{"meta":{"query_hash":"c3cff002f5b3","filters":{"topic":"Complex Network Analysis Techniques"},"cohort_total":1618,"direct_labels_cover":3,"predictions_cover":1618,"exported":1618,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/c3cff002f5b3","api":"https://metacan.xera.ac/api/v1/cohort?topic=Complex+Network+Analysis+Techniques"},"results":[{"id":"W102198652","doi":"","title":"Measuring information propagation and retention in boolean networks and its implications to a model of human organizations","year":2006,"lang":"en","type":"article","venue":"SMO'06 Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Measure (data warehouse); Generalization; Computer science; Mutual information; Clustering coefficient; Context (archaeology); Pairwise comparison; Path (computing); Theoretical computer science; Noise (video); Data mining; Cluster analysis; Function (biology); Mathematics; Artificial intelligence; Computer network","score_opus":0.042835905076215645,"score_gpt":0.26627297636976527,"score_spread":0.22343707129354962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102198652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29838482,0.000007805233,0.69991374,0.00021413257,0.000010230747,0.00032666745,0.000013209917,0.000019872983,0.0011095275],"genre_scores_gemma":[0.9954007,0.000016546726,0.00433237,0.000014941952,0.000037874415,0.000025008276,0.000104719446,0.000010857141,0.00005694669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990125,0.0000112937305,0.0004773558,0.00019507161,0.00020525561,0.00009855258],"domain_scores_gemma":[0.9982328,0.000023151955,0.00037753754,0.00007079191,0.0012629511,0.000032785065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021161287,0.00012618938,0.00014927276,0.00026674828,0.00016658807,0.00010407989,0.000123474,0.000049269216,0.0000070318288],"category_scores_gemma":[0.000024852467,0.000119995864,0.00002613925,0.00036767888,0.000035276746,0.000594461,0.00007287542,0.00009146453,1.2774892e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000119206625,0.000027582788,0.010362956,0.000013939245,0.000010277667,1.4998157e-9,0.00020826251,0.8534229,0.0004759341,0.13518554,0.0000057751377,0.00027491382],"study_design_scores_gemma":[0.00022886391,0.000018472656,0.0020105434,0.00014220978,0.000028328514,1.3313768e-7,0.00008008059,0.97454005,0.00077640486,0.022067882,0.0000017878342,0.00010521287],"about_ca_topic_score_codex":0.000083437495,"about_ca_topic_score_gemma":0.000005313244,"teacher_disagreement_score":0.6970159,"about_ca_system_score_codex":0.00003520093,"about_ca_system_score_gemma":0.000024271343,"threshold_uncertainty_score":0.48932892},"labels":[],"label_agreement":null},{"id":"W1031007865","doi":"10.1007/978-3-319-09758-9_2","title":"Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering","year":2014,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristics; Cluster analysis; Integer programming; Mathematical optimization; Computer science; Heuristic; Quadratic programming; Graph; Quadratic equation; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.05286764056656895,"score_gpt":0.3095841128748814,"score_spread":0.25671647230831246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1031007865","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041021012,0.000049124254,0.94981813,0.00003091712,0.000110702094,0.001723093,0.00013793285,0.00016238337,0.0479267],"genre_scores_gemma":[0.0032616695,0.0000075865673,0.9758584,0.00003015797,0.0012312571,0.00030707274,0.00007658107,0.00030504036,0.018922249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961633,0.000007488476,0.0015078936,0.00072565686,0.00048046038,0.001115219],"domain_scores_gemma":[0.99758464,0.00046275553,0.0008336438,0.00043155727,0.0004633855,0.00022402537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001185899,0.000756115,0.0013331113,0.00035136443,0.0003284934,0.0002847156,0.0005317942,0.00021832551,0.00020487946],"category_scores_gemma":[0.00015434128,0.0008276283,0.0002595124,0.00015361846,0.0001123609,0.000059314494,0.00062418584,0.00059829984,0.000046436442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010087528,0.000073395066,0.0000404148,0.0011765191,0.00016220729,0.0000023084601,0.00034414584,0.001055084,0.000020144518,0.98467034,0.002590206,0.009855175],"study_design_scores_gemma":[0.00020702793,0.00007872474,0.000002946424,0.0021023166,0.00047251358,0.000004439631,0.000051284256,0.1908388,0.000006537297,0.7719179,0.03351604,0.00080149644],"about_ca_topic_score_codex":0.000013680386,"about_ca_topic_score_gemma":0.000026187532,"teacher_disagreement_score":0.21275243,"about_ca_system_score_codex":0.00024947536,"about_ca_system_score_gemma":0.000076599244,"threshold_uncertainty_score":0.9994175},"labels":[],"label_agreement":null},{"id":"W105936172","doi":"","title":"Characterizing a social bookmarking and tagging network","year":2008,"lang":"en","type":"article","venue":"Max Planck Institute for Plasma Physics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Bookmarking; Computer science; Social network (sociolinguistics); Friendship; Similarity (geometry); Meaning (existential); World Wide Web; Set (abstract data type); Popularity; Relation (database); Information retrieval; Social media; Data mining; Artificial intelligence; Social psychology; Psychology","score_opus":0.030299334637744115,"score_gpt":0.2491075953901403,"score_spread":0.21880826075239618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105936172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89391077,0.000028554537,0.08623879,0.00021358431,0.0005540266,0.0005997195,0.00020348441,0.00032040576,0.017930696],"genre_scores_gemma":[0.98723257,0.000005428526,0.0075556156,0.00014741499,0.004320025,0.00009161792,0.0004688762,0.000034774468,0.00014371033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987811,0.000017939958,0.00026533307,0.00033429055,0.00014037458,0.00046098366],"domain_scores_gemma":[0.9994677,0.00006715083,0.0001867875,0.0001661477,0.000044666485,0.000067576235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000105477666,0.00025378077,0.00038873052,0.000037190315,0.0009377678,0.00007012534,0.00015941374,0.000048864633,0.000014845935],"category_scores_gemma":[0.0000024223361,0.0002770553,0.00016740615,0.0001840074,0.00012429609,0.00032363317,0.00011044096,0.00019366521,0.000006638137],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002815359,0.0003412596,0.10747089,0.00015684748,0.0011011856,0.000034296776,0.002674385,0.0023321768,0.004304288,0.65143704,0.064294696,0.16557138],"study_design_scores_gemma":[0.0021779116,0.00011471281,0.0076930504,0.0002003501,0.00029357336,0.000026378375,0.000111019224,0.06131299,0.0030877294,0.047913354,0.8754351,0.0016338251],"about_ca_topic_score_codex":0.000060913386,"about_ca_topic_score_gemma":0.000011770908,"teacher_disagreement_score":0.8111404,"about_ca_system_score_codex":0.000028591518,"about_ca_system_score_gemma":0.000044352404,"threshold_uncertainty_score":0.9999682},"labels":[],"label_agreement":null},{"id":"W10999265","doi":"10.1007/978-3-319-05029-4_10","title":"Simultaneous Analysis of Multiple Big Data Networks: Mapping Graphs into a Data Model","year":2014,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Online analytical processing; Data Web; Web intelligence; Big data; Web modeling; Cloud computing; Data science; Web mapping; Data mining; World Wide Web; Web service; Data warehouse","score_opus":0.20008176655843,"score_gpt":0.37660825104799134,"score_spread":0.17652648448956135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10999265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004057459,0.0023609896,0.9910046,0.000031711683,0.0001523488,0.00027776483,0.0007037502,0.000048574,0.0053796708],"genre_scores_gemma":[0.9407049,0.00054985756,0.04764853,0.00005228217,0.00035618336,0.000016607175,0.008616151,0.00005130085,0.0020041864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965316,0.000059138114,0.0013299569,0.0012441847,0.0005139033,0.00032123132],"domain_scores_gemma":[0.9931405,0.003186857,0.00080799824,0.002258185,0.0005478252,0.00005862151],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077121996,0.0005010424,0.0014005606,0.00091908465,0.00015677394,0.000035762092,0.002509657,0.00010903668,0.000051596777],"category_scores_gemma":[0.00012817016,0.0005178647,0.00027353395,0.000722327,0.0005099986,0.00009684255,0.0041581756,0.0004502891,0.0000061788332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001060915,0.00003437632,0.00067567563,0.000036178422,0.005123201,0.0000032532264,0.00026450955,0.84306395,1.852582e-7,0.07154595,0.0007655973,0.07847651],"study_design_scores_gemma":[0.000037855752,0.000011749524,0.000007560541,0.00022223356,0.0008526723,2.0088135e-7,0.000121137666,0.7609461,5.593374e-7,0.23596291,0.0015068974,0.00033013892],"about_ca_topic_score_codex":0.00028864507,"about_ca_topic_score_gemma":0.0009295172,"teacher_disagreement_score":0.9433561,"about_ca_system_score_codex":0.000076213,"about_ca_system_score_gemma":0.00009116969,"threshold_uncertainty_score":0.9997273},"labels":[],"label_agreement":null},{"id":"W112289382","doi":"","title":"Multinet: an interactive program for analysing and visualizing complex networks","year":2005,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Variance (accounting); Node (physics); Computer science; Visualization; Data mining; Space (punctuation); Machine learning","score_opus":0.017078671626275226,"score_gpt":0.3013621977275221,"score_spread":0.28428352610124685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112289382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90850055,0.00027773384,0.06541674,0.000056439698,0.00027368058,0.0029326435,0.00019477676,0.0008505835,0.021496855],"genre_scores_gemma":[0.9820121,0.000029526398,0.006985144,0.000018048955,0.00059095083,0.000015946582,0.008456321,0.00006928669,0.0018226602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836355,0.00010456007,0.00029450204,0.00068741327,0.00014860665,0.00040137293],"domain_scores_gemma":[0.99869496,0.00011589438,0.00043042886,0.0003352248,0.00025888204,0.00016462815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010881561,0.0004191267,0.00059653306,0.0005681201,0.00036557304,0.00016748036,0.00035074248,0.00017548712,0.00018261207],"category_scores_gemma":[0.0000033199365,0.0005248448,0.00033413118,0.0006123506,0.00005311417,0.0004077583,0.00007254932,0.0003815226,0.0000019774955],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007728763,0.0009866555,0.2078157,0.00010343858,0.0021818646,0.000016074602,0.00025190844,0.003253014,0.0000323665,0.004976001,0.009817201,0.7697929],"study_design_scores_gemma":[0.0021334474,0.0004486551,0.005562572,0.00038370717,0.00266282,4.874915e-9,0.07071907,0.5264683,0.00046257878,0.0006313218,0.38861197,0.0019155705],"about_ca_topic_score_codex":0.0006665974,"about_ca_topic_score_gemma":0.07019402,"teacher_disagreement_score":0.76787734,"about_ca_system_score_codex":0.000104459636,"about_ca_system_score_gemma":0.00004267066,"threshold_uncertainty_score":0.99972034},"labels":[],"label_agreement":null},{"id":"W1164910490","doi":"10.1007/978-3-319-21837-3_9","title":"Minimum-Cost Information Dissemination in Social Networks","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Computer science; Business; Internet privacy","score_opus":0.014681728136535897,"score_gpt":0.28075043330614696,"score_spread":0.26606870516961106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1164910490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000141808,0.000047950107,0.98730534,0.000119887416,0.0002202633,0.0003101954,0.000007353389,0.00004290809,0.011804298],"genre_scores_gemma":[0.98998433,0.0000029854064,0.008399147,0.00010091226,0.0011704863,0.000020537893,0.00017707834,0.000016720383,0.00012779268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840254,0.000019581601,0.00043727938,0.00036557252,0.00044558404,0.000329457],"domain_scores_gemma":[0.9990515,0.00013076392,0.0002726716,0.00028927147,0.00019679927,0.000058956368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057955825,0.00027276936,0.00034361365,0.00057822274,0.000120599936,0.00021301683,0.00058945874,0.00015251106,0.00007697739],"category_scores_gemma":[0.000010206505,0.00027241587,0.00009099431,0.00048155698,0.00020072376,0.00047568616,0.0002895697,0.0005286652,0.000012903032],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005205681,0.000015109772,0.00054328924,0.0000048665593,0.000006962484,0.0000013348301,0.00051756366,0.037995536,0.0000029285668,0.011328003,0.0006665598,0.9489126],"study_design_scores_gemma":[0.0001926292,0.000033730605,0.00056696555,0.00021084359,0.000014810329,9.831771e-7,0.0000010988113,0.78116244,0.00004087756,0.21116439,0.006122788,0.00048845744],"about_ca_topic_score_codex":0.00004247631,"about_ca_topic_score_gemma":0.000059031485,"teacher_disagreement_score":0.98984253,"about_ca_system_score_codex":0.0002507843,"about_ca_system_score_gemma":0.0001400284,"threshold_uncertainty_score":0.9999728},"labels":[],"label_agreement":null},{"id":"W1221429143","doi":"10.1016/j.joi.2015.08.002","title":"How to become an important player in scientific collaboration networks?","year":2015,"lang":"en","type":"article","venue":"Journal of Informetrics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Publication; Computer science; Productivity; Quality (philosophy); Position (finance); Work (physics); Data science; Knowledge management; Business; Engineering","score_opus":0.02861058399649574,"score_gpt":0.29994983463309877,"score_spread":0.271339250636603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1221429143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9041324,0.00013490723,0.093884766,0.00035674064,0.0004851342,0.00016172456,0.0000055983705,0.000012728113,0.00082599145],"genre_scores_gemma":[0.9912719,0.0000037641103,0.008075641,0.000047630372,0.00042875262,0.000002549457,0.0000130788985,0.000008255554,0.00014840742],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985888,0.000027843185,0.0006212418,0.00009487788,0.00045552212,0.00021168654],"domain_scores_gemma":[0.99805355,0.00004715278,0.00056392024,0.00019617664,0.00087667484,0.00026255127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016151352,0.00010477614,0.00025968978,0.0014263213,0.00005290531,0.00063376257,0.00027718814,0.000035413934,0.000019166979],"category_scores_gemma":[0.0001215727,0.00008847788,0.00007898083,0.0048103346,0.000018962906,0.0011079378,0.000051896855,0.00019902454,0.0000023257392],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012956528,0.00039194347,0.7938276,0.0000054885304,0.00011083604,0.000020370659,0.0015549647,0.050390955,0.00013867361,0.008269743,0.06434599,0.0808139],"study_design_scores_gemma":[0.005414414,0.003991776,0.08217112,0.00024325053,0.00028145066,0.00004777244,0.01733043,0.25201863,0.003126364,0.026266789,0.60718817,0.0019198755],"about_ca_topic_score_codex":0.000024358014,"about_ca_topic_score_gemma":0.000083726925,"teacher_disagreement_score":0.71165645,"about_ca_system_score_codex":0.00014773334,"about_ca_system_score_gemma":0.00026110417,"threshold_uncertainty_score":0.6111387},"labels":[],"label_agreement":null},{"id":"W1258323250","doi":"10.1016/j.socnet.2015.07.006","title":"Structure and formation of top networks in international trade, 2001–2010","year":2015,"lang":"en","type":"article","venue":"Social Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":121,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Ministry of Education of the People's Republic of China","keywords":"China; Network formation; International trade; Preferential attachment; Network structure; Regional trade; Economic geography; Computer science; Business; Complex network; Regional science; Geography; Free trade; Theoretical computer science","score_opus":0.014857789051695576,"score_gpt":0.26785033511555656,"score_spread":0.25299254606386096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1258323250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48985133,0.0006692543,0.49192917,0.0016902317,0.0011612643,0.0006194498,0.000048355338,0.00012544543,0.013905499],"genre_scores_gemma":[0.9980873,0.000011197333,0.00050650287,0.00004144799,0.0011839796,0.0000064854194,0.00012256343,0.000009769177,0.00003079358],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992422,0.00005202008,0.00026284004,0.00012464372,0.00012878382,0.00018952868],"domain_scores_gemma":[0.99966127,0.000027985783,0.00014847888,0.000081523605,0.000029755567,0.000050977327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017894586,0.00010514422,0.00020236526,0.000061943705,0.000043420194,0.000029934858,0.00013128009,0.00008782136,0.0000729967],"category_scores_gemma":[0.0000029198807,0.00010761557,0.000060239952,0.00023602809,0.000051150357,0.00015566278,0.000064986205,0.00022708015,1.8298049e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014187816,0.00019224528,0.37192866,0.000011425317,0.000222755,0.000002680449,0.0038373051,0.13407107,0.000048301798,0.052252557,0.11645136,0.32083976],"study_design_scores_gemma":[0.0009748926,0.000038859325,0.034641568,0.000034304496,0.00004711112,0.0000010641905,0.0007648734,0.93426335,0.00007246255,0.023191176,0.005670662,0.0002996624],"about_ca_topic_score_codex":0.00015205688,"about_ca_topic_score_gemma":0.00011133365,"teacher_disagreement_score":0.8001923,"about_ca_system_score_codex":0.000034433528,"about_ca_system_score_gemma":0.000016268154,"threshold_uncertainty_score":0.43884355},"labels":[],"label_agreement":null},{"id":"W12814185","doi":"10.1023/a:1023679303322","title":"MULTILEVEL AGGREGATION METHODS FOR SMALL-WORLD GRAPHS WITH APPLICATION TO RANDOM-WALK RANKING","year":2011,"lang":"en","type":"article","venue":"Computing and Informatics / Computers and Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Markov chain; Computer science; Theoretical computer science; Random walk; Graph; Cluster analysis; Mathematics; Algorithm; Machine learning","score_opus":0.04849255361357132,"score_gpt":0.3277189366690197,"score_spread":0.2792263830554484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12814185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039401527,0.000025385694,0.9593928,0.000022296457,0.00006686458,0.0005572268,0.0000023464183,0.000074813746,0.00045676378],"genre_scores_gemma":[0.54304785,0.0000020945722,0.45678136,0.00006926825,0.00005878718,0.000019909332,0.000009280591,0.000007282699,0.0000041960348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988763,0.00003959614,0.00055348134,0.00020015365,0.00007190305,0.00025859618],"domain_scores_gemma":[0.9990155,0.0003146538,0.00024259527,0.00018025983,0.00014371055,0.00010328992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062851066,0.00018954935,0.00028537516,0.00020064584,0.00035843175,0.00015509318,0.00016226426,0.000025774178,0.0000047233716],"category_scores_gemma":[0.000008415173,0.00016496616,0.000063606094,0.00029208086,0.00007640706,0.00012455808,0.0001303177,0.00010547663,0.0000015216478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049234168,0.000027700731,0.0005251102,0.00002570881,0.000040403036,5.057374e-8,0.0037612342,0.0024130538,0.000031719428,0.06352073,0.00002046449,0.92958456],"study_design_scores_gemma":[0.00010711754,0.000097072465,0.000119293974,0.00011348832,0.000039307783,9.990996e-7,0.00044060248,0.95017666,0.005204248,0.042892992,0.0005791988,0.0002290061],"about_ca_topic_score_codex":0.00009969586,"about_ca_topic_score_gemma":0.00001543576,"teacher_disagreement_score":0.9477636,"about_ca_system_score_codex":0.000008991591,"about_ca_system_score_gemma":0.000012119099,"threshold_uncertainty_score":0.6727125},"labels":[],"label_agreement":null},{"id":"W13191483","doi":"10.4018/978-1-4666-2806-9.ch006","title":"Analyzing Social Networks to Mine Important Friends","year":2012,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Social network (sociolinguistics); Interdependence; Data science; Social media; Computer science; Social network analysis; Process (computing); Social group; World Wide Web; Social web; Internet privacy; Knowledge management; Sociology; Social science","score_opus":0.01470228179735824,"score_gpt":0.26450735533678976,"score_spread":0.24980507353943152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13191483","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003728653,0.00047824855,0.011487371,0.000046396843,0.00019997638,0.00031742078,0.0001692269,0.00020072247,0.9867278],"genre_scores_gemma":[0.95271456,0.0000019792499,0.0010741336,0.0001743109,0.0062329727,0.000042978278,0.000092956696,0.00010344185,0.039562643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763733,0.000021927646,0.00072581926,0.00058013597,0.00031889445,0.0007158871],"domain_scores_gemma":[0.9985177,0.000023348504,0.00045744792,0.00056102104,0.00012676336,0.00031370614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020346437,0.0006390329,0.0008755056,0.00011217129,0.00022289953,0.00011134804,0.00046227424,0.00027124005,0.0007806767],"category_scores_gemma":[0.0000010513234,0.00066757994,0.0007221733,0.00006667358,0.000067882844,0.00004163743,0.0003844033,0.00043601965,0.00008763882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016231332,0.000015116138,0.0020305878,0.0000039754905,0.000571871,0.0000073462297,0.000033878998,0.000023562658,0.000005380574,0.95331043,0.014879292,0.029102342],"study_design_scores_gemma":[0.0004141541,0.00011265722,0.00051851507,0.00021901804,0.0019350994,0.0000062763265,0.000023268036,0.000569275,0.000036782956,0.60346097,0.39036328,0.0023407256],"about_ca_topic_score_codex":0.000272549,"about_ca_topic_score_gemma":0.00010010728,"teacher_disagreement_score":0.95234174,"about_ca_system_score_codex":0.00019823994,"about_ca_system_score_gemma":0.000077519704,"threshold_uncertainty_score":0.9995775},"labels":[],"label_agreement":null},{"id":"W134985385","doi":"10.5591/978-1-57735-516-8/ijcai11-231","title":"Modular community detection in networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rounding; Modularity (biology); Partition (number theory); Computer science; Modular design; Clique percolation method; Network partition; Relaxation (psychology); Iterative method; Theoretical computer science; Measure (data warehouse); Cluster analysis; Mathematical optimization; Algorithm; Data mining; Artificial intelligence; Distributed computing; Mathematics","score_opus":0.029402930156707734,"score_gpt":0.23970124970487516,"score_spread":0.21029831954816744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134985385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42208982,0.000005923614,0.51093704,0.000002127509,0.00001555887,0.000054947373,1.8113468e-7,0.00006233081,0.0668321],"genre_scores_gemma":[0.99849665,7.1378093e-7,0.0013132931,0.000017561155,0.00005184687,0.00001636838,0.0000047706144,0.0000065384056,0.00009225074],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995438,0.00010580953,0.00012194835,0.00006989161,0.00003555848,0.00012299571],"domain_scores_gemma":[0.9996524,0.000018115554,0.000029933264,0.0002592506,0.000016836582,0.000023481403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019338477,0.00006502283,0.00009635171,0.000053368985,0.00006901223,0.0000088671895,0.0001247861,0.000020121726,0.0007825387],"category_scores_gemma":[7.471306e-7,0.000062292595,0.00005234409,0.00019808962,0.000016648399,0.000059545204,0.00006133816,0.00023858354,0.000008855705],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030364221,0.0007992541,0.57341975,0.000003540919,0.00011809091,0.000001520232,0.0010568735,0.0038057582,0.00096116995,0.0383611,0.00045523682,0.38098735],"study_design_scores_gemma":[0.000419102,0.000101457066,0.40474904,0.0000198819,0.00003924722,5.1777516e-7,0.00077821,0.44947374,0.01755416,0.12527397,0.0011426607,0.0004479996],"about_ca_topic_score_codex":0.008737004,"about_ca_topic_score_gemma":0.0010412761,"teacher_disagreement_score":0.57640684,"about_ca_system_score_codex":0.00001256135,"about_ca_system_score_gemma":0.000002737298,"threshold_uncertainty_score":0.9978639},"labels":[],"label_agreement":null},{"id":"W138163147","doi":"","title":"Next-generation, scalable network visualization and analysis","year":2011,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Visualization; Computer science; Data visualization; Scalability; Data science; Information visualization; Visual analytics; Graph drawing; Social network analysis; Data mining; World Wide Web; Database","score_opus":0.2042328873439756,"score_gpt":0.4126227801775031,"score_spread":0.2083898928335275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W138163147","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7651382,0.005361927,0.19452165,0.0024558057,0.0007400604,0.008686361,0.0006309284,0.00016806692,0.02229699],"genre_scores_gemma":[0.99627894,0.00017750128,0.002288007,0.00001037494,0.00009924122,0.00013450031,0.000027517928,0.000010508284,0.0009734313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845654,0.00032682516,0.00029469846,0.00032441478,0.0002855173,0.00031201838],"domain_scores_gemma":[0.9958247,0.00031566285,0.00019982469,0.00033134944,0.003278696,0.00004976599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063384883,0.0001441668,0.00038300647,0.00013695337,0.0005716256,0.000049925027,0.00024014553,0.00002541652,0.00008622952],"category_scores_gemma":[0.00016523538,0.00010294667,0.000101445556,0.0025062652,0.00033798916,0.00013935386,0.00019780497,0.0001104693,0.0000011541151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023846194,0.00025719724,0.044806153,0.000041924905,0.0032595352,1.9602635e-7,0.0064577693,0.0039717513,0.0022101318,0.91819155,0.011176489,0.009388832],"study_design_scores_gemma":[0.0032361445,0.0015435113,0.007919085,0.00071941357,0.0021577596,1.2392664e-7,0.07198392,0.23444344,0.27410015,0.38018644,0.022245921,0.0014640779],"about_ca_topic_score_codex":0.000017420867,"about_ca_topic_score_gemma":0.00024093947,"teacher_disagreement_score":0.5380051,"about_ca_system_score_codex":0.00004772023,"about_ca_system_score_gemma":0.00009828022,"threshold_uncertainty_score":0.43965396},"labels":[],"label_agreement":null},{"id":"W140142130","doi":"10.22329/amr.v13i1.2835","title":"Analyzing Structural Relations in Multivariate Dyadic Binary Data","year":2009,"lang":"en","type":"article","venue":"Applied Multivariate Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Popularity; Class (philosophy); Relation (database); Set (abstract data type); Binary relation; Computer science; Binary number; Function (biology); Artificial intelligence; Theoretical computer science; Psychology; Econometrics; Mathematics; Social psychology; Data mining; Discrete mathematics; Arithmetic","score_opus":0.10109837152361563,"score_gpt":0.42386426885663075,"score_spread":0.32276589733301514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140142130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8739782,0.00027359644,0.042856153,0.0017653302,0.000109500084,0.0026892598,0.00019194845,0.00048811233,0.07764788],"genre_scores_gemma":[0.98770267,0.000005056691,0.011079343,0.000013426236,0.00029711882,0.000052134037,0.0006280228,0.00002993831,0.00019229205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686974,0.00031756714,0.00054703746,0.0008815816,0.00050260156,0.0008814941],"domain_scores_gemma":[0.99757034,0.00049149233,0.00011766275,0.0015271397,0.0001313508,0.00016200508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018560349,0.00025769573,0.0003965214,0.00072769553,0.00043951834,0.00015256055,0.0012009543,0.00009762915,0.00060234417],"category_scores_gemma":[0.00004627267,0.00024753576,0.000077946046,0.0019928361,0.000109844885,0.00032777645,0.0007156067,0.001118429,0.00013177814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035747184,0.0009773675,0.06410687,0.000020830881,0.0004855355,0.00004395287,0.0018586301,0.010078803,0.112388,0.49196044,0.0057876855,0.3119344],"study_design_scores_gemma":[0.0023216247,0.00008869603,0.318065,0.00009518842,0.00006660802,0.0000010314396,0.00055621087,0.5100963,0.0014399193,0.16440156,0.0020530808,0.00081478944],"about_ca_topic_score_codex":0.0033199408,"about_ca_topic_score_gemma":0.00006298008,"teacher_disagreement_score":0.5000175,"about_ca_system_score_codex":0.0001424381,"about_ca_system_score_gemma":0.00013121197,"threshold_uncertainty_score":0.9999977},"labels":[],"label_agreement":null},{"id":"W1419517020","doi":"10.1016/j.diin.2015.05.002","title":"Graph-theoretic characterization of cyber-threat infrastructures","year":2015,"lang":"en","type":"article","venue":"Digital Investigation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer security; Malware; PageRank; Cyber threats; Centrality; Key (lock); Critical infrastructure; Data science; Malware analysis; World Wide Web","score_opus":0.016332704371522334,"score_gpt":0.23333260849992132,"score_spread":0.21699990412839898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1419517020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97251016,0.000005413593,0.017368792,0.000035731482,0.000039847302,0.00010225274,0.000039741124,0.000057188146,0.009840853],"genre_scores_gemma":[0.9980557,3.4945361e-7,0.00045122424,0.000018945744,0.00010620957,0.000010498118,0.0012415029,0.0000109359,0.00010463265],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993847,0.000020597341,0.00022256294,0.00012827029,0.00014919696,0.000094654046],"domain_scores_gemma":[0.9994457,0.000013102365,0.00016541137,0.0001643264,0.00012790671,0.00008357618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006271804,0.00009959543,0.00013395493,0.000090341484,0.000023221732,0.000072011666,0.00009327421,0.000024870229,0.000058369675],"category_scores_gemma":[0.000012363348,0.000094564275,0.000059157217,0.00028221044,0.0001455795,0.00041172927,0.000034482935,0.000048569596,0.000012826428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016005746,0.000058219142,0.5713784,0.000015286325,0.00008915612,3.561155e-7,0.00080914964,0.00014674968,0.03407928,0.36544257,0.0014416408,0.026523173],"study_design_scores_gemma":[0.00017494419,0.000047662936,0.038367298,0.00002853979,0.00002697825,4.776831e-7,0.000070605194,0.0012695197,0.07577839,0.8836417,0.0004315678,0.00016232536],"about_ca_topic_score_codex":0.00003335884,"about_ca_topic_score_gemma":4.5134053e-7,"teacher_disagreement_score":0.53301114,"about_ca_system_score_codex":0.000013576881,"about_ca_system_score_gemma":0.00003252226,"threshold_uncertainty_score":0.38562194},"labels":[],"label_agreement":null},{"id":"W144734202","doi":"","title":"Adaptive Reward Mechanism for Sustainable Online Learning Community","year":2005,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mechanism (biology); Computer science; Information overload; Sustainability; Online community; Quality (philosophy); World Wide Web; Knowledge management; Internet privacy","score_opus":0.023013260224201908,"score_gpt":0.2881290161072103,"score_spread":0.2651157558830084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W144734202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09877108,0.000013004604,0.8519642,0.00034558563,0.000007632538,0.0003716479,0.0000069109674,0.00027524208,0.048244696],"genre_scores_gemma":[0.9335955,9.105465e-7,0.04701628,0.00009776549,0.00028061506,0.000049568567,0.000089667796,0.000017189717,0.01885251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999253,0.00009915437,0.0001663428,0.00012036497,0.000073362084,0.0002878212],"domain_scores_gemma":[0.99926126,0.00013403248,0.00007377184,0.00023561703,0.00024685354,0.000048447648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028807312,0.0001166703,0.00018166435,0.000057148118,0.00041267602,0.000039385395,0.00019364516,0.000024715344,0.00044657863],"category_scores_gemma":[0.00001149055,0.00011098663,0.00013684425,0.00013304791,0.000018526634,0.00013237073,0.00013979092,0.0003069193,0.000009172738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017122245,0.00023314994,0.0006927833,0.000004885638,0.00009235695,2.0215573e-7,0.00024432875,0.00075242255,0.00009639795,0.96516293,0.00484792,0.027855475],"study_design_scores_gemma":[0.0009073776,0.000485706,0.00025483852,0.000023305493,0.00015763743,5.059242e-7,0.026286015,0.16669603,0.009037502,0.65367043,0.14186698,0.00061367656],"about_ca_topic_score_codex":0.0013504855,"about_ca_topic_score_gemma":0.00014109635,"teacher_disagreement_score":0.8348244,"about_ca_system_score_codex":0.00004889103,"about_ca_system_score_gemma":0.000020703403,"threshold_uncertainty_score":0.48897228},"labels":[],"label_agreement":null},{"id":"W1480463768","doi":"10.1007/978-3-642-37401-2_31","title":"Finding Diverse Friends in Social Networks","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Friendship; Centrality; Social network (sociolinguistics); Computer science; Social network analysis; Data science; Range (aeronautics); Tree (set theory); World Wide Web; Internet privacy; Social media; Psychology; Social psychology; Mathematics; Engineering","score_opus":0.01818432171563378,"score_gpt":0.262725370854987,"score_spread":0.2445410491393532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480463768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005205774,0.00005820386,0.9785826,0.00008521632,0.0003095013,0.00021760397,0.0000039623687,0.00005550091,0.020166803],"genre_scores_gemma":[0.9784728,0.000004048174,0.018984899,0.00016018859,0.0019459856,0.000013746075,0.000022380684,0.00003009808,0.00036580063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997901,0.000024003744,0.00037747927,0.00077218545,0.00037701306,0.0005482796],"domain_scores_gemma":[0.9990666,0.00016397036,0.00021731123,0.0004019879,0.00007970059,0.00007043593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034558072,0.0003706276,0.0004884401,0.0005609052,0.0002449354,0.00022450443,0.0009431861,0.00017499845,0.00060160644],"category_scores_gemma":[0.0000030073527,0.00036438328,0.00017089728,0.00049983605,0.00036963058,0.00019354271,0.00073934323,0.0008579611,0.000029708883],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032541118,0.000028387401,0.004013032,0.0000055580567,0.000028418366,0.000012955171,0.00043579386,0.044604197,0.000008031607,0.03662571,0.0003589629,0.9138757],"study_design_scores_gemma":[0.0002553874,0.00004420873,0.001237068,0.00024527023,0.0000311412,0.00000140223,0.0000011162747,0.6122793,0.00006105378,0.38264215,0.002356767,0.0008451817],"about_ca_topic_score_codex":0.00016246621,"about_ca_topic_score_gemma":0.000081152895,"teacher_disagreement_score":0.9779523,"about_ca_system_score_codex":0.00017966573,"about_ca_system_score_gemma":0.0000994829,"threshold_uncertainty_score":0.9998808},"labels":[],"label_agreement":null},{"id":"W1487148382","doi":"","title":"Node similarity in networked information spaces","year":2001,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Hyperlink; Information retrieval; Similarity (geometry); PageRank; Information space; Graph; Node (physics); World Wide Web; Data mining; Theoretical computer science; Web page; Artificial intelligence","score_opus":0.009274039329636687,"score_gpt":0.2492799709667277,"score_spread":0.240005931637091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487148382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41926706,0.000014613004,0.1989271,0.00065561966,0.000039013892,0.00017823157,0.0000020225034,0.00016418067,0.38075215],"genre_scores_gemma":[0.9969806,0.00000408178,0.0024537598,0.0001400444,0.0001055962,0.000011838204,0.000038766044,0.0000030582182,0.00026222118],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994988,0.000019799661,0.00017764664,0.000070815186,0.00007651669,0.00015645969],"domain_scores_gemma":[0.99972534,0.000022394746,0.000048700895,0.00014995682,0.000025865127,0.000027725766],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011975092,0.00007354019,0.00011002558,0.000075587566,0.000034705758,0.000058041358,0.00009562297,0.000019200219,0.0012847909],"category_scores_gemma":[0.0000015228891,0.00006710055,0.000048337573,0.00031710716,0.000011946529,0.00032763503,0.00004290617,0.00008734073,0.000054945434],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012476538,0.00006754085,0.89053565,0.0000018894744,0.00002494916,6.3927786e-7,0.00013659279,0.0049076704,0.000011319386,0.036269467,0.016865706,0.051166076],"study_design_scores_gemma":[0.0008715066,0.0000328962,0.13082561,0.000036658217,0.00003468521,8.744401e-7,0.00060163916,0.36243904,0.00037376306,0.05996049,0.4442283,0.0005945535],"about_ca_topic_score_codex":0.0010538289,"about_ca_topic_score_gemma":0.00017428397,"teacher_disagreement_score":0.7597101,"about_ca_system_score_codex":0.000015237233,"about_ca_system_score_gemma":0.000009540268,"threshold_uncertainty_score":0.9996282},"labels":[],"label_agreement":null},{"id":"W1489598403","doi":"10.1103/physreve.86.011118","title":"Agglomerative percolation on bipartite networks: Nonuniversal behavior due to spontaneous symmetry breaking at the percolation threshold","year":2012,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Percolation (cognitive psychology); Percolation threshold; Bipartite graph; Percolation critical exponents; Continuum percolation theory; Statistical physics; Physics; Mathematics; Psychology; Combinatorics; Quantum mechanics; Neuroscience; Graph","score_opus":0.018268012518866256,"score_gpt":0.3133028100166327,"score_spread":0.2950347974977664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489598403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9820544,0.002027139,0.0066340445,0.0005078141,0.000115797775,0.0015030759,0.00001658699,0.00009808684,0.007043023],"genre_scores_gemma":[0.99755335,0.00009512731,0.0001249506,0.00048158926,0.0012937099,0.00021041269,0.00007488397,0.00002753768,0.00013842646],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99863297,0.00015540227,0.00025543972,0.00028604837,0.00029061103,0.00037955563],"domain_scores_gemma":[0.9989781,0.000214572,0.00014923314,0.00043319335,0.00007756477,0.00014738808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028084283,0.0002444158,0.00041121923,0.00004531083,0.0002972149,0.00004747571,0.0001980928,0.000023149896,0.00042939984],"category_scores_gemma":[0.000011637026,0.00017731087,0.00029672476,0.0005238769,0.000037614558,0.000217714,0.00014401643,0.0002462041,0.0002440385],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019349439,0.0029742506,0.07250273,0.0002094288,0.0005829004,0.000051058087,0.0024452922,0.0050305864,0.005379275,0.2493992,0.02643097,0.6348008],"study_design_scores_gemma":[0.0022657232,0.002587555,0.3768946,0.012189155,0.010884002,0.00025030941,0.0009496004,0.23978437,0.006428352,0.01093005,0.3289685,0.007867786],"about_ca_topic_score_codex":0.00006786415,"about_ca_topic_score_gemma":0.000025571286,"teacher_disagreement_score":0.62693304,"about_ca_system_score_codex":0.00016328401,"about_ca_system_score_gemma":0.000012353101,"threshold_uncertainty_score":0.72305274},"labels":[],"label_agreement":null},{"id":"W1492373979","doi":"","title":"Investigating the distributional property of the session workload","year":2010,"lang":"en","type":"article","venue":"Journal of Web Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Workload; Session (web analytics); Computer science; Server; Web server; Distribution (mathematics); Web application; Database; World Wide Web; The Internet; Operating system; Mathematics","score_opus":0.00640363630781026,"score_gpt":0.21704843705534418,"score_spread":0.21064480074753392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492373979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9846888,0.000045440036,0.01419825,0.0005002283,0.00020280629,0.000049120463,0.0000030408842,0.000008371627,0.00030391457],"genre_scores_gemma":[0.9972141,0.0000012180649,0.0022557566,0.000006803063,0.0004887607,0.0000014843738,4.968913e-7,0.00000564649,0.000025778118],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994268,0.00001645573,0.00025881862,0.000038816794,0.00017342072,0.00008569748],"domain_scores_gemma":[0.9994372,0.00006422387,0.0002386554,0.00013415788,0.00009492377,0.00003080397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030840552,0.00006397329,0.00011318287,0.000024356455,0.00006428075,0.000020104731,0.00025687082,0.000016619897,0.000049484617],"category_scores_gemma":[0.00004052062,0.000026980928,0.00014291436,0.00018256479,0.000032959142,0.000063271786,0.00006598372,0.00044814972,3.3947447e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004441146,0.00007757404,0.21871522,0.000019375531,0.00020948483,6.385943e-7,0.00017206451,0.026117668,0.71965545,0.011845822,0.0039540385,0.019228201],"study_design_scores_gemma":[0.001138255,0.00010431314,0.24472551,0.002036736,0.00040698453,0.00007307281,0.00036929714,0.41473663,0.25620303,0.0087714335,0.07075568,0.0006790357],"about_ca_topic_score_codex":0.0000075544503,"about_ca_topic_score_gemma":0.0000010257154,"teacher_disagreement_score":0.46345243,"about_ca_system_score_codex":0.0000098636565,"about_ca_system_score_gemma":0.000056427365,"threshold_uncertainty_score":0.19470124},"labels":[],"label_agreement":null},{"id":"W1493754278","doi":"10.34989/swp-2010-13","title":"Estimating the Structure of the Payment Network in the LVTS: An Application of Estimating Communities in Network Data","year":2021,"lang":"en","type":"preprint","venue":"Econstor (Econstor)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Bank of Canada","funders":"","keywords":"Payment; Payment system; Market liquidity; Network structure; Business; Value (mathematics); Actuarial science; Computer science; Econometrics; Finance; Economics","score_opus":0.024689958609900097,"score_gpt":0.28597371054406207,"score_spread":0.261283751934162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493754278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96730167,0.00089603604,0.0287456,0.00019394481,0.0005688976,0.0012333895,0.00020511757,0.00003337372,0.00082198106],"genre_scores_gemma":[0.95865345,0.0000070041856,0.039236035,0.00008978547,0.0010086478,0.00011143981,0.000855748,0.000034645775,0.0000032426808],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996011,0.0013051955,0.0013819586,0.0005306011,0.0003310544,0.00044016563],"domain_scores_gemma":[0.99281615,0.0010458204,0.001667957,0.0043220236,0.00011134395,0.00003671315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021399835,0.0004316192,0.0008749758,0.00008283626,0.00034060483,0.00014691685,0.0035761266,0.00016172187,0.00018313782],"category_scores_gemma":[0.00003488236,0.00028706534,0.00023056952,0.0005730156,0.00042545763,0.00017318781,0.0026981817,0.0015837774,5.3295105e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004279275,0.00007598317,0.6281254,0.00005695469,0.00011978659,2.9927548e-7,0.0019374733,0.36006048,0.0000109495395,0.002915932,0.00055665284,0.006135778],"study_design_scores_gemma":[0.00025324628,0.000020195266,0.074482866,0.0013361293,0.0002301785,0.000004601388,0.0045949705,0.8910356,0.00004370693,0.027261492,0.00029298646,0.00044399945],"about_ca_topic_score_codex":0.0059329895,"about_ca_topic_score_gemma":0.010996756,"teacher_disagreement_score":0.5536426,"about_ca_system_score_codex":0.00011083094,"about_ca_system_score_gemma":0.00034353105,"threshold_uncertainty_score":0.99995816},"labels":[],"label_agreement":null},{"id":"W149655877","doi":"","title":"Databases and Social Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Dissemination; Computer science; Social network analysis; Social network (sociolinguistics); Data science; Distributed database; State (computer science); Database; World Wide Web; Information retrieval; Social media","score_opus":0.04886023601338653,"score_gpt":0.2677226937686309,"score_spread":0.21886245775524438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W149655877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056356132,0.000041492392,0.71738774,0.00003732122,0.000023641294,0.0000739799,0.000005376516,0.00013462796,0.22593969],"genre_scores_gemma":[0.9947001,0.0000012232077,0.0046678735,0.00004692279,0.00019955782,0.000005626413,0.000021379656,0.0000050133362,0.00035232975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999695,0.000011587801,0.00006848382,0.000097384225,0.00002960788,0.00009793285],"domain_scores_gemma":[0.99985343,0.000010500373,0.000022316986,0.00008354292,0.000011412427,0.000018807857],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000042250504,0.000054016804,0.00007688489,0.000016629674,0.00007002187,0.000010313881,0.00004905941,0.000006860571,0.0023826915],"category_scores_gemma":[1.6756074e-7,0.000046976722,0.000030990763,0.000048195172,0.000030106461,0.00005468489,0.00007083578,0.000043068612,0.000005558609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062597273,0.0000713884,0.23776767,0.0000013914822,0.000084695675,6.156742e-7,0.0002194897,0.000002574596,0.000016730533,0.66460127,0.02823911,0.06898884],"study_design_scores_gemma":[0.0017033758,0.00018518638,0.41577828,0.000041195304,0.00072672166,0.000003991464,0.0028847845,0.10628633,0.0060547506,0.16571622,0.297992,0.0026271907],"about_ca_topic_score_codex":0.00043107648,"about_ca_topic_score_gemma":0.000017567985,"teacher_disagreement_score":0.93834394,"about_ca_system_score_codex":0.0000015645599,"about_ca_system_score_gemma":0.0000028223587,"threshold_uncertainty_score":0.99852926},"labels":[],"label_agreement":null},{"id":"W1497626542","doi":"10.1080/15427951.2015.1103339","title":"How to Burn a Graph","year":2015,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Iterated function; Graph; Combinatorics; Transitive relation; Discrete mathematics; Line graph","score_opus":0.03516612690738674,"score_gpt":0.28078952342868885,"score_spread":0.2456233965213021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497626542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097240016,0.000017038517,0.8664687,0.00051085086,0.000065185755,0.00018066644,0.0000044911494,0.00013713003,0.03537592],"genre_scores_gemma":[0.9407586,1.3570163e-7,0.05145479,0.00005909354,0.00018833316,0.00003229773,0.0000062438376,0.000018177467,0.0074823643],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934775,0.000014133088,0.00016423305,0.00014030779,0.00016464018,0.00016895498],"domain_scores_gemma":[0.9993474,0.00003159803,0.00007444749,0.00031362195,0.00009145864,0.00014147043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001399419,0.00012244952,0.0001979812,0.00008225057,0.000011257973,0.00014183353,0.00027453015,0.000017921853,0.0001459852],"category_scores_gemma":[0.000014780026,0.0001051039,0.000102234095,0.00018379356,0.0000170138,0.000059964037,0.00013469264,0.00007505564,0.000157891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094612715,0.00064042973,0.005091248,0.000027050894,0.0003297445,0.000006667792,0.0065477183,0.00006827843,0.00030168067,0.44776645,0.5259867,0.013224584],"study_design_scores_gemma":[0.00042182123,0.00026475673,0.000049547758,0.00017095033,0.00012927725,0.000006467472,0.002690768,0.019280674,0.008519023,0.7643899,0.20342709,0.00064972596],"about_ca_topic_score_codex":0.000059159982,"about_ca_topic_score_gemma":0.000009914426,"teacher_disagreement_score":0.84351856,"about_ca_system_score_codex":0.00001971053,"about_ca_system_score_gemma":0.000011639681,"threshold_uncertainty_score":0.42860126},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015306428776491559,"score_gpt":0.26501313154914535,"score_spread":0.2497067027726538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502487903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004885605,0.0000622828,0.9910991,0.00012438829,0.00021433167,0.00055635395,0.000017891949,0.000054774762,0.0073823244],"genre_scores_gemma":[0.9420043,0.0000042085017,0.055968888,0.00032312403,0.0014946866,0.00005161789,0.000034838726,0.000040232047,0.00007808892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766403,0.00001427701,0.0004616897,0.00092251244,0.00035761882,0.000579887],"domain_scores_gemma":[0.9986364,0.0003142839,0.00025355705,0.00047726,0.00024604812,0.00007243615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004940854,0.00042816176,0.00061074627,0.0004364064,0.00026519905,0.0002110664,0.0011317012,0.00026367966,0.00004714433],"category_scores_gemma":[0.000005596863,0.0004278721,0.00021361357,0.00035802423,0.0006700816,0.00026648236,0.00048791795,0.0012015114,0.000002465876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014966889,0.00004084781,0.0007766795,0.000011203991,0.000023835159,0.000004315611,0.00033515177,0.4907555,0.0000614468,0.37441102,0.000023527451,0.13354151],"study_design_scores_gemma":[0.00013334496,0.00002444437,0.00009134825,0.000105113795,0.000010055129,4.7255574e-7,1.8573367e-7,0.47524527,0.00010042265,0.5235688,0.0004162231,0.0003043168],"about_ca_topic_score_codex":0.00006524856,"about_ca_topic_score_gemma":0.0003284543,"teacher_disagreement_score":0.94151574,"about_ca_system_score_codex":0.00011714615,"about_ca_system_score_gemma":0.00019219155,"threshold_uncertainty_score":0.9998173},"labels":[],"label_agreement":null},{"id":"W1505868393","doi":"10.1103/physreve.88.062801","title":"Network growth with arbitrary initial conditions: Degree dynamics for uniform and preferential attachment","year":2013,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Preferential attachment; Degree distribution; Degree (music); Mathematics; Graph; Rendering (computer graphics); Infinity; Complete graph; Topology (electrical circuits); Discrete mathematics; Combinatorics; Computer science; Complex network; Mathematical analysis","score_opus":0.026908833810652264,"score_gpt":0.31961329094518526,"score_spread":0.29270445713453297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505868393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41994998,0.0091958195,0.47583115,0.0046951724,0.00020566922,0.014305321,0.0005646196,0.0006745753,0.07457771],"genre_scores_gemma":[0.99424183,0.00022131499,0.0029211661,0.00033038008,0.0007252738,0.0009888805,0.00050859334,0.000023203726,0.00003933443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905854,0.000034988043,0.00023230331,0.00026120452,0.00014209267,0.00027089633],"domain_scores_gemma":[0.999267,0.00015915926,0.00012907319,0.00022035581,0.00012477246,0.00009965549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007785073,0.00019951782,0.00041987406,0.000018193121,0.00012258734,0.0000554601,0.00013845242,0.000015934575,0.00018470237],"category_scores_gemma":[0.0000038884104,0.00014942604,0.00014614055,0.00016316348,0.00007341295,0.00018119809,0.00007556707,0.00015298094,0.00001724059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018091503,0.00034226995,0.00580359,0.00061336363,0.00032805343,3.7182465e-7,0.000021636202,0.000013381771,0.000015310294,0.9284134,0.014983587,0.04944697],"study_design_scores_gemma":[0.0006635177,0.00037421312,0.0054337187,0.0017708974,0.0008446518,0.0000015986194,0.00001885783,0.020347979,0.00010741658,0.96585256,0.0039880704,0.00059651985],"about_ca_topic_score_codex":0.0000845414,"about_ca_topic_score_gemma":0.000019137007,"teacher_disagreement_score":0.5742919,"about_ca_system_score_codex":0.000023158087,"about_ca_system_score_gemma":0.00002905124,"threshold_uncertainty_score":0.6093417},"labels":[],"label_agreement":null},{"id":"W1506103758","doi":"10.2139/ssrn.1115311","title":"The Epistemic Structure and Dynamics of Social Networks","year":2008,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Epistemology; Dynamics (music); Sociology; Social dynamics; Social science; Philosophy","score_opus":0.0035514731722321173,"score_gpt":0.21694529857828204,"score_spread":0.21339382540604993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506103758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78007513,0.0021688915,0.21574216,0.00072102755,0.00007310668,0.00010875176,0.0000066792154,0.000023319488,0.0010809592],"genre_scores_gemma":[0.9985194,0.00057223695,0.000095569536,0.0000056007248,0.0004428748,0.0000013378756,0.000007513519,0.000012202876,0.00034322919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864584,0.00006471871,0.00023393733,0.00009514734,0.00012673257,0.00083362963],"domain_scores_gemma":[0.99953824,0.000050258648,0.00021659247,0.00010253856,0.00006376653,0.000028595412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036105872,0.00010567415,0.00017164066,0.000031002193,0.00062407553,0.000023974728,0.00020510265,0.00003489959,0.000025589854],"category_scores_gemma":[0.0000018306886,0.00007516273,0.00011615993,0.00013795379,0.00011280608,0.000048803773,0.000045378063,0.0010475849,2.539264e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018736233,0.000010910728,0.029797995,9.014145e-7,0.00027378363,3.8432412e-7,0.00008226344,0.00011884617,0.000031710188,0.90292466,0.00024289961,0.06649692],"study_design_scores_gemma":[0.00032469875,0.00008504372,0.005327449,0.0000068344393,0.00008120081,0.00014409189,0.00074244064,0.012954594,0.00004220407,0.97948897,0.0006321571,0.00017032084],"about_ca_topic_score_codex":0.000050693827,"about_ca_topic_score_gemma":0.00033445173,"teacher_disagreement_score":0.21844433,"about_ca_system_score_codex":0.00015264163,"about_ca_system_score_gemma":0.00029491328,"threshold_uncertainty_score":0.47999474},"labels":[],"label_agreement":null},{"id":"W1508155876","doi":"10.1007/978-3-540-68825-9_33","title":"A Novel Approach for Social Behavior Analysis of the Blogosphere","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Atlantic Canada Opportunities Agency","keywords":"Blogosphere; Computer science; Cyberspace; The Internet; World Wide Web; Social media; Information retrieval; Style (visual arts); Data science","score_opus":0.026822859954667603,"score_gpt":0.27011765620860545,"score_spread":0.24329479625393785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508155876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073197955,0.00004009739,0.9960859,0.0000346605,0.000082436694,0.00046032664,0.00006710253,0.000022345672,0.0024751907],"genre_scores_gemma":[0.7957277,0.0000015360675,0.2033438,0.00007829262,0.00047125234,0.000051599083,0.000048845843,0.000024102901,0.00025286665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982382,0.000011807522,0.0003887678,0.00063669344,0.00043312373,0.00029139468],"domain_scores_gemma":[0.9986454,0.00013482384,0.00038496227,0.0006042867,0.00019581808,0.000034711862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022530602,0.00028982823,0.0006560576,0.00030671316,0.0002712433,0.000052717685,0.0012255525,0.00012355788,0.000052523643],"category_scores_gemma":[0.0000042775478,0.00021916298,0.0007538922,0.0010066711,0.00065647427,0.00005031026,0.000409403,0.00033863308,2.8636092e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017113922,0.00046934522,0.01058971,0.000035666482,0.001366877,0.0000012752546,0.0014795347,0.12792495,0.00064622407,0.022795413,0.00034047654,0.8343334],"study_design_scores_gemma":[0.00047945464,0.00010472408,0.0067485175,0.00007842078,0.0029975404,0.0000032197327,0.0000014147005,0.96563935,0.0014789215,0.020006524,0.0014125269,0.0010493686],"about_ca_topic_score_codex":0.000087183704,"about_ca_topic_score_gemma":0.00004923232,"teacher_disagreement_score":0.83771443,"about_ca_system_score_codex":0.0000716487,"about_ca_system_score_gemma":0.00017226924,"threshold_uncertainty_score":0.8937207},"labels":[],"label_agreement":null},{"id":"W1509263583","doi":"10.1007/978-3-7091-0294-7_11","title":"Detecting Communities in Social Networks Using Local Information","year":2010,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Community structure; Data mining; Hierarchy; Data science; Measure (data warehouse); Phone; Complex network; Process (computing); Evolving networks; Theoretical computer science; World Wide Web; Mathematics","score_opus":0.02320499279674504,"score_gpt":0.25896945536943194,"score_spread":0.2357644625726869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509263583","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004337225,0.000011356053,0.47169128,0.000006521838,0.000049583385,0.00012066083,0.0000050209674,0.000070941926,0.5276109],"genre_scores_gemma":[0.9896345,0.0000030204262,0.0028847314,0.000060768238,0.000913782,0.000008405383,0.00029866613,0.000036643625,0.006159468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991115,0.00002074526,0.00044276932,0.00008418436,0.00012796771,0.00021283109],"domain_scores_gemma":[0.99933535,0.000065686356,0.00027606386,0.00022014561,0.00007608957,0.000026666352],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020551849,0.00024025884,0.00034720564,0.00022301171,0.00025727483,0.00009849455,0.00020320111,0.0002348647,0.0017541116],"category_scores_gemma":[5.016223e-7,0.0002565223,0.00017540967,0.000046557183,0.00010644444,0.00021943156,0.00019561763,0.0011538696,0.000011617559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010207748,0.000012602573,0.0007268565,0.000013282907,0.00013013392,5.39458e-7,0.0006084282,0.0028864853,0.000004413078,0.4204072,0.0003893537,0.5748105],"study_design_scores_gemma":[0.000571729,0.000038694336,0.000116971,0.00037171255,0.00026572266,0.0000026305606,0.001736021,0.55406284,0.0001322784,0.20270318,0.238246,0.0017522426],"about_ca_topic_score_codex":0.0019553027,"about_ca_topic_score_gemma":0.0010715779,"teacher_disagreement_score":0.9892008,"about_ca_system_score_codex":0.00006673271,"about_ca_system_score_gemma":0.00003523987,"threshold_uncertainty_score":0.9999887},"labels":[],"label_agreement":null},{"id":"W1511767998","doi":"10.1007/978-0-387-09695-7_27","title":"Modeling the Spread of Preventable Diseases: Social Culture and Epidemiology","year":2008,"lang":"en","type":"book-chapter","venue":"IFIP International Federation for Information Processing/IFIP","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; German University in Cairo; University of Windsor","keywords":"Psychological intervention; Tuberculosis; Malaria; Environmental health; Medicine; Population; Immunology; Nursing; Pathology","score_opus":0.03146677627998677,"score_gpt":0.30817077602775556,"score_spread":0.27670399974776877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511767998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029696518,0.00073164044,0.67903703,0.0011938841,0.0003092447,0.0013185617,0.0009949738,0.0001353151,0.31598237],"genre_scores_gemma":[0.90654635,0.00019032187,0.005367767,0.00079121994,0.0020253353,0.00043104155,0.011503314,0.00006748418,0.07307719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827945,0.000025056977,0.0010197174,0.00021480674,0.00029665916,0.00016431008],"domain_scores_gemma":[0.9978852,0.000102283535,0.0009730872,0.00013730524,0.0008582338,0.0000438638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028483925,0.00027822217,0.00040786795,0.00015914782,0.00064812246,0.00018881429,0.0002722905,0.0001613457,0.00014923495],"category_scores_gemma":[0.000044645865,0.00022634593,0.00025095147,0.0000398204,0.00011410374,0.0009875451,0.00008642905,0.00023133874,0.000008233057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001426101,0.00006421471,0.00044058368,0.0002344565,0.00059545564,1.3256495e-7,0.0025895117,0.008540609,0.000011224443,0.8278142,0.04654278,0.113024205],"study_design_scores_gemma":[0.0006298943,0.00005516149,0.000059001588,0.00025417467,0.00023753406,0.0000056163976,0.00028267296,0.41131374,0.00006514241,0.18731263,0.39929226,0.00049215584],"about_ca_topic_score_codex":0.00003667026,"about_ca_topic_score_gemma":0.0000066317507,"teacher_disagreement_score":0.90624934,"about_ca_system_score_codex":0.000071170965,"about_ca_system_score_gemma":0.000139069,"threshold_uncertainty_score":0.9230119},"labels":[],"label_agreement":null},{"id":"W1512997342","doi":"10.4236/ojdm.2015.53004","title":"A Combinatorial Analysis of Tree-Like Sentences","year":2015,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Digraph; Combinatorics; Sentence; Word (group theory); Alphabet; Mathematics; Tree (set theory); Context (archaeology); Loop (graph theory); Graph; Directed graph; Computer science; Discrete mathematics; Artificial intelligence; Linguistics","score_opus":0.04083047348209679,"score_gpt":0.33034497499909926,"score_spread":0.2895145015170025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512997342","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67202526,0.00019459019,0.2023049,0.0004070857,0.00056347094,0.0005415781,0.00006111258,0.000021001631,0.123881],"genre_scores_gemma":[0.9768281,0.0000026909956,0.022859817,0.0000074230634,0.00015095898,0.0000024391825,0.00000850093,0.000010501323,0.00012956618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984447,0.00007827771,0.00081845676,0.00009389934,0.00042925568,0.00013545532],"domain_scores_gemma":[0.997833,0.00010706122,0.0012220095,0.000294385,0.00040762324,0.0001358989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095661276,0.00013116543,0.00083395874,0.00023968732,0.00003541047,0.00012189249,0.0008291858,0.000023258635,0.00025030642],"category_scores_gemma":[0.000025471225,0.00009681312,0.00042561395,0.00080202235,0.000060630053,0.00024186935,0.00022256457,0.0001229645,0.0000024875296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036501326,0.0034311817,0.15208563,0.000099782315,0.035405084,0.00003471412,0.01408007,0.0037171454,0.0009601824,0.73333466,0.040737744,0.01574882],"study_design_scores_gemma":[0.004012227,0.0011536909,0.001215618,0.00049901847,0.017580446,0.000013334649,0.022290137,0.067279555,0.0036361876,0.8755477,0.005916338,0.00085574423],"about_ca_topic_score_codex":0.000083434315,"about_ca_topic_score_gemma":0.000012125503,"teacher_disagreement_score":0.30480283,"about_ca_system_score_codex":0.00002154374,"about_ca_system_score_gemma":0.000101941485,"threshold_uncertainty_score":0.39479247},"labels":[],"label_agreement":null},{"id":"W1522481850","doi":"10.1007/978-3-642-36203-3_49-1","title":"Social Network Analysis","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Transparency (behavior); Social network analysis; Extant taxon; Politics; Data science; Social network (sociolinguistics); Space (punctuation); Network science; State (computer science); Political science; Sociology; Social science; Computer science; Complex network; Social media; World Wide Web; Law","score_opus":0.014879566347998864,"score_gpt":0.2623347603114523,"score_spread":0.24745519396345345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522481850","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000069232187,0.00006103923,0.027536772,0.00006352193,0.00004378876,0.0001553671,0.000021327807,0.00013504272,0.9719762],"genre_scores_gemma":[0.053055555,0.000004261977,0.00082457665,0.000080357655,0.0027612338,0.0000061902288,0.0006410877,0.000057466477,0.94256926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862486,0.000014081501,0.00037006396,0.00044975942,0.00024743506,0.00029379252],"domain_scores_gemma":[0.99901795,0.000048773996,0.00029413195,0.00050317915,0.00008483888,0.00005114736],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000119785545,0.00036534196,0.0009019284,0.0002137786,0.00012327264,0.00006665344,0.000309675,0.00015963682,0.034264583],"category_scores_gemma":[1.8526582e-7,0.00035199182,0.0014745141,0.0001837066,0.000043064887,0.00003360756,0.00018312849,0.0003422785,0.0006698529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002150357,0.0000062363756,0.0015719823,0.0000019321665,0.0044937106,4.6823422e-7,0.000007079643,0.00018910656,1.8575501e-7,0.852626,0.134661,0.0064401026],"study_design_scores_gemma":[0.00006218592,0.000010164601,0.0001518303,0.0000101955075,0.0040738257,4.0849002e-8,0.0000027910278,0.0009438405,0.0000014196553,0.28610143,0.70815706,0.00048520142],"about_ca_topic_score_codex":0.00008072912,"about_ca_topic_score_gemma":0.000050970153,"teacher_disagreement_score":0.57349604,"about_ca_system_score_codex":0.000034804376,"about_ca_system_score_gemma":0.00005195494,"threshold_uncertainty_score":0.9998932},"labels":[],"label_agreement":null},{"id":"W1531478191","doi":"10.1109/hicss.2015.193","title":"Computational Analysis of Collective Intelligence in Conversational Text","year":2015,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Collective intelligence; Computer science; Intelligence analysis; Set (abstract data type); Web intelligence; Data science; Computational intelligence; Quality (philosophy); World Wide Web; The Internet; Artificial intelligence; Epistemology; Web modeling","score_opus":0.027229497737764265,"score_gpt":0.301201839451299,"score_spread":0.27397234171353474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531478191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10922644,0.0000092184955,0.8367605,0.000063216554,0.0000115827825,0.0000912863,0.000015727657,0.000017727943,0.053804252],"genre_scores_gemma":[0.9893902,1.13577336e-7,0.010201379,0.000017439455,0.000015168162,0.000008115553,0.000085967586,0.0000024374224,0.00027916],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938124,0.00003681272,0.00022632562,0.00012198033,0.00016077483,0.00007285992],"domain_scores_gemma":[0.9994748,0.00013132548,0.00007759008,0.000082548344,0.00019825195,0.000035432648],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016498586,0.000057446035,0.00019797457,0.00037710913,0.000012606549,0.000008415922,0.00008718468,0.000011696188,0.0013171377],"category_scores_gemma":[0.000005921349,0.00005618536,0.000094515235,0.0017592716,0.00004215384,0.00004983353,0.000032846452,0.000043142943,0.0000075336775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012755271,0.0001171018,0.5177854,5.522458e-7,0.0006626066,1.8379346e-7,0.0005649972,0.31729865,0.000004194876,0.15958712,0.0011008705,0.0028655801],"study_design_scores_gemma":[0.00010958847,0.000018293962,0.053361572,0.0000025445456,0.00014806275,3.451559e-8,0.00064594345,0.83817333,0.00021728758,0.1071548,0.00008849517,0.000080054306],"about_ca_topic_score_codex":0.00065015035,"about_ca_topic_score_gemma":0.00009427008,"teacher_disagreement_score":0.8801638,"about_ca_system_score_codex":0.000057723675,"about_ca_system_score_gemma":0.00012697358,"threshold_uncertainty_score":0.9995958},"labels":[],"label_agreement":null},{"id":"W1539265339","doi":"10.1103/physreve.92.062809","title":"Complex networks as an emerging property of hierarchical preferential attachment","year":2015,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Canadian Institutes of Health Research; James S. McDonnell Foundation","keywords":"Hierarchy; Complex system; Preferential attachment; Randomness; Complex network; Computer science; Simple (philosophy); Theoretical computer science; Property (philosophy); Projection (relational algebra); Artificial intelligence; Mathematics; Epistemology; Algorithm; Economics","score_opus":0.07407556414277666,"score_gpt":0.3843080179624406,"score_spread":0.3102324538196639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539265339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6097961,0.0100817755,0.20532392,0.003096045,0.00037237196,0.0052412166,0.00006301537,0.0007888663,0.16523668],"genre_scores_gemma":[0.99786097,0.0001404411,0.0008056485,0.0001504787,0.0007332984,0.00007337634,0.00014114966,0.00002091411,0.00007373296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844724,0.00022249571,0.00039220857,0.00031790155,0.00034478382,0.00027536097],"domain_scores_gemma":[0.9989182,0.0000373002,0.00017715665,0.00048540658,0.00013804516,0.00024390158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002574737,0.00020135744,0.00064206886,0.000027077582,0.00005418725,0.000021538292,0.00033770897,0.000015029231,0.00039650386],"category_scores_gemma":[0.00001060829,0.00013568164,0.00027975946,0.00027275685,0.00007771943,0.000114702205,0.00019209633,0.00022169529,0.00003241726],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009750068,0.0036198024,0.010977584,0.0005134313,0.00055729295,0.0000023133664,0.00039907606,0.001133407,0.001168345,0.21810858,0.039845437,0.72357726],"study_design_scores_gemma":[0.0017729243,0.00160244,0.0040223696,0.0033319425,0.0016173027,0.0000033862614,0.000109700995,0.4430293,0.0018403612,0.21128985,0.32951117,0.0018692485],"about_ca_topic_score_codex":0.00018742138,"about_ca_topic_score_gemma":0.0000032331095,"teacher_disagreement_score":0.721708,"about_ca_system_score_codex":0.000023114319,"about_ca_system_score_gemma":0.000049937622,"threshold_uncertainty_score":0.55329365},"labels":[],"label_agreement":null},{"id":"W1545751276","doi":"10.1007/978-3-319-16112-9_16","title":"Inter-layer Degree Correlations in Heterogeneously Growing Multiplex Networks","year":2015,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Degree (music); Layer (electronics); Homogeneous; Node (physics); Multiplex; Statistical physics; Focus (optics); Monte Carlo method; Mathematics; Computer science; Physics; Statistics; Materials science; Nanotechnology; Bioinformatics; Biology; Optics","score_opus":0.2166275278247333,"score_gpt":0.38851693402126536,"score_spread":0.17188940619653206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545751276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003534429,0.006127462,0.8878723,0.00013668402,0.0007262873,0.00073426135,0.000046938105,0.000118197946,0.10388442],"genre_scores_gemma":[0.9816783,0.00012393629,0.007320439,0.00007484683,0.0005520515,0.00008873529,0.0002458999,0.0000673442,0.009848445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975231,0.00006214184,0.0010379965,0.0006310933,0.00035644948,0.00038917828],"domain_scores_gemma":[0.99796426,0.0008487344,0.00034339263,0.0003128597,0.0004590282,0.00007173398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004204266,0.0004886338,0.0007424987,0.00044933247,0.00011646905,0.000039901843,0.000424326,0.00013850343,0.00026279953],"category_scores_gemma":[0.000031240546,0.00052605907,0.00024766958,0.00021638238,0.00028892586,0.00014658841,0.00056102604,0.000767585,0.00006800366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013425118,0.000042454536,0.0037127156,0.000011160212,0.00030323066,0.000022988997,0.00042547556,0.799974,1.6396864e-7,0.15590598,0.0018989407,0.03768945],"study_design_scores_gemma":[0.00013710931,0.000050179216,0.000138385,0.00077403145,0.00006233785,0.0000048431834,0.0003782148,0.43896946,0.0000036513034,0.5532178,0.0056264014,0.00063758134],"about_ca_topic_score_codex":0.00014284735,"about_ca_topic_score_gemma":0.0005529454,"teacher_disagreement_score":0.98132485,"about_ca_system_score_codex":0.00037323375,"about_ca_system_score_gemma":0.00008750873,"threshold_uncertainty_score":0.9997191},"labels":[],"label_agreement":null},{"id":"W1545879303","doi":"10.14778/2732219.2732221","title":"More is simpler","year":2013,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Leverage (statistics); Similarity (geometry); Computation; Theoretical computer science; Cluster analysis; Similarity measure; Artificial intelligence; Algorithm","score_opus":0.007098670208723978,"score_gpt":0.2316398325702858,"score_spread":0.22454116236156182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545879303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93692887,0.000035060606,0.0001242212,0.0029503708,0.000044017703,0.0006032503,0.0000069916096,0.00006268462,0.059244543],"genre_scores_gemma":[0.997268,0.0000020745897,0.0010014186,0.00020669444,0.00012733464,0.00012011776,0.0000011810051,0.000012330995,0.0012608081],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992157,0.0000021089947,0.00021233407,0.00016464174,0.00020938503,0.00019583135],"domain_scores_gemma":[0.999478,0.000012122509,0.00017185639,0.00013784623,0.00015811327,0.000042051553],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000069883296,0.000121403464,0.000164659,0.000037383797,0.00007341194,0.000046519992,0.00038871844,0.000016317026,0.0017054535],"category_scores_gemma":[0.000002727996,0.00007966469,0.00017846319,0.00019902039,0.000050468087,0.000117554984,0.00024950216,0.00008957649,0.000034567995],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072678877,0.00029825352,0.30801404,0.000045369572,0.00037801033,3.4737333e-8,0.001578787,0.000010267673,0.07429141,0.08161047,0.5007457,0.03302038],"study_design_scores_gemma":[0.00053110684,0.00006474459,0.027046619,0.00010464254,0.00018443943,0.0000010168591,0.0014915977,0.0018404042,0.72543323,0.19259273,0.050254602,0.00045487014],"about_ca_topic_score_codex":0.00040125017,"about_ca_topic_score_gemma":3.4821863e-7,"teacher_disagreement_score":0.6511418,"about_ca_system_score_codex":0.000020431378,"about_ca_system_score_gemma":0.0000075256403,"threshold_uncertainty_score":0.99920714},"labels":[],"label_agreement":null},{"id":"W1550982495","doi":"10.1109/asonam.2013.6785663","title":"Welcome from the ASONAM 2013 program chairs","year":2013,"lang":"en","type":"article","venue":"Advances in Social Networks Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hospitality; Library science; Tourism; Operations research; Media studies; Political science; Engineering; Sociology; Computer science; Law","score_opus":0.0076730569831212694,"score_gpt":0.2810129423045941,"score_spread":0.27333988532147285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550982495","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8399873,0.016422624,0.12727225,0.0016835749,0.00030790345,0.0011411334,0.000022665048,0.00027765488,0.012884908],"genre_scores_gemma":[0.99391305,0.0005135731,0.003596593,0.00009237068,0.0014307947,0.00025034315,0.000099535784,0.000015534202,0.000088205554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986075,0.00011188471,0.00037327077,0.00036675265,0.00015967908,0.00038090284],"domain_scores_gemma":[0.9991449,0.00030934,0.00021691891,0.00021689801,0.000055120996,0.0000568031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022066476,0.00020682382,0.00048690222,0.00008573576,0.00038413148,0.00017903547,0.00025447618,0.000056283046,0.00056655426],"category_scores_gemma":[0.0000036441404,0.00015549768,0.00028126768,0.0013281337,0.00014314284,0.00030808302,0.00013737849,0.00023089164,0.000004071743],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025003962,0.000045786303,0.4536064,7.3890203e-7,0.00045201796,3.453903e-7,0.00035350307,0.0043846644,9.471042e-7,0.001632677,0.0017896424,0.5377308],"study_design_scores_gemma":[0.0004966894,0.000053211126,0.34475124,0.000058316593,0.0013918638,1.2547947e-7,0.005209094,0.5467496,0.0000038072324,0.021347191,0.07917509,0.00076376804],"about_ca_topic_score_codex":0.0027123902,"about_ca_topic_score_gemma":0.0015722845,"teacher_disagreement_score":0.54236495,"about_ca_system_score_codex":0.000017283557,"about_ca_system_score_gemma":0.0000073519795,"threshold_uncertainty_score":0.6341011},"labels":[],"label_agreement":null},{"id":"W1551299591","doi":"10.1103/physrevlett.107.195702","title":"Percolation Transitions Are Not Always Sharpened by Making Networks Interdependent","year":2011,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":101,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Percolation (cognitive psychology); Statistical physics; Percolation threshold; Interdependent networks; Discontinuity (linguistics); Critical exponent; Exponent; Percolation critical exponents; Dimension (graph theory); Percolation theory; Directed percolation; Physics; Complex network; Computer science; Phase transition; Topology (electrical circuits); Mathematics; Combinatorics; Condensed matter physics; Quantum mechanics; Mathematical analysis","score_opus":0.03011660118401357,"score_gpt":0.29238107069166397,"score_spread":0.2622644695076504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551299591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09561184,0.0019593276,0.8871741,0.0053723454,0.00011088271,0.0011814507,0.00006499913,0.00034559073,0.008179439],"genre_scores_gemma":[0.9926066,0.00009851407,0.0005763683,0.006076847,0.0003907537,0.000114604154,0.00010200219,0.0000275753,0.0000067417764],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987851,0.00014850867,0.00030236875,0.00032030744,0.00017634896,0.00026740012],"domain_scores_gemma":[0.999345,0.000038388534,0.00018450065,0.0003285973,0.00003589616,0.00006761038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016044731,0.00021375457,0.00039802364,0.00003086441,0.000111433794,0.000033219574,0.00025997794,0.000007973842,0.000647463],"category_scores_gemma":[0.0000022267993,0.00020005243,0.00039983154,0.00020524427,0.000040131854,0.00016981071,0.00006130818,0.00023872865,0.000058846304],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013916435,0.004699756,0.031450458,0.0014378221,0.0025272642,0.00004488888,0.004524261,0.0023436544,0.055949423,0.044133995,0.5310404,0.32170895],"study_design_scores_gemma":[0.0046984893,0.0007377084,0.113598526,0.042384237,0.011382947,0.000020990989,0.0009954887,0.5999427,0.012140471,0.029076861,0.17236722,0.012654386],"about_ca_topic_score_codex":0.000034973265,"about_ca_topic_score_gemma":0.000004007599,"teacher_disagreement_score":0.89699477,"about_ca_system_score_codex":0.000034956556,"about_ca_system_score_gemma":0.000004091335,"threshold_uncertainty_score":0.8157901},"labels":[],"label_agreement":null},{"id":"W155194117","doi":"10.1007/978-3-642-31087-4_34","title":"A Semantic-Based Social Network of Academic Researchers","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Social network (sociolinguistics); Artificial intelligence; World Wide Web; Data science; Information retrieval; Social media","score_opus":0.041521192869372746,"score_gpt":0.3198772308341208,"score_spread":0.27835603796474806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155194117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003938709,0.00041754704,0.99428535,0.00025650396,0.0001628827,0.0002537189,0.000007318612,0.000046643963,0.004176148],"genre_scores_gemma":[0.9566133,0.0000066069965,0.040632397,0.00014840053,0.0024364998,0.000008014288,0.000016866084,0.00003420176,0.00010373557],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975836,0.000050781255,0.00044642738,0.00055731565,0.0006974947,0.0006643778],"domain_scores_gemma":[0.9985097,0.00037354825,0.00033481163,0.0004866724,0.00018973956,0.00010550749],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011304144,0.00031451197,0.0005465409,0.00028883855,0.00017996949,0.000052935797,0.0011534336,0.00021173026,0.00022986077],"category_scores_gemma":[0.000011015529,0.00029980717,0.00022957094,0.00053982786,0.0008461224,0.00010651835,0.0004929525,0.0011853517,0.000010446448],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017071921,0.00003540275,0.0057517453,0.000037759874,0.0000594457,0.0000026421383,0.00033010737,0.026617698,0.00014725937,0.035839926,0.00034136223,0.9308196],"study_design_scores_gemma":[0.0003320702,0.000099916586,0.001143951,0.00067085744,0.00009357191,0.000001035039,4.6901428e-7,0.19320713,0.0016197674,0.7958607,0.0060720644,0.000898492],"about_ca_topic_score_codex":0.0000621188,"about_ca_topic_score_gemma":0.000017098591,"teacher_disagreement_score":0.95621943,"about_ca_system_score_codex":0.0001234695,"about_ca_system_score_gemma":0.00037979858,"threshold_uncertainty_score":0.9999454},"labels":[],"label_agreement":null},{"id":"W1553186921","doi":"","title":"Self explaining graphs","year":2006,"lang":"en","type":"article","venue":"Society for Information Technology & Teacher Education International Conference","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"","keywords":"Computer science","score_opus":0.010386085531599525,"score_gpt":0.2837735171776573,"score_spread":0.2733874316460578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553186921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107529856,0.00007922588,0.68188846,0.0070499973,0.00096509466,0.0010860442,0.00009116021,0.0016352677,0.1996749],"genre_scores_gemma":[0.9436497,0.0000056080917,0.053465936,0.0001473864,0.00023836207,0.00061681785,0.0009796036,0.000009326573,0.0008872433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999028,0.000008693897,0.00043078314,0.00016382731,0.00017658975,0.00019207945],"domain_scores_gemma":[0.99873245,0.000026135054,0.00032923778,0.00021946477,0.00066628325,0.00002645671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018784349,0.00015308108,0.00013558417,0.00025486833,0.00019793703,0.0001361822,0.00042545935,0.00011278901,0.00049635954],"category_scores_gemma":[0.000009857126,0.00016763124,0.00026465085,0.00035850113,0.00007952155,0.0007701912,0.00006675145,0.00020533991,0.00003758145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002550721,0.00013219478,0.022010788,0.0000069218695,0.00009788087,4.3585904e-9,0.0004681674,0.000011161214,0.00006373686,0.91400814,0.030947693,0.032250773],"study_design_scores_gemma":[0.000508415,0.000033571196,0.001850315,0.000034021363,0.00007556671,0.0000019615081,0.00891624,0.017210072,0.0018287307,0.51045907,0.45868063,0.00040141],"about_ca_topic_score_codex":0.000090283844,"about_ca_topic_score_gemma":0.000003040192,"teacher_disagreement_score":0.8361199,"about_ca_system_score_codex":0.0001073671,"about_ca_system_score_gemma":0.00021803839,"threshold_uncertainty_score":0.68358034},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02429333108308914,"score_gpt":0.27978632205072834,"score_spread":0.2554929909676392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554338108","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062789004,0.00014229017,0.14468181,0.0000066766206,0.000019080786,0.00022217228,0.000079380756,0.00007632318,0.8547095],"genre_scores_gemma":[0.0028908642,0.00002255394,0.010488823,0.000022445805,0.00088067044,0.0000028168258,0.00021654047,0.00003670051,0.9854386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983097,0.0002649363,0.00028099993,0.00058906653,0.00016403735,0.00039129765],"domain_scores_gemma":[0.9990269,0.000120333265,0.00028126957,0.00038911577,0.00007801034,0.00010436152],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000300973,0.0003766777,0.0009325496,0.00045539672,0.00022228867,0.00006026237,0.0004059907,0.00022966984,0.000012367889],"category_scores_gemma":[6.3343964e-7,0.0004792244,0.00052325,0.0001323784,0.00015172102,0.00009695112,0.0005148584,0.00056518405,7.276635e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026607213,0.000019426932,0.00014416518,0.000014015464,0.0018868464,0.000013730799,0.00007393187,0.0019235559,0.0000017265484,0.874125,0.104859225,0.016911745],"study_design_scores_gemma":[0.00045622405,0.000013710607,0.00017811815,0.000052287905,0.0043719052,4.0536804e-7,0.000040078157,0.042959947,0.000013269476,0.0017996518,0.94931835,0.0007960635],"about_ca_topic_score_codex":0.00042541616,"about_ca_topic_score_gemma":0.00001879938,"teacher_disagreement_score":0.87232536,"about_ca_system_score_codex":0.00021493368,"about_ca_system_score_gemma":0.00011191106,"threshold_uncertainty_score":0.99976593},"labels":[],"label_agreement":null},{"id":"W1555269938","doi":"10.1109/ccece.2001.933769","title":"Shaping and policing of fractal α-stable broadband traffic","year":2002,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hurst exponent; Self-similarity; Fractal; Gaussian; Computer science; Broadband; Broadband networks; Traffic generation model; Real-time computing; Telecommunications; Mathematics; Statistics","score_opus":0.02390436097451343,"score_gpt":0.24966566625218328,"score_spread":0.22576130527766985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555269938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9434393,0.00010891173,0.0052556703,0.00005201736,0.0000058800433,0.000050327075,0.0000018356511,0.000041282907,0.051044766],"genre_scores_gemma":[0.9979257,0.0000056485724,0.0013300682,0.000019933568,0.00007907691,0.0000022706179,0.0000021117091,0.0000067148976,0.0006284562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955434,0.000010300362,0.00013981335,0.00010805515,0.000060689108,0.00012682339],"domain_scores_gemma":[0.99976057,0.00003120685,0.00005001886,0.00010692567,0.000018053375,0.000033223292],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004737242,0.00006899779,0.00014764848,0.000052254647,0.000046756068,0.00002044673,0.000053182448,0.000012663915,0.0016900187],"category_scores_gemma":[8.952814e-7,0.0000631281,0.000048962007,0.000117973126,0.000025868769,0.00007305442,0.00003304797,0.00005228775,0.000003990786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010143131,0.00046484335,0.2582402,0.000045860434,0.0004258855,0.0000015079436,0.002101223,0.0017758248,0.012612769,0.05905045,0.018692087,0.6465792],"study_design_scores_gemma":[0.0014534057,0.00019527834,0.01755119,0.00019022333,0.0002597839,0.0000049795362,0.0015276793,0.9231904,0.03197056,0.007847498,0.014730273,0.0010787193],"about_ca_topic_score_codex":0.0005285669,"about_ca_topic_score_gemma":0.0000147266965,"teacher_disagreement_score":0.9214146,"about_ca_system_score_codex":0.0000043422483,"about_ca_system_score_gemma":0.0000023170776,"threshold_uncertainty_score":0.9992226},"labels":[],"label_agreement":null},{"id":"W1559531398","doi":"","title":"Proceedings of the 3rd international workshop on Modeling social media","year":2012,"lang":"en","type":"article","venue":"ACM Conference on Hypertext","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Social media; Collective intelligence; Computer science; Context (archaeology); World Wide Web; Social computing; Data science; Social intelligence; Psychology","score_opus":0.08597390578293271,"score_gpt":0.3040081704496126,"score_spread":0.21803426466667988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559531398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8791754,0.000016016778,0.00095574145,0.002260672,0.0002867118,0.00013677258,0.000011404179,0.000047757556,0.117109515],"genre_scores_gemma":[0.998644,0.000003828057,0.00032397654,0.0001240523,0.00069753174,0.000020369505,0.000007600756,0.000011279567,0.00016735088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992169,0.000011108247,0.00017723037,0.0001437018,0.00025992678,0.00019111986],"domain_scores_gemma":[0.99944425,0.000078303885,0.000109590685,0.00017507425,0.00014557976,0.000047213955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011893353,0.00012018443,0.0001637325,0.00004973878,0.000089709596,0.000036806086,0.00062150945,0.000038196264,0.00077430997],"category_scores_gemma":[0.00005196565,0.000086278415,0.00012242956,0.000131594,0.000043856475,0.0001084935,0.00017987976,0.00019345901,0.000025081197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004304126,0.00035774815,0.013554734,0.0000041554918,0.00016547187,5.9008233e-8,0.002275165,0.00009950732,0.0026442646,0.8406872,0.0074969097,0.13267176],"study_design_scores_gemma":[0.002689903,0.00015974049,0.026058655,0.0012929769,0.00062274624,0.000003192714,0.014836692,0.28305712,0.02902511,0.61256903,0.027099567,0.0025852313],"about_ca_topic_score_codex":0.000015645172,"about_ca_topic_score_gemma":0.0000019504605,"teacher_disagreement_score":0.2829576,"about_ca_system_score_codex":0.00002011342,"about_ca_system_score_gemma":0.000023736557,"threshold_uncertainty_score":0.84781516},"labels":[],"label_agreement":null},{"id":"W156463760","doi":"","title":"Mining Data and Modelling Social Capital in Virtual Learning Communities","year":2005,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Bayesian network; Bayesian probability; Machine learning; Social capital; Data science; Artificial intelligence; Data mining","score_opus":0.049368921640937556,"score_gpt":0.288744103010999,"score_spread":0.23937518137006145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156463760","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9049608,0.00003239234,0.087873735,0.00008183748,0.000004024055,0.000029845529,0.000003396847,0.000044357017,0.0069695795],"genre_scores_gemma":[0.9931576,0.000004068663,0.0062178527,0.000017422524,0.00023604529,0.00000312442,0.00011885914,0.000009048329,0.00023597098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948347,0.000051318406,0.0001465457,0.00011179521,0.0000646944,0.00014216779],"domain_scores_gemma":[0.99970514,0.00006836471,0.000036520098,0.00015988381,0.000011766266,0.000018330693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018617908,0.00007945738,0.00013338456,0.000059299564,0.00015814122,0.000060085105,0.00019844132,0.000017193297,0.00028516093],"category_scores_gemma":[6.22043e-7,0.00008306463,0.000019965144,0.000069529066,0.000039123068,0.0002153216,0.00034146174,0.00017877537,0.0000028573677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018911493,0.00019329724,0.22400974,0.0000059366494,0.0001634353,0.0000010771256,0.044595163,0.12545562,0.00007674849,0.10091608,0.0021252192,0.5024388],"study_design_scores_gemma":[0.0001235463,0.000009265074,0.00017473867,0.000007867501,0.000010362006,1.5397987e-7,0.018705722,0.9775369,0.000022647722,0.0006778727,0.0026211406,0.00010974226],"about_ca_topic_score_codex":0.0010532583,"about_ca_topic_score_gemma":0.0004918646,"teacher_disagreement_score":0.8520813,"about_ca_system_score_codex":0.000009439567,"about_ca_system_score_gemma":0.000009318761,"threshold_uncertainty_score":0.3387277},"labels":[],"label_agreement":null},{"id":"W1571586326","doi":"10.1109/ccnc.2015.7158041","title":"Mobile network applications of agent-based model to investigate boundless connectivity threshold","year":2015,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Percolation (cognitive psychology); Visualization; Percolation theory; Social connectedness; Mobility model; Graphical user interface; Percolation threshold; Grid; Human–computer interaction; Agent-based model; Distributed computing; Theoretical computer science; Data mining; Artificial intelligence; Topology (electrical circuits); Engineering; Mathematics","score_opus":0.0428566141263866,"score_gpt":0.3006447338831666,"score_spread":0.25778811975678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571586326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12451385,0.000027644466,0.85630757,0.000050694725,0.000013028789,0.0005281858,0.000015817339,0.000102135,0.018441057],"genre_scores_gemma":[0.9719435,2.5248627e-7,0.02663418,0.00017098988,0.00014069291,0.00061616517,0.000037448273,0.000015957516,0.00044078848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991106,0.000028136901,0.00023813407,0.00024384286,0.00016108439,0.00021824644],"domain_scores_gemma":[0.99899125,0.000034000335,0.00009724649,0.0005069025,0.00015882653,0.00021176077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002568409,0.00013172603,0.00025139554,0.000057838424,0.0000665118,0.00003084479,0.00024122288,0.000025968242,0.00007051851],"category_scores_gemma":[0.0000018724531,0.00012660921,0.00010545241,0.00046765036,0.00006069782,0.00005640829,0.000106900465,0.00008015816,0.000020798208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010046905,0.00017137028,0.023037562,0.0000044805247,0.0000494887,6.8562095e-8,0.00008031755,0.8334045,0.00025694686,0.11742895,0.022750938,0.002805371],"study_design_scores_gemma":[0.00027854127,0.00007791872,0.000095578245,0.000015203701,0.0000602499,5.1833187e-8,0.00008357449,0.8075653,0.0051532956,0.17689121,0.00951771,0.00026136852],"about_ca_topic_score_codex":0.00032906124,"about_ca_topic_score_gemma":0.000107883076,"teacher_disagreement_score":0.8474297,"about_ca_system_score_codex":0.000031400778,"about_ca_system_score_gemma":0.00012789544,"threshold_uncertainty_score":0.5162974},"labels":[],"label_agreement":null},{"id":"W1574923366","doi":"10.1002/widm.1112","title":"Self‐organizing maps for latent semantic analysis of free‐form text in support of public policy analysis","year":2013,"lang":"en","type":"article","venue":"Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Mitacs; University of Victoria","keywords":"Computer science; Cluster analysis; Information retrieval; Unstructured data; Latent semantic analysis; Context (archaeology); Topic model; Document clustering; Natural language processing; Artificial intelligence; Big data; Data mining","score_opus":0.05294647992264497,"score_gpt":0.3458112725074737,"score_spread":0.2928647925848287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574923366","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9304622,0.012942637,0.043728158,0.00081787107,0.00013054672,0.0022306736,0.0042652874,0.00009229166,0.0053303284],"genre_scores_gemma":[0.98969287,0.00083625637,0.004330356,0.000015180702,0.0001438698,0.00014232166,0.0045564193,0.00002911658,0.00025360915],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691826,0.00018502529,0.0015779936,0.00072763755,0.00015486569,0.00043624593],"domain_scores_gemma":[0.99676335,0.00027304108,0.00078971026,0.0018786443,0.00017591662,0.00011931301],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001375656,0.00036336956,0.0019438161,0.0018774146,0.0001135534,0.00013342431,0.0011617738,0.00006670981,0.00025460738],"category_scores_gemma":[0.00007278374,0.0003013354,0.0007473648,0.004503287,0.0001253261,0.0010857183,0.0030798789,0.00013190538,0.000006282533],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026807447,0.0014034876,0.7903975,0.0010551789,0.014391103,0.0000012891605,0.0063889013,0.00002618128,0.00037223278,0.0021482373,0.039056417,0.14473265],"study_design_scores_gemma":[0.0049926834,0.0016830715,0.30969223,0.0051999106,0.109607756,0.000009728428,0.01495937,0.48282897,0.00084101286,0.016292205,0.048421364,0.0054716943],"about_ca_topic_score_codex":0.00038545424,"about_ca_topic_score_gemma":0.00097393343,"teacher_disagreement_score":0.48280278,"about_ca_system_score_codex":0.00005881788,"about_ca_system_score_gemma":0.00012666003,"threshold_uncertainty_score":0.99994385},"labels":[],"label_agreement":null},{"id":"W1575859992","doi":"10.1007/978-3-319-16112-9_5","title":"Measuring the Generalized Friendship Paradox in Networks with Quality-Dependent Connectivity","year":2015,"lang":"en","type":"preprint","venue":"Studies in computational intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Friendship; Uncorrelated; Phenomenon; Node (physics); Quality (philosophy); Measure (data warehouse); Mathematics; Contrast (vision); Computer science; Econometrics; Social psychology; Psychology; Statistics; Epistemology; Artificial intelligence; Data mining; Physics; Philosophy; Quantum mechanics","score_opus":0.20755388189535542,"score_gpt":0.41242012467089956,"score_spread":0.20486624277554413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575859992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1639644,0.0035203677,0.8285377,0.00045256954,0.0004035545,0.0008779704,0.000026622327,0.00008189351,0.0021348938],"genre_scores_gemma":[0.99347377,0.000076235745,0.005537048,0.00005586159,0.00035529488,0.00039331077,0.00006265266,0.000025707783,0.00002010658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668354,0.0006986185,0.0008573667,0.0007271847,0.0006017121,0.00043160972],"domain_scores_gemma":[0.99698484,0.0014862395,0.00045156654,0.00049193494,0.00053104816,0.000054361823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024426978,0.00042232315,0.0008108553,0.00018397461,0.00015832098,0.000090411864,0.0006703552,0.00008241652,0.00002830047],"category_scores_gemma":[0.00007603363,0.0003169253,0.00014567097,0.0005184999,0.00035249212,0.00006873228,0.0012901445,0.0011176618,0.000004598783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005246979,0.00009967572,0.048275266,0.0000233129,0.00030660466,0.000006463561,0.0012543321,0.8960052,1.1750679e-7,0.049862787,0.00010654756,0.0040072193],"study_design_scores_gemma":[0.00020474897,0.000031728523,0.0059493617,0.00040434147,0.00004960228,0.0000016096999,0.0025156352,0.3447358,0.000027238135,0.6455193,0.000049728507,0.0005108585],"about_ca_topic_score_codex":0.0016882485,"about_ca_topic_score_gemma":0.0020231847,"teacher_disagreement_score":0.8295094,"about_ca_system_score_codex":0.0003549665,"about_ca_system_score_gemma":0.00020259147,"threshold_uncertainty_score":0.9999283},"labels":[],"label_agreement":null},{"id":"W1588722511","doi":"10.15353/joci.v11i2.2832","title":"Community informatics as innovation in sociotechnical infrastructures","year":2015,"lang":"en","type":"article","venue":"The Journal of Community Informatics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sociotechnical system; Informatics; Knowledge management; Engineering informatics; Affordance; Analytics; Reputation; Information technology; Computer science; Data science; Business; Engineering; Health informatics; Sociology; Political science","score_opus":0.04231170926783378,"score_gpt":0.32549509767156365,"score_spread":0.28318338840372986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588722511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9553302,0.0000110929805,0.033828482,0.00031460033,0.00004903274,0.00012469644,0.0000048219217,0.000025631347,0.010311458],"genre_scores_gemma":[0.99615693,0.000008191564,0.0030839308,0.0006286182,0.00007022898,0.0000017145499,0.000029529896,0.000009291535,0.000011550018],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99633247,0.0010456957,0.0019484672,0.000004995262,0.0004586846,0.00020969177],"domain_scores_gemma":[0.9963196,0.000580575,0.0016511652,0.0007239604,0.00066167646,0.00006301578],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0075701773,0.00017567776,0.0003917877,0.00037563752,0.00039874096,0.000091434405,0.0014803786,0.00008235273,0.000041999043],"category_scores_gemma":[0.00023678591,0.0001239925,0.00009621675,0.00095248676,0.00020160618,0.000731695,0.000549061,0.0036418154,0.0000109952625],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021992413,0.0006551476,0.011737308,0.00009162012,0.0003664427,2.6273278e-7,0.80991465,0.027323078,0.00007605911,0.04887572,0.058728963,0.042010825],"study_design_scores_gemma":[0.0013144065,0.00049523206,0.004506518,0.00014393555,0.000118354845,0.000057144924,0.56221575,0.0040152925,0.0006746745,0.41717517,0.008992092,0.0002914412],"about_ca_topic_score_codex":0.00071639934,"about_ca_topic_score_gemma":0.00004760106,"teacher_disagreement_score":0.36829945,"about_ca_system_score_codex":0.00012930775,"about_ca_system_score_gemma":0.00023374896,"threshold_uncertainty_score":0.9986568},"labels":[],"label_agreement":null},{"id":"W1593504724","doi":"","title":"Proceedings of the 1st ACM international workshop on Complex networks meet information & knowledge management","year":2009,"lang":"en","type":"article","venue":"Conference on Information and Knowledge Management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Complex network; Variety (cybernetics); Data science; Centrality; Network science; Social network analysis; World Wide Web; Social media; Artificial intelligence","score_opus":0.024035890533861702,"score_gpt":0.28162316204439186,"score_spread":0.2575872715105302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593504724","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023894333,0.000011116422,0.010446869,0.00068777584,0.00019473623,0.0006990995,0.000008676416,0.000079255326,0.98548305],"genre_scores_gemma":[0.9977068,0.000071911854,0.000640957,0.00034559713,0.000086174616,0.000070122325,0.00009877561,0.000004767888,0.0009749102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987813,0.000017404056,0.0005812124,0.00014870048,0.0002550713,0.00021630789],"domain_scores_gemma":[0.9989367,0.000024142144,0.0003639923,0.00032149864,0.00029221692,0.00006143807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026324624,0.00023258191,0.00020918545,0.000339758,0.00018872613,0.00029246704,0.0006858253,0.000043475142,0.00017392464],"category_scores_gemma":[0.0000060380867,0.00018354178,0.0001079831,0.0004304119,0.00006117057,0.00075158913,0.00042118755,0.0001519258,0.00007035313],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026549196,0.00009081257,0.00024997268,0.000029797257,0.00007412229,2.5922112e-8,0.00052402756,0.00009090985,0.0000010542602,0.6431225,0.020078128,0.3357121],"study_design_scores_gemma":[0.0026523913,0.00024615027,0.05911447,0.0012762961,0.00023975383,8.309062e-7,0.010746084,0.16978334,0.00018392205,0.032875106,0.72198707,0.0008945851],"about_ca_topic_score_codex":0.0000017448988,"about_ca_topic_score_gemma":0.0000018999772,"teacher_disagreement_score":0.99531734,"about_ca_system_score_codex":0.00006482875,"about_ca_system_score_gemma":0.000011931352,"threshold_uncertainty_score":0.74846166},"labels":[],"label_agreement":null},{"id":"W1595035399","doi":"10.1007/11863649_1","title":"Automated Social Network Analysis for Collaborative Work","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Collaborative software; Work (physics); Computer-supported cooperative work; Human–computer interaction; Social network analysis; Software; World Wide Web; Social network (sociolinguistics); Collaborative network; Data science; Software engineering; Knowledge management; Engineering; Social media","score_opus":0.012876603803281652,"score_gpt":0.26792996552671655,"score_spread":0.2550533617234349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595035399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008180073,0.00012760134,0.99233055,0.00015147979,0.00021691732,0.0005182648,0.000043112057,0.00028759774,0.006242684],"genre_scores_gemma":[0.7480239,0.0000018689218,0.24618524,0.0002303244,0.0040994305,0.00007745795,0.0003852372,0.00006553946,0.0009309393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973724,0.00003500868,0.0005303662,0.0009882048,0.0004487039,0.0006253521],"domain_scores_gemma":[0.9981769,0.00039625305,0.00044964958,0.00049584307,0.0004124292,0.00006894372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049369957,0.0004837787,0.00091784046,0.00062680896,0.00047557434,0.0003089467,0.00084504136,0.00019123954,0.000086569584],"category_scores_gemma":[0.0000048806983,0.00047015067,0.00048598833,0.0030672674,0.00044877737,0.00011263681,0.00030017973,0.00039015317,0.0000048708102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023276925,0.000048674,0.0056260973,0.000010145928,0.0007873138,0.000004341157,0.0002370066,0.81237525,0.00000484994,0.024259029,0.007661417,0.14896257],"study_design_scores_gemma":[0.0002947377,0.00007428486,0.0016557099,0.00012170596,0.00072995573,2.5396548e-7,3.741829e-7,0.69309497,0.00008072999,0.2917079,0.011181161,0.0010582325],"about_ca_topic_score_codex":0.00004440836,"about_ca_topic_score_gemma":0.00012053607,"teacher_disagreement_score":0.74794215,"about_ca_system_score_codex":0.00017812465,"about_ca_system_score_gemma":0.00025907025,"threshold_uncertainty_score":0.999775},"labels":[],"label_agreement":null},{"id":"W1597577408","doi":"10.1103/physreve.81.046115","title":"Communities, clustering phase transitions, and hysteresis: Pitfalls in constructing network ensembles","year":2010,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Hysteresis; Cluster analysis; Phase transition; Phase (matter); Computer science; Data science; Statistical physics; Physics; Artificial intelligence; Condensed matter physics","score_opus":0.02046140719502981,"score_gpt":0.326050864851729,"score_spread":0.3055894576566992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597577408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98673767,0.003643661,0.0050656544,0.00027690458,0.000046662833,0.00042128837,0.000016367147,0.00007347076,0.0037183096],"genre_scores_gemma":[0.9965909,0.00049259025,0.0022508749,0.00016808696,0.00037949995,0.00006172321,0.00003574421,0.000015386013,0.0000051635257],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990713,0.0001319304,0.00030287672,0.00015783655,0.00009088654,0.00024515024],"domain_scores_gemma":[0.99931055,0.0001887721,0.000100407815,0.00030235012,0.00002910728,0.000068780326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002480055,0.00016577517,0.00047838237,0.000030824274,0.00010463381,0.000044420212,0.00015112264,0.000015443686,0.0001106183],"category_scores_gemma":[0.000004633245,0.00015639933,0.000121197416,0.00021479126,0.00008679409,0.00010988647,0.00008427484,0.00039612886,0.0000048071706],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026718059,0.0011434356,0.018001381,0.0014018557,0.00024748486,0.000008452661,0.0011483233,0.000087147826,0.012481507,0.15320164,0.0013883509,0.8108637],"study_design_scores_gemma":[0.012111233,0.0009327863,0.007067738,0.05651141,0.0034330848,0.00010165428,0.005624392,0.25375578,0.0050201644,0.4721404,0.17569484,0.007606523],"about_ca_topic_score_codex":0.00019456206,"about_ca_topic_score_gemma":0.0003121404,"teacher_disagreement_score":0.80325717,"about_ca_system_score_codex":0.000006779937,"about_ca_system_score_gemma":0.000015139094,"threshold_uncertainty_score":0.637778},"labels":[],"label_agreement":null},{"id":"W1598423130","doi":"","title":"Improving data visualization for high-density information transfer in social network analysis tools","year":2009,"lang":"en","type":"article","venue":"QUT ePrints (Queensland University of Technology)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"WSP (Canada)","funders":"","keywords":"Computer science; Visualization; Social network analysis; Relevance (law); Knowledge management; Data science; Focus (optics); Data visualization; New product development; Information visualization; Product (mathematics); Software; World Wide Web; Data mining; Social media","score_opus":0.013585144463356713,"score_gpt":0.2459878433270238,"score_spread":0.2324026988636671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598423130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42484662,0.0000028121121,0.5742632,0.00026776077,0.000008823495,0.00019396715,0.000057300855,0.00008318655,0.0002763174],"genre_scores_gemma":[0.99225974,0.000004062465,0.0070036543,0.000014030134,0.000042462805,5.833099e-7,0.0006535708,0.0000032399303,0.00001867082],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992105,0.000025181413,0.00022953878,0.00023872523,0.000093634015,0.00020243198],"domain_scores_gemma":[0.99930036,0.000025309535,0.00013786493,0.00040330345,0.00011308494,0.00002005366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002458828,0.00011311048,0.00034328626,0.0005080918,0.00017164183,0.000020049769,0.00047264094,0.00012618188,0.00005702721],"category_scores_gemma":[0.000009297751,0.00013654726,0.00010985768,0.0012106098,0.00005803132,0.00043821364,0.0001401946,0.00012743665,0.0000023090463],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020231075,0.00022564016,0.26572576,0.000023490784,0.00076767546,0.0000020034083,0.00033324963,0.0011347377,0.00043195763,0.2769904,0.0018299203,0.45233285],"study_design_scores_gemma":[0.0033236772,0.00019812935,0.79928136,0.00005748971,0.0022003,4.242359e-7,0.0012669145,0.08241277,0.0028451392,0.098143436,0.009379361,0.00089099247],"about_ca_topic_score_codex":0.00070549763,"about_ca_topic_score_gemma":0.00032522096,"teacher_disagreement_score":0.5674131,"about_ca_system_score_codex":0.000038871156,"about_ca_system_score_gemma":0.000028258428,"threshold_uncertainty_score":0.55682355},"labels":[],"label_agreement":null},{"id":"W1598687569","doi":"","title":"Re-ranking search results using network analysis a case study with google: a case study with Google","year":2002,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Relevance (law); Ranking (information retrieval); Computer science; Information retrieval; Search engine; Network analysis; Web crawler; Webometrics; Set (abstract data type); Hyperlink; Selection (genetic algorithm); Adjacency matrix; Data mining; Web page; World Wide Web; Machine learning; Theoretical computer science; Engineering","score_opus":0.15995180505773637,"score_gpt":0.42511381292109385,"score_spread":0.2651620078633575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598687569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99092054,0.0002568754,0.0018162314,0.00030650626,0.000036947982,0.0057843393,0.00018679118,0.00004234283,0.00064939365],"genre_scores_gemma":[0.99649495,0.000017237273,0.0022722022,0.000005199976,0.00012392693,0.00040630263,0.00000702737,0.000044650165,0.00062848075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.9943806,0.001664157,0.0007385958,0.0010506477,0.0011876652,0.000978327],"domain_scores_gemma":[0.990329,0.0018039368,0.0004946999,0.0013208804,0.0059019546,0.00014947854],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0020180456,0.00047808746,0.001174305,0.0004364645,0.0020728642,0.00018861654,0.0005765024,0.000039016075,0.00004639103],"category_scores_gemma":[0.00017262861,0.00030180142,0.00018647742,0.008972927,0.00060132466,0.00020840536,0.00055013335,0.0006283587,0.0000012819675],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009008351,0.010693708,0.2943649,0.00016029771,0.040046718,0.0068691033,0.1898042,0.42684972,0.000121683566,0.0016426704,0.0023024036,0.018136239],"study_design_scores_gemma":[0.004871716,0.005590544,0.0001429852,0.0003672814,0.0014221714,0.000030206735,0.9488492,0.037225094,0.00050191855,0.00024168396,0.0002143495,0.00054286537],"about_ca_topic_score_codex":0.0010269622,"about_ca_topic_score_gemma":0.032629292,"teacher_disagreement_score":0.759045,"about_ca_system_score_codex":0.00029419982,"about_ca_system_score_gemma":0.00025557302,"threshold_uncertainty_score":0.99994344},"labels":[],"label_agreement":null},{"id":"W1598789001","doi":"10.3938/jkps.53.3837","title":"Statistical Investigation of Connected Structures of Stock Networks in a Financial Time Series","year":2008,"lang":"en","type":"preprint","venue":"Journal of the Korean Physical Society","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Stock (firearms); Econometrics; Stock market; Stock market index; Variables; Statistics; Economics; Financial economics; Mathematics; Geography","score_opus":0.009350151320491515,"score_gpt":0.2457243093499499,"score_spread":0.23637415802945838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598789001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9871774,0.0000386655,0.012169023,0.00012339848,0.00008737457,0.00020806499,0.00010781732,0.00000792548,0.000080355916],"genre_scores_gemma":[0.99403507,0.000015421336,0.004997319,0.000016030852,0.0008633593,0.0000039208126,0.000038197777,0.000018270566,0.000012419564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815935,0.00023396344,0.0008300896,0.00017344618,0.0004156436,0.00018753432],"domain_scores_gemma":[0.9974146,0.00024286787,0.0016585283,0.0003186182,0.00029990103,0.00006551264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023672104,0.0002428329,0.0009592909,0.000038512473,0.00005604218,0.000016094606,0.00052346295,0.00012920702,0.000029133535],"category_scores_gemma":[0.000037665435,0.00017280065,0.0009825488,0.00029399534,0.00044982968,0.0000719013,0.0004135264,0.0011295377,1.5608066e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011187969,0.002532563,0.2523561,0.00076674233,0.005650263,0.000013071489,0.01982353,0.41075242,0.021860054,0.110749446,0.14966574,0.024711272],"study_design_scores_gemma":[0.00089029444,0.0002314037,0.22209622,0.00071336597,0.0005735865,0.0000051263173,0.00012255063,0.09009122,0.010148505,0.67460173,0.000059237853,0.00046676208],"about_ca_topic_score_codex":0.00013887882,"about_ca_topic_score_gemma":0.00000387708,"teacher_disagreement_score":0.5638523,"about_ca_system_score_codex":0.000073090974,"about_ca_system_score_gemma":0.00030805328,"threshold_uncertainty_score":0.7046606},"labels":[],"label_agreement":null},{"id":"W1603323476","doi":"10.1007/11527954_15","title":"Algorithmic Foundations of the Internet:Foreword","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; The Internet; World Wide Web","score_opus":0.013083527159608725,"score_gpt":0.259365659742581,"score_spread":0.2462821325829723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603323476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021490728,0.00006171389,0.9856761,0.00021500544,0.00026341365,0.00021517156,0.0000068399922,0.00002653182,0.013320333],"genre_scores_gemma":[0.9120623,0.0000032822443,0.08527131,0.000161575,0.0009782295,0.000008095813,0.000009996206,0.00002294587,0.0014823001],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861085,0.000015089045,0.00034793626,0.00044133983,0.00035631735,0.00022847015],"domain_scores_gemma":[0.9987255,0.00013318783,0.000271692,0.00071248057,0.000121271565,0.00003586734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021760564,0.00023313894,0.00029774162,0.00023285748,0.00009402754,0.000082634375,0.0012789586,0.00006912074,0.0003843983],"category_scores_gemma":[0.000005136265,0.00017271617,0.00021049268,0.0003131558,0.000566034,0.00008944502,0.00060771813,0.00043986458,0.000010555246],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010894782,0.0000201291,0.00091095024,0.000004264731,0.000028496608,3.750367e-7,0.00016981823,0.006987277,0.000026046986,0.043083925,0.00008423743,0.9486834],"study_design_scores_gemma":[0.00015601097,0.000052661246,0.0006014321,0.00047374386,0.000059234855,0.000003289516,2.7799337e-7,0.3558066,0.0026849776,0.62049353,0.019144632,0.0005236221],"about_ca_topic_score_codex":0.00009268841,"about_ca_topic_score_gemma":0.00012405706,"teacher_disagreement_score":0.94815975,"about_ca_system_score_codex":0.00009336324,"about_ca_system_score_gemma":0.00016620386,"threshold_uncertainty_score":0.70431614},"labels":[],"label_agreement":null},{"id":"W1605301763","doi":"10.1007/978-3-540-79721-0_89","title":"VisoLink: A User-Centric Social Relationship Mining","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Popularity; Computer science; World Wide Web; Visualization; Social network (sociolinguistics); Ranking (information retrieval); Social network service; Enhanced Data Rates for GSM Evolution; Data science; Service (business); Order (exchange); Social media; Information retrieval; Data mining; Artificial intelligence; Psychology; Social psychology","score_opus":0.02499464992974731,"score_gpt":0.2676699473180763,"score_spread":0.242675297388329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605301763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011754794,0.00015180578,0.9864559,0.00016776635,0.00022511966,0.00020082158,0.000006266666,0.00010052243,0.011516324],"genre_scores_gemma":[0.92228395,0.0000069047333,0.07490229,0.0001720564,0.0019093893,0.000008529474,0.000029940917,0.000038230406,0.00064873276],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788237,0.000027780576,0.00040756052,0.0007422998,0.00049574947,0.00044425443],"domain_scores_gemma":[0.99871534,0.00035344184,0.0002807164,0.0004437383,0.00012959268,0.00007715216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026375917,0.000351321,0.00043711293,0.00058479246,0.0004805305,0.00014746083,0.00079993857,0.00015871701,0.00013573351],"category_scores_gemma":[0.000013253096,0.00035767356,0.00021628391,0.0005909359,0.00041027408,0.0001438713,0.0003965848,0.000673425,0.000026405402],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010048532,0.000079287776,0.02696933,0.000017438959,0.000073198564,0.00003654742,0.0021497444,0.01314506,0.0000152246375,0.03719309,0.0019060745,0.91840494],"study_design_scores_gemma":[0.0011111397,0.00021783092,0.012923403,0.00081651134,0.00021066879,0.000038525923,0.0000021178505,0.39504012,0.00039256705,0.53115326,0.054529008,0.00356481],"about_ca_topic_score_codex":0.000027082324,"about_ca_topic_score_gemma":0.000017465287,"teacher_disagreement_score":0.9211084,"about_ca_system_score_codex":0.00014773404,"about_ca_system_score_gemma":0.0002573223,"threshold_uncertainty_score":0.9998875},"labels":[],"label_agreement":null},{"id":"W1621366770","doi":"10.1103/physreve.72.036117","title":"Phase transition in random catalytic networks","year":2005,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Austrian Science Fund; Science Foundation Ireland","keywords":"Crossover; Statistical physics; Phase transition; Quadratic equation; Set (abstract data type); Nonlinear system; Similarity (geometry); Mathematics; Applied mathematics; Computer science; Physics; Thermodynamics; Quantum mechanics","score_opus":0.013510931447267432,"score_gpt":0.33059019173688453,"score_spread":0.3170792602896171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1621366770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34191245,0.05370889,0.53952885,0.007003374,0.00010708704,0.0038475946,0.000041495514,0.0004910419,0.05335923],"genre_scores_gemma":[0.9977155,0.0007332807,0.00016496501,0.00039383917,0.00077301974,0.000099110795,0.00008730541,0.000012502984,0.000020528172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912673,0.000073125106,0.0002715688,0.00020673018,0.000111574314,0.00021028426],"domain_scores_gemma":[0.9995353,0.000073990086,0.00006753957,0.00023947953,0.000022395394,0.00006127582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017494784,0.00014075199,0.00045306858,0.000030040545,0.00002963857,0.000014517109,0.00012806818,0.00000998604,0.00022170319],"category_scores_gemma":[0.0000035963915,0.00012263704,0.00026354907,0.00034717025,0.000024084497,0.00011712673,0.000019665853,0.00017466689,0.00006774421],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033440174,0.0020883146,0.000116622614,0.00011228959,0.000064472966,0.0000017360501,0.00011062784,0.0019795208,0.00017531241,0.01434866,0.005245195,0.9757238],"study_design_scores_gemma":[0.008132925,0.00018924903,0.00019705777,0.00315622,0.000739275,0.0000014838652,0.000016753977,0.8491713,0.001227666,0.023543634,0.112643674,0.0009807781],"about_ca_topic_score_codex":0.00004457309,"about_ca_topic_score_gemma":0.000009032639,"teacher_disagreement_score":0.974743,"about_ca_system_score_codex":0.00002624978,"about_ca_system_score_gemma":0.000014022416,"threshold_uncertainty_score":0.5000993},"labels":[],"label_agreement":null},{"id":"W1623375142","doi":"10.1007/978-3-319-15168-7_43","title":"Generalized Friendship Paradox: An Analytical Approach","year":2015,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Friendship; Popularity; Node (physics); Quality (philosophy); Degree (music); Social network (sociolinguistics); Distribution (mathematics); Degree distribution; Social psychology; Psychology; Computer science; Mathematics; Social media; Epistemology; Complex network; Combinatorics; Physics","score_opus":0.04538740260786307,"score_gpt":0.32308889194688756,"score_spread":0.2777014893390245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1623375142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10372279,0.00007447805,0.89486325,0.000120171,0.00030347132,0.00027859167,0.000009760862,0.00013178929,0.0004957013],"genre_scores_gemma":[0.6799845,7.3361423e-7,0.31878892,0.000111237096,0.000987357,0.000031374464,0.000077947974,0.000017079707,8.756834e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641263,0.00020170723,0.00048440983,0.0015035826,0.0007208594,0.0006767967],"domain_scores_gemma":[0.99755615,0.00010292379,0.00021199722,0.0015777999,0.00025122357,0.00029991174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013323387,0.0004573706,0.00069535116,0.00047700937,0.0001423935,0.00056394504,0.0021637615,0.00016981277,0.000055386838],"category_scores_gemma":[0.000022260447,0.00040625414,0.00020224517,0.001379368,0.000491812,0.0001965757,0.001973065,0.0010512462,0.000005981604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012857955,0.00032158304,0.019269995,0.00001688845,0.000046528028,0.000006181823,0.00068307435,0.7471147,0.00003215939,0.008061521,0.00010510802,0.22432937],"study_design_scores_gemma":[0.00013560995,0.000032670952,0.0005372797,0.000027462582,0.00002515459,0.0000016002771,8.854254e-7,0.77718306,0.0002671501,0.2213572,0.00006017168,0.00037179253],"about_ca_topic_score_codex":0.00045323622,"about_ca_topic_score_gemma":0.000022954551,"teacher_disagreement_score":0.5762617,"about_ca_system_score_codex":0.00017141002,"about_ca_system_score_gemma":0.00051642145,"threshold_uncertainty_score":0.99983895},"labels":[],"label_agreement":null},{"id":"W164646593","doi":"","title":"Finding experts by link prediction in co-authorship networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Link (geometry); Computer science; Vocabulary; Data science; Link analysis; Information retrieval","score_opus":0.016481914413777575,"score_gpt":0.300593696895817,"score_spread":0.28411178248203944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164646593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11771812,0.00007399439,0.81145114,0.000070828486,0.00007658519,0.00014762027,0.0000033029644,0.00015621242,0.07030219],"genre_scores_gemma":[0.9965634,0.0000022481045,0.0010488544,0.00005127952,0.00067973445,0.000015255402,0.00011518026,0.000014173675,0.0015099001],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903214,0.000035252328,0.00028992453,0.00021152607,0.0001114428,0.00031972662],"domain_scores_gemma":[0.99957675,0.00008964688,0.00006203835,0.00018041699,0.000017988386,0.00007318288],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005364234,0.000117927826,0.00015095771,0.00011091631,0.00006620254,0.00003781139,0.000113406284,0.00006530136,0.0010480615],"category_scores_gemma":[0.0000023122097,0.00011458014,0.00007390568,0.0003023388,0.000019103976,0.000087041764,0.00003038402,0.00018026038,0.000009899009],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018013165,0.000103873055,0.7839505,0.0000016481129,0.000042289612,0.0000020842897,0.00025309814,0.0013601738,0.0005714382,0.0072312336,0.11366057,0.092805065],"study_design_scores_gemma":[0.0023281411,0.0002826333,0.13252082,0.00025423188,0.00012310727,0.0000032000755,0.0019537923,0.55266035,0.036451798,0.030575465,0.24078277,0.0020636688],"about_ca_topic_score_codex":0.000236559,"about_ca_topic_score_gemma":0.00004780338,"teacher_disagreement_score":0.8788453,"about_ca_system_score_codex":0.000042474734,"about_ca_system_score_gemma":0.00000657122,"threshold_uncertainty_score":0.9998651},"labels":[],"label_agreement":null},{"id":"W1648113946","doi":"10.48550/arxiv.1404.5874","title":"Using Triangles to Improve Community Detection in Directed Networks","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Weighting; Computer science; Directed graph; Partition (number theory); Graph; Metric (unit); Theoretical computer science; Combinatorics; Mathematics; Algorithm","score_opus":0.07402897683819298,"score_gpt":0.22228997969983308,"score_spread":0.1482610028616401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1648113946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5323288,0.000005569107,0.46620187,0.000003325064,0.00012948926,0.00026427122,0.000007903961,0.00013546098,0.00092336145],"genre_scores_gemma":[0.9988342,0.0000040013338,0.00062001095,0.000019466217,0.00027428436,0.000003367456,0.000051108833,0.0000315723,0.00016202361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817085,0.000640495,0.000267976,0.000536951,0.00004584142,0.00033788613],"domain_scores_gemma":[0.99841267,0.00013611894,0.00026690535,0.0009480157,0.00011299627,0.0001232696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004499125,0.00031746313,0.0005134289,0.00037682697,0.00021676102,0.00006607487,0.0006005263,0.00019125953,0.00005944683],"category_scores_gemma":[0.000012687898,0.00040053952,0.00027127803,0.0007817121,0.00005004323,0.00008013184,0.0010870283,0.0012280538,0.000007580162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009895642,0.0001865539,0.019149695,0.000022356648,0.00019166003,0.000006933398,0.00012773678,0.9677238,0.00038780598,0.0026862882,0.00008313947,0.0093351165],"study_design_scores_gemma":[0.00037153027,0.000038102076,0.0024434172,0.00011071185,0.0001652819,1.3521141e-7,0.00012611235,0.9768313,0.00048377117,0.01883083,0.00015473783,0.00044407125],"about_ca_topic_score_codex":0.010205585,"about_ca_topic_score_gemma":0.0017320857,"teacher_disagreement_score":0.4665054,"about_ca_system_score_codex":0.0002819163,"about_ca_system_score_gemma":0.00004628269,"threshold_uncertainty_score":0.9998447},"labels":[],"label_agreement":null},{"id":"W1680403736","doi":"10.1137/1.9781611972771.67","title":"Sketching Landscapes of Page Farms","year":2007,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Web page; Page view; Computer science; World Wide Web; Sketch; PageRank; Static web page; Information retrieval; Web development; Algorithm","score_opus":0.007232030906435289,"score_gpt":0.26416086004425604,"score_spread":0.2569288291378207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1680403736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49967825,0.000017010943,0.27034226,0.00002082324,0.000013718474,0.000041415755,0.0000012825433,0.000054507167,0.22983074],"genre_scores_gemma":[0.9940725,5.1899804e-7,0.005251205,0.000012947455,0.000118239295,0.000001047755,0.000006669852,0.000005180867,0.0005316886],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956566,0.000007244274,0.00015666326,0.00008059046,0.00007107499,0.000118760865],"domain_scores_gemma":[0.9997154,0.000048957467,0.00005306131,0.00013433855,0.000022473962,0.00002578445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020364161,0.000055465298,0.0001122552,0.00004924604,0.000024511592,0.000007990252,0.00008800769,0.000010337545,0.00083380233],"category_scores_gemma":[8.880078e-7,0.000044707373,0.00008125879,0.00012055635,0.000008652547,0.00003213712,0.000035925867,0.000048389935,0.0000063288862],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011108019,0.00015364612,0.5683083,0.000007164569,0.00015480723,0.0000012838852,0.00029467558,0.000049842023,0.012575315,0.22747722,0.0046383445,0.18632832],"study_design_scores_gemma":[0.0015195083,0.00021607986,0.122158095,0.00011905828,0.00028793077,0.000001917612,0.0036615252,0.015788687,0.51414436,0.2261324,0.11452029,0.0014501737],"about_ca_topic_score_codex":0.00023135071,"about_ca_topic_score_gemma":0.000041817293,"teacher_disagreement_score":0.50156903,"about_ca_system_score_codex":0.000003202062,"about_ca_system_score_gemma":0.0000041663543,"threshold_uncertainty_score":0.9129551},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007366537962974608,"score_gpt":0.2519133967675395,"score_spread":0.2445468588045649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1700368447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98537725,0.00002822081,0.011501359,0.000054453274,0.000016504358,0.00009784179,0.00003208444,0.00001032469,0.002881971],"genre_scores_gemma":[0.9993876,5.935202e-7,0.00049627014,0.000008593476,0.00003837233,0.000008925529,0.000030623636,0.000006174634,0.00002283557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993517,0.0001235018,0.00024525353,0.000073809686,0.00009980339,0.000105936924],"domain_scores_gemma":[0.99959034,0.000043220476,0.00012505337,0.00019097856,0.0000362316,0.000014156233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001514082,0.00008183289,0.00019519273,0.000038032176,0.000050999173,0.00000898769,0.000191142,0.000020928788,0.00058001885],"category_scores_gemma":[4.1191743e-7,0.00006537403,0.00006659827,0.00008329841,0.000063042564,0.000034687215,0.000026299964,0.0000902203,7.0462943e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009421218,0.0015130641,0.0666377,0.000047970218,0.00041072036,1.297526e-7,0.07504045,0.000028014094,0.03890514,0.501338,0.0014483993,0.31453618],"study_design_scores_gemma":[0.0027108237,0.0029046074,0.094484024,0.00021996688,0.0003747325,7.160494e-7,0.23645496,0.048132066,0.023984907,0.5777681,0.011867205,0.0010979006],"about_ca_topic_score_codex":0.0012961322,"about_ca_topic_score_gemma":0.0005160373,"teacher_disagreement_score":0.3134383,"about_ca_system_score_codex":0.0000022842191,"about_ca_system_score_gemma":0.000006323729,"threshold_uncertainty_score":0.6350799},"labels":[],"label_agreement":null},{"id":"W1707330547","doi":"","title":"Predict the Position of Actors in Social Networks Using Centrality Metrics","year":2014,"lang":"en","type":"article","venue":"Journal of academic and applied studies","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Centrality; Betweenness centrality; PageRank; Network science; Closeness; Katz centrality; Social network analysis; Social network (sociolinguistics); Computer science; Network theory; Theoretical computer science; Artificial intelligence; Complex network; Social media; Mathematics; World Wide Web; Statistics","score_opus":0.03629283739309859,"score_gpt":0.32865233755521706,"score_spread":0.2923595001621185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1707330547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9747429,0.00096404,0.023613911,0.00018680921,0.000036344863,0.00006832421,0.0000014789954,0.0000034625193,0.0003827443],"genre_scores_gemma":[0.9987215,0.00026480263,0.00028102618,0.000028441924,0.00069698243,0.0000011366633,5.6858136e-7,0.0000040307073,0.0000015453248],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99919707,0.000060799153,0.0004155864,0.000063715444,0.00014154012,0.00012128742],"domain_scores_gemma":[0.9992298,0.00017955842,0.0004838277,0.00003960374,0.00004705168,0.000020182064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000649657,0.00008086169,0.00032644867,0.00007492257,0.00010990115,0.0000068996524,0.00010381852,0.000043695418,0.0000018084868],"category_scores_gemma":[0.000009501049,0.00005229245,0.000077365155,0.00025663475,0.00009915311,0.000046259876,0.00006557482,0.0004170978,2.238043e-8],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022250149,0.00017259516,0.7581665,0.000065268134,0.0017872801,6.07599e-7,0.0050992165,0.010198112,0.0052762222,0.09514308,0.005203485,0.11866514],"study_design_scores_gemma":[0.004673659,0.00039568808,0.59455866,0.00073903723,0.0030448332,0.000013703783,0.025673864,0.066839434,0.01200716,0.2872285,0.003670028,0.001155419],"about_ca_topic_score_codex":0.00000670613,"about_ca_topic_score_gemma":4.1331904e-7,"teacher_disagreement_score":0.19208542,"about_ca_system_score_codex":0.000021799922,"about_ca_system_score_gemma":0.000009865853,"threshold_uncertainty_score":0.21324241},"labels":[],"label_agreement":null},{"id":"W1735861005","doi":"10.16995/dscn.45","title":"Anna Munster. An Aesthesia of Networks: Conjunctive Experience in Art and Technology. Cambridge, MA: MIT Press. 2013. ISBN: 9780262018951 (hardcover)","year":2015,"lang":"en","type":"article","venue":"Digital Studies / Le champ numérique","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Representation (politics); Variety (cybernetics); Art history; Computer science; History; Sociology; Artificial intelligence; Political science; Law","score_opus":0.03184968580466924,"score_gpt":0.2829127350074767,"score_spread":0.2510630492028075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1735861005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9793499,0.0054789637,0.004080972,0.00039045388,0.00006893637,0.0005072307,0.00004530704,0.00013762208,0.009940623],"genre_scores_gemma":[0.9987394,0.00028447568,0.00008579504,0.00004222489,0.00012581106,0.00019712468,0.00004223458,0.000031202686,0.00045171476],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99833536,0.00006371535,0.00047526316,0.00053140405,0.0001875709,0.0004067094],"domain_scores_gemma":[0.9987652,0.000067335044,0.00025355042,0.00047189245,0.00032168525,0.00012037478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020308037,0.0003437398,0.0006995773,0.00014520515,0.00007801207,0.000085779175,0.00030804944,0.00009790652,0.0000033247802],"category_scores_gemma":[0.00002749126,0.00032328174,0.000091228976,0.00044885892,0.00054781314,0.0006632506,0.00042748978,0.00023200212,0.0000043616405],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005048196,0.002497303,0.66686946,0.000104842075,0.0018276573,0.00008409157,0.1129505,0.0017113677,0.00020845553,0.0097206235,0.15764947,0.045871407],"study_design_scores_gemma":[0.0042122086,0.0019642178,0.006800601,0.00071526546,0.000011022635,0.00003122041,0.73121375,0.010996603,0.005783678,0.034500413,0.20096323,0.002807795],"about_ca_topic_score_codex":0.00026815245,"about_ca_topic_score_gemma":0.000095844196,"teacher_disagreement_score":0.66006887,"about_ca_system_score_codex":0.00005510437,"about_ca_system_score_gemma":0.000048061505,"threshold_uncertainty_score":0.9999219},"labels":[],"label_agreement":null},{"id":"W1740881022","doi":"","title":"Modeling content hotness dynamics in networks","year":2010,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Popularity; Computer science; Markov chain; The Internet; Focus (optics); Content distribution; World Wide Web; Machine learning; Computer network","score_opus":0.019270088265800924,"score_gpt":0.23984521651404894,"score_spread":0.22057512824824801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1740881022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20870116,0.00023055437,0.76678216,0.0012562006,0.00015012389,0.00037954873,0.000033531607,0.00016913215,0.022297563],"genre_scores_gemma":[0.9713322,0.00008480343,0.025619427,0.00002682479,0.00007713896,0.00014139485,0.001268427,0.000059184506,0.0013906104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572337,0.0020118416,0.00072360353,0.0007998993,0.00029263532,0.00044867868],"domain_scores_gemma":[0.99550384,0.00047913796,0.00040304475,0.002145563,0.0013236998,0.00014470262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035110954,0.00040577163,0.0005800336,0.00024146162,0.00020288037,0.00037432168,0.0013469056,0.00030525605,0.00019821254],"category_scores_gemma":[0.000096198746,0.0004557297,0.00034312063,0.00038673216,0.00012951824,0.000097803124,0.0016863686,0.0017662286,0.000007670657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002019862,0.0013016041,0.055398352,0.00008546589,0.00028763007,0.0000053584536,0.002379173,0.10284812,0.00029946765,0.6975689,0.00031106334,0.13949469],"study_design_scores_gemma":[0.00023826586,8.8371266e-8,0.0005082625,0.0007670746,0.00004510445,5.8208065e-7,0.00012351084,0.979761,0.0006392005,0.017242473,0.00026966276,0.00040475026],"about_ca_topic_score_codex":0.011665643,"about_ca_topic_score_gemma":0.01814779,"teacher_disagreement_score":0.8769129,"about_ca_system_score_codex":0.00019537735,"about_ca_system_score_gemma":0.0001599381,"threshold_uncertainty_score":0.9997894},"labels":[],"label_agreement":null},{"id":"W1756750362","doi":"10.1016/j.chaos.2015.06.004","title":"Multiplex networks with intrinsic fitness: Modeling the merit-fame interplay via latent layers","year":2015,"lang":"en","type":"article","venue":"Chaos Solitons & Fractals","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Homogeneity (statistics); Fitness function; Multiplex; Computer science; Mathematics; Mathematical optimization; Statistics; Biology; Bioinformatics","score_opus":0.025096492895990585,"score_gpt":0.2756005664918236,"score_spread":0.250504073595833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1756750362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3972778,0.00041161606,0.5984111,0.00052983453,0.00021519908,0.00057000376,0.000013260885,0.0002460936,0.002325102],"genre_scores_gemma":[0.99668723,0.000012600757,0.0015587028,0.00018354865,0.0011031444,0.00016772286,0.00008426208,0.00006213247,0.00014063952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803656,0.00013016685,0.0004580507,0.000454668,0.00031935892,0.0006011938],"domain_scores_gemma":[0.9983595,0.00013688217,0.00023121547,0.0008032358,0.00022941102,0.0002397323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004093261,0.00037663517,0.00048455637,0.00009959733,0.00022936327,0.00015798044,0.0005573461,0.00008050447,0.00015430781],"category_scores_gemma":[0.000010803167,0.00025471754,0.00022187458,0.00040957527,0.00014897893,0.00024091011,0.00026139434,0.00050724973,0.000042978118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032033757,0.0006527419,0.052573692,0.000022186769,0.0016303277,0.000026940472,0.004241286,0.83995694,0.0006275122,0.0050095078,0.010245945,0.08469258],"study_design_scores_gemma":[0.00055176223,0.000092604714,0.00018046027,0.000099421806,0.00015797181,0.000006571232,0.000907844,0.9895517,0.00045384737,0.003645111,0.0038783643,0.00047433842],"about_ca_topic_score_codex":0.001283486,"about_ca_topic_score_gemma":0.000099805526,"teacher_disagreement_score":0.59940946,"about_ca_system_score_codex":0.000084911735,"about_ca_system_score_gemma":0.00007915291,"threshold_uncertainty_score":0.9999905},"labels":[],"label_agreement":null},{"id":"W176300518","doi":"10.1007/978-3-642-35725-1_3","title":"Social Media Annotation and Tagging Based on Folksonomy Link Prediction in a Tripartite Graph","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Folksonomy; Computer science; Information retrieval; Metadata; Social media; Graph; World Wide Web; Annotation; tf–idf; Process (computing); Data mining; Artificial intelligence; Theoretical computer science; Term (time)","score_opus":0.014069718217494559,"score_gpt":0.24389403779240484,"score_spread":0.22982431957491029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176300518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019997596,0.000037094775,0.9939427,0.00042082212,0.00017363843,0.0003289828,0.000009195886,0.0000606328,0.0030271998],"genre_scores_gemma":[0.9782054,0.0000021456199,0.02044374,0.0002191091,0.0009967469,0.000032800603,0.00004918224,0.000019724615,0.00003116331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839956,0.00003069486,0.00033612104,0.0006258537,0.00032631046,0.00028148192],"domain_scores_gemma":[0.99910694,0.00031978622,0.00019647578,0.00024157845,0.00007924743,0.000055987042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003652288,0.00026933887,0.00033595337,0.0007673152,0.0001429976,0.00017413058,0.00027527352,0.00011775801,0.00007989605],"category_scores_gemma":[0.0000082904935,0.00026397314,0.00008928426,0.00037732715,0.000240616,0.00017457338,0.00010504152,0.00048181223,0.000005866137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010212636,0.000028604143,0.0022538374,0.00001140246,0.000011438885,0.0000024524818,0.00072178623,0.01892349,0.000033810575,0.008522291,0.00010828175,0.9693724],"study_design_scores_gemma":[0.00035933751,0.00005965772,0.0025580884,0.00026710556,0.000019149682,3.406457e-7,6.0815637e-7,0.8037166,0.00015570504,0.19161634,0.00091976277,0.0003272938],"about_ca_topic_score_codex":0.000051641142,"about_ca_topic_score_gemma":0.000060769988,"teacher_disagreement_score":0.97620565,"about_ca_system_score_codex":0.000093879455,"about_ca_system_score_gemma":0.00009579692,"threshold_uncertainty_score":0.9999812},"labels":[],"label_agreement":null},{"id":"W1763088598","doi":"10.1103/physreve.84.066117","title":"Clustering drives assortativity and community structure in ensembles of networks","year":2011,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Assortativity; Cluster analysis; Homophily; Community structure; Transitive relation; Computer science; Clustering coefficient; Complex network; Statistical physics; Artificial intelligence; Physics; Mathematics; Combinatorics","score_opus":0.032661833035116494,"score_gpt":0.31157149637611137,"score_spread":0.2789096633409949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763088598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98857075,0.0019447614,0.006980052,0.000010780125,0.0000079018655,0.00017759735,0.000006868636,0.000016796728,0.0022844772],"genre_scores_gemma":[0.99870306,0.00037623628,0.0008224462,0.000025181007,0.000043105076,0.000010364629,0.000009734497,0.0000074683667,0.000002375467],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992,0.0003039153,0.00020097736,0.00010710689,0.00006450548,0.00012349967],"domain_scores_gemma":[0.99939984,0.00015987783,0.00012848887,0.00025033654,0.000026318306,0.000035130677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001864391,0.0001136483,0.00043832647,0.000021188238,0.00004571718,0.000005141763,0.00013620767,0.000011409969,0.000058458212],"category_scores_gemma":[0.000010672675,0.000095496085,0.00008942623,0.0001754083,0.00006138139,0.00006558578,0.00013151196,0.00032499112,4.1936056e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002961791,0.0014741989,0.42228854,0.0016563858,0.00031903217,0.0000019547786,0.003997023,0.00022025628,0.0043028444,0.042298425,0.00033394326,0.5230778],"study_design_scores_gemma":[0.0005929846,0.00028367285,0.67097783,0.005971587,0.0005005584,0.0000011066813,0.00032017988,0.05785522,0.005247657,0.25670895,0.0006075951,0.00093263446],"about_ca_topic_score_codex":0.00067209464,"about_ca_topic_score_gemma":0.00016655841,"teacher_disagreement_score":0.52214515,"about_ca_system_score_codex":0.00000559219,"about_ca_system_score_gemma":0.0000052847954,"threshold_uncertainty_score":0.38942173},"labels":[],"label_agreement":null},{"id":"W1765349666","doi":"10.48550/arxiv.1307.4047","title":"Convex relaxation for finding planted influential nodes in a social network","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bipartite graph; Relaxation (psychology); Generative model; Regular polygon; Probabilistic logic; Computer science; Graphical model; Set (abstract data type); Mathematical optimization; Theoretical computer science; Time complexity; Graph; Mathematics; Generative grammar; Algorithm; Artificial intelligence","score_opus":0.06340286974963392,"score_gpt":0.22051102406575526,"score_spread":0.15710815431612135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765349666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7753953,0.000011184097,0.22199044,0.000021382693,0.000136858,0.0005833979,0.000045777142,0.0001008232,0.0017148594],"genre_scores_gemma":[0.99763554,0.0000061595642,0.00059514545,0.000018118171,0.00080165034,0.00001457393,0.00041817024,0.000026646212,0.00048401576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986296,0.0000986914,0.00027347435,0.00057773356,0.0000518978,0.0003685464],"domain_scores_gemma":[0.9990219,0.000118879834,0.0004171627,0.00028227296,0.00010786,0.000051940304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019000033,0.00026487745,0.00043751238,0.00021097416,0.0002111532,0.00007646542,0.00038560914,0.00020576379,0.00021419364],"category_scores_gemma":[0.0000053990802,0.00033515086,0.00031385722,0.00037458647,0.000059419886,0.0001338699,0.00044056762,0.00045122235,0.00001856055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018664922,0.00017269044,0.23947476,0.000087651184,0.00061017316,0.000011306964,0.0003848266,0.31449437,0.000054734985,0.433068,0.009415855,0.0020389913],"study_design_scores_gemma":[0.0011871845,0.000026309022,0.01563931,0.00021191724,0.00033362073,1.4950287e-7,0.00017429442,0.5533709,0.000069027185,0.4267005,0.0015533364,0.0007334592],"about_ca_topic_score_codex":0.0006983447,"about_ca_topic_score_gemma":0.00007230195,"teacher_disagreement_score":0.23887652,"about_ca_system_score_codex":0.00014072562,"about_ca_system_score_gemma":0.00007694335,"threshold_uncertainty_score":0.99991006},"labels":[],"label_agreement":null},{"id":"W177017953","doi":"","title":"GRAPH-THEORETIC MODELS OF SPREAD AND COMPETITION","year":2004,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Voter model; Vertex (graph theory); Competition (biology); Graph; Conjecture; Combinatorics; Mathematics; Mathematical economics; Econometrics; Discrete mathematics; Statistics","score_opus":0.008878358302198738,"score_gpt":0.23083081990431656,"score_spread":0.22195246160211782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177017953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3659358,0.000024769623,0.5801721,0.00005784466,0.000004885079,0.00006007833,0.0000029882067,0.000033338012,0.053708144],"genre_scores_gemma":[0.9935298,0.0000056151107,0.006380933,0.000011592995,0.000022162558,0.0000044067638,0.000009553691,0.0000042147517,0.000031748667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996841,0.00000880022,0.00010313332,0.000086147826,0.00005174099,0.00006605492],"domain_scores_gemma":[0.9997936,0.000012095902,0.00003551353,0.0001111791,0.000025562282,0.0000220483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000043520824,0.00005304326,0.00010318886,0.000041948257,0.000021805912,0.000008022409,0.000044659602,0.000009460886,0.00021009642],"category_scores_gemma":[2.2523393e-7,0.000046668,0.000047457415,0.000086120875,0.000060669554,0.00005159081,0.000025579424,0.000029958723,0.0000016559277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016091277,0.000031631258,0.0011949624,0.0000025483234,0.000016580987,5.8110214e-8,0.000035873487,0.0009304043,0.0003408675,0.9958975,0.000017507677,0.0015305002],"study_design_scores_gemma":[0.00013769182,0.000019651912,0.00026076668,0.000015122077,0.000020019717,1.8703544e-7,0.000041698935,0.0018996254,0.0061522466,0.99137247,0.000026948293,0.000053566386],"about_ca_topic_score_codex":0.00028504376,"about_ca_topic_score_gemma":0.000008465271,"teacher_disagreement_score":0.627594,"about_ca_system_score_codex":0.0000036197525,"about_ca_system_score_gemma":0.000005736925,"threshold_uncertainty_score":0.23004085},"labels":[],"label_agreement":null},{"id":"W1808737093","doi":"","title":"Unveiling Hidden Communities Through Cascading Detection on Network Structures","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Fraction (chemistry); Computer science; Community structure; Function (biology); Process (computing); Data mining; Mathematics; Statistics","score_opus":0.08603557766417128,"score_gpt":0.21642763880364516,"score_spread":0.13039206113947388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1808737093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.733406,0.00011999647,0.24249522,0.000010363056,0.0005026664,0.00031277566,0.000024958343,0.0003239086,0.02280408],"genre_scores_gemma":[0.9973011,0.00003982135,0.00064770656,0.000036248137,0.001391117,0.0000027370545,0.00012432225,0.000048012327,0.0004089247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984395,0.00026807116,0.00024069124,0.00046248702,0.000087927256,0.00050130684],"domain_scores_gemma":[0.99828136,0.00018732475,0.00036331374,0.0009796242,0.00009365646,0.00009474836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019676147,0.00043352676,0.00048056032,0.00013896107,0.000505198,0.00010023486,0.00066925643,0.00021017251,0.0005811156],"category_scores_gemma":[0.0000021756216,0.00049948436,0.00039696152,0.00037389903,0.00011291446,0.00019761983,0.0009035543,0.0011434358,0.000032298245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076289914,0.0000985419,0.029113447,0.0000487841,0.00086123176,0.000010909088,0.0009372968,0.62564445,0.000024666755,0.33652303,0.001071536,0.005589849],"study_design_scores_gemma":[0.0006525943,0.00009831084,0.00492453,0.00051780936,0.0013215794,0.000002399091,0.003453794,0.15996376,0.0016941173,0.8186525,0.006664697,0.002053878],"about_ca_topic_score_codex":0.0031875405,"about_ca_topic_score_gemma":0.00026267112,"teacher_disagreement_score":0.4821295,"about_ca_system_score_codex":0.0001987288,"about_ca_system_score_gemma":0.00005039575,"threshold_uncertainty_score":0.99974567},"labels":[],"label_agreement":null},{"id":"W1814109117","doi":"10.1609/icwsm.v6i1.14267","title":"The Emergence of Conventions in Online Social Networks","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International AAAI Conference on Web and Social Media","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"National Research Foundation","keywords":"Convention; Raising (metalworking); Process (computing); Social media; Social network (sociolinguistics); Early adopter; World Wide Web; Sociology; Internet privacy; Computer science; Political science; Social science; Engineering","score_opus":0.027587365082877922,"score_gpt":0.28481191360971503,"score_spread":0.2572245485268371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814109117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98366976,0.00004393032,0.000083665276,0.0060373372,0.00024831828,0.00007786409,0.000045130382,0.000008449067,0.009785577],"genre_scores_gemma":[0.99932265,0.00006591897,0.000056276436,0.000030767136,0.00034144046,0.000011221958,0.000012788171,0.0000041763788,0.00015474897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992923,0.000011217832,0.0002560802,0.00011569822,0.00022579991,0.00009890684],"domain_scores_gemma":[0.99921995,0.00009479982,0.00021417328,0.000032498807,0.00042512993,0.000013454656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015634533,0.00007225527,0.00014693971,0.000029000294,0.00013181636,0.000033069,0.0003129697,0.000029928398,0.00016769228],"category_scores_gemma":[0.00004066274,0.000052214593,0.000106784966,0.00015954956,0.00016137389,0.00004521119,0.00014931269,0.00016276578,2.817515e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022120117,0.0001518077,0.037371848,0.0000062627764,0.00010010517,9.767011e-8,0.0011362019,0.000003200091,0.0028252746,0.9358451,0.0018459794,0.02069204],"study_design_scores_gemma":[0.0017150041,0.000065514825,0.20586704,0.00048154363,0.00019996561,0.0000013781739,0.029633824,0.04521537,0.012960254,0.69531,0.007937505,0.0006126284],"about_ca_topic_score_codex":0.000023798792,"about_ca_topic_score_gemma":0.00014038142,"teacher_disagreement_score":0.24053508,"about_ca_system_score_codex":0.000009561814,"about_ca_system_score_gemma":0.000057477886,"threshold_uncertainty_score":0.21292493},"labels":[],"label_agreement":null},{"id":"W1815181277","doi":"10.1103/physreve.92.062812","title":"Growing multiplex networks with arbitrary number of layers","year":2015,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Multiplex; Node (physics); Computer science; Homogeneous; Degree (music); Joint (building); Limit (mathematics); Statistical physics; Joint probability distribution; Transient (computer programming); Distributed computing; Topology (electrical circuits); Mathematics; Physics; Mathematical analysis; Engineering; Statistics; Combinatorics; Bioinformatics","score_opus":0.023916876780388036,"score_gpt":0.3238903282491899,"score_spread":0.29997345146880183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1815181277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6825434,0.013553878,0.116337106,0.000984575,0.00012476591,0.0018690969,0.000024121886,0.00044983337,0.18411325],"genre_scores_gemma":[0.9959491,0.00011861661,0.0032168862,0.00021820616,0.00037564672,0.00004307839,0.000026226706,0.000020982454,0.000031250707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907875,0.00007098381,0.00023099747,0.00020349167,0.0002135455,0.0002022418],"domain_scores_gemma":[0.99922436,0.00007850724,0.00014872961,0.00032748908,0.00009606671,0.00012484253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015224678,0.00016203984,0.00051608286,0.000013209094,0.00002412505,0.000010392236,0.00018527149,0.0000105357385,0.00010716891],"category_scores_gemma":[0.0000067951605,0.00011961862,0.000218598,0.00034919506,0.000055786073,0.0001464523,0.000068197,0.00016703024,0.000030117691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012328857,0.002119686,0.25072843,0.0010699515,0.0015421981,0.000013772116,0.0003807216,0.0034173564,0.00045133365,0.4105756,0.04497995,0.2845977],"study_design_scores_gemma":[0.0061313426,0.0010350252,0.010687447,0.024508625,0.0055227815,0.000021257823,0.0006194737,0.34190658,0.008552569,0.33028978,0.26504034,0.0056847553],"about_ca_topic_score_codex":0.000117617456,"about_ca_topic_score_gemma":0.0000013636474,"teacher_disagreement_score":0.33848923,"about_ca_system_score_codex":0.000012989983,"about_ca_system_score_gemma":0.000032079573,"threshold_uncertainty_score":0.48779058},"labels":[],"label_agreement":null},{"id":"W1826088685","doi":"10.1142/s0219525915500186","title":"ESTIMATION OF CONTROL ENERGY AND CONTROL STRATEGIES FOR COMPLEX NETWORKS","year":2015,"lang":"en","type":"article","venue":"Advances in Complex Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Major Research Plan; National Natural Science Foundation of China","keywords":"Controllability; Degree (music); Complex network; Eigenvalues and eigenvectors; Energy (signal processing); Mathematical optimization; Computer science; Control (management); Control theory (sociology); Mathematics; Applied mathematics; Statistics; Physics; Artificial intelligence","score_opus":0.023094317472170417,"score_gpt":0.3001357037728903,"score_spread":0.27704138630071984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1826088685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002468677,0.0026501282,0.991529,0.000026489195,0.00010341075,0.0005032934,0.00006221821,0.00004887475,0.0026079293],"genre_scores_gemma":[0.9960755,0.00001289431,0.0032398205,0.000026625663,0.00025521597,0.00024344609,0.000110193105,0.000018582969,0.000017688883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985828,0.00013707641,0.0005924792,0.00026078738,0.00015979238,0.00026707904],"domain_scores_gemma":[0.99878407,0.00036616545,0.00036447105,0.00024443152,0.00016261126,0.000078261175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035699582,0.00019673213,0.00064147095,0.00010319491,0.000056806217,0.00006974271,0.00018101776,0.00003846235,0.000011924256],"category_scores_gemma":[0.000008293295,0.00018727774,0.000079600344,0.00018377583,0.00011470935,0.00034074805,0.000027405382,0.000056638066,3.0513255e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009443987,0.000058085145,0.011778951,0.000044821772,0.00007743673,3.6108582e-7,0.00006302962,0.67693686,0.00010362093,0.2904965,0.0009893463,0.019356553],"study_design_scores_gemma":[0.0019347862,0.00011775451,0.0004546953,0.00005090963,0.000041296826,0.0000011437779,0.00051894295,0.94568145,0.000007948588,0.036926705,0.014085446,0.00017892213],"about_ca_topic_score_codex":0.0006354786,"about_ca_topic_score_gemma":0.00013870768,"teacher_disagreement_score":0.99360687,"about_ca_system_score_codex":0.00003308008,"about_ca_system_score_gemma":0.00003930012,"threshold_uncertainty_score":0.76369643},"labels":[],"label_agreement":null},{"id":"W1826423291","doi":"10.1007/978-3-319-14717-8_7","title":"Community Dynamics: Event and Role Analysis in Social Network Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Event (particle physics); Social network analysis; Community structure; Data science; Network analysis; Complex network; Relation (database); Dynamic network analysis; Dynamics (music); Order (exchange); Data mining; World Wide Web; Social media; Sociology; Computer network; Ecology","score_opus":0.008332632787932615,"score_gpt":0.2550819172058235,"score_spread":0.2467492844178909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1826423291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004554852,0.0001122903,0.9918874,0.00011745563,0.000052990123,0.0001691347,0.000015972522,0.000044302968,0.0030455892],"genre_scores_gemma":[0.9837368,0.000005085513,0.015270212,0.00013094759,0.0005538958,0.000009217036,0.00014516023,0.00002104877,0.00012764503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974522,0.00019477135,0.0006014506,0.00077206705,0.00044763004,0.0005319079],"domain_scores_gemma":[0.9981701,0.00037664987,0.00038237587,0.00085890153,0.00011626812,0.00009574932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015188315,0.00044748874,0.0012287177,0.0017344512,0.00048355965,0.00023363098,0.0010618258,0.00017644666,0.0001059986],"category_scores_gemma":[0.000006573054,0.00044878916,0.0005410785,0.0032022146,0.00049164094,0.00008346281,0.0009218596,0.001177352,0.00000256217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072864063,0.000051105,0.1181882,0.000009413635,0.0013924048,0.0000027433537,0.0005694133,0.45758376,0.0000021109313,0.023329802,0.000021663498,0.3988421],"study_design_scores_gemma":[0.00008717515,0.000025674784,0.0134037165,0.000035675163,0.0009861708,2.2402608e-7,0.0000012757716,0.7627664,0.0000037500063,0.22214246,0.00016141558,0.00038604706],"about_ca_topic_score_codex":0.001447078,"about_ca_topic_score_gemma":0.011646186,"teacher_disagreement_score":0.97918195,"about_ca_system_score_codex":0.00025302087,"about_ca_system_score_gemma":0.000078546094,"threshold_uncertainty_score":0.9997964},"labels":[],"label_agreement":null},{"id":"W1837983221","doi":"10.2139/ssrn.2311755","title":"Communication Network Design: Balancing Modularity and Mixing via Optimal Graph Spectra","year":2013,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Computer science; Modularity (biology); Crowdsourcing; Graph; Distributed computing; Theoretical computer science; Focus (optics); Data science; World Wide Web","score_opus":0.011087849808776643,"score_gpt":0.24649235634079525,"score_spread":0.2354045065320186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1837983221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03817997,0.0069624516,0.9535062,0.00018930522,0.00009656928,0.00039822824,0.000002215643,0.0000897358,0.0005753208],"genre_scores_gemma":[0.9085901,0.0023872487,0.08758029,0.00001836737,0.0011504397,0.00004802757,0.00005700591,0.000058296355,0.00011025271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99594164,0.0004950249,0.0006172108,0.0004796798,0.00028837804,0.0021780513],"domain_scores_gemma":[0.9981253,0.0001190288,0.00068943267,0.0007641171,0.00016442938,0.0001376494],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0027716558,0.00045772886,0.0006311902,0.00016656527,0.0005939989,0.0004047301,0.000794903,0.00018234387,0.00012747366],"category_scores_gemma":[0.000005051823,0.00046656132,0.00035518772,0.00022029034,0.00007492883,0.000200381,0.00070978265,0.006257763,0.000006641569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010543064,0.00030641476,0.029343478,0.000055850014,0.0054251533,0.0000043261034,0.0005508662,0.21182027,0.00050467724,0.5074831,0.0027872957,0.2416131],"study_design_scores_gemma":[0.00021699154,0.00006463253,0.0005726886,0.00013976305,0.00025496833,0.000031014846,0.00013764609,0.061790355,0.00006106039,0.93615305,0.00012829823,0.00044953852],"about_ca_topic_score_codex":0.0010123773,"about_ca_topic_score_gemma":0.00013913329,"teacher_disagreement_score":0.8704101,"about_ca_system_score_codex":0.00052453094,"about_ca_system_score_gemma":0.00073007913,"threshold_uncertainty_score":0.9997786},"labels":[],"label_agreement":null},{"id":"W183876417","doi":"10.1007/978-3-642-30904-5_12","title":"Complex Networks and Social Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Mathematics in industry","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Complex network; Computer science; Line (geometry); Sociology; World Wide Web; Mathematics","score_opus":0.04633227479974714,"score_gpt":0.2797685786324912,"score_spread":0.23343630383274408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183876417","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005780111,0.00062865985,0.03780104,0.00011620542,0.00014624711,0.00055638223,0.00003777038,0.00015319443,0.9599825],"genre_scores_gemma":[0.86029434,0.00006711726,0.0054203663,0.00017627218,0.007104591,0.00008864853,0.0005073604,0.00033182857,0.12600946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827635,0.00002431993,0.00066418474,0.00034052844,0.00021870508,0.00047588514],"domain_scores_gemma":[0.9988286,0.00015702599,0.0004624381,0.00041125342,0.000046815992,0.000093866365],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035125925,0.0004960286,0.0008419392,0.00015136958,0.00014318507,0.000087963286,0.00030498073,0.0010158074,0.00335313],"category_scores_gemma":[0.000001634014,0.0005219685,0.00019325178,0.000067069406,0.00017832582,0.000060504964,0.0003635913,0.0024216913,0.000018163602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034612647,0.000107636726,0.0026455962,0.00006038089,0.00027445692,0.00000454069,0.00025582145,0.0004880118,8.0049506e-7,0.94780946,0.019559305,0.028790554],"study_design_scores_gemma":[0.00086864515,0.00004861277,0.00095723115,0.0011956005,0.00095162145,0.000015284455,0.00040890655,0.13428406,0.0000041784465,0.65303344,0.20533958,0.0028928448],"about_ca_topic_score_codex":0.000017261927,"about_ca_topic_score_gemma":0.000009858167,"teacher_disagreement_score":0.85971636,"about_ca_system_score_codex":0.00006802838,"about_ca_system_score_gemma":0.000022880966,"threshold_uncertainty_score":0.9998798},"labels":[],"label_agreement":null},{"id":"W184150090","doi":"10.1007/978-3-7091-0388-3_8","title":"Finding Hidden Links in Terrorist Networks by Checking Indirect Links of Different Sub-Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Order (exchange); Social network analysis; Criminal investigation; Terrorism; Computer security; Government (linguistics); Social network (sociolinguistics); Criminal behaviour; Data science; Criminology; Social media; Political science; World Wide Web; Business; Law; Psychology","score_opus":0.018451525039987957,"score_gpt":0.2532313069170564,"score_spread":0.23477978187706847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184150090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004937186,0.01014865,0.9056946,0.00018846091,0.0014487628,0.0021941236,0.000093130446,0.00038395965,0.074911125],"genre_scores_gemma":[0.9902708,0.00054686435,0.00026793717,0.00015294463,0.0062830956,0.000104986146,0.0011525156,0.00031562577,0.00090525846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99477065,0.0002528655,0.0018563631,0.0012502448,0.00050676684,0.001363136],"domain_scores_gemma":[0.9966086,0.0007502308,0.001597263,0.0007446601,0.00013096134,0.00016826419],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0006369069,0.0014095337,0.0026596505,0.0005364949,0.00029920315,0.00011884748,0.0010290968,0.004380981,0.0006166328],"category_scores_gemma":[0.00001734664,0.0014690411,0.0010206178,0.0005502639,0.0003552149,0.0001044593,0.000568543,0.009250859,0.0000029958594],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036505953,0.0005659962,0.11124656,0.0001251391,0.0019661398,0.00005936739,0.0025404026,0.09430101,0.000030571708,0.013895375,0.009872698,0.7650317],"study_design_scores_gemma":[0.005646097,0.0007600036,0.012724041,0.010201629,0.0029867452,0.000007908065,0.0000873597,0.49023634,0.00091618765,0.44310072,0.02061099,0.012721963],"about_ca_topic_score_codex":0.00041641574,"about_ca_topic_score_gemma":0.0011875422,"teacher_disagreement_score":0.98533356,"about_ca_system_score_codex":0.00041879842,"about_ca_system_score_gemma":0.00007437354,"threshold_uncertainty_score":0.9998655},"labels":[],"label_agreement":null},{"id":"W1850172974","doi":"10.1007/978-3-642-13962-8_23","title":"Spatial Models for Virtual 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":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Spatial network; Theoretical computer science; Cluster analysis; Link (geometry); Spatial analysis; Data mining; Graph; Spatial database; Link analysis; Node (physics); Information retrieval; Artificial intelligence; Geography; Mathematics; Computer network","score_opus":0.013410573460410927,"score_gpt":0.24729299915714067,"score_spread":0.23388242569672973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850172974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003551062,0.000049692913,0.9954633,0.00007763861,0.0007539716,0.0004307291,0.000016405655,0.00007938344,0.0030933388],"genre_scores_gemma":[0.829557,0.000003517575,0.16598739,0.0002353043,0.003774611,0.00003351739,0.00005863928,0.000053880533,0.00029616637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978732,0.000010486977,0.0003781688,0.00088595203,0.0003545647,0.0004976345],"domain_scores_gemma":[0.9984286,0.00032273546,0.00022759882,0.0007322185,0.00018359614,0.00010529455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038815534,0.00041019486,0.00049956253,0.00029957746,0.00023025565,0.00021034983,0.0010862066,0.00023128864,0.00013552966],"category_scores_gemma":[0.0000051232414,0.0003861093,0.00025781084,0.0001679829,0.00044275014,0.00015630151,0.00045841915,0.0008641741,0.000004420322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070917195,0.00001626787,0.000040831837,0.0000028009322,0.000020393642,0.0000011418251,0.000054201206,0.2558128,0.000031947973,0.05074815,0.00003888379,0.6932255],"study_design_scores_gemma":[0.000087725835,0.000052133673,0.000004250539,0.00004707956,0.000016376309,6.126958e-7,3.018049e-8,0.5995749,0.0002094542,0.39848286,0.0012579638,0.00026656318],"about_ca_topic_score_codex":0.00010386458,"about_ca_topic_score_gemma":0.00018903712,"teacher_disagreement_score":0.8295215,"about_ca_system_score_codex":0.000061338425,"about_ca_system_score_gemma":0.00017718172,"threshold_uncertainty_score":0.9998591},"labels":[],"label_agreement":null},{"id":"W1860273176","doi":"10.31235/osf.io/y33dm","title":"A Computational Model of Crowds for Collective Intelligence","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Crowds; Computer science; Collective intelligence; Data science; Computer security; Artificial intelligence","score_opus":0.05098707773768135,"score_gpt":0.34192167107671934,"score_spread":0.290934593339038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860273176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00908877,0.0000016531055,0.95456964,0.000052236883,0.000006883169,0.00012539099,0.000020260335,0.000011890275,0.036123276],"genre_scores_gemma":[0.8645309,1.0000602e-7,0.13401292,0.000007366967,0.000023203806,0.000028875636,0.0000073014116,0.0000037089337,0.0013855784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965554,0.00000384678,0.000114754985,0.00009425563,0.000053510947,0.00007807815],"domain_scores_gemma":[0.99949706,0.000055930675,0.00010968855,0.00017572004,0.0001451465,0.000016484439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007041956,0.00004834667,0.00010998013,0.000025094047,0.00018313692,0.000029987263,0.00018132622,0.000009052025,0.00011193006],"category_scores_gemma":[0.000004858389,0.00004477739,0.00008835296,0.000025030571,0.000051568644,0.000054771765,0.00006005046,0.000023140741,0.0000011702593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019087218,0.00008612195,0.0073300404,0.0000042509564,0.00010685656,1.7666226e-8,0.00013462752,0.16399083,0.00012917489,0.80931497,0.0034294357,0.015454601],"study_design_scores_gemma":[0.000036708247,0.000010556878,0.0002069972,0.0000027211886,0.000008495301,9.2163175e-9,0.000014471211,0.59773684,0.0024506089,0.39947584,0.0000253083,0.00003145397],"about_ca_topic_score_codex":0.000078373494,"about_ca_topic_score_gemma":0.000006633833,"teacher_disagreement_score":0.85544217,"about_ca_system_score_codex":0.000009627337,"about_ca_system_score_gemma":0.000056181085,"threshold_uncertainty_score":0.18259689},"labels":[],"label_agreement":null},{"id":"W1902531515","doi":"10.1103/physreve.83.036110","title":"Random sequential renormalization of networks: Application to critical trees","year":2011,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Statistical physics; Renormalization; Mathematics; Renormalization group; Critical phenomena; Computer science; Physics; Mathematical physics; Quantum mechanics; Phase transition","score_opus":0.024239497935293407,"score_gpt":0.33221481070495845,"score_spread":0.30797531276966505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902531515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028306558,0.000961901,0.9856932,0.00011873417,0.000023170021,0.0004826197,0.0000049704904,0.000053050488,0.009831708],"genre_scores_gemma":[0.99742717,0.00017414191,0.0017121255,0.00011661048,0.00035037057,0.00015860958,0.000038750142,0.00001232199,0.00000988826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991254,0.00008669423,0.0003038559,0.00019548883,0.00013581457,0.00015271195],"domain_scores_gemma":[0.99932736,0.000072774346,0.000099196164,0.00030710036,0.00011446491,0.00007908477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015995871,0.00011569457,0.00038918146,0.00002746769,0.000034830035,0.000006888965,0.0001735085,0.000011056404,0.000308275],"category_scores_gemma":[0.000021024076,0.00010069731,0.00021027477,0.00035838087,0.000039767754,0.0000770613,0.00006445112,0.00006729607,0.000024731142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009463135,0.0011423487,0.006068298,0.0004152463,0.00018991392,5.2392556e-7,0.00026812873,0.0005624325,0.003208456,0.7215693,0.008501053,0.25797966],"study_design_scores_gemma":[0.0026444248,0.0009708925,0.015521104,0.0069687897,0.004614903,0.0000025139236,0.00007618514,0.32095495,0.045442402,0.50877845,0.09117468,0.002850721],"about_ca_topic_score_codex":0.00009040555,"about_ca_topic_score_gemma":0.000003724675,"teacher_disagreement_score":0.99459654,"about_ca_system_score_codex":0.000008769685,"about_ca_system_score_gemma":0.000009709371,"threshold_uncertainty_score":0.41063172},"labels":[],"label_agreement":null},{"id":"W190281733","doi":"10.1007/978-94-007-6359-3_13","title":"A Study of Malware Propagation via Online Social Networking","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Malware; Popularity; Trojan; Computer science; Scripting language; Cross-site scripting; Computer security; World Wide Web; The Internet; Operating system","score_opus":0.021371796911433226,"score_gpt":0.27737542260993997,"score_spread":0.25600362569850676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W190281733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011382981,0.0013640486,0.88510495,0.00036908718,0.001056975,0.005751668,0.0000920321,0.00046948777,0.094408736],"genre_scores_gemma":[0.9832209,0.000011062001,0.0004462608,0.00006557855,0.014214241,0.000082328675,0.0006090835,0.000144014,0.0012065807],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735844,0.00013780917,0.0009424975,0.00061867636,0.00043827883,0.0005043187],"domain_scores_gemma":[0.9982285,0.00019447527,0.0009843069,0.0003186083,0.00022458861,0.000049541635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021206234,0.00063773594,0.0012261943,0.00020622331,0.0003241446,0.00006350844,0.00041924254,0.00062002667,0.00076567737],"category_scores_gemma":[0.0000037401899,0.0006579084,0.0004467651,0.0002987479,0.00013352199,0.0000689219,0.0002588803,0.0015214151,0.0000056293616],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089717454,0.00082029874,0.0085635325,0.000047764162,0.0012004944,0.000013914394,0.003570848,0.026748694,0.000007833131,0.010158468,0.003633631,0.94514483],"study_design_scores_gemma":[0.004751087,0.0012427145,0.00790226,0.0014329507,0.003213202,0.000003543429,0.0005302386,0.15764165,0.000030902134,0.7902789,0.026962394,0.00601015],"about_ca_topic_score_codex":0.00034023353,"about_ca_topic_score_gemma":0.00081776327,"teacher_disagreement_score":0.9718379,"about_ca_system_score_codex":0.00014269106,"about_ca_system_score_gemma":0.00005360376,"threshold_uncertainty_score":0.99958724},"labels":[],"label_agreement":null},{"id":"W1907626704","doi":"10.1109/mascot.2000.876556","title":"The synTraff suite of traffic modeling toolkits","year":2000,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multifractal system; Autoregressive integrated moving average; Computer science; Wavelet; Fractal; Traffic generation model; Suite; Autoregressive model; Gaussian; Artificial intelligence; Real-time computing; Machine learning; Time series; Mathematics; Statistics; Geography","score_opus":0.008166408291719614,"score_gpt":0.2342681402830953,"score_spread":0.2261017319913757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1907626704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93068546,0.00007560051,0.011969314,0.00010810837,0.000010526081,0.000090351714,0.0000020884754,0.00007174883,0.056986794],"genre_scores_gemma":[0.9970552,0.000013150124,0.0006595,0.000010913,0.000090760645,0.000008257039,0.000004238148,0.000007440544,0.0021505503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941576,0.000022121398,0.00020069485,0.000106676875,0.00009799825,0.00015672884],"domain_scores_gemma":[0.9996125,0.0000617604,0.000029356834,0.00023972084,0.00003107247,0.000025560741],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000125708,0.00007457969,0.00011860904,0.000016881731,0.00010316884,0.000030270348,0.00018374785,0.00001203381,0.0019313458],"category_scores_gemma":[7.8509976e-7,0.00004921899,0.000118682496,0.00013632755,0.000025975709,0.000044460292,0.000016284514,0.00006131104,0.000021210719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009425958,0.000055029966,0.00027363948,0.0000015124492,0.000087604916,1.2842486e-7,0.000079962505,0.19785336,0.00007234496,0.024109099,0.0016228625,0.77583504],"study_design_scores_gemma":[0.00007344095,0.0000127924095,0.000039105274,0.000008192437,0.000028549957,1.5428454e-7,0.000075602016,0.98944443,0.00042681472,0.0030874563,0.0067092543,0.0000942064],"about_ca_topic_score_codex":0.00007677449,"about_ca_topic_score_gemma":0.000020117004,"teacher_disagreement_score":0.79159105,"about_ca_system_score_codex":0.0000046879813,"about_ca_system_score_gemma":0.000012722534,"threshold_uncertainty_score":0.998981},"labels":[],"label_agreement":null},{"id":"W1909020983","doi":"10.1111/poms.12521","title":"Design Improvements for Message Propagation in Malleable Social Networks","year":2015,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Alberta","funders":"University of California Merced; University of Minnesota; University of California","keywords":"Computer science; Network topology; Heuristic; Distributed computing; Network planning and design; Cascade; Tree (set theory); Propagation delay; Computer network; Artificial intelligence; Engineering","score_opus":0.03587610350601438,"score_gpt":0.28315792305508086,"score_spread":0.24728181954906647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1909020983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00525148,0.000039623596,0.9903387,0.00088053715,0.00010556523,0.0014631193,0.0000011192344,0.000044553628,0.0018752951],"genre_scores_gemma":[0.97833335,0.00000965141,0.018005138,0.000038849128,0.00030019446,0.0008435978,0.000056091525,0.0000095792,0.0024035624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935883,0.00004308543,0.00016992855,0.00022675205,0.00007760533,0.00012382414],"domain_scores_gemma":[0.9997647,0.0000036984109,0.000032721364,0.000098192875,0.00007582621,0.00002485889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004444549,0.000079936246,0.000089276626,0.00008987181,0.00017449577,0.00008667482,0.000049013193,0.000013715854,0.000022388851],"category_scores_gemma":[0.0000034686914,0.00007923299,0.000020335821,0.0001870524,0.000015046784,0.00018217896,0.00004182215,0.000042424177,0.0000018727352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103806036,0.00059601304,0.0026529208,0.00004035829,0.00022580702,4.758786e-7,0.0009956851,0.46851522,0.00015911255,0.24114533,0.035846036,0.24971923],"study_design_scores_gemma":[0.0014720426,0.00013939869,0.0013620836,0.00003304937,0.00014767038,4.093956e-7,0.0015259376,0.97343296,0.0012590843,0.00910495,0.011091977,0.00043043727],"about_ca_topic_score_codex":0.00003243618,"about_ca_topic_score_gemma":0.000021343263,"teacher_disagreement_score":0.9730818,"about_ca_system_score_codex":0.0000397059,"about_ca_system_score_gemma":0.000010445416,"threshold_uncertainty_score":0.32310277},"labels":[],"label_agreement":null},{"id":"W191866010","doi":"10.1007/978-1-4614-7163-9_402-1","title":"Sociograph Representations, Concepts, Data, and Analysis","year":2017,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Data science","score_opus":0.038410527510379884,"score_gpt":0.3497177849140638,"score_spread":0.3113072574036839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191866010","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013883177,0.0005257648,0.028053405,0.000107562955,0.000021679696,0.00015626087,0.0005409633,0.00008050115,0.9705],"genre_scores_gemma":[0.061436113,0.00027328462,0.004863182,0.00004109079,0.00051288336,0.000013283188,0.008211292,0.00004321799,0.92460567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867874,0.000015475098,0.00030534843,0.0006675223,0.0001855519,0.00014735998],"domain_scores_gemma":[0.99698836,0.00007723189,0.00039768938,0.0023796915,0.00007928338,0.00007776108],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016177379,0.0002641539,0.0005880296,0.0003083298,0.00026241248,0.00020137463,0.0006821246,0.00009060983,0.007214681],"category_scores_gemma":[0.0000020963491,0.00025202264,0.00038310766,0.000040710365,0.00022977506,0.00014250958,0.0006244035,0.00022072505,0.000029627015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028030502,0.000016890752,0.049815267,0.000006093533,0.0106021445,0.0000028029435,0.000047220932,0.0000033699728,0.0000013113544,0.74126196,0.13492374,0.063316375],"study_design_scores_gemma":[0.00016880402,0.0000120545665,0.002048774,0.000030821182,0.009170434,3.1792248e-7,0.000051765106,0.002765246,0.000006213689,0.27139145,0.7136729,0.00068124424],"about_ca_topic_score_codex":0.0006975017,"about_ca_topic_score_gemma":0.00018942794,"teacher_disagreement_score":0.5787491,"about_ca_system_score_codex":0.00000801749,"about_ca_system_score_gemma":0.00002819994,"threshold_uncertainty_score":0.9999932},"labels":[],"label_agreement":null},{"id":"W1953590333","doi":"10.1177/2056305115591178","title":"What Are the Stakes in Doing Critical Research on Social Media Platforms?","year":2015,"lang":"en","type":"article","venue":"Social Media + Society","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Social media; Field (mathematics); Politics; Key (lock); Public relations; Sociology; Social media optimization; Political science; Computer science; World Wide Web; Computer security","score_opus":0.2003550398611114,"score_gpt":0.41715359214199416,"score_spread":0.21679855228088277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953590333","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98103714,0.00043404588,0.0003443688,0.010499275,0.0012539767,0.00045979486,0.00005766615,0.00018411092,0.005729629],"genre_scores_gemma":[0.9933467,0.000030604646,0.00024929122,0.00016614336,0.0059971977,0.00010664027,0.00004771218,0.000033668937,0.000022053071],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99714255,0.00025681345,0.00034090446,0.000362124,0.0011429337,0.00075465033],"domain_scores_gemma":[0.9965223,0.0026867618,0.00009599285,0.00021862934,0.00032770986,0.00014859093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022776246,0.0002130664,0.00039277578,0.00006314065,0.0007663162,0.00030471492,0.00048107916,0.0001816414,0.00012588044],"category_scores_gemma":[0.00021981659,0.00016696441,0.00039977924,0.0007896102,0.00071721716,0.0003426586,0.00022110743,0.0012631904,0.00004137532],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006296188,0.00040860104,0.0045145242,0.000021136131,0.00017632618,0.000006776039,0.48665273,0.000008944094,0.00004649299,0.20656784,0.25420448,0.047329206],"study_design_scores_gemma":[0.0006313697,0.000023160403,0.0025397567,0.00008073942,0.00003950337,1.370934e-7,0.7502478,0.00027553763,0.00015734529,0.23883237,0.006850063,0.00032224704],"about_ca_topic_score_codex":0.00005199145,"about_ca_topic_score_gemma":0.0010681554,"teacher_disagreement_score":0.26359504,"about_ca_system_score_codex":0.0002964628,"about_ca_system_score_gemma":0.00020901312,"threshold_uncertainty_score":0.68086106},"labels":[],"label_agreement":null},{"id":"W1958020823","doi":"10.1002/cjs.11271","title":"Using the bootstrap for statistical inference on random graphs","year":2015,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Mitacs; National Science Foundation","keywords":"Nonparametric statistics; Inference; Statistical inference; Computer science; Sampling distribution; Degree (music); Sample size determination; Sampling (signal processing); Mathematics; Statistics; Data mining; Artificial intelligence","score_opus":0.11296819411451584,"score_gpt":0.34533133128632487,"score_spread":0.23236313717180904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1958020823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052236174,0.000040668383,0.99299,0.00009856046,0.0001541247,0.000119178294,0.00074944145,0.000002569615,0.0006218081],"genre_scores_gemma":[0.9297848,0.0000010365543,0.06984567,0.00007473286,0.0002306296,0.000002706486,0.000022471315,0.000011941829,0.000026012343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916285,0.00006078437,0.00032032156,0.00007407122,0.00015070102,0.00023127552],"domain_scores_gemma":[0.9982829,0.00053637463,0.00021186241,0.00012763908,0.00040564104,0.00043559095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037607577,0.00010204572,0.0002139098,0.00011653532,0.00013914653,0.00009232909,0.00020499766,0.00001892122,0.000121444275],"category_scores_gemma":[0.00013976508,0.00007472791,0.0000669287,0.000112398215,0.000121395904,0.000042345666,0.000005855541,0.00018238275,0.0000016158933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006802542,0.000021426093,0.010954178,0.000005095431,0.00016856373,0.00002468735,0.00031257985,0.0029965998,0.0000091881675,0.88252974,0.08510833,0.017801564],"study_design_scores_gemma":[0.0017975944,0.00041494888,0.0013610946,0.000070904694,0.00033736206,0.000013592755,0.0006346492,0.034429863,0.00007503474,0.9261529,0.034433436,0.0002786115],"about_ca_topic_score_codex":0.0027801103,"about_ca_topic_score_gemma":0.0025359655,"teacher_disagreement_score":0.9245612,"about_ca_system_score_codex":0.00006722221,"about_ca_system_score_gemma":0.0011040579,"threshold_uncertainty_score":0.42027137},"labels":[],"label_agreement":null},{"id":"W195925378","doi":"","title":"UNDERSTANDING THE EVOLUTION OF INFORMATION SYSTEMS RESEARCH FROM THE PERSPECTIVE OF CO-AUTHORSHIP NETWORK: A COMPREHENSIVE DATA ANALYSIS FROM 1993 TO 2012","year":2014,"lang":"en","type":"article","venue":"Journal of the Association for Information Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scientometrics; Ranking (information retrieval); Social network analysis; Data science; Field (mathematics); Elite; Institution; Perspective (graphical); Information system; Network analysis; Computer science; Phenomenon; Bibliometrics; Sociology; Library science; Social science; Political science; World Wide Web; Information retrieval; Engineering; Social media; Epistemology; Mathematics","score_opus":0.12618587036157858,"score_gpt":0.35791260350538806,"score_spread":0.23172673314380948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195925378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018353954,0.0002061055,0.9738946,0.00087386306,0.0006860099,0.0012865305,0.0012128717,0.000013804537,0.0034722572],"genre_scores_gemma":[0.9987416,0.0000035140174,0.00020528481,0.000025244213,0.00069439836,0.000020042175,0.0002690699,0.000005610453,0.00003522154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995711,0.0011888945,0.0015112752,0.000085747786,0.0012758091,0.0002272261],"domain_scores_gemma":[0.98886645,0.002948148,0.004705808,0.0007083245,0.002721291,0.000049962757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00827081,0.00012587654,0.0005069507,0.00033886684,0.00045824194,0.0003120369,0.0011047488,0.00008486684,0.00000589731],"category_scores_gemma":[0.0004727798,0.00007251354,0.0003291657,0.0015580768,0.000046990837,0.0016708103,0.00018896104,0.00033871748,0.0000061495025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019749522,0.000040824056,0.1336128,0.000039454622,0.005685894,9.067377e-9,0.015923083,0.3921939,0.00005159603,0.36455137,0.087414235,0.00028932604],"study_design_scores_gemma":[0.0016334505,0.00019730566,0.10300773,0.0006535294,0.0029833985,9.242378e-7,0.17496364,0.6032588,0.000071553266,0.03999456,0.07287155,0.00036357553],"about_ca_topic_score_codex":0.0066674054,"about_ca_topic_score_gemma":0.00010313673,"teacher_disagreement_score":0.9803877,"about_ca_system_score_codex":0.0012569393,"about_ca_system_score_gemma":0.00013806688,"threshold_uncertainty_score":0.9999473},"labels":[],"label_agreement":null},{"id":"W1965063278","doi":"10.1088/0256-307x/26/8/088901","title":"The Fractal Dimensions of Complex Networks","year":2009,"lang":"en","type":"article","venue":"Chinese Physics Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Particle Physics","funders":"","keywords":"Complex network; Fractal; Fractal dimension; Complex system; Exponent; Small-world network; Computer science; Perspective (graphical); Dimension (graph theory); Function (biology); Statistical physics; Fractal dimension on networks; Topology (electrical circuits); Fractal analysis; Mathematics; Physics; Artificial intelligence; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.009166213929127101,"score_gpt":0.2594683485877035,"score_spread":0.2503021346585764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965063278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8039533,0.00006125156,0.19028082,0.0025895247,0.00009467778,0.00020564623,0.00000860838,0.00009266384,0.0027135042],"genre_scores_gemma":[0.9978347,0.0000043190967,0.0006132478,0.00069012656,0.0007612654,0.000007263619,0.000053573673,0.000013670902,0.000021850148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910045,0.000045391887,0.0002540144,0.00017903408,0.00016514517,0.0002559969],"domain_scores_gemma":[0.9990852,0.00016970588,0.00017225098,0.0004715186,0.000051419927,0.00004988753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093918614,0.00018423579,0.0002553666,0.000021745678,0.00025346596,0.000041727588,0.00031477402,0.000015271487,0.00002925623],"category_scores_gemma":[0.0000028435504,0.000108077125,0.00025752513,0.00036952918,0.00010620126,0.000083233055,0.000066563785,0.00019608978,0.0000057284465],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008930554,0.00091923575,0.15792923,0.000008107372,0.00086840265,0.0000049989394,0.00061829743,0.057569146,0.19786267,0.13626188,0.15289444,0.2949743],"study_design_scores_gemma":[0.0016177624,0.00021893761,0.29284197,0.00010255593,0.00038208414,0.000002321001,0.00013002091,0.37911,0.0051639862,0.30109358,0.017557368,0.00177941],"about_ca_topic_score_codex":0.00003966803,"about_ca_topic_score_gemma":0.0000014938556,"teacher_disagreement_score":0.32154086,"about_ca_system_score_codex":0.000011154343,"about_ca_system_score_gemma":0.000008383233,"threshold_uncertainty_score":0.44072574},"labels":[],"label_agreement":null},{"id":"W1965168371","doi":"10.1007/s11467-009-0047-1","title":"Energy spectrum for a atrongly correlated network and local magnetism","year":2009,"lang":"en","type":"article","venue":"Frontiers of Physics in China","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Magnetism; Statistical physics; Formalism (music); Energy spectrum; Survivability; Physics; Transformation (genetics); Quantum; Computer science; Quantum mechanics","score_opus":0.005984339564086091,"score_gpt":0.22650466742170355,"score_spread":0.22052032785761747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965168371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02147465,0.0007970813,0.9743317,0.00015718146,0.00013273832,0.00017462659,0.000014507737,0.000036479378,0.0028810415],"genre_scores_gemma":[0.9813722,0.000021287431,0.017851941,0.00002820146,0.00046646694,0.000014857227,0.000059114718,0.000017203422,0.00016875517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899715,0.00003082989,0.00027868836,0.00026722322,0.00010375666,0.00032236933],"domain_scores_gemma":[0.9995081,0.00002806688,0.00015413502,0.000234763,0.000022029266,0.00005293351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001039778,0.00018425114,0.00040026483,0.00005410096,0.000059961665,0.000018308441,0.00017081333,0.00004706188,0.000013242872],"category_scores_gemma":[0.0000010148192,0.00019579502,0.00014895562,0.00028440685,0.00008892478,0.00009338853,0.000042446016,0.00014108702,3.0041315e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012398111,0.00027888358,0.03366686,0.000008129007,0.00015107385,0.0000013462497,0.0001934158,0.0128030395,0.00006866404,0.44561115,0.072519064,0.4345744],"study_design_scores_gemma":[0.0006886752,0.00024753518,0.00955608,0.000032696735,0.00006714609,2.3927228e-7,0.000039678966,0.13633811,0.00059119234,0.84946954,0.00272282,0.00024627152],"about_ca_topic_score_codex":0.0002522365,"about_ca_topic_score_gemma":0.000017504051,"teacher_disagreement_score":0.9598975,"about_ca_system_score_codex":0.00002886664,"about_ca_system_score_gemma":0.000022864157,"threshold_uncertainty_score":0.7984289},"labels":[],"label_agreement":null},{"id":"W1965489156","doi":"10.1016/j.physa.2006.08.023","title":"Evolving model of weighted networks inspired by scientific collaboration networks","year":2006,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Preferential attachment; Clustering coefficient; Vertex (graph theory); Degree distribution; Complex network; Average path length; Weighted network; Computer science; Scale-free network; Cluster analysis; Link (geometry); Network formation; Evolving networks; Path (computing); Theoretical computer science; Artificial intelligence; Graph; Shortest path problem; Computer network","score_opus":0.008018641633436486,"score_gpt":0.2469610947648341,"score_spread":0.23894245313139761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965489156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022684636,0.0001999044,0.9958466,0.00007634312,0.00001782262,0.0004871058,0.00046960873,0.000057999554,0.00057613227],"genre_scores_gemma":[0.9856621,0.000011956093,0.012760255,0.0000127041885,0.00014975213,0.000308511,0.0009846883,0.000023335755,0.000086721215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987127,0.000034403725,0.00040280202,0.00040459368,0.0001884345,0.00025703394],"domain_scores_gemma":[0.99893874,0.00014941246,0.00021729888,0.00028890153,0.00031777928,0.0000878926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012800717,0.00017629114,0.00028029885,0.00005668252,0.00033571752,0.0001390492,0.00016286375,0.000045284538,0.000050155],"category_scores_gemma":[0.0000038313106,0.00018060498,0.000051893367,0.00068524416,0.000051752817,0.00012370035,0.00008326198,0.00013169415,0.0000024724654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003833389,0.00022038893,0.000024529982,0.0000065829436,0.000027329781,2.6558226e-8,0.0000111737945,0.010269388,0.006045646,0.97243845,0.0069339154,0.0040187133],"study_design_scores_gemma":[0.0001044705,0.00001577372,0.000015582546,0.000007725542,0.00006755289,3.6843478e-8,0.000011617939,0.7518619,0.00059529324,0.24654306,0.0006430503,0.0001339412],"about_ca_topic_score_codex":0.00004957606,"about_ca_topic_score_gemma":0.0000119318975,"teacher_disagreement_score":0.9833936,"about_ca_system_score_codex":0.000022028944,"about_ca_system_score_gemma":0.000040399034,"threshold_uncertainty_score":0.7364857},"labels":[],"label_agreement":null},{"id":"W1965526599","doi":"10.1109/asonam.2012.23","title":"Global Similarity in Social Networks with Typed Edges","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Embedding; Computer science; Enhanced Data Rates for GSM Evolution; Similarity (geometry); Theoretical computer science; Graph; Multiple edges; Artificial intelligence; Image (mathematics)","score_opus":0.015670643276251256,"score_gpt":0.2788313038725153,"score_spread":0.2631606605962641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965526599","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28813156,0.0000958642,0.31908664,0.00025028855,0.00006894822,0.00021833871,0.000006744085,0.0001844694,0.39195716],"genre_scores_gemma":[0.9973876,4.1839266e-7,0.0015782646,0.000055314355,0.0007958363,0.000010861083,0.000015902764,0.0000059964245,0.00014980102],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99941033,0.000032233507,0.000103859755,0.00010254776,0.00007387285,0.00027717437],"domain_scores_gemma":[0.9997811,0.000014596349,0.000034944744,0.0001036336,0.000021168287,0.000044570144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010993064,0.00009441475,0.00014629975,0.00001873341,0.000060649607,0.000020367048,0.000088661385,0.000028694632,0.00059126754],"category_scores_gemma":[4.7013387e-7,0.00007540393,0.000049209906,0.0003036323,0.000027841665,0.000090612724,0.000051325304,0.000083311934,0.00000760031],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010522518,0.00010462238,0.90681046,6.51193e-7,0.000033139975,1.8217638e-7,0.000029741113,0.000162874,5.426153e-7,0.06485364,0.008749162,0.019244466],"study_design_scores_gemma":[0.0006224123,0.000036896243,0.95528096,0.000012571399,0.00008644116,5.82223e-7,0.000255687,0.008495402,0.00007862485,0.013234539,0.02138805,0.0005078349],"about_ca_topic_score_codex":0.00041990075,"about_ca_topic_score_gemma":0.00025411876,"teacher_disagreement_score":0.70925605,"about_ca_system_score_codex":0.000030193778,"about_ca_system_score_gemma":0.000012534556,"threshold_uncertainty_score":0.6473965},"labels":[],"label_agreement":null},{"id":"W1965639564","doi":"10.1109/icawst.2013.6765505","title":"Dynamically identifying roles in social media by mapping real world","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Athabasca University","funders":"","keywords":"Computer science; Set (abstract data type); Cyber Space; Space (punctuation); Order (exchange); Mechanism (biology); The Internet; Data science; Social media; Social network (sociolinguistics); Information space; World Wide Web; Business","score_opus":0.016149427189143112,"score_gpt":0.2685712902616919,"score_spread":0.25242186307254877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965639564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7978674,0.000020216758,0.041085623,0.0005423723,0.000044496064,0.00023672871,0.0000066683556,0.0002176983,0.15997879],"genre_scores_gemma":[0.9958355,0.0000017159018,0.002546973,0.000031496274,0.00026546823,0.000048271588,0.0000641827,0.000012985153,0.0011934444],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991114,0.000039629478,0.00026921413,0.0001952998,0.00013188926,0.00025253795],"domain_scores_gemma":[0.9996675,0.00007639325,0.000066345485,0.00011537969,0.00003185183,0.000042509517],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010949617,0.0001128526,0.00019843208,0.00014241728,0.00007636839,0.000104569735,0.00018052447,0.000022877717,0.0026780756],"category_scores_gemma":[0.0000017715645,0.00010949181,0.00009264453,0.00036235983,0.000028424338,0.00015114908,0.00010135549,0.000143684,0.00007249206],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047279914,0.0002524516,0.44362375,0.000011338829,0.00016003368,0.0000014819317,0.0013976032,0.0000148858235,0.013174001,0.12047465,0.15138206,0.269503],"study_design_scores_gemma":[0.00090060604,0.000013427302,0.47426197,0.00014184891,0.000073212555,2.148528e-7,0.0041261422,0.055579815,0.0024149665,0.4531532,0.007843551,0.0014910318],"about_ca_topic_score_codex":0.0024347543,"about_ca_topic_score_gemma":0.0019513584,"teacher_disagreement_score":0.33267856,"about_ca_system_score_codex":0.000039003393,"about_ca_system_score_gemma":0.000010521238,"threshold_uncertainty_score":0.9982336},"labels":[],"label_agreement":null},{"id":"W1965792576","doi":"10.1145/1376815.1376816","title":"Joint cluster analysis of attribute data and relationship data","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Knowledge Discovery from Data","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Data mining; Cluster analysis; Heuristic; Identification (biology); Tree (set theory); Machine learning; Mathematics; Artificial intelligence","score_opus":0.15403939983569437,"score_gpt":0.3374659296680593,"score_spread":0.1834265298323649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965792576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09494489,0.0003875556,0.8141442,0.00025722134,0.00008240924,0.00019978463,0.089615226,0.00005537998,0.00031334066],"genre_scores_gemma":[0.89811295,0.0001050399,0.007239299,0.000020575999,0.00011936637,0.000008927831,0.094046615,0.0000228407,0.00032436653],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976367,0.00016247833,0.0005974874,0.0011498448,0.00022594258,0.00022758603],"domain_scores_gemma":[0.986357,0.00077650853,0.00020559385,0.012500946,0.00006924662,0.00009073617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042657237,0.00025256,0.0005923204,0.00037261262,0.0003128995,0.00008344376,0.003680263,0.000063807376,0.00042191125],"category_scores_gemma":[0.000053482414,0.00024434118,0.00012153805,0.0012208215,0.00018552845,0.0020655415,0.0011117562,0.00030936726,0.000026012955],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026030277,0.004562328,0.73960197,0.00006616323,0.027235094,0.000009455821,0.0015691904,0.002690768,0.00040947425,0.0013642674,0.1356031,0.08662786],"study_design_scores_gemma":[0.0020830883,0.000110605324,0.3737023,0.00021628848,0.024075156,0.0000040688924,0.0007328013,0.5546895,0.0008371073,0.005674841,0.036280446,0.001593761],"about_ca_topic_score_codex":0.0012199297,"about_ca_topic_score_gemma":0.0012996616,"teacher_disagreement_score":0.8069049,"about_ca_system_score_codex":0.000021909264,"about_ca_system_score_gemma":0.00010558071,"threshold_uncertainty_score":0.9963944},"labels":[],"label_agreement":null},{"id":"W1966018813","doi":"10.1103/physreve.86.066104","title":"PageRank and rank-reversal dependence on the damping factor","year":2012,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Rank (graph theory); PageRank; Mean reciprocal rank; Combinatorics; Spearman's rank correlation coefficient; Rank correlation; Mathematics; Correlation; Function (biology); Stability (learning theory); Statistics; Computer science; Theoretical computer science; Biology; Machine learning","score_opus":0.035315514980809704,"score_gpt":0.32841258289050673,"score_spread":0.29309706790969703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966018813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92406034,0.027111417,0.0131342625,0.004493524,0.00015151905,0.0016406075,0.00003412238,0.00021153603,0.029162671],"genre_scores_gemma":[0.9980587,0.0005911012,0.00009229441,0.000625732,0.0005408751,0.000045016837,0.000004241464,0.000010054028,0.000032027398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923444,0.000104580715,0.00012885511,0.00014983413,0.00015867518,0.00022363749],"domain_scores_gemma":[0.9992358,0.00031178378,0.00007112504,0.0002845876,0.00001912498,0.00007754686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018134498,0.0001353869,0.0002666827,0.0000102635195,0.0000974395,0.000024818662,0.00015455473,0.0000072898415,0.00037112008],"category_scores_gemma":[0.000019199026,0.000081348604,0.00015405813,0.00013322708,0.00003877674,0.00010734102,0.00007721751,0.00017965444,0.00009309258],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010030784,0.00047180871,0.024563896,0.00026372803,0.0002656426,6.143683e-7,0.0004077015,0.0000021122999,0.0023766027,0.52362156,0.013998961,0.43401736],"study_design_scores_gemma":[0.0013206002,0.00037549617,0.083126694,0.010474489,0.0022874812,0.000005841608,0.0002152188,0.0073831733,0.019975128,0.1663966,0.7047681,0.0036711337],"about_ca_topic_score_codex":0.00002136574,"about_ca_topic_score_gemma":3.8797282e-7,"teacher_disagreement_score":0.6907692,"about_ca_system_score_codex":0.000009119572,"about_ca_system_score_gemma":0.0000063799334,"threshold_uncertainty_score":0.4063505},"labels":[],"label_agreement":null},{"id":"W1966438230","doi":"10.1103/physreve.82.036115","title":"Propagation dynamics on networks featuring complex topologies","year":2010,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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":"Network topology; Topology (electrical circuits); Complex network; Statistical physics; Set (abstract data type); Random graph; Ode; Computer science; Epidemic model; Zero (linguistics); Field (mathematics); Mathematics; Applied mathematics; Theoretical computer science; Physics; Pure mathematics; Combinatorics; Population","score_opus":0.017695749797327815,"score_gpt":0.32260991749946893,"score_spread":0.30491416770214114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966438230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5179808,0.002141801,0.21652304,0.007774654,0.0007912535,0.0038057962,0.000053436404,0.0015717333,0.24935748],"genre_scores_gemma":[0.997931,0.0001345779,0.00064305426,0.00021313455,0.00079153647,0.00007112224,0.00012001964,0.000016269634,0.00007929243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991569,0.000048209582,0.00018374917,0.00024431263,0.00014793266,0.00021891596],"domain_scores_gemma":[0.9992473,0.0001059336,0.00012054631,0.0004022244,0.00006774111,0.00005623965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012432558,0.00016973342,0.0003509922,0.00002251445,0.00010084878,0.000035958332,0.0002300416,0.00001802198,0.00026821042],"category_scores_gemma":[0.000019008674,0.00013471949,0.00019055438,0.00026219853,0.00006277541,0.000065023334,0.00008613311,0.00042397532,0.00004941595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047921917,0.0002480261,0.0022843345,0.00009284998,0.000056660596,6.5759497e-7,0.000011004823,0.00019016862,0.0009682498,0.6993435,0.0077906074,0.28900915],"study_design_scores_gemma":[0.00041623638,0.0002593683,0.028432975,0.001585841,0.0004910743,0.0000021213286,0.000030394349,0.78681105,0.0020627591,0.12759861,0.0509224,0.0013871781],"about_ca_topic_score_codex":0.000029485665,"about_ca_topic_score_gemma":0.000011536981,"teacher_disagreement_score":0.78662086,"about_ca_system_score_codex":0.000020030817,"about_ca_system_score_gemma":0.000011105698,"threshold_uncertainty_score":0.54937017},"labels":[],"label_agreement":null},{"id":"W1966438375","doi":"10.1080/17513758.2013.819127","title":"Epidemic progression on networks based on disease generation time","year":2013,"lang":"en","type":"article","venue":"Journal of Biological Dynamics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; BC Centre for Disease Control","funders":"Canadian Institutes of Health Research","keywords":"Epidemic model; Generation time; Infectious disease (medical specialty); Computer science; Disease; Biology; Demography; Medicine; Population","score_opus":0.01757780906991084,"score_gpt":0.2776781843695282,"score_spread":0.2601003752996173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966438375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74676806,0.00004593482,0.2504416,0.0011733859,0.00011797329,0.00028002323,0.000011848389,0.000039860566,0.0011213348],"genre_scores_gemma":[0.9961812,0.000007784254,0.0025143747,0.0003215237,0.00079064514,0.000011308719,0.00011644532,0.000008642314,0.000048058166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989393,0.00017495018,0.0003989245,0.00014721867,0.00016051551,0.00017912178],"domain_scores_gemma":[0.9990007,0.00016857692,0.0003888837,0.00016580132,0.000118050964,0.00015793534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029373277,0.00014348469,0.00025859752,0.00007635143,0.00007497457,0.000046086538,0.00017955281,0.00006233906,0.00055795145],"category_scores_gemma":[0.000029696621,0.00008630551,0.00024411424,0.00012354148,0.00004035301,0.000060936563,0.000027785005,0.00029832893,0.000032712636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043338037,0.00148209,0.15777846,0.0000046056853,0.00014136435,0.00001324137,0.0000057165726,0.38747698,0.001107953,0.013264563,0.025082383,0.41320926],"study_design_scores_gemma":[0.0001591284,0.0004561183,0.020955544,0.000052229007,0.000021061824,3.350085e-7,0.0000018437778,0.9735145,0.0000234492,0.004549695,0.00016080278,0.00010531434],"about_ca_topic_score_codex":0.0000038385824,"about_ca_topic_score_gemma":2.8567078e-7,"teacher_disagreement_score":0.5860375,"about_ca_system_score_codex":0.00006742069,"about_ca_system_score_gemma":0.000021559803,"threshold_uncertainty_score":0.61091775},"labels":[],"label_agreement":null},{"id":"W1966676530","doi":"10.1007/s11227-011-0644-y","title":"An anomaly-based detection in ubiquitous network using the equilibrium state of the catastrophe theory","year":2011,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Anomaly detection; Catastrophe theory; State (computer science); Computer security; Distributed computing; Data mining; Algorithm","score_opus":0.022327271869888678,"score_gpt":0.2520841345001339,"score_spread":0.22975686263024522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966676530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87151545,0.00015608913,0.12799063,0.000017688608,0.00011361848,0.00011195144,0.0000015914428,0.000008317403,0.00008464132],"genre_scores_gemma":[0.99728453,0.000001423832,0.002154582,0.000033635275,0.0005044284,5.953093e-7,5.2641894e-7,0.000018626102,0.0000016291222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979048,0.00092785514,0.00058804924,0.00009265288,0.00021146299,0.00027518268],"domain_scores_gemma":[0.998652,0.00025618685,0.0005141649,0.00041923142,0.00012371388,0.00003473323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026948713,0.00014098299,0.00025098943,0.00006583721,0.00020830389,0.000027625074,0.0007500172,0.000019848387,0.00003160298],"category_scores_gemma":[0.000007578738,0.00007079312,0.00019459736,0.00045352752,0.0001437381,0.0001688573,0.00013000537,0.00043624354,2.8627042e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003969954,0.00029509183,0.13422792,0.000017488963,0.00026211463,0.0000041947565,0.0066008763,0.68031305,0.07820536,0.0006241924,0.00003433727,0.099018395],"study_design_scores_gemma":[0.0010250601,0.0005593849,0.086362064,0.0005617475,0.00067682983,0.000064891276,0.0039199907,0.68923783,0.17143239,0.045587815,0.000087039196,0.0004849778],"about_ca_topic_score_codex":0.0005785457,"about_ca_topic_score_gemma":0.00005702017,"teacher_disagreement_score":0.12583604,"about_ca_system_score_codex":0.000040369712,"about_ca_system_score_gemma":0.00007604364,"threshold_uncertainty_score":0.28868595},"labels":[],"label_agreement":null},{"id":"W1967063156","doi":"10.1109/hicss.2014.222","title":"Link Sharing on Twitter during Popular Events: Implications for Social Navigation on Websites","year":2014,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Social media; Computer science; World Wide Web; Social media optimization; Web page; Order (exchange); Internet privacy","score_opus":0.027950743771081664,"score_gpt":0.31754675266143223,"score_spread":0.2895960088903506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967063156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8906712,0.0000012323529,0.098127045,0.0021230194,0.000026805496,0.00030103722,0.000009416195,0.0001504435,0.008589828],"genre_scores_gemma":[0.99627477,1.194981e-7,0.0013483283,0.00012172179,0.0010128111,0.00014359488,0.00018206051,0.000017854836,0.00089873106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993594,0.000015003651,0.00016644639,0.00023423186,0.00006514946,0.00015972999],"domain_scores_gemma":[0.9996016,0.000034566034,0.000076894146,0.00021600137,0.000043776232,0.000027138127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009448985,0.00010380182,0.00012293269,0.000053774955,0.000270057,0.000038650716,0.0001365823,0.000026063874,0.00012939215],"category_scores_gemma":[0.0000026598218,0.00009821145,0.00014138539,0.000090837224,0.000007240703,0.000054520584,0.000038992206,0.00008018624,0.000040978313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031816497,0.00021388721,0.18676928,0.000021348633,0.00016218789,3.3260644e-8,0.0001626958,0.00035180568,0.0073174653,0.763041,0.0053529707,0.03657547],"study_design_scores_gemma":[0.0011818762,0.00019447909,0.28652528,0.00014471538,0.00015399404,2.566431e-7,0.00007599386,0.012512728,0.020489726,0.65462726,0.0233288,0.00076489034],"about_ca_topic_score_codex":0.000025505758,"about_ca_topic_score_gemma":0.0000020477762,"teacher_disagreement_score":0.10841378,"about_ca_system_score_codex":0.00003149506,"about_ca_system_score_gemma":0.0000031959928,"threshold_uncertainty_score":0.40049466},"labels":[],"label_agreement":null},{"id":"W1967279324","doi":"10.2753/mis0742-1222220309","title":"Coauthorship Dynamics and Knowledge Capital: The Patterns of Cross-Disciplinary Collaboration in Information Systems Research","year":2005,"lang":"en","type":"article","venue":"Journal of Management Information Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Knowledge management; Cohesion (chemistry); Discipline; Social network analysis; Social capital; Field (mathematics); Knowledge sharing; Network science; Construct (python library); Data science; Computer science; Order (exchange); Sociology; Social science; Complex network; World Wide Web; Business","score_opus":0.02918296425776425,"score_gpt":0.3647974192034532,"score_spread":0.335614454945689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967279324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9088892,0.0004432215,0.061750647,0.00034980415,0.00043543795,0.0014520602,0.000056119126,0.000022496424,0.026601054],"genre_scores_gemma":[0.99942005,0.000051769628,0.00009027084,0.00000531589,0.00017023251,0.0000377843,0.000055869685,0.0000046304267,0.00016409012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975476,0.00024225021,0.0014389332,0.000050130737,0.00055198686,0.00016904614],"domain_scores_gemma":[0.99760276,0.00010916781,0.0011029118,0.00020649914,0.0009346982,0.00004396255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040371884,0.00010745583,0.00024757444,0.00077997544,0.00013620849,0.00056359253,0.00027318468,0.000043481177,0.0000065738714],"category_scores_gemma":[0.0000108724125,0.00008039828,0.000056228753,0.0006038932,0.000043931643,0.003350352,0.00014240955,0.00023627792,0.000012616387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012900161,0.00016828782,0.20623021,0.0017284494,0.00033174234,9.909436e-7,0.021493347,0.10143683,0.0000040702967,0.6281449,0.004921797,0.035410367],"study_design_scores_gemma":[0.0022339628,0.0002857121,0.08665154,0.0019322339,0.000110982524,0.00001701986,0.15592736,0.68565094,0.000046641206,0.0009583108,0.06579684,0.00038845438],"about_ca_topic_score_codex":0.00012374339,"about_ca_topic_score_gemma":0.000043419597,"teacher_disagreement_score":0.6271866,"about_ca_system_score_codex":0.00021839685,"about_ca_system_score_gemma":0.000046355482,"threshold_uncertainty_score":0.54347354},"labels":[],"label_agreement":null},{"id":"W1967374088","doi":"10.1023/b:scie.0000013298.22207.2b","title":"Modelling the characteristics of Web page outlinks","year":2004,"lang":"en","type":"article","venue":"Scientometrics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Web page; Negative binomial distribution; Poisson distribution; Computer science; Mandelbrot set; Distribution (mathematics); Frequency distribution; Gaussian; Mathematics; Information retrieval; World Wide Web; Statistics; Physics","score_opus":0.03194412944867789,"score_gpt":0.28198450038848505,"score_spread":0.25004037093980713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967374088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64549387,0.00005701884,0.34925666,0.000090270936,0.00011175625,0.00010756705,0.000025949206,0.00003697641,0.004819912],"genre_scores_gemma":[0.9952945,0.000010137116,0.004372962,0.000020431045,0.00014071612,0.000004917564,0.000012359941,0.000008836175,0.0001351235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892247,0.000018226048,0.00026086648,0.0001674891,0.000419,0.0002119487],"domain_scores_gemma":[0.99915165,0.00007838372,0.00016961842,0.0003677337,0.00017886884,0.000053777367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006182035,0.00009136832,0.0001674985,0.00064944295,0.00011743217,0.00006549761,0.0003996999,0.000022763097,0.00007490122],"category_scores_gemma":[0.000020421176,0.000065663924,0.00012369787,0.0055641737,0.00009097743,0.000061705425,0.000113608956,0.00014692346,0.000015675732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020017142,0.0012562867,0.2051464,0.000049147297,0.00035738727,0.000004179621,0.0026711666,0.23529044,0.004493071,0.42758366,0.0019833394,0.12114492],"study_design_scores_gemma":[0.0010700291,0.00014507285,0.0060646916,0.00008831337,0.00025376532,0.000001095546,0.00047134524,0.8811399,0.007627387,0.08101626,0.02137701,0.0007451544],"about_ca_topic_score_codex":0.000118185,"about_ca_topic_score_gemma":8.0793666e-7,"teacher_disagreement_score":0.64584947,"about_ca_system_score_codex":0.0000309482,"about_ca_system_score_gemma":0.000059241745,"threshold_uncertainty_score":0.26776972},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010466423746140388,"score_gpt":0.24528135215887262,"score_spread":0.23481492841273222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967510236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28478917,0.000013378545,0.6962627,0.0004703881,0.00035763477,0.00025910075,0.0000064084716,0.00019966424,0.017641557],"genre_scores_gemma":[0.9923325,6.596398e-7,0.0006978135,0.0037972385,0.0029171414,0.000026766184,0.000079784,0.00007318834,0.00007486133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998036,0.0005230184,0.0003051498,0.00036144175,0.00026699863,0.0005073387],"domain_scores_gemma":[0.9986151,0.00042959285,0.00019772965,0.00061082636,0.000028507022,0.00011825779],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059422466,0.0003117719,0.00028078473,0.00012821646,0.00018057057,0.00006998037,0.00029315794,0.000030649113,0.00022186876],"category_scores_gemma":[0.000008970659,0.0003023147,0.0002907234,0.00024970935,0.000048065824,0.00018366885,0.00008338539,0.0004863794,0.00021798348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039792058,0.001687523,0.10761817,0.00002994727,0.00058392703,0.000016964585,0.0012255342,0.30361265,0.030966803,0.272995,0.044231657,0.23663393],"study_design_scores_gemma":[0.0026467878,0.00071514316,0.07193298,0.000936698,0.0008480932,0.000002169188,0.0002564168,0.8556751,0.017408455,0.024031254,0.021586763,0.0039601144],"about_ca_topic_score_codex":0.000018985744,"about_ca_topic_score_gemma":2.7703095e-7,"teacher_disagreement_score":0.7075434,"about_ca_system_score_codex":0.0000966338,"about_ca_system_score_gemma":0.00000703402,"threshold_uncertainty_score":0.9999429},"labels":[],"label_agreement":null},{"id":"W1968105630","doi":"10.1016/j.disc.2007.06.025","title":"The diameter of protean graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Giant component; Discrete mathematics; Graph; Degree distribution; Random graph; Complex network","score_opus":0.010262389157823898,"score_gpt":0.2737825081792333,"score_spread":0.26352011902140937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968105630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102481954,0.000051809013,0.837812,0.00007735731,0.000033256914,0.00043734626,0.000008592819,0.000059150934,0.059038535],"genre_scores_gemma":[0.96786547,0.0000015343289,0.031725682,0.00000616522,0.000052067375,0.000015809737,0.000005051582,0.000013994878,0.0003142531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999235,0.000015218007,0.0003210459,0.0000860211,0.00015771556,0.00018500954],"domain_scores_gemma":[0.9991408,0.00021162946,0.00018314522,0.000385878,0.00004584566,0.000032727545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051796425,0.00009464506,0.00015884767,0.000036939382,0.00009313081,0.000026547948,0.00022539076,0.000015110046,0.000074461015],"category_scores_gemma":[0.000009703117,0.000058290196,0.00016314593,0.00018185134,0.000090759786,0.000028693486,0.000045142002,0.00007818248,0.000006558903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060747593,0.00010093329,0.008966527,0.000030137386,0.00017689537,4.5431705e-7,0.0008830526,0.0000039717097,0.0014260705,0.9640608,0.001221701,0.023123417],"study_design_scores_gemma":[0.00015489012,0.000046818397,0.0013089175,0.000067833345,0.00010156506,5.362345e-7,0.0014524409,0.0020786861,0.038522866,0.9517146,0.0043196105,0.00023123418],"about_ca_topic_score_codex":0.000018147044,"about_ca_topic_score_gemma":0.0000082788765,"teacher_disagreement_score":0.8653835,"about_ca_system_score_codex":0.0000049726846,"about_ca_system_score_gemma":0.0000066196912,"threshold_uncertainty_score":0.23770052},"labels":[],"label_agreement":null},{"id":"W1968464900","doi":"10.1103/physreve.83.056121","title":"Multiple epidemic waves in delayed susceptible-infected-recovered models on complex networks","year":2011,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; York University","funders":"","keywords":"Uncorrelated; Transmission (telecommunications); Amplitude; Lag; Physics; Epidemic model; Complex network; Transmission rate; Mathematics; Statistical physics; Computer science; Statistics; Telecommunications; Optics; Combinatorics; Medicine; Population; Computer network","score_opus":0.06406122547619987,"score_gpt":0.320097406510983,"score_spread":0.25603618103478315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968464900","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50875235,0.009491294,0.30095735,0.0004903883,0.00026643212,0.00553819,0.00019322241,0.0010624891,0.17324826],"genre_scores_gemma":[0.99680567,0.00099145,0.001064712,0.00042696568,0.00031222616,0.00015485779,0.0001763539,0.000040394803,0.000027354785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801344,0.00025760534,0.00055279693,0.000486994,0.00019142541,0.00049772067],"domain_scores_gemma":[0.99860424,0.00034398623,0.0002301128,0.0006168631,0.00006737974,0.0001374489],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002781903,0.00034865225,0.0009196142,0.00007762329,0.00006676725,0.000017651939,0.00036945712,0.000033106513,0.0006086657],"category_scores_gemma":[0.00002230547,0.0003022571,0.00047273285,0.00058102026,0.000058266472,0.00016737392,0.00013094558,0.0004025291,0.000109275956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033752085,0.006590771,0.08207341,0.0006555425,0.0010661685,0.000018465875,0.00069483515,0.02727527,0.0026620403,0.4375368,0.042204287,0.39888486],"study_design_scores_gemma":[0.0005669721,0.00024787014,0.0043042665,0.0014210106,0.0001958997,4.687716e-7,0.000011069173,0.85095036,0.00023694297,0.1390082,0.0023745315,0.00068242423],"about_ca_topic_score_codex":0.00077887013,"about_ca_topic_score_gemma":0.00007509106,"teacher_disagreement_score":0.8236751,"about_ca_system_score_codex":0.000054368644,"about_ca_system_score_gemma":0.000021077265,"threshold_uncertainty_score":0.99994296},"labels":[],"label_agreement":null},{"id":"W1971939145","doi":"10.1109/aina.2014.133","title":"Semantic Graph Compression with Hypergraphs","year":2014,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Redundancy (engineering); Theoretical computer science; Data compression; Random graph; Graph; Data mining; Algorithm","score_opus":0.004639869991229941,"score_gpt":0.214374893018877,"score_spread":0.20973502302764704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971939145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20951344,0.000009509083,0.57106084,0.00013537068,0.000018561326,0.00010150636,7.427555e-7,0.00020956407,0.21895045],"genre_scores_gemma":[0.9939184,4.8843543e-7,0.005416218,0.000051710576,0.00009152386,0.000010806399,0.000012071446,0.000010571624,0.00048816125],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994614,0.000031338903,0.000099431425,0.00016081495,0.00010447298,0.00014253217],"domain_scores_gemma":[0.9995855,0.000026426085,0.00004205713,0.00026732017,0.000031909778,0.00004679506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000063231804,0.00009917643,0.00014496785,0.00006410693,0.000078949975,0.00002821239,0.000118911456,0.000011633175,0.00062916835],"category_scores_gemma":[3.738516e-7,0.00006613459,0.000072163835,0.00020654504,0.000033435186,0.00004643584,0.000035778234,0.00006579189,0.000022441156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002021902,0.0002092629,0.4991054,0.000008773306,0.00019466816,6.1844025e-7,0.00006390816,0.0002636662,0.0021357678,0.38955393,0.018531794,0.08991197],"study_design_scores_gemma":[0.003005203,0.00077262317,0.11538001,0.00036556314,0.00061518315,0.00000612483,0.0005089996,0.09259939,0.037193503,0.58354247,0.16355355,0.0024573577],"about_ca_topic_score_codex":0.0001698851,"about_ca_topic_score_gemma":0.000018429026,"teacher_disagreement_score":0.784405,"about_ca_system_score_codex":0.000001972814,"about_ca_system_score_gemma":0.000003884761,"threshold_uncertainty_score":0.6888952},"labels":[],"label_agreement":null},{"id":"W1972778893","doi":"10.1007/s13278-010-0016-2","title":"Introduction to the first issue of Social Network Analysis and Mining journal","year":2010,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Publication; Multidisciplinary approach; Computer science; Popularity; Variety (cybernetics); Data science; Field (mathematics); Social network (sociolinguistics); Social media; Management science; Engineering; Political science; World Wide Web; Sociology; Social science; Artificial intelligence","score_opus":0.006249649551441206,"score_gpt":0.2553527334439966,"score_spread":0.24910308389255542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972778893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9414302,0.00029328355,0.049590845,0.006738011,0.00038221607,0.0002039664,0.000013645591,0.00005070875,0.0012971049],"genre_scores_gemma":[0.9687836,0.000021436188,0.006617471,0.00015764488,0.024072543,0.000017571414,0.00005307123,0.000023526532,0.0002531169],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99770993,0.00017620876,0.00072220055,0.0004864519,0.00033586775,0.00056936766],"domain_scores_gemma":[0.9985346,0.0001808439,0.0006505329,0.00027143976,0.00022418832,0.00013839338],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016306235,0.00029800722,0.0010179504,0.00038881897,0.0021771756,0.0002967822,0.00028653778,0.0001193584,0.0006528662],"category_scores_gemma":[0.000018767692,0.00025005193,0.0007712367,0.005091371,0.00019135214,0.0001248839,0.0002325986,0.00047380148,0.0000018219722],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006718489,0.00007937972,0.70314753,0.0000095502955,0.019952819,0.0000018115978,0.009537964,0.020070506,0.00006684701,0.005799976,0.115862094,0.12540431],"study_design_scores_gemma":[0.00080509123,0.00017481484,0.47882935,0.000034166427,0.055541884,0.000005079389,0.009157572,0.04855653,0.000055477067,0.0048007886,0.40053523,0.0015040202],"about_ca_topic_score_codex":0.00024967978,"about_ca_topic_score_gemma":0.0028325662,"teacher_disagreement_score":0.28467312,"about_ca_system_score_codex":0.000019309278,"about_ca_system_score_gemma":0.000030799987,"threshold_uncertainty_score":0.9999952},"labels":[],"label_agreement":null},{"id":"W1973000011","doi":"10.1139/p10-007","title":"On routing strategy with finite-capacity effect on scale-free networks","year":2010,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Routing (electronic design automation); Network packet; Physics; Condensation; Topology (electrical circuits); Frame (networking); Static routing; Diffusion; Mathematical optimization; Computer science; Routing protocol; Computer network; Mathematics","score_opus":0.009533922084666198,"score_gpt":0.21599405871012878,"score_spread":0.2064601366254626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973000011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96299964,0.0000059761733,0.025064744,0.000071872804,0.0001927967,0.00011723797,0.000021113225,0.000014243612,0.011512378],"genre_scores_gemma":[0.99772495,1.770728e-7,0.00042097768,0.00008184315,0.0016951703,0.0000029328185,0.000007898164,0.000030410698,0.000035626534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998904,0.000074899996,0.00026321755,0.0001659304,0.00019869067,0.00039328486],"domain_scores_gemma":[0.99833214,0.00028911288,0.0003226213,0.00044019002,0.0001534343,0.0004624948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030553617,0.00022634031,0.00034859357,0.00010874953,0.00020814009,0.00012926746,0.00044233794,0.0000535884,0.00017319688],"category_scores_gemma":[0.000019699495,0.00018008429,0.00020771078,0.00029493903,0.00010371868,0.0001195344,0.000013461756,0.0011266079,0.000007918052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019079474,0.00023411938,0.1919005,0.000016669528,0.00078344677,0.00008853264,0.0003722767,0.23534739,0.0006375263,0.2866407,0.013184618,0.27060342],"study_design_scores_gemma":[0.01328887,0.022428066,0.08554953,0.0031947219,0.0023710462,0.000102715974,0.0005442803,0.24427785,0.045247298,0.56388766,0.01282955,0.006278411],"about_ca_topic_score_codex":0.0020838638,"about_ca_topic_score_gemma":0.00786091,"teacher_disagreement_score":0.27724695,"about_ca_system_score_codex":0.00005443465,"about_ca_system_score_gemma":0.00028150156,"threshold_uncertainty_score":0.7343624},"labels":[],"label_agreement":null},{"id":"W1973129201","doi":"10.1109/socialcom.2010.67","title":"Exploring Social Networks: A Frequent Pattern Visualization Approach","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Visualization; Complement (music); Social network (sociolinguistics); Pairwise comparison; Representation (politics); Graph drawing; Information retrieval; Data science; World Wide Web; Theoretical computer science; Data mining; Artificial intelligence; Social media","score_opus":0.06113835351727699,"score_gpt":0.284847492035412,"score_spread":0.223709138518135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973129201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16640592,0.0000020529383,0.812715,0.00002853301,0.00008235052,0.00009681405,0.0000010653694,0.00016096403,0.02050732],"genre_scores_gemma":[0.9960308,9.1290894e-7,0.0020236464,0.000042677406,0.0015734228,0.00011410105,0.00008607879,0.000019555982,0.00010881045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992799,0.000026382024,0.00017636883,0.00020078759,0.00011516292,0.00020135615],"domain_scores_gemma":[0.99966866,0.000014227194,0.0000657616,0.00016566728,0.00004386766,0.00004182963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012340758,0.00011618188,0.00014032927,0.000051142935,0.00014606239,0.000070066286,0.00013937704,0.000025498208,0.0007780093],"category_scores_gemma":[8.230493e-7,0.00010849995,0.00010951808,0.00020292676,0.00002316828,0.00017120059,0.000065629814,0.00017260319,0.000011243355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044420617,0.00039990884,0.14103904,0.000008090493,0.00019077984,5.4642896e-7,0.00072815805,0.00050151296,0.001248879,0.48118594,0.0057795434,0.36891314],"study_design_scores_gemma":[0.0007778471,0.00004942583,0.03317724,0.000017154758,0.00018887069,0.0000012450334,0.0010645858,0.92079633,0.0037928908,0.018604131,0.020226305,0.0013039676],"about_ca_topic_score_codex":0.00034213785,"about_ca_topic_score_gemma":0.000024718469,"teacher_disagreement_score":0.9202948,"about_ca_system_score_codex":0.000008917166,"about_ca_system_score_gemma":0.000007974022,"threshold_uncertainty_score":0.85186565},"labels":[],"label_agreement":null},{"id":"W1973522621","doi":"10.1145/2757281","title":"Refining Social Graph Connectivity via Shortcut Edge Addition","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Knowledge Discovery from Data","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Graph; Computation; Theoretical computer science; Algorithm; Data mining","score_opus":0.08509666336746628,"score_gpt":0.3278070009381637,"score_spread":0.24271033757069738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973522621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04771097,0.00009028627,0.9375229,0.00015629394,0.0004231863,0.00015567723,0.008145196,0.00022061767,0.005574883],"genre_scores_gemma":[0.9878633,0.0000038093358,0.0022048918,0.000029750125,0.0007953213,0.00007107351,0.008639165,0.000039806993,0.00035285135],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982305,0.00017496252,0.00033490607,0.0007235213,0.00022753565,0.00030857068],"domain_scores_gemma":[0.99753755,0.00028920575,0.0001241657,0.0018159585,0.00010729399,0.00012583542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029147568,0.00028770647,0.00037482165,0.00015850857,0.00037615266,0.0001712347,0.0011029074,0.00008236161,0.000662064],"category_scores_gemma":[0.000015644806,0.00030026853,0.00020554896,0.00048754257,0.00010586474,0.0013260074,0.0001145437,0.0003934701,0.00016441235],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036820146,0.0037669113,0.008584977,0.00001787253,0.001964874,0.00000673108,0.0014178226,0.0003137023,0.0013285655,0.004451393,0.12913099,0.84864795],"study_design_scores_gemma":[0.009899933,0.0011208312,0.027096214,0.0006909956,0.006016416,0.000009991234,0.0058952505,0.039972622,0.027976407,0.5094182,0.3643956,0.0075075733],"about_ca_topic_score_codex":0.0011997157,"about_ca_topic_score_gemma":0.0013300957,"teacher_disagreement_score":0.94015235,"about_ca_system_score_codex":0.000085016036,"about_ca_system_score_gemma":0.00012535935,"threshold_uncertainty_score":0.9999449},"labels":[],"label_agreement":null},{"id":"W1973612436","doi":"10.1049/iet-com.2011.0025","title":"Theoretical analysis for tree-like networks using random geometry","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Hierarchical routing; Routing table; Computer science; Hierarchical network model; Static routing; Network topology; Multipath routing; Routing (electronic design automation); Policy-based routing; Dynamic Source Routing; Distributed computing; Computer network; Routing protocol","score_opus":0.058631513950006355,"score_gpt":0.31698394375612327,"score_spread":0.2583524298061169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973612436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074236793,0.0002266447,0.97196674,0.00009449743,0.000025258223,0.00027615274,0.000025684185,0.00009019611,0.019871173],"genre_scores_gemma":[0.91710347,0.00001968607,0.08233167,0.000048309383,0.00008413983,0.00012271797,0.00022477779,0.000018513298,0.000046716337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989818,0.00015984503,0.0003382005,0.0001939364,0.00008326864,0.00024298379],"domain_scores_gemma":[0.9972516,0.00044209516,0.00014543459,0.0019517844,0.00013465786,0.00007445678],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038466722,0.00014178669,0.00034311888,0.0002184341,0.00036671408,0.00004493374,0.0009430313,0.000047076297,0.0011112327],"category_scores_gemma":[0.000008859197,0.00013715721,0.0005227642,0.0011169309,0.00027646997,0.00007598061,0.0003067463,0.00018147245,0.000004297361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045009638,0.00037467436,0.059604116,0.0000018597668,0.0022967309,9.495758e-8,0.0003030596,0.0017447165,0.000034979686,0.92446846,0.0006775621,0.010448766],"study_design_scores_gemma":[0.00051064405,0.000021528498,0.0032294204,0.000009148149,0.002289939,2.4671468e-7,0.00016796582,0.9045279,0.00007257922,0.08638289,0.0025401902,0.00024756565],"about_ca_topic_score_codex":0.00026142295,"about_ca_topic_score_gemma":0.000077394965,"teacher_disagreement_score":0.9096798,"about_ca_system_score_codex":0.000021956148,"about_ca_system_score_gemma":0.000021289012,"threshold_uncertainty_score":0.9998019},"labels":[],"label_agreement":null},{"id":"W1973793454","doi":"10.1371/journal.pone.0113438","title":"Inferring Meaningful Communities from Topology-Constrained Correlation Networks","year":2014,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Dalhousie University; Departamento Administrativo de Ciencia, Tecnología e Innovación (COLCIENCIAS)","keywords":"Voting; Computer science; Adjacency list; Topology (electrical circuits); Modularity (biology); Data mining; Algorithm; Mathematics; Biology; Combinatorics","score_opus":0.029903285512051774,"score_gpt":0.22456855220645675,"score_spread":0.19466526669440498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973793454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6974849,0.000027545926,0.27604535,0.00007878791,0.000030041287,0.00010374578,0.000006083581,0.00018452427,0.026039016],"genre_scores_gemma":[0.9923973,0.0000026989958,0.006572154,0.00007005838,0.0005652811,0.000022785762,0.00024127544,0.000016165564,0.000112250666],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999243,0.00012290954,0.00021475306,0.000118899545,0.000114741975,0.0001856733],"domain_scores_gemma":[0.999133,0.0003104115,0.00011431065,0.00033907912,0.00005984293,0.000043337655],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014751578,0.00012306221,0.00026504396,0.000053454358,0.00015943739,0.00004693401,0.00018120944,0.0000455113,0.0013009673],"category_scores_gemma":[0.000008111878,0.00013320788,0.00006654578,0.00009847891,0.000077175246,0.00008606751,0.0000998729,0.0002529887,0.000028696693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017835237,0.0006826276,0.87028015,0.000007260499,0.0010432623,3.0567153e-7,0.0011269653,0.0044365837,0.00093270466,0.1033521,0.00047038833,0.017649835],"study_design_scores_gemma":[0.00042136805,0.00006836738,0.012772444,0.00019239202,0.00038001811,1.03399934e-7,0.0005468251,0.9295955,0.0014358575,0.05390307,0.0003305284,0.00035357542],"about_ca_topic_score_codex":0.0013146173,"about_ca_topic_score_gemma":0.00013790028,"teacher_disagreement_score":0.92515886,"about_ca_system_score_codex":0.000015754524,"about_ca_system_score_gemma":0.000007829082,"threshold_uncertainty_score":0.999612},"labels":[],"label_agreement":null},{"id":"W1974712447","doi":"10.1109/infcom.2013.6566732","title":"Video sharing propagation in social networks: Measurement, modeling, and analysis","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Broadband; Process (computing); Broadband networks; Service (business); Event (particle physics); Multimedia; Diversity (politics); World Wide Web; Telecommunications; Business","score_opus":0.02997316901507579,"score_gpt":0.2623670691848706,"score_spread":0.23239390016979483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974712447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24046174,0.000031307976,0.7522735,0.000086535685,0.000005373299,0.00019073891,3.3269313e-7,0.000055133893,0.006895325],"genre_scores_gemma":[0.9986191,0.000001773938,0.0010213584,0.000021654634,0.00015218812,0.000077078716,0.000018317036,0.000007707681,0.00008083411],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991581,0.000027717544,0.00024140692,0.00024299846,0.00014972832,0.00018004498],"domain_scores_gemma":[0.9996745,0.000006605851,0.000056508557,0.00012703548,0.000102162754,0.00003318863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028371147,0.000101743244,0.00020526747,0.00017741886,0.00009183182,0.000113267284,0.00009321756,0.000024189168,0.00055391697],"category_scores_gemma":[0.0000017710381,0.00009380287,0.00009421586,0.0006100087,0.000012577399,0.00018168244,0.000077257,0.00009043182,0.000004624468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035874577,0.00008101224,0.8857062,0.0000042209003,0.00062416674,1.353407e-7,0.00018639764,0.057053976,0.00018757035,0.020010835,0.0010002544,0.03514166],"study_design_scores_gemma":[0.00009282964,0.0000036729114,0.014444861,0.000004740732,0.00013378293,1.4526655e-8,0.00006187579,0.9714037,0.000023941378,0.013704982,0.000018148585,0.00010743206],"about_ca_topic_score_codex":0.0023699927,"about_ca_topic_score_gemma":0.00029667572,"teacher_disagreement_score":0.91434973,"about_ca_system_score_codex":0.0000339903,"about_ca_system_score_gemma":0.000007183675,"threshold_uncertainty_score":0.60650027},"labels":[],"label_agreement":null},{"id":"W1975948899","doi":"10.1145/1150402.1150478","title":"Bias and controversy","year":2006,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Standard deviation; Computer science; Subjectivity; Object (grammar); Dependency (UML); Ground truth; Focus (optics); Artificial intelligence; Value (mathematics); Statistics; Machine learning; Mathematics; Epistemology; Philosophy","score_opus":0.008344340202299766,"score_gpt":0.22355797205090347,"score_spread":0.2152136318486037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975948899","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32363647,0.00005173392,0.07021325,0.0002248839,0.000013247801,0.00007664682,0.0000028744046,0.00011305622,0.6056678],"genre_scores_gemma":[0.9946686,3.287669e-7,0.001527709,0.00003124214,0.00014926899,0.0000032206974,0.0000067696747,0.0000030462497,0.0036098373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997546,0.0000073393207,0.000063150444,0.00007262485,0.00003253981,0.00006975409],"domain_scores_gemma":[0.9998577,0.000027050028,0.000018513874,0.0000722757,0.000010914121,0.000013501103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000034048775,0.000041483952,0.000067141955,0.000017243441,0.000027555678,0.000024430108,0.000026758384,0.0000058033656,0.0006800944],"category_scores_gemma":[3.404198e-7,0.00003444574,0.000029949075,0.000044199318,0.000014973755,0.000027519147,0.000019592471,0.000022057804,0.000009622052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013759465,0.000024528206,0.22955526,4.6538122e-7,0.000019146197,2.2682646e-7,0.000004221385,0.000008539449,0.00033458782,0.7140126,0.04313763,0.012901376],"study_design_scores_gemma":[0.0009879054,0.000048516045,0.08199391,0.00000961329,0.00009921359,8.5683e-7,0.0001368729,0.012422109,0.008545882,0.5031077,0.392151,0.0004964222],"about_ca_topic_score_codex":0.0011830394,"about_ca_topic_score_gemma":0.000028969382,"teacher_disagreement_score":0.6710321,"about_ca_system_score_codex":0.0000023753628,"about_ca_system_score_gemma":0.000002606041,"threshold_uncertainty_score":0.74465567},"labels":[],"label_agreement":null},{"id":"W1976079781","doi":"10.1109/cason.2012.6412389","title":"DIFSoN: Discovering influential friends from social networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Interdependence; Friendship; Centrality; Computer science; Social network (sociolinguistics); Social network analysis; Data science; World Wide Web; Social media; Sociology; Psychology; Social psychology","score_opus":0.009270826467814693,"score_gpt":0.25726698575570844,"score_spread":0.24799615928789376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976079781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4565355,0.00006464191,0.5000808,0.000040424286,0.00016330939,0.000058521728,0.000009894873,0.00013327405,0.042913634],"genre_scores_gemma":[0.99360293,6.9832555e-7,0.0011431437,0.000051376453,0.0048359153,0.000016297294,0.000085042615,0.00001665145,0.0002479169],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99916375,0.000029461997,0.00017936974,0.00014842277,0.000118818614,0.00036019954],"domain_scores_gemma":[0.99964195,0.000029915003,0.000066446,0.00016864605,0.00001576401,0.0000772606],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007586152,0.00013596023,0.00018189533,0.000027573968,0.00015853962,0.00007099346,0.00014765032,0.000035130884,0.003961379],"category_scores_gemma":[4.5754174e-7,0.00012343968,0.00016760541,0.00014263295,0.000029301431,0.00026682665,0.00016542844,0.00013652984,0.000033810386],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016471924,0.00021026381,0.81609106,0.0000011822361,0.000442027,3.5273396e-7,0.000681666,0.00067530863,0.00026070877,0.10442726,0.0150689995,0.062124673],"study_design_scores_gemma":[0.0018739426,0.0000602135,0.63536215,0.000044288478,0.0010228199,6.115739e-7,0.0017870882,0.08791234,0.0061278474,0.0320443,0.23114534,0.0026190586],"about_ca_topic_score_codex":0.0009368765,"about_ca_topic_score_gemma":0.000016092503,"teacher_disagreement_score":0.5370675,"about_ca_system_score_codex":0.000017575518,"about_ca_system_score_gemma":0.0000060468583,"threshold_uncertainty_score":0.99694914},"labels":[],"label_agreement":null},{"id":"W1976533648","doi":"10.1145/2480362.2480389","title":"Discovering influential nodes from trust network","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Viral marketing; Computer science; Maximization; Task (project management); Set (abstract data type); Word of mouth; Greedy algorithm; Social network (sociolinguistics); Theoretical computer science; Mathematical optimization; Social media; World Wide Web; Algorithm; Marketing; Mathematics; Business; Engineering","score_opus":0.00519356849636704,"score_gpt":0.21663999208247187,"score_spread":0.21144642358610483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976533648","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8409012,0.000025268575,0.10901204,0.00008416571,0.00006301785,0.00012264616,0.0000046347773,0.00013477159,0.049652275],"genre_scores_gemma":[0.98976564,7.82964e-7,0.008061153,0.00008691748,0.0011796342,0.00004000514,0.000044748438,0.000013675015,0.00080742565],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993024,0.000016369819,0.00017769488,0.00018355026,0.000090551104,0.0002294586],"domain_scores_gemma":[0.9995721,0.00003620436,0.000051822095,0.00026107338,0.000024812778,0.000053999567],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000031851378,0.00011746065,0.00015987775,0.00001961153,0.00008456301,0.00015076708,0.00016742677,0.000018454426,0.016771145],"category_scores_gemma":[7.089098e-7,0.000100160956,0.000115510884,0.00012247697,0.000023380895,0.00021498997,0.00013163158,0.000083197105,0.00029264504],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051147804,0.0000763652,0.84404826,0.0000015845258,0.00031994082,4.184978e-7,0.00014021742,0.004055139,0.0013613915,0.041036673,0.043861546,0.06509336],"study_design_scores_gemma":[0.0009419045,0.000044177337,0.44963595,0.00008189492,0.00025061195,2.3651883e-7,0.00047903348,0.12705606,0.008113668,0.32476833,0.08719641,0.001431727],"about_ca_topic_score_codex":0.009231584,"about_ca_topic_score_gemma":0.000029623805,"teacher_disagreement_score":0.39441228,"about_ca_system_score_codex":0.00000915322,"about_ca_system_score_gemma":0.000007671961,"threshold_uncertainty_score":0.997366},"labels":[],"label_agreement":null},{"id":"W1976578688","doi":"10.1088/1742-5468/2012/04/p04011","title":"Control range: a controllability-based index for node significance in directed networks","year":2012,"lang":"en","type":"article","venue":"Journal of Statistical Mechanics Theory and Experiment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Controllability; Index (typography); Node (physics); Range (aeronautics); Computer science; Control (management); Computer network; Topology (electrical circuits); Mathematics; Artificial intelligence; Engineering; World Wide Web; Applied mathematics; Combinatorics","score_opus":0.008726350500409185,"score_gpt":0.28595265002524944,"score_spread":0.27722629952484024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976578688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013170553,0.0005850217,0.9856358,0.00006120531,0.000111614376,0.00034280753,0.000038803955,0.000012168986,0.000042014355],"genre_scores_gemma":[0.9836792,0.0000035304777,0.015798911,0.0001267343,0.00028596763,0.00008247584,0.000005198343,0.000014615033,0.0000033936121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984835,0.00037787552,0.0005375025,0.00012943949,0.00015083872,0.00032088213],"domain_scores_gemma":[0.9975642,0.0017588912,0.00025942668,0.0001210274,0.00012196905,0.00017447164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020165846,0.0001568236,0.00048986793,0.000075921576,0.00006093965,0.000029870316,0.000104331484,0.000046276138,0.000173924],"category_scores_gemma":[0.00008593562,0.00012848242,0.00010900142,0.00009717642,0.00004167327,0.000080978316,0.00001753276,0.00019962076,3.4375793e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029088024,0.0006054967,0.0033027327,0.000013346557,0.00016410547,0.00000199725,0.0001301233,0.001250996,0.001643927,0.9818731,0.00019445778,0.007910909],"study_design_scores_gemma":[0.008452864,0.000636702,0.001078749,0.000110934474,0.00029169073,0.0000026746225,0.00036415938,0.44407356,0.003666728,0.5396442,0.001239608,0.0004381751],"about_ca_topic_score_codex":0.000010301853,"about_ca_topic_score_gemma":8.8150097e-7,"teacher_disagreement_score":0.97050864,"about_ca_system_score_codex":0.000055136232,"about_ca_system_score_gemma":0.000038437516,"threshold_uncertainty_score":0.5239361},"labels":[],"label_agreement":null},{"id":"W1976949588","doi":"10.1142/s0219525911003207","title":"THE SMALL-WORLD PROPERTY IN NETWORKS GROWING BY ACTIVE EDGES","year":2011,"lang":"en","type":"article","venue":"Advances in Complex Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Small-world network; Probabilistic logic; Computer science; Average path length; Focus (optics); Property (philosophy); Clustering coefficient; Logarithm; Simple (philosophy); Cluster analysis; Complex network; Fractal; Artificial intelligence; Algorithm; Mathematics; Theoretical computer science; Physics","score_opus":0.0348856568424598,"score_gpt":0.2680624899057502,"score_spread":0.2331768330632904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976949588","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04789483,0.032929763,0.2701478,0.00030631784,0.0021557289,0.00507283,0.00005952931,0.00063278177,0.6408004],"genre_scores_gemma":[0.9979963,0.000089580506,0.00041851855,0.000023479197,0.00027392834,0.0003136447,0.000025243986,0.000025941554,0.0008334001],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982317,0.00024892404,0.0005341721,0.00036456395,0.00014085436,0.00047975592],"domain_scores_gemma":[0.9990155,0.00024882978,0.00021599127,0.0004184496,0.000050483413,0.000050740306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039932036,0.00023184046,0.00039291903,0.00010628983,0.00018114698,0.00006993734,0.00054945756,0.000029734454,0.0000588741],"category_scores_gemma":[0.0000053199806,0.00014598199,0.00009094858,0.0006261567,0.00011419796,0.00037965048,0.00013985901,0.00030817083,0.000005422656],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016281831,0.00043058395,0.36775172,0.000051195235,0.0001937861,0.000010619952,0.0010257007,0.009486538,0.00021074923,0.13364768,0.008836123,0.47819248],"study_design_scores_gemma":[0.00086744886,0.00010091415,0.0092906235,0.00047022823,0.000037802565,0.0000023722394,0.0028643545,0.12185543,0.0006084332,0.015330675,0.8476134,0.0009583134],"about_ca_topic_score_codex":0.003473468,"about_ca_topic_score_gemma":0.00316252,"teacher_disagreement_score":0.95010144,"about_ca_system_score_codex":0.00008702144,"about_ca_system_score_gemma":0.000016715481,"threshold_uncertainty_score":0.5952973},"labels":[],"label_agreement":null},{"id":"W1977290048","doi":"10.1177/0002764214556806","title":"Collaborating, Connecting, and Clustering in the Humanities","year":2014,"lang":"en","type":"article","venue":"American Behavioral Scientist","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Scholarship; Cluster analysis; Principal (computer security); Thematic map; Sociology; Digital humanities; Collaborative network; Data science; Humanities; Computer science; Library science; Social science; Political science; Geography; Artificial intelligence; Art; Cartography","score_opus":0.018135881684096314,"score_gpt":0.30555654579526287,"score_spread":0.28742066411116657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977290048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906476,0.000008413922,0.00336909,0.00006344477,0.000034663615,0.00009836364,0.0000049010314,0.000031703064,0.005741831],"genre_scores_gemma":[0.9982971,3.196163e-7,0.0013651664,0.000098215634,0.00008197698,0.00002076824,0.000009642658,0.0000071020845,0.00011968373],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992548,0.00009414753,0.00014078004,0.00019152871,0.00012851624,0.00019019269],"domain_scores_gemma":[0.99960995,0.000045986922,0.00010911135,0.00018705489,0.000027686378,0.00002018942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032089546,0.0000894363,0.00014334843,0.00006124258,0.00031190112,0.00032066755,0.00019517586,0.0000060420875,0.00008026784],"category_scores_gemma":[0.0000032304768,0.000070898444,0.000029712275,0.00045635665,0.000365535,0.000073842566,0.00008824296,0.00008932785,0.0000030643341],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034387206,0.00014712536,0.75280964,0.0000027860606,0.0000074150366,0.0000022648276,0.0029304863,0.000033942793,0.0007349793,0.019072399,0.0020224827,0.22223304],"study_design_scores_gemma":[0.0012179562,0.0010834972,0.5579149,0.00012783584,0.0002478048,0.000015836911,0.044469055,0.019406872,0.0008458894,0.0046129744,0.36841387,0.0016435224],"about_ca_topic_score_codex":0.0074965246,"about_ca_topic_score_gemma":0.0038817604,"teacher_disagreement_score":0.3663914,"about_ca_system_score_codex":0.0000134058355,"about_ca_system_score_gemma":0.000008862898,"threshold_uncertainty_score":0.99911267},"labels":[],"label_agreement":null},{"id":"W1977307693","doi":"10.1109/icdm.2012.14","title":"Community Preserving Lossy Compression of Social Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lossy compression; Lossless compression; Computer science; Data compression; Social network (sociolinguistics); Compression (physics); Theoretical computer science; Focus (optics); Graph; Data mining; Algorithm; Artificial intelligence; Social media; World Wide Web","score_opus":0.025585928981920397,"score_gpt":0.3014273258260357,"score_spread":0.2758413968441153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977307693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5236159,0.00008434713,0.28181762,0.000054849243,0.000058699825,0.00013406962,0.0000042115803,0.000109227825,0.19412106],"genre_scores_gemma":[0.9979255,4.6915616e-7,0.0011925051,0.000016341868,0.00040434435,0.000006712413,0.000031167434,0.000008963785,0.00041395242],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992716,0.00019325655,0.00018471006,0.00005022858,0.000093111594,0.00020715044],"domain_scores_gemma":[0.99947846,0.0000746652,0.000106171625,0.00025111006,0.00004541077,0.000044197972],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029995403,0.00008401416,0.00018262125,0.000028422324,0.00021382593,0.000012107885,0.00024170282,0.00002862205,0.0017723386],"category_scores_gemma":[0.0000014282124,0.00007352458,0.00010974223,0.00013424591,0.00004174305,0.00012331012,0.0003168138,0.00023196447,0.0000037618618],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001881349,0.0008343058,0.80421805,0.000019335597,0.00019895188,3.8597396e-8,0.0013899435,0.0008845498,0.0010331273,0.08855302,0.080229275,0.022620609],"study_design_scores_gemma":[0.0012417923,0.00011052539,0.7041857,0.00015712775,0.000377104,6.6398246e-7,0.0035494089,0.16995196,0.021488294,0.027670577,0.07003254,0.0012342653],"about_ca_topic_score_codex":0.00078399776,"about_ca_topic_score_gemma":0.000010454659,"teacher_disagreement_score":0.47430962,"about_ca_system_score_codex":0.000007763989,"about_ca_system_score_gemma":0.0000043272726,"threshold_uncertainty_score":0.9991402},"labels":[],"label_agreement":null},{"id":"W1977400111","doi":"10.1073/pnas.1010757107","title":"Nonuniversal power law scaling in the probability distribution of scientific citations","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":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Defense Science and Engineering Graduate; National Institutes of Health; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Institute of General Medical Sciences; U.S. Department of Defense","keywords":"Mechanism (biology); Citation; Exponent; CITES; Computer science; Web of science; Point (geometry); Distribution (mathematics); Mathematical economics; Law; Political science; MEDLINE; Mathematics; Library science; Epistemology; Philosophy; Biology","score_opus":0.02787040732682701,"score_gpt":0.3014482925743217,"score_spread":0.2735778852474947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977400111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921056,0.0000031659756,0.000023385126,0.000873265,0.000011363812,0.00014487338,0.000030513951,0.000004052907,0.0068037505],"genre_scores_gemma":[0.9985369,9.538128e-8,0.0014074123,0.000013413391,0.000024527339,0.000006366327,9.5220605e-7,0.0000010518893,0.000009300408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988825,0.000008873011,0.00024272368,0.00014840382,0.00062762055,0.000089887464],"domain_scores_gemma":[0.99924356,0.0001262768,0.00028528742,0.000013843629,0.00031998617,0.000011051638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020906345,0.000049652463,0.00009016697,0.000072776806,0.0002265066,0.000034986802,0.0006909516,0.00002498696,0.00002358214],"category_scores_gemma":[0.000089396715,0.000030557436,0.000078077406,0.0011581688,0.0014469085,0.0002865565,0.00007917429,0.00017098554,2.1369148e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020615496,0.00007388621,0.036696248,0.000006017218,0.000004857655,2.6939972e-10,0.00022387168,0.00007122037,0.054903455,0.90766835,0.00016003773,0.00019001625],"study_design_scores_gemma":[0.000084527506,0.000013504943,0.22760688,0.00003644607,0.000014507848,2.928272e-7,0.00051840773,0.0020859863,0.07541884,0.6937673,0.0003911806,0.000062111314],"about_ca_topic_score_codex":0.00004673034,"about_ca_topic_score_gemma":0.000001365642,"teacher_disagreement_score":0.213901,"about_ca_system_score_codex":0.000011498684,"about_ca_system_score_gemma":0.00002996797,"threshold_uncertainty_score":0.53311944},"labels":[],"label_agreement":null},{"id":"W1977595081","doi":"10.1109/itw.2010.5593378","title":"Weighted SCAN for modeling cooperative group role dynamics","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Cluster analysis; Group (periodic table); Hierarchical clustering; Rest (music); Graph; Social group; Artificial intelligence; Theoretical computer science; Psychology; Social psychology","score_opus":0.007039069360070681,"score_gpt":0.2514927957370643,"score_spread":0.2444537263769936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977595081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16763,0.000003732441,0.8081832,0.00007039409,0.000038099883,0.00020192559,0.00001902824,0.00009627462,0.023757327],"genre_scores_gemma":[0.95597875,2.9243344e-7,0.042810168,0.000027734835,0.0002732995,0.00007916497,0.00019844613,0.000016974303,0.00061518117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993962,0.000009950102,0.00015602371,0.00019343803,0.000062451516,0.00018191314],"domain_scores_gemma":[0.9995523,0.000034127068,0.00003588376,0.00021086185,0.00011567008,0.000051142673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009454186,0.000112911024,0.0001535017,0.000042979365,0.00013427026,0.00005641892,0.00014508066,0.00002956395,0.0005599213],"category_scores_gemma":[0.0000014163252,0.00009750094,0.00010888281,0.00011664707,0.000019634896,0.00008369443,0.000045398654,0.00014029533,0.0000067581745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009175387,0.00008438446,0.0027891889,0.0000013806829,0.000084180894,5.1418986e-8,0.000049140628,0.00080294796,0.003146868,0.95623404,0.00064153003,0.03615711],"study_design_scores_gemma":[0.00013603772,0.000019264353,0.000014127694,0.0000022995584,0.000023853003,7.9767936e-8,0.00011695433,0.9419547,0.00089843705,0.055395957,0.0013108292,0.00012750742],"about_ca_topic_score_codex":0.00044769162,"about_ca_topic_score_gemma":0.0009738669,"teacher_disagreement_score":0.9411517,"about_ca_system_score_codex":0.000013910706,"about_ca_system_score_gemma":0.000017979808,"threshold_uncertainty_score":0.6130746},"labels":[],"label_agreement":null},{"id":"W1977804969","doi":"10.1007/s13278-014-0171-y","title":"Social media analysis and summarization for opinion mining: a business case study","year":2014,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Bank of Canada; University of Calgary","funders":"","keywords":"Automatic summarization; Computer science; Social media; Diversity (politics); Subject (documents); Variety (cybernetics); Sentiment analysis; Data science; Microblogging; Public opinion; World Wide Web; Information retrieval; Internet privacy; Artificial intelligence; Sociology; Political science","score_opus":0.02241678001222896,"score_gpt":0.3019833421825592,"score_spread":0.2795665621703302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977804969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7620018,0.00007611433,0.2372685,0.00008417018,0.000052296462,0.0002308542,0.000014658508,0.00005753883,0.00021405745],"genre_scores_gemma":[0.99309546,0.000007932775,0.0035130107,0.00002592208,0.0027557632,0.00008525655,0.00045266215,0.000027300852,0.00003666765],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9979235,0.00026498412,0.00055429654,0.0006077108,0.0002249977,0.0004245093],"domain_scores_gemma":[0.9985224,0.000511672,0.00042621855,0.00018072456,0.00025791384,0.00010108436],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010001116,0.0003011834,0.0010468734,0.0005058807,0.0013675024,0.00024936418,0.000117184114,0.00009778723,0.000034637975],"category_scores_gemma":[0.00003038607,0.0003080423,0.00047446165,0.004582147,0.000099004275,0.00012245403,0.00014154591,0.000102669015,1.9666948e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031204607,0.00014582931,0.8654226,0.000011779481,0.010295543,0.000004258205,0.0099471295,0.0010310932,0.0000039679126,0.002244781,0.0009909268,0.10987088],"study_design_scores_gemma":[0.0028600625,0.00020009284,0.49369502,0.000031533236,0.082226485,0.0000045906563,0.046289418,0.36346576,0.0000059943472,0.0057638586,0.0035698814,0.0018873041],"about_ca_topic_score_codex":0.0007261156,"about_ca_topic_score_gemma":0.0031602106,"teacher_disagreement_score":0.3717276,"about_ca_system_score_codex":0.000020398178,"about_ca_system_score_gemma":0.000022538223,"threshold_uncertainty_score":0.9999372},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06144235142182627,"score_gpt":0.34881920195504457,"score_spread":0.2873768505332183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978323161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13642183,0.0028564443,0.81728894,0.0009869684,0.0001721831,0.0010318211,0.000013172108,0.0002622701,0.04096639],"genre_scores_gemma":[0.9978236,0.00039594874,0.00023901419,0.00039911663,0.0010202093,0.000055254535,0.00003294981,0.000019726704,0.000014167166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989001,0.00015634096,0.00030896367,0.0002520832,0.00015154663,0.00023093232],"domain_scores_gemma":[0.99909574,0.00023291202,0.00011615393,0.00044325172,0.000043916258,0.000068029876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027791408,0.00018037496,0.00041747765,0.000017393606,0.000093983086,0.000017177392,0.0002937752,0.000017438984,0.00012308366],"category_scores_gemma":[0.000016199965,0.00011616926,0.00037434688,0.00021117348,0.000032616015,0.000086128915,0.00009764306,0.00045561968,0.00006999297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033866327,0.00071531546,0.01449187,0.00010924803,0.00062048185,0.0000011510529,0.00023393078,0.015304036,0.000030376925,0.42838362,0.0099870935,0.530089],"study_design_scores_gemma":[0.00004700608,0.000039590497,0.0004712461,0.00047906514,0.00025531184,1.5374886e-7,0.000009153595,0.9457912,0.000027044314,0.049827766,0.0028664784,0.00018601006],"about_ca_topic_score_codex":0.00013768891,"about_ca_topic_score_gemma":0.0000017922777,"teacher_disagreement_score":0.93048716,"about_ca_system_score_codex":0.00003080781,"about_ca_system_score_gemma":0.000008148281,"threshold_uncertainty_score":0.47372448},"labels":[],"label_agreement":null},{"id":"W1980019620","doi":"10.1140/epjb/e2014-50026-4","title":"Edge-ratio network clustering by Variable Neighborhood Search","year":2014,"lang":"en","type":"article","venue":"The European Physical Journal B","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristic; Enhanced Data Rates for GSM Evolution; Cluster analysis; Identification (biology); Variable neighborhood search; Hierarchical clustering; Graph; Computer science; Cluster (spacecraft); Clustering coefficient; Variable (mathematics); Graph theory; Mathematics; Algorithm; Combinatorics; Mathematical optimization; Theoretical computer science; Artificial intelligence; Metaheuristic","score_opus":0.010123891358606309,"score_gpt":0.2430100253457464,"score_spread":0.2328861339871401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980019620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035412519,0.000031192274,0.6274358,0.00017534303,0.00009487461,0.000070993774,0.0000025483018,0.000059938582,0.36858806],"genre_scores_gemma":[0.9848069,0.000003135172,0.001321587,0.00012228338,0.012968536,0.0000021193125,0.0000097980255,0.00004957632,0.00071604387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977851,0.0010367669,0.00026782588,0.00019575571,0.00027528996,0.00043926213],"domain_scores_gemma":[0.99903274,0.00019790458,0.00014072446,0.00039854532,0.00008073054,0.00014934737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012401269,0.00018910784,0.000245443,0.000022539729,0.00052924216,0.00031285765,0.0006624244,0.0000100339885,0.0001742583],"category_scores_gemma":[0.000005812654,0.00012804578,0.00018865279,0.00028586414,0.000054687953,0.0001348545,0.0002890594,0.0006608578,0.00017534477],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036298632,0.0003176918,0.001669518,0.000007244855,0.00046715766,0.0000048230772,0.000507041,0.030951405,0.009103097,0.09772249,0.35736996,0.5018433],"study_design_scores_gemma":[0.0015590652,0.0005174918,0.0016800785,0.00024098773,0.00047825693,0.000038218765,0.00023348382,0.4030168,0.0016720728,0.38651648,0.20266643,0.0013806516],"about_ca_topic_score_codex":0.000011120873,"about_ca_topic_score_gemma":2.0007515e-7,"teacher_disagreement_score":0.98126566,"about_ca_system_score_codex":0.00002035675,"about_ca_system_score_gemma":0.000016032354,"threshold_uncertainty_score":0.5221555},"labels":[],"label_agreement":null},{"id":"W1980180555","doi":"10.1145/1643823.1643875","title":"An environment for building, exploring and querying academic social networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Data science; Field (mathematics); Process (computing); Set (abstract data type); Social network analysis; Social network (sociolinguistics); Citation; Computational sociology; Scale (ratio); Maturity (psychological); Complex network; Knowledge management; World Wide Web; Social media; Psychology","score_opus":0.04197986674602465,"score_gpt":0.31086314985259567,"score_spread":0.268883283106571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980180555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25457147,0.000055810255,0.74452096,0.00013907414,0.000012500165,0.0001396216,0.0000010895163,0.000077613935,0.00048187355],"genre_scores_gemma":[0.9856482,0.000019402625,0.013226276,0.000082921564,0.000898891,0.00005891861,0.0000127686235,0.000010670692,0.0000419229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932194,0.000016495975,0.00015654962,0.00021685082,0.00006272461,0.00022543289],"domain_scores_gemma":[0.9997546,0.000025101308,0.000053791733,0.00010425871,0.000006785524,0.000055468725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014056756,0.00011094399,0.00014722237,0.000034671535,0.00019341157,0.0000366728,0.0001008832,0.000033435623,0.00007441635],"category_scores_gemma":[4.3759576e-7,0.000110075845,0.00006778893,0.000044162618,0.000017829776,0.00017766793,0.000027263028,0.0001308952,5.659134e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015435979,0.0000667397,0.017316239,0.0000020761447,0.000053520893,1.8019239e-7,0.00025977788,0.004029212,0.002687529,0.15095147,0.0018057058,0.8228121],"study_design_scores_gemma":[0.001651021,0.0005874293,0.058078308,0.00006529886,0.00038042577,0.00000123108,0.001266222,0.62059104,0.010678031,0.22166647,0.083152145,0.0018823892],"about_ca_topic_score_codex":0.000022624361,"about_ca_topic_score_gemma":6.3679454e-7,"teacher_disagreement_score":0.8209297,"about_ca_system_score_codex":0.000017299793,"about_ca_system_score_gemma":0.0000032735547,"threshold_uncertainty_score":0.44887626},"labels":[],"label_agreement":null},{"id":"W1980666253","doi":"10.1007/s11390-008-9148-5","title":"Clustering by Pattern Similarity","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Similarity (geometry); Cluster analysis; Computer science; Closeness; Set (abstract data type); Data mining; Euclidean distance; Artificial intelligence; Task (project management); Range (aeronautics); Pattern recognition (psychology); Mathematics; Image (mathematics)","score_opus":0.009573061431451745,"score_gpt":0.24141486421708222,"score_spread":0.23184180278563046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980666253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43660334,0.000070439346,0.5624089,0.00070785126,0.00005634695,0.000020010144,4.7105303e-7,0.000019364361,0.000113273614],"genre_scores_gemma":[0.9882192,0.000017785533,0.01154493,0.00008190026,0.00012597213,5.738162e-7,1.6054268e-7,0.0000028141708,0.000006663156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992755,0.000008942791,0.00021859865,0.00012455197,0.00020411465,0.0001682938],"domain_scores_gemma":[0.9993523,0.000015972171,0.00017559793,0.00014256345,0.0002600979,0.000053493302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028466276,0.00007078657,0.00018090977,0.00031461945,0.0001816507,0.000032408,0.00041081035,0.000026572972,0.000013998484],"category_scores_gemma":[0.0000033917931,0.000058506026,0.00003531372,0.00060341286,0.00044043508,0.00020429137,0.00023568716,0.00019171415,9.049791e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027179262,0.00010115991,0.18218575,0.0000026857583,0.000041407588,0.000025153538,0.00011511401,0.0000378959,0.0041451403,0.00091299857,0.01154079,0.8008892],"study_design_scores_gemma":[0.0038661454,0.0033705104,0.04849117,0.00034212045,0.00020301598,0.0036647355,0.00035589142,0.60093546,0.11744795,0.10674823,0.112506375,0.002068374],"about_ca_topic_score_codex":0.000009084445,"about_ca_topic_score_gemma":7.424249e-7,"teacher_disagreement_score":0.7988208,"about_ca_system_score_codex":0.000016323065,"about_ca_system_score_gemma":0.00006542374,"threshold_uncertainty_score":0.23858066},"labels":[],"label_agreement":null},{"id":"W1980757347","doi":"10.1109/cidm.2013.6597236","title":"Transaction-based link strength prediction in a social network","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Friendship; Computer science; Matrix decomposition; Social network (sociolinguistics); Database transaction; Non-negative matrix factorization; Artificial intelligence; Matrix (chemical analysis); Data mining; Machine learning; Link (geometry); Big data; Theoretical computer science; Gradient descent; Artificial neural network; Social media; World Wide Web; Computer network; Database","score_opus":0.008389720976984968,"score_gpt":0.23544032272435908,"score_spread":0.22705060174737413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980757347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18571532,0.000017342883,0.7238776,0.002082752,0.00013661709,0.00072908355,0.000013917812,0.00049782416,0.08692953],"genre_scores_gemma":[0.9959775,2.395516e-7,0.0022560554,0.000055430177,0.0010653139,0.00011424467,0.00004896478,0.000009981744,0.00047224542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931663,0.00004002843,0.00020173268,0.00015236906,0.00008996733,0.00019927933],"domain_scores_gemma":[0.9997547,0.000034578454,0.00004340166,0.00010201655,0.000033568766,0.000031702217],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007524715,0.00009451185,0.00013523272,0.000056713634,0.00009217362,0.00004019949,0.0000742064,0.000035278954,0.006659962],"category_scores_gemma":[4.022521e-7,0.00009038232,0.00010305121,0.00029818295,0.000021906766,0.00009480011,0.000006289378,0.00013796729,0.000052363073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022054795,0.00042143033,0.33741194,0.000009349333,0.00016413981,4.8584565e-7,0.00019884958,0.018316451,0.00041272477,0.033488788,0.108261354,0.5012924],"study_design_scores_gemma":[0.0014870398,0.00010169163,0.143483,0.000044376884,0.000096529984,1.13020484e-7,0.00021970009,0.7223402,0.0016151926,0.11106925,0.018952364,0.00059051247],"about_ca_topic_score_codex":0.0010233263,"about_ca_topic_score_gemma":0.00008173256,"teacher_disagreement_score":0.8102622,"about_ca_system_score_codex":0.000025261908,"about_ca_system_score_gemma":0.000022673667,"threshold_uncertainty_score":0.9942481},"labels":[],"label_agreement":null},{"id":"W1981096766","doi":"10.1080/13614560208914740","title":"Searching the hypermedia Web: improved topic distillation through network analytic relevance ranking","year":2002,"lang":"en","type":"article","venue":"New Review of Hypermedia and Multimedia","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; St. Michael's Hospital","funders":"","keywords":"Relevance (law); Ranking (information retrieval); Computer science; Information retrieval; Set (abstract data type); Hypermedia; Hyperlink; Variance (accounting); Regression analysis; Search engine; Regression; Network analysis; Web page; Statistics; Machine learning; World Wide Web; Mathematics; Engineering","score_opus":0.01925216485857263,"score_gpt":0.27267773176767285,"score_spread":0.25342556690910023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981096766","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2167607,0.7036795,0.01956601,0.01107577,0.0020527134,0.006187496,0.000075951575,0.0005368759,0.04006496],"genre_scores_gemma":[0.9274821,0.058366396,0.010660195,0.00055514683,0.0023071615,0.000054502747,0.00006675762,0.00003763931,0.00047006804],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982149,0.00014818305,0.0005871023,0.0003550134,0.00030220213,0.00039260346],"domain_scores_gemma":[0.9982432,0.0007270812,0.00031299025,0.000506586,0.00008688041,0.00012326374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040095433,0.00025652116,0.00062754547,0.000037555328,0.00017010285,0.000034975234,0.0002969999,0.000045957346,0.0007162216],"category_scores_gemma":[0.00014433051,0.00017831678,0.00023972019,0.00043505052,0.00017841824,0.00016870964,0.00011923863,0.0003192709,0.000016660179],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075487164,0.000056295834,0.015053235,0.0006446273,0.00019697114,0.0000020111263,0.00078504457,0.000041891133,0.00068547507,0.0017519497,0.017739821,0.9630351],"study_design_scores_gemma":[0.002549361,0.00018098399,0.01542673,0.010198489,0.0017697392,0.000016937827,0.00019191788,0.3616953,0.0003809015,0.012481871,0.59377974,0.0013280342],"about_ca_topic_score_codex":0.00015009104,"about_ca_topic_score_gemma":0.000026570711,"teacher_disagreement_score":0.9617071,"about_ca_system_score_codex":0.000019766543,"about_ca_system_score_gemma":0.0000434752,"threshold_uncertainty_score":0.7842124},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Kempe Foundation","keywords":"Computer science; Cascade; Theoretical computer science; Graph; Algorithm; Artificial intelligence","score_opus":0.023294515532490696,"score_gpt":0.2336198565520808,"score_spread":0.2103253410195901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981377410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29531845,0.00000990509,0.57160693,0.000005505193,0.0000091926095,0.00005829309,5.134564e-7,0.000043190626,0.13294803],"genre_scores_gemma":[0.9941083,0.0000011439095,0.0057000234,0.000009236368,0.000030911935,0.0000064281994,0.000004191774,0.0000033363322,0.0001363986],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996787,0.0000103833545,0.00012776349,0.00007519642,0.00003922318,0.00006873493],"domain_scores_gemma":[0.9996669,0.000010053637,0.00006780643,0.00018957049,0.00004783311,0.000017793389],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000563072,0.000041645406,0.00007445685,0.00002464912,0.000014947956,0.0000030425156,0.000103002516,0.000010116827,0.0011133258],"category_scores_gemma":[6.2621103e-7,0.000037242393,0.000042355703,0.00012640127,0.000024030189,0.0000496274,0.000024226543,0.0000324694,0.000008162066],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005083959,0.00008564562,0.67694294,0.0000012991463,0.00004361214,6.25213e-8,0.00011699494,0.0008516382,0.0004057418,0.2980766,0.001095473,0.022374881],"study_design_scores_gemma":[0.00020373653,0.00007058848,0.79594076,0.000028027293,0.0000915656,1.6004996e-7,0.00016933374,0.063815325,0.047982577,0.089358054,0.00199505,0.00034479302],"about_ca_topic_score_codex":0.00044707893,"about_ca_topic_score_gemma":0.000003021383,"teacher_disagreement_score":0.6987899,"about_ca_system_score_codex":0.0000023977625,"about_ca_system_score_gemma":0.000004501199,"threshold_uncertainty_score":0.9997998},"labels":[],"label_agreement":null},{"id":"W1982313773","doi":"10.1239/aap/1427814580","title":"The Mixing Time of the Newman-Watts Small-World Model","year":2015,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Mixing (physics); Upper and lower bounds; Random walk; Combinatorics; Logarithm; Small-world network; Random graph; Order (exchange); Binary logarithm; Graph; Discrete mathematics; Statistical physics; Mathematical analysis; Complex network; Statistics","score_opus":0.023467631182763748,"score_gpt":0.26857203660776013,"score_spread":0.2451044054249964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982313773","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38861457,0.0010123388,0.10359654,0.0008172334,0.00015760129,0.003005107,0.000022929737,0.00020372952,0.50257],"genre_scores_gemma":[0.98928106,0.0000029459368,0.010207207,0.00002361704,0.000059899754,0.00013633065,0.0000034357558,0.000010379352,0.00027512145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885803,0.000074756936,0.00037345814,0.00026638585,0.00018567672,0.00024171695],"domain_scores_gemma":[0.9987806,0.0001887972,0.00019040098,0.0007403883,0.000057568795,0.00004226142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075514807,0.0001410314,0.00022809861,0.000024082376,0.000109005996,0.000015589989,0.0005613817,0.00001984431,0.000016127122],"category_scores_gemma":[0.00001376636,0.00008548916,0.00010188182,0.0004303089,0.00023161671,0.000068187335,0.00026327872,0.00020065464,0.000005443661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011832772,0.00033473398,0.091746375,0.000032701555,0.000054843073,8.80229e-8,0.00060658314,0.18159245,0.00048684422,0.55618757,0.0006316795,0.16820781],"study_design_scores_gemma":[0.00018514924,0.0000065284075,0.00048552133,0.000017727685,0.000014912561,4.106689e-8,0.000049750877,0.047778353,0.0027727573,0.9411527,0.0074139433,0.00012264238],"about_ca_topic_score_codex":0.000051722745,"about_ca_topic_score_gemma":0.00044087588,"teacher_disagreement_score":0.6006665,"about_ca_system_score_codex":0.00006504728,"about_ca_system_score_gemma":0.000067699926,"threshold_uncertainty_score":0.34861466},"labels":[],"label_agreement":null},{"id":"W1983309476","doi":"10.1109/asonam.2012.43","title":"User Features and Social Networks for Topic Modeling in Online Social Media","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Social media; Computer science; Social media optimization; World Wide Web","score_opus":0.03182874442394712,"score_gpt":0.296544951320988,"score_spread":0.2647162068970409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983309476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7451232,0.00019575999,0.25229678,0.000533862,0.00009516246,0.00021856643,0.000015539948,0.00006926896,0.0014518515],"genre_scores_gemma":[0.99273574,0.0000018502793,0.003851057,0.000076110795,0.0030701365,0.000023845589,0.00010233814,0.000011285365,0.00012763879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940854,0.000019997899,0.00014222316,0.000111886286,0.00005664543,0.00026070423],"domain_scores_gemma":[0.99980557,0.000061969826,0.000031897773,0.00004920112,0.000023538098,0.000027829963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116096235,0.000095101284,0.00017926157,0.00004010531,0.00010247482,0.000025183013,0.000064695436,0.000050457424,0.00007751395],"category_scores_gemma":[0.0000015974362,0.0000866545,0.00007884576,0.00007368109,0.000016701983,0.00008877793,0.00005398763,0.00011563706,3.0000112e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006564723,0.0005800381,0.18284558,0.000021841492,0.0002350031,2.525447e-7,0.005686817,0.0017436633,0.00008517892,0.47806922,0.030355535,0.30031124],"study_design_scores_gemma":[0.0020937626,0.000028944465,0.07541534,0.000024310715,0.00023831466,5.887787e-7,0.0038390353,0.8441298,0.00010820645,0.06214455,0.010947057,0.0010300616],"about_ca_topic_score_codex":0.00009983364,"about_ca_topic_score_gemma":0.00026327444,"teacher_disagreement_score":0.8423862,"about_ca_system_score_codex":0.000012832503,"about_ca_system_score_gemma":0.000006592817,"threshold_uncertainty_score":0.3533668},"labels":[],"label_agreement":null},{"id":"W1983445308","doi":"10.1140/epjb/e2006-00170-5","title":"Modeling network growth with assortative mixing","year":2006,"lang":"en","type":"article","venue":"The European Physical Journal B","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Cancer Agency","funders":"","keywords":"Mixing (physics); Computer science; Statistical physics; Physics","score_opus":0.009484388599079827,"score_gpt":0.23041921667129422,"score_spread":0.2209348280722144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983445308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27079123,0.000044386896,0.45030278,0.00018615932,0.000041315983,0.00009734256,0.000002160948,0.00009036483,0.2784443],"genre_scores_gemma":[0.9885489,0.0000012417879,0.002462028,0.00003000105,0.008689929,0.0000018604371,0.00000571264,0.00004267991,0.00021767647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986127,0.00038644354,0.00023049138,0.00016557648,0.00027649404,0.00032828498],"domain_scores_gemma":[0.9993248,0.00011354557,0.000158507,0.00020042302,0.00013920796,0.00006352447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005397991,0.00017841358,0.00020800144,0.000025660627,0.00044479987,0.00017849483,0.00037898982,0.0000061501496,0.000020188072],"category_scores_gemma":[0.0000019026014,0.00010287301,0.00018411792,0.00026757145,0.000047682737,0.0001298229,0.000083487146,0.0005659945,0.0000360542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008133318,0.0003466622,0.006818144,0.0000040540604,0.0006636278,0.00007312148,0.000735593,0.719098,0.0011268031,0.21453898,0.018663732,0.037850004],"study_design_scores_gemma":[0.0006112188,0.00015109214,0.00349856,0.00016522003,0.00034991014,0.00002446259,0.0002472194,0.1286348,0.0003816013,0.86469215,0.00066813495,0.00057560194],"about_ca_topic_score_codex":0.000095999065,"about_ca_topic_score_gemma":0.000005159807,"teacher_disagreement_score":0.71775764,"about_ca_system_score_codex":0.000018553887,"about_ca_system_score_gemma":0.00001634405,"threshold_uncertainty_score":0.41950396},"labels":[],"label_agreement":null},{"id":"W1983854789","doi":"10.1109/smc.2014.6973949","title":"Extracting deep social relationships from photos","year":2014,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Graph; Object (grammar); Set (abstract data type); Image (mathematics); Information retrieval; Artificial intelligence; Theory of relativity; Data set; Computer vision; Theoretical computer science","score_opus":0.02329365697188389,"score_gpt":0.25967004319310594,"score_spread":0.23637638622122203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983854789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24963647,0.0000042569345,0.5399468,0.00013648735,0.000023851433,0.00005399692,0.0000019504828,0.00013770418,0.2100585],"genre_scores_gemma":[0.98827875,7.553129e-8,0.01039902,0.000032113196,0.0007958794,0.000011559112,0.000043952085,0.000009582019,0.00042906558],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944127,0.0000767284,0.00014443004,0.00014035555,0.00007921742,0.00011798554],"domain_scores_gemma":[0.9995353,0.0002091264,0.00007139437,0.00013135622,0.000024712923,0.000028112798],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015842926,0.00007264687,0.00010940784,0.000026502656,0.0002413074,0.000043726992,0.00009238195,0.000024026982,0.0029899094],"category_scores_gemma":[0.0000075534876,0.000070479124,0.00008847314,0.00009508438,0.000013449581,0.000076174925,0.000033690416,0.00016183211,0.00009489897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067833307,0.0001214395,0.47589457,0.0000014167579,0.00017132967,2.218786e-7,0.0008002261,0.00007319891,0.002415814,0.32136,0.011020151,0.18813488],"study_design_scores_gemma":[0.0005854208,0.000021533577,0.1439145,0.000015752168,0.0002072423,1.8501626e-7,0.0014424147,0.15673159,0.008755483,0.6029163,0.084657446,0.0007521451],"about_ca_topic_score_codex":0.0005550185,"about_ca_topic_score_gemma":0.00007282658,"teacher_disagreement_score":0.7386423,"about_ca_system_score_codex":0.00000917116,"about_ca_system_score_gemma":0.0000050339613,"threshold_uncertainty_score":0.99792147},"labels":[],"label_agreement":null},{"id":"W1984698956","doi":"10.1016/j.physa.2014.10.006","title":"A new method to construct co-author networks","year":2014,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia; University of Toronto","funders":"Program for New Century Excellent Talents in University; Natural Science Foundation of Chongqing; National Natural Science Foundation of China","keywords":"Computer science; PageRank; Node (physics); Citation; Representation (politics); Scheme (mathematics); Quality (philosophy); Construct (python library); Data mining; Theoretical computer science; Community structure; Computer network; Mathematics; World Wide Web; Law; Statistics","score_opus":0.014880673371934801,"score_gpt":0.33727214956454404,"score_spread":0.3223914761926092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984698956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051259114,0.000014184539,0.9960544,0.0004680679,0.000013980119,0.0005162119,0.00013039904,0.000084950974,0.0026665444],"genre_scores_gemma":[0.6682841,0.0000020260782,0.33056676,0.00016549477,0.0004432698,0.000307414,0.00009025039,0.000023974466,0.00011667656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987585,0.00007692163,0.0002755031,0.0004439147,0.00014752512,0.0002976323],"domain_scores_gemma":[0.9986429,0.00048367362,0.00009032605,0.0003202986,0.00008336752,0.00037943074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001927004,0.00019504994,0.000324658,0.0000529785,0.00020459873,0.000088456945,0.00019795264,0.00003323538,0.00032062686],"category_scores_gemma":[0.000012625093,0.00019074052,0.000063000305,0.0003358105,0.0000117873515,0.00004256042,0.00010648197,0.00016776819,0.000065278175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003222227,0.000034305882,0.000008247595,0.0000029008006,0.00003263643,3.904436e-8,0.000015721915,0.000077027806,0.0005267065,0.7824789,0.0050800727,0.21174017],"study_design_scores_gemma":[0.00012636639,0.000054294003,0.000047120666,0.000007474061,0.000088271576,5.533681e-7,0.000017312914,0.3824144,0.00044510752,0.54032445,0.076257005,0.00021764304],"about_ca_topic_score_codex":0.000055581102,"about_ca_topic_score_gemma":0.0000028614577,"teacher_disagreement_score":0.66823286,"about_ca_system_score_codex":0.000012289267,"about_ca_system_score_gemma":0.000029771472,"threshold_uncertainty_score":0.7778173},"labels":[],"label_agreement":null},{"id":"W1984969896","doi":"10.1016/j.tcs.2008.02.037","title":"Cleaning a network with brushes","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Brush; Vertex (graph theory); Graph; Enhanced Data Rates for GSM Evolution; Computer science; Combinatorics; Traverse; Mathematics; Artificial intelligence; Engineering; Electrical engineering","score_opus":0.00811646038885474,"score_gpt":0.22615958601625125,"score_spread":0.2180431256273965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984969896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2053003,0.0000064696046,0.77592033,0.000070875554,0.000034539837,0.00006353296,3.01997e-7,0.0001110747,0.018492557],"genre_scores_gemma":[0.89821935,5.2133424e-7,0.10117846,0.0001066633,0.00046950387,0.000004437384,9.2659786e-7,0.000007784809,0.0000123772425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987253,0.000037262475,0.00013858626,0.00034568514,0.00032370712,0.00042945638],"domain_scores_gemma":[0.9992928,0.0000911546,0.000044011016,0.00035595387,0.00008395304,0.00013214647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035825587,0.00012328061,0.00016973508,0.000048666843,0.0005576381,0.000078358906,0.0005457186,0.000011206245,0.00028797137],"category_scores_gemma":[0.0000019756226,0.00008994685,0.000051380568,0.0008347996,0.0024305165,0.00014734193,0.00026711533,0.00013581474,0.000027809077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007590606,0.00002494409,0.011293809,4.743378e-7,0.000008709615,0.0000045845986,0.00011147542,0.0011952784,0.000019175666,0.9755451,0.00031613506,0.011472733],"study_design_scores_gemma":[0.00034949172,0.00039137702,0.015479014,0.000078823075,0.00003497259,0.00004575039,0.00002141581,0.5019256,0.0018335443,0.47818285,0.0010395115,0.0006176606],"about_ca_topic_score_codex":0.000011352254,"about_ca_topic_score_gemma":4.7812193e-7,"teacher_disagreement_score":0.692919,"about_ca_system_score_codex":0.000014169242,"about_ca_system_score_gemma":0.000057144767,"threshold_uncertainty_score":0.895534},"labels":[],"label_agreement":null},{"id":"W1985219999","doi":"10.1103/physreve.76.021101","title":"Phase transition of a one-dimensional Ising model with distance-dependent connections","year":2007,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Particle Physics","funders":"","keywords":"Ising model; Scaling; Statistical physics; Phase transition; Monte Carlo method; Critical exponent; Physics; Mean field theory; Range (aeronautics); Condensed matter physics; Mathematics; Statistics; Materials science; Geometry","score_opus":0.025272981525431858,"score_gpt":0.3392130088204255,"score_spread":0.31394002729499365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985219999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13655642,0.00076832005,0.85964674,0.00018302388,0.000006388841,0.00027670478,0.000026404496,0.00004144638,0.0024945654],"genre_scores_gemma":[0.9968394,0.00004901255,0.0028071296,0.00009223943,0.00012116293,0.000020549012,0.00004077057,0.000012457654,0.000017285547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914956,0.000025480575,0.0002500998,0.00018614304,0.00023210961,0.0001565784],"domain_scores_gemma":[0.9994389,0.00006789595,0.0001266376,0.00020376388,0.00010004004,0.0000627891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016854776,0.000118027216,0.00036065246,0.000028652494,0.000060762246,0.0000066553716,0.000071691386,0.000007760159,0.00007428738],"category_scores_gemma":[0.000002251096,0.00009672868,0.00018005984,0.00024198632,0.0000474874,0.00008112604,0.000014510015,0.00011236178,0.000004731481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038510273,0.01457496,0.00023987486,0.0010825443,0.00090558815,0.0000059954123,0.0005648413,0.010026569,0.05599053,0.62464803,0.0016075184,0.28996843],"study_design_scores_gemma":[0.0050281063,0.0012091509,0.00014673859,0.010323949,0.003244592,0.0000053017543,0.00011860523,0.6623152,0.07931718,0.23296517,0.0037852237,0.001540796],"about_ca_topic_score_codex":0.000032747776,"about_ca_topic_score_gemma":0.000010456274,"teacher_disagreement_score":0.86028296,"about_ca_system_score_codex":0.000021320999,"about_ca_system_score_gemma":0.000025309659,"threshold_uncertainty_score":0.39444813},"labels":[],"label_agreement":null},{"id":"W198523258","doi":"10.1007/978-3-642-25501-4_4","title":"Connectivity Criteria for Ranking Network Nodes","year":2011,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Centrality; Computer science; Hierarchy; Measure (data warehouse); Ranking (information retrieval); Node (physics); Enhanced Data Rates for GSM Evolution; Weighted network; Data mining; Theoretical computer science; Complex network; Artificial intelligence; Mathematics; Combinatorics; World Wide Web","score_opus":0.06259090798941008,"score_gpt":0.32932694746690916,"score_spread":0.2667360394774991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198523258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007432272,0.00011683684,0.6676173,0.000079552854,0.00009895241,0.0003604457,0.000021595546,0.000046176643,0.33158478],"genre_scores_gemma":[0.78896713,0.00037242958,0.20853506,0.0003654277,0.0003315311,0.00014625667,0.00028258283,0.000019772911,0.0009798054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990284,0.00002042935,0.00045786935,0.00017061298,0.00013158277,0.00019113022],"domain_scores_gemma":[0.99809146,0.00023289034,0.00029571456,0.0010430015,0.00029112044,0.000045826302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095318875,0.00016446652,0.00025595623,0.00031157763,0.00049711054,0.00025052633,0.0010496249,0.0000513646,0.00007488977],"category_scores_gemma":[0.000006566143,0.000170953,0.00007414099,0.00017546535,0.0004836718,0.0017951176,0.00087810407,0.0002109682,0.000008406457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027682497,0.000006526815,0.00040997087,0.0000084092935,0.000010920698,8.879993e-9,0.0003519845,0.00007248068,7.1002415e-7,0.8199065,0.00068279915,0.17854695],"study_design_scores_gemma":[0.00030511856,0.000037235994,0.001603708,0.0002890318,0.000035047546,0.0000013520461,0.000015164515,0.26094225,0.0000126175755,0.45150355,0.28480393,0.00045101347],"about_ca_topic_score_codex":0.00003240762,"about_ca_topic_score_gemma":0.000008631892,"teacher_disagreement_score":0.7888928,"about_ca_system_score_codex":0.00004232708,"about_ca_system_score_gemma":0.00008715965,"threshold_uncertainty_score":0.6971261},"labels":[],"label_agreement":null},{"id":"W1985611027","doi":"10.1371/journal.pone.0034523","title":"Exploring Statistical and Population Aspects of Network Complexity","year":2012,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast","keywords":"Ambiguity; Computer science; Measure (data warehouse); Population; Contrast (vision); Diversity (politics); Artificial intelligence; Categorization; Estimator; Structural complexity; Variety (cybernetics); Machine learning; Complex network; Data mining; Mathematics; Statistics; Medicine","score_opus":0.2085753597381901,"score_gpt":0.2831939388728728,"score_spread":0.0746185791346827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985611027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98074526,0.00005498576,0.014867735,0.000017597156,0.000011640091,0.000092377806,0.000009861888,0.000035793757,0.004164769],"genre_scores_gemma":[0.9734653,0.000003812733,0.025985237,0.000004407151,0.00045979745,0.000014826057,0.000051689272,0.000008048121,0.000006852279],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99943924,0.00003479229,0.0001513204,0.00008419361,0.0001173029,0.00017317061],"domain_scores_gemma":[0.99966025,0.000066921595,0.00006635227,0.00012069634,0.000025226544,0.0000605736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113290975,0.00006575451,0.00019632833,0.00002315824,0.000048524173,0.000008916029,0.00003856194,0.000008954491,0.00022234826],"category_scores_gemma":[0.000004571699,0.00006781719,0.0000212229,0.00009399571,0.00003222511,0.00013595786,0.00005091989,0.00006333663,0.000003637306],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042538736,0.00029970525,0.6044842,0.00001329972,0.00010482258,4.4794085e-8,0.00004857955,0.000007109122,0.00022794325,0.39232576,0.000041685784,0.0024425855],"study_design_scores_gemma":[0.00011843075,0.00003283833,0.8833217,0.00007761731,0.00018886419,8.1836134e-8,0.000027595013,0.0030573304,0.0024102684,0.1105918,0.00003304447,0.00014043871],"about_ca_topic_score_codex":0.00024460178,"about_ca_topic_score_gemma":0.000008064391,"teacher_disagreement_score":0.28173393,"about_ca_system_score_codex":0.000008982018,"about_ca_system_score_gemma":0.0000030095423,"threshold_uncertainty_score":0.27655047},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011340116176308866,"score_gpt":0.30442035742864987,"score_spread":0.293080241252341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986763531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8336266,0.028566236,0.117491625,0.0015095486,0.00022797105,0.001606685,0.00005641917,0.00017503383,0.016739864],"genre_scores_gemma":[0.9986448,0.000525544,0.00035429673,0.000066747416,0.00034024633,0.00003102607,0.000013344193,0.0000059997965,0.000017979015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994956,0.0000429023,0.00013944763,0.00014602259,0.000064762,0.000111254376],"domain_scores_gemma":[0.99949247,0.0000763205,0.0000945253,0.00020737124,0.000047208094,0.00008209001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077074386,0.00008678471,0.00028292715,0.00001272229,0.000029284152,0.0000037237662,0.00008189665,0.000008040125,0.00014022415],"category_scores_gemma":[0.000010029036,0.0000719897,0.00012114417,0.000120608485,0.00011226225,0.000041947635,0.000063694955,0.0001411399,0.0000048330025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001936352,0.0002828914,0.012884085,0.00013137325,0.00010494156,3.749039e-7,0.000019603815,0.000021699965,0.0007851333,0.85330164,0.002995017,0.1294539],"study_design_scores_gemma":[0.0005954723,0.00034024697,0.08516275,0.0016848329,0.001989294,8.988241e-7,0.000025659121,0.16384955,0.00065967574,0.70756716,0.037156712,0.0009677551],"about_ca_topic_score_codex":0.000042566517,"about_ca_topic_score_gemma":0.000004606127,"teacher_disagreement_score":0.1650182,"about_ca_system_score_codex":0.0000021668545,"about_ca_system_score_gemma":0.000012406366,"threshold_uncertainty_score":0.29356545},"labels":[],"label_agreement":null},{"id":"W1987182838","doi":"10.1239/jap/1214950363","title":"Bounding the Size and Probability of Epidemics on Networks","year":2008,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Centre for Disease Control","funders":"Los Alamos National Laboratory; Centers for Disease Control and Prevention; Advanced Scientific Computing Research; Division of Mathematical Sciences; U.S. Department of Energy","keywords":"Mathematics; Bounding overwatch; Transmissibility (structural dynamics); Upper and lower bounds; Marginal distribution; Combinatorics; Probability distribution; Population; Unimodality; Statistics; Random variable; Mathematical analysis","score_opus":0.022720868091109656,"score_gpt":0.2505995687641281,"score_spread":0.22787870067301844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987182838","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98598796,0.00005800725,0.009155822,0.0002335918,0.00004596387,0.00039346443,0.0000025229883,0.000013378441,0.004109266],"genre_scores_gemma":[0.99139833,0.000016304835,0.008214992,0.00004837613,0.0002921423,0.000012027377,7.684125e-7,0.000009867278,0.000007166852],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983377,0.00012943486,0.0008483033,0.00020376629,0.00026926887,0.00021156634],"domain_scores_gemma":[0.9975106,0.0009804422,0.00081205997,0.0004283378,0.00018537966,0.000083189436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021833633,0.00016727242,0.00051807024,0.000033707318,0.00019056063,0.000018942768,0.00029078536,0.00005198084,0.00006196592],"category_scores_gemma":[0.00007353791,0.00010826027,0.00023032802,0.00024903988,0.00039422905,0.00006780584,0.00009781939,0.0005082419,4.4643193e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001203998,0.0015053973,0.67377365,0.000117006566,0.0006794708,0.0000029733148,0.0017169295,0.030776432,0.00096727174,0.24027222,0.0028106868,0.04617396],"study_design_scores_gemma":[0.0006576078,0.00026551806,0.07627704,0.00006317622,0.00016133305,0.00001356526,0.00011752188,0.0039560827,0.0017937098,0.9147836,0.0016474479,0.00026339447],"about_ca_topic_score_codex":0.000017807195,"about_ca_topic_score_gemma":0.000003477975,"teacher_disagreement_score":0.6745114,"about_ca_system_score_codex":0.000063736305,"about_ca_system_score_gemma":0.00008116946,"threshold_uncertainty_score":0.44147256},"labels":[],"label_agreement":null},{"id":"W1987683954","doi":"10.1371/journal.pone.0121129","title":"On the Relation between the Small World Structure and Scientific Activities","year":2015,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University","funders":"","keywords":"Productivity; Small-world network; Relation (database); Quality (philosophy); Citation; Computer science; Data science; Field (mathematics); Scientometrics; Knowledge management; Business; World Wide Web; Complex network; Mathematics; Epistemology; Economics","score_opus":0.07461774811662807,"score_gpt":0.23983724159725736,"score_spread":0.1652194934806293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987683954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99500746,0.00003336787,0.00035282222,0.00083117356,0.00001150689,0.00014770919,0.000012661149,0.00002871825,0.003574582],"genre_scores_gemma":[0.9978503,2.0649416e-7,0.00031475036,0.000021745895,0.00024002191,0.000010905977,0.000021886768,0.0000069390553,0.0015332287],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994661,0.0000653559,0.000077407465,0.00012470738,0.00017071502,0.000095676914],"domain_scores_gemma":[0.9994054,0.0002102986,0.000058847072,0.0002634123,0.00003404135,0.000028022652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020865403,0.000069372465,0.00009573852,0.00004318475,0.00021948718,0.00014846123,0.00012961202,0.000011374312,0.00009023033],"category_scores_gemma":[0.0000083169325,0.000038663045,0.000024724837,0.00020040518,0.00009562213,0.000049152193,0.00005992233,0.00015973092,0.0000052589976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027356487,0.00034282217,0.60425854,0.000012435704,0.00100371,2.537121e-7,0.0023510724,0.00007583736,0.003513604,0.357414,0.012161895,0.018838452],"study_design_scores_gemma":[0.0003504593,0.00009850886,0.105722696,0.00017894588,0.00068874133,9.7398775e-8,0.0005594194,0.0047074626,0.04262001,0.8397571,0.00490902,0.00040756265],"about_ca_topic_score_codex":0.000029839159,"about_ca_topic_score_gemma":0.00004086695,"teacher_disagreement_score":0.49853587,"about_ca_system_score_codex":0.00001286819,"about_ca_system_score_gemma":0.000014130116,"threshold_uncertainty_score":0.168814},"labels":[],"label_agreement":null},{"id":"W1988019345","doi":"10.1145/2492517.2492522","title":"Spectral embedding for dynamic social networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Queen's University","funders":"","keywords":"Embedding; Computer science; Artificial intelligence","score_opus":0.008315301290854992,"score_gpt":0.28407397988938965,"score_spread":0.27575867859853465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988019345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04813373,0.000009007994,0.9311796,0.00022485007,0.000042016134,0.00029204402,0.0000021298993,0.00012913461,0.019987527],"genre_scores_gemma":[0.9852228,3.3165884e-7,0.01216961,0.000049741742,0.0006443655,0.0001309164,0.000040997482,0.000015739626,0.0017254845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937654,0.000011014207,0.00014299147,0.00015276138,0.00005118191,0.00026550682],"domain_scores_gemma":[0.99973375,0.000038758677,0.000047830796,0.00010361952,0.000041803516,0.00003421906],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005571581,0.000099200464,0.00014712034,0.000030751555,0.0001432854,0.000078100784,0.00011874202,0.000023746681,0.0028328355],"category_scores_gemma":[5.8589177e-7,0.00009055363,0.0001813885,0.00009549342,0.00001900893,0.000088839675,0.000036290832,0.00007295523,0.000028456845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012631624,0.00019707861,0.021845246,0.0000091498405,0.0004850743,2.513465e-7,0.00020410666,0.0072782454,0.00085567444,0.37743902,0.2945371,0.29713643],"study_design_scores_gemma":[0.0001436106,0.000015634369,0.0028416493,0.0000026927596,0.000028941398,8.1053905e-8,0.00010065329,0.9363243,0.000094407136,0.057846457,0.0024354118,0.0001661553],"about_ca_topic_score_codex":0.00015288834,"about_ca_topic_score_gemma":0.000012976677,"teacher_disagreement_score":0.9370891,"about_ca_system_score_codex":0.000019950408,"about_ca_system_score_gemma":0.000007397619,"threshold_uncertainty_score":0.9980787},"labels":[],"label_agreement":null},{"id":"W1989057468","doi":"10.1016/j.physa.2004.11.039","title":"Weighted networks of scientific communication: the measurement and topological role of weight","year":2004,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Clustering coefficient; Econophysics; Cluster analysis; Connection (principal bundle); Citation; Inverse; Computer science; Mathematics; Statistics; Topology (electrical circuits); Theoretical computer science; Combinatorics; Library science","score_opus":0.016149215905853435,"score_gpt":0.25644503687291215,"score_spread":0.2402958209670587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989057468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011573611,0.0007966442,0.98538303,0.0005383628,0.000009357756,0.00057180476,0.00010930993,0.000022968095,0.0009949091],"genre_scores_gemma":[0.99250937,0.000063356514,0.007159879,0.000011286625,0.000038313836,0.00016986087,0.000037874197,0.0000069296343,0.0000031307093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915075,0.000040025978,0.00027578347,0.00020900983,0.00019569529,0.00012875153],"domain_scores_gemma":[0.9990316,0.00015933774,0.00015297985,0.00036564426,0.00023043322,0.000060019916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023916452,0.00010236298,0.00020804841,0.000027097498,0.000266435,0.000032125285,0.0002083471,0.000022733075,0.000041673957],"category_scores_gemma":[0.000006191054,0.00007411868,0.00004095725,0.00027354513,0.00015776497,0.000035059104,0.00015221188,0.000116229516,0.0000011252183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042197685,0.00016736475,0.000019115647,0.000005551312,0.000042127536,1.2751044e-8,0.00006257702,0.000030540592,0.00247591,0.9857026,0.000031793403,0.01145822],"study_design_scores_gemma":[0.00014420105,0.000038349182,0.00027335004,0.000017559982,0.00009659649,2.114621e-7,0.00009875884,0.058142114,0.0030512952,0.9361243,0.0019282739,0.00008497829],"about_ca_topic_score_codex":0.000038999016,"about_ca_topic_score_gemma":0.000007663967,"teacher_disagreement_score":0.98093575,"about_ca_system_score_codex":0.000011277319,"about_ca_system_score_gemma":0.000027989558,"threshold_uncertainty_score":0.3022472},"labels":[],"label_agreement":null},{"id":"W1989237035","doi":"10.1109/icsmc.2011.6084089","title":"Calculating the strength of ties of a social network in a semantic search system using hidden Markov models","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Semantic search; Social Semantic Web; Scalability; Semantic Web; Information retrieval; Semantic analytics; Semantics (computer science); Semantic technology; Semantic computing; World Wide Web; Semantic Web Stack; Semantic grid; Software agent; Artificial intelligence; Database","score_opus":0.053155345617176955,"score_gpt":0.28018735328216804,"score_spread":0.2270320076649911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989237035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9415673,0.00002436301,0.039856784,0.000004990569,0.000010433884,0.00016891341,0.0000030556776,0.00002164354,0.018342502],"genre_scores_gemma":[0.9896163,2.1295521e-7,0.0102123255,0.0000016124897,0.00011112951,0.000006395064,0.0000023799937,0.0000108795775,0.000038762126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899745,0.00014320372,0.00037599608,0.00011950325,0.0001574429,0.00020642637],"domain_scores_gemma":[0.9995183,0.000065232314,0.00015425362,0.00017988357,0.00006670389,0.000015651392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041513014,0.00009486097,0.00029762916,0.000059298352,0.000072997595,0.000009292139,0.00018228061,0.000026242938,0.000101157326],"category_scores_gemma":[7.522775e-7,0.00006957566,0.00012926743,0.00033273522,0.0000613638,0.000056616762,0.00013953248,0.000093801704,2.5873712e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006250476,0.00022456466,0.24075226,0.00022623484,0.0005678291,0.0000017430536,0.01211522,0.012961588,0.0005956888,0.71252227,0.00024853056,0.019721575],"study_design_scores_gemma":[0.00014158676,0.000015143242,0.0032122897,0.00015034666,0.0000736216,2.8138575e-7,0.005102581,0.9836304,0.00085098995,0.006709581,0.0000021329324,0.00011101461],"about_ca_topic_score_codex":0.006513613,"about_ca_topic_score_gemma":0.00012283378,"teacher_disagreement_score":0.97066885,"about_ca_system_score_codex":0.00002296547,"about_ca_system_score_gemma":0.000035218294,"threshold_uncertainty_score":0.9846678},"labels":[],"label_agreement":null},{"id":"W1989960380","doi":"10.1103/physreve.79.036113","title":"Heterogeneous bond percolation on multitype networks with an application to epidemic dynamics","year":2009,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":106,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Ministry of Health, British Columbia; Fonds Québécois de la Recherche sur la Nature et les Technologies; Michael Smith Health Research BC","keywords":"Percolation (cognitive psychology); Statistical physics; Percolation threshold; Bond; Dynamics (music); Computer science; Physics; Economics; Quantum mechanics","score_opus":0.011076673837278676,"score_gpt":0.31912273608322245,"score_spread":0.3080460622459438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989960380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18974845,0.0006362651,0.80338514,0.0010606159,0.000016034584,0.001677109,0.00000996693,0.00021682524,0.0032495733],"genre_scores_gemma":[0.99604326,0.000078927755,0.0021028398,0.0011167732,0.00037495172,0.0000936764,0.00016257068,0.000015978636,0.000010995863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990711,0.000058008678,0.00019725716,0.00033121015,0.00014720035,0.00019519264],"domain_scores_gemma":[0.9991927,0.000047715563,0.00010588304,0.000465743,0.00006545399,0.00012249583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011771476,0.00017346807,0.0003464365,0.00002723781,0.0000709076,0.000022973574,0.00016903298,0.000015051851,0.000017013153],"category_scores_gemma":[0.0000045738143,0.00013993427,0.00011397525,0.00032993773,0.000012501493,0.000079794154,0.000018504059,0.0001491027,0.000045028115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003946381,0.0005612979,0.0017461843,0.000029268847,0.000039052426,5.6289474e-7,0.000024709203,0.027665481,0.00019369234,0.053572413,0.0006994439,0.9154284],"study_design_scores_gemma":[0.0001243508,0.0006772943,0.0034125536,0.00045404042,0.00016355819,6.94065e-7,0.0000032327862,0.97662514,0.00012163052,0.014591016,0.0034448947,0.00038159871],"about_ca_topic_score_codex":0.000041462572,"about_ca_topic_score_gemma":0.000023722137,"teacher_disagreement_score":0.94895965,"about_ca_system_score_codex":0.00005806747,"about_ca_system_score_gemma":0.000009080931,"threshold_uncertainty_score":0.5706354},"labels":[],"label_agreement":null},{"id":"W1990112073","doi":"10.1007/s13278-014-0233-1","title":"Modeling and predicting cascading removal phenomenon over social networks","year":2014,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Cascading failure; Computer science; Phenomenon; Generality; Rumor; Maximization; Distributed computing; Interdependent networks; Cascade; Intuition; Theoretical computer science; Artificial intelligence; Complex network; Mathematical optimization; Mathematics; Engineering","score_opus":0.01041030318758127,"score_gpt":0.25434723836805945,"score_spread":0.24393693518047818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990112073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6231303,0.00027770482,0.37248218,0.000049425726,0.000046670488,0.00007677483,0.0000025966538,0.00008664282,0.0038476943],"genre_scores_gemma":[0.9903609,0.000020800291,0.0038687224,0.00008135749,0.005468629,0.000014342057,0.00006161325,0.000036637564,0.000086982116],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790245,0.00019473904,0.0005007669,0.0005518089,0.00022358102,0.0006266689],"domain_scores_gemma":[0.9992874,0.00013708846,0.0002471893,0.00014474723,0.00006613986,0.00011741976],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009821025,0.0003051772,0.0007724113,0.00017709816,0.0015932323,0.00024386542,0.00013272243,0.00011770069,0.00007356446],"category_scores_gemma":[0.0000067928986,0.00032330528,0.00035795872,0.0011126916,0.00009284956,0.00014768938,0.00022391121,0.00029033594,3.844304e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037820202,0.000054949058,0.50873715,0.000017831904,0.0049913162,0.0000033341344,0.0048818737,0.19233839,0.00003722142,0.03458616,0.0010775161,0.25323644],"study_design_scores_gemma":[0.00025620274,0.000014822228,0.0052087023,0.000019105864,0.0018756634,5.844084e-7,0.0007895876,0.9878217,7.1345784e-7,0.00302476,0.0006465492,0.0003416246],"about_ca_topic_score_codex":0.00045654652,"about_ca_topic_score_gemma":0.0001665784,"teacher_disagreement_score":0.7954833,"about_ca_system_score_codex":0.000031114912,"about_ca_system_score_gemma":0.000012525313,"threshold_uncertainty_score":0.9999219},"labels":[],"label_agreement":null},{"id":"W1990284223","doi":"10.1239/jap/1165505200","title":"An urn model arising from all-optical networks","year":2006,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Mathematics; Independent and identically distributed random variables; Combinatorics; Factorial; Random variable; Generating function; Integer (computer science); Moment-generating function; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.013021914087138015,"score_gpt":0.25467624821332946,"score_spread":0.24165433412619144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990284223","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53139645,0.000018929513,0.46193737,0.00005148724,0.000024371257,0.000108482236,0.0000035864261,0.000027194845,0.0064321198],"genre_scores_gemma":[0.9003647,7.830176e-7,0.09851433,0.00004068383,0.0010300464,0.0000057207217,0.000022987846,0.000016333983,0.000004425865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837756,0.000044445034,0.00076256506,0.0002539472,0.00028421427,0.00027728235],"domain_scores_gemma":[0.9987775,0.00009369017,0.00043666497,0.0004154092,0.00014400609,0.00013274713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065831724,0.00018704963,0.0004382663,0.00005145465,0.0000808583,0.00010464087,0.00033461186,0.00007441088,0.00013107438],"category_scores_gemma":[0.0000022048705,0.00016144056,0.00024342629,0.00014278076,0.00007975926,0.0001651209,0.00005813626,0.00048323467,0.0000023016044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020395155,0.0011042253,0.028029716,0.0000045551396,0.00020920226,0.0000022691781,0.00010149833,0.8435753,0.0041013737,0.0914847,0.0018842255,0.029298957],"study_design_scores_gemma":[0.00025550232,0.000035569763,0.002565124,0.000008372335,0.00012924225,5.8358097e-7,0.000022105545,0.3430678,0.0013243399,0.65222657,0.00020921693,0.00015560206],"about_ca_topic_score_codex":0.00009729701,"about_ca_topic_score_gemma":0.000021324044,"teacher_disagreement_score":0.56074184,"about_ca_system_score_codex":0.000080590056,"about_ca_system_score_gemma":0.000066049935,"threshold_uncertainty_score":0.6583355},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.041840485208061266,"score_gpt":0.28500952898286724,"score_spread":0.24316904377480597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990570693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0910709,0.0000049257733,0.9058926,0.000024866124,0.00001096803,0.0002524671,0.0000096214,0.00008035275,0.0026532668],"genre_scores_gemma":[0.8745739,5.172855e-7,0.12491447,0.00013218987,0.00008731043,0.00006352672,0.000029180806,0.000014034414,0.00018486519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993645,0.000013807016,0.00016169786,0.0001891363,0.00009793092,0.00017293166],"domain_scores_gemma":[0.99941176,0.000021818973,0.0000606224,0.0003509556,0.000111280155,0.00004356692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014880791,0.00010727518,0.00010307684,0.000031221327,0.00014139766,0.000029193066,0.00022923367,0.000022299178,0.0001298767],"category_scores_gemma":[7.473715e-7,0.00007137932,0.00008607768,0.0001267345,0.000036720485,0.00008183071,0.000056250774,0.00006359099,0.0000052417513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006248986,0.00021258513,0.00069137866,0.0000012371402,0.00004471546,5.8055146e-8,0.0004288138,0.8142594,0.00007952841,0.16113,0.00030467007,0.022841368],"study_design_scores_gemma":[0.000094404546,0.000027875956,0.00019996038,0.0000024343897,0.000031677348,6.58532e-8,0.00015638833,0.95687234,0.001311997,0.041145068,0.000058317626,0.00009945682],"about_ca_topic_score_codex":0.00013783721,"about_ca_topic_score_gemma":0.000006981156,"teacher_disagreement_score":0.783503,"about_ca_system_score_codex":0.0000110194305,"about_ca_system_score_gemma":0.000022297163,"threshold_uncertainty_score":0.29107642},"labels":[],"label_agreement":null},{"id":"W1990657247","doi":"10.1016/s0378-8733(00)00020-4","title":"Dynamical systems to define centrality in social networks","year":2000,"lang":"en","type":"article","venue":"Social Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":106,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Hôpital du Saint-Sacrement","funders":"","keywords":"Centrality; Katz centrality; Betweenness centrality; Network science; Computer science; Complex network; Theoretical computer science; Psychology; Artificial intelligence; Mathematics; Statistics","score_opus":0.009976188222390167,"score_gpt":0.2682369452012228,"score_spread":0.25826075697883266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990657247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6321028,0.00053116743,0.30054328,0.0016571208,0.0008203646,0.0018101772,0.00007315874,0.00070622703,0.061755717],"genre_scores_gemma":[0.9930365,0.0000085700685,0.00013654935,0.00017021189,0.0058220555,0.00009710172,0.00017243731,0.000043570148,0.00051301095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751306,0.00028094195,0.0005770664,0.00046961315,0.0002515832,0.00090774376],"domain_scores_gemma":[0.9993954,0.000070708506,0.00010919565,0.00022142653,0.00005281082,0.00015047102],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003970415,0.00030518256,0.00060332794,0.000070729446,0.0004241283,0.00014098588,0.00035312408,0.00020967388,0.001067432],"category_scores_gemma":[0.0000019261279,0.0003369334,0.00030644052,0.00096256874,0.00008385748,0.0000856714,0.00009948463,0.00058536057,0.000036650115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002081079,0.0005589664,0.12069504,0.000011945326,0.000306882,0.00001299211,0.00079926517,0.43383303,0.000005147761,0.09642416,0.09697698,0.25016746],"study_design_scores_gemma":[0.0011283786,0.0000634864,0.1049057,0.00007701491,0.00014548934,9.857667e-7,0.00031850778,0.8466489,0.0000015188829,0.0079081645,0.037559923,0.0012419804],"about_ca_topic_score_codex":0.0012132496,"about_ca_topic_score_gemma":0.00023442539,"teacher_disagreement_score":0.4128158,"about_ca_system_score_codex":0.00017218478,"about_ca_system_score_gemma":0.000030294792,"threshold_uncertainty_score":0.99990827},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.056720518850135716,"score_gpt":0.26189961063934397,"score_spread":0.20517909178920826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991635064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74912,0.000020389363,0.06211278,0.00059285323,0.000079506994,0.0020141196,0.00017604673,0.00023726698,0.18564704],"genre_scores_gemma":[0.9810469,1.9981306e-7,0.018635739,0.00008277109,0.000078599835,0.000078779,0.000014371509,0.00001094837,0.00005167943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918824,0.0000051968454,0.00020682316,0.00023783698,0.0002049617,0.00015692355],"domain_scores_gemma":[0.9994437,0.0000059393838,0.00018271556,0.00019612568,0.00013637182,0.00003515072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018976523,0.00010783131,0.00014790401,0.00005497216,0.00010261179,0.000026275402,0.0008376284,0.000016966625,0.00003992527],"category_scores_gemma":[0.000007701671,0.00008083672,0.000070374605,0.00033763866,0.000039483028,0.00012908899,0.00041742355,0.000071782495,0.0000035258686],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025969197,0.003268426,0.31139603,0.00023793227,0.000737233,1.195329e-7,0.0076476224,0.0014337575,0.039301097,0.5405243,0.058793392,0.03640039],"study_design_scores_gemma":[0.0027206317,0.00035439327,0.116854966,0.00032893676,0.001238319,0.0000017043022,0.002716396,0.059319235,0.66323596,0.120174974,0.031049574,0.0020048912],"about_ca_topic_score_codex":0.00017181116,"about_ca_topic_score_gemma":8.928153e-7,"teacher_disagreement_score":0.62393486,"about_ca_system_score_codex":0.00002244541,"about_ca_system_score_gemma":0.000018254026,"threshold_uncertainty_score":0.32964256},"labels":[],"label_agreement":null},{"id":"W1991773119","doi":"10.1007/s10726-005-9001-y","title":"Introduction to the Special Issue on the Graph Model for Conflict Resolution","year":2005,"lang":"en","type":"article","venue":"Group Decision and Negotiation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"","keywords":"Conflict resolution; Computer science; Resolution (logic); Graph; Sociology; Theoretical computer science; Artificial intelligence; Social science","score_opus":0.02009217325215433,"score_gpt":0.27925780082492063,"score_spread":0.2591656275727663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991773119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033520304,0.000025435973,0.942729,0.021741793,0.00019371437,0.00065575656,0.000011826659,0.000036608235,0.0010855611],"genre_scores_gemma":[0.9645819,0.000018001363,0.0057154032,0.0009184333,0.027932197,0.00012011683,0.000057397272,0.000013519713,0.000642996],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921066,0.000043620956,0.00020225647,0.00023778965,0.00017524166,0.00013045702],"domain_scores_gemma":[0.99934995,0.00018869444,0.00008055118,0.00027848303,0.00006700403,0.000035299825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046823954,0.00010142774,0.000101106816,0.000078156714,0.0003667224,0.00008801499,0.00012165492,0.000027382752,0.00027067875],"category_scores_gemma":[0.000028311297,0.000061072365,0.0000835446,0.0002043688,0.000019526517,0.0000966191,0.00003605667,0.00008710651,0.000045540153],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104704086,0.000039741226,0.000053514592,4.7203667e-7,0.000014340965,7.769671e-9,0.00034464075,0.013715687,0.0001332644,0.08783802,0.47818702,0.4195686],"study_design_scores_gemma":[0.0001684221,0.000054339544,0.00086976256,0.0000059516565,0.000022641254,1.6934301e-7,0.00006801251,0.39807847,0.00022755054,0.017428681,0.5829971,0.00007889327],"about_ca_topic_score_codex":0.000014327348,"about_ca_topic_score_gemma":0.00006425627,"teacher_disagreement_score":0.9370136,"about_ca_system_score_codex":0.000026352678,"about_ca_system_score_gemma":0.0000053691015,"threshold_uncertainty_score":0.29637426},"labels":[],"label_agreement":null},{"id":"W1991815812","doi":"10.1103/physreve.76.042901","title":"Vulnerability of a killer whale social network to disease outbreaks","year":2007,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Killam Trusts; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Endangered species; Vulnerability (computing); Outbreak; Context (archaeology); Sociality; Social network (sociolinguistics); Population; Whale; Ecology; Geography; Biology; Computer science; Environmental health; Computer security; Medicine; Virology; Social media; Habitat","score_opus":0.019441198171373308,"score_gpt":0.35310782393550366,"score_spread":0.33366662576413036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991815812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6822807,0.012826658,0.21128508,0.0069450377,0.00035195067,0.0048043146,0.000120575656,0.00049879344,0.080886856],"genre_scores_gemma":[0.99713916,0.00003724203,0.00070907455,0.0005156683,0.0014314281,0.00005019242,0.000023107168,0.000015308504,0.000078838806],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871284,0.00008587025,0.0003732254,0.00027315988,0.00023512063,0.0003198154],"domain_scores_gemma":[0.9990714,0.00013815986,0.00013544301,0.00035616095,0.00009364053,0.00020519101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004963875,0.00016396107,0.0005596412,0.000019676134,0.00008080149,0.000010015345,0.00021729173,0.000010267902,0.00029866528],"category_scores_gemma":[0.000019483292,0.00014051171,0.0004704896,0.0005038917,0.00004975971,0.000048775975,0.00013600611,0.00013853263,0.000049108654],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009086202,0.0016018657,0.037639063,0.0007340932,0.00026183578,0.0000025314744,0.00024555754,0.00011688944,0.00036120214,0.20606084,0.11707035,0.6358149],"study_design_scores_gemma":[0.0005237179,0.00016510906,0.13892856,0.0025297373,0.0012775495,1.898532e-7,0.000038775113,0.0010110183,0.0008878862,0.2951386,0.5581431,0.0013557966],"about_ca_topic_score_codex":0.00004202634,"about_ca_topic_score_gemma":0.000005352255,"teacher_disagreement_score":0.63445914,"about_ca_system_score_codex":0.000022349042,"about_ca_system_score_gemma":0.000021952314,"threshold_uncertainty_score":0.57299006},"labels":[],"label_agreement":null},{"id":"W1992680141","doi":"10.1103/physreve.85.031118","title":"Propagation on networks: An exact alternative perspective","year":2012,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Computer science; Simple (philosophy); Branching process; Process (computing); Statistical physics; Perspective (graphical); Markov process; Class (philosophy); Markov chain; Gaussian; Applied mathematics; Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence; Machine learning; Physics; Statistics","score_opus":0.027125534858871037,"score_gpt":0.36138437716523397,"score_spread":0.33425884230636294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992680141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28231245,0.025480805,0.40464136,0.0020988537,0.0005622949,0.0054485393,0.00004646787,0.00093375525,0.27847546],"genre_scores_gemma":[0.9965187,0.00023763001,0.00017210511,0.0002720378,0.002594456,0.00011586334,0.000035800076,0.000018644496,0.00003478454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990125,0.00016352991,0.00015161665,0.00022557663,0.0001830566,0.0002637746],"domain_scores_gemma":[0.9992614,0.0000751245,0.00013037983,0.0003147144,0.00009388637,0.00012451521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019052213,0.00016887457,0.00031939466,0.000023533092,0.00006815864,0.000020994263,0.00015861222,0.0000086946375,0.00023369734],"category_scores_gemma":[0.00001174489,0.00013141849,0.00019435673,0.00023430277,0.00003117106,0.0002811672,0.000040959192,0.00018345799,0.00011044341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009423283,0.0011413711,0.0017275847,0.000033309712,0.00013110135,2.6461092e-7,0.0003923164,0.00019930064,0.00008115346,0.8924301,0.002279922,0.10157412],"study_design_scores_gemma":[0.0014244583,0.0020196529,0.023220487,0.0069025042,0.002479891,0.0000031451448,0.0010600815,0.32766172,0.010840699,0.53732723,0.08288983,0.0041703237],"about_ca_topic_score_codex":0.00008149165,"about_ca_topic_score_gemma":8.2256815e-7,"teacher_disagreement_score":0.7142062,"about_ca_system_score_codex":0.000065074135,"about_ca_system_score_gemma":0.000009566801,"threshold_uncertainty_score":0.53590906},"labels":[],"label_agreement":null},{"id":"W1992774762","doi":"10.1109/ciss.2014.6814136","title":"Microscopic generative models for complex networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Complex network; Generative grammar; Computer science; Human dynamics; Complex system; Evolving networks; Generative model; The Internet; Enhanced Data Rates for GSM Evolution; Data science; Theoretical computer science; Phenomenon; Small-world network; Artificial intelligence; World Wide Web; Epistemology","score_opus":0.02714076824587968,"score_gpt":0.2832568401434916,"score_spread":0.25611607189761193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992774762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023669293,0.00001378712,0.966948,0.00010170601,0.000031075047,0.00022515042,0.00000562431,0.000087247354,0.030220494],"genre_scores_gemma":[0.89850956,6.5234383e-7,0.09945939,0.00025404466,0.00057906273,0.00008637616,0.000106161446,0.00001561222,0.0009891605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992993,0.00003346135,0.00017374166,0.00021462343,0.000052672818,0.000226233],"domain_scores_gemma":[0.99950635,0.00007930037,0.00005818568,0.00023679424,0.00007006234,0.000049316368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112564725,0.00012623053,0.00020982287,0.000030693966,0.0001296399,0.000053905333,0.00015046568,0.000022775006,0.0004258116],"category_scores_gemma":[8.7442334e-7,0.000111281275,0.00013359694,0.00008722804,0.000029068175,0.00006467657,0.00004979782,0.00005660218,0.000005902516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007844078,0.00006914201,0.0028554813,0.000003245034,0.0001198182,2.5240881e-8,0.000043380434,0.11012299,0.0013349379,0.7753102,0.08259364,0.02753928],"study_design_scores_gemma":[0.00018035097,0.000027912787,0.00009634803,0.0000032037683,0.000022037526,3.9539568e-8,0.000011254819,0.87923497,0.0010093603,0.10513886,0.014151435,0.00012421906],"about_ca_topic_score_codex":0.000080988495,"about_ca_topic_score_gemma":0.000018401639,"teacher_disagreement_score":0.8961426,"about_ca_system_score_codex":0.0000102160175,"about_ca_system_score_gemma":0.000007817372,"threshold_uncertainty_score":0.46623382},"labels":[],"label_agreement":null},{"id":"W1992869033","doi":"10.1007/s00285-012-0545-6","title":"Edge removal in random contact networks and the basic reproduction number","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematical Biology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degree (music); Mathematics; Reproduction; Combinatorics; Enhanced Data Rates for GSM Evolution; Basic reproduction number; Order (exchange); Reduction (mathematics); Distribution (mathematics); Discrete mathematics; Computer science; Physics; Biology; Geometry; Demography; Mathematical analysis; Artificial intelligence; Ecology","score_opus":0.013365056411568885,"score_gpt":0.2845484861307215,"score_spread":0.2711834297191526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992869033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.842493,0.00093845464,0.14414579,0.0010513596,0.00020051499,0.00020706136,5.741506e-7,0.00000979735,0.010953466],"genre_scores_gemma":[0.99706393,0.000025501915,0.0017743913,0.000035608107,0.0010456196,0.0000042617835,8.9366415e-7,0.0000053570484,0.000044432363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998955,0.00027652257,0.00046197267,0.0000774782,0.00005426831,0.00017475552],"domain_scores_gemma":[0.9988641,0.00062869396,0.00026837937,0.00014717042,0.000043590982,0.000048060218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021592462,0.000082406754,0.00040966048,0.000035774,0.000033528133,0.000013115845,0.0000962354,0.00004040583,0.00042928176],"category_scores_gemma":[0.000089564724,0.000044252683,0.00013138863,0.000092935275,0.00010743689,0.000074038464,0.000043778964,0.00026184908,0.0000064467627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006928454,0.0003453732,0.106004566,0.000012614633,0.00029482375,0.000003106073,0.0004475837,0.000031456926,0.0002811475,0.85506696,0.0022830775,0.034536447],"study_design_scores_gemma":[0.009649331,0.00015320716,0.014822692,0.00017214076,0.00043308092,0.00077656884,0.00041954208,0.007636941,0.00043748756,0.9503828,0.014760117,0.00035603903],"about_ca_topic_score_codex":0.000008024077,"about_ca_topic_score_gemma":6.357169e-7,"teacher_disagreement_score":0.15457095,"about_ca_system_score_codex":0.000013956118,"about_ca_system_score_gemma":0.000009870937,"threshold_uncertainty_score":0.4700334},"labels":[],"label_agreement":null},{"id":"W199296758","doi":"10.1137/1.9781611972795.84","title":"Detecting Communities in Social Networks using Max-Min Modularity","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":101,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Modularity (biology); Cluster analysis; Chen; Community structure; Robustness (evolution); Complex network; Measure (data warehouse); Clustering coefficient; Theoretical computer science; Data mining; Artificial intelligence; Mathematics; World Wide Web; Combinatorics","score_opus":0.03596780132429976,"score_gpt":0.3038009831175571,"score_spread":0.2678331817932573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W199296758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7065156,0.000023457456,0.28018305,0.000049696402,0.0000150202895,0.000081869155,8.0562376e-7,0.000087142274,0.013043347],"genre_scores_gemma":[0.9937888,6.569382e-7,0.0057137352,0.00007887928,0.00034652816,0.0000030987012,0.000012883007,0.0000081858525,0.00004723786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992212,0.00010160368,0.00022361471,0.000106359905,0.000079642065,0.00026758265],"domain_scores_gemma":[0.99966085,0.000042048756,0.00006711575,0.00017723383,0.000028420893,0.000024305671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025240035,0.000118889555,0.00021142706,0.00008530643,0.0002556915,0.00006459249,0.00016667006,0.000039696017,0.00026329438],"category_scores_gemma":[9.5202364e-7,0.00012553179,0.000101267,0.00028536905,0.000028026952,0.00009723472,0.000070701324,0.0002852103,0.0000010723865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030530628,0.00045979122,0.2861647,0.000005674966,0.0001235214,0.000004371398,0.0019067083,0.04193128,0.001032258,0.11335602,0.00083860895,0.5541465],"study_design_scores_gemma":[0.00023360962,0.00002158243,0.014738752,0.000023976396,0.000027245123,5.2089354e-7,0.0013532909,0.932847,0.0004017013,0.049750734,0.0003064349,0.00029512792],"about_ca_topic_score_codex":0.0029138853,"about_ca_topic_score_gemma":0.0003533913,"teacher_disagreement_score":0.89091575,"about_ca_system_score_codex":0.000041804695,"about_ca_system_score_gemma":0.000010680323,"threshold_uncertainty_score":0.5119038},"labels":[],"label_agreement":null},{"id":"W1993155646","doi":"10.1016/j.physa.2006.03.031","title":"Preferential network perturbation","year":2006,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Cancer Agency","funders":"Genome Canada","keywords":"Perturbation (astronomy); Betweenness centrality; Network topology; Vertex (graph theory); Mathematics; Topology (electrical circuits); Computer science; Robustness (evolution); Mathematical optimization; Theoretical computer science; Combinatorics; Physics; Chemistry; Centrality; Computer network; Quantum mechanics","score_opus":0.008955716090274594,"score_gpt":0.24999818297431253,"score_spread":0.24104246688403794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993155646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092315045,0.00005203469,0.99246633,0.00013839809,0.000015718748,0.00036795938,0.00014120173,0.000079721765,0.0058154576],"genre_scores_gemma":[0.98787636,0.0000064029123,0.010180358,0.000024616247,0.00085404,0.00042195266,0.0004121534,0.000017461536,0.00020668625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991122,0.00002665797,0.00022162726,0.0002893877,0.00012657077,0.0002235776],"domain_scores_gemma":[0.9994495,0.00013538785,0.00008567566,0.00018267892,0.00007924979,0.00006749683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056959725,0.00013715452,0.00017363689,0.000023642138,0.00023080867,0.00006632005,0.00010171764,0.000023827382,0.00026813152],"category_scores_gemma":[0.000002291188,0.00013285308,0.000046797595,0.00020561989,0.000013250982,0.000059343118,0.00006706133,0.000105027306,0.00003238088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002539877,0.00011102007,0.000028430024,0.000004296701,0.000021448715,3.4418296e-8,0.000004969047,0.0000840327,0.0006287753,0.9874985,0.003328042,0.008287868],"study_design_scores_gemma":[0.00009289492,0.00001901387,0.0002616513,0.000004487583,0.000072211355,1.5473482e-7,0.000006068143,0.12874505,0.00022980475,0.85397446,0.016451808,0.00014238564],"about_ca_topic_score_codex":0.000048227128,"about_ca_topic_score_gemma":0.0000062478207,"teacher_disagreement_score":0.9869532,"about_ca_system_score_codex":0.000011292631,"about_ca_system_score_gemma":0.000014690022,"threshold_uncertainty_score":0.54175913},"labels":[],"label_agreement":null},{"id":"W1994022121","doi":"10.1109/allerton.2012.6483470","title":"Growing a network on a given substrate","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Degree (music); Degree distribution; Steady state (chemistry); Graph; Convergence (economics); Preferential attachment; Computer science; Transient (computer programming); Distribution (mathematics); Statistical physics; Mathematics; Applied mathematics; Complex network; Mathematical analysis; Theoretical computer science; Physics; Combinatorics","score_opus":0.025190120154119127,"score_gpt":0.2769099069186779,"score_spread":0.25171978676455875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994022121","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15186635,0.00040348744,0.12982164,0.00063411467,0.0009053202,0.0009837142,0.000038790848,0.00096403266,0.7143826],"genre_scores_gemma":[0.9894041,0.0000039138886,0.005101789,0.00012327897,0.003789645,0.00011167448,0.00017693495,0.00004285133,0.0012458301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845797,0.00008305598,0.0003284926,0.00043472028,0.0001889321,0.0005068562],"domain_scores_gemma":[0.9988393,0.00007131693,0.00020443981,0.00072306214,0.0000451055,0.00011674713],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027466196,0.00035673156,0.000468006,0.0000684102,0.00009995143,0.00011340365,0.0004000845,0.0001130251,0.0026633716],"category_scores_gemma":[8.951741e-7,0.00032706524,0.00044231486,0.0001434929,0.00002615402,0.00007200513,0.00060625357,0.00071640755,0.00016081365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045852004,0.0004802903,0.10623526,0.00006419976,0.0019723214,0.000005832675,0.00026918537,0.038583413,0.00007667451,0.63715315,0.14334542,0.07176844],"study_design_scores_gemma":[0.00060911255,0.000100045116,0.018417304,0.0010998425,0.0011585542,0.0000010834091,0.00020019292,0.021658186,0.002347522,0.84400576,0.106983274,0.0034190924],"about_ca_topic_score_codex":0.00045599166,"about_ca_topic_score_gemma":0.000011776846,"teacher_disagreement_score":0.83753777,"about_ca_system_score_codex":0.000039753126,"about_ca_system_score_gemma":0.00004096402,"threshold_uncertainty_score":0.99991816},"labels":[],"label_agreement":null},{"id":"W1994356260","doi":"10.1145/2392622.2392628","title":"Sampling online social networks by random walk","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Random walk; Simple random sample; Estimator; Sampling (signal processing); Computer science; Statistics; Degree (music); Population; Systematic sampling; Scale (ratio); Gini coefficient; Mathematics; Telecommunications; Geography; Inequality","score_opus":0.02077615980753074,"score_gpt":0.29724754749512694,"score_spread":0.2764713876875962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994356260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06283983,0.00023306394,0.9177274,0.0001799569,0.000088198925,0.00012571638,0.00001640085,0.00018178982,0.018607663],"genre_scores_gemma":[0.9919626,0.0000029279051,0.0041573644,0.00012247667,0.002553844,0.0000130551025,0.00026230587,0.00001737582,0.0009080343],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918103,0.000037182846,0.00019682891,0.00012514021,0.00009681069,0.000363034],"domain_scores_gemma":[0.999632,0.000067981615,0.00006663069,0.0001306364,0.000027280841,0.00007547863],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017159009,0.00012712392,0.00021884986,0.00002541792,0.00015236322,0.00003366446,0.0001251787,0.000034263754,0.0020405985],"category_scores_gemma":[0.000001198453,0.00011137833,0.00016392594,0.00014750448,0.000023869714,0.00010519938,0.00007106821,0.00014530284,0.000016638513],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006417308,0.0010316215,0.16937277,0.0000044150793,0.0005368679,1.4198753e-7,0.000322568,0.00040360005,0.00089697016,0.06346698,0.42391956,0.33998033],"study_design_scores_gemma":[0.004797137,0.000058410402,0.015265778,0.00003344865,0.00059386593,0.0000011766575,0.00091389444,0.086517684,0.0019948469,0.01583625,0.8720087,0.0019788272],"about_ca_topic_score_codex":0.00016494551,"about_ca_topic_score_gemma":0.0000058120486,"teacher_disagreement_score":0.9291228,"about_ca_system_score_codex":0.000014756335,"about_ca_system_score_gemma":0.000005626539,"threshold_uncertainty_score":0.9988717},"labels":[],"label_agreement":null},{"id":"W1994726942","doi":"10.1145/1870178.1870182","title":"On random walks in direction-aware network problems","year":2010,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Laplacian matrix; Random walk; Computer science; Link (geometry); Theoretical computer science; Random graph; Graph; Undirected graph; Mathematics; Computer network","score_opus":0.030670013121722853,"score_gpt":0.3260838846842447,"score_spread":0.29541387156252186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994726942","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8603993,0.051238034,0.012585331,0.002104423,0.002638033,0.012037662,0.000018684215,0.00056762196,0.058410916],"genre_scores_gemma":[0.9897224,0.007557608,0.0009692119,0.00030107057,0.00043450884,0.00074038905,0.00013129466,0.000024440524,0.00011913067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977551,0.00020387759,0.0006627863,0.00037642292,0.0006747025,0.0003270908],"domain_scores_gemma":[0.9978794,0.00048378317,0.0003346494,0.0008882152,0.00034588084,0.00006809348],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004419857,0.00022919339,0.00048697356,0.00033612983,0.00016234996,0.000049205213,0.00043998717,0.00005843236,0.0028445837],"category_scores_gemma":[0.00044358333,0.00020070565,0.00017334243,0.003394849,0.000026899677,0.0002174564,0.00009822763,0.0005518709,0.00014191815],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010507363,0.00013048122,0.08533599,0.00019580581,0.000042149957,1.4110891e-7,0.00001996422,0.0058920775,0.000017304203,0.0011972197,0.014199306,0.89295906],"study_design_scores_gemma":[0.005494676,0.00041991507,0.12924077,0.008591432,0.0010547993,0.0000038211874,0.00001557729,0.5936843,0.0003390511,0.03529995,0.22385776,0.0019979195],"about_ca_topic_score_codex":0.00003975669,"about_ca_topic_score_gemma":0.000032217275,"teacher_disagreement_score":0.8909611,"about_ca_system_score_codex":0.000068283065,"about_ca_system_score_gemma":0.00009270661,"threshold_uncertainty_score":0.99806696},"labels":[],"label_agreement":null},{"id":"W1996600093","doi":"10.1046/j.1467-9876.2003.05215.x","title":"Bayesian Analysis of Directed Graphs Data with Applications to Social Networks","year":2004,"lang":"en","type":"article","venue":"Journal of the Royal Statistical Society Series C (Applied Statistics)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Okanagan University College; Okanagan College","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Versailles Saint-Quentin-en-Yvelines","keywords":"Computer science; Variety (cybernetics); Markov chain Monte Carlo; Variable-order Bayesian network; Inference; Bayesian probability; Data mining; Theoretical computer science; Markov chain; Machine learning; Bayesian network; Covariate; Bayesian inference; Artificial intelligence; Data science","score_opus":0.010144831962567056,"score_gpt":0.26677348120998806,"score_spread":0.256628649247421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996600093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077766477,0.000015256042,0.99478805,0.00024347189,0.000030934127,0.0002914708,0.0033144497,0.000026298358,0.0005124174],"genre_scores_gemma":[0.68123585,0.000003716085,0.31812528,0.00007671076,0.00017751686,0.000021592772,0.00029975726,0.000024079816,0.00003548572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978478,0.00006881067,0.00083400763,0.00030876911,0.0005915072,0.00034913418],"domain_scores_gemma":[0.9977921,0.0003147816,0.0007656201,0.0005900944,0.00035044164,0.00018691944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003644632,0.0002567486,0.0007870659,0.00007963807,0.00039364427,0.00008481614,0.00096653146,0.00006118667,0.00026829776],"category_scores_gemma":[0.000018089171,0.0001818167,0.0002829479,0.0016017637,0.00037500774,0.00006750052,0.000315105,0.0004210007,0.0000011702977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027688677,0.000495313,0.004666725,0.000028979526,0.00811701,0.0000026972368,0.0006315918,0.14794187,0.000053428394,0.7999319,0.02331152,0.014542087],"study_design_scores_gemma":[0.003908875,0.00096191803,0.15675725,0.00014873648,0.035619706,0.0000072666157,0.0034648909,0.24738997,0.0002749512,0.5296193,0.019580765,0.002266422],"about_ca_topic_score_codex":0.00019073256,"about_ca_topic_score_gemma":0.00014134396,"teacher_disagreement_score":0.6804582,"about_ca_system_score_codex":0.00008624958,"about_ca_system_score_gemma":0.0001475837,"threshold_uncertainty_score":0.74142694},"labels":[],"label_agreement":null},{"id":"W1997116660","doi":"10.48550/arxiv.1410.2196","title":"Role of Subgraphs in Epidemics over Finite-Size Networks under the Scaled SIS Process","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; York University; National Science Foundation","keywords":"Adjacency matrix; Node (physics); Submodular set function; Adjacency list; Topology (electrical circuits); Process (computing); Network topology; Range (aeronautics); Distribution (mathematics); Computer science; Mathematical optimization; Mathematics; Combinatorics; Computer network; Physics","score_opus":0.025517784365751507,"score_gpt":0.20247793629844307,"score_spread":0.17696015193269157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997116660","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8479907,0.00008188541,0.14836901,0.000028497081,0.000052763644,0.00034942725,0.000017435692,0.0000629771,0.003047292],"genre_scores_gemma":[0.9993812,0.00005661902,0.00008409164,0.000054178705,0.0001627097,0.0000048807497,0.00004473169,0.000031772193,0.00017985792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816674,0.00027116927,0.00040490637,0.0006877377,0.000093895054,0.0003755709],"domain_scores_gemma":[0.99747866,0.0007979345,0.00048586974,0.0010080066,0.00014800472,0.00008152753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047279894,0.00035769725,0.00065535476,0.00019402603,0.00009410634,0.00003359703,0.0010309129,0.00022618727,0.00024284956],"category_scores_gemma":[0.00001727675,0.00033475843,0.000491329,0.00088503154,0.00020409546,0.00008091801,0.00069887453,0.000869917,0.000003994764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003220453,0.000087483,0.18567073,0.000018756326,0.00018067153,0.0000013235557,0.000056847974,0.77354556,0.0000057990114,0.03999915,0.00009358044,0.0003078687],"study_design_scores_gemma":[0.00027518815,0.000012937177,0.013863954,0.00011609226,0.00022692047,6.172819e-8,0.00026097018,0.7277892,0.000049436916,0.25699976,0.00009044349,0.00031500353],"about_ca_topic_score_codex":0.0012597241,"about_ca_topic_score_gemma":0.00036120837,"teacher_disagreement_score":0.2170006,"about_ca_system_score_codex":0.00006911683,"about_ca_system_score_gemma":0.00008455064,"threshold_uncertainty_score":0.9999105},"labels":[],"label_agreement":null},{"id":"W1998062243","doi":"10.1016/j.mbs.2013.10.001","title":"Epidemic dynamics on semi-directed complex networks","year":2013,"lang":"en","type":"article","venue":"Mathematical Biosciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Specialized Research Fund for the Doctoral Program of Higher Education of China; National Natural Science Foundation of China","keywords":"Basic reproduction number; Uncorrelated; Stability theory; Mathematics; Mathematical economics; Zero (linguistics); Computer science; Applied mathematics; Mathematical optimization; Statistical physics; Statistics; Physics; Population; Medicine; Nonlinear system","score_opus":0.019175873568917028,"score_gpt":0.27230528203848176,"score_spread":0.2531294084695647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998062243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26027915,0.000025365862,0.44201735,0.0024070577,0.00015397996,0.000931568,0.000017474442,0.00095736625,0.2932107],"genre_scores_gemma":[0.9907192,0.0000011799759,0.008372788,0.00019437307,0.00013336023,0.000059853293,0.000020302632,0.0000110227575,0.00048791227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855494,0.00007151399,0.00035879316,0.00033309506,0.0002725918,0.00040907564],"domain_scores_gemma":[0.9989212,0.0004149621,0.00012269238,0.00034382255,0.000059812424,0.00013749131],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002906237,0.00018996124,0.0003233549,0.00008228488,0.0001912913,0.00015324111,0.0004653548,0.000041197098,0.0037489843],"category_scores_gemma":[0.0000322998,0.00013700788,0.00013556499,0.0005566994,0.00026951564,0.00011121248,0.000110018824,0.00016418961,0.00037403643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039244674,0.0005410071,0.019693276,0.000018324337,0.00007642038,9.64229e-7,0.00010568175,0.00051235384,0.0007489859,0.9072045,0.02443892,0.04665561],"study_design_scores_gemma":[0.00004325172,0.00003420021,0.0014058762,0.000028886761,0.000012423179,4.6462236e-7,0.00008008705,0.7338404,0.00009494125,0.26414463,0.00015729423,0.00015752901],"about_ca_topic_score_codex":0.00009540134,"about_ca_topic_score_gemma":0.000005853137,"teacher_disagreement_score":0.73332804,"about_ca_system_score_codex":0.00003298231,"about_ca_system_score_gemma":0.0000134942475,"threshold_uncertainty_score":0.99716175},"labels":[],"label_agreement":null},{"id":"W1998537526","doi":"10.1145/1842752.1842783","title":"Integrating recommender information in social ecosystems decisions","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Homophily; Recommender system; Computer science; Process (computing); Originality; Function (biology); Data science; Machine learning; Information retrieval; Artificial intelligence; World Wide Web; Psychology","score_opus":0.016405340062499083,"score_gpt":0.290943028125358,"score_spread":0.2745376880628589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998537526","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40871742,0.0000010613395,0.26685047,0.00051357824,0.000176534,0.00021059626,0.00000776513,0.00012701878,0.32339555],"genre_scores_gemma":[0.9928698,1.07534056e-7,0.0067281784,0.000047975176,0.00021724151,0.000024032764,0.000048852926,0.0000035962967,0.00006021803],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946994,0.000021322216,0.0002609637,0.000064086795,0.00006888498,0.00011481337],"domain_scores_gemma":[0.99968714,0.000075658325,0.0000702237,0.00010398939,0.000041574935,0.000021423799],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022240747,0.00006571863,0.00010711932,0.00010811982,0.00009215058,0.00006865829,0.00010554941,0.00002815044,0.0014703594],"category_scores_gemma":[0.000009953009,0.000055840716,0.000060095193,0.00019470097,0.0000071434933,0.00027710965,0.000045002824,0.0002254183,0.000045749148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032903547,0.000062347885,0.06840752,0.0000014804999,0.00002556765,1.0222617e-7,0.0007573394,0.000012814106,0.0005152685,0.42487714,0.045062628,0.46027452],"study_design_scores_gemma":[0.0011777548,0.0000391923,0.014022604,0.000054698878,0.00003657488,0.0000015191725,0.006457352,0.26837024,0.0022558318,0.22381273,0.48286802,0.0009034809],"about_ca_topic_score_codex":0.00060113706,"about_ca_topic_score_gemma":0.0012727991,"teacher_disagreement_score":0.5841524,"about_ca_system_score_codex":0.000011940643,"about_ca_system_score_gemma":0.000013203573,"threshold_uncertainty_score":0.99944246},"labels":[],"label_agreement":null},{"id":"W1998708803","doi":"10.1038/srep05399","title":"Controllability and observability analysis for vertex domination centrality in directed networks","year":2014,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Centrality; Network controllability; Observability; Controllability; Vertex (graph theory); Betweenness centrality; Computer science; Complex network; Network analysis; Node (physics); Network science; Network theory; Weighted network; Linear subspace; Topology (electrical circuits); Mathematics; Theoretical computer science; Combinatorics; Graph; Physics; Pure mathematics","score_opus":0.010081097706767104,"score_gpt":0.2557331580790155,"score_spread":0.24565206037224838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998708803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88192534,0.00003294117,0.116671115,0.00006865404,0.00039183645,0.00051575387,0.000004318438,0.000072057686,0.00031797795],"genre_scores_gemma":[0.9982432,3.4440134e-7,0.0012760779,0.0000065246236,0.000052402276,0.000083730716,0.00021915477,0.0000060481752,0.00011249991],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99788004,0.00019958729,0.0006185865,0.00080909027,0.00019346605,0.00029920123],"domain_scores_gemma":[0.9983175,0.00027276415,0.00028967674,0.00079411134,0.0002363662,0.000089621535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040195654,0.0001378196,0.00044466005,0.00015091906,0.0001923195,0.00019956742,0.00009231875,0.000042980675,0.0000880195],"category_scores_gemma":[0.0001576937,0.00012901131,0.00023553436,0.0012172189,0.00016930579,0.0001321074,0.000056222947,0.00008264432,2.5745317e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013733534,0.00010559022,0.9863739,0.0000068248114,0.00009971807,4.795152e-7,0.000049496535,0.001753925,0.00014690093,0.00096344034,0.00037688226,0.010109093],"study_design_scores_gemma":[0.00019130298,0.000008391838,0.5526274,0.0000052245764,0.0001880301,1.8350234e-7,0.000012546255,0.35654268,0.0002446458,0.088424295,0.0016298542,0.00012544544],"about_ca_topic_score_codex":0.0004589189,"about_ca_topic_score_gemma":0.00065662345,"teacher_disagreement_score":0.43374652,"about_ca_system_score_codex":0.000056307148,"about_ca_system_score_gemma":0.000028450484,"threshold_uncertainty_score":0.5260929},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03524039814181307,"score_gpt":0.32986439765669817,"score_spread":0.2946239995148851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998753427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30210164,0.00049463403,0.69494224,0.00008814679,0.00042081747,0.0013764107,0.000029488063,0.000228324,0.00031828674],"genre_scores_gemma":[0.9938868,0.0000016860616,0.003045901,0.00000980441,0.0007726653,0.00093958667,0.0010002259,0.00004332036,0.00029997976],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998417,0.00039034378,0.00055352424,0.00024439354,0.00009394583,0.0003007817],"domain_scores_gemma":[0.99842334,0.00039322453,0.00025685373,0.00055297965,0.0003030203,0.000070569564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048361372,0.0002043872,0.0003515646,0.00022433045,0.00020117102,0.00023616188,0.00034751013,0.00009747558,0.0000973933],"category_scores_gemma":[0.000015419562,0.00020670655,0.00013289032,0.0003074356,0.00005038103,0.00021090174,0.000030401981,0.00034336772,0.00004271161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015326783,0.0064288774,0.629383,0.0017026443,0.00059239456,3.8154008e-7,0.016786424,0.038315628,0.034740545,0.09043816,0.0082348455,0.17322382],"study_design_scores_gemma":[0.0005558192,0.00013691753,0.005487474,0.0004698983,0.000027173739,1.2722224e-7,0.009982378,0.9728191,0.0009510026,0.003865089,0.005325806,0.0003792343],"about_ca_topic_score_codex":0.0027397664,"about_ca_topic_score_gemma":0.0002341379,"teacher_disagreement_score":0.93450344,"about_ca_system_score_codex":0.00007491554,"about_ca_system_score_gemma":0.000050098453,"threshold_uncertainty_score":0.84292483},"labels":[],"label_agreement":null},{"id":"W1999154986","doi":"10.5539/nct.v1n2p76","title":"Using Simulation to Investigate Virus Propagation in Computer Networks","year":2012,"lang":"en","type":"article","venue":"Network and Communication Technologies","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Quarantine; Computer security; Herd immunity; Range (aeronautics); Control (management); Computer virus; Risk analysis (engineering); Artificial intelligence; Engineering; Business; Virology; Biology; Ecology","score_opus":0.03902316909878746,"score_gpt":0.30413205738761195,"score_spread":0.2651088882888245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999154986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32356977,0.0011843453,0.67384887,0.00024720383,0.000036339206,0.0003661642,8.7897365e-7,0.00043173262,0.00031469538],"genre_scores_gemma":[0.9335996,0.00006946526,0.066030085,0.00006399593,0.00013529118,0.000058274803,0.000024921714,0.000013109524,0.0000052662876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990412,0.00011134821,0.0002921543,0.00016229284,0.00008012471,0.0003128607],"domain_scores_gemma":[0.999098,0.00011390962,0.00013571946,0.0005645231,0.000046257996,0.000041587846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037715302,0.00014506008,0.00019731966,0.00013856206,0.0001967873,0.0000568315,0.00028050662,0.000086058295,0.000010650124],"category_scores_gemma":[0.000008025314,0.0001447964,0.000028145909,0.0006987366,0.00009267883,0.00024133635,0.00044684054,0.00024412393,0.000003251003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069295706,0.00004773066,0.1514313,0.000002516871,0.000018051027,4.662808e-8,0.00014493453,0.62436783,0.000073464085,0.020226581,0.00025514205,0.20342545],"study_design_scores_gemma":[0.00011623482,0.000023191567,0.010209454,0.00007972225,0.000019413956,3.463317e-7,0.00011724492,0.9660352,0.00026390108,0.021106686,0.0018096936,0.00021892675],"about_ca_topic_score_codex":0.00013973058,"about_ca_topic_score_gemma":0.000033074808,"teacher_disagreement_score":0.6100298,"about_ca_system_score_codex":0.00004000041,"about_ca_system_score_gemma":0.000007760643,"threshold_uncertainty_score":0.5904626},"labels":[],"label_agreement":null},{"id":"W1999547539","doi":"10.1145/2425248.2425278","title":"Network criticality in vehicular networks","year":2012,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Criticality; Centrality; Computer science; Robustness (evolution); Cluster analysis; Network science; Graph; Complex network; Metric (unit); Theoretical computer science; Distributed computing; Data mining; Computer network; Mathematics; Artificial intelligence; Engineering","score_opus":0.0660193517817655,"score_gpt":0.36241616083445494,"score_spread":0.29639680905268945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999547539","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2739725,0.6213408,0.07431181,0.0015778841,0.001050754,0.0047535603,0.000007085167,0.00027572806,0.02270986],"genre_scores_gemma":[0.9851675,0.010026365,0.002577609,0.0008645884,0.0008853104,0.00031929772,0.00011853388,0.000019743205,0.000021056812],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972896,0.00043079985,0.0007277301,0.0002724151,0.00065245695,0.0006270148],"domain_scores_gemma":[0.99811316,0.00034871296,0.00021353948,0.0008932499,0.00030149033,0.00012983136],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0076783323,0.00022012004,0.00049642386,0.00017538625,0.00012421368,0.000033558077,0.0004328522,0.000057075104,0.0019171458],"category_scores_gemma":[0.00041590762,0.00020611798,0.00016235256,0.0034596005,0.0000355103,0.00043808192,0.00019701771,0.00034072826,0.00009516786],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002195527,0.00012359864,0.638414,0.00014691321,0.000029704539,1.0398489e-7,0.000011335615,0.0063379537,7.243837e-7,0.0030177163,0.00985722,0.34205854],"study_design_scores_gemma":[0.0007335596,0.000073829935,0.4271893,0.0030523778,0.0009707749,0.0000021511946,0.000017298089,0.48610213,0.000037898495,0.0066008507,0.07417907,0.0010407631],"about_ca_topic_score_codex":0.000021838589,"about_ca_topic_score_gemma":0.0000012416541,"teacher_disagreement_score":0.711195,"about_ca_system_score_codex":0.00012639271,"about_ca_system_score_gemma":0.00005459338,"threshold_uncertainty_score":0.99899524},"labels":[],"label_agreement":null},{"id":"W1999684889","doi":"10.1142/s0217979213501464","title":"PHASE TRANSITIONS IN ISING MODEL INDUCED BY WEIGHT REDISTRIBUTION ON WEIGHTED REGULAR NETWORKS","year":2013,"lang":"en","type":"article","venue":"International Journal of Modern Physics B","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Ising model; Spins; Phase transition; Binary number; Link (geometry); Coupling (piping); Homogeneous; Weighted network","score_opus":0.014006565306910334,"score_gpt":0.28441206301861155,"score_spread":0.2704054977117012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999684889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31110528,0.000027923721,0.6872275,0.00072021544,0.00009957917,0.00008751002,0.000038423856,0.00001325294,0.00068035995],"genre_scores_gemma":[0.99762416,0.000006041467,0.0011316144,0.000093153845,0.00088267005,0.000013246918,0.00020570339,0.00002038211,0.000023044191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985438,0.00005981227,0.0005586243,0.00017499084,0.0004639982,0.00019878086],"domain_scores_gemma":[0.99883914,0.00004091158,0.00039601192,0.00015874523,0.00048234532,0.00008282792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015286772,0.00017614012,0.00026415254,0.00013956561,0.00005531989,0.00009990995,0.00037602457,0.00005171068,0.00008233397],"category_scores_gemma":[0.000002868925,0.00017006342,0.00023290879,0.00017666454,0.000028882341,0.00049579394,0.000031974512,0.00042554596,0.0000047911703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036897697,0.006858198,0.00065356336,0.0000046955774,0.0013273257,0.000017841483,0.00079340185,0.1978441,0.1287919,0.11547672,0.024430301,0.52343297],"study_design_scores_gemma":[0.0011689895,0.00006737874,0.000024305029,0.00007836198,0.000028768221,0.0000014914108,0.0000137410325,0.74655026,0.0055409106,0.24632908,0.000070458525,0.0001262357],"about_ca_topic_score_codex":0.000030681334,"about_ca_topic_score_gemma":0.0000011820165,"teacher_disagreement_score":0.68651885,"about_ca_system_score_codex":0.00016826973,"about_ca_system_score_gemma":0.000055993223,"threshold_uncertainty_score":0.6934985},"labels":[],"label_agreement":null},{"id":"W2000230739","doi":"10.1109/tfuzz.2006.890684","title":"Hypercube Graph Representations and Fuzzy Measures of Graph Properties","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Mathematics; Chordal graph; Graph product; Hypercube; Indifference graph; Discrete mathematics; Theoretical computer science; Combinatorics; Computer science; Graph; 1-planar graph","score_opus":0.03711030495542208,"score_gpt":0.2638540348240703,"score_spread":0.22674372986864824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000230739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2996463,0.0005176708,0.68486893,0.00005524396,0.00037741943,0.00066738,0.000045851462,0.00018455915,0.013636628],"genre_scores_gemma":[0.99901104,0.000026351358,0.00034624853,0.000007778183,0.0001056311,0.00008268976,0.000004178027,0.000023904619,0.00039215016],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99855375,0.00009712848,0.0005024328,0.00029919978,0.00030070884,0.0002467589],"domain_scores_gemma":[0.99908066,0.00009846055,0.00014236571,0.00041184993,0.00016836009,0.00009833098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004009217,0.00019263226,0.00034124113,0.00038539473,0.00023363644,0.00005252912,0.00014306832,0.000054329805,0.000019613308],"category_scores_gemma":[0.0000013157086,0.00017024887,0.00021208546,0.0005512323,0.00013927746,0.00013807158,0.000001805955,0.0001798121,0.000005986577],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011817717,0.0057342993,0.07774271,0.0011229533,0.009119262,0.000028365163,0.0127800815,0.12923075,0.35824263,0.08646727,0.008940913,0.309409],"study_design_scores_gemma":[0.0072408863,0.0020404488,0.025340775,0.00292586,0.004405383,0.00013232275,0.045296304,0.008719177,0.82987195,0.056594346,0.01157441,0.0058581275],"about_ca_topic_score_codex":0.0023291907,"about_ca_topic_score_gemma":0.00017246311,"teacher_disagreement_score":0.6993648,"about_ca_system_score_codex":0.000019216917,"about_ca_system_score_gemma":0.000023508324,"threshold_uncertainty_score":0.6942547},"labels":[],"label_agreement":null},{"id":"W2000305477","doi":"10.1109/icc.2014.6883936","title":"A data-driven study of influences in Twitter communities","year":2014,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Science Foundation","keywords":"Microblogging; Computer science; Social media; Perspective (graphical); World Wide Web; Data science; Artificial intelligence","score_opus":0.06606581502082347,"score_gpt":0.3342140464641859,"score_spread":0.2681482314433624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000305477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.986478,0.0000022135896,0.0023563458,0.000017978617,0.000005175949,0.00009432846,0.0000033235362,0.000019216513,0.011023435],"genre_scores_gemma":[0.99905306,2.5514552e-7,0.0007929449,0.00002573929,0.000032764965,0.000011365168,0.00002799418,0.000003846411,0.000052031137],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994369,0.00011801323,0.00020030476,0.00008359174,0.00008085115,0.000080348414],"domain_scores_gemma":[0.9991674,0.0000907371,0.000060038637,0.00064666814,0.000023331218,0.000011819658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019036063,0.00006119254,0.0001765818,0.00007112628,0.000023960141,0.000016426651,0.0004819246,0.000007143876,0.00033847152],"category_scores_gemma":[0.0000011324316,0.000050010396,0.000018295526,0.00013187955,0.000030781088,0.000091597976,0.00033269587,0.00007200017,0.0000037865805],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019030815,0.0002686163,0.9925941,0.0000014517368,0.000036625155,4.762103e-8,0.0012210084,0.00026814025,0.000014820991,0.002058973,0.0007103946,0.002823891],"study_design_scores_gemma":[0.0017187962,0.00060854905,0.7293267,0.000089215915,0.00014789762,1.689755e-7,0.06669881,0.16832015,0.00028385528,0.021529552,0.010688288,0.00058797584],"about_ca_topic_score_codex":0.009443051,"about_ca_topic_score_gemma":0.0035963813,"teacher_disagreement_score":0.2632674,"about_ca_system_score_codex":0.0000025890877,"about_ca_system_score_gemma":0.000005149296,"threshold_uncertainty_score":0.99715316},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01122099561622583,"score_gpt":0.24802535413489965,"score_spread":0.23680435851867382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000922801","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041506335,0.00013580186,0.13009453,0.00046256883,0.00010065706,0.0021801773,0.00029095227,0.00022613513,0.8660941],"genre_scores_gemma":[0.95100033,0.00020898433,0.0020256229,0.0010728043,0.0020364039,0.000708235,0.0121216,0.00012802002,0.030698024],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860877,0.00008777361,0.00042191872,0.0003667127,0.00028270244,0.00023211972],"domain_scores_gemma":[0.99863213,0.00012431956,0.00033768825,0.0008428374,0.000032110434,0.000030908373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045439467,0.00030328226,0.0003662332,0.0003519616,0.00013169211,0.00022644982,0.00068939844,0.00010828574,0.000099038036],"category_scores_gemma":[0.00001338368,0.0002905577,0.000053423817,0.00012867988,0.000051454837,0.00038823776,0.0006445822,0.00030796736,0.000024236746],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028676022,0.000032502572,0.00020839788,0.00013532635,0.0002678841,0.0000010455549,0.0000498708,0.002537972,2.682292e-7,0.06653684,0.17844811,0.7517531],"study_design_scores_gemma":[0.00023992542,0.000031793188,0.004490782,0.00057292875,0.000419072,2.1495936e-7,0.000025462736,0.02377201,0.000012813968,0.031036047,0.938645,0.0007539391],"about_ca_topic_score_codex":0.000050429906,"about_ca_topic_score_gemma":0.000040887244,"teacher_disagreement_score":0.95058525,"about_ca_system_score_codex":0.00009791748,"about_ca_system_score_gemma":0.000024948415,"threshold_uncertainty_score":0.99995464},"labels":[],"label_agreement":null},{"id":"W2001285918","doi":"10.1109/tfuzz.2012.2227263","title":"Looking for Like-Minded Individuals in Social Networks Using Tagging and E Fuzzy Sets","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Army Research Office; Office of Naval Research; Multidisciplinary University Research Initiative","keywords":"Computer science; Popularity; Set (abstract data type); Fuzzy set; Information retrieval; Fuzzy logic; Relation (database); Similarity (geometry); Process (computing); Social web; World Wide Web; Artificial intelligence; Data mining; Social media","score_opus":0.031635217504088445,"score_gpt":0.2995834060620969,"score_spread":0.26794818855800845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001285918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21636495,0.0001932211,0.7810299,0.000033624383,0.00064961315,0.0007613631,0.0000517693,0.00010092278,0.00081467524],"genre_scores_gemma":[0.99798125,0.0000026381872,0.00085841963,0.00003131968,0.00081972417,0.00019255771,0.000012418139,0.00004143404,0.00006024498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998475,0.0001285692,0.0004220039,0.0002731598,0.00017030083,0.0005309471],"domain_scores_gemma":[0.99932885,0.00017923782,0.00017388644,0.00017817257,0.00004219939,0.0000976316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053995766,0.00023444509,0.00040648883,0.00026364712,0.0004359981,0.00011855323,0.00011406983,0.00010837414,0.000014503119],"category_scores_gemma":[6.5129024e-7,0.000252055,0.00016434454,0.00034287493,0.000037862425,0.00025647302,0.0000032998582,0.00027072296,0.0000021316011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002950918,0.0028436847,0.18429561,0.0006286636,0.003432126,0.0000057356647,0.014679104,0.52174723,0.0046647354,0.02150976,0.0069578853,0.23894037],"study_design_scores_gemma":[0.0081737405,0.00036347986,0.008804593,0.002021205,0.0023590077,0.000044401786,0.009185648,0.93614686,0.00462007,0.006903396,0.016574048,0.004803557],"about_ca_topic_score_codex":0.00036698306,"about_ca_topic_score_gemma":0.000028724267,"teacher_disagreement_score":0.7816163,"about_ca_system_score_codex":0.00009145527,"about_ca_system_score_gemma":0.000023673678,"threshold_uncertainty_score":0.99999315},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009329629330325499,"score_gpt":0.27136157759761986,"score_spread":0.26203194826729437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001550906","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55716413,0.14319508,0.13472882,0.005042883,0.00038773924,0.0027651552,0.00013815952,0.0003915254,0.15618654],"genre_scores_gemma":[0.99370486,0.0047958004,0.0009133507,0.00015530933,0.00035294468,0.000016696094,0.00001732232,0.000019274188,0.000024418547],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988808,0.000073701405,0.00044917362,0.00026615695,0.000055032448,0.00027510888],"domain_scores_gemma":[0.9987313,0.00014474774,0.0008140985,0.00021062494,0.000026805345,0.000072416435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006946534,0.00017601065,0.00086086884,0.000051879466,0.00008045382,0.00002668021,0.0001613483,0.00001635665,0.00018995671],"category_scores_gemma":[0.0000035269843,0.00017198829,0.00025462377,0.0001749903,0.00023528148,0.000088882094,0.000056668963,0.000112170455,0.0000029893322],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022529624,0.000039053375,0.062339343,0.00015641832,0.0004979782,0.0000011512691,0.000109083885,0.000035759036,0.000015689591,0.0034579008,0.0070373486,0.9262878],"study_design_scores_gemma":[0.009947799,0.00094544265,0.16519408,0.013091887,0.009299363,0.000020708132,0.0199678,0.028436678,0.0009799993,0.0074974312,0.73684055,0.007778238],"about_ca_topic_score_codex":0.0002474428,"about_ca_topic_score_gemma":0.0000314171,"teacher_disagreement_score":0.9185095,"about_ca_system_score_codex":0.0000271718,"about_ca_system_score_gemma":0.000017804521,"threshold_uncertainty_score":0.7013478},"labels":[],"label_agreement":null},{"id":"W2001724096","doi":"10.1007/s13278-014-0182-8","title":"Modeling dynamic social networks using spectral embedding","year":2014,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Queen's University","funders":"","keywords":"Computer science; Embedding; Dynamic network analysis; Theoretical computer science; Social network (sociolinguistics); Graph drawing; Graph; Network science; Set (abstract data type); Node (physics); Complex network; Social media; Artificial intelligence; Computer network","score_opus":0.012907227163208764,"score_gpt":0.29060712550303436,"score_spread":0.2776998983398256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001724096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4087086,0.00009349542,0.58986133,0.00003172512,0.000048640024,0.000054960787,0.0000019344934,0.00007256936,0.001126724],"genre_scores_gemma":[0.98336035,0.000007738828,0.012559417,0.00005958841,0.003814529,0.000009448605,0.00008828189,0.00004288015,0.000057790232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997695,0.00021014496,0.0005437375,0.00054464553,0.00023894336,0.00076752173],"domain_scores_gemma":[0.9992976,0.000081803315,0.0002554379,0.00017711967,0.0000816148,0.000106411935],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007435976,0.00033755324,0.00086357625,0.0002251204,0.0015810155,0.000234075,0.00020166575,0.00012086393,0.00013583069],"category_scores_gemma":[0.0000039743713,0.00036623326,0.00070458814,0.0016492407,0.00008890759,0.00013839152,0.00017281856,0.0003080151,0.0000010303647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000123799755,0.000028606806,0.03560766,0.000004059095,0.0020413594,8.0173885e-7,0.0007966129,0.9157835,0.000028989567,0.008881829,0.00016189482,0.03665228],"study_design_scores_gemma":[0.00017589986,0.000011083982,0.0013526964,0.00001447455,0.002302579,2.867711e-7,0.0005854059,0.9903951,0.0000011242187,0.0046593426,0.00011077663,0.0003912178],"about_ca_topic_score_codex":0.00035303802,"about_ca_topic_score_gemma":0.00020652455,"teacher_disagreement_score":0.5773019,"about_ca_system_score_codex":0.000058862122,"about_ca_system_score_gemma":0.000020937061,"threshold_uncertainty_score":0.99987894},"labels":[],"label_agreement":null},{"id":"W2002371774","doi":"10.1007/s00285-014-0791-x","title":"Disease invasion on community networks with environmental pathogen movement","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Biology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; University of Central Florida; National Science Foundation","keywords":"Basic reproduction number; Perturbation (astronomy); Biology; Pathogen; Laplacian matrix; Cluster analysis; Community structure; Disease; Graph; Mathematics; Ecology; Combinatorics; Statistics; Genetics; Demography","score_opus":0.011358133886968347,"score_gpt":0.23843060365812654,"score_spread":0.2270724697711582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002371774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6797528,0.000018290144,0.3182564,0.00017179376,0.000019300813,0.00008629758,0.000005939941,0.000008901748,0.0016802463],"genre_scores_gemma":[0.996366,0.000003621755,0.0031726605,0.0002084154,0.00020356843,0.0000042454312,0.0000151422455,0.000008905008,0.000017440174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990221,0.00032517404,0.0003252446,0.00007223079,0.0001093784,0.00014585326],"domain_scores_gemma":[0.9990099,0.0003300004,0.000266645,0.0002445007,0.000017011977,0.00013193348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056069624,0.00011566801,0.00028805697,0.000045255158,0.00008571127,0.000012425521,0.0002073906,0.000027306904,0.000455346],"category_scores_gemma":[0.000013812029,0.000070958435,0.00012507613,0.0000401684,0.00008627421,0.00002826152,0.00007607806,0.00033431916,0.000012704239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001111319,0.00795201,0.24522811,0.00006637291,0.0011718726,0.000020798221,0.00048100163,0.005324888,0.011961319,0.6029355,0.003269919,0.12047687],"study_design_scores_gemma":[0.0014927973,0.0031563316,0.024143187,0.00030613018,0.00036213777,0.000009024238,0.00025894906,0.02414463,0.0009155577,0.94170624,0.0030580026,0.00044703737],"about_ca_topic_score_codex":0.0000022655274,"about_ca_topic_score_gemma":4.624718e-7,"teacher_disagreement_score":0.33877072,"about_ca_system_score_codex":0.000023665136,"about_ca_system_score_gemma":0.000009422895,"threshold_uncertainty_score":0.49857193},"labels":[],"label_agreement":null},{"id":"W2002494504","doi":"10.1103/physreve.68.066124","title":"Stochastically evolving networks","year":2003,"lang":"en","type":"article","venue":"Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Node (physics); Random graph; Context (archaeology); Class (philosophy); Evolving networks; Statistical physics; Complex network; Theoretical computer science; Mathematics; Artificial intelligence; Physics","score_opus":0.008983550202050767,"score_gpt":0.3082817039719377,"score_spread":0.29929815376988694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002494504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004966274,0.0051206145,0.91330326,0.00070392183,0.0005739058,0.00096380955,0.00011321177,0.00027360208,0.073981404],"genre_scores_gemma":[0.9915752,0.0007425637,0.0052770777,0.0001846527,0.0010432696,0.00009363486,0.00027478885,0.000086180495,0.0007226409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967451,0.00030192774,0.0009152186,0.0008787929,0.00039903622,0.0007599419],"domain_scores_gemma":[0.9978826,0.0006578926,0.00022610571,0.00062020076,0.00019304566,0.00042017613],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031078857,0.0006151508,0.0011705147,0.00005490341,0.00043875971,0.000118803844,0.00034170615,0.00009967481,0.000695254],"category_scores_gemma":[0.00010629714,0.0005316251,0.0004048518,0.00036945601,0.00046624662,0.00026702715,0.00053093274,0.0010334598,0.00009996911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019871313,0.00064505485,0.00084194023,0.00024104136,0.0004021151,0.000018136028,0.000207968,0.00035784632,0.00010595193,0.9413313,0.017827652,0.038001116],"study_design_scores_gemma":[0.00052947184,0.0003253213,0.0006116265,0.0011090904,0.00073268515,0.000012321337,0.00008470522,0.17977771,0.0001236678,0.8120626,0.0037245923,0.00090618717],"about_ca_topic_score_codex":0.00001164564,"about_ca_topic_score_gemma":0.0000015786435,"teacher_disagreement_score":0.9866089,"about_ca_system_score_codex":0.00006645566,"about_ca_system_score_gemma":0.000060219798,"threshold_uncertainty_score":0.99971354},"labels":[],"label_agreement":null},{"id":"W2003131755","doi":"10.1145/1516360.1516442","title":"Efficient identification of starters and followers in social media","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Social media; Identification (biology); Relation (database); World Wide Web; Computer science; Social web; User engagement; Internet privacy; Sociology; Psychology","score_opus":0.008561950765350197,"score_gpt":0.25869579934993153,"score_spread":0.2501338485845813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003131755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98773396,0.000007721077,0.009086055,0.000114666764,0.000009642967,0.000049650604,0.000001753428,0.000012608809,0.0029839228],"genre_scores_gemma":[0.9996567,2.996082e-7,0.0002722883,0.000007707651,0.0000324232,0.0000018040621,0.0000064803985,0.0000015749907,0.000020766793],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9996218,0.000012510249,0.00015562543,0.00008082552,0.00006502863,0.00006418861],"domain_scores_gemma":[0.9998469,0.000019524186,0.00005015938,0.000056766494,0.000014472051,0.000012183109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102870355,0.000038410984,0.00008822304,0.00006156181,0.00001914332,0.000008419089,0.000039346272,0.000009043581,0.000051523817],"category_scores_gemma":[0.0000012730973,0.000036828606,0.00003341014,0.0001314469,0.00001747517,0.0000130253,0.000008049704,0.000026582818,7.6634643e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004286149,0.000762116,0.09056562,0.000008551087,0.000093670336,9.310923e-7,0.0071182246,0.0010404092,0.05005742,0.3566592,0.0054268674,0.48822412],"study_design_scores_gemma":[0.0011703381,0.000062900166,0.8138108,0.000023828876,0.000087830565,1.1000745e-7,0.0031762458,0.06222234,0.019675085,0.0990378,0.00031069323,0.000421998],"about_ca_topic_score_codex":0.000027680826,"about_ca_topic_score_gemma":0.000009964804,"teacher_disagreement_score":0.7232452,"about_ca_system_score_codex":0.0000071454233,"about_ca_system_score_gemma":0.0000047582535,"threshold_uncertainty_score":0.1501827},"labels":[],"label_agreement":null},{"id":"W2005020601","doi":"10.1103/physrevlett.99.098701","title":"Localization Transition of Biased Random Walks on Random Networks","year":2007,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Random walk; Statistical physics; Transition (genetics); Physics; Mathematics; Statistics","score_opus":0.011385817401257806,"score_gpt":0.28585810038715564,"score_spread":0.2744722829858978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005020601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037854306,0.0007059496,0.9592327,0.00078151963,0.000037189882,0.0005530525,0.000004214905,0.000055377084,0.00077571376],"genre_scores_gemma":[0.9946789,0.00023903092,0.00015430206,0.004253675,0.00050092273,0.000030640287,0.00012042638,0.000019654166,0.000002442415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869853,0.00014207418,0.00043798363,0.00023468128,0.00024776897,0.00023898603],"domain_scores_gemma":[0.999041,0.00034011956,0.00021076053,0.00028609738,0.000053836884,0.0000681767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005024881,0.00018827103,0.00060905924,0.000057832072,0.000055801927,0.0000114484765,0.00013651948,0.000010293349,0.000109419154],"category_scores_gemma":[0.000008727372,0.00015826798,0.0004701552,0.0004411709,0.000060552447,0.00006631645,0.00001370944,0.00016163794,0.000011488996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025682375,0.0032767053,0.0030663372,0.0018374108,0.0014923863,0.000017807552,0.0008024526,0.24492946,0.024780395,0.025767734,0.07568947,0.6157716],"study_design_scores_gemma":[0.017322987,0.0005040757,0.0018403233,0.012375499,0.0030835671,0.0000017460075,0.000052064217,0.8941153,0.021672808,0.007896049,0.038881373,0.0022541978],"about_ca_topic_score_codex":0.00003688458,"about_ca_topic_score_gemma":0.0000013435528,"teacher_disagreement_score":0.9590784,"about_ca_system_score_codex":0.00002223744,"about_ca_system_score_gemma":0.000006304846,"threshold_uncertainty_score":0.6453981},"labels":[],"label_agreement":null},{"id":"W200532039","doi":"10.1007/978-1-4419-6287-4_8","title":"ONDOCS: Ordering Nodes to Detect Overlapping Community Structure","year":2010,"lang":"en","type":"book-chapter","venue":"Annals of information systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Outlier; Data mining; Metric (unit); Scalability; Intuition; Community structure; Machine learning; Theoretical computer science; Data science; Artificial intelligence; Mathematics; Engineering; Database","score_opus":0.03586288736963758,"score_gpt":0.28786112329899655,"score_spread":0.251998235929359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W200532039","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012818701,0.00016877713,0.05800862,0.00006729793,0.0004582751,0.0012516702,0.0007983714,0.00023975383,0.9261885],"genre_scores_gemma":[0.99260634,0.000008752047,0.0013843676,0.00014708783,0.00037836196,0.000024321822,0.00047211742,0.000034018147,0.00494462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984096,0.000040040486,0.0009224311,0.00009724593,0.00032755153,0.00020310492],"domain_scores_gemma":[0.99757624,0.000090814676,0.0009656727,0.00069704745,0.0005812409,0.000088972636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040823786,0.00030492526,0.00061008096,0.00037614314,0.00020198856,0.00015765186,0.00043921714,0.000182305,0.00026106488],"category_scores_gemma":[0.0000123640075,0.00029971413,0.00022971987,0.00008523898,0.000036698104,0.0004571705,0.00019619403,0.00075151946,0.00005356538],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009588654,0.00003419559,0.00058901263,0.0018465898,0.0024821123,8.35826e-7,0.0070958603,0.007826619,0.0042711208,0.6391404,0.024987804,0.31162956],"study_design_scores_gemma":[0.0001876578,0.00009029404,0.00017335033,0.0014173593,0.000074446645,0.00000301024,0.00044238975,0.0009085966,0.003783382,0.019561008,0.97254694,0.0008115735],"about_ca_topic_score_codex":0.0011769903,"about_ca_topic_score_gemma":0.00004751544,"teacher_disagreement_score":0.97978765,"about_ca_system_score_codex":0.000016694727,"about_ca_system_score_gemma":0.000047441034,"threshold_uncertainty_score":0.9999455},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014753997209886396,"score_gpt":0.2711749183502127,"score_spread":0.2564209211403263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005498212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9691559,0.0000028998331,0.029192507,0.00015421232,0.00009873758,0.000061946645,0.000005799902,0.000054474727,0.0012735141],"genre_scores_gemma":[0.9975475,0.0000018394655,0.001948676,0.00011130355,0.00024712432,0.0000025884601,0.000059017682,0.000008578102,0.00007339469],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99940526,0.00002019891,0.00012821816,0.00011402733,0.0001512849,0.00018099065],"domain_scores_gemma":[0.9994327,0.000027536804,0.00005691852,0.00028445185,0.00016142649,0.00003701172],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028032318,0.0000638826,0.0000817335,0.00010578055,0.00019291727,0.00009077947,0.00041097437,0.00001393087,0.0019476755],"category_scores_gemma":[0.00001011852,0.00006304218,0.000010286862,0.0019236293,0.0001254063,0.00021674244,0.00017586627,0.00015186072,0.0000130976005],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.8148224e-7,0.000037517257,0.9845933,7.899315e-7,9.446495e-7,1.101699e-7,0.0003909632,0.00012248558,0.0013315869,0.008976685,0.00023639374,0.004309049],"study_design_scores_gemma":[0.00015853642,0.0000132806945,0.9770166,0.000024805595,0.000007394373,8.74559e-7,0.0009917408,0.008841259,0.0031441422,0.0067409296,0.002803769,0.00025661907],"about_ca_topic_score_codex":0.0004946473,"about_ca_topic_score_gemma":0.0010375495,"teacher_disagreement_score":0.028391572,"about_ca_system_score_codex":0.00001272127,"about_ca_system_score_gemma":0.000047669713,"threshold_uncertainty_score":0.99896467},"labels":[],"label_agreement":null},{"id":"W2005724884","doi":"10.5539/ijsp.v2n4p64","title":"Assessing Goodness of Fit of Exponential Random Graph Models","year":2013,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Goodness of fit; Exponential random graph models; Statistic; Computer science; Exponential function; Graph; Statistics; Mathematics; Data mining; Random graph; Theoretical computer science","score_opus":0.03118772774747145,"score_gpt":0.3108430410146557,"score_spread":0.27965531326718424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005724884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48199043,0.000032568743,0.5174527,0.00003861922,0.00007257738,0.00006367319,0.00006269356,0.0000015149582,0.0002852158],"genre_scores_gemma":[0.9462221,0.0000128282945,0.05364982,0.0000039102933,0.00008939287,0.0000028998727,0.000009337873,0.000004178303,0.0000054832954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988287,0.00006303786,0.00065289316,0.00008259786,0.00030273007,0.000070061695],"domain_scores_gemma":[0.99782753,0.00021806412,0.00068049115,0.000085129985,0.001145541,0.00004326987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037632167,0.000077153185,0.0002760872,0.000085348765,0.00002026055,0.000059174134,0.00018840263,0.000017901006,0.0002879041],"category_scores_gemma":[0.000024826366,0.00006434792,0.0001049749,0.0000560402,0.00010864358,0.00029683998,0.000057032685,0.00009635193,1.838726e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047235892,0.001714985,0.21490599,0.0001740415,0.002289977,0.000005926934,0.0010993183,0.010324475,0.008356783,0.42438552,0.0022378752,0.33403274],"study_design_scores_gemma":[0.00078353856,0.000058526115,0.015545614,0.00007689263,0.000069218295,0.0000028376287,0.00008863417,0.020130768,0.0015760362,0.96155864,0.00003195791,0.00007736377],"about_ca_topic_score_codex":0.0003072947,"about_ca_topic_score_gemma":0.0000035777932,"teacher_disagreement_score":0.5371731,"about_ca_system_score_codex":0.000012780398,"about_ca_system_score_gemma":0.000049635088,"threshold_uncertainty_score":0.3152348},"labels":[],"label_agreement":null},{"id":"W2005793290","doi":"10.1088/0256-307x/27/2/028901","title":"Condensation of Self-Driven Particles in Scale-Free Networks","year":2010,"lang":"en","type":"article","venue":"Chinese Physics Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council Canada","keywords":"Condensation; Materials science; Scale (ratio); Chemical physics; Thermodynamics; Physics; Quantum mechanics","score_opus":0.004940972917695779,"score_gpt":0.23277626139677937,"score_spread":0.2278352884790836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005793290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9733245,0.0000047903654,0.025696434,0.00031419785,0.00007750748,0.000134441,0.0000054956313,0.000067929956,0.0003747465],"genre_scores_gemma":[0.99538076,6.806432e-7,0.0038308427,0.00012249858,0.0005853625,0.000024526813,0.000032612206,0.000019657036,0.0000030499466],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991322,0.000039026083,0.000272311,0.00020597017,0.00013928235,0.0002112224],"domain_scores_gemma":[0.999164,0.00008273345,0.00015581986,0.0005075428,0.000045173794,0.000044726472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011042008,0.00015979336,0.00026506258,0.000053389973,0.000040131385,0.000024941657,0.00030189526,0.000028342565,0.00004691953],"category_scores_gemma":[0.000004176564,0.00014639166,0.00013628395,0.00040236418,0.00007155094,0.00014189897,0.00010635471,0.00027741157,0.0000045227343],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008040018,0.00019728934,0.8078548,0.0000074448158,0.000065074346,7.145449e-7,0.00036756782,0.00867542,0.17059562,0.0077418727,0.00093669613,0.0035494743],"study_design_scores_gemma":[0.0018930899,0.000038874237,0.35796165,0.00005881498,0.00013648503,7.6279974e-7,0.000056854362,0.48982972,0.036730487,0.112293206,0.00017843001,0.00082162954],"about_ca_topic_score_codex":0.00013673498,"about_ca_topic_score_gemma":0.00008225923,"teacher_disagreement_score":0.4811543,"about_ca_system_score_codex":0.000011470198,"about_ca_system_score_gemma":0.000011905787,"threshold_uncertainty_score":0.5969679},"labels":[],"label_agreement":null},{"id":"W2005989548","doi":"10.1088/1367-2630/17/1/013044","title":"Defining and identifying cograph communities in complex networks","year":2015,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Centrality; Enhanced Data Rates for GSM Evolution; Community structure; Complex network; Computer science; Cograph; Focus (optics); Representation (politics); Simple (philosophy); Theoretical computer science; Identification (biology); Graph; Algorithm; Artificial intelligence; Combinatorics; Mathematics; Physics; Political science; Epistemology; World Wide Web","score_opus":0.06252222761273765,"score_gpt":0.31076026157493575,"score_spread":0.2482380339621981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005989548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46410814,0.0020119294,0.5290249,0.00011433322,0.00013276524,0.00009688806,0.0000033415197,0.000027730663,0.0044799983],"genre_scores_gemma":[0.99252844,0.000029770434,0.006884699,0.00004153839,0.0004768321,7.455683e-7,0.000011960306,0.000013312171,0.000012690522],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991211,0.00009775354,0.00036988853,0.000060880106,0.00017431115,0.00017602611],"domain_scores_gemma":[0.99917084,0.000107176355,0.00032621084,0.00014092047,0.00012582462,0.00012904308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037953147,0.00011767085,0.0003208216,0.000103684215,0.00005868842,0.00009298413,0.00020109398,0.000020644886,0.000029628627],"category_scores_gemma":[0.000003144632,0.00011413927,0.00010940255,0.00029598176,0.00006002786,0.00023889587,0.00009908021,0.00035103425,0.0000010617179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050511335,0.00015751075,0.6279217,0.000008811625,0.0002495906,0.000007767259,0.0033079532,0.016626773,0.00006788972,0.081469685,0.018165488,0.2519663],"study_design_scores_gemma":[0.0060129934,0.00052365195,0.054958407,0.00084960373,0.00048101807,0.00004595199,0.01898978,0.108722225,0.0005204676,0.7889141,0.01886592,0.0011158693],"about_ca_topic_score_codex":0.00064381026,"about_ca_topic_score_gemma":0.00007132033,"teacher_disagreement_score":0.7074444,"about_ca_system_score_codex":0.000021088543,"about_ca_system_score_gemma":0.00005540113,"threshold_uncertainty_score":0.46544644},"labels":[],"label_agreement":null},{"id":"W2006144017","doi":"10.1016/j.tcs.2015.02.032","title":"Spread of influence in weighted networks under time and budget constraints","year":2015,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Bounded function; Time complexity; Set (abstract data type); Simple (philosophy); Combinatorics; Graph; Mathematics; Polynomial; Computer science; Discrete mathematics","score_opus":0.008156097673453464,"score_gpt":0.26168961917936084,"score_spread":0.25353352150590736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006144017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4819279,0.000047823425,0.5141884,0.000093707764,0.000079249054,0.00024283142,0.000015735386,0.00004886578,0.0033554824],"genre_scores_gemma":[0.9819812,0.0000029451026,0.01781466,0.000047989404,0.00011569306,0.000007781485,0.000015058095,0.000010280663,0.0000043547093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798095,0.00013768586,0.00044869792,0.0006577671,0.00037705107,0.00039783327],"domain_scores_gemma":[0.9985251,0.00018064704,0.00018803128,0.00061653554,0.00029588904,0.00019383786],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013025725,0.00025768185,0.00053769036,0.00021123527,0.000058363017,0.00013993683,0.00095155,0.00009564244,0.00016020809],"category_scores_gemma":[0.000010490762,0.00022965622,0.00007363308,0.00054408,0.006058985,0.000108548134,0.0023841558,0.0005234102,0.0000060779207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013069199,0.00009254682,0.0039573447,0.000010844501,0.000028664463,0.0000024730036,0.00013762566,0.01844968,0.00007823293,0.9563364,0.00011645373,0.02077669],"study_design_scores_gemma":[0.000102667356,0.000029230256,0.0019031231,0.00013646398,0.000015995673,0.0000010130382,0.0000031310244,0.55340147,0.00016145213,0.44406804,0.000003909816,0.000173478],"about_ca_topic_score_codex":0.00005365295,"about_ca_topic_score_gemma":0.0000013112133,"teacher_disagreement_score":0.5349518,"about_ca_system_score_codex":0.000045916007,"about_ca_system_score_gemma":0.00020538123,"threshold_uncertainty_score":0.9966459},"labels":[],"label_agreement":null},{"id":"W2006177467","doi":"10.1103/physreve.81.046102","title":"Loops and multiple edges in modularity maximization of networks","year":2010,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Maximization; Null model; Null (SQL); Mathematics; Random graph; Modularity (biology); Clique; Combinatorics; Clique problem; Discrete mathematics; Computer science; Pathwidth; Mathematical optimization; Graph; Line graph","score_opus":0.011031249524207665,"score_gpt":0.2855459455967111,"score_spread":0.27451469607250345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006177467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9469817,0.003919211,0.046218086,0.00020217302,0.00004522693,0.0005412192,0.0000071729373,0.000041161962,0.0020440207],"genre_scores_gemma":[0.99849534,0.000495861,0.00077082525,0.000031650445,0.00015688372,0.0000152570465,0.00002042034,0.000007133943,0.00000660237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994485,0.00003963109,0.0001849449,0.00015006705,0.0000703458,0.00010650682],"domain_scores_gemma":[0.9995426,0.00008121051,0.000089880574,0.00021023295,0.000040101986,0.000035958616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013285465,0.00008825256,0.00031847184,0.000020647076,0.000018248165,0.000007754788,0.00009024231,0.000013408562,0.00004802887],"category_scores_gemma":[0.00002061854,0.000076991026,0.00008337388,0.0002165064,0.000044640303,0.000058324134,0.00006416141,0.00018750077,0.0000016325214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007389181,0.00067613844,0.36686027,0.00038102,0.000056886292,4.814582e-7,0.000057882626,0.0007033885,0.003830611,0.08881084,0.0007157037,0.5378994],"study_design_scores_gemma":[0.000611227,0.000058250414,0.107488275,0.0013011381,0.00023855321,5.44202e-7,0.000009486824,0.75122184,0.00406724,0.12794302,0.006504767,0.0005556691],"about_ca_topic_score_codex":0.000112984366,"about_ca_topic_score_gemma":0.000027760068,"teacher_disagreement_score":0.75051844,"about_ca_system_score_codex":0.000002903141,"about_ca_system_score_gemma":0.00000632017,"threshold_uncertainty_score":0.31396028},"labels":[],"label_agreement":null},{"id":"W2006185078","doi":"10.1371/journal.pone.0106086","title":"Astrophysicists’ Conversational Connections on Twitter","year":2014,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Economic and Social Research Council; Joint Information Systems Committee; Arts and Humanities Research Council; National Science Foundation","keywords":"Affordance; Altmetrics; Social media; Terminology; World Wide Web; Publishing; Variety (cybernetics); Microblogging; Computer science; Psychology; Linguistics; Human–computer interaction; Political science","score_opus":0.03500668078735206,"score_gpt":0.23422028026545574,"score_spread":0.1992135994781037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006185078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88763577,0.0000015575501,0.054668013,0.0006624514,0.000025534637,0.00014531592,0.000010029002,0.00014051703,0.056710824],"genre_scores_gemma":[0.99452966,1.8042836e-7,0.0036734522,0.00022422237,0.0006768734,0.00003688794,0.000053279382,0.000011600315,0.0007938681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99938923,0.000035857873,0.00011102446,0.00015976104,0.00017986192,0.00012424671],"domain_scores_gemma":[0.9995356,0.000090113994,0.00005460498,0.00021743067,0.00006244731,0.000039759234],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000052800304,0.00008675044,0.00014541333,0.000047916586,0.00008618655,0.000026229365,0.00008630732,0.000013275971,0.0015360096],"category_scores_gemma":[0.000004577093,0.00008742605,0.00007149228,0.00009760223,0.000029584276,0.00003663477,0.000023980156,0.00010213804,0.0003324931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053964955,0.006112243,0.11936574,0.000022932625,0.0019836202,5.5966285e-7,0.00027463541,0.00040559805,0.051558275,0.78894454,0.022855991,0.00842187],"study_design_scores_gemma":[0.003552577,0.001490983,0.07501504,0.00052206294,0.0016381389,5.162098e-7,0.0003105804,0.13070516,0.43323606,0.31924114,0.032025885,0.002261863],"about_ca_topic_score_codex":0.000025457115,"about_ca_topic_score_gemma":8.4269556e-7,"teacher_disagreement_score":0.46970344,"about_ca_system_score_codex":0.000016344722,"about_ca_system_score_gemma":0.000007800888,"threshold_uncertainty_score":0.9993767},"labels":[],"label_agreement":null},{"id":"W2006509071","doi":"10.1109/icsmc.2007.4414204","title":"Ivory coast toxic waste dumping dispute: A comparison of the graph model and drama theory","year":2007,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"","keywords":"Dumping; Drama; Conflict resolution; Toxic waste; Graph theory; Order (exchange); Capital city; Computer science; Business; Operations research; Environmental economics; Hazardous waste; Economics; Engineering; Political science; Law; Waste management; Mathematics; International trade; Economic geography; Finance","score_opus":0.014167418590937722,"score_gpt":0.28050231051156843,"score_spread":0.2663348919206307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006509071","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5884739,0.00006524507,0.40291652,0.000030352656,0.000015577514,0.00009306882,0.0000026329192,0.000027127217,0.008375583],"genre_scores_gemma":[0.99733293,0.0000013518704,0.0021865063,0.000041213556,0.00006331422,0.000004301427,0.0000030060169,0.000010788062,0.00035661386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991814,0.00004508393,0.00028506984,0.0001636831,0.0001332197,0.00019155101],"domain_scores_gemma":[0.9993576,0.00011385711,0.000131937,0.00031303265,0.00003820413,0.00004538532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039044995,0.00011959809,0.00022661012,0.000059311897,0.000118980606,0.000022975693,0.00019473616,0.000025352985,0.000050384395],"category_scores_gemma":[0.000002181776,0.00008168686,0.0001415825,0.00021673723,0.00011345097,0.000056250716,0.00018605965,0.00013231067,6.473833e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043433763,0.00028221967,0.22445902,0.000021413129,0.00022312712,2.2989315e-7,0.0014089599,0.0049732127,0.0075720535,0.6977589,0.0020763187,0.06118111],"study_design_scores_gemma":[0.00072169,0.00007341156,0.018286066,0.00016962616,0.0002961374,9.100523e-7,0.0063687325,0.47815347,0.061590455,0.4333038,0.0004141993,0.0006215092],"about_ca_topic_score_codex":0.00009368078,"about_ca_topic_score_gemma":0.00015605609,"teacher_disagreement_score":0.47318026,"about_ca_system_score_codex":0.000007498993,"about_ca_system_score_gemma":0.0000136551935,"threshold_uncertainty_score":0.33310935},"labels":[],"label_agreement":null},{"id":"W2008671102","doi":"10.1109/iscas.2012.6271569","title":"Contingency constrained optimal power flow solutions in complex network power grids","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Mathematical optimization; Power flow; Network topology; Contingency; Computer science; Topology (electrical circuits); Flow network; Maximum flow problem; Power (physics); Power network; Multi-commodity flow problem; Graph theory; Graph; Electric power system; Mathematics; Theoretical computer science; Computer network","score_opus":0.021923060310736008,"score_gpt":0.2679954357709825,"score_spread":0.2460723754602465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008671102","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13543697,0.0002670826,0.35933843,0.00046604444,0.0003329118,0.0005872356,0.000042128213,0.0003902678,0.5031389],"genre_scores_gemma":[0.9661227,0.000001155782,0.032676246,0.00011390834,0.00046922572,0.000036885616,0.0000931503,0.000021596006,0.00046512415],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99820125,0.00008600403,0.00042792357,0.00023756616,0.00015269367,0.00089459063],"domain_scores_gemma":[0.99926573,0.00008246757,0.000095472395,0.00033501987,0.00006721116,0.00015407396],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044198212,0.00022708131,0.00035133367,0.00009013655,0.00017019034,0.000047090845,0.00021026527,0.000051524545,0.016136872],"category_scores_gemma":[0.00000495789,0.0002177317,0.0002068512,0.00043030054,0.000107643915,0.00020327706,0.00016231899,0.00022101907,0.00010027226],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017057097,0.00063379883,0.43738037,0.0000025597155,0.00025009678,0.0000016955062,0.00044515,0.0034144896,0.0004007905,0.40827188,0.14342532,0.005756788],"study_design_scores_gemma":[0.0036364738,0.00032152256,0.45247117,0.00012840335,0.00035380173,0.000013564361,0.0024829044,0.15936607,0.0003876391,0.023970166,0.35343543,0.0034328448],"about_ca_topic_score_codex":0.00014204992,"about_ca_topic_score_gemma":0.000032446133,"teacher_disagreement_score":0.83068573,"about_ca_system_score_codex":0.000035919995,"about_ca_system_score_gemma":0.00003264747,"threshold_uncertainty_score":0.9847625},"labels":[],"label_agreement":null},{"id":"W2009532016","doi":"10.1038/srep02171","title":"Global efficiency of local immunization on complex networks","year":2013,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":111,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Betweenness centrality; Complex network; Mesoscopic physics; Scale (ratio); Measure (data warehouse); Community structure; Complex system; Immunization","score_opus":0.009212425791800403,"score_gpt":0.24967410171352353,"score_spread":0.24046167592172313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009532016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46812022,0.000032278876,0.5126573,0.0000305582,0.0007865346,0.00029840576,0.0000018196891,0.00007420479,0.017998716],"genre_scores_gemma":[0.99881715,2.2459287e-7,0.0006372773,0.000009265012,0.00006977623,0.000016212703,0.00013669551,0.0000070663427,0.00030635612],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985391,0.000043108947,0.0004749649,0.00038760866,0.00031983422,0.00023537835],"domain_scores_gemma":[0.9985618,0.000020351996,0.0003387359,0.000772736,0.0002414086,0.00006496161],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039005672,0.000119014716,0.00019778282,0.0000743899,0.00018439192,0.0001341854,0.00017655414,0.000027125248,0.0014490602],"category_scores_gemma":[0.0000047986787,0.00010586252,0.00012601103,0.00090056175,0.00025979502,0.00009667457,0.00009533674,0.000060224895,0.00002400732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109839375,0.001170358,0.39289573,0.000019183102,0.00017069264,0.000020107187,0.00016271674,0.1500469,0.003381328,0.04869251,0.22800638,0.17542313],"study_design_scores_gemma":[0.00033261313,0.0001730171,0.12912767,0.00014673351,0.00011058499,0.000018305574,0.00041456407,0.5900808,0.009552231,0.2514237,0.01777888,0.0008409143],"about_ca_topic_score_codex":0.00043435078,"about_ca_topic_score_gemma":0.000007589144,"teacher_disagreement_score":0.5306969,"about_ca_system_score_codex":0.000035304754,"about_ca_system_score_gemma":0.00003991234,"threshold_uncertainty_score":0.99946374},"labels":[],"label_agreement":null},{"id":"W2010023761","doi":"10.1016/j.jcss.2007.04.001","title":"The web from a complex adaptive systems perspective","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Computer science; Complex adaptive system; Perspective (graphical); Web modeling; World Wide Web; Complex system; Web intelligence; Openness to experience; Data science; Web service; Artificial intelligence","score_opus":0.023887283972343312,"score_gpt":0.28359252803897544,"score_spread":0.25970524406663215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010023761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25335333,0.0025281012,0.7224299,0.00023650359,0.0008320534,0.00019594471,0.000008542603,0.000030504305,0.020385144],"genre_scores_gemma":[0.9949198,0.0000062052654,0.0036838483,0.0000095916575,0.0013584269,8.047707e-7,1.9625529e-7,0.0000032278238,0.000017909964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987461,0.00011991156,0.0004494049,0.00013753913,0.00036054198,0.00018651456],"domain_scores_gemma":[0.9985971,0.00047000896,0.00046128547,0.00010194473,0.00028760138,0.00008205854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016741796,0.000102156606,0.00028021284,0.00009876252,0.00044395143,0.00032323544,0.00037219102,0.0000151655395,0.0000048393954],"category_scores_gemma":[0.0000015544082,0.00005674579,0.00011935183,0.00024569477,0.00020007549,0.0001431965,0.000069226924,0.00011590151,0.0000014761797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008772731,0.000085842934,0.038232625,0.000010064075,0.0006768346,0.000026854124,0.0024888832,0.0013554435,0.0003128606,0.91711104,0.010335813,0.02927604],"study_design_scores_gemma":[0.0012744558,0.0013195472,0.04933363,0.0008006501,0.0002598103,0.0002150921,0.10636277,0.8015658,0.00013261914,0.020935014,0.017139193,0.0006614086],"about_ca_topic_score_codex":0.00034592726,"about_ca_topic_score_gemma":0.000017925651,"teacher_disagreement_score":0.896176,"about_ca_system_score_codex":0.000048092264,"about_ca_system_score_gemma":0.00006330035,"threshold_uncertainty_score":0.34145606},"labels":[],"label_agreement":null},{"id":"W2010124625","doi":"10.1016/j.sbspro.2011.07.055","title":"Community Evolution Mining in Dynamic Social Networks","year":2011,"lang":"en","type":"article","venue":"Procedia - Social and Behavioral Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":99,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Community structure; Matching (statistics); Data science; Dynamic network analysis; Social network analysis; Data mining; Complex network; Graph; Social network (sociolinguistics); Series (stratigraphy); Theoretical computer science; Social media; World Wide Web; Mathematics","score_opus":0.10381495649428735,"score_gpt":0.35478282972602004,"score_spread":0.2509678732317327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010124625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99673647,0.000023803914,0.00056746614,0.000040274615,0.000038327835,0.00008903618,0.0000030301176,0.000042882424,0.0024586958],"genre_scores_gemma":[0.99928284,0.0000011419619,0.00050678424,0.00000910915,0.00014084304,0.000027397135,0.000006491844,0.0000044209387,0.00002097906],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991991,0.000083991836,0.00016502754,0.00015942047,0.00012630662,0.0002661564],"domain_scores_gemma":[0.99979687,0.00001365341,0.00008849008,0.00003729027,0.000030381068,0.000033292516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040504747,0.00010381889,0.00015817124,0.00006689179,0.0010045082,0.00005219304,0.00020113756,0.000047742957,0.000071365335],"category_scores_gemma":[0.0000014035376,0.00009593539,0.000054974873,0.00047882347,0.00040456152,0.00020216676,0.00011752652,0.00021418161,0.0000010919266],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069586654,0.00026089954,0.93595016,0.000003048162,0.0000046170608,3.8653872e-7,0.008321358,0.0000021169255,0.00008653165,0.005144183,0.00011482113,0.050104894],"study_design_scores_gemma":[0.0001890426,0.00011549748,0.9610284,0.000015162877,0.00005301754,4.572886e-7,0.010169674,0.0033670408,0.00002978544,0.024690997,0.000049116465,0.00029178776],"about_ca_topic_score_codex":0.004389951,"about_ca_topic_score_gemma":0.0015261789,"teacher_disagreement_score":0.049813107,"about_ca_system_score_codex":0.00003359055,"about_ca_system_score_gemma":0.00003460589,"threshold_uncertainty_score":0.7725967},"labels":[],"label_agreement":null},{"id":"W2010831422","doi":"10.1080/00330124.2010.533560","title":"Social Network Analysis of the Academic GIScience Community","year":2010,"lang":"en","type":"article","venue":"The Professional Geographer","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Social network analysis; Field (mathematics); Social network (sociolinguistics); Sociology; Geography; Data science; Humanities; Social science; Computer science; World Wide Web; Social media; Social capital; Mathematics; Philosophy","score_opus":0.018682220181867614,"score_gpt":0.32969159997048536,"score_spread":0.31100937978861776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010831422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942198,0.000023321792,0.00046136638,0.00094296626,0.00020129768,0.00016321363,0.0000131941,0.00002761036,0.003947246],"genre_scores_gemma":[0.99864507,7.50134e-7,0.00016615896,0.00016993085,0.00030487854,0.000030860174,0.000011618617,0.0000069770613,0.00066373916],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985677,0.00047000012,0.00026136154,0.00012184262,0.00032900096,0.00025007478],"domain_scores_gemma":[0.99876803,0.0002768417,0.00026904375,0.0005626475,0.00009214781,0.00003126851],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012581875,0.00011741411,0.00022789343,0.00006934886,0.0013277021,0.0000140656675,0.0012471334,0.00006159618,0.0007583379],"category_scores_gemma":[0.0000074261147,0.00005957018,0.00049189327,0.0025973448,0.0005931756,0.000050376006,0.00057396275,0.001509584,0.000002790438],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008451281,0.00008583589,0.9270718,0.0000014737883,0.0005512775,1.5857486e-8,0.0006729871,0.0002550294,0.0016646077,0.061038822,0.005279303,0.00337041],"study_design_scores_gemma":[0.000069800924,0.0000048094707,0.8952279,0.000011989104,0.0007216382,7.35031e-8,0.00036940922,0.0016707696,0.00024808708,0.09904987,0.0025108203,0.00011481951],"about_ca_topic_score_codex":0.0005007031,"about_ca_topic_score_gemma":0.00023061379,"teacher_disagreement_score":0.03801105,"about_ca_system_score_codex":0.0000031536506,"about_ca_system_score_gemma":0.000040684805,"threshold_uncertainty_score":0.99997246},"labels":[],"label_agreement":null},{"id":"W2010994105","doi":"10.1007/s13278-015-0292-y","title":"SSRM: structural social role mining for dynamic social networks","year":2015,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Betweenness centrality; Centrality; Social network (sociolinguistics); Automatic summarization; Leverage (statistics); Data science; Social network analysis; Dynamic network analysis; Computer science; Organizational network analysis; Community structure; Event (particle physics); Network science; Complex network; Knowledge management; Artificial intelligence; Social media; World Wide Web","score_opus":0.015045648583704482,"score_gpt":0.29278568931377635,"score_spread":0.27774004073007186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010994105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.817925,0.000684251,0.17609498,0.0004343068,0.00026287252,0.00042061135,0.000061782026,0.00023868264,0.0038775215],"genre_scores_gemma":[0.98643553,0.0000035213602,0.0059748576,0.00009908255,0.0064778156,0.000081278384,0.0005532539,0.000056440247,0.00031821104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972867,0.00018564114,0.0006416427,0.0006272313,0.00032498795,0.0009337928],"domain_scores_gemma":[0.9987766,0.00015091056,0.000508099,0.00015469371,0.00023777378,0.00017187925],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007754621,0.00042435323,0.0010905822,0.00020180033,0.0018859498,0.00027943205,0.00028853698,0.0001995432,0.000089607565],"category_scores_gemma":[0.000009020401,0.00044796392,0.00094089215,0.0016144472,0.00017935285,0.00016701837,0.00021557856,0.000262128,0.0000010886358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032438952,0.00012602766,0.33215404,0.00002354061,0.014253711,0.000004410177,0.023211714,0.022007251,0.000035431978,0.03419461,0.044795923,0.528869],"study_design_scores_gemma":[0.0018623339,0.00011570301,0.03961376,0.000021245289,0.008544947,8.523791e-7,0.01824575,0.8923367,0.0000047771427,0.029762944,0.007939105,0.0015518713],"about_ca_topic_score_codex":0.00019376275,"about_ca_topic_score_gemma":0.00039330812,"teacher_disagreement_score":0.87032944,"about_ca_system_score_codex":0.000092217495,"about_ca_system_score_gemma":0.00007282654,"threshold_uncertainty_score":0.9997972},"labels":[],"label_agreement":null},{"id":"W2011851630","doi":"10.1109/icdmw.2010.103","title":"Modeling the Temporal Dynamics of Social Rating Networks Using Bidirectional Effects of Social Relations and Rating Patterns","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Generative model; Computer science; Social network (sociolinguistics); Social relation; Set (abstract data type); Transitive relation; Artificial intelligence; Machine learning; Dynamics (music); Social relationship; Data mining; Generative grammar; Data science; Psychology; Social psychology; Mathematics; Social media; World Wide Web","score_opus":0.00977118118524449,"score_gpt":0.2658707567689729,"score_spread":0.2560995755837284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011851630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.584718,0.0000031862862,0.41465825,0.00004118865,0.000037462094,0.000060866143,0.0000035493385,0.000015603528,0.00046193454],"genre_scores_gemma":[0.99377155,1.593494e-7,0.0056515485,0.0000053302488,0.00048121845,0.000006922333,0.000035212717,0.000012241513,0.00003583923],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992662,0.000064346204,0.0003035358,0.0001224267,0.00011777516,0.0001257142],"domain_scores_gemma":[0.9994558,0.00015645094,0.00020294059,0.00007532823,0.00009392941,0.000015525202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024172064,0.00009815142,0.00019344245,0.000044006407,0.00044005446,0.000028424061,0.00007610859,0.000049954942,0.00007187468],"category_scores_gemma":[0.000007407245,0.000081329665,0.000116278614,0.0001633498,0.000061189145,0.00007679203,0.00007927098,0.00026736272,7.0866825e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017222745,0.00018082326,0.5842465,0.00006165926,0.0004976183,3.169563e-7,0.0025699814,0.114600785,0.010751618,0.2564649,0.00016494155,0.030443646],"study_design_scores_gemma":[0.000104707564,0.000006157245,0.002435903,0.000012657177,0.00006477926,2.2877668e-7,0.00032260362,0.9948279,0.00018367331,0.0019597406,0.0000037837108,0.00007786591],"about_ca_topic_score_codex":0.0008363816,"about_ca_topic_score_gemma":0.000452223,"teacher_disagreement_score":0.8802271,"about_ca_system_score_codex":0.000012854389,"about_ca_system_score_gemma":0.000028645663,"threshold_uncertainty_score":0.33845878},"labels":[],"label_agreement":null},{"id":"W2013240448","doi":"10.1063/1.3039876","title":"First passage percolation on locally treelike networks. I. Dense random graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Random graph; Mathematics; Combinatorics; Limiting; Shortest path problem; Exponential function; Percolation (cognitive psychology); Enhanced Data Rates for GSM Evolution; Independent and identically distributed random variables; Discrete mathematics; Graph; Random variable; Computer science; Statistics","score_opus":0.01718648150027798,"score_gpt":0.24529066205962313,"score_spread":0.22810418055934514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013240448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12562189,0.00004198256,0.8684859,0.00018209522,0.00006651386,0.00018083403,0.0000023275304,0.000034176097,0.005384266],"genre_scores_gemma":[0.99261636,0.000023652341,0.006269655,0.00006923935,0.0008827746,0.0000067522424,0.0000037224686,0.00002802664,0.00009980483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836653,0.00008586337,0.0006966077,0.00014238105,0.00046673964,0.00024189675],"domain_scores_gemma":[0.99837035,0.00050568755,0.0004991389,0.00027750115,0.00020846573,0.0001388477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035852537,0.00021671609,0.00058361,0.00007510717,0.00018735026,0.00004108441,0.00024682775,0.00004864945,0.00024074904],"category_scores_gemma":[0.000023662122,0.00016763106,0.00058210414,0.00029357674,0.00009368389,0.00017910324,0.000039930033,0.00039792442,0.000030976455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017419773,0.0064782742,0.012633058,0.00013387667,0.0020670474,0.00018983918,0.0016879947,0.108479396,0.00032851193,0.7301343,0.080366105,0.055759605],"study_design_scores_gemma":[0.0023854543,0.00052098796,0.0014331535,0.0003508565,0.0003252807,0.00004415841,0.00007899216,0.14793068,0.00033297762,0.8450884,0.001092219,0.0004167881],"about_ca_topic_score_codex":0.0000031416855,"about_ca_topic_score_gemma":8.4352763e-7,"teacher_disagreement_score":0.8669945,"about_ca_system_score_codex":0.000039224426,"about_ca_system_score_gemma":0.000037085872,"threshold_uncertainty_score":0.6835797},"labels":[],"label_agreement":null},{"id":"W2013497788","doi":"10.1140/epjb/e2013-40920-6","title":"Degree correlation in scale-free graphs","year":2013,"lang":"en","type":"article","venue":"The European Physical Journal B","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Degree (music); Preferential attachment; Degree distribution; Mathematics; Scale-free network; Combinatorics; Distribution (mathematics); Joint probability distribution; Node (physics); Growth model; Conditional probability distribution; Scale (ratio); Statistics; Discrete mathematics; Mathematical analysis; Complex network; Physics","score_opus":0.014652346963359151,"score_gpt":0.23738690356438036,"score_spread":0.2227345566010212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013497788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6462077,0.000026711794,0.015505166,0.0005681498,0.00008050127,0.00017686668,0.0000018631908,0.00005446747,0.33737862],"genre_scores_gemma":[0.997878,0.000002178758,0.0005065468,0.0000393125,0.0013087367,0.0000041763055,0.0000029806824,0.000023250495,0.00023479144],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875236,0.00046301,0.0002410741,0.00012532128,0.00019436816,0.00022389695],"domain_scores_gemma":[0.9992503,0.000096010845,0.00014105815,0.00037073414,0.000063016356,0.000078891586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038444306,0.00012866389,0.00016068842,0.000066755994,0.00015212089,0.00013892801,0.0006021297,0.000007163303,0.0001818072],"category_scores_gemma":[0.00000578332,0.00008255031,0.0001900882,0.00029603823,0.00005544622,0.00019824329,0.00016959812,0.0005093656,0.00037847034],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012315097,0.00029960112,0.034669045,0.000001906463,0.0001014634,0.000008742018,0.0007925305,0.0008852037,0.002422653,0.021839896,0.063300595,0.875666],"study_design_scores_gemma":[0.0005159073,0.000054059532,0.22067611,0.00004951678,0.00005317792,0.000008669707,0.00015568575,0.005660994,0.00017455818,0.77137035,0.0010415365,0.0002394074],"about_ca_topic_score_codex":0.000074206786,"about_ca_topic_score_gemma":0.0000035927483,"teacher_disagreement_score":0.87542665,"about_ca_system_score_codex":0.000016930653,"about_ca_system_score_gemma":0.000008210796,"threshold_uncertainty_score":0.4864597},"labels":[],"label_agreement":null},{"id":"W2013807400","doi":"10.1239/jap/1165505216","title":"Navigation in small-world networks: a scale-free continuum model","year":2006,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Defense Advanced Research Projects Agency; Centre de Recherches Mathématiques; Scuola Normale Superiore","keywords":"Mathematics; Connection (principal bundle); Preferential attachment; Scale (ratio); Scale invariance; Statistical physics; Theoretical computer science; Complex network; Computer science; Combinatorics; Geography; Statistics; Geometry; Physics","score_opus":0.010206989251881703,"score_gpt":0.2274660986008347,"score_spread":0.21725910934895298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013807400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.818669,0.00003502174,0.16378143,0.00014381165,0.000035762576,0.00033918346,0.0000040160094,0.000027784898,0.01696398],"genre_scores_gemma":[0.9658296,6.0898356e-7,0.03356593,0.000020001078,0.00047391548,0.000024307536,0.000012054287,0.000013768236,0.00005979435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983848,0.00004992251,0.0009118511,0.00021088349,0.00018351412,0.0002590338],"domain_scores_gemma":[0.9987112,0.00007776199,0.00057294074,0.0003957453,0.00018136985,0.00006097993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001031559,0.00017100727,0.00044168197,0.00013075935,0.00005200031,0.00005366372,0.00037295255,0.00004531694,0.000046111138],"category_scores_gemma":[0.0000036234408,0.00015501055,0.00021811096,0.00047245238,0.00007033992,0.00010460485,0.0000970985,0.00043229986,0.0000012353953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046546388,0.0014285379,0.29195434,0.000042552016,0.0001128278,0.0000037377388,0.00018804494,0.5415707,0.0011094707,0.12545213,0.00911002,0.028562168],"study_design_scores_gemma":[0.0007232673,0.000021558959,0.007138894,0.000049204948,0.00005165932,9.055303e-7,0.000016652019,0.100105725,0.0008965514,0.8904531,0.00037371012,0.00016876237],"about_ca_topic_score_codex":0.00012546772,"about_ca_topic_score_gemma":0.0009725239,"teacher_disagreement_score":0.765001,"about_ca_system_score_codex":0.00012062797,"about_ca_system_score_gemma":0.00006488426,"threshold_uncertainty_score":0.6321147},"labels":[],"label_agreement":null},{"id":"W2014351728","doi":"10.1109/iv.2012.61","title":"Visualizing Community Centric Network Layouts","year":2012,"lang":"en","type":"article","venue":"2012 16th International Conference on Information Visualisation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bounding overwatch; Computer science; Focus (optics); Community structure; Frame (networking); Minimum bounding box; Data mining; Theoretical computer science; Information retrieval; Data science; Artificial intelligence; Mathematics; Computer network","score_opus":0.06510936874876437,"score_gpt":0.3523840399015485,"score_spread":0.2872746711527841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014351728","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1923817,0.000022967788,0.32148176,0.0005714926,0.0019353875,0.00062299054,0.00011050971,0.00044409384,0.4824291],"genre_scores_gemma":[0.9958625,0.0000064199007,0.00073114503,0.00044591585,0.0009951096,0.00005718126,0.0016558126,0.00001154381,0.00023440749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982787,0.00023542796,0.00055895327,0.0000899463,0.00047706685,0.00035995623],"domain_scores_gemma":[0.9986555,0.00010335106,0.00046975145,0.00026919227,0.0003774064,0.00012480376],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008932743,0.0002029717,0.0001803782,0.0002504058,0.00034570365,0.00023671502,0.00035053786,0.000062437124,0.005607534],"category_scores_gemma":[0.000028002913,0.00020442731,0.00010448403,0.0002896189,0.000038736587,0.003329175,0.000114587456,0.000345422,0.0006516621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002866065,0.0001594147,0.048997186,0.000006383381,0.00009012135,2.6599404e-8,0.0018022656,0.00044020644,0.000035287932,0.91524863,0.010921467,0.022270331],"study_design_scores_gemma":[0.0032572376,0.0003901822,0.22525683,0.00048587864,0.00025026238,0.000007638843,0.010666996,0.27371442,0.0034953163,0.090377256,0.38944215,0.0026558256],"about_ca_topic_score_codex":0.0002119879,"about_ca_topic_score_gemma":0.000005666209,"teacher_disagreement_score":0.8248714,"about_ca_system_score_codex":0.00012858606,"about_ca_system_score_gemma":0.000038252983,"threshold_uncertainty_score":0.9953015},"labels":[],"label_agreement":null},{"id":"W2015734610","doi":"10.3141/2453-11","title":"Hidden Social Networks that Drive Online Public Involvement in Infrastructure Construction","year":2014,"lang":"en","type":"article","venue":"Transportation Research Record Journal of the Transportation Research Board","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Social media; Social network (sociolinguistics); Social network analysis; Scale (ratio); Computer science; Business; Public relations; Data science; Internet privacy; Political science; World Wide Web; Geography","score_opus":0.06260915850595791,"score_gpt":0.3584078428068329,"score_spread":0.29579868430087497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015734610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9684973,0.00004523542,0.026998077,0.0032506136,0.00026155336,0.0006652135,0.00004369114,0.000026610292,0.00021170074],"genre_scores_gemma":[0.99570805,0.00012207986,0.0030943793,0.0000421305,0.00072948256,0.00005563892,0.000114515315,0.00004315764,0.000090543996],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9932211,0.0016422748,0.001286838,0.00040725633,0.0025455707,0.0008969272],"domain_scores_gemma":[0.996061,0.0005732754,0.00061167235,0.00038456617,0.0021080656,0.00026137047],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0036276376,0.00026784567,0.0005483553,0.0011687091,0.00060412113,0.00018924862,0.0010468969,0.00016610052,0.0006659091],"category_scores_gemma":[0.000035796656,0.00021410796,0.00044924853,0.002458084,0.00063708075,0.00058467285,0.000016245063,0.0028394836,0.000003818598],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026163927,0.0002490685,0.8989573,0.000041097708,0.00017584363,0.000008195168,0.0013967211,0.0017826112,0.00026053045,0.02513274,0.0038332962,0.06790093],"study_design_scores_gemma":[0.0012860271,0.00020739037,0.953668,0.0001528549,0.00004538767,1.4820255e-7,0.003821997,0.0025320388,0.00021246726,0.029550215,0.00831651,0.00020699215],"about_ca_topic_score_codex":0.006739978,"about_ca_topic_score_gemma":0.037929587,"teacher_disagreement_score":0.06769394,"about_ca_system_score_codex":0.00026853985,"about_ca_system_score_gemma":0.00037258316,"threshold_uncertainty_score":0.99987423},"labels":[],"label_agreement":null},{"id":"W2017082499","doi":"10.1007/s11280-012-0168-2","title":"Finding email correspondents in online social networks","year":2012,"lang":"en","type":"article","venue":"World Wide Web","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Similarity (geometry); Social network (sociolinguistics); World Wide Web; Data science; Graph; Information retrieval; Social media; Artificial intelligence; Theoretical computer science","score_opus":0.021668976744591402,"score_gpt":0.2994256717349167,"score_spread":0.2777566949903253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017082499","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9745469,0.0001913579,0.0061955643,0.00030439114,0.0003400492,0.00019495342,0.000016346472,0.00012758716,0.018082825],"genre_scores_gemma":[0.9939765,0.0000016146836,0.0005830359,0.00016136837,0.0016007142,0.000020010119,0.00009206223,0.00002392332,0.0035407809],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99880743,0.000085744665,0.00028719462,0.00017405789,0.00014897234,0.0004966085],"domain_scores_gemma":[0.9994813,0.00012686865,0.00011432534,0.0001801944,0.000019319843,0.00007799721],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002829568,0.00015932952,0.00025779428,0.00022811834,0.000110860914,0.000036374095,0.00020297282,0.00003104877,0.0012420852],"category_scores_gemma":[0.000004907914,0.00016744825,0.00013653935,0.00071242015,0.000030922823,0.00014629992,0.00013073382,0.0002943915,0.000044175948],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014514955,0.00018665771,0.9538961,0.0000015177976,0.00003410359,0.0000010944013,0.00012496422,0.00020257667,0.000046183846,0.005642105,0.028721947,0.011128257],"study_design_scores_gemma":[0.0011095504,0.000018969393,0.7844618,0.000118957076,0.00011333635,6.765442e-7,0.00034497606,0.034160934,0.00014754478,0.0041539986,0.17451946,0.0008497785],"about_ca_topic_score_codex":0.0001395234,"about_ca_topic_score_gemma":0.00068844284,"teacher_disagreement_score":0.16943426,"about_ca_system_score_codex":0.000064879554,"about_ca_system_score_gemma":0.000020507778,"threshold_uncertainty_score":0.9996709},"labels":[],"label_agreement":null},{"id":"W2017152855","doi":"10.1145/2661829.2661859","title":"CAST","year":2014,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of British Columbia","funders":"","keywords":"Computer science; STREAMS; Timeline; Context (archaeology); Social media; Task (project management); World Wide Web; Data stream mining; Creativity; Data science; Information retrieval; Data mining; Computer network; Engineering","score_opus":0.004528557172482196,"score_gpt":0.22774454047726644,"score_spread":0.22321598330478426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017152855","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024765423,0.0000012997397,0.3580562,0.000069276335,0.000011139531,0.00001822722,2.5706143e-7,0.00006689253,0.6170113],"genre_scores_gemma":[0.9935966,4.406014e-8,0.0034968567,0.00004967795,0.00020368272,0.0000034669138,0.0000037704683,0.0000033907913,0.002642499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997739,0.000010087132,0.000050209157,0.00006388497,0.000033279182,0.00006859339],"domain_scores_gemma":[0.9998146,0.000014444817,0.00001269715,0.00012656458,0.000011254099,0.00002043352],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000468227,0.000034308283,0.000052855197,0.00001457482,0.000024865887,0.000012978979,0.00005667826,0.000004333,0.0029919096],"category_scores_gemma":[4.881974e-7,0.00002843575,0.00003884313,0.000052981213,0.0000073989663,0.00001853501,0.000022021723,0.000024810357,0.00012464423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.5218803e-7,0.000020987398,0.047940295,4.0033515e-7,0.00001803933,4.0777184e-8,0.000012244978,0.00001533962,0.00019453031,0.79004824,0.026828932,0.13492048],"study_design_scores_gemma":[0.00020252123,0.00003544259,0.0078737745,0.000005499124,0.00003229528,3.3910766e-7,0.00005239431,0.033183195,0.007047475,0.2030942,0.7481761,0.00029675086],"about_ca_topic_score_codex":0.00013042834,"about_ca_topic_score_gemma":0.000005769474,"teacher_disagreement_score":0.9688312,"about_ca_system_score_codex":0.0000018639399,"about_ca_system_score_gemma":0.0000018940855,"threshold_uncertainty_score":0.9979195},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Analytics; Data science; World Wide Web","score_opus":0.0041232313029208505,"score_gpt":0.250569348265993,"score_spread":0.24644611696307211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018165284","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66465735,9.0021797e-7,0.029672796,0.000116744064,0.00009134253,0.000039118848,7.426841e-7,0.00011503968,0.305306],"genre_scores_gemma":[0.98926413,3.5610416e-8,0.008679584,0.00003279652,0.00051163166,0.0000073483247,0.0000035635733,0.000004435866,0.001496445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997504,0.0000034469786,0.000056286273,0.00007227597,0.000039199724,0.00007841443],"domain_scores_gemma":[0.9997633,0.000010909928,0.000014935868,0.00016756177,0.000015426072,0.000027853644],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000030447241,0.00004139599,0.000049996568,0.000018690505,0.000030383699,0.000021161228,0.00008661994,0.00000859107,0.007114456],"category_scores_gemma":[4.119036e-7,0.000033993965,0.000046180896,0.000055745542,0.000013565758,0.000028130653,0.000026217956,0.00009206209,0.00011224996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013795568,0.00009149857,0.3457312,5.9308945e-7,0.000044109744,4.403852e-7,0.000026484664,8.4323534e-7,0.05032342,0.4301416,0.05112539,0.12251303],"study_design_scores_gemma":[0.00035372816,0.000031487492,0.07665581,0.000004957098,0.000057841975,0.0000011894558,0.00008006321,0.003756195,0.13879378,0.25052175,0.5291271,0.00061609247],"about_ca_topic_score_codex":0.000087264205,"about_ca_topic_score_gemma":0.000008248234,"teacher_disagreement_score":0.4780017,"about_ca_system_score_codex":8.794057e-7,"about_ca_system_score_gemma":0.000004508888,"threshold_uncertainty_score":0.9937932},"labels":[],"label_agreement":null},{"id":"W2021542103","doi":"10.1145/1835980.1835984","title":"A geometric model for on-line social networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Dimension (graph theory); Computer science; Ranking (information retrieval); Euclidean space; Property (philosophy); Theoretical computer science; Space (punctuation); Line (geometry); Function (biology); Euclidean geometry; Euclidean distance; Power (physics); Geometric networks; Parameter space; Power law; Topology (electrical circuits); Algorithm; Artificial intelligence; Complex network; Mathematics; Combinatorics; Statistics; World Wide Web","score_opus":0.031960517054244506,"score_gpt":0.31154741955628285,"score_spread":0.2795869025020383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021542103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015710931,0.000002273646,0.9697994,0.00016811953,0.000049638988,0.00016551593,0.000008935861,0.00009388905,0.014001294],"genre_scores_gemma":[0.9827403,2.6414813e-7,0.0133152865,0.00013170937,0.0013014874,0.000078842815,0.00004626379,0.000016815784,0.0023690364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937373,0.000005403945,0.00014511183,0.00017667154,0.00007970488,0.00021934882],"domain_scores_gemma":[0.9995955,0.00007488272,0.00005321149,0.00017072774,0.00006326533,0.00004236508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012853876,0.000106063875,0.00015923465,0.00011222527,0.00013884266,0.00003637522,0.00015384909,0.000041493633,0.00046133326],"category_scores_gemma":[0.000003177696,0.000092574395,0.00018947457,0.0003260814,0.000020213367,0.00003361938,0.000040108822,0.00018597039,0.000008181059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033021945,0.00033092074,0.0024562061,0.0000025459042,0.00014330914,1.1213069e-7,0.00003929675,0.105723545,0.00017976647,0.560766,0.11593849,0.21438682],"study_design_scores_gemma":[0.00017482525,0.00002347172,0.0000809944,7.5816996e-7,0.000024200725,2.8778988e-8,0.0000044089948,0.9708018,0.00018273461,0.025415728,0.003177845,0.00011325714],"about_ca_topic_score_codex":0.000026625563,"about_ca_topic_score_gemma":0.000021101596,"teacher_disagreement_score":0.96702933,"about_ca_system_score_codex":0.000005916742,"about_ca_system_score_gemma":0.000015023575,"threshold_uncertainty_score":0.50512755},"labels":[],"label_agreement":null},{"id":"W2021616776","doi":"10.1103/physreve.76.046112","title":"Link and subgraph likelihoods in random undirected networks with fixed and partially fixed degree sequences","year":2007,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Degree (music); Mathematics; Function (biology); Combinatorics; Sequence (biology); Node (physics); Triangle inequality; Limit (mathematics); Partition function (quantum field theory); Discrete mathematics; Physics","score_opus":0.016164048444478666,"score_gpt":0.29345682994733385,"score_spread":0.2772927815028552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021616776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85849714,0.05235735,0.08074527,0.0008030656,0.00004679607,0.0018064278,0.000008864552,0.00023815707,0.005496942],"genre_scores_gemma":[0.99461395,0.00358913,0.0012337519,0.0001488898,0.00030851716,0.000053872587,0.000023928476,0.000017636212,0.000010356871],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986742,0.00012807125,0.00033816733,0.00035772767,0.00015853053,0.0003432964],"domain_scores_gemma":[0.9990678,0.0003629625,0.0001426695,0.00023404491,0.000056584875,0.00013597759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004385734,0.00023623786,0.00067122286,0.000055897362,0.00007047017,0.000045279165,0.00012408961,0.000025756946,0.000028564002],"category_scores_gemma":[0.000015102886,0.00017352744,0.00010835544,0.0006335576,0.00013208634,0.00010026481,0.000066878565,0.00025236295,0.0000019085187],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018217301,0.00023911029,0.20090368,0.0002672062,0.00025225262,0.000015256777,0.0001338246,0.00007309449,0.00045393707,0.008225391,0.00053701334,0.78871703],"study_design_scores_gemma":[0.015262637,0.0018260445,0.72047526,0.022205178,0.004067576,0.00002768188,0.00022330307,0.08053543,0.00436653,0.092927895,0.052270412,0.005812069],"about_ca_topic_score_codex":0.00018952666,"about_ca_topic_score_gemma":0.00030152893,"teacher_disagreement_score":0.782905,"about_ca_system_score_codex":0.000011037384,"about_ca_system_score_gemma":0.000025919837,"threshold_uncertainty_score":0.7076244},"labels":[],"label_agreement":null},{"id":"W2022518109","doi":"10.1038/ncomms6121","title":"A scaling law for random walks on networks","year":2014,"lang":"en","type":"article","venue":"Nature Communications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; McGill University; Ottawa Hospital","funders":"","keywords":"Random walk; Statistical physics; Complex network; Random graph; Continuous-time random walk; Nonlinear system; Power law; Exponential function; Computer science; Probability distribution; Scaling; Stochastic process; Path (computing); Mathematics; Physics; Theoretical computer science; Mathematical analysis; Combinatorics; Graph; Statistics","score_opus":0.014299982311314881,"score_gpt":0.3106405238194915,"score_spread":0.29634054150817657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022518109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021021124,0.0014105629,0.7815148,0.0047387793,0.00019302865,0.0010181038,0.000034250203,0.0003878136,0.20860054],"genre_scores_gemma":[0.98064375,0.000010123777,0.017795563,0.0006551699,0.00034068702,0.000190611,0.00025794518,0.00001885557,0.00008727683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931103,0.000117724376,0.00018264595,0.00015072666,0.000074213676,0.00016368733],"domain_scores_gemma":[0.99706596,0.0011617071,0.00009269019,0.0015292495,0.00010702241,0.000043340693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003337481,0.00011090947,0.00018576367,0.000041636093,0.00044554312,0.000054490643,0.0007817268,0.000096562675,0.000028391765],"category_scores_gemma":[0.000024991126,0.00010277666,0.00018448752,0.00016699909,0.00006793323,0.000041153955,0.00015247182,0.00058974256,0.0000060894054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015234791,0.00007964855,0.00041261263,0.0000010449072,0.00005457288,6.106025e-9,0.000023801878,0.00075056124,0.000024489533,0.96888167,0.008398286,0.021358093],"study_design_scores_gemma":[0.0008229332,0.000030133477,0.00021274683,0.000040325674,0.00009255051,1.2918005e-7,0.00002077366,0.23923539,0.00020326089,0.052949805,0.706182,0.00020995279],"about_ca_topic_score_codex":0.000044211763,"about_ca_topic_score_gemma":0.00012248644,"teacher_disagreement_score":0.9785417,"about_ca_system_score_codex":0.000015768073,"about_ca_system_score_gemma":0.000007814642,"threshold_uncertainty_score":0.41911104},"labels":[],"label_agreement":null},{"id":"W2024385674","doi":"10.5539/cis.v4n1p186","title":"One Improved Collaborative Filtering Method Based on Information Transformation","year":2010,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai Leading Academic Discipline Project","keywords":"Collaborative filtering; Computer science; Similarity (geometry); Hamming distance; Bipartite graph; Rank (graph theory); Transformation (genetics); Process (computing); Data mining; Information retrieval; Recommender system; Degree (music); Algorithm; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.007469658878520445,"score_gpt":0.27019843007552197,"score_spread":0.2627287711970015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024385674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02608986,3.2290993e-7,0.9562622,0.00017579593,0.00012425834,0.00023385507,0.000014745934,0.00006751831,0.017031493],"genre_scores_gemma":[0.8752255,6.324319e-7,0.12415895,0.00046938547,0.000062455125,0.000021903455,0.00005824094,0.0000016554146,0.0000012828323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991519,0.000016679147,0.0003247809,0.00008990044,0.000256614,0.00016012439],"domain_scores_gemma":[0.99919057,0.000048084607,0.00016211592,0.00018752385,0.00033406762,0.00007765396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006233959,0.000100466204,0.00011410555,0.00035927963,0.0002993771,0.0005152256,0.00019659988,0.000024009534,0.00006062254],"category_scores_gemma":[0.000008208306,0.00009516739,0.00003106989,0.0007466112,0.00009256982,0.009192213,0.00004725092,0.00015130705,0.0000190939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016502485,0.000023603361,0.00018554219,0.000014736718,0.000007233961,8.617717e-9,0.0025425935,0.0030964478,0.0024634907,0.073978536,0.00014294607,0.91752833],"study_design_scores_gemma":[0.0002780862,0.000064166095,0.00346551,0.000011836123,0.000005299374,2.4735044e-7,0.00008298026,0.97417367,0.010677791,0.0005587792,0.01055513,0.00012652883],"about_ca_topic_score_codex":0.000017684413,"about_ca_topic_score_gemma":9.767742e-7,"teacher_disagreement_score":0.9710772,"about_ca_system_score_codex":0.000016067639,"about_ca_system_score_gemma":0.0000888638,"threshold_uncertainty_score":0.66641325},"labels":[],"label_agreement":null},{"id":"W2024464703","doi":"","title":"Do Neighbor Buddies Make a Difference in Reblog Likelihood? An Analysis on SINA Weibo Data","year":2015,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Set (abstract data type); Sample (material); Data set; Social media; Statistical analysis; World Wide Web; Data science; Information retrieval; Data mining; Artificial intelligence; Statistics; Mathematics","score_opus":0.05769314900694413,"score_gpt":0.32709623305833024,"score_spread":0.26940308405138613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024464703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86509955,0.00011996809,0.068950646,0.00050156453,0.00006115033,0.0003269511,0.00017077186,0.0002885857,0.06448084],"genre_scores_gemma":[0.9939245,0.00000381929,0.0046216277,0.00008792154,0.0001945122,0.000021347076,0.000591444,0.000015755873,0.00053905323],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998233,0.00012782885,0.00034691827,0.00066618755,0.00027705415,0.00034897315],"domain_scores_gemma":[0.9976862,0.00008089809,0.00011158772,0.0018630498,0.00008212295,0.00017611202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041705006,0.0002333301,0.0004844317,0.00035700932,0.000052791547,0.00014222406,0.0008690599,0.000042111875,0.00052013283],"category_scores_gemma":[0.000013058947,0.00019214234,0.00011660738,0.0011177633,0.000046717094,0.00016086923,0.0004358481,0.00018633956,0.000029638148],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000504854,0.00072728866,0.83150345,0.0000029610578,0.0006049666,0.000006017344,0.00030301177,0.0003070688,0.000059321934,0.03327411,0.0031894252,0.12997188],"study_design_scores_gemma":[0.0016535725,0.00077085814,0.37706363,0.00009001475,0.0020128046,7.628653e-7,0.0031587123,0.46821192,0.0006172256,0.13083026,0.013752628,0.0018376128],"about_ca_topic_score_codex":0.0036786713,"about_ca_topic_score_gemma":0.0038196496,"teacher_disagreement_score":0.46790484,"about_ca_system_score_codex":0.000041739982,"about_ca_system_score_gemma":0.000051900013,"threshold_uncertainty_score":0.78353375},"labels":[],"label_agreement":null},{"id":"W2024996305","doi":"10.1007/s10479-012-1286-z","title":"Reformulation of a model for hierarchical divisive graph modularity maximization","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Heuristics; Mathematics; Random graph; Maximization; Quadratic equation; Combinatorics; Graph; Modularity (biology); Theory of computation; Discrete mathematics; Mathematical optimization; Algorithm","score_opus":0.28975513845299045,"score_gpt":0.4873950097450737,"score_spread":0.19763987129208327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024996305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3325456,0.000040524075,0.6658154,0.0003296803,0.0000064341502,0.00039009986,0.00006543227,0.000008768693,0.0007980395],"genre_scores_gemma":[0.98139477,0.000012508812,0.01795131,0.000008822217,0.00009451623,0.0001252415,0.00022173238,0.000009854679,0.00018126279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887085,0.000119891105,0.00030853666,0.00012440232,0.00031290678,0.0002634402],"domain_scores_gemma":[0.9982953,0.00010038773,0.000041738156,0.00027851848,0.0012171973,0.00006685695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011105471,0.00006815448,0.00016813855,0.00028185657,0.00019222997,0.000022085984,0.00015375273,0.00003626259,0.000063411644],"category_scores_gemma":[0.000058929156,0.00006247751,0.00012771698,0.0004636496,0.00009191436,0.00031268384,0.00007987986,0.00013062867,0.0000012984285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053904274,0.0006616573,0.011918136,0.000030293913,0.00012882157,1.6706057e-8,0.0010069989,0.22315234,0.005474767,0.74405897,0.001548167,0.01196591],"study_design_scores_gemma":[0.00011360957,0.000053541375,0.002782405,0.000013400605,0.000009418774,4.141497e-8,0.00004728855,0.9228483,0.014706944,0.05928583,0.00007645777,0.000062771825],"about_ca_topic_score_codex":0.00023796142,"about_ca_topic_score_gemma":0.000017680104,"teacher_disagreement_score":0.69969594,"about_ca_system_score_codex":0.000008572772,"about_ca_system_score_gemma":0.00006153532,"threshold_uncertainty_score":0.2547759},"labels":[],"label_agreement":null},{"id":"W2024997033","doi":"10.1109/ccece.2008.4564655","title":"Diffusion characters: Breaking the spectral barrier","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"University of Guelph","keywords":"Eigenvalues and eigenvectors; Euclidean geometry; Combinatorics; Character (mathematics); Graph; Mathematics; Wheel graph; Adjacency matrix; Euclidean space; Line graph; Discrete mathematics; Graph power; Physics; Geometry","score_opus":0.012576377124843408,"score_gpt":0.19330867932026996,"score_spread":0.18073230219542655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024997033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.941238,0.000050472816,0.050549094,0.0010852037,0.000122572,0.0003609569,0.00000911645,0.00021719767,0.00636738],"genre_scores_gemma":[0.99860823,0.000027657938,0.0004324087,0.00022043231,0.00051100174,0.000037719987,0.000008360515,0.000021758577,0.00013242272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847376,0.00000921675,0.00023871116,0.00043065584,0.00019803566,0.0006495914],"domain_scores_gemma":[0.9991696,0.00004541966,0.000071019094,0.0001428812,0.00015471206,0.00041638006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009130812,0.00030871524,0.00030006008,0.00023563683,0.00037249606,0.00026970656,0.00038037525,0.00006622284,0.0001793003],"category_scores_gemma":[0.0000064168075,0.00024798507,0.0000905049,0.00038346415,0.00007372629,0.00016888439,0.000068295776,0.0005147735,0.000011887572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002461184,0.0000881036,0.0698803,0.000025316795,0.00020002697,0.000031257176,0.0022000845,0.00008659712,0.002856881,0.8011457,0.0021454666,0.12131566],"study_design_scores_gemma":[0.00028272002,0.00018262,0.06057564,0.00012577145,0.000037906622,0.000048362148,0.00005166165,0.9299379,0.00061570737,0.003297214,0.0041575623,0.00068694504],"about_ca_topic_score_codex":0.0037318133,"about_ca_topic_score_gemma":0.00022293796,"teacher_disagreement_score":0.9298513,"about_ca_system_score_codex":0.00007736837,"about_ca_system_score_gemma":0.0001944239,"threshold_uncertainty_score":0.99999726},"labels":[],"label_agreement":null},{"id":"W2025994373","doi":"10.1103/physreve.89.062807","title":"Entropy distribution and condensation in random networks with a given degree distribution","year":2014,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada; Wilfrid Laurier University","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Degree distribution; Statistical physics; Degree (music); Entropy (arrow of time); Mathematics; Random graph; Complex network; Discrete mathematics; Combinatorics; Physics; Thermodynamics","score_opus":0.011260532511682663,"score_gpt":0.2696619300263968,"score_spread":0.25840139751471414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025994373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19259359,0.0014885037,0.80413413,0.00047376158,0.000013776367,0.0006411576,0.000033400025,0.000056103134,0.0005655762],"genre_scores_gemma":[0.99837136,0.00033927083,0.00009384623,0.000046360798,0.00022164243,0.00009013891,0.00082359294,0.000007795139,0.0000059743165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991074,0.00015858981,0.0002013339,0.00022494148,0.00012523662,0.00018248064],"domain_scores_gemma":[0.9994451,0.00013694823,0.00012416513,0.00018254966,0.000053078787,0.000058148813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023658235,0.00014214976,0.0003974306,0.000010324681,0.0000523326,0.000027888957,0.00007140765,0.00001391006,0.000026675349],"category_scores_gemma":[0.000019253866,0.00010846437,0.00008561761,0.0002465186,0.000051652718,0.00008736055,0.000035807232,0.0001445339,0.000004437264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017527957,0.0005240683,0.0743854,0.00032640237,0.00015653006,0.0000014736999,0.000050558367,0.000927104,0.00021185643,0.57643056,0.00346408,0.34334671],"study_design_scores_gemma":[0.0054190997,0.0004561163,0.10393355,0.004562478,0.0010114558,0.000003303494,0.00002104135,0.72735137,0.0004993656,0.103786975,0.051743466,0.001211755],"about_ca_topic_score_codex":0.00006807846,"about_ca_topic_score_gemma":0.000011094213,"teacher_disagreement_score":0.8057778,"about_ca_system_score_codex":0.000033884327,"about_ca_system_score_gemma":0.000010133672,"threshold_uncertainty_score":0.44230488},"labels":[],"label_agreement":null},{"id":"W2026012558","doi":"10.1109/icdm.2013.159","title":"Validating Network Value of Influencers by Means of Explanations","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Influencer marketing; Computer science; Heuristics; Heuristic; Function (biology); Action (physics); Value (mathematics); Greedy algorithm; Product (mathematics); Social network (sociolinguistics); Marketing; Artificial intelligence; Mathematics; Machine learning; Social media; World Wide Web; Algorithm; Business","score_opus":0.013146682120446512,"score_gpt":0.271553748230508,"score_spread":0.2584070661100615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026012558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.247211,0.00020218028,0.59503,0.000114072136,0.00015346392,0.0008257616,0.00022568958,0.00015220477,0.15608561],"genre_scores_gemma":[0.97067505,0.000008993458,0.028386144,0.000015831636,0.0001860283,0.00008147195,0.00036117662,0.000020423868,0.0002648897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849504,0.00008563678,0.0006916185,0.0002858008,0.0002355228,0.00020636695],"domain_scores_gemma":[0.9982843,0.00014292919,0.000721087,0.00058717653,0.000215352,0.000049203267],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023449009,0.00021636304,0.000539354,0.00008635212,0.000045370933,0.000028527205,0.00045420826,0.000085819454,0.0017105675],"category_scores_gemma":[0.000005979831,0.00020953972,0.00029109747,0.00021872717,0.000069163085,0.00005835869,0.0005009025,0.0002764453,0.00000449227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043727314,0.00020565146,0.11430542,0.00013246792,0.0015443916,1.0123105e-7,0.00046862615,0.42193893,0.0011460538,0.30684188,0.13623513,0.017176973],"study_design_scores_gemma":[0.00050687674,0.00009605766,0.004347447,0.0012134437,0.0011297947,2.0445992e-7,0.0009302456,0.32701078,0.035720736,0.6214727,0.005976043,0.0015956243],"about_ca_topic_score_codex":0.005348499,"about_ca_topic_score_gemma":0.000014228223,"teacher_disagreement_score":0.7234641,"about_ca_system_score_codex":0.00002697287,"about_ca_system_score_gemma":0.0000749925,"threshold_uncertainty_score":0.999202},"labels":[],"label_agreement":null},{"id":"W2026091182","doi":"10.1145/2492517.2500333","title":"What do large networks look like?","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Graph; Community structure; Theoretical computer science; Random graph; Computer network; Topology (electrical circuits); Mathematics; Combinatorics","score_opus":0.006000741036937736,"score_gpt":0.23691903582485857,"score_spread":0.23091829478792084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026091182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06152016,0.0009441016,0.77021354,0.0007080857,0.00052635465,0.0007422624,0.0000024338708,0.0006056347,0.1647374],"genre_scores_gemma":[0.9902859,0.000036933136,0.001446707,0.00033701188,0.00051794946,0.00006842298,0.000028765564,0.000017000983,0.00726132],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915576,0.000027802862,0.00017648471,0.00021821048,0.00009749117,0.00032425864],"domain_scores_gemma":[0.99938136,0.000035736684,0.000052522344,0.0003838129,0.00006367363,0.000082920546],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009413954,0.00013291075,0.00017045332,0.00003985523,0.00008366126,0.00037757767,0.00019344936,0.00003079957,0.026249148],"category_scores_gemma":[4.100082e-7,0.00011063161,0.00013972183,0.00017421706,0.000019330731,0.0004896371,0.00013588787,0.00012644357,0.000583277],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025676254,0.0002541319,0.1013876,0.0000027228907,0.00022909934,8.252344e-7,0.00010868762,0.0003812324,0.000058724458,0.1677221,0.5260459,0.2038064],"study_design_scores_gemma":[0.00096684694,0.00009614484,0.010521087,0.00013841911,0.00016300949,0.0000012149694,0.0031596054,0.30365756,0.0007129794,0.15587145,0.5232553,0.0014563601],"about_ca_topic_score_codex":0.00021158443,"about_ca_topic_score_gemma":0.000009701309,"teacher_disagreement_score":0.9287657,"about_ca_system_score_codex":0.000010009409,"about_ca_system_score_gemma":0.000007864627,"threshold_uncertainty_score":0.97464097},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Link (geometry); Computer science; Link analysis; World Wide Web; Computer network","score_opus":0.02283628608296505,"score_gpt":0.272730496850655,"score_spread":0.24989421076768992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026875114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8351186,0.000078216115,0.003297999,0.0030289008,0.000054154803,0.00012457777,0.000013551191,0.00012821025,0.15815577],"genre_scores_gemma":[0.9925334,0.0000058042365,0.0012951154,0.00024746658,0.0005492176,0.000010224001,0.000015326177,0.000009965415,0.0053334734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994216,0.00003811111,0.00012395349,0.00016940662,0.00009663168,0.00015029356],"domain_scores_gemma":[0.9993037,0.0003803586,0.000043708005,0.0002244309,0.000014083806,0.00003371587],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007565689,0.000116164665,0.00013340412,0.000058408757,0.00017843406,0.00011721772,0.00013632802,0.000015974507,0.0038640343],"category_scores_gemma":[0.0000035539636,0.00007461002,0.00006277922,0.00015262795,0.0000448169,0.00004508852,0.00006823186,0.00015516019,0.000009653071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012395553,0.000017065653,0.20174393,0.0000010268417,0.00015417676,0.0000015681217,0.00015916211,0.00004116711,0.00026962388,0.7053575,0.04701283,0.045229536],"study_design_scores_gemma":[0.00024548417,0.000034416382,0.05039433,0.000053716503,0.000089689944,3.387025e-7,0.0007193476,0.0071425675,0.0043250094,0.7323825,0.20420834,0.00040426882],"about_ca_topic_score_codex":0.00042321224,"about_ca_topic_score_gemma":0.00031465632,"teacher_disagreement_score":0.1574148,"about_ca_system_score_codex":0.000008297533,"about_ca_system_score_gemma":0.000008097764,"threshold_uncertainty_score":0.9970466},"labels":[],"label_agreement":null},{"id":"W2027022598","doi":"10.1117/12.421079","title":"&lt;title&gt;Value-balanced agglomerative connectivity clustering&lt;/title&gt;","year":2001,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Hierarchical clustering; Outlier; Graph; Single-linkage clustering; Correlation clustering; Spectral clustering; Similarity measure; CURE data clustering algorithm; Artificial intelligence; Theoretical computer science","score_opus":0.010450990054378714,"score_gpt":0.24198798186932946,"score_spread":0.23153699181495074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027022598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88400304,0.00006162487,0.0008980727,0.00054350117,0.00014545568,0.0002436766,0.000026352445,0.00008878328,0.113989465],"genre_scores_gemma":[0.9643116,0.000039965296,0.033003807,0.000054335265,0.00079934404,0.000080561105,0.00001367787,0.000045775625,0.0016509272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989048,2.0263437e-8,0.00030877333,0.00024057592,0.00030981176,0.00023600466],"domain_scores_gemma":[0.99909735,0.000060510534,0.00019336895,0.000051466883,0.00053491176,0.000062370345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002317279,0.00019462022,0.0002815941,0.000056983692,0.000058422655,0.00006408473,0.00041210398,0.00007370485,0.0002842862],"category_scores_gemma":[0.00005538269,0.00016983224,0.00041565878,0.0002323996,0.00010023302,0.00017181753,0.00011713246,0.0001816612,0.000016083317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025767953,0.00008860133,0.0004942795,0.00005749861,0.00041477583,7.0846205e-8,0.00006547763,0.00008070617,0.0953583,0.87626356,0.024306456,0.0028444873],"study_design_scores_gemma":[0.0025579336,0.0006108806,0.0028958914,0.0008368494,0.0006963477,0.000022690101,0.000760396,0.40631297,0.13184768,0.04242154,0.4091426,0.001894194],"about_ca_topic_score_codex":0.0000061581895,"about_ca_topic_score_gemma":1.4577948e-7,"teacher_disagreement_score":0.83384204,"about_ca_system_score_codex":0.00007858403,"about_ca_system_score_gemma":0.000018970475,"threshold_uncertainty_score":0.6925558},"labels":[],"label_agreement":null},{"id":"W2027330558","doi":"10.1103/physreve.79.026101","title":"Time evolution of epidemic disease on finite and infinite networks","year":2009,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; BC Centre for Disease Control; University of British Columbia","funders":"Canadian Institutes of Health Research; Ministry of Health, British Columbia; Michael Smith Health Research BC","keywords":"Formalism (music); Computer science; Theoretical computer science; Variety (cybernetics); Infectious disease (medical specialty); Disease; Statistical physics; Mathematical optimization; Mathematics; Artificial intelligence; Physics; Medicine","score_opus":0.011481235851312157,"score_gpt":0.2963660413049991,"score_spread":0.28488480545368694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027330558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64413226,0.13727733,0.15363279,0.0067538735,0.000120766534,0.004172331,0.00015812504,0.00068106793,0.053071488],"genre_scores_gemma":[0.9983492,0.0008752077,0.00008474242,0.00033434626,0.00025974688,0.0000138883825,0.000029215154,0.0000069784246,0.00004671248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992131,0.00008645868,0.00023878698,0.00019516144,0.00011508073,0.00015141857],"domain_scores_gemma":[0.9992096,0.00021462099,0.00014672775,0.00028504813,0.000038281127,0.000105762236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013853781,0.00013600296,0.0004127092,0.000029027073,0.00003343409,0.0000066212574,0.0001005574,0.0000075825233,0.000068832145],"category_scores_gemma":[0.00003075002,0.00011348035,0.00019873676,0.00024905294,0.000046536297,0.000056207016,0.000031926153,0.00012640141,0.000029314606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008010493,0.0011682813,0.00968926,0.00035247285,0.00017178115,0.0000023832133,0.00003151978,0.006708533,0.0004448151,0.4041266,0.019598017,0.55762625],"study_design_scores_gemma":[0.0003948791,0.00038454687,0.03548001,0.005465967,0.00083788077,2.3183786e-7,0.0000027359972,0.6117071,0.00007815736,0.32715923,0.017809764,0.00067950506],"about_ca_topic_score_codex":0.0000074111585,"about_ca_topic_score_gemma":8.1812466e-8,"teacher_disagreement_score":0.6049986,"about_ca_system_score_codex":0.000014690284,"about_ca_system_score_gemma":0.000013162001,"threshold_uncertainty_score":0.46275944},"labels":[],"label_agreement":null},{"id":"W2027750494","doi":"10.1016/j.mbs.2005.12.016","title":"A stochastic model for the spread of a sexually transmitted disease which results in a scale-free network","year":2006,"lang":"en","type":"article","venue":"Mathematical Biosciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Promiscuity; Scale-free network; Infectivity; Scale (ratio); Mathematics; Power law; Statistical physics; Complex network; Statistics; Biology; Combinatorics; Virology; Physics; Ecology","score_opus":0.017214721788013712,"score_gpt":0.2688816282161682,"score_spread":0.2516669064281545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027750494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059942883,0.00004761637,0.9367844,0.0010981234,0.000014984415,0.00057493086,0.0000920228,0.000033471875,0.001411559],"genre_scores_gemma":[0.9834486,3.3033314e-7,0.016144138,0.000018043,0.00009401993,0.00013809408,0.000008549847,0.0000074094864,0.00014076743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986049,0.000032844277,0.00048404705,0.00027453643,0.000285553,0.00031810498],"domain_scores_gemma":[0.9985641,0.0007564511,0.00012681635,0.0004247142,0.00006902227,0.000058848305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006533631,0.00013598012,0.00026424223,0.00005621328,0.000114723065,0.000049691767,0.00060285575,0.000021803735,0.000016188367],"category_scores_gemma":[0.00006966932,0.0000846974,0.00011828546,0.0007370983,0.00023170737,0.00006523646,0.00007494229,0.00007409807,0.0000013174152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034300546,0.0015028176,0.002862015,0.0001280788,0.0000619568,6.2970827e-7,0.0011175743,0.35407424,0.00045189122,0.628551,0.0040707174,0.006836057],"study_design_scores_gemma":[0.00018974443,0.000017766553,0.00064114813,0.00004865252,0.000035192134,5.111855e-8,0.000039378247,0.58574104,0.000021590236,0.41319302,0.0000066111306,0.00006579991],"about_ca_topic_score_codex":0.000097208125,"about_ca_topic_score_gemma":0.00028250634,"teacher_disagreement_score":0.9235058,"about_ca_system_score_codex":0.000008884319,"about_ca_system_score_gemma":0.00007337052,"threshold_uncertainty_score":0.34538597},"labels":[],"label_agreement":null},{"id":"W2029082199","doi":"10.2139/ssrn.1319699","title":"The Impact of Sampling and Network Topology on the Estimation of Social Inter-Correlations","year":2008,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Estimation; Topology (electrical circuits); Network topology; Sampling (signal processing); Social network (sociolinguistics); Computer science; Econometrics; Mathematics; Economics; Computer network; Telecommunications","score_opus":0.014564127396581939,"score_gpt":0.30151570421549956,"score_spread":0.28695157681891764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029082199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7430635,0.00020570334,0.2556363,0.00032198787,0.00002871269,0.00007077935,0.0000013540105,0.0000056786,0.0006659634],"genre_scores_gemma":[0.9993853,0.00009004685,0.00018181639,0.000003109172,0.00027764964,0.0000027437368,0.0000022557526,0.0000055687565,0.0000515069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911815,0.000092935166,0.00022106907,0.000055741708,0.00007311463,0.00043900052],"domain_scores_gemma":[0.9993087,0.00026873132,0.00025458672,0.00008753027,0.00006781621,0.000012625592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060954713,0.000068846326,0.00013104122,0.000029297973,0.0005159788,0.000010564109,0.00012626895,0.00001912281,0.000035295878],"category_scores_gemma":[0.000013674015,0.000038477723,0.00015176096,0.00013215297,0.00010225993,0.00003393116,0.000025484911,0.0005635217,5.4512816e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034505272,0.00002935248,0.028745856,3.8995915e-7,0.0003798719,3.9484178e-8,0.00028790662,0.009592166,0.00003345618,0.9138342,0.0005234614,0.04653877],"study_design_scores_gemma":[0.00016709714,0.00028164292,0.026776148,0.000012703479,0.00005674395,0.000017807117,0.00047634187,0.015755184,0.000046693345,0.95624673,0.00008964786,0.00007325918],"about_ca_topic_score_codex":0.00015879833,"about_ca_topic_score_gemma":0.000054418822,"teacher_disagreement_score":0.2563218,"about_ca_system_score_codex":0.00008459796,"about_ca_system_score_gemma":0.00026131177,"threshold_uncertainty_score":0.39685437},"labels":[],"label_agreement":null},{"id":"W2029392249","doi":"10.1007/978-3-319-03578-9_12","title":"Influence Diffusion in Social Networks under Time Window Constraints","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cardinality (data modeling); Bounded function; Computer science; Node (physics); Set (abstract data type); Time complexity; Integer (computer science); Discrete mathematics; Interval (graph theory); Graph; Combinatorics; Window (computing); Algorithm; Theoretical computer science; Mathematics; Data mining","score_opus":0.008503308808419811,"score_gpt":0.23784666845535943,"score_spread":0.2293433596469396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029392249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008990759,0.000057835652,0.9813471,0.00018204535,0.00012066062,0.00041099897,0.00000612487,0.000073399104,0.00881108],"genre_scores_gemma":[0.98850954,0.0000041079074,0.009725667,0.00041433724,0.0009214226,0.000014151219,0.000027066659,0.000033244818,0.00035043934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975431,0.000039295694,0.00049067853,0.0008796965,0.00046041337,0.0005868337],"domain_scores_gemma":[0.99878293,0.00024696044,0.00026981602,0.00047269912,0.00013528508,0.00009227781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035520073,0.00045290968,0.0005926334,0.0004545311,0.00021422331,0.00023031454,0.0009861605,0.00023316294,0.00079748785],"category_scores_gemma":[0.000005222872,0.0004313699,0.00015587783,0.00045308098,0.0010710054,0.00021574527,0.00065249094,0.0009333693,0.000074498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064218875,0.000066272376,0.003159051,0.000008498902,0.000034038567,0.000012280466,0.00024164152,0.2466437,0.00026862574,0.022153426,0.0002255728,0.7271805],"study_design_scores_gemma":[0.00038349075,0.00005352895,0.0057549262,0.00045108638,0.000025411327,0.000003844747,4.4020473e-7,0.54503506,0.00013152025,0.44674996,0.00043877552,0.0009719779],"about_ca_topic_score_codex":0.00009999191,"about_ca_topic_score_gemma":0.000033544482,"teacher_disagreement_score":0.97951883,"about_ca_system_score_codex":0.00018332415,"about_ca_system_score_gemma":0.0001804998,"threshold_uncertainty_score":0.9998138},"labels":[],"label_agreement":null},{"id":"W2029880254","doi":"10.1109/asonam.2012.85","title":"Dealing with Disappearance of an Actor Set in Social Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Node (physics); Set (abstract data type); Information flow; Network topology; Group (periodic table); Quality (philosophy); Key (lock); Class (philosophy); Distributed computing; Categorization; Flow (mathematics); Social network (sociolinguistics); Dynamic network analysis; Computer network; Topology (electrical circuits); Theoretical computer science; Computer security; Artificial intelligence; World Wide Web; Engineering; Mathematics; Social media","score_opus":0.016941935627752373,"score_gpt":0.2937378100636161,"score_spread":0.27679587443586373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029880254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8941342,0.000022678745,0.097963765,0.000016111548,0.000009094291,0.000069012196,0.000002377864,0.000028553583,0.0077541554],"genre_scores_gemma":[0.9973691,4.3257523e-7,0.0021706773,0.000010646158,0.00038572666,0.000006953601,0.000015950176,0.000009062607,0.00003142848],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999509,0.000024988161,0.00012698559,0.000081607766,0.00006705413,0.00019039323],"domain_scores_gemma":[0.9997662,0.000014372097,0.00006185717,0.00010628309,0.00001609945,0.000035230245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011396248,0.000072378665,0.00015019377,0.000027954658,0.00003459165,0.000008456464,0.00008108486,0.000017231283,0.0002229706],"category_scores_gemma":[2.4322347e-7,0.000058397738,0.000037889837,0.00014717925,0.000025965792,0.00013065452,0.000023296521,0.00007699995,9.985731e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026243262,0.00013896963,0.9193116,0.000002896086,0.00004418211,1.3821735e-7,0.00037544456,0.0016518965,0.00009846272,0.058271743,0.00018463263,0.019893778],"study_design_scores_gemma":[0.0017256838,0.00021613252,0.81858844,0.00013523414,0.00017137543,9.760387e-7,0.0021638349,0.15525706,0.0063846777,0.009280911,0.004810219,0.0012654823],"about_ca_topic_score_codex":0.0002695231,"about_ca_topic_score_gemma":0.000073155345,"teacher_disagreement_score":0.15360516,"about_ca_system_score_codex":0.0000071752174,"about_ca_system_score_gemma":0.000005265282,"threshold_uncertainty_score":0.24413717},"labels":[],"label_agreement":null},{"id":"W2030794512","doi":"10.1145/1569901.1570068","title":"Agglomerative genetic algorithm for clustering in social networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Dalhousie University; Arizona Cotton Growers Association","keywords":"Cluster analysis; Computer science; Social network (sociolinguistics); Hierarchical clustering of networks; Data mining; CURE data clustering algorithm; Correlation clustering; Canopy clustering algorithm; Hierarchical clustering; Single-linkage clustering; Hierarchical network model; Brown clustering; Machine learning; Artificial intelligence; Social media; World Wide Web","score_opus":0.012484690759548275,"score_gpt":0.28791796753854565,"score_spread":0.27543327677899737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030794512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002423154,0.000026927102,0.9901633,0.000106587235,0.000018862038,0.00021463592,0.000002414914,0.000045983423,0.006998098],"genre_scores_gemma":[0.90582615,0.0000013309905,0.09291308,0.00011441472,0.0008033868,0.0000430092,0.000020018626,0.000007782962,0.0002708441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993549,0.000020245532,0.00018184503,0.00016728815,0.000050836625,0.00022491299],"domain_scores_gemma":[0.9997937,0.000026482987,0.000045019915,0.00008142817,0.000028965238,0.000024379035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006914462,0.00010214381,0.00017545444,0.00005420687,0.00009166597,0.000036903173,0.00009231652,0.000025888381,0.00013846134],"category_scores_gemma":[4.1339754e-7,0.00010056433,0.000104024104,0.00017815048,0.0000117114705,0.00004335075,0.000024290499,0.0000763865,0.0000016210711],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035612231,0.000052421296,0.0009932817,4.6131402e-7,0.000021893715,4.1392457e-7,0.00008187344,0.0046328753,0.000017723789,0.0037670173,0.002909946,0.98751855],"study_design_scores_gemma":[0.00029412453,0.00004679784,0.0072957105,0.0000057028387,0.000013883926,1.2057717e-7,0.000059490656,0.97250414,0.00009549196,0.018230064,0.0012986119,0.0001558708],"about_ca_topic_score_codex":0.000047848218,"about_ca_topic_score_gemma":0.000019439225,"teacher_disagreement_score":0.9873627,"about_ca_system_score_codex":0.000022071945,"about_ca_system_score_gemma":0.000008680164,"threshold_uncertainty_score":0.41008943},"labels":[],"label_agreement":null},{"id":"W2031103178","doi":"10.1063/1.4916215","title":"A new closeness centrality measure via effective distance in complex networks","year":2015,"lang":"en","type":"article","venue":"Chaos An Interdisciplinary Journal of Nonlinear Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"State Key Laboratory of Virtual Reality Technology and Systems; National Natural Science Foundation of China","keywords":"Centrality; Closeness; Measure (data warehouse); Shortest path problem; Computer science; Betweenness centrality; Dijkstra's algorithm; Complex network; Network science; Path (computing); Distance measures; Theoretical computer science; Topology (electrical circuits); Algorithm; Mathematics; Data mining; Artificial intelligence; Graph; Combinatorics","score_opus":0.02782577385438575,"score_gpt":0.3487109843469604,"score_spread":0.3208852104925747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031103178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.433391,0.00011582542,0.56506073,0.00026586646,0.00027124022,0.00020187804,0.000005882255,0.0000186799,0.00066888257],"genre_scores_gemma":[0.98623985,0.0000016087929,0.012629124,0.000020234942,0.0010598933,0.0000036051179,0.0000077091845,0.000014824132,0.000023144241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773407,0.00017558974,0.00065879273,0.00035951505,0.00061107945,0.00046098288],"domain_scores_gemma":[0.9979642,0.000058690435,0.000496244,0.00039461683,0.000544017,0.0005422267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019767077,0.00022612562,0.00048679014,0.00026516948,0.00021425,0.00014534674,0.0010890389,0.000038434428,0.00007474204],"category_scores_gemma":[0.000017051023,0.00018740991,0.00018837389,0.0011691931,0.00034403775,0.00090804405,0.00053904677,0.00046897415,0.000004119832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016860272,0.00249203,0.41410658,0.000029571316,0.00023565927,0.00021692913,0.0122896265,0.05433007,0.0056275195,0.0049031423,0.004243212,0.49983963],"study_design_scores_gemma":[0.002661693,0.0015276835,0.15756308,0.00057327026,0.00010237637,0.00013115154,0.0032648963,0.78638846,0.001978215,0.043772157,0.0010981973,0.0009388017],"about_ca_topic_score_codex":0.00009015935,"about_ca_topic_score_gemma":0.00010529337,"teacher_disagreement_score":0.7320584,"about_ca_system_score_codex":0.00025415668,"about_ca_system_score_gemma":0.0003579775,"threshold_uncertainty_score":0.76423544},"labels":[],"label_agreement":null},{"id":"W2031450031","doi":"10.1016/j.eswa.2014.11.067","title":"A new model to quantify the impact of a topic in a location over time with Social Media","year":2014,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Badan Riset dan Inovasi Nasional; McGill University","keywords":"Computer science; Social media; Data science; Set (abstract data type); Component (thermodynamics); Doors; Social network (sociolinguistics); Mobile device; World Wide Web","score_opus":0.014825304050287804,"score_gpt":0.29949969309602126,"score_spread":0.28467438904573344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031450031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046383455,0.00003399813,0.95072436,0.00017437083,0.0000031134887,0.0007451723,0.000005927932,0.000033354416,0.0018962395],"genre_scores_gemma":[0.9962841,2.1603361e-7,0.0022785922,0.00001151579,0.00027293735,0.0009806162,0.000021110389,0.000013421338,0.00013743925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933314,0.000035286976,0.0001969504,0.00017014585,0.0001363558,0.00012811011],"domain_scores_gemma":[0.99934185,0.000069575945,0.000117240226,0.00034347395,0.000077696845,0.000050166414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104699364,0.00010738978,0.00020709111,0.000066643064,0.00006740507,0.00002825783,0.00018160691,0.00002144404,0.000031400945],"category_scores_gemma":[0.0000016219385,0.0000634294,0.000046276004,0.0005111148,0.000022898326,0.0000422998,0.000021246156,0.000059448656,0.000009549752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023156345,0.0007688423,0.076457284,0.00004059838,0.0007066346,2.1193341e-7,0.031722587,0.22169802,0.0072847465,0.5624255,0.0560487,0.04261532],"study_design_scores_gemma":[0.001358684,0.00020742553,0.038683303,0.00022850986,0.00008380413,0.0000019103913,0.0009320058,0.9441243,0.00037895635,0.007411517,0.005922791,0.0006668066],"about_ca_topic_score_codex":0.0040169377,"about_ca_topic_score_gemma":0.00016489287,"teacher_disagreement_score":0.9499007,"about_ca_system_score_codex":0.000043852975,"about_ca_system_score_gemma":0.000100778634,"threshold_uncertainty_score":0.60724354},"labels":[],"label_agreement":null},{"id":"W2031620091","doi":"10.1080/15427951.2014.977407","title":"Finding Safe Strategies for Competitive Diffusion on Trees","year":2014,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Tree (set theory); Game tree; Diffusion; Game theory; Mathematical optimization; Mathematical economics; Sequential game; Combinatorics","score_opus":0.021641919489689024,"score_gpt":0.2895912902731283,"score_spread":0.2679493707834393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031620091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15992776,0.0000026879777,0.7391004,0.0000478967,0.000046642686,0.00020332856,0.000010773163,0.00007470551,0.10058584],"genre_scores_gemma":[0.9802743,3.8694395e-7,0.017913185,0.0000344759,0.00021636623,0.000048490096,0.00002984078,0.000020145948,0.0014627873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931514,0.000022157992,0.00023335092,0.0001587816,0.000107243904,0.000163351],"domain_scores_gemma":[0.99918896,0.0003831829,0.00013820139,0.00021340934,0.000044039774,0.00003222196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001395849,0.00014625248,0.00024133854,0.00006192045,0.000045878485,0.00009868824,0.0001928159,0.000024780551,0.00037122564],"category_scores_gemma":[0.000010291971,0.00012209128,0.00014196883,0.00005294305,0.000030745792,0.00005171545,0.00005795374,0.00007918346,0.00004721184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063748794,0.0001910988,0.00028730877,0.000019232768,0.000052965665,1.0550404e-7,0.00065905106,0.000051361272,0.00035101577,0.9905355,0.0034861541,0.0043598525],"study_design_scores_gemma":[0.00052106223,0.00043689838,0.00030037735,0.0004706854,0.00009744659,6.693954e-7,0.0023339544,0.24449515,0.0057866555,0.7142056,0.030946217,0.00040527817],"about_ca_topic_score_codex":0.000023822351,"about_ca_topic_score_gemma":0.00002131028,"teacher_disagreement_score":0.8203466,"about_ca_system_score_codex":0.000018009603,"about_ca_system_score_gemma":0.0000080254285,"threshold_uncertainty_score":0.49787378},"labels":[],"label_agreement":null},{"id":"W2031920071","doi":"10.1145/2492517.2492662","title":"Detect inflated follower numbers in OSN using star sampling","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simple random sample; Sampling (signal processing); Estimator; Computer science; Random walk; Variance (accounting); Systematic sampling; Star (game theory); Sample (material); Simple (philosophy); Statistics; Poisson sampling; Sampling design; Importance sampling; Algorithm; Mathematics; Slice sampling; Monte Carlo method; Telecommunications","score_opus":0.02242390492234059,"score_gpt":0.2864961626567138,"score_spread":0.2640722577343732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031920071","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.940878,0.000010750224,0.048366174,0.000020348396,0.000021638338,0.00018237342,7.50733e-7,0.00008639814,0.010433613],"genre_scores_gemma":[0.9697824,4.5960658e-7,0.029903105,0.00003217866,0.0000677698,0.000017377479,0.0000074412133,0.000015772486,0.00017351111],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991926,0.000027762386,0.00024397917,0.00018650957,0.00009069894,0.00025848267],"domain_scores_gemma":[0.99959385,0.00004244038,0.000057942987,0.00021368495,0.000042832762,0.00004926432],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009678097,0.00012346654,0.00018355687,0.0001019234,0.000050856448,0.0000663248,0.000119623655,0.000028642178,0.0041831196],"category_scores_gemma":[0.0000024163796,0.00011514079,0.00009938471,0.0003466231,0.000016239897,0.00016757027,0.00006953939,0.00012475318,0.000062926076],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018014278,0.00021819345,0.84091634,0.000011639117,0.00044414328,0.0000034908849,0.00049033016,0.007591785,0.05691134,0.0075141187,0.0035043978,0.08237619],"study_design_scores_gemma":[0.0026536665,0.00012908933,0.09099798,0.0002899418,0.00025134668,0.0000022637396,0.0016421761,0.6693765,0.034858093,0.18190804,0.015045276,0.00284565],"about_ca_topic_score_codex":0.011584876,"about_ca_topic_score_gemma":0.00021126744,"teacher_disagreement_score":0.7499184,"about_ca_system_score_codex":0.000040784154,"about_ca_system_score_gemma":0.000019296762,"threshold_uncertainty_score":0.99672717},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Statistical survey; Computer science; Statistics; Mathematics","score_opus":0.021314908928495517,"score_gpt":0.31187383520578127,"score_spread":0.29055892627728575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032005951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59429884,0.00015514574,0.3813515,0.0000944284,0.00008787137,0.00009678436,0.00009214321,0.00007236697,0.023750931],"genre_scores_gemma":[0.99271965,0.000005125579,0.0062822835,0.000003392927,0.00006214254,0.000008691287,0.00069676014,0.000009896418,0.00021206227],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992858,0.0001126725,0.0002259464,0.00015533819,0.00007275807,0.00014744267],"domain_scores_gemma":[0.99947983,0.00022888985,0.00008877013,0.00012306935,0.000042832515,0.000036630016],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004110871,0.000087282075,0.00018374657,0.0001325422,0.00011432775,0.000038398066,0.00006812611,0.000022187063,0.0012253624],"category_scores_gemma":[0.00001531783,0.00008495021,0.000030064544,0.000441542,0.00005509438,0.00007854066,0.00005604184,0.00037268677,0.000001829138],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005879131,0.000051506137,0.73176426,0.0000016448463,0.00002870597,2.9304985e-7,0.000054862106,0.013692626,0.000018183437,0.13061121,0.0001901109,0.12358074],"study_design_scores_gemma":[0.00016780545,0.000017898908,0.43446365,0.000005966839,0.000016480411,2.8762028e-7,0.00000625316,0.5385006,0.0000016174885,0.02518119,0.0015452692,0.000092963935],"about_ca_topic_score_codex":0.0068057654,"about_ca_topic_score_gemma":0.004938834,"teacher_disagreement_score":0.524808,"about_ca_system_score_codex":0.0000035665043,"about_ca_system_score_gemma":0.000011184665,"threshold_uncertainty_score":0.999808},"labels":[],"label_agreement":null},{"id":"W2032775730","doi":"10.1007/s13278-011-0022-z","title":"Introduction to the second issue of Social Network Analysis and Mining journal: scientific computing for social network analysis and dynamicity","year":2011,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Social network analysis; Computer science; Data science; Social network (sociolinguistics); Network analysis; World Wide Web; Social media; Engineering","score_opus":0.014783541823223586,"score_gpt":0.2721317396699832,"score_spread":0.2573481978467596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032775730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7604043,0.00044182496,0.23766762,0.0005422675,0.00024838114,0.00032386923,0.000049012102,0.000050654806,0.00027210033],"genre_scores_gemma":[0.96845603,0.00001436542,0.01714246,0.00011650841,0.01355156,0.000025991298,0.00025586714,0.000044823533,0.0003924159],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99536115,0.0005880541,0.0013532034,0.00109708,0.0004756238,0.001124886],"domain_scores_gemma":[0.9970396,0.0003770113,0.0015021041,0.00034962347,0.0005108847,0.0002207524],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0042093606,0.0005454398,0.0021330572,0.00092783605,0.0063584778,0.0008304775,0.00041538168,0.00020562175,0.00040689422],"category_scores_gemma":[0.000024379166,0.000502427,0.0016134304,0.011954447,0.0005826426,0.0002243599,0.00045050128,0.00043358735,6.846293e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016195647,0.00012990845,0.7643952,0.00003997246,0.06376178,0.000001915985,0.026813881,0.0319339,0.00003390135,0.0034266561,0.03491212,0.074388824],"study_design_scores_gemma":[0.0009724013,0.00019563099,0.5590561,0.000042632113,0.11570326,0.0000023166137,0.011708446,0.28464457,0.000027943894,0.0071621914,0.018854508,0.0016299709],"about_ca_topic_score_codex":0.0003621375,"about_ca_topic_score_gemma":0.004502627,"teacher_disagreement_score":0.25271067,"about_ca_system_score_codex":0.00006968001,"about_ca_system_score_gemma":0.00006656128,"threshold_uncertainty_score":0.99974275},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.048373751578016835,"score_gpt":0.33598191198758043,"score_spread":0.2876081604095636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034008825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54391336,0.00004816319,0.05405345,0.0013408739,0.00003377828,0.0008515737,3.4770565e-7,0.00003280645,0.39972568],"genre_scores_gemma":[0.99838376,0.0000011619564,0.001176467,0.0002932677,0.000055821194,0.000015181537,4.7861784e-7,0.0000038526387,0.00007001253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99880654,0.00024722307,0.00014446893,0.00022018187,0.00025378,0.00032782656],"domain_scores_gemma":[0.99898404,0.00031362366,0.00006791739,0.00057731854,0.000030520023,0.000026600605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011634282,0.000086362175,0.00010103255,0.000056068493,0.0012988114,0.0005386416,0.0015728999,0.0000065519653,0.000043092463],"category_scores_gemma":[0.000010401491,0.000053969296,0.000027911447,0.0013025766,0.00045287053,0.00024366291,0.0014310603,0.00025652026,0.0000011598738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000143102125,0.00012484833,0.22767884,0.000006371113,0.000038220278,0.0000015722127,0.01652516,0.00086089264,0.00002458442,0.70287335,0.0005911703,0.05126067],"study_design_scores_gemma":[0.000325945,0.000044731336,0.32903612,0.00007957329,0.000074496726,9.040663e-7,0.32475135,0.0098736575,0.00015891585,0.3263261,0.008987745,0.0003404784],"about_ca_topic_score_codex":0.0026412955,"about_ca_topic_score_gemma":0.00063279155,"teacher_disagreement_score":0.45447043,"about_ca_system_score_codex":0.00008144604,"about_ca_system_score_gemma":0.000008662459,"threshold_uncertainty_score":0.9989539},"labels":[],"label_agreement":null},{"id":"W2034089403","doi":"10.1103/physreve.88.062820","title":"Percolation on random networks with arbitrary<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mi>k</mml:mi></mml:math>-core structure","year":2013,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Percolation (cognitive psychology); Core (optical fiber); Algorithm; Computer science; Random graph; Discrete mathematics; Theoretical computer science; Mathematics","score_opus":0.013753003904412217,"score_gpt":0.2560813332516618,"score_spread":0.2423283293472496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034089403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9904401,0.0010852126,0.003196491,0.00021026659,0.00006797712,0.00020403646,0.00001551112,0.000112608235,0.004667801],"genre_scores_gemma":[0.9960993,0.00042589952,0.00095420855,0.0006081491,0.001226413,0.00034513863,0.00024620935,0.00006922843,0.000025451138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983092,0.00008164949,0.0003791766,0.00043887418,0.0003996622,0.00039142245],"domain_scores_gemma":[0.99855226,0.00023509718,0.00035498565,0.0006452343,0.000065863314,0.00014653911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001798568,0.00030048954,0.00039310078,0.00003382343,0.00021949079,0.00014298657,0.0003253143,0.00008684557,0.00035848847],"category_scores_gemma":[0.000023100254,0.0002727371,0.0005092261,0.00031171416,0.000105319705,0.00026473103,0.00013307009,0.00050258695,0.00034435221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004356767,0.000098835,0.000042511812,0.00016805148,0.00018493949,0.000003708607,0.00007119369,0.0005267242,0.00015145885,0.9828417,0.0027612257,0.013106139],"study_design_scores_gemma":[0.00059519056,0.000305169,0.0003503929,0.0018261209,0.0006215078,0.0000070276433,0.00003592767,0.97356147,0.0007799832,0.014823381,0.006614692,0.00047914608],"about_ca_topic_score_codex":0.00015449179,"about_ca_topic_score_gemma":0.000015565256,"teacher_disagreement_score":0.97303474,"about_ca_system_score_codex":0.000009751367,"about_ca_system_score_gemma":0.00006189559,"threshold_uncertainty_score":0.99997246},"labels":[],"label_agreement":null},{"id":"W2034127125","doi":"10.1145/2433396.2433423","title":"Bursty subgraphs in social networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Social media; Context (archaeology); Event (particle physics); World Wide Web; Data science; Social network (sociolinguistics); Internet privacy; Geography","score_opus":0.007469962954818121,"score_gpt":0.24116167664129304,"score_spread":0.23369171368647493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034127125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52009374,0.000040582894,0.17449126,0.00052690867,0.00005428439,0.00038296985,0.0000011130998,0.00021524672,0.30419388],"genre_scores_gemma":[0.9981758,8.425298e-7,0.00064299064,0.00006706227,0.00035696878,0.00005702411,0.000013063049,0.000008238433,0.0006780174],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99940586,0.000026888738,0.0001530311,0.00013703362,0.00006231642,0.00021487779],"domain_scores_gemma":[0.99976707,0.000021329879,0.000034196593,0.00012006826,0.000027135568,0.000030199246],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006826789,0.000085532374,0.00013863906,0.00006372608,0.000058717702,0.000044535496,0.00011824399,0.000025545285,0.005115846],"category_scores_gemma":[3.7026248e-7,0.00007635098,0.0000975746,0.00030525634,0.000024434918,0.000085403866,0.00004791174,0.00011501937,0.0000561254],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018519396,0.00010741416,0.694889,9.170497e-7,0.000046152916,3.6335683e-7,0.00007072347,0.00034434596,0.00005269951,0.12883398,0.10151456,0.074138],"study_design_scores_gemma":[0.00063302,0.00003233377,0.56856066,0.000014170856,0.000036575195,2.1096776e-7,0.0004036733,0.12148235,0.00035551251,0.29576862,0.012002437,0.0007104416],"about_ca_topic_score_codex":0.0018670022,"about_ca_topic_score_gemma":0.000059538048,"teacher_disagreement_score":0.47808203,"about_ca_system_score_codex":0.000010151839,"about_ca_system_score_gemma":0.0000057259645,"threshold_uncertainty_score":0.99579364},"labels":[],"label_agreement":null},{"id":"W2034244548","doi":"10.1080/15427951.2007.10129135","title":"Growing Protean Graphs","year":2007,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Hyperlink; Mathematics; Vertex (graph theory); Random graph; Topological graph; Graph; Web page; Degree distribution; Discrete mathematics; Theoretical computer science; Combinatorics; Computer science; Complex network; World Wide Web","score_opus":0.013733698708369255,"score_gpt":0.2752517246273588,"score_spread":0.26151802591898954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034244548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.334086,0.000011591426,0.5987685,0.000027603399,0.000043380176,0.0001833252,0.0000013037924,0.0001514774,0.06672684],"genre_scores_gemma":[0.9584434,2.0403832e-7,0.03996262,0.000033935852,0.00013032604,0.000012848427,0.0000063743705,0.000020282547,0.001389996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917054,0.000009669566,0.00031241105,0.00013790547,0.00014231037,0.00022715387],"domain_scores_gemma":[0.99945825,0.000074319185,0.00011444544,0.00026002034,0.00003872533,0.00005425153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036123564,0.00012545523,0.00017612953,0.000090837595,0.000027651531,0.000045110944,0.00023232329,0.000023046798,0.0006619173],"category_scores_gemma":[0.0000054626735,0.0001123531,0.00014400706,0.00016014063,0.000029994706,0.00008807301,0.00008589569,0.00012400652,0.000088270564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004677056,0.00038385505,0.010209886,0.000034548713,0.00019613656,0.000006721958,0.0012839084,0.000005816514,0.0013120389,0.953258,0.00841036,0.024894068],"study_design_scores_gemma":[0.0003429653,0.000108240914,0.0005927926,0.0002871257,0.00013133716,0.000008168308,0.0013783425,0.011991232,0.081207834,0.88116324,0.022135003,0.0006537326],"about_ca_topic_score_codex":0.00006677799,"about_ca_topic_score_gemma":0.0000086950895,"teacher_disagreement_score":0.6243574,"about_ca_system_score_codex":0.000016026532,"about_ca_system_score_gemma":0.0000056583663,"threshold_uncertainty_score":0.724753},"labels":[],"label_agreement":null},{"id":"W2034464123","doi":"10.1007/s13278-010-0015-3","title":"Promoting where, when and what? An analysis of web logs by integrating data mining and social network techniques to guide ecommerce business promotions","year":2010,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Data science; Social network analysis; Web mining; Computer science; World Wide Web; Social commerce; Social network (sociolinguistics); Data mining; Knowledge management; Social media; Business; Web service","score_opus":0.018022743806547604,"score_gpt":0.303615564202031,"score_spread":0.2855928203954834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034464123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9589019,0.00050982303,0.038641494,0.0008889384,0.00005996528,0.00036879923,0.00011107207,0.0001433292,0.00037470603],"genre_scores_gemma":[0.93063855,0.000077723744,0.06652385,0.000116943935,0.0013588008,0.000049443704,0.0011246925,0.000047370137,0.00006265197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966536,0.0003224668,0.0010046121,0.0010432992,0.0002999177,0.00067608146],"domain_scores_gemma":[0.9978914,0.00026591695,0.00074085675,0.0005767656,0.00033098971,0.0001940412],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0021700913,0.00045793265,0.001470081,0.00050164404,0.0013431998,0.00080125284,0.00052532565,0.00020928052,0.00010171361],"category_scores_gemma":[0.00003422042,0.0004655622,0.000267956,0.0039068507,0.0002572554,0.0009043382,0.0008487439,0.00039361973,1.3880533e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001825221,0.0001460768,0.4482704,0.000030439882,0.0072884685,0.0000013080692,0.011416306,0.00017427474,0.0011597226,0.0011101065,0.008102589,0.52228206],"study_design_scores_gemma":[0.0009736831,0.0003389901,0.10961127,0.00059642334,0.060387686,0.00000360245,0.04150583,0.7532601,0.00014499955,0.003666379,0.026096059,0.0034149813],"about_ca_topic_score_codex":0.0013535337,"about_ca_topic_score_gemma":0.012236189,"teacher_disagreement_score":0.7530858,"about_ca_system_score_codex":0.000024293142,"about_ca_system_score_gemma":0.00006394904,"threshold_uncertainty_score":0.9999569},"labels":[],"label_agreement":null},{"id":"W2035007494","doi":"10.1109/socialcom.2010.102","title":"Media Monitoring Using Social Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Blogosphere; Computer science; Exploit; Focus (optics); World Wide Web; Keyword search; Information retrieval; Filter (signal processing); Social network (sociolinguistics); Process (computing); Social media; Search engine; Data science; The Internet; Computer security","score_opus":0.021716483773840896,"score_gpt":0.29654407713143244,"score_spread":0.27482759335759155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035007494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71153075,0.0000072727025,0.2655016,0.000031323056,0.00038882875,0.000051611198,9.089342e-7,0.00014389116,0.022343852],"genre_scores_gemma":[0.9834059,2.2822833e-7,0.011565273,0.000006386363,0.004924276,0.000004254212,0.0000050632016,0.000012525512,0.0000761129],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994657,0.000012487735,0.00012146192,0.0001249209,0.00008682359,0.00018858693],"domain_scores_gemma":[0.9997092,0.00003958165,0.00004505065,0.00012950828,0.000035129236,0.000041544892],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000096182375,0.0000862366,0.00012564611,0.000032891632,0.00015194643,0.00004876112,0.00012531204,0.000034262837,0.0010132887],"category_scores_gemma":[0.0000013808262,0.000081713886,0.00009832055,0.00014478281,0.000028126884,0.00006399868,0.00006509908,0.00023538651,0.0000064523188],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050976687,0.00009202148,0.7169504,0.0000014932464,0.00015049151,0.0000012581297,0.00028251036,0.0011136319,0.014318377,0.11295548,0.003045259,0.15108399],"study_design_scores_gemma":[0.000992758,0.000025092204,0.13593854,0.00003537679,0.00042905373,0.0000026608363,0.0010482775,0.7326393,0.03679522,0.06271753,0.027389672,0.0019865131],"about_ca_topic_score_codex":0.00021298713,"about_ca_topic_score_gemma":0.000014928461,"teacher_disagreement_score":0.73152566,"about_ca_system_score_codex":0.000006495696,"about_ca_system_score_gemma":0.000010770713,"threshold_uncertainty_score":0.9998999},"labels":[],"label_agreement":null},{"id":"W2035447260","doi":"10.1139/cjp-2013-0652","title":"Analysis of community-detection methods based on Potts spin model in complex networks","year":2015,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Potts model; Breakup; Community structure; Complex network; Physics; Statistical physics; Null model; Random graph; Graph; Theoretical computer science; Computer science; Statistics; Combinatorics; Mathematics","score_opus":0.08362025374394348,"score_gpt":0.3535519878865819,"score_spread":0.2699317341426384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035447260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13189714,0.00002089532,0.8661562,0.000052892407,0.000040830393,0.000062671694,0.000018866129,0.000005068652,0.0017454458],"genre_scores_gemma":[0.99070114,4.0481578e-7,0.008984087,0.000103426835,0.00014575548,0.0000021760538,0.000038607977,0.000016433618,0.000007957363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984116,0.00056363986,0.0005197023,0.000084868836,0.00017329796,0.0002469031],"domain_scores_gemma":[0.9983,0.00013907149,0.00047798426,0.00037832186,0.0003416397,0.0003629736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012096053,0.00015555682,0.00059936993,0.00074247725,0.0000897023,0.000032894503,0.00035655807,0.00004503313,0.000040071143],"category_scores_gemma":[0.000019955367,0.00016020959,0.0003768065,0.0016921253,0.00007357698,0.00010318928,0.000017350589,0.0006008643,4.823182e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015869102,0.00007225741,0.013794604,0.0000020782738,0.0003140443,0.0000013270732,0.00030044804,0.93756723,0.0001131005,0.0014967776,0.0004115497,0.045910686],"study_design_scores_gemma":[0.00031785708,0.0001147813,0.0065356526,0.000024018364,0.00045128132,2.1391811e-7,0.00023070557,0.980843,0.0005327898,0.01063394,0.0001823249,0.00013343638],"about_ca_topic_score_codex":0.015778683,"about_ca_topic_score_gemma":0.015992919,"teacher_disagreement_score":0.858804,"about_ca_system_score_codex":0.00021025284,"about_ca_system_score_gemma":0.00046916454,"threshold_uncertainty_score":0.99077535},"labels":[],"label_agreement":null},{"id":"W2036115991","doi":"10.5539/mas.v6n12p91","title":"Correlation Network Analysis of International Postgraduate Students’ Satisfaction in Top Malaysian Universities: A Robust Approach","year":2012,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Centrality; Correlation; Order (exchange); Econophysics; Positive correlation; Marketing; Psychology; Computer science; Business; Econometrics; Statistics; Economics; Mathematics; Medicine; Finance","score_opus":0.014088529099478275,"score_gpt":0.26413175963116176,"score_spread":0.2500432305316835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036115991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47431627,0.000005622301,0.5153466,0.0000068008953,0.000034322697,0.000089495974,0.0000035411506,0.000015373169,0.010181973],"genre_scores_gemma":[0.99403614,0.0000013117576,0.005750846,0.000009965233,0.0000749485,0.000013057592,0.000046254434,0.0000051344487,0.00006234896],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987279,0.000022844848,0.00023071139,0.000256591,0.00048129735,0.00028063287],"domain_scores_gemma":[0.99945176,0.000026344082,0.00017392985,0.0002273145,0.00006042519,0.000060209943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006085748,0.000103281294,0.0002099537,0.00052482955,0.00010700006,0.000050789055,0.0003814202,0.000022810967,0.00009101848],"category_scores_gemma":[9.964452e-7,0.00010877876,0.00008238415,0.0022494185,0.00012635764,0.00032199582,0.00016465096,0.000108026004,0.0000025735944],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008490045,0.000068690635,0.69761544,7.784392e-7,0.00010639732,3.5702424e-8,0.0008043302,0.28212026,0.00056463067,0.016185325,0.000011761166,0.0025138806],"study_design_scores_gemma":[0.00008623184,0.0000028460745,0.4011129,0.0000030270269,0.00010274774,5.6271805e-8,0.0005316736,0.5973265,0.00004306272,0.0007053109,0.000010209795,0.00007541889],"about_ca_topic_score_codex":0.00042162056,"about_ca_topic_score_gemma":0.000029932471,"teacher_disagreement_score":0.51971984,"about_ca_system_score_codex":0.00017442787,"about_ca_system_score_gemma":0.00004050813,"threshold_uncertainty_score":0.44358692},"labels":[],"label_agreement":null},{"id":"W2036362885","doi":"10.1080/15427951.2012.625246","title":"Geometric Protean Graphs","year":2012,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Dimension (graph theory); Link (geometry); Property (philosophy); Ranking (information retrieval); Euclidean space; Space (punctuation); Theoretical computer science; Function (biology); Euclidean geometry; Computer science; Artificial intelligence; Combinatorics","score_opus":0.02043266424877522,"score_gpt":0.2723019065488521,"score_spread":0.2518692423000769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036362885","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45676604,0.00011787225,0.449229,0.000032709817,0.00011819492,0.00038062353,0.0000056429885,0.00022579003,0.09312412],"genre_scores_gemma":[0.9744539,7.0561583e-7,0.023166036,0.000017534809,0.00020900452,0.00004889256,0.0000091185975,0.000020725352,0.0020740358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992094,0.000017706852,0.0002478077,0.000099851895,0.00014773267,0.0002775029],"domain_scores_gemma":[0.9994054,0.00006295797,0.00012462585,0.0002907174,0.000034524634,0.000081761114],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021890814,0.00013033734,0.00019164529,0.00017375514,0.000023155126,0.000040501793,0.0002257982,0.000022648155,0.0018637031],"category_scores_gemma":[0.000008904674,0.00011115841,0.00014128826,0.00038580594,0.000025884989,0.00010726721,0.00010432485,0.00011261768,0.0003100841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031391962,0.0017770665,0.1418003,0.00006758632,0.00040189023,8.2372054e-7,0.0020075925,0.0000049724376,0.00022301645,0.759357,0.06649924,0.027857378],"study_design_scores_gemma":[0.0009687908,0.0003037993,0.008384778,0.00042980415,0.0006678061,0.000024487937,0.0015417727,0.02116157,0.06258971,0.7360878,0.16558756,0.002252136],"about_ca_topic_score_codex":0.00004843059,"about_ca_topic_score_gemma":9.378711e-7,"teacher_disagreement_score":0.5176879,"about_ca_system_score_codex":0.000015948632,"about_ca_system_score_gemma":0.0000048159727,"threshold_uncertainty_score":0.9990487},"labels":[],"label_agreement":null},{"id":"W2037178873","doi":"10.1109/asonam.2010.47","title":"A Dynamic and Task-Oriented Social Network Extraction System Based on Analyzing Personal Social Data","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Task (project management); Data extraction; Social network (sociolinguistics); Data science; Data mining; Social media; World Wide Web; Engineering","score_opus":0.012366411144685742,"score_gpt":0.28975305292371256,"score_spread":0.27738664177902683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037178873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5486616,0.000015129596,0.43231994,0.0007058523,0.00040375788,0.00042338352,0.00018473687,0.00053812965,0.016747508],"genre_scores_gemma":[0.99432063,1.6011633e-7,0.0036582255,0.000032136213,0.0012987583,0.000014443669,0.00055931765,0.000019348621,0.00009700268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884945,0.000068386835,0.000213837,0.00040667885,0.00019276774,0.00026885458],"domain_scores_gemma":[0.99942064,0.00007114502,0.00014608463,0.00025843125,0.000050311173,0.00005337613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034700616,0.00016884762,0.00023787678,0.0000715217,0.0005723187,0.00009844898,0.00019121716,0.0000651981,0.00026739447],"category_scores_gemma":[0.0000024486376,0.00016284295,0.000099165074,0.0002690376,0.00005551967,0.00013802023,0.000112281145,0.00035911353,0.000007058965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053542265,0.0012394016,0.2025076,0.00015604292,0.0016657646,0.000018383202,0.0013150203,0.0006618633,0.013396773,0.34462383,0.10257405,0.33130586],"study_design_scores_gemma":[0.0003562415,0.000021433589,0.014088226,0.000017349612,0.00016109773,7.745564e-7,0.00033610125,0.9783554,0.0000137184015,0.00032515067,0.006064583,0.00025992215],"about_ca_topic_score_codex":0.00020034541,"about_ca_topic_score_gemma":0.0001874257,"teacher_disagreement_score":0.97769356,"about_ca_system_score_codex":0.00003649905,"about_ca_system_score_gemma":0.000038702274,"threshold_uncertainty_score":0.6640542},"labels":[],"label_agreement":null},{"id":"W2037188504","doi":"10.1016/j.physa.2014.06.011","title":"Viral information propagation in the Digg online social network","year":2014,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Fields Institute for Research in Mathematical Sciences; Arizona State University","keywords":"Focus (optics); Voting; Computer science; Viral marketing; Social media; Social network (sociolinguistics); Diffusion; Point (geometry); World Wide Web; Physics; Mathematics; Politics; Political science","score_opus":0.00956996371043885,"score_gpt":0.2682098733640599,"score_spread":0.25863990965362105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037188504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026246754,0.0000051310726,0.99487674,0.0007801252,0.000008473807,0.00048942916,0.000119840115,0.00003158755,0.0010640153],"genre_scores_gemma":[0.9948119,0.0000030869905,0.0035344143,0.00019530726,0.0004658633,0.00041535945,0.0005629649,0.000006907489,0.0000042129022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992123,0.00007153247,0.00024843958,0.0001426558,0.00014570277,0.00017933064],"domain_scores_gemma":[0.99948,0.00018332059,0.000105201645,0.00013760767,0.000061248604,0.000032612195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019458916,0.00010633254,0.00014521998,0.000028427105,0.00024148675,0.000080449696,0.00014609031,0.000021934333,0.000021903164],"category_scores_gemma":[0.000009438846,0.000083796716,0.00003285908,0.00027321343,0.000015473739,0.00014159661,0.000049490984,0.00015377569,0.000014997139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025520742,0.00008781854,0.000019174531,0.0000052882656,0.000007753756,1.19517445e-8,0.00010323526,0.00004119697,0.00003936756,0.9344755,0.0007141875,0.06450392],"study_design_scores_gemma":[0.00012209568,0.000029212151,0.0010437146,0.0000043990162,0.00003283934,1.2023575e-7,0.00007145,0.30009046,0.000014151797,0.68047506,0.01801183,0.000104689716],"about_ca_topic_score_codex":0.000024661322,"about_ca_topic_score_gemma":0.000009464173,"teacher_disagreement_score":0.9921872,"about_ca_system_score_codex":0.000010932448,"about_ca_system_score_gemma":0.00001234674,"threshold_uncertainty_score":0.3417131},"labels":[],"label_agreement":null},{"id":"W2037722368","doi":"10.1049/iet-syb.2013.0039","title":"Anti‐triangle centrality‐based community detection in complex networks","year":2014,"lang":"en","type":"article","venue":"IET Systems Biology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"National Natural Science Foundation of China","keywords":"Centrality; Vertex (graph theory); Enhanced Data Rates for GSM Evolution; Community structure; Computer science; Network science; Complex network; Focus (optics); Theoretical computer science; Network analysis; Data mining; Artificial intelligence; Algorithm; Mathematics; Combinatorics; Graph; Physics","score_opus":0.02680775768258498,"score_gpt":0.28272534128769083,"score_spread":0.25591758360510586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037722368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.530713,0.00005818454,0.46492428,0.00006016337,0.0002920046,0.00036210247,0.00001687045,0.00015484943,0.0034185208],"genre_scores_gemma":[0.9990833,9.045919e-7,0.00012008515,0.000050580584,0.00042845888,0.000048970407,0.00023412071,0.000013972148,0.000019655703],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719596,0.0017674245,0.00042328393,0.00020591567,0.00005311686,0.0003543066],"domain_scores_gemma":[0.9989494,0.0002764348,0.00018092447,0.00048571263,0.000050776325,0.000056726214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009837012,0.00016610266,0.00050855905,0.000119862256,0.00016466383,0.000034658504,0.0002650081,0.000106726286,0.000082577266],"category_scores_gemma":[0.0000104455185,0.00015642487,0.00012473883,0.00030901996,0.00007508165,0.000034134588,0.00006380469,0.00035672204,0.000013871876],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032201802,0.00033159822,0.93433565,0.000034218483,0.00011358422,5.7391804e-7,0.000087810695,0.013432025,0.0059895017,0.01717055,0.0014802511,0.026992021],"study_design_scores_gemma":[0.001375444,0.00025246144,0.121330455,0.00007458639,0.00005068013,0.0000019209233,0.00022604626,0.8132698,0.0012020505,0.0044083544,0.057238184,0.00056999887],"about_ca_topic_score_codex":0.008565579,"about_ca_topic_score_gemma":0.00073385413,"teacher_disagreement_score":0.8130052,"about_ca_system_score_codex":0.000049582104,"about_ca_system_score_gemma":0.0000116903575,"threshold_uncertainty_score":0.99803644},"labels":[],"label_agreement":null},{"id":"W203789032","doi":"10.5555/2557696.2557734","title":"Self-similarity of the simulated internet traffic from the source with clustered fragmented periodic output","year":2013,"lang":"en","type":"article","venue":"Summer Computer Simulation Conference","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Self-similarity; Similarity (geometry); Cluster analysis; Cluster (spacecraft); Scaling; The Internet; Computer science; Internet traffic; Cluster size; Property (philosophy); Data mining; Mathematics; Artificial intelligence; Computer network; Physics; World Wide Web","score_opus":0.020340861757453865,"score_gpt":0.23529643019172758,"score_spread":0.2149555684342737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W203789032","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57793623,0.000010849404,0.42113844,0.0002272271,0.000052229465,0.00041605128,0.0000092478,0.00008031051,0.00012939975],"genre_scores_gemma":[0.9966882,3.9931905e-7,0.0027368919,0.00021154096,0.00016069155,0.000013874654,0.000062849715,0.000018261544,0.00010732903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985477,0.0002325045,0.0003931815,0.00033458165,0.00027896988,0.00021308583],"domain_scores_gemma":[0.998297,0.00035326398,0.00030414012,0.0006530223,0.00034048673,0.000052135176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009376159,0.00023710664,0.00028998763,0.00003704784,0.00014418941,0.00019003873,0.0006204269,0.000050711897,0.0006431538],"category_scores_gemma":[0.0000028979678,0.00013871906,0.00014765165,0.00027548644,0.00011874787,0.00014971745,0.0002590002,0.00025343057,0.000019396488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026537693,0.00018148306,0.15787855,0.0000080809,0.000439804,1.7535858e-7,0.0029492823,0.7935659,0.000014583106,0.00039992048,0.0011971983,0.04333846],"study_design_scores_gemma":[0.00046190643,0.00003687986,0.038841594,0.000059629776,0.0000799683,8.3862076e-8,0.00008960688,0.95753974,0.000079238926,0.00032262361,0.0023225541,0.0001661563],"about_ca_topic_score_codex":0.0011466282,"about_ca_topic_score_gemma":0.000076756165,"teacher_disagreement_score":0.41875193,"about_ca_system_score_codex":0.000021789778,"about_ca_system_score_gemma":0.00005550369,"threshold_uncertainty_score":0.7042083},"labels":[],"label_agreement":null},{"id":"W2039238617","doi":"","title":"Using Triads to Identify Local Community Structure in Social Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Metric (unit); Outlier; Data mining; Node (physics); Ground truth; Community structure; Quality (philosophy); Social network analysis; Machine learning; Artificial intelligence; Mathematics; Social media; Statistics; World Wide Web; Engineering","score_opus":0.09246421631653462,"score_gpt":0.3921529370099543,"score_spread":0.2996887206934197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039238617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4707632,0.000006608905,0.5255069,0.000040672454,0.00004073228,0.0000996234,0.000003205647,0.00003928835,0.0034997435],"genre_scores_gemma":[0.9961953,4.6507385e-8,0.0031021726,0.00009677469,0.0005042485,0.0000043276195,0.000030324378,0.000012825456,0.000053966247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990301,0.00025687143,0.00022996152,0.000120648634,0.00012926362,0.00023314457],"domain_scores_gemma":[0.99952483,0.00003582883,0.00005251105,0.00022659355,0.00006523068,0.00009501834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037771065,0.00012225541,0.00024388265,0.00009062791,0.0001467822,0.00006340108,0.00025052825,0.000050864302,0.0002625716],"category_scores_gemma":[0.0000032941043,0.00011784831,0.00007815181,0.0004930851,0.000034681958,0.000080453465,0.00022672144,0.00039789025,0.0000042176575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002148781,0.00058600615,0.29383373,0.0000097089105,0.00032902358,0.000005831971,0.0044447556,0.37653852,0.0011577331,0.06476412,0.10211821,0.15599748],"study_design_scores_gemma":[0.0028323594,0.00014226214,0.05822162,0.000059837595,0.00017299644,0.0000019748975,0.008676153,0.70924634,0.00135862,0.20874692,0.009212864,0.0013280341],"about_ca_topic_score_codex":0.0055378797,"about_ca_topic_score_gemma":0.0009362672,"teacher_disagreement_score":0.5254321,"about_ca_system_score_codex":0.00009042999,"about_ca_system_score_gemma":0.00003705599,"threshold_uncertainty_score":0.8371654},"labels":[],"label_agreement":null},{"id":"W2039552732","doi":"10.1007/s13278-014-0154-z","title":"Interactive discovery of influential friends from social networks","year":2014,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interdependence; Centrality; Friendship; Computer science; Social network (sociolinguistics); Social network analysis; Data science; World Wide Web; Social media; Sociology; Social science","score_opus":0.005928328827660596,"score_gpt":0.2549476657562682,"score_spread":0.24901933692860762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039552732","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6498019,0.000076704746,0.34618473,0.000038628936,0.00007925344,0.000055804492,0.000021729193,0.000035194655,0.0037060555],"genre_scores_gemma":[0.99424785,0.0000053590647,0.0014126856,0.00005317378,0.003915504,0.000013612187,0.0002549388,0.000021173411,0.000075703756],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9982643,0.00022412509,0.000525076,0.00040085628,0.0002092534,0.0003763947],"domain_scores_gemma":[0.9989166,0.0002509344,0.00051645935,0.00016824742,0.0000922702,0.00005545911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003509526,0.00024318442,0.00085060025,0.00014943015,0.00048182174,0.00013875977,0.00019138237,0.00009535043,0.00019992414],"category_scores_gemma":[0.000004860328,0.00024559835,0.00066397473,0.001175199,0.00015593217,0.0002149128,0.00021357361,0.00022125087,7.935339e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014589977,0.0001672613,0.7369836,0.0000063469033,0.014788311,9.618412e-7,0.005012921,0.010633932,0.00012450718,0.035726096,0.0037102853,0.19269988],"study_design_scores_gemma":[0.0018625961,0.0001639387,0.52771896,0.00010472859,0.022098958,1.8706885e-7,0.0057346183,0.3911647,0.00024406367,0.042930596,0.0061305026,0.0018461514],"about_ca_topic_score_codex":0.000993061,"about_ca_topic_score_gemma":0.00023656276,"teacher_disagreement_score":0.38053074,"about_ca_system_score_codex":0.00001863179,"about_ca_system_score_gemma":0.000016044072,"threshold_uncertainty_score":0.99999964},"labels":[],"label_agreement":null},{"id":"W2039584044","doi":"10.1007/s13278-013-0112-1","title":"Group disappearance in social networks with communities","year":2013,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homophily; Node (physics); Group (periodic table); Computer science; Set (abstract data type); Social network (sociolinguistics); Flock; Network topology; Network formation; Quality (philosophy); Theoretical computer science; Data mining; Computer network; Mathematics; World Wide Web; Ecology; Social media; Engineering; Combinatorics","score_opus":0.009275801054004508,"score_gpt":0.24061367627127883,"score_spread":0.23133787521727434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039584044","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9269388,0.0002805096,0.06711867,0.00016778188,0.000021398753,0.0001997791,0.0000031222323,0.00007352699,0.0051964256],"genre_scores_gemma":[0.9965461,0.000017606468,0.0017892233,0.00009205933,0.0012183025,0.0001008979,0.000110648696,0.000023762354,0.00010143827],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99849623,0.00019521883,0.00035984605,0.0002522454,0.00016670159,0.0005297459],"domain_scores_gemma":[0.9994148,0.00010333076,0.00020406462,0.00015855418,0.00005966399,0.00005956135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030785467,0.00024388854,0.00066124846,0.00016289581,0.0008134833,0.00019772077,0.00019033035,0.00007091027,0.00032770963],"category_scores_gemma":[5.9734606e-7,0.00022231339,0.00024298756,0.001884895,0.00019346428,0.0001742076,0.00012696598,0.00029007206,0.0000020875623],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015487529,0.000058117956,0.93897486,0.0000035857522,0.0011758406,8.952609e-7,0.0024130417,0.005244073,0.0000019775796,0.010694622,0.0017328394,0.039684687],"study_design_scores_gemma":[0.0008542532,0.00007182025,0.8099387,0.0000755214,0.0017365727,3.8001394e-7,0.015113596,0.16036673,0.0000011915758,0.009570067,0.0013191791,0.0009519702],"about_ca_topic_score_codex":0.0032798497,"about_ca_topic_score_gemma":0.0031129115,"teacher_disagreement_score":0.15512267,"about_ca_system_score_codex":0.0000231239,"about_ca_system_score_gemma":0.000010204336,"threshold_uncertainty_score":0.9065677},"labels":[],"label_agreement":null},{"id":"W2039736135","doi":"10.1142/s012918311550103x","title":"Extracting principal parameters of complex networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Modern Physics C","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre de Recherches Mathématiques","keywords":"Eigenvalues and eigenvectors; Resolvent; Computer science; Statistical physics; Complex network; Sequence (biology); Matrix (chemical analysis); Principal (computer security); Principal component analysis; Diffusion; Mathematics; Algorithm; Artificial intelligence; Physics; Mathematical analysis","score_opus":0.0697471680995871,"score_gpt":0.3304411947271408,"score_spread":0.2606940266275537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039736135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23902696,0.000043514938,0.75748473,0.00009029435,0.0002496851,0.00004228555,0.000006946673,0.000010260861,0.0030453238],"genre_scores_gemma":[0.9837328,0.000002681305,0.015200891,0.000031963496,0.00097004406,0.0000015081578,0.00001583967,0.000015346646,0.000028925211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857223,0.000052764088,0.0005708439,0.000104586914,0.0005609544,0.00013863787],"domain_scores_gemma":[0.99779654,0.00010936971,0.0009649564,0.0001412348,0.0008915046,0.00009637058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033245087,0.00012241976,0.00028450086,0.000079437355,0.000020365847,0.00004567903,0.0005180081,0.00002241454,0.00003686844],"category_scores_gemma":[0.0000146941,0.00011505624,0.00026893103,0.000096261334,0.000049768398,0.00024694062,0.00010993653,0.0002381675,0.0000018588107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020977679,0.0006528205,0.075478606,0.000003756688,0.0015954828,0.000016756738,0.0007831014,0.37080964,0.0026029628,0.019936314,0.0023339735,0.52557683],"study_design_scores_gemma":[0.0013962226,0.0001482607,0.0020683825,0.00013165454,0.0001527362,0.000022575385,0.00022467226,0.76007205,0.0047688214,0.22919624,0.0015093187,0.00030908574],"about_ca_topic_score_codex":0.000045558365,"about_ca_topic_score_gemma":0.0000010385161,"teacher_disagreement_score":0.74470586,"about_ca_system_score_codex":0.000057517584,"about_ca_system_score_gemma":0.00007867642,"threshold_uncertainty_score":0.46918574},"labels":[],"label_agreement":null},{"id":"W2041208620","doi":"10.1111/j.1523-1739.2012.01858.x","title":"From the Science to the Application of Connectivity Conservation","year":2012,"lang":"en","type":"article","venue":"Conservation Biology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Conservation science; Geography; Environmental planning; Environmental resource management; Environmental science; Biodiversity; Ecology; Biology","score_opus":0.029982514529594766,"score_gpt":0.3111161151995833,"score_spread":0.28113360066998855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041208620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75746286,0.000028657074,0.2334987,0.00818531,0.00007064704,0.0002474816,0.000019673427,0.000019645644,0.00046700286],"genre_scores_gemma":[0.997415,6.0739075e-7,0.00089453283,0.0012100919,0.00031967877,0.00008615748,0.000060381764,0.000003206422,0.000010358224],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993642,0.00010935816,0.00017746996,0.00013649976,0.00007094365,0.00014152391],"domain_scores_gemma":[0.99873483,0.0005133762,0.00016004145,0.00037458655,0.00018905506,0.00002807937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007538123,0.000063018924,0.00010109982,0.00003094757,0.00019592022,0.000014019403,0.0003028024,0.000020394747,0.00007046272],"category_scores_gemma":[0.000068155634,0.00003826138,0.000034795215,0.0005246185,0.00026035646,0.00009803117,0.00009265024,0.000060295206,0.00001989863],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052941377,0.00002433565,0.77134037,3.538958e-7,0.0000148263725,1.1784901e-9,0.00026473403,0.000008805484,0.025963528,0.18727794,0.0032438207,0.011855979],"study_design_scores_gemma":[0.00010721082,0.000022255577,0.8370261,0.000004904965,0.000033386288,1.3524412e-7,0.00028593524,0.0069598965,0.021426972,0.030332247,0.1036934,0.000107539825],"about_ca_topic_score_codex":0.004547012,"about_ca_topic_score_gemma":0.00013553261,"teacher_disagreement_score":0.23995212,"about_ca_system_score_codex":0.000017171778,"about_ca_system_score_gemma":0.00005051638,"threshold_uncertainty_score":0.68737525},"labels":[],"label_agreement":null},{"id":"W2041670710","doi":"10.1109/dasc.2011.141","title":"Finding Strong Groups of Friends among Friends in Social Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Friendship; Popularity; Casual; Social media; Internet privacy; Social network (sociolinguistics); World Wide Web; Interdependence; Computer science; Face (sociological concept); Social group; Psychology; Social psychology; Sociology; Political science; Social science","score_opus":0.03029972686551392,"score_gpt":0.2673251478918135,"score_spread":0.2370254210262996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041670710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.573308,0.00001102926,0.19785184,0.0000052116716,0.000039356015,0.00009042689,0.0000031243776,0.000060674327,0.22863032],"genre_scores_gemma":[0.99761504,5.966392e-7,0.00187691,0.0000048873826,0.00026957478,0.000020806216,0.000020267347,0.000016538912,0.00017540174],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998931,0.000047597696,0.00036572144,0.00021718482,0.00011964103,0.00031888488],"domain_scores_gemma":[0.99954313,0.000030322792,0.0001585528,0.00019068134,0.000034299537,0.000042994903],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020987875,0.00014650454,0.00029604053,0.00015122427,0.000080445636,0.00001493201,0.00022807324,0.00005533506,0.003006389],"category_scores_gemma":[7.230182e-7,0.00014426812,0.00016485358,0.00045289283,0.00007860149,0.00014567673,0.00012907184,0.00019995112,0.0000025286956],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008092571,0.00009963704,0.8220504,0.0000018353821,0.00008157224,8.701704e-7,0.00063615246,0.000107079795,0.00001906921,0.1707013,0.0006772055,0.005616829],"study_design_scores_gemma":[0.00081112824,0.00010633907,0.881184,0.000056518144,0.00017692472,2.3308414e-7,0.0033361367,0.07577971,0.0022874312,0.035307713,0.00024662836,0.0007072267],"about_ca_topic_score_codex":0.0010960014,"about_ca_topic_score_gemma":0.00016463468,"teacher_disagreement_score":0.42430702,"about_ca_system_score_codex":0.000017842336,"about_ca_system_score_gemma":0.000012143512,"threshold_uncertainty_score":0.997905},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02584356087544954,"score_gpt":0.30262111552378207,"score_spread":0.27677755464833254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041835352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8880239,0.00010269029,0.073970474,0.00006381906,0.00009474787,0.00022682772,0.00003774348,0.00012350993,0.037356306],"genre_scores_gemma":[0.99181455,0.000008360932,0.0073526045,0.00002800807,0.00008361217,0.000032476684,0.00008838088,0.000024528139,0.0005674459],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982873,0.00021872603,0.00049721793,0.0004100666,0.00024214336,0.00034453964],"domain_scores_gemma":[0.9979818,0.00031329962,0.0002983851,0.0011766267,0.00011451304,0.000115407376],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048074944,0.00023076311,0.00065783306,0.0005937535,0.000095679345,0.00003366883,0.0005299647,0.00007084545,0.0031163301],"category_scores_gemma":[0.000056813267,0.00022283122,0.00074602925,0.0022110417,0.00007841563,0.00009280713,0.00007264839,0.0002051523,0.000019391426],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019132056,0.00024247843,0.9166691,0.0000073910974,0.0035004339,0.0000014751664,0.00018214119,0.00042298634,0.0013053943,0.033667807,0.0037638398,0.04021783],"study_design_scores_gemma":[0.0016900591,0.00056232914,0.1053426,0.00010079462,0.014525928,0.0000015943954,0.000791322,0.0122365095,0.062495317,0.7069401,0.09244139,0.0028720368],"about_ca_topic_score_codex":0.00042674545,"about_ca_topic_score_gemma":0.0000724631,"teacher_disagreement_score":0.8113265,"about_ca_system_score_codex":0.0000203622,"about_ca_system_score_gemma":0.00003568141,"threshold_uncertainty_score":0.997795},"labels":[],"label_agreement":null},{"id":"W2041874687","doi":"10.1371/journal.pone.0114503","title":"Motif-Role-Fingerprints: The Building-Blocks of Motifs, Clustering-Coefficients and Transitivities in Directed Networks","year":2014,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Australian Research Council; National Health and Medical Research Council; Natural Sciences and Engineering Research Council of Canada; Medical Research Council; Australian Government; National Science Foundation","keywords":"Motif (music); Structural motif; Network motif; Computational biology; Adjacency matrix; Centrality; Cluster analysis; Computer science; Pattern recognition (psychology); Biology; Mathematics; Combinatorics; Artificial intelligence; Biological network; Theoretical computer science; Graph","score_opus":0.012581043380042598,"score_gpt":0.21082219003970656,"score_spread":0.19824114665966397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041874687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9068197,0.00008877883,0.09157655,0.00006976009,0.0000110027095,0.00019480195,0.0000050019735,0.00006885116,0.0011655847],"genre_scores_gemma":[0.9983556,0.0000094978805,0.0013871677,0.000022384138,0.00011836499,0.000028524533,0.000007751049,0.000018220262,0.000052446256],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989744,0.000113500086,0.0002771499,0.00022593216,0.00017410697,0.00023494149],"domain_scores_gemma":[0.99932677,0.00018785389,0.00010632007,0.00028926824,0.000051251925,0.000038538055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030579924,0.00014695911,0.00034256087,0.0000879647,0.000072367846,0.00003503284,0.00018654446,0.00003535633,0.00005188441],"category_scores_gemma":[0.000011594603,0.00012378619,0.000062252235,0.00025905014,0.000095686075,0.000047678688,0.00010850946,0.00018745346,6.2017074e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001596635,0.0052433847,0.750993,0.00017675462,0.0015805822,0.0000017286275,0.004058226,0.051068146,0.03429859,0.0076334137,0.00015867972,0.14462782],"study_design_scores_gemma":[0.00037745415,0.000055500397,0.027617995,0.0003400359,0.00014792423,1.8843289e-7,0.00010514141,0.9610091,0.008144515,0.0019501316,0.000050560982,0.00020147947],"about_ca_topic_score_codex":0.00036465452,"about_ca_topic_score_gemma":0.00008157789,"teacher_disagreement_score":0.90994096,"about_ca_system_score_codex":0.000012852365,"about_ca_system_score_gemma":0.000006372178,"threshold_uncertainty_score":0.5047854},"labels":[],"label_agreement":null},{"id":"W2042236541","doi":"10.1371/journal.pone.0066005","title":"Link Clustering with Extended Link Similarity and EQ Evaluation Division","year":2013,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Jilin University; National Natural Science Foundation of China","keywords":"Jaccard index; Cluster analysis; Dendrogram; Similarity (geometry); Hierarchical clustering; Partition (number theory); Single-linkage clustering; Mathematics; Similarity measure; Link (geometry); Hierarchical clustering of networks; Distance matrix; Pattern recognition (psychology); Consensus clustering; Computer science; Data mining; Artificial intelligence; Correlation clustering; Algorithm; CURE data clustering algorithm; Combinatorics","score_opus":0.052503424732475566,"score_gpt":0.26122148068148776,"score_spread":0.2087180559490122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042236541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9648641,0.000068501184,0.029479468,0.00064079056,0.0000053373547,0.0005855579,0.0000025090947,0.00009273606,0.0042610285],"genre_scores_gemma":[0.9866838,0.0000049100727,0.012798683,0.0000308898,0.00023987326,0.000102567865,0.00003658544,0.000014007574,0.000088693516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914837,0.0000550243,0.0001459202,0.00021767772,0.00028468322,0.00014830104],"domain_scores_gemma":[0.9993999,0.000043106764,0.00007687399,0.00024856793,0.00017406627,0.00005745698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001974555,0.000109359156,0.00018300864,0.000045897305,0.00009671823,0.00008608155,0.00007798523,0.000027431164,0.00069525535],"category_scores_gemma":[0.0000061309365,0.00009295946,0.000028382286,0.00010726915,0.000026325051,0.00015922684,0.00010296378,0.00013170349,0.000018851633],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026007256,0.001052901,0.14082971,0.00007078972,0.00081905175,6.246753e-7,0.000380894,0.0002910535,0.017714337,0.0012077052,0.00032169567,0.8372852],"study_design_scores_gemma":[0.0006683968,0.00018961291,0.13241576,0.00028184135,0.00047500405,1.6693394e-7,0.000045721197,0.82774776,0.008063089,0.029704949,0.00006843048,0.0003392989],"about_ca_topic_score_codex":0.00013960256,"about_ca_topic_score_gemma":0.000013847672,"teacher_disagreement_score":0.83694595,"about_ca_system_score_codex":0.000018191247,"about_ca_system_score_gemma":0.0000136251965,"threshold_uncertainty_score":0.76125586},"labels":[],"label_agreement":null},{"id":"W2042857706","doi":"10.1371/journal.pone.0122777","title":"Generating Attributed Networks with Communities","year":2015,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Computer science; Task (project management); Set (abstract data type); Community structure; Focus (optics); Generator (circuit theory); Data science; Biological network; Complex network; Data mining; Network analysis; Theoretical computer science; Bioinformatics; World Wide Web; Biology; Ecology; Engineering","score_opus":0.08606062182673915,"score_gpt":0.24305279747565756,"score_spread":0.1569921756489184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042857706","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8826535,0.00010105511,0.110575,0.000092898925,0.000007346275,0.0001497332,0.000006882775,0.00018919137,0.006224404],"genre_scores_gemma":[0.97315496,0.0000017533431,0.025998618,0.000058546448,0.0003306578,0.000038980495,0.00016257272,0.000017869655,0.00023602061],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993452,0.00007378542,0.00013333997,0.000086822474,0.00017381008,0.00018706873],"domain_scores_gemma":[0.99934477,0.000042640117,0.000070076734,0.0003035909,0.00016293615,0.00007596778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001516407,0.00010758392,0.00022109349,0.00003306865,0.00010857593,0.00006226282,0.00015681477,0.000018448598,0.00014601428],"category_scores_gemma":[0.0000017259321,0.00009391764,0.00003077532,0.00018171786,0.000039107577,0.00007209508,0.00008393517,0.00016742614,0.00000986994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006780624,0.002788596,0.911184,0.000018318222,0.0029818877,0.000003989308,0.0014188739,0.05111292,0.0008722415,0.009888318,0.011951139,0.007711872],"study_design_scores_gemma":[0.0008867231,0.00026526253,0.0008723892,0.00023853476,0.0005231614,5.761457e-7,0.0015360374,0.98776317,0.004397929,0.0019747517,0.0009759379,0.00056555046],"about_ca_topic_score_codex":0.0004962253,"about_ca_topic_score_gemma":0.00009702687,"teacher_disagreement_score":0.9366502,"about_ca_system_score_codex":0.00001903906,"about_ca_system_score_gemma":0.0000223834,"threshold_uncertainty_score":0.382985},"labels":[],"label_agreement":null},{"id":"W2042940468","doi":"10.1103/physrevlett.100.058702","title":"Critical Networks Exhibit Maximal Information Diversity in Structure-Dynamics Relationships","year":2008,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Institute of General Medical Sciences","keywords":"Statistical physics; Chaotic; Complex network; Dynamics (music); Network structure; Phase transition; Computer science; Physics; Critical phenomena; Network dynamics; Diversity (politics); Complex system; Complex dynamics; Theoretical computer science; Mathematics; Condensed matter physics; Artificial intelligence; Discrete mathematics","score_opus":0.023111491190854257,"score_gpt":0.27338250850868395,"score_spread":0.2502710173178297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042940468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8157627,0.0005685899,0.17635441,0.004589734,0.00008156118,0.0005908993,0.000031757256,0.00013220543,0.0018881606],"genre_scores_gemma":[0.99709594,0.000113289185,0.0006414335,0.0017546085,0.0002038985,0.000015542566,0.0001654291,0.000007872352,0.0000019727725],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988797,0.00014237361,0.00030930352,0.00017392071,0.00022927078,0.00026543913],"domain_scores_gemma":[0.9993214,0.00019647248,0.00009538421,0.0002564069,0.000052587413,0.000077775556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014055891,0.00016520711,0.00034709607,0.00006293648,0.00026806572,0.000022818516,0.00020921743,0.000013215179,0.000106632106],"category_scores_gemma":[0.00003456407,0.00015993207,0.0001909714,0.00043046215,0.00010742969,0.00055313384,0.00021587384,0.00049166445,0.000029633344],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026643522,0.000321096,0.7835622,0.00029114413,0.00012382884,0.000014846396,0.00058881135,0.012024857,0.000059568556,0.15697277,0.024885468,0.021128805],"study_design_scores_gemma":[0.0007339154,0.000061100305,0.28827468,0.0013432163,0.00040878955,0.000010018097,0.000059980233,0.6692929,0.0000437292,0.03394303,0.004479599,0.0013490259],"about_ca_topic_score_codex":0.00010689703,"about_ca_topic_score_gemma":0.000013003767,"teacher_disagreement_score":0.65726805,"about_ca_system_score_codex":0.00008529707,"about_ca_system_score_gemma":0.000012123768,"threshold_uncertainty_score":0.65218407},"labels":[],"label_agreement":null},{"id":"W2043152202","doi":"10.1109/pccc.2014.7017060","title":"JLMC: A clustering method based on Jordan-Form of Laplacian-Matrix","year":2014,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cluster analysis; Spectral clustering; Laplacian matrix; Computer science; Laplace operator; Correlation clustering; Algorithm; Matrix (chemical analysis); Modularity (biology); Canopy clustering algorithm; CURE data clustering algorithm; Mathematics; Data mining; Artificial intelligence","score_opus":0.009648517083962336,"score_gpt":0.3032960856054976,"score_spread":0.29364756852153523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043152202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009558174,0.0000018810574,0.88670677,0.00008145917,0.000019997562,0.0000906612,0.0000030294248,0.000068718015,0.10346931],"genre_scores_gemma":[0.88537157,1.4314121e-7,0.11380021,0.000079705285,0.0001215958,0.000013031715,0.000011031482,0.00001324772,0.000589436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918014,0.00006730652,0.0002503648,0.00017781538,0.00014825012,0.00017611156],"domain_scores_gemma":[0.99921316,0.00021024416,0.0001154698,0.00036848997,0.000044697936,0.000047929338],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003915925,0.00012735969,0.0002685974,0.00010935518,0.00004662164,0.000020548738,0.00017312595,0.00002376514,0.0010523571],"category_scores_gemma":[0.0000064529263,0.0001076211,0.00017949975,0.00019276277,0.000015498557,0.00004428658,0.000057225137,0.00009079731,0.000019302592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001402193,0.00059277494,0.025598649,0.00008599366,0.0003028455,8.205678e-7,0.00027812438,0.032649875,0.004182908,0.35736874,0.008814866,0.5699842],"study_design_scores_gemma":[0.0003042529,0.00010279876,0.00039192615,0.000034585137,0.000040874354,1.021851e-7,0.00003283745,0.9615579,0.013280171,0.0144131575,0.009668186,0.00017316206],"about_ca_topic_score_codex":0.00032123484,"about_ca_topic_score_gemma":0.00004267571,"teacher_disagreement_score":0.92890805,"about_ca_system_score_codex":0.000014043613,"about_ca_system_score_gemma":0.000014264176,"threshold_uncertainty_score":0.9998608},"labels":[],"label_agreement":null},{"id":"W2043276060","doi":"10.1080/10919392.2014.896715","title":"Interactive Mining of Strong Friends from Social Networks and Its Applications in E-Commerce","year":2014,"lang":"en","type":"article","venue":"Journal of Organizational Computing and Electronic Commerce","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Friendship; Interdependence; Computer science; Social network (sociolinguistics); Data science; World Wide Web; Psychology; Social media; Social psychology; Sociology","score_opus":0.0065793522552642,"score_gpt":0.2632399672017554,"score_spread":0.25666061494649123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043276060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7371563,0.00029224428,0.2619257,0.00021501523,0.000014929136,0.000047186924,0.0000026320104,0.000007346206,0.0003386893],"genre_scores_gemma":[0.9988205,0.00001380291,0.00068848697,0.000034476972,0.00039363056,6.828317e-7,0.000026852835,0.000014014428,0.0000075516286],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901307,0.000114064955,0.00043882307,0.00013039669,0.00012237858,0.000181263],"domain_scores_gemma":[0.99869454,0.0005425535,0.000460177,0.0000615054,0.0001991955,0.000042059168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031481747,0.00011726865,0.0003138841,0.00011573901,0.00014370191,0.00003149202,0.00014506477,0.00003397692,0.000036204772],"category_scores_gemma":[0.000016312943,0.00011752397,0.00004756654,0.00033627774,0.000031601587,0.00008992563,0.000103792976,0.00033412132,1.3984126e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007667349,0.00038482074,0.7279271,0.000019386736,0.0006563707,4.2373023e-7,0.0033142013,0.010774441,0.0008400863,0.19722375,0.00049764366,0.058285087],"study_design_scores_gemma":[0.0022666557,0.00038243178,0.34697947,0.00027855852,0.00039513435,0.000016934468,0.0029436164,0.6206893,0.0006541408,0.02220656,0.0025551186,0.0006321093],"about_ca_topic_score_codex":0.000039419472,"about_ca_topic_score_gemma":0.0000102799795,"teacher_disagreement_score":0.60991484,"about_ca_system_score_codex":0.000042949563,"about_ca_system_score_gemma":0.000049937742,"threshold_uncertainty_score":0.47924882},"labels":[],"label_agreement":null},{"id":"W2043384621","doi":"10.1109/tit.2014.2346183","title":"Tracking a Markov-Modulated Stationary Degree Distribution of a Dynamic Random Graph","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Mathematics; Stationary distribution; Degree distribution; Markov process; Degree (music); Markov model; Markov kernel; Discrete mathematics; Variable-order Markov model; Algorithm; Applied mathematics; Combinatorics; Statistics; Complex network","score_opus":0.006857078902441537,"score_gpt":0.23262984795697728,"score_spread":0.22577276905453575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043384621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055765387,0.0000035830876,0.941704,0.000022794635,0.0000800591,0.00021480296,0.0002192007,0.00010625276,0.0018839438],"genre_scores_gemma":[0.9985274,0.0000035256817,0.00076504785,0.00002936335,0.000015206126,0.000053150437,0.0005405767,0.000008481965,0.000057236717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989184,0.0001543402,0.0004941289,0.000096993695,0.00019063718,0.00014547016],"domain_scores_gemma":[0.9990646,0.00023198241,0.00024338806,0.00023884459,0.00017881316,0.0000423481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049734116,0.00013994052,0.00019873666,0.00021988172,0.0001738187,0.000033104167,0.00011916699,0.000043981105,0.00047851814],"category_scores_gemma":[0.000004556578,0.00013724288,0.00018407719,0.0004126788,0.00006418069,0.00063713617,0.0000011660035,0.00015625182,0.0000318519],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005052069,0.00019908635,0.000056991546,0.000037121157,0.00026840373,6.871558e-8,0.0007360519,0.035834093,0.00045124604,0.022828879,0.00028164542,0.9388012],"study_design_scores_gemma":[0.006910888,0.00041940584,0.008481685,0.000307585,0.00064743054,0.000005562895,0.0015345044,0.6909901,0.027512604,0.2583283,0.0037267702,0.0011352049],"about_ca_topic_score_codex":0.000026657042,"about_ca_topic_score_gemma":0.000004429318,"teacher_disagreement_score":0.942762,"about_ca_system_score_codex":0.0000383793,"about_ca_system_score_gemma":0.000025274903,"threshold_uncertainty_score":0.55966026},"labels":[],"label_agreement":null},{"id":"W2043690777","doi":"10.1007/s10588-005-5379-y","title":"Structure in the Enron Email Dataset","year":2005,"lang":"en","type":"article","venue":"Computational and Mathematical Organization Theory","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":121,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Word (group theory); Computer science; Singular value decomposition; Key (lock); Value (mathematics); Function (biology); Decomposition; Natural language processing; Maxima and minima; Artificial intelligence; Mathematics; Machine learning","score_opus":0.005135491209253993,"score_gpt":0.24096780313269975,"score_spread":0.23583231192344575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043690777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13005878,0.0000467452,0.86650634,0.0013576966,0.0000110264855,0.00021290348,0.00014568846,0.000044039265,0.0016167816],"genre_scores_gemma":[0.99037236,6.3833204e-7,0.008067121,0.00038303723,0.00012574432,0.0000033268386,0.0010012505,0.000008071849,0.000038461596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994172,0.00008763295,0.00017618953,0.00011593552,0.0001225378,0.0000805244],"domain_scores_gemma":[0.9994742,0.00030764253,0.000046630426,0.00010695652,0.000041642703,0.000022897275],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021077241,0.000079453974,0.000099321056,0.000039595296,0.00008264097,0.000052049443,0.00012332694,0.000017529075,0.0019985554],"category_scores_gemma":[0.00002264359,0.000053925243,0.000013866579,0.00024043277,0.000048456386,0.00008749512,0.000046738864,0.00007799188,0.000032574935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015561697,0.00006163528,0.00095617445,0.000005732283,0.000011859365,2.119776e-7,0.00044095848,0.0014493114,0.000018140152,0.9895056,0.0024003282,0.005148489],"study_design_scores_gemma":[0.000121231715,0.000005482185,0.0023579807,0.000008011784,0.000017386083,0.0000039820466,0.00016936529,0.010838192,0.00007728484,0.9852234,0.0011010815,0.0000765766],"about_ca_topic_score_codex":0.0000013019272,"about_ca_topic_score_gemma":0.0000010925949,"teacher_disagreement_score":0.8603136,"about_ca_system_score_codex":0.0000077671575,"about_ca_system_score_gemma":0.000012504195,"threshold_uncertainty_score":0.99891376},"labels":[],"label_agreement":null},{"id":"W2043930431","doi":"10.5555/3191835.3191970","title":"Understanding south asian violent extremist group-group interactions","year":2014,"lang":"en","type":"article","venue":"Advances in Social Networks Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Betweenness centrality; Centrality; PageRank; Agency (philosophy); Terrorism; Group (periodic table); Computer security; Computer science; Politics; Social network analysis; Political science; Sociology; Theoretical computer science; Mathematics; World Wide Web; Social science; Combinatorics","score_opus":0.025546114697191955,"score_gpt":0.2929306845473224,"score_spread":0.2673845698501304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043930431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020323558,0.00038472423,0.96158016,0.0000470046,0.000077390214,0.000073368574,0.00000347768,0.000051690335,0.017458625],"genre_scores_gemma":[0.9962522,0.000084278814,0.0025166385,0.00003955573,0.00092586904,0.000028833547,0.00008658947,0.000018461462,0.00004759401],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985042,0.00013351199,0.00042117888,0.00042552652,0.00014728527,0.00036824725],"domain_scores_gemma":[0.99929756,0.00015809541,0.00027336605,0.00017138346,0.000023890792,0.00007571473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038947567,0.0002179628,0.0005245442,0.00026977807,0.00049235293,0.00012037655,0.00014259036,0.00004830057,0.00015903273],"category_scores_gemma":[0.0000051385327,0.00022243104,0.00030137968,0.0012537717,0.00010392299,0.00026803088,0.000097420394,0.00024271857,4.9924734e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023082124,0.00010880647,0.6245937,0.00000770622,0.00086919067,0.0000014479448,0.0016835886,0.018087162,0.000016616239,0.08964992,0.00017757068,0.2647812],"study_design_scores_gemma":[0.001016563,0.0000855889,0.031675763,0.00021391001,0.0026376024,6.462569e-7,0.023647727,0.87484103,0.000005673515,0.041634466,0.022976952,0.0012640931],"about_ca_topic_score_codex":0.00007918257,"about_ca_topic_score_gemma":0.0011525006,"teacher_disagreement_score":0.9759286,"about_ca_system_score_codex":0.000084961204,"about_ca_system_score_gemma":0.000004422407,"threshold_uncertainty_score":0.9070475},"labels":[],"label_agreement":null},{"id":"W2044028731","doi":"10.1080/15427951.2012.671149","title":"Model Selection for Social Networks Using Graphlets","year":2012,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Property (philosophy); Selection (genetic algorithm); Model selection; Machine learning; Artificial intelligence; Computer science; Mathematics; Tree (set theory); Data mining; Theoretical computer science","score_opus":0.07055483639277808,"score_gpt":0.3336439917856682,"score_spread":0.26308915539289013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044028731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1285037,0.000013945333,0.8697917,0.000008226784,0.000046150468,0.00015968611,0.000003320979,0.00006500661,0.0014082643],"genre_scores_gemma":[0.9009362,2.3262565e-7,0.09795486,0.00001841821,0.0007070472,0.00003721658,0.000013585786,0.000025744439,0.00030673074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930364,0.000012334443,0.00022734015,0.000098450466,0.000081001446,0.00027720732],"domain_scores_gemma":[0.99962765,0.00004354862,0.00014189041,0.00008942734,0.00005757669,0.000039903472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017346829,0.00012464813,0.00018966761,0.000052950152,0.000072457384,0.00003966063,0.000113045506,0.000041243187,0.000094916686],"category_scores_gemma":[0.0000023483653,0.000121548816,0.00018184469,0.00010915114,0.000019509915,0.00010642298,0.00004612212,0.00008753907,0.0000039665106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022289172,0.0013277909,0.02044445,0.000089318244,0.00072212046,7.10671e-8,0.0041337423,0.022026638,0.0013722394,0.8896957,0.050240204,0.009925439],"study_design_scores_gemma":[0.000080032325,0.000009519049,0.000014089135,0.00001577798,0.000094142226,6.848032e-7,0.00004710341,0.96109605,0.00054990454,0.037535608,0.0004316057,0.00012548245],"about_ca_topic_score_codex":0.000024619289,"about_ca_topic_score_gemma":0.000003527925,"teacher_disagreement_score":0.9390694,"about_ca_system_score_codex":0.000031411746,"about_ca_system_score_gemma":0.000007850858,"threshold_uncertainty_score":0.49566168},"labels":[],"label_agreement":null},{"id":"W2044203218","doi":"10.1145/1321211.1321249","title":"Identifying active subgroups in online communities","year":2007,"lang":"en","type":"article","venue":"Proceedings of CASCON","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Sense of community; Computer science; Online community; Contrast (vision); Hierarchical clustering; Data science; Psychology; World Wide Web; Machine learning; Artificial intelligence; Social psychology","score_opus":0.02627888670266525,"score_gpt":0.30424263018138825,"score_spread":0.277963743478723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044203218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98250526,0.000041114803,0.0009212915,0.00001734021,0.00001535603,0.000101075486,0.0000052357955,0.000034726567,0.01635858],"genre_scores_gemma":[0.9979186,0.000005191565,0.0018617068,0.000011676121,0.00011212434,0.0000058077967,0.000017211942,0.000012192744,0.000055470155],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992727,0.0000031892564,0.00029013996,0.000099688164,0.00012891043,0.00020536216],"domain_scores_gemma":[0.999523,0.000055515167,0.00017400637,0.000065206616,0.00015132867,0.00003096562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032085893,0.00010452626,0.00023477401,0.00022078329,0.00004161519,0.000026806498,0.00019610663,0.000027014014,0.00008362046],"category_scores_gemma":[0.0000036826352,0.00011129691,0.00007645327,0.00031290087,0.00005578176,0.0002365739,0.00010025288,0.00019786344,0.0000013254046],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009124729,0.0003963717,0.8261838,0.00007028374,0.00009592835,0.0000010506351,0.006608222,0.000003646832,0.03528594,0.07211449,0.0002981809,0.058850847],"study_design_scores_gemma":[0.0012170512,0.00016472972,0.31484064,0.000630994,0.0001287697,0.0000035461962,0.09332153,0.0011707052,0.5118035,0.074499734,0.0014823035,0.00073649426],"about_ca_topic_score_codex":0.0013753985,"about_ca_topic_score_gemma":0.0002631238,"teacher_disagreement_score":0.5113432,"about_ca_system_score_codex":0.0000321691,"about_ca_system_score_gemma":0.000008047114,"threshold_uncertainty_score":0.45385563},"labels":[],"label_agreement":null},{"id":"W2044519314","doi":"10.5555/3191835.3191894","title":"SSRM: structural social role mining for dynamic social networks","year":2014,"lang":"en","type":"article","venue":"Advances in Social Networks Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Betweenness centrality; Centrality; Social network (sociolinguistics); Leverage (statistics); Automatic summarization; Data science; Social network analysis; Computer science; Dynamic network analysis; Community structure; Complex network; Trustworthiness; Organizational network analysis; Knowledge management; Social media; Artificial intelligence; World Wide Web; Computer security","score_opus":0.005484107625801026,"score_gpt":0.2928808204789766,"score_spread":0.2873967128531756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044519314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3470288,0.0015834925,0.6478874,0.00014106013,0.00018108006,0.00029957478,0.000023086244,0.000113795664,0.0027417154],"genre_scores_gemma":[0.9912356,0.000056815355,0.00449884,0.000092014874,0.003557395,0.000106509935,0.0003135494,0.000048653932,0.00009057977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973054,0.00019859061,0.00072769437,0.00068972114,0.00023230528,0.00084629527],"domain_scores_gemma":[0.99875414,0.00035344693,0.0005453643,0.00015536814,0.00011114495,0.0000805481],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006524224,0.00041750976,0.0011288555,0.00027051524,0.0014634406,0.00018458802,0.00030533207,0.00019166394,0.000072307805],"category_scores_gemma":[0.00001088331,0.0004417791,0.00070035516,0.001489098,0.00021280031,0.00033386276,0.00016660776,0.00032610228,2.6988477e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007266848,0.000043749675,0.14499086,0.0000125665365,0.0011194648,6.81568e-7,0.0021995436,0.061405405,0.000009134664,0.015944934,0.000414943,0.77378607],"study_design_scores_gemma":[0.00066316465,0.00003943171,0.021249855,0.0000182389,0.0012088754,1.8786717e-7,0.0027046415,0.9605384,0.0000017551076,0.008774867,0.004203769,0.000596804],"about_ca_topic_score_codex":0.00008684952,"about_ca_topic_score_gemma":0.00088372146,"teacher_disagreement_score":0.899133,"about_ca_system_score_codex":0.0000705114,"about_ca_system_score_gemma":0.000018512437,"threshold_uncertainty_score":0.9998365},"labels":[],"label_agreement":null},{"id":"W2045144565","doi":"10.1145/2492517.2492608","title":"Information propagation in microblog networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Microblogging; Social media; Computer science; World Wide Web","score_opus":0.003474630080736421,"score_gpt":0.20246396896294885,"score_spread":0.19898933888221243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045144565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16678387,0.0000059751305,0.7634321,0.00018909828,0.000021737062,0.00037760375,3.914157e-7,0.0000847918,0.06910445],"genre_scores_gemma":[0.9978404,5.7514217e-7,0.0017398676,0.00007718948,0.00005634836,0.000069631235,0.00005554044,0.000002602968,0.00015781676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962085,0.000013989571,0.00017372899,0.00004305226,0.000040030307,0.000108355875],"domain_scores_gemma":[0.9997836,0.000010396779,0.000047881953,0.00009920141,0.00004156646,0.000017380837],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000060060385,0.00005347373,0.00006786528,0.00006654355,0.00002105882,0.000058810507,0.0000614044,0.00001599546,0.0015509506],"category_scores_gemma":[7.710046e-7,0.00004629721,0.00002815548,0.00018096049,0.000008209613,0.00047562423,0.000025776402,0.00006286825,0.0001497021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034347443,0.00009387861,0.3544652,0.000005206898,0.000033335782,6.290926e-8,0.00027469706,0.014310984,0.00047060722,0.08117009,0.055430096,0.4937424],"study_design_scores_gemma":[0.00039587312,0.000026071595,0.1070229,0.000024102326,0.000011726883,2.7266228e-7,0.00032958575,0.8512328,0.0018076722,0.028875303,0.009947659,0.0003259856],"about_ca_topic_score_codex":0.0010162513,"about_ca_topic_score_gemma":0.000018186889,"teacher_disagreement_score":0.8369219,"about_ca_system_score_codex":0.000013043564,"about_ca_system_score_gemma":0.0000059625445,"threshold_uncertainty_score":0.99936175},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.02811512758379235,"score_gpt":0.3356441094382786,"score_spread":0.30752898185448624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045387243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06132078,0.0010858468,0.9345477,0.00035377764,0.00014572669,0.0014179412,0.000015595146,0.00007472694,0.0010378904],"genre_scores_gemma":[0.9914835,0.00025117202,0.0058954246,0.00014795002,0.0015179358,0.0003584831,0.0002994476,0.000017089937,0.000028962593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991775,0.000049357994,0.00023928129,0.00024725558,0.000101118356,0.00018546607],"domain_scores_gemma":[0.9994294,0.000060344595,0.00010508755,0.00027518344,0.00008056879,0.00004943372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002479765,0.00012593628,0.00032897477,0.000024438628,0.000059402642,0.000034249006,0.00013299598,0.000022318232,0.00010557491],"category_scores_gemma":[0.000018039678,0.00012016001,0.0001843002,0.00026997944,0.00002036556,0.00010689979,0.00003564693,0.0002110048,0.000005748099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055573496,0.0006420071,0.0059045604,0.00014103169,0.000059422942,3.6557623e-7,0.000025773765,0.0028838536,0.004228379,0.095213786,0.008200698,0.88269454],"study_design_scores_gemma":[0.00015281304,0.000020495447,0.0008980245,0.000094401315,0.00006534581,1.03516776e-7,7.566921e-7,0.96630853,0.00056898216,0.018997848,0.012723552,0.0001691518],"about_ca_topic_score_codex":0.000083341656,"about_ca_topic_score_gemma":0.000044494638,"teacher_disagreement_score":0.9634247,"about_ca_system_score_codex":0.00001470079,"about_ca_system_score_gemma":0.000016176096,"threshold_uncertainty_score":0.48999828},"labels":[],"label_agreement":null},{"id":"W2046331757","doi":"10.1139/cjp-2014-0112","title":"Topology properties of a weighted multi-local-world evolving network","year":2015,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Priority Academic Program Development of Jiangsu Higher Education Institutions; National Natural Science Foundation of China","keywords":"Topology (electrical circuits); Physics; Preferential attachment; Distribution (mathematics); Small-world network; The Internet; Power law; Field (mathematics); Local area network; Statistical physics; Complex network; Computer science; Computer network; Statistics; Mathematical analysis; Mathematics; Pure mathematics; Combinatorics; World Wide Web","score_opus":0.04118717937681919,"score_gpt":0.25432796613720793,"score_spread":0.21314078676038872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046331757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37952083,0.0072068297,0.5940076,0.0011197281,0.0014999795,0.0005404608,0.000041927284,0.00005409804,0.01600854],"genre_scores_gemma":[0.99303013,0.0000012560016,0.0052883397,0.000045891367,0.0013867205,0.0000022439215,0.000003418353,0.00001896853,0.00022302424],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989138,0.00008448165,0.00043423983,0.000100861704,0.00013691044,0.00032968525],"domain_scores_gemma":[0.9983713,0.000024043438,0.00039897033,0.00020152664,0.0005659445,0.00043820203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002516719,0.00013956912,0.00040494517,0.00013447797,0.00007767103,0.000030093697,0.00029913042,0.000027667451,0.00011857067],"category_scores_gemma":[0.0000073530005,0.00012278618,0.00019081497,0.00044671443,0.00018574813,0.00015336354,0.000025879257,0.00024209857,0.0000046828527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101952784,0.00040284422,0.35722008,0.00007048026,0.002166137,0.00008969918,0.005140945,0.03101313,0.001629366,0.15286373,0.220926,0.22837566],"study_design_scores_gemma":[0.0072362665,0.0014583474,0.010132823,0.0026311616,0.0019511108,0.00006890135,0.006085516,0.20455813,0.06880429,0.48780492,0.20604134,0.0032271924],"about_ca_topic_score_codex":0.010006356,"about_ca_topic_score_gemma":0.009794318,"teacher_disagreement_score":0.6135093,"about_ca_system_score_codex":0.00010152268,"about_ca_system_score_gemma":0.0010532946,"threshold_uncertainty_score":0.9965861},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.04442482537466764,"score_gpt":0.3184144351284185,"score_spread":0.27398960975375086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046360729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14149968,0.000020182773,0.85678613,0.00006923924,0.00002026797,0.00008273779,0.00001773365,0.000014329905,0.0014897165],"genre_scores_gemma":[0.9984767,0.000013074028,0.0012845102,0.000067516026,0.00008799674,0.000008206832,0.000020299278,0.000007749148,0.000033975917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990621,0.0004374336,0.00022858733,0.000054836317,0.00008120005,0.00013579655],"domain_scores_gemma":[0.9987296,0.000711885,0.00013434148,0.0003119287,0.00009031222,0.000021960117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009468681,0.00007541626,0.00018641105,0.00003875463,0.000107406464,0.000014978656,0.00018832016,0.000016771151,0.000049463848],"category_scores_gemma":[0.00003978727,0.000058654416,0.00004704123,0.0001580197,0.00007384752,0.00002393261,0.00006050293,0.00024451915,0.000002701126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029413428,0.0003672762,0.015116513,0.000024124125,0.00020336905,6.0133135e-7,0.0010921955,0.025129776,0.00034180895,0.12135892,0.016075848,0.8199954],"study_design_scores_gemma":[0.0008666093,0.00015960194,0.029529633,0.000050425104,0.00007238679,4.4770212e-7,0.00030072022,0.49178502,0.0043531507,0.46948972,0.0031577644,0.00023453649],"about_ca_topic_score_codex":0.0012928399,"about_ca_topic_score_gemma":0.00038559275,"teacher_disagreement_score":0.856977,"about_ca_system_score_codex":0.0000035074634,"about_ca_system_score_gemma":0.0000057991556,"threshold_uncertainty_score":0.23918577},"labels":[],"label_agreement":null},{"id":"W2046598510","doi":"10.1007/s11280-013-0204-x","title":"Mining most frequently changing component in evolving graphs","year":2013,"lang":"en","type":"article","venue":"World Wide Web","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Intuition; Component (thermodynamics); Graph; Data mining; Machine learning; Artificial intelligence; Theoretical computer science","score_opus":0.00964463561293763,"score_gpt":0.23155167089314238,"score_spread":0.22190703528020475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046598510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94991004,0.00020115585,0.0018301522,0.00051473425,0.000094791736,0.0003308577,0.0000031198647,0.00015828644,0.04695687],"genre_scores_gemma":[0.99478686,0.0000017670147,0.003769947,0.00017557557,0.00014041727,0.00010597511,0.00003235706,0.000025430234,0.0009616748],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987418,0.000052272688,0.00032156176,0.00027297033,0.00015230029,0.0004590635],"domain_scores_gemma":[0.9993355,0.0001285366,0.00011234509,0.00029986078,0.000046949724,0.00007676143],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018611748,0.00018000664,0.00026531436,0.00060487684,0.00011157292,0.000103837156,0.00022458137,0.000017131471,0.0021665343],"category_scores_gemma":[0.000004685612,0.0001870367,0.000115701114,0.0011109404,0.00003256344,0.00019661132,0.00013552004,0.00017641729,0.00007999842],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020034254,0.00009044631,0.9355883,0.0000060291286,0.00007086086,0.0000039442175,0.00036704625,0.00022350463,0.0041627227,0.02396165,0.022483446,0.013040022],"study_design_scores_gemma":[0.0028288024,0.00009525428,0.40898916,0.0017600894,0.00022921088,0.0000030272693,0.0038389221,0.34614196,0.0098425215,0.13355054,0.08930179,0.0034187317],"about_ca_topic_score_codex":0.0014133105,"about_ca_topic_score_gemma":0.00057298806,"teacher_disagreement_score":0.52659917,"about_ca_system_score_codex":0.00005301808,"about_ca_system_score_gemma":0.000020530708,"threshold_uncertainty_score":0.9987456},"labels":[],"label_agreement":null},{"id":"W2047824131","doi":"10.1109/cgc.2013.58","title":"Benefits and Limitations of the Social Network Analysis When Explaining Instances of Ineffective Communication in Two Chemical, Biological, Radiological, Nuclear, and Explosives Simulations","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Confounding; Radiological weapon; Explosive material; Computer science; Telecommunications network; Social network analysis; Communications system; Representation (politics); Network analysis; Computer security; Statistics; Medicine; Telecommunications; Engineering; Social media; Mathematics; Chemistry","score_opus":0.052658762666453904,"score_gpt":0.29124274561603813,"score_spread":0.23858398294958422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047824131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9978381,0.00021961826,0.0007129238,0.00013859659,0.0000025228705,0.00023333152,0.000006865206,0.000015061438,0.0008329729],"genre_scores_gemma":[0.99422085,0.0000858844,0.0055849166,0.000020080372,0.000021086076,0.000038870166,0.000022702354,0.000004169605,0.0000014279091],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991755,0.00019333264,0.00030785394,0.00015349744,0.00006050302,0.000109300185],"domain_scores_gemma":[0.99842286,0.0010686775,0.00022071193,0.00017692278,0.000090320624,0.000020529053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012389489,0.0000962011,0.00033194362,0.00007553998,0.00016486719,0.000024785802,0.0001562211,0.00003166782,0.00007149187],"category_scores_gemma":[0.000032465432,0.00006547283,0.00009210079,0.00059138314,0.00030403218,0.00011828992,0.00015013697,0.00010309151,1.6077863e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015329531,0.00020624809,0.79792637,0.000004945693,0.000670006,1.4000365e-8,0.0076408754,0.013604977,0.003962205,0.14008795,0.00019239755,0.035688683],"study_design_scores_gemma":[0.0008322697,0.0001146953,0.7662148,0.000099437915,0.0005162354,1.4667297e-7,0.012128564,0.076446,0.0007760849,0.14240983,0.000083419385,0.0003785357],"about_ca_topic_score_codex":0.0003399947,"about_ca_topic_score_gemma":0.00018644202,"teacher_disagreement_score":0.06284101,"about_ca_system_score_codex":0.000008126797,"about_ca_system_score_gemma":0.0000054032075,"threshold_uncertainty_score":0.26699045},"labels":[],"label_agreement":null},{"id":"W2048145627","doi":"10.1016/j.jcta.2009.05.001","title":"Avoider–Enforcer: The rules of the game","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hypergraph; Complete graph; Monotonic function; Set (abstract data type); Monotone polygon; Element (criminal law); Mathematical economics; Mathematics; Graph; Combinatorics; Computer science; Law","score_opus":0.005057344982118709,"score_gpt":0.23138600549454463,"score_spread":0.22632866051242592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048145627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95728046,0.0005854212,0.0034652182,0.00278769,0.0026955905,0.0003277215,0.000010665724,0.000030742314,0.03281652],"genre_scores_gemma":[0.9984004,0.000013940496,0.0001107064,0.000070290924,0.0010944314,0.0000012762307,5.9721833e-7,0.000008376614,0.000299968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986418,0.00028910566,0.00052795076,0.00006922462,0.00031454256,0.00015741368],"domain_scores_gemma":[0.9983692,0.00022230217,0.000765909,0.00036637654,0.00023560302,0.000040604264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009390174,0.000133484,0.00033622413,0.000045341545,0.00014260216,0.000053055814,0.00070540566,0.00003192706,0.00026454264],"category_scores_gemma":[0.000041943254,0.000068978785,0.00045579186,0.00019018719,0.00017064576,0.00018907567,0.00007726113,0.000325003,0.0000015107602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018162676,0.00007482503,0.0004358608,0.0000016354471,0.00012339707,6.015603e-7,0.0003327189,0.000051895968,0.00048425983,0.9897662,0.0020017466,0.006545243],"study_design_scores_gemma":[0.0003486361,0.00021768193,0.0011745162,0.000042002437,0.00010007625,0.000006869845,0.00031804136,0.000013422496,0.0065464643,0.96466357,0.026491756,0.000076952194],"about_ca_topic_score_codex":0.000008025836,"about_ca_topic_score_gemma":3.106613e-7,"teacher_disagreement_score":0.041119985,"about_ca_system_score_codex":0.000020771227,"about_ca_system_score_gemma":0.000080592814,"threshold_uncertainty_score":0.28965566},"labels":[],"label_agreement":null},{"id":"W2048197593","doi":"10.1016/j.stamet.2011.01.005","title":"Adjusting for network size and composition effects in exponential-family random graph models","year":2011,"lang":"en","type":"article","venue":"Statistical Methodology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":107,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Allergy and Infectious Diseases; Eunice Kennedy Shriver National Institute of Child Health and Human Development; National Institute on Drug Abuse; Office of Naval Research; Fundação para a Ciência e a Tecnologia; National Sanitarium Association; University of Washington; National Institutes of Health; National Science Foundation","keywords":"Homophily; Random graph; Exponential random graph models; Graph; Social network (sociolinguistics); Random walk; Offset (computer science); Network model; Composition (language)","score_opus":0.1131982019369454,"score_gpt":0.3437420514407053,"score_spread":0.2305438495037599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048197593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028327461,0.00012042041,0.9699776,0.000010634133,0.000102985505,0.00044894344,0.000022935754,0.000039279814,0.00094971823],"genre_scores_gemma":[0.49701557,0.0000027321878,0.50269735,0.000037079284,0.000102453465,0.00011005305,0.000021526654,0.000010012044,0.0000032215162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786216,0.0010663783,0.00033727355,0.00031470612,0.00006083833,0.00035861507],"domain_scores_gemma":[0.9891047,0.010550283,0.00009573321,0.00013461596,0.00004168583,0.00007297072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011436079,0.00015791434,0.00052835705,0.00006052503,0.000084911284,0.000012620358,0.000087926615,0.000058933172,0.00006805733],"category_scores_gemma":[0.00013145013,0.00014934182,0.00007480742,0.00013924371,0.00011987283,0.000053666077,0.00006768736,0.00014990139,9.0155817e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062694924,0.00008630409,0.0031233777,0.000047165722,0.00011249485,0.000005419782,0.00025968463,0.0006427204,0.0018162074,0.9446936,0.00033355108,0.048252482],"study_design_scores_gemma":[0.0012923055,0.00012052358,0.010844438,0.00003124637,0.00012626925,9.2276866e-7,0.00003140432,0.032802917,0.0003041205,0.95428073,0.00001120041,0.00015394182],"about_ca_topic_score_codex":0.0003409173,"about_ca_topic_score_gemma":0.000014783063,"teacher_disagreement_score":0.46868813,"about_ca_system_score_codex":0.0000092726605,"about_ca_system_score_gemma":0.000011112144,"threshold_uncertainty_score":0.6089983},"labels":[],"label_agreement":null},{"id":"W2050675408","doi":"10.1016/j.cor.2012.02.008","title":"Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Pairwise comparison; Simulated annealing; Heuristics; Algorithm; Population; Combinatorial optimization; Mathematical optimization; Graph; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.10095449481360119,"score_gpt":0.43985149621535835,"score_spread":0.33889700140175716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050675408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015808143,0.00006655341,0.9811695,0.0007979507,0.00030126338,0.0015293902,0.00002642629,0.000077642144,0.00022312225],"genre_scores_gemma":[0.8781515,8.923565e-7,0.11983087,0.000024896073,0.0014188857,0.00046872612,0.00006846829,0.000021251826,0.000014545128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734193,0.0005694352,0.00034547792,0.00037117815,0.00064987526,0.0007220767],"domain_scores_gemma":[0.997533,0.00086278195,0.000025217036,0.00045589334,0.0009802098,0.0001428538],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018487858,0.00016292263,0.00019521329,0.00017463237,0.0017384535,0.00056397176,0.0004039493,0.00006197841,0.000056225712],"category_scores_gemma":[0.00004253232,0.00013761768,0.00016129462,0.0012162067,0.00023837268,0.00036635905,0.00020985154,0.00034634984,0.00000951408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017424171,0.0014490201,0.020254724,0.0000805993,0.00039443807,0.000001210818,0.0010713098,0.55254066,0.002940258,0.298203,0.0034448325,0.119445704],"study_design_scores_gemma":[0.0005327396,0.00009235447,0.00041127886,0.000033726865,0.000047736816,0.0000016747929,0.00016221651,0.9892433,0.0022098003,0.006191227,0.00091642945,0.000157483],"about_ca_topic_score_codex":0.0020336069,"about_ca_topic_score_gemma":0.00006913426,"teacher_disagreement_score":0.8623433,"about_ca_system_score_codex":0.0002780811,"about_ca_system_score_gemma":0.00022977674,"threshold_uncertainty_score":0.99956113},"labels":[],"label_agreement":null},{"id":"W2050893034","doi":"10.1103/physrevlett.107.158702","title":"Structural Preferential Attachment: Network Organization beyond the Link","year":2011,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Canadian Institutes of Health Research","keywords":"Modularity (biology); Preferential attachment; Complex network; Computer science; Community structure; Self-organization; Link (geometry); Complex system; Simple (philosophy); Mechanism (biology); Perspective (graphical); Similarity (geometry); Network formation; Evolving networks; Independence (probability theory); Scale (ratio); Theoretical computer science; Artificial intelligence; Epistemology; Computer network; Mathematics; World Wide Web; Physics","score_opus":0.021374365046241423,"score_gpt":0.2778164551848938,"score_spread":0.2564420901386524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050893034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91348904,0.0045225904,0.050175004,0.015722925,0.0005972764,0.0024857968,0.000024564613,0.00052782905,0.0124549465],"genre_scores_gemma":[0.99360025,0.000098887904,0.0003937562,0.0032693462,0.002469083,0.00003556215,0.00009557693,0.000024094621,0.000013462003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998959,0.00012071131,0.00023749433,0.0002374782,0.00018204974,0.00026324316],"domain_scores_gemma":[0.9992802,0.000044457425,0.000159669,0.00040876193,0.000053025877,0.000053893942],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010079942,0.00018649807,0.00029791286,0.000011855101,0.00016948587,0.000034495984,0.00035712,0.0000060284483,0.0010638135],"category_scores_gemma":[0.0000036818574,0.000121870115,0.00019438389,0.00042379645,0.00006369544,0.00010326117,0.00013005943,0.00019897234,0.00007977659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027284343,0.00026892222,0.15914038,0.00050193764,0.0016681447,0.0000036520123,0.0015913357,0.00091772777,0.0029115842,0.3205376,0.28059676,0.23183466],"study_design_scores_gemma":[0.0023014073,0.00043504618,0.2788028,0.0043150536,0.009322541,0.000010016814,0.00008848948,0.035689842,0.008840187,0.42292973,0.23118186,0.006082985],"about_ca_topic_score_codex":0.000038406266,"about_ca_topic_score_gemma":0.0000010343116,"teacher_disagreement_score":0.22575168,"about_ca_system_score_codex":0.000016261985,"about_ca_system_score_gemma":0.0000092147375,"threshold_uncertainty_score":0.9998494},"labels":[],"label_agreement":null},{"id":"W2051995667","doi":"10.1002/meet.2009.1450460218","title":"Author name disambiguation for collaboration network analysis and visualization","year":2009,"lang":"en","type":"article","venue":"Proceedings of the American Society for Information Science and Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Soundness; Context (archaeology); Graph; Information retrieval; Cluster analysis; Similarity (geometry); Visualization; Heuristic; Clustering coefficient; Data mining; Network analysis; Data science; Theoretical computer science; Artificial intelligence; Image (mathematics)","score_opus":0.007768434405943632,"score_gpt":0.30065506767197037,"score_spread":0.2928866332660267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051995667","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83743083,0.000015022919,0.15704805,0.004485471,0.000017420723,0.00069516443,0.00001811445,0.00008146824,0.00020844648],"genre_scores_gemma":[0.9824462,0.000007950076,0.017249396,0.00017460297,0.000028636192,0.0000669492,0.0000124439775,0.0000020747748,0.000011769021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992726,0.0000012543163,0.00024803285,0.00012973006,0.00017720753,0.0001711669],"domain_scores_gemma":[0.99812853,0.000025684974,0.0005978964,0.00007083918,0.001153083,0.000023955561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066582154,0.00007527506,0.00018609517,0.0002119338,0.00042535484,0.00011629437,0.00018410775,0.000025946709,6.8783737e-7],"category_scores_gemma":[0.00007730336,0.000060372127,0.000096851785,0.0055932454,0.00056915137,0.00093629636,0.000053805947,0.000037614653,6.0447526e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022548562,0.000026455235,0.058534477,0.000021591128,0.00017294833,3.5506867e-10,0.0013118052,0.0000947925,0.0060821474,0.69207317,0.0044362335,0.23722386],"study_design_scores_gemma":[0.00086414657,0.00086330314,0.059774816,0.00004403102,0.0013615703,8.637342e-7,0.020982284,0.5792271,0.032421876,0.2790307,0.024854,0.00057530793],"about_ca_topic_score_codex":0.000009550063,"about_ca_topic_score_gemma":7.852161e-7,"teacher_disagreement_score":0.5791323,"about_ca_system_score_codex":0.000031642463,"about_ca_system_score_gemma":0.00004611802,"threshold_uncertainty_score":0.32715285},"labels":[],"label_agreement":null},{"id":"W2052378529","doi":"10.1145/2492517.2492568","title":"Graph-based Sybil detection in social and information systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Networks of Centres of Excellence of Canada; Natural Sciences and Engineering Research Council of Canada; Institute for Computing, Information and Cognitive Systems","keywords":"Sybil attack; Computer science; Graph; Adversary; Theoretical computer science; Bridge (graph theory); Data mining; Wireless sensor network; Computer security; Computer network","score_opus":0.007068083627072033,"score_gpt":0.22294795179868,"score_spread":0.21587986817160795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052378529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7806181,0.000008012388,0.1981936,0.00008520476,0.000031092208,0.00034605825,0.0000015302378,0.000097955744,0.020618502],"genre_scores_gemma":[0.99965066,2.3288003e-7,0.00015039119,0.00002147306,0.000061790364,0.00007925284,0.000010476075,0.0000022232718,0.0000234934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966156,0.00002021627,0.00013698642,0.000050134586,0.000053023894,0.000078060875],"domain_scores_gemma":[0.99984336,0.00001309468,0.00004496321,0.000048870766,0.000034378958,0.000015337433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006342459,0.00004972251,0.00007708731,0.000112475274,0.00005228424,0.00008072216,0.00002808426,0.000017942539,0.00009379013],"category_scores_gemma":[5.85607e-7,0.0000446622,0.000026349184,0.00016877169,0.000011716824,0.0003880742,0.000010851562,0.000045930996,0.00001520943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017131299,0.00014100129,0.28310037,0.00007106943,0.000098598255,1.4277174e-7,0.0005029991,0.0015324445,0.0021410517,0.19635457,0.0068806875,0.5091599],"study_design_scores_gemma":[0.001423459,0.0000937107,0.26131374,0.00004402261,0.000049424274,4.323493e-7,0.0015714985,0.6893757,0.0052143564,0.027569165,0.012690951,0.00065355323],"about_ca_topic_score_codex":0.0033510427,"about_ca_topic_score_gemma":0.000037789523,"teacher_disagreement_score":0.68784326,"about_ca_system_score_codex":0.000011771642,"about_ca_system_score_gemma":0.000005306464,"threshold_uncertainty_score":0.50657964},"labels":[],"label_agreement":null},{"id":"W2052898451","doi":"10.1073/pnas.0707563105","title":"Optimal partition and effective dynamics of complex networks","year":2008,"lang":"en","type":"article","venue":"Proceedings of the National Academy of Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China; Centre de Recherches Mathématiques; Princeton University; National Science Foundation","keywords":"Partition (number theory); Markov chain; Complex network; Computer science; Network dynamics; Network partition; Theoretical computer science; Mathematical optimization; Mathematics; Distributed computing; Machine learning; Combinatorics","score_opus":0.02792713820187399,"score_gpt":0.2940923244205852,"score_spread":0.2661651862187112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052898451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99454427,0.000025852418,0.00036671973,0.00028619368,0.0000032190678,0.00013704016,0.000010249629,0.000006625185,0.0046198615],"genre_scores_gemma":[0.9970241,0.000007682451,0.0028702305,0.000016310922,0.000053759934,0.000008299702,5.792117e-7,0.000001973071,0.000017023454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99921334,0.0000057257907,0.00020761594,0.00012477815,0.000365431,0.00008310219],"domain_scores_gemma":[0.99936813,0.00008934275,0.00034272094,0.000005250775,0.0001781595,0.000016413833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041260693,0.000060168873,0.00014675703,0.00007080514,0.00014181221,0.0000061428664,0.00025026323,0.000024387637,0.000015722853],"category_scores_gemma":[0.00001833378,0.000043657907,0.00006410834,0.00043599814,0.00083081896,0.00016596021,0.000101962156,0.00008417743,7.56953e-8],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002568928,0.00013293535,0.4009316,0.000036022608,0.00009361339,2.8130984e-9,0.00024450428,0.009163439,0.021659674,0.5625305,0.0014256103,0.0037563937],"study_design_scores_gemma":[0.00018431197,0.00008065592,0.49948618,0.0000755237,0.000035465197,0.0000029017135,0.0001481055,0.35847774,0.03814536,0.10320264,0.00004805422,0.00011304501],"about_ca_topic_score_codex":0.000013102669,"about_ca_topic_score_gemma":5.1124456e-8,"teacher_disagreement_score":0.45932788,"about_ca_system_score_codex":0.000012454846,"about_ca_system_score_gemma":0.000007692242,"threshold_uncertainty_score":0.3061187},"labels":[],"label_agreement":null},{"id":"W2053553533","doi":"10.1145/1286240.1286291","title":"Identifying subcommunities using cohesive subgroups in social hypertext","year":2007,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Hyperlink; Hypertext; World Wide Web; Computer science; Sense of community; The Internet; Group (periodic table); Connection (principal bundle); Social network (sociolinguistics); Web page; Psychology; Social media; Mathematics; Social psychology","score_opus":0.061314793449726734,"score_gpt":0.33694825751239815,"score_spread":0.2756334640626714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053553533","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87346137,0.000032182812,0.08738429,0.000021284364,0.00002677366,0.00007899585,0.0000012888069,0.000059364946,0.03893448],"genre_scores_gemma":[0.99551153,7.701712e-7,0.003881929,0.00004321968,0.0002880601,0.000003491622,0.000014071512,0.0000143995385,0.00024250745],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991635,0.000049880837,0.0002595895,0.00012320315,0.000116819814,0.0002869914],"domain_scores_gemma":[0.9996196,0.0000915774,0.000070349335,0.00014809617,0.000042425178,0.000027931841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003680324,0.00011393487,0.00020061826,0.00017835047,0.00021214531,0.00005902602,0.00017744453,0.000029548119,0.00064785755],"category_scores_gemma":[0.000001288913,0.00011809997,0.0001078037,0.00032736058,0.000050097526,0.00013803838,0.00011184945,0.00017202286,0.000010474479],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030420073,0.00026371502,0.6850589,0.00001282538,0.00016046096,0.000013336774,0.0038465164,0.000052790936,0.00830764,0.2595666,0.0014645634,0.04122224],"study_design_scores_gemma":[0.0029398545,0.00009345235,0.417019,0.0002501663,0.0003839088,0.000010013333,0.08964867,0.026421083,0.06636195,0.38558114,0.008158354,0.003132388],"about_ca_topic_score_codex":0.0031152773,"about_ca_topic_score_gemma":0.0006291954,"teacher_disagreement_score":0.26803985,"about_ca_system_score_codex":0.00005600421,"about_ca_system_score_gemma":0.000015504278,"threshold_uncertainty_score":0.7093586},"labels":[],"label_agreement":null},{"id":"W2053572557","doi":"10.1145/2063576.2063952","title":"Suggesting ghost edges for a smaller world","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dissemination; Computer science; Small-world network; Shortest path problem; Path (computing); Network topology; Range (aeronautics); Enhanced Data Rates for GSM Evolution; Topology (electrical circuits); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Complex network; Combinatorics; Computer network; Graph; World Wide Web; Telecommunications; Engineering","score_opus":0.07794235720448614,"score_gpt":0.2761322672529262,"score_spread":0.19818991004844008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053572557","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020851905,0.00002169337,0.37919828,0.00008545945,0.000049908638,0.00028126696,0.0000050473423,0.00023143535,0.599275],"genre_scores_gemma":[0.9384266,1.8079233e-7,0.05213581,0.000048935755,0.00026062815,0.00007577479,0.000011711858,0.000013834489,0.009026501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994623,0.000009526233,0.0001414622,0.00015735699,0.000043075393,0.00018627854],"domain_scores_gemma":[0.9996102,0.00006312472,0.00005049664,0.00018269688,0.000052966945,0.000040543237],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009666276,0.000091878916,0.00012780799,0.000064273045,0.00007437719,0.000020580368,0.00013168245,0.000009985228,0.0030425908],"category_scores_gemma":[0.00000246065,0.00007951651,0.00011780475,0.00014798602,0.000018407945,0.000048520935,0.000052344505,0.000049374372,0.000025448619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018595509,0.00017445904,0.21101095,0.000007691137,0.00017722533,4.2393518e-7,0.00028541157,0.0000034289194,0.00023956611,0.5878288,0.055444375,0.14480905],"study_design_scores_gemma":[0.0014852749,0.00025469533,0.05230253,0.00012936625,0.0004132751,9.802359e-7,0.00091793836,0.012560825,0.084206164,0.49766457,0.3482478,0.001816583],"about_ca_topic_score_codex":0.000338307,"about_ca_topic_score_gemma":0.00012268098,"teacher_disagreement_score":0.9175747,"about_ca_system_score_codex":0.0000059346557,"about_ca_system_score_gemma":0.000010192467,"threshold_uncertainty_score":0.9978688},"labels":[],"label_agreement":null},{"id":"W2053802590","doi":"10.1109/cgc.2012.64","title":"A Network-Flow Based Influence Propagation Model for Social Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Popularity; Computer science; Information flow; Social network (sociolinguistics); Network model; Path (computing); Noise (video); Distributed computing; Computer network; Social media; Artificial intelligence; World Wide Web","score_opus":0.02401787936328543,"score_gpt":0.27841378151460755,"score_spread":0.25439590215132213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053802590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067108027,0.00001933876,0.98983735,0.00011404947,0.00003104928,0.0003868911,0.000005088615,0.0001334827,0.002761952],"genre_scores_gemma":[0.9392628,1.5845586e-7,0.058339514,0.0002911018,0.0014808004,0.0002713724,0.000095011084,0.000020336745,0.00023889422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903333,0.000030168907,0.00021399687,0.00015906946,0.00010496046,0.00045845073],"domain_scores_gemma":[0.9995125,0.000057226884,0.00010443403,0.00015807567,0.000100532154,0.0000672095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029017212,0.0001407878,0.00017739265,0.000029107687,0.00022856217,0.000042437478,0.00012735666,0.000045400135,0.00010266533],"category_scores_gemma":[0.0000023429193,0.00013040056,0.00015071283,0.00019224842,0.000027498858,0.00021480536,0.000037964455,0.00009366861,0.000004369854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016971164,0.00007119634,0.02114307,0.000003373956,0.000029616043,1.0867271e-8,0.000053226104,0.9033562,0.000018458872,0.03793233,0.024398828,0.012976729],"study_design_scores_gemma":[0.00018021608,0.000009888412,0.0011097739,0.000005688935,0.00004918982,2.5695185e-8,0.0000058295723,0.98587185,0.000039999723,0.011835426,0.00072770525,0.00016440837],"about_ca_topic_score_codex":0.000021891954,"about_ca_topic_score_gemma":0.000005651605,"teacher_disagreement_score":0.932552,"about_ca_system_score_codex":0.00002543157,"about_ca_system_score_gemma":0.000031551728,"threshold_uncertainty_score":0.531758},"labels":[],"label_agreement":null},{"id":"W2053862682","doi":"10.1109/asonam.2012.67","title":"Learning the Strength of the Factors Influencing User Behavior in Online Social Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Correlation; Probabilistic logic; Social network (sociolinguistics); Social media; Social relationship; Artificial intelligence; Machine learning; World Wide Web; Psychology; Social psychology; Mathematics","score_opus":0.01687563459441678,"score_gpt":0.2793807382478803,"score_spread":0.2625051036534635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053862682","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9980536,0.000016921382,0.00086757884,0.000029947316,0.000032752858,0.000108597655,0.0000020657733,0.000021783339,0.00086675165],"genre_scores_gemma":[0.99941766,6.633062e-7,0.00009176312,0.000014365618,0.00026035958,0.0000102597705,0.00001130892,0.000010065362,0.00018354293],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992671,0.00010444297,0.00021227975,0.00007769427,0.000112752816,0.00022575355],"domain_scores_gemma":[0.9995853,0.00008967997,0.00012698476,0.00015366678,0.000024346855,0.000020059628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016164633,0.00009767545,0.00014404973,0.000027620132,0.00013665922,0.000015120899,0.0002152469,0.000029002336,0.00030500945],"category_scores_gemma":[0.0000037517825,0.00005259682,0.00014245404,0.00027171645,0.00004643671,0.00007934305,0.00014255563,0.00032997478,5.720133e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.3499824e-7,0.00008227535,0.99226964,4.318781e-7,0.000017182821,1.1710216e-8,0.00054418744,0.00059901574,0.00006113495,0.0017607618,0.00011507438,0.0045493706],"study_design_scores_gemma":[0.000063747975,0.000006642082,0.99435365,0.0000062860086,0.00004824371,3.0036407e-8,0.0023263234,0.0017015212,0.00044901657,0.000057746045,0.0009104151,0.0000763787],"about_ca_topic_score_codex":0.0011909915,"about_ca_topic_score_gemma":0.00021997852,"teacher_disagreement_score":0.004472992,"about_ca_system_score_codex":0.000019652298,"about_ca_system_score_gemma":0.000012269955,"threshold_uncertainty_score":0.33396396},"labels":[],"label_agreement":null},{"id":"W2055282689","doi":"10.1109/asonam.2014.6921534","title":"Welcome from the ASONAM 2014 program chairs","year":2014,"lang":"en","type":"article","venue":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Beijing; China; Library science; Tourism; Social network analysis; Political science; Social media; Media studies; Computer science; Sociology; Law","score_opus":0.01855538463337721,"score_gpt":0.3238136106587647,"score_spread":0.3052582260253875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055282689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34906992,0.00397647,0.49412608,0.009968245,0.0061258744,0.001986116,0.00045677865,0.0007753525,0.13351515],"genre_scores_gemma":[0.9900693,0.001005334,0.0031996833,0.00028684523,0.00432165,0.00018267598,0.0004344147,0.000034590048,0.00046546175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970362,0.0003272521,0.0006887342,0.00083458924,0.000575359,0.0005378417],"domain_scores_gemma":[0.9976595,0.00077773706,0.0006045313,0.0005822882,0.0002508767,0.00012506626],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008169516,0.00045408393,0.000793071,0.0001985184,0.00043872,0.0003704805,0.0011722996,0.00014421044,0.0018218071],"category_scores_gemma":[0.000042837317,0.0003693953,0.00046077612,0.00053710013,0.0002974697,0.0003074637,0.00026434465,0.0005454518,0.000047056394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011464538,0.00035924293,0.3876265,0.0000051374127,0.0017422435,0.0000022458842,0.0005540179,0.010528803,0.000018096534,0.10817608,0.051937893,0.43893507],"study_design_scores_gemma":[0.0010608622,0.00019099307,0.07453034,0.0001731341,0.00080596574,5.467581e-7,0.0011302634,0.7005178,0.000018683624,0.031086214,0.1894002,0.0010850402],"about_ca_topic_score_codex":0.0006723771,"about_ca_topic_score_gemma":0.0013507275,"teacher_disagreement_score":0.689989,"about_ca_system_score_codex":0.000069807495,"about_ca_system_score_gemma":0.00003707793,"threshold_uncertainty_score":0.9998758},"labels":[],"label_agreement":null},{"id":"W2056007251","doi":"10.1007/s13278-013-0132-x","title":"Communities validity: methodical evaluation of community mining algorithms","year":2013,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Cluster analysis; Data mining; Computer science; Context (archaeology); Set (abstract data type); Graph; Machine learning; Theoretical computer science","score_opus":0.10658509686447877,"score_gpt":0.36373138540013145,"score_spread":0.2571462885356527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056007251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9440397,0.00014822143,0.051042613,0.00006631516,0.000029964673,0.00015986894,0.0000071034456,0.000039354753,0.0044668727],"genre_scores_gemma":[0.9821806,0.000008278708,0.017008867,0.000043590084,0.00045606706,0.00006585289,0.00018639352,0.000015267093,0.00003509746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962696,0.0023144414,0.00052256085,0.00013421463,0.00044232534,0.0003168704],"domain_scores_gemma":[0.99810326,0.00068995537,0.0003916798,0.00031822128,0.00042269513,0.00007418874],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0039088656,0.0001988712,0.00073337747,0.00019821216,0.0010049825,0.00011034594,0.00024609567,0.000076813725,0.000919782],"category_scores_gemma":[0.000017940263,0.00019886572,0.0004072519,0.0012462664,0.0002199852,0.00014163421,0.00024340893,0.00030820502,0.0000013305595],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006058328,0.00015400346,0.43505105,0.00001119123,0.004046056,9.416435e-8,0.015709667,0.0030897374,0.000035870107,0.0023718125,0.0035111094,0.53601336],"study_design_scores_gemma":[0.0008565137,0.00011956483,0.26823378,0.0000720343,0.016391883,4.123005e-7,0.09320736,0.5744577,0.00011397468,0.045147475,0.0006053413,0.0007939779],"about_ca_topic_score_codex":0.0062010353,"about_ca_topic_score_gemma":0.0004983172,"teacher_disagreement_score":0.571368,"about_ca_system_score_codex":0.000027647218,"about_ca_system_score_gemma":0.0000389151,"threshold_uncertainty_score":0.9999935},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005080035300856293,"score_gpt":0.22888739030898098,"score_spread":0.22380735500812468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056465001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9282103,0.000037589503,0.07125795,0.000065333195,0.000016282054,0.00009778904,0.00002389427,0.000063894084,0.0002269521],"genre_scores_gemma":[0.9978165,0.0000063955936,0.001527097,0.000076408,0.0001044327,0.0000032576872,0.0004338166,0.000007036921,0.000025056997],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994886,0.0000088476745,0.00016294072,0.00013799292,0.00006835434,0.00013328873],"domain_scores_gemma":[0.9997665,0.000009696228,0.00007220562,0.00008929919,0.000024845698,0.000037423008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000034485813,0.000096542,0.00012844276,0.00004346985,0.000059350856,0.000030451632,0.000044855056,0.000018120554,0.00011669525],"category_scores_gemma":[1.9654664e-7,0.000092457645,0.000042839227,0.0001372965,0.00001001978,0.00017124836,8.994368e-7,0.00008069699,5.2149204e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063670224,0.00008320141,0.4211201,0.000013949424,0.000155648,0.0000036510953,0.0018512197,0.0017554021,0.012908214,0.023306733,0.0004353853,0.53830284],"study_design_scores_gemma":[0.00022702156,0.000050350656,0.9597306,0.000016495145,0.00006710645,1.17771584e-7,0.000064827196,0.0044163736,0.0025478913,0.031824738,0.0008642289,0.0001902364],"about_ca_topic_score_codex":0.000048676407,"about_ca_topic_score_gemma":0.00005832751,"teacher_disagreement_score":0.5386105,"about_ca_system_score_codex":0.0000060665516,"about_ca_system_score_gemma":0.0000047887247,"threshold_uncertainty_score":0.37703133},"labels":[],"label_agreement":null},{"id":"W2056580848","doi":"10.1145/1995966.1995981","title":"Tags vs shelves","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Freie Universität Berlin; Korea Advanced Institute of Science and Technology; Universidad de Oviedo; University of Illinois at Urbana-Champaign; Syddansk Universitet; Universidade de São Paulo; Shanghai Jiao Tong University; Centre National de la Recherche Scientifique; Universität Potsdam; Orta Doğu Teknik Üniversitesi; Imperial College London; Dalhousie University; University of Galway; Slovenská technická univerzita v Bratislave; Vrije Universiteit Amsterdam; University of Warwick; Universiteit van Amsterdam; University of Southampton; University of Patras; University of Toronto; Universität Kassel; Carnegie Mellon University; Brown University; Arizona State University; University of Pittsburgh; Technische Universiteit Delft; Georgia Institute of Technology; KU Leuven; Aarhus Universitet; Università degli Studi di Padova; Sandia National Laboratories; Technische Universiteit Eindhoven; Technische Universität Darmstadt; Teesside University; University of Texas at Austin; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Université de Genève; Trinity College Dublin; Cisco Systems","keywords":"Computer science; Semantics (computer science); Task (project management); Support vector machine; Pragmatics; Information retrieval; Tag system; Artificial intelligence; Data science; World Wide Web","score_opus":0.025110322777831345,"score_gpt":0.23519203409977557,"score_spread":0.21008171132194423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056580848","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052553847,0.0000073000074,0.06772147,0.000039669892,0.000021919286,0.000052790314,0.0000011214852,0.0001534397,0.8794484],"genre_scores_gemma":[0.9846061,4.466361e-7,0.010743899,0.000052849577,0.00011200131,0.000009546372,0.0000044390204,0.0000063285834,0.0044644107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996423,0.0000100027355,0.00008795839,0.00010313652,0.00004560329,0.00011098061],"domain_scores_gemma":[0.9997327,0.000008048174,0.000023650085,0.00018486008,0.000018243529,0.000032506163],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000043142543,0.00006101131,0.0000856167,0.000027863176,0.00003278923,0.000011332899,0.00011559212,0.0000090044905,0.016415434],"category_scores_gemma":[3.3595265e-7,0.000050361217,0.0000746542,0.000083652856,0.000017746075,0.000050845676,0.000045721637,0.000040912582,0.00015492024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007646931,0.00012681837,0.23739827,0.0000013204342,0.00009811215,6.897078e-7,0.00027735336,8.2860004e-7,0.00022464337,0.6735595,0.047902834,0.04040202],"study_design_scores_gemma":[0.0005152021,0.00016512588,0.08967833,0.00002129278,0.00016168712,8.377551e-7,0.0005708025,0.0028146217,0.06320997,0.6095044,0.23241831,0.0009394328],"about_ca_topic_score_codex":0.00040127878,"about_ca_topic_score_gemma":0.000010860921,"teacher_disagreement_score":0.93205225,"about_ca_system_score_codex":0.0000028944503,"about_ca_system_score_gemma":0.000005504561,"threshold_uncertainty_score":0.9844837},"labels":[],"label_agreement":null},{"id":"W2056951373","doi":"10.1145/2487575.2487683","title":"Information cascade at group scale","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Popularity; Newspaper; Product (mathematics); Computer science; Group buying; Group (periodic table); Social network (sociolinguistics); Scale (ratio); Social group; Social media; Internet privacy; Advertising; World Wide Web; Psychology; Business; Social psychology; Mathematics; Geography","score_opus":0.004403346710670149,"score_gpt":0.21137623808083403,"score_spread":0.2069728913701639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056951373","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62934417,0.0000049017376,0.07987966,0.00019249751,0.000024549037,0.00019881732,0.000002917814,0.00015760459,0.2901949],"genre_scores_gemma":[0.9951431,4.2830163e-7,0.0027025128,0.00011311499,0.00008257361,0.00004489916,0.00007324804,0.0000032481112,0.0018368381],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996347,0.0000082314145,0.00012761938,0.000046862384,0.00007016205,0.00011243699],"domain_scores_gemma":[0.99973446,0.00001061627,0.00003965471,0.00014719159,0.000030219802,0.00003786747],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000033896224,0.00005839677,0.000070320326,0.00003373769,0.00006108786,0.00005084497,0.000076465025,0.000013149448,0.010498972],"category_scores_gemma":[3.431744e-7,0.000048194634,0.00004548519,0.00008815627,0.000012140685,0.00041494434,0.000072643634,0.000038228365,0.0015261291],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030017295,0.00006806812,0.117471784,0.0000067912893,0.00007718613,4.8067083e-8,0.0004224146,0.00003787172,0.002268603,0.069279954,0.5357593,0.27460495],"study_design_scores_gemma":[0.0008112434,0.000108240485,0.15730266,0.000023633072,0.000115847106,0.0000021177918,0.0011119924,0.0490448,0.030108538,0.080954984,0.6793829,0.0010330097],"about_ca_topic_score_codex":0.0011622792,"about_ca_topic_score_gemma":0.00002562928,"teacher_disagreement_score":0.36579898,"about_ca_system_score_codex":0.000017850498,"about_ca_system_score_gemma":0.000002473638,"threshold_uncertainty_score":0.9992513},"labels":[],"label_agreement":null},{"id":"W2057348139","doi":"10.1016/j.ipm.2013.07.004","title":"An empirical investigation of Web session workloads: Can self-similarity be explained by deterministic chaos?","year":2013,"lang":"en","type":"article","venue":"Information Processing & Management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Session (web analytics); Computer science; Similarity (geometry); CHAOS (operating system); Self-similarity; Information retrieval; Empirical research; Data mining; World Wide Web; Artificial intelligence; Statistics; Mathematics","score_opus":0.01252282015519443,"score_gpt":0.27609306686692237,"score_spread":0.2635702467117279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057348139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8810711,0.000021290893,0.10503476,0.0012472143,0.00006337004,0.0010651193,0.000026091398,0.0005099773,0.010961053],"genre_scores_gemma":[0.989122,0.0000027249728,0.009769435,0.00045333416,0.000040439976,0.00017269916,0.0003880588,0.000009604298,0.000041758234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986882,0.00005278671,0.00057922397,0.00015591441,0.0003177344,0.000206127],"domain_scores_gemma":[0.9989864,0.000015388852,0.00044893054,0.0002716289,0.00017941419,0.000098189375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002333235,0.00017226371,0.00019334738,0.00018273786,0.00018399883,0.00025456506,0.00023614583,0.00004250702,0.00016919426],"category_scores_gemma":[0.0000030224016,0.00016244904,0.000051346604,0.00039298032,0.00004453635,0.0015632464,0.00008859049,0.00010654639,0.000011724623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026329495,0.00042903598,0.09233819,0.0008569767,0.00023243892,6.6569254e-7,0.010542686,0.00075219723,0.0009109111,0.0020212904,0.05325731,0.838632],"study_design_scores_gemma":[0.0018100676,0.00023276915,0.053040374,0.000718046,0.0004336572,0.000001172984,0.007460277,0.8799985,0.0068237833,0.024366478,0.023806186,0.001308711],"about_ca_topic_score_codex":0.00005482432,"about_ca_topic_score_gemma":0.000003202027,"teacher_disagreement_score":0.8792463,"about_ca_system_score_codex":0.00005756883,"about_ca_system_score_gemma":0.000046937315,"threshold_uncertainty_score":0.662448},"labels":[],"label_agreement":null},{"id":"W2057678386","doi":"10.3934/nhm.2015.10.1","title":"Transferability of collective transportation line networks from a topological and passenger demand perspective","year":2015,"lang":"en","type":"article","venue":"Networks and Heterogeneous Media","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Junta de Andalucía; Ministerio de Economía y Competitividad","keywords":"Transferability; Linearization; Perspective (graphical); Computer science; Line (geometry); Complex network; Topology (electrical circuits); Mathematics; Physics; Artificial intelligence; Combinatorics; Machine learning; Geometry; Nonlinear system","score_opus":0.022151957450402545,"score_gpt":0.26091428889678214,"score_spread":0.2387623314463796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057678386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8569198,0.0026371537,0.13982521,0.00007118934,0.00006591955,0.00024199983,0.000042557967,0.00003604511,0.00016009828],"genre_scores_gemma":[0.9984374,0.00016323078,0.00069628353,0.000031955802,0.00052151794,0.00003293174,0.00009417697,0.000015438574,0.000007068785],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878806,0.000108535016,0.00033280146,0.00039543415,0.00014018622,0.0002349727],"domain_scores_gemma":[0.9991087,0.00024855928,0.00009647606,0.00016531178,0.00017725548,0.00020373806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020764246,0.00020876242,0.00049410586,0.000040525614,0.000080002406,0.000028158494,0.000078046134,0.00011985796,0.00008294341],"category_scores_gemma":[0.0000066987895,0.00018045482,0.0001096149,0.00016717713,0.0002042389,0.000053512762,0.000019138371,0.00021280591,1.8158207e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012492181,0.00081199047,0.80551547,0.000017017528,0.0013881786,0.000029586108,0.013902465,0.12537707,0.0001601528,0.010363066,0.0006945081,0.040491268],"study_design_scores_gemma":[0.003798128,0.0011873655,0.17840537,0.00011161445,0.0011232055,0.0000075630305,0.003397461,0.6555674,0.0011769115,0.15367368,0.00041182278,0.0011394632],"about_ca_topic_score_codex":0.0007081538,"about_ca_topic_score_gemma":0.00082523143,"teacher_disagreement_score":0.6271101,"about_ca_system_score_codex":0.000035922294,"about_ca_system_score_gemma":0.000034332938,"threshold_uncertainty_score":0.7358734},"labels":[],"label_agreement":null},{"id":"W2059041870","doi":"10.1109/bdcloud.2014.110","title":"Discovery of Really Popular Friends from Social Networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Social media; Social computing; World Wide Web; Set (abstract data type); Data science; Social network (sociolinguistics); Social media optimization; Internet privacy","score_opus":0.007019247668729954,"score_gpt":0.23993378502622034,"score_spread":0.23291453735749038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059041870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17912953,0.000012464144,0.7714378,0.000063778105,0.000038027618,0.000043527325,0.000011238289,0.00005395144,0.04920965],"genre_scores_gemma":[0.99607486,8.342961e-7,0.0023314976,0.000037802805,0.00090065406,0.000006002817,0.000137662,0.000012440951,0.0004982746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992768,0.00005120692,0.00022970336,0.00017265302,0.00011333495,0.00015626565],"domain_scores_gemma":[0.99955463,0.00003943403,0.000115659095,0.0002344927,0.000032498087,0.000023292434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010612172,0.00010424558,0.00024897838,0.000030207802,0.00006182384,0.000034643715,0.00017759456,0.000033104574,0.00037913356],"category_scores_gemma":[0.0000011647753,0.00009247383,0.00017837744,0.00012917828,0.000036466583,0.00009893213,0.000088301706,0.00008797876,0.000003918598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022684759,0.00016680836,0.186785,0.0000024994765,0.00037900213,2.6995414e-7,0.00014518478,0.0007015924,0.0008406699,0.73078775,0.022656936,0.057511628],"study_design_scores_gemma":[0.0014135952,0.00020209761,0.1465237,0.00006808657,0.00076581736,1.6445242e-7,0.00049662637,0.23552808,0.0077814255,0.56347775,0.042315647,0.0014270084],"about_ca_topic_score_codex":0.0018353465,"about_ca_topic_score_gemma":0.00005530013,"teacher_disagreement_score":0.8169453,"about_ca_system_score_codex":0.0000072090934,"about_ca_system_score_gemma":0.000007997773,"threshold_uncertainty_score":0.41512468},"labels":[],"label_agreement":null},{"id":"W2059645366","doi":"10.1007/s13278-012-0071-y","title":"Managing node disappearance based on information flow in 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":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Node (physics); Computer science; Exploit; Information flow; Quality (philosophy); Social network (sociolinguistics); Flow (mathematics); Flow network; Computer network; Restructuring; Distributed computing; Data mining; Computer security; World Wide Web; Mathematics; Mathematical optimization","score_opus":0.008356677030947312,"score_gpt":0.25317414373930003,"score_spread":0.24481746670835272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059645366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13689521,0.00025679768,0.83945084,0.00055455865,0.00016334972,0.00025823206,0.000012918675,0.00013797331,0.022270117],"genre_scores_gemma":[0.9946816,0.0000070935866,0.002483073,0.00030422426,0.002261724,0.000033363016,0.00019104083,0.000014512233,0.00002337364],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984096,0.00013862934,0.00041870607,0.0001999748,0.00021353505,0.00061953295],"domain_scores_gemma":[0.9994351,0.00008578958,0.00023532688,0.00013242137,0.00003553692,0.000075828124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006736011,0.00022132494,0.00049429707,0.0002786179,0.00060576986,0.00012135228,0.00012273742,0.000078971614,0.00011047857],"category_scores_gemma":[0.0000030877563,0.0002316491,0.00032470727,0.0019070209,0.000054758206,0.00033284392,0.00006826762,0.00023920732,0.0000037711409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032130854,0.00006102471,0.5663887,0.000005713698,0.00041812868,3.134247e-7,0.0013575857,0.23667376,4.2511158e-7,0.0045754844,0.0019660257,0.18852071],"study_design_scores_gemma":[0.0003030043,0.000008691429,0.11748424,0.000025639598,0.0005229793,2.9349343e-8,0.0005313329,0.87765175,0.000001057502,0.00077145983,0.0024019878,0.00029783047],"about_ca_topic_score_codex":0.00012281955,"about_ca_topic_score_gemma":0.000054588465,"teacher_disagreement_score":0.85778636,"about_ca_system_score_codex":0.000046149224,"about_ca_system_score_gemma":0.000011743901,"threshold_uncertainty_score":0.9446376},"labels":[],"label_agreement":null},{"id":"W2059883798","doi":"10.1080/15427951.2011.604289","title":"NAViGaTOR: Large Scalable and Interactive Navigation and Analysis of Large Graphs","year":2011,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Ontario Institute for Cancer Research","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Visualization; Computer science; Workflow; Graph drawing; Scalability; Graphical user interface; Data visualization; Graph Layout; Variety (cybernetics); Memory footprint; Interactive visualization; Data mining; Database; Programming language; Artificial intelligence","score_opus":0.014881715529797473,"score_gpt":0.2781225979841873,"score_spread":0.2632408824543898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059883798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8914179,0.00004770668,0.10471294,0.0000036561926,0.000013428596,0.00010267856,0.000058592133,0.000030171945,0.003612884],"genre_scores_gemma":[0.9908721,0.0000041923804,0.008845278,0.00001008907,0.000010778804,0.000013137005,0.0000585378,0.00001234552,0.00017352853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991878,0.000029421948,0.00033500564,0.00018370753,0.00010526556,0.00015876365],"domain_scores_gemma":[0.9993121,0.000076583616,0.00025357577,0.0002216436,0.000082430146,0.000053641845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022516516,0.0001353051,0.0003819211,0.00018091884,0.000028084653,0.000027146734,0.000112745554,0.000032166066,0.0005161034],"category_scores_gemma":[0.000005423367,0.00012208713,0.00012995527,0.00035157404,0.00005280663,0.000121742996,0.00015277724,0.00010337761,0.0000038396947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002609745,0.0014399993,0.43876883,0.0001344472,0.005403196,0.0000029160012,0.022675369,0.0000016840577,0.0005171234,0.52614486,0.0011940178,0.0036914772],"study_design_scores_gemma":[0.001592311,0.00043490197,0.045003545,0.0010509068,0.009147755,0.000008741807,0.009794952,0.5065194,0.042467445,0.38011032,0.0026030682,0.0012666888],"about_ca_topic_score_codex":0.00016548058,"about_ca_topic_score_gemma":0.000022080289,"teacher_disagreement_score":0.5065177,"about_ca_system_score_codex":0.000008865471,"about_ca_system_score_gemma":0.0000048217057,"threshold_uncertainty_score":0.5650971},"labels":[],"label_agreement":null},{"id":"W2060133255","doi":"10.1109/icnsc.2014.6819679","title":"Microblogging as a social sensing tool","year":2014,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Microblogging; Social media; Computer science; World Wide Web; The Internet; Data science","score_opus":0.006156950768038334,"score_gpt":0.2478389908333989,"score_spread":0.24168204006536056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060133255","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2919209,0.000003708611,0.34889367,0.00073505996,0.000028006767,0.00006837406,6.5628126e-7,0.00017067994,0.3581789],"genre_scores_gemma":[0.98966753,5.433377e-8,0.008101745,0.00017731829,0.00059978286,0.0000011245273,0.0000070436063,0.000009302895,0.0014360718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952203,0.000031264615,0.00010978245,0.00012820719,0.00005482651,0.00015387608],"domain_scores_gemma":[0.9997726,0.000039403698,0.000038606835,0.000108789725,0.000023006287,0.000017557508],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010427092,0.00007538755,0.00011897313,0.000032075986,0.00013403462,0.00004999668,0.00006446651,0.000014567291,0.0009919904],"category_scores_gemma":[0.000002018972,0.00007161734,0.000099079756,0.00008590047,0.000018147528,0.00003594792,0.00005365823,0.000064627755,0.000105539555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042798274,0.00003963155,0.01023027,0.0000034529605,0.00012893119,4.2336666e-7,0.00019935833,0.000016877133,0.018934045,0.57143736,0.027027292,0.3719781],"study_design_scores_gemma":[0.00071505347,0.00005347154,0.0029680943,0.00003725877,0.00020853546,0.0000034723896,0.00019426136,0.05861186,0.036631107,0.68209875,0.21744154,0.0010365892],"about_ca_topic_score_codex":0.00025788948,"about_ca_topic_score_gemma":0.000007174197,"teacher_disagreement_score":0.69774663,"about_ca_system_score_codex":0.000008468941,"about_ca_system_score_gemma":0.000007644201,"threshold_uncertainty_score":0.99992126},"labels":[],"label_agreement":null},{"id":"W2060648910","doi":"10.1103/physreve.84.066111","title":"Random sequential renormalization and agglomerative percolation in networks: Application to Erdös-Rényi and scale-free graphs","year":2011,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Random graph; Renormalization; Scaling; Renormalization group; Continuum percolation theory; Statistical physics; Percolation (cognitive psychology); Mathematics; Phase transition; Critical exponent; Combinatorics; Percolation theory; Percolation threshold; Discrete mathematics; Percolation critical exponents; Graph; Physics; Mathematical physics; Topology (electrical circuits); Quantum mechanics; Geometry","score_opus":0.013669734674542638,"score_gpt":0.28557032227168655,"score_spread":0.2719005875971439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060648910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33842736,0.0062324787,0.64485186,0.0004561058,0.000037160906,0.0031913703,0.000014572746,0.0001212562,0.0066678617],"genre_scores_gemma":[0.9970495,0.0011056764,0.0012514024,0.0001247954,0.00013126466,0.0002684345,0.000050524217,0.0000117668715,0.000006643239],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999089,0.0001190578,0.00025577017,0.0002850864,0.00010307449,0.00014801283],"domain_scores_gemma":[0.9994713,0.000043696982,0.000103792045,0.00024472215,0.00005820009,0.00007825513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002162759,0.00014382893,0.00034752852,0.00005825538,0.00006394082,0.000024107729,0.000101597594,0.000016434624,0.000036020927],"category_scores_gemma":[0.000009868509,0.00013051789,0.00006991552,0.00044665314,0.000038823822,0.00017138645,0.000102897866,0.000096961645,0.000003261575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002243523,0.0007710117,0.1537072,0.0005119049,0.00020068725,0.0000011803991,0.0028880343,0.00051329966,0.0024482158,0.2160557,0.0031009286,0.61957747],"study_design_scores_gemma":[0.0040482,0.00040883824,0.17436893,0.0032933333,0.001085166,0.0000031352004,0.0001409558,0.2961907,0.00166494,0.509289,0.007725835,0.0017809329],"about_ca_topic_score_codex":0.00020364329,"about_ca_topic_score_gemma":0.000064256776,"teacher_disagreement_score":0.65862215,"about_ca_system_score_codex":0.000014604955,"about_ca_system_score_gemma":0.0000068258673,"threshold_uncertainty_score":0.5322365},"labels":[],"label_agreement":null},{"id":"W2061678866","doi":"10.1007/s10618-013-0330-1","title":"What distinguish one from its peers in social networks?","year":2013,"lang":"en","type":"article","venue":"Data Mining and Knowledge Discovery","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Taiwan University; National Science Council; Intel Corporation","keywords":"Uniqueness; Identification (biology); Computer science; Task (project management); Vertex (graph theory); Group (periodic table); Social network (sociolinguistics); Social network analysis; Theoretical computer science; Data mining; Machine learning; Graph; Mathematics; World Wide Web; Social media; Engineering","score_opus":0.051955979837728185,"score_gpt":0.3072964131251066,"score_spread":0.2553404332873784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061678866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9866737,0.0022943176,0.0035608346,0.00014216785,0.00029976672,0.00019937701,0.00030059696,0.00006451887,0.0064647086],"genre_scores_gemma":[0.99354994,0.000054419037,0.0005198411,0.000023646375,0.0015505102,0.00002954363,0.0034662928,0.000020142274,0.00078564265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988128,0.000071186645,0.0002651097,0.00047102684,0.000088813256,0.00029108746],"domain_scores_gemma":[0.9992043,0.00017690747,0.000095629504,0.0004228862,0.000042875672,0.000057452267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018739027,0.00017480829,0.00030502892,0.00006443785,0.00015126268,0.0007793636,0.00040720796,0.00004527058,0.00020491678],"category_scores_gemma":[0.000018798382,0.00017820219,0.000047522895,0.00022048675,0.000059037236,0.0017401425,0.0006923609,0.00014960286,0.00002304052],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025526533,0.0005783297,0.22032194,0.00002734594,0.0003693913,0.0000036353126,0.004277977,0.000018753732,0.00015960766,0.0036094163,0.14455055,0.6260575],"study_design_scores_gemma":[0.0038861101,0.0001439781,0.33954415,0.0026345495,0.0008532021,0.0000012480374,0.046075907,0.53528696,0.00033054914,0.017882997,0.04950076,0.0038595647],"about_ca_topic_score_codex":0.00081094285,"about_ca_topic_score_gemma":0.00035804932,"teacher_disagreement_score":0.622198,"about_ca_system_score_codex":0.000016397502,"about_ca_system_score_gemma":0.000030197296,"threshold_uncertainty_score":0.7515421},"labels":[],"label_agreement":null},{"id":"W2063691329","doi":"10.1088/1367-2630/8/5/072","title":"Modelling weighted networks using connection count","year":2006,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Physics; Connection (principal bundle); Statistical physics; Geometry","score_opus":0.021568021577796987,"score_gpt":0.25638094395647326,"score_spread":0.23481292237867626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063691329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12618057,0.00013530644,0.87253356,0.000018592757,0.0001225468,0.000039569073,9.6182e-7,0.000015948992,0.00095294154],"genre_scores_gemma":[0.97488284,0.000005646389,0.01893779,0.000013376241,0.0060719936,3.405977e-7,0.000007518048,0.000019902598,0.00006059264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905425,0.00003465919,0.00041384177,0.000100725745,0.00021212452,0.00018437218],"domain_scores_gemma":[0.99902296,0.000041693413,0.0005255323,0.00012898099,0.00021974837,0.000061097955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013783731,0.00013427253,0.00027620108,0.000054368298,0.000099822704,0.00006360684,0.00013210463,0.000030323135,0.000073997726],"category_scores_gemma":[3.8898492e-7,0.0001256629,0.00023991044,0.0002756505,0.000018994666,0.00022608203,0.00002167218,0.000251897,0.0000016513678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012511746,0.000068751855,0.0021359152,0.0000012310949,0.00008037627,0.0000013759009,0.000016342805,0.96238947,0.00049274554,0.02236524,0.0027206845,0.009715332],"study_design_scores_gemma":[0.00027925867,0.000027990018,0.000025652547,0.000041868258,0.00012980573,0.0000036535316,0.00001791419,0.87956965,0.0017341076,0.11617778,0.0018712714,0.00012106729],"about_ca_topic_score_codex":0.000775159,"about_ca_topic_score_gemma":0.0000032019946,"teacher_disagreement_score":0.8535958,"about_ca_system_score_codex":0.000061217455,"about_ca_system_score_gemma":0.00007470955,"threshold_uncertainty_score":0.5124385},"labels":[],"label_agreement":null},{"id":"W2064051468","doi":"10.1016/j.jtbi.2013.01.006","title":"The importance of contact network topology for the success of vaccination strategies","year":2013,"lang":"en","type":"article","venue":"Journal of Theoretical Biology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network topology; Topology (electrical circuits); Transmission (telecommunications); Exponential growth; Epidemic model; Transmission rate; Computer science; Network model; Mathematics; Computer network; Medicine; Artificial intelligence; Telecommunications; Population","score_opus":0.00780926788641275,"score_gpt":0.30050359094393964,"score_spread":0.2926943230575269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064051468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.701401,0.0013952277,0.28696346,0.005560721,0.00035677612,0.000494072,0.000010952449,0.000007067719,0.003810733],"genre_scores_gemma":[0.99876916,0.000042162763,0.00077190675,0.000033245517,0.00035910629,0.0000119720535,0.0000020447824,0.00000434894,0.000006067726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990186,0.00015279085,0.00054768234,0.0000618694,0.000055056422,0.00016399767],"domain_scores_gemma":[0.9966057,0.0021728578,0.00068782095,0.00016583028,0.00034502315,0.000022793418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074142724,0.00007396114,0.00029680514,0.00002222831,0.00007551504,0.000016630398,0.00039178837,0.000043661526,0.00058598863],"category_scores_gemma":[0.000052682422,0.000034172208,0.00021121796,0.00008405172,0.000345192,0.000049638136,0.000047498655,0.00013467892,4.0541565e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006046833,0.000022208822,0.033218794,0.0000024801225,0.00017227983,4.4375035e-8,0.000016192567,0.000065592176,0.0006427272,0.9569019,0.0009691133,0.007928168],"study_design_scores_gemma":[0.00017998682,0.0003399618,0.011814103,0.000007576444,0.00007521454,0.0000015653875,0.00023318824,0.0013640813,0.0014368055,0.9837417,0.0007670704,0.000038759794],"about_ca_topic_score_codex":0.00002126635,"about_ca_topic_score_gemma":0.0000069313555,"teacher_disagreement_score":0.29736817,"about_ca_system_score_codex":0.0000073954384,"about_ca_system_score_gemma":0.000039526825,"threshold_uncertainty_score":0.64161646},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012110608450964828,"score_gpt":0.27587261390496126,"score_spread":0.2637620054539964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064796447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99320054,0.000045693043,0.000021456744,0.0008160216,0.000016730539,0.000106097934,0.0000048756447,0.000005323183,0.0057832473],"genre_scores_gemma":[0.999027,0.000004233074,0.0007440664,0.00002554656,0.00016051362,0.0000017908096,8.314346e-8,0.0000015500572,0.00003519341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932075,0.0000045181737,0.00017682322,0.00010148379,0.0003331968,0.00006323671],"domain_scores_gemma":[0.9993822,0.000104792765,0.00034442623,0.0000069548887,0.00015078759,0.000010827844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006029395,0.00005049852,0.00011424843,0.000049841576,0.0001348044,0.000014954012,0.00037656535,0.000029886514,0.00002898302],"category_scores_gemma":[0.000039278708,0.000026036447,0.000059936105,0.00042323067,0.0009966947,0.00013157027,0.000100646495,0.00017758254,2.7880013e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000120423,0.000016060645,0.04704353,0.000008982166,0.000031811654,9.5386275e-11,0.00011731304,0.00016474223,0.1804232,0.7674201,0.0007501201,0.0040120957],"study_design_scores_gemma":[0.0002250518,0.000013819433,0.10158891,0.000033468626,0.00004228824,0.0000010594372,0.0001052053,0.02205516,0.241221,0.63426536,0.00037466697,0.000074027776],"about_ca_topic_score_codex":0.000021272219,"about_ca_topic_score_gemma":2.4442744e-7,"teacher_disagreement_score":0.13315476,"about_ca_system_score_codex":0.0000023790797,"about_ca_system_score_gemma":0.000007351964,"threshold_uncertainty_score":0.3672363},"labels":[],"label_agreement":null},{"id":"W2065195810","doi":"10.1016/j.physa.2006.12.021","title":"The effect of weight on community structure of networks","year":2006,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Community structure; Modularity (biology); Matching (statistics); Weight function; Mathematics; Weighted network; Complex network; Redistribution (election); Network structure; Computer science; Combinatorics; Statistics; Theoretical computer science; Political science; Biology","score_opus":0.0048392852382918294,"score_gpt":0.2518430590534523,"score_spread":0.24700377381516045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065195810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039279457,0.00007476655,0.9584688,0.00006583365,0.000012931218,0.0005488619,0.0004636194,0.000022472415,0.0010632736],"genre_scores_gemma":[0.9990718,0.000006224283,0.0006151697,0.0000042821116,0.000100261015,0.00007460708,0.00010843992,0.000010396755,0.000008862439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992801,0.00012529497,0.00023613776,0.00011710353,0.00011225142,0.00012913554],"domain_scores_gemma":[0.9981112,0.0013137531,0.00015759037,0.00031917793,0.000065093,0.000033200504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011021381,0.00011631153,0.00023162847,0.000018346822,0.0002725935,0.000015345178,0.00018163935,0.000021968232,0.000022723492],"category_scores_gemma":[0.000006227262,0.00007825283,0.00005513716,0.00018440928,0.0000449239,0.00001598614,0.00006994164,0.00021097278,8.2696937e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012341688,0.00006992025,0.000059009315,0.000011377701,0.00003732291,1.1833094e-8,0.0000055113296,0.00016121188,0.002978919,0.9828907,0.0004151201,0.013358536],"study_design_scores_gemma":[0.00023675784,0.00031598407,0.00078542705,0.000019789033,0.00016122877,1.2227824e-7,0.000014658674,0.13426612,0.02207095,0.8401014,0.001887005,0.00014052872],"about_ca_topic_score_codex":0.00012810736,"about_ca_topic_score_gemma":0.000012768118,"teacher_disagreement_score":0.9597923,"about_ca_system_score_codex":0.0000058631044,"about_ca_system_score_gemma":0.0000063662887,"threshold_uncertainty_score":0.31910577},"labels":[],"label_agreement":null},{"id":"W2065228389","doi":"10.1109/ntms.2012.6208767","title":"A Study of Trojan Propagation in Online Social Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Malware; Trojan; Cluster analysis; Computer science; Clustering coefficient; Computer security; Confidentiality; Code (set theory); Theoretical computer science; Artificial intelligence","score_opus":0.025857941757812405,"score_gpt":0.3108142787139449,"score_spread":0.2849563369561325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065228389","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9747445,0.000007512962,0.021785913,0.00001657906,0.000013536624,0.00021173485,8.479046e-7,0.000021824153,0.0031975447],"genre_scores_gemma":[0.99909383,1.4229563e-7,0.00037646785,0.0000058740893,0.00040904633,0.000019997382,0.000021087326,0.0000058478895,0.00006770003],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99945945,0.000053469073,0.00020059032,0.00007176289,0.00007607551,0.00013864686],"domain_scores_gemma":[0.99978334,0.000013960029,0.000073950956,0.0000871969,0.000023623077,0.000017950568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013846582,0.00006070518,0.0001479644,0.000053692977,0.00002500055,0.000005192306,0.00006353176,0.00001383217,0.00017814088],"category_scores_gemma":[6.5945756e-7,0.00005302675,0.00004115434,0.00024243585,0.000009424256,0.00007087984,0.00003754446,0.00007378438,9.760545e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000694047,0.0021936868,0.9680391,9.312294e-7,0.00003716815,6.5372404e-8,0.0009563668,0.00034199032,0.00003295359,0.0061882786,0.00041963437,0.021782909],"study_design_scores_gemma":[0.0010427258,0.00017325244,0.9581223,0.00000992461,0.00008402726,9.270608e-8,0.007665615,0.030828603,0.0002514752,0.0012723359,0.00030704678,0.00024258262],"about_ca_topic_score_codex":0.00041242983,"about_ca_topic_score_gemma":0.00021107038,"teacher_disagreement_score":0.030486612,"about_ca_system_score_codex":0.000011343411,"about_ca_system_score_gemma":0.00000532247,"threshold_uncertainty_score":0.21623681},"labels":[],"label_agreement":null},{"id":"W2065303122","doi":"10.1371/journal.pone.0124978","title":"Immunization against the Spread of Rumors in Homogenous Networks","year":2015,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Rumor; Immunization; Computer science; Process (computing); Epidemic model; Statistics; Mathematics; Medicine; Environmental health; Political science; Public relations; Population; Immunology","score_opus":0.03788666062436423,"score_gpt":0.22938308584751643,"score_spread":0.1914964252231522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065303122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9843908,0.00021562696,0.0068576066,0.0000886891,0.000009816779,0.00019855505,0.0000029357152,0.000031614218,0.00820439],"genre_scores_gemma":[0.99884224,0.000013493806,0.00084469374,0.00002139701,0.00012406071,0.000020187563,0.000046782403,0.000011224839,0.00007594328],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938345,0.000064165455,0.00019597841,0.000088541776,0.00013886609,0.0001290225],"domain_scores_gemma":[0.9994413,0.00003907574,0.00010002324,0.00030727507,0.000084801606,0.00002752415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020224559,0.00007182441,0.00017717,0.000046920733,0.00003070679,0.000013633541,0.00019755268,0.000019022686,0.00003127193],"category_scores_gemma":[0.0000064591095,0.00005770921,0.00004081351,0.0003458231,0.000034669814,0.000042116022,0.00007408842,0.000111112015,0.0000049665487],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047994792,0.003998067,0.9129381,0.000019783154,0.00077166146,0.0000022257682,0.0020386674,0.032437645,0.003638512,0.012930544,0.001465856,0.029710915],"study_design_scores_gemma":[0.0025774252,0.00045811126,0.059607666,0.0010011595,0.0008657316,5.5793447e-7,0.0025628817,0.8233955,0.063260294,0.04382789,0.0011707722,0.0012720414],"about_ca_topic_score_codex":0.00033348706,"about_ca_topic_score_gemma":0.000042535306,"teacher_disagreement_score":0.85333043,"about_ca_system_score_codex":0.00002036978,"about_ca_system_score_gemma":0.000022093885,"threshold_uncertainty_score":0.23533133},"labels":[],"label_agreement":null},{"id":"W2065887199","doi":"10.1016/j.tcs.2010.06.009","title":"The surviving rate of an infected network","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Integer (computer science); Discrete mathematics; Physics; Computer science; Graph; Operating system","score_opus":0.004482338258743271,"score_gpt":0.2509630541180462,"score_spread":0.24648071585930292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065887199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60480076,0.000001690982,0.39155805,0.000062530686,0.0001798714,0.000062742525,5.4685034e-7,0.000045615358,0.0032881664],"genre_scores_gemma":[0.97986716,2.461843e-7,0.01965235,0.00002791567,0.00043912322,0.0000032733235,0.000001221559,0.000005322543,0.0000034081252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998944,0.00012597333,0.00019326311,0.00022930885,0.00017542453,0.00033206373],"domain_scores_gemma":[0.9986325,0.00046093247,0.00007729592,0.0005709689,0.0001561639,0.00010217191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022360375,0.00009102992,0.00013361622,0.00003168852,0.00045877698,0.00015976906,0.0008993836,0.000015565276,0.00014410944],"category_scores_gemma":[0.000019222409,0.00005870525,0.000055952478,0.000689997,0.0024070246,0.00013169764,0.00035420453,0.00021901868,0.000004978478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002904403,0.000021332467,0.0029856963,3.3966742e-7,0.0000048726315,1.2662363e-7,0.000027624052,0.00023864814,0.001670298,0.9579605,0.000026006479,0.03706165],"study_design_scores_gemma":[0.000049660415,0.000051057057,0.010621248,0.000006154723,0.000007918678,5.1723504e-7,0.0000030311528,0.40547332,0.004176367,0.5793067,0.00020755365,0.00009643096],"about_ca_topic_score_codex":0.000025228133,"about_ca_topic_score_gemma":0.000011024177,"teacher_disagreement_score":0.4052347,"about_ca_system_score_codex":0.0000038015119,"about_ca_system_score_gemma":0.000044231674,"threshold_uncertainty_score":0.88687825},"labels":[],"label_agreement":null},{"id":"W2067351853","doi":"10.1139/f08-104","title":"Network models for ecosystem-based fishery analysis: a review of concepts and application to the Gulf of Alaska marine food web","year":2008,"lang":"en","type":"review","venue":"Canadian Journal of Fisheries and Aquatic Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Santa Fe Institute","keywords":"Food web; Fishing; Ecosystem; Fisheries management; Marine ecosystem; Fishery; Apex predator; Food chain; Network analysis; Ecosystem-based management; Environmental resource management; Ecology; Geography; Environmental science; Biology; Engineering","score_opus":0.03365282757278386,"score_gpt":0.2868200368315277,"score_spread":0.2531672092587438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067351853","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018083394,0.97711754,0.02113268,0.00042689237,0.00004021963,0.000737851,0.00011405932,0.0000018571104,0.00024809624],"genre_scores_gemma":[0.03672621,0.95872396,0.004000088,0.00015339178,0.00023719588,0.0000995339,0.00003072539,0.000013861407,0.000015013112],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981597,0.00013713277,0.0010479091,0.00021475842,0.00021404862,0.00022644435],"domain_scores_gemma":[0.9975937,0.00040117392,0.0013909356,0.00024358611,0.00015893199,0.00021166775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008822876,0.00020925426,0.0016150986,0.00026993913,0.00021112445,0.00006417414,0.00047843688,0.00004191299,0.000040543033],"category_scores_gemma":[0.000036698744,0.000134393,0.0004893058,0.0013572368,0.0002931079,0.00010133704,0.00003083104,0.00010068094,9.045715e-8],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037338953,0.000015664795,0.0032921096,0.0064555393,0.001137498,6.6678496e-7,0.00011795787,0.0013299147,4.1034355e-8,0.0016700134,0.012000992,0.9739759],"study_design_scores_gemma":[0.00014547225,0.00047531133,0.000038527487,0.023250666,0.0041686734,0.000011483707,0.00018787131,0.018031642,5.407825e-7,0.0035790715,0.94977987,0.00033086617],"about_ca_topic_score_codex":0.00090539834,"about_ca_topic_score_gemma":0.009741283,"teacher_disagreement_score":0.97364503,"about_ca_system_score_codex":0.000033376593,"about_ca_system_score_gemma":0.0013253324,"threshold_uncertainty_score":0.5480388},"labels":[],"label_agreement":null},{"id":"W2067656157","doi":"10.1007/s10844-012-0227-2","title":"Folksonomy link prediction based on a tripartite graph for tag recommendation","year":2012,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Folksonomy; Link (geometry); Graph; Information retrieval; World Wide Web; Data mining; Database; Computer network; Theoretical computer science","score_opus":0.02655069947119669,"score_gpt":0.2834824826696471,"score_spread":0.2569317831984504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067656157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033981556,0.000029605648,0.9907726,0.00016545583,0.0009380233,0.0004565596,0.000043497286,0.000026698255,0.004169415],"genre_scores_gemma":[0.9966033,0.0000054028806,0.0016097843,0.00008973164,0.0013909477,0.00006804304,0.00018854355,0.000007989756,0.0000362351],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832654,0.0000675318,0.001152521,0.000045962977,0.00022362378,0.00018381511],"domain_scores_gemma":[0.9978743,0.00014099186,0.0012843275,0.000129534,0.00046614965,0.00010468161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012709271,0.00012432593,0.0002444424,0.00044750416,0.000091864655,0.00011891978,0.0001150613,0.000044730696,0.00011358645],"category_scores_gemma":[0.00001743393,0.00010319486,0.0002803073,0.00022032161,0.000008938285,0.0012892928,0.000009323473,0.00014413,0.000027675092],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094419677,0.0008608578,0.07290372,0.00029320148,0.0010781575,1.3947641e-7,0.0036814902,0.099003986,0.00013189188,0.05566921,0.15454157,0.6108916],"study_design_scores_gemma":[0.0006947593,0.0003758822,0.0003533004,0.0002015027,0.00011383923,0.0000036344518,0.0011276624,0.1700567,0.002242454,0.00037026824,0.8242848,0.00017523565],"about_ca_topic_score_codex":0.000014630975,"about_ca_topic_score_gemma":1.6932843e-7,"teacher_disagreement_score":0.9932052,"about_ca_system_score_codex":0.00010807566,"about_ca_system_score_gemma":0.000039701812,"threshold_uncertainty_score":0.42081642},"labels":[],"label_agreement":null},{"id":"W2069308324","doi":"10.1190/tle29111354.1","title":"Collaboration and trends in Geophysics","year":2010,"lang":"en","type":"article","venue":"The Leading Edge","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ConocoPhillips (Canada)","funders":"","keywords":"Geek; Genius; Graph; Euler's formula; Graph theory; Mathematics; Computer science; Art history; Combinatorics; History; Artificial intelligence","score_opus":0.008931699650840518,"score_gpt":0.28326499233884445,"score_spread":0.27433329268800394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069308324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9783201,0.000009217166,0.0005299041,0.00055258424,0.000062327534,0.000039258437,0.0000018413713,0.00002986894,0.020454852],"genre_scores_gemma":[0.9982138,5.649153e-7,0.00024555722,0.000023545192,0.00030251773,0.000009246126,0.000009397512,0.0000059922213,0.0011893564],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969035,0.000018458368,0.00007347094,0.000086588,0.000039698985,0.00009144974],"domain_scores_gemma":[0.9997481,0.000036162764,0.00003195425,0.00015404138,0.000015171243,0.000014586356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011868226,0.000054391425,0.000080594924,0.00005226858,0.000059444883,0.000049043454,0.00008108876,0.000013951082,0.000068365676],"category_scores_gemma":[0.00000143639,0.00004126971,0.00002027586,0.0003382821,0.000034804998,0.00006455365,0.000029879098,0.0001531029,0.000013867211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008248816,0.00007619955,0.08472174,0.000002683943,0.00003789088,5.915348e-7,0.0021222616,0.0000329365,0.032629516,0.3130795,0.018209973,0.54907846],"study_design_scores_gemma":[0.0014827992,0.00011815197,0.33643976,0.00006185496,0.0002018887,0.000002703561,0.0010142158,0.03662804,0.024692286,0.39188758,0.20625947,0.0012112351],"about_ca_topic_score_codex":0.00008201321,"about_ca_topic_score_gemma":0.00021004856,"teacher_disagreement_score":0.54786724,"about_ca_system_score_codex":0.000004909235,"about_ca_system_score_gemma":0.0000050081976,"threshold_uncertainty_score":0.168293},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006771410045472699,"score_gpt":0.25534182186877935,"score_spread":0.24857041182330666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070199170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99064153,0.00027824542,0.006866259,0.00006547903,0.000024999663,0.00012568846,0.000002965576,0.000039657254,0.001955171],"genre_scores_gemma":[0.99753284,0.000013397717,0.0006806422,0.000115569834,0.0014752815,0.00002670427,0.00005992164,0.000018758701,0.00007689439],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9984516,0.00016529011,0.00036772448,0.0003089733,0.0001733022,0.00053311937],"domain_scores_gemma":[0.9993834,0.00016216763,0.00023390341,0.00009867712,0.0000375652,0.00008432597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064348226,0.00022213274,0.00052718405,0.00019936451,0.0005003763,0.000079385936,0.000083183586,0.00009655108,0.00010890203],"category_scores_gemma":[0.0000066832094,0.00022583168,0.00018304514,0.0012993328,0.00008907561,0.00020881617,0.000105550986,0.00021684424,0.000001916662],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003613543,0.00008596214,0.93154633,0.0000051809448,0.0008088833,7.999452e-7,0.0025973022,0.0068511316,0.00003819225,0.01305528,0.0021117628,0.042863045],"study_design_scores_gemma":[0.000566503,0.000042774576,0.84634966,0.000053123786,0.0014964504,2.7422453e-7,0.0005748432,0.14539936,0.000010255917,0.004110207,0.0007248722,0.0006716724],"about_ca_topic_score_codex":0.00014203196,"about_ca_topic_score_gemma":0.000050433482,"teacher_disagreement_score":0.13854824,"about_ca_system_score_codex":0.00003379995,"about_ca_system_score_gemma":0.000011452293,"threshold_uncertainty_score":0.9209148},"labels":[],"label_agreement":null},{"id":"W2071159824","doi":"10.1016/j.cor.2014.02.003","title":"A randomized algorithm with local search for containment of pandemic disease spread","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Rounding; Cardinality (data modeling); Containment (computer programming); Mathematics; Node (physics); Algorithm; Graph; Mathematical optimization; Computer science; Combinatorics; Data mining","score_opus":0.03607817111238463,"score_gpt":0.36136741005549106,"score_spread":0.3252892389431064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071159824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027070502,0.00004204966,0.9707688,0.0002762104,0.000017697159,0.0014320441,0.000024826863,0.00003347118,0.0003343771],"genre_scores_gemma":[0.94984716,0.0000051237776,0.04896233,0.00002055032,0.0001949124,0.00060286315,0.0001398672,0.00001800738,0.00020919873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979277,0.00063516817,0.00031299953,0.0003161537,0.0004550288,0.00035292198],"domain_scores_gemma":[0.9978051,0.000944479,0.00002576176,0.00042712793,0.00062625273,0.00017123707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019926364,0.00012967548,0.00042607918,0.00021195147,0.00028667902,0.00010568975,0.000320449,0.000021560001,0.00007691098],"category_scores_gemma":[0.000015708521,0.00010009204,0.000165622,0.0003338728,0.00044722218,0.00008185563,0.00015409519,0.0002025952,0.0000062032486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011299647,0.0008667929,0.005617847,0.000073129646,0.0009044877,0.0000020315376,0.00081821874,0.15160276,0.0002907686,0.22703192,0.0034932632,0.59799916],"study_design_scores_gemma":[0.021459466,0.00016391466,0.00010740016,0.000059082235,0.000044636745,2.6035374e-7,0.000111425245,0.9745681,0.0006422563,0.0018254201,0.00089608313,0.00012192655],"about_ca_topic_score_codex":0.0005711841,"about_ca_topic_score_gemma":0.000031204905,"teacher_disagreement_score":0.92277664,"about_ca_system_score_codex":0.000058664453,"about_ca_system_score_gemma":0.000196953,"threshold_uncertainty_score":0.4081635},"labels":[],"label_agreement":null},{"id":"W2071479119","doi":"10.1016/j.physa.2005.11.018","title":"The analysis and dissimilarity comparison of community structure","year":2005,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Community structure; Hierarchical clustering of networks; Cluster analysis; Hierarchical clustering; Computer science; Data mining; Network structure; Measure (data warehouse); Complex network; Econophysics; Process (computing); Clique percolation method; Artificial intelligence; Mathematics; Theoretical computer science; Fuzzy clustering; Econometrics; Statistics; Canopy clustering algorithm","score_opus":0.01825065818946683,"score_gpt":0.3275792624993063,"score_spread":0.3093286043098395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071479119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051754467,0.00011747625,0.9464205,0.00044918983,0.0000034096547,0.00024426926,0.0007928464,0.000023090703,0.00019474649],"genre_scores_gemma":[0.99409366,0.000013479364,0.0056295497,0.000015049029,0.00005579272,0.000052904983,0.00012804779,0.0000066220946,0.0000049167465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992908,0.00008179128,0.00025332716,0.00013084874,0.00011196167,0.0001312666],"domain_scores_gemma":[0.9986673,0.0007344447,0.00013071815,0.0003052123,0.00008559208,0.00007672789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011181716,0.000109310815,0.00027470093,0.000033814653,0.00054873974,0.000048757487,0.00016275381,0.00002030045,0.000042955617],"category_scores_gemma":[0.00001119424,0.00008237269,0.000052447176,0.0003655798,0.000055550892,0.000037246624,0.00013118405,0.00023403545,7.2439013e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002823097,0.00012251141,0.00034121808,0.0000046421746,0.0001872053,3.6967047e-9,0.00015939029,0.000023083008,0.0005876098,0.9036304,0.0001397669,0.09480137],"study_design_scores_gemma":[0.000116741874,0.000028160499,0.011211161,0.0000034755117,0.0009483685,9.185208e-8,0.00041899894,0.28293288,0.0018051276,0.6973317,0.005032938,0.00017029155],"about_ca_topic_score_codex":0.00009042935,"about_ca_topic_score_gemma":0.00017689102,"teacher_disagreement_score":0.9423392,"about_ca_system_score_codex":0.000006788476,"about_ca_system_score_gemma":0.000008579618,"threshold_uncertainty_score":0.4220518},"labels":[],"label_agreement":null},{"id":"W2072032962","doi":"10.1109/icmla.2012.235","title":"Machine Learning Module to Improve Communication between Agents in Multi-agent System","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Ontology; Process (computing); Domain (mathematical analysis); Multi-agent system; Knowledge sharing; The Internet; Order (exchange); Domain knowledge; Human–computer interaction; Meaning (existential); Artificial intelligence; Knowledge management; World Wide Web","score_opus":0.04565106171250425,"score_gpt":0.31756870009010285,"score_spread":0.2719176383775986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072032962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6742315,0.00012882671,0.3110253,0.00009441208,0.000044252418,0.00056482025,0.000012709505,0.00023242376,0.013665772],"genre_scores_gemma":[0.98774666,0.0000011132717,0.011202524,0.0000148823365,0.00009853621,0.00006134757,0.000087424865,0.000015310716,0.0007722262],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99915296,0.0001244687,0.00024715814,0.00013397432,0.00009399104,0.00024744766],"domain_scores_gemma":[0.99940455,0.00003656465,0.00007677991,0.00035913367,0.000025598996,0.000097355485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003666175,0.000109398745,0.0001929626,0.0000897816,0.000081384125,0.000026576117,0.00021242794,0.00002207892,0.00014733041],"category_scores_gemma":[0.0000028275572,0.000102703794,0.00006476498,0.00019490391,0.0000071443305,0.00010411555,0.0002250713,0.00016380342,0.000100291305],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014089976,0.00007548724,0.9802419,0.0000053284957,0.00003645514,4.572309e-8,0.00019384232,0.0003631462,0.00013532588,0.0034069493,0.00015301428,0.015387105],"study_design_scores_gemma":[0.001044895,0.000066602784,0.6839234,0.00014097455,0.00012452244,2.2652284e-7,0.00097516057,0.28208783,0.005839188,0.00024355839,0.02481039,0.000743236],"about_ca_topic_score_codex":0.0026972014,"about_ca_topic_score_gemma":0.000045736495,"teacher_disagreement_score":0.31351513,"about_ca_system_score_codex":0.000086653345,"about_ca_system_score_gemma":0.000004417355,"threshold_uncertainty_score":0.4188139},"labels":[],"label_agreement":null},{"id":"W2075214042","doi":"10.1103/physreve.86.011128","title":"Discontinuous percolation transitions in epidemic processes, surface depinning in random media, and Hamiltonian random graphs","year":2012,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Statistical physics; Hamiltonian (control theory); Random graph; Phase transition; Directed percolation; Physics; Tricritical point; Non-equilibrium thermodynamics; Phase diagram; Mathematics; Combinatorics; Graph; Critical exponent; Condensed matter physics; Quantum mechanics; Phase (matter)","score_opus":0.016290358499967548,"score_gpt":0.30344789276671724,"score_spread":0.28715753426674967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075214042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95654213,0.033192515,0.007754959,0.0006783235,0.000021166054,0.00093545485,0.000012596303,0.000045341993,0.00081749837],"genre_scores_gemma":[0.99695563,0.0021523617,0.0004642935,0.00007543709,0.00013560631,0.00013855723,0.000058504655,0.000015796362,0.0000037971502],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986622,0.00024772662,0.00041020053,0.00022817205,0.00013130486,0.00032039432],"domain_scores_gemma":[0.9991821,0.00041650413,0.00010806523,0.0001654275,0.00003428477,0.00009362011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006354814,0.00018176684,0.0007133063,0.0000629702,0.000051751987,0.000018919263,0.000095912816,0.00001883295,0.000035003104],"category_scores_gemma":[0.000065551154,0.00015735802,0.00014376361,0.0006835176,0.000049575825,0.00032333043,0.000027342854,0.00023835147,0.0000056218346],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018428714,0.0018667341,0.8190642,0.0021365546,0.00018154747,0.0000038218095,0.00704667,0.00046427705,0.0031839223,0.038674712,0.00064068823,0.12655257],"study_design_scores_gemma":[0.030459527,0.00019590909,0.5098933,0.034998614,0.002696996,0.000012474381,0.001251426,0.059983484,0.0015758884,0.34101,0.013066787,0.0048555736],"about_ca_topic_score_codex":0.0002685304,"about_ca_topic_score_gemma":0.00021396414,"teacher_disagreement_score":0.3091709,"about_ca_system_score_codex":0.000022539822,"about_ca_system_score_gemma":0.000028862733,"threshold_uncertainty_score":0.6416874},"labels":[],"label_agreement":null},{"id":"W2075280697","doi":"10.1155/2013/323750","title":"A Multidimensional and Multimembership Clustering Method for Social Networks and Its Application in Customer Relationship Management","year":2013,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Science Foundation of Ministry of Education of China; Independent Innovation Foundation of Shandong University; China Postdoctoral Science Foundation; Shandong University; Ministry of Education of the People's Republic of China; National Science Foundation","keywords":"Computer science; Hierarchical clustering; Data mining; Cluster analysis; Redundancy (engineering); Tree (set theory); Feature (linguistics); Graph; Artificial intelligence; Machine learning; Theoretical computer science; Mathematics","score_opus":0.019920322069317122,"score_gpt":0.2784200982199617,"score_spread":0.2584997761506446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075280697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017074253,0.000035603163,0.98158556,0.000050713134,0.000005746939,0.0009030641,5.6313564e-7,0.00003677309,0.00030774588],"genre_scores_gemma":[0.8625234,8.7412946e-7,0.1365225,0.0000048645124,0.000032854543,0.00086569536,0.0000056740537,0.000015789634,0.000028401211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999267,0.000018875293,0.00027209893,0.00018875404,0.00006183899,0.0001914785],"domain_scores_gemma":[0.9995672,0.00027494473,0.000040339084,0.00006717275,0.000015878897,0.00003445826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035097275,0.00011504411,0.00018390075,0.00011524937,0.000038018694,0.000022799488,0.000044504282,0.000042941625,0.000017249655],"category_scores_gemma":[0.000008693342,0.00011680332,0.000028253602,0.00014962514,0.000008104172,0.00008547962,0.0000788224,0.00013508285,0.0000028631125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049510404,0.00012925919,0.007003367,0.00073203596,0.000062336025,3.2631766e-7,0.00093693443,0.71617633,0.0005950477,0.25034866,0.000043232296,0.023967486],"study_design_scores_gemma":[0.0002842827,0.0000033627612,0.002779185,0.000091337926,0.000013167,3.5626547e-7,0.000046901183,0.97607386,0.0000132291825,0.020548563,0.000028412584,0.00011733439],"about_ca_topic_score_codex":0.00002248033,"about_ca_topic_score_gemma":0.0000051717784,"teacher_disagreement_score":0.8454491,"about_ca_system_score_codex":0.000025955575,"about_ca_system_score_gemma":0.00000134985,"threshold_uncertainty_score":0.4763101},"labels":[],"label_agreement":null},{"id":"W2075555551","doi":"10.1109/ijcnn.2013.6706937","title":"Dissimilarity space embedding of labeled graphs by a clustering-based compression procedure","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Embedding; Cluster analysis; Benchmarking; Computer science; Set (abstract data type); Graph; Space (punctuation); Algorithm; Theoretical computer science; Data mining; Artificial intelligence","score_opus":0.007458632058585294,"score_gpt":0.2619154051305483,"score_spread":0.254456773071963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075555551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6767352,0.000052009877,0.31107175,0.00052606076,0.00003519118,0.0006461985,0.000023018427,0.00023679517,0.010673746],"genre_scores_gemma":[0.99233276,5.351392e-7,0.007088463,0.0000443303,0.00003370663,0.000056405752,0.000051325467,0.000014377655,0.00037807325],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918026,0.000036915797,0.00022901203,0.00021053023,0.00014578439,0.00019749816],"domain_scores_gemma":[0.9993828,0.00004753508,0.00013893592,0.00026890016,0.00008945526,0.000072409384],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000068381116,0.00014837347,0.00025557875,0.00005910562,0.00007462619,0.00004000192,0.00018062252,0.00003428348,0.0020257537],"category_scores_gemma":[0.0000026973619,0.000120680925,0.00012542107,0.00022499675,0.000039752562,0.000100562465,0.00008846675,0.00011382266,0.0000061488336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004852911,0.0012479568,0.40720394,0.0001916397,0.00031551084,5.683775e-7,0.00023109371,0.003643618,0.15323621,0.012496668,0.41291535,0.008468915],"study_design_scores_gemma":[0.00087478897,0.000097164004,0.005519902,0.00021876198,0.00009020868,2.1160577e-7,0.00022386078,0.86680174,0.112398446,0.010502457,0.0027335437,0.00053894747],"about_ca_topic_score_codex":0.00072817696,"about_ca_topic_score_gemma":0.000032260454,"teacher_disagreement_score":0.8631581,"about_ca_system_score_codex":0.000009349915,"about_ca_system_score_gemma":0.000017585893,"threshold_uncertainty_score":0.9988865},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Robustness (evolution); Computer science; Computer network; Biology","score_opus":0.016629843536909144,"score_gpt":0.2789023387438961,"score_spread":0.2622724952069869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076916637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066827363,0.000053948803,0.99216,0.0002765472,0.000020688234,0.0003116911,0.00012022904,0.000023401448,0.00035075124],"genre_scores_gemma":[0.98787344,0.000024397774,0.011673815,0.000008125634,0.00017112932,0.00018946183,0.000037516675,0.00001106376,0.00001103304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928683,0.000025515514,0.0002104505,0.00021027673,0.00009836972,0.00016852905],"domain_scores_gemma":[0.9989801,0.00045689763,0.000109464665,0.0002555941,0.00010696726,0.00009095148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012500823,0.00011174369,0.00019229052,0.000017930834,0.00032561587,0.00005160444,0.00015095716,0.000022731156,0.000043591182],"category_scores_gemma":[0.0000100131165,0.00008442095,0.000034856464,0.00017735375,0.00012267378,0.00003395256,0.00012442385,0.0002099792,0.0000010567837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028979982,0.00005929156,0.00003633228,0.0000043901982,0.00003378921,1.5910379e-8,0.0000056161157,0.000023873848,0.000542396,0.9699316,0.0002124853,0.029147312],"study_design_scores_gemma":[0.00007051589,0.000017394994,0.00042239393,0.000002454373,0.0000598909,2.0389442e-7,0.000029085426,0.5457376,0.0001728946,0.45005888,0.0033400555,0.00008861182],"about_ca_topic_score_codex":0.000026013924,"about_ca_topic_score_gemma":0.00003171869,"teacher_disagreement_score":0.98119074,"about_ca_system_score_codex":0.0000026504504,"about_ca_system_score_gemma":0.000011748494,"threshold_uncertainty_score":0.34425864},"labels":[],"label_agreement":null},{"id":"W2077382842","doi":"10.1007/s11590-013-0621-x","title":"A locally optimal hierarchical divisive heuristic for bipartite modularity maximization","year":2013,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Bipartite graph; Heuristic; Modularity (biology); Mathematics; Combinatorics; Maximization; Hierarchical clustering; Partition (number theory); Cluster analysis; Theoretical computer science; Computer science; Graph; Mathematical optimization; Statistics","score_opus":0.007227211670618004,"score_gpt":0.22886043147526455,"score_spread":0.22163321980464654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077382842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017713957,0.000005668547,0.9788524,0.0022575716,0.000050214003,0.0006698633,0.000018155133,0.00011661977,0.0003155462],"genre_scores_gemma":[0.70371544,0.0000016160185,0.29426596,0.0007312426,0.00026133243,0.0003709048,0.00051030493,0.000032988024,0.000110202134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988544,0.00006236179,0.00030801992,0.00032612457,0.00015940862,0.00028970555],"domain_scores_gemma":[0.99924535,0.00008551021,0.00013946996,0.00025747388,0.00017861994,0.000093607014],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009900757,0.00017779385,0.0002102533,0.000112869115,0.00017558529,0.00017399553,0.00017582519,0.000039129078,0.000982434],"category_scores_gemma":[0.00001861875,0.00018237831,0.0001422723,0.00026547094,0.00006673807,0.00027289873,0.00006124392,0.00011314735,0.00002683411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010390293,0.00006461961,0.0027346506,0.0000062697,0.000062462335,2.4795116e-7,0.000056482357,0.9808543,0.00030568993,0.0033165368,0.009189495,0.0033988678],"study_design_scores_gemma":[0.0003425922,0.000028308965,0.0006081867,0.000012086684,0.00004857238,3.0344398e-7,0.00001316297,0.9964663,0.00020813866,0.0014551849,0.00060363306,0.00021357795],"about_ca_topic_score_codex":0.00007874285,"about_ca_topic_score_gemma":8.148852e-7,"teacher_disagreement_score":0.68600154,"about_ca_system_score_codex":0.00003376734,"about_ca_system_score_gemma":0.000019152088,"threshold_uncertainty_score":0.9999308},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Graph; Random graph; Theoretical computer science","score_opus":0.03364774990292631,"score_gpt":0.3177440464959458,"score_spread":0.2840962965930195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077787974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11749858,0.0001445295,0.88031507,0.0006759768,0.000027510783,0.00016377331,0.0000016286813,0.000011073551,0.0011618678],"genre_scores_gemma":[0.9901845,0.000014440277,0.00891118,0.00006393615,0.00074370304,0.000028113765,0.0000059937256,0.000012694076,0.00003544056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880016,0.000093861076,0.0006495323,0.00009808834,0.00010238868,0.00025596697],"domain_scores_gemma":[0.99873304,0.0005945203,0.00038653845,0.0000637863,0.00017326041,0.00004885941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007422274,0.00011882371,0.00060564576,0.00009280006,0.00008167011,0.00001554588,0.00019405135,0.000091224574,0.00019164271],"category_scores_gemma":[0.000037833845,0.000090572816,0.0003026029,0.0001567949,0.00012828472,0.000096912096,0.000028359016,0.0002562358,0.0000010360217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018990804,0.0030103514,0.044565916,0.00026145112,0.001484621,0.000038131628,0.008125759,0.028664332,0.00007144694,0.8567693,0.036307678,0.018801894],"study_design_scores_gemma":[0.0012345555,0.00008263619,0.00007192693,0.000030476122,0.000060128477,0.000007386872,0.00027700095,0.02771861,0.0000064960923,0.9698175,0.0005977079,0.000095545096],"about_ca_topic_score_codex":0.000003960529,"about_ca_topic_score_gemma":0.0000024032279,"teacher_disagreement_score":0.8726859,"about_ca_system_score_codex":0.000023393119,"about_ca_system_score_gemma":0.00005307415,"threshold_uncertainty_score":0.36934522},"labels":[],"label_agreement":null},{"id":"W2077883651","doi":"10.1103/physreve.89.022801","title":"Coexistence of phases and the observability of random graphs","year":2014,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Observability; Observable; Observer (physics); Random graph; Statistical physics; Percolation (cognitive psychology); Mathematics; Component (thermodynamics); Graph; Connected component; Discrete mathematics; Computer science; Combinatorics; Applied mathematics; Physics; Quantum mechanics","score_opus":0.02040694347035172,"score_gpt":0.3163636237921376,"score_spread":0.2959566803217859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077883651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95695335,0.016818017,0.010680508,0.0007154569,0.000022540089,0.0011439153,0.000020567879,0.000035733563,0.013609898],"genre_scores_gemma":[0.9989198,0.0007391549,0.00019544213,0.00005937373,0.000043254993,0.000030792333,0.000003364606,0.0000033325628,0.0000055155588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924266,0.00019435697,0.00025626898,0.000119683806,0.00011353884,0.00007348289],"domain_scores_gemma":[0.9986529,0.00072687,0.00019088482,0.00033355632,0.000071411094,0.000024378765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004600566,0.000081360726,0.0005937035,0.000007271975,0.000024671697,0.0000037824504,0.00015418362,0.000004198233,0.000039575396],"category_scores_gemma":[0.00006632742,0.000045960096,0.00028118122,0.00016858571,0.0003171855,0.000029480127,0.000057805286,0.000057615638,7.11677e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082754814,0.00038581304,0.010792156,0.000864266,0.00015255313,2.4933696e-8,0.000115578194,0.0000048439347,0.00095949176,0.8424873,0.00070986134,0.14344539],"study_design_scores_gemma":[0.002605946,0.00011946253,0.004392387,0.00171659,0.00088932965,1.9721703e-7,0.000019401134,0.008009565,0.005923149,0.9672189,0.008867573,0.00023753369],"about_ca_topic_score_codex":0.000100938836,"about_ca_topic_score_gemma":0.0000011119872,"teacher_disagreement_score":0.14320785,"about_ca_system_score_codex":0.0000014153875,"about_ca_system_score_gemma":0.000005749688,"threshold_uncertainty_score":0.18741983},"labels":[],"label_agreement":null},{"id":"W2078130621","doi":"10.1186/s40649-015-0010-y","title":"Efficiently identifying critical nodes in large complex networks","year":2015,"lang":"en","type":"article","venue":"Computational Social Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Pairwise comparison; Vertex (graph theory); Node (physics); Cardinality (data modeling); Greedy algorithm; Graph; Algorithm; Context (archaeology); Set (abstract data type); Time complexity; Theoretical computer science; Mathematics; Mathematical optimization; Data mining; Artificial intelligence","score_opus":0.05083340851624824,"score_gpt":0.35394257981924876,"score_spread":0.3031091713030005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078130621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015611869,0.00018919702,0.97983515,0.00032899802,0.00023407239,0.00017138678,0.000011930868,0.0001298575,0.0034875139],"genre_scores_gemma":[0.9922811,8.440605e-7,0.004918327,0.00029564777,0.0019477542,0.000033344226,0.00045978988,0.00003201039,0.0000311874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978406,0.00023260467,0.00053632644,0.00037908833,0.0004071374,0.00060427067],"domain_scores_gemma":[0.9989109,0.00040472634,0.00013422772,0.0001303768,0.000258429,0.00016131275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006777241,0.00023232657,0.00040007214,0.00012328704,0.00035472494,0.00017953615,0.00028900677,0.00009688342,0.0002537952],"category_scores_gemma":[0.000023175633,0.00026695727,0.0001948213,0.00074267504,0.00013932974,0.0001915682,0.00022325838,0.00041087013,0.000021380636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001853403,0.00021754208,0.058488503,0.0000027899446,0.000042381504,0.0000046932782,0.0002458727,0.79664844,4.851112e-7,0.12862681,0.012586921,0.0031170165],"study_design_scores_gemma":[0.00054922176,0.000012811837,0.03609811,0.000021777283,0.00002530185,6.5432806e-7,0.00024525667,0.9082981,2.915203e-7,0.053534474,0.0009604343,0.00025358703],"about_ca_topic_score_codex":0.000090066125,"about_ca_topic_score_gemma":0.000025738433,"teacher_disagreement_score":0.97666925,"about_ca_system_score_codex":0.00011915767,"about_ca_system_score_gemma":0.00006678946,"threshold_uncertainty_score":0.99997824},"labels":[],"label_agreement":null},{"id":"W2078783412","doi":"10.1109/icdm.2012.70","title":"Assessing the Significance of Data Mining Results on Graphs with Feature Vectors","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Data mining; Exploit; Machine learning; Artificial intelligence; Theoretical computer science","score_opus":0.05431636247416097,"score_gpt":0.3366373956675038,"score_spread":0.2823210331933428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078783412","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8431234,0.00009683709,0.02494718,0.0006765199,0.00006603209,0.00035998056,0.00007033146,0.00011692912,0.13054278],"genre_scores_gemma":[0.9876491,4.939448e-7,0.011825211,0.000027553413,0.00016431996,0.0000060664856,0.000086030544,0.0000094724255,0.00023174392],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993206,0.000054927386,0.00012839475,0.00017240214,0.00014994707,0.00017370773],"domain_scores_gemma":[0.99879795,0.00021159093,0.00014417592,0.0007833154,0.00003091791,0.000032045155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034472047,0.000097898286,0.00013429657,0.00003336325,0.000087185,0.000047164413,0.0003666492,0.000014994493,0.00004427629],"category_scores_gemma":[0.000004354555,0.000053045238,0.00003593217,0.00028974653,0.00005217239,0.000297367,0.000090510446,0.00011675697,0.0000012839903],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012666643,0.0005307991,0.64702404,0.000016764188,0.0006932029,7.8870045e-7,0.0012304948,0.00021501926,0.0022970713,0.06447799,0.13045157,0.15293558],"study_design_scores_gemma":[0.0028537514,0.00067594013,0.715078,0.0009612828,0.0013940847,0.0000038117153,0.0170361,0.01929779,0.080452316,0.005804709,0.15394206,0.0025001832],"about_ca_topic_score_codex":0.00014342343,"about_ca_topic_score_gemma":0.00001308479,"teacher_disagreement_score":0.15043539,"about_ca_system_score_codex":0.0000052333685,"about_ca_system_score_gemma":0.000017545608,"threshold_uncertainty_score":0.21631221},"labels":[],"label_agreement":null},{"id":"W2080099401","doi":"10.1017/s096354830500708x","title":"The Small Giant Component in Scale-Free Random Graphs","year":2005,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Giant component; Component (thermodynamics); Random graph; Upper and lower bounds; Mathematics; Combinatorics; Scale (ratio); Graph; Connected component; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.01325639483048388,"score_gpt":0.2363868157909862,"score_spread":0.2231304209605023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080099401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9635772,0.000378525,0.027900485,0.001260417,0.00024833926,0.0009121413,0.0000034064963,0.00022663754,0.0054928605],"genre_scores_gemma":[0.99503535,0.0000059203658,0.0046645193,0.00003352522,0.00015397824,0.00003380451,0.000010988275,0.000022945173,0.000038953243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974288,0.00034341335,0.0008064561,0.00051370804,0.000296405,0.00061122957],"domain_scores_gemma":[0.99753124,0.0007740843,0.00025300405,0.0011586663,0.00017057967,0.00011241121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020346588,0.00028678245,0.00045688386,0.000105085084,0.000534691,0.00016002184,0.0010902062,0.000055042805,0.000018788316],"category_scores_gemma":[0.00005742721,0.0002352968,0.0002835743,0.00079444377,0.00017251838,0.000079934056,0.00075437693,0.0005280255,0.000010161225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060589493,0.0011236541,0.2608071,0.000029833624,0.000095404546,0.0000016604803,0.00057232345,0.004285985,0.00010988851,0.5770012,0.0010081144,0.15490425],"study_design_scores_gemma":[0.0021400007,0.00003844285,0.02018547,0.00006137283,0.000030852774,0.0000010947687,0.00007805868,0.12359796,0.00046295486,0.8493441,0.003676758,0.00038295615],"about_ca_topic_score_codex":0.00025306994,"about_ca_topic_score_gemma":0.00020554216,"teacher_disagreement_score":0.27234286,"about_ca_system_score_codex":0.0002137067,"about_ca_system_score_gemma":0.00005779073,"threshold_uncertainty_score":0.9595125},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011698642306982568,"score_gpt":0.3276967364990397,"score_spread":0.3159980941920571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080243455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38712293,0.0076645077,0.57655096,0.00040052185,0.00004896943,0.00084639125,0.0002193715,0.00009813404,0.027048217],"genre_scores_gemma":[0.9961004,0.0002993073,0.0032678975,0.00003665343,0.00015010785,0.000018106766,0.00011018906,0.000009171949,0.000008138637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887174,0.000051459945,0.00046099472,0.00019787156,0.00023708632,0.00018083089],"domain_scores_gemma":[0.99905765,0.00008755145,0.0002963321,0.00040886842,0.000083449195,0.000066135966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018561822,0.0001353004,0.0010322793,0.000039634087,0.000023346955,0.0000037530992,0.00019141244,0.000009438773,0.0004422013],"category_scores_gemma":[0.000014089199,0.00011186139,0.0005988884,0.001359485,0.00008439977,0.000036479836,0.0000687096,0.00010259664,0.0000073756246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062984964,0.0006204011,0.032725874,0.00026409663,0.0022089456,8.684725e-7,0.000036981783,0.004976216,0.00014907563,0.92371804,0.0015656096,0.033727568],"study_design_scores_gemma":[0.00041353962,0.00022838694,0.24106966,0.0018473249,0.017962689,2.524012e-7,0.000008319085,0.006806416,0.0014535098,0.7249579,0.004651198,0.0006008341],"about_ca_topic_score_codex":0.00023671433,"about_ca_topic_score_gemma":0.000005695635,"teacher_disagreement_score":0.6089775,"about_ca_system_score_codex":0.000014612503,"about_ca_system_score_gemma":0.00003900634,"threshold_uncertainty_score":0.4841794},"labels":[],"label_agreement":null},{"id":"W2080617644","doi":"10.1080/15427951.2006.10129121","title":"Finding (Short) Paths in Social Networks","year":2006,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Mathematics; Set (abstract data type); Degree distribution; Theoretical computer science; Random graph; Social network (sociolinguistics); Computer science; Complex network; Combinatorics; Graph; Social media","score_opus":0.017565717930368534,"score_gpt":0.2796462541375113,"score_spread":0.2620805362071428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080617644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41867337,0.000031588206,0.48436606,0.00003592135,0.00006209039,0.00018691736,0.0000040699047,0.00012206724,0.09651792],"genre_scores_gemma":[0.99335635,3.806904e-7,0.004624003,0.000011834625,0.00059108005,0.000025986972,0.000029112598,0.000022383343,0.0013388549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990695,0.000022862501,0.0003844661,0.00015711485,0.00011657607,0.00024946433],"domain_scores_gemma":[0.9996452,0.00006699037,0.0000931043,0.00015209906,0.000023367975,0.000019235436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016231957,0.0001440805,0.00025285702,0.00008726093,0.000035036774,0.00006554424,0.00020515599,0.000043504835,0.0003916624],"category_scores_gemma":[0.0000019423342,0.00014173708,0.00012880653,0.0001966114,0.000027750275,0.000051563336,0.00009443555,0.0001718593,0.000023707902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006575785,0.0010759268,0.10298148,0.000034142777,0.00011697671,0.000015939397,0.0010965087,0.0017454458,0.0001637634,0.79734415,0.079189,0.016230062],"study_design_scores_gemma":[0.00040460925,0.000046034664,0.0054726014,0.00022712114,0.00009200605,0.000002993455,0.0004045322,0.62720454,0.0015344727,0.35470468,0.009163081,0.00074333826],"about_ca_topic_score_codex":0.00022163708,"about_ca_topic_score_gemma":0.00007235061,"teacher_disagreement_score":0.6254591,"about_ca_system_score_codex":0.00004089992,"about_ca_system_score_gemma":0.0000073153933,"threshold_uncertainty_score":0.577987},"labels":[],"label_agreement":null},{"id":"W2081306046","doi":"10.1145/2739482.2764630","title":"Evolving Neurocontrollers for the Control of Information Diffusion in Social Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Heuristic; Artificial neural network; Artificial intelligence; Control (management); Diffusion","score_opus":0.012842951383176603,"score_gpt":0.25313850449690645,"score_spread":0.24029555311372985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081306046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062432494,0.000025438196,0.98835456,0.0003154029,0.000035423956,0.00044370547,0.0000030945125,0.00001969447,0.0045594014],"genre_scores_gemma":[0.999278,5.885453e-7,0.0002968844,0.00009839512,0.00020614135,0.00007503022,0.0000112718335,0.0000038476246,0.000029851275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994675,0.000030355559,0.0002442693,0.00005065215,0.00008564875,0.00012160617],"domain_scores_gemma":[0.99948394,0.0001792615,0.00012635834,0.00008759364,0.00010334264,0.000019510395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029840026,0.00006356986,0.00015637322,0.00004831863,0.00006307884,0.000027257534,0.00011574322,0.000019098088,0.00003697163],"category_scores_gemma":[0.000011213241,0.00004310402,0.00009926088,0.00013519912,0.00001884092,0.00015588998,0.000027777282,0.00006240015,7.0383044e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060333323,0.00023177979,0.23719108,0.000013398955,0.0003059579,1.1323015e-7,0.0018579625,0.19089925,0.0001573224,0.17484164,0.08080174,0.3130964],"study_design_scores_gemma":[0.0014879438,0.000022879029,0.006072465,0.0000032377864,0.00002840146,1.9130267e-8,0.00033683138,0.98467004,0.000012139906,0.004177359,0.0031359869,0.00005269044],"about_ca_topic_score_codex":0.00022308652,"about_ca_topic_score_gemma":0.000021230197,"teacher_disagreement_score":0.9930347,"about_ca_system_score_codex":0.000014745962,"about_ca_system_score_gemma":0.000019314299,"threshold_uncertainty_score":0.17577308},"labels":[],"label_agreement":null},{"id":"W2086019327","doi":"10.1109/ijcnn.2007.4371181","title":"Visualization and classification of graph-structured data: the case of the Enron dataset","year":2007,"lang":"en","type":"article","venue":"IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Representation (politics); Cluster analysis; Graph; Space (punctuation); Dimension (graph theory); Visualization; Data visualization; Latent class model; Data mining; Artificial intelligence; Machine learning; Theoretical computer science; Mathematics","score_opus":0.0899208082438059,"score_gpt":0.3684215405121601,"score_spread":0.2785007322683542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086019327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74768215,0.00012591085,0.2221644,0.004695018,0.009868067,0.0021298174,0.003710971,0.00019341215,0.009430253],"genre_scores_gemma":[0.9955257,0.00010952377,0.000082844614,0.00043514205,0.001354052,0.000036334128,0.0022984468,0.00004397291,0.000113972856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960255,0.0003560321,0.0013091078,0.00094515405,0.00086908985,0.0004951082],"domain_scores_gemma":[0.99559313,0.00060697255,0.0014345403,0.001335794,0.00088191114,0.00014764498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084312976,0.0005657167,0.00052373874,0.00028973396,0.00031019052,0.00028398517,0.0026611285,0.00018843723,0.00045209206],"category_scores_gemma":[0.00004927319,0.0004042864,0.00023447632,0.0005638057,0.00061718014,0.00053551473,0.00045094386,0.00094044587,0.0000025425602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013153618,0.000599743,0.016412714,0.000024346742,0.0010307927,0.000070144,0.00024645615,0.15343969,0.0037308848,0.72302175,0.019612567,0.08049555],"study_design_scores_gemma":[0.0005687966,0.00014154683,0.0047647986,0.00013663444,0.000103615224,0.00006289997,0.00025065296,0.9880691,0.00062293425,0.0045121964,0.00039762334,0.00036916247],"about_ca_topic_score_codex":0.00040986657,"about_ca_topic_score_gemma":0.0007761853,"teacher_disagreement_score":0.8346295,"about_ca_system_score_codex":0.000074268064,"about_ca_system_score_gemma":0.000062800056,"threshold_uncertainty_score":0.9998409},"labels":[],"label_agreement":null},{"id":"W2086228055","doi":"10.1016/j.tcs.2014.07.009","title":"On non-progressive spread of influence through social networks","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematics; Theoretical computer science; Sociology","score_opus":0.005540294514259801,"score_gpt":0.2710650071988626,"score_spread":0.2655247126846028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086228055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24829817,0.0000022815482,0.74048024,0.00006743678,0.000051475792,0.00007997885,9.5143764e-7,0.000036303445,0.010983152],"genre_scores_gemma":[0.98523676,1.7795968e-7,0.014194343,0.00018350683,0.00036670698,0.0000072603316,0.0000016903792,0.000007416723,0.0000021580797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986004,0.000073736184,0.00023414327,0.00036859128,0.00036560462,0.00035752385],"domain_scores_gemma":[0.9990256,0.00023816786,0.00012751829,0.00037707822,0.00015975659,0.000071891736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005137137,0.00014471178,0.00025546126,0.000054037588,0.00025657113,0.00007602381,0.00081088993,0.000028472512,0.00014117603],"category_scores_gemma":[0.00001170359,0.0001176007,0.00010210732,0.0006002304,0.002615775,0.00014625644,0.0003588603,0.00017612579,0.000012907655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009019361,0.00005420982,0.00049102126,0.0000016368324,0.00000779244,2.844776e-7,0.0001282483,0.0025912502,0.000089301706,0.972745,0.00010339316,0.023778811],"study_design_scores_gemma":[0.00011744809,0.0001640123,0.002084167,0.000038198446,0.000012742238,3.25129e-7,0.000003782348,0.4133365,0.0029721786,0.581092,0.000034868102,0.00014381798],"about_ca_topic_score_codex":0.000011420097,"about_ca_topic_score_gemma":1.2006937e-7,"teacher_disagreement_score":0.7369386,"about_ca_system_score_codex":0.00001457727,"about_ca_system_score_gemma":0.000025768282,"threshold_uncertainty_score":0.96379316},"labels":[],"label_agreement":null},{"id":"W2086722845","doi":"10.1109/icccas.2006.285221","title":"A Quantum Information Network and Its Properties Driven by External Fields","year":2006,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Exponent; Statistical physics; Degree distribution; Topology (electrical circuits); Computer science; Property (philosophy); Quantum; Degree (music); Power law; Field (mathematics); Channel (broadcasting); Complex network; Mathematics; Theoretical computer science; Physics; Quantum mechanics; Statistics; Pure mathematics","score_opus":0.00796995964369534,"score_gpt":0.21041826876689185,"score_spread":0.2024483091231965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086722845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7237051,0.000378581,0.24326801,0.0002561183,0.000038861264,0.00022849336,0.000005308007,0.00014927257,0.031970244],"genre_scores_gemma":[0.9982582,0.0000037126792,0.0006417647,0.000063276675,0.00022461994,0.000018555134,0.000024381672,0.000003617385,0.0007618829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995457,0.000013303999,0.00016271719,0.00006970509,0.000073639756,0.00013494123],"domain_scores_gemma":[0.9998068,0.000009269951,0.000053824773,0.00007569142,0.00003235239,0.000022056864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045694356,0.00007741151,0.000095731586,0.000020115496,0.00007546172,0.00008000832,0.00006359563,0.000020181256,0.00022703383],"category_scores_gemma":[5.0636254e-7,0.00006144663,0.000034872948,0.00006806657,0.000011605994,0.00026554696,0.000046218425,0.00006077701,0.000013750648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030869676,0.00011183001,0.13352895,0.000024407707,0.000103048944,4.3532378e-7,0.00023166694,0.0042198934,0.0019082195,0.46672955,0.35504603,0.038065095],"study_design_scores_gemma":[0.0007476746,0.00014663671,0.013407739,0.000125914,0.00009750499,0.0000021872947,0.000156953,0.78918594,0.010758591,0.08773921,0.0968053,0.0008263733],"about_ca_topic_score_codex":0.0004843235,"about_ca_topic_score_gemma":0.000017831338,"teacher_disagreement_score":0.78496605,"about_ca_system_score_codex":0.000005012964,"about_ca_system_score_gemma":0.0000062590584,"threshold_uncertainty_score":0.25057212},"labels":[],"label_agreement":null},{"id":"W2088047873","doi":"10.2139/ssrn.1989560","title":"Homophily and Long-Run Integration in Social Networks","year":2012,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada); Université Laval","funders":"","keywords":"Homophily; Sociology; Psychology; Social psychology","score_opus":0.007588437176701703,"score_gpt":0.256694701064103,"score_spread":0.2491062638874013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088047873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50100124,0.0024391578,0.49416915,0.00022562209,0.00007701758,0.00009957684,6.410097e-7,0.000027808373,0.0019597756],"genre_scores_gemma":[0.9975077,0.00020479015,0.00015993636,0.000017926885,0.0019203849,0.0000068135073,0.000008907196,0.000014342481,0.00015920086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814874,0.00008422506,0.00021841947,0.00010341886,0.000104189174,0.0013410304],"domain_scores_gemma":[0.99970967,0.000022710847,0.0001132899,0.000069047324,0.0000306926,0.00005459195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095923437,0.00012259933,0.00017042953,0.00010753731,0.00017940014,0.000056038443,0.000108908476,0.000042380027,0.00006552318],"category_scores_gemma":[0.0000020585737,0.00011207599,0.000087487744,0.00022103942,0.000024059877,0.0002490316,0.00003596521,0.001253742,0.0000033488623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015844138,0.000076892175,0.2776089,6.573791e-7,0.00008554719,3.1508065e-7,0.00017500977,0.00003498989,0.000039711784,0.4376459,0.00026026534,0.28405595],"study_design_scores_gemma":[0.0010469917,0.0001638057,0.14539562,0.00004406457,0.00015038581,0.0000705383,0.001812172,0.005344877,0.00010596759,0.8443063,0.0009773383,0.00058195123],"about_ca_topic_score_codex":0.00007487677,"about_ca_topic_score_gemma":0.00029574093,"teacher_disagreement_score":0.49650642,"about_ca_system_score_codex":0.00021909217,"about_ca_system_score_gemma":0.00012213098,"threshold_uncertainty_score":0.5446955},"labels":[],"label_agreement":null},{"id":"W2088131549","doi":"10.1371/journal.pone.0106052","title":"Dimensionality of Social Networks Using Motifs and Eigenvalues","year":2014,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; National Science Foundation","keywords":"Curse of dimensionality; Logarithm; Intrinsic dimension; Metric (unit); Eigenvalues and eigenvectors; Dimension (graph theory); Exploit; Computer science; Complex network; Social network (sociolinguistics); Dimensionality reduction; Scale-free network; Theoretical computer science; Mathematics; Artificial intelligence; Physics; Combinatorics; Social media; Computer security; World Wide Web; Engineering","score_opus":0.042105344796756046,"score_gpt":0.25315238824908254,"score_spread":0.2110470434523265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088131549","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9745224,0.0000346882,0.024168674,0.000029487926,0.0000049775754,0.00006244381,0.000003225897,0.000024085906,0.0011499862],"genre_scores_gemma":[0.9932235,0.0000011290699,0.006381066,0.000015601861,0.00032266925,0.0000027830515,0.000011592669,0.000008700181,0.000032949083],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994066,0.000062909916,0.0001570813,0.00012749236,0.00013101962,0.000114941635],"domain_scores_gemma":[0.99964744,0.00005020493,0.00009634422,0.000118210526,0.000059179667,0.000028639926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001680755,0.00007457403,0.00023549875,0.000024514102,0.00008729807,0.00001168461,0.00005759556,0.000022727076,0.00012204912],"category_scores_gemma":[0.000003409914,0.00007457845,0.000053286174,0.00008405618,0.00005932088,0.00003478059,0.00007767583,0.00006881662,8.5212264e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043267577,0.002854165,0.7555543,0.0000999254,0.0019936138,3.265484e-7,0.0005511652,0.0013089245,0.051356677,0.1625804,0.0006108747,0.023046354],"study_design_scores_gemma":[0.0004414091,0.00007405593,0.06199175,0.0001477865,0.00083016115,1.3288596e-7,0.00006757717,0.8605029,0.023984842,0.051408466,0.00013669822,0.00041419626],"about_ca_topic_score_codex":0.000105485284,"about_ca_topic_score_gemma":0.0000020429723,"teacher_disagreement_score":0.859194,"about_ca_system_score_codex":0.0000069209777,"about_ca_system_score_gemma":0.0000061769806,"threshold_uncertainty_score":0.3041221},"labels":[],"label_agreement":null},{"id":"W2088835748","doi":"10.1007/bf02949831","title":"The impact of non-Gaussian distribution traffic on network performance","year":2002,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Gaussian; Range (aeronautics); Gaussian process; Traffic generation model; Marginal distribution; Gaussian network model; Probability density function; Algorithm; Simulation; Real-time computing; Statistics; Mathematics; Random variable; Physics","score_opus":0.006624346709116896,"score_gpt":0.24712193004527663,"score_spread":0.24049758333615973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088835748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97147226,0.00009445726,0.027618742,0.00047723207,0.00006778352,0.000043490247,7.470083e-7,0.000010876615,0.00021441795],"genre_scores_gemma":[0.99884593,0.00004856296,0.00090275955,0.000005250635,0.00018888137,8.3529847e-7,2.3437109e-7,0.0000022052463,0.0000053303843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924034,0.000011368503,0.00025729087,0.00009389611,0.00018792905,0.00020915523],"domain_scores_gemma":[0.9992174,0.000038898044,0.00029735532,0.00018308403,0.00022322635,0.000040055354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003949094,0.00007681195,0.00017631736,0.00014246887,0.00025556676,0.00004654411,0.00043811122,0.000025725805,0.000008742262],"category_scores_gemma":[0.0000038894195,0.00004400064,0.0000742889,0.0010209124,0.00045042235,0.00013048906,0.00007694459,0.00019580577,0.0000010646273],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007928717,0.00007436834,0.014938059,0.0000011340961,0.000045300683,0.0000011032207,0.000030583982,0.006986404,0.00014384312,0.0042840573,0.0054048738,0.96808237],"study_design_scores_gemma":[0.00037062805,0.0022381295,0.051430423,0.000104784245,0.000028389792,0.000048518767,0.00002264072,0.9372332,0.001332211,0.0048037157,0.0022311127,0.00015622156],"about_ca_topic_score_codex":0.0000021671294,"about_ca_topic_score_gemma":2.787505e-7,"teacher_disagreement_score":0.96792614,"about_ca_system_score_codex":0.00003200643,"about_ca_system_score_gemma":0.000051123723,"threshold_uncertainty_score":0.19656387},"labels":[],"label_agreement":null},{"id":"W2089397652","doi":"10.1016/j.disc.2014.06.020","title":"Firefighting on square, hexagonal, and triangular grids","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ryerson University","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Conjecture; Square tiling; Square (algebra); Multiplicative function; Grid; Hexagonal crystal system; Discrete mathematics; Graph; Geometry; Mathematical analysis; Crystallography","score_opus":0.011190456765124372,"score_gpt":0.2579566958760887,"score_spread":0.24676623911096435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089397652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.598246,0.00006995272,0.2999989,0.00031269965,0.000058465866,0.0003361464,0.000021418631,0.00022150626,0.10073492],"genre_scores_gemma":[0.9874047,0.0000017058534,0.011826106,0.00005461736,0.00027701212,0.00002029753,0.00002779895,0.000024777793,0.00036297645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991687,0.000039501672,0.00024887928,0.00019152004,0.00016231825,0.00018908495],"domain_scores_gemma":[0.99926585,0.00018862975,0.00012256889,0.0003325615,0.000025813202,0.00006456387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026634822,0.00016143003,0.00026951073,0.00005420002,0.000117084805,0.00007749663,0.00012895865,0.000026452051,0.0002219466],"category_scores_gemma":[0.000019697984,0.00013093368,0.0001081503,0.00011215456,0.000037578633,0.00004553377,0.00006892643,0.000108211076,0.000029644723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058813253,0.000120345045,0.0028027499,0.0000639421,0.00010826603,7.057227e-7,0.0006789852,0.00003548017,0.00016953102,0.96813834,0.0029889545,0.024886832],"study_design_scores_gemma":[0.0011891513,0.00033148352,0.0013023658,0.0005187207,0.00033034754,0.0000033481197,0.0011055743,0.27169198,0.0049243085,0.67323756,0.044245318,0.0011198595],"about_ca_topic_score_codex":0.000013467925,"about_ca_topic_score_gemma":8.2444114e-7,"teacher_disagreement_score":0.38915873,"about_ca_system_score_codex":0.000008432768,"about_ca_system_score_gemma":0.0000055807927,"threshold_uncertainty_score":0.5339321},"labels":[],"label_agreement":null},{"id":"W2089727530","doi":"10.1177/0759106311426997","title":"Understanding Sequencing in Social Network Communications","year":2012,"lang":"fr","type":"article","venue":"Bulletin of Sociological Methodology/Bulletin de Méthodologie Sociologique","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Conceptualization; Context (archaeology); Humanities; Sociology; Computer science; Philosophy; Artificial intelligence; Geography","score_opus":0.5780477217126787,"score_gpt":0.42737550621376885,"score_spread":0.15067221549890986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089727530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045541916,0.030239783,0.8070122,0.094030425,0.0014617762,0.0018297979,0.00013861356,0.00059275905,0.019152729],"genre_scores_gemma":[0.51231486,0.0028268546,0.47966158,0.0014950854,0.0026646943,0.00029625878,0.00009144954,0.000074215066,0.00057502475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9313374,0.06133029,0.0024183872,0.0011019605,0.00032841743,0.003483527],"domain_scores_gemma":[0.9469103,0.049469396,0.0017484812,0.0012699303,0.00023353718,0.00036836177],"candidate_categories":["metaresearch","metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.04928682,0.001101453,0.003128299,0.0002688411,0.0010613538,0.000050328963,0.002443669,0.0039118757,0.004732939],"category_scores_gemma":[0.0068133003,0.0011072495,0.0014232617,0.0007124339,0.006999293,0.000067801724,0.0023019845,0.005463966,0.00029083333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002073024,0.00054367585,0.19019696,0.00013608384,0.0005656236,0.000014818077,0.0030135836,0.001501219,0.0006334766,0.7101656,0.0900513,0.0029703476],"study_design_scores_gemma":[0.0012453638,0.0006251964,0.029416122,0.00039126436,0.00056698493,0.000043263324,0.01961087,0.00030519403,0.00027386303,0.7700887,0.17572188,0.0017113158],"about_ca_topic_score_codex":0.0008139317,"about_ca_topic_score_gemma":0.00001379601,"teacher_disagreement_score":0.4667729,"about_ca_system_score_codex":0.003740305,"about_ca_system_score_gemma":0.0006433433,"threshold_uncertainty_score":0.99913776},"labels":[],"label_agreement":null},{"id":"W2089763102","doi":"10.1007/978-3-540-77004-6_8","title":"A Spatial Web Graph Model with Local Influence Regions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Wilfrid Laurier University; University of British Columbia","funders":"","keywords":"Degree distribution; Preferential attachment; Embedding; Computer science; Exponent; Graph; Metric space; Theoretical computer science; Metric (unit); Range (aeronautics); Degree (music); Node (physics); Complex network; Topology (electrical circuits); Data mining; Mathematics; World Wide Web; Discrete mathematics; Combinatorics; Artificial intelligence; Physics; Engineering","score_opus":0.014413974156930036,"score_gpt":0.25068082550353266,"score_spread":0.2362668513466026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089763102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046148017,0.00004646377,0.9908904,0.0000974741,0.00006412118,0.0002560685,0.000009030075,0.00010346894,0.008071508],"genre_scores_gemma":[0.86472523,0.000004187193,0.13437921,0.0003084494,0.00035117994,0.000009416135,0.000012457289,0.000034492718,0.00017540321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974626,0.0000123555055,0.00037180513,0.0009533671,0.00065945974,0.0005404578],"domain_scores_gemma":[0.99837637,0.00014300738,0.00023577458,0.0008663032,0.00023398889,0.00014455996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003148225,0.0004615919,0.0004720972,0.000659765,0.0002071025,0.00014766383,0.001048626,0.00014088211,0.000046091864],"category_scores_gemma":[0.0000029948028,0.00038887293,0.00015753873,0.00054289575,0.001318364,0.00017298052,0.0003983997,0.0008021467,0.000009101679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015260019,0.000031422594,0.0009291241,0.000007330672,0.00003331285,0.000019263083,0.000125431,0.633003,0.000021967535,0.041769736,0.00003691525,0.32400724],"study_design_scores_gemma":[0.00013146843,0.000073317904,0.000057473655,0.00023235365,0.000028954482,0.0000055655796,1.518117e-7,0.71477133,0.00014998045,0.28369296,0.00040621666,0.00045021533],"about_ca_topic_score_codex":0.0002817508,"about_ca_topic_score_gemma":0.00084709865,"teacher_disagreement_score":0.8642637,"about_ca_system_score_codex":0.00011719584,"about_ca_system_score_gemma":0.00046399803,"threshold_uncertainty_score":0.9998563},"labels":[],"label_agreement":null},{"id":"W2089946007","doi":"10.1109/cason.2011.6085925","title":"Tracking changes in dynamic information networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Dynamic network analysis; Matching (statistics); Complex network; Population; Graph; Social network analysis; Data mining; Social network (sociolinguistics); Evolving networks; Stability (learning theory); Community structure; Tracking (education); Data science; Theoretical computer science; Machine learning; World Wide Web; Social media; Computer network","score_opus":0.015370791573352227,"score_gpt":0.23787608410155617,"score_spread":0.22250529252820395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089946007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0944304,0.000018894367,0.75493705,0.000048517046,0.00004528873,0.00016806489,0.0000011957464,0.00014017249,0.15021044],"genre_scores_gemma":[0.99788404,0.0000030115166,0.0019181555,0.000049120685,0.000034413417,0.0000187932,0.000024737363,0.0000038960807,0.00006383254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996181,0.0000126947225,0.000131106,0.000060170594,0.00004332587,0.00013456737],"domain_scores_gemma":[0.9997882,0.000009539074,0.000048711692,0.000114890725,0.000019854602,0.000018788896],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009197298,0.00006412043,0.000087391054,0.00009391259,0.000022734343,0.000020708703,0.00008664305,0.00001798634,0.001152965],"category_scores_gemma":[5.8669616e-7,0.00005926644,0.00003172999,0.00018292872,0.000009231098,0.00023449921,0.000030605614,0.000075690084,0.000015748605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009224749,0.000072355935,0.22569968,0.000003489989,0.00003706509,4.7889563e-7,0.0011452215,0.0009284407,0.000020595984,0.04481168,0.00073587144,0.7265359],"study_design_scores_gemma":[0.00040663453,0.000056774665,0.21505615,0.00004831621,0.000033169246,5.017458e-7,0.000987464,0.75111187,0.0011279476,0.025239835,0.0054518622,0.00047948892],"about_ca_topic_score_codex":0.0004939276,"about_ca_topic_score_gemma":0.0005357324,"teacher_disagreement_score":0.90345365,"about_ca_system_score_codex":0.000013015335,"about_ca_system_score_gemma":0.000004014948,"threshold_uncertainty_score":0.9997601},"labels":[],"label_agreement":null},{"id":"W2090167811","doi":"10.1109/icdm.2012.145","title":"Profit Maximization over Social Networks","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":114,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Profit maximization; Computer science; Maximization; Profit (economics); Monotonic function; Mathematical optimization; Greedy algorithm; Microeconomics; Econometrics; Operations research; Economics; Mathematics; Algorithm","score_opus":0.019226573456299828,"score_gpt":0.28538072448167506,"score_spread":0.2661541510253752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090167811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006766723,0.00008627473,0.9077776,0.00010070446,0.00025700132,0.0003976544,0.000013309221,0.00027990967,0.0843208],"genre_scores_gemma":[0.9898877,0.0000038065934,0.0031875062,0.000052183805,0.004222192,0.00012240074,0.0007466115,0.00004042537,0.0017371558],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988325,0.0000610777,0.00029426214,0.0003231016,0.00016702354,0.00032204052],"domain_scores_gemma":[0.99925184,0.000017430795,0.00024465128,0.00035375016,0.00007510795,0.00005723029],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015428556,0.00026757125,0.00034952673,0.00006692343,0.00011798775,0.00011062346,0.00026781822,0.00017731424,0.00615777],"category_scores_gemma":[6.38056e-7,0.00025920174,0.00031042757,0.00012960742,0.000029950515,0.0000659913,0.00073723105,0.00050195336,0.000026484846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018390889,0.00020922137,0.406354,0.000044732406,0.0009798221,4.974873e-7,0.000277864,0.02297541,0.000012753252,0.2737276,0.19275604,0.102643676],"study_design_scores_gemma":[0.00067797286,0.000019637237,0.10618496,0.00013277552,0.0013566276,3.7854764e-7,0.00009665409,0.66258496,0.00032333887,0.1812096,0.04452814,0.0028849503],"about_ca_topic_score_codex":0.000326166,"about_ca_topic_score_gemma":0.000008415309,"teacher_disagreement_score":0.983121,"about_ca_system_score_codex":0.00004578701,"about_ca_system_score_gemma":0.000033942444,"threshold_uncertainty_score":0.999986},"labels":[],"label_agreement":null},{"id":"W2090321918","doi":"10.5210/fm.v19i7.4994","title":"Reuse, temporal dynamics, interest sharing, and collaboration in social tagging systems","year":2014,"lang":"en","type":"article","venue":"First Monday","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Metadata; Reuse; World Wide Web; Dynamics (music); Publication; Vocabulary; User-generated content; Information retrieval; Population; Social media","score_opus":0.013202620321308698,"score_gpt":0.26745943505947606,"score_spread":0.25425681473816736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090321918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98914415,0.00003467354,0.0072285337,0.0008681123,0.00009511571,0.0001793553,0.000018563078,0.000082693674,0.00234881],"genre_scores_gemma":[0.99877626,0.0000011429296,0.0003102932,0.0000123059635,0.00036816447,0.000033690507,0.00013116206,0.000016150707,0.00035084016],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992438,0.00004184798,0.0002405834,0.00023693209,0.00007326053,0.00016357964],"domain_scores_gemma":[0.999474,0.000025043946,0.000121142075,0.00030519936,0.00004085017,0.00003375114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023343498,0.00011594756,0.00020993469,0.000105095605,0.00014567112,0.00015887283,0.00025081675,0.00003955484,0.000038144794],"category_scores_gemma":[0.000012904002,0.00012226045,0.00003476263,0.00023637008,0.000029451428,0.000119231474,0.00024377057,0.00012300546,0.000005754687],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009703166,0.000056485263,0.90518904,0.00003229218,0.00004000371,0.0000010119469,0.0033904654,0.00023078038,0.000030047055,0.068401955,0.021089783,0.0015284609],"study_design_scores_gemma":[0.00057272986,0.000052762494,0.017297508,0.00016778542,0.0000346189,5.222947e-7,0.0005913358,0.6923892,0.00004649642,0.014048956,0.27436885,0.00042922175],"about_ca_topic_score_codex":0.0010254014,"about_ca_topic_score_gemma":0.00057808135,"teacher_disagreement_score":0.88789153,"about_ca_system_score_codex":0.00007109215,"about_ca_system_score_gemma":0.00001130302,"threshold_uncertainty_score":0.49856365},"labels":[],"label_agreement":null},{"id":"W2090966237","doi":"10.1140/epjb/e2014-40800-7","title":"The gateway coefficient: a novel metric for identifying critical connections in modular networks","year":2014,"lang":"en","type":"article","venue":"The European Physical Journal B","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Gateway (web page); Modular design; Metric (unit); Computer science; Computer network; Engineering; World Wide Web; Operating system; Operations management","score_opus":0.02541568223942277,"score_gpt":0.3057569263210115,"score_spread":0.2803412440815887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090966237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013330633,0.000076658944,0.97625315,0.00063710613,0.00019481887,0.00016387361,0.0000031681063,0.000035651778,0.009304948],"genre_scores_gemma":[0.99564147,0.0000041383655,0.00058912556,0.000048760405,0.0035950441,0.000012445004,0.0000028975753,0.000035115805,0.000070986855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982904,0.0005773786,0.00033286872,0.00018700307,0.00020753373,0.00040477535],"domain_scores_gemma":[0.99757457,0.0017441721,0.00013396576,0.00032183537,0.00013112818,0.00009434159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019109477,0.00015436408,0.0002139556,0.00007804095,0.000961761,0.00037756248,0.000578566,0.000010602606,0.000008074781],"category_scores_gemma":[0.00011493327,0.000089982044,0.0003172461,0.00056990964,0.00012569355,0.000085902,0.00014521311,0.0005491031,0.000015843438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005783657,0.00073838263,0.00032983968,0.0000076066945,0.0002847491,0.0000038366484,0.0004844299,0.12835428,0.0033209205,0.6397064,0.00680963,0.21990214],"study_design_scores_gemma":[0.00081112364,0.00013573175,0.0025400114,0.00008325363,0.00020776888,0.000013221942,0.00026606923,0.8466341,0.0002943956,0.13017997,0.018502675,0.0003316951],"about_ca_topic_score_codex":0.0000114154645,"about_ca_topic_score_gemma":0.0000024490053,"teacher_disagreement_score":0.98231083,"about_ca_system_score_codex":0.000028316521,"about_ca_system_score_gemma":0.000010698857,"threshold_uncertainty_score":0.73971856},"labels":[],"label_agreement":null},{"id":"W2091214390","doi":"10.1109/tkde.2012.220","title":"Bias Correction in a Small Sample from Big Data","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Estimator; Sample size determination; Computer science; Sampling bias; Big data; Sample (material); Simple random sample; Population size; Sampling (signal processing); Statistics; Reciprocal; Population; Point estimation; Data mining; Mathematics; Telecommunications","score_opus":0.10547437860269274,"score_gpt":0.291973674795889,"score_spread":0.18649929619319625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091214390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02976199,0.00031587214,0.9678766,0.000007196609,0.00079259113,0.00008691838,0.000843008,0.000090901405,0.00022490259],"genre_scores_gemma":[0.9943161,0.000037062564,0.004241915,0.000004113786,0.00046392943,0.000016686821,0.00085270085,0.000020412133,0.000047072077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921894,0.00002390862,0.00018510895,0.00031131005,0.000043518634,0.00021719444],"domain_scores_gemma":[0.9986143,0.00028442778,0.000026760728,0.0009817338,0.000012374025,0.00008040761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020174023,0.00014408729,0.00017150523,0.0001596882,0.000059420283,0.00003768162,0.00034559765,0.000034882567,0.000084223604],"category_scores_gemma":[0.0000046288033,0.00015162403,0.000026389589,0.00027964858,0.000010504908,0.00033799934,0.000024289306,0.00021906346,0.000017820212],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016830129,0.0005624874,0.008457338,0.000016600681,0.00018508578,4.823119e-7,0.0005007351,0.0031869484,0.00084081735,0.00011105943,0.002225028,0.9838966],"study_design_scores_gemma":[0.00057161984,0.00003060772,0.0057300157,0.00016622027,0.00022164064,0.0000015229909,0.00017140097,0.9165331,0.0041234945,0.00013899432,0.07173528,0.00057609536],"about_ca_topic_score_codex":0.0017711378,"about_ca_topic_score_gemma":0.000915329,"teacher_disagreement_score":0.9833205,"about_ca_system_score_codex":0.000020320658,"about_ca_system_score_gemma":0.00001469365,"threshold_uncertainty_score":0.61830485},"labels":[],"label_agreement":null},{"id":"W2091638386","doi":"10.1109/icdmw.2011.12","title":"A Diffusion of Innovation-Based Closeness Measure for Network Associations","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Closeness; Measure (data warehouse); Intersection (aeronautics); Computer science; Context (archaeology); Data science; Data mining; Network science; Representation (politics); Bibliometrics; Centrality; Community structure; Event (particle physics); Network analysis; Theoretical computer science; Complex network; Mathematics; World Wide Web; Geography; Statistics; Engineering","score_opus":0.04526582028915156,"score_gpt":0.27569412493396206,"score_spread":0.2304283046448105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091638386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09090472,0.0000058431056,0.8898521,0.000041262956,0.000036982685,0.00027350156,0.000024459789,0.00006227998,0.01879885],"genre_scores_gemma":[0.97270286,6.9142196e-8,0.026757974,0.0000360908,0.0001543105,0.00006551555,0.00013076444,0.000009581028,0.00014283275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934185,0.00002346337,0.00030176743,0.00010916057,0.000095407224,0.00012833379],"domain_scores_gemma":[0.9990631,0.00009296685,0.00022073546,0.00017172414,0.00043692684,0.000014586296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025339102,0.00007496725,0.00016438059,0.00006772753,0.000083230094,0.0000071583154,0.00010147157,0.000026739459,0.00038946082],"category_scores_gemma":[0.000011856598,0.000067928755,0.000091397764,0.0006576664,0.000015283904,0.00003375404,0.000019238123,0.000039191615,0.0000013212644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017951264,0.00025315653,0.43634588,0.0000055045084,0.00012129307,2.2945411e-8,0.00010102298,0.00018532966,0.00070774404,0.5435196,0.0070945714,0.011647934],"study_design_scores_gemma":[0.001976904,0.00021779293,0.1689599,0.00010648244,0.0004062146,4.087621e-8,0.00015114377,0.062387735,0.04218852,0.71543694,0.0074036536,0.0007646512],"about_ca_topic_score_codex":0.00023716652,"about_ca_topic_score_gemma":0.000039018556,"teacher_disagreement_score":0.88179815,"about_ca_system_score_codex":0.000011912819,"about_ca_system_score_gemma":0.00004908553,"threshold_uncertainty_score":0.42643228},"labels":[],"label_agreement":null},{"id":"W2091687228","doi":"10.1016/j.tcs.2013.01.032","title":"Cops and invisible robbers: The cost of drunkenness","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Psychology","score_opus":0.0059258660472191645,"score_gpt":0.23838519953481221,"score_spread":0.23245933348759304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091687228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34562236,0.00001579367,0.64660406,0.0005552838,0.000043012144,0.00024241133,0.000001015892,0.00003050467,0.0068855593],"genre_scores_gemma":[0.9914219,9.275249e-7,0.008377861,0.00009345733,0.00008051117,0.000013799678,6.7541936e-7,0.0000037221002,0.0000071572404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918014,0.000046566474,0.00015109198,0.00020849232,0.00019828576,0.00021543747],"domain_scores_gemma":[0.99923736,0.00018181268,0.000050624974,0.00033269502,0.00011827771,0.00007921994],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00045552247,0.00008238525,0.0001356497,0.000045026074,0.00017689377,0.00013647942,0.0005448702,0.000010359449,0.00039564667],"category_scores_gemma":[0.0000048536835,0.000050568855,0.000037283877,0.00045425846,0.0027670392,0.00015779465,0.0004259162,0.000089668836,0.000014591165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.915232e-7,0.000019678082,0.0022869653,0.0000012059592,0.000005348471,5.7427865e-8,0.00011688855,0.000041122057,0.00026832896,0.95213026,0.0002311033,0.044898123],"study_design_scores_gemma":[0.00011306382,0.000057983707,0.0075488696,0.00002490988,0.00001564335,0.0000013324427,0.000060240396,0.34961775,0.0057641347,0.63646466,0.00019128883,0.00014010207],"about_ca_topic_score_codex":0.0000678844,"about_ca_topic_score_gemma":5.626794e-7,"teacher_disagreement_score":0.6457995,"about_ca_system_score_codex":0.000006580699,"about_ca_system_score_gemma":0.00002194395,"threshold_uncertainty_score":0.99994683},"labels":[],"label_agreement":null},{"id":"W2091750636","doi":"10.1109/iscas.2010.5537699","title":"Spectral analysis of Internet topology graphs","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Internet topology; Spectral clustering; Adjacency matrix; Laplacian matrix; The Internet; Computer science; Spectral graph theory; Eigenvalues and eigenvectors; Laplace operator; Matrix (chemical analysis); Cluster analysis; Topology (electrical circuits); Network topology; Adjacency list; Topological data analysis; Theoretical computer science; Mathematics; Computer network; Artificial intelligence; Graph; World Wide Web; Physics; Algorithm; Combinatorics","score_opus":0.007464582850213272,"score_gpt":0.26795178038435885,"score_spread":0.26048719753414556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091750636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8976031,0.0000024905694,0.025076605,0.000047032863,0.00004008341,0.000034969522,0.0000043888926,0.00003733806,0.07715397],"genre_scores_gemma":[0.99521005,2.7222637e-7,0.003800754,0.000017387854,0.000052870604,0.000004095554,0.000030105597,0.0000040398445,0.0008804145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994843,0.000014926838,0.00018516657,0.0001365753,0.00005797451,0.00012107823],"domain_scores_gemma":[0.9995592,0.000033198507,0.000071603055,0.00026773897,0.000035643185,0.000032572512],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007894406,0.00007141804,0.00025136856,0.00026899372,0.000012544048,0.000009088099,0.00017152572,0.000022203538,0.01595469],"category_scores_gemma":[0.0000012503792,0.000060905026,0.00030706258,0.00064064655,0.00006931603,0.000026907168,0.000048219896,0.000118298216,0.000007179086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001965072,0.000046299225,0.40685314,3.8939052e-7,0.0009626763,1.3932656e-7,0.000033730837,0.000011001109,0.0028303452,0.5854537,0.0011802829,0.002626338],"study_design_scores_gemma":[0.00046980332,0.00016180579,0.4366063,0.000005023025,0.0048299567,8.253044e-7,0.00030420496,0.062103797,0.13008061,0.35181955,0.012879536,0.00073861226],"about_ca_topic_score_codex":0.001705186,"about_ca_topic_score_gemma":0.0010302793,"teacher_disagreement_score":0.23363414,"about_ca_system_score_codex":0.0000020375082,"about_ca_system_score_gemma":0.000006507239,"threshold_uncertainty_score":0.9849449},"labels":[],"label_agreement":null},{"id":"W2093312554","doi":"10.1007/s10100-012-0258-3","title":"Sequential clustering with radius and split criteria","year":2012,"lang":"en","type":"article","venue":"Central European Journal of Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Royal Military College of Canada; HEC Montréal","funders":"","keywords":"Cluster analysis; Homogeneity (statistics); RADIUS; Complete-linkage clustering; Cluster (spacecraft); k-medians clustering; Mathematics; Single-linkage clustering; Determining the number of clusters in a data set; Homogeneous; Set (abstract data type); Correlation clustering; Computer science; Algorithm; Combinatorics; Data mining; CURE data clustering algorithm; Statistics","score_opus":0.07503335675284213,"score_gpt":0.3740511940266259,"score_spread":0.2990178372737838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093312554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.903852,0.00029201186,0.08647842,0.00026365113,0.0000772791,0.00012397149,0.0000049288924,0.000009783819,0.00889795],"genre_scores_gemma":[0.9871828,0.000021735448,0.011431619,0.000009087894,0.0011064158,0.0000011294126,0.0000051268726,0.000017750175,0.00022436878],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9984311,0.0005875179,0.0002606769,0.000085007625,0.00025957238,0.00037615234],"domain_scores_gemma":[0.99930626,0.000028604993,0.0000371644,0.00013353593,0.00026193034,0.00023251431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013920921,0.00007989688,0.0001294546,0.00014508824,0.0002498826,0.0002572339,0.00017231083,0.000006425427,0.00056499924],"category_scores_gemma":[0.000010700251,0.000060491424,0.00004675681,0.00019255871,0.00010481395,0.00038124062,0.00010630412,0.00032918973,0.000010516522],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095279724,0.0022282077,0.27980292,0.0001240729,0.0022293574,0.00043974703,0.017139502,0.017094804,0.11839244,0.06685109,0.039668232,0.45507684],"study_design_scores_gemma":[0.009841903,0.004031399,0.548935,0.0015925426,0.00073841924,0.0016130542,0.008370321,0.17238092,0.02594222,0.0007691669,0.22321235,0.0025726918],"about_ca_topic_score_codex":0.000025649957,"about_ca_topic_score_gemma":0.0000045200545,"teacher_disagreement_score":0.45250416,"about_ca_system_score_codex":0.00003180405,"about_ca_system_score_gemma":0.000050923594,"threshold_uncertainty_score":0.6186345},"labels":[],"label_agreement":null},{"id":"W2094083250","doi":"10.1016/j.tcs.2011.05.016","title":"An edge deletion model for complex networks","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.035898796686286094,"score_gpt":0.28954232575921907,"score_spread":0.25364352907293297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094083250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017538961,0.0000022509487,0.97790813,0.000024957328,0.000058316356,0.0002074737,0.0000037292823,0.00012417372,0.0041320142],"genre_scores_gemma":[0.73314714,1.7755985e-7,0.26646698,0.000102992286,0.0002393926,0.000020332996,0.000010703773,0.000008737317,0.0000035112546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987216,0.00004017457,0.0002038375,0.00042930673,0.00018230769,0.00042279746],"domain_scores_gemma":[0.99905556,0.000050671297,0.000057259833,0.00048490305,0.0001701661,0.00018145173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006555928,0.00013950393,0.00017742363,0.00007733297,0.00032991494,0.00010131519,0.00082881073,0.000024485073,0.00025192468],"category_scores_gemma":[0.0000021393164,0.0001216573,0.000094533265,0.0003399466,0.0011689125,0.00022873154,0.00017938687,0.000097983735,0.0000061757924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012633798,0.00009255133,0.0003516478,8.804205e-7,0.000005250368,1.100872e-7,0.0001566746,0.00590859,0.00017405378,0.9600272,0.00014319636,0.03312717],"study_design_scores_gemma":[0.000067509194,0.00007645577,0.0003546101,0.0000034646976,0.000010706533,2.7849856e-7,0.0000031361267,0.6607999,0.0002916903,0.33826506,0.000016943588,0.000110244415],"about_ca_topic_score_codex":0.0000088684765,"about_ca_topic_score_gemma":7.6318196e-7,"teacher_disagreement_score":0.71560824,"about_ca_system_score_codex":0.00001866037,"about_ca_system_score_gemma":0.000033190223,"threshold_uncertainty_score":0.49610406},"labels":[],"label_agreement":null},{"id":"W2095047577","doi":"10.1145/1149941.1149945","title":"A social hypertext model for finding community in blogs","year":2006,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Centrality; Hypertext; Computer science; World Wide Web; Set (abstract data type); Sense of community; Measure (data warehouse); Virtual community; Social network (sociolinguistics); Online community; Community structure; Social network analysis; Sample (material); Data science; Social media; The Internet; Information retrieval; Data mining; Psychology; Social psychology; Mathematics","score_opus":0.052316931957986514,"score_gpt":0.31767073602457807,"score_spread":0.26535380406659154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095047577","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59571403,0.0000038770304,0.3626382,0.00012661838,0.0000044878557,0.00014455577,0.0000072938637,0.000055966484,0.041304994],"genre_scores_gemma":[0.99241966,5.8344863e-8,0.0060188603,0.000034952973,0.00011575633,0.00005513719,0.000050492563,0.000008582226,0.0012964822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954194,0.00003388995,0.00014554505,0.000076352335,0.000042987944,0.00015929794],"domain_scores_gemma":[0.999758,0.00006449053,0.000035254245,0.00011122328,0.000020770762,0.000010264912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001609007,0.000072420975,0.00014169705,0.000051818613,0.00018574353,0.000022554843,0.00012614187,0.000021269781,0.00007362331],"category_scores_gemma":[8.2731293e-7,0.00007121403,0.00010011074,0.00010994731,0.000017768356,0.000042475986,0.00005011144,0.00012451649,0.0000024013802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002165063,0.0008024859,0.07595955,0.00001136699,0.000058125206,1.9891792e-7,0.00087492476,0.009532901,0.0013736029,0.8300022,0.05587078,0.02549222],"study_design_scores_gemma":[0.00027870495,0.0000070201213,0.0017680352,0.000003437236,0.000014034229,3.317275e-8,0.00012213986,0.6986787,0.00030230015,0.298192,0.00052055216,0.00011308331],"about_ca_topic_score_codex":0.002737285,"about_ca_topic_score_gemma":0.00081899867,"teacher_disagreement_score":0.68914574,"about_ca_system_score_codex":0.000020895855,"about_ca_system_score_gemma":0.000012683796,"threshold_uncertainty_score":0.41379747},"labels":[],"label_agreement":null},{"id":"W2097439479","doi":"10.1109/icassp.2012.6288560","title":"A novel use of stochastic approximation algorithms for estimating degree of each node in social networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Adjacency matrix; Markov chain; Degree distribution; Regular graph; Mathematics; Degree (music); Random graph; Random geometric graph; Graph; Discrete mathematics; Upper and lower bounds; Computer science; Algorithm; Combinatorics; Line graph; Voltage graph; Complex network; Statistics","score_opus":0.09357836979797461,"score_gpt":0.3238214127425483,"score_spread":0.23024304294457365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097439479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01973791,0.000007919464,0.97969043,0.000008192696,0.000025616857,0.0002720124,0.000012697656,0.000018649847,0.00022654975],"genre_scores_gemma":[0.60995626,2.1147258e-8,0.3897275,0.0000031523293,0.00021318483,0.000039197246,0.00004117902,0.00000808111,0.000011421995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992065,0.000017545477,0.00036576597,0.00010153554,0.000094689,0.00021400463],"domain_scores_gemma":[0.9993643,0.00018012595,0.00023879088,0.00011250516,0.00007967955,0.000024563831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026083228,0.00009781045,0.00026526273,0.00008212549,0.00003954327,0.0000105342815,0.00008244319,0.00003549153,0.000024717208],"category_scores_gemma":[0.000010871533,0.00009464671,0.000112928115,0.00021022177,0.000028943481,0.00017038212,0.000047517173,0.00007150185,1.979641e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008129526,0.0019150075,0.06441653,0.00013901456,0.00035768354,3.3265973e-8,0.0017981486,0.39677975,0.003396012,0.1363941,0.0012211427,0.39350128],"study_design_scores_gemma":[0.00027548184,0.000012854463,0.0024891507,0.000029988905,0.00004326871,7.76115e-8,0.0000620403,0.99552166,0.00027292522,0.0011963211,0.0000066818784,0.0000895409],"about_ca_topic_score_codex":0.00035962704,"about_ca_topic_score_gemma":0.000010669881,"teacher_disagreement_score":0.5987419,"about_ca_system_score_codex":0.000017674984,"about_ca_system_score_gemma":0.000012571023,"threshold_uncertainty_score":0.38595808},"labels":[],"label_agreement":null},{"id":"W2100241383","doi":"10.1109/asonam.2011.110","title":"Predicting a Social Network Structure Once a Node Is Deleted","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Betweenness centrality; Centrality; Node (physics); Computer science; Exploit; Network structure; Social network (sociolinguistics); Network science; Dynamic network analysis; Theoretical computer science; Complex network; Computer network; Computer security; Mathematics; World Wide Web; Engineering; Combinatorics; Social media","score_opus":0.019321865351778742,"score_gpt":0.24805544343520392,"score_spread":0.22873357808342518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100241383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7344255,0.000033729513,0.1295285,0.00012833874,0.00009407304,0.00025364573,0.000033842603,0.00049603125,0.13500637],"genre_scores_gemma":[0.9819226,2.683e-7,0.016474308,0.00022500275,0.0010786307,0.000009909448,0.000017751132,0.000017428005,0.00025409335],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991283,0.00003166774,0.00019873587,0.00022227886,0.00011455272,0.00030446128],"domain_scores_gemma":[0.99959785,0.00001790074,0.00010156659,0.00018422431,0.00005271345,0.0000457193],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006448496,0.00013958612,0.00018893804,0.000026457437,0.00021329008,0.000029145325,0.00019239279,0.00004115687,0.0052958513],"category_scores_gemma":[9.407623e-7,0.00012659631,0.00013226751,0.0002648398,0.00003037492,0.000073432755,0.00010152265,0.0001679729,0.000011168958],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028099825,0.00007878735,0.8386556,0.000006282759,0.00048474528,0.0000019068005,0.0032318514,0.0000734041,0.00045937407,0.0620521,0.05940846,0.03551938],"study_design_scores_gemma":[0.0018769497,0.00020016388,0.16248941,0.00014087568,0.0009123347,0.000004569732,0.0019523686,0.15144464,0.01615951,0.62679315,0.035358552,0.0026674927],"about_ca_topic_score_codex":0.00074061396,"about_ca_topic_score_gemma":0.000055939483,"teacher_disagreement_score":0.6761662,"about_ca_system_score_codex":0.000013992041,"about_ca_system_score_gemma":0.000019618195,"threshold_uncertainty_score":0.99561346},"labels":[],"label_agreement":null},{"id":"W2100476241","doi":"10.1145/1610304.1610308","title":"Comparison of network criticality, algebraic connectivity, and other graph metrics","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Betweenness centrality; Criticality; Algebraic connectivity; Computer science; Robustness (evolution); Network topology; Complex network; Theoretical computer science; Node (physics); Graph theory; Algebraic number; Graph; Mathematics; Computer network; Laplacian matrix; Engineering; Statistics","score_opus":0.0333579709491339,"score_gpt":0.35029502908624444,"score_spread":0.31693705813711054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100476241","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49403498,0.0004726294,0.40602058,0.00043385357,0.000039162966,0.00024265576,0.000009139848,0.00015318586,0.0985938],"genre_scores_gemma":[0.9946256,0.0000013685627,0.004984028,0.0001873573,0.00013475817,0.0000027400836,0.000003654476,0.0000070915207,0.00005335633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913186,0.00006381014,0.00027362866,0.00018760288,0.0001360377,0.00020707704],"domain_scores_gemma":[0.9993592,0.00021748031,0.00007759696,0.00022318494,0.000057341393,0.000065225984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023869955,0.000118224176,0.00036161632,0.00008974603,0.000061523686,0.000032122916,0.00011526537,0.000030139909,0.00042057564],"category_scores_gemma":[0.0000075131748,0.00010666879,0.000108475164,0.00054239004,0.00007054361,0.000048574973,0.000059549657,0.000102631355,0.0000021856977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031775705,0.00015650327,0.45313415,0.000002367988,0.00004301872,6.765989e-8,0.000021398944,0.000040493294,0.00007765663,0.52982014,0.004081543,0.012619473],"study_design_scores_gemma":[0.0002747644,0.0001925409,0.08463044,0.00002326161,0.00013583721,3.7976795e-7,0.00010332924,0.010152335,0.003410683,0.8976449,0.0031352877,0.00029623447],"about_ca_topic_score_codex":0.00017744751,"about_ca_topic_score_gemma":0.000017021026,"teacher_disagreement_score":0.5005907,"about_ca_system_score_codex":0.000005025447,"about_ca_system_score_gemma":0.0000072496773,"threshold_uncertainty_score":0.46050084},"labels":[],"label_agreement":null},{"id":"W2101113783","doi":"10.48550/arxiv.1008.2005","title":"Approximation Analysis of Influence Spread in Social Networks","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Maximization; Viral marketing; Set (abstract data type); Task (project management); Greedy algorithm; Budget constraint; Mathematical optimization; Context (archaeology); Computer science; Simple (philosophy); Approximation algorithm; Selection (genetic algorithm); Mathematics; Economics; Artificial intelligence","score_opus":0.03438320849683092,"score_gpt":0.20973451181094305,"score_spread":0.17535130331411214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101113783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7492007,0.0000060442144,0.24836941,0.000006358667,0.000028420249,0.00015321004,0.000022803642,0.000039658986,0.0021734042],"genre_scores_gemma":[0.99921685,0.000008080049,0.00030624558,0.0000063549446,0.00011651043,0.000002256354,0.00023721493,0.000013036704,0.00009342383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987027,0.00010884686,0.00032765503,0.0005632483,0.000065680826,0.00023189196],"domain_scores_gemma":[0.99864775,0.00006964012,0.0005216081,0.00056011725,0.00015234722,0.00004854289],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002341649,0.00023628489,0.00064434024,0.00074150716,0.00007201433,0.000029520443,0.0005653283,0.00024181236,0.00018890179],"category_scores_gemma":[0.0000042620395,0.00029629143,0.0005151984,0.0020356094,0.00011736813,0.000113104186,0.0005575384,0.00077321153,0.0000025217914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000147504325,0.0000905726,0.22832157,0.0000107236965,0.00071270845,0.000002747803,0.00008713277,0.70993006,0.000035861383,0.060089055,0.00003242969,0.0006724036],"study_design_scores_gemma":[0.00015220545,0.0000063362404,0.066128634,0.000028021033,0.0014804758,1.7591857e-8,0.00005556442,0.89813745,0.00006124313,0.033644516,0.00003028275,0.00027522843],"about_ca_topic_score_codex":0.0017177992,"about_ca_topic_score_gemma":0.00050438754,"teacher_disagreement_score":0.25001618,"about_ca_system_score_codex":0.00007035411,"about_ca_system_score_gemma":0.000056523815,"threshold_uncertainty_score":0.9999489},"labels":[],"label_agreement":null},{"id":"W2101318094","doi":"10.1145/2505515.2505599","title":"Originator or propagator?","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Engineering and Physical Sciences Research Council; Microsoft Research Asia; National Natural Science Foundation of China","keywords":"Propagator; Computer science; Physics; Mathematical physics","score_opus":0.009653856690581646,"score_gpt":0.25594096597755717,"score_spread":0.24628710928697553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101318094","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38246408,0.000014578122,0.07380216,0.000630625,0.00007413746,0.00067182345,0.000002344271,0.00056677865,0.5417735],"genre_scores_gemma":[0.97789496,2.5131132e-7,0.0057444233,0.00006771847,0.00017880359,0.00009380479,0.000004244368,0.000008766307,0.016007036],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995422,0.000011688889,0.000105983934,0.00012328362,0.00007126085,0.0001455904],"domain_scores_gemma":[0.999652,0.000017494025,0.000028928334,0.00019634489,0.000049807568,0.000055414905],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000032540407,0.000076810175,0.000100907084,0.000028705796,0.000042098658,0.00005457763,0.00011883681,0.000010548227,0.04215446],"category_scores_gemma":[9.807009e-7,0.00004875972,0.000053966116,0.00014633805,0.000016716362,0.00010924898,0.00003971406,0.000051072948,0.0009104842],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004586435,0.00015063536,0.094330214,0.00000447013,0.00012769719,9.530054e-7,0.00003800755,0.0000035210185,0.0010437742,0.36793005,0.39148843,0.14487766],"study_design_scores_gemma":[0.00061002176,0.00014888278,0.009720766,0.000026707059,0.000080942795,0.0000016232101,0.00035188696,0.012964475,0.03578875,0.18371415,0.7556507,0.00094111264],"about_ca_topic_score_codex":0.0005369625,"about_ca_topic_score_gemma":0.000004637265,"teacher_disagreement_score":0.59543085,"about_ca_system_score_codex":0.000008732741,"about_ca_system_score_gemma":0.0000214549,"threshold_uncertainty_score":0.99986744},"labels":[],"label_agreement":null},{"id":"W2101912780","doi":"10.1109/asonam.2009.15","title":"A Visual Data Mining Approach to Find Overlapping Communities in Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Outlier; Computer science; Scalability; Intuition; Data mining; Visualization; Community structure; Data visualization; Machine learning; Artificial intelligence; Database; Statistics; Mathematics","score_opus":0.05092384800342735,"score_gpt":0.3177640856825561,"score_spread":0.26684023767912873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101912780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16126831,0.00005193593,0.71867007,0.00009641325,0.000015590096,0.00020579199,0.0000039135675,0.00010072704,0.11958726],"genre_scores_gemma":[0.9746675,0.0000016908377,0.024223113,0.00029784124,0.00019583764,0.000010577129,0.00034809328,0.000008879478,0.00024648153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990856,0.000067545465,0.00024546208,0.00021220464,0.00010114345,0.00028803226],"domain_scores_gemma":[0.99910295,0.00007838466,0.000046001707,0.0006984332,0.00001848097,0.000055757464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031163258,0.00013560856,0.0002362616,0.0001241001,0.00008591097,0.000095523355,0.00059014553,0.000026137252,0.00015081381],"category_scores_gemma":[0.0000022025954,0.00013419904,0.00004099163,0.00041353938,0.000016360289,0.00016231404,0.00036828153,0.00017467998,0.0000034910195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050827395,0.0013795239,0.15907408,0.00000797897,0.00019308327,0.000001994933,0.0035697117,0.0993073,0.00012424432,0.05278397,0.06620801,0.61729926],"study_design_scores_gemma":[0.00016242903,0.00003744401,0.015997237,0.000040905852,0.000015173934,3.173703e-7,0.0025169437,0.97726816,0.0000089754,0.00074000057,0.00297287,0.00023956173],"about_ca_topic_score_codex":0.0008702172,"about_ca_topic_score_gemma":0.00008796369,"teacher_disagreement_score":0.87796086,"about_ca_system_score_codex":0.000017166372,"about_ca_system_score_gemma":0.000014088564,"threshold_uncertainty_score":0.54724777},"labels":[],"label_agreement":null},{"id":"W2102549231","doi":"10.1007/s10115-006-0023-9","title":"Node similarity in the citation graph","year":2006,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Dalhousie University","funders":"Southeast University; Dalhousie University","keywords":"Computer science; Graph; Complementarity (molecular biology); Theoretical computer science; Similarity (geometry); Citation; Random geometric graph; Similitude; Information retrieval; Data mining; Artificial intelligence; Line graph; Voltage graph; World Wide Web","score_opus":0.01017648760587226,"score_gpt":0.24321623998598907,"score_spread":0.23303975238011682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102549231","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23801003,0.00058782595,0.07877822,0.00017292157,0.00017587536,0.00068649166,0.00002169198,0.000095497395,0.68147147],"genre_scores_gemma":[0.9995604,0.0000028059758,0.00004592026,0.000025394107,0.00014819451,0.00005084126,0.00010798638,0.0000018638876,0.000056593355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994363,0.000059842016,0.0002857473,0.000048131595,0.000082114464,0.00008782809],"domain_scores_gemma":[0.99966997,0.000045906712,0.000090743415,0.0001121735,0.00007038453,0.000010795227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035871362,0.00006564549,0.00009419722,0.00012664798,0.00008327612,0.00013223733,0.000076104065,0.00002113797,0.000009745947],"category_scores_gemma":[0.0000017582859,0.000047502588,0.000033338547,0.00031229903,0.000015351712,0.0006746443,0.000014386683,0.000065947745,0.000032055228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005987396,0.00009833739,0.14573576,0.00007590455,0.000024207815,1.4320817e-7,0.004603974,0.00078719563,0.000023732475,0.7829243,0.05171754,0.014002911],"study_design_scores_gemma":[0.0008893238,0.000036210284,0.19858457,0.00010781173,0.000042635354,0.0000028948348,0.0048438786,0.086844295,0.00010374742,0.019029101,0.6891016,0.0004139278],"about_ca_topic_score_codex":0.0005513974,"about_ca_topic_score_gemma":0.00003798954,"teacher_disagreement_score":0.7638952,"about_ca_system_score_codex":0.000009877157,"about_ca_system_score_gemma":0.000009138165,"threshold_uncertainty_score":0.19370994},"labels":[],"label_agreement":null},{"id":"W2102707884","doi":"10.1038/npre.2011.5608.1","title":"Disordered Proteins and Network Disorder in Network Descriptions of Protein Structure, Dynamics and Function: Hypotheses and a Comprehensive Review","year":2011,"lang":"en","type":"preprint","venue":"Nature Precedings","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Network structure; Function (biology); Dynamics (music); Structure function; Computational biology; Psychology; Computer science; Physics; Biology; Evolutionary biology; Theoretical computer science","score_opus":0.012966128832433522,"score_gpt":0.24947832152510319,"score_spread":0.23651219269266965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102707884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6380423,0.33214673,0.01638934,0.0006209476,0.00036348632,0.0095605245,0.00033189871,0.00021271358,0.0023320944],"genre_scores_gemma":[0.9816052,0.005742937,0.011480587,0.00008319662,0.00034207926,0.00041614793,0.00020748713,0.000055564295,0.00006679996],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979223,0.00015038444,0.00059423095,0.0007581981,0.00019323494,0.00038164158],"domain_scores_gemma":[0.99858695,0.0000992593,0.0005753836,0.00043148152,0.00020842266,0.000098520315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022059957,0.0005212914,0.00107402,0.00012400896,0.00014110244,0.00007836247,0.0002275569,0.00044696286,0.00008842992],"category_scores_gemma":[0.000025569461,0.00048545207,0.00012691098,0.00041963777,0.0002244883,0.0001176123,0.0009474593,0.0017704626,1.4424069e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004778791,0.00041382294,0.5192318,0.012812579,0.0022020896,0.0000033480278,0.0010627996,0.0010396311,0.0003744993,0.20471925,0.007346361,0.25031593],"study_design_scores_gemma":[0.0010711947,0.00027310118,0.09923188,0.020554854,0.0012418961,0.000007559146,0.00021365589,0.007860806,0.000067240646,0.8583904,0.009419568,0.0016678389],"about_ca_topic_score_codex":0.0004651348,"about_ca_topic_score_gemma":0.0006771378,"teacher_disagreement_score":0.65367115,"about_ca_system_score_codex":0.000031735133,"about_ca_system_score_gemma":0.000049251237,"threshold_uncertainty_score":0.99975973},"labels":[],"label_agreement":null},{"id":"W2102799228","doi":"10.5539/nct.v1n2p1","title":"Modeling Latency in a Network Distribution","year":2012,"lang":"en","type":"article","venue":"Network and Communication Technologies","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Latency (audio); Computer science; Reliability (semiconductor); Transmission (telecommunications); Computer network; Data transmission; Real-time computing; Regression analysis; Telecommunications; Machine learning","score_opus":0.016129567653293524,"score_gpt":0.25714297623796584,"score_spread":0.24101340858467232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102799228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65542454,0.03815874,0.2901125,0.0017928693,0.000108617496,0.00066795666,0.0000089398445,0.0021658286,0.011560029],"genre_scores_gemma":[0.99166405,0.0010087634,0.0069491835,0.000014366673,0.000114321614,0.000104957966,0.00011338604,0.000009975981,0.000021009275],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990149,0.00008031173,0.00027859458,0.00014073236,0.00007308208,0.00041236955],"domain_scores_gemma":[0.99915457,0.00007019657,0.00008366057,0.0006328305,0.00003284603,0.000025872738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044466826,0.00013621968,0.00020398753,0.000042550757,0.00023452796,0.00003729142,0.00034735506,0.000089536734,0.00002288494],"category_scores_gemma":[0.00000810583,0.00013213305,0.000040380088,0.00055182766,0.000084009036,0.00019918197,0.0004328458,0.00032261072,0.000005092341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082108345,0.00008423491,0.427217,0.0000037350087,0.0000343657,7.853408e-8,0.000097666874,0.020544814,0.0000062592862,0.39224386,0.0026584493,0.1571013],"study_design_scores_gemma":[0.0003276734,0.00003351651,0.013213339,0.00018163194,0.00005574471,0.0000012994323,0.0011961289,0.3458859,0.000062687504,0.6240767,0.014450659,0.0005146773],"about_ca_topic_score_codex":0.00015294577,"about_ca_topic_score_gemma":0.000033611195,"teacher_disagreement_score":0.41400367,"about_ca_system_score_codex":0.000028351264,"about_ca_system_score_gemma":0.000007278394,"threshold_uncertainty_score":0.5388229},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020532423285766616,"score_gpt":0.27613023573709344,"score_spread":0.25559781245132684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102920490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33643717,0.00024712738,0.4843109,0.00032910402,0.00018395517,0.00036109253,0.000001079907,0.0002584241,0.17787115],"genre_scores_gemma":[0.99528193,0.0000010892857,0.0024790892,0.000024700836,0.0019165634,0.000020754878,0.000016927288,0.000008686187,0.00025022903],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994112,0.000032825857,0.00013492057,0.00010391231,0.0000608916,0.00025623362],"domain_scores_gemma":[0.999807,0.000010572538,0.00004065937,0.00009925805,0.000015240889,0.00002725118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020400208,0.00007461407,0.000111705995,0.000050647326,0.000062917665,0.000018514931,0.00006500865,0.000015697875,0.0005478664],"category_scores_gemma":[7.141205e-7,0.00007075347,0.000059888993,0.00022652492,0.00001178728,0.00014442968,0.00004417575,0.000107127125,0.000014206628],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005126103,0.00015140502,0.7907942,0.0000017131279,0.000026162948,1.01003536e-7,0.00015886172,0.0006639429,0.000086200955,0.08733551,0.009868778,0.11090799],"study_design_scores_gemma":[0.00091654307,0.000032772008,0.8360817,0.00004370121,0.00013110165,0.0000012011627,0.00088106544,0.07150665,0.0022568766,0.022815634,0.06404971,0.0012830525],"about_ca_topic_score_codex":0.00011319591,"about_ca_topic_score_gemma":0.000008040088,"teacher_disagreement_score":0.65884477,"about_ca_system_score_codex":0.000021116211,"about_ca_system_score_gemma":0.000004716487,"threshold_uncertainty_score":0.5998753},"labels":[],"label_agreement":null},{"id":"W2104071108","doi":"10.1145/2487788.2488009","title":"Towards linking buyers and sellers","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sandia National Laboratories; University of North Carolina at Chapel Hill; Samsung; Slovenská technická univerzita v Bratislave; Singapore Management University; Universität Innsbruck; Université de Lyon; Universiteit Hasselt; University of Illinois at Urbana-Champaign; Universität Stuttgart; Universidade Federal de Pernambuco; Peking University; Universidade Federal de Minas Gerais; Technische Universität Berlin; Universidad de Chile; Universidade de São Paulo; Los Alamos National Laboratory; College of Computing; National and Kapodistrian University of Athens; Chinese University of Hong Kong; Centre National de la Recherche Scientifique; SLAC National Accelerator Laboratory; Universidade Federal do Maranhão; Technische Universität Wien; Vrije Universiteit Brussel; Hong Kong Polytechnic University; Sapienza Università di Roma; Universität Leipzig; Athabasca University; Cyprus University of Technology; Tsinghua University; Fondazione Bruno Kessler; Leibniz-Gemeinschaft; Pennsylvania State University; Simon Fraser University; Indiana University Bloomington; Università degli Studi di Padova; Universidad de Valladolid; Euskal Herriko Unibertsitatea; Fudan University; Hanyang University; Universität Bielefeld; Vrije Universiteit Amsterdam; Universidade Federal do Amazonas; Erasmus Universiteit Rotterdam; University of California, Santa Barbara; University of Ioannina; Université de Fribourg; Google; Universiteit van Amsterdam; Pohang University of Science and Technology; Weizmann Institute of Science; University of California, San Diego; Aalto-Yliopisto; University of Galway; Nanyang Technological University; National University of Singapore; University of Oxford; University College London; Universidade Federal do Rio de Janeiro; College of Charleston; Carl von Ossietzky Universität Oldenburg; Université de Montpellier; University of Twente; Instituto Federal de Educação, Ciência e Tecnologia da Paraíba; Microsoft Research Asia; University of Waterloo; Max Planck Institute for Software Systems; Stony Brook University; Karlsruhe Institute of Technology; Institut \"Jožef Stefan\"; University of Michigan; University of Cyprus; Eidgenössische Technische Hochschule Zürich; Indian Institute of Technology Bombay; Institut national de recherche en informatique et en automatique (INRIA); Santa Fe Institute; Princeton University; University of Pennsylvania; University of Patras; Dartmouth College; Sveučilište u Zagrebu; Università degli Studi di Trento; Universidad Nacional de La Plata; Lunds Universitet; Dalhousie University; Hebrew University of Jerusalem; University of Maryland, Baltimore County; DePaul University; Universidade Federal de Ouro Preto; Athens University of Economics and Business; Korea University; Carnegie Mellon University; Rensselaer Polytechnic Institute; Helsingin Yliopisto; Ohio State University; Institute for Scientific Interchange; Northwestern University; Universidade Federal do Rio Grande do Norte; University of Minnesota; Pontificia Universidad Católica de Chile; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Johns Hopkins Bloomberg School of Public Health; Freie Universität Berlin; University of Rochester; Cardiff University; Institute for Infocomm Research; Universität Ulm; École des Mines de Nantes; Universidad de Alicante; Emory University; University of Southern California; Adobe Systems; Purdue University; University of Glasgow; Universität des Saarlandes; George Mason University; University of Aberdeen; Harvard University; Arizona State University; Brown University; Indraprastha Institute of Information Technology, Delhi; Kyungpook National University; University of New South Wales; National University of Ireland; Kempe Foundation; University of Louisville; University of Toronto; Korea Advanced Institute of Science and Technology; University of Alberta; Clemson University; Università degli Studi di Firenze; Aalborg Universitet; University of Washington; King Mongkut's University of Technology Thonburi; Intel Corporation; Microsoft Research; Technische Universität Chemnitz; Raytheon Company; Universidade de Santiago de Compostela; Baidu; Technische Universität Darmstadt; Lehigh University; Carleton College; Case Western Reserve University; Technische Universiteit Delft; Siemens; Facebook; Yale University","keywords":"Task (project management); Recall; Computer science; Work (physics); Precision and recall; Social media; Internet privacy; Data science; Business; World Wide Web; Artificial intelligence; Engineering; Psychology","score_opus":0.008048487032177908,"score_gpt":0.23151433325179607,"score_spread":0.22346584621961815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104071108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5993094,0.000036221318,0.06305518,0.00051579153,0.000025691998,0.00017147145,7.381655e-7,0.00015848884,0.33672702],"genre_scores_gemma":[0.99005127,0.0000023441207,0.008711578,0.00007798443,0.000106365784,0.00001505777,0.0000050715016,0.0000062867425,0.0010240234],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962384,0.0000096280955,0.000083764666,0.00011348344,0.000052351144,0.00011694846],"domain_scores_gemma":[0.9997839,0.000014838823,0.000022500375,0.00010843527,0.000025684327,0.000044672084],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000042514446,0.000066238914,0.000088120614,0.00003101289,0.000048990198,0.00006220694,0.000062229854,0.000012118146,0.0031102556],"category_scores_gemma":[4.1220792e-7,0.000055190358,0.000040661645,0.00007596681,0.000019738727,0.000076534256,0.00005557707,0.00005362137,0.000052784126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000107053,0.000037616453,0.14250049,0.000005048209,0.00015038277,2.566187e-7,0.00024515446,0.00002810581,0.0011924616,0.08693405,0.02682977,0.7420756],"study_design_scores_gemma":[0.0011056026,0.00013738187,0.078388,0.00009393501,0.00021495075,0.0000021666033,0.0026939367,0.10040262,0.02147074,0.63456523,0.15918809,0.0017373197],"about_ca_topic_score_codex":0.0010296598,"about_ca_topic_score_gemma":0.0000045485467,"teacher_disagreement_score":0.74033827,"about_ca_system_score_codex":0.000004798799,"about_ca_system_score_gemma":0.000006804918,"threshold_uncertainty_score":0.99780107},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021228984444530943,"score_gpt":0.2885582191907317,"score_spread":0.2673292347462008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104075446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034936368,0.00011068869,0.90996647,0.000011867205,0.00012813386,0.00028787533,0.000007628829,0.00009629105,0.08589741],"genre_scores_gemma":[0.976423,0.000010371276,0.0169241,0.000029625,0.00030449548,0.00005721963,0.00036327593,0.000036050336,0.0058518606],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998726,0.000096204065,0.0004907845,0.00036190305,0.00012169642,0.00020342572],"domain_scores_gemma":[0.99882066,0.000050938725,0.00037426178,0.00056508335,0.00013583376,0.000053228538],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017432273,0.00024843845,0.0004728407,0.00016730135,0.00003640337,0.00004090398,0.0002684797,0.00008922671,0.0019853488],"category_scores_gemma":[0.0000019189627,0.0002459506,0.0003093023,0.00031106986,0.000039136932,0.000020974161,0.00037623566,0.0002799738,0.000004684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016980839,0.00072720594,0.36369488,0.00010941011,0.0009939532,8.98908e-7,0.00011742503,0.22949262,0.00006354241,0.30158523,0.046399616,0.05679827],"study_design_scores_gemma":[0.00042141444,0.00003114705,0.0060160123,0.00036182694,0.0004867167,1.6550186e-7,0.00003805745,0.900065,0.0031243023,0.065338366,0.023003938,0.0011130631],"about_ca_topic_score_codex":0.0005942608,"about_ca_topic_score_gemma":0.00020180346,"teacher_disagreement_score":0.97292936,"about_ca_system_score_codex":0.00002298411,"about_ca_system_score_gemma":0.000034420984,"threshold_uncertainty_score":0.9999993},"labels":[],"label_agreement":null},{"id":"W2104293880","doi":"10.1103/physreve.83.056105","title":"Locally optimal heuristic for modularity maximization of networks","year":2011,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristics; Heuristic; Modularity (biology); Computer science; Consistent heuristic; Hierarchical clustering; Maximization; Mathematics; Mathematical optimization; Algorithm; Theoretical computer science; Artificial intelligence; Cluster analysis; Incremental heuristic search; Search algorithm; Beam search","score_opus":0.031040316128877032,"score_gpt":0.30317082458353634,"score_spread":0.2721305084546593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104293880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043440773,0.001479939,0.991144,0.000020647574,0.000018530553,0.0004707978,0.0000100028565,0.000033929777,0.0024780796],"genre_scores_gemma":[0.9883838,0.00023741701,0.010899501,0.00005611338,0.0002214443,0.00010732822,0.000057493395,0.000015283691,0.000021605265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992477,0.00004308551,0.00026900353,0.00018555622,0.00009430856,0.0001603064],"domain_scores_gemma":[0.99931043,0.000061709994,0.00017039929,0.00027472063,0.0001325,0.000050260416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013856606,0.00012225383,0.00041979665,0.000015886144,0.000033671004,0.000005510259,0.000175762,0.000012435797,0.0001491112],"category_scores_gemma":[0.000014262146,0.000107194464,0.00029686847,0.00018646181,0.0000416432,0.000053679905,0.000054642034,0.00008031271,0.0000046770583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007022793,0.0018337509,0.005366283,0.0013102943,0.00044080525,7.074658e-7,0.00015991727,0.0040829913,0.00017111952,0.6536888,0.0072764144,0.32559872],"study_design_scores_gemma":[0.00038271298,0.0002556013,0.002090782,0.0012492525,0.00092131854,3.1135227e-7,0.000008085435,0.81226426,0.0014854636,0.1769222,0.0039290627,0.00049096625],"about_ca_topic_score_codex":0.00004030496,"about_ca_topic_score_gemma":6.5727403e-7,"teacher_disagreement_score":0.9840397,"about_ca_system_score_codex":0.000007686787,"about_ca_system_score_gemma":0.000014137678,"threshold_uncertainty_score":0.43712634},"labels":[],"label_agreement":null},{"id":"W2106335950","doi":"10.1109/tit.2008.926315","title":"Network Inference From Co-Occurrences","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Convergence (economics); Inference; Random walk; Random permutation; Permutation (music); Monte Carlo method; Random graph; Exponential growth; Belief propagation; Stochastic process","score_opus":0.017909350498590364,"score_gpt":0.2635177903557149,"score_spread":0.24560843985712452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106335950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021978416,0.000007760161,0.95864135,0.000026448179,0.00019496179,0.0001220069,0.00012130052,0.00017143549,0.018736292],"genre_scores_gemma":[0.99822265,0.0000122721485,0.0011523777,0.00019504807,0.00013589431,0.00006018986,0.00009086039,0.000005644764,0.0001250783],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911815,0.00007795273,0.00033535017,0.000102276266,0.00018207745,0.00018420533],"domain_scores_gemma":[0.9991942,0.0002792434,0.0001410951,0.00026020725,0.00006531633,0.00005990878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015646797,0.00014352071,0.00015885857,0.000108243796,0.00039837972,0.00004597361,0.00018625964,0.000039178907,0.0034064709],"category_scores_gemma":[0.0000013809702,0.0001362745,0.00011941816,0.0002567365,0.000092877664,0.0007522523,0.0000011652007,0.00021925766,0.0004906182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002471201,0.00037296687,0.003915471,0.000010495637,0.0005564838,0.000001244748,0.0072901924,0.18737279,0.000055084256,0.1495025,0.023558898,0.62711674],"study_design_scores_gemma":[0.002869199,0.00047745748,0.00869236,0.000307865,0.00046195005,0.000007708119,0.0035143376,0.0749229,0.041912615,0.77403647,0.08995909,0.0028380423],"about_ca_topic_score_codex":0.000111259666,"about_ca_topic_score_gemma":0.0000031958796,"teacher_disagreement_score":0.9762442,"about_ca_system_score_codex":0.000021077441,"about_ca_system_score_gemma":0.00004897439,"threshold_uncertainty_score":0.99750453},"labels":[],"label_agreement":null},{"id":"W2106435568","doi":"10.1145/1081870.1081948","title":"A fast kernel-based multilevel algorithm for graph clustering","year":2005,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":121,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cluster analysis; Computer science; Correlation clustering; Algorithm; Graph partition; Clustering coefficient; Spectral clustering; Graph; CURE data clustering algorithm; Power graph analysis; Canopy clustering algorithm; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.01568065875773655,"score_gpt":0.2774245638028065,"score_spread":0.26174390504506995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106435568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017115086,0.00001011495,0.9930099,0.000117437965,0.000022523576,0.00024176633,0.000025160787,0.00015544127,0.004706105],"genre_scores_gemma":[0.588042,1.8550385e-7,0.41033986,0.00010528608,0.00039650896,0.00010567717,0.000040919833,0.000016509659,0.00095304917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992496,0.000011426118,0.00019462671,0.00022072518,0.000081986094,0.00024163569],"domain_scores_gemma":[0.9995455,0.000056773388,0.00005774157,0.00022197973,0.000058509733,0.00005948346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008985026,0.00013712561,0.0001711778,0.000078411635,0.00009244701,0.0000440934,0.00015094625,0.0000221409,0.00063037785],"category_scores_gemma":[8.6547175e-7,0.00012728316,0.00022176799,0.00010338677,0.000020821903,0.000068916954,0.000043082302,0.000061338724,0.000018679806],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035505564,0.00009105597,0.0007868066,0.0000025712632,0.000050602754,9.120101e-8,0.000024474912,0.0021503163,0.00014812683,0.0013074473,0.0031672919,0.99226767],"study_design_scores_gemma":[0.00046297428,0.00002018438,0.00021675744,0.000009838099,0.000028431052,9.9448734e-8,0.00002966715,0.975401,0.004055468,0.0014809001,0.018117072,0.00017762503],"about_ca_topic_score_codex":0.000116318406,"about_ca_topic_score_gemma":0.000040593222,"teacher_disagreement_score":0.99209005,"about_ca_system_score_codex":0.000018724792,"about_ca_system_score_gemma":0.000016738688,"threshold_uncertainty_score":0.6902195},"labels":[],"label_agreement":null},{"id":"W2106684638","doi":"10.1109/iri.2012.6303017","title":"Interactive visualization of the social network of research collaborations","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Social network (sociolinguistics); Information retrieval; Graph; Multidimensional scaling; Social network analysis; Visualization; Metric (unit); Graph Layout; XML; Relational database; Data science; Graph drawing; Data mining; Theoretical computer science; World Wide Web; Social media; Machine learning","score_opus":0.052742454247386314,"score_gpt":0.4264329640405417,"score_spread":0.3736905097931554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106684638","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.666643,0.00006118557,0.1248582,0.0004427044,0.00020077532,0.00068624463,0.000023395494,0.000048338716,0.20703614],"genre_scores_gemma":[0.9988023,3.7539215e-7,0.00042807098,0.000005199589,0.00041308865,0.000012644138,0.000008669342,0.0000043309174,0.00032534526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993529,0.00017082009,0.00015255087,0.00004585753,0.00015558631,0.00012232883],"domain_scores_gemma":[0.9992608,0.0001128416,0.00010106399,0.000113405535,0.00039920027,0.000012734139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036905825,0.000034800796,0.00008996848,0.000026881424,0.00013174691,0.000006953669,0.000105385145,0.000013818093,0.0004177594],"category_scores_gemma":[0.000008771972,0.000024969822,0.000056250086,0.00093986164,0.00007598573,0.00007997792,0.00009008909,0.000062436506,0.0000018663223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054372713,0.00011667309,0.18758836,0.0000023682057,0.000057827365,1.6408722e-9,0.0010306463,0.00006721346,0.00065123977,0.7866216,0.02295382,0.0009048689],"study_design_scores_gemma":[0.00086298777,0.00018747472,0.46595737,0.00022236774,0.00033890674,2.0747385e-7,0.019977054,0.0132747665,0.21310516,0.23503543,0.050427973,0.00061029725],"about_ca_topic_score_codex":0.00014598167,"about_ca_topic_score_gemma":0.000022487744,"teacher_disagreement_score":0.5515861,"about_ca_system_score_codex":0.000015939226,"about_ca_system_score_gemma":0.000036747195,"threshold_uncertainty_score":0.45741725},"labels":[],"label_agreement":null},{"id":"W2108063157","doi":"10.1109/tc.2006.83","title":"An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Government of Ontario","keywords":"Shortest path problem; Shortest Path Faster Algorithm; Algorithm; Floyd–Warshall algorithm; K shortest path routing; Computer science; Graph; Mathematics; Theoretical computer science","score_opus":0.007588173983234923,"score_gpt":0.2548482205699203,"score_spread":0.24726004658668538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108063157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016121205,0.000009122922,0.9828012,0.00003269263,0.000305518,0.00046507007,0.0000370113,0.00018166055,0.00004654649],"genre_scores_gemma":[0.9539057,4.6416733e-7,0.045603797,0.000044287885,0.00016144199,0.00015517966,0.00007955712,0.00003770354,0.00001184573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985821,0.000049592603,0.00035964092,0.00043201147,0.00014145121,0.0004351493],"domain_scores_gemma":[0.99927974,0.00020027344,0.00008007109,0.00031493837,0.000042875166,0.00008212573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018675548,0.00024633878,0.00028157476,0.00025019297,0.00016413387,0.00007572138,0.00022512939,0.000052961834,0.000030375137],"category_scores_gemma":[1.2673748e-7,0.00027285534,0.0002186912,0.00033108675,0.00004561519,0.00006825804,0.0000019730405,0.000252146,0.0000036626361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008980839,0.0003661017,0.000023771934,5.4458087e-7,0.000042702613,0.0000015285167,0.0000412185,0.8510122,0.000018337847,0.00021852013,0.00006154006,0.1482046],"study_design_scores_gemma":[0.00045878862,0.00014775115,0.00017349307,0.000044321016,0.00006140521,0.0000011239705,0.00006818308,0.99814373,0.0000533143,0.0005480319,0.000031186493,0.00026869454],"about_ca_topic_score_codex":0.000342485,"about_ca_topic_score_gemma":0.00015971986,"teacher_disagreement_score":0.9377845,"about_ca_system_score_codex":0.00013494141,"about_ca_system_score_gemma":0.000025986568,"threshold_uncertainty_score":0.99997234},"labels":[],"label_agreement":null},{"id":"W2108424850","doi":"10.1186/s40649-015-0013-8","title":"A study on the influential neighbors to maximize information diffusion in online social networks","year":2015,"lang":"en","type":"article","venue":"Computational Social Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Iran Telecommunication Research Center; National Research Foundation of Korea; National IT Industry Promotion Agency; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Maximization; Viral marketing; Computer science; Diffusion; Social network (sociolinguistics); Control (management); Mathematical optimization; Data science; Operations research; Social media; Mathematics; World Wide Web; Artificial intelligence","score_opus":0.03092943649076229,"score_gpt":0.3021121997038541,"score_spread":0.2711827632130918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108424850","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5833909,0.000008046373,0.41264707,0.0016330364,0.000214435,0.0008477454,0.000016653825,0.00009241978,0.0011496873],"genre_scores_gemma":[0.99548113,2.5311e-7,0.00036798025,0.0012285209,0.0023712572,0.00010422676,0.00041223541,0.000019792153,0.0000146193315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979817,0.00030699116,0.00058987516,0.0002349076,0.0005287137,0.00035779644],"domain_scores_gemma":[0.9990565,0.00023500898,0.0002466248,0.00013190946,0.00022870615,0.00010122159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054864556,0.0002432184,0.00032918045,0.00014588569,0.00045403294,0.00017840862,0.00033730993,0.0000865125,0.000064070315],"category_scores_gemma":[0.000019122252,0.00021009019,0.00015315438,0.0009368519,0.000054872376,0.00024420547,0.00025144345,0.00045891642,0.000019749517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012954717,0.0005026982,0.024693439,6.2618506e-7,0.000077375844,0.0000011741316,0.003286427,0.912354,1.1279595e-7,0.016961541,0.017783357,0.024209697],"study_design_scores_gemma":[0.0014576114,0.00014815426,0.27517667,0.000017339496,0.00004720974,2.111696e-7,0.0037298596,0.69932514,1.7684071e-7,0.017924603,0.001821536,0.00035146892],"about_ca_topic_score_codex":0.00022408181,"about_ca_topic_score_gemma":0.0000719739,"teacher_disagreement_score":0.4122791,"about_ca_system_score_codex":0.00015108437,"about_ca_system_score_gemma":0.000072286864,"threshold_uncertainty_score":0.85672295},"labels":[],"label_agreement":null},{"id":"W2109051794","doi":"10.1177/0165551510392147","title":"Identification of dependency patterns in research collaboration environments through cluster analysis","year":2010,"lang":"en","type":"article","venue":"Journal of Information Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Information Technology Research Centre","keywords":"Dependency (UML); Economic shortage; Cluster analysis; Identification (biology); Cluster (spacecraft); Computer science; Work (physics); Measure (data warehouse); Index (typography); Data science; Data mining; Artificial intelligence; Ecology; World Wide Web; Engineering","score_opus":0.026819402074334472,"score_gpt":0.38464509976627737,"score_spread":0.3578256976919429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109051794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8264569,0.0000015164906,0.17241497,0.00010711703,0.00005398096,0.000073067546,0.0000044906283,0.0000013214678,0.0008865958],"genre_scores_gemma":[0.998159,0.000005716232,0.0017675374,0.000011543322,0.000034661814,0.0000030502752,0.000004851202,0.0000011871955,0.000012466336],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980259,0.000052053267,0.0008466664,0.000062436295,0.00089207146,0.00012090068],"domain_scores_gemma":[0.99827653,0.00005495367,0.0008359431,0.00021453452,0.000583575,0.00003445224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036323152,0.000045752557,0.00013597915,0.001092666,0.000089954854,0.00014058336,0.0004096025,0.00002093236,0.0001279265],"category_scores_gemma":[0.00007730026,0.000039459963,0.00006482795,0.0029922447,0.00012312653,0.0042182202,0.000058824873,0.00023774443,0.000006831623],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000415181,0.00020937972,0.86100644,0.00001201324,0.0001131632,3.1957208e-7,0.007858824,0.012858763,0.07635266,0.017324692,0.0002752262,0.023946974],"study_design_scores_gemma":[0.00068553106,0.000102898775,0.70172507,0.00003911449,0.00013368689,0.000002533153,0.005288762,0.07550594,0.19799604,0.016437482,0.001870287,0.0002126549],"about_ca_topic_score_codex":0.000063869185,"about_ca_topic_score_gemma":0.000043114553,"teacher_disagreement_score":0.17170206,"about_ca_system_score_codex":0.000052329364,"about_ca_system_score_gemma":0.00012994859,"threshold_uncertainty_score":0.30581078},"labels":[],"label_agreement":null},{"id":"W2109807035","doi":"10.1007/3-540-45071-8_29","title":"Perturbation of the Hyper-Linked Environment","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; PageRank; Stability (learning theory); Link (geometry); Link analysis; Perturbation (astronomy); Data mining; Theoretical computer science; Algorithm; Machine learning; Computer network","score_opus":0.01148093721732509,"score_gpt":0.21841780307538025,"score_spread":0.20693686585805515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109807035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007505047,0.000116670395,0.98954207,0.00022086091,0.00018946771,0.0002328631,0.0000040821647,0.000013752425,0.0089297015],"genre_scores_gemma":[0.9549797,0.000010202954,0.043179046,0.0003223209,0.00033314223,0.000007685046,0.00000752711,0.000022995162,0.0011373889],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866533,0.000023539653,0.0002826676,0.0004336901,0.00040411527,0.00019063418],"domain_scores_gemma":[0.99888664,0.00010767793,0.00023836024,0.0006917576,0.000044138334,0.00003144275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023323318,0.00021582459,0.00026991148,0.00012969614,0.0001042022,0.000039081217,0.00070884574,0.000071533614,0.0002218949],"category_scores_gemma":[0.000004489268,0.0001551815,0.00016337326,0.00015311406,0.0004013502,0.000051489253,0.00028789815,0.00031900854,0.0000054540087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036651693,0.000070500006,0.003377204,0.000014481998,0.000047821068,6.7022376e-7,0.00037251928,0.05892716,0.0008336578,0.05396824,0.00013081514,0.8822533],"study_design_scores_gemma":[0.00019467024,0.00007227476,0.0007757495,0.00025548466,0.00006583618,0.0000024029882,3.2950754e-7,0.102771185,0.0073933266,0.8699026,0.017980969,0.00058518065],"about_ca_topic_score_codex":0.00001648169,"about_ca_topic_score_gemma":0.0000032810137,"teacher_disagreement_score":0.9542292,"about_ca_system_score_codex":0.00008943216,"about_ca_system_score_gemma":0.000069751346,"threshold_uncertainty_score":0.6328118},"labels":[],"label_agreement":null},{"id":"W2110711283","doi":"10.1109/icc.2013.6654892","title":"Robust network design","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Robustness (evolution); Computer science; Markov chain; Mathematical optimization; Network packet; Network topology; Robust optimization; Markov process; Topology (electrical circuits); Mathematics; Computer network; Machine learning","score_opus":0.03347110334615506,"score_gpt":0.23089771880987486,"score_spread":0.1974266154637198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110711283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015793352,0.000014910271,0.9039183,0.000114072995,0.000021545497,0.00016307303,1.5731104e-7,0.00012864119,0.09405995],"genre_scores_gemma":[0.8260385,5.713679e-7,0.16961871,0.000099325014,0.0004986919,0.0000685903,0.000005694962,0.000010226058,0.0036597017],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994431,0.000034135275,0.00011996706,0.0001290426,0.00006282544,0.0002109278],"domain_scores_gemma":[0.9996174,0.00005003577,0.00003307883,0.00020966628,0.000039829498,0.000049981405],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008655463,0.000083341336,0.00011011645,0.00001833482,0.00006648254,0.00006176838,0.00012969118,0.000013350471,0.020125281],"category_scores_gemma":[5.861501e-7,0.000068515954,0.00006966255,0.00016368569,0.000015048566,0.00008815348,0.000047441583,0.000060022892,0.0005995852],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010911145,0.000039688734,0.020013468,5.92214e-7,0.000077148485,1.6538615e-7,0.000012769526,0.03500559,0.00007873631,0.08357051,0.81312186,0.048078407],"study_design_scores_gemma":[0.00031022774,0.00007219519,0.008993333,0.000021216752,0.00008150243,5.7424586e-7,0.00011069785,0.38788593,0.0018415692,0.5555892,0.04435999,0.0007335906],"about_ca_topic_score_codex":0.00041790833,"about_ca_topic_score_gemma":0.0000023661742,"teacher_disagreement_score":0.82445914,"about_ca_system_score_codex":0.000006079118,"about_ca_system_score_gemma":0.000008494955,"threshold_uncertainty_score":0.98077047},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012401966851945315,"score_gpt":0.292649307197903,"score_spread":0.28024734034595766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111289574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07478326,0.00013336848,0.92201906,0.0013591293,0.00003658253,0.00012935513,0.000011100692,0.00039523642,0.0011329204],"genre_scores_gemma":[0.98015565,0.00001655567,0.018431913,0.00008206262,0.00008080269,0.000081298946,0.000013817972,0.000019903024,0.0011180217],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989039,0.00005758684,0.00028044396,0.00040337132,0.00010411701,0.00025060633],"domain_scores_gemma":[0.99901307,0.00009988828,0.00008249754,0.0007123869,0.000043284163,0.000048876624],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015761257,0.0002017997,0.00032300915,0.00088141346,0.000096677206,0.000039329872,0.0004671198,0.00011597863,0.002007952],"category_scores_gemma":[0.0000045257234,0.0001976944,0.00020234418,0.00088559923,0.00014978358,0.00008249857,0.000032863754,0.0003351691,0.000046773413],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000345303,0.00021143252,0.0030850545,0.0000013660426,0.002267044,0.0000013149009,0.00022194069,0.00026696397,0.00039090778,0.038005568,0.00018184679,0.95533204],"study_design_scores_gemma":[0.0028982323,0.00083377014,0.0015974041,0.000103741506,0.005417837,0.00002275609,0.0018058975,0.05244728,0.44842377,0.34342033,0.1409895,0.0020394856],"about_ca_topic_score_codex":0.00008701304,"about_ca_topic_score_gemma":0.000036774527,"teacher_disagreement_score":0.95329255,"about_ca_system_score_codex":0.000039055318,"about_ca_system_score_gemma":0.000008206492,"threshold_uncertainty_score":0.99890435},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01199413693648282,"score_gpt":0.28675549934091604,"score_spread":0.2747613624044332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111347866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031507034,0.000013309674,0.96783626,0.0000064704063,0.00015596449,0.00015238253,0.000009625787,0.000112143,0.00020682992],"genre_scores_gemma":[0.9992326,0.000020359374,0.00027754597,0.00016194148,0.00019744027,0.000007610346,0.000046345038,0.000024312652,0.000031847994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988576,0.00006801195,0.00041953853,0.0002455209,0.00021274855,0.00019653756],"domain_scores_gemma":[0.999358,0.00008144764,0.00017928847,0.00013782215,0.00017789518,0.00006552538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026717244,0.00017430144,0.00023786254,0.00039695128,0.00026156224,0.00004687,0.00009745642,0.000059835234,0.00008370995],"category_scores_gemma":[3.3134305e-7,0.00018911618,0.00015534082,0.00086516654,0.00008689232,0.00010814764,0.0000030469205,0.00012491633,0.0000011052247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006186395,0.0005797622,0.0023146092,0.000022138478,0.00021327674,9.279936e-7,0.00051349093,0.0025954102,0.000039423267,0.95587164,0.0006672225,0.03712025],"study_design_scores_gemma":[0.0004988797,0.00013690029,0.0015924993,0.00003014925,0.00010411794,0.0000011164299,0.000050741586,0.9890976,0.005219771,0.002177837,0.00082021265,0.00027017912],"about_ca_topic_score_codex":0.0000335199,"about_ca_topic_score_gemma":0.0000128669135,"teacher_disagreement_score":0.9865022,"about_ca_system_score_codex":0.000012912076,"about_ca_system_score_gemma":0.000014073766,"threshold_uncertainty_score":0.7711934},"labels":[],"label_agreement":null},{"id":"W2111501075","doi":"10.1103/physreve.86.046104","title":"Sampling properties of directed networks","year":2012,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sampling (signal processing); Computer science; Environmental science; Telecommunications","score_opus":0.045932025994280125,"score_gpt":0.3250156605005385,"score_spread":0.27908363450625834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111501075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6737388,0.21789849,0.07734797,0.00032226316,0.00020935562,0.0015716563,0.00001185078,0.0006158791,0.02828375],"genre_scores_gemma":[0.998023,0.0005891167,0.0005321239,0.000058160193,0.0007027415,0.000048708815,0.00001009263,0.000012959046,0.00002313222],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926555,0.000061199884,0.00022120576,0.00010734771,0.00011568348,0.00022899533],"domain_scores_gemma":[0.9994577,0.00004518347,0.00012428313,0.0002481982,0.000057842153,0.00006680109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014705502,0.00011753119,0.0004144375,0.000014870935,0.000033761775,0.0000063444386,0.00013072445,0.000007675942,0.00012937645],"category_scores_gemma":[0.000011073816,0.00008639942,0.0002290466,0.00026407748,0.00003628204,0.00009190125,0.00007182132,0.00010536716,0.000017115091],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024643472,0.0028863496,0.10790585,0.0022357022,0.0009289907,1.7949402e-7,0.0004697094,0.00032256808,0.02247347,0.22509496,0.012561494,0.6250961],"study_design_scores_gemma":[0.0017135667,0.00043331287,0.06069127,0.051999778,0.0075414483,0.0000042093175,0.000197406,0.16643363,0.12304263,0.07191011,0.5096288,0.0064038495],"about_ca_topic_score_codex":0.00003589985,"about_ca_topic_score_gemma":2.5266166e-7,"teacher_disagreement_score":0.6186922,"about_ca_system_score_codex":0.000007809893,"about_ca_system_score_gemma":0.000007230248,"threshold_uncertainty_score":0.3523266},"labels":[],"label_agreement":null},{"id":"W2111539254","doi":"10.1016/s0025-5564(03)00042-7","title":"Using network models to approximate spatial point-process models","year":2003,"lang":"en","type":"article","venue":"Mathematical Biosciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Adolph C. and Mary Sprague Miller Institute for Basic Research in Science, University of California Berkeley; National Science Foundation","keywords":"Moment closure; Computer science; Point process; Process (computing); Spatial network; Enhanced Data Rates for GSM Evolution; Moment (physics); Spatial analysis; Network model; Closure (psychology); Spatial ecology; Space (punctuation); Point (geometry); Data mining; Mathematics; Artificial intelligence; Statistics; Ecology; Geography","score_opus":0.07375228194956573,"score_gpt":0.3150410055843725,"score_spread":0.24128872363480675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111539254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051949408,0.00001596173,0.8985394,0.000059562662,0.00004748831,0.00025128617,0.0000041335175,0.00008632704,0.04904642],"genre_scores_gemma":[0.8741958,3.9278277e-7,0.12550257,0.00008113733,0.0001142009,0.000030928746,0.0000014565222,0.000013695768,0.000059814272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816155,0.000065114866,0.00037962725,0.00043328622,0.00040641197,0.00055401894],"domain_scores_gemma":[0.9992138,0.00007842669,0.00010549977,0.00033305542,0.000075065414,0.00019415475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000589275,0.00021463136,0.00035080174,0.00008030925,0.00027695572,0.00017607104,0.00042140528,0.00003576551,0.00037851828],"category_scores_gemma":[0.000012410993,0.00016926246,0.00012785646,0.00076109933,0.00013886995,0.00033504656,0.00010032524,0.0001014647,0.000026349217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028829347,0.000118898926,0.00016652135,0.000014577843,0.0000180055,5.4612326e-7,0.00039054386,0.15936099,0.00022775299,0.8384198,0.00014436996,0.0011351184],"study_design_scores_gemma":[0.00003131299,0.000012892251,9.5172464e-7,0.000027567694,0.000015212504,7.400301e-7,0.00015279287,0.4758289,0.00082730094,0.522959,0.000014864714,0.00012848582],"about_ca_topic_score_codex":0.00005731954,"about_ca_topic_score_gemma":0.00000393842,"teacher_disagreement_score":0.8222464,"about_ca_system_score_codex":0.00002043803,"about_ca_system_score_gemma":0.00005442883,"threshold_uncertainty_score":0.69023234},"labels":[],"label_agreement":null},{"id":"W2111666030","doi":"10.1109/infocom.2008.4544621","title":"AORTA: Autonomic network control and management system","year":2008,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Betweenness centrality; Computer science; Network management station; Distributed computing; Network topology; Element management system; Network architecture; Network management; Overlay network; Network management application; Survivability; Centrality; The Internet","score_opus":0.007171662662092054,"score_gpt":0.2121009976043068,"score_spread":0.20492933494221477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111666030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14364557,0.00027172256,0.4961557,0.0001422265,0.00011772016,0.00072092155,0.00000559214,0.0006050611,0.3583355],"genre_scores_gemma":[0.9931339,0.000011079082,0.0047843237,0.000051985815,0.00030783413,0.000046798446,0.000005780898,0.000010245824,0.0016480422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999347,0.000023767107,0.00017941935,0.0001890324,0.000062981606,0.0001978425],"domain_scores_gemma":[0.9996472,0.000021232174,0.000053994103,0.0002109039,0.000013761259,0.000052911768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008781337,0.00010836001,0.0002003023,0.000031180403,0.00015022306,0.000021557193,0.000088518354,0.000013439106,0.00013818899],"category_scores_gemma":[8.492988e-8,0.000096454845,0.00007023451,0.00008856863,0.000030986503,0.000041986397,0.000056053104,0.000047029775,0.00003136331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011090556,0.000041055726,0.24208416,0.000016502785,0.00056939153,0.000011876347,0.000030212328,0.0013394823,0.000010136638,0.6865977,0.056320783,0.012967615],"study_design_scores_gemma":[0.004576781,0.00014393912,0.33733973,0.00020892668,0.0009425024,0.00003168235,0.00061631034,0.34088832,0.00013310535,0.013125785,0.30023274,0.001760187],"about_ca_topic_score_codex":0.00012204878,"about_ca_topic_score_gemma":0.0000047522162,"teacher_disagreement_score":0.8494883,"about_ca_system_score_codex":0.000021847902,"about_ca_system_score_gemma":0.000006143547,"threshold_uncertainty_score":0.39333147},"labels":[],"label_agreement":null},{"id":"W2111814513","doi":"10.14778/2535570.2488330","title":"Partitioning and ranking tagged data sources","year":2013,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Ranking (information retrieval); Information retrieval; Categorization; Partition (number theory); Set (abstract data type); Rank (graph theory); Learning to rank; Focus (optics); Data mining; Social media; Data science; World Wide Web; Artificial intelligence; Mathematics","score_opus":0.016600964907052655,"score_gpt":0.23227638965751488,"score_spread":0.21567542475046222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111814513","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902109,0.00011324747,0.00035964386,0.00060891657,0.000023923918,0.00032876394,0.0000060614448,0.000041771316,0.008306759],"genre_scores_gemma":[0.9978105,0.000005943015,0.001842751,0.00003201535,0.00011662299,0.00005012619,0.0000056794856,0.00000821709,0.00012818273],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993232,0.000004495772,0.00018516609,0.00019145885,0.00014794407,0.00014776392],"domain_scores_gemma":[0.9995285,0.000023539451,0.000176167,0.00017034162,0.000070653456,0.00003076946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018486894,0.000091497706,0.00013882828,0.000030443902,0.00013735952,0.00010141486,0.0004233802,0.000011345234,0.00020593191],"category_scores_gemma":[0.000008072168,0.000063947526,0.000043902877,0.00012076031,0.000057366524,0.00023909987,0.0006122765,0.0000783382,0.0000037746597],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075612384,0.00013490782,0.8457416,0.000056195306,0.00032472503,3.3937354e-8,0.0008974551,0.00001886999,0.04420003,0.050766677,0.019358749,0.038493138],"study_design_scores_gemma":[0.001979,0.00013384869,0.12912174,0.0008836778,0.0007901069,0.0000054637735,0.004948171,0.02630422,0.4293917,0.37567985,0.02961612,0.001146113],"about_ca_topic_score_codex":0.00039649493,"about_ca_topic_score_gemma":0.0000020714606,"teacher_disagreement_score":0.7166199,"about_ca_system_score_codex":0.000008146572,"about_ca_system_score_gemma":0.000005246405,"threshold_uncertainty_score":0.26077044},"labels":[],"label_agreement":null},{"id":"W2112804575","doi":"10.1145/2492517.2492633","title":"Incremental local community identification in dynamic social networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Soundness; Computer science; Identification (biology); Community structure; Dynamic network analysis; Key (lock); Frame (networking); Population; Data mining; Data science; Artificial intelligence; Computer security; Mathematics; Computer network; Ecology; Sociology","score_opus":0.009529289300298026,"score_gpt":0.2673468518280712,"score_spread":0.2578175625277732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112804575","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59061676,0.0000045746906,0.4034568,0.000081530045,0.00001541641,0.00014610287,0.0000010010687,0.000051096777,0.005626719],"genre_scores_gemma":[0.9992993,4.8853656e-7,0.00026237112,0.000040131694,0.000059389433,0.00006512317,0.00010540673,0.000008208658,0.00015958298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992842,0.00014994275,0.00023159539,0.000095458876,0.00007739887,0.0001613919],"domain_scores_gemma":[0.9996689,0.00003210648,0.000061954786,0.00018069986,0.0000325347,0.000023806999],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021934079,0.000083679166,0.000121005454,0.00005499849,0.00013507956,0.000062164276,0.00018849288,0.000027485012,0.0015563502],"category_scores_gemma":[5.9462764e-7,0.00008461391,0.00006261266,0.00020562664,0.000054756816,0.00014050015,0.00011023386,0.0002633881,0.00006306392],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011500961,0.0010190095,0.28442347,0.000008276435,0.00016117655,3.6984133e-7,0.0009879398,0.0035740759,0.0026955996,0.040289316,0.022077776,0.6447515],"study_design_scores_gemma":[0.00024470163,0.0000130710005,0.41533875,0.000006775773,0.000016201646,1.14577595e-7,0.0018606693,0.5571524,0.00031139498,0.024679366,0.00017029964,0.00020623174],"about_ca_topic_score_codex":0.009922354,"about_ca_topic_score_gemma":0.00092092995,"teacher_disagreement_score":0.64454526,"about_ca_system_score_codex":0.000064714804,"about_ca_system_score_gemma":0.0000068372437,"threshold_uncertainty_score":0.9993564},"labels":[],"label_agreement":null},{"id":"W2112932846","doi":"10.1002/cplx.10066","title":"Dynamics of social networks","year":2002,"lang":"en","type":"article","venue":"Complexity","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":122,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Evolving networks; Complex network; Simple (philosophy); Small-world network; Degree distribution; Theoretical computer science; Degree (music); Scale (ratio); Path (computing); Scale-free network; Preferential attachment; Human dynamics; Distributed computing; Statistical physics; Data science; Artificial intelligence; World Wide Web; Computer network; Physics; Epistemology","score_opus":0.037617539654884125,"score_gpt":0.27011963176051573,"score_spread":0.2325020921056316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112932846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18768057,0.00009416108,0.56692654,0.0008620211,0.00011773698,0.00025024553,0.00007089988,0.00023122333,0.24376662],"genre_scores_gemma":[0.99786234,8.8430534e-7,0.0014138076,0.000019253173,0.0002880309,0.0000056839417,0.000058293805,0.000010235088,0.00034144806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993238,0.000040493618,0.00021325996,0.00014023995,0.00010204458,0.00018016799],"domain_scores_gemma":[0.9995549,0.000027963744,0.00012049284,0.0002073535,0.000055706245,0.00003359986],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007320271,0.00010078257,0.00023289825,0.00003688101,0.000112554604,0.000014457399,0.00020751986,0.000025914225,0.0048935157],"category_scores_gemma":[0.0000012243455,0.0001054209,0.00016581443,0.00022529779,0.00014681276,0.000038547543,0.00009703735,0.0001212676,0.000015763248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044655576,0.00021944006,0.03582,0.000005480092,0.000102863116,3.960295e-7,0.00016821238,0.00019435801,0.000015251034,0.90728194,0.01882109,0.037366524],"study_design_scores_gemma":[0.00021065267,0.00002366106,0.017788343,0.000006877019,0.00003614443,2.964218e-7,0.00008074608,0.84313065,0.000061105886,0.1351341,0.0033087223,0.00021871962],"about_ca_topic_score_codex":0.000097064054,"about_ca_topic_score_gemma":0.00003361527,"teacher_disagreement_score":0.8429363,"about_ca_system_score_codex":0.00002315902,"about_ca_system_score_gemma":0.000003100593,"threshold_uncertainty_score":0.99601614},"labels":[],"label_agreement":null},{"id":"W2113804969","doi":"10.1007/s11009-013-9325-z","title":"Applications of the Variance of Final Outbreak Size for Disease Spreading in Networks","year":2013,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Outbreak; Mathematics; Random graph; Statistics; Epidemic model; Population; Transmission (telecommunications); Variance (accounting); Econometrics; Graph; Combinatorics; Demography; Computer science; Medicine","score_opus":0.04428539404927821,"score_gpt":0.30963346738387454,"score_spread":0.2653480733345963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113804969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32847112,0.000027679287,0.67022693,0.000054966524,0.00001151506,0.0008811301,0.0000025480333,0.000007786123,0.0003163334],"genre_scores_gemma":[0.82664114,5.1237714e-7,0.17300904,0.000016292412,0.000034202014,0.0002877135,0.0000022751726,0.0000040319405,0.0000047792323],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987955,0.0003257683,0.00041463392,0.0002570754,0.000041271665,0.000165749],"domain_scores_gemma":[0.9968612,0.0025561368,0.00021200132,0.00030492392,0.000040480947,0.00002521162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015881044,0.00009446578,0.0003257673,0.000029443105,0.000052576666,0.000005383305,0.00019843045,0.00004296943,0.000017853896],"category_scores_gemma":[0.0000528664,0.000077912955,0.000070783964,0.00028029404,0.0001773829,0.000014163451,0.00015756798,0.0001558025,1.0602942e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005439697,0.0001794787,0.67709684,0.00008416546,0.00002245368,1.3068452e-8,0.00016310354,0.014337568,0.0003330787,0.1950722,0.000010668653,0.11264604],"study_design_scores_gemma":[0.00022230916,0.0000072027883,0.3311614,0.000022759856,0.00001952579,5.4794874e-8,0.000027806078,0.05734038,0.00020529285,0.6108974,0.000029097928,0.000066726585],"about_ca_topic_score_codex":0.0002588295,"about_ca_topic_score_gemma":0.000022773618,"teacher_disagreement_score":0.49817002,"about_ca_system_score_codex":0.000013170836,"about_ca_system_score_gemma":0.000025861027,"threshold_uncertainty_score":0.31771982},"labels":[],"label_agreement":null},{"id":"W2116273603","doi":"10.1016/j.tcs.2012.01.041","title":"Fighting constrained fires in graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Limiting; Random regular graph; Random graph; Mathematics; Graph; Discrete mathematics; Chordal graph; 1-planar graph; Engineering","score_opus":0.00893920547535462,"score_gpt":0.263824961362226,"score_spread":0.2548857558868714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116273603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6027071,0.00001975197,0.37349153,0.00012211729,0.00010128097,0.000091285576,0.0000012908142,0.00007561797,0.023390042],"genre_scores_gemma":[0.97756845,2.1619047e-7,0.022166455,0.00006602001,0.000185328,0.000005292302,0.0000013449574,0.0000041968774,0.0000027097806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988856,0.000051355615,0.00017639335,0.00020807545,0.00020557204,0.00047304717],"domain_scores_gemma":[0.99941707,0.0001473109,0.00003636134,0.00023168165,0.000035104436,0.00013246805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008344602,0.00009738292,0.00014092385,0.00012560874,0.0001349082,0.0000714521,0.00041233547,0.000013365449,0.00048638968],"category_scores_gemma":[0.000008204737,0.00008059,0.00005534148,0.0007351078,0.0013179292,0.00021251339,0.00023537666,0.0001238855,0.00001967685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012497038,0.000044828947,0.03323656,7.1949285e-7,0.0000023965745,3.1867864e-7,0.000150149,0.00001744856,0.00016684408,0.9416434,0.000032641816,0.024703411],"study_design_scores_gemma":[0.00020413043,0.000043215598,0.023035664,0.000043981025,0.000010688087,0.0000026071234,0.000036991096,0.17263672,0.0049492763,0.79851407,0.00020888505,0.00031374735],"about_ca_topic_score_codex":0.000015336986,"about_ca_topic_score_gemma":4.3112087e-7,"teacher_disagreement_score":0.37486136,"about_ca_system_score_codex":0.000015590022,"about_ca_system_score_gemma":0.0000226378,"threshold_uncertainty_score":0.53256255},"labels":[],"label_agreement":null},{"id":"W2116859224","doi":"10.1145/1367497.1367706","title":"Guanxi in the chinese web - a study of mutual linking","year":2008,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Guanxi; China; Feeling; Computer science; World Wide Web; Graph; Mechanism (biology); Psychology; Social psychology; Epistemology; Political science","score_opus":0.016441733449006977,"score_gpt":0.2836253059384795,"score_spread":0.26718357248947255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116859224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97700804,0.000008937339,0.000565707,0.000023988789,0.000007067775,0.00016469824,6.041618e-7,0.0000198482,0.022201126],"genre_scores_gemma":[0.99948406,8.7719724e-7,0.0002493316,0.000020556814,0.00010899397,0.00002022748,0.0000035597177,0.0000046699893,0.00010773101],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994115,0.000066053995,0.00019065733,0.00010383185,0.00013261162,0.00009532165],"domain_scores_gemma":[0.99960035,0.00006897263,0.00005052225,0.00025090502,0.000019543557,0.000009730005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016027817,0.000073320385,0.00015065233,0.000060354127,0.000051291234,0.0000075169555,0.00021789815,0.000008774571,0.00021189997],"category_scores_gemma":[0.0000015296133,0.0000433586,0.000060895334,0.00042157603,0.000020253694,0.00003522404,0.00005868084,0.00009776954,0.0000043332984],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032788248,0.0005621736,0.9923618,6.4408704e-7,0.000028904731,0.0000021377118,0.0031745587,0.000058590555,0.000066646244,0.001602491,0.00045272187,0.001686052],"study_design_scores_gemma":[0.0020126689,0.00049343694,0.9467088,0.0000267991,0.000074381234,0.000004033095,0.011561685,0.024025695,0.00019580293,0.01263584,0.0018301117,0.00043075968],"about_ca_topic_score_codex":0.00070519786,"about_ca_topic_score_gemma":0.0003294259,"teacher_disagreement_score":0.045653015,"about_ca_system_score_codex":0.0000039575584,"about_ca_system_score_gemma":0.000013111542,"threshold_uncertainty_score":0.23201561},"labels":[],"label_agreement":null},{"id":"W2118105720","doi":"10.1145/2492517.2492586","title":"Temporal subgraph isomorphism","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Subgraph isomorphism problem; Computer science; Isomorphism (crystallography); Database transaction; Induced subgraph isomorphism problem; Theoretical computer science; Focus (optics); Range (aeronautics); Data mining; Graph; Database","score_opus":0.006272180056065599,"score_gpt":0.21737499482442882,"score_spread":0.21110281476836323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118105720","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4762077,0.000032491538,0.11004157,0.00094412355,0.00005868171,0.0003581818,0.0000030341475,0.0004058218,0.4119484],"genre_scores_gemma":[0.989203,3.578978e-7,0.006338623,0.00009835579,0.00014611438,0.000043594973,0.0000197873,0.000008137176,0.0041420716],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995199,0.000013537349,0.00012283443,0.00012402276,0.00007092989,0.00014876573],"domain_scores_gemma":[0.999648,0.000014365883,0.000034397242,0.0002109196,0.00004083186,0.000051530802],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000037152437,0.00008043408,0.000107680906,0.0000468802,0.000046704805,0.000047595913,0.000120248245,0.000012462953,0.024068823],"category_scores_gemma":[3.4530171e-7,0.00006601104,0.0001006902,0.00015183077,0.000025009489,0.000100254554,0.000042023832,0.0000587635,0.0006053129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.523544e-7,0.00008407068,0.5165473,0.0000010516089,0.00007528081,3.020235e-7,0.00003140954,0.0000035841288,0.000776326,0.14141206,0.30834478,0.032723024],"study_design_scores_gemma":[0.00060063,0.00008739122,0.089047655,0.000017378537,0.00007841337,0.0000011186781,0.0003862432,0.012506153,0.0097614275,0.71201634,0.17450543,0.0009918218],"about_ca_topic_score_codex":0.0030409133,"about_ca_topic_score_gemma":0.000009627001,"teacher_disagreement_score":0.57060426,"about_ca_system_score_codex":0.0000041487333,"about_ca_system_score_gemma":0.000006656062,"threshold_uncertainty_score":0.97682333},"labels":[],"label_agreement":null},{"id":"W2118175818","doi":"10.1016/j.dam.2013.04.005","title":"Network descriptors based on betweenness centrality and transmission and their extremal values","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Betweenness centrality; Centrality; Mathematics; Network theory; Transmission (telecommunications); Key (lock); Information transmission; Transmission network; Theoretical computer science; Combinatorics; Discrete mathematics; Computer science; Computer network; Telecommunications; Computer security","score_opus":0.013323665500559644,"score_gpt":0.22446025656908775,"score_spread":0.2111365910685281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118175818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48201683,0.00006407549,0.50849694,0.0001676458,0.000017844848,0.00071604335,0.000013507865,0.00013463394,0.0083724875],"genre_scores_gemma":[0.9661394,0.000004206473,0.03347486,0.00005889939,0.00014081849,0.000081646824,0.000039150134,0.000029635812,0.00003140072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893636,0.00002837973,0.00029224614,0.0002897486,0.00013322232,0.00032003692],"domain_scores_gemma":[0.99923587,0.00017721496,0.000116640185,0.00030735641,0.000024452282,0.00013846431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019108185,0.00026905313,0.0003737792,0.000037333513,0.00017934968,0.0001175042,0.00012627136,0.000049881077,0.00022263866],"category_scores_gemma":[0.0000014691235,0.00019520927,0.00007669318,0.00012574575,0.00009691562,0.00006585842,0.000054317734,0.00013910567,0.0000052561863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008494778,0.0009073057,0.035096344,0.000596961,0.00053740694,0.0000012673172,0.005760631,0.0016236426,0.008999881,0.5886081,0.009840868,0.34794265],"study_design_scores_gemma":[0.0006855896,0.0000723144,0.0065079625,0.0002457889,0.00018003922,4.7034007e-7,0.0011344255,0.23784402,0.0042347154,0.747511,0.0008522787,0.0007313683],"about_ca_topic_score_codex":0.000032471973,"about_ca_topic_score_gemma":6.5356676e-7,"teacher_disagreement_score":0.48412254,"about_ca_system_score_codex":0.000010608946,"about_ca_system_score_gemma":0.000009017858,"threshold_uncertainty_score":0.7960403},"labels":[],"label_agreement":null},{"id":"W2118522628","doi":"10.1109/mcetech.2008.12","title":"NetSim: a Simulation and Visualization Software for Information Network Modeling","year":2008,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Visualization; Software; Network simulation; Data visualization; Software visualization; Software system; Software engineering; Distributed computing; Data mining; Component-based software engineering; Programming language","score_opus":0.02704068186681272,"score_gpt":0.29610399087554884,"score_spread":0.2690633090087361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118522628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027029237,0.000018139155,0.97185504,0.000009677011,0.000014287832,0.0002101119,0.0000026005393,0.00011804041,0.0007428888],"genre_scores_gemma":[0.9716479,0.0000023377213,0.027789276,0.00006199578,0.00019761955,0.000030712366,0.00022107265,0.000006712318,0.000042333384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995413,0.000009972176,0.00018919486,0.00007956193,0.00006614248,0.00011382119],"domain_scores_gemma":[0.9996325,0.00005404067,0.000062215964,0.00007938674,0.00014583157,0.000026040121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000074333286,0.000072121984,0.00009504264,0.000043807828,0.00019570015,0.000032627213,0.000032862736,0.000021166708,0.00003794333],"category_scores_gemma":[0.0000070358315,0.00007053809,0.000034734407,0.0001725359,0.0000089456025,0.00039942883,0.000022872067,0.000024982743,0.000002057089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007636115,0.000007403384,0.011062292,0.0000037439158,0.000016048398,1.072072e-8,0.00011509999,0.94881815,7.8343703e-7,0.02039669,0.0010190107,0.018553128],"study_design_scores_gemma":[0.00014577573,0.000014182226,0.00020460405,0.0000057321026,0.000014977102,1.2541648e-7,0.000019019597,0.98674804,0.000009952073,0.010333076,0.0024208457,0.000083667735],"about_ca_topic_score_codex":0.00004197295,"about_ca_topic_score_gemma":0.0000021300364,"teacher_disagreement_score":0.9446187,"about_ca_system_score_codex":0.000008260073,"about_ca_system_score_gemma":0.000013351552,"threshold_uncertainty_score":0.287646},"labels":[],"label_agreement":null},{"id":"W2119167474","doi":"10.1002/cplx.21717","title":"Response to Dehmer and Mowshowitz","year":2015,"lang":"en","type":"article","venue":"Complexity","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Citation; Center (category theory); Information retrieval; Computer science; Physics; Library science; Chemistry; Crystallography","score_opus":0.08262912684899043,"score_gpt":0.3238732660492656,"score_spread":0.24124413920027515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119167474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9511233,0.000026962947,0.035465647,0.001035269,0.000037228492,0.0001485017,0.00001670665,0.00009595305,0.012050437],"genre_scores_gemma":[0.9906376,1.2204168e-7,0.008469964,0.00019581759,0.00011989586,0.000017385113,0.000012167392,0.000010225145,0.00053680775],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926347,0.00010503291,0.00012751904,0.00020556018,0.00011982236,0.00017857442],"domain_scores_gemma":[0.99930304,0.000054452863,0.0000319915,0.0003014675,0.00007580419,0.00023324047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039156296,0.00010523976,0.00016902937,0.00006184282,0.00006681401,0.00004480773,0.0001414214,0.000014267311,0.00026849692],"category_scores_gemma":[0.00001710586,0.000101324316,0.000043899377,0.00018745246,0.00006745596,0.00005219066,0.00019698792,0.000072858355,0.00007703619],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093499053,0.0003182184,0.46303204,0.000006640052,0.00019813814,0.000005696473,0.0024635766,0.00012217152,0.0041101924,0.18624742,0.30363506,0.03892585],"study_design_scores_gemma":[0.0009491425,0.00025920096,0.16577032,0.000026708101,0.00004744122,0.000003742776,0.000645298,0.005324589,0.0022972345,0.3517655,0.47220853,0.0007022681],"about_ca_topic_score_codex":0.00031807885,"about_ca_topic_score_gemma":0.00003241607,"teacher_disagreement_score":0.29726171,"about_ca_system_score_codex":0.000024042669,"about_ca_system_score_gemma":0.000030184425,"threshold_uncertainty_score":0.41318855},"labels":[],"label_agreement":null},{"id":"W2119361765","doi":"10.1002/asi.23591","title":"Visualizing the world's scientific publications","year":2015,"lang":"en","type":"article","venue":"Journal of the Association for Information Science and Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Council","keywords":"Cluster analysis; Data science; Bridging (networking); Strengths and weaknesses; Visualization; Computer science; Ethnic group; Cluster (spacecraft); Scale (ratio); Regional science; Geography; Data mining; Political science; Psychology; Cartography; Artificial intelligence","score_opus":0.022917088391585936,"score_gpt":0.3177725153327299,"score_spread":0.2948554269411439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119361765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6532103,0.00016629229,0.053346857,0.20317926,0.0030038066,0.0016547622,0.0000396894,0.00023542292,0.08516363],"genre_scores_gemma":[0.9984842,5.16814e-7,0.00061332516,0.00009091311,0.000055502966,0.000009983472,0.0000012377067,0.0000012658057,0.0007430339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990086,0.00001603903,0.00031099576,0.00004446673,0.0004943646,0.00012553582],"domain_scores_gemma":[0.99601203,0.00007757671,0.0009239431,0.00016328508,0.0027913963,0.000031755342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004078809,0.000040090366,0.00008217641,0.00064919697,0.00063915877,0.00044126678,0.0005551951,0.000020238938,0.000003386633],"category_scores_gemma":[0.0006623918,0.000022521564,0.000047331832,0.0032930798,0.00023093254,0.0015409926,0.000116296076,0.000119789984,0.0000029526143],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026482426,0.00001934282,0.079228245,0.0000011796457,0.00003441189,3.889775e-9,0.00059312227,0.000057453068,0.00024745625,0.82994306,0.068062454,0.021810636],"study_design_scores_gemma":[0.0002704016,0.000024910712,0.0035076404,0.000008784069,0.000037826892,0.000002413886,0.001589997,0.0029168965,0.0030519154,0.095605835,0.89292353,0.00005986083],"about_ca_topic_score_codex":0.0000027465708,"about_ca_topic_score_gemma":0.0000068068935,"teacher_disagreement_score":0.82486105,"about_ca_system_score_codex":0.00015719506,"about_ca_system_score_gemma":0.000311641,"threshold_uncertainty_score":0.49159572},"labels":[],"label_agreement":null},{"id":"W2120236744","doi":"10.1109/cts.2015.7210441","title":"Community detection in social networks by cultural algorithm","year":2015,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Space (punctuation); Core (optical fiber); Field (mathematics); Machine learning; Data science; Data mining; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.02806613695315383,"score_gpt":0.29634819060754974,"score_spread":0.2682820536543959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120236744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18729731,0.000033406664,0.7658888,0.00010752289,0.00006601611,0.0001411054,0.000005431827,0.00017646445,0.04628391],"genre_scores_gemma":[0.9979676,4.3880652e-7,0.001155797,0.0000323164,0.00032311605,0.00001704907,0.00007063615,0.0000068082923,0.00042626544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993722,0.00016893892,0.00014031096,0.00008044909,0.000079411475,0.00015871905],"domain_scores_gemma":[0.99973345,0.000016644699,0.00004290399,0.000110463814,0.000051671996,0.00004488385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025122194,0.00008708966,0.00013315554,0.000029157354,0.00014280071,0.00004086189,0.00012572286,0.00003365715,0.00008623],"category_scores_gemma":[0.0000012753414,0.00007859285,0.000059545135,0.0002383776,0.000028415612,0.00010306369,0.00007498267,0.0003153502,0.000007042074],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010695573,0.00027152413,0.012207172,8.607015e-7,0.000059704325,3.1039164e-7,0.00071214535,0.00026477478,0.0001762485,0.0020989096,0.14247772,0.8417199],"study_design_scores_gemma":[0.0022622375,0.00020823375,0.008215849,0.00001689381,0.00008731069,0.0000014297323,0.00990232,0.8313393,0.0061139246,0.051939297,0.08878221,0.0011310094],"about_ca_topic_score_codex":0.005135957,"about_ca_topic_score_gemma":0.00031704496,"teacher_disagreement_score":0.8405889,"about_ca_system_score_codex":0.00005092777,"about_ca_system_score_gemma":0.0000075057583,"threshold_uncertainty_score":0.77640647},"labels":[],"label_agreement":null},{"id":"W2120264529","doi":"10.1109/cse.2009.238","title":"Representing Small Group Evolution","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Multidisciplinary University Research Initiative","keywords":"Representation (politics); Group (periodic table); Dozen; Diversity (politics); Computer science; Simple (philosophy); Trajectory; Probabilistic logic; Theoretical computer science; Process (computing); Social evolution; Point (geometry); Artificial intelligence; Evolutionary biology; Mathematics; Sociology; Physics; Epistemology","score_opus":0.011316602165853264,"score_gpt":0.2471772284774806,"score_spread":0.23586062631162735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120264529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10997812,0.000021580296,0.6182311,0.00016725002,0.000016432366,0.00007081153,3.5022703e-7,0.00019660046,0.27131775],"genre_scores_gemma":[0.9888023,2.253719e-7,0.009593237,0.00003824585,0.0002678298,0.0000032658554,0.000011204151,0.0000034372567,0.0012802468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995238,0.000017146625,0.00011916512,0.00014593723,0.000056305453,0.00013760403],"domain_scores_gemma":[0.9996908,0.000013153818,0.000040307496,0.0002061902,0.00002221384,0.000027363116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009165318,0.00006116782,0.00008264074,0.00003799077,0.00006186428,0.000029385732,0.00009127126,0.000011268138,0.0005029413],"category_scores_gemma":[0.0000014575021,0.0000565063,0.000085078354,0.00015040724,0.000007129639,0.000052902404,0.000026273512,0.00005724905,0.000024255129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027110952,0.00009945054,0.086742215,6.148618e-7,0.00002739852,4.6188057e-7,0.000019705638,0.000049253023,0.0030755107,0.78429794,0.006336885,0.11934784],"study_design_scores_gemma":[0.00034536404,0.00008842364,0.16942134,0.000025155525,0.00007571089,8.885647e-7,0.00016706226,0.035439495,0.004083894,0.77360386,0.016255416,0.0004933946],"about_ca_topic_score_codex":0.00026696955,"about_ca_topic_score_gemma":0.000009571514,"teacher_disagreement_score":0.8788242,"about_ca_system_score_codex":0.00001255505,"about_ca_system_score_gemma":0.0000037764473,"threshold_uncertainty_score":0.55068547},"labels":[],"label_agreement":null},{"id":"W2120913948","doi":"10.1109/icdm.2010.88","title":"Mixed-Membership Stochastic Block-Models for Transactional Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Generative model; Inference; Theoretical computer science; Data mining; Social network analysis; Transactional leadership; Data modeling; Block (permutation group theory); Social network (sociolinguistics); Stochastic block model; Artificial intelligence; Machine learning; Generative grammar; Social media; Cluster analysis; Database; World Wide Web; Mathematics","score_opus":0.020832085199776147,"score_gpt":0.25592153828582376,"score_spread":0.23508945308604762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120913948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077875187,0.0000075515004,0.9804485,0.00013274397,0.00019978719,0.00025284226,0.000012417944,0.00012935158,0.0110292975],"genre_scores_gemma":[0.9843823,1.5080812e-7,0.013505104,0.000047482983,0.000939513,0.00014155224,0.000053127944,0.00002318496,0.0009076102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914724,0.000012189992,0.00020100192,0.00024541465,0.00011188903,0.00028225392],"domain_scores_gemma":[0.999349,0.0001735697,0.00005663453,0.00024398656,0.00008485568,0.00009195434],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016251672,0.00015179263,0.00018283144,0.00005362255,0.00013788017,0.00004790927,0.00017543299,0.00005473321,0.0016959673],"category_scores_gemma":[0.0000014919,0.00014157746,0.00024225468,0.00012513548,0.000041381107,0.0001044328,0.000015355425,0.00024615016,0.0000071911404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033587417,0.00017401122,0.00035633624,0.000004066058,0.00021216822,1.4583894e-7,0.000039917406,0.32312942,0.0003500376,0.63719976,0.0131086055,0.025391992],"study_design_scores_gemma":[0.00025540218,0.000021064552,0.00006335841,0.000004141201,0.00007560017,8.364169e-7,0.000029209803,0.88611573,0.00031927053,0.110424414,0.0024876196,0.00020336214],"about_ca_topic_score_codex":0.00006919306,"about_ca_topic_score_gemma":0.00014073522,"teacher_disagreement_score":0.97659475,"about_ca_system_score_codex":0.0000076119545,"about_ca_system_score_gemma":0.000026613017,"threshold_uncertainty_score":0.9992166},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01709537810502288,"score_gpt":0.2942611460251368,"score_spread":0.27716576792011394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121020155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09612625,0.0000068529375,0.8693058,0.00020060522,0.000010781739,0.000067892484,5.3913425e-7,0.00006831497,0.03421299],"genre_scores_gemma":[0.999344,4.070174e-7,0.00019860684,0.00008369696,0.00013689135,0.0000054410175,0.000043272703,0.0000032223188,0.00018449295],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994654,0.0001079136,0.00017360623,0.00007316094,0.00005635858,0.00012357405],"domain_scores_gemma":[0.99973285,0.000023056045,0.00004376644,0.0001612439,0.000022059141,0.000017017359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024477273,0.000061389,0.00010428356,0.000044886267,0.00014951493,0.000031863055,0.00014579543,0.000022824364,0.00022341064],"category_scores_gemma":[5.9879886e-7,0.000062520936,0.000057476384,0.00024341891,0.000024290026,0.000062499974,0.000025801373,0.00023033872,0.000008984106],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012309157,0.0005893085,0.04158401,0.0000011760139,0.000028766732,4.2981517e-7,0.0003802066,0.0055481554,0.0002270787,0.28599256,0.023818644,0.6418174],"study_design_scores_gemma":[0.00034818164,0.000037834743,0.5467935,0.000009822692,0.000026034044,1.5672059e-7,0.00080222083,0.21216457,0.0008961739,0.23673326,0.0018792329,0.000309028],"about_ca_topic_score_codex":0.0005001991,"about_ca_topic_score_gemma":0.000095965064,"teacher_disagreement_score":0.90321773,"about_ca_system_score_codex":0.000022968308,"about_ca_system_score_gemma":0.000005600129,"threshold_uncertainty_score":0.25495297},"labels":[],"label_agreement":null},{"id":"W2124151566","doi":"10.48550/arxiv.1212.1633","title":"Inferring Attitude in Online Social Networks Based On Quadratic Correlation","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Snapshot (computer storage); Computer science; Artificial intelligence; Sign (mathematics); Social network (sociolinguistics); Correlation; Machine learning; Quadratic equation; Set (abstract data type); Data mining; Social media; Mathematics; World Wide Web","score_opus":0.06550775575817744,"score_gpt":0.2220921012323181,"score_spread":0.15658434547414066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124151566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43744957,0.000012092867,0.5583001,0.00002583522,0.00015031609,0.00026124023,0.000017131455,0.00010682025,0.0036768808],"genre_scores_gemma":[0.99845403,0.0000036106928,0.00025452947,0.00004016056,0.00057803764,0.000002414307,0.0004643045,0.000028784125,0.00017412764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861586,0.00017463941,0.00026191023,0.00052262825,0.00007673466,0.0003482146],"domain_scores_gemma":[0.99900603,0.000116160554,0.0002948192,0.0004440845,0.00005954113,0.00007936786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020162406,0.0003100048,0.00040951563,0.0002937833,0.00012539867,0.000041723903,0.00036328388,0.00020525376,0.0002883582],"category_scores_gemma":[0.0000031520242,0.00038538472,0.00027740494,0.00045561854,0.000052758878,0.000109148015,0.00035060648,0.00092938053,0.0000193124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002385401,0.00024649623,0.2542901,0.000010409519,0.000053104348,0.0000053376557,0.000043613065,0.7258343,0.0000010857168,0.018562628,0.00009329052,0.0008357761],"study_design_scores_gemma":[0.0003439434,0.000013529999,0.042793203,0.000116380514,0.00014290775,3.043774e-8,0.00004489247,0.94932574,0.0000026413286,0.0067945663,0.00007991893,0.00034223704],"about_ca_topic_score_codex":0.0005687274,"about_ca_topic_score_gemma":0.00027144808,"teacher_disagreement_score":0.56100446,"about_ca_system_score_codex":0.00025030892,"about_ca_system_score_gemma":0.00007700264,"threshold_uncertainty_score":0.9998598},"labels":[],"label_agreement":null},{"id":"W2124521159","doi":"10.1109/cason.2009.29","title":"Detecting Communities in Large Networks by Iterative Local Expansion","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Scalability; Community structure; Graph; Theoretical computer science; Network science; Property (philosophy); Network structure; Evolving networks; Data mining; Complex network; World Wide Web; Mathematics","score_opus":0.009394864034611055,"score_gpt":0.2599286813377045,"score_spread":0.2505338173030935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124521159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17938383,0.00009345555,0.80785453,0.00005681354,0.000011172956,0.00008990999,0.0000025185973,0.00008290565,0.0124248415],"genre_scores_gemma":[0.9985877,0.0000034225839,0.0008792392,0.00020610694,0.00007265526,0.000009572212,0.00007149863,0.000006887616,0.00016289754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992592,0.000100419835,0.00020441614,0.00010871683,0.00007057828,0.00025670129],"domain_scores_gemma":[0.9996127,0.00007828672,0.00004833017,0.0002006555,0.000027437216,0.000032598487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018871618,0.00011878011,0.00017875897,0.000058642436,0.00012227506,0.000049228693,0.00013104879,0.000029121766,0.0005211243],"category_scores_gemma":[7.1715266e-7,0.00010883372,0.00006299207,0.00021521711,0.000021549093,0.00011284113,0.00005308498,0.0002451902,0.0000035022672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042903088,0.000721823,0.10914836,0.0000029479368,0.000078156234,0.000003226204,0.0033709425,0.009329871,0.0005732781,0.046561114,0.01859556,0.81157184],"study_design_scores_gemma":[0.00070097274,0.00016411958,0.0035640677,0.000097577824,0.000020485188,5.228543e-7,0.008710576,0.9630337,0.003905162,0.013606122,0.0056919674,0.0005047266],"about_ca_topic_score_codex":0.0006626278,"about_ca_topic_score_gemma":0.00034130755,"teacher_disagreement_score":0.9537038,"about_ca_system_score_codex":0.000024466852,"about_ca_system_score_gemma":0.0000058162896,"threshold_uncertainty_score":0.57059455},"labels":[],"label_agreement":null},{"id":"W2125952937","doi":"10.1109/cec.2008.4630866","title":"Behavioral regimes in the evolution of extremal epidemic graphs","year":2008,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"University of Guelph","keywords":"Population; Degree (music); Sequence (biology); Computer science; Operator (biology); Degree distribution; Chromosome; Representation (politics); Evolutionary algorithm; Population size; Complex network; Theoretical computer science; Artificial intelligence; Biology; Demography","score_opus":0.03159807849730051,"score_gpt":0.2912098592077597,"score_spread":0.2596117807104592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125952937","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97000724,0.00007438033,0.010525838,0.00006257814,0.000008875409,0.00009617174,0.0000013846038,0.00002248511,0.019201038],"genre_scores_gemma":[0.99853545,0.0000026293585,0.0011232918,0.000009153683,0.000037040954,0.00001532547,0.0000062520394,0.000003720274,0.00026714857],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994194,0.00006911709,0.00019694133,0.0001016688,0.000099687735,0.0001131904],"domain_scores_gemma":[0.9996252,0.00004487257,0.00006820653,0.00022641681,0.000023457638,0.000011852283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016998356,0.00006471703,0.00013260872,0.00007859452,0.00004218626,0.000003032918,0.00016279618,0.000015569874,0.00021140435],"category_scores_gemma":[0.0000011026125,0.000044602737,0.00011428478,0.00030744352,0.00006420165,0.000054301774,0.000023961202,0.000082806204,0.0000032357989],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038434755,0.00014773243,0.83827424,7.752239e-7,0.000009189481,9.125045e-7,0.00022926365,0.000022936701,0.00029586267,0.15330832,0.005040136,0.0026667775],"study_design_scores_gemma":[0.0006839432,0.00018036456,0.71141684,0.000045471475,0.00012759317,0.000010237969,0.0033755188,0.0052567357,0.0026606699,0.2730117,0.0027555455,0.00047537268],"about_ca_topic_score_codex":0.004314217,"about_ca_topic_score_gemma":0.00008787784,"teacher_disagreement_score":0.12685741,"about_ca_system_score_codex":0.00001659184,"about_ca_system_score_gemma":0.000019526695,"threshold_uncertainty_score":0.6521834},"labels":[],"label_agreement":null},{"id":"W2126668712","doi":"10.1145/2043932.2043946","title":"A generalized stochastic block model for recommendation in social rating networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cluster analysis; Computer science; Stochastic block model; Probabilistic logic; Social network (sociolinguistics); Data mining; Artificial intelligence; Machine learning; Mixture model; Block (permutation group theory); Social media; Mathematics","score_opus":0.06456470940623994,"score_gpt":0.30331263519766216,"score_spread":0.23874792579142223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126668712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017551785,0.000002337573,0.977773,0.00004874047,0.000017083254,0.0002512047,0.0000032258176,0.0000532393,0.004299364],"genre_scores_gemma":[0.9584008,1.6205311e-7,0.040792797,0.00005274218,0.0002709309,0.00016967705,0.00006718956,0.000013669995,0.00023202284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934596,0.000026813334,0.00023493159,0.00016207545,0.000036264348,0.00019396801],"domain_scores_gemma":[0.99974537,0.000030908628,0.00008555786,0.00007656968,0.000039345803,0.000022224714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017108904,0.00009655727,0.00016424673,0.000057101934,0.00010405029,0.00001819974,0.00008023419,0.00002826648,0.00031163785],"category_scores_gemma":[0.0000018539389,0.000096254495,0.00009645629,0.00012652353,0.000009731066,0.00006437691,0.000037155605,0.000074369214,0.0000010901935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017339452,0.000524014,0.0070056575,0.000008809952,0.00023693411,1.8338666e-7,0.0028711427,0.45507059,0.00024743876,0.38302514,0.027513832,0.12332287],"study_design_scores_gemma":[0.00033856573,0.000009841653,0.00007711632,0.0000034029174,0.0000205304,3.1248632e-8,0.000047092242,0.9655307,0.000042974138,0.033786986,0.000034158944,0.00010861762],"about_ca_topic_score_codex":0.00018404637,"about_ca_topic_score_gemma":0.00008886087,"teacher_disagreement_score":0.940849,"about_ca_system_score_codex":0.000020191539,"about_ca_system_score_gemma":0.000014587977,"threshold_uncertainty_score":0.39251444},"labels":[],"label_agreement":null},{"id":"W2128163546","doi":"10.1109/glocom.1999.830278","title":"Traffic modeling with universal multifractals","year":2003,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ste. Anne's Hospital","funders":"","keywords":"Multifractal system; Intermittency; Fractal; Cascade; Computer science; TRACE (psycholinguistics); Statistical physics; Queue; Formalism (music); Traffic generation model; Mathematics; Real-time computing; Physics; Engineering; Turbulence","score_opus":0.011040923824843462,"score_gpt":0.22874726618803443,"score_spread":0.21770634236319097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128163546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42598885,0.0000056909707,0.49765232,0.00001364918,0.0000052105534,0.000054927765,5.6673844e-7,0.000083365856,0.076195404],"genre_scores_gemma":[0.9824126,3.7860636e-7,0.016833708,0.000012610635,0.000029510975,0.0000039721444,0.000005442928,0.000010091325,0.0006917221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954706,0.00002135801,0.000083342515,0.00013796151,0.00007227654,0.00013802634],"domain_scores_gemma":[0.9997358,0.000015745793,0.000024250267,0.00014998992,0.000033752625,0.000040479434],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000055523367,0.00008447845,0.00010506201,0.000038090446,0.00005620745,0.000022928076,0.00006390996,0.000011159063,0.001165268],"category_scores_gemma":[5.684467e-7,0.00006609073,0.000051338946,0.00013834416,0.000012822214,0.00007632012,0.0000085990105,0.00006380325,0.00001668909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018444009,0.00025706392,0.007828133,0.000002722473,0.00026923485,0.0000038026515,0.00023466484,0.49855596,0.00030743514,0.45542458,0.0012052276,0.035892744],"study_design_scores_gemma":[0.00033828823,0.000030334097,0.000015470992,0.000008851146,0.000047448648,6.9140253e-7,0.000641438,0.99173194,0.0009541862,0.0020868038,0.0039173616,0.00022715844],"about_ca_topic_score_codex":0.00007584856,"about_ca_topic_score_gemma":0.000015383908,"teacher_disagreement_score":0.5564237,"about_ca_system_score_codex":0.000010391555,"about_ca_system_score_gemma":0.000021437629,"threshold_uncertainty_score":0.9997478},"labels":[],"label_agreement":null},{"id":"W2128435186","doi":"10.1103/physreve.85.026108","title":"Structural preferential attachment: Stochastic process for the growth of scale-free, modular, and self-similar systems","year":2012,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Modularity (biology); Preferential attachment; Scaling; Statistical physics; Process (computing); Modular design; Stochastic process; Independence (probability theory); Scale (ratio); Computer science; Self-similarity; Self-organization; Complex system; Similarity (geometry); Theoretical computer science; Complex network; Mathematics; Artificial intelligence; Physics; Statistics","score_opus":0.022843567598908,"score_gpt":0.3244647536174988,"score_spread":0.30162118601859084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128435186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7306624,0.061626226,0.1995738,0.00039314656,0.0002800573,0.0061790585,0.0002542025,0.0002002307,0.000830882],"genre_scores_gemma":[0.9985924,0.0001463949,0.00017180615,0.000019911242,0.0006865382,0.00033453712,0.000024128645,0.00001692263,0.0000074064023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990432,0.00005809257,0.00026197545,0.00017946561,0.00020449361,0.0002527756],"domain_scores_gemma":[0.99909884,0.00015982738,0.00019393275,0.00034964478,0.000118930046,0.0000788218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017693902,0.00017741554,0.00047318812,0.00001629559,0.000096213116,0.000021502101,0.0002904519,0.000012517238,0.000015316986],"category_scores_gemma":[0.000011225261,0.000110736204,0.00019760027,0.00014918442,0.00005282457,0.00012802139,0.00011097322,0.00009793551,0.0000013095845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112789974,0.0026705295,0.05192815,0.024333157,0.0039313217,1.48565e-7,0.0020038541,0.0018951177,0.0011147946,0.8449025,0.00792569,0.059181955],"study_design_scores_gemma":[0.0023385917,0.00045692667,0.016700836,0.0054376107,0.009987427,0.0000050388235,0.00018946399,0.7735633,0.002435543,0.182677,0.0043372423,0.0018709804],"about_ca_topic_score_codex":0.000027488177,"about_ca_topic_score_gemma":6.295986e-7,"teacher_disagreement_score":0.7716682,"about_ca_system_score_codex":0.000010427316,"about_ca_system_score_gemma":0.000012203252,"threshold_uncertainty_score":0.45156914},"labels":[],"label_agreement":null},{"id":"W2128899929","doi":"10.1145/2207243.2207247","title":"Social network analysis and mining to support the assessment of on-line student participation","year":2012,"lang":"en","type":"article","venue":"ACM SIGKDD Explorations Newsletter","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Automatic summarization; Computer science; Toolbox; Social network analysis; Identification (biology); Visualization; Data science; World Wide Web; Exploit; Social media; Online discussion; Information retrieval; Data mining","score_opus":0.076759501794539,"score_gpt":0.40748789889979475,"score_spread":0.33072839710525576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128899929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8210824,0.000005436405,0.16993365,0.0078081167,0.000048022033,0.00027705944,0.000007667259,0.000029090472,0.00080854853],"genre_scores_gemma":[0.99060076,7.384612e-7,0.0067817327,0.0011328427,0.0010625152,0.00024639873,0.0001025312,0.000011526703,0.000060962673],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998857,0.00012749352,0.00035079065,0.00016878368,0.00023287705,0.00026300797],"domain_scores_gemma":[0.99908006,0.00020039882,0.00015756114,0.00042959367,0.000067894725,0.00006451679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040137154,0.00012981861,0.0002480144,0.00012285523,0.0002568244,0.000058483092,0.00020357198,0.000021824855,0.00025521795],"category_scores_gemma":[0.000008619527,0.000100669626,0.00013224213,0.00080631353,0.00003651984,0.00016778793,0.00017139682,0.00009505467,0.000009949673],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000570051,0.00024544264,0.91705954,0.000001642886,0.00090813224,1.4721992e-7,0.003428632,0.0127487285,0.0002315046,0.010800372,0.04620362,0.008366523],"study_design_scores_gemma":[0.00041054434,0.00030619654,0.96702355,0.00001530777,0.0027980646,1.3483904e-7,0.0015136747,0.0064179846,0.0011168378,0.0025594346,0.017335204,0.00050306064],"about_ca_topic_score_codex":0.00002695778,"about_ca_topic_score_gemma":0.00003980912,"teacher_disagreement_score":0.16951834,"about_ca_system_score_codex":0.00002206436,"about_ca_system_score_gemma":0.000014070927,"threshold_uncertainty_score":0.41051883},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.031427913772389,"score_gpt":0.2552130692557583,"score_spread":0.2237851554833693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128965269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069771498,0.000011419244,0.8144458,0.000030386993,0.000032679756,0.00026242784,0.0000055253527,0.00009914852,0.17813547],"genre_scores_gemma":[0.7348212,0.000002174503,0.26397425,0.0007829204,0.00014868191,0.00006649963,0.00008155197,0.000020547266,0.00010217341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988022,0.000019515763,0.0005235796,0.00015018742,0.00018138808,0.00032316308],"domain_scores_gemma":[0.99940336,0.00003743613,0.00016079453,0.00024818673,0.000061220046,0.00008899326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024794022,0.00017325638,0.00023457174,0.00017114285,0.00009160844,0.00006878994,0.0002690516,0.00004686165,0.00014640753],"category_scores_gemma":[0.000008147528,0.00017502182,0.00009020282,0.00047147952,0.000037132577,0.0002649715,0.00015860985,0.00017414641,0.000035215005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053963464,0.0007710783,0.049305663,0.000059571797,0.00023041545,0.0000016661795,0.018480776,0.011005665,0.00002307077,0.786787,0.063291945,0.06998919],"study_design_scores_gemma":[0.0004474999,0.00006473477,0.010037738,0.00009882099,0.000042274576,0.0000031265115,0.0011306,0.9602761,0.00031712462,0.013624641,0.013276196,0.00068108813],"about_ca_topic_score_codex":0.00038145584,"about_ca_topic_score_gemma":0.0000058671235,"teacher_disagreement_score":0.9492705,"about_ca_system_score_codex":0.000038238188,"about_ca_system_score_gemma":0.000029741608,"threshold_uncertainty_score":0.7137183},"labels":[],"label_agreement":null},{"id":"W2129419521","doi":"10.1016/j.peva.2011.07.008","title":"Characterizing and modelling popularity of user-generated videos","year":2011,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":107,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Popularity; Upload; Computer science; Key (lock); Sampling (signal processing); Dynamics (music); Set (abstract data type); Data mining; Artificial intelligence; World Wide Web; Computer vision; Computer security","score_opus":0.0854509516755767,"score_gpt":0.29144745724691096,"score_spread":0.20599650557133425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129419521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96428376,0.000025857313,0.034107503,0.0000059958393,0.000022424296,0.00014410578,0.0000018889077,0.000020004667,0.0013884427],"genre_scores_gemma":[0.9951748,0.000009637619,0.0046412414,0.0000052840523,0.00006929235,0.000026900503,0.00005143147,0.000006661466,0.000014716233],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938565,0.000040569612,0.00020139501,0.00012338764,0.0001538011,0.000095169344],"domain_scores_gemma":[0.9995582,0.0000059408753,0.00013242979,0.00013594344,0.00014656936,0.000020900447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051447126,0.00007271897,0.000120032055,0.00005793562,0.000067427674,0.000010559457,0.000055312226,0.000018247481,0.0002594566],"category_scores_gemma":[0.0000017277079,0.00007167697,0.000028396451,0.00012086376,0.00001718214,0.000232847,0.000027317548,0.000057945235,0.000002785162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004379745,0.00013116357,0.7726587,0.000030439785,0.000107871485,5.955281e-8,0.0019093249,0.0054688975,0.022583101,0.0033781421,0.00003672221,0.19365181],"study_design_scores_gemma":[0.00012503921,0.00002409381,0.07280262,0.000022952669,0.00006472901,1.1131841e-7,0.000021979651,0.88615465,0.039554838,0.0011123185,0.000036200636,0.000080465456],"about_ca_topic_score_codex":0.0001807224,"about_ca_topic_score_gemma":0.0000028743545,"teacher_disagreement_score":0.88068575,"about_ca_system_score_codex":0.000012278917,"about_ca_system_score_gemma":0.000018227413,"threshold_uncertainty_score":0.2922902},"labels":[],"label_agreement":null},{"id":"W2129713756","doi":"10.1145/1963405.1963480","title":"Modeling the temporal dynamics of social rating networks using bidirectional effects of social relations and rating patterns","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Social network (sociolinguistics); Social relation; Computer science; Probabilistic logic; Dynamics (music); Generative model; Transitive relation; Social relationship; Artificial intelligence; Data science; Machine learning; Generative grammar; Psychology; Social psychology; Social media; World Wide Web; Mathematics","score_opus":0.02160327434646172,"score_gpt":0.2626151525489592,"score_spread":0.24101187820249745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129713756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49569082,0.0000068112727,0.50308675,0.000012469423,0.000019755156,0.00006105311,0.0000029533837,0.000015669928,0.0011036921],"genre_scores_gemma":[0.9932172,2.87429e-7,0.0064576613,0.000004765061,0.00024266318,0.000007156128,0.000024763618,0.000012018547,0.00003353595],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992484,0.00008692968,0.00031465723,0.00011981843,0.0001049221,0.00012527347],"domain_scores_gemma":[0.9995267,0.00009549195,0.0002115177,0.0000674142,0.00008463119,0.000014243124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020715658,0.000098003526,0.00019701998,0.000044729553,0.00036928675,0.000015461432,0.00007299343,0.000038891125,0.00008932082],"category_scores_gemma":[0.0000041549606,0.000081234204,0.00011714273,0.00016209758,0.00005328405,0.00007982595,0.00008010678,0.00014284714,7.966211e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002807878,0.00022548105,0.6850743,0.00006714267,0.0006671823,4.5128078e-7,0.007556216,0.053813085,0.0009785638,0.22936116,0.00012359957,0.022104684],"study_design_scores_gemma":[0.00010198813,0.000010077085,0.0036220066,0.00002031007,0.000082945786,1.745843e-7,0.0006742984,0.9925306,0.00015513823,0.0027218687,0.0000011416182,0.00007948429],"about_ca_topic_score_codex":0.0014494163,"about_ca_topic_score_gemma":0.00017890913,"teacher_disagreement_score":0.9387175,"about_ca_system_score_codex":0.00001968631,"about_ca_system_score_gemma":0.000023351506,"threshold_uncertainty_score":0.33126348},"labels":[],"label_agreement":null},{"id":"W2130568399","doi":"10.1109/infocom.2008.4544634","title":"On congestion in mission critical networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Network topology; Betweenness centrality; Robustness (evolution); Computer science; Network congestion; Centrality; Network traffic control; Computer network; Complex network; Graph theory; Network science; Distributed computing; Topology (electrical circuits); Mathematics; Network packet","score_opus":0.02052773289775998,"score_gpt":0.2981631458509268,"score_spread":0.2776354129531668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130568399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5013372,0.000039650007,0.3733899,0.00062386756,0.00007555642,0.00014640142,8.7788914e-7,0.0001593992,0.12422718],"genre_scores_gemma":[0.99860245,0.0000026140872,0.0008106893,0.000082611514,0.00012944287,0.000005070918,0.000009653201,0.0000058663627,0.0003515918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949956,0.000033565888,0.0001224495,0.00013398104,0.00007290727,0.00013752707],"domain_scores_gemma":[0.9996637,0.0001322286,0.00001383469,0.00012699081,0.000020040472,0.00004316806],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000060482766,0.00006883416,0.000103550745,0.000051069346,0.000054086355,0.000008055032,0.00005737247,0.000024142157,0.0012317621],"category_scores_gemma":[0.0000069804155,0.000059723527,0.000046066063,0.00013566196,0.00003218483,0.000037690683,0.000020554506,0.00012205469,0.0000229689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040866827,0.00048644783,0.18990271,0.0000019283652,0.00001831888,0.000016389009,0.000056386798,0.022085715,0.00009319783,0.7076064,0.052849017,0.02684264],"study_design_scores_gemma":[0.00084592594,0.00023658799,0.121164106,0.00013922075,0.000029112416,0.0000047904837,0.00006390489,0.7328216,0.0014745139,0.13539697,0.0071588177,0.00066448],"about_ca_topic_score_codex":0.00011158184,"about_ca_topic_score_gemma":0.0000048057964,"teacher_disagreement_score":0.71073586,"about_ca_system_score_codex":0.000013473629,"about_ca_system_score_gemma":0.000007877556,"threshold_uncertainty_score":0.99968123},"labels":[],"label_agreement":null},{"id":"W2130574703","doi":"10.1109/iv.2008.68","title":"Effectiveness of Machine Learning Techniques for Automated Identification of Calling Communities","year":2008,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Machine learning; Classifier (UML); Artificial intelligence; Data mining; Support vector machine; Identification (biology); Fuzzy logic","score_opus":0.018888743294577116,"score_gpt":0.29257543232474187,"score_spread":0.27368668903016474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130574703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53115666,0.00002437634,0.46766168,0.000002360695,0.0000054797015,0.00023726262,0.000011201956,0.00027183106,0.0006291674],"genre_scores_gemma":[0.9891591,0.0000064509754,0.010547696,6.802721e-7,0.000012556487,0.00006538614,0.00013740534,0.000011007953,0.000059737602],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935,0.00012938397,0.0003020728,0.00006893357,0.00007125533,0.000078318524],"domain_scores_gemma":[0.99909854,0.00032205507,0.00020986957,0.00017026393,0.00018826014,0.000010987975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042682234,0.00007544426,0.00023695512,0.00009302949,0.00010041351,0.0000048890643,0.00012634398,0.000020251964,0.000032427943],"category_scores_gemma":[0.000005538683,0.00007125726,0.00010959766,0.00014323025,0.000068400914,0.000054508375,0.000037992602,0.00006516263,2.7829898e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013780827,0.00050854095,0.41232595,0.0005475346,0.0005251814,1.9902257e-7,0.0010771357,0.003985606,0.5079019,0.061352275,0.00016803594,0.011469814],"study_design_scores_gemma":[0.00012659031,0.000063676714,0.006232594,0.000077018725,0.000036281705,2.9461168e-7,0.00012973887,0.16013753,0.83095396,0.002057397,0.000097215525,0.00008767877],"about_ca_topic_score_codex":0.001503568,"about_ca_topic_score_gemma":0.000007675497,"teacher_disagreement_score":0.45800245,"about_ca_system_score_codex":0.00000950484,"about_ca_system_score_gemma":0.00001248538,"threshold_uncertainty_score":0.2905787},"labels":[],"label_agreement":null},{"id":"W2131325046","doi":"10.1007/978-3-642-38457-8_30","title":"Classifying Organizational Roles Using Email Social Networks","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Knowledge management; World Wide Web; Artificial intelligence","score_opus":0.01814002854880201,"score_gpt":0.2544399838711365,"score_spread":0.23629995532233447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131325046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040394338,0.0000986297,0.99484366,0.000103127066,0.0002511398,0.00018598868,0.000004085478,0.000079781945,0.0040296135],"genre_scores_gemma":[0.8920757,0.0000033614715,0.10284148,0.00027166444,0.0044666603,0.000005562834,0.00004737449,0.0000636112,0.00022456532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792904,0.000024063222,0.00039332994,0.00072756514,0.00047753064,0.0004484684],"domain_scores_gemma":[0.9988843,0.00013691219,0.00029566782,0.0003548003,0.00025509993,0.00007320084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002450462,0.00038491623,0.00044812774,0.00033324634,0.0004474147,0.0003701559,0.00079039176,0.00017694781,0.0008640524],"category_scores_gemma":[0.000004921509,0.00037620656,0.00014882124,0.00046301805,0.00041644706,0.00019470816,0.0005863367,0.0006206957,0.000019468625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034176799,0.00004343943,0.003809133,0.000013855185,0.00009890915,0.0000071850077,0.0003624202,0.34609106,0.00016904846,0.08699955,0.0003355564,0.56206644],"study_design_scores_gemma":[0.00007402329,0.0000110615465,0.000120040946,0.00010985634,0.000027792443,0.000002430087,2.717252e-7,0.8022999,0.00007979797,0.19639796,0.0004638356,0.00041298987],"about_ca_topic_score_codex":0.00005513964,"about_ca_topic_score_gemma":0.000026127942,"teacher_disagreement_score":0.8920022,"about_ca_system_score_codex":0.00017820548,"about_ca_system_score_gemma":0.00023010447,"threshold_uncertainty_score":0.999869},"labels":[],"label_agreement":null},{"id":"W2132190589","doi":"10.1109/wi.2007.78","title":"On Query Completion in Web Search Engines Based on Query Stream Mining","year":2007,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Atlantic Canada Opportunities Agency","keywords":"Computer science; Web search query; Metric (unit); Phrase; Information retrieval; Web query classification; Query expansion; Sargable; Query optimization; Query language; Search engine; Data mining; Database; Natural language processing","score_opus":0.017108066309162305,"score_gpt":0.287595312363772,"score_spread":0.2704872460546097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132190589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88362306,0.000004878268,0.053069882,0.00014203979,0.000030924584,0.00016405417,0.0000059495796,0.00013087712,0.06282834],"genre_scores_gemma":[0.99600685,5.2287277e-7,0.0032355853,0.00014957102,0.00020619521,0.0000120292,0.000083562445,0.00001872276,0.00028697733],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881846,0.00006499452,0.00026921518,0.00027285857,0.00024612038,0.00032835113],"domain_scores_gemma":[0.9991168,0.0004384358,0.00004624988,0.00028974694,0.000044845587,0.00006396587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000558669,0.00016536402,0.00022078624,0.0003810322,0.00007220439,0.00003529615,0.00013226282,0.00003803826,0.0008819643],"category_scores_gemma":[0.000005568522,0.00015347585,0.00010870802,0.000397472,0.000028071458,0.00004794329,0.000031373183,0.00019995729,0.000032942677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033200986,0.001993606,0.59193933,0.000028986095,0.000116150004,0.00002629054,0.00026706338,0.0473773,0.0044770823,0.18132417,0.016612448,0.15550557],"study_design_scores_gemma":[0.0017351296,0.0005553231,0.08837827,0.0004008212,0.000039569335,4.4428333e-7,0.00093581085,0.8741155,0.023921978,0.004105975,0.0048277485,0.0009833947],"about_ca_topic_score_codex":0.0005814867,"about_ca_topic_score_gemma":0.00044091855,"teacher_disagreement_score":0.82673824,"about_ca_system_score_codex":0.000070011934,"about_ca_system_score_gemma":0.000036704434,"threshold_uncertainty_score":0.96568906},"labels":[],"label_agreement":null},{"id":"W2132846062","doi":"10.5539/mas.v4n7p89","title":"Equivalent Resistance of 5×n-laddered Network","year":2010,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Program for New Century Excellent Talents in University; Natural Science Foundation of Yunnan Province; National Natural Science Foundation of China; National Science Foundation","keywords":"Integer (computer science); Mathematics; Matrix (chemical analysis); Mathematical analysis; Materials science; Physics; Computer science; Composite material","score_opus":0.009627358238165564,"score_gpt":0.25467751494158714,"score_spread":0.24505015670342156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132846062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21322322,0.000026041598,0.5635882,0.00007479678,0.00013416808,0.0002757331,0.0000066310217,0.00010594884,0.22256528],"genre_scores_gemma":[0.97802174,5.044038e-7,0.021403786,0.000022720855,0.0002080397,0.000029207546,0.0000028296226,0.000009755504,0.00030138885],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857575,0.000007782923,0.00024542754,0.00038081614,0.00040039315,0.0003898161],"domain_scores_gemma":[0.99898374,0.000037698075,0.00015732973,0.000640288,0.0000886107,0.000092317394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005564729,0.00012110573,0.00020003141,0.0000673868,0.0002260964,0.000050745613,0.0007223504,0.000022328097,0.0002727583],"category_scores_gemma":[0.0000036063586,0.00011466803,0.00006664455,0.00069820863,0.00052211154,0.00008344834,0.00021354407,0.0001934658,0.000011086524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010828706,0.000055913697,0.0022510076,0.0000036046142,0.000011236558,1.5353487e-7,0.00012565615,0.00034623517,0.64439446,0.3389359,0.001170035,0.012694959],"study_design_scores_gemma":[0.00033369445,0.00001677136,0.0049616867,0.000024407927,0.000039625025,2.6958804e-7,0.000055157227,0.07730727,0.12195087,0.78846157,0.0063713314,0.00047734543],"about_ca_topic_score_codex":0.000021416932,"about_ca_topic_score_gemma":0.00004413449,"teacher_disagreement_score":0.7647985,"about_ca_system_score_codex":0.000012046248,"about_ca_system_score_gemma":0.00010651867,"threshold_uncertainty_score":0.46760264},"labels":[],"label_agreement":null},{"id":"W2133476728","doi":"10.1109/cse.2009.469","title":"On the Design of Collective Applications","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Computer science; Aggregate (composite); Set (abstract data type); Presentation (obstetrics); Human–computer interaction; Collective behavior; Data science","score_opus":0.01960681742269217,"score_gpt":0.2662364644420986,"score_spread":0.24662964701940643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133476728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084528845,0.0000025706408,0.84319955,0.00024744525,9.265778e-7,0.0002147221,8.6647947e-7,0.000018060098,0.15547056],"genre_scores_gemma":[0.9952028,2.2430703e-7,0.0036161712,0.00008928745,0.000025739535,0.000052434196,0.0000012432025,0.0000015761443,0.001010547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976796,0.000023426905,0.00006352391,0.00005680912,0.000042806172,0.000045463785],"domain_scores_gemma":[0.9996285,0.0001480307,0.00003144836,0.00015464606,0.000029081304,0.000008286482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000062450614,0.000034623215,0.000055652858,0.000018567242,0.000050772036,0.000005878802,0.00008857801,0.000004926187,0.00052723434],"category_scores_gemma":[9.1902467e-7,0.00002115084,0.00003755614,0.00019678766,0.000012798689,0.000008161891,0.000005831631,0.00003106491,0.0000094503375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028036454,0.00006813893,0.00009840294,7.346805e-8,0.00001876436,5.9094707e-9,0.000023930099,0.0003695034,0.00040797098,0.97231734,0.016741108,0.009951982],"study_design_scores_gemma":[0.000045040953,0.0000675529,0.0005622435,0.0000025973095,0.000016218773,1.9944268e-8,0.00004604407,0.0049483934,0.014223009,0.9786292,0.0014095744,0.00005012989],"about_ca_topic_score_codex":0.000010694123,"about_ca_topic_score_gemma":2.5003453e-7,"teacher_disagreement_score":0.99435747,"about_ca_system_score_codex":0.000006922875,"about_ca_system_score_gemma":0.000014644379,"threshold_uncertainty_score":0.57728463},"labels":[],"label_agreement":null},{"id":"W2134165172","doi":"10.1109/icdmw.2010.40","title":"Meerkat: Community Mining with Dynamic Social Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Visualization; Data science; Graphical user interface; Social network analysis; Data mining; Social network (sociolinguistics); Exploratory analysis; Network analysis; Event (particle physics); Data visualization; Social media; World Wide Web; Engineering","score_opus":0.007234276236694074,"score_gpt":0.2559657912966591,"score_spread":0.24873151505996502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134165172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73605585,0.0000026221437,0.19199295,0.00010533989,0.000035418252,0.00007837265,0.00000205812,0.00016578582,0.071561575],"genre_scores_gemma":[0.9917098,1.2996222e-7,0.0074427305,0.000050749477,0.00023185227,0.000016000484,0.000046203284,0.000017326383,0.0004851801],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993947,0.00006395693,0.00012821353,0.0001094164,0.00009043774,0.00021328549],"domain_scores_gemma":[0.99947387,0.00007230552,0.00006744118,0.00029275473,0.000049440037,0.00004417815],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020262072,0.00012412152,0.00017105509,0.00003507645,0.00042651832,0.000058234167,0.00024405227,0.00003681123,0.0009803664],"category_scores_gemma":[8.7678796e-7,0.000100787576,0.00007741841,0.00018670243,0.00008093353,0.00006508038,0.000099235156,0.0005949745,0.0000058417236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007827365,0.0009085821,0.46346974,0.000011361219,0.0010148642,0.000003542105,0.0025493193,0.0019770006,0.0025641154,0.17667441,0.032142438,0.31860635],"study_design_scores_gemma":[0.0021231286,0.00034383507,0.17996031,0.000055747932,0.0006061883,0.0000071624695,0.005973755,0.74571735,0.0011914643,0.030881157,0.030748826,0.0023910499],"about_ca_topic_score_codex":0.00059795013,"about_ca_topic_score_gemma":0.0017246548,"teacher_disagreement_score":0.7437404,"about_ca_system_score_codex":0.0000074872037,"about_ca_system_score_gemma":0.000015888589,"threshold_uncertainty_score":0.9999329},"labels":[],"label_agreement":null},{"id":"W2134744539","doi":"10.5555/2330748.2330769","title":"Understanding video propagation in online social networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Popularity; Computer science; Social media; Randomness; Online video; World Wide Web; Multimedia; Internet privacy; Statistics","score_opus":0.08360307235147611,"score_gpt":0.30544196795670553,"score_spread":0.2218388956052294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134744539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054865155,0.000017122211,0.92401636,0.00016306763,0.00003890549,0.000111887195,0.00000120733,0.00006814187,0.020718176],"genre_scores_gemma":[0.99779654,7.035513e-7,0.0010362412,0.000036852405,0.0009157061,0.000009471021,0.000054453725,0.000008706295,0.00014133802],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942803,0.000034641096,0.00015147333,0.00008582665,0.000072217066,0.00022779572],"domain_scores_gemma":[0.99981564,0.00002473242,0.000048645943,0.00006972802,0.00001116288,0.000030098761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016437186,0.00007313053,0.000110054,0.000059313395,0.000067104535,0.000020077248,0.00005718364,0.000023830244,0.00046557226],"category_scores_gemma":[9.031866e-7,0.00006771945,0.000053125492,0.00024671818,0.000016079694,0.00014678664,0.000036003676,0.000106794454,0.000004570397],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000667197,0.00024580766,0.5664481,0.0000020288155,0.000036217425,1.3488004e-7,0.00024168061,0.0009497108,0.00006449319,0.41473007,0.006355458,0.010919635],"study_design_scores_gemma":[0.0014676618,0.000059309292,0.22518964,0.00007425445,0.00015032727,7.8392026e-7,0.0048305085,0.6331055,0.00077391724,0.124993294,0.00810075,0.0012540312],"about_ca_topic_score_codex":0.000107450665,"about_ca_topic_score_gemma":0.00006634801,"teacher_disagreement_score":0.94293135,"about_ca_system_score_codex":0.000082441606,"about_ca_system_score_gemma":0.0000072413723,"threshold_uncertainty_score":0.50976896},"labels":[],"label_agreement":null},{"id":"W2135174320","doi":"10.1109/cibcb.2012.6217253","title":"Evolving a social fabric to fit and epidemic profile","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Representation (politics); Computer science; Simple (philosophy); Theoretical computer science; Social network (sociolinguistics); Artificial intelligence; Social contact; Social media; Sociology","score_opus":0.026706869189365105,"score_gpt":0.30759552525683714,"score_spread":0.28088865606747204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135174320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7443638,0.00016284078,0.106916524,0.0006736302,0.00005285288,0.00037380445,0.000008167797,0.00021781247,0.14723058],"genre_scores_gemma":[0.98987484,2.4872242e-7,0.007786615,0.00010726921,0.00061946403,0.000035804307,0.000004842262,0.000008590666,0.0015623146],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994544,0.00002370626,0.000113080954,0.00010977634,0.000060363745,0.00023868382],"domain_scores_gemma":[0.9997411,0.000037177833,0.0000306782,0.00008818007,0.0000219503,0.00008093917],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015516746,0.00007747295,0.00013244849,0.00004286005,0.000096882584,0.000024729587,0.00006280064,0.00001502801,0.0021906511],"category_scores_gemma":[0.0000037082284,0.00006948195,0.000051122577,0.00014769446,0.000011663079,0.000105611165,0.0000991374,0.000059634403,0.00007413385],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036950064,0.00008836921,0.6118469,0.000006141795,0.00008401968,9.5380585e-8,0.0008216934,0.000002237178,0.001355049,0.058226313,0.20159194,0.1259735],"study_design_scores_gemma":[0.0007753169,0.00012584872,0.72756195,0.000066949746,0.00035158457,0.0000028058776,0.0018411631,0.019866731,0.008005704,0.0362076,0.20324953,0.0019447964],"about_ca_topic_score_codex":0.00019689153,"about_ca_topic_score_gemma":0.0000038078135,"teacher_disagreement_score":0.24551105,"about_ca_system_score_codex":0.000013854982,"about_ca_system_score_gemma":0.000006037943,"threshold_uncertainty_score":0.9987215},"labels":[],"label_agreement":null},{"id":"W2135520881","doi":"","title":"Clustering the internet topology at the AS-level","year":2005,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Cluster analysis; Categorical variable; Data mining; The Internet; Computer science; Cluster (spacecraft); Path (computing); Link (geometry); Set (abstract data type); Topology (electrical circuits); Theoretical computer science; Mathematics; Artificial intelligence; Machine learning; World Wide Web; Computer network; Combinatorics","score_opus":0.022942730139222083,"score_gpt":0.2854966764833662,"score_spread":0.2625539463441441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135520881","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2318083,0.00009714257,0.19934979,0.01612103,0.000095123214,0.00025192805,0.000004067541,0.00013269066,0.55213994],"genre_scores_gemma":[0.9502096,0.0000013174212,0.000789507,0.00080092583,0.00042377773,0.00002056775,0.000005229348,0.000006861747,0.047742184],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995013,0.00004160015,0.00012374407,0.00011806725,0.0000623876,0.00015293961],"domain_scores_gemma":[0.9995317,0.00008375089,0.00004034444,0.00031038318,0.000015321375,0.000018496143],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012810426,0.00007893725,0.000086862434,0.000013139329,0.00011488385,0.000033396016,0.00029953284,0.00001352116,0.011184347],"category_scores_gemma":[0.0000013544,0.000038575352,0.00009039471,0.00006358387,0.00006789166,0.000030138786,0.000352711,0.000098030374,0.00033026715],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018851799,0.000070304195,0.020368382,0.0000013729343,0.00028061678,6.115089e-7,0.0009894107,0.0007467496,0.00041906958,0.26507592,0.3118498,0.4001789],"study_design_scores_gemma":[0.00017487779,0.000031844917,0.002835561,0.0000059712384,0.000055888326,0.0000060017333,0.00046799335,0.041953553,0.0073693427,0.010996966,0.93589485,0.0002071582],"about_ca_topic_score_codex":0.0008941775,"about_ca_topic_score_gemma":0.0012881198,"teacher_disagreement_score":0.7184013,"about_ca_system_score_codex":0.000022942662,"about_ca_system_score_gemma":0.0000064975616,"threshold_uncertainty_score":0.98971957},"labels":[],"label_agreement":null},{"id":"W2135575990","doi":"10.1007/978-3-642-30373-9_42","title":"“Two Is a Crowd” - Optimal Trend Adoption in Social Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Social network (sociolinguistics); Computer science; Process (computing); Social network analysis; Graph; Data science; Social media; World Wide Web; Theoretical computer science","score_opus":0.02196035611509857,"score_gpt":0.2609623881138835,"score_spread":0.23900203199878495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135575990","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068156584,0.0003671961,0.99391824,0.00024204723,0.00016107887,0.0003594334,0.00006794487,0.000037344376,0.004165146],"genre_scores_gemma":[0.32481444,0.000053060736,0.67389095,0.00008803299,0.0008702232,0.000039302857,0.00015943933,0.000025626325,0.00005892202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989345,0.0000096703325,0.0005469,0.00011107554,0.00015209141,0.00024573907],"domain_scores_gemma":[0.99910414,0.0001152311,0.00040266782,0.0002856554,0.00006118868,0.00003108646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027072072,0.00024698806,0.0003727692,0.00019276413,0.000627644,0.00011348819,0.0007447401,0.00013086859,0.000008917059],"category_scores_gemma":[0.0000028422767,0.00021704976,0.00025496766,0.00021885584,0.00026359383,0.00021820066,0.00042478883,0.0004306469,2.785138e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020900968,0.000021147245,0.000063645704,0.00003837545,0.000107463864,1.5594265e-8,0.0015398737,0.8721624,0.0000020502125,0.076882236,0.0001836834,0.048997026],"study_design_scores_gemma":[0.0002692235,0.000025707013,0.00014281992,0.00014593406,0.00011817535,0.0000012464136,0.000011268687,0.9712948,0.000022650074,0.0019543243,0.025640965,0.00037287324],"about_ca_topic_score_codex":0.00007193666,"about_ca_topic_score_gemma":0.00008056556,"teacher_disagreement_score":0.3241329,"about_ca_system_score_codex":0.000053360396,"about_ca_system_score_gemma":0.00005325519,"threshold_uncertainty_score":0.8851033},"labels":[],"label_agreement":null},{"id":"W2135893603","doi":"10.1109/cse.2009.435","title":"Collaborative Mining in Multiple Social Networks Data for Criminal Group Discovery","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Knowledge extraction; Social network analysis; Inference; Database transaction; Process (computing); Social network (sociolinguistics); Data science; Association rule learning; Resource (disambiguation); Data mining; Criminal investigation; Artificial intelligence; World Wide Web; Social media; Database","score_opus":0.03700813625947358,"score_gpt":0.31724640409220556,"score_spread":0.280238267832732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135893603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10615046,0.0000509479,0.8881738,0.00025400062,0.000044454133,0.0004403404,0.00012777752,0.00006789492,0.0046903244],"genre_scores_gemma":[0.9800313,0.0000012903225,0.018083554,0.00010347594,0.00069522177,0.000033340017,0.0009086395,0.00000975626,0.00013342354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990487,0.000038952978,0.00023873223,0.0003244642,0.00008174747,0.00026740585],"domain_scores_gemma":[0.9993969,0.00015055972,0.000085159474,0.00029924748,0.000040797382,0.000027302134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002014678,0.00013460398,0.00024232331,0.000055829427,0.00013737183,0.000110262685,0.0003337697,0.000032285698,0.000048912672],"category_scores_gemma":[0.000007133131,0.0001278427,0.000065329645,0.0003098529,0.000027656151,0.0003910447,0.00011416238,0.000088593406,6.6915413e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049694587,0.0013038898,0.08451612,0.000012640608,0.00025133198,0.0000047528256,0.0017934261,0.0024513688,0.00080935186,0.26143545,0.18167217,0.46525255],"study_design_scores_gemma":[0.002327117,0.00026967822,0.05399498,0.000054185024,0.00022145915,2.6422052e-7,0.0060259127,0.9022636,0.00024019627,0.017695794,0.016004672,0.000902182],"about_ca_topic_score_codex":0.00011295657,"about_ca_topic_score_gemma":0.0002857517,"teacher_disagreement_score":0.89981216,"about_ca_system_score_codex":0.000022705412,"about_ca_system_score_gemma":0.000026661484,"threshold_uncertainty_score":0.5213274},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019336901941465128,"score_gpt":0.28063291913272154,"score_spread":0.2612960171912564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135957668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034930035,0.000052628413,0.9635645,0.000024250536,0.0000544394,0.0001952304,0.00006232154,0.000116124174,0.0010004544],"genre_scores_gemma":[0.9959237,0.000041175732,0.0034019728,0.000091629205,0.00006891749,0.00003410262,0.000046070152,0.000028747467,0.00036367224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796677,0.000073763156,0.00057188905,0.0006324627,0.00030403887,0.00045109226],"domain_scores_gemma":[0.998908,0.00011669035,0.00017073289,0.00050449517,0.00009360863,0.00020646663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042666966,0.00036755917,0.00053893245,0.0009141719,0.00031035603,0.00007825327,0.0002726847,0.00006770729,0.0007893093],"category_scores_gemma":[6.6845575e-7,0.000319925,0.00060027716,0.001450475,0.000111610825,0.00010681143,0.000005789194,0.0003973687,0.000017475535],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040574098,0.00068721507,0.06478733,0.000011904748,0.002940278,0.000003377266,0.00039939865,0.0048391414,0.00039867495,0.0002355777,0.000022366194,0.92563415],"study_design_scores_gemma":[0.0004935626,0.0002377986,0.019181065,0.00006220253,0.0065723527,0.00000839483,0.00064584246,0.56113684,0.40646303,0.002999016,0.00039955397,0.0018003575],"about_ca_topic_score_codex":0.0049059927,"about_ca_topic_score_gemma":0.001219783,"teacher_disagreement_score":0.96099365,"about_ca_system_score_codex":0.00002918118,"about_ca_system_score_gemma":0.000012689011,"threshold_uncertainty_score":0.99992526},"labels":[],"label_agreement":null},{"id":"W2136112859","doi":"10.1109/cibcb.2007.4221242","title":"Evolving Extremal Epidemic Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Permutation (music); Population; Theoretical computer science; Representation (politics); Chromosome; Graph theory; Joins; Iterated function; Graph; Focus (optics); Set (abstract data type); Mathematics; Combinatorics; Biology","score_opus":0.011374384171941575,"score_gpt":0.2759337685205734,"score_spread":0.2645593843486318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136112859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02047834,0.00009328573,0.8216487,0.000029885801,0.000041319574,0.00006016542,2.5530144e-7,0.0001438368,0.15750422],"genre_scores_gemma":[0.98725426,0.0000011755718,0.010446194,0.00008517594,0.000780843,0.0000022375964,0.000010399202,0.000013301092,0.0014064193],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991205,0.000019380237,0.00025146193,0.00018314952,0.00008968256,0.00033585876],"domain_scores_gemma":[0.9994168,0.00014770987,0.000066106404,0.00024971412,0.000042589832,0.00007706102],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005226074,0.00011063024,0.0001594456,0.000061226005,0.00008087651,0.00002828077,0.00014959344,0.00002752174,0.0036044351],"category_scores_gemma":[0.0000035628964,0.00009982917,0.00013123598,0.00023180533,0.000023203345,0.000083234525,0.00007093937,0.00014249604,0.00003410604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010110059,0.00009091999,0.6079015,0.0000018782856,0.0001339524,0.0000041150874,0.000077776924,0.0022397146,0.0004074765,0.10889492,0.055589117,0.2246485],"study_design_scores_gemma":[0.00060995127,0.00006757022,0.102265194,0.00006686537,0.00016852863,0.0000037690452,0.0008385152,0.7764183,0.003320184,0.0715192,0.04347025,0.0012516488],"about_ca_topic_score_codex":0.00028315806,"about_ca_topic_score_gemma":0.00003992391,"teacher_disagreement_score":0.9667759,"about_ca_system_score_codex":0.000019941506,"about_ca_system_score_gemma":0.0000076233787,"threshold_uncertainty_score":0.9973064},"labels":[],"label_agreement":null},{"id":"W2136162247","doi":"10.1103/physreve.80.051127","title":"Critical behavior of the Ising model in annealed scale-free networks","year":2009,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council Canada; Korea Science and Engineering Foundation","keywords":"Ising model; Scaling; Cutoff; Statistical physics; Non-equilibrium thermodynamics; Physics; Phase transition; Critical point (mathematics); Critical phenomena; Condensed matter physics; Mathematics; Thermodynamics; Mathematical analysis; Quantum mechanics; Geometry","score_opus":0.018244245555881392,"score_gpt":0.34208405614919224,"score_spread":0.32383981059331085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136162247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.818604,0.019308811,0.12122767,0.0071754176,0.00012642313,0.0028442373,0.00005225604,0.00020179331,0.030459424],"genre_scores_gemma":[0.9984786,0.00013853722,0.0008001417,0.0003370142,0.00018067476,0.000038162994,0.000004323374,0.000009276293,0.000013299795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989295,0.00009336789,0.00033761124,0.00020796158,0.00019312167,0.00023844188],"domain_scores_gemma":[0.9990546,0.00009325054,0.00009035302,0.0006426425,0.00006581331,0.00005335615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016364513,0.00014452677,0.0004823323,0.000020081558,0.000045564695,0.000014185858,0.00045154968,0.000016124344,0.00003547929],"category_scores_gemma":[0.000028817472,0.000102541104,0.0003658515,0.0004229357,0.00007639296,0.000081959144,0.00012127774,0.00025097543,0.000002254782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021845535,0.004021983,0.029386489,0.00033045674,0.00005461562,0.000002795722,0.00016095485,0.009452199,0.0026813573,0.40130726,0.0106286695,0.54195136],"study_design_scores_gemma":[0.0003420494,0.00006862149,0.021395259,0.0032253338,0.0005527669,6.700497e-7,0.000007537765,0.6774946,0.00088211027,0.2952397,0.00035920294,0.0004321833],"about_ca_topic_score_codex":0.000023269708,"about_ca_topic_score_gemma":0.0000040984123,"teacher_disagreement_score":0.66804236,"about_ca_system_score_codex":0.000017321821,"about_ca_system_score_gemma":0.000019658892,"threshold_uncertainty_score":0.41815048},"labels":[],"label_agreement":null},{"id":"W2136275291","doi":"","title":"Monochromatic Bi-Clustering","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Computer science; Computational complexity theory; Complement (music); Simulated annealing; Pairwise comparison; Time complexity; Monochromatic color; Optimization problem; Approximation algorithm; Mathematical optimization; Theoretical computer science; Heuristic; Algorithm; Mathematics; Artificial intelligence","score_opus":0.010088343829847659,"score_gpt":0.23899772597297436,"score_spread":0.2289093821431267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136275291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3033074,0.000010805639,0.4119939,0.00018172905,0.000024117164,0.00019202835,4.1930252e-7,0.00022032122,0.28406927],"genre_scores_gemma":[0.98471576,2.1146914e-7,0.012780888,0.000042240652,0.000104771694,0.000047087087,0.000003855286,0.000007486869,0.0022976717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960554,0.000009889263,0.000114247356,0.000094130686,0.000051166164,0.00012502992],"domain_scores_gemma":[0.9997133,0.000017432088,0.000027494398,0.00018470822,0.00002079423,0.000036278157],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000028347373,0.00006619052,0.00009435933,0.000033286182,0.000038578048,0.000056354686,0.000099810735,0.000007959047,0.0145629095],"category_scores_gemma":[4.7539814e-7,0.00005482115,0.00005833023,0.000094035815,0.000010127577,0.000095356256,0.00006542519,0.000036978523,0.0006302762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018560719,0.00026594303,0.12115896,0.000026432765,0.00042844086,0.0000010135002,0.00036761942,0.0006334097,0.015610489,0.084780246,0.17435178,0.6023738],"study_design_scores_gemma":[0.0004177346,0.000057562833,0.032631606,0.000054610762,0.00007827323,0.0000013202825,0.00055631174,0.73398155,0.011395561,0.20962285,0.01038505,0.000817594],"about_ca_topic_score_codex":0.0008941916,"about_ca_topic_score_gemma":0.0000070224833,"teacher_disagreement_score":0.73334813,"about_ca_system_score_codex":0.0000064464157,"about_ca_system_score_gemma":0.0000038683957,"threshold_uncertainty_score":0.9863379},"labels":[],"label_agreement":null},{"id":"W2137007447","doi":"10.1109/tetc.2013.2273079","title":"Balancing System Survivability and Cost of Smart Grid Via Modeling Cascading Failures","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cascading failure; Robustness (evolution); Computer science; Smart grid; Survivability; Relay; Electric power system; Grid; Telecommunications network; Distributed computing; Interdependent networks; Reliability engineering; Power control; Complex network; Computer network; Power (physics); Engineering; Electrical engineering","score_opus":0.014457547653848806,"score_gpt":0.25940815596752576,"score_spread":0.24495060831367696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137007447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40185124,0.000011665268,0.59742594,0.000044146007,0.00016664442,0.00016570168,0.0000020863238,0.000056527588,0.00027607044],"genre_scores_gemma":[0.99427766,0.0000015880127,0.0055156415,0.0000067188,0.00015178023,0.000018286843,0.0000016898209,0.000015937152,0.000010701011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986865,0.00009934227,0.00050739234,0.00029759615,0.00014711104,0.00026205397],"domain_scores_gemma":[0.9993258,0.00016509091,0.00011524687,0.00025818803,0.00008440266,0.00005128444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039470632,0.00016622688,0.0003279485,0.00017887769,0.0001988346,0.00004262217,0.00013372969,0.000042479594,0.000034476747],"category_scores_gemma":[0.0000019963834,0.00017895995,0.00010447298,0.00028103136,0.000032715936,0.00011415203,0.000007976851,0.00029854258,0.0000015109692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062068875,0.0000997651,0.027964074,0.0001334075,0.00009630945,8.3572235e-7,0.0008566063,0.82569075,0.0007951935,0.0011762133,0.000014616545,0.14316602],"study_design_scores_gemma":[0.00015347486,0.000014655299,0.0004115391,0.00020477381,0.000022712871,0.0000011645656,0.0005134634,0.99620324,0.0017863456,0.0005146408,0.000019665928,0.00015430107],"about_ca_topic_score_codex":0.0067671277,"about_ca_topic_score_gemma":0.0002055477,"teacher_disagreement_score":0.5924264,"about_ca_system_score_codex":0.00007969001,"about_ca_system_score_gemma":0.000014562461,"threshold_uncertainty_score":0.9998469},"labels":[],"label_agreement":null},{"id":"W2137180616","doi":"10.1016/j.eswa.2014.07.018","title":"OWA operator based link prediction ensemble for social network","year":2014,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":126,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Badan Riset dan Inovasi Nasional; National Natural Science Foundation of China; McGill University","keywords":"Computer science; Benchmark (surveying); Link (geometry); Stability (learning theory); Operator (biology); Data mining; Variance (accounting); Social network (sociolinguistics); Ensemble learning; Algorithm; Artificial intelligence; Machine learning; Social media","score_opus":0.012930514568681406,"score_gpt":0.2658279071817388,"score_spread":0.25289739261305744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137180616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003528101,0.00007285797,0.99350625,0.00035245274,0.000053179254,0.0013584597,0.000034784967,0.00021652025,0.004052682],"genre_scores_gemma":[0.96700823,5.117152e-7,0.014362401,0.00009581001,0.006348924,0.011518009,0.0003179809,0.000036971935,0.00031117615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899423,0.000055911627,0.0002708941,0.00030428215,0.00012956026,0.00024510603],"domain_scores_gemma":[0.99917257,0.000094381925,0.00013933996,0.0003627639,0.0001613635,0.000069598056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020607776,0.00015287519,0.00024076967,0.00003876308,0.00053125643,0.00008874156,0.00017057755,0.000049284547,0.000027289036],"category_scores_gemma":[0.0000013340131,0.00013194069,0.000095648415,0.0002588768,0.000031937343,0.00005640299,0.000017457442,0.00007356121,0.000015953015],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007394599,0.00034080687,0.013257335,0.000068984766,0.0004186827,8.3327116e-8,0.00048443314,0.016974714,0.002615436,0.6346493,0.2795965,0.05151978],"study_design_scores_gemma":[0.00047912353,0.00006687646,0.00020259475,0.000033513195,0.00004916621,3.2396653e-7,0.00009904251,0.1394924,0.00038898087,0.0015607368,0.8573965,0.00023073284],"about_ca_topic_score_codex":0.00011762937,"about_ca_topic_score_gemma":0.000008477872,"teacher_disagreement_score":0.97914386,"about_ca_system_score_codex":0.000035057194,"about_ca_system_score_gemma":0.000045429777,"threshold_uncertainty_score":0.5380385},"labels":[],"label_agreement":null},{"id":"W2137331635","doi":"10.1145/2063576.2063655","title":"Building directories for social tagging systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Otto von Guericke University Magdeburg; Instituto Superior Técnico; Institute for Infocomm Research; University of Massachusetts Amherst; University of California, Los Angeles; Technische Universität Clausthal; Singapore Management University; National Laboratory of Pattern Recognition; Haute école Spécialisée de Suisse Occidentale; Guangxi Normal University; KU Leuven; University of Massachusetts Boston; Peking University; Universidad de Córdoba; Universidade Federal de Minas Gerais; Tampereen Yliopisto; Universidad de Castilla-La Mancha; University of Alberta; Korea Advanced Institute of Science and Technology; Yonsei University; Dalian University of Technology; Universität Konstanz; Kangwon National University; Trakya Üniversitesi; Hebrew University of Jerusalem; Bauhaus-Universität Weimar; University of Tsukuba; University of Central Florida; Universidad de Granada; Universidade de Lisboa; Technische Universität Darmstadt; Universiteit Antwerpen; Universidad Autónoma de Madrid; Universiteit Gent; Sapienza Università di Roma; Università degli Studi di Padova; Universiteit van Amsterdam; Université de Fribourg; Fudan University; National Central University; Ewha Womans University; Kyung Hee University; Hanyang University; Universität Heidelberg; Technische Universität Berlin; Beihang University; University of Twente; National Cheng Kung University; Microsoft Research Asia; City University of Hong Kong; University of Waterloo; Radboud Universiteit; Curtin University of Technology; Accenture; Queensland University of Technology; York University; University of Glasgow; University of Louisville; Università della Calabria; University of Crete; Arizona State University; Universitat Pompeu Fabra; National Chengchi University; Florida Institute of Technology; Indian Institute of Technology Madras; University of Warwick; RMIT University; Università degli Studi di Siena; Università degli Studi di Milano; Dublin City University; Johns Hopkins University; Harbin Institute of Technology; University of Illinois at Urbana-Champaign; Microsoft; Kent State University; Shandong University; Hong Kong Baptist University; Missouri University of Science and Technology; University of Bedfordshire; Indian Institute of Technology Bombay; Universidad de Valladolid; Teesside University; Robert Gordon University; University of Wolverhampton; Dartmouth College; National ICT Australia; Washington State University; Drexel University; Università degli Studi di Verona; Carnegie Mellon University; Queen Mary University of London; University of Ottawa; University of Southern California; University of Oklahoma; Georgia Institute of Technology; Universidade da Coruña; Dalhousie University; DePaul University; University of Texas at Arlington; University of Oregon; University of Technology Sydney; Technische Universiteit Delft; Microsoft Research; Université de Toulouse; University of Oxford; Florida International University; University of Pittsburgh; Julius-Maximilians-Universität Würzburg","keywords":"Computer science; Navigability; Information retrieval; Hierarchy; Interface (matter); Tag system; Visibility; Folksonomy; Social network (sociolinguistics); World Wide Web; Social media; Algorithm","score_opus":0.05144062432209683,"score_gpt":0.29753573055618265,"score_spread":0.24609510623408581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137331635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02609014,0.000029271701,0.88146824,0.000023090679,0.00014104586,0.0002193023,0.0000075205867,0.0002485371,0.09177283],"genre_scores_gemma":[0.97935593,1.268065e-7,0.01926383,0.00000911928,0.0006849795,0.00008448913,0.0000052646815,0.000011960334,0.00058430876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995229,0.000012915109,0.00012793724,0.00012302243,0.000051458814,0.00016172652],"domain_scores_gemma":[0.9997598,0.000031390755,0.000056007255,0.000085252985,0.000046220972,0.000021361318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010368029,0.000077455115,0.00014302746,0.000033416352,0.00015406978,0.00003759908,0.00009792644,0.000014371795,0.00021643686],"category_scores_gemma":[0.0000012366872,0.00006985389,0.000106477106,0.00008249654,0.00001642947,0.00006192265,0.0000329171,0.00003350399,0.0000028412048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038205035,0.000021183449,0.0068060346,0.0000057232287,0.000075938515,6.617132e-8,0.00023586443,0.0000023430755,0.00040365115,0.9785476,0.006262622,0.0076351683],"study_design_scores_gemma":[0.0010994335,0.0001440196,0.005409638,0.00010378625,0.0005247156,8.954166e-7,0.0030590137,0.033968717,0.059570197,0.34928775,0.5450053,0.0018265061],"about_ca_topic_score_codex":0.0006075883,"about_ca_topic_score_gemma":0.000003816849,"teacher_disagreement_score":0.9532658,"about_ca_system_score_codex":0.000011631281,"about_ca_system_score_gemma":0.000007942906,"threshold_uncertainty_score":0.2848559},"labels":[],"label_agreement":null},{"id":"W2137465421","doi":"10.1016/j.tcs.2008.10.015","title":"The degree distribution of random<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-trees","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scroll; Degree (music); Mathematics; Distribution (mathematics); Computer science; Physics; Mathematical analysis; Theology; Philosophy","score_opus":0.015779277903760762,"score_gpt":0.24383143856678902,"score_spread":0.22805216066302825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137465421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77758527,0.00004509635,0.22053547,0.00015085857,0.00015170498,0.000046463392,0.000023165183,0.00006461773,0.0013973686],"genre_scores_gemma":[0.9954925,0.000026160995,0.0038788621,0.00007459104,0.00040705124,0.000039203744,0.000049854894,0.00002207535,0.000009705262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977304,0.00009778153,0.00046097682,0.00046703688,0.00070097897,0.00054283295],"domain_scores_gemma":[0.99806786,0.000599203,0.00026074258,0.0007901992,0.000113562586,0.00016846489],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010167192,0.0002162836,0.0002155084,0.000049079037,0.00090679637,0.00020632752,0.0010543225,0.000084814405,0.00003952205],"category_scores_gemma":[0.00007026413,0.00018454355,0.0003401988,0.0005090813,0.002899925,0.0002463796,0.00074556645,0.00028595803,0.00008527955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100972546,0.00009063224,0.00009272113,0.000008505579,0.000052846983,0.000008955818,0.00014921225,0.0004214174,0.0002535809,0.99284726,0.00024723422,0.005726682],"study_design_scores_gemma":[0.00037957195,0.00017860255,0.00055021077,0.00006922971,0.000068855355,0.000020849662,0.00002755806,0.9691455,0.006149972,0.022793626,0.00042847227,0.00018758055],"about_ca_topic_score_codex":0.0000700089,"about_ca_topic_score_gemma":0.000009220309,"teacher_disagreement_score":0.9700536,"about_ca_system_score_codex":0.000012616759,"about_ca_system_score_gemma":0.0001600913,"threshold_uncertainty_score":0.9998136},"labels":[],"label_agreement":null},{"id":"W2137907137","doi":"10.1109/cec.2011.5949698","title":"Comparison of evolved epidemic networks with diffusion characters","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Character (mathematics); Diffusion; Computer science; Degree (music); Epidemic model; Variety (cybernetics); Artificial intelligence; Space (punctuation); Mathematics; Algorithm; Physics; Demography","score_opus":0.038567386608616104,"score_gpt":0.29089650948308216,"score_spread":0.25232912287446607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137907137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6849607,0.000021549442,0.29215017,0.000011292838,0.000018451909,0.00012369157,8.4074867e-7,0.00007043976,0.022642821],"genre_scores_gemma":[0.9933702,0.0000015467602,0.0062941737,0.000017491615,0.000072628485,0.000011873296,0.00002698745,0.000012533233,0.00019256343],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992533,0.00003499827,0.00028065022,0.00016342496,0.00009249889,0.00017515535],"domain_scores_gemma":[0.99937105,0.000040350755,0.00020276583,0.00028106122,0.000052860378,0.00005190789],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009741341,0.00012145963,0.00033018555,0.000050925304,0.00004066524,0.000005856014,0.00015954116,0.000024815612,0.0012520361],"category_scores_gemma":[7.013305e-7,0.00008828754,0.000092553964,0.00017262173,0.00005040985,0.00006100774,0.000056176334,0.00011536031,0.0000058736646],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003372346,0.00018773031,0.98200005,0.000002066813,0.00008130389,1.4248965e-7,0.00019296262,0.00008953092,0.0005009701,0.0075148055,0.00085829885,0.008538434],"study_design_scores_gemma":[0.0007289483,0.00037037177,0.71868664,0.00012550967,0.00026977292,4.0410242e-7,0.0006416534,0.26010403,0.013743376,0.0037466818,0.0009777142,0.0006049125],"about_ca_topic_score_codex":0.00065461383,"about_ca_topic_score_gemma":0.000023469058,"teacher_disagreement_score":0.30840948,"about_ca_system_score_codex":0.000007928009,"about_ca_system_score_gemma":0.0000076186734,"threshold_uncertainty_score":0.99966097},"labels":[],"label_agreement":null},{"id":"W2138392784","doi":"","title":"Using the Omega Index for Evaluating Abstractive Community Detection","year":2012,"lang":"en","type":"article","venue":"North American Chapter of the Association for Computational Linguistics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of the Fraser Valley","funders":"","keywords":"Automatic summarization; Computer science; Disjoint sets; Sentence; Artificial intelligence; Natural language processing; Cluster analysis; Metric (unit); Graph; Contrast (vision); Task (project management); Index (typography); Theoretical computer science; Mathematics; Combinatorics","score_opus":0.06175701061134741,"score_gpt":0.3600102047298923,"score_spread":0.2982531941185449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138392784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49842542,0.00000507042,0.5000515,0.00004182003,0.00026543235,0.00048562777,0.00017775972,0.000020157631,0.00052722613],"genre_scores_gemma":[0.9846835,1.10504274e-7,0.014401929,0.000051156963,0.0007322536,0.00003644069,0.000059934137,0.000014845945,0.000019804724],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990666,0.00011469823,0.00029911855,0.00007689577,0.000266165,0.00017655177],"domain_scores_gemma":[0.9959802,0.0016342805,0.0011321595,0.0001511056,0.0010755651,0.000026680362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000736804,0.00010081892,0.00017342254,0.00004015039,0.00060449913,0.000023044506,0.00018455538,0.000016267444,0.000002491917],"category_scores_gemma":[0.0006078044,0.000078509904,0.00020247606,0.00018917039,0.00006652805,0.000029740213,0.000058192654,0.00017724095,3.5155395e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004287469,0.00012772123,0.777732,0.000010220683,0.00039434162,2.4846036e-9,0.000667951,0.18923584,0.00004158723,0.019082341,0.00004698714,0.01261812],"study_design_scores_gemma":[0.0004038053,0.000100865305,0.39112338,0.00001376879,0.00037743765,1.5075433e-7,0.00050713326,0.5722824,0.00044514798,0.03207947,0.0024556913,0.00021075673],"about_ca_topic_score_codex":0.0004003035,"about_ca_topic_score_gemma":0.00007749328,"teacher_disagreement_score":0.4862581,"about_ca_system_score_codex":0.00013848822,"about_ca_system_score_gemma":0.00003737565,"threshold_uncertainty_score":0.46493798},"labels":[],"label_agreement":null},{"id":"W2138667259","doi":"10.1109/ccece.2005.1556914","title":"The effectiveness of vaccinations on the spread of email-borne computer viruses","year":2005,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer virus; Computer science; Node (physics); Simplicity; The Internet; Vaccination; Virus; Computer network; Theoretical computer science; Virology; Distributed computing; Computer security; World Wide Web; Medicine; Engineering","score_opus":0.012437904157631003,"score_gpt":0.27700310530941713,"score_spread":0.2645652011517861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138667259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7580132,0.000048324804,0.18186861,0.00074735377,0.00004401316,0.0005441163,0.000014182056,0.000057218247,0.058662966],"genre_scores_gemma":[0.99900985,0.0000015149985,0.0007417861,0.000029368424,0.000107021115,0.000022349708,0.0000022963598,0.000005374091,0.00008042737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939543,0.00017321401,0.00016604294,0.00008543881,0.00009679499,0.00008305509],"domain_scores_gemma":[0.99798214,0.0015220272,0.00008963559,0.00031361612,0.000081589824,0.000010996457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042727325,0.00007014668,0.00013116653,0.00002623241,0.00009000452,0.000014480695,0.00021362079,0.000010112885,0.0002397652],"category_scores_gemma":[0.0000043655737,0.00003518504,0.000114812516,0.00015446957,0.000033810524,0.000030403635,0.000058865076,0.000058185167,0.000008251172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020451744,0.00016101514,0.0105592925,0.0000038888456,0.0001527154,1.7881758e-8,0.000030410209,0.0011013653,0.0007693023,0.95146364,0.0026199447,0.033117943],"study_design_scores_gemma":[0.0006745778,0.00029921357,0.290672,0.00018029127,0.00018970021,2.62158e-7,0.00015297113,0.03372963,0.56954676,0.07777406,0.026437303,0.00034324452],"about_ca_topic_score_codex":0.00015717585,"about_ca_topic_score_gemma":0.000041316376,"teacher_disagreement_score":0.8736896,"about_ca_system_score_codex":0.000008328951,"about_ca_system_score_gemma":0.000009770113,"threshold_uncertainty_score":0.26252607},"labels":[],"label_agreement":null},{"id":"W2139137343","doi":"10.1109/cibcb.2008.4675789","title":"Characterization of extremal epidemic networks with diffusion characters","year":2008,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Population; Adjacency matrix; Computer science; Evolutionary algorithm; Metric (unit); Character (mathematics); Evolutionary computation; Complex network; Sequence (biology); Matrix (chemical analysis); Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.011241331465462455,"score_gpt":0.21245103394563453,"score_spread":0.20120970248017206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139137343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.734482,0.000003096535,0.26346987,0.000030474377,0.000013159075,0.00009462825,0.0000017397485,0.000048662987,0.0018563885],"genre_scores_gemma":[0.9980771,0.000013140866,0.0009119165,0.00003734008,0.00018388015,0.00001360305,0.00018001682,0.000014301795,0.0005687187],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99928486,0.000032869,0.0002425683,0.00016833577,0.00011168936,0.00015965046],"domain_scores_gemma":[0.99946207,0.000028267834,0.00018802125,0.00021886974,0.00005853104,0.00004421877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006612249,0.0001194494,0.00023646922,0.00006202101,0.000073436255,0.000005944827,0.00010316063,0.000024757675,0.0004883863],"category_scores_gemma":[7.242014e-7,0.00009131715,0.00007782886,0.0002250822,0.00005542459,0.00011376046,0.00003831393,0.00008466059,0.000003929335],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057204623,0.00019311575,0.8515028,0.0000047110534,0.0001028258,0.000002109111,0.0001340376,0.00020960471,0.12953675,0.0056411615,0.0002081135,0.0124075655],"study_design_scores_gemma":[0.0005904661,0.00013001144,0.9007486,0.00008041446,0.00008417228,0.000006242926,0.000035347628,0.07776224,0.018533627,0.00030473009,0.0012785816,0.0004455678],"about_ca_topic_score_codex":0.000109103894,"about_ca_topic_score_gemma":0.0000032356734,"teacher_disagreement_score":0.2635951,"about_ca_system_score_codex":0.000008944329,"about_ca_system_score_gemma":0.000012669663,"threshold_uncertainty_score":0.53474873},"labels":[],"label_agreement":null},{"id":"W2139618284","doi":"10.7282/t3765fq1","title":"Analyzing the impact of local perturbations of network topologies at the application-level","year":2007,"lang":"en","type":"article","venue":"Rutgers University Community Repository (Rutgers University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Network topology; Computer science; Distributed computing; Complex network; Network formation; Computer network","score_opus":0.017169270823251682,"score_gpt":0.24668971246801802,"score_spread":0.22952044164476634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139618284","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07971069,0.00007192039,0.3348811,0.000116346164,0.000057235568,0.00034798658,0.000047487338,0.000089869834,0.58467734],"genre_scores_gemma":[0.9978029,0.000015653475,0.00046585323,0.000005193579,0.000057531935,1.9469249e-7,0.000049287086,0.000011559151,0.0015918077],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99829334,0.00068918115,0.0002868689,0.00020361252,0.00018007639,0.0003469009],"domain_scores_gemma":[0.9965422,0.0012842914,0.00055066566,0.001208174,0.00031831372,0.00009636324],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00068718643,0.00022880276,0.0003628895,0.00028599703,0.0021540578,0.00001914928,0.0014435153,0.000093435774,0.00007145135],"category_scores_gemma":[0.000008202968,0.00018735624,0.00062185986,0.0016955724,0.0013014511,0.00019275617,0.00070054375,0.0005683696,0.0000019456438],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016163752,0.0018641584,0.47112826,0.000085109146,0.008140169,0.000037372345,0.0106958775,0.11676664,0.3138311,0.023763584,0.027132794,0.024938574],"study_design_scores_gemma":[0.0039871335,0.0011134656,0.039510757,0.00032208534,0.00424427,0.000023243801,0.021923088,0.016698943,0.89518934,0.009115504,0.005213927,0.0026582158],"about_ca_topic_score_codex":0.01407359,"about_ca_topic_score_gemma":0.0000196275,"teacher_disagreement_score":0.91809225,"about_ca_system_score_codex":0.00048615926,"about_ca_system_score_gemma":0.00016670128,"threshold_uncertainty_score":0.99914503},"labels":[],"label_agreement":null},{"id":"W2139709253","doi":"10.1073/pnas.0805921105","title":"Experience versus talent shapes the structure of the Web","year":2008,"lang":"en","type":"article","venue":"Proceedings of the National Academy of Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Web page; Entitlement (fair division); Variance (accounting); Hyperlink; Computer science; Ranking (information retrieval); World Wide Web; Popularity; The Internet; Information retrieval; Psychology; Business; Social psychology","score_opus":0.04232035534904881,"score_gpt":0.30970573470669854,"score_spread":0.2673853793576497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139709253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99480045,0.000052345793,0.0000019546958,0.0012078377,0.000016328926,0.000116514224,0.000014524409,0.0000054260354,0.0037846428],"genre_scores_gemma":[0.99945384,0.000007540893,0.00032704757,0.000048206763,0.00009948343,0.0000042786874,5.5340156e-8,0.000002103225,0.000057445715],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986158,0.000006888438,0.00023686823,0.00014509122,0.00089072203,0.0001046492],"domain_scores_gemma":[0.9992513,0.00010285739,0.00043659602,0.00001452809,0.00018146986,0.000013260368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025489394,0.00007634934,0.00011604274,0.00004343565,0.0003414133,0.000011162119,0.0013692714,0.000024208284,0.00006996435],"category_scores_gemma":[0.000053314754,0.00003482035,0.00012785805,0.0007513561,0.0014222983,0.00017449331,0.00025083093,0.00013690363,1.7956076e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002852662,0.00007476431,0.12068494,0.000018011031,0.00008241447,1.6759761e-9,0.00235162,0.00053375354,0.5909091,0.2808717,0.003482895,0.0009622453],"study_design_scores_gemma":[0.00019426901,0.000032357435,0.1333263,0.00006224082,0.000030630206,0.0000018395253,0.0010750091,0.0036345832,0.78264624,0.07791318,0.0009717069,0.00011165591],"about_ca_topic_score_codex":0.000016121048,"about_ca_topic_score_gemma":1.6740456e-7,"teacher_disagreement_score":0.20295852,"about_ca_system_score_codex":0.000012040235,"about_ca_system_score_gemma":0.000034875724,"threshold_uncertainty_score":0.5240517},"labels":[],"label_agreement":null},{"id":"W2139836297","doi":"10.1007/978-3-642-00528-2_4","title":"Mining Research Communities in Bibliographical Data","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Exploit; Data science; Social network (sociolinguistics); Social network analysis; Information retrieval; Knowledge extraction; World Wide Web; Data mining; Social media","score_opus":0.10668408608785356,"score_gpt":0.3666192580311923,"score_spread":0.2599351719433387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139836297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016027882,0.0006357875,0.9686076,0.0005748894,0.0001583133,0.00039114672,0.000025799312,0.00009060636,0.027913036],"genre_scores_gemma":[0.9115015,0.000080393176,0.08721267,0.00018713532,0.0006876399,0.000007259084,0.00016164906,0.000029261671,0.00013245553],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970792,0.00012875636,0.00045528787,0.00081606244,0.000861965,0.00065874954],"domain_scores_gemma":[0.99625146,0.0010557433,0.00011914647,0.0022975416,0.00018699114,0.000089133464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028135863,0.00031343082,0.00048958004,0.006655862,0.000262764,0.00041553995,0.00402206,0.0001463826,0.00015763885],"category_scores_gemma":[0.0000150951555,0.0003017756,0.000088508285,0.0039589894,0.0011732512,0.00028635442,0.002639206,0.0017432999,0.0000067901287],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005185673,0.000049957904,0.0059381374,0.0000070071906,0.000014769382,0.000014579975,0.00037341003,0.002337917,0.000006724036,0.010716935,0.00044982153,0.98008555],"study_design_scores_gemma":[0.0002191295,0.00013875043,0.0013146725,0.0010360521,0.000015271891,0.0000040093823,0.000005519557,0.33290112,0.00006601226,0.6485105,0.015076228,0.00071271637],"about_ca_topic_score_codex":0.0008287974,"about_ca_topic_score_gemma":0.0015259495,"teacher_disagreement_score":0.97937286,"about_ca_system_score_codex":0.00007081039,"about_ca_system_score_gemma":0.00021575727,"threshold_uncertainty_score":0.99994344},"labels":[],"label_agreement":null},{"id":"W2140351104","doi":"10.1109/ccece.2008.4564851","title":"Study of number of packets in transit in a data network model near onset of congestion using functional fixed effect models","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Network packet; Computer science; Computer network; Data modeling","score_opus":0.058553134226024234,"score_gpt":0.25440971396257644,"score_spread":0.1958565797365522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140351104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9258727,0.000014804004,0.07365699,0.000012116113,0.000013336485,0.00027538187,0.000015554675,0.000012273477,0.00012686462],"genre_scores_gemma":[0.9978827,0.0000071343907,0.0020259896,0.0000048726415,0.000030044013,0.000015624382,0.000019454228,0.000012160247,0.0000019888078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986762,0.000021324084,0.00043830022,0.00035752193,0.00018136426,0.00032531444],"domain_scores_gemma":[0.99937093,0.0000654841,0.000119364166,0.00015624454,0.0001626701,0.00012528128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019863273,0.0002068831,0.00054511614,0.00024702464,0.000039504965,0.000023309936,0.0002593501,0.00006526616,0.000016886415],"category_scores_gemma":[0.0000061698875,0.00021700369,0.000037641017,0.0005979724,0.000050074003,0.00018158687,0.000058354577,0.00027748628,1.3852414e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013100718,0.0003606871,0.38561124,0.000086256405,0.00013694914,0.000009704905,0.0016195966,0.56913537,0.00033315129,0.034198426,0.000070278336,0.008307322],"study_design_scores_gemma":[0.00051386625,0.00017405656,0.017650686,0.0001868405,0.000026940997,0.0000050417657,0.000023481065,0.97959435,0.00007592988,0.0015742483,8.667095e-7,0.00017368991],"about_ca_topic_score_codex":0.0072613503,"about_ca_topic_score_gemma":0.0015967945,"teacher_disagreement_score":0.41045898,"about_ca_system_score_codex":0.000047940794,"about_ca_system_score_gemma":0.00032745083,"threshold_uncertainty_score":0.99934936},"labels":[],"label_agreement":null},{"id":"W2140507670","doi":"10.1109/cec.2009.4983357","title":"Discovery of email communication networks from the Enron corpus with a genetic algorithm using social network analysis","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Prestige; Key (lock); Social network analysis; Computer science; Corporation; Social network (sociolinguistics); Commission; Set (abstract data type); Social media; Data science; World Wide Web; Business; Computer security; Finance","score_opus":0.010113213228108486,"score_gpt":0.24926431075001432,"score_spread":0.23915109752190583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140507670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17160779,0.0003458957,0.8271102,0.00009269545,0.000009020975,0.0001387197,0.000011905773,0.00003411352,0.0006497145],"genre_scores_gemma":[0.93506277,0.000016361935,0.06409795,0.00009010307,0.0004932678,0.0000069229973,0.00017491243,0.000011637032,0.00004610473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878854,0.00018980101,0.00035587332,0.00022518744,0.00019575004,0.00024484217],"domain_scores_gemma":[0.99875885,0.00015570976,0.00034147015,0.0006363016,0.000082002174,0.000025643454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017150791,0.00017876677,0.00042171337,0.00004606812,0.00029590414,0.00010637472,0.0004029519,0.00004152754,0.000096728196],"category_scores_gemma":[6.629991e-7,0.00012177943,0.0002861301,0.0011353156,0.00010088114,0.000117611904,0.000090448986,0.00017406048,5.264085e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075055796,0.0003318535,0.32328808,0.000001245673,0.0047532455,0.000001166825,0.0005191582,0.3978427,0.000116743075,0.011865366,0.002598902,0.25860646],"study_design_scores_gemma":[0.00025283106,0.00005098743,0.18072295,0.000025658346,0.0024565666,2.264428e-7,0.00019839301,0.80296445,0.00007690911,0.012861095,0.00012501892,0.00026494078],"about_ca_topic_score_codex":0.004259188,"about_ca_topic_score_gemma":0.00037334178,"teacher_disagreement_score":0.763455,"about_ca_system_score_codex":0.000027549833,"about_ca_system_score_gemma":0.000028355138,"threshold_uncertainty_score":0.64386463},"labels":[],"label_agreement":null},{"id":"W2140529485","doi":"10.7202/602460ar","title":"Reconstruction en sciences sociales : le cas des réseaux de savoirs","year":2009,"lang":"fr","type":"article","venue":"Nouvelles perspectives en sciences sociales","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy","score_opus":0.05120711727047539,"score_gpt":0.3621398787267884,"score_spread":0.310932761456313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140529485","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90144014,0.014377602,0.024984999,0.017559063,0.00052317034,0.000505047,0.00006464055,0.00027588566,0.040269442],"genre_scores_gemma":[0.94095284,0.0014805819,0.053976893,0.00009073302,0.0023789916,0.000017650671,0.0000054084107,0.000023508845,0.0010733875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946479,0.0016021235,0.0006082883,0.0011797452,0.00071305706,0.001248884],"domain_scores_gemma":[0.9975257,0.0012426676,0.0004694197,0.00025881143,0.00029111697,0.00021227694],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0035218212,0.0005329113,0.00069269264,0.00042180956,0.0045430083,0.0007527632,0.001141468,0.000269389,0.00032128624],"category_scores_gemma":[0.00026873738,0.0005583015,0.00058778207,0.0021559892,0.019239409,0.0010969121,0.00019727486,0.00050650723,0.000048762806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012532395,0.00044122714,0.0166931,0.000016075468,0.00014597493,0.0000038370767,0.09055204,0.0005361481,0.0024198948,0.80332637,0.0014457394,0.08440705],"study_design_scores_gemma":[0.00024936788,0.0003630007,0.0154745355,0.00017136472,0.00013471708,0.000019656145,0.38952276,0.0018598827,0.001710893,0.58859974,0.0012088659,0.0006852255],"about_ca_topic_score_codex":0.0071079317,"about_ca_topic_score_gemma":0.0022040203,"teacher_disagreement_score":0.2989707,"about_ca_system_score_codex":0.002905395,"about_ca_system_score_gemma":0.007850485,"threshold_uncertainty_score":0.99968684},"labels":[],"label_agreement":null},{"id":"W2141015754","doi":"10.2139/ssrn.875350","title":"Strong Ties in a Small World","year":2006,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Business","score_opus":0.0071683537541906055,"score_gpt":0.2302624887385152,"score_spread":0.2230941349843246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141015754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6399694,0.0020467795,0.28416565,0.00041906463,0.00009267417,0.00020184214,0.0000028754685,0.00010289249,0.0729988],"genre_scores_gemma":[0.9927699,0.000026081025,0.0006831266,0.000008678662,0.00070533785,0.000009085299,0.000008348586,0.000018753019,0.0057707075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977552,0.000064985805,0.00031148194,0.00015672922,0.0001102413,0.0016013461],"domain_scores_gemma":[0.99962544,0.000028740136,0.0001306916,0.00014604548,0.00003566226,0.000033404674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066421146,0.00014665234,0.00020359986,0.00026881462,0.00010110547,0.000071348724,0.00023804608,0.000020164462,0.00022107006],"category_scores_gemma":[0.0000010819278,0.00013906496,0.00015314591,0.00038926146,0.000021173824,0.00009802193,0.000039188537,0.0013148824,0.000014226758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009312492,0.000062929576,0.13106433,7.144812e-7,0.000060377337,0.0000012642703,0.000013403597,0.00024847346,0.00005804027,0.83418137,0.00038840153,0.03391138],"study_design_scores_gemma":[0.0003847269,0.000046500005,0.004503118,0.00001958578,0.000030913976,0.0000091654165,0.00034967472,0.0005767092,0.0001591157,0.98841053,0.0053076283,0.00020231091],"about_ca_topic_score_codex":0.0018751099,"about_ca_topic_score_gemma":0.025879825,"teacher_disagreement_score":0.35280046,"about_ca_system_score_codex":0.0003863911,"about_ca_system_score_gemma":0.000426778,"threshold_uncertainty_score":0.9918953},"labels":[],"label_agreement":null},{"id":"W2141016930","doi":"10.1177/0263276405057196","title":"Complexity, Science and the Public","year":2005,"lang":"en","type":"article","venue":"Theory Culture & Society","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Meaning (existential); Context (archaeology); Field (mathematics); Epistemology; Data science; Power (physics); Sociology; Computer science; Mathematics; Geography; Philosophy","score_opus":0.015763776936221153,"score_gpt":0.2698607167070234,"score_spread":0.2540969397708022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141016930","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39259395,0.0037621555,0.09525226,0.03984963,0.00021208763,0.0017357939,0.000048765876,0.00101464,0.46553072],"genre_scores_gemma":[0.9941434,0.00001713864,0.0038138877,0.00095721707,0.00046298187,0.00001849292,0.000005951794,0.0000069184252,0.00057397987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990682,0.00009322635,0.00012335133,0.00021334419,0.00025447912,0.00024742383],"domain_scores_gemma":[0.9993343,0.0000670524,0.0000688325,0.0002994503,0.00016434542,0.00006606246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001782735,0.00011726863,0.00015493555,0.000010681439,0.0007164502,0.00020217174,0.00042324545,0.000021193477,0.00038053194],"category_scores_gemma":[0.000011434329,0.00006672453,0.00016396453,0.00040523233,0.002309869,0.0002104247,0.0002584016,0.0001987269,0.000014960648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003821003,0.000022441627,0.00018195853,9.2466365e-7,0.000042355332,1.6857195e-8,0.0026587183,0.0000014413761,0.0002707919,0.9673984,0.019930556,0.00948855],"study_design_scores_gemma":[0.0005793738,0.000008522483,0.0003696541,0.0000057041952,0.00006140097,0.0000017316402,0.003651154,0.0025853724,0.0006176829,0.80056256,0.1913715,0.00018536732],"about_ca_topic_score_codex":0.000012652382,"about_ca_topic_score_gemma":0.000005512412,"teacher_disagreement_score":0.6015495,"about_ca_system_score_codex":0.00003952536,"about_ca_system_score_gemma":0.000047439375,"threshold_uncertainty_score":0.85108083},"labels":[],"label_agreement":null},{"id":"W2141274153","doi":"10.1163/157361109789017041","title":"Critical Behavior Ising Model S = 1, 3/2 and 2 on Directed Networks","year":2009,"lang":"en","type":"article","venue":"Multidiscipline Modeling in Materials and Structures","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Fundação de Amparo à Pesquisa do Estado do Piauí","keywords":"Ising model; Phase transition; Order (exchange); Ising spin; Statistical physics; Phase (matter); Condensed matter physics; Small-world network; Physics; Mathematics; Complex network; Combinatorics; Quantum mechanics","score_opus":0.022964607283679238,"score_gpt":0.3109651567356412,"score_spread":0.28800054945196196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141274153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9538142,0.00008432816,0.045619126,0.000098069,0.000049570255,0.00015357562,0.000022088265,0.00007887827,0.00008017289],"genre_scores_gemma":[0.9869256,0.000014846696,0.012714216,0.000036062545,0.00023182906,0.000016115213,0.000038450922,0.000016408863,0.0000064692767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988524,0.000045555553,0.00035318267,0.00036853,0.00010275257,0.00027762426],"domain_scores_gemma":[0.99962956,0.000037016245,0.000046359342,0.00017654322,0.00003969207,0.000070817405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015400746,0.00022518412,0.00035413107,0.00009632359,0.00016904208,0.00017588517,0.00008152932,0.00006744149,0.00003507806],"category_scores_gemma":[0.000009301262,0.00019015881,0.000035913577,0.00007225733,0.000044247812,0.00008972393,0.00007765037,0.00013979137,1.570544e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014769084,0.00015117896,0.0038471853,0.000016330983,0.000022670094,0.000005873684,0.00043247078,0.8865327,0.048259,0.03316072,0.000038890317,0.02738524],"study_design_scores_gemma":[0.00023660078,0.00002994756,0.005773607,0.000042610045,0.00003290626,8.4525703e-7,0.000023748127,0.9326889,0.0010041924,0.059961926,7.2270524e-7,0.00020399466],"about_ca_topic_score_codex":0.00008451333,"about_ca_topic_score_gemma":0.000009844881,"teacher_disagreement_score":0.047254812,"about_ca_system_score_codex":0.000011297081,"about_ca_system_score_gemma":0.0000071807253,"threshold_uncertainty_score":0.77544516},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.042764357149507444,"score_gpt":0.3893523946520242,"score_spread":0.34658803750251677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141363521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97071433,0.000046084573,0.020276366,0.008511739,0.00012142202,0.00019458492,0.000013371293,0.00001443524,0.00010768702],"genre_scores_gemma":[0.99294394,0.000019167923,0.006769771,0.0001307078,0.00011943663,0.000008886216,0.0000011812875,0.000002706316,0.0000042151887],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998729,0.000060422255,0.0003387925,0.00010187265,0.0005519197,0.00021797823],"domain_scores_gemma":[0.99769676,0.00033733025,0.000704275,0.00019744564,0.00103824,0.000025971634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022643635,0.0000781918,0.00016598863,0.00015930078,0.0012528894,0.00016814518,0.00073184544,0.000027462167,0.000008359232],"category_scores_gemma":[0.00023327964,0.00003574717,0.00016905069,0.002694168,0.002037355,0.001046917,0.00029105615,0.0003625998,4.4782365e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015477007,0.00008621447,0.20514743,0.000022439239,0.0005562223,2.5136757e-7,0.017140197,0.00014990834,0.03082902,0.16002987,0.05376325,0.5321204],"study_design_scores_gemma":[0.0007388851,0.0008080971,0.11626668,0.00019578615,0.00022756206,0.00002220094,0.09632827,0.0044707465,0.014677054,0.7363779,0.029475678,0.0004111114],"about_ca_topic_score_codex":0.00003759542,"about_ca_topic_score_gemma":0.000010132697,"teacher_disagreement_score":0.57634807,"about_ca_system_score_codex":0.000107010615,"about_ca_system_score_gemma":0.00018026672,"threshold_uncertainty_score":0.96363384},"labels":[],"label_agreement":null},{"id":"W2141374930","doi":"10.37693/pjos.2011.3.8830","title":"Content Analysis and the Measurement of Meaning: The Visualization of Frames in Collections of Messages","year":2011,"lang":"en","type":"article","venue":"Public Journal of Semiotics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Meaning (existential); Semantic space; Computer science; Framing (construction); Visualization; Space (punctuation); Social network analysis; Communication theory; Latent semantic analysis; Information retrieval; Linguistics; World Wide Web; Natural language processing; Artificial intelligence; Social media; Sociology; Epistemology; Communication","score_opus":0.07448249658531614,"score_gpt":0.2766385500508565,"score_spread":0.2021560534655404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141374930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64026713,0.0013565109,0.34487385,0.0010095228,0.00007869868,0.00041600416,0.0000117295485,0.000008127076,0.011978407],"genre_scores_gemma":[0.9990699,0.000088272514,0.00079192856,0.000007748541,0.000022213395,0.0000014448585,7.632509e-7,0.0000041920953,0.000013484097],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986053,0.00017936103,0.0007180117,0.00005355073,0.0003615497,0.000082226026],"domain_scores_gemma":[0.99763435,0.00017802915,0.0010839412,0.00015746994,0.00092104287,0.000025141884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020133834,0.0000691551,0.00041270463,0.00034027486,0.00004658463,0.000018458768,0.00021784118,0.00001966577,0.000057175515],"category_scores_gemma":[0.00010393037,0.000038883176,0.00021063902,0.0012263241,0.00017056425,0.00007051941,0.000049879098,0.000110512425,1.5010182e-8],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010904592,0.00058213476,0.73814636,0.000026732965,0.0052790153,2.3667432e-7,0.0077343383,0.00086068886,0.00095703837,0.24327125,0.00051612506,0.0025170224],"study_design_scores_gemma":[0.008059858,0.001055816,0.4695973,0.00086757884,0.01782232,0.000009765533,0.052593898,0.08075187,0.13547735,0.23161167,0.0014139492,0.00073863025],"about_ca_topic_score_codex":0.0003263991,"about_ca_topic_score_gemma":0.00014701004,"teacher_disagreement_score":0.3588028,"about_ca_system_score_codex":0.000020626157,"about_ca_system_score_gemma":0.000062455576,"threshold_uncertainty_score":0.15856099},"labels":[],"label_agreement":null},{"id":"W2141750152","doi":"10.1145/2463676.2463679","title":"Peckalytics","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; World Wide Web; Analytics; Social media; Data science; Graph; Scale (ratio); Information retrieval","score_opus":0.005382890208118038,"score_gpt":0.22336878081446673,"score_spread":0.2179858906063487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141750152","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09227614,0.000005042564,0.111817926,0.00029384193,0.000016808444,0.000100391706,4.529804e-7,0.00013615975,0.79535323],"genre_scores_gemma":[0.98606646,1.6165983e-7,0.0058417753,0.000059150345,0.00012760445,0.000016246711,0.000004047338,0.000004322027,0.007880218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972653,0.0000048770526,0.00006911207,0.00006651321,0.000042692693,0.00009024669],"domain_scores_gemma":[0.9997739,0.000011911312,0.000015461086,0.00014046537,0.000029425672,0.000028790888],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000018393128,0.000042615524,0.000057407153,0.000018084518,0.000024166842,0.00003283641,0.00007278716,0.000005846949,0.02508883],"category_scores_gemma":[3.5870448e-7,0.000034393717,0.000046609035,0.00007226055,0.000009834419,0.000052400545,0.000030862186,0.000032687058,0.0008269564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.5174347e-7,0.000062494495,0.12594664,8.516601e-7,0.00006091857,1.0230471e-7,0.000030449202,0.00001528981,0.0005958044,0.48235512,0.2973909,0.09354116],"study_design_scores_gemma":[0.0002704847,0.00003815782,0.03579009,0.000008004766,0.000058228226,3.96153e-7,0.00037050428,0.049331598,0.009763736,0.74794054,0.15586111,0.00056716515],"about_ca_topic_score_codex":0.00038429542,"about_ca_topic_score_gemma":0.0000015907598,"teacher_disagreement_score":0.8937903,"about_ca_system_score_codex":0.000003246154,"about_ca_system_score_gemma":0.00000377286,"threshold_uncertainty_score":0.999951},"labels":[],"label_agreement":null},{"id":"W2141990617","doi":"10.1145/2736277.2741080","title":"HypTrails","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sandia National Laboratories; Télécom Paris; Indiana University Bloomington; University of Illinois at Urbana-Champaign; Microsoft Research; University of Science and Technology of China; Julius-Maximilians-Universität Würzburg; Universität Leipzig; Peking University; Indian Institute of Technology Delhi; Università degli Studi di Torino; University of California, Santa Barbara; Korea Advanced Institute of Science and Technology; Tsinghua University; Technische Universität München; Sapienza Università di Roma; University of Pittsburgh; University of New South Wales; KU Leuven; Aalto-Yliopisto; University of Twente; Universiteit van Amsterdam; University of Southern California; Purdue University; University College London; Brigham Young University; University of Southampton; Università degli Studi di Milano; York University; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Capital Normal University; McGill University; Université de Fribourg; Centre National de la Recherche Scientifique; Dartmouth College; University of California, Davis; Vrije Universiteit Amsterdam; Stony Brook University; Johns Hopkins University; King Abdullah University of Science and Technology; Baidu; Microsoft Research Asia; Università di Pisa; Southern Methodist University; University of Ioannina; Carleton College; Aix-Marseille Université; Ohio State University; National University of Singapore; Universität Zürich; Carnegie Mellon University; Harvard University; University of Oxford","keywords":"Computer science; Prior probability; Inference; Leverage (statistics); Machine learning; Dirichlet distribution; Probabilistic logic; Artificial intelligence; Bayesian probability; Information retrieval; Mathematics","score_opus":0.03806580612928448,"score_gpt":0.3103169605021356,"score_spread":0.2722511543728511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141990617","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009122323,0.0000810849,0.09594819,0.000104889805,0.00014564698,0.00019937257,0.000024807954,0.00030112136,0.8940726],"genre_scores_gemma":[0.9833727,0.0000011647223,0.009851444,0.00003270348,0.0008300113,0.00005282482,0.00020120364,0.000020056308,0.005637922],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918514,0.00002833577,0.00019552921,0.0002875576,0.0001404596,0.0001629883],"domain_scores_gemma":[0.99913204,0.000014626338,0.00009826628,0.00056737097,0.000105421685,0.000082281644],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015536054,0.00018191832,0.00028719738,0.000060844122,0.000021906311,0.0000764174,0.00032689128,0.000062143,0.0034132847],"category_scores_gemma":[0.0000012223882,0.00016443977,0.00020697655,0.00006619869,0.000021616474,0.000020773025,0.0007320128,0.0003346496,0.00013210122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034989744,0.0001354798,0.01004288,0.000014305417,0.00045321163,0.0000014017837,0.00009282407,0.0009212259,0.000032827556,0.18963568,0.73272145,0.065945186],"study_design_scores_gemma":[0.000100576355,0.000009883622,0.00034484378,0.00003305549,0.00011354572,1.3344477e-7,0.000044126416,0.0062924516,0.0004916294,0.9107873,0.08133068,0.00045181936],"about_ca_topic_score_codex":0.0005426956,"about_ca_topic_score_gemma":0.0000061844885,"teacher_disagreement_score":0.9742504,"about_ca_system_score_codex":0.0000253366,"about_ca_system_score_gemma":0.00009730694,"threshold_uncertainty_score":0.99749774},"labels":[],"label_agreement":null},{"id":"W2142556848","doi":"10.1007/s10726-008-9147-5","title":"Enhancing National Security and Energy Security in the Post-911 Era: Group Decision Support for Strategic Policy Analysis under Conditions of Conflict","year":2009,"lang":"en","type":"article","venue":"Group Decision and Negotiation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Negotiation; Energy security; National security; Population; Environmental resource management; Business; Environmental economics; Economics; Political science; Engineering; Sociology; Law","score_opus":0.015624824619667976,"score_gpt":0.31296117916074834,"score_spread":0.29733635454108037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142556848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8001153,0.000093060786,0.19805716,0.00027931604,0.000021565307,0.00021169265,0.00011367362,0.000020025758,0.0010882224],"genre_scores_gemma":[0.9972597,0.000050948864,0.001434992,0.00039045766,0.0001277736,0.000026652337,0.0006970369,0.0000066856633,0.000005776656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984607,0.00010531245,0.0005421739,0.00033389183,0.00037005893,0.00018783167],"domain_scores_gemma":[0.99847424,0.00078991,0.00024507853,0.00019975191,0.00022812292,0.0000628726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000722361,0.00017119107,0.00033807836,0.0005728293,0.00019150517,0.00010205806,0.00013815024,0.00007596494,0.000095306146],"category_scores_gemma":[0.000034905053,0.00013980092,0.0001865401,0.0009411164,0.00004757069,0.00023650572,0.000036838683,0.0001197679,5.247222e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013833892,0.00041901856,0.006118451,0.000006732578,0.00018569919,5.913984e-7,0.0009950477,0.0003852491,0.0019278233,0.9676629,0.0003610823,0.021799108],"study_design_scores_gemma":[0.00086863217,0.00023872107,0.1316095,0.000025993462,0.00020307902,0.0000021466317,0.0007800285,0.03066089,0.00021228587,0.834801,0.0004026352,0.00019505915],"about_ca_topic_score_codex":0.00054143113,"about_ca_topic_score_gemma":0.0012973205,"teacher_disagreement_score":0.1971444,"about_ca_system_score_codex":0.000042269097,"about_ca_system_score_gemma":0.000050849678,"threshold_uncertainty_score":0.5700916},"labels":[],"label_agreement":null},{"id":"W2143698785","doi":"10.1609/icwsm.v3i1.13981","title":"Connecting Users with Similar Interests across Multiple Web Services","year":2009,"lang":"en","type":"article","venue":"Proceedings of the International AAAI Conference on Web and Social Media","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Popularity; World Wide Web; Web service; Normalization (sociology); User group; Service (business); Internet privacy; Information retrieval; Business","score_opus":0.02045708555029058,"score_gpt":0.2754993019003084,"score_spread":0.25504221635001784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143698785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907608,0.000005929079,0.000012328307,0.0025472625,0.000073255535,0.0000919704,0.000034299243,0.000035990157,0.006438137],"genre_scores_gemma":[0.99925894,0.000005645822,0.00021213529,0.00015765206,0.00030381524,0.0000070808396,0.000008513928,0.000007982002,0.00003824064],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991715,0.000005323024,0.00018685454,0.00019689943,0.00028102062,0.00015838898],"domain_scores_gemma":[0.9992712,0.0000816102,0.00024160945,0.000044465327,0.0003264283,0.000034699944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012996192,0.0001381441,0.00019040717,0.00004046283,0.00016667225,0.00013704775,0.00044696635,0.000035360506,0.00006338687],"category_scores_gemma":[0.000019420168,0.000098720666,0.00007533801,0.00009498585,0.0000703002,0.00015089649,0.00011068473,0.00017459922,0.000001279867],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056102884,0.0004791821,0.44245657,0.000069290356,0.00065354555,0.0000010787014,0.032583024,0.000013766192,0.06644497,0.35386872,0.0011794966,0.10168934],"study_design_scores_gemma":[0.010410362,0.0011021898,0.24315542,0.0038652495,0.0005564123,0.000014237353,0.14118631,0.18070458,0.10431822,0.2898796,0.021567488,0.003239953],"about_ca_topic_score_codex":0.00003132579,"about_ca_topic_score_gemma":0.00016282279,"teacher_disagreement_score":0.19930115,"about_ca_system_score_codex":0.00001944177,"about_ca_system_score_gemma":0.000024975712,"threshold_uncertainty_score":0.4025712},"labels":[],"label_agreement":null},{"id":"W2143834312","doi":"10.1239/aap/1282924060","title":"Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; University of Cambridge; National Science Foundation","keywords":"Mathematics; Exponent; Poisson distribution; Combinatorics; Random graph; Percolation theory; Vertex (graph theory); Exponential function; Exponential distribution; Dirichlet distribution; Limit (mathematics); Limiting; Discrete mathematics; Extreme value theory; Percolation (cognitive psychology); Random variable; Topology (electrical circuits); Mathematical analysis; Statistics; Boundary value problem","score_opus":0.007441630799005094,"score_gpt":0.24494024259808136,"score_spread":0.23749861179907628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143834312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47303063,0.0003983613,0.4835336,0.00038058407,0.00020794358,0.0023178163,0.000063635984,0.00026513732,0.03980228],"genre_scores_gemma":[0.99286187,0.000033115117,0.0063955337,0.000024694322,0.00019501291,0.00035388768,0.00010843962,0.000013551811,0.0000139212225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859655,0.00010662197,0.00035918772,0.00050279975,0.00014440196,0.00029043027],"domain_scores_gemma":[0.99866223,0.0005953258,0.0001366859,0.00050376385,0.000032543136,0.00006947344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010077121,0.0002202108,0.00031245442,0.000046517933,0.00021802977,0.000052199513,0.00018586231,0.00007297905,0.0001918622],"category_scores_gemma":[0.000031619827,0.00019893679,0.00007901367,0.00029183933,0.0001892498,0.00014349428,0.0000917119,0.0004736879,0.0000039306738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034150638,0.00024147813,0.065685906,0.000013689489,0.000017913853,2.4103298e-7,0.0000492785,0.0026778239,0.0001010456,0.81766707,0.00007809625,0.11312596],"study_design_scores_gemma":[0.0009036924,0.000042176296,0.023268862,0.00002048232,0.00003153591,2.8497865e-7,0.000028207389,0.012433043,0.00020208916,0.9484826,0.014299136,0.00028790082],"about_ca_topic_score_codex":0.000030462355,"about_ca_topic_score_gemma":0.00024782613,"teacher_disagreement_score":0.5198312,"about_ca_system_score_codex":0.00004760424,"about_ca_system_score_gemma":0.000014115157,"threshold_uncertainty_score":0.8112407},"labels":[],"label_agreement":null},{"id":"W2143940456","doi":"10.1145/2488388.2488439","title":"Organizational overlap on social networks and its applications","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Social network (sociolinguistics); Organizational network analysis; Connection (principal bundle); Data science; Face (sociological concept); Enhanced Data Rates for GSM Evolution; Social network analysis; World Wide Web; Knowledge management; Social media; Artificial intelligence; Organizational learning","score_opus":0.00960841445975208,"score_gpt":0.24284143748281328,"score_spread":0.2332330230230612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143940456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12212014,0.00007995164,0.60407776,0.001929916,0.000037181522,0.001192032,0.000013544277,0.00041570974,0.2701338],"genre_scores_gemma":[0.99788207,0.0000017002234,0.00038860866,0.00013630849,0.0004944285,0.00009793767,0.000048390666,0.000008644693,0.0009419222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996316,0.00000982035,0.00008583438,0.000120019555,0.000060415725,0.00009231885],"domain_scores_gemma":[0.99977154,0.00003403686,0.00003112495,0.00006638274,0.00006595702,0.00003096457],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000021559312,0.0000639318,0.0000720626,0.000022499316,0.0001389891,0.000046252873,0.00005984379,0.000018059856,0.003571817],"category_scores_gemma":[6.004914e-7,0.0000581081,0.00002546614,0.00015516077,0.000012410553,0.000046810448,0.00003848431,0.000055840766,0.0001063767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.939816e-7,0.000047508827,0.011302711,7.050051e-7,0.000031668726,1.2317322e-8,0.000010567871,0.00008436812,0.000086844695,0.95965993,0.01591751,0.012857703],"study_design_scores_gemma":[0.0009285627,0.00007655134,0.14005576,0.000017596756,0.00015674629,9.268529e-7,0.00036904207,0.30781826,0.0018351307,0.48405918,0.06337177,0.0013104822],"about_ca_topic_score_codex":0.000027388243,"about_ca_topic_score_gemma":0.0000010691609,"teacher_disagreement_score":0.8757619,"about_ca_system_score_codex":0.000006713285,"about_ca_system_score_gemma":0.000006493699,"threshold_uncertainty_score":0.99733907},"labels":[],"label_agreement":null},{"id":"W2144334863","doi":"10.1609/icwsm.v3i1.13984","title":"Characterization of FriendFeed — A Web-based Social Aggregation Service","year":2009,"lang":"en","type":"article","venue":"Proceedings of the International AAAI Conference on Web and Social Media","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Popularity; Aggregate (composite); World Wide Web; Web service; Service (business); Computer science; User-generated content; Business; Internet privacy; Social media; Marketing","score_opus":0.018629082772040367,"score_gpt":0.25105560758713424,"score_spread":0.23242652481509388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144334863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867743,0.0000013157497,0.00006803694,0.005856807,0.00007386419,0.00010150598,0.000049264643,0.00002097488,0.007053908],"genre_scores_gemma":[0.9992646,0.0000028611578,0.00007519563,0.00020497125,0.00036040458,0.000010293489,0.000043898926,0.0000051702445,0.000032627002],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992123,0.000007842189,0.00023569028,0.00013461051,0.00032025413,0.00008925959],"domain_scores_gemma":[0.9989528,0.000029194098,0.00038535937,0.000026405245,0.0005879274,0.000018282566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118995275,0.000100854006,0.00017717664,0.000076589764,0.00009716238,0.00004316023,0.00026388967,0.000043394448,0.00010891021],"category_scores_gemma":[0.000016238055,0.00008506259,0.000084305044,0.0001717259,0.000058840833,0.000111077774,0.000039442974,0.00010208878,9.012004e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010862642,0.00019346729,0.0094041815,0.000020308587,0.00007397915,3.5226282e-8,0.0024888995,4.6160702e-7,0.54774874,0.3936207,0.00028534542,0.046055242],"study_design_scores_gemma":[0.0037872992,0.00022724264,0.30348945,0.0007831613,0.00031810257,6.246928e-7,0.0028761935,0.055687055,0.42688358,0.20161875,0.003426233,0.0009023249],"about_ca_topic_score_codex":0.000011127718,"about_ca_topic_score_gemma":0.0000063433886,"teacher_disagreement_score":0.29408526,"about_ca_system_score_codex":0.000018946497,"about_ca_system_score_gemma":0.00006301809,"threshold_uncertainty_score":0.34687516},"labels":[],"label_agreement":null},{"id":"W2144782648","doi":"10.1162/neco_a_00603","title":"Intrinsic Graph Structure Estimation Using Graph Laplacian","year":2014,"lang":"en","type":"letter","venue":"Neural Computation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Research Institute for Sustainable Humanosphere, Kyoto University","keywords":"Mixed graph; Mathematics; Laplacian matrix; Spurious relationship; Graph; Line graph; Null graph; Covariance matrix; Algorithm; Strength of a graph; Voltage graph; Theoretical computer science; Computer science; Discrete mathematics","score_opus":0.019271071563809694,"score_gpt":0.27705194655769244,"score_spread":0.25778087499388275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144782648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088412374,0.000043737593,0.8770858,0.03189131,0.0007024935,0.00075111137,0.000077532,0.0004872738,0.0005483534],"genre_scores_gemma":[0.9424814,3.8865605e-7,0.011467519,0.037907686,0.003857235,0.00001084965,0.0041802446,0.00007097398,0.000023719382],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982048,0.00020984933,0.00043491324,0.00048203662,0.00035063116,0.0003177273],"domain_scores_gemma":[0.99887884,0.000105042025,0.000507995,0.00029562687,0.00017127485,0.000041241437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007266736,0.00040198633,0.00046195718,0.0004214155,0.0002078181,0.00019712381,0.00023535657,0.0002467145,0.000110483896],"category_scores_gemma":[0.0000036963968,0.0004097569,0.00027752618,0.0005009868,0.000055068238,0.00016758764,0.000062414605,0.0010913084,0.000008232928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013204514,0.000024122848,0.0021582465,0.00011623563,0.00026721304,0.000017411523,0.00009765053,0.1542089,0.00017721897,0.00061926956,0.6975978,0.14470273],"study_design_scores_gemma":[0.0003046731,0.00006111512,0.00046452734,0.00009338692,0.00034541552,0.000010210935,0.000006008456,0.851706,0.00015731713,0.13018514,0.015939761,0.0007264411],"about_ca_topic_score_codex":0.00021689657,"about_ca_topic_score_gemma":0.0000069444213,"teacher_disagreement_score":0.8656183,"about_ca_system_score_codex":0.000051078285,"about_ca_system_score_gemma":0.000026780272,"threshold_uncertainty_score":0.99983543},"labels":[],"label_agreement":null},{"id":"W2145341005","doi":"10.1145/1529282.1529618","title":"Link-based event detection in email communication networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Event (particle physics); Linkage (software); Telecommunications network; Link (geometry); Data mining; Computer network","score_opus":0.007590372606813354,"score_gpt":0.2618902290751431,"score_spread":0.25429985646832975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145341005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045634966,0.00005997052,0.94322675,0.00051743473,0.000012348162,0.00014454882,2.6279767e-7,0.00010642743,0.010297262],"genre_scores_gemma":[0.9972808,0.0000034449831,0.0023417575,0.0001362439,0.00009921319,0.000017550401,0.000029782857,0.0000051185602,0.000086133834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994161,0.000068465626,0.00019999994,0.00011837083,0.00006537712,0.00013167452],"domain_scores_gemma":[0.99949795,0.000036584606,0.00006303475,0.00034755422,0.0000288835,0.000025972491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018204004,0.00008020552,0.00011404412,0.00007428362,0.000057640806,0.000026388587,0.00013490397,0.000028981818,0.0002354472],"category_scores_gemma":[0.0000011936602,0.00007867245,0.000077159035,0.0002843405,0.000010397428,0.000054091015,0.000017654198,0.00015118149,0.0000070193096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013406516,0.0001684007,0.01706842,7.4061984e-7,0.000013098472,2.0970677e-7,0.000024395027,0.066650644,0.00020917541,0.0076546986,0.0006375792,0.9075592],"study_design_scores_gemma":[0.0002907675,0.000053293134,0.0383359,0.000026147802,0.000015541238,7.5933954e-8,0.000023504504,0.9377858,0.0031503711,0.018230159,0.0019239817,0.00016447573],"about_ca_topic_score_codex":0.00036616562,"about_ca_topic_score_gemma":0.0003008049,"teacher_disagreement_score":0.9516458,"about_ca_system_score_codex":0.00003451359,"about_ca_system_score_gemma":0.000009110232,"threshold_uncertainty_score":0.32081693},"labels":[],"label_agreement":null},{"id":"W2145651273","doi":"10.1007/978-3-540-87781-3_2","title":"A Unifying Framework for Building Social Computing Applications","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Novelty; Social computing; Reputation; Data science; Social network (sociolinguistics); Focus (optics); Selection (genetic algorithm); Knowledge management; World Wide Web; Artificial intelligence; Social media","score_opus":0.02443119515785624,"score_gpt":0.3071611910079315,"score_spread":0.28272999585007524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145651273","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000066805806,0.00012271616,0.99706566,0.00014707592,0.00013986713,0.00059276726,0.000011785358,0.000119985874,0.001733306],"genre_scores_gemma":[0.3558411,0.0000034303798,0.6413931,0.00015356795,0.0024879356,0.000033159497,0.000018171337,0.000035094734,0.00003440496],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979445,0.000012742456,0.00040273383,0.0008305529,0.00033584607,0.0004736377],"domain_scores_gemma":[0.99834096,0.00063720206,0.00032460288,0.00045445387,0.00017634178,0.00006644657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003111856,0.00034881357,0.00047440003,0.00037372488,0.00080678915,0.00017743254,0.00094657583,0.0001652562,0.000027204893],"category_scores_gemma":[0.000009070067,0.00037043853,0.0002539729,0.0004291368,0.00040197303,0.00008561478,0.00044282913,0.00066465716,0.0000039563424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021756935,0.00001864816,0.00015433875,0.000016473561,0.000029875018,0.0000010635715,0.00036301184,0.009791274,0.000028447492,0.2061407,0.000054282333,0.7833997],"study_design_scores_gemma":[0.000102816884,0.000024031564,0.000031737105,0.00022903201,0.000029909543,0.0000025911438,4.7546962e-7,0.17647411,0.00027930355,0.81263787,0.009676745,0.00051138015],"about_ca_topic_score_codex":0.00001961088,"about_ca_topic_score_gemma":0.000004694972,"teacher_disagreement_score":0.78288835,"about_ca_system_score_codex":0.00014330636,"about_ca_system_score_gemma":0.00017836454,"threshold_uncertainty_score":0.9998748},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.11612452728765789,"score_gpt":0.5037805052009522,"score_spread":0.3876559779132943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146653491","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001895108,0.9326349,0.06475325,0.0014460413,0.00010565145,0.0005567305,0.00009145708,0.000008582604,0.00021388741],"genre_scores_gemma":[0.018485423,0.9547115,0.024124961,0.0007267186,0.001572294,0.000040134848,0.00028450947,0.000045646415,0.000008786934],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9880309,0.007052043,0.004144667,0.00015721736,0.00014218397,0.0004729736],"domain_scores_gemma":[0.96423936,0.023004968,0.011537317,0.0008354514,0.00028326304,0.00009961484],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.016345507,0.00033110665,0.006415553,0.00020833952,0.0005757453,0.0000060997186,0.0013295707,0.0002337428,0.000044743843],"category_scores_gemma":[0.0007054621,0.00021639378,0.0040812963,0.0010377485,0.00024928365,0.00004478579,0.00026659569,0.0033555056,2.033582e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003202104,0.00027176118,0.007308032,0.005251276,0.008676384,2.537699e-7,0.00041715964,0.0007823597,5.014981e-8,0.014384113,0.008231957,0.9546446],"study_design_scores_gemma":[0.0007499005,0.0021412792,0.0016667284,0.033540845,0.01908557,0.000016865108,0.00060855836,0.00039876153,9.1039783e-7,0.21251944,0.72861177,0.0006594042],"about_ca_topic_score_codex":0.0040626023,"about_ca_topic_score_gemma":0.00037289513,"teacher_disagreement_score":0.9539852,"about_ca_system_score_codex":0.00017403257,"about_ca_system_score_gemma":0.0009091597,"threshold_uncertainty_score":0.9989438},"labels":[],"label_agreement":null},{"id":"W2146978024","doi":"10.1214/ejp.v20-3749","title":"Fixed speed competition on the configuration model with infinite variance degrees: unequal speeds","year":2015,"lang":"en","type":"article","venue":"Electronic Journal of Probability","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of British Columbia; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Exponent; Combinatorics; Power law; Graph; Distribution (mathematics); Competition (biology); Mathematical analysis; Statistics","score_opus":0.03918833485536344,"score_gpt":0.26259196994628714,"score_spread":0.2234036350909237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146978024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50731826,0.000034527227,0.48524326,0.0011702274,0.000025529345,0.00028740516,0.000003748609,0.00002208667,0.005894981],"genre_scores_gemma":[0.99696416,0.0000025891286,0.0026432448,0.00005659313,0.00022347058,0.0000053773006,0.000009573878,0.000011065428,0.00008392525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844635,0.0002425454,0.00043832036,0.00016111835,0.00038954095,0.0003221563],"domain_scores_gemma":[0.99848133,0.00013325534,0.0004975548,0.0003097781,0.00049784366,0.000080228216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015898611,0.00016172157,0.00027161578,0.00005894311,0.00009020817,0.000058624133,0.0002676969,0.000031155385,0.00010755506],"category_scores_gemma":[0.000035609217,0.0001005955,0.00012275098,0.00027717615,0.00009103332,0.00018777618,0.000021496231,0.0005680138,0.000007193596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004117631,0.00031191393,0.0047576427,0.0000046393534,0.00019435103,6.706188e-7,0.0002633604,0.087085925,0.0006163652,0.9042515,0.0004369943,0.0016648413],"study_design_scores_gemma":[0.001292902,0.0017252156,0.0011333391,0.00009175123,0.00016768163,0.000009005914,0.00026343061,0.11012541,0.0042192717,0.8793177,0.0013525363,0.00030173024],"about_ca_topic_score_codex":0.00005689983,"about_ca_topic_score_gemma":0.0000630564,"teacher_disagreement_score":0.48964593,"about_ca_system_score_codex":0.00032214477,"about_ca_system_score_gemma":0.000707024,"threshold_uncertainty_score":0.41021654},"labels":[],"label_agreement":null},{"id":"W2147010252","doi":"10.1145/2396761.2398630","title":"On compressing weighted time-evolving graphs","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Australian Research Council","keywords":"Computer science; Snapshot (computer storage); Bounded function; Lossy compression; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.010030744536284915,"score_gpt":0.2539365410155592,"score_spread":0.24390579647927427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147010252","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44638124,0.00007016354,0.035470653,0.00005159616,0.000062047286,0.000112707436,0.0000033792396,0.0003044201,0.5175438],"genre_scores_gemma":[0.993256,2.4724972e-7,0.0047308668,0.000053580527,0.00020172943,0.0000074476698,0.000028116636,0.000013632746,0.001708429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993394,0.00003561417,0.0001292725,0.000118480355,0.00011000201,0.00026723978],"domain_scores_gemma":[0.9995364,0.00007985273,0.000052063024,0.00022786054,0.00002621111,0.00007764342],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010171166,0.000112353475,0.00014451663,0.000076253535,0.00011585597,0.00004432036,0.000111598,0.000017127004,0.008484021],"category_scores_gemma":[9.694098e-7,0.00009406317,0.000110264904,0.00017162343,0.000020655387,0.00014425216,0.00005261388,0.00009568261,0.0003991603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072378825,0.00038518046,0.09877262,0.0000022914346,0.00018312951,2.838386e-7,0.00011390641,0.00001625824,0.006005924,0.73191285,0.13296308,0.02963722],"study_design_scores_gemma":[0.0019015028,0.00022954537,0.043754376,0.00036029582,0.00057948235,0.0000030249275,0.0003076769,0.16719854,0.13488601,0.5384373,0.1089983,0.0033439691],"about_ca_topic_score_codex":0.00004175977,"about_ca_topic_score_gemma":4.163406e-7,"teacher_disagreement_score":0.5468747,"about_ca_system_score_codex":0.000011085225,"about_ca_system_score_gemma":0.000004351907,"threshold_uncertainty_score":0.99242234},"labels":[],"label_agreement":null},{"id":"W2148499054","doi":"10.1016/j.jtbi.2004.03.026","title":"Netscan: a procedure for generating reaction networks by size","year":2004,"lang":"en","type":"article","venue":"Journal of Theoretical Biology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; File Transfer Protocol; Constraint (computer-aided design); Software; Theoretical computer science; Algorithm; Mathematics; Programming language; The Internet; World Wide Web","score_opus":0.005428676607105416,"score_gpt":0.2689913828549424,"score_spread":0.26356270624783695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148499054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18655564,0.00028246548,0.81019235,0.0017421935,0.00016700315,0.00016704471,0.000008722061,0.000019608593,0.000864982],"genre_scores_gemma":[0.9861935,0.000008379312,0.01227316,0.00018010597,0.001298179,0.000009737711,0.000012220628,0.000010946924,0.0000137773395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991832,0.000056626206,0.00038005915,0.00011724635,0.000052173396,0.0002107174],"domain_scores_gemma":[0.9991626,0.00024660546,0.00029419316,0.00009289539,0.00013028018,0.0000734332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035573283,0.00010627185,0.0002753759,0.000023610348,0.00007084112,0.000020520809,0.00015223058,0.000074630785,0.00012527844],"category_scores_gemma":[0.00005648263,0.00007819858,0.00021388697,0.00008826425,0.0001412196,0.000041541498,0.00002683252,0.0002254912,8.077428e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010512766,0.0001427431,0.0014049659,0.0000030912202,0.00018657235,6.196402e-7,0.00002286231,0.0010218566,0.028448366,0.95058215,0.0041352035,0.013946443],"study_design_scores_gemma":[0.001005915,0.00080065185,0.0001076655,0.000043704913,0.00019667759,0.000025166159,0.000056586203,0.008209511,0.007314641,0.9770103,0.0050215567,0.00020762351],"about_ca_topic_score_codex":0.000005265068,"about_ca_topic_score_gemma":7.141168e-7,"teacher_disagreement_score":0.79963785,"about_ca_system_score_codex":0.000030359693,"about_ca_system_score_gemma":0.000045815155,"threshold_uncertainty_score":0.31888455},"labels":[],"label_agreement":null},{"id":"W2149340196","doi":"10.1109/cse.2009.245","title":"Guanxi in the Chinese Web","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Guanxi; World Wide Web; Computer science; Web site; Web application; The Internet; Information retrieval; China; Political science; Law","score_opus":0.005596047846521418,"score_gpt":0.27355513317920305,"score_spread":0.26795908533268165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149340196","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5556682,0.000019204032,0.0030861262,0.0015056735,0.000007920034,0.00008694575,6.569551e-7,0.000047184916,0.43957812],"genre_scores_gemma":[0.9985534,7.6538834e-7,0.00053076475,0.00040643403,0.00014826136,0.0000053931326,0.000005199549,0.0000019227946,0.00034784444],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996455,0.000025159463,0.00008946756,0.00007816443,0.0000643497,0.000097380405],"domain_scores_gemma":[0.9997432,0.000024842104,0.00001676332,0.0001970939,0.0000076597935,0.000010433487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114416485,0.00005742207,0.00007449789,0.000031205967,0.00002643432,0.000026111627,0.00017443276,0.0000071871195,0.00070516433],"category_scores_gemma":[8.8178405e-7,0.000031549458,0.00005753894,0.00029447753,0.0000068902186,0.000034719676,0.000011878525,0.00007039694,0.000022984987],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005070813,0.000336729,0.40861368,6.1276967e-7,0.000022090902,0.0000024458002,0.0003862866,0.00007954736,0.0006716228,0.38360983,0.04608357,0.16018853],"study_design_scores_gemma":[0.00039867306,0.00006818899,0.46624523,0.0000087786175,0.00001955626,8.8737977e-7,0.0002936446,0.01594382,0.0002001729,0.4778077,0.038711205,0.0003021469],"about_ca_topic_score_codex":0.000085631065,"about_ca_topic_score_gemma":0.00003922006,"teacher_disagreement_score":0.44288525,"about_ca_system_score_codex":0.0000035480857,"about_ca_system_score_gemma":0.000005854415,"threshold_uncertainty_score":0.7721055},"labels":[],"label_agreement":null},{"id":"W2149666388","doi":"10.1016/j.physa.2015.10.026","title":"A novel information cascade model in online social networks","year":2015,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Science Foundation of China University of Petroleum, Beijing; National Natural Science Foundation of China","keywords":"Computer science; Popularity; Cascade; Information cascade; Social network (sociolinguistics); Node (physics); Data mining; Similarity (geometry); Scope (computer science); Theoretical computer science; Data science; Artificial intelligence; Social media; World Wide Web; Mathematics","score_opus":0.03067536286540617,"score_gpt":0.3021095679357764,"score_spread":0.27143420507037025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149666388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012174699,0.000012529695,0.9970543,0.0002741721,0.000006912673,0.00033299712,0.0004605251,0.00004106669,0.0006000329],"genre_scores_gemma":[0.9770157,0.000004896461,0.02184412,0.00009583585,0.00017238551,0.00030147543,0.0005438191,0.000011248222,0.0000105588915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917614,0.000014915888,0.00028375364,0.00017715376,0.00014064815,0.0002073792],"domain_scores_gemma":[0.99948335,0.000063432664,0.000095948264,0.00012275834,0.000116101444,0.0001183841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000983784,0.00013043862,0.00020191578,0.000057470206,0.00009752044,0.000050890532,0.000117257536,0.000036153455,0.000011270283],"category_scores_gemma":[0.000007739573,0.00013288092,0.00003369698,0.00029863542,0.000013826201,0.00017593187,0.000095023424,0.0001828787,0.000007746544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054699553,0.00020466153,0.0000066551615,0.0000036957276,0.000014238612,3.7955058e-8,0.00012792212,0.0032761216,0.0001035237,0.97752625,0.00072164775,0.018009773],"study_design_scores_gemma":[0.0002201218,0.000012526975,0.00005155285,0.0000032998444,0.000025349953,1.8615495e-7,0.00009376567,0.76457196,0.000012692729,0.23359479,0.0013008056,0.00011292383],"about_ca_topic_score_codex":0.00007645452,"about_ca_topic_score_gemma":0.000017575392,"teacher_disagreement_score":0.9757982,"about_ca_system_score_codex":0.000031731553,"about_ca_system_score_gemma":0.000046115838,"threshold_uncertainty_score":0.5418726},"labels":[],"label_agreement":null},{"id":"W2149800717","doi":"10.1145/3131782","title":"A Survey of Link Recommendation for Social Networks","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Management Information Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Link (geometry); Recommender system; Computer science; Perspective (graphical); Link analysis; Diversity (politics); Data science; Social network (sociolinguistics); Information retrieval; World Wide Web; Social media; Artificial intelligence; Sociology","score_opus":0.05196653141541468,"score_gpt":0.3182047074027288,"score_spread":0.26623817598731414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149800717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004318458,0.0000018495273,0.98864913,0.00021523617,0.0002519741,0.0007018387,0.00013159175,0.000046709643,0.009569801],"genre_scores_gemma":[0.99766725,0.000005818436,0.0011326107,0.000021806844,0.00009577981,0.00028351665,0.00055161276,0.000007802763,0.00023381534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991078,0.000051158753,0.00048644864,0.00009474221,0.00012426652,0.00013559304],"domain_scores_gemma":[0.9986189,0.00008043727,0.00058237836,0.0005040192,0.00019156959,0.00002269295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006395475,0.00010915073,0.0001946271,0.00015740591,0.0006168709,0.00023262057,0.0003779632,0.000037482343,0.00007310992],"category_scores_gemma":[0.000004943834,0.000113096285,0.00011958658,0.00011159229,0.000023248342,0.00069926115,0.000014759866,0.0000744802,0.000012388266],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060948256,0.00006422648,0.002170256,0.000092942384,0.00046565305,1.8199007e-8,0.00016020512,0.014656352,6.2325523e-7,0.012139624,0.0037005714,0.9664886],"study_design_scores_gemma":[0.0034678318,0.0002342777,0.10905176,0.00021614732,0.00052670954,2.800168e-7,0.0016304161,0.67478687,0.00014056734,0.0026065079,0.20644684,0.00089179806],"about_ca_topic_score_codex":0.0005908811,"about_ca_topic_score_gemma":0.000022037933,"teacher_disagreement_score":0.9972354,"about_ca_system_score_codex":0.000029738409,"about_ca_system_score_gemma":0.000006988655,"threshold_uncertainty_score":0.47445345},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015630568737843797,"score_gpt":0.2893821742104498,"score_spread":0.273751605472606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149910108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9968274,0.000039436778,0.00011479781,0.0009889714,0.000005958777,0.00012400582,0.00000727591,0.000014709814,0.0018774],"genre_scores_gemma":[0.997672,0.0000029118892,0.002099472,0.0001416116,0.00006746042,0.000005138786,0.0000012044294,0.000002596799,0.000007605548],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987311,0.000008265839,0.00034065222,0.00022248965,0.00055358926,0.00014393548],"domain_scores_gemma":[0.99926126,0.000124342,0.00043945204,0.000010609578,0.00014106155,0.000023276432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048092104,0.000096430136,0.00018224321,0.0001395146,0.00013793872,0.000038129514,0.0006675404,0.000043475742,0.000010715243],"category_scores_gemma":[0.00006925027,0.00007109378,0.000089932335,0.000780897,0.0002433333,0.000257221,0.00008053588,0.00019788322,2.0500323e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027491595,0.00019442238,0.79620034,0.00000852742,0.000018309669,1.1421767e-8,0.0001844388,0.038240317,0.09924994,0.0594105,0.00019119645,0.0062745176],"study_design_scores_gemma":[0.00015481765,0.000020504527,0.57743376,0.00018780104,0.000010194595,7.711304e-8,0.00003976095,0.25928384,0.0045892578,0.15818256,0.000016471678,0.000080950864],"about_ca_topic_score_codex":0.00011144817,"about_ca_topic_score_gemma":6.96058e-7,"teacher_disagreement_score":0.22104354,"about_ca_system_score_codex":0.00003834741,"about_ca_system_score_gemma":0.000016906519,"threshold_uncertainty_score":0.28991202},"labels":[],"label_agreement":null},{"id":"W2150160673","doi":"10.1109/cnsr.2011.17","title":"VisVerND: Visual Verification of Network Traffic Dataset","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Completeness (order theory); Data mining; Visualization; Protocol (science); Process (computing); Quality (philosophy); Artificial intelligence","score_opus":0.026349816775126163,"score_gpt":0.275934293230243,"score_spread":0.24958447645511683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150160673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7081201,0.00006463829,0.21246481,0.000027902272,0.00011915252,0.00042169212,0.00030528262,0.00025615946,0.07822022],"genre_scores_gemma":[0.9932226,0.0000013962634,0.0055833287,0.000015015795,0.00014744585,0.000009511671,0.00093189086,0.000007720864,0.000081093014],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942046,0.00002701205,0.00020102014,0.00014234544,0.00007963621,0.00012953351],"domain_scores_gemma":[0.9995513,0.000016560132,0.000099376295,0.00027300758,0.000027189257,0.000032557775],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011165156,0.00007797085,0.00013694668,0.000028565055,0.000033890683,0.000007220821,0.00015639102,0.000016167569,0.0034948676],"category_scores_gemma":[6.2276587e-7,0.000071548726,0.00006133408,0.00017296911,0.000030211959,0.00007014809,0.000043049316,0.00004765336,0.000036786674],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010498132,0.0013406563,0.075582296,0.00001769714,0.00056718907,0.0000011280952,0.00054934976,0.0013162118,0.0012284154,0.23011623,0.43083763,0.2583382],"study_design_scores_gemma":[0.002755981,0.0013033614,0.1940259,0.00016942255,0.001394819,0.0000027189753,0.0015529772,0.26301968,0.085880205,0.07228452,0.3743001,0.0033103079],"about_ca_topic_score_codex":0.00023354057,"about_ca_topic_score_gemma":0.000012869621,"teacher_disagreement_score":0.28510246,"about_ca_system_score_codex":0.000004798773,"about_ca_system_score_gemma":0.000011458808,"threshold_uncertainty_score":0.9974161},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005424297446348432,"score_gpt":0.24680482870482875,"score_spread":0.24138053125848033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150443611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9782496,0.000045498113,0.017611872,0.00012687319,0.000071505216,0.00015080548,0.0000046597333,0.00006118802,0.0036780038],"genre_scores_gemma":[0.972601,0.0000036660927,0.026704298,0.00006893831,0.0003877791,0.000007798892,0.0000046842897,0.0000058918718,0.00021596983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990486,0.000014394639,0.00014686887,0.0002812127,0.00023337727,0.00027553114],"domain_scores_gemma":[0.9994942,0.000015483995,0.00008848313,0.00022765121,0.00009971851,0.000074487114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029111668,0.00010676943,0.00012313659,0.000062205276,0.00037236558,0.00015938765,0.00024507893,0.000019005392,0.0000789872],"category_scores_gemma":[0.0000040685686,0.00009391908,0.000019216886,0.0008223345,0.00011001218,0.00050406187,0.000107181404,0.00008736857,0.000005809769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001985675,0.00009310985,0.093592755,0.000013367384,0.00003476966,4.383981e-7,0.0007455144,0.014789239,0.17079099,0.050973315,0.008793696,0.660153],"study_design_scores_gemma":[0.0004290106,0.00023147045,0.034178745,0.000065398795,0.000059925595,0.0000060612124,0.0002046457,0.71290904,0.18813264,0.034787823,0.028264852,0.00073037605],"about_ca_topic_score_codex":0.000009587299,"about_ca_topic_score_gemma":0.000034593173,"teacher_disagreement_score":0.6981198,"about_ca_system_score_codex":0.000045874687,"about_ca_system_score_gemma":0.00008764787,"threshold_uncertainty_score":0.3829909},"labels":[],"label_agreement":null},{"id":"W2150860159","doi":"10.1016/j.dam.2012.03.030","title":"Improving heuristics for network modularity maximization using an exact algorithm","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristics; Merge (version control); Maximization; Algorithm; Heuristic; Merge algorithm; Partition (number theory); Mathematics; Modularity (biology); Computer science; Mathematical optimization; Parallel computing","score_opus":0.027694047983033043,"score_gpt":0.2873221680629435,"score_spread":0.25962812007991043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150860159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011239512,0.000023987088,0.9865682,0.0000037008658,0.000065548345,0.0005886673,0.000041400705,0.00012658414,0.0013423581],"genre_scores_gemma":[0.4278713,5.812197e-7,0.5709118,0.0000127646845,0.00088666764,0.000062436746,0.00019662965,0.000044472512,0.000013304807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986492,0.000017876724,0.00040325616,0.00022908639,0.00017701552,0.00052359473],"domain_scores_gemma":[0.9989149,0.00008852112,0.00031489268,0.00047646635,0.00006922609,0.00013598953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044102865,0.00024420393,0.00035430686,0.00004506943,0.00026071348,0.00009573921,0.00020259232,0.00006363178,0.00006289042],"category_scores_gemma":[0.0000064473447,0.00023990055,0.00012968764,0.0001926392,0.00003602674,0.00018613735,0.000105791,0.00012429093,0.0000037675024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019752651,0.0010869513,0.0022244367,0.00026555956,0.00039072716,3.2912214e-7,0.0013854047,0.020937394,0.004088557,0.8232562,0.00076475774,0.14557995],"study_design_scores_gemma":[0.00018706289,0.000014874738,0.00003724742,0.000016123344,0.00023931857,5.84579e-7,0.00024112425,0.88417494,0.0011564546,0.113333516,0.00028462394,0.00031411968],"about_ca_topic_score_codex":0.000030632567,"about_ca_topic_score_gemma":0.0000010725707,"teacher_disagreement_score":0.86323756,"about_ca_system_score_codex":0.00004129496,"about_ca_system_score_gemma":0.00002031702,"threshold_uncertainty_score":0.978286},"labels":[],"label_agreement":null},{"id":"W2151469863","doi":"10.1016/j.aam.2012.09.001","title":"Geometric graph properties of the spatial preferred attachment model","year":2012,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Dalhousie University","funders":"","keywords":"Distance; Metric space; Metric (unit); Mathematics; Combinatorics; Resistance distance; Spatial network; Metric dimension; Intrinsic metric; Preferential attachment; Neighbourhood (mathematics); Graph; Discrete mathematics; Injective metric space; Line graph; Complex network; Graph power; Pathwidth; Mathematical analysis","score_opus":0.03217433644861553,"score_gpt":0.2847754627619362,"score_spread":0.25260112631332066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151469863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07423098,0.0025610058,0.8879593,0.000022474522,0.00019694588,0.002041978,0.00004815933,0.000090347894,0.03284883],"genre_scores_gemma":[0.94922817,0.0000802333,0.04995691,0.0000064854917,0.00011270924,0.0005084075,0.000016754002,0.00003494665,0.000055363467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982679,0.000020521937,0.0007202755,0.00029734976,0.00039233168,0.00030161245],"domain_scores_gemma":[0.9981575,0.00006474968,0.00073247735,0.000962264,0.00004614285,0.00003686375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027009347,0.00033318487,0.0006482649,0.00020838958,0.00005110847,0.000023546416,0.00075883354,0.00009302775,0.000030168429],"category_scores_gemma":[0.000006965925,0.00023114998,0.0002380385,0.00042041438,0.00012422052,0.00005209761,0.0011046903,0.0004682368,0.0000030153515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050831146,0.0032163258,0.019566562,0.004194871,0.0005228379,1.8567452e-7,0.003975129,0.47119284,0.0019658913,0.3956164,0.00030451184,0.0993936],"study_design_scores_gemma":[0.00033050214,0.000009093826,0.00020966982,0.0007470923,0.00030884586,1.8814349e-7,0.0002523213,0.100309595,0.025921773,0.87092394,0.00035033395,0.00063664315],"about_ca_topic_score_codex":0.000037972815,"about_ca_topic_score_gemma":0.000017299826,"teacher_disagreement_score":0.8749972,"about_ca_system_score_codex":0.00005796328,"about_ca_system_score_gemma":0.00005412006,"threshold_uncertainty_score":0.9426023},"labels":[],"label_agreement":null},{"id":"W2152980153","doi":"10.1145/2594440","title":"Understanding Video Sharing Propagation in Social Networks","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Probabilistic logic; Process (computing); Data science; Resource (disambiguation); Server; Service (business); World Wide Web; Multimedia; Artificial intelligence; Computer network","score_opus":0.06324397275784471,"score_gpt":0.31190178160783155,"score_spread":0.24865780884998684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152980153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021432692,0.000025087695,0.9939424,0.00090306293,0.000016678037,0.0004608337,0.0000057693683,0.00015169955,0.0023512035],"genre_scores_gemma":[0.96423036,0.000029357378,0.03510824,0.000051969982,0.00016062151,0.00028980768,0.00008100195,0.000022641798,0.0000260257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881387,0.00011301411,0.00039333894,0.00033771934,0.000107431275,0.00023462954],"domain_scores_gemma":[0.99796146,0.0006361264,0.00014712213,0.0011371006,0.00005384523,0.000064346146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003932339,0.00016811032,0.0002098962,0.00023084051,0.0012005775,0.00010118848,0.000716541,0.000058721485,0.00003031494],"category_scores_gemma":[0.0000048816587,0.00019018896,0.00008219644,0.00067702465,0.00015576181,0.000101877886,0.000089161964,0.00044151017,0.000007249629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007819855,0.00056585175,0.0111807315,0.000012398095,0.00008746665,5.089211e-8,0.00075491046,0.014301795,0.00018758529,0.13878515,0.000076567405,0.8340397],"study_design_scores_gemma":[0.00034883793,0.000016366268,0.0017925005,0.000040189298,0.0000438455,4.848933e-7,0.00030532072,0.965327,0.00003986386,0.029776342,0.0020931216,0.00021612558],"about_ca_topic_score_codex":0.00012600711,"about_ca_topic_score_gemma":0.00007368703,"teacher_disagreement_score":0.9620871,"about_ca_system_score_codex":0.00008831394,"about_ca_system_score_gemma":0.000015116525,"threshold_uncertainty_score":0.9233992},"labels":[],"label_agreement":null},{"id":"W2153120494","doi":"10.1093/comnet/cnu010","title":"Network robustness versus multi-strategy sequential attack","year":2014,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); Betweenness centrality; Computer science; Greedy algorithm; Centrality; Pairwise comparison; Artificial intelligence; Mathematics; Algorithm; Statistics","score_opus":0.07814062192789892,"score_gpt":0.32945073441080697,"score_spread":0.251310112482908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153120494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025323842,0.00024952902,0.96772784,0.00011184678,0.0009727933,0.00013563652,0.0000025296188,0.000059419337,0.0054165367],"genre_scores_gemma":[0.97219586,0.00001228438,0.018554468,0.000081638915,0.008915349,0.0000052742425,0.00003151784,0.00004889771,0.00015468853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973033,0.00034864535,0.0010347728,0.0002629757,0.00039660046,0.00065370405],"domain_scores_gemma":[0.9975296,0.00032262938,0.0010477174,0.00044368618,0.00040289052,0.00025343345],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00093074795,0.00035116132,0.0007892142,0.00012275112,0.00024478242,0.00017996704,0.00070054847,0.000103985214,0.0010673634],"category_scores_gemma":[0.000011145389,0.00031966384,0.0005463835,0.00049228914,0.000120714714,0.0002422768,0.00015501892,0.0007156435,0.000010992059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019130157,0.00011860964,0.0048688017,0.0000035727926,0.0003193596,0.0000055053865,0.000012682358,0.9188513,0.000020438873,0.004388168,0.051501997,0.019718265],"study_design_scores_gemma":[0.0023978201,0.0003397639,0.004175202,0.00007722705,0.0002805485,0.000014740154,0.000040354997,0.9530562,0.000014127846,0.0016872069,0.037496917,0.00041986536],"about_ca_topic_score_codex":0.000027228843,"about_ca_topic_score_gemma":0.000027287513,"teacher_disagreement_score":0.9491734,"about_ca_system_score_codex":0.00006087159,"about_ca_system_score_gemma":0.00006833092,"threshold_uncertainty_score":0.99992555},"labels":[],"label_agreement":null},{"id":"W2153252787","doi":"10.7202/021290ar","title":"National Airline Networks : A Graph Theoretic Analysis","year":2005,"lang":"en","type":"article","venue":"Cahiers de géographie du Québec","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Degree distribution; Graph; Path analysis (statistics); Computer science; Regression analysis; Population; Econometrics; Network analysis; Complex network; Regression; Mathematics; Statistics; Theoretical computer science; Engineering; Sociology; Demography","score_opus":0.0039864732604057715,"score_gpt":0.21530799590767435,"score_spread":0.21132152264726858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153252787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29955724,0.0006347999,0.6691318,0.0020131276,0.000048575417,0.0002514604,0.000019807097,0.0003762046,0.027966933],"genre_scores_gemma":[0.9952762,0.00003563094,0.0024422435,0.0005312642,0.00085493096,0.00007931087,0.00012258903,0.000029775529,0.00062806753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834716,0.0001246377,0.0003876681,0.00039587464,0.0002910722,0.000453568],"domain_scores_gemma":[0.9988325,0.0002146488,0.00017539649,0.0003908977,0.00019674438,0.0001898077],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005270531,0.0002685912,0.00039143147,0.0009431514,0.00028579566,0.0000783001,0.00038284805,0.00010349911,0.0012157728],"category_scores_gemma":[0.000016905482,0.00026395576,0.0009638221,0.0036162902,0.0013509836,0.000116891075,0.000048318452,0.00040307935,0.000019344168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040639,0.00032489217,0.22854787,0.000004453303,0.0043121716,0.0000035734074,0.0004144554,0.08703934,0.000027728413,0.62038213,0.025041265,0.033861462],"study_design_scores_gemma":[0.0019235022,0.00014329044,0.08348039,0.00004432452,0.007563745,0.000010394103,0.00044488482,0.51626587,0.00027094627,0.23991667,0.14753073,0.0024052681],"about_ca_topic_score_codex":0.0019621686,"about_ca_topic_score_gemma":0.0052514407,"teacher_disagreement_score":0.69571894,"about_ca_system_score_codex":0.00015040839,"about_ca_system_score_gemma":0.00017111309,"threshold_uncertainty_score":0.9999813},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016276719406942957,"score_gpt":0.29813931771175406,"score_spread":0.2818625983048111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153349054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5238752,0.00026653023,0.4713405,0.0015943768,0.00021010514,0.000117139825,0.000010622889,0.00001736553,0.0025681616],"genre_scores_gemma":[0.9972422,0.0000028944582,0.0020300755,0.00009242397,0.00024783512,5.995281e-7,8.455092e-7,0.000006110963,0.00037702118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920416,0.00005355556,0.0003805777,0.00006818855,0.00018096721,0.00011253788],"domain_scores_gemma":[0.9990478,0.000028079665,0.0005239268,0.00021793865,0.00013471872,0.000047497066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012760283,0.00009758273,0.0002133822,0.000011389495,0.00009046221,0.000024847646,0.00029266352,0.00002245964,0.00013046716],"category_scores_gemma":[0.000009058593,0.000066143904,0.00077720184,0.00014033134,0.000040937077,0.00008518526,0.0000673925,0.0002281943,0.0000014989585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001565091,0.0014042013,0.23208569,0.0000303988,0.0013276935,0.0000012285215,0.00474207,0.5272181,0.0012235033,0.009298154,0.20877735,0.01373507],"study_design_scores_gemma":[0.0031675354,0.0009790552,0.28546903,0.0011950483,0.0024644146,0.000009926541,0.002040617,0.20694932,0.019174071,0.45943177,0.018073913,0.0010453155],"about_ca_topic_score_codex":0.0000699123,"about_ca_topic_score_gemma":0.0000021766505,"teacher_disagreement_score":0.473367,"about_ca_system_score_codex":0.00004943371,"about_ca_system_score_gemma":0.000034458182,"threshold_uncertainty_score":0.26972702},"labels":[],"label_agreement":null},{"id":"W2157178313","doi":"10.1109/ccece.2006.277444","title":"Data Mining Network Traffic","year":2006,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Hurst exponent; Computer science; Intermittency; Data mining; Network packet; Fuzzy logic; Artificial intelligence; Statistics; Mathematics; Computer network","score_opus":0.025762248780313336,"score_gpt":0.27371755344053494,"score_spread":0.24795530466022161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157178313","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26187193,0.00019456616,0.22279868,0.00025645318,0.000109197004,0.0001891587,0.000040537314,0.00059534336,0.51394415],"genre_scores_gemma":[0.96565896,3.2679606e-7,0.030224308,0.000028135788,0.0014622656,0.0000045404963,0.00044874178,0.00001052012,0.0021621734],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993165,0.000017959785,0.00016154101,0.0002203862,0.00007785553,0.00020575683],"domain_scores_gemma":[0.99928176,0.000040487488,0.000044706485,0.0005958564,0.000014197571,0.000023003437],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012899537,0.00008501262,0.0001215384,0.00002059135,0.00007685135,0.00004655693,0.00035533283,0.000012601456,0.0014995871],"category_scores_gemma":[4.410222e-7,0.00007710603,0.00004534721,0.00019760108,0.000016697608,0.00008662691,0.00017042528,0.00005033108,0.000031216514],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017492474,0.000060478716,0.034141757,8.5767977e-7,0.000046581303,7.67905e-7,0.000005664745,0.008513438,0.000014942375,0.035903495,0.8411169,0.08019337],"study_design_scores_gemma":[0.00029511913,0.000021380209,0.007372864,0.000022304157,0.00012499014,7.5347344e-7,0.00009588603,0.38951942,0.00009247515,0.017877854,0.58404785,0.0005290977],"about_ca_topic_score_codex":0.00019508347,"about_ca_topic_score_gemma":0.0001359719,"teacher_disagreement_score":0.703787,"about_ca_system_score_codex":0.000004517012,"about_ca_system_score_gemma":0.000010987946,"threshold_uncertainty_score":0.9994132},"labels":[],"label_agreement":null},{"id":"W2157940332","doi":"10.1145/1718487.1718525","title":"Early online identification of attention gathering items in social media","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Social media; Computer science; Identification (biology); Set (abstract data type); Task (project management); World Wide Web; Internet privacy; Information retrieval; Data science","score_opus":0.01479545160627812,"score_gpt":0.27991240496527947,"score_spread":0.2651169533590014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157940332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911649,0.0000013591717,0.007493951,0.00003490138,0.000044119577,0.00004759916,0.000005292277,0.000023449289,0.0011843839],"genre_scores_gemma":[0.99877846,2.528792e-7,0.0007387546,0.0000014554998,0.00030271194,0.0000062739614,0.00005189774,0.0000056797626,0.00011451734],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9995035,0.000013296948,0.00023868137,0.0000925406,0.000079090474,0.00007286954],"domain_scores_gemma":[0.9997222,0.00002391201,0.00010154241,0.00010116993,0.000039440787,0.0000117304735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013952021,0.00004660591,0.0000965422,0.00006960376,0.00002302031,0.000014287368,0.000084279956,0.000021253063,0.0002508021],"category_scores_gemma":[0.000003048979,0.000046520072,0.000060951996,0.00016605441,0.000020333691,0.00006680971,0.000023047092,0.00010001421,0.0000050194803],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003711156,0.00021724081,0.3409856,0.0000036555336,0.000024570958,9.7935626e-8,0.0004792026,0.000005438808,0.5510712,0.052845035,0.00015891092,0.054205313],"study_design_scores_gemma":[0.00014463878,0.000004032159,0.9706625,0.000005551729,0.000013988494,3.4537695e-8,0.00018278853,0.00322566,0.009356335,0.0161473,0.00017043005,0.000086737324],"about_ca_topic_score_codex":0.00027807555,"about_ca_topic_score_gemma":0.0003630327,"teacher_disagreement_score":0.6296769,"about_ca_system_score_codex":0.0000044373123,"about_ca_system_score_gemma":0.000005573068,"threshold_uncertainty_score":0.27461073},"labels":[],"label_agreement":null},{"id":"W2158929600","doi":"10.1145/2184356.2184366","title":"Predicting human contacts in mobile social networks using supervised learning","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Mobile telephony; Social learning; Artificial intelligence; Machine learning; Human–computer interaction; Telecommunications; Mobile radio; Knowledge management","score_opus":0.02626986322008507,"score_gpt":0.30375956142518723,"score_spread":0.27748969820510216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158929600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96778095,0.00008419217,0.0198286,0.0000037215104,0.00003279154,0.00014836145,4.3943035e-7,0.00011259769,0.012008343],"genre_scores_gemma":[0.9981539,9.3278203e-7,0.00042496296,0.000015136744,0.0012022798,0.000026251755,0.000028311166,0.000021345444,0.00012683305],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989613,0.000098220175,0.00025359527,0.0001465649,0.000099157885,0.0004411142],"domain_scores_gemma":[0.9996894,0.00004462812,0.000084651365,0.00009462877,0.000026030404,0.00006068665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031702785,0.00012963668,0.00022603823,0.00007384373,0.00026824683,0.000045656914,0.00010038649,0.00004360523,0.00086805556],"category_scores_gemma":[0.0000016060716,0.00013347936,0.000103562226,0.0002334104,0.00002052099,0.00020946907,0.00009633567,0.00029145338,0.0000035442745],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021948324,0.00007191047,0.98757434,0.0000016484306,0.000030043428,2.043462e-7,0.0005048567,0.0030086164,0.0010229824,0.003751538,0.000099312005,0.0039323303],"study_design_scores_gemma":[0.0015813007,0.00010262282,0.17581989,0.00009944258,0.000187018,0.0000011921129,0.0056092693,0.806711,0.0019469984,0.0015198549,0.0052874177,0.0011339942],"about_ca_topic_score_codex":0.0009565786,"about_ca_topic_score_gemma":0.000041969557,"teacher_disagreement_score":0.81175447,"about_ca_system_score_codex":0.000047909823,"about_ca_system_score_gemma":0.0000097108605,"threshold_uncertainty_score":0.95046},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022702445818102917,"score_gpt":0.2931075849506718,"score_spread":0.27040513913256886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159176819","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9714627,0.000010682821,0.016278682,0.0012979441,0.000035454985,0.0003692522,0.000008358794,0.000079623744,0.010457263],"genre_scores_gemma":[0.9990054,0.0000036235112,0.0005237572,0.00006407355,0.00013396435,0.000040397306,0.000008174143,0.000020344065,0.00020028235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983012,0.000031112162,0.0004978028,0.0004294216,0.00037395625,0.00036648606],"domain_scores_gemma":[0.9984795,0.000089725596,0.00025068628,0.00015363548,0.0009699206,0.000056525932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025224654,0.00022625695,0.00033973492,0.0000898158,0.0002371592,0.00014219718,0.00050691067,0.00007692857,0.0005878504],"category_scores_gemma":[0.000083696235,0.00017871207,0.00009801483,0.0010646052,0.00032663645,0.00023345322,0.00018665486,0.0003603315,0.00003279754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084741,0.0018475987,0.02162494,0.000103832026,0.00015116532,0.0000036523022,0.0028713674,0.01923228,0.090103716,0.79560506,0.00058131287,0.067027636],"study_design_scores_gemma":[0.000086109074,0.00017189077,0.0011316774,0.0005459802,0.000090627495,0.000002500459,0.0010167696,0.59992176,0.22875182,0.16774467,0.000026656538,0.0005095406],"about_ca_topic_score_codex":0.000036153222,"about_ca_topic_score_gemma":0.0000096538915,"teacher_disagreement_score":0.6278604,"about_ca_system_score_codex":0.000035486366,"about_ca_system_score_gemma":0.00010603166,"threshold_uncertainty_score":0.7287667},"labels":[],"label_agreement":null},{"id":"W2159745802","doi":"10.1109/infcomw.2009.5072195","title":"Survival Value of Communication Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Criticality; Computer science; Mathematical optimization; Betweenness centrality; Robustness (evolution); Mathematics","score_opus":0.010152551188843019,"score_gpt":0.269738864257181,"score_spread":0.259586313068338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159745802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044357162,0.00008606816,0.7011677,0.00023272292,0.000015169899,0.00008601556,9.1848295e-7,0.000078109755,0.25397617],"genre_scores_gemma":[0.9943878,0.000005695719,0.0052641514,0.00003205597,0.00006278958,0.0000017698636,0.000024229963,0.000003129477,0.00021835427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999585,0.000046061636,0.00015420288,0.00006811766,0.00006336706,0.000083296974],"domain_scores_gemma":[0.9994813,0.000040199786,0.00006761686,0.0003514794,0.00003978871,0.000019577163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013486207,0.00005408657,0.00012495129,0.00002399471,0.00003387085,0.000009582362,0.0001744545,0.000013676345,0.00036095068],"category_scores_gemma":[7.472792e-7,0.00004937653,0.000075046686,0.00014418218,0.00001799212,0.000038980543,0.000030319898,0.00006219714,0.0000025681377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037541172,0.00009838122,0.02621496,3.2333665e-7,0.000034398065,2.8940272e-8,0.000022773096,0.0071175606,0.000109754,0.9061113,0.003694496,0.056592297],"study_design_scores_gemma":[0.00050706964,0.00014076503,0.14804332,0.00004579619,0.00012215208,2.0432401e-7,0.00019637583,0.5084404,0.0049041323,0.328142,0.008998317,0.00045950947],"about_ca_topic_score_codex":0.00018431841,"about_ca_topic_score_gemma":0.000004940919,"teacher_disagreement_score":0.9500307,"about_ca_system_score_codex":0.000004489904,"about_ca_system_score_gemma":0.0000053935814,"threshold_uncertainty_score":0.3952157},"labels":[],"label_agreement":null},{"id":"W2160280191","doi":"10.1109/tpds.2014.2342740","title":"Small Cluster in Cyber Physical Systems: Network Topology, Interdependence and Cascading Failures","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Interdependent networks; Cascading failure; Computer science; Giant component; Network topology; Small-world network; Component (thermodynamics); Generality; Cluster (spacecraft); Distributed computing; Topology (electrical circuits); Metric (unit); Fraction (chemistry); Complex network; Upper and lower bounds; Connected component; Percolation (cognitive psychology); Computer network; Random graph; Theoretical computer science; Mathematics; Physics; Graph; Electric power system; Artificial intelligence","score_opus":0.01464613176780329,"score_gpt":0.24597382361107165,"score_spread":0.23132769184326835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160280191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12360272,0.00015056929,0.87501866,0.0001063309,0.0002119834,0.00032145216,0.00006541025,0.00006972087,0.00045314428],"genre_scores_gemma":[0.9991466,0.000010241152,0.0001424003,0.000018304398,0.0002946077,0.00017406084,0.000029095405,0.000016648366,0.0001680674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998463,0.00027069144,0.00037567137,0.00041021378,0.00011636808,0.0003640945],"domain_scores_gemma":[0.9991962,0.00026492128,0.00011289661,0.0002571853,0.000046813188,0.0001219882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028475412,0.00025399393,0.00049406243,0.00009236614,0.00019778096,0.00015170152,0.00012864548,0.00008828279,0.000011142391],"category_scores_gemma":[0.0000018195631,0.00022576508,0.0000949092,0.00020872816,0.00009919409,0.000101594014,0.0000071255677,0.00030478215,0.0000070352635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001135445,0.00027629474,0.009438787,0.00010090692,0.00028898008,0.000005304138,0.00043413928,0.9617825,0.000107551794,0.02165192,0.0015234137,0.0042766617],"study_design_scores_gemma":[0.0013620828,0.0001920633,0.0012602357,0.0004031587,0.0001683567,0.000031698917,0.0011493453,0.9879077,0.000039241735,0.0023094525,0.0045392816,0.0006374008],"about_ca_topic_score_codex":0.0029156257,"about_ca_topic_score_gemma":0.00036774823,"teacher_disagreement_score":0.87554383,"about_ca_system_score_codex":0.000041607607,"about_ca_system_score_gemma":0.000012335082,"threshold_uncertainty_score":0.92064327},"labels":[],"label_agreement":null},{"id":"W2160404036","doi":"10.1155/2014/801854","title":"A Novel Complex Networks Clustering Algorithm Based on the Core Influence of Nodes","year":2014,"lang":"en","type":"article","venue":"The Scientific World JOURNAL","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Program for New Century Excellent Talents in University; State Key Laboratory of Software Development Environment; National Natural Science Foundation of China; China University of Petroleum, Beijing; Science Foundation of China University of Petroleum, Beijing; Beihang University","keywords":"Cluster analysis; Computer science; Betweenness centrality; Core (optical fiber); Single-linkage clustering; Complex network; Cluster (spacecraft); Algorithm; Correlation clustering; Data mining; Convergence (economics); CURE data clustering algorithm; Community structure; Fuzzy clustering; Centrality; Artificial intelligence; Mathematics","score_opus":0.029389024052725837,"score_gpt":0.26642177270642314,"score_spread":0.2370327486536973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160404036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06293391,0.0000142173885,0.9329325,0.00076894974,0.0002517059,0.00015464924,0.000009374155,0.000026805355,0.0029078783],"genre_scores_gemma":[0.98916876,3.0934964e-7,0.009572722,0.00017738984,0.00042242432,0.0000065122213,0.000005798822,0.000012729839,0.0006333701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855185,0.0001407025,0.0003726843,0.00019548244,0.0004337192,0.00030558588],"domain_scores_gemma":[0.998337,0.0004168739,0.00037358855,0.000615484,0.00019288082,0.0000642309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024494268,0.00015058796,0.00020866573,0.00015790752,0.00097156415,0.0003747793,0.0008959608,0.000012696669,0.00051218976],"category_scores_gemma":[0.00001342272,0.00008260402,0.00020278766,0.0008484539,0.00035318287,0.00007207868,0.00014472158,0.00043212253,0.000006777152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028007455,0.0001650224,0.0050105746,0.0000046872065,0.00011223897,5.833922e-7,0.00020686658,0.85500556,0.008507237,0.010793714,0.01826943,0.10189607],"study_design_scores_gemma":[0.00017835824,0.000017352131,0.0055961325,0.00009782851,0.000037461967,0.0000027194526,0.000041350508,0.98430103,0.00024566273,0.0035780547,0.0057970863,0.000106942345],"about_ca_topic_score_codex":0.000043651755,"about_ca_topic_score_gemma":0.000032468506,"teacher_disagreement_score":0.92623484,"about_ca_system_score_codex":0.000022668008,"about_ca_system_score_gemma":0.000037021182,"threshold_uncertainty_score":0.7472584},"labels":[],"label_agreement":null},{"id":"W2161002879","doi":"10.1177/1090198108320357","title":"Emergence and Robustness of a Community Discussion Network on Mercury Contamination and Health in the Brazilian Amazon","year":2006,"lang":"en","type":"article","venue":"Health Education & Behavior","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Robustness (evolution); Amazon rainforest; Sustainability; Community resilience; Community network; Intermediary; Computer science; Sociology; Environmental health; Computer security; Business; Redundancy (engineering); Medicine; Ecology; World Wide Web; Marketing","score_opus":0.03293401189747654,"score_gpt":0.36811628373401967,"score_spread":0.33518227183654314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161002879","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882061,0.00029704176,0.0012474117,0.009313852,0.00009446161,0.00070500985,0.000008123732,0.000014575736,0.000113447466],"genre_scores_gemma":[0.9986965,0.000042308086,0.0004638754,0.00026249647,0.0001464149,0.00016928725,0.00017452675,0.000007876645,0.0000367238],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99869555,0.0005015091,0.0003862092,0.0001244415,0.00011139462,0.00018091679],"domain_scores_gemma":[0.9992955,0.000062167455,0.00028923326,0.0002549994,0.00004538992,0.000052763473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009724712,0.00010309584,0.00020676636,0.000079550504,0.00033588495,0.000019846628,0.00010132558,0.000021994183,0.000030929034],"category_scores_gemma":[0.000002023829,0.00007220871,0.000025857495,0.00030162753,0.0000508143,0.00006894285,0.000026545444,0.00022896897,2.6344333e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006886419,0.0010993687,0.42474192,0.00003694811,0.0000023183097,2.0514097e-8,0.001631098,0.00010837195,0.000008556123,0.007988713,0.014164037,0.5502117],"study_design_scores_gemma":[0.00011873965,0.00011175207,0.9951232,0.000105274885,0.000010811563,4.9413535e-7,0.0023638075,0.0002650787,0.0000072954067,0.0007816645,0.001042084,0.00006976134],"about_ca_topic_score_codex":0.012493277,"about_ca_topic_score_gemma":0.002582737,"teacher_disagreement_score":0.5703813,"about_ca_system_score_codex":0.000043599397,"about_ca_system_score_gemma":0.0001757003,"threshold_uncertainty_score":0.9940826},"labels":[],"label_agreement":null},{"id":"W2161876704","doi":"10.1007/978-3-540-73133-7_12","title":"Empirical Analysis of a Dynamic Social Network Built from PGP Keyrings","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Snapshot (computer storage); Computer science; Social network (sociolinguistics); Dynamic network analysis; Focus (optics); Data science; Set (abstract data type); Key (lock); Data mining; Empirical research; Computer security; World Wide Web; Social media; Database; Computer network","score_opus":0.018329284280746174,"score_gpt":0.2884802352072239,"score_spread":0.27015095092647773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161876704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008467214,0.00022506496,0.9885355,0.00012679829,0.0001594566,0.00015976261,0.0000458067,0.000065660606,0.0022147216],"genre_scores_gemma":[0.93562007,0.000014999638,0.06292863,0.00019912777,0.00097244326,0.000006202115,0.00012295863,0.00003210143,0.000103445265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971097,0.000038333365,0.0006484542,0.0010269657,0.00067652896,0.00050001405],"domain_scores_gemma":[0.9981085,0.00038992753,0.0004970484,0.00073825044,0.00017817515,0.00008808487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002808769,0.00044953576,0.0011862003,0.00080097845,0.00024400691,0.000087017055,0.001237975,0.00019885114,0.00029151587],"category_scores_gemma":[0.000005910671,0.00043687221,0.0006884956,0.0016885947,0.0007299583,0.000093232324,0.0006938182,0.00065147236,0.000006103363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003029949,0.00013933641,0.039641842,0.000012681455,0.0024208631,0.00002930648,0.0020625712,0.1766163,0.00008487459,0.002366509,0.0009999856,0.7755954],"study_design_scores_gemma":[0.00020091445,0.00006412638,0.016703779,0.00014498584,0.0009937396,9.978254e-7,4.0604945e-7,0.81201416,0.0000842614,0.16654503,0.002353663,0.0008939284],"about_ca_topic_score_codex":0.00041494504,"about_ca_topic_score_gemma":0.00035796835,"teacher_disagreement_score":0.9271529,"about_ca_system_score_codex":0.00015847282,"about_ca_system_score_gemma":0.00020894474,"threshold_uncertainty_score":0.9998083},"labels":[],"label_agreement":null},{"id":"W2162149512","doi":"10.1007/978-3-662-44848-9_10","title":"Density-Based Subspace Clustering in Heterogeneous Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cluster analysis; Computer science; Vertex (graph theory); Data mining; Exploit; Subspace topology; Similarity (geometry); Correlation clustering; Clustering high-dimensional data; Theoretical computer science; Artificial intelligence; Graph","score_opus":0.01063671099295312,"score_gpt":0.23663686362435168,"score_spread":0.22600015263139855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162149512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008493134,0.000099651275,0.99719054,0.00010071476,0.0002834751,0.00025812731,0.0000016078881,0.00008093178,0.0011356225],"genre_scores_gemma":[0.95544505,0.000002743966,0.04321117,0.00041858578,0.0007730588,0.000009346494,0.000017830975,0.00004364811,0.00007858353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755776,0.000044478213,0.00043457295,0.0009787905,0.0003924746,0.000591909],"domain_scores_gemma":[0.9984058,0.0002900398,0.00023894895,0.00086259283,0.00009572871,0.00010690201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053457025,0.0004678412,0.0006293551,0.00057577563,0.00012982641,0.00020640876,0.0009630983,0.00017327747,0.000076492055],"category_scores_gemma":[0.0000056392773,0.00047298986,0.0001956757,0.0003887227,0.00031211492,0.00006087243,0.00052354904,0.00076893065,0.000009682573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005760922,0.0000122506135,0.0021671553,0.000008187676,0.000009821201,0.000016949667,0.000036402424,0.79712135,0.000013626898,0.00096883986,0.000010855284,0.19962883],"study_design_scores_gemma":[0.00016283184,0.000046377045,0.0001130498,0.0003004944,0.000013909411,0.000003391206,4.571641e-8,0.9726176,0.00035933068,0.025278533,0.0006217138,0.00048268418],"about_ca_topic_score_codex":0.00014527574,"about_ca_topic_score_gemma":0.0010707729,"teacher_disagreement_score":0.95459574,"about_ca_system_score_codex":0.00018256552,"about_ca_system_score_gemma":0.00012393507,"threshold_uncertainty_score":0.9997722},"labels":[],"label_agreement":null},{"id":"W2162528915","doi":"10.1109/socialcom.2010.21","title":"The Evolution of Friendships in Chinese Online Social Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Affect (linguistics); China; Friendship; Social network (sociolinguistics); Computer science; Social relationship; Internet privacy; World Wide Web; Social media; Psychology; Social psychology; Political science","score_opus":0.005071483155003545,"score_gpt":0.26571969662160994,"score_spread":0.2606482134666064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162528915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9467995,0.000021028527,0.04093509,0.00021006732,0.000069881586,0.00007563038,0.0000034650968,0.000028702614,0.0118565895],"genre_scores_gemma":[0.99872744,7.1744165e-7,0.0005508748,0.000005159798,0.0005534135,0.000007365751,0.000016228087,0.0000055609125,0.00013322032],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994789,0.000029256189,0.0001931457,0.00008946372,0.000073757015,0.00013551662],"domain_scores_gemma":[0.99963707,0.00007477035,0.00007509121,0.00015769832,0.000039667375,0.000015719468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019922323,0.00006836099,0.00011571557,0.000033898425,0.00009378866,0.0000133581025,0.00016543949,0.000028608392,0.00018119156],"category_scores_gemma":[0.000004487372,0.000043594253,0.000084390966,0.00030758188,0.00005727068,0.000036354828,0.000057124864,0.00024445768,0.0000011524112],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011158332,0.00014943478,0.6708171,7.419678e-7,0.000027662027,8.709713e-8,0.00007088937,0.0003139022,0.0005021765,0.2964943,0.0012170274,0.030395506],"study_design_scores_gemma":[0.0003185925,0.000018876459,0.7002869,0.0000046619966,0.000019434505,1.5452846e-7,0.0004347434,0.1771628,0.00008300564,0.11843094,0.003061005,0.00017888116],"about_ca_topic_score_codex":0.0009191871,"about_ca_topic_score_gemma":0.00424485,"teacher_disagreement_score":0.17806338,"about_ca_system_score_codex":0.000012148163,"about_ca_system_score_gemma":0.000018513312,"threshold_uncertainty_score":0.2368726},"labels":[],"label_agreement":null},{"id":"W2162668316","doi":"10.1109/iciea.2013.6566517","title":"Modeling cascading failures in smart power grid using interdependent complex networks and percolation theory","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada","keywords":"Cascading failure; Interdependent networks; Computer science; Distributed computing; Robustness (evolution); Smart grid; Telecommunications network; Complex network; Grid; Electric power system; Power-system protection; Interdependence; Node (physics); Computer network; Power (physics); Engineering; Electrical engineering","score_opus":0.017882730825069897,"score_gpt":0.2620456483797714,"score_spread":0.24416291755470151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162668316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47661078,0.000026863807,0.51966417,0.000029066272,0.000021130507,0.00014172976,4.5188867e-7,0.000034654528,0.0034711407],"genre_scores_gemma":[0.9943933,0.0000014457547,0.0053366288,0.000042156265,0.00014411993,0.000014666522,0.000016446798,0.000017136445,0.000034099427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903566,0.00014868529,0.0002753975,0.00022763664,0.00008548037,0.00022712394],"domain_scores_gemma":[0.9996462,0.00005208973,0.000047549907,0.00015701963,0.00004613629,0.00005102983],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003977035,0.00014253936,0.00018935587,0.00012143785,0.00009973081,0.00014448563,0.00009728841,0.000029514937,0.0013847406],"category_scores_gemma":[0.0000018889261,0.00013021324,0.00006556673,0.000121659694,0.000023120889,0.00025967546,0.0001451467,0.0001586617,0.000005133498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017834644,0.00014650199,0.25601605,0.0000103045695,0.00021814898,0.0000024867818,0.0012908985,0.6117238,0.0035019747,0.06950001,0.00096009497,0.056611963],"study_design_scores_gemma":[0.00011798667,0.000007650447,0.0053152707,0.000028907105,0.000014803112,0.0000010049191,0.00083201594,0.9828318,0.000020650956,0.010639321,0.000038337246,0.00015226212],"about_ca_topic_score_codex":0.0046913675,"about_ca_topic_score_gemma":0.00022472434,"teacher_disagreement_score":0.5177825,"about_ca_system_score_codex":0.000039723225,"about_ca_system_score_gemma":0.0000063125804,"threshold_uncertainty_score":0.9995281},"labels":[],"label_agreement":null},{"id":"W2163680076","doi":"10.1109/icdmw.2010.97","title":"Modeling and Comparing the Influence of Neighbors on the Behavior of Users in Social and Similarity Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Similarity (geometry); Social network (sociolinguistics); Computer science; Measure (data warehouse); Recommender system; Social influence; Social relation; Social media; Artificial intelligence; Psychology; Social psychology; World Wide Web; Data mining","score_opus":0.02563999513746331,"score_gpt":0.28348669894147394,"score_spread":0.25784670380401065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163680076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99694353,0.000004995317,0.002356252,0.000070258575,0.0000049487703,0.00013577467,8.866049e-7,0.0000059764293,0.0004773856],"genre_scores_gemma":[0.9997937,0.0000018323765,0.0001277317,0.000020800811,0.000034135668,0.000015049551,8.3658307e-7,0.0000038015364,0.000002078269],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955827,0.00003056717,0.00016703673,0.00009034223,0.00006627669,0.000087523265],"domain_scores_gemma":[0.9996787,0.00009023973,0.000060067578,0.00012946795,0.000028988694,0.000012556481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023659275,0.00006567748,0.00014482067,0.000022109127,0.00008488337,0.000015992668,0.00011441836,0.000023346789,0.000016536724],"category_scores_gemma":[0.0000027864703,0.00003934517,0.000032721717,0.0000936618,0.00011427084,0.000037093923,0.000089337,0.0002406492,3.111876e-8],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006468841,0.00003530835,0.90159935,0.0000015497419,0.000013959862,3.8233427e-8,0.00020146715,0.052751265,0.0004071726,0.043474294,0.00001486842,0.0014942567],"study_design_scores_gemma":[0.000090840425,0.000008661125,0.2726049,0.000009787491,0.00002978321,5.29849e-8,0.00019527882,0.724264,0.00020720321,0.0025292444,0.0000052827086,0.00005491166],"about_ca_topic_score_codex":0.0016023361,"about_ca_topic_score_gemma":0.0004934204,"teacher_disagreement_score":0.6715128,"about_ca_system_score_codex":0.000002193403,"about_ca_system_score_gemma":0.0000062464783,"threshold_uncertainty_score":0.24222636},"labels":[],"label_agreement":null},{"id":"W2164336898","doi":"10.48550/arxiv.0905.4438","title":"Extreme value theory, Poisson-Dirichlet distributions and FPP on random networks","year":2009,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Exponent; Combinatorics; Poisson distribution; Dirichlet distribution; Limit (mathematics); Random graph; Percolation theory; Exponential function; Vertex (graph theory); Discrete mathematics; Exponential distribution; Topology (electrical circuits); Mathematical analysis; Statistics","score_opus":0.021045365597526556,"score_gpt":0.2597509797660136,"score_spread":0.238705614168487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164336898","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8089542,0.0002463342,0.18012379,0.00084330083,0.00005855245,0.0002453197,0.000021148826,0.00017566611,0.009331724],"genre_scores_gemma":[0.9983833,0.000021216858,0.00023824644,0.00025732061,0.00053307775,0.000020964668,0.00012123448,0.000015124106,0.0004095209],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988007,0.00013527228,0.00025336863,0.00034045675,0.00011962797,0.00035057185],"domain_scores_gemma":[0.9991087,0.00020411896,0.000105365274,0.00042136587,0.000046100537,0.00011438364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031318382,0.00022164511,0.0003030384,0.000056117085,0.00026371318,0.000058302983,0.00018702135,0.00005052891,0.00028828543],"category_scores_gemma":[0.000013409757,0.00019562193,0.00016862206,0.00027431815,0.00006717036,0.000086740416,0.00005674904,0.00024670394,0.00003218531],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018550038,0.0004438499,0.54811054,0.0000025729094,0.00025174872,0.000006598346,0.00009763944,0.000712456,0.00055344345,0.39001402,0.015532633,0.044089016],"study_design_scores_gemma":[0.002338498,0.00026810513,0.8170481,0.00009760717,0.0003385936,0.0000026679595,0.00008065724,0.012328947,0.0010816845,0.1445518,0.021067904,0.00079544674],"about_ca_topic_score_codex":0.000051853425,"about_ca_topic_score_gemma":0.0000033902197,"teacher_disagreement_score":0.26893756,"about_ca_system_score_codex":0.000025940397,"about_ca_system_score_gemma":0.00001339797,"threshold_uncertainty_score":0.7977231},"labels":[],"label_agreement":null},{"id":"W2165483422","doi":"10.1145/1526709.1526849","title":"A geographical analysis of knowledge production in computer science","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Social network analysis; Geoinformatics; Data science; Giant component; Process (computing); Social network (sociolinguistics); Field (mathematics); Geography; Regional science; World Wide Web; Cartography; Theoretical computer science; Social media; Mathematics","score_opus":0.009501230762359378,"score_gpt":0.2832277436557981,"score_spread":0.27372651289343874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165483422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90013117,0.000010521072,0.09469233,0.00008934779,0.000015030285,0.0000645469,4.3424063e-7,0.000028316184,0.0049683107],"genre_scores_gemma":[0.99374217,0.000001000543,0.0061514364,0.000009068126,0.00006478636,0.0000022785962,0.000004458237,0.0000012719319,0.000023503722],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993368,0.000018585963,0.00018598461,0.00022363244,0.000106796324,0.00012820476],"domain_scores_gemma":[0.9995907,0.0000114482245,0.000046311492,0.00023174053,0.000092205635,0.000027603772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029923045,0.000058028538,0.00019372617,0.000915745,0.000033104938,0.000014073783,0.00014582141,0.000009634806,0.00012123857],"category_scores_gemma":[0.0000016804238,0.000050282564,0.00012623113,0.005610847,0.000098675104,0.00008175025,0.000033372165,0.000054356602,0.0000013720561],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005096039,0.0005487719,0.68081903,0.0000013472855,0.0001489941,1.5782004e-7,0.00016360756,0.0033698305,0.0015426738,0.03120777,0.0001942349,0.2819985],"study_design_scores_gemma":[0.000070035785,0.000042223717,0.83418334,0.000007755067,0.00017353831,7.954221e-8,0.000009781189,0.1520588,0.004909124,0.00837739,0.000060519167,0.000107391206],"about_ca_topic_score_codex":0.00011928829,"about_ca_topic_score_gemma":0.00005701612,"teacher_disagreement_score":0.2818911,"about_ca_system_score_codex":0.000011038667,"about_ca_system_score_gemma":0.00002065383,"threshold_uncertainty_score":0.2695826},"labels":[],"label_agreement":null},{"id":"W2165665775","doi":"10.1061/9780784479292.071","title":"Social Network Analysis Research on the Supply Network of JD Cement Group","year":2015,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Association of Canadian Universities for Research in Astronomy","keywords":"Subsidiary; Core (optical fiber); Supply network; Node (physics); Business; Industrial organization; Social network analysis; Competitive advantage; Plan (archaeology); Computer science; Operations management; Engineering; Marketing; Telecommunications; Multinational corporation","score_opus":0.11670417969580622,"score_gpt":0.3860548277447115,"score_spread":0.2693506480489053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165665775","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32742468,0.0003143606,0.1409679,0.00788234,0.00023432293,0.0017526506,0.000030696192,0.00030125212,0.5210918],"genre_scores_gemma":[0.995718,0.0000023047576,0.0011346021,0.00009565614,0.0019523175,0.00007056442,0.000066810884,0.000015330084,0.00094438373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997538,0.0005259969,0.00037662915,0.00029159614,0.000707241,0.0005605569],"domain_scores_gemma":[0.9985468,0.00038536562,0.00013878442,0.00053288013,0.0003017429,0.000094455085],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028236902,0.00015711365,0.00039228794,0.00010572422,0.00033540197,0.00006734998,0.00049570715,0.00004046527,0.0015570715],"category_scores_gemma":[0.0000061125556,0.000106029154,0.00038435444,0.0029293154,0.00014032297,0.00004090079,0.0002789791,0.00031084093,0.000035107263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003010153,0.00010902,0.0707782,8.5981065e-7,0.0010183044,2.782372e-7,0.00011704292,0.00960155,0.0000031190611,0.5391223,0.3762883,0.0029309224],"study_design_scores_gemma":[0.00086168153,0.00065128907,0.039242767,0.0000502292,0.0018043264,1.2352794e-7,0.0027391897,0.053908065,0.00028949385,0.72942126,0.17022258,0.00080899085],"about_ca_topic_score_codex":0.0010369194,"about_ca_topic_score_gemma":0.00022668653,"teacher_disagreement_score":0.66829336,"about_ca_system_score_codex":0.00006211428,"about_ca_system_score_gemma":0.000048940004,"threshold_uncertainty_score":0.9993556},"labels":[],"label_agreement":null},{"id":"W2166300068","doi":"10.1109/cse.2009.113","title":"Information Technology Capabilities for Digital Social Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Typology; Dissemination; Computer science; Knowledge management; Social network (sociolinguistics); World Wide Web; Data science; Social network analysis; Identity (music); Social media; Telecommunications; Sociology","score_opus":0.005121494665318861,"score_gpt":0.23805867326544192,"score_spread":0.23293717860012306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166300068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017061574,0.0000063402913,0.93970054,0.00085097115,0.000018577068,0.00019927505,0.000011197006,0.0002553742,0.04189616],"genre_scores_gemma":[0.99757576,1.8147297e-7,0.0017290693,0.00007887814,0.00024535172,0.000032816708,0.0001089529,0.0000029370497,0.00022603906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995658,0.0000026899345,0.00016689926,0.00005772257,0.000044834287,0.0001620562],"domain_scores_gemma":[0.99974793,0.000019914392,0.00005369219,0.00009512057,0.00006859689,0.000014720056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003921835,0.00007582821,0.00011638215,0.00008030885,0.00010589655,0.00009139562,0.00010123062,0.000038561073,0.00009547056],"category_scores_gemma":[0.0000027648264,0.000070010894,0.00009481776,0.00016372939,0.00003127297,0.0003587447,0.000019416913,0.000056410743,0.0000060527204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005862524,0.000026636984,0.0027742519,0.0000010703931,0.00002169726,9.293069e-9,0.00008794516,0.0001841593,0.000003458714,0.58558226,0.01598655,0.3953261],"study_design_scores_gemma":[0.00041248457,0.00015573148,0.0015294596,0.0000057640978,0.000034162378,3.4279824e-7,0.0016423496,0.040471055,0.0003635473,0.84043777,0.11460645,0.00034088877],"about_ca_topic_score_codex":0.000006554852,"about_ca_topic_score_gemma":8.0709174e-7,"teacher_disagreement_score":0.9805142,"about_ca_system_score_codex":0.000013567158,"about_ca_system_score_gemma":0.000009468001,"threshold_uncertainty_score":0.28549615},"labels":[],"label_agreement":null},{"id":"W2169504063","doi":"10.1111/j.1467-985x.2011.00695.x","title":"Modelling Member Behaviour in on-Line User-Generated Content Sites: A Semiparametric Bayesian Approach","year":2011,"lang":"en","type":"article","venue":"Journal of the Royal Statistical Society Series A (Statistics in Society)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Bivariate analysis; Event (particle physics); User-generated content; Computer science; Econometrics; Set (abstract data type); Bayesian probability; Line (geometry); Linear model; Machine learning; Artificial intelligence; Social media; Mathematics; World Wide Web","score_opus":0.07675050356163719,"score_gpt":0.2859784746130932,"score_spread":0.20922797105145602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169504063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04739311,0.00009923219,0.9510412,0.0000622513,0.000116107185,0.00029328928,0.0003378799,0.000017915461,0.00063901825],"genre_scores_gemma":[0.6101539,0.000035241414,0.3891212,0.00010964632,0.00014284876,0.000018157472,0.00003640041,0.00003629873,0.00034631867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969199,0.00023835697,0.0012807582,0.00035029813,0.0006381538,0.0005725417],"domain_scores_gemma":[0.9980191,0.00048016247,0.0006532781,0.0003315087,0.00033200104,0.00018392867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008708568,0.0003791927,0.00077069626,0.00006720944,0.00019490471,0.00009974663,0.0005677943,0.0001505203,0.00035128437],"category_scores_gemma":[0.000066508146,0.00028763563,0.00058736873,0.0009788529,0.00031411726,0.00011852655,0.00018007276,0.0012634275,0.00000213258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037123857,0.003545889,0.22473803,0.00012874992,0.0011860701,0.000049054273,0.0070697586,0.502202,0.00003566342,0.20285942,0.0550851,0.0027290748],"study_design_scores_gemma":[0.00110464,0.0002840317,0.0043435576,0.00010929017,0.00026364066,0.000004608236,0.002648814,0.9549399,0.00014608429,0.035439976,0.000274043,0.00044139652],"about_ca_topic_score_codex":0.0007393948,"about_ca_topic_score_gemma":0.00004889057,"teacher_disagreement_score":0.5627608,"about_ca_system_score_codex":0.00030808468,"about_ca_system_score_gemma":0.00014568098,"threshold_uncertainty_score":0.99995756},"labels":[],"label_agreement":null},{"id":"W2169548945","doi":"10.1209/0295-5075/98/16001","title":"Exact solution of bond percolation on small arbitrary graphs","year":2012,"lang":"en","type":"article","venue":"Europhysics Letters (EPL)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Random graph; Percolation (cognitive psychology); Mathematics; Percolation theory; Continuum percolation theory; Graph theory; Indifference graph; Combinatorics; Chordal graph; Graph; Discrete mathematics; Percolation critical exponents; Topology (electrical circuits); Geometry; Critical exponent","score_opus":0.015493964589567451,"score_gpt":0.22955459982433898,"score_spread":0.21406063523477153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169548945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95590323,0.000025657258,0.035675816,0.00024161303,0.00012711712,0.00017361065,0.000012204585,0.00008228004,0.0077584623],"genre_scores_gemma":[0.9960335,0.0000018030578,0.00261738,0.0004727566,0.0007124745,0.000013706058,0.00007857363,0.000036951697,0.000032881406],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9988746,0.0000903806,0.0002708438,0.00022686315,0.00020664571,0.0003306821],"domain_scores_gemma":[0.9992003,0.0000708777,0.00020682538,0.0004080908,0.00004021342,0.00007369992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013607818,0.00020539731,0.00024232657,0.000119501616,0.00009968396,0.000024417946,0.00017330036,0.000024800433,0.00006254271],"category_scores_gemma":[0.0000022538122,0.0002109181,0.00025194924,0.00033441235,0.000060253657,0.00021261003,0.000056985184,0.00022615895,0.0000469789],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008798556,0.0012507265,0.13348109,0.000047157315,0.0004038685,0.0000027853957,0.0010957957,0.00047732957,0.5971067,0.21281,0.02066414,0.032572422],"study_design_scores_gemma":[0.0027753108,0.000891263,0.47368932,0.00045969235,0.0012551579,0.0000035013186,0.00027521653,0.012562202,0.39241314,0.08185725,0.029999804,0.0038181252],"about_ca_topic_score_codex":0.00008664729,"about_ca_topic_score_gemma":6.249187e-7,"teacher_disagreement_score":0.34020826,"about_ca_system_score_codex":0.000026417581,"about_ca_system_score_gemma":0.000010328611,"threshold_uncertainty_score":0.860099},"labels":[],"label_agreement":null},{"id":"W2170644657","doi":"10.1504/ijwet.2013.052582","title":"Social network restructuring after a node removal","year":2013,"lang":"en","type":"article","venue":"International Journal of Web Engineering and Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Betweenness centrality; Centrality; Computer science; Node (physics); Exploit; Closeness; Network controllability; Social network (sociolinguistics); Witness; Topology (electrical circuits); Computer network; Computer security; Mathematics; World Wide Web","score_opus":0.0031836649805760124,"score_gpt":0.2197133954766829,"score_spread":0.21652973049610688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170644657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98877877,0.00019432754,0.008814035,0.0015816643,0.00019845393,0.00003164942,0.0000012725801,0.00005641363,0.0003434245],"genre_scores_gemma":[0.98875105,0.000008599493,0.010144664,0.000015961448,0.001032098,0.0000065933846,9.594029e-7,0.000010488097,0.000029573794],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999416,0.000005886292,0.00024206,0.00007837895,0.00012126913,0.0001364142],"domain_scores_gemma":[0.9995908,0.000020024114,0.00012235534,0.00005952896,0.00017949779,0.00002777059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006985687,0.00008737306,0.0001531393,0.00025842004,0.000025039662,0.00004567049,0.00021522495,0.000048845606,0.00010605143],"category_scores_gemma":[0.000007917904,0.000081328224,0.0000661382,0.00013467816,0.000031251813,0.00009305656,0.000093472896,0.0002427897,0.0000030348604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010850747,0.00017143841,0.2992124,0.000028139386,0.0035346753,0.0003991027,0.00031972336,0.014226253,0.0320363,0.23958288,0.016094554,0.394286],"study_design_scores_gemma":[0.0043718168,0.0003265143,0.09685896,0.0007987454,0.0003865811,0.002282056,0.0003876117,0.15987974,0.008999342,0.49410173,0.22971557,0.0018913228],"about_ca_topic_score_codex":0.000011259823,"about_ca_topic_score_gemma":5.663951e-7,"teacher_disagreement_score":0.3923947,"about_ca_system_score_codex":0.000021318567,"about_ca_system_score_gemma":0.000014789361,"threshold_uncertainty_score":0.3316469},"labels":[],"label_agreement":null},{"id":"W2170852155","doi":"10.1145/1348549.1348558","title":"DBconnect","year":2007,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.0069627103417419945,"score_gpt":0.2730802010287438,"score_spread":0.2661174906870018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170852155","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071976475,0.0000050724984,0.40590242,0.000031803724,0.0000129380705,0.000025218125,2.409255e-7,0.00007886689,0.52196693],"genre_scores_gemma":[0.99249786,8.553883e-8,0.0050728214,0.000050438553,0.00020524894,0.0000012789568,0.0000037045718,0.000003897627,0.0021646703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996855,0.000003758773,0.00007953477,0.00007198622,0.000043422522,0.000115781644],"domain_scores_gemma":[0.9997907,0.00003196758,0.000016217797,0.000117409625,0.000014965204,0.00002873163],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014269343,0.000040239913,0.000054688368,0.000030281544,0.00002789838,0.000010050432,0.000061712104,0.000006353116,0.0039610337],"category_scores_gemma":[5.474862e-7,0.000034164546,0.000052807685,0.00010484701,0.000008428447,0.000024076946,0.000021277254,0.00003373945,0.00008290116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026090115,0.00004070661,0.12041971,4.3138925e-7,0.00004120973,8.201841e-7,0.000025296475,0.0000039277443,0.00084839435,0.6932201,0.015295955,0.17010084],"study_design_scores_gemma":[0.00048646072,0.00006718979,0.057489853,0.000011695827,0.0000702227,0.0000011715745,0.0005347202,0.0022223655,0.1303284,0.31786674,0.4902049,0.000716291],"about_ca_topic_score_codex":0.00012083813,"about_ca_topic_score_gemma":0.00001703451,"teacher_disagreement_score":0.9205214,"about_ca_system_score_codex":0.0000042088286,"about_ca_system_score_gemma":0.0000032348655,"threshold_uncertainty_score":0.9969495},"labels":[],"label_agreement":null},{"id":"W2171228059","doi":"10.4018/jdwm.2010090801","title":"Investigating the Properties of a Social Bookmarking and Tagging Network","year":2010,"lang":"en","type":"article","venue":"International Journal of Data Warehousing and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Bookmarking; Similarity (geometry); Social network (sociolinguistics); Set (abstract data type); World Wide Web; Friendship; Meaning (existential); Popularity; Information retrieval; Social media; Artificial intelligence","score_opus":0.0489664359810364,"score_gpt":0.30693320963499304,"score_spread":0.25796677365395665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171228059","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99525726,0.00021809089,0.0033897515,0.00063274597,0.00016533978,0.000025866793,0.0000075079247,0.000006749371,0.0002966865],"genre_scores_gemma":[0.9846792,0.0000061524006,0.013928361,0.000062331754,0.0013032649,4.763904e-7,0.000006194861,0.000007722163,0.0000062679446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928075,0.000034602883,0.00031245052,0.00009217806,0.00018868277,0.000091336944],"domain_scores_gemma":[0.9991904,0.00009291381,0.00044964085,0.000098498684,0.00014295314,0.00002561458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006732627,0.00007028472,0.00014288408,0.000055546123,0.00016896633,0.00012433146,0.0003674817,0.00001596189,0.000010217264],"category_scores_gemma":[0.000040021972,0.000049760976,0.00003203447,0.00005362451,0.0001311105,0.00029030748,0.00035428104,0.00022343904,4.387209e-8],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037972557,0.000050573784,0.15104981,0.000022518832,0.0009351991,0.000006001223,0.008231088,0.00024778186,0.03937578,0.007064834,0.0032090815,0.78976935],"study_design_scores_gemma":[0.007435605,0.00047571436,0.08053376,0.011799026,0.0027956576,0.0013436225,0.045281075,0.4999305,0.025949875,0.04964803,0.27162057,0.003186576],"about_ca_topic_score_codex":0.000058066635,"about_ca_topic_score_gemma":0.000013530138,"teacher_disagreement_score":0.78658277,"about_ca_system_score_codex":0.0000042996508,"about_ca_system_score_gemma":0.000041723117,"threshold_uncertainty_score":0.20291938},"labels":[],"label_agreement":null},{"id":"W2171477300","doi":"10.1109/isda.2010.5687285","title":"Detecting anomalies in spatiotemporal data using genetic algorithms with fuzzy community membership","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Fisheries and Oceans Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Data mining; Computer science; Modularity (biology); Simulated annealing; Fuzzy logic; Genetic algorithm; Community structure; Metric (unit); Fuzzy set; Machine learning; Artificial intelligence; Algorithm; Mathematics; Statistics; Engineering","score_opus":0.07232111783551562,"score_gpt":0.3166700908854984,"score_spread":0.2443489730499828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171477300","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95281184,0.0000063826537,0.04060254,0.00002122226,0.00002387969,0.00012633092,0.0000086258315,0.000069107526,0.006330063],"genre_scores_gemma":[0.81688374,1.4578717e-7,0.18286659,0.000012023272,0.00013647007,0.0000045814236,0.000055176966,0.000015994983,0.00002529726],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906313,0.00013801976,0.0002303186,0.00021628743,0.000121781006,0.00023047479],"domain_scores_gemma":[0.9986299,0.00010093432,0.000108281456,0.0010695793,0.000042447246,0.000048856546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046676717,0.00014805415,0.00020164717,0.00009653942,0.00019853046,0.00008465309,0.000552461,0.000033657107,0.00030920294],"category_scores_gemma":[0.0000062512813,0.00012877461,0.000029895924,0.00031090027,0.00007273249,0.0002016416,0.00037289172,0.0005936406,0.000002483022],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009678425,0.000129999,0.9421339,0.000007691928,0.00006594614,0.0000025702527,0.00031344107,0.00038759699,0.0015048138,0.0009278635,0.000045139273,0.05447138],"study_design_scores_gemma":[0.0011939668,0.00015277557,0.17159846,0.000110497866,0.00020606063,0.000015737272,0.0040415074,0.7842805,0.013839638,0.02233035,0.0009125889,0.0013179637],"about_ca_topic_score_codex":0.024767263,"about_ca_topic_score_gemma":0.01614245,"teacher_disagreement_score":0.78389287,"about_ca_system_score_codex":0.000013597132,"about_ca_system_score_gemma":0.00004446971,"threshold_uncertainty_score":0.9817269},"labels":[],"label_agreement":null},{"id":"W2171629704","doi":"10.1109/lcn.2006.322217","title":"Indicator Random Variables in Traffic Analysis and the Birthday Problem","year":2006,"lang":"en","type":"article","venue":"Conference on Local Computer Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Pareto principle; Lomax distribution; Random variable; Pareto interpolation; Pareto distribution; Independence (probability theory); Pareto analysis; Variable (mathematics); Computer science; Heavy-tailed distribution; Generalized Pareto distribution; Mathematics; Mathematical optimization; Statistics; Extreme value theory","score_opus":0.005732882315966756,"score_gpt":0.21098518659122364,"score_spread":0.2052523042752569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171629704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041878458,0.00012342042,0.9547259,0.00021817039,0.00003540531,0.00034532067,0.0000029251585,0.00007493303,0.0025954605],"genre_scores_gemma":[0.9972148,0.000014683909,0.0020736996,0.00009111249,0.00040980507,0.00007912741,0.000060214934,0.0000138242,0.000042726046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982747,0.00029981282,0.00044976047,0.00044300823,0.00017306363,0.00035967238],"domain_scores_gemma":[0.9989934,0.00036907342,0.00016478417,0.00036250573,0.00004561913,0.00006459812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054155214,0.00025660105,0.0006158453,0.0002455831,0.00020016564,0.0001665638,0.00033699,0.00007309366,0.00015933014],"category_scores_gemma":[6.7375277e-7,0.00017753517,0.00021363224,0.00096900755,0.00031181777,0.00006127806,0.00018165956,0.00038170937,0.0000041199837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012631378,0.00012285661,0.016698662,0.0000032503428,0.0003309477,0.000002391073,0.000097805634,0.7588021,3.6475163e-7,0.13234384,0.00082451507,0.09064696],"study_design_scores_gemma":[0.0018510538,0.000030672196,0.006134378,0.000034438,0.00017615057,3.4418753e-7,0.00002170666,0.97943497,0.0000035530795,0.011639156,0.00046664686,0.00020693283],"about_ca_topic_score_codex":0.00050699845,"about_ca_topic_score_gemma":0.0002705837,"teacher_disagreement_score":0.95533633,"about_ca_system_score_codex":0.000024067684,"about_ca_system_score_gemma":0.000031500385,"threshold_uncertainty_score":0.7239674},"labels":[],"label_agreement":null},{"id":"W2176301075","doi":"10.1098/rsos.150028","title":"Simple graph models of information spread in finite populations","year":2015,"lang":"en","type":"article","venue":"Royal Society Open Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Athabasca University","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Eigenvalues and eigenvectors; Laplace operator; Chordal graph; Vertex (graph theory); Discrete mathematics; Graph; Mathematical analysis","score_opus":0.04876972195546099,"score_gpt":0.3276135158025326,"score_spread":0.27884379384707164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176301075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32253948,0.0000129448745,0.61255527,0.0001188029,0.000046619563,0.0005019942,0.000033641674,0.000034384328,0.064156845],"genre_scores_gemma":[0.98247826,3.820877e-7,0.017369423,0.00004098525,0.000013215077,0.000016730537,0.000029304598,0.0000021320507,0.00004955488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917895,0.000015690024,0.00024058549,0.00012578018,0.00027187943,0.00016709825],"domain_scores_gemma":[0.99938947,0.000021102565,0.00012215383,0.00023437002,0.00016406788,0.000068826215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008020961,0.0000626623,0.0001289373,0.000049893653,0.000109794324,0.00013771832,0.00075881527,0.000015258918,0.00004512956],"category_scores_gemma":[0.000012014096,0.0000598316,0.00007273822,0.0009836891,0.00013485228,0.0012377582,0.00044065135,0.00006652183,0.0000051888464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005870507,0.00011226907,0.2268072,0.000004178079,0.00001361738,4.485183e-8,0.004220736,0.57342565,0.000044659027,0.17347255,0.009855679,0.012037514],"study_design_scores_gemma":[0.00018821137,0.0000153458,0.010942646,0.000009334508,0.0000057626967,1.9647114e-8,0.00083523314,0.80275166,0.00017051083,0.18446144,0.0005259357,0.00009386992],"about_ca_topic_score_codex":0.005969289,"about_ca_topic_score_gemma":0.000065623906,"teacher_disagreement_score":0.6599388,"about_ca_system_score_codex":0.00004217349,"about_ca_system_score_gemma":0.00015559631,"threshold_uncertainty_score":0.90238196},"labels":[],"label_agreement":null},{"id":"W2178827989","doi":"10.1609/icwsm.v9i1.14651","title":"Exemplar-Based Topic Detection in Twitter Streams","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International AAAI Conference on Web and Social Media","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Qatar National Research Fund; Fonds National de la Recherche Luxembourg","keywords":"Computer science; Benchmark (surveying); Set (abstract data type); Recall; Precision and recall; Context (archaeology); Meaning (existential); Data science; Focus (optics); Key (lock); Term (time); Information retrieval; Interpretation (philosophy); Artificial intelligence; Computer security; Psychology","score_opus":0.025357772336797868,"score_gpt":0.2622715350143426,"score_spread":0.23691376267754471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178827989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.984097,0.0000041141034,0.000039742183,0.0026187156,0.0001172428,0.000045807843,0.0000070946926,0.000009595893,0.013060666],"genre_scores_gemma":[0.9994312,0.0000026778582,0.00007221175,0.000094762516,0.000230251,0.000015621834,0.0000050619374,0.000004112981,0.00014409331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994425,0.000006353008,0.00014456442,0.00013423726,0.00019150854,0.000080846294],"domain_scores_gemma":[0.99964124,0.000039216193,0.00009317425,0.000030472942,0.00018085401,0.000015070953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000773565,0.00007186917,0.000116855765,0.000049726514,0.000045673107,0.000048535338,0.00016057724,0.000028880093,0.00019550373],"category_scores_gemma":[0.000020845255,0.00005925142,0.000063706895,0.00009990463,0.000036868085,0.000050666502,0.0000629764,0.00012729721,9.99484e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009906942,0.00043188705,0.28348526,0.000039151146,0.00017498102,0.0000014735791,0.0037183731,0.000003994503,0.18280251,0.33015487,0.0014780872,0.19761035],"study_design_scores_gemma":[0.0021917855,0.000076784294,0.12187568,0.00044820458,0.00009947987,0.000001969863,0.006900253,0.014167951,0.57918525,0.26664096,0.007810141,0.0006015173],"about_ca_topic_score_codex":0.000028079592,"about_ca_topic_score_gemma":0.00008713378,"teacher_disagreement_score":0.39638275,"about_ca_system_score_codex":0.000024912008,"about_ca_system_score_gemma":0.000044177956,"threshold_uncertainty_score":0.24162027},"labels":[],"label_agreement":null},{"id":"W2179342229","doi":"10.1109/asonam.2012.52","title":"Relative Validity Criteria for Community Mining Algorithms","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Cluster analysis; Data mining; Computer science; Context (archaeology); Task (project management); Quality (philosophy); Measure (data warehouse); Ground truth; Data science; Data stream mining; Machine learning; Geography; Engineering","score_opus":0.12707875420176903,"score_gpt":0.3759533761527146,"score_spread":0.2488746219509456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179342229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19462463,0.0000139818485,0.7523592,0.000061403625,0.000088088935,0.00019247195,0.000024069677,0.00011493824,0.052521203],"genre_scores_gemma":[0.9014519,1.9251846e-7,0.09712758,0.000035885038,0.00046122613,0.000054885935,0.00007296159,0.000011283238,0.00078408845],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929595,0.00016669842,0.0001554716,0.00007615406,0.000059585334,0.00024615685],"domain_scores_gemma":[0.9991911,0.0003492381,0.00006528821,0.0002653515,0.000060983846,0.00006804771],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006162221,0.00010280975,0.00016645984,0.00003165973,0.00027168024,0.00002758975,0.00014081605,0.000022999204,0.00091983814],"category_scores_gemma":[0.000009325164,0.00009323431,0.00013285252,0.00009583294,0.000029550716,0.00024125793,0.00009680874,0.00013475498,0.000011001728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033744996,0.0012784025,0.43536702,0.000025674228,0.0006137887,1.1445817e-7,0.0071417135,0.0000075823436,0.0011598942,0.31763908,0.13931805,0.09741495],"study_design_scores_gemma":[0.00251099,0.0006587075,0.09908689,0.00012987087,0.0010458817,0.0000025625825,0.013056896,0.058516085,0.04873824,0.44959852,0.32393926,0.002716108],"about_ca_topic_score_codex":0.00030199793,"about_ca_topic_score_gemma":0.0000063291145,"teacher_disagreement_score":0.7068273,"about_ca_system_score_codex":0.000017451674,"about_ca_system_score_gemma":0.000007233696,"threshold_uncertainty_score":0.99999344},"labels":[],"label_agreement":null},{"id":"W2180895191","doi":"10.1504/ijsccps.2011.044173","title":"The evolution of friendships in Chinese online social networks","year":2011,"lang":"en","type":"article","venue":"International Journal of Social Computing and Cyber-Physical Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Affect (linguistics); China; Social network (sociolinguistics); Friendship; Social relationship; Internet privacy; World Wide Web; Computer science; Psychology; Social media; Social psychology; Political science; Communication","score_opus":0.01276771261909842,"score_gpt":0.29021987712208697,"score_spread":0.27745216450298854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180895191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9827605,0.00011564538,0.015149775,0.00009422938,0.0003693346,0.00005365928,0.000006505599,0.00000866518,0.0014417175],"genre_scores_gemma":[0.9960017,0.0000020844411,0.00006506859,0.0000041001053,0.0039004292,0.0000010594185,0.0000041836593,0.000008189559,0.000013179031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998725,0.00015554093,0.0005510549,0.0000969109,0.00032378433,0.00014774117],"domain_scores_gemma":[0.99873286,0.00017023712,0.00067963876,0.000045822017,0.00033895002,0.00003248201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043460497,0.00011031234,0.00031438185,0.00007641534,0.00016062918,0.00005007398,0.00032638875,0.000035528865,0.0000037634932],"category_scores_gemma":[0.000011283098,0.000078868514,0.00020680648,0.00019217005,0.00010344806,0.00007919073,0.00009675206,0.00029676312,3.3803678e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003369101,0.0014413343,0.387086,0.000016802453,0.0013495334,0.000013380165,0.014112381,0.002197272,0.0003607244,0.5004254,0.0007300184,0.09193025],"study_design_scores_gemma":[0.0017034744,0.00021039067,0.7460929,0.00027179418,0.00012768184,0.000016827693,0.009402904,0.18381865,0.000032525142,0.057174813,0.0007233331,0.0004246909],"about_ca_topic_score_codex":0.0008732541,"about_ca_topic_score_gemma":0.00002784835,"teacher_disagreement_score":0.44325057,"about_ca_system_score_codex":0.00008457672,"about_ca_system_score_gemma":0.00003443594,"threshold_uncertainty_score":0.32161647},"labels":[],"label_agreement":null},{"id":"W2184303504","doi":"","title":"Measuring Propagation in Online Social Networks: The Case of YouTube","year":2011,"lang":"en","type":"article","venue":"Journal of Information Systems Applied Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Friendship; Crawling; Popularity; Social network (sociolinguistics); Computer science; Internet privacy; World Wide Web; Advertising; Computer network; Social media; Business; Psychology; Social psychology","score_opus":0.11418326646963163,"score_gpt":0.33423426219834174,"score_spread":0.22005099572871012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184303504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8734037,0.00008498041,0.09805747,0.00006490228,0.00011644593,0.0009347159,0.000009991037,0.000014047641,0.027313704],"genre_scores_gemma":[0.99931264,0.0000036114473,0.00026543086,0.0000030613246,0.0003759652,0.000020544025,0.000006095801,0.0000050963527,0.0000075802914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9981222,0.00019391217,0.0010114274,0.000043300606,0.00044443432,0.00018473496],"domain_scores_gemma":[0.9981757,0.00009092182,0.00071752345,0.00013296807,0.00084699714,0.00003589676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042727003,0.00007215085,0.00023229264,0.000422263,0.00014794072,0.00006356638,0.000248651,0.000040259416,0.000024819445],"category_scores_gemma":[0.000014726817,0.000046979545,0.000080507016,0.0006691046,0.00006217397,0.00040180288,0.00006636161,0.00050168915,0.0000031049033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009717598,0.001011326,0.022696473,0.00051454594,0.0009048229,0.00006446565,0.07320143,0.036851548,0.001067731,0.5309837,0.007999486,0.3237327],"study_design_scores_gemma":[0.007933234,0.00088138034,0.038473964,0.001614697,0.00027720744,0.00081657135,0.47271177,0.439515,0.008309995,0.018278215,0.00985739,0.0013305836],"about_ca_topic_score_codex":0.00062063494,"about_ca_topic_score_gemma":0.000024166686,"teacher_disagreement_score":0.5127055,"about_ca_system_score_codex":0.000073541676,"about_ca_system_score_gemma":0.00008888952,"threshold_uncertainty_score":0.21796177},"labels":[],"label_agreement":null},{"id":"W2185303861","doi":"10.1109/dsaa.2015.7344846","title":"Discovering and tracking influencer-influencee relationships between online communities","year":2015,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Transfer entropy; Causality (physics); Entropy (arrow of time); Multigraph; Data science; Tracking (education); Social network (sociolinguistics); Microblogging; Data mining; Social media; Artificial intelligence; Theoretical computer science; Principle of maximum entropy; World Wide Web; Graph; Psychology","score_opus":0.14025898396750644,"score_gpt":0.3249947006913918,"score_spread":0.18473571672388536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185303861","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9722201,0.00004436762,0.020497162,0.000103025675,0.00000892725,0.000068886526,0.000014473419,0.000097391596,0.006945654],"genre_scores_gemma":[0.99421006,0.0000018854445,0.005393292,0.000017417597,0.00017212734,0.0000065430872,0.000071221315,0.0000102506465,0.00011720701],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99936366,0.00007476176,0.00020891054,0.00009743756,0.00011225519,0.00014297848],"domain_scores_gemma":[0.99940526,0.00014879624,0.000066236644,0.00022499711,0.00006435459,0.000090356734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024332505,0.00010711528,0.00016975444,0.00006703248,0.00016730247,0.000103763254,0.00014276252,0.000023628474,0.000053384025],"category_scores_gemma":[0.000007918487,0.00009773825,0.00003817916,0.00015230791,0.000075292926,0.00034639076,0.0001390431,0.00024300447,0.000004802162],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011889312,0.000013502641,0.9801,0.0000016198312,0.000031386702,1.05316175e-7,0.0009593394,0.00039311821,0.00000942516,0.0102470545,0.00011284926,0.00813045],"study_design_scores_gemma":[0.00046985046,0.000059015874,0.87122023,0.00009843779,0.0001342597,9.867559e-7,0.02052202,0.009405664,0.00037310473,0.09180907,0.0053977333,0.00050964864],"about_ca_topic_score_codex":0.0022377695,"about_ca_topic_score_gemma":0.00027515198,"teacher_disagreement_score":0.10887976,"about_ca_system_score_codex":0.000018903436,"about_ca_system_score_gemma":0.000023123685,"threshold_uncertainty_score":0.39856502},"labels":[],"label_agreement":null},{"id":"W2186374666","doi":"","title":"WHAT DOES SOCIAL MEDIA SAY ABOUT THE INFRASTRUCTURE CONSTRUCTION PROJECT","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Sociotechnical system; Social media; Process (computing); Social network analysis; Profiling (computer programming); Public participation; Computer science; Stakeholder; Knowledge management; Business; Public relations; World Wide Web; Political science","score_opus":0.008335650494473512,"score_gpt":0.2528614365136833,"score_spread":0.2445257860192098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186374666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9137231,0.00011743353,0.018338365,0.00496757,0.0015034395,0.0014689303,0.000019100968,0.0005502309,0.059311815],"genre_scores_gemma":[0.9956454,0.000010914906,0.0022760283,0.00012824353,0.0013562815,0.0000946819,0.000033083055,0.000011704823,0.00044367072],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992358,0.000059961636,0.00018480139,0.00017573856,0.00014974504,0.00019396338],"domain_scores_gemma":[0.9995038,0.00008679657,0.000097726566,0.00019794481,0.00008946658,0.000024255418],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007853603,0.00013545947,0.00015752137,0.000043875116,0.00022934133,0.00037273057,0.00019962735,0.000039462488,0.00553384],"category_scores_gemma":[0.0000031225516,0.00006790936,0.00012681585,0.00020291988,0.00014541845,0.00040051856,0.000078846904,0.00017134023,0.00003827514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039611855,0.000025720097,0.017919563,0.000004219756,0.00019181789,1.307479e-7,0.0028023,0.0000065772383,0.00045036076,0.17834727,0.1280435,0.67220455],"study_design_scores_gemma":[0.00051251875,0.000023484146,0.071368076,0.000041257175,0.00019347601,0.0000029276375,0.037979957,0.0026231436,0.0046462486,0.7743408,0.107510805,0.0007572741],"about_ca_topic_score_codex":0.00033960427,"about_ca_topic_score_gemma":0.00008245766,"teacher_disagreement_score":0.6714473,"about_ca_system_score_codex":0.000016418551,"about_ca_system_score_gemma":0.0000331693,"threshold_uncertainty_score":0.9953752},"labels":[],"label_agreement":null},{"id":"W2190822848","doi":"10.1007/978-3-319-12188-8_10","title":"Latent Tunnel Based Information Propagation in Microblog Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Microblogging; Social media; Computer science; Data science; World Wide Web","score_opus":0.008376937978472878,"score_gpt":0.22436360323395654,"score_spread":0.21598666525548366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2190822848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008103722,0.00020790771,0.96998876,0.00023864214,0.00022933079,0.00077422627,0.000012229857,0.00011634096,0.028351525],"genre_scores_gemma":[0.99261665,0.00002104167,0.000955478,0.0005937837,0.0032496627,0.00008576877,0.0018907551,0.00008172023,0.0005051526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977413,0.00010911356,0.0009189487,0.00041783485,0.0002643503,0.0005484659],"domain_scores_gemma":[0.9985661,0.0002443847,0.00066026725,0.0003384491,0.0001309344,0.000059861424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044065947,0.00058190967,0.000820627,0.0003549605,0.00016852618,0.00012845932,0.00033212063,0.0008378256,0.00037965525],"category_scores_gemma":[0.000010135301,0.0006121966,0.00036930866,0.00028088808,0.000107232445,0.00012360327,0.000114422866,0.0016344766,0.000015375106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000550352,0.000031743926,0.003564171,0.000025182875,0.00008132808,0.0000022361016,0.00016060093,0.75307596,0.0000020051687,0.02316062,0.002067996,0.21777314],"study_design_scores_gemma":[0.0009419331,0.000058866804,0.0012898808,0.00054288976,0.00014719348,4.60784e-7,0.0000027081737,0.8912251,0.000014018275,0.07866701,0.02595479,0.0011551548],"about_ca_topic_score_codex":0.00017222582,"about_ca_topic_score_gemma":0.0004878545,"teacher_disagreement_score":0.9925356,"about_ca_system_score_codex":0.00026442832,"about_ca_system_score_gemma":0.00007405466,"threshold_uncertainty_score":0.99963295},"labels":[],"label_agreement":null},{"id":"W2196655855","doi":"10.1103/physreve.92.062807","title":"General and exact approach to percolation on random graphs","year":2015,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Canadian Institutes of Health Research","keywords":"Random graph; Percolation (cognitive psychology); Continuum percolation theory; Giant component; Statistical physics; Percolation threshold; Mathematics; Phase transition; Connected component; Discontinuity (linguistics); Combinatorics; Graph; Percolation critical exponents; Discrete mathematics; Critical exponent; Physics; Mathematical analysis","score_opus":0.035516383608068997,"score_gpt":0.32516223335321864,"score_spread":0.2896458497451496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196655855","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77455133,0.005001075,0.052425954,0.0010142346,0.00006201464,0.0022971835,0.000014871907,0.00020138685,0.16443197],"genre_scores_gemma":[0.99743986,0.00010667944,0.001511427,0.00038099271,0.00033909097,0.000114051705,0.000030262287,0.000010943912,0.00006672012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992687,0.00008348859,0.00013569323,0.00022222115,0.00016023146,0.00012968465],"domain_scores_gemma":[0.99950695,0.000039196642,0.00004514609,0.00021487586,0.000044939316,0.00014891171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018616824,0.00012364992,0.0003391805,0.000029020755,0.000035371762,0.000025624353,0.00008939453,0.0000071050613,0.000015959888],"category_scores_gemma":[0.000011638946,0.00009499817,0.00013120592,0.00022852463,0.00001573003,0.00005644947,0.000045379096,0.000085868385,0.000035085413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007639368,0.0010376384,0.005779296,0.0002030016,0.00017749464,4.7382446e-7,0.00034361318,0.00033737716,0.00067872653,0.5953045,0.06376181,0.3322997],"study_design_scores_gemma":[0.004653518,0.0009636046,0.014790981,0.0022497498,0.0013560747,0.0000028304487,0.00009923682,0.12427862,0.0010553754,0.51489645,0.3332588,0.002394711],"about_ca_topic_score_codex":0.000033607863,"about_ca_topic_score_gemma":3.3126165e-7,"teacher_disagreement_score":0.329905,"about_ca_system_score_codex":0.00001299545,"about_ca_system_score_gemma":0.000010493081,"threshold_uncertainty_score":0.3873913},"labels":[],"label_agreement":null},{"id":"W2199911684","doi":"","title":"Detecting Online Firestorms in Social Media","year":2015,"lang":"en","type":"article","venue":"ERef Bayreuth (University of Bayreuth)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Social media; Computer science; Detector; Internet privacy; Word of mouth; Information retrieval; Advertising; World Wide Web; Telecommunications; Business","score_opus":0.04504513868568905,"score_gpt":0.24911834930541962,"score_spread":0.20407321061973058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2199911684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9825474,0.00006540452,0.0037670238,0.00021639462,0.00010022399,0.000123941,0.000057484067,0.00010726254,0.013014891],"genre_scores_gemma":[0.9952282,0.0000029828159,0.0040289653,0.000012603668,0.00035014976,4.0298002e-7,0.00008653563,0.000018346796,0.0002718135],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.998715,0.00010110034,0.00022977861,0.0003179624,0.00029778236,0.0003384185],"domain_scores_gemma":[0.99910223,0.00010519054,0.00023502899,0.00028186303,0.00012776256,0.00014793398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033702177,0.00018833103,0.00042796068,0.0002881704,0.00016129359,0.000014942599,0.00047526308,0.00009040144,0.0004225166],"category_scores_gemma":[0.000014624871,0.00023109805,0.0001900906,0.0006709127,0.00013001828,0.00024111282,0.00028614287,0.0003273279,0.000030014548],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042882955,0.0016914489,0.31491718,0.00006260527,0.00054868736,0.000093050505,0.046832386,0.00042723207,0.000977704,0.021427194,0.019360308,0.59323335],"study_design_scores_gemma":[0.015113637,0.0006040124,0.4890804,0.00050152786,0.0008894792,0.000009269912,0.2139252,0.034896385,0.0013869489,0.11476642,0.12465897,0.0041677537],"about_ca_topic_score_codex":0.002159365,"about_ca_topic_score_gemma":0.0027187946,"teacher_disagreement_score":0.5890656,"about_ca_system_score_codex":0.00011820524,"about_ca_system_score_gemma":0.00010488189,"threshold_uncertainty_score":0.9423905},"labels":[],"label_agreement":null},{"id":"W2209513704","doi":"10.1371/journal.pone.0140133","title":"A Shadowing Problem in the Detection of Overlapping Communities: Lifting the Resolution Limit through a Cascading Procedure","year":2015,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Canadian Institutes of Health Research","keywords":"Limit (mathematics); Computer science; Process (computing); Function (biology); Community structure; Simple (philosophy); Network analysis; Data mining; Artificial intelligence; Machine learning; Algorithm; Mathematics; Physics; Biology; Statistics","score_opus":0.09545521358724761,"score_gpt":0.2651290527466789,"score_spread":0.1696738391594313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209513704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97978145,0.00023619956,0.009234036,0.00036441477,0.000007209151,0.0005623517,0.0000022225677,0.000059068618,0.0097530475],"genre_scores_gemma":[0.9972096,0.000005273614,0.0024080013,0.000052568554,0.00016367596,0.0001239876,0.000007402474,0.000012099706,0.000017353566],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897754,0.00021025079,0.00026962248,0.00009925043,0.00026063144,0.00018269524],"domain_scores_gemma":[0.99922687,0.00019305221,0.0001752078,0.0002939633,0.000096312484,0.000014619123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076800364,0.00009992076,0.00018675358,0.000051838953,0.00019534222,0.000052308667,0.0002734448,0.000027518698,0.0000062737795],"category_scores_gemma":[0.000024752595,0.00006891728,0.00006286217,0.00047029782,0.000043818876,0.00017554223,0.00009881221,0.0003170942,0.0000014607739],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023662542,0.005488076,0.29465574,0.0007856745,0.002348884,0.0000035763014,0.53157866,0.007029016,0.08533372,0.05022163,0.0008284703,0.021489933],"study_design_scores_gemma":[0.002132496,0.0007065967,0.00891284,0.0073336684,0.0012980145,0.0000079927495,0.2546377,0.5652075,0.0400461,0.116606615,0.0018937237,0.001216806],"about_ca_topic_score_codex":0.0026607173,"about_ca_topic_score_gemma":0.00041047277,"teacher_disagreement_score":0.5581784,"about_ca_system_score_codex":0.00005340903,"about_ca_system_score_gemma":0.00003230484,"threshold_uncertainty_score":0.40222266},"labels":[],"label_agreement":null},{"id":"W2212555590","doi":"","title":"Identifying important nodes in heterogenous networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Field (mathematics); Artificial intelligence; Machine learning; Set (abstract data type); Statistical model; Position paper; Statistical learning; Data modeling; Statistical relational learning; Data set; Data mining; Theoretical computer science; Relational database; Data science; World Wide Web; Database","score_opus":0.011812103720965826,"score_gpt":0.25254528049555436,"score_spread":0.24073317677458853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212555590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75028837,0.00016818003,0.23361674,0.000070302325,0.000043957825,0.00026773533,6.588144e-7,0.00013357446,0.015410509],"genre_scores_gemma":[0.9966509,0.0000056239223,0.002776062,0.00007245686,0.00013370416,0.00006816654,0.0000130988465,0.000013416098,0.00026661495],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913275,0.000023979957,0.00030556394,0.00018542253,0.00007864708,0.00027364283],"domain_scores_gemma":[0.99959236,0.000024757488,0.000068625304,0.00023787543,0.000027739115,0.00004864995],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000105482744,0.00011198888,0.00017403466,0.0000734428,0.00004718249,0.00009911908,0.00015294181,0.000022054019,0.0030582927],"category_scores_gemma":[6.7708e-7,0.00009886504,0.00009799012,0.00021253775,0.000017013761,0.00014083742,0.000080944395,0.00011407892,0.000057715937],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012277656,0.000093853814,0.9617321,0.00000214326,0.000058774218,0.0000023817522,0.00007606363,0.0017906066,0.00039659988,0.009446788,0.0033970962,0.023002382],"study_design_scores_gemma":[0.0007538904,0.000053260002,0.25306034,0.0000906537,0.000071212744,0.0000034660102,0.0008167652,0.5922968,0.004279016,0.14491758,0.0024562774,0.001200769],"about_ca_topic_score_codex":0.0034489557,"about_ca_topic_score_gemma":0.00013897767,"teacher_disagreement_score":0.70867175,"about_ca_system_score_codex":0.000016945574,"about_ca_system_score_gemma":0.0000071070776,"threshold_uncertainty_score":0.99785304},"labels":[],"label_agreement":null},{"id":"W2216197559","doi":"10.1007/978-3-7091-1797-2_4","title":"Global Structure in Social Networks with Directed Typed Edges","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Embedding; Analogy; Computer science; Theoretical computer science; Enhanced Data Rates for GSM Evolution; Random walk; Graph; Flow (mathematics); Algorithm; Artificial intelligence; Mathematics; Epistemology","score_opus":0.008202011631623317,"score_gpt":0.24484775630108613,"score_spread":0.2366457446694628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216197559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072535296,0.0017400241,0.849688,0.00039598285,0.000645246,0.0012896896,0.00015516109,0.000592529,0.14476801],"genre_scores_gemma":[0.9810823,0.000027433029,0.0008679046,0.0002810738,0.015238193,0.000038112918,0.0009880152,0.0001784754,0.001298494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967288,0.00018679211,0.00073999393,0.00095995876,0.0004289438,0.000955529],"domain_scores_gemma":[0.9984381,0.00026914704,0.0006141903,0.00041446026,0.0001639876,0.0001000972],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00020846394,0.0010260813,0.0016079837,0.0001900234,0.00038130712,0.00014716153,0.0005958318,0.0014243384,0.0007992302],"category_scores_gemma":[0.00000887527,0.0009701525,0.00044158637,0.0006557025,0.00031291664,0.000054299486,0.00023341148,0.0022041055,0.0000038997578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005454948,0.00010993972,0.03864889,0.000047833317,0.0012324561,0.00005092311,0.0005554248,0.24094479,0.0000015341394,0.11401863,0.021859126,0.58198494],"study_design_scores_gemma":[0.0037880566,0.00028494096,0.014924027,0.0011215151,0.0013354912,0.000007030798,0.000025624355,0.13922542,0.000007966142,0.7103661,0.12302683,0.005887013],"about_ca_topic_score_codex":0.0002878997,"about_ca_topic_score_gemma":0.0054211994,"teacher_disagreement_score":0.98035693,"about_ca_system_score_codex":0.00038614144,"about_ca_system_score_gemma":0.00012183021,"threshold_uncertainty_score":0.999872},"labels":[],"label_agreement":null},{"id":"W2227882607","doi":"10.1090/conm/588/11705","title":"Modularity maximization in networks by variable neighborhood search","year":2013,"lang":"en","type":"article","venue":"Contemporary mathematics - American Mathematical Society","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Heuristics; Maximization; Modularity (biology); Mathematics; Heuristic; Variable neighborhood search; Variable (mathematics); Cluster analysis; Mathematical optimization; Metaheuristic; Computer science; Algorithm; Statistics","score_opus":0.014824364263683859,"score_gpt":0.2519053774267214,"score_spread":0.23708101316303756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227882607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024534287,0.00008718336,0.93737996,0.0003063847,0.000018119492,0.000987134,0.00001864739,0.00019916001,0.036469147],"genre_scores_gemma":[0.89183795,0.000008579879,0.10686399,0.00018781617,0.0001004649,0.00027662786,0.00012260315,0.00006858516,0.000533387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729556,0.0001514488,0.0009683077,0.0005030723,0.00044791287,0.00063371065],"domain_scores_gemma":[0.99802613,0.00047727756,0.00036227898,0.0007402907,0.00015721198,0.00023682049],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00070436904,0.00041341322,0.0009359637,0.000061387305,0.00015133992,0.00021821901,0.0005232558,0.00010019796,0.0020970916],"category_scores_gemma":[0.000030250469,0.00037821307,0.00035016806,0.0010870217,0.00035253458,0.00038094056,0.0002633314,0.00053560437,0.00010637634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001940085,0.007872354,0.06550359,0.0006868067,0.0013846456,0.0000043306977,0.005538218,0.004208967,0.0018626222,0.69605035,0.20029388,0.016574847],"study_design_scores_gemma":[0.00032221535,0.0000450844,0.00020097458,0.00009076473,0.000031217194,8.3364193e-7,0.0016179746,0.7413797,0.00009787313,0.255629,0.00018476926,0.0003995907],"about_ca_topic_score_codex":0.0005920883,"about_ca_topic_score_gemma":7.841361e-7,"teacher_disagreement_score":0.86730367,"about_ca_system_score_codex":0.00009798529,"about_ca_system_score_gemma":0.000086505264,"threshold_uncertainty_score":0.99986696},"labels":[],"label_agreement":null},{"id":"W2232198868","doi":"10.1609/icwsm.v5i1.14182","title":"MODEC — Modeling and Detecting Evolutions of Communities","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International AAAI Conference on Web and Social Media","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Snapshot (computer storage); Data science; Computer science; Variety (cybernetics); Multitude; Evolving networks; Social network (sociolinguistics); Social network analysis; Biological network; Complex network; Data mining; Social media; Artificial intelligence; World Wide Web","score_opus":0.043269076361076436,"score_gpt":0.2695168491721134,"score_spread":0.22624777281103695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2232198868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98932636,0.000026695065,0.00023240472,0.0006279164,0.000042769272,0.00003101571,0.000019463096,0.000008671692,0.009684734],"genre_scores_gemma":[0.99941087,0.000026659238,0.0003904093,0.000016051757,0.000103594626,0.000006499679,0.0000038319404,0.000004009342,0.000038053506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995336,0.000006752147,0.00015801899,0.000074445925,0.0001630021,0.000064176056],"domain_scores_gemma":[0.9993111,0.0000745613,0.00011709428,0.00003138087,0.00045136397,0.000014486484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009995593,0.00006278207,0.00013323242,0.000039045488,0.00012170584,0.000036022244,0.0001665783,0.000021182552,0.00004421751],"category_scores_gemma":[0.00002663232,0.00005366091,0.000053566826,0.00006197295,0.00009613719,0.00006693774,0.00018091238,0.00012097257,1.0509161e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018198669,0.00007434698,0.02960909,0.000024798806,0.00015965893,4.246104e-8,0.0074579823,0.000043260177,0.016692203,0.9328978,0.00008321595,0.012939402],"study_design_scores_gemma":[0.00044367128,0.000023576291,0.0029430287,0.00034657394,0.00010073489,0.0000015431965,0.03183422,0.5507796,0.015376009,0.3977918,0.00014119166,0.00021807195],"about_ca_topic_score_codex":0.00008850781,"about_ca_topic_score_gemma":0.000050822386,"teacher_disagreement_score":0.5507363,"about_ca_system_score_codex":0.000009694024,"about_ca_system_score_gemma":0.000038487928,"threshold_uncertainty_score":0.21882284},"labels":[],"label_agreement":null},{"id":"W2234028576","doi":"10.1371/journal.pone.0146896","title":"Topological Vulnerability Evaluation Model Based on Fractal Dimension of Complex Networks","year":2016,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National High-tech Research and Development Program; Beihang University; State Key Laboratory of Virtual Reality Technology and Systems; National Natural Science Foundation of China","keywords":"Betweenness centrality; Vulnerability (computing); Computer science; Economic shortage; Complex network; Topology (electrical circuits); Vulnerability assessment; Fractal; Enhanced Data Rates for GSM Evolution; Dimension (graph theory); Fractal dimension; Space (punctuation); Artificial intelligence; Mathematics; Computer security; Medicine; Statistics","score_opus":0.08857512940227034,"score_gpt":0.3044661489148671,"score_spread":0.21589101951259676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234028576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7976128,0.000004274542,0.19880165,0.0003099963,0.00000601132,0.00026718754,0.000012546855,0.00004740961,0.002938147],"genre_scores_gemma":[0.99212384,7.3862645e-7,0.0075674215,0.000054731616,0.000113610404,0.000048324124,0.00004808071,0.000009490858,0.000033779972],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987268,0.00017426624,0.00026448703,0.00025441157,0.00041433057,0.00016570344],"domain_scores_gemma":[0.99898154,0.00024001246,0.00013651865,0.00039810064,0.00019437664,0.00004943769],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046915642,0.000119535536,0.00028299264,0.000044510718,0.00006224846,0.000007410827,0.00011942467,0.000044614364,0.0015015053],"category_scores_gemma":[0.00002847169,0.000081622195,0.00010895899,0.00010709727,0.00007400005,0.000049671107,0.00004984794,0.000100080426,0.0000075367066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069672556,0.020124996,0.30548257,0.00003954917,0.000794661,7.389004e-7,0.00007772381,0.24737525,0.21643068,0.038843717,0.002196432,0.16793695],"study_design_scores_gemma":[0.00035965565,0.00011558812,0.006096087,0.00006425892,0.00012133321,8.010972e-9,0.0000024584665,0.9634557,0.012276079,0.017401256,0.0000035430523,0.00010406623],"about_ca_topic_score_codex":0.00002314786,"about_ca_topic_score_gemma":0.0000023996276,"teacher_disagreement_score":0.7160804,"about_ca_system_score_codex":0.000048655555,"about_ca_system_score_gemma":0.000025557965,"threshold_uncertainty_score":0.9994113},"labels":[],"label_agreement":null},{"id":"W2236224384","doi":"10.48550/arxiv.0909.4370","title":"Rumors in a Network: Who's the Culprit?","year":2009,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Banff International Research Station for Mathematical Innovation and Discovery; National Science Foundation","keywords":"Centrality; Rumor; Estimator; Computer science; Network topology; Katz centrality; Network theory; Network science; Betweenness centrality; Complex network; Mathematics; Statistics; Computer network","score_opus":0.032603424884629154,"score_gpt":0.17967398897780595,"score_spread":0.14707056409317681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236224384","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88999015,0.00004953437,0.048663482,0.0003699835,0.000038957358,0.00023038062,0.0000020553744,0.00011678249,0.06053867],"genre_scores_gemma":[0.9978175,0.000010472859,0.00008281895,0.00013851705,0.00016639715,4.0807123e-7,0.0000050924527,0.0000063980497,0.0017723645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999183,0.000076935765,0.000117807984,0.00027510672,0.000038091544,0.00030905928],"domain_scores_gemma":[0.9994126,0.000049772938,0.00006930798,0.00038941382,0.000027164593,0.000051716866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016893045,0.00012725877,0.00016954244,0.00006732405,0.00013340308,0.00002995198,0.00038680484,0.000027984712,0.00025607154],"category_scores_gemma":[0.0000016346555,0.000113013884,0.00013649571,0.0008797703,0.000051031515,0.00012044958,0.00007615285,0.00019537688,0.00004298203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021028438,0.000092158254,0.16175407,8.281638e-7,0.00004180219,0.000027129037,0.00008521056,0.073031254,0.000009728788,0.7539032,0.0035561938,0.0074773817],"study_design_scores_gemma":[0.0008914607,0.00010078626,0.11219176,0.00006974756,0.00012921436,0.0000010135385,0.00045183644,0.25269744,0.000093969786,0.61151534,0.02124537,0.00061206607],"about_ca_topic_score_codex":0.00023554775,"about_ca_topic_score_gemma":0.00007675395,"teacher_disagreement_score":0.17966619,"about_ca_system_score_codex":0.000038976286,"about_ca_system_score_gemma":0.000019896444,"threshold_uncertainty_score":0.46085724},"labels":[],"label_agreement":null},{"id":"W2240570329","doi":"","title":"Social network analysis, Markov Chains and input-output models: combining tools to map and measure the circulation of currency in small economies.","year":2014,"lang":"en","type":"article","venue":"Journal of rural and community development","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Markov chain; Circulation (fluid dynamics); Currency; Measure (data warehouse); Equivalence (formal languages); Economics; Computer science; Liberian dollar; Input–output model; Econometrics; Economy; Mathematics; Macroeconomics; Statistics; Finance; Discrete mathematics; Data mining; Engineering","score_opus":0.03936225624782358,"score_gpt":0.2560585044550187,"score_spread":0.21669624820719513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240570329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97913635,0.00021450964,0.019926388,0.00038753785,0.00001645383,0.00008547684,0.0000011105009,0.0000033124354,0.0002288755],"genre_scores_gemma":[0.9980215,0.000025358342,0.0018211791,0.000043204724,0.0000646011,0.0000041695625,0.000007969702,0.0000042201063,0.000007812828],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988782,0.00037032217,0.00047413717,0.00005346885,0.000091759335,0.00013213365],"domain_scores_gemma":[0.9992484,0.00018380066,0.0003182297,0.0001064056,0.00008771935,0.000055473334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015791694,0.00011399877,0.00039127062,0.00013709247,0.00033953803,0.000069030306,0.00016461013,0.000027675114,0.0000048272013],"category_scores_gemma":[0.000006122949,0.000087165434,0.00006775243,0.00020217818,0.000045232562,0.00011010302,0.00019732138,0.00036519804,8.0453866e-8],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055606037,0.000119437624,0.35494408,0.000025806177,0.0007504968,1.70705e-7,0.013279505,0.0053018746,0.000015176127,0.0072131534,0.00017547607,0.61811924],"study_design_scores_gemma":[0.000696716,0.00009518949,0.9381098,0.00020763167,0.00027693418,0.0000023146188,0.0047232187,0.022622608,0.000019524923,0.03220452,0.0007756901,0.00026582438],"about_ca_topic_score_codex":0.00019619436,"about_ca_topic_score_gemma":0.00040006696,"teacher_disagreement_score":0.6178534,"about_ca_system_score_codex":0.000029705516,"about_ca_system_score_gemma":0.000036893474,"threshold_uncertainty_score":0.35545033},"labels":[],"label_agreement":null},{"id":"W2243575632","doi":"","title":"Bibliometric factor maps for knowledge discovery in digital libraries","year":2009,"lang":"en","type":"article","venue":"International Conference on Electronic Publishing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Digital library; Visualization; Information retrieval; Exploratory search; Field (mathematics); Citation; Domain (mathematical analysis); Co-citation; Data science; Information visualization; World Wide Web; Data mining","score_opus":0.036269693073406224,"score_gpt":0.3078835157846224,"score_spread":0.2716138227112162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243575632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4277057,0.00039173334,0.14125282,0.0073760427,0.0004621404,0.0007799248,0.0005848199,0.00033781354,0.421109],"genre_scores_gemma":[0.9975985,0.000010407845,0.00013676165,0.00008590158,0.00039398076,0.000041809606,0.0004891012,0.000012602937,0.0012309351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986414,0.000016239785,0.00029903324,0.00034199396,0.00025550407,0.00044583066],"domain_scores_gemma":[0.9992163,0.00021729045,0.0001329203,0.00017655276,0.00020527611,0.00005164565],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00016788059,0.00017733107,0.00020398793,0.007345821,0.000057840432,0.0048644757,0.0007546124,0.000048058635,0.00021978225],"category_scores_gemma":[0.00012711392,0.00017233557,0.00014050303,0.0061475295,0.00002293452,0.006184179,0.00007373243,0.00036190887,0.000007918387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032779477,0.00017189888,0.0060174637,0.0000011925245,0.00004594618,3.0737561e-7,0.000055842924,0.000011984832,0.00009808172,0.8524756,0.0027862692,0.13830264],"study_design_scores_gemma":[0.0006735385,0.00022639723,0.009358704,0.00006972092,0.000008439513,6.198551e-7,0.0001229226,0.009444387,0.0007368222,0.955636,0.023366712,0.00035572227],"about_ca_topic_score_codex":0.00003967104,"about_ca_topic_score_gemma":0.00002493271,"teacher_disagreement_score":0.56989276,"about_ca_system_score_codex":0.0001819941,"about_ca_system_score_gemma":0.0002869359,"threshold_uncertainty_score":0.99616855},"labels":[{"model":"gemma","categories":["bibliometrics"],"domain":null,"study_design":"not_applicable","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":["bibliometrics"],"domain":null,"study_design":"design_other","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W2244035215","doi":"10.1139/cjp-2013-0711","title":"Method to enhance traffic capacity for two-layer complex networks","year":2014,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Computer network; Topology (electrical circuits); Network packet; Routing (electronic design automation); Layer (electronics); Network layer; Path (computing); Betweenness centrality; Distributed computing; Shortest path problem; Routing protocol; Computer science; Physics; Theoretical computer science; Nanotechnology","score_opus":0.031132180931639813,"score_gpt":0.3148700697632076,"score_spread":0.28373788883156775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244035215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029327665,0.000015639569,0.96900904,0.00024449022,0.000114806164,0.0001652045,0.000024046614,0.000010185595,0.0010889105],"genre_scores_gemma":[0.8496449,1.3853175e-7,0.14751221,0.00031905662,0.0024226627,0.000009716673,0.000010556398,0.000026239735,0.000054487704],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987632,0.00011491425,0.00038619118,0.00017862205,0.0001200266,0.00043702516],"domain_scores_gemma":[0.9983241,0.00017657764,0.00028366005,0.0002469964,0.00034232085,0.0006263557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057197973,0.00018350132,0.00043532174,0.000106378844,0.00018157625,0.0000849645,0.0003843905,0.000029613815,0.00013356397],"category_scores_gemma":[0.000009709967,0.0001840651,0.0003306197,0.00030833617,0.000041523614,0.000107458894,0.000013701718,0.0002446272,0.000005981082],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012569538,0.000035901303,0.00076051743,0.0000066674834,0.00019782524,0.0000010186791,0.00025036032,0.18091328,0.0011397543,0.044331845,0.031909436,0.7404408],"study_design_scores_gemma":[0.0009712574,0.00052862265,0.0010254155,0.00015964216,0.00044418356,0.0000087256985,0.00012266425,0.4051604,0.012906848,0.07273229,0.50486267,0.0010772606],"about_ca_topic_score_codex":0.0015926703,"about_ca_topic_score_gemma":0.0030578093,"teacher_disagreement_score":0.82149684,"about_ca_system_score_codex":0.00008759042,"about_ca_system_score_gemma":0.00020789943,"threshold_uncertainty_score":0.7505956},"labels":[],"label_agreement":null},{"id":"W2251003032","doi":"10.1145/2740908.2742476","title":"Locally Adaptive Density Ratio for Detecting Novelty in Twitter Streams","year":2015,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Novelty; Key (lock); Kernel density estimation; Density estimation; Kernel (algebra); Function (biology); Probability density function; Data mining; Data stream mining; Artificial intelligence; Mathematics; Statistics","score_opus":0.04881225264044798,"score_gpt":0.292646202727436,"score_spread":0.24383395008698805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2251003032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3065831,0.0000030062938,0.68727416,0.00004655667,0.000017034616,0.00019213722,0.0000016719288,0.00004136384,0.005840948],"genre_scores_gemma":[0.97608286,4.470597e-8,0.023285681,0.000066978086,0.00017691344,0.000043240143,0.00001096659,0.000009937235,0.00032339126],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999335,0.000024674273,0.00018178565,0.00019101666,0.00008448996,0.0001830641],"domain_scores_gemma":[0.99952954,0.0000683559,0.00005970981,0.00016035812,0.00012496003,0.00005707089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022720103,0.000102622245,0.0001694962,0.00004957224,0.000036307163,0.000030567076,0.00009101665,0.000022938488,0.0000615539],"category_scores_gemma":[0.000007973098,0.0000922828,0.00007578367,0.00014386339,0.000016245773,0.00008000113,0.000057644455,0.00008585335,0.000008567473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032027307,0.000571331,0.57236755,0.000009806056,0.00033837662,0.0000039163906,0.001919919,0.0041129426,0.0021536474,0.0712283,0.020008419,0.32696554],"study_design_scores_gemma":[0.0033379772,0.00048642824,0.010544594,0.000066783774,0.00012317083,0.00000131508,0.004836112,0.75675124,0.070099205,0.1486613,0.00402044,0.0010714616],"about_ca_topic_score_codex":0.0012378672,"about_ca_topic_score_gemma":0.0008684911,"teacher_disagreement_score":0.7526383,"about_ca_system_score_codex":0.000047591886,"about_ca_system_score_gemma":0.00004587604,"threshold_uncertainty_score":0.3763183},"labels":[],"label_agreement":null},{"id":"W2255547463","doi":"10.19173/irrodl.v17i1.2110","title":"An Experimental Study of Satisfaction Response: Evaluation of Online Collaborative Learning","year":2016,"lang":"en","type":"article","venue":"The International Review of Research in Open and Distributed Learning","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Undergraduate Education; Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; University of International Business and Economics","keywords":"Collaborative learning; Beijing; Context (archaeology); Quality (philosophy); Psychology; Computer science; Online learning; Mathematics education; Knowledge management; Multimedia; China","score_opus":0.10257028117011732,"score_gpt":0.5122471512452272,"score_spread":0.4096768700751099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255547463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99680203,0.0015389301,0.00028538835,0.000336236,0.000009100245,0.00069219444,0.000037922346,0.0000033550143,0.00029486316],"genre_scores_gemma":[0.9990941,0.00065842713,0.000052283292,0.000002036622,0.000020302858,0.00007176667,0.000071980256,0.0000047401345,0.000024349845],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9957767,0.0027735876,0.00040335063,0.00015791052,0.0007964031,0.00009204067],"domain_scores_gemma":[0.9977625,0.00072540116,0.00030914982,0.00015841662,0.001019588,0.000024927083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00820699,0.00006478728,0.0002317903,0.00011969017,0.00007305227,0.00002467423,0.0003688668,0.0000122424335,0.00042990537],"category_scores_gemma":[0.00056277117,0.000041088926,0.000028491788,0.00045694335,0.00009863407,0.00018274132,0.00025335114,0.00019265484,5.4652463e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001028053,0.0015201494,0.83306634,0.000086097876,0.0002099101,6.062898e-7,0.0009820508,0.00088795595,0.027027555,0.0032270965,0.00023123703,0.13173294],"study_design_scores_gemma":[0.008180615,0.0055606877,0.78339714,0.017036723,0.00019883052,0.0000020654722,0.12795228,0.023747053,0.02489777,0.0048186984,0.0037937653,0.00041439148],"about_ca_topic_score_codex":0.0008839908,"about_ca_topic_score_gemma":0.000043234762,"teacher_disagreement_score":0.13131855,"about_ca_system_score_codex":0.00008267477,"about_ca_system_score_gemma":0.00015063868,"threshold_uncertainty_score":0.47071624},"labels":[],"label_agreement":null},{"id":"W2258784158","doi":"10.1038/srep21297","title":"Assortativity and leadership emerge from anti-preferential attachment in heterogeneous networks","year":2016,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Defense Threat Reduction Agency; Universidad Rey Juan Carlos; Office of Naval Research; Azrieli Foundation; Israel Science Foundation; Ministerio de Economía y Competitividad","keywords":"Assortativity; Heterogeneous network; Preferential attachment; Degree (music); Population; Cluster analysis; Connection (principal bundle); Visibility","score_opus":0.04467035021560236,"score_gpt":0.27552353656258693,"score_spread":0.23085318634698457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258784158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9765902,0.00019399627,0.021595184,0.000082664235,0.00094162265,0.00017203632,0.0000070183723,0.00005478247,0.0003624663],"genre_scores_gemma":[0.99882936,0.0000030922224,0.00022531017,0.0000071522754,0.00016918025,0.00002418025,0.00006600433,0.0000131719735,0.0006625218],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99804735,0.00009244892,0.00045399187,0.0007687315,0.00026323827,0.00037423318],"domain_scores_gemma":[0.9989329,0.00005716528,0.00024831377,0.0006155117,0.00004522318,0.00010087152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005738634,0.00016994774,0.00027312615,0.00011279128,0.00013453056,0.00015571355,0.00011418259,0.0000425669,0.000794016],"category_scores_gemma":[0.0000076025,0.00012811701,0.0001076104,0.00024847768,0.00015212492,0.00014451529,0.0001242978,0.000095802934,0.0000066633274],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050646004,0.00011447158,0.9647544,0.0000024542437,0.000069153946,0.000053979526,0.0000916293,0.00017574611,0.0066499896,0.00014521055,0.003979008,0.023958916],"study_design_scores_gemma":[0.0015618824,0.00010800968,0.66855097,0.00060642895,0.00033350458,0.000025735088,0.0002732057,0.0143537745,0.10041286,0.177199,0.034310143,0.0022644794],"about_ca_topic_score_codex":0.00032296972,"about_ca_topic_score_gemma":0.0002899706,"teacher_disagreement_score":0.2962034,"about_ca_system_score_codex":0.00003122759,"about_ca_system_score_gemma":0.000025493931,"threshold_uncertainty_score":0.86939186},"labels":[],"label_agreement":null},{"id":"W2262766865","doi":"","title":"Core decomposition spectra of large graphs and their applications in modelling","year":2008,"lang":"en","type":"article","venue":"international conference on Modelling and simulation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Modular decomposition; Clustering coefficient; Random graph; Cluster analysis; Vertex (graph theory); Computer science; Spectral clustering; Generalization; Core (optical fiber); Pathwidth; Null model; Theoretical computer science; Mathematics; Graph; Combinatorics; Line graph; Artificial intelligence","score_opus":0.0884296710595762,"score_gpt":0.34154708465373135,"score_spread":0.2531174135941551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2262766865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4743824,0.000013292887,0.5246277,0.000014267916,0.000005297082,0.00006349653,0.000011157644,0.000010454873,0.0008719392],"genre_scores_gemma":[0.99687314,0.00005586999,0.0028895338,0.000006759991,0.000027072685,0.000012441112,0.00011332605,0.0000057398174,0.000016124135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943846,0.000014432334,0.0002060524,0.00017324847,0.00009074781,0.00007708094],"domain_scores_gemma":[0.99962527,0.00007653665,0.00008989897,0.00007921238,0.00010563456,0.00002342828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008016496,0.00008986147,0.00012467262,0.00015030777,0.00007569383,0.000016188862,0.000059990274,0.00002571751,0.000027333039],"category_scores_gemma":[5.5884965e-7,0.000084866566,0.00003510841,0.000081051454,0.000030169764,0.00008730278,0.000016545753,0.00008793843,4.2077764e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012653175,0.000052913518,0.01081761,0.0000017920619,0.0000135809505,8.4825395e-8,0.0003028729,0.77431834,0.00011901748,0.21367608,6.360982e-7,0.0006844496],"study_design_scores_gemma":[0.00014380092,0.000012735961,0.00033940512,0.000027244045,0.0000039831393,2.0721338e-7,0.00007113077,0.82726705,0.00021244372,0.17184289,0.000016368756,0.00006275335],"about_ca_topic_score_codex":0.0001040265,"about_ca_topic_score_gemma":0.000005805315,"teacher_disagreement_score":0.52249074,"about_ca_system_score_codex":0.0000106436555,"about_ca_system_score_gemma":0.000010288029,"threshold_uncertainty_score":0.3460758},"labels":[],"label_agreement":null},{"id":"W2263890399","doi":"10.1145/2808797.2809310","title":"Spectral Embedding of Directed Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Betweenness centrality; Embedding; Directed graph; Computer science; Node (physics); Theoretical computer science; Strengths and weaknesses; Enhanced Data Rates for GSM Evolution; Property (philosophy); Mathematics; Artificial intelligence; Algorithm; Combinatorics; Engineering; Epistemology","score_opus":0.019419666244014845,"score_gpt":0.28543115153271437,"score_spread":0.2660114852886995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263890399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18016312,0.000060686823,0.5692179,0.000036106554,0.00006448367,0.00009646381,0.0000016015764,0.00027340697,0.25008622],"genre_scores_gemma":[0.9894013,4.8780504e-7,0.009677367,0.000007994842,0.00025301636,0.0000038423264,0.00001246105,0.000007672306,0.00063588604],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949586,0.000022677546,0.00015597619,0.000101575715,0.00008570618,0.0001382291],"domain_scores_gemma":[0.99962056,0.00002344496,0.000061028073,0.00016804521,0.00006402976,0.00006292086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001079381,0.00007114297,0.00015759097,0.0000382479,0.000016193937,0.000012195851,0.00010286017,0.000014081861,0.00060135784],"category_scores_gemma":[0.0000021106284,0.00006223737,0.000080431055,0.00021379197,0.000020204998,0.000044041215,0.000045584686,0.00006136232,0.0000057338234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003778052,0.00030878896,0.5651873,0.000004159281,0.0004277591,0.0000018506772,0.00032081266,0.061541833,0.0004352624,0.1937735,0.14463909,0.033321917],"study_design_scores_gemma":[0.00037611253,0.0000598761,0.004222696,0.000018737706,0.000069001195,4.3387715e-7,0.00024350184,0.9585754,0.004426916,0.026429128,0.0053074798,0.00027067974],"about_ca_topic_score_codex":0.00028426104,"about_ca_topic_score_gemma":0.000009289846,"teacher_disagreement_score":0.89703363,"about_ca_system_score_codex":0.000010678761,"about_ca_system_score_gemma":0.000015224061,"threshold_uncertainty_score":0.6584447},"labels":[],"label_agreement":null},{"id":"W2264085712","doi":"10.1609/icwsm.v9i4.14686","title":"Everyone's Invited: A New Paradigm for Evaluation on Non-Transferable Datasets","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International AAAI Conference on Web and Social Media","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Data science; Social media; Process (computing); Context (archaeology); Task (project management); Geolocation; Computational sociology; Resource (disambiguation); Analytics; Scale (ratio); World Wide Web","score_opus":0.03986226007874676,"score_gpt":0.3032576873639515,"score_spread":0.2633954272852047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2264085712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9688864,0.000031751715,0.00051275466,0.015839195,0.00040401643,0.00051888113,0.0005603116,0.000026691761,0.013220043],"genre_scores_gemma":[0.99855524,0.000012222913,0.00020448772,0.00028870214,0.0005080142,0.000052198073,0.0002073869,0.0000074970935,0.00016426342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990951,0.00000770226,0.00018367951,0.0002096171,0.00039300535,0.000110907706],"domain_scores_gemma":[0.9993495,0.0001113322,0.00011882525,0.000054574888,0.0003302286,0.00003557135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020914196,0.00010640445,0.00016475114,0.00004873472,0.000103661616,0.00009036195,0.00026483045,0.000035473353,0.00020633158],"category_scores_gemma":[0.000058409674,0.00008807454,0.000097331176,0.000097233904,0.000041279087,0.000104864564,0.000058653957,0.0001147811,0.0000016207144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002442155,0.00035943917,0.007679509,0.00003781647,0.0004580642,2.0158055e-7,0.002895527,0.000011515394,0.022584079,0.7705868,0.13018686,0.064955994],"study_design_scores_gemma":[0.004079371,0.00017222403,0.014422895,0.0005510966,0.00043690106,0.0000011431462,0.0019461607,0.03857504,0.08404036,0.80585146,0.04928118,0.00064219197],"about_ca_topic_score_codex":0.00002674664,"about_ca_topic_score_gemma":0.000023944402,"teacher_disagreement_score":0.080905676,"about_ca_system_score_codex":0.000029900786,"about_ca_system_score_gemma":0.00012686884,"threshold_uncertainty_score":0.35915756},"labels":[],"label_agreement":null},{"id":"W2264380204","doi":"10.4230/lipics.approx-random.2014.857","title":"It’s a Small World for Random Surfers","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"PageRank; Logarithm; Upper and lower bounds; Random graph; Graph; Combinatorics; Computer science; Tree (set theory); Mathematics; Selection (genetic algorithm); Discrete mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.01649037442209622,"score_gpt":0.26245746898906425,"score_spread":0.24596709456696803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2264380204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025804872,0.000014770671,0.931354,0.0008973002,0.00047336024,0.0024674844,0.0005887078,0.00030334966,0.03809617],"genre_scores_gemma":[0.95639783,0.0000038733674,0.035697717,0.0018245162,0.0008588342,0.0008165507,0.0017646545,0.00009725182,0.002538781],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973125,0.00005009837,0.0012084765,0.0002979016,0.0002722392,0.00085879193],"domain_scores_gemma":[0.99769074,0.00050496944,0.00052632333,0.0007515641,0.00031018618,0.00021621282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094290246,0.00047292755,0.000771296,0.00032764007,0.00038497898,0.00031568852,0.00070342846,0.00009720902,0.00020755483],"category_scores_gemma":[0.00003882764,0.00043270036,0.0007807699,0.00034639012,0.00010072057,0.00042985508,0.0001997084,0.0003045798,0.00006771595],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019188061,0.0015466658,0.07169228,0.0012411898,0.0030586543,0.0000010175007,0.009371878,0.0013946926,0.00015585798,0.20328099,0.49734634,0.20899165],"study_design_scores_gemma":[0.0063472283,0.00017046585,0.00015147045,0.00012573815,0.00021153844,0.0000014331855,0.00046466006,0.09991626,0.00080634124,0.008922896,0.8822104,0.000671583],"about_ca_topic_score_codex":0.00005378466,"about_ca_topic_score_gemma":0.00014369935,"teacher_disagreement_score":0.93059295,"about_ca_system_score_codex":0.0000704037,"about_ca_system_score_gemma":0.000048869213,"threshold_uncertainty_score":0.9998125},"labels":[],"label_agreement":null},{"id":"W2267182525","doi":"","title":"Distance in the Forest Fire Model - How far are you from {Eve}?","year":2016,"lang":"en","type":"article","venue":"MPG.PuRe (Max Planck Society)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bounded function; Generative model; Power law; Property (philosophy); Graph; Resizing; Degree (music); Computer science; Random walk; Generative grammar; Statistical physics; Mathematics; Physics; Theoretical computer science; Artificial intelligence; Mathematical analysis; Economics","score_opus":0.01366068260122354,"score_gpt":0.22240476025940534,"score_spread":0.2087440776581818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267182525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7141569,0.0008197639,0.26458344,0.011224688,0.00013341295,0.0007018705,0.0009044843,0.0002999451,0.0071754535],"genre_scores_gemma":[0.99627787,0.000036218982,0.0012993295,0.00036988364,0.00058891723,0.00010564786,0.00013899403,0.000032591615,0.0011505338],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853873,0.00006308631,0.00023316215,0.00044310847,0.00029060445,0.000431307],"domain_scores_gemma":[0.99885947,0.00017846368,0.0001887677,0.0006686279,0.000045172295,0.00005949063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016792693,0.00028403252,0.00035308412,0.000019414345,0.00017426467,0.00011125705,0.00062743865,0.00010073594,0.00012582744],"category_scores_gemma":[0.0000061511596,0.00017520497,0.00038400202,0.00029207004,0.00009147557,0.0001892025,0.00010684776,0.00028125854,0.000020853902],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020190964,0.00018608512,0.6787768,0.0000120573695,0.00021818491,0.0000059968165,0.0015122072,0.0004919475,0.00036116331,0.022382794,0.28766966,0.008362892],"study_design_scores_gemma":[0.0028448515,0.00006959935,0.1344132,0.00060577074,0.00032489203,0.0000014706045,0.0042918003,0.1760649,0.00036573946,0.38733855,0.2915882,0.0020910578],"about_ca_topic_score_codex":0.00017754683,"about_ca_topic_score_gemma":0.0003503514,"teacher_disagreement_score":0.5443636,"about_ca_system_score_codex":0.000065015614,"about_ca_system_score_gemma":0.000036152618,"threshold_uncertainty_score":0.71446514},"labels":[],"label_agreement":null},{"id":"W2267902091","doi":"10.1609/aaai.v29i1.9163","title":"A New Granger Causal Model for Influence Evolution in Dynamic Social Networks: The Case of DBLP","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Interpretability; Granger causality; Computer science; Causality (physics); Social network (sociolinguistics); Multigraph; Econometrics; Data science; Data mining; Artificial intelligence; Machine learning; Theoretical computer science; Social media; Mathematics; World Wide Web","score_opus":0.06854819209006671,"score_gpt":0.3311819870115975,"score_spread":0.2626337949215308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267902091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59079343,0.00003070483,0.4065244,0.00076448417,0.00006349148,0.00072931405,0.00001654654,0.00002902915,0.0010486197],"genre_scores_gemma":[0.99852395,0.0000023316763,0.0011690272,0.00001888358,0.00010606074,0.00006623197,0.000001444118,0.000013562408,0.000098490535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869365,0.000019008736,0.00053714926,0.00026425192,0.00018586326,0.0003000574],"domain_scores_gemma":[0.9986322,0.00008909795,0.00042445573,0.00016290694,0.0006336998,0.00005766413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005992272,0.00018105935,0.00029045562,0.00009072826,0.0001400503,0.000057020763,0.000614259,0.000060406135,0.000017486576],"category_scores_gemma":[0.000087833316,0.00012706814,0.00015997839,0.0005539078,0.00021312821,0.00016493945,0.00016216772,0.00023521182,0.000002089298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002010643,0.00014581694,0.0014025605,0.000015802927,0.000039253944,3.5173468e-7,0.0024361538,0.03701398,0.0027560606,0.9141153,0.00061675435,0.041256912],"study_design_scores_gemma":[0.000029600556,0.00004325287,0.00009720571,0.000060211147,0.000027889775,0.0000011196558,0.0009178809,0.63865477,0.0030713605,0.3569996,0.0000033206438,0.000093776485],"about_ca_topic_score_codex":0.0017635368,"about_ca_topic_score_gemma":0.0004235369,"teacher_disagreement_score":0.6016408,"about_ca_system_score_codex":0.000071166585,"about_ca_system_score_gemma":0.0001733816,"threshold_uncertainty_score":0.5181688},"labels":[],"label_agreement":null},{"id":"W2271333017","doi":"10.1371/journal.pone.0143633","title":"Qualities and Inequalities in Online Social Networks through the Lens of the Generalized Friendship Paradox","year":2016,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Friendship; Hierarchy; Inequality; Social network (sociolinguistics); Phenomenon; Social psychology; Psychology; Sociology; Mathematics; Computer science; Social media; Epistemology; World Wide Web; Political science","score_opus":0.093028126133299,"score_gpt":0.28137528733959233,"score_spread":0.18834716120629333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2271333017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941072,0.00021143387,0.0013327216,0.0028856786,0.000013347529,0.00016448706,0.00006150328,0.000024268982,0.0011993622],"genre_scores_gemma":[0.99860555,0.000049697028,0.00044039777,0.00012264137,0.00044025882,0.00003559811,0.000010313635,0.000012731738,0.00028281927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887824,0.00026717858,0.0003212623,0.00014224005,0.00018938542,0.00020166798],"domain_scores_gemma":[0.99923074,0.00028368674,0.00016386028,0.0002621075,0.000047762027,0.00001182508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020996574,0.00012085945,0.00030689582,0.000021588776,0.00011404705,0.000019014507,0.00022204517,0.00003424257,0.000117110685],"category_scores_gemma":[0.0000122523115,0.000060371043,0.00009331225,0.00016611596,0.0002249895,0.00008859703,0.00014488866,0.000120133765,5.5748643e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051028204,0.00083061605,0.12897848,0.000028999171,0.00053498254,1.837349e-7,0.0055731786,0.000030125428,0.0017463557,0.8586491,0.0007228148,0.0028541926],"study_design_scores_gemma":[0.0033360189,0.00016264725,0.09960988,0.0010629379,0.0008175891,3.9050747e-7,0.009568446,0.004174459,0.016852807,0.8597136,0.0036053131,0.0010959203],"about_ca_topic_score_codex":0.00074270746,"about_ca_topic_score_gemma":0.00024590833,"teacher_disagreement_score":0.029368589,"about_ca_system_score_codex":0.00001426462,"about_ca_system_score_gemma":0.000018239956,"threshold_uncertainty_score":0.24618596},"labels":[],"label_agreement":null},{"id":"W2273727572","doi":"10.5539/ijef.v8n2p179","title":"Co-Movement in Stock Markets Based on Directed Complex Network","year":2016,"lang":"en","type":"article","venue":"International Journal of Economics and Finance","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Degree distribution; Stock (firearms); Clustering coefficient; Stock exchange; Stock market; Average path length; Cluster analysis; Complex network; Econometrics; Computer science; Economics; Mathematics; Statistics; Combinatorics; Graph; Geography; Shortest path problem; Finance","score_opus":0.013471075113422472,"score_gpt":0.2558183218204301,"score_spread":0.2423472467070076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273727572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9866462,0.000043307475,0.0056718523,0.002025196,0.00021532782,0.00007225508,0.000040456616,0.0000050680014,0.0052803545],"genre_scores_gemma":[0.9973895,0.0001764726,0.0017316808,0.0002410347,0.00036993,0.0000034793347,0.000004578346,0.0000066767507,0.000076654665],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993505,0.00002229686,0.00035678508,0.00010678048,0.000056721427,0.000106956475],"domain_scores_gemma":[0.99937195,0.00011919768,0.00033062216,0.00007952399,0.00007595562,0.000022782828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022419565,0.000083575746,0.00017741426,0.00009965384,0.000020558284,0.0000317418,0.00019376457,0.000015300655,0.00017010464],"category_scores_gemma":[0.000004205671,0.00006592383,0.00007744503,0.000033534325,0.00002636891,0.000081203085,0.000020958312,0.000066174136,0.0000021715448],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072320225,0.00039628768,0.38966426,0.000001907952,0.00031668798,0.000019368379,0.000035326255,0.03927369,0.00017571442,0.1411087,0.017882949,0.41040188],"study_design_scores_gemma":[0.003584508,0.00023288719,0.48767096,0.00039981303,0.000019165273,0.0000039153906,0.000009449797,0.23726536,0.0006415053,0.09754771,0.17223236,0.00039237348],"about_ca_topic_score_codex":0.00001535115,"about_ca_topic_score_gemma":0.00001452492,"teacher_disagreement_score":0.4100095,"about_ca_system_score_codex":0.00007194575,"about_ca_system_score_gemma":0.00003185431,"threshold_uncertainty_score":0.26882958},"labels":[],"label_agreement":null},{"id":"W2277726991","doi":"10.1007/978-3-319-25660-3_13","title":"Evaluation of Community Mining Algorithms in the Presence of Attributes","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Variety (cybernetics); Cluster analysis; Data mining; Focus (optics); Point (geometry); Data science; Ground truth; Machine learning; Information retrieval; Artificial intelligence; Mathematics","score_opus":0.09704232291428187,"score_gpt":0.34014078057350666,"score_spread":0.24309845765922478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277726991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013019143,0.000383395,0.98139346,0.000098296485,0.000105017614,0.00042947702,0.000016447015,0.00001166428,0.0045431294],"genre_scores_gemma":[0.97745734,0.0000018444032,0.022351423,0.000021240388,0.00012390957,0.000009549276,0.000017106511,0.0000077505165,0.000009805867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755985,0.00032411568,0.00043228836,0.00023670353,0.0012560239,0.00019104598],"domain_scores_gemma":[0.9971057,0.00092950166,0.0003780435,0.0008048855,0.00075653126,0.000025294321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007359037,0.00018866503,0.00038891434,0.00029934576,0.00007688956,0.000036948426,0.0014307596,0.00006796636,0.000035499117],"category_scores_gemma":[0.00009222225,0.00014466677,0.000085667714,0.00047910216,0.00052108767,0.00010380362,0.0004386442,0.00052792573,5.426804e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002917768,0.000077237186,0.002206635,0.000013987097,0.000025212175,4.418369e-7,0.0035323459,0.07590341,0.00005333524,0.0030864559,0.00007834834,0.9150197],"study_design_scores_gemma":[0.00021993792,0.00011210501,0.0013736802,0.00038227224,0.00007585015,0.00000108536,0.000012969663,0.56158876,0.0010745089,0.43481264,0.00012732446,0.00021885778],"about_ca_topic_score_codex":0.0004418458,"about_ca_topic_score_gemma":0.00019001961,"teacher_disagreement_score":0.9644382,"about_ca_system_score_codex":0.00008769063,"about_ca_system_score_gemma":0.00033934804,"threshold_uncertainty_score":0.58993393},"labels":[],"label_agreement":null},{"id":"W2278598945","doi":"10.1103/physreve.93.032304","title":"Constrained growth of complex scale-independent systems","year":2016,"lang":"en","type":"preprint","venue":"Physical review. E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; James S. McDonnell Foundation","keywords":"Independence (probability theory); Preferential attachment; Scaling; Scale (ratio); Computer science; Dynamical systems theory; Statistical physics; Conjecture; Snapshot (computer storage); Mathematics; Complex network; Geography; Physics; Statistics","score_opus":0.02675638196902702,"score_gpt":0.340039493611877,"score_spread":0.31328311164285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278598945","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13527052,0.03395401,0.3727452,0.0038999496,0.0016701834,0.014015094,0.0042547625,0.0013383026,0.432852],"genre_scores_gemma":[0.99713373,0.00062808825,0.0003182421,0.000051654893,0.0012023859,0.00027297353,0.00023598691,0.000047142952,0.000109820765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997182,0.00027818664,0.0009168683,0.00067725603,0.00056432345,0.00038136015],"domain_scores_gemma":[0.99720997,0.00021211097,0.0009561614,0.0010688438,0.00038492327,0.00016799805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035126475,0.0005126567,0.0019955223,0.00007959349,0.000051337298,0.000043351836,0.00081228133,0.000066349276,0.0003703012],"category_scores_gemma":[0.000017022287,0.00038648618,0.0011163146,0.00019866221,0.00020378573,0.000050445517,0.0008763888,0.0004970053,0.00008133007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031101208,0.001755857,0.015578633,0.012963733,0.0023988315,0.0000060795232,0.00011630719,0.000055930428,0.009993479,0.8632848,0.051307995,0.042507205],"study_design_scores_gemma":[0.0011962606,0.00020502729,0.0035774328,0.04432631,0.0036230495,0.000004599721,0.000045659992,0.012671658,0.0066225515,0.906214,0.018482745,0.00303069],"about_ca_topic_score_codex":0.00022529098,"about_ca_topic_score_gemma":0.0000016357802,"teacher_disagreement_score":0.8618632,"about_ca_system_score_codex":0.00006104843,"about_ca_system_score_gemma":0.000119512566,"threshold_uncertainty_score":0.9998587},"labels":[],"label_agreement":null},{"id":"W2280515390","doi":"10.1109/icdmw.2015.214","title":"Temporal Topic Inference for Trend Prediction","year":2015,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Predictability; Inference; Social media; Leverage (statistics); Vocabulary; Microblogging; Machine learning; Artificial intelligence; Hidden Markov model; Novelty; Topic model; Crowds; Data mining; Data science","score_opus":0.045373080411128246,"score_gpt":0.3168395138004439,"score_spread":0.27146643338931564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280515390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07214175,0.000013850162,0.8366444,0.00016971788,0.000092228314,0.00020796515,0.000023597864,0.00018506795,0.090521425],"genre_scores_gemma":[0.9898932,1.3547806e-7,0.0068279454,0.000015858815,0.00032289536,0.000046173598,0.00009294232,0.0000040102927,0.0027968525],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965066,0.000008361227,0.000101109785,0.000097016804,0.00005495741,0.00008789706],"domain_scores_gemma":[0.99974996,0.000020254958,0.000028917992,0.000117678974,0.000036793554,0.000046381465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000712425,0.0000524559,0.00007892917,0.00002752901,0.000025796915,0.000021868855,0.00006260392,0.000012097849,0.0002317489],"category_scores_gemma":[0.0000025768952,0.00004451693,0.000050924005,0.00006964406,0.000009473903,0.00006475473,0.000021450747,0.000027904782,0.0000070377387],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013180104,0.00010037548,0.63532823,0.0000031840716,0.00006980294,1.007818e-7,0.00015973467,0.00010143996,0.00006717715,0.1726399,0.10398422,0.08753264],"study_design_scores_gemma":[0.0013593179,0.00036524254,0.010643246,0.000017685174,0.000110043606,2.927952e-7,0.00047961663,0.08274296,0.0030621986,0.37246293,0.5283536,0.00040289515],"about_ca_topic_score_codex":0.00015183621,"about_ca_topic_score_gemma":0.000040890383,"teacher_disagreement_score":0.91775143,"about_ca_system_score_codex":0.000010813362,"about_ca_system_score_gemma":0.000019387007,"threshold_uncertainty_score":0.2537488},"labels":[],"label_agreement":null},{"id":"W2280952051","doi":"10.1007/978-3-319-20916-6_39","title":"Trust-Based Individualization for Persuasive Presentation Builder","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Presentation (obstetrics); Personalization; Trustworthiness; Computer science; Face (sociological concept); Advice (programming); Content (measure theory); Multimedia; World Wide Web; Internet privacy; Psychology; Sociology; Medicine","score_opus":0.030936495857346813,"score_gpt":0.30787143241349296,"score_spread":0.27693493655614615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280952051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009404416,0.00009000793,0.99632674,0.00015236637,0.0002227686,0.0006145567,0.000031077005,0.000059439983,0.0024089662],"genre_scores_gemma":[0.661483,0.0000022642491,0.3345481,0.0003920093,0.0020041927,0.00010983437,0.00060275913,0.000078539975,0.0007793345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982688,0.000019569843,0.00029671704,0.00064558577,0.00048580448,0.00028356924],"domain_scores_gemma":[0.9986096,0.0002161391,0.00026268922,0.0004217005,0.00041356593,0.00007628389],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039231256,0.00028351057,0.00031821473,0.0004347729,0.00013754751,0.00017941643,0.00056613254,0.00010947648,0.00010893865],"category_scores_gemma":[0.000019063787,0.00027412546,0.00013749152,0.00026980444,0.00022863221,0.00015188359,0.00015011772,0.00021901037,0.000004630997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023590828,0.00006571188,0.0025920258,0.000036323978,0.00006601715,0.0000018357118,0.000710531,0.2316603,0.000053574022,0.04919723,0.0011004024,0.71449244],"study_design_scores_gemma":[0.00040422208,0.00011365776,0.000066230576,0.00012634434,0.00005952503,4.684626e-7,7.725402e-7,0.5912152,0.0010168583,0.39992574,0.006637744,0.00043322917],"about_ca_topic_score_codex":0.0000384171,"about_ca_topic_score_gemma":0.00002304641,"teacher_disagreement_score":0.71405923,"about_ca_system_score_codex":0.00014343197,"about_ca_system_score_gemma":0.00035270088,"threshold_uncertainty_score":0.9999711},"labels":[],"label_agreement":null},{"id":"W2281598407","doi":"10.1109/ssp.2016.7551716","title":"Bayesian inference of diffusion networks with unknown infection times","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Inference; Diffusion; Bayesian probability; Computer science; Bayesian inference; Hidden variable theory; Bayesian network; Econometrics; Statistical physics; Data mining; Artificial intelligence; Algorithm; Machine learning; Mathematics; Physics","score_opus":0.007603065276787401,"score_gpt":0.2563720242131654,"score_spread":0.24876895893637802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281598407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020860493,0.000023439292,0.9167295,0.0000499648,0.00006377497,0.000262247,0.0000070041774,0.00013991681,0.061863642],"genre_scores_gemma":[0.99529743,0.000027227172,0.002722143,0.000007971209,0.0003949149,0.000057888465,0.00009453426,0.000027213024,0.0013706487],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987718,0.00006845421,0.00035971485,0.00040143428,0.00017933284,0.00021925446],"domain_scores_gemma":[0.99862605,0.00009097941,0.0004084155,0.00063919794,0.00017122265,0.00006412688],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011644555,0.0003031651,0.0004872018,0.00013585361,0.000056947894,0.000045007077,0.00022648435,0.00012912462,0.001988982],"category_scores_gemma":[0.000002201793,0.0001975482,0.00019987988,0.00016651038,0.00008049389,0.00005957824,0.0005875824,0.00033897057,0.0000050699728],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054931807,0.0003489844,0.7199347,0.000069199006,0.0007198922,8.286329e-7,0.00006539878,0.0143362405,0.00015372619,0.11315016,0.0037123943,0.14745353],"study_design_scores_gemma":[0.0014969264,0.0005524207,0.061004408,0.0041546416,0.001212008,0.0000013989056,0.000031074076,0.46854618,0.006535688,0.4411491,0.012324926,0.0029912377],"about_ca_topic_score_codex":0.0011929005,"about_ca_topic_score_gemma":0.00012386196,"teacher_disagreement_score":0.97443694,"about_ca_system_score_codex":0.000029810322,"about_ca_system_score_gemma":0.000074485506,"threshold_uncertainty_score":0.99892336},"labels":[],"label_agreement":null},{"id":"W2282180493","doi":"10.1145/2835776.2855089","title":"Temporal Formation and Evolution of Online Communities","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Causation; Causality (physics); Granger causality; Computer science; Identification (biology); Data science; Online community; Series (stratigraphy); Epistemology; Machine learning; World Wide Web; Ecology","score_opus":0.015547679314800136,"score_gpt":0.25525831237242297,"score_spread":0.23971063305762283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282180493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6698028,0.00001570193,0.32706684,0.000106833424,0.0000033787232,0.000031269465,0.000010516008,0.000021865844,0.0029407907],"genre_scores_gemma":[0.9973469,0.0000024791766,0.0024232424,0.0000032930448,0.000026830041,0.000002015551,0.000018775998,0.0000019219626,0.00017457159],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978495,0.000017466285,0.00009934559,0.000023258624,0.000034145996,0.00004081642],"domain_scores_gemma":[0.9997945,0.000025471101,0.000047416117,0.0000898349,0.00003321307,0.000009584757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000450186,0.000031891945,0.000063091866,0.00003421672,0.000023839842,0.0000037217494,0.00003705754,0.0000065504364,0.00017048356],"category_scores_gemma":[4.0074372e-7,0.00002006866,0.000020912194,0.000037682203,0.00003123412,0.00011610744,0.00003329037,0.000014665693,0.0000010270496],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065815198,0.00007563392,0.676058,0.0000063405487,0.00003077944,1.4183085e-8,0.00016786136,0.0000016288735,0.0031051496,0.19667667,0.0014265734,0.122444786],"study_design_scores_gemma":[0.0019144034,0.00033878442,0.42991772,0.00035794446,0.0001431979,0.000001821716,0.01062817,0.033115733,0.03148667,0.47552875,0.015900563,0.0006662344],"about_ca_topic_score_codex":0.0008893035,"about_ca_topic_score_gemma":0.00018941553,"teacher_disagreement_score":0.32754406,"about_ca_system_score_codex":0.000008579072,"about_ca_system_score_gemma":0.0000048987563,"threshold_uncertainty_score":0.18666755},"labels":[],"label_agreement":null},{"id":"W2284361950","doi":"10.1109/sitis.2015.27","title":"Network Disintegration in Criminal Network","year":2015,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Centrality; Computer science; Node (physics); Computer network; Slowness; Key (lock); Betweenness centrality; Identification (biology); Distributed computing; Computer security; Topology (electrical circuits); Engineering; Mathematics","score_opus":0.035363691803496404,"score_gpt":0.2869572049634579,"score_spread":0.2515935131599615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284361950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090414956,0.0001634301,0.5597907,0.00036806776,0.00023362266,0.00028041744,0.0000013538933,0.00020822878,0.34853923],"genre_scores_gemma":[0.9860111,5.998329e-7,0.011706466,0.00010960136,0.0014147101,0.000022942906,0.00004177572,0.0000105553845,0.0006822569],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912524,0.00006146005,0.000226746,0.0001759214,0.00012259634,0.00028800804],"domain_scores_gemma":[0.99957424,0.000034194825,0.00005488133,0.00020633757,0.000051941654,0.00007839061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032331917,0.00011389867,0.00017513386,0.000034404024,0.00003961751,0.000047393154,0.00012915125,0.000023549306,0.00055787363],"category_scores_gemma":[0.000002844052,0.00009855478,0.00006231755,0.00039437937,0.00001980925,0.00010342498,0.00005751534,0.00012446674,0.000042970776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027285178,0.00008507305,0.3442579,0.0000012770226,0.000026664224,0.0000018789905,0.00017396639,0.0325846,0.000004426257,0.33711573,0.2524524,0.033268806],"study_design_scores_gemma":[0.00078012317,0.00013464357,0.028826563,0.00007812339,0.00010490144,0.000001216921,0.00095026096,0.108985946,0.000097634984,0.81268084,0.046693012,0.00066672405],"about_ca_topic_score_codex":0.00066817953,"about_ca_topic_score_gemma":0.0003034887,"teacher_disagreement_score":0.89559615,"about_ca_system_score_codex":0.000035212855,"about_ca_system_score_gemma":0.00003542034,"threshold_uncertainty_score":0.6108325},"labels":[],"label_agreement":null},{"id":"W2285189722","doi":"10.1016/j.physa.2016.10.021","title":"Exploring triad-rich substructures by graph-theoretic characterizations in complex networks","year":2016,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Substructure; Triad (sociology); Computer science; Complex network; Community structure; Centrality; Theoretical computer science; Property (philosophy); Graph; Data mining; Mathematics; Sociology; Combinatorics; World Wide Web; Engineering; Epistemology","score_opus":0.03399142497960632,"score_gpt":0.2692809030974057,"score_spread":0.23528947811779938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285189722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017984156,0.00003481639,0.98027134,0.00037964666,0.000015144392,0.0004920497,0.0005319971,0.000067862056,0.00022298012],"genre_scores_gemma":[0.9963069,0.00016488583,0.0018015013,0.000037964386,0.00015211507,0.0011500618,0.0003436603,0.000028837612,0.000014077625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871975,0.000061003808,0.00035516103,0.00041291764,0.00013209185,0.0003190623],"domain_scores_gemma":[0.9990584,0.00037799877,0.000089200235,0.0002723342,0.00007024212,0.00013178895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094141345,0.00020437567,0.00030008183,0.00008478026,0.00018019615,0.00005513309,0.00018800428,0.00002771478,0.00028402085],"category_scores_gemma":[0.000010997582,0.00016292074,0.000050383154,0.00047906442,0.000041813317,0.00014342199,0.00008599217,0.00012641646,0.000010598515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005901436,0.00010809293,0.00012467132,0.0000048646234,0.000029138031,1.2919807e-7,0.000026233101,0.000010553262,0.010842097,0.96238047,0.00038155811,0.026086295],"study_design_scores_gemma":[0.0006514708,0.00005856363,0.0033115777,0.00003671227,0.00011482479,5.767125e-7,0.0000549189,0.06690226,0.0018141257,0.92043406,0.006090242,0.0005306891],"about_ca_topic_score_codex":0.000018593977,"about_ca_topic_score_gemma":0.00000473396,"teacher_disagreement_score":0.97846985,"about_ca_system_score_codex":0.000021277066,"about_ca_system_score_gemma":0.000012410672,"threshold_uncertainty_score":0.6643715},"labels":[],"label_agreement":null},{"id":"W2286094480","doi":"10.3389/fpsyg.2016.00276","title":"Layered Social Network Analysis Reveals Complex Relationships in Kindergarteners","year":2016,"lang":"en","type":"article","venue":"Frontiers in Psychology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Amgen (Canada); University of Toronto","funders":"Canadian Institutes of Health Research; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Reciprocal; Transitive relation; Psychology; Hierarchy; Motif (music); Network motif; Complex network; Social relation; Developmental psychology; Cognitive science; Social psychology; Computer science; World Wide Web; Mathematics","score_opus":0.03701206059484582,"score_gpt":0.3220939980188892,"score_spread":0.2850819374240434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286094480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06313872,0.000117793395,0.9127091,0.0031108723,0.00037958496,0.0002568997,0.000020377389,0.00008028858,0.02018632],"genre_scores_gemma":[0.9762638,0.000011169444,0.022854544,0.00019206801,0.00035739673,0.00005831062,0.000055905082,0.000018703144,0.00018807224],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99769455,0.0006358783,0.00055850093,0.00048297615,0.00011949652,0.0005086158],"domain_scores_gemma":[0.99920124,0.00011451408,0.00020132428,0.00039352896,0.000034029068,0.000055348555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007593817,0.00018518354,0.0005997438,0.0006643085,0.000109995664,0.000015066095,0.00032237382,0.00013099876,0.0005459375],"category_scores_gemma":[0.000010801034,0.00016383025,0.00023821341,0.0021355238,0.00012944441,0.0000845555,0.000052831976,0.00027400994,0.000016748898],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000320579,0.00006406983,0.8127337,6.11019e-7,0.00030550812,0.000002294516,0.00008508314,0.00016707616,0.000049259772,0.005121918,0.16002944,0.021408986],"study_design_scores_gemma":[0.0008018058,0.000014514662,0.711902,0.000011124948,0.00010949184,2.3769707e-7,0.00008927725,0.0008930674,0.000002134773,0.2743361,0.011613158,0.00022706928],"about_ca_topic_score_codex":0.0000713221,"about_ca_topic_score_gemma":0.00024867724,"teacher_disagreement_score":0.9131251,"about_ca_system_score_codex":0.00007841558,"about_ca_system_score_gemma":0.000016153464,"threshold_uncertainty_score":0.6680804},"labels":[],"label_agreement":null},{"id":"W2286666002","doi":"10.1145/2939672.2939758","title":"When Social Influence Meets Item Inference","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Viral marketing; Inference; Computer science; Maximization; Selection (genetic algorithm); Construct (python library); Greedy algorithm; Product (mathematics); Computation; Graph; Data mining; Machine learning; Artificial intelligence; Mathematical optimization; Theoretical computer science; Social media; Algorithm; Mathematics","score_opus":0.013739340161778583,"score_gpt":0.2810812217223731,"score_spread":0.2673418815605945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286666002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73518604,0.000009922712,0.14966086,0.0027429864,0.000028921955,0.00014209886,0.000010946313,0.00032679047,0.11189145],"genre_scores_gemma":[0.9960979,7.369065e-7,0.0015500771,0.00007711095,0.00019685543,0.000017952898,0.0000021380893,0.000007087258,0.0020501076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993723,0.000024923733,0.00014743219,0.00016742342,0.00010926622,0.00017866738],"domain_scores_gemma":[0.99956,0.00010749193,0.000056696885,0.00016974413,0.00006659052,0.000039467875],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000696385,0.000094131115,0.00012735766,0.00003513937,0.000079897436,0.000031655476,0.00019852827,0.000020014675,0.003171071],"category_scores_gemma":[0.0000067112746,0.000060527105,0.000078143756,0.00008551118,0.000047219055,0.0001522565,0.00010125221,0.000041992265,0.00014057482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004706195,0.000050148792,0.26542982,0.000001740742,0.000075251024,4.8490557e-7,0.0001736363,0.0000019907136,0.007777882,0.48049572,0.020210396,0.22577822],"study_design_scores_gemma":[0.00078214204,0.00006368655,0.14899325,0.000085775384,0.000085888365,3.6112746e-7,0.00009607114,0.00050232554,0.025534023,0.5888796,0.23401733,0.00095955556],"about_ca_topic_score_codex":0.0001922932,"about_ca_topic_score_gemma":0.00001801858,"teacher_disagreement_score":0.2609119,"about_ca_system_score_codex":0.00001538509,"about_ca_system_score_gemma":0.000021190894,"threshold_uncertainty_score":0.99774015},"labels":[],"label_agreement":null},{"id":"W2286934681","doi":"10.11575/prism/30914","title":"A Network Analysis of Online Forum Discussions on Executable Acceptance Test Driven Development","year":2009,"lang":"en","type":"article","venue":"Open MIND","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Centrality; Social network analysis; Executable; Product (mathematics); Computer science; Social network (sociolinguistics); Knowledge management; Test (biology); Process (computing); Data science; New product development; Core (optical fiber); Sentiment analysis; World Wide Web; Social media; Artificial intelligence; Business; Marketing","score_opus":0.0254560500857833,"score_gpt":0.320177698043644,"score_spread":0.2947216479578607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286934681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88495123,0.00007411732,0.035383746,0.0017257953,0.000053981923,0.0011221252,0.0002439232,0.00001680717,0.07642825],"genre_scores_gemma":[0.94266766,0.000001457596,0.055350795,0.00005874667,0.00007207666,0.000013766228,0.00030971534,0.0000074939335,0.0015182926],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.998834,0.000028744604,0.0003793756,0.00031228867,0.0001583964,0.00028720876],"domain_scores_gemma":[0.9991449,0.000078767145,0.00021600716,0.00043541455,0.000051642113,0.0000732278],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010700134,0.00015826104,0.00045780305,0.00012726722,0.00014515173,0.000074876414,0.0005536758,0.000026532533,0.0033562235],"category_scores_gemma":[0.0000050475405,0.00012495584,0.00016102282,0.0012456174,0.00002090198,0.00011034819,0.00018897245,0.00010426864,0.000023418273],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034967532,0.0012360156,0.184453,6.639061e-7,0.00087952014,0.000001631949,0.00025299875,0.014951015,0.00040402432,0.0009256758,0.008201752,0.78865874],"study_design_scores_gemma":[0.0016541757,0.00100821,0.4944288,0.0006088031,0.0046064956,5.302496e-7,0.002699105,0.09853424,0.014361114,0.00974794,0.37019062,0.0021599603],"about_ca_topic_score_codex":0.000045829223,"about_ca_topic_score_gemma":0.00030495157,"teacher_disagreement_score":0.7864988,"about_ca_system_score_codex":0.000030276216,"about_ca_system_score_gemma":0.000060760605,"threshold_uncertainty_score":0.99755484},"labels":[],"label_agreement":null},{"id":"W2288475590","doi":"10.1103/physreve.93.012301","title":"Temporal dynamics of connectivity and epidemic properties of growing networks","year":2016,"lang":"en","type":"article","venue":"Physical review. E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Network dynamics; Evolving networks; Epidemic model; Complex network; Resilience (materials science); Network science; Dynamic network analysis; Network topology; Preferential attachment; Statistical physics; Mathematics; Computer network; Population; Physics; Sociology","score_opus":0.018741064409812117,"score_gpt":0.29711110869613083,"score_spread":0.27837004428631873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288475590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9497577,0.003914147,0.045064256,0.0004662021,0.000014815197,0.00026204102,0.00000971666,0.000026139242,0.00048497538],"genre_scores_gemma":[0.9990706,0.00057402917,0.00016343851,0.00002580896,0.00011573262,0.000019709485,0.000004427689,0.000010490201,0.000015785956],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991747,0.00010492775,0.00030561828,0.00017425565,0.00010019091,0.00014030648],"domain_scores_gemma":[0.9992429,0.00016778774,0.0002376943,0.0002397387,0.00007008644,0.00004182022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025008892,0.00012178788,0.0005969219,0.000019579782,0.000023370356,0.0000032287367,0.00011751218,0.000012508826,0.000021783797],"category_scores_gemma":[0.000032793938,0.00007425214,0.00019260429,0.00014403365,0.0001306873,0.00012579725,0.00010411056,0.00007368838,0.0000010968645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002797983,0.00038141978,0.23555365,0.0008959465,0.00030541446,3.0318708e-7,0.000045915946,0.000035418572,0.031389732,0.25689662,0.0007942118,0.4736734],"study_design_scores_gemma":[0.0018774582,0.0007065204,0.029717471,0.03721426,0.0020196831,0.0000029402654,0.00011706362,0.28792232,0.10117555,0.5330371,0.003998012,0.002211633],"about_ca_topic_score_codex":0.00012102364,"about_ca_topic_score_gemma":0.0000056131294,"teacher_disagreement_score":0.47146177,"about_ca_system_score_codex":0.000014143438,"about_ca_system_score_gemma":0.000013409542,"threshold_uncertainty_score":0.30279145},"labels":[],"label_agreement":null},{"id":"W2288565797","doi":"10.5555/2888619.2888644","title":"Evaluating the science-technology interaction in nanotechnology: a simulation-based study","year":2015,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University","funders":"","keywords":"Interconnectivity; Multidisciplinary approach; Context (archaeology); Knowledge management; Productivity; Nanotechnology; Field (mathematics); Sociology of scientific knowledge; Engineering; Computer science; Data science; Sociology; Social science; Materials science; Artificial intelligence","score_opus":0.13789158921197775,"score_gpt":0.43145289189150604,"score_spread":0.2935613026795283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288565797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77413565,0.0000037037837,0.22419386,0.0003766249,0.000089135436,0.00045123816,8.645259e-7,0.0001283428,0.0006206021],"genre_scores_gemma":[0.9990056,1.9681023e-8,0.00076651684,0.000031039774,0.000058966783,0.00007861458,0.0000054418397,0.000009809882,0.000043945907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985146,0.00013012385,0.0003925737,0.00038863148,0.0003397333,0.0002343582],"domain_scores_gemma":[0.9983092,0.00034502754,0.0002026318,0.0005262041,0.00057783717,0.000039116654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095156865,0.00015075016,0.00019159802,0.00075580645,0.00016706348,0.00012962338,0.00049357826,0.000046416964,0.00016622093],"category_scores_gemma":[0.00023162743,0.00012133636,0.000044414755,0.0017634023,0.00018731401,0.00027211793,0.00016914262,0.0002897269,0.000024771514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026280935,0.0001267819,0.10061627,5.6859835e-7,0.000010925754,3.3720335e-7,0.00054413645,0.8732263,0.00022521512,0.0016313181,0.0000024133426,0.023589479],"study_design_scores_gemma":[0.0005527669,0.00020665495,0.0020089177,0.000025292244,0.00001850169,6.129254e-8,0.0018034826,0.9855218,0.0005169901,0.009107659,0.00011370591,0.00012420134],"about_ca_topic_score_codex":0.00009268463,"about_ca_topic_score_gemma":0.000058236263,"teacher_disagreement_score":0.22487001,"about_ca_system_score_codex":0.00012863323,"about_ca_system_score_gemma":0.0002309703,"threshold_uncertainty_score":0.4947953},"labels":[],"label_agreement":null},{"id":"W2288710413","doi":"10.1109/glocom.2015.7417534","title":"Energy-Efficient and Fault-Tolerant Evolution Models for Large-Scale Wireless Sensor Networks: A Complex Networks-Based Approach","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wireless sensor network; Fault tolerance; Computer science; Distributed computing; Network topology; Efficient energy use; Energy (signal processing); Node (physics); Cluster analysis; Topology (electrical circuits); Computer network; Engineering; Artificial intelligence; Mathematics","score_opus":0.0657653160746157,"score_gpt":0.30902912364703494,"score_spread":0.24326380757241922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288710413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042068087,0.00074569584,0.9860876,0.00044319365,0.00010183503,0.00073616963,0.00036149143,0.00024560955,0.007071578],"genre_scores_gemma":[0.94817823,0.000036044916,0.04966175,0.0001383879,0.00019012956,0.00045604137,0.0012445858,0.000033167325,0.00006168357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718505,0.00043125343,0.00068627874,0.0006261854,0.00032955623,0.0007416708],"domain_scores_gemma":[0.9959658,0.0001662351,0.00039509154,0.0021460375,0.0009385059,0.00038837604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000700069,0.00046100898,0.00066833006,0.00009683325,0.00062403694,0.0002597553,0.0013469594,0.000157651,0.000020911553],"category_scores_gemma":[0.000005886082,0.00047425897,0.00024330425,0.0006500377,0.00029607693,0.00019295626,0.00048724582,0.00029027,0.0000043799632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000830303,0.00087135663,0.0027402642,0.000010325603,0.00013596806,1.9111481e-7,0.00011198566,0.73580956,0.000009155448,0.2397669,0.013907897,0.0065533957],"study_design_scores_gemma":[0.0012018633,0.00005803101,0.00018607517,0.000050051665,0.00015097359,0.0000022203187,0.0006869839,0.98160493,0.000004194771,0.00978451,0.0057750302,0.00049511826],"about_ca_topic_score_codex":0.0013240532,"about_ca_topic_score_gemma":0.00061306334,"teacher_disagreement_score":0.9439714,"about_ca_system_score_codex":0.00029625028,"about_ca_system_score_gemma":0.0002834937,"threshold_uncertainty_score":0.99977094},"labels":[],"label_agreement":null},{"id":"W2289882453","doi":"10.1103/physreve.81.026105","title":"Edge ratio and community structure in networks","year":2010,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; HEC Montréal","keywords":"Modularity (biology); Mathematics; Maximization; Community structure; Enhanced Data Rates for GSM Evolution; Combinatorics; Algorithm; Mathematical optimization; Computer science; Artificial intelligence","score_opus":0.01318637623071539,"score_gpt":0.31106620822093634,"score_spread":0.29787983199022094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289882453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99052966,0.0020031906,0.0026130045,0.00022283482,0.000042519965,0.00034357497,0.000007718361,0.000043057007,0.004194458],"genre_scores_gemma":[0.99901843,0.00017685497,0.00022037579,0.00016868897,0.00034061616,0.000020883208,0.00003360609,0.000008691094,0.000011831839],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993503,0.00017106398,0.00015450675,0.00011906269,0.00006437262,0.00014067237],"domain_scores_gemma":[0.99936736,0.00014737702,0.000060777813,0.00034498374,0.000025252977,0.000054229364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001882542,0.0001173471,0.0003211473,0.00001662406,0.00009080583,0.000023371047,0.00016291805,0.000015075819,0.00020852617],"category_scores_gemma":[0.00001364139,0.00009650502,0.00007824258,0.00020980655,0.000054009695,0.0000658051,0.000108678476,0.0009762478,0.0000037222628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070854953,0.0007604657,0.064732514,0.00039148648,0.00010126965,0.0000012215021,0.00034514858,0.000076784,0.008974343,0.28060985,0.00736993,0.6366299],"study_design_scores_gemma":[0.0009873845,0.00017595945,0.13672592,0.0022547892,0.00050322636,0.0000034366124,0.000078835976,0.10467054,0.0020950546,0.6497094,0.10115342,0.0016420195],"about_ca_topic_score_codex":0.00019962729,"about_ca_topic_score_gemma":0.00014978388,"teacher_disagreement_score":0.6349879,"about_ca_system_score_codex":0.000004422953,"about_ca_system_score_gemma":0.000008725224,"threshold_uncertainty_score":0.42413652},"labels":[],"label_agreement":null},{"id":"W2290176743","doi":"10.1109/malware.2015.7413690","title":"Measuring the health of antivirus ecosystems","year":2015,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Polytechnique Montréal","funders":"Ministry of Science Research and Technology","keywords":"Malware; Benchmarking; Ecosystem; Software; Computer science; Dominance (genetics); Product (mathematics); Work (physics); Computer security; Business; Engineering; Ecology; Operating system; Marketing","score_opus":0.0690420808310286,"score_gpt":0.29587441109098483,"score_spread":0.22683233025995625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290176743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4641308,0.00062631984,0.20849808,0.0013634174,0.00018562183,0.0005395921,0.000011685474,0.00019445506,0.32445002],"genre_scores_gemma":[0.99910206,8.203019e-7,0.00050382054,0.000024437286,0.00012109731,0.0000056665053,0.0000025116692,0.000004739088,0.00023486356],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994752,0.00006277168,0.00016908995,0.00007185815,0.000117882846,0.00010321274],"domain_scores_gemma":[0.9995694,0.000024027724,0.00009866305,0.00021578597,0.00005270043,0.0000394201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004538376,0.000050104456,0.00014207738,0.00002241161,0.00003585629,0.0000122359725,0.00013283764,0.0000053551084,0.00007954511],"category_scores_gemma":[0.0000015475077,0.000030917246,0.000059994167,0.0001229891,0.000013921629,0.000029252322,0.00004434329,0.000042821946,0.00001538547],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017884226,0.00023438052,0.39976534,0.000025292184,0.0003598434,2.990794e-7,0.0012273183,0.00033920386,0.00046508666,0.31300262,0.1654525,0.11911024],"study_design_scores_gemma":[0.0027662364,0.0007041219,0.013924197,0.00035751922,0.00017662138,0.0000048924326,0.011246971,0.11108426,0.08051469,0.17424108,0.60338545,0.0015939574],"about_ca_topic_score_codex":0.0027793332,"about_ca_topic_score_gemma":0.00015156678,"teacher_disagreement_score":0.53497124,"about_ca_system_score_codex":0.000014191771,"about_ca_system_score_gemma":0.000048743932,"threshold_uncertainty_score":0.4201539},"labels":[],"label_agreement":null},{"id":"W2291722634","doi":"10.1145/2808797.2808818","title":"Social networks with multiple relationship semantics","year":2015,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Popularity; Computer science; Pairwise comparison; Semantics (computer science); Enhanced Data Rates for GSM Evolution; Social network (sociolinguistics); Set (abstract data type); Theoretical computer science; Dynamic network analysis; Artificial intelligence; World Wide Web; Computer network; Social media; Social psychology; Psychology; Programming language","score_opus":0.04122804088759968,"score_gpt":0.2850521808183751,"score_spread":0.2438241399307754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291722634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07694034,0.000010903105,0.86280614,0.00031729296,0.000020948832,0.000119336815,0.0000011427265,0.00018535029,0.05959853],"genre_scores_gemma":[0.99013895,7.4468694e-8,0.008116285,0.000028696293,0.0004857616,0.00001184003,0.000036885525,0.000012770145,0.0011687493],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947006,0.00003085818,0.00011378854,0.00012078102,0.00011362663,0.00015088104],"domain_scores_gemma":[0.99960965,0.00005874651,0.00005336172,0.00013518886,0.00008212436,0.000060956765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011412797,0.00008640692,0.00011721898,0.000029825844,0.00010459811,0.000038753158,0.00008708135,0.000023711684,0.00008855995],"category_scores_gemma":[0.0000029928667,0.0000688063,0.000048545324,0.00021770957,0.00003209876,0.000067682,0.000038096427,0.00011414484,0.000018611912],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009017954,0.000036038797,0.9028541,4.6109272e-7,0.000038912953,3.8848333e-7,0.00009675622,0.0027084975,7.795862e-7,0.06788808,0.025104746,0.0012622222],"study_design_scores_gemma":[0.0024070514,0.00017295484,0.1732241,0.000026868589,0.00031566218,0.0000021440073,0.0015665212,0.7015719,0.00019561121,0.07769136,0.0417263,0.0010995448],"about_ca_topic_score_codex":0.00013511605,"about_ca_topic_score_gemma":0.00006182468,"teacher_disagreement_score":0.9131986,"about_ca_system_score_codex":0.000014578553,"about_ca_system_score_gemma":0.000024175662,"threshold_uncertainty_score":0.28058395},"labels":[],"label_agreement":null},{"id":"W2293559664","doi":"","title":"Non-trivial Inter-layer Degree Correlations in Heterogeneously Growing Multiplex Networks.","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Degree (music); Homogeneous; Layer (electronics); Node (physics); Statistical physics; Focus (optics); Monte Carlo method; Mathematics; Multiplex; Expression (computer science); Physics; Computer science; Statistics; Materials science; Nanotechnology; Optics; Biology; Bioinformatics","score_opus":0.05110513527598149,"score_gpt":0.19579614256646272,"score_spread":0.14469100729048123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293559664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5106464,0.0000027330263,0.48670864,0.000009693861,0.000058281053,0.00009603998,0.0000014303318,0.000053576634,0.0024232157],"genre_scores_gemma":[0.99889755,0.0000025372733,0.00036103177,0.000042018455,0.00025142997,0.0000016523425,0.000027576423,0.000021577021,0.00039462763],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889106,0.000087676395,0.00021022193,0.00043368732,0.000041239746,0.00033610672],"domain_scores_gemma":[0.9992038,0.0001243455,0.00011261257,0.0004078627,0.000052226456,0.000099162564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016138163,0.00019534916,0.0002541147,0.00020310684,0.00013683838,0.000035363755,0.00034779363,0.00005714123,0.00015545465],"category_scores_gemma":[0.000005400492,0.00023073095,0.00020926993,0.0006291265,0.00005856075,0.00027225932,0.00018893849,0.00025247302,0.00005246295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024546494,0.00010654782,0.63086945,0.000002154648,0.00007368074,0.0000137584575,0.00004936118,0.3437596,0.00007492358,0.017593674,0.0003466135,0.0070856987],"study_design_scores_gemma":[0.00059574563,0.000034168566,0.023013232,0.000030143145,0.000058935853,6.0395104e-7,0.000040724317,0.9713651,0.000115630144,0.0036484406,0.00082383247,0.0002734544],"about_ca_topic_score_codex":0.0006121783,"about_ca_topic_score_gemma":0.00054105563,"teacher_disagreement_score":0.6276055,"about_ca_system_score_codex":0.00007124755,"about_ca_system_score_gemma":0.000016292286,"threshold_uncertainty_score":0.9408935},"labels":[],"label_agreement":null},{"id":"W2293616274","doi":"","title":"Maximizing the coverage of information propagation in social networks","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Submodular set function; Computer science; Node (physics); Maximization; Set (abstract data type); Popularity; Theoretical computer science; Mathematical optimization; Mathematics","score_opus":0.0992775265964285,"score_gpt":0.34083534369133994,"score_spread":0.24155781709491145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293616274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039808895,0.0000037220636,0.89545816,0.0012849355,0.00025460534,0.00023915221,0.000011328404,0.000028443284,0.06291074],"genre_scores_gemma":[0.9993763,0.0000034467014,0.00020926217,0.000068574,0.00023490316,0.000029167408,0.0000498752,0.0000040186587,0.000024435785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989423,0.000064196,0.00044931137,0.00010920821,0.00030006643,0.00013487891],"domain_scores_gemma":[0.99923396,0.00005218414,0.00023103172,0.000113731956,0.0003432025,0.00002589111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042780556,0.000095120835,0.00012007806,0.0001283456,0.00006051225,0.000101726284,0.00034227897,0.000030205312,0.0002621349],"category_scores_gemma":[0.00003174046,0.00007809948,0.000058015466,0.00025263388,0.00007177333,0.0002852392,0.00007119997,0.0001806517,0.000034315577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005500895,0.000051668943,0.0013704556,8.836553e-7,0.0000149666685,2.184508e-7,0.00060191844,0.01357504,0.000056986682,0.8021387,0.00014053249,0.18199365],"study_design_scores_gemma":[0.00004665949,0.00004412773,0.000753136,0.000038215065,0.000006956003,2.643975e-7,0.001268321,0.6153225,0.0041211927,0.37771207,0.000562095,0.00012449994],"about_ca_topic_score_codex":0.00026988867,"about_ca_topic_score_gemma":0.000054008528,"teacher_disagreement_score":0.9595674,"about_ca_system_score_codex":0.000057345616,"about_ca_system_score_gemma":0.00006324516,"threshold_uncertainty_score":0.31848046},"labels":[],"label_agreement":null},{"id":"W2294073150","doi":"10.1609/icwsm.v5i1.14112","title":"The Effect of Mobile Platforms on Twitter Content Generation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International AAAI Conference on Web and Social Media","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Microblogging; Computer science; Social media; Popularity; Mobile device; User-generated content; Mobile Web; Context (archaeology); World Wide Web; Mobile technology; Mobile computing; Multimedia; Telecommunications; Geography","score_opus":0.03894464090698667,"score_gpt":0.2730717834981809,"score_spread":0.23412714259119422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294073150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9915243,0.000012849636,0.00001060805,0.0010276207,0.00017345768,0.0001039103,0.000011757477,0.000006343595,0.007129146],"genre_scores_gemma":[0.99919987,0.000015905207,0.000018202001,0.000056691762,0.00037728038,0.000043626205,0.000009897068,0.000004587975,0.0002739279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993332,0.0000067336673,0.00018483867,0.000115794086,0.00028276732,0.00007667529],"domain_scores_gemma":[0.9993038,0.00014949532,0.00018563624,0.000042297066,0.00030369306,0.000015042659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018344278,0.00008360193,0.00014910262,0.000022877386,0.000111004534,0.000056717054,0.0002172101,0.00002478049,0.00007496392],"category_scores_gemma":[0.000038703703,0.000046508732,0.000102998354,0.000054616954,0.00008933385,0.00004496092,0.000083781364,0.00011111088,0.0000011663428],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016769768,0.00011494486,0.042896,0.000021059603,0.00038172805,1.8159507e-7,0.002134175,0.000004729824,0.14368828,0.74197,0.0072143646,0.06140684],"study_design_scores_gemma":[0.0012274077,0.00037251008,0.008489117,0.00019154338,0.00012016662,9.162401e-7,0.002459438,0.0056722853,0.9310358,0.04413102,0.0060292766,0.0002705073],"about_ca_topic_score_codex":0.000008419618,"about_ca_topic_score_gemma":0.000007685268,"teacher_disagreement_score":0.78734756,"about_ca_system_score_codex":0.000015690337,"about_ca_system_score_gemma":0.000024674206,"threshold_uncertainty_score":0.1896571},"labels":[],"label_agreement":null},{"id":"W2294590546","doi":"10.1007/978-3-319-24489-1_22","title":"Accurate Online Social Network User Profiling","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Moncton","funders":"","keywords":"Computer science; Profiling (computer programming); Inference; Social graph; Graph; Social network (sociolinguistics); Theoretical computer science; Data mining; Social media; Artificial intelligence; World Wide Web","score_opus":0.03514172732641399,"score_gpt":0.30271006616246376,"score_spread":0.2675683388360498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294590546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025947206,0.00016971213,0.99220806,0.00019760607,0.00045046263,0.00029804299,0.000023033133,0.00011953727,0.0062740836],"genre_scores_gemma":[0.5990473,0.0000075841267,0.38185468,0.00063092227,0.016371278,0.000021486463,0.00028689034,0.00012408708,0.0016557474],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745655,0.00003096578,0.0004567988,0.000861028,0.00059147703,0.0006031695],"domain_scores_gemma":[0.998585,0.00013887737,0.00032548647,0.00054167403,0.00029683177,0.00011216673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005951069,0.00044913162,0.0005918648,0.0002457108,0.00026188677,0.00022685323,0.0011100173,0.00016378277,0.00014157538],"category_scores_gemma":[0.000007685115,0.00041579682,0.00019419848,0.00046495977,0.0003877292,0.00017137693,0.00077282055,0.0008382301,0.000019962396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017110497,0.000077274155,0.0017150439,0.000018338467,0.00010338375,0.000018075003,0.00028823974,0.18691286,0.000030617553,0.07908366,0.0022009865,0.7295344],"study_design_scores_gemma":[0.00025035677,0.000068335576,0.00011508786,0.00022889026,0.000060036782,0.0000025220502,4.902177e-7,0.2544508,0.00014645208,0.724339,0.019411372,0.00092663086],"about_ca_topic_score_codex":0.00003685485,"about_ca_topic_score_gemma":0.000061380604,"teacher_disagreement_score":0.7286078,"about_ca_system_score_codex":0.00015845451,"about_ca_system_score_gemma":0.00037806222,"threshold_uncertainty_score":0.9998294},"labels":[],"label_agreement":null},{"id":"W2295072097","doi":"10.1287/mnsc.2016.2446","title":"Utility-Based Link Recommendation for Online Social Networks","year":2016,"lang":"en","type":"article","venue":"Management Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Recommender system; Linkage (software); Bayesian network; Social network (sociolinguistics); Revenue; Link (geometry); Key (lock); Link analysis; Focus (optics); Information retrieval; Social media; Data mining; Data science; World Wide Web; Machine learning; Computer network; Business; Computer security","score_opus":0.027220576124317074,"score_gpt":0.3131915042590587,"score_spread":0.2859709281347416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295072097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036942551,0.000001222303,0.9856847,0.003688367,0.00007996418,0.00028680742,0.000015044597,0.00007568831,0.006473957],"genre_scores_gemma":[0.9816594,7.8571435e-7,0.0172041,0.00019855208,0.00035594302,0.000050163682,0.00004699215,0.000006366784,0.00047770634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990913,0.00001792999,0.0001620559,0.0003152227,0.00014083477,0.00027262833],"domain_scores_gemma":[0.99957585,0.000047240173,0.00008780781,0.00019358398,0.000058990896,0.000036494286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051026494,0.00008647237,0.000095466254,0.0001085261,0.00032814287,0.000063107094,0.00033457024,0.0000112384205,0.00036708842],"category_scores_gemma":[0.0000032137682,0.00006524434,0.00007820097,0.0004552413,0.00014274482,0.00015045305,0.00012412285,0.00003211513,0.00000533679],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075669486,0.000060862825,0.0048364196,0.0000032975393,0.000013655924,5.3703737e-8,0.000005020672,0.00004157274,0.000060818642,0.033894885,0.004874741,0.9562011],"study_design_scores_gemma":[0.0011953003,0.00007106275,0.0340419,0.00005092011,0.00010328796,2.6385724e-8,0.000067961824,0.4981069,0.0009981702,0.042364594,0.42253608,0.00046380397],"about_ca_topic_score_codex":0.000008459193,"about_ca_topic_score_gemma":0.0000052057835,"teacher_disagreement_score":0.9779651,"about_ca_system_score_codex":0.000031661362,"about_ca_system_score_gemma":0.000014035383,"threshold_uncertainty_score":0.40193608},"labels":[],"label_agreement":null},{"id":"W2299394720","doi":"10.1103/physreve.93.062309","title":"Distance distribution in configuration-model networks","year":2016,"lang":"en","type":"article","venue":"Physical review. E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation","keywords":"Shortest path problem; Degree distribution; Mathematics; Average path length; Negative binomial distribution; Distribution (mathematics); Dispersion (optics); Path length; Degree (music); Path (computing); Variance (accounting); Connection (principal bundle); Recursion (computer science); Statistical physics; Statistics; Mathematical analysis; Geometry; Computer science; Complex network; Combinatorics; Physics; Algorithm; Poisson distribution","score_opus":0.011294994164613388,"score_gpt":0.31660274765608093,"score_spread":0.30530775349146755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299394720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010546992,0.00067846366,0.98427546,0.0007228423,0.00001490721,0.00023379966,0.000023289627,0.000044609937,0.003459653],"genre_scores_gemma":[0.9987366,0.00052877655,0.000093522984,0.0000843749,0.00024558182,0.000096097625,0.00009334085,0.000009224181,0.00011243743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991519,0.000052205723,0.00024247514,0.0002277501,0.00011886491,0.00020682739],"domain_scores_gemma":[0.9994168,0.00010048357,0.00010304799,0.0002778321,0.000048639962,0.000053181244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117794734,0.00012893023,0.00030307774,0.000011491426,0.00003555656,0.0000134474885,0.00014516001,0.000011375532,0.00011382107],"category_scores_gemma":[0.000014313031,0.00008687229,0.00015475738,0.00025289238,0.000040474268,0.00012307859,0.000035028203,0.000090752306,0.000043262095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008695567,0.00026041095,0.013152458,0.00004258571,0.00003054499,6.4210656e-7,0.0000115479925,0.00038036387,0.0011181432,0.69503343,0.0132662635,0.2766949],"study_design_scores_gemma":[0.00071945117,0.0000549129,0.009878879,0.0039669634,0.0001865777,2.6848383e-7,0.0000052213236,0.40873536,0.00349016,0.5214082,0.050604843,0.00094915205],"about_ca_topic_score_codex":0.000023269722,"about_ca_topic_score_gemma":0.00000842325,"teacher_disagreement_score":0.98818964,"about_ca_system_score_codex":0.000045934452,"about_ca_system_score_gemma":0.000017073962,"threshold_uncertainty_score":0.35425493},"labels":[],"label_agreement":null},{"id":"W2302144074","doi":"10.1038/srep37057","title":"Graphlet characteristics in directed networks","year":2016,"lang":"en","type":"preprint","venue":"Scientific Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Montreal Heart Institute","funders":"Institut de Cardiologie de Montréal; Fondation Institut de Cardiologie de Montréal","keywords":"Centrality; Similarity (geometry); Vertex (graph theory); Correlation; Structural similarity; Network analysis; Node (physics); Computer science; Community structure; Complex network; Mathematics; Theoretical computer science; Artificial intelligence; Data mining; Combinatorics; Physics","score_opus":0.011017309718041851,"score_gpt":0.2551404158931408,"score_spread":0.24412310617509894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2302144074","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.872793,0.00048052586,0.07339251,0.00022995002,0.025136176,0.0017052296,0.00007872533,0.0010628105,0.025121033],"genre_scores_gemma":[0.9956408,0.000005885895,0.0005192538,0.0000068842783,0.00070130156,0.00013498343,0.000876138,0.00003743342,0.0020772843],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965211,0.00011108476,0.0010884244,0.0013564546,0.00040268002,0.0005202576],"domain_scores_gemma":[0.99664664,0.000050928622,0.0010082837,0.0019541061,0.00021649794,0.00012353976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013421552,0.00036260817,0.0006691258,0.0004580079,0.00015354507,0.00048057313,0.00037976727,0.00015870336,0.00071496004],"category_scores_gemma":[0.000020702473,0.00031189312,0.00036084978,0.0006271558,0.00021518706,0.00007435131,0.00084329565,0.00055642554,0.000011874128],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008879503,0.00026642927,0.8795332,0.00003688141,0.00020485546,0.00037969538,0.00013769082,0.00023083358,0.00041691278,0.0018415719,0.08115475,0.03578831],"study_design_scores_gemma":[0.0001733255,0.000011915731,0.06750248,0.0011549186,0.00016682912,0.000011501545,0.000016919916,0.015240439,0.00094149006,0.84634894,0.067003645,0.0014275998],"about_ca_topic_score_codex":0.0001378773,"about_ca_topic_score_gemma":0.0000319925,"teacher_disagreement_score":0.8445074,"about_ca_system_score_codex":0.00007247635,"about_ca_system_score_gemma":0.0001697928,"threshold_uncertainty_score":0.9999333},"labels":[],"label_agreement":null},{"id":"W2302188385","doi":"10.1890/15-1613.1","title":"How individual links affect network stability in a large‐scale, heterogeneous metacommunity","year":2016,"lang":"en","type":"article","venue":"Ecology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Carl-Zeiss-Stiftung","keywords":"Metacommunity; Affect (linguistics); Ecology; Stability (learning theory); Scale (ratio); Environmental science; Geography; Computer science; Biology; Psychology; Sociology; Demography; Biological dispersal; Communication; Cartography","score_opus":0.019659037379405244,"score_gpt":0.2646011983508948,"score_spread":0.24494216097148955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2302188385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9881152,0.00006191486,0.009819505,0.00074105395,0.000102273116,0.00028561783,0.00004223392,0.00008548409,0.00074670423],"genre_scores_gemma":[0.99823546,0.000004192302,0.0010845228,0.000102690654,0.00032119217,0.00011552839,0.000034522353,0.000017533435,0.000084358835],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99798524,0.00076064665,0.00025538125,0.00031288416,0.00009929717,0.00058655225],"domain_scores_gemma":[0.9985981,0.0005580214,0.00012927862,0.00059553416,0.000041162755,0.000077915334],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00088475755,0.00019039569,0.00045698334,0.00007907725,0.00012420471,0.000038544946,0.00040729117,0.0001550587,0.0011787063],"category_scores_gemma":[0.000020196034,0.0001450241,0.00018915253,0.0002625883,0.00009298987,0.00009244748,0.0004114339,0.0004229527,0.000022163076],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016686054,0.00026580502,0.9873927,0.0000027546039,0.0001441488,0.0000032757316,0.00014549318,0.000029756186,0.000090622634,0.0013451172,0.0011798727,0.009383721],"study_design_scores_gemma":[0.0018307249,0.0004235133,0.8828631,0.000032985947,0.00018590521,0.000003828913,0.0001880528,0.00083102874,0.0024302106,0.09189716,0.018622788,0.0006906684],"about_ca_topic_score_codex":0.000061811894,"about_ca_topic_score_gemma":0.004650371,"teacher_disagreement_score":0.10452961,"about_ca_system_score_codex":0.00006295689,"about_ca_system_score_gemma":0.000037130525,"threshold_uncertainty_score":0.99973434},"labels":[],"label_agreement":null},{"id":"W2308391319","doi":"","title":"The Arab Spring and Online Protests in Iraq","year":2014,"lang":"en","type":"article","venue":"EUR Research Repository (Erasmus University Rotterdam)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Sectarianism; Social media; Political science; Language change; Spring (device); CLIPS; Politics; Media studies; Sociology; Law","score_opus":0.0208846426531513,"score_gpt":0.2820240818799908,"score_spread":0.26113943922683946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2308391319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837002,0.000043653712,0.001202395,0.00062071177,0.000034061697,0.00040406993,0.0000016743602,0.000054847766,0.01393839],"genre_scores_gemma":[0.9962536,0.000011042121,0.0005048562,0.000010163172,0.00024784135,0.000004663434,0.0000034417226,0.000013190396,0.0029512076],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9979638,0.0007085275,0.0001709269,0.00036261053,0.0003483728,0.00044575863],"domain_scores_gemma":[0.9988354,0.00037451836,0.00006569994,0.00047699985,0.00012608919,0.000121331126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009064061,0.00012986294,0.00017022184,0.0002284324,0.0008483717,0.00015593998,0.000472124,0.00003564906,0.000009993842],"category_scores_gemma":[0.000021023314,0.00011578315,0.000068085785,0.0004367583,0.00023477197,0.00015437156,0.00046225532,0.0006150625,0.000007895736],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020973357,0.00035089222,0.91227174,0.000031870833,0.00012514004,0.00011726822,0.0005002526,0.00009439304,0.008832784,0.027550368,0.00265622,0.047259353],"study_design_scores_gemma":[0.0032428894,0.00043776972,0.59980685,0.00034893426,0.000050671882,0.000013728815,0.0017243947,0.036009297,0.0069524036,0.0077764364,0.342737,0.0008996664],"about_ca_topic_score_codex":0.0024140195,"about_ca_topic_score_gemma":0.00037276727,"teacher_disagreement_score":0.34008077,"about_ca_system_score_codex":0.00010203239,"about_ca_system_score_gemma":0.00005500148,"threshold_uncertainty_score":0.6525075},"labels":[],"label_agreement":null},{"id":"W2310244163","doi":"10.1017/nws.2016.1","title":"Homophily, influence and the decay of segregation in self-organizing networks","year":2016,"lang":"en","type":"article","venue":"Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Arizona; National Science Foundation","keywords":"Homophily; Vertex (graph theory); Similarity (geometry); Preferential attachment; Computer science; Phenomenon; Network model; Complex network; Theoretical computer science; Mathematics; Artificial intelligence; Combinatorics; Epistemology; Graph; World Wide Web","score_opus":0.003198444830000384,"score_gpt":0.21694753273386544,"score_spread":0.21374908790386504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2310244163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97538936,0.00019640158,0.021898733,0.000287107,0.000050536444,0.00021010186,5.603904e-7,0.000043441505,0.0019237704],"genre_scores_gemma":[0.9979067,0.00004175559,0.0018347685,0.000033802287,0.0001468052,0.000013731448,3.3053607e-7,0.000006181448,0.000015943551],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988596,0.00007492103,0.00026924,0.0002640775,0.00021833045,0.00031384357],"domain_scores_gemma":[0.9990342,0.00032429677,0.00017040335,0.00031776086,0.00010608425,0.000047231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013940977,0.00010188927,0.00018762152,0.000070326474,0.0001893104,0.000051084822,0.00042106927,0.00002100851,0.000020408372],"category_scores_gemma":[0.000015794303,0.000057648347,0.00003691812,0.0014879683,0.00074706326,0.00029546215,0.00022263113,0.000092495444,0.0000016345494],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024140896,0.000044986962,0.6024598,0.0000033710717,0.000021420807,5.2596897e-7,0.00038936027,0.014746019,0.0014739111,0.31401223,0.00022862571,0.06659562],"study_design_scores_gemma":[0.0028966677,0.00008916725,0.51144713,0.0006463018,0.000100429024,0.000005041859,0.00015607078,0.18695118,0.0052325074,0.2906564,0.0010811232,0.00073803193],"about_ca_topic_score_codex":0.00011902742,"about_ca_topic_score_gemma":0.000028168448,"teacher_disagreement_score":0.17220517,"about_ca_system_score_codex":0.000028316945,"about_ca_system_score_gemma":0.000057120764,"threshold_uncertainty_score":0.27525857},"labels":[],"label_agreement":null},{"id":"W2314169690","doi":"10.1109/cnsc.2014.6906638","title":"Hybrid Mean-Variance Mapping Optimization to determine the number of clusters in network partitioning of Hydro Québec Power Grid","year":2014,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cluster analysis; Computer science; Variance (accounting); Heuristic; Set (abstract data type); Cluster (spacecraft); Grid; Computation; Grid computing; Data mining; Algorithm; Mathematics; Artificial intelligence","score_opus":0.009119107618394491,"score_gpt":0.23679339678410227,"score_spread":0.22767428916570778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314169690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19548225,0.0000065813333,0.79003453,0.00023676535,0.000039797334,0.00015144794,0.0000018517006,0.00002113209,0.014025639],"genre_scores_gemma":[0.9740382,7.5061934e-7,0.0255442,0.000111401256,0.00014604273,0.00002241764,0.000011317324,0.000010333553,0.00011535014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991118,0.000080710946,0.00037839494,0.00015308984,0.000107077234,0.0001689333],"domain_scores_gemma":[0.99931985,0.00013565058,0.0001749704,0.0002800388,0.000060584163,0.000028901255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033479588,0.000096807235,0.00022559862,0.000038518338,0.000047835078,0.000015024336,0.00016568053,0.000012219485,0.00060577434],"category_scores_gemma":[0.0000089626365,0.00007818613,0.000081033075,0.00027616252,0.00003252471,0.000068369285,0.000084925174,0.00006488139,0.0000043216687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011945725,0.000044565306,0.10859232,0.0000057928455,0.00004531542,1.4154803e-7,0.00024269804,0.8791351,0.00009105046,0.005746237,0.0026319658,0.0034529062],"study_design_scores_gemma":[0.00035368785,0.00003790423,0.0052697244,0.00020532498,0.000041624848,8.84513e-7,0.0001455171,0.9840876,0.0022007136,0.0031815483,0.0042099366,0.0002655305],"about_ca_topic_score_codex":0.0043451893,"about_ca_topic_score_gemma":0.00092229433,"teacher_disagreement_score":0.7785559,"about_ca_system_score_codex":0.00001983263,"about_ca_system_score_gemma":0.000021555019,"threshold_uncertainty_score":0.6632804},"labels":[],"label_agreement":null},{"id":"W2318541620","doi":"10.1109/tst.2016.7399279","title":"A comparative analysis on Weibo and Twitter","year":2016,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Assortativity; PageRank; Reciprocity (cultural anthropology); Cluster analysis; Computer science; Clustering coefficient; Centrality; Index (typography); Data mining; World Wide Web; Complex network; Mathematics; Artificial intelligence; Statistics","score_opus":0.019347746646685506,"score_gpt":0.31530193905771525,"score_spread":0.29595419241102977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318541620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94354635,0.000020458481,0.0427927,0.0018558908,0.000022448628,0.000098249984,0.0000031905902,0.00020821451,0.011452502],"genre_scores_gemma":[0.9975684,0.0000013402085,0.0019814586,0.00006561629,0.000034297755,0.000018996423,8.155265e-7,0.000004021397,0.00032501083],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987396,0.000018798903,0.0001755189,0.0005109681,0.00019344217,0.00036167802],"domain_scores_gemma":[0.9991891,0.000057117973,0.00010669394,0.00049912604,0.00008500027,0.00006296254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002547422,0.00014269966,0.0003271862,0.0016147529,0.00024433935,0.00005201314,0.00043625044,0.00003966207,0.0002281323],"category_scores_gemma":[0.000008827835,0.00009378564,0.00007369206,0.0042698556,0.0016963715,0.00013602852,0.000211185,0.00010874521,0.000049871953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020357575,0.0001980498,0.40793437,0.0000014214055,0.00047952266,0.0000035665203,0.00060173386,0.000037978567,0.11069549,0.34101325,0.00092596735,0.13808827],"study_design_scores_gemma":[0.0014774908,0.0011336085,0.076570794,0.00016730986,0.0012833372,0.000009883936,0.0020136659,0.009860373,0.46013954,0.3980524,0.04742247,0.0018691246],"about_ca_topic_score_codex":0.000038155355,"about_ca_topic_score_gemma":0.000009923753,"teacher_disagreement_score":0.34944406,"about_ca_system_score_codex":0.00005358452,"about_ca_system_score_gemma":0.000042749958,"threshold_uncertainty_score":0.62503517},"labels":[],"label_agreement":null},{"id":"W2319319882","doi":"10.5539/cis.v9n2p41","title":"Correlation Analysis between Maximal Clique Size and Centrality Metrics for Random Networks and Scale-Free Networks","year":2016,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Experimental Program to Stimulate Competitive Research; National Aeronautics and Space Administration","keywords":"Betweenness centrality; Centrality; Mathematics; Clique; Metric (unit); Random graph; Correlation; Correlation coefficient; Node (physics); Statistics; Combinatorics; Computer science; Graph; Physics","score_opus":0.008819761130094205,"score_gpt":0.2476525932050505,"score_spread":0.2388328320749563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2319319882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08687719,0.000037069025,0.9124232,0.00013302838,0.000049602826,0.00023304322,0.000018063309,0.000033460878,0.00019535703],"genre_scores_gemma":[0.9885422,0.000054059863,0.011091467,0.00008844676,0.00017618544,0.000012367973,0.000024607409,0.0000027213614,0.000007929559],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893445,0.00003374662,0.00038587308,0.00021842131,0.00017604232,0.0002514542],"domain_scores_gemma":[0.9986639,0.00056044286,0.00020767414,0.00022896288,0.00019889386,0.00014011022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010218174,0.00012687473,0.00027180562,0.00025690146,0.00032428803,0.0003367953,0.00019805641,0.000041949865,0.00000989214],"category_scores_gemma":[0.000029892657,0.000092205184,0.00007243613,0.001113656,0.00026762288,0.0023101221,0.00024668683,0.000068955196,3.3618682e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029287137,0.000008494229,0.5859766,0.0000063400435,0.000092252034,2.175265e-8,0.00014255231,0.0048115635,0.0000027729054,0.007892077,0.00033607418,0.40070197],"study_design_scores_gemma":[0.000698205,0.000028648614,0.30962345,0.000009949841,0.000118959826,3.083062e-7,0.000008892581,0.68712705,0.000011261085,0.0015189033,0.000739614,0.000114781076],"about_ca_topic_score_codex":0.000023746266,"about_ca_topic_score_gemma":0.0000022883505,"teacher_disagreement_score":0.90166503,"about_ca_system_score_codex":0.00002060523,"about_ca_system_score_gemma":0.000019834666,"threshold_uncertainty_score":0.37600183},"labels":[],"label_agreement":null},{"id":"W2320730520","doi":"10.1103/physreve.93.032304","title":"Constrained growth of complex scale-independent systems","year":2020,"lang":"en","type":"article","venue":"Corpus Université Laval (Université Laval)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; James S. McDonnell Foundation","keywords":"Scale (ratio); Statistical physics; Physics; Quantum mechanics","score_opus":0.012417617216672396,"score_gpt":0.19692535233920913,"score_spread":0.18450773512253674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2320730520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7898568,0.00042073207,0.044748243,0.0027713103,0.00025676202,0.0011448127,0.0005552667,0.00077694753,0.15946914],"genre_scores_gemma":[0.9977979,0.00005421277,0.0005789382,0.000055631343,0.00017005841,0.0000011982765,0.00013835462,0.000034834295,0.0011688386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980531,0.00014310009,0.00034591823,0.0005604028,0.00047154567,0.00042598054],"domain_scores_gemma":[0.9983376,0.00009922444,0.00040813355,0.0004036679,0.0003699592,0.0003813622],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011841842,0.00036142595,0.0007047609,0.00024566057,0.00028226146,0.000044514774,0.0008478741,0.00009972256,0.0003293648],"category_scores_gemma":[0.0000048378647,0.00042198857,0.0004316495,0.00092576345,0.00018759792,0.00024516365,0.00046707314,0.0002971624,0.000022798102],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071565574,0.00057023217,0.31424433,0.0002542977,0.002018444,0.0003009829,0.011709419,0.001212061,0.2063201,0.43351972,0.013202649,0.01593211],"study_design_scores_gemma":[0.0329761,0.0044814246,0.1056293,0.0012665887,0.008858619,0.00015399954,0.09314185,0.14218204,0.36391142,0.0095924875,0.2274803,0.010325879],"about_ca_topic_score_codex":0.007796076,"about_ca_topic_score_gemma":0.00026916206,"teacher_disagreement_score":0.42392722,"about_ca_system_score_codex":0.0001799054,"about_ca_system_score_gemma":0.0001624905,"threshold_uncertainty_score":0.9998232},"labels":[],"label_agreement":null},{"id":"W2326892059","doi":"10.1103/physrevlett.111.189602","title":"Son, Grassberger, and Paczuski Reply:","year":2013,"lang":"en","type":"letter","venue":"Physical Review Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Physics; Theoretical physics","score_opus":0.013477281117267004,"score_gpt":0.27914720345110744,"score_spread":0.26566992233384046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2326892059","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013715539,0.009502621,0.0010494784,0.9847254,0.00011536439,0.001004269,0.00003710442,0.00020006155,0.001994156],"genre_scores_gemma":[0.004003981,0.0020643359,0.00037283162,0.9835813,0.008553441,0.0004432603,0.0005240031,0.0001115147,0.0003453435],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973276,0.00023365476,0.0005326914,0.00084851077,0.00044015562,0.00061736983],"domain_scores_gemma":[0.99805427,0.00025975858,0.00044936105,0.0010441865,0.00007354769,0.00011886126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016360861,0.000653878,0.0014305376,0.00008195478,0.00010366424,0.00012582014,0.00046370726,0.000034447494,0.0008023734],"category_scores_gemma":[0.000011384424,0.0005493616,0.00096812495,0.00029493152,0.00015645115,0.00014695783,0.0002383864,0.0012286699,0.00034111968],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.7876106e-7,0.000027281541,0.00016531626,0.00056918414,0.00026558308,0.000010591708,0.0000087527005,7.599999e-7,0.00008534229,0.00020606004,0.9890404,0.009620361],"study_design_scores_gemma":[0.00006529008,0.000014674295,0.00005519449,0.0015315837,0.00066436187,0.0000011060574,7.1995373e-7,0.00021617564,0.000017146673,0.0031324388,0.9937009,0.0006004111],"about_ca_topic_score_codex":0.0002658068,"about_ca_topic_score_gemma":4.2168307e-7,"teacher_disagreement_score":0.00901995,"about_ca_system_score_codex":0.00003975869,"about_ca_system_score_gemma":0.000022014663,"threshold_uncertainty_score":0.9996958},"labels":[],"label_agreement":null},{"id":"W2327014027","doi":"10.1177/0002764214556802","title":"Advice Giving and Receiving Within a Research Network","year":2014,"lang":"en","type":"article","venue":"American Behavioral Scientist","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Advice (programming); Centrality; Social network (sociolinguistics); Context (archaeology); Social network analysis; Enabling; Information exchange; Public relations; Computer science; Psychology; Knowledge management; Social media; Social psychology; World Wide Web; Political science; Telecommunications","score_opus":0.03051991729782189,"score_gpt":0.3685554830135665,"score_spread":0.3380355657157446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2327014027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9871376,0.000019401294,0.0049893,0.000102886755,0.00009867289,0.00013761668,0.00000392623,0.00012888279,0.0073816995],"genre_scores_gemma":[0.9859968,0.0000011338126,0.012547599,0.00003174002,0.0002974565,0.000030595733,0.0000101910655,0.00001931738,0.0010651968],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980249,0.00026734706,0.0002335094,0.0004669733,0.0003817207,0.00062558835],"domain_scores_gemma":[0.9990475,0.00012383173,0.0001500917,0.00038870203,0.00011692644,0.00017293236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017538174,0.00013716707,0.00024838088,0.00012128017,0.00067179656,0.00026391,0.00030029134,0.000015040151,0.00021282591],"category_scores_gemma":[0.000011168166,0.00013375978,0.00006284238,0.0014345174,0.00073983864,0.00013656609,0.00036300818,0.0002863535,0.000022559228],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004944017,0.00008875896,0.75767726,0.0000024617148,0.000011530994,0.0000014183576,0.00026989833,0.000067561916,0.0007306438,0.011880575,0.008872513,0.22039242],"study_design_scores_gemma":[0.00081377797,0.0011576609,0.74963665,0.00037187684,0.000256787,0.000013247393,0.0034036261,0.04001622,0.00085324433,0.030928474,0.17049012,0.0020582965],"about_ca_topic_score_codex":0.008814586,"about_ca_topic_score_gemma":0.00071356294,"teacher_disagreement_score":0.21833412,"about_ca_system_score_codex":0.00003667185,"about_ca_system_score_gemma":0.000026063139,"threshold_uncertainty_score":0.9977858},"labels":[],"label_agreement":null},{"id":"W2329603662","doi":"10.1103/physrevlett.110.108103","title":"Pathogen Mutation Modeled by Competition Between Site and Bond Percolation","year":2013,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"National Science Foundation","keywords":"Percolation (cognitive psychology); Competition (biology); Coevolution; Statistical physics; Hysteresis; Physics; Mutation; Percolation theory; Phase transition; Biology; Evolutionary biology; Condensed matter physics; Ecology; Genetics; Neuroscience; Quantum mechanics; Conductivity","score_opus":0.00925278613305592,"score_gpt":0.2650740402716704,"score_spread":0.2558212541386145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2329603662","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94070464,0.00058098434,0.055591576,0.0022337758,0.000005473643,0.00052351557,0.00002860964,0.000052184234,0.00027922605],"genre_scores_gemma":[0.9970313,0.00009676805,0.0006760626,0.0012019593,0.00022343225,0.00012324152,0.00062816753,0.000013232496,0.000005888755],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992212,0.000087916065,0.00019585715,0.00021520695,0.00013682376,0.00014299004],"domain_scores_gemma":[0.99955803,0.000081266306,0.00010654932,0.00015201869,0.00004001158,0.00006210043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008963216,0.0001344475,0.00029101936,0.000022139131,0.000078365476,0.000048624814,0.00006245087,0.0000059155273,0.00010626624],"category_scores_gemma":[0.0000027209353,0.00012223024,0.000107895125,0.0001342997,0.000029983512,0.00024104517,0.000031578413,0.000116687916,0.00008301715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007367225,0.0004881796,0.10741461,0.0010516144,0.0004966113,0.0000017244048,0.00071046205,0.00051374314,0.42408553,0.012952457,0.1329739,0.3193038],"study_design_scores_gemma":[0.002475964,0.00037457125,0.1428244,0.004726138,0.003468913,0.0000034576794,0.00013594986,0.6815365,0.006097718,0.110352345,0.043894574,0.004109495],"about_ca_topic_score_codex":0.00012764556,"about_ca_topic_score_gemma":4.7537083e-7,"teacher_disagreement_score":0.68102276,"about_ca_system_score_codex":0.00001818555,"about_ca_system_score_gemma":0.0000032661185,"threshold_uncertainty_score":0.49844047},"labels":[],"label_agreement":null},{"id":"W2332703424","doi":"10.5465/ambpp.2014.12549abstract","title":"The Power of Words Online: Explaining Tie Formation of New Members in Open-Source Online Communities","year":2014,"lang":"en","type":"article","venue":"Academy of Management Proceedings","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mainstream; Context (archaeology); Online community; Computer science; Cluster analysis; Key (lock); Interpersonal ties; Data science; Mechanism (biology); World Wide Web; Psychology; Political science; Social psychology; Artificial intelligence; Epistemology; History; Computer security","score_opus":0.029896583564262037,"score_gpt":0.30092688312680693,"score_spread":0.2710302995625449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332703424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9715153,0.00005595965,0.004039168,0.0009506587,0.000011827479,0.00043352533,0.0000049267387,0.000027918762,0.02296072],"genre_scores_gemma":[0.9946799,0.0000604405,0.004528787,0.00007515506,0.000042201977,0.000013999633,0.000019831203,0.000013898046,0.0005657617],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989062,0.00002171042,0.00055268407,0.000107847656,0.00023568062,0.00017589395],"domain_scores_gemma":[0.99912417,0.00009050073,0.00059387175,0.000115814284,0.000048337097,0.000027309445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073445984,0.00012841848,0.0003012744,0.00017069143,0.00006909268,0.000033064596,0.00091598736,0.000034907036,0.000045373094],"category_scores_gemma":[0.000006828427,0.000108389635,0.00007510892,0.0003746792,0.00008345716,0.00038912173,0.00066788285,0.00020737071,3.778494e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017806598,0.0005651969,0.044196595,0.00038702664,0.00047779462,4.2624006e-8,0.014695734,0.0006804205,0.00030792964,0.4123544,0.030830644,0.49532616],"study_design_scores_gemma":[0.0046718684,0.0005310053,0.041780047,0.0031621277,0.0005673512,7.23278e-7,0.23717405,0.07106364,0.014244148,0.08540526,0.5403037,0.0010960421],"about_ca_topic_score_codex":0.0002875496,"about_ca_topic_score_gemma":0.000018441757,"teacher_disagreement_score":0.5094731,"about_ca_system_score_codex":0.000016618376,"about_ca_system_score_gemma":0.0000051872053,"threshold_uncertainty_score":0.4420001},"labels":[],"label_agreement":null},{"id":"W2341382548","doi":"10.1007/978-1-4614-6170-8_100123","title":"Mining Social Media Data","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Social media; Data science; Computer science; World Wide Web","score_opus":0.06238106495918707,"score_gpt":0.2872716593374611,"score_spread":0.22489059437827405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341382548","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000055706637,0.00002759343,0.02539434,0.00007214063,0.00006921858,0.000058768197,0.000084888,0.00011888849,0.9741686],"genre_scores_gemma":[0.050871946,0.0000052672945,0.0070434716,0.00010613382,0.0095811505,0.0000068565796,0.0061744284,0.00011723617,0.9260935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892986,0.000010134404,0.00026840763,0.00042183808,0.00019923484,0.00017050795],"domain_scores_gemma":[0.9987496,0.00013347952,0.00018909293,0.0008378266,0.00004296076,0.000047043803],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015513982,0.0002500833,0.00042865257,0.000073913616,0.00008966838,0.000050970208,0.0007471911,0.00010116236,0.014131327],"category_scores_gemma":[0.0000021993073,0.0002390494,0.0001588732,0.000016959182,0.000054549528,0.000036830752,0.00065422396,0.00021725736,0.00020039328],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.7446185e-7,0.0000027061224,0.000025823794,0.0000018343277,0.0001268837,3.6238345e-7,0.000026652306,1.0231764e-7,6.9918315e-7,0.61341137,0.2750058,0.11139701],"study_design_scores_gemma":[0.00005611628,0.0000033751094,0.0000075593002,0.000023155955,0.00017270497,1.0514448e-7,0.000011847681,0.0004405828,0.00000430318,0.0812719,0.9177177,0.00029067768],"about_ca_topic_score_codex":0.00002505995,"about_ca_topic_score_gemma":0.000058210248,"teacher_disagreement_score":0.6427119,"about_ca_system_score_codex":0.000011814599,"about_ca_system_score_gemma":0.00003159501,"threshold_uncertainty_score":0.9867699},"labels":[],"label_agreement":null},{"id":"W2342118945","doi":"","title":"Complex Network Analysis of Highway Network in Guangdong Province in China","year":2016,"lang":"en","type":"article","venue":"Canadian social science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Betweenness centrality; Centrality; Closeness; China; Complex network; Computer science; Topology (electrical circuits); Degree distribution; Economic geography; Space (punctuation); Regional science; Geography; Transport engineering; Mathematics; Statistics; Engineering; Combinatorics","score_opus":0.011322289471588505,"score_gpt":0.25707468885723755,"score_spread":0.24575239938564905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342118945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88287926,0.00005200363,0.0045725117,0.00079674134,0.00012157485,0.000440286,0.00007729145,0.00004415396,0.11101619],"genre_scores_gemma":[0.9991177,0.0000013032338,0.00042016114,0.00006071347,0.00028366336,0.000014070007,0.000009486509,0.0000072241005,0.000085686195],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99814636,0.00007878957,0.00035099545,0.00036927965,0.00024242188,0.0008121836],"domain_scores_gemma":[0.9992816,0.000058930615,0.00015111867,0.00024981174,0.000059408234,0.00019915767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084901054,0.00012957252,0.00040215164,0.00054137286,0.00022251454,0.000038959006,0.0006120975,0.0000376697,0.00041234453],"category_scores_gemma":[0.00001104676,0.000112760536,0.00013335186,0.007054535,0.00047482326,0.00017643876,0.00008445044,0.00010074537,0.0000034415466],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022926379,0.0000128582715,0.9035254,8.649665e-7,0.000037520273,0.0000024748215,0.00013565169,0.0006277703,0.00015079929,0.07611982,0.001505281,0.017879264],"study_design_scores_gemma":[0.00013136341,0.000009414035,0.98594695,0.00003152944,0.00005233674,3.4657642e-8,0.00006390832,0.0036161328,0.000023868168,0.005938593,0.0039819977,0.00020386567],"about_ca_topic_score_codex":0.09271013,"about_ca_topic_score_gemma":0.42733273,"teacher_disagreement_score":0.33462262,"about_ca_system_score_codex":0.0004668278,"about_ca_system_score_gemma":0.00057948485,"threshold_uncertainty_score":0.91333157},"labels":[],"label_agreement":null},{"id":"W2342671210","doi":"10.1109/tkde.2016.2525993","title":"Clearing Contamination in Large Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Clearing; Graph; Mathematical optimization; Theoretical computer science; Algorithm; Mathematics","score_opus":0.014555985345564236,"score_gpt":0.2634419975948157,"score_spread":0.24888601224925144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342671210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01841407,0.000077771765,0.98082787,0.000016688615,0.00009217781,0.000070859576,0.000040202005,0.00007079214,0.0003895967],"genre_scores_gemma":[0.99926037,0.000035348166,0.0004299923,0.0000032250753,0.00009645808,0.000017157685,0.000016796874,0.00001453145,0.00012609633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993988,0.000013741275,0.00014499741,0.00022572403,0.00003993278,0.00017679716],"domain_scores_gemma":[0.99950945,0.000098438366,0.000018262148,0.00031797038,0.000015066336,0.00004078149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015889126,0.000102090125,0.00012317176,0.00013214689,0.000048854323,0.000021072177,0.00014069646,0.00002836794,0.00008448507],"category_scores_gemma":[9.637107e-7,0.00008645706,0.000026448597,0.00016919729,0.00000827747,0.00023964753,0.000007326276,0.000116164454,0.000009892194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022896242,0.0003963704,0.008249252,0.000024549743,0.00014492651,0.000002522794,0.00022594647,0.015610766,0.0019748753,0.005240167,0.0004813315,0.9676264],"study_design_scores_gemma":[0.0009128187,0.00003297266,0.0057540527,0.00024440902,0.00004834311,9.559981e-7,0.000037581172,0.9813463,0.002689136,0.00010853225,0.008496715,0.0003281516],"about_ca_topic_score_codex":0.000018911132,"about_ca_topic_score_gemma":0.000062314735,"teacher_disagreement_score":0.98084635,"about_ca_system_score_codex":0.000022674245,"about_ca_system_score_gemma":0.000006393158,"threshold_uncertainty_score":0.35256168},"labels":[],"label_agreement":null},{"id":"W2342989779","doi":"10.4236/jamp.2016.44078","title":"Measuring the Evolution and Influence in Society’s Information Networks","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Mathematics and Physics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Beijing Intelligent Logistics System Collaborative Innovation Center; Beijing Wuzi University; Beijing Key Laboratory of Intelligent Logistics System; National Natural Science Foundation of China","keywords":"Computer science; Information flow; Reliability (semiconductor); The Internet; Diffusion; Flow (mathematics); Mechanism (biology); Order (exchange); Sensitivity (control systems); Complex network; Value (mathematics); Econometrics; Data mining; Machine learning; Mathematics","score_opus":0.009075594936954852,"score_gpt":0.21289696698028251,"score_spread":0.20382137204332768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342989779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3733337,0.000039932707,0.62538123,0.00008242072,0.000010520775,0.00008803939,9.3738197e-7,0.0000047679837,0.001058447],"genre_scores_gemma":[0.991633,0.00004328785,0.008163022,0.000020966843,0.00012890749,0.0000041512426,2.9822317e-7,0.0000042899414,0.0000021081307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943227,0.0000050244785,0.00030536365,0.000041070958,0.00012272446,0.00009357724],"domain_scores_gemma":[0.99935126,0.000113264134,0.000340042,0.00008723382,0.000081456135,0.000026759002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035062045,0.00007754255,0.00015662645,0.000017474249,0.000059833757,0.000056113695,0.000081314894,0.000019066403,0.0000025786264],"category_scores_gemma":[0.000003093402,0.00004262415,0.00005138139,0.000109380235,0.000047206846,0.00027221162,0.000047323294,0.000112445945,5.2645623e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020620499,0.00009160141,0.005815825,0.000055079745,0.0001503057,1.5951292e-7,0.003058068,0.0043589133,0.002338619,0.73522455,0.00039895307,0.24848732],"study_design_scores_gemma":[0.0007059948,0.000034461667,0.0050821234,0.00027928772,0.00009273345,0.0000035015762,0.001286297,0.0585947,0.00059170515,0.93269444,0.00044196827,0.0001927995],"about_ca_topic_score_codex":0.0000069221,"about_ca_topic_score_gemma":8.1985127e-7,"teacher_disagreement_score":0.61829925,"about_ca_system_score_codex":0.000024468638,"about_ca_system_score_gemma":0.000017545372,"threshold_uncertainty_score":0.17381625},"labels":[],"label_agreement":null},{"id":"W2343463516","doi":"10.1101/050435","title":"Reconstructing contact network parameters from viral phylogenies","year":2016,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; AIDS Vancouver","funders":"Canadian Institutes of Health Research; Michael Smith Health Research BC; Providence Health Care; St. Paul's Foundation; Bill and Melinda Gates Foundation","keywords":"Approximate Bayesian computation; Kernel (algebra); Preferential attachment; Computer science; Population; Inference; Transmission (telecommunications); Algorithm; Data mining; Artificial intelligence; Complex network; Mathematics","score_opus":0.012869690570861743,"score_gpt":0.21926850152404093,"score_spread":0.2063988109531792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343463516","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96667975,0.0005876734,0.029316438,0.0000871791,0.0012865548,0.000603813,0.00063276687,0.0006624088,0.00014341275],"genre_scores_gemma":[0.97146976,0.00002352739,0.024751354,0.000070898415,0.00329647,0.00022447163,0.0000021295364,0.0001573489,0.0000040511745],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9962739,0.00026061593,0.0008843561,0.0013370124,0.00033320737,0.0009109196],"domain_scores_gemma":[0.9964258,0.0002948442,0.000989489,0.0017442683,0.0002798293,0.00026575086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046144144,0.0008359467,0.0011167369,0.00017694112,0.00028239386,0.00038175893,0.0008973526,0.00035214153,0.0004557522],"category_scores_gemma":[0.000032295073,0.00081492023,0.0005812696,0.00031426686,0.00015555958,0.00017979827,0.0008719184,0.00091515173,0.000079451405],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008556134,0.0001762461,0.7118862,0.00008179952,0.003844256,0.00003354929,0.000019428922,0.0003327167,0.26165026,0.016774962,0.004873765,0.00024123906],"study_design_scores_gemma":[0.003345336,0.0002433303,0.17041154,0.005620935,0.0031845488,2.3041194e-8,0.00003191285,0.0075541586,0.7631865,0.010983395,0.025058383,0.010379925],"about_ca_topic_score_codex":0.00047316472,"about_ca_topic_score_gemma":0.0000036228712,"teacher_disagreement_score":0.5414747,"about_ca_system_score_codex":0.00019897429,"about_ca_system_score_gemma":0.00028138756,"threshold_uncertainty_score":0.9994302},"labels":[],"label_agreement":null},{"id":"W2347830075","doi":"","title":"Measurement and Analysis of Information Propagation in Online Social Networks Like Microblog","year":2013,"lang":"en","type":"article","venue":"Xi'an Jiaotong Daxue xuebao","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Microblogging; Popularity; Social media; GRASP; Statistic; Computer science; Connotation; The Internet; Social network (sociolinguistics); World Wide Web; Statistics; Mathematics; Psychology; Social psychology","score_opus":0.012907354974128737,"score_gpt":0.24298120442043025,"score_spread":0.23007384944630152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2347830075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9351002,0.000041900206,0.06350328,0.00010240195,0.000028974477,0.0005359951,0.00002312677,0.000048532096,0.00061562174],"genre_scores_gemma":[0.9976557,0.0000031387706,0.0015343754,0.00005451829,0.00010150779,0.00007145707,0.00055174576,0.0000092237315,0.00001835551],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99870014,0.00009782713,0.0005493797,0.00018805444,0.0002403935,0.00022421223],"domain_scores_gemma":[0.99916375,0.000016489454,0.00029306707,0.00022595556,0.00024384822,0.000056883095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039687924,0.00015948468,0.00038017303,0.00042166028,0.00008271781,0.00009225929,0.00014989353,0.000060854487,0.00018183417],"category_scores_gemma":[0.000004824184,0.0001565865,0.00012479033,0.0008913155,0.00005370256,0.0006464887,0.00006897618,0.00015673233,0.000003609814],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057286572,0.000961561,0.6592025,0.000070896895,0.002201708,6.236618e-7,0.0030312277,0.018287243,0.0055227373,0.007953092,0.0029934272,0.29971766],"study_design_scores_gemma":[0.000526129,0.00006545167,0.52417934,0.00004629761,0.0006361411,1.8102139e-7,0.000458614,0.47096622,0.0004972296,0.0013010233,0.0009833016,0.00034008778],"about_ca_topic_score_codex":0.0019776213,"about_ca_topic_score_gemma":0.00059945445,"teacher_disagreement_score":0.45267898,"about_ca_system_score_codex":0.00006320193,"about_ca_system_score_gemma":0.000032693933,"threshold_uncertainty_score":0.63854116},"labels":[],"label_agreement":null},{"id":"W2348265194","doi":"","title":"Attractive Factors-based Scale-free Networks Evolving Model","year":2008,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Correctness; Scale-free network; Computer science; Degree distribution; Preferential attachment; Factor (programming language); Scale (ratio); Degree (music); Complex network; Network model; Scale factor (cosmology); Statistical physics; Data mining; Algorithm; Physics","score_opus":0.02560555983347514,"score_gpt":0.2540671082845528,"score_spread":0.22846154845107766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2348265194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16969875,0.00002287522,0.7883072,0.000046376696,0.000021655624,0.00011954621,0.000007523859,0.00021210471,0.04156401],"genre_scores_gemma":[0.9820353,0.0000012738435,0.016643124,0.00006826459,0.00020858708,0.000021284748,0.000049783477,0.000026587322,0.00094584125],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891895,0.00003280509,0.00022868214,0.00030159065,0.00018952717,0.00032846676],"domain_scores_gemma":[0.99899447,0.00011278136,0.000097329554,0.0005905339,0.00010237789,0.00010251945],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000075272386,0.0002108194,0.00026823644,0.0000761241,0.00030234232,0.00003386272,0.00034503985,0.000046396515,0.0011170628],"category_scores_gemma":[0.0000037831303,0.00018602984,0.00024916275,0.00023667514,0.00006784729,0.00018029267,0.000109551,0.000226942,0.000010631454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019738754,0.00036652692,0.55243087,0.0000027877056,0.00017743246,0.0000025679244,0.00021767433,0.37974703,0.00026248067,0.0065061357,0.057561554,0.002705199],"study_design_scores_gemma":[0.00021430428,0.00001597833,0.009349658,0.000008477276,0.00003359458,2.1998721e-7,0.000040706997,0.9843322,0.0013526295,0.004234413,0.00017452092,0.00024330383],"about_ca_topic_score_codex":0.00044691522,"about_ca_topic_score_gemma":0.00003806983,"teacher_disagreement_score":0.8123365,"about_ca_system_score_codex":0.000041362422,"about_ca_system_score_gemma":0.000054068776,"threshold_uncertainty_score":0.99979603},"labels":[],"label_agreement":null},{"id":"W2354717916","doi":"","title":"Measurement and Analysis of Online Social Networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Merge (version control); Computer science; Social network (sociolinguistics); Preferential attachment; The Internet; World Wide Web; Network topology; Data science; Internet topology; Social media; Enhanced Data Rates for GSM Evolution; Clustering coefficient; Cluster analysis; Complex network; Topology (electrical circuits); Internet privacy; Computer network; Artificial intelligence; Mathematics; Information retrieval","score_opus":0.01843048509881608,"score_gpt":0.26592317887438954,"score_spread":0.24749269377557345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2354717916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11583499,0.00003498919,0.8760369,0.00009705315,0.000008301237,0.00004493126,0.0000043320792,0.000032736425,0.007905796],"genre_scores_gemma":[0.9983643,0.0000012070967,0.001381989,0.0000297299,0.00014870256,0.0000026518312,0.000030769777,0.000004210233,0.000036392183],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942905,0.000039224138,0.0001757545,0.00011963985,0.00013909221,0.000097220756],"domain_scores_gemma":[0.99967015,0.000016937625,0.000079663965,0.00011936932,0.00008765925,0.000026224858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002453906,0.000069559435,0.0002641908,0.000100044024,0.00004424934,0.000011203312,0.00006601653,0.00001554512,0.0002644684],"category_scores_gemma":[0.0000016209242,0.000060189734,0.000147535,0.00041986528,0.00002877898,0.00001898641,0.000044712524,0.000045038796,2.8165087e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010152145,0.0002812769,0.59024084,0.0000048034685,0.0046819435,4.748611e-8,0.00009088067,0.0048995516,0.00030170503,0.1042409,0.0030919549,0.29215595],"study_design_scores_gemma":[0.00016373067,0.000025255658,0.27878118,0.0000050697017,0.0019664087,1.3469262e-8,0.00005225447,0.7137134,0.00015932506,0.0027780465,0.002206448,0.00014886384],"about_ca_topic_score_codex":0.00019508057,"about_ca_topic_score_gemma":0.00013029044,"teacher_disagreement_score":0.8825294,"about_ca_system_score_codex":0.000006846698,"about_ca_system_score_gemma":0.00000490203,"threshold_uncertainty_score":0.28957435},"labels":[],"label_agreement":null},{"id":"W2359449710","doi":"","title":"Review of the Interdependent Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Air (Canada)","funders":"","keywords":"Interdependent networks; Interdependence; Cascading failure; Robustness (evolution); Computer science; Network topology; Distributed computing; Complex network; Scale-free network; Topology (electrical circuits); Computer network; Mathematics; Electric power system","score_opus":0.005974260540663077,"score_gpt":0.24030204444842257,"score_spread":0.2343277839077595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2359449710","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044904556,0.008859193,0.37552577,0.0018228671,0.00012988348,0.0009188903,0.0000014567288,0.00008995293,0.60816157],"genre_scores_gemma":[0.9981602,0.00017075308,0.0003167057,0.00056370406,0.00008285243,0.00002237677,0.0000023514515,0.0000042553247,0.0006767903],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995911,0.00004645247,0.00016611074,0.00006546352,0.000056326477,0.00007453279],"domain_scores_gemma":[0.9995484,0.000016127455,0.000076296354,0.0002941146,0.000049129463,0.000015932357],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000102013815,0.000050518676,0.00010891324,0.000007457779,0.000020562718,0.000008641423,0.00021912702,0.0000055091277,0.007873481],"category_scores_gemma":[0.0000011626407,0.000028151164,0.00014896471,0.00010697903,0.000018261024,0.000028648861,0.0001389456,0.00006147246,0.000028906186],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.2627338e-7,0.00006837978,0.04106137,0.00013566294,0.000118204596,2.6485955e-8,0.000014598081,0.00009441474,0.000056685076,0.028555157,0.7270323,0.20286286],"study_design_scores_gemma":[0.0009496359,0.00014769698,0.13316517,0.033513617,0.000961307,0.0000036522622,0.0004564959,0.12232479,0.0105245905,0.15290366,0.543104,0.0019454249],"about_ca_topic_score_codex":0.00029064782,"about_ca_topic_score_gemma":0.0000038475628,"teacher_disagreement_score":0.99366975,"about_ca_system_score_codex":0.000004084857,"about_ca_system_score_gemma":0.000004016009,"threshold_uncertainty_score":0.99303347},"labels":[],"label_agreement":null},{"id":"W2375284075","doi":"","title":"Order Affection in Bottom-up Merging Community Detection Strategies Based on Modularity","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Modularity (biology); Affection; Computer science; Community structure; Flowchart; Complex network; Field (mathematics); Order (exchange); Theoretical computer science; Artificial intelligence; Data mining; World Wide Web; Mathematics; Programming language; Psychology; Statistics","score_opus":0.010565303488961597,"score_gpt":0.2728343902412986,"score_spread":0.26226908675233696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2375284075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76015556,5.0817664e-7,0.2246785,0.00003605076,0.000092887036,0.00011231465,8.9815524e-7,0.000127434,0.014795827],"genre_scores_gemma":[0.9977456,1.2879258e-7,0.0020124812,0.000026162792,0.000094841154,0.000032907476,0.000019882273,0.000011103903,0.00005692389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924064,0.0001970465,0.00014986939,0.00014248944,0.00010833671,0.00016163668],"domain_scores_gemma":[0.9993758,0.00010269127,0.000055719105,0.0003783942,0.000056050285,0.00003133473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044382544,0.00012526257,0.0001446828,0.00015218333,0.00021556875,0.00008438903,0.000121449935,0.00005162808,0.00045488027],"category_scores_gemma":[0.0000074472996,0.0001202237,0.00007154862,0.00040016446,0.000030497744,0.00016112384,0.000033012337,0.0009500671,0.0000076282768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018044624,0.0023910825,0.23878635,0.000047763195,0.00015763739,0.0000016799845,0.00069101324,0.03824931,0.2491482,0.10173637,0.0005990736,0.36801106],"study_design_scores_gemma":[0.00066522753,0.00012899109,0.06672491,0.00002446629,0.000032660904,2.8661498e-7,0.00091317325,0.826487,0.0673985,0.036660463,0.0005664859,0.00039780387],"about_ca_topic_score_codex":0.011195371,"about_ca_topic_score_gemma":0.010955562,"teacher_disagreement_score":0.7882377,"about_ca_system_score_codex":0.000025338974,"about_ca_system_score_gemma":0.000027916329,"threshold_uncertainty_score":0.99538916},"labels":[],"label_agreement":null},{"id":"W2388195600","doi":"","title":"Comparison between China's and USA's Spatial Structure of Crude Oil Importing Trade Based on Complex Network Theory","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"China; Diversification (marketing strategy); Crude oil; International trade; SAFER; Business; Economics; Economy; Geography; International economics; Engineering; Mathematics; Statistics; Marketing","score_opus":0.013033234659234389,"score_gpt":0.2904044676145419,"score_spread":0.2773712329553075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2388195600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94112164,0.0000051879847,0.05067708,0.00010395171,0.00005052749,0.00009566575,0.000039364768,0.00006296101,0.007843631],"genre_scores_gemma":[0.98899317,2.0925195e-7,0.009860727,0.00004957523,0.00090737955,0.0000032997216,0.00013198041,0.00002334119,0.000030297184],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985825,0.00010347117,0.00051189656,0.00029680596,0.00020407031,0.00030128253],"domain_scores_gemma":[0.99888057,0.0002440517,0.00036671257,0.00038579412,0.000021664038,0.00010123766],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027753314,0.00023563622,0.0005448742,0.00006706546,0.00015444183,0.000045215693,0.00022451428,0.00007097077,0.0021296772],"category_scores_gemma":[0.000006368547,0.00019764884,0.00014377039,0.00017294164,0.00012315887,0.000043319105,0.00007541358,0.0004506174,9.721526e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023292554,0.0000565394,0.8851469,0.000009376816,0.00007575351,2.1379222e-7,0.000051701423,0.000810809,0.007192378,0.01792114,0.00077763066,0.08793423],"study_design_scores_gemma":[0.00045147556,0.00010277807,0.92381436,0.000030467978,0.00013852812,2.3742908e-7,0.000031665615,0.045976337,0.012183538,0.015744265,0.0011946282,0.00033172726],"about_ca_topic_score_codex":0.000609337,"about_ca_topic_score_gemma":0.0002985993,"teacher_disagreement_score":0.08760251,"about_ca_system_score_codex":0.0000066909815,"about_ca_system_score_gemma":0.000024880277,"threshold_uncertainty_score":0.9987825},"labels":[],"label_agreement":null},{"id":"W2392680035","doi":"","title":"Network structure of 'space of flows' in Jilin Province based on telecommunication flows","year":2014,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Metropolitan area; Space (punctuation); Hierarchy; Information flow; Node (physics); Telecommunications; Geography; Regional science; Computer science; Economic geography; Engineering; Political science","score_opus":0.005918087212552971,"score_gpt":0.23383377278428827,"score_spread":0.2279156855717353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2392680035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8223721,0.000026509095,0.15452375,0.0002699009,0.000028714487,0.000440855,0.0000113234,0.000055475168,0.02227143],"genre_scores_gemma":[0.9625452,5.683687e-7,0.037236203,0.000028178552,0.00007871904,0.0000058456235,0.000040602445,0.000010196664,0.000054449672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991398,0.00013923172,0.00030961976,0.00015083145,0.00011999171,0.00014056085],"domain_scores_gemma":[0.99891084,0.00016873506,0.00017873228,0.0006618776,0.000057069192,0.00002275645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020362588,0.000110325585,0.0002732359,0.000075796044,0.000023868484,0.0000064698243,0.00028343796,0.000036193218,0.00038607093],"category_scores_gemma":[0.000007666393,0.00009728294,0.00007633782,0.00030472712,0.00002320955,0.000034467557,0.00005705702,0.00013994426,0.0000012263954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010307359,0.00043272588,0.14502633,0.000050731,0.00005833097,9.2928516e-8,0.00008605747,0.65642995,0.0145426225,0.1191566,0.0031564368,0.060957093],"study_design_scores_gemma":[0.00036968518,0.000115575844,0.0077971695,0.00009341994,0.000022510481,2.2309882e-8,0.00001916316,0.9544205,0.020405844,0.014917058,0.0016765518,0.00016249444],"about_ca_topic_score_codex":0.0005151187,"about_ca_topic_score_gemma":0.0010473283,"teacher_disagreement_score":0.2979906,"about_ca_system_score_codex":0.00001564143,"about_ca_system_score_gemma":0.000038116807,"threshold_uncertainty_score":0.42272058},"labels":[],"label_agreement":null},{"id":"W2392727782","doi":"10.1371/journal.pone.0154655","title":"Topology of Innovation Spaces in the Knowledge Networks Emerging through Questions-And-Answers","year":2016,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Ranking (information retrieval); Class (philosophy); Theoretical computer science; Topology (electrical circuits); Data science; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.0400178646261696,"score_gpt":0.2903468315793003,"score_spread":0.25032896695313067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2392727782","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9328632,0.00028032245,0.055854775,0.0024471467,0.000016349335,0.00018661954,0.0000026563307,0.000032176067,0.008316778],"genre_scores_gemma":[0.9979895,0.000035683723,0.0016249389,0.000027010941,0.00017804925,0.000032003565,0.0000055460528,0.0000057194916,0.000101564496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939233,0.000083732695,0.00022458594,0.00011386119,0.00006723581,0.00011822904],"domain_scores_gemma":[0.9994781,0.00015516258,0.00010538536,0.00016819192,0.00008642213,0.000006734868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002381847,0.00006834552,0.00015810921,0.00007574198,0.000042003016,0.0000090398935,0.00010828734,0.000023760265,0.00009051374],"category_scores_gemma":[0.000011936202,0.00004329179,0.000020514459,0.00050752505,0.0000787583,0.000077814024,0.000041595697,0.00007538849,0.0000021794403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012201408,0.0007846181,0.23190044,0.000014828195,0.0002344847,2.7835853e-7,0.0013479416,0.000027610657,0.0049723177,0.728796,0.0008354047,0.031073866],"study_design_scores_gemma":[0.003151673,0.0006665159,0.1225174,0.002747537,0.0012019137,0.0000017320257,0.004310325,0.023683207,0.04467594,0.7794974,0.01595641,0.0015899936],"about_ca_topic_score_codex":0.00015634023,"about_ca_topic_score_gemma":0.000039375893,"teacher_disagreement_score":0.10938304,"about_ca_system_score_codex":0.000010216871,"about_ca_system_score_gemma":0.000011640642,"threshold_uncertainty_score":0.1765388},"labels":[],"label_agreement":null},{"id":"W2394964303","doi":"10.14288/1.0076448","title":"Topic modeling for infrastructure-related discussions in online social media","year":2015,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Social media; Computer science; Public relations; Internet privacy; Sociology; Data science; Media studies; World Wide Web; Business; Political science","score_opus":0.017004478708379636,"score_gpt":0.21685886990881512,"score_spread":0.19985439120043547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394964303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98437506,0.00001974987,0.014532883,0.000094836956,0.00005126177,0.00014708916,0.00018232243,0.000038582235,0.0005582038],"genre_scores_gemma":[0.99732757,0.000002336692,0.0022404946,0.0000049938994,0.000091604816,8.026017e-7,0.00019260374,0.000008748353,0.00013085624],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993435,0.00003106819,0.00013654753,0.00020107545,0.00011751351,0.00017029543],"domain_scores_gemma":[0.99958545,0.000028983353,0.00007884056,0.00011554829,0.00011816182,0.00007302957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010246772,0.000036640486,0.00023811884,0.000046882502,0.00010910967,0.000029916233,0.00020543206,0.00005724692,0.000085072],"category_scores_gemma":[0.000009690477,0.000109805675,0.00013245363,0.0002477813,0.00006522008,0.00013221285,0.00010251876,0.000120817516,0.0000010394516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011253711,0.00021912764,0.04122793,0.000013010249,0.00008328436,0.0000072990106,0.0015237413,0.0019826647,0.000042413038,0.0001782574,0.006606211,0.9481048],"study_design_scores_gemma":[0.0019198577,0.000029232286,0.8108615,0.000083325045,0.00008409355,0.0000013121337,0.008227591,0.100863,3.46275e-7,0.07732737,0.00033607517,0.000266245],"about_ca_topic_score_codex":0.026948733,"about_ca_topic_score_gemma":0.13636287,"teacher_disagreement_score":0.94783854,"about_ca_system_score_codex":0.00005106303,"about_ca_system_score_gemma":0.000060536735,"threshold_uncertainty_score":0.9795309},"labels":[],"label_agreement":null},{"id":"W2397142713","doi":"","title":"Detecting Emergent Behavior in Distributed Systems Caused by Overgeneralization.","year":2012,"lang":"en","type":"article","venue":"Software Engineering and Knowledge Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Distributed computing","score_opus":0.008145317801078446,"score_gpt":0.22764957981304418,"score_spread":0.21950426201196574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397142713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44742763,0.0035661818,0.5479773,0.0000013925089,0.0004478131,0.00016107319,0.000032807624,0.0003702418,0.000015525202],"genre_scores_gemma":[0.99752885,0.00001380102,0.0016339166,6.675088e-7,0.00041231464,0.00017298575,0.00012155201,0.000057472607,0.00005845162],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885786,0.000017421216,0.0003269471,0.00021198406,0.00009334382,0.0004924575],"domain_scores_gemma":[0.99948984,0.000082303224,0.000046965357,0.00017860983,0.000035819663,0.0001664676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019596916,0.00026584318,0.00028351697,0.00018050447,0.000058782603,0.000045262976,0.00009617934,0.00006208691,0.000029202745],"category_scores_gemma":[0.00004134016,0.00029990575,0.00007063383,0.00045753428,0.000006377957,0.00016063142,0.00007494548,0.00021142584,0.0000041095655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002719296,0.0002535794,0.7306419,0.00021783232,0.00017965962,0.0000022895015,0.0006604833,0.24992101,0.010220685,0.0026000838,0.0015601317,0.0037395996],"study_design_scores_gemma":[0.0007935829,0.000041308518,0.050887547,0.00036463168,0.00019266283,0.000005560802,0.00016105513,0.90620023,0.006833962,0.000008158998,0.032879386,0.0016319455],"about_ca_topic_score_codex":0.000090040325,"about_ca_topic_score_gemma":0.0000025513282,"teacher_disagreement_score":0.6797544,"about_ca_system_score_codex":0.00008645061,"about_ca_system_score_gemma":0.000009758088,"threshold_uncertainty_score":0.9999453},"labels":[],"label_agreement":null},{"id":"W2400661058","doi":"","title":"Social computing and intelligence: exploring opportunities for the public and the enterprise","year":2015,"lang":"en","type":"article","venue":"Computer Science and Software Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Business intelligence; Collective intelligence; Crowds; Computer science; Social media analytics; Data science; Business analytics; Analytics; Social media; Knowledge management; Competitive intelligence; Intelligence cycle; World Wide Web; Military intelligence; Business model; Business; Computer security; Marketing; Electronic business; Political science","score_opus":0.10292877366495339,"score_gpt":0.28242004178710306,"score_spread":0.17949126812214966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400661058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079574354,0.00031559082,0.9192733,0.0005337601,0.00011091007,0.00012255342,7.7641613e-7,0.000060781076,0.000007984961],"genre_scores_gemma":[0.985043,0.000020272502,0.014496245,0.00005265797,0.0003505881,0.000026522892,7.379535e-7,0.0000060610664,0.00000391036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934685,0.000014433511,0.000120441146,0.00017452668,0.00014446,0.00019926569],"domain_scores_gemma":[0.9992654,0.00039983442,0.000035943405,0.00010674156,0.000115824034,0.00007628168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011627048,0.000096646494,0.00012664302,0.00006414631,0.0004881393,0.000447539,0.00022591064,0.000009237045,5.4611763e-7],"category_scores_gemma":[0.000041732404,0.00006146247,0.000027510301,0.00017139678,0.00035811213,0.00028091544,0.00038853832,0.000082628896,7.680759e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004176529,0.0000066140065,0.004028214,0.000012747623,0.000035549114,5.2298935e-7,0.004982702,0.0009553741,0.000002674274,0.0643688,0.00029955033,0.9253031],"study_design_scores_gemma":[0.00018029867,0.00001795189,0.00079860113,0.00002177227,0.000019023462,0.000003797789,0.0011240034,0.99151105,0.000030860712,0.002293801,0.0038669407,0.00013191746],"about_ca_topic_score_codex":0.000011373854,"about_ca_topic_score_gemma":4.919441e-7,"teacher_disagreement_score":0.99055564,"about_ca_system_score_codex":0.00001165893,"about_ca_system_score_gemma":0.000036733774,"threshold_uncertainty_score":0.4315629},"labels":[],"label_agreement":null},{"id":"W2400929321","doi":"10.3233/978-1-61499-391-9-51","title":"Variable Neighborhood Search for Edge-Ratio Network Clustering","year":2014,"lang":"en","type":"book-chapter","venue":"NATO science for peace and security series. D, Information and communication security","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Cluster analysis; Enhanced Data Rates for GSM Evolution; Variable (mathematics); Computer science; Mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.013876181552171948,"score_gpt":0.2710844233456527,"score_spread":0.25720824179348073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400929321","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010581571,0.002148982,0.443854,0.0015391535,0.00031337564,0.0046724584,0.0009263066,0.0003720163,0.54511553],"genre_scores_gemma":[0.969862,0.0014531774,0.017905032,0.00072387897,0.00058706466,0.0004754211,0.003253096,0.000059836057,0.0056805345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807364,0.000040787563,0.0007185648,0.00035707033,0.00038069213,0.00042925816],"domain_scores_gemma":[0.9973245,0.00022175841,0.0005184885,0.0008454563,0.0008980365,0.0001917393],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0020269002,0.00035402516,0.00049904856,0.00022940975,0.0016291182,0.00076622784,0.0007182357,0.0002013019,0.00008936507],"category_scores_gemma":[0.000026868729,0.00037574646,0.00013837984,0.00021757185,0.00053131755,0.0017536543,0.00061391154,0.0004667216,0.000006145899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045294757,0.000012010186,0.00009274517,0.0001251767,0.000039182552,9.664619e-9,0.0022246847,0.000055098117,0.0000029810462,0.9841008,0.0032724873,0.010029517],"study_design_scores_gemma":[0.00048166927,0.00011598208,0.00001188156,0.0001239403,0.00007006436,0.0000024215587,0.0005956632,0.09319098,0.00004380102,0.27120546,0.6337107,0.00044744287],"about_ca_topic_score_codex":0.00007560351,"about_ca_topic_score_gemma":0.00006963675,"teacher_disagreement_score":0.9688038,"about_ca_system_score_codex":0.000073777606,"about_ca_system_score_gemma":0.00022700113,"threshold_uncertainty_score":0.99986947},"labels":[],"label_agreement":null},{"id":"W2401457476","doi":"10.5441/002/edbt.2015.17","title":"Reaching a desired set of users via different paths: an online advertising technique on micro-blogging platforms","year":2015,"lang":"en","type":"article","venue":"Movebank","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Online advertising; Bidding; Categorization; Social media; Set (abstract data type); Microblogging; World Wide Web; Information retrieval; The Internet; Business; Artificial intelligence; Marketing","score_opus":0.05513256519267921,"score_gpt":0.2920389246882903,"score_spread":0.2369063594956111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401457476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8668833,0.000021374133,0.131991,0.000020316082,0.00003463611,0.00026398365,0.00003618409,0.00015172553,0.0005975318],"genre_scores_gemma":[0.98689985,0.0000015562712,0.012445616,0.00005179948,0.00021854682,0.00003200595,0.00026584932,0.000041179897,0.000043583303],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99859583,0.00006059781,0.00043735962,0.00034246178,0.00024515542,0.00031860263],"domain_scores_gemma":[0.99893,0.000054953976,0.0002478568,0.0005468478,0.000078107994,0.00014227124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003105503,0.00026325867,0.00041032472,0.00017991317,0.000085247004,0.000040457184,0.0003025404,0.00006547462,0.00003358664],"category_scores_gemma":[0.000009383511,0.00022446549,0.00016891542,0.00018934121,0.00004589622,0.00019297493,0.00012237355,0.0002744652,0.0000022919733],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038430103,0.0017631293,0.3765204,0.00006681754,0.0005400909,0.000021114365,0.0032189183,0.003287823,0.27374548,0.0072789015,0.0009253259,0.3322477],"study_design_scores_gemma":[0.0032282372,0.0015542387,0.05518595,0.0012367404,0.0003926769,0.000013689496,0.001571896,0.08932124,0.6854193,0.15773082,0.0020143732,0.0023308252],"about_ca_topic_score_codex":0.00053254835,"about_ca_topic_score_gemma":0.000032458433,"teacher_disagreement_score":0.4116738,"about_ca_system_score_codex":0.00011606744,"about_ca_system_score_gemma":0.00003076514,"threshold_uncertainty_score":0.9153437},"labels":[],"label_agreement":null},{"id":"W2402216016","doi":"10.1017/nws.2017.22","title":"The hourglass effect in hierarchical dependency networks","year":2017,"lang":"en","type":"preprint","venue":"Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University; National Science Foundation","keywords":"Hourglass; Traverse; Dependency (UML); Computer science; Modular design; Set (abstract data type); Vertex (graph theory); Property (philosophy); Distributed computing; Topology (electrical circuits); Theoretical computer science; Mathematics; Artificial intelligence; Graph; Physics","score_opus":0.009963911779965395,"score_gpt":0.30165893104311464,"score_spread":0.2916950192631492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402216016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52514756,0.0074172486,0.20500632,0.0027332308,0.01184593,0.005832021,0.0000280193,0.000894926,0.24109474],"genre_scores_gemma":[0.9953583,0.000108956425,0.00087288144,0.000036003396,0.0030479091,0.00023873906,0.000016935099,0.000031384683,0.0002888935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957825,0.00033883617,0.00056464603,0.0011302081,0.0008028949,0.0013809275],"domain_scores_gemma":[0.99591947,0.0007482138,0.00055525877,0.0024414826,0.00012116736,0.00021439655],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0050617736,0.00047238247,0.00064337807,0.00014131896,0.0019653419,0.0013778979,0.004663268,0.00017701014,0.000053354044],"category_scores_gemma":[0.00007065384,0.00033859414,0.0003529772,0.00072370813,0.0014316358,0.00017826859,0.003993003,0.0023518628,0.000015589627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046458357,0.0000874115,0.33704653,0.000013034905,0.00008869017,0.00001716716,0.00006804516,0.2184475,0.000009562466,0.040133834,0.010046486,0.39399529],"study_design_scores_gemma":[0.0002935048,0.000071169285,0.07291169,0.0004753807,0.00007971146,0.0000013348161,0.000007947813,0.56344944,0.000029851963,0.35662812,0.0052459245,0.00080590346],"about_ca_topic_score_codex":0.0004807296,"about_ca_topic_score_gemma":0.00036432003,"teacher_disagreement_score":0.47021073,"about_ca_system_score_codex":0.0001488985,"about_ca_system_score_gemma":0.0004648941,"threshold_uncertainty_score":0.99994975},"labels":[],"label_agreement":null},{"id":"W2403568692","doi":"","title":"Structural Diversity in Social Recommender Systems.","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Recommender system; Diversity (politics); Computer science; Social network (sociolinguistics); Connection (principal bundle); World Wide Web; Feature (linguistics); Interpersonal ties; Internet privacy; Data science; Social media; Sociology; Engineering; Social science","score_opus":0.03367853413996811,"score_gpt":0.2671341450724352,"score_spread":0.2334556109324671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403568692","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9223727,0.0000056943804,0.0022999423,0.00024229226,0.000047188507,0.00017019731,0.000002291788,0.00006401195,0.07479566],"genre_scores_gemma":[0.99882823,1.1776372e-7,0.00023331618,0.000030009562,0.0001828866,0.000012122217,0.000010242606,0.0000036042213,0.0006994619],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99954826,0.00003434691,0.00010829137,0.000105814965,0.00006500897,0.00013830258],"domain_scores_gemma":[0.9998236,0.000014581625,0.000033616365,0.000079119556,0.000026712229,0.00002238763],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000046188557,0.000065746724,0.000120519806,0.000042119624,0.00014331128,0.00004125485,0.0001147506,0.00001663379,0.003713108],"category_scores_gemma":[2.86847e-7,0.000057566736,0.000053316584,0.000108598164,0.00001230387,0.00010825876,0.00021575073,0.00007483383,0.000048013084],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013309036,0.000020180689,0.8292258,0.0000026392306,0.000048163787,1.5702574e-7,0.00022820775,0.000031020187,0.000023436329,0.072082266,0.08672847,0.011608384],"study_design_scores_gemma":[0.0008022383,0.000024678799,0.8101257,0.000014024953,0.000044130175,3.0969522e-7,0.002728815,0.044471756,0.000133568,0.13621071,0.004762705,0.0006813701],"about_ca_topic_score_codex":0.008664598,"about_ca_topic_score_gemma":0.000036639307,"teacher_disagreement_score":0.08196576,"about_ca_system_score_codex":0.000025679457,"about_ca_system_score_gemma":0.0000041433204,"threshold_uncertainty_score":0.9979368},"labels":[],"label_agreement":null},{"id":"W2405817496","doi":"","title":"Analyzing Participation of Students in Online Courses Using Social Network Analysis Techniques.","year":2011,"lang":"en","type":"article","venue":"Educational Data Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Automatic summarization; Toolbox; Computer science; Social network analysis; Identification (biology); Visualization; Social media; Online discussion; World Wide Web; Exploit; Data science; Multimedia; Information retrieval; Artificial intelligence","score_opus":0.126295305895185,"score_gpt":0.4262975173209416,"score_spread":0.3000022114257566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405817496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97820216,0.00004547531,0.020966971,0.000035476438,0.00004097612,0.00009972251,0.00013882715,0.00001870489,0.000451658],"genre_scores_gemma":[0.91762835,0.0000016768174,0.07943891,0.000011529792,0.0005171566,0.000014148352,0.0023604059,0.0000102821405,0.00001752776],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99871665,0.000087258486,0.0004847668,0.0002938003,0.00021116008,0.00020637484],"domain_scores_gemma":[0.99902713,0.000091412454,0.000338125,0.00040567503,0.00010096917,0.0000366683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005056555,0.00011611962,0.0003023838,0.00030905093,0.000096440985,0.000024674422,0.0005473373,0.000028818737,0.0005518376],"category_scores_gemma":[0.000017198376,0.00013048119,0.00008308717,0.0014215437,0.000048702903,0.00025940483,0.000268249,0.00009355642,8.367981e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006275335,0.0004332886,0.99122345,0.0000027294298,0.00042394013,1.4102862e-7,0.00055775954,0.00023794032,0.000043568463,0.0013427847,0.0005859433,0.005142165],"study_design_scores_gemma":[0.000096388525,0.000011291275,0.9775927,0.000051202576,0.0009449523,9.690489e-8,0.0006935367,0.018054623,0.00016845531,0.0020798808,0.00011042213,0.00019641839],"about_ca_topic_score_codex":0.0012245066,"about_ca_topic_score_gemma":0.0003094096,"teacher_disagreement_score":0.060573827,"about_ca_system_score_codex":0.00004011473,"about_ca_system_score_gemma":0.00011243789,"threshold_uncertainty_score":0.6042235},"labels":[],"label_agreement":null},{"id":"W2411658193","doi":"10.1145/2872518.2896920","title":"Who are We Modelling","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Social media; Relation (database); Analytics; Data science; Recommender system; Nudge theory; Social media analytics; Data modeling; World Wide Web; Data mining; Database","score_opus":0.030923094223230512,"score_gpt":0.2597699832357713,"score_spread":0.22884688901254077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411658193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008146644,0.000023150658,0.9400453,0.000985161,0.000009660552,0.00003309068,0.0000023047562,0.0000883868,0.05066633],"genre_scores_gemma":[0.9867768,0.000012636105,0.004030648,0.000022365886,0.00019434385,0.0000070132437,8.6110003e-7,0.0000075693024,0.008947741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996029,0.000009620525,0.00009007519,0.00012000364,0.00005817723,0.0001192267],"domain_scores_gemma":[0.9996967,0.000027122976,0.000036793845,0.0001826929,0.000025348812,0.000031355998],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000038860857,0.00006273864,0.00010581553,0.00002678028,0.000035015797,0.000014821819,0.0000911513,0.0000098527835,0.0021880288],"category_scores_gemma":[2.1760069e-7,0.000037432266,0.00007378061,0.000064997126,0.000012306191,0.000058405923,0.000036998987,0.00002534034,0.00006701359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057657517,0.00007480656,0.06719321,0.0000031942982,0.00013222516,7.734628e-7,0.000055326684,0.0015709738,0.0006806328,0.61848277,0.078914344,0.23288599],"study_design_scores_gemma":[0.00046255902,0.000024856437,0.0003546999,0.00027721576,0.000060159047,2.3541737e-7,0.00014660471,0.15731324,0.015845863,0.5558017,0.26912215,0.0005907322],"about_ca_topic_score_codex":0.000053610143,"about_ca_topic_score_gemma":0.0000040929126,"teacher_disagreement_score":0.9786302,"about_ca_system_score_codex":0.00000723252,"about_ca_system_score_gemma":0.000004578133,"threshold_uncertainty_score":0.9987241},"labels":[],"label_agreement":null},{"id":"W2415288055","doi":"10.1038/srep19818","title":"Estimating the minimum control count of random network models","year":2016,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Controllability; Measure (data warehouse); Null model; Computer science; Random graph; Complex network; Control (management); Network model; Null (SQL); Network analysis; Mathematics; Statistics; Mathematical optimization; Theoretical computer science; Data mining; Applied mathematics; Artificial intelligence; Combinatorics","score_opus":0.01172927252332738,"score_gpt":0.24491822548774547,"score_spread":0.2331889529644181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415288055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23336878,0.00012509876,0.75829244,0.00022187797,0.0017374965,0.0004133404,0.000004991446,0.00006093556,0.0057750554],"genre_scores_gemma":[0.9956249,2.2468431e-7,0.0030042196,0.000010271696,0.00034531756,0.00003954178,0.000006251717,0.000010033842,0.0009592467],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836314,0.000071230155,0.0005729078,0.00036807737,0.00035161857,0.0002730117],"domain_scores_gemma":[0.99811935,0.00020693647,0.0005517618,0.000882574,0.00019188962,0.000047478727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021189023,0.00011499138,0.00027110186,0.00003924987,0.00027312184,0.000099063465,0.00019708007,0.000018465145,0.00025504272],"category_scores_gemma":[0.000019560279,0.0000594849,0.00019600874,0.00029044462,0.00025924484,0.00012717437,0.00006712016,0.00005250888,0.000004566112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013269242,0.0003541822,0.14151883,0.000031983916,0.0009453152,0.0000597348,0.0008715842,0.3013322,0.021549586,0.042868108,0.3656156,0.12472019],"study_design_scores_gemma":[0.0006305276,0.000014816354,0.00029747034,0.00014974647,0.00013370298,0.000007456872,0.000030341882,0.2515025,0.0020402276,0.73755914,0.0074252933,0.0002087596],"about_ca_topic_score_codex":0.00005928228,"about_ca_topic_score_gemma":0.0000050721533,"teacher_disagreement_score":0.7622561,"about_ca_system_score_codex":0.000014571074,"about_ca_system_score_gemma":0.00007029347,"threshold_uncertainty_score":0.27925387},"labels":[],"label_agreement":null},{"id":"W2415626237","doi":"10.1038/srep18693","title":"Topological constraints on network control profiles","year":2015,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Controllability; Computer science; Topology (electrical circuits); Complex network; Network structure; Network formation; Network model; Distributed computing; Control (management); Data mining; Mathematics; Artificial intelligence","score_opus":0.026128840686872566,"score_gpt":0.27977836519206134,"score_spread":0.2536495245051888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415626237","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56241006,0.00015604935,0.044251025,0.0006673327,0.0083521595,0.0012180476,0.000012723791,0.0005824999,0.38235012],"genre_scores_gemma":[0.9965959,7.600832e-8,0.0011507791,0.000049063703,0.0005654793,0.000040408977,0.000049548184,0.000008517296,0.0015401973],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826103,0.00008158822,0.00037494287,0.00054669054,0.00037883924,0.00035688956],"domain_scores_gemma":[0.99873483,0.000047394587,0.00022860979,0.0006393214,0.00016145557,0.00018838586],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013675407,0.00014146784,0.00024392316,0.000058416896,0.00020412913,0.00020466137,0.00014031668,0.00003572875,0.0013542887],"category_scores_gemma":[0.0000318281,0.00011175303,0.00013575332,0.00032182387,0.00043822697,0.00006396957,0.000057403926,0.00013270642,0.00007290702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026903748,0.0003031064,0.23786458,0.0000027934043,0.00013248008,0.00025982893,0.00009785268,0.002886807,0.00034541436,0.10458639,0.6280684,0.02542544],"study_design_scores_gemma":[0.00054519024,0.00016495869,0.003977824,0.000061476516,0.000092491595,0.000046796424,0.00025255166,0.002267464,0.0032695392,0.77355665,0.21516542,0.0005996345],"about_ca_topic_score_codex":0.000021775571,"about_ca_topic_score_gemma":0.0000026004898,"teacher_disagreement_score":0.6689703,"about_ca_system_score_codex":0.000027518716,"about_ca_system_score_gemma":0.00014346564,"threshold_uncertainty_score":0.9995586},"labels":[],"label_agreement":null},{"id":"W2432087854","doi":"10.1145/2882903.2882913","title":"Truss Decomposition of Probabilistic Graphs","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Truss; Probabilistic logic; Computer science; Discrete mathematics; Mathematics; Theoretical computer science; Mathematical optimization; Combinatorics; Artificial intelligence; Structural engineering; Engineering","score_opus":0.008151865806117927,"score_gpt":0.26728100839938457,"score_spread":0.25912914259326664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2432087854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65605074,0.000007981405,0.2864675,0.00017899674,0.00002177112,0.00015213944,0.0000090329395,0.00008812477,0.057023685],"genre_scores_gemma":[0.9967628,5.8945113e-7,0.002891772,0.000005868551,0.000031475603,0.000012778385,0.000004087442,0.0000043971063,0.00028619074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996077,0.000017754364,0.00013974069,0.00009553971,0.00005864865,0.00008062584],"domain_scores_gemma":[0.9996759,0.000049434442,0.00005309866,0.00015952633,0.000039921437,0.000022094375],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000053891024,0.000052912095,0.00010285714,0.000041096733,0.000018054305,0.0000044721,0.00007577566,0.000008815382,0.0015360793],"category_scores_gemma":[0.0000011810321,0.000031843254,0.00008570645,0.000100766694,0.000033276247,0.000042679152,0.000022679025,0.000014906389,0.000012361028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006911343,0.00009644006,0.047339,0.0000033874135,0.00005226527,8.2572626e-8,0.000012834849,0.000004647451,0.015637623,0.8604547,0.0016777931,0.07471436],"study_design_scores_gemma":[0.00031285363,0.00006669596,0.011929359,0.000048842754,0.00005500908,2.5338235e-7,0.000015125733,0.00044673425,0.060669772,0.9249317,0.0013558229,0.00016785049],"about_ca_topic_score_codex":0.000057644265,"about_ca_topic_score_gemma":0.0000051974926,"teacher_disagreement_score":0.34071207,"about_ca_system_score_codex":0.0000064067995,"about_ca_system_score_gemma":0.0000069121456,"threshold_uncertainty_score":0.99937665},"labels":[],"label_agreement":null},{"id":"W243241807","doi":"10.1007/978-3-7091-0388-3_11","title":"A Global Measure for Estimating the Degree of Organization and Effectiveness of Individual Actors with Application to Terrorist Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Terrorism; Strengths and weaknesses; Social network analysis; Measure (data warehouse); Computer science; Order (exchange); Knowledge management; Data science; Political science; Psychology; Social psychology; Data mining; Business; Social media","score_opus":0.01767399928912586,"score_gpt":0.2556786578905076,"score_spread":0.23800465860138173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W243241807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001339081,0.00015775848,0.995929,0.000014210268,0.000048502832,0.0012004909,0.000043763957,0.000025657699,0.0012415185],"genre_scores_gemma":[0.993448,0.000001757477,0.0052261255,0.00001527449,0.00089623145,0.000083588755,0.00026836214,0.000054202217,0.00000643166],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882364,0.00007802175,0.00036046724,0.00033294022,0.00019812802,0.00020678763],"domain_scores_gemma":[0.99846554,0.0004544641,0.00054533174,0.00022710832,0.0002736466,0.000033898392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043392438,0.0003134481,0.00060206733,0.000056166336,0.00015068067,0.000027491013,0.00028818473,0.00030168533,0.000011227697],"category_scores_gemma":[0.000021087233,0.00024407842,0.00010777711,0.00032913111,0.00014693907,0.000030691022,0.000121937104,0.00029603514,6.782808e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039556623,0.0000753997,0.08455312,0.00016908359,0.0010158912,3.5964226e-7,0.0012288295,0.29122147,0.000009607896,0.052892834,0.00012440166,0.5683134],"study_design_scores_gemma":[0.0039149653,0.0014513794,0.121317364,0.0049430393,0.005976419,0.0000067739256,0.00009031493,0.20915177,0.00048367475,0.647987,0.0008269219,0.0038503536],"about_ca_topic_score_codex":0.00010700079,"about_ca_topic_score_gemma":0.00026588363,"teacher_disagreement_score":0.99210894,"about_ca_system_score_codex":0.00006191673,"about_ca_system_score_gemma":0.000049552782,"threshold_uncertainty_score":0.9953229},"labels":[],"label_agreement":null},{"id":"W2438490550","doi":"10.1145/2882903.2882961","title":"Continuous Influence Maximization","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maximization; Computer science; Benchmark (surveying); Mathematical optimization; Product (mathematics); Mathematics","score_opus":0.004517386598518624,"score_gpt":0.2246258745456434,"score_spread":0.22010848794712476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2438490550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29208717,0.000003862944,0.6537325,0.00024663936,0.000011636303,0.00006153501,0.0000019234265,0.00013492862,0.05371982],"genre_scores_gemma":[0.9944593,7.963653e-7,0.0022421244,0.00003918107,0.000063839674,0.000008907035,0.00000207404,0.0000044574167,0.0031793253],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999676,0.000010470626,0.0000866841,0.00009177387,0.000048594004,0.000086484586],"domain_scores_gemma":[0.99973667,0.000024485842,0.000031968328,0.00014062144,0.0000441889,0.000022062775],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000370169,0.000046383142,0.000065555585,0.000022677517,0.00002470656,0.000014001692,0.00007437238,0.000007823808,0.0018521381],"category_scores_gemma":[0.0000022470188,0.000028055932,0.00003426629,0.00007597789,0.000016967775,0.000084428124,0.000027508739,0.000014187575,0.00009651211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032470628,0.000035203044,0.44366202,6.110527e-7,0.000036052905,2.855023e-7,0.000015871497,0.00003160723,0.009419878,0.26011202,0.0077918316,0.27889138],"study_design_scores_gemma":[0.0016462898,0.00013061994,0.1541168,0.00012790143,0.000117359246,0.0000015092666,0.000106726955,0.0028267147,0.14332202,0.4915835,0.2048069,0.0012136878],"about_ca_topic_score_codex":0.00006656635,"about_ca_topic_score_gemma":0.000002587394,"teacher_disagreement_score":0.70237213,"about_ca_system_score_codex":0.0000060861976,"about_ca_system_score_gemma":0.000005691333,"threshold_uncertainty_score":0.99906033},"labels":[],"label_agreement":null},{"id":"W2466732631","doi":"10.1007/978-3-642-30904-5","title":"Advances in Network Analysis and its Applications","year":2012,"lang":"en","type":"book","venue":"Mathematics in industry","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science","score_opus":0.016278852775270247,"score_gpt":0.2927772675573244,"score_spread":0.27649841478205417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466732631","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065122696,0.005272869,0.024399143,0.0000276477,0.00003540861,0.0008389509,0.000050439576,0.000068464346,0.9686558],"genre_scores_gemma":[0.4438797,0.0014701303,0.04019235,0.0000959285,0.00658773,0.003221094,0.001352099,0.00035235108,0.5028486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855363,0.00003180903,0.0005972338,0.00030478078,0.00017428419,0.00033826125],"domain_scores_gemma":[0.9988087,0.00027058585,0.00036693888,0.00044630788,0.000034351484,0.00007315107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037041632,0.00029011877,0.0007467864,0.00041961318,0.000048285026,0.000037082176,0.0002735054,0.00042363323,0.000641935],"category_scores_gemma":[0.0000045720567,0.00030255772,0.00014383532,0.00086729013,0.00004338089,0.0001036855,0.00017387008,0.0012273939,0.00001847401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031696718,0.00054520083,0.11293474,0.00042509264,0.0009828821,0.0000035706723,0.0005243069,0.0033982096,0.0000014369346,0.8179222,0.006468258,0.056790948],"study_design_scores_gemma":[0.00021473881,0.000009875063,0.00076319807,0.00071498944,0.0014930099,9.809931e-7,0.00015312493,0.007847595,0.000012614533,0.8315193,0.15636395,0.0009066269],"about_ca_topic_score_codex":0.000009668666,"about_ca_topic_score_gemma":0.000089003435,"teacher_disagreement_score":0.46580723,"about_ca_system_score_codex":0.00009314343,"about_ca_system_score_gemma":0.00005908202,"threshold_uncertainty_score":0.99994266},"labels":[],"label_agreement":null},{"id":"W2466842698","doi":"10.1007/978-3-319-30024-5_14","title":"A Knowledge Based Framework for Link Prediction in Social Networks","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; State (computer science); Social network (sociolinguistics); Current (fluid); Data mining; Link (geometry); Artificial intelligence; Social network analysis; Machine learning; Algorithm; Computer network; Social media","score_opus":0.018080417114593197,"score_gpt":0.2841137369816817,"score_spread":0.2660333198670885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466842698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014747199,0.000115812785,0.9945628,0.00034183604,0.0004987988,0.00048694492,0.000025317166,0.00008144396,0.003872303],"genre_scores_gemma":[0.797486,0.0000036241042,0.19017868,0.00028840534,0.011447816,0.000117052645,0.000051820076,0.00007226652,0.00035435735],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798506,0.000028921428,0.0004295318,0.00082007836,0.00024310249,0.00049327785],"domain_scores_gemma":[0.998385,0.00074077724,0.00022481842,0.00043162057,0.0001535738,0.00006421825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053926435,0.0003596468,0.00048513536,0.00049994816,0.00021678806,0.00012601094,0.00071984506,0.00031236422,0.00012536632],"category_scores_gemma":[0.000014821202,0.00031565633,0.00023841047,0.00039346245,0.00031622755,0.00010266985,0.00023556511,0.00067580974,0.000007001302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014865853,0.00003276283,0.000805384,0.000012856481,0.00001760403,0.0000010578229,0.00011841834,0.013426006,0.0000057253965,0.09068737,0.00015046267,0.89472747],"study_design_scores_gemma":[0.00018340825,0.000047139038,0.0001271993,0.000425063,0.000014709797,1.5759882e-7,5.2312245e-8,0.45143807,0.000040240935,0.54462755,0.0028435066,0.0002529123],"about_ca_topic_score_codex":0.000007213005,"about_ca_topic_score_gemma":0.00003521865,"teacher_disagreement_score":0.89447457,"about_ca_system_score_codex":0.00021480054,"about_ca_system_score_gemma":0.00024699443,"threshold_uncertainty_score":0.99992955},"labels":[],"label_agreement":null},{"id":"W2466907714","doi":"10.1016/j.physa.2016.06.035","title":"Directed networks’ different link formation mechanisms causing degree distribution distinction","year":2016,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Preferential attachment; Degree distribution; Complex network; Distribution (mathematics); Power law; Mathematics; Mathematical economics; Computer science; Combinatorics; Statistics","score_opus":0.018943593833539486,"score_gpt":0.25990444621080266,"score_spread":0.24096085237726317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466907714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011470531,0.000020818317,0.99688095,0.00045150347,0.00003269432,0.0005215515,0.0006143214,0.00020212204,0.00012899951],"genre_scores_gemma":[0.99465245,0.00003577279,0.0034399438,0.000016002414,0.00032365066,0.00056230923,0.0009154451,0.000023474136,0.0000309806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873775,0.000058830436,0.00034620022,0.00037536022,0.00018066724,0.00030117715],"domain_scores_gemma":[0.9989647,0.00028794946,0.00018456363,0.0002592177,0.00015392057,0.00014959848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092253205,0.00022277853,0.00025804053,0.000036780002,0.0003621556,0.0000748774,0.0000965535,0.00004576244,0.00012309582],"category_scores_gemma":[0.000016238222,0.00016457558,0.00006932475,0.0002461489,0.000021236703,0.00016695326,0.00010460577,0.00011733899,0.000015914073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069324933,0.000084798594,0.0000076179676,0.000006573478,0.000030370718,1.177698e-7,0.0000068614045,0.00000732888,0.0045643537,0.8276949,0.00025364084,0.1673365],"study_design_scores_gemma":[0.00025538148,0.000046246816,0.00067247805,0.000039313876,0.00015429751,0.0000010550593,0.000013284469,0.3988692,0.0025892288,0.5950875,0.0019966906,0.0002753106],"about_ca_topic_score_codex":0.00001668591,"about_ca_topic_score_gemma":0.000009065086,"teacher_disagreement_score":0.99350536,"about_ca_system_score_codex":0.00007115806,"about_ca_system_score_gemma":0.000011308451,"threshold_uncertainty_score":0.67111975},"labels":[],"label_agreement":null},{"id":"W2467224519","doi":"10.1145/2911451.2914694","title":"An Exploration of Evaluation Metrics for Mobile Push Notifications","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Microblogging; Metric (unit); Relevance (law); Social media; Task (project management); Table (database); Filter (signal processing); Measure (data warehouse); Information retrieval; Data mining; Data science; World Wide Web","score_opus":0.08685250694954773,"score_gpt":0.37952417568005237,"score_spread":0.29267166873050465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467224519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034418784,0.0000068850986,0.9632542,0.00008217286,0.000017925138,0.00046557465,0.00002027275,0.000034063894,0.0017001309],"genre_scores_gemma":[0.98293334,0.0000013262546,0.016092584,0.0000035634316,0.00009020011,0.00059329014,0.000100251156,0.000006218002,0.00017924306],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994766,0.000033813587,0.00018005187,0.00012241944,0.000121844336,0.000065277294],"domain_scores_gemma":[0.9991326,0.00010061732,0.0001016275,0.00026063249,0.00038283606,0.000021692827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035769024,0.000047248148,0.000082345825,0.000100857134,0.00003999338,0.000012121181,0.00006953351,0.000012911563,0.0005935752],"category_scores_gemma":[0.000011103657,0.000033296157,0.000060225684,0.0002447401,0.0000137853385,0.00042239568,0.000007918704,0.0000104009305,0.000005498202],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062330546,0.00025264552,0.0046631875,0.0000026128685,0.000048059675,2.7541e-9,0.00010289364,0.00048523818,0.032129873,0.20766051,0.0022849147,0.7523638],"study_design_scores_gemma":[0.0009535555,0.00035935643,0.0019016413,0.000021061163,0.00034578802,3.6862602e-8,0.00066642347,0.18566906,0.33264634,0.4633434,0.013745355,0.00034796508],"about_ca_topic_score_codex":0.000026344269,"about_ca_topic_score_gemma":0.000009305864,"teacher_disagreement_score":0.9485145,"about_ca_system_score_codex":0.000017927281,"about_ca_system_score_gemma":0.000025079005,"threshold_uncertainty_score":0.6499232},"labels":[],"label_agreement":null},{"id":"W2476680721","doi":"10.5539/cis.v9n3p7","title":"Assortativity Analysis of Real-World Network Graphs based on Centrality Metrics","year":2016,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Experimental Program to Stimulate Competitive Research; National Aeronautics and Space Administration","keywords":"Assortativity; Betweenness centrality; Centrality; Katz centrality; Computer science; Connectivity; Graph; Network science; Complex network; Combinatorics; Mathematics; Theoretical computer science","score_opus":0.015149885399042643,"score_gpt":0.28259361498876895,"score_spread":0.2674437295897263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476680721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14802144,0.0000013461341,0.8435828,0.000063675,0.000051386534,0.00007661784,0.000020739726,0.00003106297,0.008150953],"genre_scores_gemma":[0.99425405,0.000003681008,0.0055957604,0.000097246266,0.000025459909,0.0000028371971,0.000013279317,0.0000011093908,0.000006599999],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990133,0.000034223634,0.00030968638,0.00013264369,0.00033111262,0.00017903384],"domain_scores_gemma":[0.99902683,0.00019783106,0.00023907001,0.0002630646,0.00020013642,0.00007306407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080638967,0.00008136099,0.00020538032,0.0008349273,0.00012873676,0.00007845307,0.0002085781,0.000010021215,0.000060559967],"category_scores_gemma":[0.000007985385,0.0000550899,0.00010271455,0.0052824426,0.00017304812,0.0012490604,0.000065594984,0.00003758261,0.0000020991488],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062140953,0.000029721428,0.69791836,0.000003035124,0.00007366377,2.620726e-8,0.00007507257,0.008251619,0.000015724117,0.14131907,0.00060000975,0.15170749],"study_design_scores_gemma":[0.000098037905,0.000023042174,0.5966908,0.000011703057,0.000062008054,7.843945e-9,0.0000027113244,0.40040615,0.00025684456,0.00148879,0.00088476494,0.00007514395],"about_ca_topic_score_codex":0.00009111222,"about_ca_topic_score_gemma":0.0000100727775,"teacher_disagreement_score":0.8462326,"about_ca_system_score_codex":0.000023909195,"about_ca_system_score_gemma":0.000039523686,"threshold_uncertainty_score":0.25380385},"labels":[],"label_agreement":null},{"id":"W2476724714","doi":"10.1103/physreve.94.022317","title":"Growing networks of overlapping communities with internal structure","year":2016,"lang":"en","type":"article","venue":"Physical review. E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; James S. McDonnell Foundation","keywords":"Community structure; Preferential attachment; Mechanism (biology); Node (physics); Generalization; Complex network; Distribution (mathematics); Computer science; Empirical evidence; Mathematics; Epistemology; Combinatorics; Engineering","score_opus":0.01008673418719813,"score_gpt":0.2889595186023472,"score_spread":0.27887278441514907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476724714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8337681,0.002065102,0.15782297,0.0003212715,0.000037312955,0.00030474341,0.000024828913,0.00008117081,0.0055744564],"genre_scores_gemma":[0.99889654,0.00023283514,0.00036626143,0.000106144056,0.0003312751,0.000012916457,0.000010825217,0.000015848927,0.000027354106],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992465,0.00008200458,0.00021900407,0.00011937538,0.0001532646,0.00017989574],"domain_scores_gemma":[0.99916965,0.00017403928,0.00018040584,0.00035968656,0.000071654504,0.000044544948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077085904,0.000153601,0.00045153536,0.000023577015,0.000047069272,0.000012204677,0.00027451184,0.000009919304,0.0002612309],"category_scores_gemma":[0.0000031970033,0.00008699621,0.00018325122,0.00016619462,0.000092256385,0.00016097055,0.000120785,0.00014688773,0.0000029280027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054737782,0.00028498456,0.12359103,0.00047548508,0.00096932147,0.0000019230802,0.0003103652,0.00033269817,0.018407166,0.30574816,0.003360312,0.5464638],"study_design_scores_gemma":[0.005067339,0.0017924473,0.05742449,0.12760393,0.0043256604,0.000019845826,0.0012823947,0.05788036,0.063414276,0.57926106,0.09616827,0.005759925],"about_ca_topic_score_codex":0.00012154713,"about_ca_topic_score_gemma":0.000008607116,"teacher_disagreement_score":0.5407039,"about_ca_system_score_codex":0.000014542322,"about_ca_system_score_gemma":0.000011703923,"threshold_uncertainty_score":0.35476026},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.3452505785625193,"score_gpt":0.5799659791907616,"score_spread":0.23471540062824237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478496062","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015107369,0.00037775727,0.98072326,0.0021739863,0.000058331596,0.0006439998,0.00011521716,0.000032675216,0.0007674285],"genre_scores_gemma":[0.45768097,0.000001860691,0.5418146,0.00016425617,0.00007101939,0.00007250828,0.00017827435,0.000009440822,0.00000707252],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971049,0.0012989019,0.0005184699,0.0007140739,0.00013791284,0.00022576809],"domain_scores_gemma":[0.99592644,0.0015120361,0.00027178822,0.0019877497,0.00019656676,0.00010542205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005593457,0.0001707196,0.0006593447,0.00018635488,0.0000907804,0.0000218722,0.0013794869,0.00006772209,0.000015864154],"category_scores_gemma":[0.00021213757,0.00011598772,0.00010720524,0.0007754525,0.00032662667,0.00006750752,0.00051225163,0.00022681153,0.0000041457624],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008624062,0.00066537,0.045320254,0.000008758704,0.0023906392,9.080338e-8,0.0018074609,0.00052840676,0.0015965616,0.15346739,0.01259716,0.7807555],"study_design_scores_gemma":[0.001012549,0.0010430494,0.027707163,0.000009335015,0.0018830895,0.0000010475941,0.0006478531,0.41101643,0.00019056728,0.5271239,0.029014312,0.00035066193],"about_ca_topic_score_codex":0.000070177884,"about_ca_topic_score_gemma":0.000090322275,"teacher_disagreement_score":0.78040487,"about_ca_system_score_codex":0.0000064529368,"about_ca_system_score_gemma":0.000011810261,"threshold_uncertainty_score":0.47298422},"labels":[],"label_agreement":null},{"id":"W2488394808","doi":"10.1007/978-3-319-41920-6_25","title":"Tracking Communities over Time in Dynamic Social Network","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Sherbrooke","funders":"","keywords":"Computer science; Tracking (education); Social network (sociolinguistics); Real-time computing; World Wide Web; Social media; Sociology","score_opus":0.011995244663895418,"score_gpt":0.2581289103582776,"score_spread":0.2461336656943822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488394808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016041957,0.00013736045,0.98371494,0.00018547174,0.00022861875,0.00024096013,0.000014225967,0.00008813564,0.013786104],"genre_scores_gemma":[0.98642904,0.000006428094,0.0113062905,0.00022101948,0.0013206388,0.000009563338,0.000025709387,0.000045580036,0.00063573924],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808294,0.000054276537,0.00042159576,0.00048797476,0.00038331942,0.00056988746],"domain_scores_gemma":[0.99871486,0.0003926457,0.00023502986,0.0005319894,0.00007843874,0.00004702369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000531226,0.00039230502,0.0005741594,0.00040102078,0.0002686948,0.00019713692,0.0011282306,0.00015223598,0.00050926424],"category_scores_gemma":[0.0000023056014,0.00034885784,0.00018299934,0.00032533007,0.0005794749,0.0001911783,0.00063272135,0.0007357552,0.0000272815],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008462742,0.000030629613,0.003380535,0.000009710721,0.000039565366,0.000008385632,0.00080490997,0.01102459,0.000042718773,0.021859216,0.00013235085,0.96265894],"study_design_scores_gemma":[0.00027409883,0.00004233687,0.0017271609,0.00079887273,0.00002394997,0.000001830517,5.8369045e-7,0.21137516,0.000034508193,0.78291297,0.00199615,0.00081238814],"about_ca_topic_score_codex":0.00009412995,"about_ca_topic_score_gemma":0.00042890717,"teacher_disagreement_score":0.98482484,"about_ca_system_score_codex":0.00023311625,"about_ca_system_score_gemma":0.00013704704,"threshold_uncertainty_score":0.99989635},"labels":[],"label_agreement":null},{"id":"W2489783395","doi":"10.3139/9783446447264.022","title":"Part VII: Systems' Architectures and Modularities","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Soma; Key (lock); Computer security; Psychology","score_opus":0.029472965590765628,"score_gpt":0.24526538369672088,"score_spread":0.21579241810595526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489783395","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008296938,0.0020442787,0.0037496309,0.000033809647,0.000075376076,0.00022105008,0.00006173491,0.00014481573,0.99358636],"genre_scores_gemma":[0.12507315,0.0000171513,0.0004018351,0.000021911172,0.0012883745,0.000027390208,0.00013908144,0.000058047135,0.8729731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990165,0.000016016404,0.00026680325,0.00031824017,0.00020902987,0.00017341049],"domain_scores_gemma":[0.9992548,0.000037157813,0.00012842535,0.00038827045,0.000089346475,0.000101953534],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011368448,0.00031155327,0.00049325585,0.00011170901,0.00006147867,0.00010765076,0.00014697213,0.00009642289,0.0013016766],"category_scores_gemma":[6.660513e-7,0.00026657578,0.00013706603,0.000013240977,0.00009230739,0.000019366615,0.0001598823,0.00025483288,0.000026170917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026881148,0.000005452848,0.000134232,0.000019425403,0.00024800102,0.0000015593283,0.000022783102,0.00006570979,7.7811694e-7,0.9287024,0.06261499,0.008181975],"study_design_scores_gemma":[0.00006309647,0.000021220314,0.000005499449,0.00010057874,0.00011168229,0.0000018165009,0.000019686284,0.0005915257,0.000005091358,0.29879978,0.6999793,0.0003007025],"about_ca_topic_score_codex":0.00026972487,"about_ca_topic_score_gemma":0.000020250674,"teacher_disagreement_score":0.6373643,"about_ca_system_score_codex":0.000018511766,"about_ca_system_score_gemma":0.000033596876,"threshold_uncertainty_score":0.99997866},"labels":[],"label_agreement":null},{"id":"W2490176128","doi":"10.1145/2851613.2851810","title":"Estimating topical volume in social media streams","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Computer science; Volume (thermodynamics); Social media; Cardinality (data modeling); Simple (philosophy); Task (project management); Computation; Event (particle physics); Consumption (sociology); Data mining; Algorithm; World Wide Web; Engineering","score_opus":0.014686950272381264,"score_gpt":0.2738329863196364,"score_spread":0.2591460360472551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490176128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7170439,0.0000034290645,0.23612116,0.00096175587,0.00006394127,0.00007213039,0.0000048136344,0.00012133261,0.045607544],"genre_scores_gemma":[0.9883378,6.960177e-8,0.010202987,0.000011950017,0.00077209383,0.000010301974,0.000004107961,0.0000053225313,0.0006553485],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994822,0.000021202059,0.00014675462,0.00012337697,0.000075122756,0.00015131169],"domain_scores_gemma":[0.9997631,0.00007871463,0.000030111749,0.00008805335,0.0000144636015,0.000025566975],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000066030974,0.00006415109,0.000121656696,0.000033795877,0.000035660512,0.000014223509,0.00009330829,0.000018673274,0.0030344194],"category_scores_gemma":[0.0000067897145,0.000042995773,0.00005806355,0.00009098222,0.000024599982,0.00005420299,0.000052374635,0.000046925004,0.000045374134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016502394,0.00003871134,0.28736305,6.603302e-7,0.000011724208,6.3175634e-7,0.000098822195,0.000002743637,0.00016926821,0.061024934,0.0044456446,0.6468422],"study_design_scores_gemma":[0.0018748075,0.0000563577,0.30094925,0.000120864155,0.000063512,6.372187e-7,0.00040821196,0.058554027,0.0029105875,0.6197764,0.014261779,0.0010235315],"about_ca_topic_score_codex":0.00009816291,"about_ca_topic_score_gemma":0.00006486263,"teacher_disagreement_score":0.64581865,"about_ca_system_score_codex":0.000018863338,"about_ca_system_score_gemma":0.000010598403,"threshold_uncertainty_score":0.99787694},"labels":[],"label_agreement":null},{"id":"W2491520803","doi":"10.4018/978-1-4666-8614-4.ch096","title":"Social Network Integration in Document Summarization","year":2015,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Automatic summarization; Computer science; Social media; Multi-document summarization; Event (particle physics); Information retrieval; Context (archaeology); Social network (sociolinguistics); World Wide Web; Microblogging; Data science","score_opus":0.021908688721220922,"score_gpt":0.2861672733421374,"score_spread":0.26425858462091645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491520803","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050277595,0.00008439482,0.008889953,0.00003955151,0.00011503739,0.00033660396,0.000029243298,0.00009256375,0.99036235],"genre_scores_gemma":[0.93141556,0.0000011622074,0.00087434635,0.000074749885,0.002944253,0.000055127624,0.00030372356,0.0000546051,0.064276464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858665,0.00003517378,0.000450536,0.0003512491,0.0003038551,0.00027250525],"domain_scores_gemma":[0.9992544,0.000012944978,0.00029062098,0.00024174486,0.00013427927,0.00006601598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019357435,0.00033637162,0.00045159672,0.00006155555,0.000077832185,0.00009241411,0.00021102298,0.00019348762,0.00015598179],"category_scores_gemma":[0.0000013731999,0.00035493533,0.00020803972,0.00004499889,0.00004390035,0.000048154438,0.00013645447,0.00028350067,0.000048119335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014014278,0.0000068908325,0.000294773,0.0000021531755,0.000060172817,0.0000019369313,0.000033206867,0.00007719348,8.105919e-7,0.93038523,0.030382251,0.03874139],"study_design_scores_gemma":[0.00017735276,0.000022746215,0.00004072118,0.00010332533,0.00007910877,2.5673745e-7,0.000007906521,0.0001870172,0.000004160163,0.95216197,0.046919487,0.00029597039],"about_ca_topic_score_codex":0.00033341578,"about_ca_topic_score_gemma":0.0004488516,"teacher_disagreement_score":0.9313653,"about_ca_system_score_codex":0.00040139136,"about_ca_system_score_gemma":0.000123049,"threshold_uncertainty_score":0.99989027},"labels":[],"label_agreement":null},{"id":"W2491746247","doi":"10.1002/9783527694365.ch9","title":"Cluster Analysis of Social Networks Using R","year":2016,"lang":"en","type":"other","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Social network analysis; Cluster (spacecraft); Interdependence; Cluster analysis; Data science; Process (computing); Social network (sociolinguistics); Focus (optics); Computer science; Network analysis; Sociology; World Wide Web; Artificial intelligence; Social science; Social media; Engineering","score_opus":0.012441394846620836,"score_gpt":0.2985696311515235,"score_spread":0.2861282363049027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491746247","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021998116,0.000023215713,0.41622856,0.000010218708,0.00002413594,0.00006577634,0.00003018909,0.00005995737,0.5835359],"genre_scores_gemma":[0.08258126,0.0000040228915,0.003587906,0.000044275657,0.0020043084,0.000009434491,0.00018247882,0.00028641176,0.9112999],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912405,0.0000494593,0.00026720937,0.00023503849,0.00013157535,0.00019265011],"domain_scores_gemma":[0.99923474,0.000029847864,0.0003837191,0.00028955762,0.000033455897,0.000028674984],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000078548575,0.00020349807,0.0007078062,0.000549216,0.000030759165,0.000014635202,0.00019514938,0.00011664474,0.0820324],"category_scores_gemma":[3.0153873e-7,0.00015488909,0.00067037425,0.00054544065,0.000056311554,0.000015227201,0.00010619158,0.000083525156,0.000014807859],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034884952,0.000041785,0.005345232,0.0000047911776,0.010072703,1.4868841e-7,0.000014049912,0.00028263984,0.000010197054,0.015175514,0.96104425,0.008005189],"study_design_scores_gemma":[0.00036407047,0.00001096518,0.00038786963,0.000097844415,0.015661346,5.5196008e-8,0.000030992214,0.12814957,0.000032288066,0.0012885332,0.85305315,0.0009233008],"about_ca_topic_score_codex":0.0007882989,"about_ca_topic_score_gemma":0.00013611477,"teacher_disagreement_score":0.41264066,"about_ca_system_score_codex":0.000017658022,"about_ca_system_score_gemma":0.000016517115,"threshold_uncertainty_score":0.91880673},"labels":[],"label_agreement":null},{"id":"W2492880706","doi":"10.1007/978-3-319-25507-1_4","title":"Spatiotemporal Network Topology Analysis","year":2015,"lang":"en","type":"book-chapter","venue":"Springer briefs in electrical and computer engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Topology (electrical circuits); Computer science; Mathematics; Combinatorics","score_opus":0.010127549051157972,"score_gpt":0.2186897961609946,"score_spread":0.20856224710983662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492880706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014090409,0.0028883237,0.9468334,0.00008164732,0.00025093733,0.00031120743,0.00000834456,0.0002981577,0.047918964],"genre_scores_gemma":[0.93472314,0.00011020307,0.033368565,0.00013560447,0.00657585,0.000048379854,0.0002277352,0.00019102315,0.024619503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983657,0.00001587494,0.0004554673,0.00052305544,0.0001900592,0.00044987223],"domain_scores_gemma":[0.99928474,0.000077000645,0.00012493257,0.00031580924,0.00005569814,0.00014183334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019231379,0.00039450394,0.000847762,0.00046473084,0.000036272344,0.00005787136,0.00022444721,0.00017614353,0.00016301339],"category_scores_gemma":[0.0000014993021,0.00042467113,0.00026748027,0.0003785746,0.00003204829,0.000045928762,0.0002411948,0.0006496303,0.000006964314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015699492,0.00004374939,0.01588392,0.000020171427,0.0022620307,0.000039451526,0.00004461618,0.11095085,0.0000020396324,0.7597251,0.0039711324,0.107041255],"study_design_scores_gemma":[0.0003080788,0.0001084041,0.003779168,0.0000864058,0.0007041409,0.0000036347787,3.9962154e-7,0.79392344,0.0000067459737,0.0526094,0.14744098,0.0010292213],"about_ca_topic_score_codex":0.00015680815,"about_ca_topic_score_gemma":0.00002289555,"teacher_disagreement_score":0.9333141,"about_ca_system_score_codex":0.000082752515,"about_ca_system_score_gemma":0.000033499702,"threshold_uncertainty_score":0.99982053},"labels":[],"label_agreement":null},{"id":"W2494842936","doi":"10.1007/978-3-319-30139-6_16","title":"Counting Subgraphs in Relational Event Graphs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Graph; Range (aeronautics); Event (particle physics); Theoretical computer science; Relational database; Information retrieval","score_opus":0.01214947538484965,"score_gpt":0.24716451392873096,"score_spread":0.2350150385438813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494842936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008493784,0.00013380194,0.9805883,0.00017424802,0.00024045748,0.00020945247,0.000008594309,0.00004794975,0.017747806],"genre_scores_gemma":[0.96876127,0.000007679358,0.030181747,0.00012852553,0.00047784502,0.000011713404,0.000015633663,0.000027057367,0.00038850904],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779296,0.000021972537,0.0004701001,0.0007696152,0.0005359823,0.00040939217],"domain_scores_gemma":[0.9987437,0.00032255935,0.00025634177,0.00049667095,0.000119439275,0.00006126408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006148973,0.00032182634,0.00038103768,0.0008437808,0.00012317303,0.0000899825,0.0006659376,0.00011281066,0.0003189308],"category_scores_gemma":[0.000008224617,0.0002743884,0.00018677297,0.0004696624,0.00035705135,0.00017731906,0.00032204716,0.00051340455,0.000018160828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005698582,0.00003630624,0.039380386,0.000008897379,0.00003118227,0.000010132401,0.00015097203,0.009181794,0.00007130372,0.444464,0.00006337141,0.50659597],"study_design_scores_gemma":[0.00016203432,0.00002396431,0.0020182983,0.00046889894,0.000010681248,0.0000016792798,9.851463e-8,0.033353824,0.00014016045,0.96145576,0.0019430816,0.00042151],"about_ca_topic_score_codex":0.00005441589,"about_ca_topic_score_gemma":0.00010804828,"teacher_disagreement_score":0.9679119,"about_ca_system_score_codex":0.00013975118,"about_ca_system_score_gemma":0.0001803595,"threshold_uncertainty_score":0.99997085},"labels":[],"label_agreement":null},{"id":"W2499474386","doi":"10.2495/dne-v11-n3-387-395","title":"About the effects of sentiments on topic detection in social networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Design & Nature and Ecodynamics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"FP7 Nanosciences, Nanotechnologies, Materials and new Production Technologies; Junta de Andalucía; European Commission","keywords":"Computer science; Data science; Psychology","score_opus":0.0052694532481016585,"score_gpt":0.2587329466200267,"score_spread":0.25346349337192503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2499474386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66624874,0.0002428034,0.3320239,0.00048920576,0.0006053134,0.00010891899,0.0000024986587,0.000004674336,0.00027397406],"genre_scores_gemma":[0.99908406,0.000058246627,0.00019457299,0.000060683706,0.00054049504,0.000001991048,0.0000011572045,0.0000051021875,0.000053692675],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993796,0.000067519366,0.00023671261,0.000065728666,0.00017369328,0.00007679705],"domain_scores_gemma":[0.9992762,0.00027337403,0.00026989315,0.000047369515,0.00011382172,0.000019298745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018888316,0.00007075152,0.0001279999,0.00012071082,0.000032038,0.00002047309,0.00018070116,0.000056909445,0.000010584177],"category_scores_gemma":[0.000016460795,0.000041402567,0.000093198854,0.00007607335,0.000025124551,0.00007796761,0.000027612763,0.00023971705,2.9925496e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066041155,0.0003805435,0.058962133,0.000013408838,0.0012842889,0.000027377248,0.00039037436,0.0015213685,0.009834152,0.027038202,0.0015546422,0.8983331],"study_design_scores_gemma":[0.014066994,0.0027101983,0.3252047,0.003410208,0.00073803234,0.000094351606,0.0004198187,0.18944971,0.060730435,0.3939153,0.007827987,0.0014322681],"about_ca_topic_score_codex":0.0000052861787,"about_ca_topic_score_gemma":0.000005419686,"teacher_disagreement_score":0.89690083,"about_ca_system_score_codex":0.000044040542,"about_ca_system_score_gemma":0.000015271806,"threshold_uncertainty_score":0.16883478},"labels":[],"label_agreement":null},{"id":"W2501538315","doi":"10.1609/aaai.v30i1.10063","title":"DRIMUX: Dynamic Rumor Influence Minimization with User Experience in Social Networks","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Rumor; Blocking (statistics); Computer science; Constraint (computer-aided design); Popularity; Inference; Node (physics); Minification; Social network (sociolinguistics); Mathematical optimization; Artificial intelligence; Computer network; Social media; Mathematics; Engineering","score_opus":0.03429066935275732,"score_gpt":0.30181836728649936,"score_spread":0.26752769793374204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501538315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9602744,0.000003890955,0.035901956,0.0007987401,0.00004157248,0.0003394339,0.000004632373,0.000048891667,0.0025864723],"genre_scores_gemma":[0.9990512,0.0000073875426,0.0005085347,0.000044538174,0.0000779537,0.0000819928,9.955468e-7,0.000017964308,0.00020943882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983962,0.00001886122,0.00049139775,0.00040625155,0.0003046845,0.0003825662],"domain_scores_gemma":[0.99891585,0.000070999544,0.00039175423,0.00017764916,0.00039546227,0.000048263926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019277103,0.0002262884,0.00028110167,0.000117443305,0.00017764865,0.00009040187,0.0007504935,0.000056304136,0.00023505333],"category_scores_gemma":[0.000035462526,0.00013835506,0.00008887175,0.00072848063,0.00038543507,0.00032775744,0.00017139952,0.00018624132,0.000012658389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029513368,0.00030330376,0.1034171,0.000014644131,0.0000434746,4.6760817e-7,0.0019705587,0.0011888753,0.03530624,0.75337857,0.00013474976,0.10394688],"study_design_scores_gemma":[0.00036532112,0.00056935917,0.044842824,0.002285583,0.00012334589,0.0000028254126,0.005208365,0.15572809,0.47281492,0.31578285,0.00047781286,0.0017987178],"about_ca_topic_score_codex":0.00008403532,"about_ca_topic_score_gemma":0.00004537347,"teacher_disagreement_score":0.43759575,"about_ca_system_score_codex":0.00005805642,"about_ca_system_score_gemma":0.000050796516,"threshold_uncertainty_score":0.5641955},"labels":[],"label_agreement":null},{"id":"W2506208815","doi":"10.1017/cbo9781139088510.008","title":"Information Diffusion in Social Media","year":2014,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Social media; Quarter (Canadian coin); Power (physics); Diffusion; Advertising; Population; Business; Computer science; Sociology; Geography; World Wide Web; Physics; Demography","score_opus":0.012767089517914233,"score_gpt":0.19541795598466719,"score_spread":0.18265086646675296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506208815","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050799246,0.0000049127525,0.0061570047,0.000007120597,0.000057285975,0.00017874799,0.00010015022,0.00008182357,0.99290496],"genre_scores_gemma":[0.10054991,0.0000063695243,0.000078952675,0.00002759387,0.0005617176,0.000001314006,0.00060734904,0.000026178552,0.8981406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920577,0.000030132447,0.00021695074,0.00016963363,0.00019270304,0.00018484009],"domain_scores_gemma":[0.99929476,0.000058364236,0.00025910742,0.00024452104,0.00008383092,0.000059442107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008128147,0.000243861,0.00036242482,0.00027053017,0.00013208148,0.00003815778,0.0003087835,0.00016780532,0.000027572565],"category_scores_gemma":[0.0000016066014,0.00029864273,0.00020993673,0.000011614228,0.00008176362,0.000098138116,0.0003003322,0.00036685535,0.000017623552],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018545472,0.0000045105808,0.000028755296,0.000011915214,0.000040511488,0.000002635093,0.00012956858,0.0000014170821,0.000003806008,0.9507772,0.03170564,0.01727554],"study_design_scores_gemma":[0.0003861721,0.000007624259,0.00013281385,0.000065421315,0.00010122375,2.0590588e-7,0.000048603586,0.00028336336,0.000030272058,0.00031705774,0.9983073,0.00031996745],"about_ca_topic_score_codex":0.00018773596,"about_ca_topic_score_gemma":0.0000058962773,"teacher_disagreement_score":0.9666016,"about_ca_system_score_codex":0.000110468696,"about_ca_system_score_gemma":0.000035786914,"threshold_uncertainty_score":0.9999466},"labels":[],"label_agreement":null},{"id":"W2507508039","doi":"10.1007/s13278-016-0387-0","title":"Spectral embedding of directed networks","year":2016,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Embedding; Computer science; Artificial intelligence; Theoretical computer science","score_opus":0.008791855830323792,"score_gpt":0.2654640255222757,"score_spread":0.25667216969195195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507508039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6409741,0.00030221557,0.35283378,0.000103741346,0.00006084057,0.00009257303,0.000009493876,0.00013240402,0.0054908236],"genre_scores_gemma":[0.99380887,0.000029313138,0.0044795573,0.000014914445,0.0013464427,0.000009599473,0.000021600037,0.000017479551,0.00027220458],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985804,0.00010658494,0.00042633654,0.00031647945,0.00015455196,0.00041566647],"domain_scores_gemma":[0.9991638,0.00019585577,0.0003134038,0.00017286795,0.00007885639,0.00007522416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035425447,0.00018914414,0.00064478215,0.00015938378,0.00027219256,0.00003578111,0.00013786319,0.00005943127,0.00047012637],"category_scores_gemma":[0.0000051960055,0.00014472773,0.000475089,0.0015009856,0.00011671962,0.00008026406,0.00010159822,0.0000844249,8.393589e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023252585,0.000043712636,0.85127014,0.0000030443393,0.0038760717,0.0000011534934,0.0003825493,0.003361365,0.00018805674,0.01453491,0.0026950743,0.123620674],"study_design_scores_gemma":[0.0022839296,0.00020569052,0.53166837,0.000356955,0.017022308,0.0000012148065,0.001864413,0.4012669,0.000586793,0.035951924,0.006301172,0.0024903517],"about_ca_topic_score_codex":0.00012701524,"about_ca_topic_score_gemma":0.000080227874,"teacher_disagreement_score":0.39790553,"about_ca_system_score_codex":0.000017726534,"about_ca_system_score_gemma":0.000014116595,"threshold_uncertainty_score":0.59018254},"labels":[],"label_agreement":null},{"id":"W2510377198","doi":"","title":"GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Constrained Shortest Path First; K shortest path routing; Private Network-to-Network Interface; Shortest Path Faster Algorithm; Yen's algorithm; Algorithm; Path (computing); Mathematical optimization; Average path length; Routing (electronic design automation); Convergence (economics); Link-state routing protocol; Dijkstra's algorithm; Routing protocol; Mathematics; Theoretical computer science; Computer network; Graph","score_opus":0.06935098984981178,"score_gpt":0.37244072958290686,"score_spread":0.30308973973309505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2510377198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014289484,0.00071082567,0.983879,0.00043778107,0.00012906721,0.00025583155,0.0000065309873,0.0000142686085,0.00027720036],"genre_scores_gemma":[0.9868474,0.000024412133,0.012198442,0.000011958116,0.0008121062,0.00003784666,0.00001845896,0.000017289327,0.000032114065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980688,0.00026025207,0.00081540184,0.00012393104,0.00050809095,0.00022354374],"domain_scores_gemma":[0.99730253,0.00073890283,0.00056192046,0.00027556182,0.0010387443,0.00008236809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021472254,0.000112756905,0.0002740853,0.00038225442,0.00011371826,0.00019720898,0.0009034882,0.000036598718,0.000010869773],"category_scores_gemma":[0.000052460684,0.000108266606,0.0001424126,0.00032288622,0.000056787612,0.00027399402,0.00015304962,0.00040924607,0.0000020184898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040118863,0.00010926512,0.0018209709,3.7511615e-8,0.0001784542,0.0000022486897,0.0006954986,0.92507696,0.000032666994,0.043990582,0.00019002303,0.027863164],"study_design_scores_gemma":[0.0012303728,0.00012747443,0.0010603332,0.0008218573,0.000024735404,0.000013758287,0.004791431,0.9614957,0.000040451956,0.029827788,0.0004336775,0.0001324336],"about_ca_topic_score_codex":0.0013537676,"about_ca_topic_score_gemma":0.00012794968,"teacher_disagreement_score":0.9725579,"about_ca_system_score_codex":0.0003174233,"about_ca_system_score_gemma":0.00019999396,"threshold_uncertainty_score":0.4414984},"labels":[],"label_agreement":null},{"id":"W2513849254","doi":"10.1371/journal.pone.0161474","title":"BRIDES: A New Fast Algorithm and Software for Characterizing Evolving Similarity Networks Using Breakthroughs, Roadblocks, Impasses, Detours, Equals and Shortcuts","year":2016,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Similarity (geometry); Computer science; Software; Algorithm; Computational biology; Biology; Artificial intelligence; Programming language","score_opus":0.04307155289782734,"score_gpt":0.2658913128315057,"score_spread":0.22281975993367836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513849254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20261638,0.0007481722,0.7955986,0.00023358628,0.00001550538,0.0004999928,0.00011115,0.00014860375,0.000027956958],"genre_scores_gemma":[0.79487216,0.00010046185,0.20338929,0.00008171024,0.0012657156,0.000046076435,0.000062539504,0.0000627893,0.000119266784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829954,0.000051292114,0.00039174053,0.0005277438,0.00019873501,0.0005309716],"domain_scores_gemma":[0.9987274,0.00032034898,0.00022924104,0.00033213466,0.00016882695,0.00022204855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000253028,0.0003093889,0.00059632096,0.000079211,0.00027656613,0.0002084614,0.00015652127,0.00008663181,0.00011995533],"category_scores_gemma":[0.000035971192,0.000269766,0.00010216628,0.00016578042,0.00007044914,0.0004273947,0.00023798284,0.00014900258,7.9833643e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041786374,0.00056509266,0.20520043,0.000082998835,0.0015537641,0.0000038588923,0.00019131124,0.000017144874,0.02276867,0.00044349692,0.0014261027,0.7677053],"study_design_scores_gemma":[0.0078038997,0.0010221452,0.088388205,0.010695182,0.0071629253,0.000038593163,0.00073964277,0.7911676,0.055052653,0.028293924,0.0033828781,0.006252305],"about_ca_topic_score_codex":0.0005576035,"about_ca_topic_score_gemma":0.000029475988,"teacher_disagreement_score":0.7911505,"about_ca_system_score_codex":0.000059244325,"about_ca_system_score_gemma":0.000073056006,"threshold_uncertainty_score":0.99997544},"labels":[],"label_agreement":null},{"id":"W2515948467","doi":"10.1109/ssp.2016.7551713","title":"Inferring network properties from fixed-choice design with strong and weak ties","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Sampling (signal processing); Network structure; Interpersonal ties; Social network (sociolinguistics); Strong ties; Data mining; Theoretical computer science; Econometrics; Mathematics; Social media; World Wide Web; Telecommunications","score_opus":0.02827427502790589,"score_gpt":0.22548867937264308,"score_spread":0.1972144043447372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515948467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23089123,0.00024434022,0.757732,0.00017500429,0.000020454761,0.00021514152,0.0000036976344,0.00019470029,0.0105234785],"genre_scores_gemma":[0.98282254,0.0000060026987,0.015079068,0.00001870541,0.00044025102,0.00003970594,0.0000028600437,0.00001886843,0.0015720027],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992009,0.000054715263,0.00015266985,0.0002376464,0.00010544783,0.0002486393],"domain_scores_gemma":[0.9994183,0.00018219737,0.00006574085,0.00023300067,0.00004088421,0.000059835686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009308879,0.00016074472,0.0002007584,0.000027427594,0.00012173216,0.000083659106,0.000115536364,0.000021629652,0.0005042301],"category_scores_gemma":[0.000002962944,0.000086080116,0.000034581146,0.00008207996,0.00007663303,0.00021606928,0.000101542035,0.000067459645,0.000010728764],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005764184,0.000039290444,0.88623005,0.0000040022696,0.00038666438,5.6598896e-7,0.00011727371,0.0010072632,0.0018162708,0.018519176,0.0066036955,0.08521813],"study_design_scores_gemma":[0.008418513,0.001934621,0.43924323,0.004434508,0.0019349944,0.000005881729,0.0036656016,0.07149187,0.118315645,0.17382708,0.16921642,0.007511635],"about_ca_topic_score_codex":0.0010895258,"about_ca_topic_score_gemma":0.00016615588,"teacher_disagreement_score":0.7519313,"about_ca_system_score_codex":0.00001343174,"about_ca_system_score_gemma":0.000021601636,"threshold_uncertainty_score":0.5520966},"labels":[],"label_agreement":null},{"id":"W2516965256","doi":"10.1017/nws.2016.13","title":"Evolution through bursts: Network structure develops through localized bursts in time and space","year":2016,"lang":"en","type":"article","venue":"Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Assortativity; Homophily; Network formation; Network dynamics; Computer science; Preferential attachment; Network model; Dynamic network analysis; Kuramoto model; Cluster analysis; Statistical physics; Complex network; Physics; Computer network; Mathematics; Artificial intelligence; Synchronization (alternating current)","score_opus":0.008107822286294569,"score_gpt":0.2518100767904448,"score_spread":0.24370225450415026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516965256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65982425,0.0011285114,0.32640478,0.0011712246,0.0004738056,0.00076074916,0.000020221798,0.0003027973,0.00991368],"genre_scores_gemma":[0.9670454,0.000033888096,0.03128804,0.00011564448,0.0011136462,0.000018154686,0.0000072681823,0.000021950602,0.0003559837],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971547,0.0001126113,0.00039449864,0.0007891649,0.0005345943,0.0010144179],"domain_scores_gemma":[0.9988282,0.0001732214,0.00020891835,0.0005462804,0.00012765628,0.00011574709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007214382,0.00030502185,0.0004124341,0.00006540187,0.0004428721,0.00014995023,0.00070494704,0.00008341764,0.00038787903],"category_scores_gemma":[0.000021441283,0.00022589973,0.00007072636,0.0023968532,0.0008134327,0.00081816135,0.0004301186,0.00021095561,0.000033421085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009902528,0.0001188191,0.5639611,0.00001051211,0.0000805095,0.0000068425047,0.0006627253,0.024292476,0.0050531765,0.3388221,0.03550622,0.031386513],"study_design_scores_gemma":[0.0013371594,0.00010430052,0.06464579,0.0006395554,0.000066198845,0.000006589726,0.00006196652,0.02022605,0.0011198126,0.876239,0.034416415,0.0011371667],"about_ca_topic_score_codex":0.00034780253,"about_ca_topic_score_gemma":0.00011940937,"teacher_disagreement_score":0.53741693,"about_ca_system_score_codex":0.00021544233,"about_ca_system_score_gemma":0.00018800187,"threshold_uncertainty_score":0.92119235},"labels":[],"label_agreement":null},{"id":"W2517032322","doi":"10.1145/2980523.2980526","title":"Viral marketing 2.0","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Viral marketing; Heuristics; Scalability; Computer science; Social network (sociolinguistics); State (computer science); Data science; Diffusion; Social media; World Wide Web; Algorithm","score_opus":0.006402298348024646,"score_gpt":0.23755493545576709,"score_spread":0.23115263710774245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517032322","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17931767,0.000006702238,0.26688725,0.0004732048,0.000024418572,0.000050371484,0.0000019080624,0.00017130718,0.5530672],"genre_scores_gemma":[0.98834026,3.9768625e-7,0.003064055,0.000023913663,0.00019030571,0.0000056936183,9.0500953e-7,0.0000048835695,0.008369584],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965394,0.000024887908,0.000077043114,0.00009131821,0.000045866538,0.0001069674],"domain_scores_gemma":[0.999743,0.00006925701,0.000021861819,0.00012923348,0.00001404794,0.00002261783],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013308207,0.00004574591,0.000059151014,0.000019519102,0.000028809756,0.000011153872,0.00007274967,0.0000060312823,0.007697274],"category_scores_gemma":[0.0000023761781,0.00002627557,0.000056744702,0.000042990792,0.000012562256,0.000046213154,0.00004176266,0.000017330529,0.000106932814],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060314205,0.000021916778,0.18236715,5.5972833e-7,0.000037904683,2.5026236e-7,0.000005215136,3.1251741e-7,0.0061290273,0.12121563,0.029979773,0.66023624],"study_design_scores_gemma":[0.0012192711,0.00006324638,0.10018594,0.00013665138,0.00009226277,9.621515e-7,0.00011733336,0.0017164737,0.06705483,0.29782858,0.5304549,0.0011295618],"about_ca_topic_score_codex":0.00003078195,"about_ca_topic_score_gemma":0.0000015272501,"teacher_disagreement_score":0.8090226,"about_ca_system_score_codex":0.0000058551523,"about_ca_system_score_gemma":0.0000041647468,"threshold_uncertainty_score":0.99320984},"labels":[],"label_agreement":null},{"id":"W2518448515","doi":"10.4310/cms.2016.v14.n6.a12","title":"An SIS-type marketing model on random networks","year":2016,"lang":"en","type":"article","venue":"Communications in Mathematical Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Type (biology); Mathematics; Random graph; Statistical physics; Discrete mathematics; Physics; Geology","score_opus":0.06313600185843862,"score_gpt":0.37184157162918413,"score_spread":0.3087055697707455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518448515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08892922,0.000087471315,0.76001674,0.001975315,0.000020132837,0.0003036005,0.0000025390764,0.000108622575,0.14855634],"genre_scores_gemma":[0.94473356,0.00002621104,0.055016637,0.000038035516,0.000028044677,0.000041143598,0.000001954853,0.000005816209,0.000108579836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885744,0.0002855007,0.0002867183,0.00019607494,0.0001604715,0.00021377327],"domain_scores_gemma":[0.9971023,0.0016259638,0.00008194861,0.0010955257,0.000039957875,0.00005426853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019396323,0.00009523821,0.00017477496,0.0000833703,0.00028666374,0.00006975995,0.0014024939,0.000024423061,0.00038172695],"category_scores_gemma":[0.00009536628,0.00005925398,0.000053893098,0.00049556413,0.00043470415,0.00015973879,0.00021744671,0.00011126383,0.00003451565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019844309,0.00047967013,0.009144561,0.0000027283463,0.00001320696,8.7800636e-8,0.00013068241,0.009421059,0.00025806806,0.90454954,0.00042862052,0.07555194],"study_design_scores_gemma":[0.00012168552,0.000018445084,0.000266538,0.000095821015,0.000006264446,9.551608e-8,0.00005854609,0.72580844,0.000025633462,0.27341685,0.000097067335,0.00008462011],"about_ca_topic_score_codex":0.0000068364857,"about_ca_topic_score_gemma":0.000009208772,"teacher_disagreement_score":0.8558044,"about_ca_system_score_codex":0.000022862789,"about_ca_system_score_gemma":0.000027030548,"threshold_uncertainty_score":0.41796425},"labels":[],"label_agreement":null},{"id":"W2519076742","doi":"10.3166/isi.21.3.93-118","title":"Recommandation contextuelle d’utilisateurs pour les plateformes de micro-blogging","year":2016,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Political science; Humanities; Art","score_opus":0.017421346327962425,"score_gpt":0.24636939643287473,"score_spread":0.22894805010491232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519076742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46209165,0.0007891153,0.52128434,0.0016959497,0.00041879204,0.00044614382,0.00014589525,0.00025739468,0.012870708],"genre_scores_gemma":[0.9907165,0.00028556908,0.005522214,0.00009614688,0.00048615457,0.000071066985,0.0002455112,0.000031145195,0.0025456618],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997779,0.0001999072,0.0009556668,0.00020830025,0.00019864578,0.0006584766],"domain_scores_gemma":[0.998265,0.00023305684,0.0006795553,0.00035249954,0.00033236796,0.00013747643],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00075291726,0.00036020819,0.00040299885,0.00028872504,0.0005290352,0.00033610157,0.0003013063,0.00019657503,0.0010451819],"category_scores_gemma":[0.00007715209,0.0003078203,0.0002483095,0.00031133034,0.00028059634,0.0033159787,0.00013218605,0.0002065292,0.00056389347],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000485406,0.000050490904,0.044596978,0.00015251813,0.00018784309,0.0000010200735,0.0027442784,0.00013945796,0.0024291757,0.020095365,0.010726312,0.918828],"study_design_scores_gemma":[0.003766769,0.00038095762,0.0320295,0.0058103297,0.000576834,0.00009445253,0.013855312,0.030385224,0.07410798,0.15506598,0.6815982,0.002328437],"about_ca_topic_score_codex":0.0008256594,"about_ca_topic_score_gemma":0.000057140172,"teacher_disagreement_score":0.91649956,"about_ca_system_score_codex":0.0008440564,"about_ca_system_score_gemma":0.00022113729,"threshold_uncertainty_score":0.9999374},"labels":[],"label_agreement":null},{"id":"W2519670224","doi":"10.1177/1541931213601052","title":"Adaptive Visualization of Complex Networks with FocalPoint","year":2016,"lang":"en","type":"article","venue":"Proceedings of the Human Factors and Ergonomics Society Annual Meeting","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; University of Toronto","keywords":"Situation awareness; Computer science; Information overload; Visualization; Cognitive load; Human–computer interaction; Context (archaeology); Task (project management); Cognition; Artificial intelligence; World Wide Web","score_opus":0.01569618995209299,"score_gpt":0.23849572782838094,"score_spread":0.22279953787628795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519670224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99345475,0.000015819423,0.005403095,0.000025462208,0.000012044858,0.00014169645,0.00001860473,0.000024030844,0.0009044674],"genre_scores_gemma":[0.99839115,0.000008594553,0.0014212963,0.000010020536,0.00009967624,0.0000055552478,0.0000033070494,0.000019112627,0.00004126802],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991888,0.00000749564,0.0003141012,0.00020216857,0.00010501856,0.00018244165],"domain_scores_gemma":[0.99903685,0.00006512727,0.0005438698,0.00007617142,0.00023814348,0.000039848805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020714398,0.00016377351,0.00029121543,0.000021033298,0.00021977596,0.000022739307,0.00019801424,0.00004108563,0.000015571006],"category_scores_gemma":[0.0000048030242,0.000091613074,0.00019041661,0.00013216141,0.00023760619,0.00016515703,0.00019741456,0.0000761421,6.586748e-8],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064335814,0.00009376183,0.90857935,0.000040353356,0.00039694956,6.7020545e-9,0.0036983788,0.00023603493,0.014141765,0.06946968,0.0016265196,0.0016528629],"study_design_scores_gemma":[0.0037003201,0.001375046,0.715185,0.0029976803,0.0010883244,0.0000017710533,0.05017492,0.04233363,0.1449082,0.034279644,0.0016544973,0.0023009581],"about_ca_topic_score_codex":0.00012656378,"about_ca_topic_score_gemma":0.000004886782,"teacher_disagreement_score":0.19339433,"about_ca_system_score_codex":0.000029631137,"about_ca_system_score_gemma":0.000010474998,"threshold_uncertainty_score":0.37358728},"labels":[],"label_agreement":null},{"id":"W2521748935","doi":"10.1007/978-3-319-33652-7_3","title":"Dynamical Social Video Propagation","year":2016,"lang":"en","type":"book-chapter","venue":"Springer briefs in electrical and computer engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Popularity; Computer science; Process (computing); Online video; Social media; Multimedia; Internet privacy; Sociology; World Wide Web; Psychology; Social psychology","score_opus":0.004851602212954368,"score_gpt":0.19529726917730486,"score_spread":0.1904456669643505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521748935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013397111,0.0002484705,0.9495003,0.00015678482,0.00013581252,0.0003172262,0.000007774669,0.00027493224,0.04801895],"genre_scores_gemma":[0.97340286,0.0000344063,0.0056489743,0.00006951036,0.0046170736,0.000055359415,0.000031283274,0.00015577092,0.015984774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868846,0.000008980171,0.0003376228,0.00042153316,0.00021859606,0.0003247918],"domain_scores_gemma":[0.9995946,0.00006169497,0.000083824256,0.0001459377,0.00004674264,0.000067195666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010856251,0.00031764337,0.0004293565,0.00022197304,0.00004762107,0.00005713312,0.00015913433,0.00014245733,0.00007568569],"category_scores_gemma":[0.0000016807955,0.00029505783,0.00015001754,0.00007713597,0.00002878387,0.00005885071,0.00016142918,0.0004776351,0.000010656051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068552117,0.000020069865,0.00024214803,0.000018642737,0.00010755769,0.000007295773,0.00002012504,0.00012360173,0.000073509415,0.7216566,0.00033139234,0.27739218],"study_design_scores_gemma":[0.0010758232,0.0001841351,0.0047450527,0.00074042636,0.00018411683,0.000011452101,5.2178336e-7,0.7106721,0.0002362934,0.12322532,0.15650794,0.0024168196],"about_ca_topic_score_codex":0.0000098669525,"about_ca_topic_score_gemma":0.0000014745006,"teacher_disagreement_score":0.9720631,"about_ca_system_score_codex":0.00012691075,"about_ca_system_score_gemma":0.000025359554,"threshold_uncertainty_score":0.9999502},"labels":[],"label_agreement":null},{"id":"W2525623085","doi":"10.1109/wcica.2016.7578775","title":"User characteristics based information diffusion model for analysis of hot social events","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Microblogging; Computer science; Social media; Diffusion; The Internet; Feature (linguistics); Social network (sociolinguistics); World Wide Web","score_opus":0.01761450075840943,"score_gpt":0.2764487009802232,"score_spread":0.2588342002218138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525623085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18422481,1.420388e-7,0.81496304,0.00007039185,0.000006848177,0.00009943403,0.00016570826,0.00002021309,0.00044937892],"genre_scores_gemma":[0.99441826,3.1172746e-7,0.0048620766,0.00004232086,0.000042985357,0.000030953313,0.00029506706,0.000004599675,0.0003034156],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994087,0.000011889454,0.00028443369,0.00007612438,0.00011245641,0.00010638662],"domain_scores_gemma":[0.9994552,0.000046809102,0.00020359302,0.00013297705,0.00013943354,0.000021999807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009484182,0.00007773075,0.00022793349,0.00017781631,0.000054685945,0.000009668545,0.00009354897,0.000024387582,0.00035433148],"category_scores_gemma":[0.0000035629519,0.000053369142,0.00027563103,0.00023657552,0.000012274526,0.00015770542,0.000029444145,0.000017616092,0.0000024705162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002988048,0.0006050131,0.49937895,0.0000379523,0.0029791319,2.779431e-8,0.0005005066,0.0016308358,0.0065955403,0.18400209,0.007908879,0.2960623],"study_design_scores_gemma":[0.00033570407,0.000012180312,0.035817035,0.000006636398,0.0006061156,1.5086659e-9,0.0000103848115,0.95864105,0.0007480555,0.0030295795,0.00068962737,0.000103631515],"about_ca_topic_score_codex":0.000028033872,"about_ca_topic_score_gemma":0.0000061004803,"teacher_disagreement_score":0.9570102,"about_ca_system_score_codex":0.000017341308,"about_ca_system_score_gemma":0.000019150297,"threshold_uncertainty_score":0.38796812},"labels":[],"label_agreement":null},{"id":"W2531271339","doi":"10.1007/978-3-319-41492-8_6","title":"Co-offence Prediction","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Knowledge extraction; Data science; Artificial intelligence; Machine learning","score_opus":0.012345948137692585,"score_gpt":0.26190134612374955,"score_spread":0.24955539798605697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531271339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012120156,0.00036425542,0.58120495,0.00014624791,0.00024072263,0.00027834406,0.00007429709,0.00014428866,0.4175348],"genre_scores_gemma":[0.9617426,0.00009574462,0.00045581927,0.00020926914,0.018842362,0.00005736019,0.00043438052,0.00014789971,0.018014567],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982841,0.00004814461,0.00045370279,0.000521772,0.0002685908,0.0004237129],"domain_scores_gemma":[0.9989462,0.0002678625,0.0003285295,0.00032620833,0.000071133094,0.00006006895],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001741446,0.00045815393,0.00061565096,0.0001319214,0.00022039107,0.000053264772,0.00031386586,0.00057928386,0.0021906097],"category_scores_gemma":[0.00000515942,0.0004139201,0.00038421268,0.00009298863,0.0001728038,0.00005826117,0.00007202023,0.000991156,0.000034490393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051026505,0.000043268872,0.006819095,0.000014421827,0.00043599194,0.000009652172,0.00021916207,0.0038382758,0.000019132192,0.22519606,0.021776935,0.74157697],"study_design_scores_gemma":[0.00035998572,0.00004741441,0.00029670572,0.0003795854,0.00017444488,7.529338e-7,0.0000015375853,0.0036723414,0.00004733407,0.82201445,0.17219876,0.0008066889],"about_ca_topic_score_codex":0.000022521503,"about_ca_topic_score_gemma":0.000036813115,"teacher_disagreement_score":0.9617305,"about_ca_system_score_codex":0.00014983858,"about_ca_system_score_gemma":0.000050523602,"threshold_uncertainty_score":0.99983126},"labels":[],"label_agreement":null},{"id":"W2533110648","doi":"10.1145/2983323.2983836","title":"Efficient Computation of Importance Based Communities in Web-Scale Networks Using a Single Machine","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computation; Theoretical computer science; Implementation; Core (optical fiber); Scale (ratio); Community structure; Graph; Distributed computing; Algorithm; Mathematics; Combinatorics; Geography","score_opus":0.019399245216964175,"score_gpt":0.26051492842227614,"score_spread":0.24111568320531196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533110648","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5224171,0.000027590977,0.47637928,0.00002238066,0.000008078812,0.00006143201,0.0000042179868,0.000022851145,0.0010570198],"genre_scores_gemma":[0.990367,3.9359014e-7,0.00953665,0.000019489025,0.00002915176,0.0000051784996,0.00001749341,0.000010051292,0.00001460638],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992858,0.00007803399,0.0003002477,0.00009442238,0.00009012141,0.00015133679],"domain_scores_gemma":[0.99947,0.00011788221,0.0001402551,0.00019680042,0.00005144,0.000023636996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019253076,0.00009490556,0.0001987406,0.00009709545,0.000038138955,0.000010740881,0.00010469107,0.000018385746,0.00029637423],"category_scores_gemma":[8.8719094e-7,0.00007017293,0.000072722534,0.00023216261,0.000061808394,0.000025490011,0.000049341357,0.000055818866,6.652679e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020458441,0.00037842724,0.61435866,0.0000060459083,0.000023716251,3.30599e-7,0.00009572992,0.36293784,0.004287322,0.0015407192,0.0000889926,0.01626176],"study_design_scores_gemma":[0.00034960482,0.000021894697,0.0023887078,0.00010093588,0.000011887626,9.1062034e-8,0.00009077638,0.9953061,0.0010932104,0.00051164796,0.000030163135,0.000095019896],"about_ca_topic_score_codex":0.0009709404,"about_ca_topic_score_gemma":0.0009554181,"teacher_disagreement_score":0.6323682,"about_ca_system_score_codex":0.000040008643,"about_ca_system_score_gemma":0.000019107845,"threshold_uncertainty_score":0.324509},"labels":[],"label_agreement":null},{"id":"W2535260614","doi":"10.1371/journal.pone.0170579","title":"A framework for analyzing contagion in assortative banking networks","year":2017,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Irish Research Council; Science Foundation Ireland","keywords":"Assortativity; Systemic risk; Cascade; Computer science; Stylized fact; Random graph; Network theory; Statistical physics; Complex network; Econometrics; Mathematics; Topology (electrical circuits); Graph; Theoretical computer science; Statistics; Physics; Economics; Combinatorics","score_opus":0.06470630947277609,"score_gpt":0.3175219645775328,"score_spread":0.2528156551047567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2535260614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44583973,0.000064257954,0.55099666,0.0001980743,0.000021416214,0.00040364085,0.0000073415595,0.000049015605,0.0024198568],"genre_scores_gemma":[0.9589592,0.000005580867,0.040319122,0.000025068113,0.00044799026,0.0001377445,0.000026839225,0.000018304956,0.000060153227],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915695,0.000030263349,0.00021403666,0.00023192941,0.00010787111,0.0002589408],"domain_scores_gemma":[0.9989715,0.00022785395,0.00026877204,0.00042035122,0.000074104275,0.000037419428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023095829,0.00011933072,0.00032957815,0.00006592354,0.00026511168,0.00014513967,0.00027332784,0.000048087033,0.000113590286],"category_scores_gemma":[0.000045580575,0.00012676077,0.000109796754,0.000081396225,0.00003257669,0.00013847853,0.000074671116,0.00022872738,0.000002779631],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031133208,0.0004925578,0.87310964,0.000011224763,0.00054836745,0.0000011252553,0.00021580211,0.00020673002,0.0002739873,0.11591666,0.00009169313,0.009101087],"study_design_scores_gemma":[0.0010065567,0.00012309817,0.11328906,0.0016240077,0.0005831245,4.7875798e-8,0.0001500154,0.21651359,0.0055967104,0.66030836,0.00013161951,0.0006737871],"about_ca_topic_score_codex":0.0002142732,"about_ca_topic_score_gemma":0.00009463117,"teacher_disagreement_score":0.7598206,"about_ca_system_score_codex":0.00003180521,"about_ca_system_score_gemma":0.000011584032,"threshold_uncertainty_score":0.51691544},"labels":[],"label_agreement":null},{"id":"W2536223246","doi":"10.1145/2983323.2983849","title":"Efficient Estimation of Triangles in Very Large Graphs","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Clustering coefficient; Computer science; Random graph; Estimator; Cluster analysis; Graph; Enhanced Data Rates for GSM Evolution; Sampling (signal processing); Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Statistics","score_opus":0.008211309966779172,"score_gpt":0.2567315794760387,"score_spread":0.2485202695092595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536223246","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79889184,0.00000977479,0.19543496,0.000050078903,0.000010504722,0.00006845535,0.0000052144887,0.000023062206,0.00550608],"genre_scores_gemma":[0.9980296,4.7992376e-7,0.0018116684,0.000004058739,0.000013151117,0.000008604617,0.000003743009,0.0000033354088,0.00012534294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995789,0.000020944895,0.00015948825,0.000083016785,0.000063891006,0.00009377801],"domain_scores_gemma":[0.99973613,0.000057058143,0.000050574847,0.00012554163,0.000017007622,0.000013659938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013693614,0.000047178753,0.00010935971,0.00009537626,0.000011187033,0.0000036030976,0.00005781208,0.000010115893,0.0005481768],"category_scores_gemma":[0.0000032071305,0.000030241214,0.00006606592,0.00017417112,0.00001343262,0.000018859488,0.000024923143,0.000017417236,0.000008918806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026917303,0.00055910554,0.13148277,0.000006798804,0.00005942621,4.3784092e-7,0.00011357721,0.0035976898,0.002833247,0.6469828,0.0018318834,0.21250539],"study_design_scores_gemma":[0.0056097065,0.00018524297,0.11673107,0.000417589,0.0001148712,3.026143e-7,0.00033485738,0.48924196,0.085926265,0.29793218,0.002688918,0.0008170546],"about_ca_topic_score_codex":0.000061634964,"about_ca_topic_score_gemma":0.000013506594,"teacher_disagreement_score":0.48564428,"about_ca_system_score_codex":0.00000845595,"about_ca_system_score_gemma":0.0000079556685,"threshold_uncertainty_score":0.6002152},"labels":[],"label_agreement":null},{"id":"W2541641307","doi":"10.1007/s13278-017-0424-7","title":"Hashkat: large-scale simulations of online social networks","year":2017,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Toronto Metropolitan University; University of Waterloo; Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Python (programming language); Scripting language; Social network (sociolinguistics); Extensibility; Software; Network topology; Dynamic network analysis; Social computing","score_opus":0.01670620556944801,"score_gpt":0.3100303740819892,"score_spread":0.2933241685125412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2541641307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7912406,0.00017674947,0.20394328,0.0003102487,0.000084254476,0.00013961842,0.00013326904,0.00006031789,0.0039117015],"genre_scores_gemma":[0.9932788,0.000009826162,0.0032955464,0.000034885918,0.0028085732,0.000006318983,0.00032266474,0.00002074846,0.00022261792],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845636,0.00008926373,0.00048075133,0.00033890663,0.00019206858,0.0004426661],"domain_scores_gemma":[0.9986742,0.000093035786,0.00069505454,0.00032967696,0.0001376703,0.00007033178],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00035631086,0.00021216551,0.00076419325,0.00012278535,0.0024266243,0.00016443565,0.00030470314,0.00010002914,0.00028482286],"category_scores_gemma":[0.0000067434175,0.00022102974,0.0005965301,0.0006096817,0.00018876577,0.00013324166,0.00027104703,0.00019032796,5.0394345e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019651894,0.00020446302,0.9114384,0.0000056387935,0.0034056955,8.4658524e-7,0.0016800354,0.023533523,0.000015782492,0.008386551,0.0026990832,0.048610315],"study_design_scores_gemma":[0.0006047547,0.000025769092,0.3865345,0.000024473527,0.0044719228,7.6463586e-8,0.0013818289,0.59822094,0.0000076088245,0.004860475,0.003395633,0.00047203893],"about_ca_topic_score_codex":0.0002745111,"about_ca_topic_score_gemma":0.0015881154,"teacher_disagreement_score":0.5746874,"about_ca_system_score_codex":0.000013247934,"about_ca_system_score_gemma":0.000024549645,"threshold_uncertainty_score":0.9988721},"labels":[],"label_agreement":null},{"id":"W2543500487","doi":"10.1109/dsdis.2015.116","title":"Efficiency Improvements in Social Network Communication via MapReduce","year":2015,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Big data; Computer science; Data science; Variety (cybernetics); Social network (sociolinguistics); Cyber-physical system; Resource (disambiguation); Programming paradigm; Distributed computing; Social media; World Wide Web; Artificial intelligence; Data mining; Computer network","score_opus":0.022138542285731987,"score_gpt":0.29510677581402917,"score_spread":0.2729682335282972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543500487","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43768364,0.00016803008,0.25185558,0.00063173403,0.00011043993,0.0006046834,0.0000032782598,0.000252073,0.30869055],"genre_scores_gemma":[0.9959607,6.1263734e-7,0.0032557696,0.000049837665,0.0002462691,0.000030866144,0.000038196806,0.000007721256,0.00040998776],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993074,0.000065989036,0.00019601786,0.00012609825,0.00010987367,0.000194641],"domain_scores_gemma":[0.99957633,0.000017129754,0.000068645444,0.00023673926,0.00006214468,0.00003903231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030113023,0.00008058209,0.0001262949,0.00003694321,0.00008245185,0.000027631657,0.00024327298,0.00002045696,0.00016074833],"category_scores_gemma":[0.0000014011854,0.000079075144,0.00004278277,0.0003954849,0.000025531312,0.000071674134,0.00014660326,0.000101082085,0.000025366757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039171868,0.0009887142,0.30347654,0.0000049268397,0.00012385054,6.276806e-7,0.001392509,0.00281874,0.0006674844,0.20090935,0.1675966,0.3219815],"study_design_scores_gemma":[0.0026757435,0.00016319215,0.03236994,0.000046649908,0.00009158294,3.636045e-7,0.0013656166,0.14257634,0.0021284136,0.7799276,0.037553802,0.001100744],"about_ca_topic_score_codex":0.0008174795,"about_ca_topic_score_gemma":0.00005311974,"teacher_disagreement_score":0.57901824,"about_ca_system_score_codex":0.000041784,"about_ca_system_score_gemma":0.000028068203,"threshold_uncertainty_score":0.3224591},"labels":[],"label_agreement":null},{"id":"W2543722153","doi":"10.1109/tkde.2017.2740284","title":"Activity Maximization by Effective Information Diffusion in Social Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Submodular set function; Scalability; Maximization; Polling; Approximation algorithm; Heuristic; Upper and lower bounds; Social network (sociolinguistics); Mathematical optimization; Algorithm; Artificial intelligence; Social media; Mathematics","score_opus":0.010554535711334448,"score_gpt":0.26786463651132125,"score_spread":0.2573101007999868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543722153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048489593,0.00001799199,0.9505302,0.000018388006,0.000100609,0.00016076834,0.00008438587,0.00004809547,0.0005499705],"genre_scores_gemma":[0.9995152,0.000018308463,0.00018404369,0.0000025724023,0.00010124886,0.000038638194,0.00011036499,0.000008816063,0.000020848935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995274,0.000017573173,0.000116900694,0.00015731623,0.000050913844,0.00012987285],"domain_scores_gemma":[0.9994955,0.00004334796,0.000059111506,0.0003506387,0.000019975481,0.000031403666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011615361,0.0001159583,0.00013850044,0.00009488957,0.00033196597,0.00012057767,0.00019735069,0.000045266817,0.000018016799],"category_scores_gemma":[0.0000016899659,0.00012361616,0.000029598763,0.00008641387,0.0000171352,0.00095553586,0.000013262201,0.00019497261,0.0000037027653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003726341,0.00022048294,0.0014160625,0.000027209646,0.0000726942,2.304941e-7,0.0002702161,0.02203332,0.0007527949,0.00029872963,0.00095280726,0.9739182],"study_design_scores_gemma":[0.0003804956,0.000016092552,0.0077978508,0.000034398556,0.00003062632,1.631856e-7,0.0000106149055,0.9885112,0.001205033,0.00003789301,0.0018192647,0.00015638031],"about_ca_topic_score_codex":0.0001263162,"about_ca_topic_score_gemma":0.000027516366,"teacher_disagreement_score":0.9737618,"about_ca_system_score_codex":0.00002781328,"about_ca_system_score_gemma":0.000006110868,"threshold_uncertainty_score":0.5040921},"labels":[],"label_agreement":null},{"id":"W2543827342","doi":"10.1109/icdmw.2014.124","title":"Exploring Mixed Membership Stochastic Block Models via Non-negative Matrix Factorization","year":2014,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Non-negative matrix factorization; Stochastic block model; Computer science; Node (physics); Matrix decomposition; Inference; Context (archaeology); Block (permutation group theory); Theoretical computer science; Incidence matrix; Community structure; Algorithm; Artificial intelligence; Mathematics; Cluster analysis; Combinatorics","score_opus":0.06320163163066293,"score_gpt":0.2677384782016064,"score_spread":0.20453684657094345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543827342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0671176,0.0000017649467,0.92132485,0.000030342684,0.00007546553,0.00017303025,0.0000023928426,0.0001528211,0.01112176],"genre_scores_gemma":[0.99236155,3.9057898e-7,0.0066894363,0.000010074001,0.0003968494,0.00008576396,0.000027247039,0.000026718197,0.00040198464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989815,0.000056084144,0.000246409,0.00027864278,0.00018434503,0.00025305286],"domain_scores_gemma":[0.9992613,0.00015080727,0.00011078158,0.0002938723,0.00009751577,0.0000857008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014411444,0.0001891962,0.000245959,0.00010212437,0.000112546586,0.000055577864,0.00016959906,0.000025131027,0.00031448173],"category_scores_gemma":[0.000005768429,0.00017661678,0.00012292074,0.00027450564,0.000021972593,0.00036092976,0.00007456368,0.000119429504,0.000043524567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046844234,0.00032701975,0.003241131,0.00003107462,0.00061488524,5.134808e-7,0.0025552534,0.55682695,0.0045400453,0.39259508,0.0016604533,0.03756075],"study_design_scores_gemma":[0.00022606143,0.000034882425,0.0002246263,0.000020814792,0.00006774404,1.4439684e-7,0.00018433743,0.86107826,0.008086318,0.12971826,0.00007580011,0.00028275393],"about_ca_topic_score_codex":0.00039884556,"about_ca_topic_score_gemma":0.000021027112,"teacher_disagreement_score":0.9252439,"about_ca_system_score_codex":0.000032743552,"about_ca_system_score_gemma":0.000012201626,"threshold_uncertainty_score":0.72022235},"labels":[],"label_agreement":null},{"id":"W2546176423","doi":"10.1115/1.4035054","title":"Function Module Partition for Complex Products and Systems Based on Weighted and Directed Complex Networks","year":2016,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Conceptual design; Partition (number theory); Modular design; Computer science; Function (biology); Complex network; Functional decomposition; Industrial engineering; Systems engineering; Data mining; Distributed computing; Engineering; Mathematics; Machine learning","score_opus":0.04662524136974074,"score_gpt":0.2597754990062855,"score_spread":0.21315025763654474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546176423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006296121,0.000059606307,0.9925096,0.00052852585,0.00011145493,0.00040840654,0.000009271728,0.000040622697,0.000036363566],"genre_scores_gemma":[0.9816811,0.000010512523,0.01755385,0.000052934985,0.00061761076,0.00002701152,0.000011027307,0.000018487526,0.000027472337],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987013,0.00025875284,0.00044266306,0.00020989789,0.0001912592,0.00019612319],"domain_scores_gemma":[0.9985602,0.0004902809,0.00038135477,0.00015043675,0.00030082685,0.00011690565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077406055,0.00015800181,0.00038388843,0.00009871694,0.00011146819,0.00006186899,0.00008339848,0.000051098257,0.000050585986],"category_scores_gemma":[0.000031374286,0.00010021239,0.00008792508,0.00014189241,0.000031492214,0.00010890354,0.000019146162,0.0001049554,7.8650567e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007372406,0.0017706773,0.0023158868,0.00018172734,0.0014933966,0.000012113326,0.000037095975,0.012117783,0.39626682,0.14862354,0.15263838,0.27717018],"study_design_scores_gemma":[0.0014315002,0.0010807315,0.0016239494,0.00018673285,0.00018961898,0.000004599966,0.00000721303,0.9749271,0.0015977838,0.01610618,0.002671565,0.000172982],"about_ca_topic_score_codex":0.000005425626,"about_ca_topic_score_gemma":5.421699e-7,"teacher_disagreement_score":0.97538495,"about_ca_system_score_codex":0.00003319051,"about_ca_system_score_gemma":0.00002355918,"threshold_uncertainty_score":0.40865424},"labels":[],"label_agreement":null},{"id":"W2548497170","doi":"10.1016/j.tcs.2018.05.030","title":"Whom to befriend to influence people","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Influencer marketing; Dominating set; Time complexity; DTIME; Computer science; Social network (sociolinguistics); Set (abstract data type); Viral marketing; Mathematics; Combinatorics; Discrete mathematics; Theoretical computer science; Graph; Computation; Algorithm; Vertex (graph theory); Social media","score_opus":0.004446420588320317,"score_gpt":0.2697570541844836,"score_spread":0.26531063359616325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548497170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46210796,4.103386e-7,0.5326898,0.00043321156,0.00005845496,0.000102531216,0.0000014706137,0.000060022398,0.00454613],"genre_scores_gemma":[0.9034375,1.9612205e-8,0.09528039,0.00075999636,0.00048515789,0.000012736913,5.988874e-7,0.0000070913784,0.000016495665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983994,0.00003428574,0.0001853792,0.00051921327,0.00037080544,0.0004909532],"domain_scores_gemma":[0.9986248,0.000074795804,0.000027572134,0.0006037697,0.0002729577,0.00039608366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053386623,0.00013561663,0.00017863286,0.00015465428,0.0005725869,0.0004572892,0.0011160827,0.000013446846,0.00061833207],"category_scores_gemma":[0.00001910692,0.00011695413,0.00004928871,0.0017555007,0.0017242781,0.00015738558,0.000968351,0.00008838414,0.0006158481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006086138,0.000027325379,0.0027574396,5.3953056e-7,0.0000033927859,2.9947927e-7,0.00087044016,0.00014115298,0.0009665146,0.9701949,0.00045703058,0.024574894],"study_design_scores_gemma":[0.00022488195,0.0012609402,0.050122406,0.00009445408,0.00003125454,0.0000037337568,0.00005327865,0.12271564,0.0475266,0.7640365,0.012929547,0.001000764],"about_ca_topic_score_codex":0.000040457908,"about_ca_topic_score_gemma":0.0000075795715,"teacher_disagreement_score":0.44132957,"about_ca_system_score_codex":0.000026614765,"about_ca_system_score_gemma":0.00007626998,"threshold_uncertainty_score":0.7915687},"labels":[],"label_agreement":null},{"id":"W2548762084","doi":"10.1109/tsipn.2017.2731160","title":"Online Bayesian Inference of Diffusion Networks","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Inference; Markov chain Monte Carlo; Exploit; Set (abstract data type); Ranking (information retrieval); Frequentist inference; Bayesian network; Bayesian inference; Node (physics); Bayesian probability; Data mining; Process (computing); Machine learning; Artificial intelligence; Engineering","score_opus":0.013407593670798433,"score_gpt":0.2732175694567648,"score_spread":0.2598099757859664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548762084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007583001,0.0001432109,0.9899135,0.000044466404,0.00023462481,0.00030133268,0.00008451478,0.00010372611,0.0015915725],"genre_scores_gemma":[0.9976036,0.00023282674,0.0013148085,0.000111836445,0.0002901109,0.000054548953,0.00027790325,0.000022151808,0.000092199894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981785,0.000062651605,0.00084301777,0.00029740084,0.00031817198,0.0003002704],"domain_scores_gemma":[0.99792147,0.00010079213,0.0011206245,0.00046462382,0.00026917734,0.00012332472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002443209,0.00042043408,0.0005859977,0.0002655764,0.0005948961,0.00041269104,0.00038321072,0.00029998802,0.00030745802],"category_scores_gemma":[0.0000017808011,0.0003935539,0.00024428827,0.00018168647,0.00016342638,0.0011988091,0.00003206345,0.0013560705,0.0000014314797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004359606,0.00013145305,0.00029856164,0.00007809783,0.00008406158,1.4584182e-7,0.00014364657,0.5316774,0.0000026649825,0.000119526645,0.00016410007,0.4672567],"study_design_scores_gemma":[0.0003275212,0.00007281809,0.00088271435,0.000902862,0.00018160525,5.744669e-7,0.000048329744,0.9947556,0.000113166134,0.0017818633,0.00054353324,0.00038936484],"about_ca_topic_score_codex":0.0002676586,"about_ca_topic_score_gemma":0.000016878765,"teacher_disagreement_score":0.99002063,"about_ca_system_score_codex":0.00003623294,"about_ca_system_score_gemma":0.00012191088,"threshold_uncertainty_score":0.99985164},"labels":[],"label_agreement":null},{"id":"W2552445864","doi":"10.5555/3192424.3192590","title":"Understanding alliance and opposition among violent groups","year":2016,"lang":"en","type":"article","venue":"Advances in Social Networks Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Opposition (politics); Alliance; Situational ethics; Political science; Political economy; Computer science; Social psychology; Sociology; Psychology; Politics","score_opus":0.024023159945715643,"score_gpt":0.28370391596118055,"score_spread":0.2596807560154649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552445864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30253607,0.001396643,0.69441104,0.00007331775,0.00002655454,0.00007232533,0.0000033319327,0.00002729057,0.0014534483],"genre_scores_gemma":[0.9971402,0.0015046955,0.0009033268,0.000022308492,0.00035179997,0.000021995897,0.0000136494755,0.0000108073555,0.000031175623],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989207,0.0000696012,0.00028269985,0.0003434939,0.000108613414,0.00027490937],"domain_scores_gemma":[0.9995005,0.00014745604,0.00017822243,0.000095685624,0.000021392843,0.000056738496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025680035,0.0001555357,0.00037320165,0.000120203615,0.00027158935,0.00006108031,0.00007473318,0.000046823065,0.00005029714],"category_scores_gemma":[0.0000024587625,0.00012580467,0.00012397178,0.00066961173,0.00015786257,0.00036479154,0.000076571065,0.00008422682,1.7472875e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010346473,0.000018714396,0.8434992,0.000002755184,0.00027811306,0.000001358478,0.00020901932,0.0013086587,0.000020328804,0.022590693,0.00005010956,0.13201073],"study_design_scores_gemma":[0.0025951965,0.00016624443,0.5524535,0.00095956976,0.003617174,0.0000011228284,0.008901654,0.25774089,0.00009408495,0.1682292,0.0030392122,0.0022021472],"about_ca_topic_score_codex":0.000044588985,"about_ca_topic_score_gemma":0.0003774271,"teacher_disagreement_score":0.69460416,"about_ca_system_score_codex":0.00005762814,"about_ca_system_score_gemma":0.0000042076845,"threshold_uncertainty_score":0.5130166},"labels":[],"label_agreement":null},{"id":"W2553679701","doi":"10.5555/3192424.3192605","title":"A new topological metric for link prediction in directed, weighted and temporal networks","year":2016,"lang":"en","type":"article","venue":"Advances in Social Networks Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Link (geometry); Metric (unit); Computer science; Metrics; Graph; Data mining; Artificial intelligence; Link analysis; Machine learning; Theoretical computer science; Routing protocol","score_opus":0.009924588694609993,"score_gpt":0.28646151756470395,"score_spread":0.27653692887009396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553679701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072116464,0.004739997,0.9220369,0.00017699935,0.00006404709,0.00022198554,0.000008984361,0.00006550082,0.00056915614],"genre_scores_gemma":[0.9875293,0.0008743858,0.010092153,0.000023102206,0.0012068322,0.00006440519,0.000048401667,0.000013238079,0.00014819649],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848187,0.000100563484,0.00048098408,0.0004555866,0.000101680496,0.00037932256],"domain_scores_gemma":[0.9991081,0.00045188924,0.00020889877,0.00010811632,0.00004175385,0.000081293816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040423239,0.00020063139,0.0006117885,0.00038824425,0.00017485143,0.000049957685,0.00009982409,0.000118798605,0.00007169322],"category_scores_gemma":[0.000013553365,0.0001528408,0.00018341535,0.0020744693,0.00008422759,0.00024275533,0.00008006074,0.00014241504,1.0018773e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031263673,0.000020162666,0.54372525,0.000001434275,0.00015179893,6.416295e-7,0.00006124142,0.0013288145,0.0000013082132,0.0021779197,0.00014526481,0.45235488],"study_design_scores_gemma":[0.0025746857,0.00016099514,0.16335236,0.00012709989,0.001112705,5.0839617e-7,0.00044060565,0.79398507,0.0000069260373,0.026438305,0.011143153,0.000657611],"about_ca_topic_score_codex":0.00022052944,"about_ca_topic_score_gemma":0.0009022974,"teacher_disagreement_score":0.91541284,"about_ca_system_score_codex":0.00003875459,"about_ca_system_score_gemma":0.000013347622,"threshold_uncertainty_score":0.62326676},"labels":[],"label_agreement":null},{"id":"W2556392400","doi":"10.5555/3192424.3192584","title":"Retweet prediction considering user's difference as an author and retweeter","year":2016,"lang":"en","type":"article","venue":"Advances in Social Networks Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Field (mathematics); Social network (sociolinguistics); Social influence; Social network analysis; Data science; Social media; World Wide Web; Psychology; Mathematics; Social psychology","score_opus":0.013424224160052893,"score_gpt":0.2992125542796387,"score_spread":0.2857883301195858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556392400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8617628,0.00065360253,0.13631797,0.000083138264,0.000040475214,0.00008259577,0.00001002733,0.00005432284,0.0009950699],"genre_scores_gemma":[0.99697125,0.00033516053,0.0018570274,0.00003191701,0.0005688414,0.000026521775,0.000023452574,0.0000147865985,0.00017104295],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998594,0.00012281445,0.0003737419,0.00046918562,0.00013143351,0.00030883958],"domain_scores_gemma":[0.99930096,0.00020230806,0.00019282693,0.00016890689,0.000043538446,0.0000914555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003275844,0.00019272837,0.0004729004,0.00017373194,0.00028101652,0.00008460502,0.00009572004,0.00007350997,0.00009290172],"category_scores_gemma":[0.000009951513,0.00015332406,0.00011183377,0.0005874948,0.00015657253,0.00041656263,0.00010281121,0.00012272275,2.7721163e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012962311,0.000016390257,0.7663454,0.0000020902194,0.00021326709,0.000001281159,0.00035735618,0.00025451416,0.00005309588,0.0045240703,0.000031854932,0.22818771],"study_design_scores_gemma":[0.0016036022,0.00028755036,0.7960328,0.00036152193,0.0027138893,0.0000025363117,0.0032488932,0.121315256,0.00013737427,0.062356386,0.010543619,0.0013965958],"about_ca_topic_score_codex":0.00009868179,"about_ca_topic_score_gemma":0.00028507173,"teacher_disagreement_score":0.22679111,"about_ca_system_score_codex":0.000021810834,"about_ca_system_score_gemma":0.000009367557,"threshold_uncertainty_score":0.62523735},"labels":[],"label_agreement":null},{"id":"W2556403520","doi":"10.1109/allerton.2012.6483386","title":"A theoretical framework for analysis of communication pathways in random networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Gossip; Gossip protocol; Computer science; Computer network; Network packet; Wireless ad hoc network; Throughput; Aggregate (composite); Wireless network; Distributed computing; Function (biology); Wireless sensor network; Wireless; Theoretical computer science; Scalability","score_opus":0.020185194030615666,"score_gpt":0.30341101523688613,"score_spread":0.2832258212062705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556403520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045767393,0.00015609896,0.9467015,0.000040962565,0.000009784004,0.00019643009,0.0000059693652,0.000023294437,0.0070985705],"genre_scores_gemma":[0.9610184,0.000007655752,0.038674217,0.000026785627,0.00007339306,0.00009100263,0.00009488988,0.000007794485,0.000005865757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992068,0.0001062286,0.00031081078,0.00009580782,0.00007084527,0.00020954851],"domain_scores_gemma":[0.9984811,0.00088354334,0.00010895765,0.0004365991,0.00004689102,0.000042929725],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000623116,0.000085968124,0.0003699876,0.00016143595,0.00003476114,0.000011693777,0.00018609969,0.000047436348,0.0012308267],"category_scores_gemma":[0.000015818832,0.00007304517,0.00030171132,0.0007965988,0.00007565519,0.000058763962,0.00006353209,0.000115134346,7.326008e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002879179,0.00012283886,0.124510676,8.2277035e-7,0.00034351792,4.76918e-9,0.00012755049,0.0026734383,0.0000056708664,0.86831814,0.000074951,0.0037936075],"study_design_scores_gemma":[0.0004697525,0.000016449965,0.015959334,0.000021603106,0.0009636436,1.8403835e-8,0.00021850171,0.5516068,0.0002712919,0.43011805,0.00020150458,0.00015308587],"about_ca_topic_score_codex":0.0000719049,"about_ca_topic_score_gemma":0.0000142883755,"teacher_disagreement_score":0.915251,"about_ca_system_score_codex":0.000011458213,"about_ca_system_score_gemma":0.0000071972563,"threshold_uncertainty_score":0.9996822},"labels":[],"label_agreement":null},{"id":"W2558304576","doi":"10.1109/cec.2016.7744350","title":"A study on population adaptation in social networks based on knowledge migration in cultural algorithm","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Population; Computer science; Asset (computer security); Key (lock); Social network (sociolinguistics); Adaptation (eye); Macro; Knowledge transfer; Artificial intelligence; Knowledge management; Computer security; Demography; Sociology; World Wide Web","score_opus":0.0298674821426378,"score_gpt":0.3183659803978244,"score_spread":0.2884984982551866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558304576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81226975,0.000002456348,0.18292165,0.00020121214,0.000042558655,0.00050696946,0.000002646362,0.00006649917,0.0039862553],"genre_scores_gemma":[0.99882144,2.214133e-7,0.00055655994,0.000017889415,0.0003012166,0.00009227204,0.00006893793,0.000009309395,0.00013213945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908066,0.00016857836,0.00025601176,0.00022573829,0.00011805567,0.0001509751],"domain_scores_gemma":[0.9996907,0.000073837946,0.00007396134,0.00010599231,0.000037231017,0.000018281966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019707959,0.00012376912,0.00015956248,0.00018006282,0.000058196416,0.00002693258,0.00006383897,0.00003452674,0.00007789356],"category_scores_gemma":[0.0000023990572,0.000086462336,0.00006083772,0.00036538453,0.000007773128,0.000114310205,0.000012806263,0.00008861003,0.000010529743],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000577995,0.0013798693,0.46573794,7.4510905e-7,0.000017117958,9.412748e-7,0.0009830296,0.010870834,0.000028860302,0.00595354,0.00084419583,0.5141251],"study_design_scores_gemma":[0.00089070067,0.00014270018,0.44091055,0.000033060907,0.0000085377005,1.0278424e-8,0.0004794018,0.5562932,0.000028573117,0.0010163675,0.000059266284,0.00013762306],"about_ca_topic_score_codex":0.0010008091,"about_ca_topic_score_gemma":0.0028936856,"teacher_disagreement_score":0.5454224,"about_ca_system_score_codex":0.00012765682,"about_ca_system_score_gemma":0.0000107226415,"threshold_uncertainty_score":0.35258317},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.041283181832990276,"score_gpt":0.39063885984119473,"score_spread":0.34935567800820444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558664061","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018951023,0.9900738,0.00018335851,0.00014926444,0.0002567498,0.00031532315,0.00018241728,0.000036154266,0.008783968],"genre_scores_gemma":[0.003393337,0.99082947,0.0005112099,0.00007119292,0.0018430593,0.00047923258,0.0013235093,0.000082049184,0.0014669464],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974433,0.000726953,0.00068934803,0.00057196006,0.000027723112,0.00054071925],"domain_scores_gemma":[0.99857587,0.00047925484,0.00035153906,0.00054258213,0.000027971133,0.000022800989],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035948164,0.00043545946,0.0013269865,0.0006887768,0.00007733022,0.000034419172,0.0007142076,0.000113723916,0.001163449],"category_scores_gemma":[0.0000037296463,0.00026519655,0.0006673246,0.0014061532,0.0001427953,0.000043392385,0.00020040109,0.00074622117,0.00008236685],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004853006,0.00014576172,0.00036388275,0.000059369486,0.00026382803,0.0000103581,0.00029250182,0.0000030466513,0.000010172556,0.008843093,0.014544682,0.97545844],"study_design_scores_gemma":[0.00013567775,0.000012305861,0.000006770757,0.0024255814,0.00017536942,0.000025179283,0.00014581475,0.000003000489,6.3306794e-7,0.0019109113,0.9948598,0.00029896482],"about_ca_topic_score_codex":0.00017571451,"about_ca_topic_score_gemma":0.00067848223,"teacher_disagreement_score":0.9803151,"about_ca_system_score_codex":0.0003144881,"about_ca_system_score_gemma":0.000053431544,"threshold_uncertainty_score":0.99998003},"labels":[],"label_agreement":null},{"id":"W2562972626","doi":"10.1109/tsp.2016.2646667","title":"Utility Change Point Detection in Online Social Media: A Revealed Preference Framework","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Maximization; Dimensionality reduction; Ground truth; Change detection; Curse of dimensionality; Marketing buzz; Preference; Social media; Dimension (graph theory); Mathematical optimization; Data mining; Artificial intelligence; Algorithm; Mathematics; Statistics","score_opus":0.06813706542608179,"score_gpt":0.30005100688956776,"score_spread":0.23191394146348598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562972626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12993254,0.000019857127,0.8693127,0.00023597397,0.0000485827,0.0001722044,0.000035648318,0.00011973888,0.00012271995],"genre_scores_gemma":[0.9979814,0.0000044982094,0.0014000504,0.000041034975,0.0004100626,0.00011483686,0.000003289695,0.000021075757,0.000023746186],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987001,0.00010312726,0.00033405423,0.00035879452,0.0002184865,0.00028546283],"domain_scores_gemma":[0.99938184,0.00019299301,0.00013070651,0.00014435223,0.00008984877,0.000060270486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018802549,0.00019050943,0.00026106596,0.00018655659,0.00025183673,0.00003962808,0.00014477267,0.000097774995,0.00054103375],"category_scores_gemma":[0.0000029454634,0.00015325533,0.00013108733,0.00054167875,0.00007735387,0.00031991617,0.0000023942607,0.00039250724,0.0000104596775],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007451532,0.00029751685,0.00047383356,0.000014017157,0.000019245357,0.0000010351387,0.0006538314,0.000010485412,0.0022617665,0.000042664513,0.0000060634043,0.996145],"study_design_scores_gemma":[0.0069373487,0.0007602382,0.097439125,0.00735193,0.00095155387,0.00001196587,0.0037933362,0.09400856,0.40740988,0.3755391,0.0011793497,0.004617621],"about_ca_topic_score_codex":0.00007025232,"about_ca_topic_score_gemma":0.00030830302,"teacher_disagreement_score":0.9915274,"about_ca_system_score_codex":0.00007020617,"about_ca_system_score_gemma":0.000045838322,"threshold_uncertainty_score":0.6249571},"labels":[],"label_agreement":null},{"id":"W25666867","doi":"","title":"Practical investigations of complex systems","year":2007,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Field (mathematics); Domain (mathematical analysis); Data science; Set (abstract data type); Context (archaeology); Complex system; Management science; Artificial intelligence; Engineering; Mathematics; Programming language","score_opus":0.06340422810184546,"score_gpt":0.3605214869018412,"score_spread":0.29711725879999573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25666867","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3953366,0.000054806573,0.002205371,0.0000979712,0.00035371294,0.00069347775,0.000034372755,0.00011110339,0.6011126],"genre_scores_gemma":[0.95088816,0.000011843994,0.0003172374,0.0000012074631,0.0005861644,0.000005361902,0.0005794279,0.000043164655,0.04756741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967852,0.00062915246,0.0004935376,0.00057025196,0.0009085603,0.0006133009],"domain_scores_gemma":[0.99723226,0.0005571986,0.00048248743,0.00074125314,0.00068432256,0.00030248187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071505347,0.000286446,0.0006004612,0.0015533896,0.00052316976,0.000118241674,0.0006222692,0.00022465007,0.00023037277],"category_scores_gemma":[0.00003298994,0.00033965745,0.00033193294,0.0017814715,0.00037681998,0.00020795474,0.0001471054,0.0012478229,0.000023631326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000545939,0.00079157855,0.15093906,0.00052677974,0.0021613806,0.00046496504,0.0006214384,0.00012769045,0.019030293,0.76411146,0.05959326,0.0010861397],"study_design_scores_gemma":[0.0023698392,0.0013792854,0.2108611,0.0017038024,0.0018975317,0.00003741667,0.038342603,0.007905151,0.11616962,0.019773688,0.59622,0.0033399537],"about_ca_topic_score_codex":0.034748163,"about_ca_topic_score_gemma":0.003040409,"teacher_disagreement_score":0.7443378,"about_ca_system_score_codex":0.0003404845,"about_ca_system_score_gemma":0.0011720754,"threshold_uncertainty_score":0.9999055},"labels":[],"label_agreement":null},{"id":"W2567966427","doi":"10.17266/35.2.1","title":"Identifying Fragments in Networks for Structural Balance and Tracking the Levels of Balance Over Time","year":2016,"lang":"en","type":"article","venue":"Connections","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Balance (ability); Tracking (education); Computer science; Psychology; Neuroscience","score_opus":0.022769598149591293,"score_gpt":0.2963136653072165,"score_spread":0.2735440671576252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567966427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7743562,0.00012220745,0.22478354,0.00016391503,0.000073764946,0.00021636732,0.000040408664,0.00002217081,0.00022144224],"genre_scores_gemma":[0.9991238,0.000003907024,0.00051476166,0.000013133658,0.00013683847,0.000035473386,0.0000030460699,0.000007253695,0.00016178965],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99950296,0.000025221405,0.00016064475,0.00013379696,0.000044993754,0.00013240747],"domain_scores_gemma":[0.99942243,0.0002525934,0.00008784141,0.00018634548,0.000034772373,0.000015987449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110403205,0.00006949926,0.0001288647,0.000034411954,0.000109604705,0.000023298711,0.00011675501,0.000017668275,0.00019197691],"category_scores_gemma":[0.0000128023585,0.00004554277,0.000056493096,0.00012606622,0.00004416693,0.00010464763,0.00004981175,0.000051432424,7.57494e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020123327,0.000035296598,0.869959,0.000012356286,0.00019563275,2.3307837e-7,0.00028905252,0.0008508935,0.015667448,0.03386437,0.0023327358,0.07677288],"study_design_scores_gemma":[0.0012225336,0.000035958998,0.75531715,0.00027288016,0.00008063135,0.0000013500191,0.00010129071,0.13582717,0.0030406376,0.10243495,0.0013614503,0.00030401585],"about_ca_topic_score_codex":0.00004259984,"about_ca_topic_score_gemma":0.00002361285,"teacher_disagreement_score":0.22476761,"about_ca_system_score_codex":0.000014520093,"about_ca_system_score_gemma":0.000006946216,"threshold_uncertainty_score":0.21020126},"labels":[],"label_agreement":null},{"id":"W2569164302","doi":"10.1103/physreve.95.062304","title":"Finite-size analysis of the detectability limit of the stochastic block model","year":2017,"lang":"en","type":"article","venue":"Physical review. E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut Universitaire en Santé Mentale de Québec; Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; James S. McDonnell Foundation; National Science Foundation","keywords":"Stochastic block model; Limit (mathematics); Mathematics; Mathematical proof; Random matrix; Partition (number theory); Equivalence (formal languages); Connection (principal bundle); Block (permutation group theory); Central limit theorem; Applied mathematics; Matrix (chemical analysis); Algorithm; Discrete mathematics; Computer science; Combinatorics; Statistics; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.024848193904696857,"score_gpt":0.33536385402822366,"score_spread":0.3105156601235268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569164302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97996867,0.00048491097,0.015422969,0.00067487085,0.000033793614,0.0006686332,0.00008394378,0.000019248284,0.0026429854],"genre_scores_gemma":[0.99965197,0.000026528247,0.00011210916,0.00004791318,0.0000668317,0.000037186714,0.0000015698522,0.000009008279,0.000046897287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987892,0.00012375158,0.0003846325,0.00023721991,0.00030315033,0.00016204474],"domain_scores_gemma":[0.99646306,0.0004569144,0.0006926423,0.0022034422,0.0001452078,0.000038743587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025678705,0.00015828352,0.0007441639,0.000018875182,0.00019998569,0.000017506572,0.0011691153,0.000015014336,0.000055566466],"category_scores_gemma":[0.00032346175,0.00008639269,0.0014462251,0.0004931045,0.00025312527,0.000049570524,0.0005153546,0.00018874595,0.0000021432072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007583573,0.0047649094,0.30204517,0.001595677,0.013028449,2.6161754e-7,0.0010149525,0.4036756,0.02597284,0.13868743,0.0026984962,0.1064404],"study_design_scores_gemma":[0.0001236693,0.000021299778,0.060588825,0.00048191636,0.0068930136,2.7202162e-8,0.0000062691033,0.858192,0.005214721,0.0681355,0.00012869362,0.00021401663],"about_ca_topic_score_codex":0.0001325391,"about_ca_topic_score_gemma":0.00003006826,"teacher_disagreement_score":0.45451647,"about_ca_system_score_codex":0.000014539412,"about_ca_system_score_gemma":0.0000430688,"threshold_uncertainty_score":0.35229918},"labels":[],"label_agreement":null},{"id":"W2571153042","doi":"10.1109/besc.2016.7804474","title":"Activity-based sampling of Twitter users for temporal prediction models","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Timeline; Sampling (signal processing); Predictability; Social media; Experience sampling method; Focus (optics); Data mining; Sample (material); Data modeling; Data science; Machine learning; World Wide Web; Statistics; Database","score_opus":0.06308703675090531,"score_gpt":0.3042007388990658,"score_spread":0.24111370214816047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571153042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20705277,8.421158e-7,0.791546,0.0001290875,0.0000143496145,0.00013797832,0.000028409595,0.00004963187,0.0010409269],"genre_scores_gemma":[0.9742288,1.3598465e-7,0.0253112,0.000017533104,0.000108893575,0.00005028443,0.000014440774,0.0000107088445,0.00025802775],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951094,0.000012987318,0.00013983651,0.00014246468,0.00007490166,0.00011883761],"domain_scores_gemma":[0.999559,0.00009281536,0.0000836931,0.00017820677,0.00006015421,0.000026117566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010154311,0.000076543,0.00013712115,0.0000557085,0.000032473585,0.000008384264,0.00007093474,0.000019204888,0.00016210857],"category_scores_gemma":[0.0000011305564,0.00005165933,0.00013957416,0.00006501609,0.000021528545,0.00012279993,0.000016832015,0.000023696452,0.0000010463169],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041412454,0.0007419476,0.5207066,0.00006313079,0.00065065396,1.1334582e-7,0.00014703217,0.011796643,0.15694489,0.07737921,0.019570487,0.21158518],"study_design_scores_gemma":[0.0023400139,0.0002835693,0.0040485766,0.00016716105,0.00020137902,8.077688e-8,0.00006546914,0.4942633,0.29687896,0.19352439,0.007722681,0.0005044455],"about_ca_topic_score_codex":0.00012458686,"about_ca_topic_score_gemma":0.000004691974,"teacher_disagreement_score":0.76717603,"about_ca_system_score_codex":0.000015556145,"about_ca_system_score_gemma":0.000021702532,"threshold_uncertainty_score":0.21066065},"labels":[],"label_agreement":null},{"id":"W2572152291","doi":"10.14778/3021924.3021930","title":"Efficient computation of feedback arc set at web-scale","year":2016,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; Feedback arc set; Set (abstract data type); Randomized algorithm; Greedy algorithm; Theoretical computer science; Probabilistic logic; Algorithm; Graph; Artificial intelligence","score_opus":0.01020956528438349,"score_gpt":0.23808216134682195,"score_spread":0.22787259606243845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572152291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99084955,0.000020733585,0.0008916839,0.0004887902,0.00004138934,0.00028335667,0.000022137754,0.000028758077,0.007373577],"genre_scores_gemma":[0.9985845,0.000002334486,0.00094639533,0.000010018593,0.00006235813,0.000026283036,0.0000016186623,0.000010868642,0.000355637],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990632,0.0000066289103,0.0003086739,0.00018097233,0.00027231246,0.00016821531],"domain_scores_gemma":[0.99929297,0.000028203713,0.0003669871,0.000106192805,0.00016907028,0.00003654674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017738031,0.000118614174,0.00021351298,0.000054585893,0.00006180518,0.000009267527,0.00026241108,0.000017536042,0.00010393607],"category_scores_gemma":[0.0000041114845,0.00006813695,0.00017981017,0.00019383272,0.00007662822,0.000027230755,0.00029548683,0.00004165491,0.000009118343],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008191881,0.0004271388,0.17870066,0.000088977285,0.0002546486,4.1099828e-8,0.0007813481,0.0006028238,0.76619935,0.015514538,0.016333425,0.021015132],"study_design_scores_gemma":[0.0010540284,0.00010146275,0.01217468,0.00037845905,0.00014237723,9.439622e-7,0.0003003916,0.0062639075,0.96433413,0.013279682,0.0017353556,0.00023456984],"about_ca_topic_score_codex":0.000039518072,"about_ca_topic_score_gemma":0.0000018742925,"teacher_disagreement_score":0.19813478,"about_ca_system_score_codex":0.000068660265,"about_ca_system_score_gemma":0.000012400784,"threshold_uncertainty_score":0.2778544},"labels":[],"label_agreement":null},{"id":"W2574403267","doi":"10.1609/icwsm.v10i1.14706","title":"SentiWorld: Understanding Emotions between Countries Based on Tweets","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International AAAI Conference on Web and Social Media","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Korea Agency for Infrastructure Technology Advancement; Korea Institute of Oriental Medicine; Ministry of Land, Infrastructure and Transport","keywords":"Sentiment analysis; Order (exchange); Computer science; Data science; Artificial intelligence; Business","score_opus":0.0524719208039344,"score_gpt":0.2833723855548204,"score_spread":0.23090046475088602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574403267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8813418,0.0000056474355,0.00066565693,0.016776934,0.00029160167,0.000121440426,0.00015365882,0.000045959117,0.10059728],"genre_scores_gemma":[0.99902385,0.000005065037,0.00010418399,0.00013684249,0.0004644308,0.00000766395,0.000025194522,0.000007425048,0.00022532255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914974,0.000009223236,0.0001787693,0.00017336964,0.00037562373,0.00011326191],"domain_scores_gemma":[0.99930173,0.00016742872,0.00015663273,0.000044119664,0.00029981253,0.000030288224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012793654,0.000105883366,0.00017302905,0.00007711853,0.00018634684,0.00012128653,0.00022988873,0.000032034164,0.00034352002],"category_scores_gemma":[0.000032431406,0.00008816813,0.0001046951,0.0001324196,0.00011538806,0.00006833064,0.000088108725,0.00015530118,0.000002608468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013015835,0.00005687978,0.07698217,0.000009645867,0.000105899926,1.7001825e-7,0.000533575,0.0000019534687,0.0008059136,0.918267,0.0019910017,0.0012327709],"study_design_scores_gemma":[0.0017767014,0.00008926288,0.08534578,0.000961571,0.00035756116,8.476706e-7,0.009889118,0.011528807,0.025327768,0.8507254,0.013221721,0.0007754541],"about_ca_topic_score_codex":0.000007493631,"about_ca_topic_score_gemma":0.00001151704,"teacher_disagreement_score":0.11768205,"about_ca_system_score_codex":0.000056594683,"about_ca_system_score_gemma":0.00008542351,"threshold_uncertainty_score":0.37613034},"labels":[],"label_agreement":null},{"id":"W2577490605","doi":"10.1109/wi.2016.0088","title":"Tracking User Activities and Marketplace Dynamics in Classified Ads","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Dynamics (music); Probabilistic logic; Tracking (education); Generative model; User modeling; Generative grammar; Human–computer interaction; Association (psychology); Artificial intelligence; World Wide Web; User interface; Psychology","score_opus":0.009812224560357546,"score_gpt":0.24435099599602517,"score_spread":0.23453877143566762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577490605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8715478,0.000011373785,0.06990447,0.0003541299,0.000019220828,0.00008317172,0.0000057637176,0.00006853015,0.05800551],"genre_scores_gemma":[0.9932545,0.0000054142074,0.0009968401,0.000016464026,0.000051288367,0.000012246165,0.0000027949625,0.000010074777,0.0056503983],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99947053,0.000036253838,0.00012142975,0.00015687777,0.00005974234,0.0001551836],"domain_scores_gemma":[0.9996366,0.0001497721,0.00003645678,0.00013758482,0.000010935809,0.000028641522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012250198,0.00009021625,0.00013678015,0.00007217669,0.000033018303,0.000032979326,0.00006878627,0.000022566966,0.0005560593],"category_scores_gemma":[0.0000021437727,0.00006228814,0.000038516453,0.000093138944,0.000057340436,0.00016475296,0.000055469667,0.000057923793,0.00000259725],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001713341,0.000036772853,0.6962952,0.0000025670822,0.00003120071,6.2629283e-7,0.000040804767,0.0000011360673,0.00065052934,0.12387481,0.0013209368,0.17772825],"study_design_scores_gemma":[0.0045649055,0.00018430492,0.66892123,0.0006224181,0.0001824646,0.000004824999,0.008617599,0.085970886,0.021825168,0.16353321,0.042976122,0.0025968896],"about_ca_topic_score_codex":0.00013838775,"about_ca_topic_score_gemma":0.0005065427,"teacher_disagreement_score":0.17513137,"about_ca_system_score_codex":0.000052318075,"about_ca_system_score_gemma":0.000010452157,"threshold_uncertainty_score":0.60884595},"labels":[],"label_agreement":null},{"id":"W2580254181","doi":"10.5267/j.dsl.2017.1.002","title":"Extracting new ideas from the behavior of social network users","year":2017,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Social network (sociolinguistics); Sociology; Data science; Psychology; Social media; World Wide Web","score_opus":0.036120418537487105,"score_gpt":0.349447225041391,"score_spread":0.3133268065039039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2580254181","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9413297,0.000008249275,0.05591445,0.0017685745,0.00021339493,0.00012701885,0.0000042740476,0.000017110264,0.0006172213],"genre_scores_gemma":[0.98922366,3.8151194e-7,0.009429142,0.00038983295,0.0009163556,0.0000093403805,0.0000020795994,0.0000071531877,0.000022040256],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985394,0.000026548276,0.00026833802,0.00030402577,0.00057756447,0.00028412],"domain_scores_gemma":[0.998359,0.0003263522,0.00043058948,0.0007647518,0.000053000447,0.00006630692],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007687982,0.000105078216,0.00017859093,0.000040152492,0.001463619,0.00043619936,0.0016897446,0.000017764321,0.00024976392],"category_scores_gemma":[0.000058402817,0.00007591506,0.00015539299,0.00026748265,0.0004906054,0.00042072294,0.00034923648,0.00015662053,0.00001500355],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012700382,0.000024552897,0.5136867,1.6675227e-7,0.000019313342,0.0000020092857,0.0003606295,0.00020705724,0.01976395,0.0036560777,0.053455696,0.40881115],"study_design_scores_gemma":[0.00024612385,0.000008603495,0.9671416,0.000039069175,0.00007610692,3.0216415e-7,0.00019596449,0.00091125665,0.0022707533,0.018248886,0.010646663,0.00021462502],"about_ca_topic_score_codex":0.0013764922,"about_ca_topic_score_gemma":0.000030805164,"teacher_disagreement_score":0.45345494,"about_ca_system_score_codex":0.000021020443,"about_ca_system_score_gemma":0.000055081575,"threshold_uncertainty_score":0.9998363},"labels":[],"label_agreement":null},{"id":"W2583455222","doi":"10.1007/s13278-017-0421-x","title":"Selecting transfer entropy thresholds for influence network prediction","year":2017,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Transfer entropy; Computer science; Entropy (arrow of time); Data mining; Machine learning; Principle of maximum entropy; Artificial intelligence","score_opus":0.013893219938584486,"score_gpt":0.2821688679491887,"score_spread":0.2682756480106042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583455222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7349281,0.0001558809,0.26248044,0.0001261114,0.0000955396,0.0002556948,0.00002131865,0.000090649,0.0018462995],"genre_scores_gemma":[0.99070823,0.000020059724,0.00452384,0.000051081282,0.0043446505,0.00008545807,0.00009070142,0.000025094885,0.00015088062],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99830526,0.000062617575,0.00041644307,0.0004511804,0.00017319969,0.00059132633],"domain_scores_gemma":[0.9990792,0.00012591197,0.00025825077,0.00031118467,0.00013671459,0.000088711975],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006682685,0.00023678316,0.0005906697,0.000079779355,0.003384476,0.00041896157,0.00026951337,0.000090481626,0.00006657643],"category_scores_gemma":[0.000011315451,0.0002423107,0.0005322724,0.0005070269,0.00011427273,0.0002362901,0.00009274064,0.0001709828,6.2762143e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030198105,0.000021940463,0.9364586,0.0000059470144,0.002326704,3.9944985e-7,0.0004937563,0.015540139,0.000050863877,0.015655467,0.0020135902,0.027402429],"study_design_scores_gemma":[0.0017528913,0.00019771632,0.6598727,0.00014120528,0.013803305,8.844474e-7,0.0008791271,0.25304046,0.0001301464,0.052258074,0.016532987,0.0013904646],"about_ca_topic_score_codex":0.00023524412,"about_ca_topic_score_gemma":0.00028537062,"teacher_disagreement_score":0.27658585,"about_ca_system_score_codex":0.000022742592,"about_ca_system_score_gemma":0.000026350583,"threshold_uncertainty_score":0.997913},"labels":[],"label_agreement":null},{"id":"W2584357054","doi":"","title":"A geometric model for on-line social networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Dimension (graph theory); Theoretical computer science; Euclidean space; Ranking (information retrieval); Property (philosophy); Line (geometry); Function (biology); Space (punctuation); Euclidean geometry; Euclidean distance; Parameter space; Geometric networks; Power (physics); Link (geometry); Topology (electrical circuits); Artificial intelligence; Complex network; Mathematics; Computer network; Combinatorics; Statistics","score_opus":0.031960517054244506,"score_gpt":0.31154741955628285,"score_spread":0.2795869025020383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584357054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015710931,0.000002273646,0.9697994,0.00016811953,0.000049638988,0.00016551593,0.000008935861,0.00009388905,0.014001294],"genre_scores_gemma":[0.9827403,2.6414813e-7,0.0133152865,0.00013170937,0.0013014874,0.000078842815,0.00004626379,0.000016815784,0.0023690364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937373,0.000005403945,0.00014511183,0.00017667154,0.00007970488,0.00021934882],"domain_scores_gemma":[0.9995955,0.00007488272,0.00005321149,0.00017072774,0.00006326533,0.00004236508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012853876,0.000106063875,0.00015923465,0.00011222527,0.00013884266,0.00003637522,0.00015384909,0.000041493633,0.00046133326],"category_scores_gemma":[0.000003177696,0.000092574395,0.00018947457,0.0003260814,0.000020213367,0.00003361938,0.000040108822,0.00018597039,0.000008181059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033021945,0.00033092074,0.0024562061,0.0000025459042,0.00014330914,1.1213069e-7,0.00003929675,0.105723545,0.00017976647,0.560766,0.11593849,0.21438682],"study_design_scores_gemma":[0.00017482525,0.00002347172,0.0000809944,7.5816996e-7,0.000024200725,2.8778988e-8,0.0000044089948,0.9708018,0.00018273461,0.025415728,0.003177845,0.00011325714],"about_ca_topic_score_codex":0.000026625563,"about_ca_topic_score_gemma":0.000021101596,"teacher_disagreement_score":0.96702933,"about_ca_system_score_codex":0.000005916742,"about_ca_system_score_gemma":0.000015023575,"threshold_uncertainty_score":0.50512755},"labels":[],"label_agreement":null},{"id":"W2585627908","doi":"10.1109/glocom.2016.7842176","title":"Profiling Online Social Network Users via Relationships and Network Characteristics","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Social network (sociolinguistics); Inference; Computer science; Profiling (computer programming); Demographics; Naive Bayes classifier; Decision tree; Logistic regression; Social network analysis; Data mining; Machine learning; Social media; Data science; Artificial intelligence; World Wide Web; Support vector machine","score_opus":0.024248462965775878,"score_gpt":0.2651761828376427,"score_spread":0.24092771987186684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585627908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43827018,0.00004375977,0.55571514,0.0010134309,0.00013651651,0.0002975129,0.000026090722,0.00028733342,0.0042100498],"genre_scores_gemma":[0.9770599,0.0000061822507,0.018703505,0.000060405335,0.0033867045,0.000015120133,0.00008549971,0.00002214868,0.0006605569],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998948,0.00009072338,0.00029646073,0.00023404014,0.00009990855,0.0003308857],"domain_scores_gemma":[0.999384,0.0001814872,0.00013954283,0.00016715072,0.000059165202,0.000068649664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026491104,0.00015190933,0.00024289996,0.000026533062,0.00036542135,0.00004071511,0.00010272785,0.000050807786,0.00028291208],"category_scores_gemma":[0.000005825921,0.00011148096,0.00008227229,0.0002092582,0.00006305824,0.00010243099,0.00010139617,0.0001584356,0.000014035265],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011162107,0.000034417306,0.858944,0.0000019451254,0.000092048205,4.1521946e-7,0.00002529845,0.000026905242,0.00011939975,0.080933854,0.0068478356,0.052962705],"study_design_scores_gemma":[0.0010024124,0.000085348765,0.67519635,0.00016239786,0.00037575283,0.0000021811686,0.0001633568,0.01845071,0.00017085596,0.2629877,0.040152937,0.0012499943],"about_ca_topic_score_codex":0.000016887763,"about_ca_topic_score_gemma":0.000024934063,"teacher_disagreement_score":0.5387897,"about_ca_system_score_codex":0.000019641675,"about_ca_system_score_gemma":0.000017904975,"threshold_uncertainty_score":0.45460615},"labels":[],"label_agreement":null},{"id":"W2585879149","doi":"10.1016/j.jclepro.2017.01.175","title":"Social network analysis reveals that communication gaps may prevent effective water management in the mining sector","year":2017,"lang":"en","type":"article","venue":"Journal of Cleaner Production","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Business; Sustainability; Social network analysis; Production (economics); Work (physics); Knowledge management; Public relations; Environmental resource management; Environmental planning; Environmental economics; Social media; Computer science; Engineering; Economics","score_opus":0.023635581727802224,"score_gpt":0.31323839949766463,"score_spread":0.2896028177698624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585879149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99134195,0.00007743603,0.0016446592,0.0031106041,0.00012496073,0.00038579915,5.2580725e-7,0.000008599186,0.0033054606],"genre_scores_gemma":[0.99729544,0.0000216476,0.0008237308,0.000022903745,0.0014884319,0.000027111892,0.000010681376,0.000009460905,0.00030061087],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985341,0.00048453963,0.00037575106,0.00015182393,0.00027275775,0.0001810428],"domain_scores_gemma":[0.9985447,0.000039265575,0.00074248156,0.0005529428,0.000101573714,0.000019056026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024688193,0.00011506566,0.00029943587,0.0001602932,0.00050887285,0.00016433327,0.0004968892,0.000026121184,0.00005427382],"category_scores_gemma":[0.0000067376873,0.00007230208,0.00028648291,0.00016710022,0.000052596806,0.00029061886,0.00010871933,0.00025979304,0.0000017942117],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040926953,0.0010474161,0.58856875,0.00007080621,0.009484204,0.000016201977,0.0144995,0.040430836,0.0007584062,0.004216787,0.062369056,0.27812877],"study_design_scores_gemma":[0.0008314146,0.00014693673,0.91058826,0.00022985571,0.0044976217,0.000012093311,0.0034013514,0.000758389,0.006101024,0.051801734,0.021168377,0.00046293106],"about_ca_topic_score_codex":0.000034955996,"about_ca_topic_score_gemma":0.00004812644,"teacher_disagreement_score":0.32201952,"about_ca_system_score_codex":0.000061689665,"about_ca_system_score_gemma":0.000004668456,"threshold_uncertainty_score":0.391389},"labels":[],"label_agreement":null},{"id":"W2585884258","doi":"10.1109/bigdata.2016.7840994","title":"On the hyperbolicity of large-scale networks and its estimation","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"High Energy Physics; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; National Institute of Standards and Technology","keywords":"Computer science; Computation; Scale (ratio); Range (aeronautics); Complex network; Contrast (vision); Degree (music); Theoretical computer science; Telecommunications network; Algorithm; Artificial intelligence; Geography; Telecommunications; Engineering","score_opus":0.008602939373320814,"score_gpt":0.24729722882700544,"score_spread":0.23869428945368462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585884258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6061974,0.000014538028,0.383565,0.00046688807,0.000008399793,0.00008651775,0.0000038378876,0.00002538495,0.0096320035],"genre_scores_gemma":[0.9991689,0.0000030020342,0.00040305295,0.000053823904,0.000051345665,0.000008391053,0.000001647905,0.000004036372,0.000305804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996499,0.000025942258,0.000096065174,0.00008375426,0.00005614444,0.000088222456],"domain_scores_gemma":[0.9996178,0.00015491234,0.000047485915,0.00013583442,0.000025927122,0.000018016934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012635761,0.000054026612,0.000087821405,0.000015363858,0.000045697136,0.0000072415405,0.000065386914,0.000012494319,0.00058427936],"category_scores_gemma":[0.0000036008082,0.00002559127,0.00003722781,0.00006766856,0.000016703865,0.00003472692,0.000040249306,0.00003168801,0.0000058720466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088742145,0.00008536052,0.0122498,0.0000016691146,0.000048429047,3.661851e-8,0.00004664589,0.0005717778,0.00093563675,0.93185604,0.005700405,0.04849531],"study_design_scores_gemma":[0.00045668488,0.000083338244,0.017851287,0.000087238666,0.000065181506,2.3086002e-7,0.000062610925,0.8279135,0.02784195,0.12373662,0.0016611257,0.00024020372],"about_ca_topic_score_codex":0.000019425726,"about_ca_topic_score_gemma":0.0000066001685,"teacher_disagreement_score":0.82734174,"about_ca_system_score_codex":0.0000033674428,"about_ca_system_score_gemma":0.0000029287844,"threshold_uncertainty_score":0.63974494},"labels":[],"label_agreement":null},{"id":"W2587315101","doi":"10.5539/cis.v10n1p54","title":"Complex Network Analysis of the Contiguous United States Graph","year":2017,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Experimental Program to Stimulate Competitive Research; National Aeronautics and Space Administration","keywords":"Betweenness centrality; Centrality; Computer science; Clustering coefficient; Assortativity; Normalization (sociology); Graph; Complex network; Theoretical computer science; Data mining; Cluster analysis; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.015742405991313168,"score_gpt":0.27323892611583606,"score_spread":0.2574965201245229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587315101","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50481915,0.0000057382294,0.48862678,0.00021204674,0.00010798729,0.00012961552,0.000019807372,0.000025723135,0.0060531446],"genre_scores_gemma":[0.9976221,0.000005126277,0.002082465,0.0002105731,0.000035796904,0.0000020714167,0.000034958513,9.4579e-7,0.000005975608],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993335,0.000015790827,0.00023427783,0.00008286491,0.00019783835,0.00013573731],"domain_scores_gemma":[0.99888885,0.000027756894,0.0003412391,0.00047483965,0.00022726467,0.000040037525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003517397,0.000065704095,0.00015553574,0.0002511063,0.0007842208,0.00037540373,0.00063253625,0.000008357359,0.000031964217],"category_scores_gemma":[0.000004081531,0.000044819208,0.00008621005,0.0012485523,0.00054058566,0.0013224324,0.0003486487,0.00004719174,0.0000011141362],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065675927,0.000028165363,0.61722946,0.000008068104,0.00042249952,4.7733298e-8,0.0015609819,0.08388407,0.000035209967,0.18184015,0.0062170886,0.10876768],"study_design_scores_gemma":[0.00005745576,0.0000067315655,0.4583146,0.0000056496638,0.000059125232,6.851829e-8,0.000024823694,0.53439283,0.00003941081,0.0015891091,0.0054630726,0.00004710302],"about_ca_topic_score_codex":0.00023820486,"about_ca_topic_score_gemma":0.000005265393,"teacher_disagreement_score":0.49280295,"about_ca_system_score_codex":0.0000053619065,"about_ca_system_score_gemma":0.000019360112,"threshold_uncertainty_score":0.6031672},"labels":[],"label_agreement":null},{"id":"W2594050085","doi":"10.1103/physreve.95.032304","title":"Effect of node attributes on the temporal dynamics of network structure","year":2017,"lang":"en","type":"article","venue":"Physical review. E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Node (physics); Hierarchy; Focus (optics); Degree distribution; Preferential attachment; Hierarchical network model; Position (finance); Theoretical computer science; Dynamic network analysis; Degree (music); Monte Carlo method; Quality (philosophy); Evolving networks; Complex network; Statistical physics; Topology (electrical circuits); Interdependent networks; Mathematics; Computer network; Physics","score_opus":0.01252869155506323,"score_gpt":0.335688123585754,"score_spread":0.32315943203069075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594050085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9883289,0.0011450406,0.002126703,0.0015555086,0.00007666928,0.0008914205,0.00016013253,0.00003246579,0.0056831655],"genre_scores_gemma":[0.99927795,0.00007171033,0.00009379307,0.0000408094,0.00040658758,0.0000187588,0.000060827628,0.000012740351,0.000016832979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904495,0.00016832196,0.00025006925,0.00016839363,0.0001961955,0.00017204229],"domain_scores_gemma":[0.9979768,0.0004379422,0.00052368676,0.0009669096,0.00006100654,0.000033676617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003164694,0.00017169325,0.0006623189,0.000009561438,0.00014055055,0.000019545238,0.00058834977,0.000015407924,0.00010814809],"category_scores_gemma":[0.000055056757,0.00009758064,0.0004057558,0.000106490166,0.00013286869,0.000043100306,0.00016115596,0.00019129044,0.000005203341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070107286,0.0002635147,0.27001163,0.001011893,0.0005942393,7.547385e-7,0.000026655192,0.00044761857,0.00080748,0.5334741,0.02834393,0.16494808],"study_design_scores_gemma":[0.0013982262,0.0022406806,0.050054286,0.013250044,0.0032564201,8.198146e-7,0.000013486224,0.111433506,0.07560063,0.7205364,0.020593332,0.0016221494],"about_ca_topic_score_codex":0.00008248676,"about_ca_topic_score_gemma":0.000007841011,"teacher_disagreement_score":0.21995734,"about_ca_system_score_codex":0.000011811639,"about_ca_system_score_gemma":0.000011678747,"threshold_uncertainty_score":0.3979223},"labels":[],"label_agreement":null},{"id":"W2594286179","doi":"","title":"Loops and Multiple Edges in Modularity Maximization of Networks","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Maximization; Null model; Mathematics; Null (SQL); Modularity (biology); Random graph; Combinatorics; Clique; Discrete mathematics; Computer science; Mathematical optimization; Graph; Data mining","score_opus":0.005553992580215262,"score_gpt":0.2040848397628506,"score_spread":0.19853084718263533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594286179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74241966,0.00018301349,0.25633433,0.00011968373,0.000015519186,0.00010568817,0.0000027106416,0.000029533989,0.00078983273],"genre_scores_gemma":[0.9937032,0.000025749056,0.00604342,0.00003761734,0.0001044508,0.000002984839,0.000032873682,0.0000062755503,0.00004343977],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994102,0.00004337805,0.000188412,0.00015785277,0.00006421451,0.00013594369],"domain_scores_gemma":[0.99966055,0.000042738677,0.00007996883,0.00015302424,0.000031300155,0.000032421834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001076275,0.00009667719,0.00019347423,0.00007700331,0.00005639938,0.000018628463,0.000079516176,0.00005372312,0.000022550134],"category_scores_gemma":[0.0000058567034,0.00009966306,0.000051885534,0.0002088179,0.00006477863,0.00006891143,0.000018657589,0.00014816955,2.7722757e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027126347,0.00018299835,0.69479245,0.0000068540317,0.000042218853,0.000001922685,0.0004960657,0.012210926,0.00042389685,0.08374076,0.00049581047,0.20757896],"study_design_scores_gemma":[0.00106452,0.00009294718,0.39790317,0.000049053036,0.000060659408,0.000001191084,0.00019811351,0.4464314,0.0024611836,0.1503966,0.0009223136,0.00041885828],"about_ca_topic_score_codex":0.00021732715,"about_ca_topic_score_gemma":0.000026770515,"teacher_disagreement_score":0.43422046,"about_ca_system_score_codex":0.00001882988,"about_ca_system_score_gemma":0.000005886272,"threshold_uncertainty_score":0.40641418},"labels":[],"label_agreement":null},{"id":"W2597498920","doi":"10.18438/b8md0g","title":"Personal Publications Lists Serve as a Reliable Calibration Parameter to Compare Coverage in Academic Citation Databases with Scientific Social Media","year":2017,"lang":"en","type":"article","venue":"Evidence Based Library and Information Practice","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Citation; Social media; Scopus; Computer science; Web of science; Library science; Information retrieval; World Wide Web; Citation database; MEDLINE; Political science","score_opus":0.052844222008334385,"score_gpt":0.33205976903614054,"score_spread":0.27921554702780615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597498920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.799951,0.00010640433,0.0850863,0.10581012,0.00016576034,0.0012737362,0.00027561618,0.00025188123,0.0070791375],"genre_scores_gemma":[0.9899514,0.000015315554,0.0054900767,0.0031201865,0.000104144696,0.00010747225,0.0011080288,0.0000069743187,0.0000964269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99887854,0.00011398247,0.0003354839,0.00020487845,0.0003059451,0.00016114663],"domain_scores_gemma":[0.99806947,0.00092782255,0.0004990816,0.00029694638,0.000112102905,0.000094573246],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0004950982,0.000120988094,0.00013528996,0.00027088134,0.0007256129,0.0018043123,0.00026113214,0.000025301297,0.00035465922],"category_scores_gemma":[0.0006415204,0.0001143067,0.000028147882,0.00047273646,0.00009000232,0.16215138,0.000118564996,0.00025160518,0.00002405928],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010509829,0.0002033456,0.27318117,0.00012313656,0.0000700486,0.0000022845395,0.006025738,0.0013058439,0.00014399145,0.64742005,0.044924956,0.025548458],"study_design_scores_gemma":[0.0012960335,0.00013146123,0.4450575,0.0010210065,0.00015759654,0.000005870821,0.0032987103,0.150042,0.0024930194,0.003927259,0.3917153,0.000854271],"about_ca_topic_score_codex":0.00011794385,"about_ca_topic_score_gemma":0.0000046451287,"teacher_disagreement_score":0.64349276,"about_ca_system_score_codex":0.000015201866,"about_ca_system_score_gemma":0.00024332655,"threshold_uncertainty_score":0.99923193},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.037351629084526994,"score_gpt":0.3061093531635858,"score_spread":0.2687577240790588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598116636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949864,0.000012075735,0.004297962,0.00009840151,0.000047030175,0.00008626128,0.000039660074,0.000014413045,0.00041777777],"genre_scores_gemma":[0.9986284,7.9903657e-7,0.00084813195,0.0000020428042,0.0003811916,0.000035319477,0.000025052586,0.000010084601,0.00006898269],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993476,0.000055395238,0.00021756344,0.00015381315,0.00009827875,0.00012731481],"domain_scores_gemma":[0.99890774,0.00018789625,0.00045638747,0.00029535918,0.00013464503,0.000017988388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020249566,0.00009689577,0.00021046742,0.000044256994,0.0004110967,0.00007286386,0.0002586411,0.000026355126,0.000040941082],"category_scores_gemma":[0.000010052191,0.00008050498,0.00013592922,0.000042441316,0.00012212536,0.00032146284,0.0000132998175,0.00005527829,5.1793984e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010568389,0.00025567008,0.017268876,0.00008613819,0.0003695618,3.1451756e-7,0.026312266,0.00001730881,0.101392694,0.010396297,0.00026519265,0.84353],"study_design_scores_gemma":[0.0021200129,0.0005448141,0.68109107,0.000183458,0.00036582822,0.0000010497932,0.012687458,0.00272459,0.2639775,0.034596946,0.001079805,0.00062746217],"about_ca_topic_score_codex":0.0002713936,"about_ca_topic_score_gemma":0.00045231785,"teacher_disagreement_score":0.84290254,"about_ca_system_score_codex":0.00001695687,"about_ca_system_score_gemma":0.000012047375,"threshold_uncertainty_score":0.32828978},"labels":[],"label_agreement":null},{"id":"W2598170113","doi":"10.1109/icsc.2017.80","title":"Querying Intimate-Core Groups in Weighted Graphs","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Core (optical fiber); Set (abstract data type); Theoretical computer science; Enhanced Data Rates for GSM Evolution; Node (physics); Graph; Heuristic; Artificial intelligence","score_opus":0.02228931397122379,"score_gpt":0.29406963604696923,"score_spread":0.27178032207574543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598170113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8483198,0.000011226663,0.008560698,0.00011609371,0.000054512937,0.00011790195,0.0000019688564,0.00010058279,0.14271721],"genre_scores_gemma":[0.99564284,0.0000021715712,0.0037509254,0.000022329601,0.00008297273,0.000022797261,0.000015195401,0.000011613166,0.0004491803],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993065,0.000013482464,0.00018745071,0.00020046518,0.00008311213,0.00020896443],"domain_scores_gemma":[0.99922746,0.0000182582,0.000112636546,0.0005763056,0.000026319598,0.000039000955],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001333267,0.00011429042,0.00019210475,0.00010264145,0.00020774666,0.00013250625,0.00036732023,0.000023892177,0.0010205265],"category_scores_gemma":[0.0000024988137,0.00010085673,0.00010743104,0.00009322187,0.000046365134,0.00018415552,0.00016465051,0.0001244362,0.000033195134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032346788,0.000047120775,0.6772024,0.0000020210434,0.000029091061,0.0000019216511,0.00004386472,0.0000021915648,0.000256259,0.30043456,0.0017499358,0.020227423],"study_design_scores_gemma":[0.0005653376,0.000022912653,0.23364663,0.00007070193,0.000037164704,4.566082e-7,0.00014590673,0.022734707,0.0034502968,0.7355246,0.0033204197,0.0004808832],"about_ca_topic_score_codex":0.00209588,"about_ca_topic_score_gemma":0.000272667,"teacher_disagreement_score":0.44355577,"about_ca_system_score_codex":0.000012695267,"about_ca_system_score_gemma":0.000009107871,"threshold_uncertainty_score":0.99989265},"labels":[],"label_agreement":null},{"id":"W2599023482","doi":"10.3390/a10020040","title":"Fuzzy Random Walkers with Second Order Bounds: An Asymmetric Analysis","year":2017,"lang":"en","type":"article","venue":"Algorithms","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science; Random graph; Fuzzy logic; Null graph; Graph; Mathematics; Algorithm; Voltage graph; Artificial intelligence; Line graph","score_opus":0.011544065930279871,"score_gpt":0.27818790118790826,"score_spread":0.2666438352576284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599023482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36956516,0.00024151723,0.37884018,0.00032193205,0.00020607591,0.00072430127,0.00011410759,0.000365831,0.24962088],"genre_scores_gemma":[0.9796739,0.0000039307834,0.017585844,0.000039474147,0.00041275166,0.000044126202,0.0001394618,0.00003017736,0.002070338],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99853677,0.00006367673,0.0002624297,0.00048461577,0.00027582745,0.00037671052],"domain_scores_gemma":[0.9979195,0.000062401916,0.00031164847,0.0013582658,0.0001874899,0.00016069696],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003120778,0.00025369966,0.00055501284,0.00037718413,0.00066713645,0.00054254907,0.0006374897,0.000045795234,0.0011460686],"category_scores_gemma":[0.0000069418334,0.00020614048,0.0002663448,0.0010360234,0.00015093504,0.00042717482,0.00011118645,0.00019218694,0.000034838795],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014760977,0.00062384957,0.42299277,0.000010793191,0.011806214,0.0000392676,0.00042770294,0.0008271297,0.00006415643,0.006706146,0.004437737,0.55191666],"study_design_scores_gemma":[0.021723395,0.0015946425,0.40925884,0.000102211,0.02176202,0.00001893946,0.0020951808,0.3234568,0.005451999,0.083407104,0.124748245,0.006380617],"about_ca_topic_score_codex":0.0019234226,"about_ca_topic_score_gemma":0.00055614836,"teacher_disagreement_score":0.61010873,"about_ca_system_score_codex":0.000026741402,"about_ca_system_score_gemma":0.000050065766,"threshold_uncertainty_score":0.999767},"labels":[],"label_agreement":null},{"id":"W2599460858","doi":"10.5465/ambpp.2015.14332abstract","title":"Exploring the Dynamics of Network Deadlock: Interorganizational Stalemate without Stale Mates?","year":2015,"lang":"en","type":"article","venue":"Academy of Management Proceedings","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Deadlock; Conceptualization; Stalemate; Deadlock prevention algorithms; Computer science; Mutual exclusion; Knowledge management; Network dynamics; Distributed computing; Political science; Artificial intelligence; Law; Mathematics","score_opus":0.059719297703323716,"score_gpt":0.27546626790520135,"score_spread":0.21574697020187764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599460858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95582396,0.000047254038,0.021322789,0.000919137,0.000056253666,0.00054386084,0.000011287957,0.00011455003,0.021160927],"genre_scores_gemma":[0.99493736,0.000020034297,0.004215082,0.000043608867,0.00016526518,0.00005227572,0.000017158618,0.00002584796,0.0005233643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987628,0.000010721621,0.0004271359,0.0002085446,0.00035152587,0.00023928848],"domain_scores_gemma":[0.99933684,0.000019697292,0.00037674754,0.00008657586,0.00012760915,0.000052507563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005053861,0.00015749896,0.00025444292,0.00009151954,0.00006619726,0.000034034827,0.0004917565,0.000021688043,0.00005761353],"category_scores_gemma":[0.000004350247,0.00012909429,0.00007360944,0.0005530288,0.00008723823,0.00035232375,0.00048461228,0.00014824998,0.0000047882586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003122241,0.00007176349,0.14466107,0.00011376959,0.00044941768,1.06255996e-7,0.00046443555,0.0007765567,0.000046499794,0.8345286,0.010784832,0.008071686],"study_design_scores_gemma":[0.003588432,0.00044254938,0.14157252,0.0019785515,0.0020244971,0.0000051508337,0.026246969,0.12240507,0.021024186,0.6295439,0.04891779,0.0022503864],"about_ca_topic_score_codex":0.000015319549,"about_ca_topic_score_gemma":6.705825e-7,"teacher_disagreement_score":0.20498474,"about_ca_system_score_codex":0.00003968559,"about_ca_system_score_gemma":0.000006945865,"threshold_uncertainty_score":0.52643126},"labels":[],"label_agreement":null},{"id":"W2601078634","doi":"10.1142/s2425038416300019","title":"Community detection in social networks","year":2017,"lang":"en","type":"article","venue":"Encyclopedia with Semantic Computing and Robotic Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"","keywords":"Homophily; Automatic summarization; Social network (sociolinguistics); Social network analysis; Data science; Network science; Social media; Sociology; Computer science; World Wide Web; Internet privacy; Complex network; Social science; Artificial intelligence","score_opus":0.01669501003673413,"score_gpt":0.2863276148949625,"score_spread":0.2696326048582284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601078634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30265743,0.000024801111,0.69091886,0.00006886954,0.000096266835,0.00012239483,1.9961537e-7,0.000047323356,0.006063881],"genre_scores_gemma":[0.9977666,0.0000145551885,0.0016386294,0.000012737733,0.0004263332,0.000005029462,0.000003245569,0.00001497505,0.00011790708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988945,0.0001324378,0.00027737115,0.00023592118,0.00011272035,0.00034705928],"domain_scores_gemma":[0.9991367,0.00014310372,0.00022687274,0.00039229443,0.00005087061,0.000050194823],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00052174926,0.00018397844,0.00029384435,0.000076970304,0.0018700022,0.00016397671,0.00036017667,0.000044771707,0.00001996491],"category_scores_gemma":[0.000015007475,0.00016041912,0.00005027577,0.00013737152,0.0001935281,0.00010071781,0.00030079662,0.0005817473,0.0000031785185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028061875,0.00019176392,0.33383504,0.00003525007,0.00008261231,0.00001023119,0.002573377,0.05134623,0.0000118943535,0.006710519,0.00006281173,0.6051122],"study_design_scores_gemma":[0.00018285897,0.00009811634,0.20208062,0.00024252966,0.00007147182,0.000007184769,0.0010344501,0.78681904,0.00013170435,0.008804708,0.000090127054,0.00043719856],"about_ca_topic_score_codex":0.0026514214,"about_ca_topic_score_gemma":0.0005860341,"teacher_disagreement_score":0.7354728,"about_ca_system_score_codex":0.000018687151,"about_ca_system_score_gemma":0.0000171473,"threshold_uncertainty_score":0.9994294},"labels":[],"label_agreement":null},{"id":"W2602768606","doi":"10.1109/ita.2016.7888181","title":"The structure of communities in information networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Order (exchange); Social network (sociolinguistics); Population; Data science; Feature (linguistics); Network structure; World Wide Web; Theoretical computer science; Social media; Sociology; Business","score_opus":0.00530591693048136,"score_gpt":0.22057051845419132,"score_spread":0.21526460152370996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602768606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49246144,0.000047115016,0.47921482,0.00037496586,0.000047590296,0.00018120778,0.000013211722,0.000047294212,0.027612362],"genre_scores_gemma":[0.99969184,0.00000779441,0.00019645558,0.000013828035,0.000024795176,0.0000016157163,0.000008249729,0.0000014726805,0.000053931213],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996894,0.000029099552,0.00015007368,0.000015779082,0.000042431155,0.000073191324],"domain_scores_gemma":[0.9995994,0.00013061237,0.000059314563,0.00017306751,0.00003054852,0.0000070398514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006994876,0.000036904697,0.000060155384,0.000025298816,0.00004006296,0.0000140059,0.0001291522,0.0000102907725,0.00030536612],"category_scores_gemma":[9.920607e-7,0.000017042974,0.000026324493,0.00008075809,0.000040794384,0.00012821343,0.000045423007,0.000041514977,0.0000010404658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008956958,0.000008744975,0.21077265,0.0000012635518,0.000032813405,8.410141e-9,0.00026611998,0.000991446,0.000095580384,0.36310986,0.003795732,0.42091686],"study_design_scores_gemma":[0.0018627729,0.00012465242,0.13524239,0.00027221953,0.000058662026,5.607478e-7,0.009405723,0.111701705,0.015772017,0.51725173,0.20754346,0.0007641245],"about_ca_topic_score_codex":0.00051823043,"about_ca_topic_score_gemma":0.00042268724,"teacher_disagreement_score":0.5072304,"about_ca_system_score_codex":0.0000058654764,"about_ca_system_score_gemma":0.000005229307,"threshold_uncertainty_score":0.33435446},"labels":[],"label_agreement":null},{"id":"W2603141756","doi":"10.1007/978-3-319-51367-6","title":"From Social Data Mining and Analysis to Prediction and Community Detection","year":2017,"lang":"en","type":"book","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Social network analysis; Data science; Context (archaeology); Computer science; State (computer science); Social network (sociolinguistics); Data mining; Social media; World Wide Web; Geography; Archaeology","score_opus":0.03219055211135649,"score_gpt":0.30564577380192814,"score_spread":0.2734552216905717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603141756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014275597,0.0006033013,0.9740191,0.00017089066,0.0002274179,0.0004776818,0.00095741823,0.00013493333,0.009133638],"genre_scores_gemma":[0.98475504,0.000024055696,0.0012277443,0.000066792694,0.00823708,0.000025650792,0.005142249,0.000049110484,0.00047227417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981834,0.0003778592,0.0003688479,0.0005757155,0.00019417361,0.00029994827],"domain_scores_gemma":[0.99821156,0.00053869275,0.00039552196,0.00072521035,0.000059457423,0.000069567155],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005620769,0.00037418705,0.00085147284,0.00023500432,0.0016504088,0.00027762135,0.0005616458,0.00053235184,0.00005158371],"category_scores_gemma":[0.000035038523,0.00042263014,0.00016369509,0.00029852724,0.00017524157,0.00012184579,0.0009260313,0.0015003643,4.3732064e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006211225,0.000051728668,0.020549988,0.0000123839545,0.0027232254,0.0000016965315,0.0040649395,0.0012972275,0.0000082529305,0.00004581385,0.009248335,0.96193427],"study_design_scores_gemma":[0.0020248205,0.00030353357,0.14794128,0.00056728284,0.021313572,0.0000013415302,0.00051943434,0.53748035,0.000035810815,0.22118649,0.06472332,0.0039027587],"about_ca_topic_score_codex":0.002518143,"about_ca_topic_score_gemma":0.008908209,"teacher_disagreement_score":0.9727914,"about_ca_system_score_codex":0.000115009076,"about_ca_system_score_gemma":0.000045966386,"threshold_uncertainty_score":0.99982256},"labels":[],"label_agreement":null},{"id":"W2604605458","doi":"10.1108/oir-11-2015-0368","title":"A typology of collaborative research networks","year":2017,"lang":"en","type":"article","venue":"Online Information Review","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Typology; Social network analysis; Originality; Computer science; Value (mathematics); Knowledge management; Data science; Management science; Sociology; Qualitative research; World Wide Web; Social media; Social science; Engineering","score_opus":0.050202617673235805,"score_gpt":0.4431830241797316,"score_spread":0.3929804065064958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604605458","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011194996,0.043063562,0.12894484,0.01644878,0.00043252012,0.005063396,0.0005998348,0.00021052283,0.7940416],"genre_scores_gemma":[0.9775339,0.015030446,0.0057593565,0.00040347688,0.00032191226,0.00009624416,0.000626923,0.000008588734,0.00021919466],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991563,0.000096598254,0.00041116704,0.000056919987,0.00014836976,0.00013062752],"domain_scores_gemma":[0.99824065,0.000063001746,0.00047268698,0.0005177864,0.0006749407,0.000030961677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073294144,0.00006699669,0.00026782075,0.00006417035,0.00019818556,0.000041544652,0.00033761645,0.000025078403,0.00058342254],"category_scores_gemma":[0.000077187055,0.00005623402,0.00007142982,0.00022264445,0.00011428146,0.00041500138,0.00014096564,0.00017818404,0.000034813158],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009956317,0.000101563615,0.008838925,0.00046555168,0.00012230506,2.2102716e-7,0.000115882955,0.000104472936,0.00000330465,0.16866551,0.12366675,0.69790554],"study_design_scores_gemma":[0.00024567006,0.00007615127,0.0040512714,0.0018497058,0.000059107824,5.4422014e-7,0.00021701914,0.008024867,0.00005144078,0.0044486434,0.9808047,0.0001708741],"about_ca_topic_score_codex":0.00009230651,"about_ca_topic_score_gemma":0.000012006505,"teacher_disagreement_score":0.9663389,"about_ca_system_score_codex":0.0000102234035,"about_ca_system_score_gemma":0.00006393925,"threshold_uncertainty_score":0.6388068},"labels":[],"label_agreement":null},{"id":"W2604623547","doi":"10.1088/1367-2630/aa7b09","title":"Spreading of localized attacks in spatial multiplex networks","year":2017,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research Global; Japan Science and Technology Agency; Defense Threat Reduction Agency; Azrieli Foundation; Israel Science Foundation","keywords":"Interdependent networks; Metastability; Scaling; Multiplex; Cascade; Scaling law; Nucleation","score_opus":0.024277396818504764,"score_gpt":0.30746450280851767,"score_spread":0.2831871059900129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604623547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22400543,0.00007450555,0.7730621,0.000072724324,0.00017765266,0.000095737494,0.0000027349738,0.000007410963,0.0025016768],"genre_scores_gemma":[0.9941816,0.000010273665,0.0037823862,0.000009195131,0.001943849,7.6202326e-7,0.0000026790149,0.000016477987,0.000052801337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889505,0.00004568314,0.0005398503,0.000109655586,0.00021127694,0.00019850074],"domain_scores_gemma":[0.9981448,0.000075666576,0.0011753747,0.000379354,0.00013474489,0.0000900406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023600974,0.00013985959,0.000492002,0.00006013419,0.00008390701,0.00006264915,0.0005106291,0.00003685966,0.000101679245],"category_scores_gemma":[0.000013978171,0.00012929906,0.00029326123,0.000089521156,0.00006686512,0.00024949224,0.0001087131,0.00031607228,0.0000015553602],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012343071,0.00026046182,0.41475427,0.000010429466,0.00020874517,0.000008931245,0.00023831306,0.033201333,0.0017805027,0.0055755842,0.0030008585,0.54083717],"study_design_scores_gemma":[0.014778227,0.0007696071,0.16668762,0.0020204838,0.0008660234,0.00001110144,0.00034831188,0.53643614,0.07295131,0.19311915,0.010429145,0.0015829069],"about_ca_topic_score_codex":0.0014945737,"about_ca_topic_score_gemma":0.000079620986,"teacher_disagreement_score":0.7701762,"about_ca_system_score_codex":0.00002791746,"about_ca_system_score_gemma":0.000077971315,"threshold_uncertainty_score":0.5272663},"labels":[],"label_agreement":null},{"id":"W2605104053","doi":"10.1609/aaai.v31i1.10905","title":"A General Clustering Agreement Index: For Comparing Disjoint and Overlapping Clusters","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cluster analysis; Disjoint sets; Rand index; Index (typography); Similarity (geometry); Benchmark (surveying); Computer science; Data mining; Mathematics; Pattern recognition (psychology); Artificial intelligence; Combinatorics; Geography; Cartography","score_opus":0.09353539178493135,"score_gpt":0.3283291559622062,"score_spread":0.23479376417727482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605104053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8858337,0.000008308073,0.096992224,0.001016284,0.00016277841,0.0006738413,0.000007268336,0.000032923057,0.0152727235],"genre_scores_gemma":[0.9977972,0.0000046780347,0.0017348559,0.00003090914,0.0001883049,0.000059916616,0.000001010067,0.0000121774565,0.00017093585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987809,0.000005721639,0.00039434448,0.00032934797,0.00019309296,0.00029656017],"domain_scores_gemma":[0.99889046,0.000034109937,0.0005248018,0.00026713146,0.00022304845,0.000060427166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032678546,0.00018648703,0.0003047308,0.00006211204,0.0006253849,0.00040466446,0.00073405355,0.000031446067,0.000042008352],"category_scores_gemma":[0.00004153824,0.00015132058,0.00013821253,0.00006306218,0.00022696213,0.00019702455,0.00061927445,0.00015432753,0.0000025875963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017805574,0.00013516318,0.05114303,0.00008990726,0.00014180258,9.1775746e-8,0.00097096927,0.0006812729,0.026833095,0.77696013,0.00020343381,0.14266308],"study_design_scores_gemma":[0.00007962541,0.00009309259,0.0050830483,0.00041116602,0.000058608603,4.74064e-7,0.0008060301,0.77592546,0.06368938,0.15343265,0.000123188,0.00029729668],"about_ca_topic_score_codex":0.00040635112,"about_ca_topic_score_gemma":0.00005763542,"teacher_disagreement_score":0.7752442,"about_ca_system_score_codex":0.000028134098,"about_ca_system_score_gemma":0.000020919753,"threshold_uncertainty_score":0.6170674},"labels":[],"label_agreement":null},{"id":"W2605659461","doi":"10.1016/j.laa.2018.07.029","title":"Recovering the structure of random linear graphs","year":2018,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Random graph; Mathematics; Random regular graph; Discrete mathematics; Path graph; Graph; Graph embedding; Line graph; Embedding; Graph power; 1-planar graph; Computer science","score_opus":0.01123864451457831,"score_gpt":0.2680506862240013,"score_spread":0.256812041709423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605659461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74493706,0.0019661267,0.24309401,0.00061598007,0.00017937095,0.0032026477,0.0012133054,0.00023177848,0.0045597036],"genre_scores_gemma":[0.9944113,0.00012241928,0.0039005184,0.000033458953,0.00092905626,0.00012565439,0.00031909798,0.000026935897,0.00013159403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893606,0.00004394453,0.0003733589,0.00036242785,0.00012978356,0.00015445043],"domain_scores_gemma":[0.99867904,0.000114444534,0.00031264246,0.00067196746,0.00016999162,0.00005192769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110151035,0.00021979077,0.00035761288,0.00007328515,0.00019266579,0.000037925336,0.00040705033,0.000102804086,0.0003119355],"category_scores_gemma":[0.000005096827,0.00016283403,0.00019991805,0.00023211351,0.000104148705,0.000031801545,0.00046376078,0.00039242077,0.000007580605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015445356,0.0005442888,0.013732348,0.00066584814,0.003722513,4.2583946e-7,0.0019562163,0.0033634612,0.01829781,0.8400431,0.011485554,0.10603393],"study_design_scores_gemma":[0.0009260367,0.00006123244,0.0014045925,0.0002113123,0.0009996392,0.0000017835822,0.00014618877,0.06447446,0.03858503,0.7978202,0.094424695,0.00094480056],"about_ca_topic_score_codex":0.00007997891,"about_ca_topic_score_gemma":0.000009962414,"teacher_disagreement_score":0.2494742,"about_ca_system_score_codex":0.000006306364,"about_ca_system_score_gemma":0.000041789644,"threshold_uncertainty_score":0.6640179},"labels":[],"label_agreement":null},{"id":"W2608294675","doi":"10.1111/coin.12117","title":"Finding Diachronic Like‐Minded Users","year":2017,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"","keywords":"Latent Dirichlet allocation; Computer science; Timestamp; Friendship; Topic model; Social media; Similarity (geometry); Context (archaeology); Data science; Interpersonal ties; Information retrieval; World Wide Web; Artificial intelligence; Sociology; Geography","score_opus":0.04944606780090331,"score_gpt":0.352443335402613,"score_spread":0.3029972676017097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608294675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059871145,0.000042534335,0.9305501,0.00016410855,0.00016434722,0.00011288609,0.000007848451,0.00006438137,0.00902266],"genre_scores_gemma":[0.98928565,0.0000019293932,0.00995394,0.00003989066,0.00024249344,0.000017171362,0.00004093953,0.000011867486,0.0004061237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991099,0.000022004166,0.00021126594,0.00025134257,0.00018122219,0.00022422119],"domain_scores_gemma":[0.9991186,0.00013526161,0.00019806842,0.00038494094,0.00010124284,0.00006183244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014279572,0.00012577605,0.00014600829,0.00005994941,0.0006053809,0.00023277957,0.0005587177,0.000022054148,0.0008477338],"category_scores_gemma":[0.00001216705,0.00013150666,0.0001221428,0.000070465736,0.00012398486,0.00019882375,0.00020074967,0.00013529419,0.00019401456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001249348,0.00015292091,0.15029304,0.000010003864,0.00023300106,0.0000052914647,0.0003344003,0.13910875,0.00006299034,0.4630362,0.005347978,0.24140291],"study_design_scores_gemma":[0.000111168396,0.000038693455,0.05435147,0.00006910613,0.00004691424,0.0000016469135,0.00010310149,0.45670873,0.0021217254,0.48134205,0.004640779,0.00046461125],"about_ca_topic_score_codex":0.0001212523,"about_ca_topic_score_gemma":0.000007731029,"teacher_disagreement_score":0.9294145,"about_ca_system_score_codex":0.000037439626,"about_ca_system_score_gemma":0.000057896694,"threshold_uncertainty_score":0.92820907},"labels":[],"label_agreement":null},{"id":"W2608595291","doi":"10.5539/cis.v10n2p52","title":"A Binary Search Algorithm for Correlation Study of Decay Centrality vs. Degree Centrality and Closeness Centrality","year":2017,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Experimental Program to Stimulate Competitive Research; National Aeronautics and Space Administration","keywords":"Centrality; Degree (music); Closeness; Binary number; Value (mathematics); Correlation; Computer science; Correlation coefficient; Monotonic function; Positive correlation; Algorithm; Physics; Mathematics; Statistics; Arithmetic; Mathematical analysis","score_opus":0.039496044708757776,"score_gpt":0.32789775665110793,"score_spread":0.28840171194235015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608595291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5915421,0.0000040723294,0.40762702,0.00004688138,0.00009108999,0.00038139705,0.000023482848,0.00001279332,0.0002711623],"genre_scores_gemma":[0.99170977,0.0000057876255,0.0081670815,0.00002174377,0.00005759406,0.000010224611,0.000020113339,0.0000019961592,0.000005665526],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99886775,0.000041361818,0.00036329712,0.00019964915,0.0002854366,0.00024247731],"domain_scores_gemma":[0.99888164,0.000046392335,0.0002668825,0.00038618405,0.00031216693,0.00010670831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092476385,0.000106701955,0.00019743858,0.000092391405,0.00076341943,0.0004151726,0.00034418862,0.000020936273,0.000009314895],"category_scores_gemma":[0.000005943467,0.00009536619,0.000040411738,0.00016225476,0.0003262008,0.003114552,0.00031429273,0.00007288316,7.7016375e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018768877,0.0001466702,0.37395653,0.000024903351,0.000020260812,7.620059e-8,0.001715725,0.00015368416,0.000018507075,0.0069851107,0.00011793336,0.6168418],"study_design_scores_gemma":[0.00046411887,0.000091654874,0.62219274,0.000010528834,0.00001363607,3.6996647e-7,0.00015769759,0.37596986,0.0003218933,0.00036169836,0.00032834618,0.000087471904],"about_ca_topic_score_codex":0.00036823648,"about_ca_topic_score_gemma":0.0000052009327,"teacher_disagreement_score":0.61675435,"about_ca_system_score_codex":0.000026733636,"about_ca_system_score_gemma":0.00006888462,"threshold_uncertainty_score":0.5871682},"labels":[],"label_agreement":null},{"id":"W2610285364","doi":"10.1145/3110025.3120959","title":"Efficient Implementation of Anchored 2-core Algorithm","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Core (optical fiber); Social network (sociolinguistics); Set (abstract data type); Graph; Core network; Theoretical computer science; Many core; Graph theory; Distributed computing; Algorithm; Computer network; Social media; World Wide Web; Parallel computing; Mathematics; Telecommunications","score_opus":0.020254095785769734,"score_gpt":0.3441596956508711,"score_spread":0.32390559986510137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610285364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7318851,0.000007144497,0.23844555,0.000068214926,0.000042442363,0.0001678666,0.000021669857,0.000036637357,0.029325373],"genre_scores_gemma":[0.98388356,2.8598893e-7,0.015821157,0.0000047159683,0.00010242398,0.000010323315,0.00001834112,0.000004694808,0.00015448457],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99955976,0.0000059454132,0.00014458116,0.00010491494,0.00008774206,0.00009707042],"domain_scores_gemma":[0.99938095,0.000007969267,0.000165481,0.00037204864,0.000050963234,0.000022598018],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000802562,0.000057803747,0.00010927949,0.000028269504,0.00012458011,0.000030250167,0.00017569214,0.0000078972,0.0014062064],"category_scores_gemma":[6.2574287e-7,0.000050626753,0.00007691654,0.000030013996,0.000031016367,0.00002391596,0.00007634571,0.000028015238,0.0000062324893],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015181769,0.000062708226,0.12995109,0.0000020055936,0.000076799784,2.0308829e-7,0.00008600535,0.00005996621,0.0012522477,0.04465417,0.0023875774,0.82146573],"study_design_scores_gemma":[0.0018885991,0.00016633378,0.5390703,0.000039609004,0.00023643566,4.1417883e-7,0.0020503371,0.23997593,0.16512334,0.042884137,0.0078743575,0.0006901634],"about_ca_topic_score_codex":0.0014210183,"about_ca_topic_score_gemma":0.000026385691,"teacher_disagreement_score":0.82077557,"about_ca_system_score_codex":0.0000067346477,"about_ca_system_score_gemma":0.000011731718,"threshold_uncertainty_score":0.99950665},"labels":[],"label_agreement":null},{"id":"W2613527851","doi":"10.1007/978-1-4939-7131-2_101196","title":"Social Networks Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Social network analysis; Computer science; World Wide Web; Social media","score_opus":0.01681452221444988,"score_gpt":0.27036168494447027,"score_spread":0.25354716273002037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613527851","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009273253,0.00003571509,0.15478137,0.00003479283,0.000029196566,0.00009168014,0.000014127496,0.00014518843,0.84485865],"genre_scores_gemma":[0.09635112,0.00000496276,0.0007198454,0.00006965053,0.0045010536,0.000010519556,0.00063677167,0.000059670365,0.8976464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998668,0.000013697063,0.00037632344,0.00045894572,0.00021662319,0.00026636646],"domain_scores_gemma":[0.9990151,0.00003304767,0.00028197299,0.0004626735,0.0001396699,0.00006755955],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011900676,0.0003709186,0.0007540669,0.00030023907,0.00017258686,0.00008042027,0.0003228885,0.00018975958,0.098223984],"category_scores_gemma":[2.5889176e-7,0.00035387248,0.0012939578,0.00017808574,0.0001164902,0.00003465755,0.00018463825,0.00031133043,0.00029155216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036871754,0.000013451336,0.0004886549,0.0000012675184,0.0064830864,9.2816816e-7,0.000024099736,0.0000526817,1.9799965e-7,0.7294525,0.25195256,0.011526869],"study_design_scores_gemma":[0.00008438704,0.000022847744,0.00008949854,0.000011781437,0.0065708775,8.926288e-8,0.000008201326,0.010169991,0.000004361977,0.26270854,0.7195869,0.0007425023],"about_ca_topic_score_codex":0.00007678304,"about_ca_topic_score_gemma":0.00007254312,"teacher_disagreement_score":0.46763435,"about_ca_system_score_codex":0.00003395584,"about_ca_system_score_gemma":0.000022901088,"threshold_uncertainty_score":0.99989134},"labels":[],"label_agreement":null},{"id":"W2614325027","doi":"10.3982/te1381","title":"Specification and Estimation of Network Formation and Network Interaction Models with the Exponential Probability Distribution","year":2020,"lang":"en","type":"article","venue":"Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Homophily; Friendship; Incentive; Network formation; Econometrics; Social network (sociolinguistics); Computer science; Interaction network; Network model; Social psychology; Psychology; Microeconomics; Economics; Artificial intelligence","score_opus":0.02002387204262882,"score_gpt":0.2006088069095295,"score_spread":0.1805849348669007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614325027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48467827,0.00006341482,0.51249176,0.00081954297,0.00000919875,0.0003874237,0.000069427246,0.000030956846,0.0014500369],"genre_scores_gemma":[0.98687136,0.000055835993,0.012580358,0.000011197886,0.000073129544,0.000001643159,0.00038252815,0.000007816241,0.000016153355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989693,0.00020640861,0.0002180085,0.00025168605,0.00019246631,0.00016213888],"domain_scores_gemma":[0.9990752,0.00014502395,0.00035164843,0.00024495585,0.00010813499,0.000075058495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024926188,0.00014315393,0.00024692074,0.000027019874,0.00032176546,0.000020133552,0.00019739002,0.00003161095,0.00003786606],"category_scores_gemma":[0.0000070797055,0.00013204907,0.00008490622,0.00021992455,0.0003243685,0.00038353205,0.00021268806,0.00020312885,4.9889707e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005153662,0.00058898184,0.03138635,0.0005202658,0.0011415984,0.000004135877,0.06314907,0.44969022,0.0014562411,0.17675692,0.009967718,0.26018485],"study_design_scores_gemma":[0.0005108253,0.00019499466,0.0144411,0.000109663204,0.00018567023,0.000002206927,0.004404072,0.96266425,0.00007267537,0.015617874,0.0016192679,0.0001774317],"about_ca_topic_score_codex":0.0004007075,"about_ca_topic_score_gemma":0.00025642526,"teacher_disagreement_score":0.512974,"about_ca_system_score_codex":0.000034498073,"about_ca_system_score_gemma":0.00002958321,"threshold_uncertainty_score":0.5384805},"labels":[],"label_agreement":null},{"id":"W2614699712","doi":"10.1145/3068943.3068946","title":"Graph Mining to Characterize Competition for Employment","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Workforce; Internship; Analytics; Computer science; Graph; Competition (biology); Data science; Theoretical computer science; Political science","score_opus":0.037346750570684664,"score_gpt":0.3092794660238742,"score_spread":0.27193271545318953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614699712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53082675,0.0000013465168,0.44834557,0.00080748065,0.00007167365,0.00034067858,0.000017839042,0.0000766785,0.019511998],"genre_scores_gemma":[0.98408055,2.5083153e-7,0.014259286,0.00010287472,0.0002817444,0.0001358607,0.000051880303,0.00000899184,0.001078576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999538,0.0000059902723,0.000113335394,0.00014837625,0.00005578093,0.00013853663],"domain_scores_gemma":[0.99945855,0.000019050165,0.000079068195,0.00035189837,0.000041004256,0.000050441624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008078645,0.00007521154,0.00012399549,0.00003789646,0.00028651956,0.00013591653,0.00019457725,0.000009433748,0.00045282266],"category_scores_gemma":[0.0000022087481,0.000070162605,0.00010245075,0.000022600028,0.000013228769,0.00007726447,0.00007511664,0.000021135642,0.000014397921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046167683,0.00022051226,0.1380923,0.00000945586,0.0002483513,4.9924404e-7,0.0002576087,0.000020120307,0.013808191,0.6086061,0.02165495,0.21703576],"study_design_scores_gemma":[0.0019158514,0.00075025135,0.39557925,0.000221576,0.00025744186,6.1583887e-7,0.00041672986,0.0048381668,0.05265185,0.13304079,0.40878004,0.0015474596],"about_ca_topic_score_codex":0.00015499929,"about_ca_topic_score_gemma":0.000028650818,"teacher_disagreement_score":0.4755653,"about_ca_system_score_codex":0.0000074796326,"about_ca_system_score_gemma":0.0000052127734,"threshold_uncertainty_score":0.49580908},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0194310404711445,"score_gpt":0.28423438600650436,"score_spread":0.26480334553535984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619906413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97348404,0.00024102491,0.0074142017,0.0076604267,0.0001011298,0.001970093,0.000037649585,0.000075424316,0.009016015],"genre_scores_gemma":[0.9959675,0.000010389929,0.0034641004,0.000035087407,0.000245358,0.00011112218,0.0000016204194,0.000009367188,0.00015542873],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993892,0.0000033926444,0.00018118128,0.00015412855,0.0001335819,0.00013852544],"domain_scores_gemma":[0.99913615,0.000033653905,0.00042752837,0.00019433264,0.00018754762,0.000020785348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026058158,0.000096095355,0.00013628039,0.000017629676,0.00061037997,0.00016102676,0.0005178602,0.000013646282,0.000009800626],"category_scores_gemma":[0.000041870582,0.00005684004,0.00009772077,0.00004711254,0.00008218846,0.00015412166,0.00031023225,0.000071508766,3.785159e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042794007,0.000067476125,0.33397397,0.00019991821,0.00036417626,5.7698458e-8,0.001663497,0.00026312887,0.015564481,0.3004269,0.0023583893,0.34507522],"study_design_scores_gemma":[0.002577603,0.00019644908,0.19529936,0.0015280356,0.0011321829,0.000004924774,0.003998016,0.061999425,0.30472842,0.37843302,0.048917588,0.0011849753],"about_ca_topic_score_codex":0.00011759481,"about_ca_topic_score_gemma":5.2011745e-7,"teacher_disagreement_score":0.34389025,"about_ca_system_score_codex":0.000016262975,"about_ca_system_score_gemma":0.000007866463,"threshold_uncertainty_score":0.46946108},"labels":[],"label_agreement":null},{"id":"W2620887933","doi":"10.7717/peerj-cs.991","title":"A longitudinal study of topic classification on Twitter","year":2022,"lang":"en","type":"article","venue":"PeerJ Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Classifier (UML); Computer science; Artificial intelligence; Machine learning; Generalization; Social media; Feature (linguistics); Entertainment; Natural language processing; Information retrieval; World Wide Web; Mathematics","score_opus":0.061929237309352896,"score_gpt":0.32355661652000284,"score_spread":0.26162737921064994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620887933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9054469,0.0000016221563,0.09315315,0.0001160791,0.00010801703,0.00014093483,0.0000010060925,0.000026782613,0.0010054983],"genre_scores_gemma":[0.9975954,2.7523853e-8,0.0021390615,0.000038087055,0.000110228604,0.000037484115,0.0000020110015,0.000003003112,0.000074665324],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99889123,0.00004666595,0.00015638032,0.0003048333,0.00046463273,0.00013626885],"domain_scores_gemma":[0.9993872,0.0000279325,0.000094837975,0.00038990518,0.00007009403,0.000030022898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003464068,0.00006657164,0.00011389533,0.00014827563,0.0002723959,0.000041500374,0.000536904,0.0000029887872,0.00020062081],"category_scores_gemma":[8.701331e-7,0.00006297943,0.00004151596,0.00069707196,0.00006532915,0.00006932732,0.00037658104,0.000101107726,0.0000037310508],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000123738755,0.001838194,0.8694375,0.0000025650759,0.00003903527,0.0000020985187,0.0024037543,0.006329845,0.0007709352,0.024946306,0.002980737,0.09123665],"study_design_scores_gemma":[0.00031218727,0.0008307557,0.81228036,0.000004642922,0.00002064224,9.11561e-7,0.00041370688,0.18113567,0.00040804382,0.00325061,0.0011693247,0.00017314387],"about_ca_topic_score_codex":0.00011909813,"about_ca_topic_score_gemma":0.0000021140686,"teacher_disagreement_score":0.17480582,"about_ca_system_score_codex":0.00003752821,"about_ca_system_score_gemma":0.000034428704,"threshold_uncertainty_score":0.25682265},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04102465157361466,"score_gpt":0.3032241378313941,"score_spread":0.26219948625777945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621145626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9562356,0.000010333797,0.0001491237,0.0007569417,0.00004505531,0.00028885237,0.000014649196,0.000035339937,0.042464107],"genre_scores_gemma":[0.99872714,0.000003187533,0.0006295879,0.000017231561,0.00012295775,0.0000324204,0.0000025955276,0.000010949738,0.00045393335],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99921113,0.000015190502,0.0001915436,0.00012258146,0.0002438831,0.00021567244],"domain_scores_gemma":[0.99899507,0.000029205037,0.00027971066,0.00046367102,0.00018536563,0.000046988513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039921215,0.0001178787,0.00020420001,0.00003298868,0.00092147826,0.00012836391,0.0014906954,0.000019985535,0.00010458909],"category_scores_gemma":[0.000016034175,0.00008449266,0.00018497126,0.00007309437,0.00015759614,0.0001373857,0.001180349,0.0003128576,0.0000075026314],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012271674,0.00027326506,0.91299534,0.00003240821,0.0002106703,5.4893988e-8,0.000570152,0.000019044226,0.02006343,0.051418554,0.007716234,0.006688601],"study_design_scores_gemma":[0.0010300203,0.00015017219,0.2870824,0.00027590376,0.00023448002,0.0000013829736,0.0016671309,0.0015627277,0.6484465,0.050857868,0.008218663,0.00047274382],"about_ca_topic_score_codex":0.0014134153,"about_ca_topic_score_gemma":0.000009821865,"teacher_disagreement_score":0.62838304,"about_ca_system_score_codex":0.000036202156,"about_ca_system_score_gemma":0.000015002552,"threshold_uncertainty_score":0.7087359},"labels":[],"label_agreement":null},{"id":"W2625520103","doi":"10.1371/journal.pone.0179120","title":"Constructing a Watts-Strogatz network from a small-world network with symmetric degree distribution","year":2017,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Degree distribution; Degree (music); Scale-free network; Clustering coefficient; Replicate; Computer science; Average path length; Cluster analysis; Sample (material); Sample size determination; Small-world network; Complex network; Hierarchical network model; Scale (ratio); Statistics; Mathematics; Artificial intelligence; Physics; Theoretical computer science","score_opus":0.0646510897436573,"score_gpt":0.24121542168785964,"score_spread":0.17656433194420235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625520103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8691732,0.00028454416,0.091269426,0.0004150982,0.000106485684,0.0007449628,0.00025871836,0.00039268495,0.03735487],"genre_scores_gemma":[0.954696,0.000004738202,0.041241955,0.000023217246,0.00301517,0.000077367484,0.00059839064,0.00003858345,0.0003045784],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980664,0.00007992506,0.00036608893,0.0004923907,0.00033115825,0.00066401163],"domain_scores_gemma":[0.99780816,0.00022249999,0.0005832544,0.0010646138,0.00016610484,0.0001553426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025043343,0.00030449737,0.0006028038,0.000056363482,0.00088973803,0.0003854896,0.0005871569,0.000052119158,0.00024194698],"category_scores_gemma":[0.000023987835,0.00028118741,0.00015266318,0.00050562585,0.000166342,0.00017629444,0.0003033122,0.00039694627,0.000022030807],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046974572,0.00029802724,0.93671626,0.00000846825,0.0012929656,0.000005538154,0.000011373676,0.000111594476,0.00002471796,0.029911136,0.0014954193,0.03007754],"study_design_scores_gemma":[0.00844053,0.00096146454,0.564692,0.007682428,0.012817975,0.0000072368903,0.0004939394,0.13375121,0.013515267,0.24008033,0.011361496,0.0061960765],"about_ca_topic_score_codex":0.0013994077,"about_ca_topic_score_gemma":0.0014985348,"teacher_disagreement_score":0.3720242,"about_ca_system_score_codex":0.0000942416,"about_ca_system_score_gemma":0.000049488484,"threshold_uncertainty_score":0.99996406},"labels":[],"label_agreement":null},{"id":"W2653056627","doi":"10.1109/ccece.2017.7946603","title":"A stochastic gamer's model for on-line games","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Server; Network packet; Predictability; Human–computer interaction; Computer network; Distributed computing","score_opus":0.05809509254143265,"score_gpt":0.3474878675406724,"score_spread":0.28939277499923977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2653056627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00903192,0.00000516707,0.9760064,0.00032292743,0.00002189699,0.00019763657,0.000018147604,0.00006315084,0.014332745],"genre_scores_gemma":[0.98362267,2.6258473e-7,0.010057785,0.000071858005,0.0002849666,0.00010440341,0.000015269106,0.000014938208,0.0058278344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994328,0.0000042841793,0.00012153624,0.00019169277,0.0000740337,0.00017564134],"domain_scores_gemma":[0.9991687,0.000046526457,0.00010089764,0.00058617676,0.000050412225,0.000047304227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073182724,0.00010945939,0.00017055367,0.00003312961,0.00023128946,0.00009491643,0.00028846788,0.000015463158,0.00019729265],"category_scores_gemma":[0.0000077715795,0.00009132988,0.00015215133,0.000016319704,0.000037966496,0.000064337415,0.0000698126,0.00005655029,0.000017206874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006677856,0.0003186559,0.0009907339,0.0000068953977,0.00028524094,2.7934226e-7,0.00015404559,0.14495564,0.00015797024,0.65338814,0.031192658,0.16848299],"study_design_scores_gemma":[0.00020311197,0.00003956743,0.00005148065,0.000010274257,0.000032165306,3.26547e-8,0.000014578769,0.9136334,0.00023951188,0.08512386,0.0005416479,0.000110361565],"about_ca_topic_score_codex":0.00016222335,"about_ca_topic_score_gemma":0.00003789529,"teacher_disagreement_score":0.9745908,"about_ca_system_score_codex":0.000008317638,"about_ca_system_score_gemma":0.000022449623,"threshold_uncertainty_score":0.37243244},"labels":[],"label_agreement":null},{"id":"W2663163049","doi":"10.1186/s40649-016-0034-y","title":"An efficient method for link prediction in weighted multiplex networks","year":2016,"lang":"en","type":"article","venue":"Computational Social Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Spurious relationship; Link (geometry); Similarity (geometry); Set (abstract data type); Data mining; Complex network; Relation (database); Artificial intelligence; Dependency (UML); Multiplex; Variety (cybernetics); Extension (predicate logic); Machine learning; Theoretical computer science","score_opus":0.012343451321665908,"score_gpt":0.30802908418031977,"score_spread":0.29568563285865385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2663163049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00675052,0.000038458966,0.9916988,0.0004058421,0.00020492917,0.0004924578,0.00004307423,0.00014927473,0.00021663855],"genre_scores_gemma":[0.93617976,0.0000010800813,0.05926106,0.00008727804,0.0037402892,0.00018222815,0.00046581533,0.00003322419,0.00004928745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827427,0.00022218614,0.00048938114,0.00042011443,0.00019905069,0.0003949742],"domain_scores_gemma":[0.9987575,0.00061544334,0.00020394176,0.00013940477,0.00019651257,0.00008724075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005627532,0.0002051218,0.00031267796,0.000108503744,0.00029876304,0.000053943066,0.00020732553,0.0001242741,0.00015033523],"category_scores_gemma":[0.0000060624684,0.00017633341,0.00020686093,0.00040189477,0.000060030765,0.000120744204,0.00004963191,0.0001654382,0.0000032971807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045593773,0.00011621026,0.0090297125,0.0000013086833,0.000045727866,2.444564e-7,0.00006559911,0.785221,0.000008824971,0.022284482,0.0022668259,0.18091448],"study_design_scores_gemma":[0.0008728818,0.000043066648,0.025557796,0.000025027379,0.000030829717,1.7285205e-7,0.000018786079,0.93986547,0.0000040377095,0.03222139,0.0011666953,0.00019382329],"about_ca_topic_score_codex":0.00005504763,"about_ca_topic_score_gemma":0.00001819746,"teacher_disagreement_score":0.9324377,"about_ca_system_score_codex":0.000108114575,"about_ca_system_score_gemma":0.00004044395,"threshold_uncertainty_score":0.7190668},"labels":[],"label_agreement":null},{"id":"W2680117742","doi":"10.1109/tsipn.2017.2731053","title":"Inferring Structural Characteristics of Networks With Strong and Weak Ties From Fixed-Choice Surveys","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Estimator; Econometrics; Social network (sociolinguistics); Network topology; Variety (cybernetics); Degree distribution; Computer science; Jackknife resampling; Interpersonal ties; Clustering coefficient; Cluster analysis; Respondent; Statistics; Mathematics; Complex network","score_opus":0.012326787098933752,"score_gpt":0.24892387347589584,"score_spread":0.23659708637696208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2680117742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12754084,0.00015477905,0.8711647,0.000011311488,0.00014957415,0.00022433423,0.00015248335,0.00006617603,0.00053579686],"genre_scores_gemma":[0.9983617,0.00009126802,0.00079213147,0.000024296467,0.0003053437,0.000040975618,0.0003253502,0.000024277808,0.00003464975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984182,0.00008822014,0.00066939875,0.00028967872,0.00026256318,0.0002719055],"domain_scores_gemma":[0.9981141,0.00015338293,0.0010682719,0.0003270919,0.00023007109,0.00010704596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026929093,0.0004203301,0.0006132733,0.00016255892,0.00054182136,0.00070039043,0.00022653953,0.00022217807,0.000117055584],"category_scores_gemma":[0.0000015193988,0.0003704095,0.00010483004,0.000102717255,0.00020538154,0.001504662,0.000028544695,0.0009936914,4.1754436e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009264766,0.000028305558,0.02553557,0.00013336282,0.00035954325,2.3765418e-7,0.0003531824,0.46372297,0.0000028993124,0.00008940422,0.000048507784,0.50963336],"study_design_scores_gemma":[0.00042859121,0.00006822569,0.06461321,0.0009232145,0.00030185253,9.1832686e-7,0.00009106133,0.9324765,0.00009049964,0.0003711601,0.0001597096,0.00047502044],"about_ca_topic_score_codex":0.000965691,"about_ca_topic_score_gemma":0.00006093475,"teacher_disagreement_score":0.8708209,"about_ca_system_score_codex":0.000030482704,"about_ca_system_score_gemma":0.00008529039,"threshold_uncertainty_score":0.9998748},"labels":[],"label_agreement":null},{"id":"W2724711068","doi":"10.1007/s11192-017-2459-y","title":"The scaling relationship between degree centrality of countries and their citation-based performance on Management Information Systems","year":2017,"lang":"en","type":"article","venue":"Scientometrics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Centrality; Degree (music); Citation; Exponent; Scaling; Degree distribution; Power law; Citation impact; China; Computer science; Complex network; Econometrics; Mathematics; Statistics; Political science; Physics; Law; Library science","score_opus":0.0761607441796123,"score_gpt":0.3116552854228882,"score_spread":0.23549454124327587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2724711068","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94996464,0.00004766177,0.042510808,0.00009898615,0.00010452078,0.00026206195,0.00003578077,0.000018087188,0.0069574397],"genre_scores_gemma":[0.99959767,0.000006665988,0.00027045686,0.000006405529,0.0000356973,0.000011408261,0.000022051165,0.0000026241578,0.000047028796],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991317,0.000031913674,0.00025047475,0.00009182462,0.0003486495,0.00014548232],"domain_scores_gemma":[0.99848586,0.00052065816,0.00037339187,0.00039993192,0.00018196822,0.000038157217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013826151,0.00007501111,0.000106142485,0.00048731186,0.000980043,0.00049104507,0.00029712514,0.000016932867,0.0000025048257],"category_scores_gemma":[0.0000707947,0.000051292333,0.000036956506,0.00080912124,0.00014008915,0.00031991277,0.00006192111,0.00006896451,0.0000054683846],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031826698,0.0000059372637,0.9312338,0.00002822988,0.000016445365,7.502476e-9,0.000082350394,0.00057375844,1.8334245e-7,0.040913343,0.0000810004,0.02706176],"study_design_scores_gemma":[0.0001370176,0.000016029053,0.9768681,0.000040316336,0.000018870664,1.1783343e-8,0.00016550823,0.01908134,0.00012579559,0.00087349373,0.0026107272,0.000062818996],"about_ca_topic_score_codex":0.00004920575,"about_ca_topic_score_gemma":0.0000011082379,"teacher_disagreement_score":0.049633007,"about_ca_system_score_codex":0.000036568308,"about_ca_system_score_gemma":0.000018055582,"threshold_uncertainty_score":0.7537797},"labels":[],"label_agreement":null},{"id":"W2724995883","doi":"10.1145/3080574","title":"Mining Community Structures in Multidimensional Networks","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Knowledge Discovery from Data","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Relevance (law); Identification (biology); Set (abstract data type); Data mining; Node (physics); Function (biology); Machine learning; Feature (linguistics); Artificial intelligence; Data science","score_opus":0.06927095770474913,"score_gpt":0.3432355618617533,"score_spread":0.2739646041570042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2724995883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58439726,0.0001259744,0.41122234,0.0001119057,0.0003713024,0.00020277147,0.0017128059,0.00006569144,0.0017899462],"genre_scores_gemma":[0.9904635,0.000011570471,0.0070524705,0.000020327623,0.00022787073,0.000022093553,0.002001588,0.000025647525,0.00017495062],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986789,0.00020392549,0.0003016838,0.00042494945,0.00012368686,0.00026682162],"domain_scores_gemma":[0.9940179,0.00054773415,0.00015087564,0.005182915,0.00003522127,0.000065349835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026990066,0.00023666913,0.00031636062,0.00010023454,0.0010706406,0.0002616713,0.002574512,0.000065351625,0.0004004307],"category_scores_gemma":[0.000024368674,0.00023102756,0.00011218866,0.00010812128,0.00014199749,0.0010223454,0.0003250817,0.0006925988,0.00001709593],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003706893,0.0040926994,0.1904051,0.000022842418,0.001501451,0.000012694685,0.0019756875,0.017712055,0.00079088047,0.0046688616,0.011029308,0.7674177],"study_design_scores_gemma":[0.004907799,0.0001948734,0.61251396,0.0008766637,0.0008468434,0.0000021946034,0.003147614,0.2836301,0.0049823606,0.07225421,0.014103233,0.0025401372],"about_ca_topic_score_codex":0.0063241147,"about_ca_topic_score_gemma":0.006171139,"teacher_disagreement_score":0.7648776,"about_ca_system_score_codex":0.000036620753,"about_ca_system_score_gemma":0.00005237741,"threshold_uncertainty_score":0.9560212},"labels":[],"label_agreement":null},{"id":"W2725519935","doi":"10.1109/cgc.2012.5","title":"Message from the SCA2012 Chairs","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network","score_opus":0.013257060521489176,"score_gpt":0.2517096816405464,"score_spread":0.23845262111905724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725519935","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25346908,0.0004972739,0.07796187,0.0010628242,0.00016506089,0.00020479395,0.000029345534,0.00024643695,0.6663633],"genre_scores_gemma":[0.99575675,0.0000011620562,0.0010685456,0.00014757327,0.0010825348,0.000015737005,0.000024836718,0.000008359685,0.0018945236],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951005,0.000033841374,0.000092907445,0.00008073361,0.000083702565,0.00019876176],"domain_scores_gemma":[0.9995162,0.00008872132,0.00003417172,0.000299814,0.0000121184,0.000048997714],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013203335,0.00007681428,0.000089862275,0.000009240649,0.000086671105,0.000026463726,0.00017866684,0.000011923612,0.0106834],"category_scores_gemma":[9.271517e-7,0.00004574268,0.00009200967,0.000081012935,0.000024235702,0.00007762744,0.00008343268,0.000074363474,0.00017312718],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018726072,0.00008636729,0.5956994,2.903658e-7,0.00012066811,4.772113e-8,0.00027190614,0.0000028672266,0.00025552002,0.21858928,0.14992234,0.03504941],"study_design_scores_gemma":[0.00028272325,0.0000120928125,0.17614388,0.0000150331225,0.00019779323,2.2354233e-7,0.001110453,0.0010838485,0.009292761,0.06059148,0.75076926,0.0005004284],"about_ca_topic_score_codex":0.0011238136,"about_ca_topic_score_gemma":0.000020825342,"teacher_disagreement_score":0.74228764,"about_ca_system_score_codex":0.0000058928367,"about_ca_system_score_gemma":0.0000041860235,"threshold_uncertainty_score":0.99022096},"labels":[],"label_agreement":null},{"id":"W2729475049","doi":"10.14569/ijacsa.2017.080638","title":"Identifying Top-k Most Influential Nodes by using the Topological Diffusion Models in the Complex Networks","year":2017,"lang":"en","type":"article","venue":"International Journal of Advanced Computer Science and Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Centrality; Betweenness centrality; Computer science; Closeness; Heat kernel; TOPSIS; Network science; Identification (biology); Complex network; Graph; Katz centrality; Social network (sociolinguistics); Topology (electrical circuits); Data mining; Theoretical computer science; Mathematics; Operations research","score_opus":0.03366455175935686,"score_gpt":0.355277146131457,"score_spread":0.32161259437210016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2729475049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21933858,0.00003951349,0.7794844,0.0008214316,0.00007018724,0.000091302245,0.0000024503663,0.0000032418154,0.00014892129],"genre_scores_gemma":[0.9893325,0.000025471265,0.009918439,0.00024244754,0.0004631071,0.000010822199,0.000002200237,0.000002445088,0.000002553379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990571,0.00002579487,0.00026251085,0.00014222889,0.00038798567,0.0001243366],"domain_scores_gemma":[0.99896926,0.000072022405,0.0003592812,0.0002444351,0.0003226516,0.000032325384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045949343,0.000073303774,0.00010126464,0.00006853578,0.0007108264,0.0006196297,0.0016382417,0.000012204385,0.000006794432],"category_scores_gemma":[0.000004765007,0.000044228396,0.000048516515,0.00015004953,0.000382131,0.0005913006,0.00033403773,0.00016712515,1.912813e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021673975,0.00025023965,0.017196732,0.0000013612304,0.000061544146,0.000003420169,0.00056809036,0.14873399,0.008988966,0.12963387,0.0004100185,0.6941301],"study_design_scores_gemma":[0.0003593788,0.000021645214,0.014561177,0.000037073794,0.000018916035,0.000024702375,0.0002718939,0.9037029,0.00023812476,0.07794794,0.002696286,0.00011995703],"about_ca_topic_score_codex":0.00006394449,"about_ca_topic_score_gemma":0.0000041032504,"teacher_disagreement_score":0.76999396,"about_ca_system_score_codex":0.000030169465,"about_ca_system_score_gemma":0.000034006025,"threshold_uncertainty_score":0.59751034},"labels":[],"label_agreement":null},{"id":"W2733500323","doi":"","title":"A conceptual basis for coalition formation in doctoral education: Core concepts and theoretical frameworks","year":2015,"lang":"en","type":"article","venue":"Canadian Society for the Study of Higher Education","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Core (optical fiber); Sociology; Social exchange theory; Balance theory; Balance (ability); Social network analysis; Conceptual framework; Epistemology; Knowledge management; Engineering ethics; Psychology; Computer science; Social science; Engineering; Social capital","score_opus":0.03830446846959175,"score_gpt":0.3465607725609438,"score_spread":0.3082563040913521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2733500323","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9895272,0.00054507446,0.003269379,0.002347689,0.0005005514,0.0027461692,0.00008767662,0.000017582403,0.000958643],"genre_scores_gemma":[0.99636567,0.0000014989337,0.0014830909,0.00033786055,0.00044944085,0.0009611786,0.00017665372,0.000011288546,0.00021330341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99932396,0.000031301563,0.00022947766,0.00015427689,0.00009327639,0.00016768361],"domain_scores_gemma":[0.99915457,0.00016467283,0.00011499051,0.00017860741,0.0002627512,0.00012439936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024476968,0.000102708014,0.00015644592,0.00004314062,0.00015192169,0.00003685023,0.00012267455,0.00006932349,0.00009796927],"category_scores_gemma":[0.000011729164,0.00009007346,0.00011316337,0.00015938292,0.00017995233,0.00011773165,0.000013126112,0.00011659981,4.5964444e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017551034,0.0003267103,0.011760091,0.000011887992,0.00009217387,9.129971e-9,0.018291898,0.000023722629,0.000006309876,0.8742134,0.08640262,0.008853655],"study_design_scores_gemma":[0.0027038043,0.0008118222,0.040634498,0.00014973218,0.0007092447,0.0000013910152,0.47924533,0.003874489,0.00010477463,0.3048327,0.16627322,0.00065899926],"about_ca_topic_score_codex":0.011023482,"about_ca_topic_score_gemma":0.0035997168,"teacher_disagreement_score":0.5693807,"about_ca_system_score_codex":0.00019365047,"about_ca_system_score_gemma":0.0005862985,"threshold_uncertainty_score":0.9955622},"labels":[],"label_agreement":null},{"id":"W2734413399","doi":"10.5539/cis.v10n3p10","title":"A Successful Advertising Strategy over Twitter","year":2017,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Popularity; Computer science; Advertising; Social media; Internet privacy; Advertising campaign; Media campaign; Computer security; World Wide Web; Business; Political science","score_opus":0.014759281090623612,"score_gpt":0.2985201161513865,"score_spread":0.2837608350607629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734413399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5800034,0.0000035549624,0.37909213,0.000078710495,0.000084411484,0.00006275841,0.0000013715464,0.00003016069,0.04064352],"genre_scores_gemma":[0.9975845,0.0000016296841,0.0021190646,0.00016386047,0.00010637285,0.0000022825186,0.0000027406059,0.0000011686989,0.00001834362],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994603,0.000004446282,0.00014635539,0.00009396531,0.00015934175,0.00013559048],"domain_scores_gemma":[0.9994399,0.000008112973,0.00012888113,0.00028306962,0.00008629079,0.000053744232],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00019091154,0.00006183342,0.000073983276,0.00009002916,0.00064291427,0.0012596498,0.00035820075,0.000008477049,0.00008060255],"category_scores_gemma":[0.0000020432306,0.00005239821,0.000023980538,0.00009556565,0.00020631138,0.0067296354,0.00024653194,0.000049611404,0.000014572686],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002948823,0.000012604537,0.19660498,0.0000068250297,0.000010617378,2.0314069e-7,0.0007027081,0.00024630304,0.00010420278,0.050925404,0.0025391,0.7488441],"study_design_scores_gemma":[0.00024484764,0.00002751604,0.6165635,0.000027876256,0.0000067375418,0.0000013402549,0.000059364673,0.3641207,0.0006617062,0.0043128766,0.013782793,0.00019075471],"about_ca_topic_score_codex":0.00008416625,"about_ca_topic_score_gemma":5.9234947e-7,"teacher_disagreement_score":0.74865335,"about_ca_system_score_codex":0.000008216464,"about_ca_system_score_gemma":0.000031129446,"threshold_uncertainty_score":0.99977714},"labels":[],"label_agreement":null},{"id":"W2735220323","doi":"10.23919/acc.2017.7962979","title":"A Polya urn-based model for epidemics on networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Martingale (probability theory); Stochastic process; Mathematics; Invariant (physics); Convergence (economics); Node (physics); Sampling scheme; Range (aeronautics); Applied mathematics; Computer science; Statistical physics; Statistics; Physics; Engineering","score_opus":0.04610476870518304,"score_gpt":0.33750439107135927,"score_spread":0.2913996223661762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735220323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024012383,0.0000065870404,0.9727037,0.00054118,0.00003229581,0.00021169316,0.000010925876,0.00007962572,0.02401279],"genre_scores_gemma":[0.97811925,6.374292e-7,0.019303318,0.0003848323,0.00039716432,0.00008470263,0.000031524432,0.000020748967,0.0016578123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926233,0.000012060249,0.00017559291,0.00022346864,0.0000716797,0.00025489484],"domain_scores_gemma":[0.9988413,0.00011801596,0.00016078848,0.00076606614,0.0000476754,0.00006614179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018724364,0.0001353495,0.00021079244,0.000034470697,0.00036902938,0.00010337339,0.00037313014,0.00003645599,0.00010553462],"category_scores_gemma":[0.00000919732,0.00011784866,0.00023632935,0.000025374542,0.000036850663,0.000058339105,0.00005145738,0.000104476814,0.0000056211197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052049934,0.00013375413,0.024727311,0.0000031930854,0.00009323113,1.8485335e-7,0.000010308815,0.59047955,0.000023969844,0.2846932,0.05352565,0.046257563],"study_design_scores_gemma":[0.00023985522,0.000024888957,0.00023188171,0.000011892016,0.000031207583,1.3054437e-8,0.0000029220025,0.96532714,0.0002174415,0.0322231,0.0015519242,0.00013770121],"about_ca_topic_score_codex":0.00012621626,"about_ca_topic_score_gemma":0.00004566961,"teacher_disagreement_score":0.975718,"about_ca_system_score_codex":0.000015626076,"about_ca_system_score_gemma":0.000028261242,"threshold_uncertainty_score":0.48057288},"labels":[],"label_agreement":null},{"id":"W2735320078","doi":"10.1186/s40649-017-0041-7","title":"Computation and analysis of temporal betweenness in a knowledge mobilization network","year":2017,"lang":"en","type":"article","venue":"Computational Social Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Betweenness centrality; Centrality; Computer science; Network science; Dynamic network analysis; Social network analysis; Network analysis; Artificial intelligence; Theoretical computer science; Measure (data warehouse); Network theory; Complex network; Data mining; Mathematics; Computer network; Statistics","score_opus":0.019679553333603075,"score_gpt":0.3261911815532441,"score_spread":0.30651162821964106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735320078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2342261,0.00010547444,0.7643503,0.000056566274,0.00005126726,0.00015416197,0.0000117514655,0.000024184488,0.0010202278],"genre_scores_gemma":[0.99459267,0.0000025180696,0.004243615,0.000010975266,0.00047200185,0.00001845994,0.0006343359,0.0000125770075,0.000012873354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988046,0.00012164563,0.00046286132,0.0002613873,0.00014645484,0.00020301959],"domain_scores_gemma":[0.9989133,0.00022340016,0.0005119158,0.00013290846,0.00017597778,0.00004251026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039049707,0.00014566477,0.00048668063,0.00018841153,0.000490958,0.00010075447,0.000184477,0.00006678227,0.000033241184],"category_scores_gemma":[0.0000070483497,0.00016602351,0.00016577213,0.0007181885,0.00016703694,0.00018975342,0.00014512838,0.00012985902,5.4530614e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066404646,0.000045895238,0.46385506,0.0000027504211,0.00025110316,1.741831e-7,0.00013811071,0.50930995,2.62492e-7,0.010702268,0.00019567534,0.015492137],"study_design_scores_gemma":[0.00015989038,0.0000066919883,0.44897613,0.000011343542,0.00016557261,2.5641326e-8,0.000023896313,0.52942264,2.781172e-7,0.02112722,0.000023571945,0.00008275216],"about_ca_topic_score_codex":0.00029601503,"about_ca_topic_score_gemma":0.00023880835,"teacher_disagreement_score":0.76036656,"about_ca_system_score_codex":0.000031396143,"about_ca_system_score_gemma":0.0000340394,"threshold_uncertainty_score":0.67702425},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.019707214881045446,"score_gpt":0.3361135036015257,"score_spread":0.31640628872048027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735861106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99643624,0.000037221245,0.0011515473,0.000032712363,0.00002278419,0.00013070827,9.93271e-7,0.000003569039,0.0021842308],"genre_scores_gemma":[0.9995084,3.751838e-7,0.0004306319,0.0000032134465,0.000028379918,0.000009787222,8.2541675e-7,0.0000017601944,0.000016675218],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994918,0.000030405394,0.000105699815,0.000108484055,0.00016010126,0.00010349103],"domain_scores_gemma":[0.99936044,0.00007700106,0.00015515529,0.0003584268,0.000032106524,0.00001685074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036146163,0.00004844583,0.00010148758,0.000038954615,0.00021706944,0.00003403671,0.0003554621,0.000007127975,0.000033553628],"category_scores_gemma":[0.00003018111,0.000031612613,0.00006318158,0.00018426341,0.00024251945,0.00014830004,0.00008113947,0.00004561185,5.7959807e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017540318,0.00035707778,0.57740986,0.0000057840334,0.00003905061,2.3568269e-7,0.00068560085,0.011012684,0.097628504,0.30592042,0.00018265982,0.0067405696],"study_design_scores_gemma":[0.00008354617,0.00004420577,0.71111757,0.000043685926,0.000009876596,2.803026e-8,0.000028963042,0.027697366,0.22019228,0.040723488,0.0000061592623,0.000052865696],"about_ca_topic_score_codex":0.0005817565,"about_ca_topic_score_gemma":0.000010209729,"teacher_disagreement_score":0.26519695,"about_ca_system_score_codex":0.000020572625,"about_ca_system_score_gemma":0.000025865456,"threshold_uncertainty_score":0.16695446},"labels":[],"label_agreement":null},{"id":"W2739877106","doi":"10.1145/3077136.3084141","title":"Event Detection on Curated Tweet Streams","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Event (particle physics); STREAMS; Computer network","score_opus":0.01563179368617053,"score_gpt":0.3044668488642134,"score_spread":0.28883505517804287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739877106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6816791,0.0000024689946,0.112055644,0.00018860142,0.00009669557,0.00015275224,0.000004563064,0.00016483791,0.2056553],"genre_scores_gemma":[0.99791443,4.996254e-7,0.0001582636,0.000014736998,0.00021941148,0.000014046234,0.000009760135,0.000007191627,0.0016616762],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955785,0.000014464145,0.00009804679,0.00014107296,0.00007674206,0.00011181557],"domain_scores_gemma":[0.99936235,0.000011811034,0.00009598456,0.00046666124,0.000029536706,0.000033639823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005805554,0.00008000989,0.00009429049,0.000027996766,0.00026598916,0.000098968165,0.00016458947,0.000014986406,0.00090184395],"category_scores_gemma":[0.0000023152722,0.000066382745,0.00008094311,0.000030718962,0.00001803521,0.000076299286,0.00004678759,0.00006998475,0.000088226094],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011546442,0.000121894154,0.02732875,9.659707e-7,0.000088969755,5.8078405e-7,0.0000151717,0.000089548914,0.0014391105,0.01892312,0.0032615343,0.9487188],"study_design_scores_gemma":[0.001295335,0.0005114002,0.13486345,0.000089528025,0.00018983903,7.2424933e-7,0.00019875707,0.091685645,0.6047335,0.09681079,0.06851615,0.0011048699],"about_ca_topic_score_codex":0.0008618802,"about_ca_topic_score_gemma":0.00009273059,"teacher_disagreement_score":0.94761395,"about_ca_system_score_codex":0.000014617034,"about_ca_system_score_gemma":0.0000060638413,"threshold_uncertainty_score":0.9874559},"labels":[],"label_agreement":null},{"id":"W2740417586","doi":"10.18653/v1/w17-2702","title":"Detecting Changes in Twitter Streams using Temporal Clusters of Hashtags","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Cluster analysis; Event (particle physics); Social media; Change detection; Conversation; Baseline (sea); Point (geometry); Data stream mining; Data mining; Artificial intelligence; World Wide Web","score_opus":0.049616414747074906,"score_gpt":0.32585261251759806,"score_spread":0.27623619777052316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740417586","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9799436,0.000004614883,0.013560796,0.00008961301,0.000023562574,0.000083653744,0.0000013016669,0.000018588009,0.006274321],"genre_scores_gemma":[0.99427533,2.7157623e-7,0.0054287026,0.000015383044,0.00012198115,0.000004616115,0.0000026013176,0.000009513423,0.00014160713],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994405,0.000019336045,0.00016242504,0.00014376295,0.000075649325,0.00015833089],"domain_scores_gemma":[0.9993553,0.000019288178,0.00020716086,0.0003691143,0.000025263567,0.000023836472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013961698,0.00009085703,0.00019214311,0.00008043715,0.00010241453,0.000051822164,0.00020752897,0.000020021866,0.00023026354],"category_scores_gemma":[0.000003083194,0.00008239552,0.00006533262,0.000053185086,0.000042816217,0.000091350004,0.00014553602,0.00007662182,0.0000012300494],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054839925,0.000033555447,0.9484296,0.000005738887,0.00003419532,7.9569276e-7,0.00017623088,0.000113917755,0.0025546378,0.00016979645,0.000083171355,0.04839288],"study_design_scores_gemma":[0.002502045,0.00022627097,0.12651514,0.00067689066,0.00022833483,0.00000218094,0.004825969,0.5614757,0.2857007,0.014399855,0.0019281425,0.0015187796],"about_ca_topic_score_codex":0.00731561,"about_ca_topic_score_gemma":0.0015933788,"teacher_disagreement_score":0.82191443,"about_ca_system_score_codex":0.000015432768,"about_ca_system_score_gemma":0.0000111294585,"threshold_uncertainty_score":0.99929476},"labels":[],"label_agreement":null},{"id":"W2741500259","doi":"10.1016/j.tcs.2018.05.035","title":"Bounds on the burning numbers of spiders and path-forests","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Graph; Mathematics; Path (computing); Upper and lower bounds; Discrete mathematics; Computer science","score_opus":0.011822099500608281,"score_gpt":0.2734107971776106,"score_spread":0.26158869767700227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741500259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58068216,0.000011720614,0.4068172,0.00035481452,0.00016765567,0.00018779279,0.000005019212,0.000042825417,0.011730816],"genre_scores_gemma":[0.98968446,0.0000014013037,0.009841488,0.00008881794,0.00035570888,0.000009769655,0.0000029986957,0.000010212862,0.00000516855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983099,0.000112072354,0.00027086085,0.00054201623,0.00044543625,0.00031971224],"domain_scores_gemma":[0.99846554,0.00033208856,0.00018520323,0.0007690545,0.00014415244,0.0001039911],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013161171,0.00021416911,0.00030582523,0.00009483346,0.0002789834,0.00023646436,0.0010921538,0.000044891898,0.00021146837],"category_scores_gemma":[0.000019318548,0.00014066054,0.00012370327,0.00030305787,0.00595296,0.000046497,0.0018971812,0.00040645004,0.000007422814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055690966,0.000025234429,0.003066411,0.0000066592106,0.000021799447,4.3243136e-7,0.00024121194,0.00017319959,0.00001883165,0.9888082,0.00031268652,0.0073197335],"study_design_scores_gemma":[0.000049083083,0.00009650466,0.0023922487,0.00019804997,0.00002998553,6.566579e-7,0.000017235614,0.17405385,0.0009587323,0.8219453,0.00007037617,0.00018800418],"about_ca_topic_score_codex":0.00003907526,"about_ca_topic_score_gemma":0.0000010892122,"teacher_disagreement_score":0.40900227,"about_ca_system_score_codex":0.000023375655,"about_ca_system_score_gemma":0.00008064929,"threshold_uncertainty_score":0.99675226},"labels":[],"label_agreement":null},{"id":"W2746604562","doi":"10.1142/s0217984917502529","title":"Robustness of complex networks with both unidirectional and bidirectional links against cascading failures","year":2017,"lang":"en","type":"article","venue":"Modern Physics Letters B","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Robustness (evolution); Cascading failure; Interdependent networks; Computer science; Betweenness centrality; Complex network; Distributed computing; Topology (electrical circuits); Computer network; Centrality; Mathematics; Electric power system","score_opus":0.018286395493305078,"score_gpt":0.2457411440982308,"score_spread":0.22745474860492573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746604562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36060783,0.000019177158,0.6374679,0.00040971304,0.000048201207,0.00010249196,0.000013611692,0.000048930633,0.0012821289],"genre_scores_gemma":[0.9928008,0.0000035926298,0.0059282356,0.000110236324,0.0009841191,0.000022212003,0.00006407233,0.000033503427,0.000053270756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895626,0.000039806648,0.0002016734,0.0003323803,0.00021979572,0.00025010572],"domain_scores_gemma":[0.9990278,0.00006059514,0.00032261538,0.0004449147,0.0000796477,0.00006446638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100652185,0.00022305788,0.00033361203,0.00005223808,0.0005696857,0.0001496871,0.00025476213,0.000048279282,0.00002240019],"category_scores_gemma":[0.0000013765784,0.00020914877,0.00011591397,0.00008562353,0.00026973846,0.00023679329,0.00013353818,0.0003114326,3.6780008e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064943095,0.00017848906,0.14090593,0.000024331322,0.0007548521,0.000003291338,0.00014869358,0.762797,0.010540807,0.0070588123,0.004093215,0.07342965],"study_design_scores_gemma":[0.000549534,0.000027166581,0.022084631,0.000090821944,0.00010971023,0.0000022248837,0.000020317219,0.97274303,0.0014638421,0.0015930077,0.00088670827,0.00042898403],"about_ca_topic_score_codex":0.00033942919,"about_ca_topic_score_gemma":0.000030948933,"teacher_disagreement_score":0.6321929,"about_ca_system_score_codex":0.00002534967,"about_ca_system_score_gemma":0.000021632379,"threshold_uncertainty_score":0.8528839},"labels":[],"label_agreement":null},{"id":"W2750703072","doi":"","title":"Algorithms for network modularity maximization","year":2010,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Modularity (biology); Computer science; Maximization; Theoretical computer science; Mathematical optimization; Mathematics","score_opus":0.01652003691823643,"score_gpt":0.24703300407337347,"score_spread":0.23051296715513706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750703072","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00856238,0.0007473015,0.9637527,0.010392037,0.00060606404,0.0014004263,0.00024244151,0.0002983884,0.013998245],"genre_scores_gemma":[0.30852398,0.00031607298,0.66175956,0.000089900845,0.0007133222,0.000576001,0.0055449926,0.00014405424,0.022332096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922257,0.0041502267,0.0010259158,0.0013372441,0.00044050592,0.0008203719],"domain_scores_gemma":[0.9897982,0.0018464667,0.001131973,0.0030933402,0.0038232529,0.00030680103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0070476555,0.00067101506,0.00084302964,0.00015008227,0.00097171945,0.0007264562,0.0017245577,0.0006087658,0.00054447586],"category_scores_gemma":[0.00037177032,0.00081088836,0.0008224261,0.0006322978,0.0003731301,0.00020293903,0.0015788814,0.0014169681,0.000061467705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016077052,0.0008642958,0.0050512366,0.00011254053,0.00036314625,8.326713e-7,0.0013085403,0.0052049393,0.0006955921,0.762521,0.0059079523,0.2179538],"study_design_scores_gemma":[0.0005897216,6.5782984e-7,0.0025021946,0.001121287,0.00032964218,0.0000021829546,0.000035442,0.584361,0.008888136,0.16260464,0.23871604,0.00084902183],"about_ca_topic_score_codex":0.002527751,"about_ca_topic_score_gemma":0.002409935,"teacher_disagreement_score":0.5999164,"about_ca_system_score_codex":0.00017678375,"about_ca_system_score_gemma":0.00039627223,"threshold_uncertainty_score":0.9994342},"labels":[],"label_agreement":null},{"id":"W2751155896","doi":"10.1016/j.autcon.2017.08.026","title":"Project collective mind: Unlocking project discussion networks","year":2017,"lang":"en","type":"article","venue":"Automation in Construction","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Concordia University","funders":"","keywords":"Computer science; Social network analysis; Relevance (law); Centrality; PageRank; Data science; Semantics (computer science); Social network (sociolinguistics); Context (archaeology); Social media; Set (abstract data type); Link analysis; Information exchange; World Wide Web; Information retrieval","score_opus":0.02129116276027732,"score_gpt":0.31751783080101614,"score_spread":0.2962266680407388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751155896","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6701253,0.000018462253,0.28329435,0.0003913809,0.000803708,0.0018655033,0.000014825773,0.0003314408,0.043155],"genre_scores_gemma":[0.9918339,0.000002052277,0.0074274978,0.0000042282204,0.00029987408,0.00014026067,0.000043113017,0.000013189914,0.00023585405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989208,0.00010330925,0.00032508848,0.00029735558,0.00014882137,0.00020465061],"domain_scores_gemma":[0.99900633,0.000040035706,0.0004536939,0.00040370782,0.00007699696,0.00001920681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024575493,0.0001496304,0.00020734515,0.00025528797,0.00057898206,0.00024736032,0.00018796352,0.00006219641,0.00008883776],"category_scores_gemma":[0.000020764805,0.000120361474,0.000087748944,0.00029447928,0.00010464726,0.00047270054,0.00008648145,0.00017866217,0.000004794771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026089798,0.00006603363,0.37029925,0.000007677957,0.000068595284,0.000001167997,0.00063146075,0.0010930129,0.00014227317,0.0068657324,0.0014308121,0.6193679],"study_design_scores_gemma":[0.0012558928,0.00007398851,0.14551723,0.00033583387,0.000092087685,0.000011025766,0.0015848451,0.8215248,0.0018459215,0.023682412,0.0034479583,0.0006280039],"about_ca_topic_score_codex":0.0007565074,"about_ca_topic_score_gemma":0.00012361316,"teacher_disagreement_score":0.82043177,"about_ca_system_score_codex":0.00014114399,"about_ca_system_score_gemma":0.00014351957,"threshold_uncertainty_score":0.49081984},"labels":[],"label_agreement":null},{"id":"W2751524443","doi":"10.2139/ssrn.3001978","title":"The Power of Social Networks in Predicting Non-Contractual Customer Activity: Evidence from Venmo","year":2017,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Business; Power (physics)","score_opus":0.009951544556617087,"score_gpt":0.2817382167831465,"score_spread":0.2717866722265294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751524443","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9516046,0.00070311176,0.045625843,0.00037965065,0.00013589667,0.000120497105,0.0000026426412,0.000011628054,0.0014161185],"genre_scores_gemma":[0.9985941,0.00026384313,0.00004002757,0.000004686182,0.0009530786,0.000008628761,0.0000011836,0.000017392877,0.00011705723],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9978995,0.00011234042,0.0003208541,0.00017865848,0.00024331575,0.0012453782],"domain_scores_gemma":[0.9985784,0.00027646468,0.0006851205,0.00034308544,0.00007822385,0.000038649163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016922008,0.00015039087,0.00028846387,0.00004894751,0.000899042,0.00018879218,0.0007250403,0.00005674064,0.000060472314],"category_scores_gemma":[0.000036576428,0.000117096235,0.00021613293,0.00008550113,0.000098464356,0.00036973102,0.00013381314,0.0019314322,0.0000033655278],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032915868,0.00015741707,0.48216897,0.0000016953745,0.0010160193,0.0000034059046,0.0010155782,0.00042264338,0.0011208057,0.02068269,0.00044613765,0.4926355],"study_design_scores_gemma":[0.0023244882,0.00039724135,0.7338941,0.00043555794,0.00045727124,0.000013764869,0.0037479906,0.035656273,0.0015495315,0.21857914,0.0020397154,0.000904888],"about_ca_topic_score_codex":0.0013508851,"about_ca_topic_score_gemma":0.001521709,"teacher_disagreement_score":0.4917306,"about_ca_system_score_codex":0.00021319812,"about_ca_system_score_gemma":0.0005400964,"threshold_uncertainty_score":0.83912194},"labels":[],"label_agreement":null},{"id":"W2752670111","doi":"10.1093/comnet/cnx039","title":"Two-mode networks exhibiting data loss","year":2017,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalization; Connection (principal bundle); Construct (python library); Matrix (chemical analysis); Computer science; Combinatorics; Matrix analysis; Mode (computer interface); Tournament; Mathematics; Discrete mathematics; Eigenvalues and eigenvectors; Physics","score_opus":0.0569844298999803,"score_gpt":0.3639085522797237,"score_spread":0.30692412237974337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752670111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026181806,0.00055618957,0.95342183,0.0005026803,0.00064566085,0.00018326797,0.000022578284,0.000057951987,0.018428061],"genre_scores_gemma":[0.9784394,0.00005596786,0.011831391,0.00012316505,0.009285593,0.000002816313,0.000095760006,0.000053268282,0.000112619986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972434,0.00015961095,0.0011255026,0.00038550553,0.00044363024,0.0006423315],"domain_scores_gemma":[0.99424875,0.0002441893,0.0024911608,0.0023903658,0.0003624832,0.0002630755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012744364,0.00035130876,0.0008408808,0.00012560702,0.0008967034,0.0006884276,0.003437891,0.000077600525,0.00064382056],"category_scores_gemma":[0.000033540604,0.0003181495,0.00039297415,0.0001570591,0.00022688831,0.0009011755,0.0013196664,0.000947605,0.0000065841705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016724422,0.0003334319,0.23173521,0.000010216699,0.0011745444,0.00012393178,0.00006629215,0.40874752,0.00008664962,0.019646605,0.13142493,0.20648341],"study_design_scores_gemma":[0.0010752963,0.000068635614,0.012317208,0.00019950418,0.0002619451,0.000051831485,0.000054718326,0.9519457,0.000018050343,0.007731598,0.025850598,0.00042486435],"about_ca_topic_score_codex":0.00022313479,"about_ca_topic_score_gemma":0.00006464886,"teacher_disagreement_score":0.95225763,"about_ca_system_score_codex":0.000045666588,"about_ca_system_score_gemma":0.000074843105,"threshold_uncertainty_score":0.99992704},"labels":[],"label_agreement":null},{"id":"W2752723247","doi":"","title":"SOCIAL NETWORK ANALYSIS OF B2B NETWORKS","year":2017,"lang":"en","type":"article","venue":"Universiti Utara Malaysia Institutional Repository (Universiti Utara Malaysia)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Universiti Kuala Lumpur","keywords":"Computer science; Information overload; Social network analysis; Volume (thermodynamics); Social network (sociolinguistics); Data science; Work (physics); Community structure; Statistical analysis; Social media; World Wide Web; Mathematics","score_opus":0.012376492170148372,"score_gpt":0.2427755826740168,"score_spread":0.23039909050386842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752723247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90734345,0.000066855915,0.038024366,0.00023459508,0.00031502143,0.00029448344,0.00009662305,0.00015640548,0.05346818],"genre_scores_gemma":[0.99563825,0.00001136468,0.0012909198,0.00004822655,0.0011872606,0.000006877906,0.00043908547,0.000036345293,0.0013416935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996647,0.00019858617,0.0006201989,0.000942334,0.00073399674,0.00085790514],"domain_scores_gemma":[0.99648505,0.00013404505,0.0012271288,0.0013278378,0.0005207855,0.0003051418],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003297233,0.0005941863,0.0011677928,0.0008770944,0.0025516872,0.00026943276,0.0017532076,0.00026820975,0.0009194181],"category_scores_gemma":[0.000008201914,0.0007452491,0.0014837806,0.0014498511,0.0013013169,0.0015093725,0.00085354596,0.00057912996,0.000024710971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015726515,0.00016432554,0.06707209,0.000011415239,0.0039043792,0.00024268184,0.0001489573,0.823548,0.00021722804,0.10269064,0.0011505187,0.00069247966],"study_design_scores_gemma":[0.00083222403,0.00007368651,0.005789615,0.00006849142,0.0043708025,0.000014341008,0.00059083605,0.9825857,0.0001267403,0.0013090428,0.0035160207,0.0007224867],"about_ca_topic_score_codex":0.00096104306,"about_ca_topic_score_gemma":0.0000014877743,"teacher_disagreement_score":0.1590377,"about_ca_system_score_codex":0.00042376254,"about_ca_system_score_gemma":0.00029062826,"threshold_uncertainty_score":0.99999386},"labels":[],"label_agreement":null},{"id":"W2752963666","doi":"10.1007/978-3-319-67810-8_5","title":"High Degree Vertices and Spread of Infections in Spatially Modelled Social Networks","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Degree (music); Conjecture; Preferential attachment; Social network (sociolinguistics); Degree distribution; Network structure","score_opus":0.02074343870545918,"score_gpt":0.26289645666923916,"score_spread":0.24215301796377997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752963666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036406391,0.00009863535,0.9928297,0.000076529606,0.00017210675,0.00019442545,0.000005322766,0.000022714947,0.0029599434],"genre_scores_gemma":[0.9816661,0.000014464949,0.017690685,0.000025799864,0.0005306679,0.000006789691,0.000008840425,0.000015707272,0.000040983152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986148,0.000021873806,0.00034585813,0.0005093201,0.00023948163,0.00026868077],"domain_scores_gemma":[0.99891514,0.00018453693,0.00032463734,0.0004293657,0.000102458864,0.000043882945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028575765,0.00025965887,0.0005120664,0.00033820214,0.00021362618,0.00013569965,0.0005978188,0.00013311575,0.000039374612],"category_scores_gemma":[0.000007710506,0.0002504641,0.00010064619,0.00012251611,0.0005496839,0.0001551116,0.00047778685,0.00045042599,7.9468543e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010848582,0.00005272163,0.006748907,0.000014156947,0.000042405183,0.0000035821556,0.0002901834,0.23845212,0.00002657503,0.022429328,0.000012431362,0.7319167],"study_design_scores_gemma":[0.0002550993,0.00006744961,0.0015569339,0.0002252864,0.000038281076,9.534073e-7,1.0123952e-7,0.72791606,0.00009089917,0.26939175,0.00013122073,0.00032595702],"about_ca_topic_score_codex":0.0011065548,"about_ca_topic_score_gemma":0.0015534201,"teacher_disagreement_score":0.97802544,"about_ca_system_score_codex":0.000050468698,"about_ca_system_score_gemma":0.00012567922,"threshold_uncertainty_score":0.99999475},"labels":[],"label_agreement":null},{"id":"W2753506939","doi":"10.1017/s0963548319000385","title":"The string of diamonds is nearly tight for rumour spreading","year":2019,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Upper and lower bounds; Bounded function; String (physics); Graph; Asynchronous communication","score_opus":0.011024349043444879,"score_gpt":0.25558355549403144,"score_spread":0.24455920645058657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753506939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9430187,0.000106124775,0.0524928,0.00010426587,0.00029249696,0.0008440256,0.0000070734245,0.0000862848,0.0030482542],"genre_scores_gemma":[0.9974674,0.0000010328761,0.002199403,0.000009529698,0.00010740413,0.000016334856,0.000007876872,0.000022387572,0.00016865243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983388,0.000080927115,0.0005369072,0.00037700543,0.00022401282,0.00044234926],"domain_scores_gemma":[0.99774617,0.0008728424,0.0003523297,0.0006726323,0.00029680054,0.000059240905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012430188,0.00018921561,0.00036836753,0.0000509072,0.00037646032,0.00010440054,0.0005399811,0.000044501663,0.000025893512],"category_scores_gemma":[0.000036973383,0.0001587537,0.0002883821,0.0004313582,0.00006551297,0.00009253222,0.00036150916,0.00021543032,0.0000056807066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009829481,0.00011859902,0.36346248,0.00006751026,0.000092302325,4.736388e-8,0.0002943974,0.0002791369,0.00028665815,0.6177411,0.00039656923,0.017251356],"study_design_scores_gemma":[0.0006478353,0.00015286848,0.0076282322,0.00010605733,0.00006671052,2.3844953e-7,0.00015573442,0.097519614,0.010735902,0.87835526,0.0042668795,0.00036468395],"about_ca_topic_score_codex":0.00007523788,"about_ca_topic_score_gemma":0.0000011915699,"teacher_disagreement_score":0.35583425,"about_ca_system_score_codex":0.000082077604,"about_ca_system_score_gemma":0.000060078408,"threshold_uncertainty_score":0.6473788},"labels":[],"label_agreement":null},{"id":"W2754393389","doi":"10.1109/cits.2017.8035342","title":"Extended core-based community detection for directed networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Compact space; Node (physics); Computer science; Core (optical fiber); Similarity (geometry); Directed graph; Focus (optics); Graph; Degree (music); Data mining; Theoretical computer science; Topology (electrical circuits); Algorithm; Mathematics; Artificial intelligence; Engineering; Telecommunications; Combinatorics","score_opus":0.04130429408263275,"score_gpt":0.32023347604234786,"score_spread":0.2789291819597151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754393389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06625297,0.0000055738606,0.9203071,0.000041576488,0.0000752139,0.00028687128,0.0000065271756,0.00029859904,0.012725574],"genre_scores_gemma":[0.99428797,3.398937e-7,0.0048929644,0.000037406815,0.00024562364,0.000117449774,0.000063089865,0.000015998427,0.0003391735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940455,0.000057733138,0.00015256711,0.00012901053,0.00006158275,0.00019456017],"domain_scores_gemma":[0.998638,0.00015240557,0.0001734452,0.0008764666,0.00011045373,0.00004922985],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00026925033,0.000119763165,0.0001816353,0.000035011417,0.0013159104,0.00013988238,0.00036813004,0.00003546595,0.00020272817],"category_scores_gemma":[0.0000151098175,0.00011087124,0.00017070756,0.00005131401,0.000062111205,0.00008042126,0.00007744025,0.00019126729,0.000002782966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025717905,0.0008715747,0.0874291,0.000019677227,0.000461765,4.6654554e-7,0.00006018533,0.0031703445,0.003353579,0.021102767,0.014261286,0.86901206],"study_design_scores_gemma":[0.0006842874,0.00009505354,0.054573797,0.000016641136,0.00009028946,8.7104645e-8,0.000032456923,0.9065427,0.012204894,0.021301478,0.004199262,0.00025900526],"about_ca_topic_score_codex":0.0018335648,"about_ca_topic_score_gemma":0.00057438767,"teacher_disagreement_score":0.92803496,"about_ca_system_score_codex":0.000019687552,"about_ca_system_score_gemma":0.000012952051,"threshold_uncertainty_score":0.99998426},"labels":[],"label_agreement":null},{"id":"W2754554435","doi":"10.3141/2643-14","title":"Incident Detection Through Twitter","year":2017,"lang":"en","type":"article","venue":"Transportation Research Record Journal of the Transportation Research Board","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Personally identifiable information; Social media; Agency (philosophy); Computer science; Incident report; Event (particle physics); Hotline; Information retrieval; World Wide Web; Computer security; Sociology; Telecommunications","score_opus":0.11933547617440932,"score_gpt":0.4272359812716472,"score_spread":0.3079005050972379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754554435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97470164,0.000056539757,0.020120654,0.0024056463,0.00041054827,0.00064611435,0.000022394917,0.000024969613,0.0016115166],"genre_scores_gemma":[0.99635744,0.00013214849,0.0015848293,0.00002674885,0.0006367678,0.00007395368,0.000009831853,0.000045599467,0.0011326704],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99396956,0.0007955459,0.0011634551,0.00038244072,0.0029263913,0.0007626217],"domain_scores_gemma":[0.9943622,0.00042859,0.0009061696,0.0010444882,0.003026637,0.00023196853],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0034566994,0.00023453322,0.00043937785,0.0004940234,0.0020129096,0.0004426782,0.0018880625,0.00010891211,0.0010877032],"category_scores_gemma":[0.00006987618,0.00017670734,0.000608791,0.0007542022,0.0007208446,0.0010968463,0.000020600468,0.0022052324,0.000034091554],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064716826,0.00031179836,0.93948907,0.00006726188,0.00038013255,0.00004799015,0.0024276825,0.00035903166,0.006682801,0.0068722684,0.011719211,0.030995576],"study_design_scores_gemma":[0.0008907988,0.0002576863,0.9281872,0.00019320166,0.00007589354,1.8770936e-7,0.0010642128,0.0001406726,0.010668575,0.033087052,0.025242472,0.00019203298],"about_ca_topic_score_codex":0.03514863,"about_ca_topic_score_gemma":0.031186735,"teacher_disagreement_score":0.030803544,"about_ca_system_score_codex":0.00016520752,"about_ca_system_score_gemma":0.00029063283,"threshold_uncertainty_score":0.9998254},"labels":[],"label_agreement":null},{"id":"W2755588509","doi":"10.1007/978-3-319-67633-3_1","title":"Comparative Study of Centrality Measures on Social Networks","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Centrality; Betweenness centrality; Network theory; Katz centrality; Network controllability; Network science; Complex network; Mathematics; Combinatorics","score_opus":0.046578483700221766,"score_gpt":0.31350808865089586,"score_spread":0.2669296049506741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755588509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00704714,0.00026978663,0.7199959,0.000187511,0.00029981433,0.0019212689,0.00006065254,0.0001884969,0.2700294],"genre_scores_gemma":[0.9989895,0.0000045875836,0.00019435122,0.000035431585,0.00037106255,0.000024097193,0.0002411941,0.00001994837,0.00011983349],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998309,0.00003304362,0.0007869796,0.00021753214,0.00042869445,0.00022473949],"domain_scores_gemma":[0.99733585,0.00007029707,0.0015763881,0.00033687986,0.00065377576,0.000026798807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023355786,0.0003984756,0.0008157469,0.00028617482,0.00038883745,0.00022663499,0.00037181846,0.00019662692,0.000094498944],"category_scores_gemma":[0.00001858999,0.00036558014,0.00010979228,0.000121910285,0.00012058948,0.0005760855,0.00009682347,0.00057002093,0.0000036577173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017564991,0.0002629276,0.0028912132,0.00020395468,0.0002617625,0.0000010101262,0.0066619115,0.08550171,0.0000017309874,0.008762206,0.00020686022,0.89506906],"study_design_scores_gemma":[0.014761299,0.0009398147,0.14033568,0.015166707,0.0035153013,0.0000052639034,0.0022513396,0.27315512,0.0016558355,0.433045,0.10303124,0.012137411],"about_ca_topic_score_codex":0.00011859017,"about_ca_topic_score_gemma":0.00011440094,"teacher_disagreement_score":0.99194235,"about_ca_system_score_codex":0.00008131049,"about_ca_system_score_gemma":0.00011168074,"threshold_uncertainty_score":0.9998796},"labels":[],"label_agreement":null},{"id":"W2757006459","doi":"10.1103/physreve.97.022305","title":"Phase transition of the susceptible-infected-susceptible dynamics on time-varying configuration model networks","year":2018,"lang":"en","type":"article","venue":"Physical review. E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund","keywords":"Degree (music); Statistical physics; Observable; Scaling; Phase transition; Degree distribution; Phenomenon; State (computer science); Limiting; Range (aeronautics); Transition point; Physics; Mathematics; Computer science; Complex network; Algorithm; Combinatorics; Quantum mechanics","score_opus":0.013798604640473774,"score_gpt":0.3277507135755878,"score_spread":0.31395210893511405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757006459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22230397,0.00017220971,0.75047815,0.0005725015,0.00006733304,0.0010389541,0.000048961418,0.00013208494,0.025185836],"genre_scores_gemma":[0.99856114,0.000077211684,0.00023490397,0.00025016462,0.0005811999,0.000041139636,0.00015487892,0.000024075176,0.000075291384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987784,0.00012979834,0.00034811936,0.00027212806,0.00023897608,0.00023258796],"domain_scores_gemma":[0.99893755,0.00008072075,0.0002523619,0.00049335323,0.0001793206,0.00005666825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016806525,0.00021112677,0.0004382666,0.000036041332,0.00015248895,0.00002344527,0.00024214832,0.000027344791,0.00026327826],"category_scores_gemma":[0.000008507042,0.00015682142,0.00039413417,0.000525846,0.00012328738,0.00011120853,0.000041304636,0.00022140323,0.000051539228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023758627,0.0068544713,0.0005712251,0.0005898475,0.00064395426,7.79471e-7,0.00061121624,0.049403466,0.1896247,0.30634016,0.023756586,0.421366],"study_design_scores_gemma":[0.0003256582,0.00032737988,0.000013617711,0.0006390586,0.00021171525,1.3341267e-7,0.0000030634988,0.97318584,0.013359761,0.011598747,0.00016640575,0.00016864034],"about_ca_topic_score_codex":0.00003486768,"about_ca_topic_score_gemma":0.0000063674843,"teacher_disagreement_score":0.92378235,"about_ca_system_score_codex":0.000045130317,"about_ca_system_score_gemma":0.000033758104,"threshold_uncertainty_score":0.6394992},"labels":[],"label_agreement":null},{"id":"W2757834785","doi":"","title":"The characterization of graph by positive inertia index.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inertia; Characterization (materials science); Index (typography); Graph; Statistics; Combinatorics; Computer science; Materials science; Nanotechnology; Physics","score_opus":0.005404067485400714,"score_gpt":0.23892051744157888,"score_spread":0.23351644995617818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757834785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99508226,0.00001604651,0.0007074308,0.00020618853,0.00020486998,0.000115801995,0.000018825927,0.000019928577,0.003628676],"genre_scores_gemma":[0.99967796,0.0000068890395,0.0000099325225,0.000009822377,0.000014939485,0.000012909497,0.000060838443,0.000009556437,0.0001971329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994364,0.000036516907,0.00016812648,0.000118721684,0.000112350426,0.00012790938],"domain_scores_gemma":[0.9990267,0.00003942402,0.00030596094,0.00050079526,0.00009855681,0.000028563858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012209563,0.00008806628,0.00013612182,0.000021688027,0.0004337261,0.000099012206,0.00038820328,0.000022568274,0.000025284546],"category_scores_gemma":[0.0000063429434,0.00006908971,0.000079354504,0.00006779853,0.00010281131,0.00012875789,0.00010945524,0.00008532685,0.0000033238625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001528396,0.00010350238,0.2167308,0.0000016648415,0.00014642993,2.1009767e-7,0.0000917697,3.7969156e-7,0.024063367,0.74442065,0.0024153113,0.012010601],"study_design_scores_gemma":[0.0004643126,0.000056056484,0.32745764,0.000030015432,0.000053618696,1.1269387e-7,0.000033898563,0.0004991809,0.056111973,0.61243474,0.0026585162,0.00019993383],"about_ca_topic_score_codex":0.0002348132,"about_ca_topic_score_gemma":0.000002951272,"teacher_disagreement_score":0.13198595,"about_ca_system_score_codex":0.000008395361,"about_ca_system_score_gemma":0.000012695009,"threshold_uncertainty_score":0.33359143},"labels":[],"label_agreement":null},{"id":"W2762936643","doi":"10.1103/physreve.97.032309","title":"Geometric evolution of complex networks with degree correlations","year":2018,"lang":"en","type":"article","venue":"Physical review. E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Degree (music); Degree distribution; Combinatorics; Thermodynamic limit; Mathematics; Order (exchange); Metric space; Homogeneous; Inverse; Connection (principal bundle); Distribution (mathematics); Physics; Discrete mathematics; Geometry; Statistical physics; Mathematical analysis; Complex network","score_opus":0.03132371860823379,"score_gpt":0.32628332267285715,"score_spread":0.29495960406462335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762936643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03743382,0.0018188882,0.93001,0.000111317495,0.000031012263,0.00044859265,0.000011215386,0.0000778507,0.03005729],"genre_scores_gemma":[0.9972754,0.00006962043,0.0018155348,0.0000393327,0.0006534897,0.000033195887,0.000045201064,0.00001459344,0.00005360926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906975,0.00006131969,0.00026038574,0.00020901838,0.00019983153,0.00019969545],"domain_scores_gemma":[0.99896044,0.00011869403,0.00022891985,0.00038674724,0.00024059127,0.00006463817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012010573,0.00014360827,0.00041637916,0.00008100143,0.00009079961,0.000009928486,0.00019223722,0.000012322306,0.00038720178],"category_scores_gemma":[0.000011788178,0.000111299145,0.00018104982,0.0015738277,0.00015114478,0.00007855298,0.0000664859,0.00012863733,0.000054777363],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004500662,0.0013481266,0.22480172,0.00023844084,0.0006236034,7.12143e-7,0.00006608429,0.0013632557,0.0006456785,0.4016033,0.061276782,0.30798727],"study_design_scores_gemma":[0.0011278867,0.0013858533,0.3691597,0.0030267786,0.0023424488,0.0000033014048,0.000049602575,0.4711766,0.00091992685,0.08674647,0.06257333,0.0014881187],"about_ca_topic_score_codex":0.00011658293,"about_ca_topic_score_gemma":0.000010059194,"teacher_disagreement_score":0.9598416,"about_ca_system_score_codex":0.000032930962,"about_ca_system_score_gemma":0.000027138914,"threshold_uncertainty_score":0.45386475},"labels":[],"label_agreement":null},{"id":"W2765800992","doi":"10.5267/j.dsl.2017.8.001","title":"A monopoly pricing model for diffusion maximization based on heterogeneous nodes and negative network externalities (Case study: A novel product)","year":2017,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monopoly; Product (mathematics); Network effect; Microeconomics; Maximization; Business; Quality (philosophy); Externality; Industrial organization; Marketing; Economics; Mathematics","score_opus":0.04133917680272499,"score_gpt":0.3274973653613535,"score_spread":0.2861581885586285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765800992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5121179,0.0000019456336,0.48722708,0.00019701022,0.00003864249,0.00037910164,0.000004679727,0.000018292794,0.00001529193],"genre_scores_gemma":[0.938676,3.6547672e-7,0.060621083,0.0004062657,0.00017299692,0.000090688474,0.0000015923517,0.000015449315,0.000015531354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982184,0.000025720301,0.00028145593,0.00066956185,0.0004633807,0.00034148002],"domain_scores_gemma":[0.9984418,0.00023797709,0.00030688057,0.00079828897,0.00012524356,0.00008982041],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00082128827,0.00019410817,0.00023854894,0.00017937695,0.0017763345,0.000761009,0.0004969797,0.000014388355,0.000005348093],"category_scores_gemma":[0.00009372009,0.00016172178,0.00008007537,0.00021042324,0.00028585692,0.00039410611,0.000247583,0.00008839099,5.7481265e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019312621,0.00033832178,0.088044554,0.000005950646,0.000030901138,0.000028554217,0.0018934058,0.79904,0.0076691345,0.00048439816,0.00028294927,0.10198869],"study_design_scores_gemma":[0.0006004899,0.0000667268,0.003233349,0.00005873883,0.00002737742,0.000005589092,0.00016936913,0.99217415,0.00080655154,0.0026651379,0.000008255064,0.00018424608],"about_ca_topic_score_codex":0.0002800108,"about_ca_topic_score_gemma":0.000023378654,"teacher_disagreement_score":0.426606,"about_ca_system_score_codex":0.000047826503,"about_ca_system_score_gemma":0.00003647531,"threshold_uncertainty_score":0.9995232},"labels":[],"label_agreement":null},{"id":"W2767138598","doi":"10.1016/j.biosystems.2017.10.013","title":"Network induction for epidemic profiles with a novel representation","year":2017,"lang":"en","type":"article","venue":"Biosystems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Representation (politics); Extant taxon; Computer science; Focus (optics); Theoretical computer science; Space (punctuation); Graph; Computation; Artificial intelligence; Algorithm","score_opus":0.058565242196263384,"score_gpt":0.32378548882682984,"score_spread":0.2652202466305664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767138598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39286512,0.00006465204,0.5976887,0.000538207,0.00048380689,0.0019556792,0.00006507023,0.0001941832,0.0061445967],"genre_scores_gemma":[0.9917869,4.2455588e-7,0.0052132113,0.000007954651,0.0022237154,0.00029892277,0.00006468697,0.00001657136,0.0003875991],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99927807,0.000020556074,0.00019651743,0.00023654655,0.00008973935,0.00017855616],"domain_scores_gemma":[0.9989266,0.00003794493,0.00039276268,0.00052073004,0.00008891555,0.000033069267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024058665,0.00010376375,0.0001986091,0.000027309776,0.00039807335,0.0001280314,0.00018539518,0.000030594118,0.000013374908],"category_scores_gemma":[0.000008922647,0.00008340982,0.0000734389,0.0000614505,0.00003152909,0.00015847642,0.000036056605,0.000053310294,0.0000034715079],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010835479,0.00010844967,0.88650596,0.00005699884,0.00036005938,3.7215182e-7,0.00012751274,0.0004905667,0.00685655,0.05244107,0.034642298,0.018301794],"study_design_scores_gemma":[0.0097284,0.0013960698,0.42970198,0.002970334,0.0015707534,0.000031714273,0.0025038954,0.15793593,0.052897867,0.08890831,0.24811263,0.004242104],"about_ca_topic_score_codex":0.0008977145,"about_ca_topic_score_gemma":0.00003788117,"teacher_disagreement_score":0.5989218,"about_ca_system_score_codex":0.000018093591,"about_ca_system_score_gemma":0.000019831046,"threshold_uncertainty_score":0.34013534},"labels":[],"label_agreement":null},{"id":"W2767181393","doi":"10.5539/cis.v10n4p50","title":"Community Detection Using Node Attributes and Structural Patterns in Online Social Networks","year":2017,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Node (physics); Term (time); Focus (optics); Set (abstract data type); Community structure; Data science; Social network (sociolinguistics); Data mining; Enhanced Data Rates for GSM Evolution; Machine learning; Artificial intelligence; World Wide Web; Social media","score_opus":0.03226937857179552,"score_gpt":0.3123654591218352,"score_spread":0.2800960805500397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767181393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6867907,0.0000016697238,0.31304166,0.000026262203,0.000037326525,0.00003535034,0.000004853582,0.000009184616,0.00005300305],"genre_scores_gemma":[0.9982867,0.0000017232411,0.0015339504,0.00005111513,0.000110550434,9.21272e-7,0.00001352639,0.0000011329001,3.6783234e-7],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995564,0.000022619679,0.0001537746,0.00006166632,0.000085001346,0.00012051737],"domain_scores_gemma":[0.99961144,0.000014615682,0.00013428352,0.00014315698,0.00006668873,0.000029825913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028178332,0.00006172893,0.000090395,0.00009111169,0.0012955278,0.00051521196,0.00020751887,0.000015046873,0.0000034136015],"category_scores_gemma":[0.0000032998244,0.000057201138,0.000015074949,0.000102758764,0.0001817741,0.0027908133,0.0003354376,0.00014402712,1.6388513e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000337142,0.0000090096855,0.6178648,0.000006811497,0.0000047872045,5.044282e-8,0.0010635243,0.0020557283,0.00005753583,0.0009648729,0.000008477662,0.377961],"study_design_scores_gemma":[0.000073403666,0.0000051597585,0.47532392,0.0000067965293,0.0000016445814,5.090065e-7,0.0000550933,0.52419984,0.00003837315,0.00023098357,0.000025326555,0.00003897505],"about_ca_topic_score_codex":0.00058579544,"about_ca_topic_score_gemma":0.00004014731,"teacher_disagreement_score":0.5221441,"about_ca_system_score_codex":0.000017870261,"about_ca_system_score_gemma":0.000011518589,"threshold_uncertainty_score":0.9964283},"labels":[],"label_agreement":null},{"id":"W2767528649","doi":"10.1103/physreve.97.032302","title":"Exact analytical solution of irreversible binary dynamics on networks","year":2018,"lang":"en","type":"article","venue":"Physical review. E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Irish Research Council; Science Foundation Ireland","keywords":"Binary number; State (computer science); Exponential function; Cascade; Node (physics); Set (abstract data type); Graph; Function (biology); Mathematics; Applied mathematics; Computer science; Algorithm; Discrete mathematics; Mathematical analysis","score_opus":0.017198492270769587,"score_gpt":0.33851018264451405,"score_spread":0.32131169037374446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767528649","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46012354,0.0029497447,0.3634896,0.0022212928,0.00036294953,0.0016525075,0.000067748515,0.00037196232,0.16876064],"genre_scores_gemma":[0.9983804,0.00020277433,0.00028004753,0.00013214807,0.0008115399,0.000013923351,0.0000645811,0.000016008711,0.00009856758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988913,0.000087583394,0.00028526052,0.00027048375,0.0002093776,0.00025598027],"domain_scores_gemma":[0.9990692,0.00011448551,0.0001672755,0.00045211945,0.00011277117,0.00008411686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018265002,0.00017293535,0.00049446494,0.000047754867,0.00007232397,0.000010442749,0.00022843148,0.000021430918,0.00032398626],"category_scores_gemma":[0.000012443775,0.00014801853,0.00036988285,0.000533213,0.00014171867,0.0000715535,0.000109313114,0.00018824707,0.00009174322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008175817,0.0020388379,0.014930791,0.00029712854,0.0004968613,0.0000021635842,0.000040429608,0.00050204707,0.0005471675,0.64140034,0.092630364,0.24703209],"study_design_scores_gemma":[0.00016044948,0.00041797844,0.0023461797,0.00094346044,0.0003748512,2.4164845e-7,0.0000068473482,0.96601707,0.00046450275,0.02219093,0.006774225,0.00030325435],"about_ca_topic_score_codex":0.00005014722,"about_ca_topic_score_gemma":0.0000035192134,"teacher_disagreement_score":0.965515,"about_ca_system_score_codex":0.00004932984,"about_ca_system_score_gemma":0.000020606793,"threshold_uncertainty_score":0.60360205},"labels":[],"label_agreement":null},{"id":"W2767812464","doi":"10.1109/tnet.2019.2940888","title":"Curing Epidemics on Networks Using a Polya Contagion Model","year":2019,"lang":"en","type":"preprint","venue":"IEEE/ACM Transactions on Networking","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Queen's University","keywords":"Curing (chemistry); Computer science; Mathematical optimization; Gradient descent; Network structure; Operations research; Mathematics; Artificial intelligence; Distributed computing; Artificial neural network; Materials science","score_opus":0.06640543453596294,"score_gpt":0.31935022585741313,"score_spread":0.2529447913214502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767812464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021657689,0.00027753477,0.9717358,0.00011046151,0.0027323917,0.0009716294,0.000061736246,0.000458136,0.001994653],"genre_scores_gemma":[0.98255,0.00018267265,0.012731676,0.00028759032,0.0034578345,0.0001500367,0.000110564884,0.00023267683,0.00029692854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559766,0.00026372852,0.0011062388,0.0014283984,0.0005210081,0.0010829495],"domain_scores_gemma":[0.9959966,0.00050520914,0.00079379574,0.0023469233,0.00013549237,0.00022200763],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0005935014,0.0010281401,0.0012815322,0.0005037496,0.00059036544,0.00027445576,0.001104837,0.00055709074,0.00011181501],"category_scores_gemma":[0.0000028506233,0.0011573313,0.0011858902,0.0005052753,0.00008226878,0.00014440752,0.000106248604,0.0034297593,0.000023843773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007945691,0.00017686239,0.0008256029,0.000028002645,0.0004997898,0.0000027085932,0.00008399167,0.9550414,0.000039196595,0.0004151396,0.00037078824,0.042437058],"study_design_scores_gemma":[0.00037517105,0.00005185698,0.000015125566,0.0015291133,0.0005311529,0.0000019465974,0.00002904731,0.98231006,0.00025676392,0.0131944185,0.00071163446,0.0009936856],"about_ca_topic_score_codex":0.00055814424,"about_ca_topic_score_gemma":0.00004613654,"teacher_disagreement_score":0.9608923,"about_ca_system_score_codex":0.0004922678,"about_ca_system_score_gemma":0.0001916546,"threshold_uncertainty_score":0.9990877},"labels":[],"label_agreement":null},{"id":"W2768352146","doi":"10.48550/arxiv.1711.08752","title":"A Survey on Network Embedding","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Embedding; Computer science; Theoretical computer science; Graph; Focus (optics); Data mining; Artificial intelligence","score_opus":0.10037349216633949,"score_gpt":0.23985031756362707,"score_spread":0.13947682539728756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768352146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64747906,0.000077271725,0.25239825,0.000037651665,0.0008079099,0.00065186433,0.00023823351,0.00045678398,0.09785297],"genre_scores_gemma":[0.99489975,0.000022029966,0.00018355525,0.000021392352,0.00073839776,0.0000014783343,0.00031297936,0.000038336682,0.0037820982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998133,0.00023492516,0.00019424414,0.0009218294,0.00007673613,0.00043925433],"domain_scores_gemma":[0.99735737,0.00018454876,0.00048288432,0.0017091011,0.0001292675,0.00013683025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045946272,0.00038846757,0.0005418586,0.00013206988,0.00040948312,0.00016884068,0.0011937084,0.00016476547,0.00042311323],"category_scores_gemma":[0.000012405785,0.00045915146,0.00042364278,0.0002077064,0.00009721983,0.00008498515,0.0013125659,0.00077876303,0.0001127607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005855568,0.00011381182,0.27107993,0.000012107321,0.0005501847,0.000042222196,0.000026387039,0.6200715,0.0000010756244,0.08392248,0.022449598,0.0016721572],"study_design_scores_gemma":[0.00068475737,0.0000888773,0.10137485,0.00058937876,0.00056773616,2.3061229e-7,0.000037982532,0.58132035,0.000039293373,0.30625787,0.0072328,0.0018058564],"about_ca_topic_score_codex":0.0026952883,"about_ca_topic_score_gemma":0.00028830298,"teacher_disagreement_score":0.34742066,"about_ca_system_score_codex":0.000105920684,"about_ca_system_score_gemma":0.0001243785,"threshold_uncertainty_score":0.999786},"labels":[],"label_agreement":null},{"id":"W2769227974","doi":"10.1093/comnet/cnz019","title":"Local clustering coefficient of spatial preferential attachment model","year":2019,"lang":"en","type":"preprint","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research","keywords":"Cluster analysis; Clustering coefficient; Preferential attachment; Vertex (graph theory); Computer science; Complex network; Mathematics; Statistical physics; Combinatorics; Physics; Graph; Artificial intelligence","score_opus":0.031472128706824594,"score_gpt":0.29944240186409743,"score_spread":0.26797027315727284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769227974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021818852,0.000304169,0.974496,0.00004745256,0.0008055088,0.00042249242,0.00004182419,0.000026727292,0.0020369436],"genre_scores_gemma":[0.9897382,0.000036580106,0.00814415,0.000029303383,0.0017591347,0.000009998334,0.00012927296,0.00006183592,0.000091486414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961529,0.00019327557,0.0019465621,0.00040781294,0.0008085503,0.00049089245],"domain_scores_gemma":[0.9954283,0.00011503837,0.0028838422,0.0007762587,0.00061147497,0.00018508703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006330818,0.0005326286,0.0016086228,0.000301758,0.00007868694,0.00010828909,0.0010734625,0.00023127458,0.00054284796],"category_scores_gemma":[0.0000029624164,0.0004937845,0.0011641396,0.00015029285,0.00013501127,0.00007497682,0.0015734473,0.0015489404,0.0000030875642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017777165,0.0003233347,0.0027427066,0.00006658123,0.0007199921,0.000002083728,0.00008710749,0.9729733,0.000051522664,0.000493651,0.0053464337,0.017015543],"study_design_scores_gemma":[0.0006801992,0.00017257128,0.0010735246,0.00057662185,0.00047324502,0.000004373889,0.000038671107,0.9931345,0.0001255185,0.002392941,0.0009373143,0.00039049404],"about_ca_topic_score_codex":0.00019706649,"about_ca_topic_score_gemma":0.000028316259,"teacher_disagreement_score":0.9679194,"about_ca_system_score_codex":0.00017940403,"about_ca_system_score_gemma":0.00028344343,"threshold_uncertainty_score":0.9997514},"labels":[],"label_agreement":null},{"id":"W2769638014","doi":"10.1007/978-3-319-72150-7_24","title":"Parallel Community Detection Methods for Sparse Complex Networks","year":2017,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Exploit; State (computer science); Artificial intelligence; Machine learning; Theoretical computer science; Data mining; Algorithm","score_opus":0.25622493239921884,"score_gpt":0.4743237760423162,"score_spread":0.21809884364309734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769638014","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000051352636,0.0010491431,0.9388069,0.00005127375,0.00033228123,0.0006290598,0.000037685404,0.00006519306,0.059023328],"genre_scores_gemma":[0.45665964,0.00044807183,0.5130989,0.00014673141,0.0014553737,0.0005040462,0.00076387374,0.00013747052,0.026785888],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980726,0.00019290493,0.0007742363,0.00043702018,0.00018064857,0.00034256626],"domain_scores_gemma":[0.995307,0.0027754707,0.0006817086,0.00060888403,0.00057349604,0.00005343141],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012547466,0.0004653198,0.00086169655,0.00019889764,0.0009633074,0.000075841825,0.000703478,0.000131755,0.00014609176],"category_scores_gemma":[0.00006389971,0.0004941097,0.0003996596,0.00004630801,0.0005863113,0.000084859814,0.000572979,0.0008790247,0.000012882635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042459604,0.00005452086,0.00008818152,0.000050399703,0.0008072777,0.0000010805633,0.0002993538,0.2643577,7.920522e-7,0.31767723,0.0014818334,0.4151392],"study_design_scores_gemma":[0.00007740559,0.000063937085,0.00006951874,0.00019225424,0.00009378143,0.000001077543,0.00013300737,0.24596131,0.000009406371,0.73329836,0.019737398,0.0003625267],"about_ca_topic_score_codex":0.00015510632,"about_ca_topic_score_gemma":0.00027391667,"teacher_disagreement_score":0.45665452,"about_ca_system_score_codex":0.00016898746,"about_ca_system_score_gemma":0.00004693594,"threshold_uncertainty_score":0.99975103},"labels":[],"label_agreement":null},{"id":"W2770617052","doi":"10.1109/tcss.2017.2768325","title":"Structure of Crowdsourcing Community Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Social Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Crowdsourcing; Popularity; Computer science; Social network (sociolinguistics); World Wide Web; Data science; Community structure; Social media; Biology; Political science; Ecology","score_opus":0.02269870064339637,"score_gpt":0.29173331899346616,"score_spread":0.2690346183500698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770617052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20389864,0.0000058782766,0.79474014,0.00003037346,0.00027401512,0.00013198164,0.00008121859,0.000039007246,0.00079873746],"genre_scores_gemma":[0.99902916,2.165054e-7,0.0004754303,0.000008294127,0.0003771125,0.000010738126,0.0000232299,0.000015489342,0.00006032098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990361,0.0001867817,0.00029537643,0.000120004464,0.00021881118,0.00014295836],"domain_scores_gemma":[0.9990386,0.00015561513,0.0003498385,0.00026389942,0.00015300821,0.00003904264],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00014999398,0.00013103789,0.00027345278,0.000058897935,0.0021324523,0.00013017154,0.0003281017,0.00005810566,0.00008604672],"category_scores_gemma":[9.0805463e-7,0.00013862259,0.00018724783,0.000086029526,0.00011818174,0.000103138955,0.0000036013632,0.00037061248,0.0000023580733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014527871,0.000121350175,0.0014554174,0.000013550891,0.00023558854,1.8606855e-7,0.00044034183,0.98367554,0.00013712546,0.005673175,0.00023254481,0.008000628],"study_design_scores_gemma":[0.001242106,0.00012658807,0.034075093,0.00019075151,0.00027521464,0.0000026029393,0.0013923339,0.9334473,0.0016843653,0.02647245,0.0003765488,0.00071465736],"about_ca_topic_score_codex":0.0029735928,"about_ca_topic_score_gemma":0.000080822014,"teacher_disagreement_score":0.79513055,"about_ca_system_score_codex":0.000040945153,"about_ca_system_score_gemma":0.000029345823,"threshold_uncertainty_score":0.9991666},"labels":[],"label_agreement":null},{"id":"W2770878427","doi":"10.1145/3110025.3110052","title":"MCDA","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Multiple-criteria decision analysis; Computer science; Context (archaeology); Constraint (computer-aided design); Set (abstract data type); Data mining; Artificial intelligence; Selection (genetic algorithm); Machine learning; Mathematical optimization; Mathematics","score_opus":0.015902914277606862,"score_gpt":0.3092072972513778,"score_spread":0.2933043829737709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770878427","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046114795,0.0000026949601,0.03642855,0.00024070693,0.000023746103,0.00002836671,7.5175933e-7,0.000051665585,0.9171087],"genre_scores_gemma":[0.99078184,1.8638053e-7,0.0021571296,0.00001823227,0.0001905579,0.0000040877308,0.0000019443792,0.0000030606063,0.0068429834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997832,0.0000031502423,0.000044034397,0.00006700691,0.0000339492,0.00006865336],"domain_scores_gemma":[0.99951124,0.0000050276026,0.00003731677,0.00041436937,0.00001248445,0.00001953564],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000033593886,0.000034454148,0.000053189993,0.000008914006,0.00018969663,0.000086373635,0.00019974803,0.0000048027287,0.0031954052],"category_scores_gemma":[9.1784506e-7,0.000028553415,0.00004766103,0.0000086301025,0.000019369545,0.000060653787,0.000073346004,0.000027185863,0.00009653601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.1869473e-7,0.000025616035,0.3340334,3.9696678e-7,0.000039599985,3.5153482e-7,0.000010571276,0.0000017387462,0.00019041193,0.4970391,0.038727805,0.1299302],"study_design_scores_gemma":[0.00035831056,0.000024428951,0.17236948,0.000012397563,0.000054762524,2.580668e-7,0.00006378275,0.0053962343,0.015678393,0.41070986,0.39489296,0.00043913157],"about_ca_topic_score_codex":0.00041362087,"about_ca_topic_score_gemma":0.000011634427,"teacher_disagreement_score":0.94466704,"about_ca_system_score_codex":0.0000019086137,"about_ca_system_score_gemma":0.0000036174229,"threshold_uncertainty_score":0.99771583},"labels":[],"label_agreement":null},{"id":"W2770895268","doi":"10.1145/3110025.3110067","title":"Community Detection in Evolving Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University; Compute Canada","keywords":"Modularity (biology); Community structure; Computer science; Enhanced Data Rates for GSM Evolution; Clique percolation method; Complex network; Social network analysis; Data mining; Order (exchange); Social network (sociolinguistics); Evolving networks; Artificial intelligence; Data science; Theoretical computer science; Machine learning; Distributed computing; World Wide Web; Mathematics","score_opus":0.020397061891524012,"score_gpt":0.289563551717916,"score_spread":0.26916648982639196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770895268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43155396,0.000011865981,0.41956666,0.000049759234,0.00004944442,0.00008562332,3.3162564e-7,0.000073794385,0.14860857],"genre_scores_gemma":[0.99909455,7.2776186e-7,0.0004767176,0.000010879065,0.00013015963,0.000011215677,0.000003011476,0.0000058529295,0.0002668643],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9995884,0.00006778291,0.00010729551,0.00007067881,0.000040239618,0.00012563427],"domain_scores_gemma":[0.999271,0.000030675794,0.00007554869,0.00057862635,0.00002242894,0.000021741613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002671683,0.0000620396,0.00010150324,0.000035497556,0.00051541685,0.00012415735,0.00028033284,0.00001875114,0.0003446712],"category_scores_gemma":[0.000006086405,0.00006026158,0.000051833682,0.000044709534,0.000028255134,0.00015160949,0.00016034763,0.00027218618,0.0000059661093],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043354275,0.00009607126,0.72204095,0.000001464938,0.000029521418,4.1118247e-7,0.00007352782,0.0011184091,0.00022279509,0.004102258,0.0010288119,0.27128145],"study_design_scores_gemma":[0.00021684218,0.000019306022,0.5807367,0.000023054501,0.000013559263,1.607883e-7,0.0001595228,0.3956514,0.001825417,0.020218393,0.0009531543,0.00018249384],"about_ca_topic_score_codex":0.010241614,"about_ca_topic_score_gemma":0.0033564907,"teacher_disagreement_score":0.56754065,"about_ca_system_score_codex":0.000018016195,"about_ca_system_score_gemma":0.00000385233,"threshold_uncertainty_score":0.9963493},"labels":[],"label_agreement":null},{"id":"W2774231546","doi":"10.1109/jcn.2017.000082","title":"Risk-adaptive strategic network protection in disaster scenarios","year":2017,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Computer security; Risk analysis (engineering); Computer network","score_opus":0.044119659109385416,"score_gpt":0.300355317562984,"score_spread":0.2562356584535986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774231546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53926635,0.005617101,0.42903304,0.0016841511,0.00026926762,0.0007663513,0.0000069742396,0.000033063927,0.02332368],"genre_scores_gemma":[0.9943165,0.00081092253,0.0043700775,0.000010748649,0.00043415825,0.000013561114,0.0000022726,0.000009716494,0.00003201979],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990488,0.00019850973,0.0004163678,0.0000867331,0.00008610701,0.00016342623],"domain_scores_gemma":[0.9978082,0.000092938644,0.0010124344,0.000909212,0.00011878007,0.00005842855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067273807,0.00010780306,0.00025491643,0.00006581714,0.00061220734,0.00019191287,0.000659022,0.000045148507,0.000027254755],"category_scores_gemma":[0.0000050891326,0.00009220618,0.00010580039,0.00010464169,0.0001417779,0.0002607806,0.0002572444,0.0006630985,7.3359666e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021393919,0.00054382643,0.5214112,0.0000054516986,0.0005441763,0.000004070547,0.0006093914,0.0656971,0.000026529771,0.05072222,0.0013368267,0.35888532],"study_design_scores_gemma":[0.0010112523,0.00025527042,0.09551509,0.00037487742,0.00019538605,0.000011228179,0.00064958626,0.7838357,0.000004934829,0.11360531,0.0042221467,0.00031920781],"about_ca_topic_score_codex":0.00028012344,"about_ca_topic_score_gemma":0.00033583384,"teacher_disagreement_score":0.71813864,"about_ca_system_score_codex":0.000022106537,"about_ca_system_score_gemma":0.000027728332,"threshold_uncertainty_score":0.47086656},"labels":[],"label_agreement":null},{"id":"W2774850139","doi":"10.3166/isi.22.3.89-113","title":"Un partitionnement d'arêtes à base de blocs pour les algorithmes de marches aléatoires dans les grands graphes sociaux","year":2017,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Art","score_opus":0.027280344145236567,"score_gpt":0.27064526445736087,"score_spread":0.2433649203121243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774850139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48546374,0.001598825,0.49931008,0.0032034926,0.00022072258,0.0005474006,0.00031348452,0.0002690679,0.009073177],"genre_scores_gemma":[0.97387564,0.00051345985,0.023705063,0.000093303555,0.0006908772,0.00026406167,0.0003801055,0.000037884063,0.00043959607],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972973,0.00027400057,0.0009364312,0.000267652,0.00036062876,0.0008640142],"domain_scores_gemma":[0.9973884,0.00021451442,0.0010407737,0.0006972322,0.0004400367,0.00021902421],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009931108,0.0004884497,0.0005121482,0.00024307735,0.0032071394,0.0013397149,0.0006947629,0.00023003486,0.0003896609],"category_scores_gemma":[0.00018909153,0.00052830396,0.00046332384,0.00020726517,0.00087752,0.0022675502,0.0002709715,0.0003439844,0.000048825237],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003227848,0.000205206,0.23709615,0.00037287126,0.0006184165,0.000005826906,0.012456351,0.00094959134,0.00035764519,0.06651662,0.005021927,0.6763671],"study_design_scores_gemma":[0.0021574032,0.00031666525,0.34261605,0.0023586156,0.0012733729,0.000041705163,0.027846087,0.14285171,0.04534421,0.3929759,0.04020844,0.0020098505],"about_ca_topic_score_codex":0.0059087705,"about_ca_topic_score_gemma":0.00053340866,"teacher_disagreement_score":0.6743573,"about_ca_system_score_codex":0.00066326605,"about_ca_system_score_gemma":0.00038020685,"threshold_uncertainty_score":0.9997169},"labels":[],"label_agreement":null},{"id":"W2774881482","doi":"10.1016/j.physa.2017.11.130","title":"Consensus-based methodology for detection communities in multilayered networks","year":2017,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Computer science; Data science","score_opus":0.07853699832787664,"score_gpt":0.3674391265344557,"score_spread":0.28890212820657907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774881482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033432525,0.000022593757,0.99532366,0.00021500808,0.000018675239,0.0006921225,0.0002318431,0.000033697324,0.00011916837],"genre_scores_gemma":[0.9473196,0.0000067233605,0.051052473,0.00003692285,0.000108756285,0.0013593229,0.00009009813,0.000017448472,0.000008625902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991611,0.00009578259,0.00024097622,0.00021950337,0.0000575243,0.00022509831],"domain_scores_gemma":[0.99783283,0.0013829549,0.000179283,0.00043107255,0.00010658701,0.00006726481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026866834,0.00013721602,0.00027802633,0.00004846301,0.000570573,0.000083443825,0.00021331059,0.000040625833,0.000029468554],"category_scores_gemma":[0.000036934063,0.00014177065,0.000055686258,0.00006239735,0.000053674594,0.000033972716,0.00008266633,0.00015968322,0.000001901322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026399219,0.00012492193,0.00007634199,0.000012339167,0.000031910462,8.202416e-8,0.0000346493,0.00043810823,0.0010512212,0.9242723,0.00006190896,0.073869824],"study_design_scores_gemma":[0.0003168367,0.000040986968,0.00028486748,0.00000856351,0.00004853126,1.1423986e-7,0.00006291447,0.7605023,0.0008651091,0.23584601,0.0018988,0.00012498331],"about_ca_topic_score_codex":0.0003180553,"about_ca_topic_score_gemma":0.00020784869,"teacher_disagreement_score":0.94427115,"about_ca_system_score_codex":0.000015177209,"about_ca_system_score_gemma":0.000018716086,"threshold_uncertainty_score":0.578124},"labels":[],"label_agreement":null},{"id":"W2775087763","doi":"10.1038/s41598-017-17168-6","title":"A Random Categorization Model for Hierarchical Taxonomies","year":2017,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Particle Physics","funders":"National Institute of General Medical Sciences; National Science Foundation; National Institutes of Health; National Cancer Institute; Aspen Center for Physics; East China Normal University","keywords":"Categorization; Computer science; Taxonomic rank; Directory; Taxonomy (biology); Sample (material); Relative abundance distribution; Data science; Parametric statistics; Abundance (ecology); Ecology; Information retrieval; Relative species abundance; Artificial intelligence; Biology; Statistics; Taxon; Mathematics","score_opus":0.028508979452601977,"score_gpt":0.2928553617912049,"score_spread":0.2643463823386029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775087763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0838385,0.000011543467,0.90808976,0.00016299896,0.0009425126,0.00045092328,0.000005495868,0.000059495458,0.006438785],"genre_scores_gemma":[0.9834589,2.4506795e-7,0.009123234,0.000004037988,0.00021025649,0.00015840128,0.00011493416,0.000010254187,0.0069197607],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888635,0.0000121419935,0.0002984148,0.00044706848,0.00015302368,0.00020299996],"domain_scores_gemma":[0.99833053,0.00002423647,0.00038010787,0.0010731353,0.00012939134,0.00006258023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007259937,0.00009785764,0.00018420827,0.00006946914,0.0011586435,0.0007871744,0.00021209447,0.000022324912,0.00007124474],"category_scores_gemma":[0.000039711973,0.00008783186,0.00017414782,0.00005335546,0.00019105943,0.00021443574,0.000099487675,0.000055478446,0.000003423245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019288389,0.00066829805,0.22242276,0.0000659453,0.0004975874,0.000039325467,0.001227777,0.043001205,0.015450553,0.2092089,0.3623081,0.14491662],"study_design_scores_gemma":[0.00022708859,0.00000525715,0.00030650926,0.000008193553,0.00003763817,0.0000013285145,0.000009165222,0.51056314,0.003160612,0.46652323,0.019021412,0.00013641556],"about_ca_topic_score_codex":0.00005149092,"about_ca_topic_score_gemma":0.000020857422,"teacher_disagreement_score":0.89962035,"about_ca_system_score_codex":0.000014778621,"about_ca_system_score_gemma":0.000088271256,"threshold_uncertainty_score":0.89114666},"labels":[],"label_agreement":null},{"id":"W2775543977","doi":"10.23919/picmet.2017.8125406","title":"International Trade Relations of Products for Wind Energy Production: A Study from the Dynamic Social Network Analysis (DSNA)","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Product (mathematics); Production (economics); Work (physics); Business; Order (exchange); Wind power; International trade; Commerce; Industrial organization; Computer science; Environmental economics; Economics; Engineering; Finance","score_opus":0.018157119504831423,"score_gpt":0.2960474221127798,"score_spread":0.2778903026079484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775543977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7021691,0.00008223058,0.23341988,0.045173667,0.0010136575,0.0020318162,0.00026232348,0.00017897488,0.015668334],"genre_scores_gemma":[0.9943873,9.885651e-7,0.0022788616,0.000011881685,0.0020337054,0.00006771583,0.00020524679,0.000010699948,0.0010035975],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99902254,0.00005625352,0.00028474166,0.0003194373,0.00018272766,0.00013430482],"domain_scores_gemma":[0.9988268,0.00007616926,0.00037958144,0.0006180754,0.000084264386,0.0000151231225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002460894,0.00011534186,0.00025607206,0.00005099785,0.00072073215,0.00010005244,0.0005121058,0.000021563803,0.0001979168],"category_scores_gemma":[0.000017597715,0.0000875807,0.00025770775,0.00028382684,0.00007916453,0.00013249884,0.00010613023,0.00007530103,5.421844e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086501546,0.0011890645,0.82044786,0.0000020875325,0.015440289,2.808913e-7,0.0015655347,0.007949174,0.00029187478,0.060682494,0.053915337,0.038429506],"study_design_scores_gemma":[0.00058728515,0.00006690958,0.89713514,0.000009339608,0.0037687947,9.08884e-8,0.0009778579,0.03779168,0.00028748403,0.031885058,0.02716895,0.00032141735],"about_ca_topic_score_codex":0.00092327636,"about_ca_topic_score_gemma":0.0009080851,"teacher_disagreement_score":0.29221818,"about_ca_system_score_codex":0.000023100538,"about_ca_system_score_gemma":0.000029219886,"threshold_uncertainty_score":0.5543362},"labels":[],"label_agreement":null},{"id":"W2776149060","doi":"10.1007/978-3-319-72050-0_17","title":"How to Choose Friends Strategically","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Viral marketing; Bipartite graph; Computer science; Product (mathematics); Maximization; Set (abstract data type); Social network (sociolinguistics); Join (topology); Alice (programming language); Time complexity; Theoretical computer science; Combinatorics; Mathematical optimization; Mathematics; Algorithm; Graph; World Wide Web; Social media","score_opus":0.018573268011307213,"score_gpt":0.26849877290742563,"score_spread":0.24992550489611842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2776149060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017469218,0.000047087822,0.9574837,0.0007072322,0.0002866214,0.00024986084,0.000011729532,0.00007313369,0.04096596],"genre_scores_gemma":[0.88576883,0.0000029864107,0.107620925,0.00030369902,0.001834042,0.000015239753,0.000017565599,0.000039673374,0.00439703],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764293,0.000013525918,0.0002615815,0.0010395176,0.0005371599,0.0005053018],"domain_scores_gemma":[0.9978598,0.000103383696,0.00024788492,0.0014008927,0.00018393094,0.00020412364],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000332867,0.0004349019,0.0005186487,0.0003978748,0.0003049377,0.0011730137,0.0020433504,0.00012779389,0.00018185846],"category_scores_gemma":[0.000010642654,0.00038610393,0.00019149059,0.00015292734,0.00038413686,0.00023182192,0.000808537,0.0006126051,0.000030184903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043045334,0.000017026678,0.00024315238,0.000005507471,0.00003303062,0.000016914408,0.00013182015,0.0035785951,0.00009343819,0.046538133,0.0001450332,0.94919306],"study_design_scores_gemma":[0.00020539909,0.00017999156,0.00042613086,0.00039166235,0.000051685252,0.0000045670545,4.4124397e-7,0.041080873,0.0012276628,0.9203909,0.034800634,0.001240079],"about_ca_topic_score_codex":0.00006777032,"about_ca_topic_score_gemma":0.00007979329,"teacher_disagreement_score":0.947953,"about_ca_system_score_codex":0.00012244197,"about_ca_system_score_gemma":0.0002836206,"threshold_uncertainty_score":0.99986386},"labels":[],"label_agreement":null},{"id":"W2780822466","doi":"10.1137/1.9781611975031.112","title":"Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Random walk; Combinatorics; Mathematics; Upper and lower bounds; Discrete mathematics; Branching process; Expander graph; Graph; Cover (algebra); Rumor; Statistics","score_opus":0.03979422242460341,"score_gpt":0.25272291910475764,"score_spread":0.21292869668015424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780822466","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021564707,0.000088369095,0.13234687,0.000101622,0.00044058062,0.008566343,0.00093931466,0.00038253338,0.8549779],"genre_scores_gemma":[0.062098008,0.000034016528,0.13891526,0.00058366475,0.021352349,0.00411663,0.00226896,0.0011863731,0.76944476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979778,0.0000051122097,0.00070775865,0.00059852394,0.00028398464,0.00042682068],"domain_scores_gemma":[0.9981302,0.000498169,0.0006570158,0.0004868376,0.000104245584,0.00012352654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064838346,0.0006286374,0.0011120075,0.000075096206,0.0006357829,0.00019242363,0.000285857,0.00056273746,0.00012736306],"category_scores_gemma":[0.0000050732842,0.0005581723,0.0015179109,0.000023784694,0.0003003377,0.000021389247,0.00011862461,0.0005172833,0.0000046728223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012665227,0.00003787925,3.504389e-7,0.00014763064,0.0010476055,6.817652e-8,0.0006949518,0.0000019845734,0.00016582805,0.9318088,0.048876286,0.01709193],"study_design_scores_gemma":[0.0029342247,0.00012596059,1.5380175e-8,0.00035362458,0.0007974066,3.4026826e-7,0.00015355213,0.00041640026,0.0012856459,0.7994016,0.19399804,0.00053323444],"about_ca_topic_score_codex":0.0000030776873,"about_ca_topic_score_gemma":0.0000018586746,"teacher_disagreement_score":0.14512175,"about_ca_system_score_codex":0.000046588502,"about_ca_system_score_gemma":0.00008391047,"threshold_uncertainty_score":0.99968696},"labels":[],"label_agreement":null},{"id":"W2782871070","doi":"10.1109/bigdata.2017.8258550","title":"Using Bi-partite graphs to cluster complex networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Bipartite graph; Partition (number theory); Modularity (biology); Cluster analysis; The Internet; Internet of Things; Network partition; Distributed computing; Graph; Data mining; Theoretical computer science; Artificial intelligence; World Wide Web","score_opus":0.06621069025203966,"score_gpt":0.34748620305335254,"score_spread":0.2812755128013129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782871070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10929374,0.000007805081,0.82436734,0.00037957533,0.00009217795,0.00023706196,0.000004041087,0.00011145622,0.065506816],"genre_scores_gemma":[0.97737944,5.580323e-7,0.021186005,0.0003187388,0.00041483526,0.000013488224,0.0000126430195,0.000019764415,0.00065450586],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990543,0.00002879756,0.0002122688,0.00026476788,0.00011279832,0.00032706533],"domain_scores_gemma":[0.9987849,0.000022533148,0.00012695906,0.0008761566,0.000060412833,0.00012901366],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014396626,0.00015780918,0.00023501333,0.00007477963,0.00055179413,0.00032200845,0.00045712496,0.000026370659,0.0013907141],"category_scores_gemma":[0.0000025352292,0.00014277724,0.00016868128,0.00010864909,0.00005512902,0.0001505526,0.0003578138,0.00010025086,0.00004669067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003471283,0.00017119705,0.66468215,0.000004802129,0.00036093712,0.0000025734103,0.00009918538,0.036421467,0.0014579144,0.13032612,0.11678996,0.049649008],"study_design_scores_gemma":[0.00041736482,0.000042763575,0.055414192,0.00004356258,0.0001190993,8.962733e-7,0.000045000677,0.86491674,0.00067100325,0.023986999,0.053689193,0.0006531918],"about_ca_topic_score_codex":0.0010167669,"about_ca_topic_score_gemma":0.00011831063,"teacher_disagreement_score":0.86808574,"about_ca_system_score_codex":0.00001408454,"about_ca_system_score_gemma":0.000009440354,"threshold_uncertainty_score":0.99952215},"labels":[],"label_agreement":null},{"id":"W2783570169","doi":"10.1109/dsaa.2017.55","title":"Identifying Anomalous Nodes in Multidimensional Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Anomaly detection; Computer science; Probabilistic logic; Node (physics); Anomaly (physics); Set (abstract data type); Dimension (graph theory); Data mining; Feature (linguistics); Exploit; Artificial intelligence; Mathematics","score_opus":0.022908809578562693,"score_gpt":0.3069511070857061,"score_spread":0.28404229750714344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783570169","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6963546,0.00005892342,0.25653175,0.00010220777,0.00010265544,0.00012985151,0.0000015555776,0.00008135054,0.04663708],"genre_scores_gemma":[0.990749,0.0000020369728,0.008287683,0.000022703633,0.00021202135,0.0000130969,0.0000101201485,0.000010304136,0.0006930028],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99930733,0.000020104762,0.00017369409,0.00020043607,0.000087867564,0.00021055255],"domain_scores_gemma":[0.99933386,0.000033334007,0.00010247,0.0004648382,0.000026774314,0.000038732334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001489272,0.00010157654,0.00016062973,0.00005431426,0.00025856038,0.00012409645,0.0002498217,0.000023353829,0.0007157939],"category_scores_gemma":[0.0000033309525,0.0000944256,0.00008863748,0.00004594291,0.000043441047,0.00016707624,0.00020930827,0.000120239565,0.000022616421],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004097153,0.00005722127,0.94930744,9.3694985e-7,0.000028000113,0.0000040543464,0.000021327194,0.0009312113,0.00013784913,0.02827854,0.0008855503,0.02034377],"study_design_scores_gemma":[0.00047516602,0.000008863488,0.71002555,0.00004989291,0.000021199114,6.46961e-7,0.000069182664,0.27415067,0.0007220508,0.0129832355,0.0011779359,0.00031560732],"about_ca_topic_score_codex":0.0015869965,"about_ca_topic_score_gemma":0.00016833663,"teacher_disagreement_score":0.2943944,"about_ca_system_score_codex":0.000013336917,"about_ca_system_score_gemma":0.000009782316,"threshold_uncertainty_score":0.78374416},"labels":[],"label_agreement":null},{"id":"W2784221923","doi":"10.1109/bigdata.2017.8257976","title":"Bias correction in clustering coefficient estimation","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Estimator; Clustering coefficient; Cluster analysis; Sampling bias; Computer science; Metric (unit); Graph; Algorithm; Sample size determination; Statistics; Data mining; Mathematics; Artificial intelligence; Theoretical computer science","score_opus":0.03312817815773735,"score_gpt":0.3117219289462506,"score_spread":0.2785937507885133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784221923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21019667,0.0000015975527,0.72762865,0.00006314917,0.00013897958,0.00007875395,3.222536e-7,0.000046532816,0.06184536],"genre_scores_gemma":[0.9960009,2.528863e-7,0.0029550863,0.0000067615597,0.00006035835,0.000010451701,0.000006559951,0.0000040467166,0.00095558196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996464,0.000011352958,0.00010668954,0.000098845565,0.000052941636,0.000083741936],"domain_scores_gemma":[0.9996318,0.000016121488,0.00007881508,0.00024239367,0.00001572862,0.000015102951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011604303,0.00004919863,0.00007478947,0.000048135666,0.00013615732,0.0001037235,0.00010203344,0.000010002664,0.00024763952],"category_scores_gemma":[0.000006597862,0.00004649323,0.000032787553,0.000039692328,0.000013739554,0.00009331923,0.00006424261,0.00004839137,0.00001938893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000078287985,0.00011871317,0.31207776,0.000002853963,0.00001794815,6.863953e-7,0.00015762505,0.055012047,0.0001491733,0.008580729,0.003414398,0.6204602],"study_design_scores_gemma":[0.00008300159,0.000006823255,0.031881005,0.000015493424,0.000004172879,1.1940962e-7,0.000033077333,0.965324,0.00089553616,0.0012347224,0.00046379576,0.000058272777],"about_ca_topic_score_codex":0.0014068845,"about_ca_topic_score_gemma":0.0003060693,"teacher_disagreement_score":0.91031194,"about_ca_system_score_codex":0.000020061456,"about_ca_system_score_gemma":0.0000058647774,"threshold_uncertainty_score":0.2711479},"labels":[],"label_agreement":null},{"id":"W2784643248","doi":"","title":"Reformulation of a locally optimal heuristic for modularity maximization","year":2012,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Modularity (biology); Computer science; Heuristic; Maximization; Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.01586893080656227,"score_gpt":0.24372330139844164,"score_spread":0.22785437059187938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784643248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046170283,0.000646756,0.94365007,0.0021681797,0.00015047613,0.0010715043,0.0002204017,0.000113467235,0.005808887],"genre_scores_gemma":[0.74163496,0.000098035525,0.25165865,0.000011609041,0.00009851689,0.0001604617,0.002752235,0.00005580116,0.0035296946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943421,0.00292465,0.0010966102,0.00073055975,0.0004026505,0.00050342333],"domain_scores_gemma":[0.99146295,0.0011468665,0.0013859397,0.0019227723,0.0038833928,0.00019806635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048920065,0.00045661748,0.0007167857,0.00019214857,0.0003559001,0.00018828618,0.0009431532,0.000323174,0.00023489524],"category_scores_gemma":[0.00038138372,0.0005297899,0.00057624775,0.00045311038,0.00026796374,0.0002378693,0.00090608577,0.00049284607,0.000019774025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056776567,0.0016223412,0.009947979,0.0004122838,0.00039571946,2.7883874e-7,0.003966136,0.013871725,0.002148412,0.8529271,0.00047728038,0.11417398],"study_design_scores_gemma":[0.00093306904,0.0000016894052,0.01041262,0.0022474213,0.00061806676,0.000002119103,0.0001046014,0.8845499,0.037614595,0.04376463,0.018923502,0.0008277795],"about_ca_topic_score_codex":0.0018415782,"about_ca_topic_score_gemma":0.00037090416,"teacher_disagreement_score":0.8706782,"about_ca_system_score_codex":0.00023451669,"about_ca_system_score_gemma":0.000294935,"threshold_uncertainty_score":0.9997154},"labels":[],"label_agreement":null},{"id":"W2786054699","doi":"","title":"A novel method to determine the number of latent dimensions with SVD","year":2018,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Silhouette; Singular value decomposition; Cluster analysis; Mathematics; Set (abstract data type); Algorithm; Data set; Eigenvalues and eigenvectors; Computer science; Pattern recognition (psychology); Artificial intelligence; Statistics","score_opus":0.02484844361583426,"score_gpt":0.3229603015088003,"score_spread":0.298111857892966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786054699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12483653,9.1243555e-7,0.854703,0.0002511482,0.000008114728,0.00012560967,0.0000035363546,0.000026659145,0.020044506],"genre_scores_gemma":[0.7198353,4.5290967e-8,0.27913192,0.0001034146,0.000083392944,0.000014447787,0.0000014571766,0.000006444163,0.0008235842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995154,0.000021368593,0.00012653354,0.00012639766,0.000092043316,0.00011825753],"domain_scores_gemma":[0.99943066,0.00006860665,0.000049184535,0.00030653927,0.000105887484,0.000039123915],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012780605,0.0000777552,0.00013522593,0.000020129672,0.00005972962,0.0000109371695,0.00013171072,0.000008306379,0.0012294928],"category_scores_gemma":[0.0000011066036,0.000040543586,0.000058849444,0.00023147489,0.00004065344,0.000020822808,0.0001004559,0.000041030693,0.000032743672],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014541524,0.000998665,0.2893253,0.0000078904,0.0012403502,0.0000012361735,0.0014750898,0.0003409288,0.13870557,0.36706686,0.03021319,0.1704795],"study_design_scores_gemma":[0.0026682857,0.0013683734,0.09472308,0.00030371995,0.0014898754,0.00004552817,0.0008792345,0.09713511,0.6098619,0.04566769,0.14380959,0.0020475672],"about_ca_topic_score_codex":0.0007655733,"about_ca_topic_score_gemma":0.00008401207,"teacher_disagreement_score":0.5949988,"about_ca_system_score_codex":0.0000045695947,"about_ca_system_score_gemma":0.000012839111,"threshold_uncertainty_score":0.9996835},"labels":[],"label_agreement":null},{"id":"W2790068678","doi":"10.26599/tst.2018.9010053","title":"Hierarchical community detection based on partial matrix convergence using random walks","year":2018,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"PMAC; Random walk; Computer science; Convergence (economics); Stochastic matrix; Algorithm; Theoretical computer science; Mathematics; Machine learning; Statistics; Markov chain","score_opus":0.021259431953329813,"score_gpt":0.3226243666990314,"score_spread":0.3013649347457016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790068678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62367696,0.0000034440488,0.3746321,0.00017595314,0.00014043179,0.00013460375,0.0000018617931,0.00028609883,0.00094858056],"genre_scores_gemma":[0.99420136,2.8031198e-7,0.0054963906,0.00006249485,0.00018859906,0.000017745024,0.0000021308126,0.00001306856,0.000017906832],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982764,0.00015237062,0.00029497058,0.00040330333,0.0003241176,0.0005488045],"domain_scores_gemma":[0.99861115,0.00010189024,0.00016012469,0.0008517639,0.00018652678,0.00008851647],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0010640026,0.00018744964,0.00027312912,0.00087395764,0.001523425,0.000080443126,0.000887153,0.00009720666,0.00025149225],"category_scores_gemma":[0.00007205984,0.00017859254,0.000092569215,0.0029075975,0.0034109757,0.00015574093,0.00027590457,0.0006518886,0.000047576974],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036469736,0.0007025782,0.039252367,0.0000095703845,0.000048145528,0.000004643705,0.0004587429,0.0023256412,0.79010975,0.03628111,0.00009924838,0.1303435],"study_design_scores_gemma":[0.0005663707,0.0003481329,0.0004039998,0.00003379745,0.00003403187,0.0000037208417,0.00013587774,0.5700725,0.40527737,0.02162093,0.0012451448,0.000258153],"about_ca_topic_score_codex":0.0004305665,"about_ca_topic_score_gemma":0.000031499516,"teacher_disagreement_score":0.5677468,"about_ca_system_score_codex":0.00013776489,"about_ca_system_score_gemma":0.00018060532,"threshold_uncertainty_score":0.9997765},"labels":[],"label_agreement":null},{"id":"W2791438573","doi":"10.1007/s13042-018-0798-5","title":"Topic specific emotion detection for retweet prediction","year":2018,"lang":"en","type":"article","venue":"International Journal of Machine Learning and Cybernetics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Sentiment analysis; Computer science; Preference; Task (project management); Field (mathematics); Topic model; Social media; Social network (sociolinguistics); Information retrieval; Data science; World Wide Web; Artificial intelligence","score_opus":0.008949833579610511,"score_gpt":0.2716502070586415,"score_spread":0.262700373479031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791438573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5971554,0.00013842432,0.4002575,0.00024526473,0.000539552,0.00005482248,0.000007766971,0.000020358912,0.0015809052],"genre_scores_gemma":[0.99396026,0.00007060929,0.0026032,0.000012144654,0.0029230241,0.0000014239315,0.000016001242,0.000008484786,0.0004048701],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999378,0.000038215763,0.00025609924,0.00008395944,0.00017169151,0.0000720147],"domain_scores_gemma":[0.99921376,0.00005476534,0.00025934647,0.00003924417,0.0004002427,0.000032664502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024196673,0.00006810503,0.0001013193,0.00010642041,0.000073790085,0.000060357175,0.00009623869,0.000024257748,0.00012409956],"category_scores_gemma":[0.0000187689,0.00006250732,0.00008176943,0.00004820495,0.000034226086,0.00006869685,0.000025690242,0.00016915142,0.0000018291969],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016328541,0.000084730185,0.20074736,0.0000038809135,0.00032320956,0.0000014179337,0.00042126756,0.00035824606,0.004326291,0.004044258,0.00102537,0.78850067],"study_design_scores_gemma":[0.0029021504,0.0023412802,0.0749578,0.00020937003,0.00024715893,0.00010182239,0.0003820929,0.16057612,0.018454058,0.05097758,0.6884469,0.00040371256],"about_ca_topic_score_codex":0.00002649218,"about_ca_topic_score_gemma":0.00000512699,"teacher_disagreement_score":0.78809696,"about_ca_system_score_codex":0.00002484719,"about_ca_system_score_gemma":0.000008063447,"threshold_uncertainty_score":0.25489748},"labels":[],"label_agreement":null},{"id":"W2792828486","doi":"10.1017/nws.2017.19","title":"Temporal evolution of the degree distribution of alters in growing networks","year":2018,"lang":"en","type":"article","venue":"Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; James S. McDonnell Foundation","keywords":"Observability; Degree distribution; Preferential attachment; Computer science; Degree (music); Statistical physics; Network topology; Complex network; Synchronization (alternating current); Network dynamics; Evolving networks; Random graph; Interdependent networks; Theoretical computer science; Mathematics; Applied mathematics; Physics; Graph; Discrete mathematics","score_opus":0.017431105289494254,"score_gpt":0.2574856976997779,"score_spread":0.24005459241028365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792828486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80491346,0.00005671093,0.19266368,0.000050825674,0.00020883876,0.0001458,0.0000028924185,0.000014747056,0.0019430227],"genre_scores_gemma":[0.99886674,7.812838e-7,0.00073418865,0.000010782312,0.0003639479,0.000005103643,0.000004519017,0.000003799938,0.000010168342],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998856,0.00005903985,0.00030671782,0.00020676538,0.00026839616,0.00030305708],"domain_scores_gemma":[0.99919605,0.000039928556,0.00023528592,0.00035636322,0.00014027297,0.000032068452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000886209,0.000083249215,0.00015874954,0.000047005506,0.00017427331,0.000014828495,0.00053645787,0.000021835986,0.00002219556],"category_scores_gemma":[0.0000111991685,0.00006420622,0.000085675034,0.002379386,0.0008528266,0.00021741555,0.00020912568,0.00010736084,6.670207e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008813614,0.000042257332,0.9171911,0.000002018624,0.0000072440375,5.4745744e-8,0.000046405385,0.024087152,0.00053263165,0.0470767,0.0009990421,0.010006606],"study_design_scores_gemma":[0.00016133624,0.000059744438,0.644463,0.0001654141,0.000021258733,2.9683764e-7,0.00007602591,0.3346076,0.002339336,0.017549302,0.00041602176,0.00014069253],"about_ca_topic_score_codex":0.0006692659,"about_ca_topic_score_gemma":0.00011526034,"teacher_disagreement_score":0.31052044,"about_ca_system_score_codex":0.0000857677,"about_ca_system_score_gemma":0.00009827191,"threshold_uncertainty_score":0.3142275},"labels":[],"label_agreement":null},{"id":"W2794488167","doi":"10.5539/nct.v3n1p1","title":"Controllability of Complex Power Networks","year":2017,"lang":"en","type":"article","venue":"Network and Communication Technologies","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Controllability; Power network; Network controllability; Power (physics); Complex network; Computer science; Basis (linear algebra); Control theory (sociology); Electric power system; Mathematics; Artificial intelligence; Control (management); Physics; Statistics; Centrality; Applied mathematics","score_opus":0.01698717356125295,"score_gpt":0.2807235702971405,"score_spread":0.26373639673588756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794488167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57737786,0.014849256,0.18901631,0.01109039,0.00020940148,0.0020240224,0.000042453983,0.0031491313,0.20224115],"genre_scores_gemma":[0.9930616,0.00034077512,0.006437697,0.000015574458,0.000028327297,0.00004485407,0.000017250115,0.000009516952,0.00004437712],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991166,0.000069377995,0.00032360447,0.00019162375,0.00008658545,0.00021220378],"domain_scores_gemma":[0.9967565,0.00015940637,0.00048983615,0.0024553197,0.000117818454,0.000021097452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036503412,0.00014356193,0.00035847287,0.000037621274,0.0007069408,0.00010087517,0.0011740485,0.00008586883,0.00008776115],"category_scores_gemma":[0.000030143941,0.00013110836,0.000077618715,0.00010315307,0.000810565,0.00012330335,0.0009789298,0.00023631161,0.0000012392841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029759114,0.00009404308,0.38782838,0.0000054270613,0.00016061164,1.2728908e-7,0.000043700762,0.00052564463,0.00011102874,0.37423652,0.0059402604,0.23102447],"study_design_scores_gemma":[0.0010396979,0.00016136274,0.26403573,0.00013235776,0.00013143198,0.0000010351403,0.0010204508,0.03862707,0.0006411956,0.6581004,0.035519622,0.0005895998],"about_ca_topic_score_codex":0.00014320169,"about_ca_topic_score_gemma":0.000030630075,"teacher_disagreement_score":0.41568375,"about_ca_system_score_codex":0.000008982528,"about_ca_system_score_gemma":0.00000961484,"threshold_uncertainty_score":0.5437288},"labels":[],"label_agreement":null},{"id":"W2794902319","doi":"10.29007/ptck","title":"Topology Vulnerability Analysis of several Urban Metro Networks","year":2018,"lang":"en","type":"paratext","venue":"EasyChair preprint","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Public Safety Canada","funders":"","keywords":"Betweenness centrality; Clustering coefficient; Vulnerability (computing); Node (physics); Computer science; Metropolitan area; Complex network; Average path length; Transport engineering; Computer security; Computer network; Geography; Cluster analysis; Shortest path problem; Engineering; Mathematics; Centrality; Statistics; Graph; Artificial intelligence","score_opus":0.014456861388273167,"score_gpt":0.30465435453395573,"score_spread":0.29019749314568255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794902319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010226712,0.00025123035,0.8896276,0.00006577276,0.00072423264,0.00051525125,0.00017591266,0.00008450567,0.09832883],"genre_scores_gemma":[0.98154426,0.00001148793,0.0017950867,0.00004166936,0.0021292886,0.00013918389,0.001052818,0.00003920659,0.013246978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624985,0.00051739236,0.001108756,0.0012208008,0.0003297983,0.0005733924],"domain_scores_gemma":[0.99603134,0.00018574804,0.0009467676,0.0023076504,0.00036668405,0.00016179151],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00073999277,0.0005690147,0.0019092835,0.00062572066,0.00013243208,0.000048065853,0.00093779975,0.0003277113,0.047328703],"category_scores_gemma":[0.000010444019,0.0005647032,0.0016462022,0.0014986281,0.00034622804,0.000058273217,0.00074766186,0.000738612,0.00041103986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008024872,0.0005394261,0.0844917,0.000037110833,0.0153773315,8.272865e-7,0.00031775972,0.61000127,0.000009101752,0.0028801442,0.28118107,0.005084008],"study_design_scores_gemma":[0.00075663807,0.00036604513,0.04429667,0.00016367945,0.004547824,7.349301e-7,0.00021992017,0.7111635,0.0008493325,0.008217323,0.22686283,0.0025554576],"about_ca_topic_score_codex":0.0023282121,"about_ca_topic_score_gemma":0.000180517,"teacher_disagreement_score":0.9713176,"about_ca_system_score_codex":0.00012819153,"about_ca_system_score_gemma":0.00011660029,"threshold_uncertainty_score":0.99968046},"labels":[],"label_agreement":null},{"id":"W2795290172","doi":"10.1371/journal.pone.0193192","title":"Quantifying the impact of scholarly papers based on higher-order weighted citations","year":2018,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Population and Public Health; King Saud University","keywords":"PageRank; Citation; Citation analysis; Computer science; Order (exchange); Information retrieval; Citation impact; Impact factor; Data science; Library science; Biology","score_opus":0.07002935799840375,"score_gpt":0.30911727559433466,"score_spread":0.2390879175959309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795290172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96425736,0.000015448193,0.0019437397,0.0004771897,0.000016066035,0.00020383864,0.000022641276,0.00006898297,0.032994717],"genre_scores_gemma":[0.9946216,7.5143157e-7,0.0047911825,0.000053965534,0.0002998539,0.000023792036,0.000028996845,0.000015408716,0.00016448747],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99922776,0.00007384996,0.00017172266,0.00014572732,0.0002273977,0.0001535483],"domain_scores_gemma":[0.9990222,0.00016047494,0.00011418503,0.00039195956,0.00027371442,0.000037486338],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014126494,0.000107156586,0.00017510734,0.000084355794,0.00016641011,0.00007959233,0.00019440374,0.00002240665,0.0022339],"category_scores_gemma":[0.000012575403,0.00007198542,0.00013790414,0.0004991835,0.0000823584,0.000119854296,0.000025614205,0.00015473554,0.00003716785],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016352777,0.006493084,0.7149855,0.000029902601,0.004232797,7.3867295e-7,0.0006109808,0.00036060528,0.19852918,0.05943152,0.0065035345,0.008658624],"study_design_scores_gemma":[0.0021402757,0.0021675625,0.66098344,0.00090050505,0.0015922333,8.417888e-8,0.00026243532,0.19407667,0.11736887,0.01768492,0.0016722998,0.001150684],"about_ca_topic_score_codex":0.00033126184,"about_ca_topic_score_gemma":0.00001204352,"teacher_disagreement_score":0.19371606,"about_ca_system_score_codex":0.000023743309,"about_ca_system_score_gemma":0.000044762615,"threshold_uncertainty_score":0.9986782},"labels":[],"label_agreement":null},{"id":"W2795523777","doi":"10.1016/j.camwa.2018.02.035","title":"A non-Markovian SIR network model with fixed infectious period and preventive rewiring","year":2018,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Pairwise comparison; Epidemic model; Basic reproduction number; Transmission (telecommunications); Infectious disease (medical specialty); Mathematics; Outbreak; Node (physics); Disease; Markov process; Computation; Computer science; Statistics; Biology; Medicine; Virology; Algorithm","score_opus":0.005843521061341865,"score_gpt":0.233525681804154,"score_spread":0.22768216074281214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795523777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042875107,0.000011523878,0.9498349,0.000053486026,0.00000633582,0.00076990365,0.0000041799517,0.00013135595,0.0063132127],"genre_scores_gemma":[0.66666776,0.000001237389,0.33251524,0.000024861754,0.00021128023,0.00041860365,0.000014542103,0.000026754093,0.000119701595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904543,0.000012516371,0.00022866976,0.00032963324,0.00012585061,0.00025789588],"domain_scores_gemma":[0.9989741,0.00006569113,0.00020509778,0.00051455764,0.00014390447,0.00009665188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009141433,0.00021359923,0.00028135176,0.000061826744,0.00035329492,0.00011600472,0.00019917973,0.000027239192,0.000016353464],"category_scores_gemma":[6.479337e-7,0.00017459608,0.000048313774,0.00039672546,0.00018121785,0.00008736117,0.00013236768,0.00012395313,0.000008779221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016115693,0.0033943553,0.11004525,0.0006603852,0.0045718816,0.000006855134,0.021653255,0.10308996,0.00061831315,0.5415721,0.023468062,0.19075847],"study_design_scores_gemma":[0.0005008954,0.00019146263,0.00067428185,0.00025597366,0.00025478858,0.000012333409,0.0001908429,0.9302314,0.00010164917,0.065925986,0.0012095206,0.0004508925],"about_ca_topic_score_codex":0.000011476699,"about_ca_topic_score_gemma":0.000026445525,"teacher_disagreement_score":0.8271414,"about_ca_system_score_codex":0.000024310964,"about_ca_system_score_gemma":0.000045434528,"threshold_uncertainty_score":0.71198213},"labels":[],"label_agreement":null},{"id":"W2796216221","doi":"10.1177/0963662518761733","title":"Identifying diffusion patterns of research articles on Twitter: A case study of online engagement with open access articles","year":2018,"lang":"en","type":"article","venue":"Public Understanding of Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Simon Fraser University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Open science; Social media; Science communication; Sociology; Scholarly communication; Citizen science; Ask price; World Wide Web; Altmetrics; Online community; Public engagement; Data science; Public relations; Computer science; Political science; Biology; Science education; Publishing; Business","score_opus":0.50896915729909,"score_gpt":0.49662623253611704,"score_spread":0.01234292476297294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796216221","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96721405,0.0000018435338,0.031666577,0.00014610196,0.000017818847,0.00043485084,0.000005407892,0.000013108581,0.0005002314],"genre_scores_gemma":[0.9992802,7.697605e-7,0.0006444073,0.000006315426,0.00003245316,0.000012994395,0.0000010831084,0.000007875936,0.000013901553],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9978277,0.00016571718,0.00037132128,0.0003587165,0.00094658334,0.0003299293],"domain_scores_gemma":[0.9984764,0.00019617479,0.00028400868,0.0004961622,0.00045727956,0.00009000579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002881206,0.000097280354,0.00023178803,0.00074365933,0.0005672697,0.0004536173,0.001341408,0.000009673142,0.00012861924],"category_scores_gemma":[0.00003649474,0.000074935975,0.0000300079,0.0024379669,0.0011704317,0.00085516536,0.0016804052,0.00013520113,3.5891742e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006484748,0.0030802498,0.94370943,0.00003387287,0.00008888314,0.000014531839,0.015173807,0.000026970743,0.011692062,0.02102828,0.00006047397,0.0050265607],"study_design_scores_gemma":[0.0026663686,0.004180921,0.08483757,0.00087415334,0.00010988908,0.000011658533,0.74957347,0.013003196,0.10700311,0.037282575,0.000019638108,0.00043747746],"about_ca_topic_score_codex":0.005020816,"about_ca_topic_score_gemma":0.0012619218,"teacher_disagreement_score":0.8588719,"about_ca_system_score_codex":0.000115033916,"about_ca_system_score_gemma":0.00013726972,"threshold_uncertainty_score":0.7590005},"labels":[{"model":"gemma","categories":["scholarly_communication","open_science"],"domain":null,"study_design":"observational","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":["bibliometrics","scholarly_communication"],"domain":null,"study_design":"observational","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W2798490332","doi":"10.1145/3184558.3186240","title":"Uniform Random Sampling Not Recommended","year":2018,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random graph; Statistics; Sampling (signal processing); Estimator; Degree (music); Degree distribution; Variance (accounting); Mathematics; Graph; Computer science; Algorithm; Discrete mathematics; Combinatorics; Complex network","score_opus":0.035837013180855845,"score_gpt":0.3116186354306156,"score_spread":0.2757816222497597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798490332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0330712,0.0000028642658,0.6258766,0.00042488181,0.00007230041,0.000121891826,0.0000035299124,0.00019753649,0.34022918],"genre_scores_gemma":[0.9721711,6.463614e-7,0.025094269,0.00020941379,0.000704305,0.00001137461,0.000018916278,0.0000101142605,0.0017798406],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940115,0.000017989356,0.00017043749,0.00015474408,0.00007378304,0.0001819188],"domain_scores_gemma":[0.99953073,0.000064318454,0.000050339957,0.00024681483,0.00006268414,0.00004511604],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001721075,0.00009280291,0.00015375955,0.00004716356,0.00012244073,0.000041999916,0.00014223349,0.000015755586,0.0068581454],"category_scores_gemma":[0.0000022204943,0.00007764713,0.00010218034,0.00015244387,0.00002751784,0.00006306762,0.00007043507,0.00006888385,0.0001472419],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001766053,0.00020327186,0.0222028,0.000004412739,0.00043251927,4.2013914e-7,0.00031549777,0.000020771293,0.0035171905,0.38363156,0.07785959,0.51163536],"study_design_scores_gemma":[0.0032673858,0.00018414174,0.0019161751,0.000041414845,0.00015529867,0.0000010700606,0.00041740132,0.026577339,0.09528289,0.18597957,0.6852653,0.00091202196],"about_ca_topic_score_codex":0.00021766653,"about_ca_topic_score_gemma":0.000032572385,"teacher_disagreement_score":0.9390999,"about_ca_system_score_codex":0.000012226989,"about_ca_system_score_gemma":0.000011443285,"threshold_uncertainty_score":0.9940497},"labels":[],"label_agreement":null},{"id":"W2799472749","doi":"10.1002/sim.7658","title":"Exposure, hazard, and survival analysis of diffusion on social networks","year":2018,"lang":"en","type":"article","venue":"Statistics in Medicine","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Yale Center for Clinical Investigation, Yale School of Medicine; Eunice Kennedy Shriver National Institute of Child Health and Human Development; National Center for Advancing Translational Sciences; National Institute of Mental Health; Canadian Institutes of Health Research; National Institute on Aging; National Institutes of Health; Yale University; Bill and Melinda Gates Foundation","keywords":"Social network (sociolinguistics); Psychological intervention; Realization (probability); Diffusion; Computer science; Population; Social network analysis; Relevance (law); Diffusion of innovations; Intervention (counseling); Process (computing); Econometrics; Actuarial science; Data science; Psychology; Statistics; Business; Sociology; Economics; Marketing; Demography; Mathematics; Political science","score_opus":0.0185726490180078,"score_gpt":0.32509458966867677,"score_spread":0.30652194065066896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799472749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4136183,0.00006222368,0.5781394,0.00011717421,0.00014712146,0.00012548504,0.000108887005,0.000021935168,0.0076594525],"genre_scores_gemma":[0.9969422,0.000018566336,0.0021431344,0.00003538524,0.0006208872,0.000004488977,0.00016508841,0.000008913207,0.00006131317],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990142,0.00008227518,0.0003374629,0.0001900675,0.00021957389,0.00015642328],"domain_scores_gemma":[0.9992856,0.00026264455,0.00014620714,0.00016508004,0.00010055596,0.000039936327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036376662,0.00011416026,0.0004837171,0.00026915834,0.000069017064,0.000005312097,0.000092893235,0.00003071035,0.00042766496],"category_scores_gemma":[0.000023475788,0.000095938594,0.000038811333,0.00072548265,0.00031115973,0.000012605866,0.000050877672,0.00012758376,7.4334577e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009711486,0.00018230165,0.5554659,0.000011577302,0.00096366,0.0000041670414,0.0010635341,0.00012640079,0.0002505753,0.29743478,0.010454163,0.13394584],"study_design_scores_gemma":[0.0010108921,0.00045947556,0.8546743,0.00006695902,0.0012735052,7.377491e-8,0.00041902318,0.10986293,0.000036343063,0.031209398,0.0007656762,0.00022145589],"about_ca_topic_score_codex":0.00043424344,"about_ca_topic_score_gemma":0.00036866078,"teacher_disagreement_score":0.58332396,"about_ca_system_score_codex":0.000013614338,"about_ca_system_score_gemma":0.000008632656,"threshold_uncertainty_score":0.46826315},"labels":[],"label_agreement":null},{"id":"W2799873964","doi":"10.11606/d.100.2018.tde-31012018-125636","title":"Estudo da propagação de postagens de notícias no Twitter","year":2018,"lang":"pt","type":"dissertation","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Air (Canada)","funders":"","keywords":"Agency (philosophy); Identification (biology); Duration (music); Computer science; Social media; World Wide Web; Sociology; Art","score_opus":0.02146934002653732,"score_gpt":0.3121087325349493,"score_spread":0.290639392508412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799873964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7068762,0.00013663387,0.1657924,0.00029306224,0.0006625858,0.0017861896,0.00008933277,0.0005116461,0.123851925],"genre_scores_gemma":[0.8825278,0.00002055603,0.015865793,0.00046988553,0.0020628693,0.00019537931,0.0025134077,0.00016932502,0.096174985],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99665076,0.00019081603,0.00077018957,0.00091027503,0.00040851682,0.0010694191],"domain_scores_gemma":[0.99745375,0.000089580244,0.0005444352,0.0009697179,0.0006566895,0.00028580314],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046329093,0.0008053947,0.0008377144,0.0002548346,0.00037762997,0.00038572535,0.00073666737,0.00035636764,0.008131974],"category_scores_gemma":[0.00001844757,0.00078236253,0.00069730205,0.0004335986,0.00009110445,0.00012440693,0.00017073193,0.0006741527,0.0021346256],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082036154,0.0037760977,0.20095304,0.0008050026,0.0068931556,0.00009796958,0.025890123,0.00012655684,0.027288709,0.015727619,0.6339027,0.083718635],"study_design_scores_gemma":[0.0041366587,0.0034965063,0.059253655,0.0033914824,0.010406848,0.000029227427,0.02277867,0.16096869,0.12340711,0.023852296,0.57448786,0.013790962],"about_ca_topic_score_codex":0.0018573542,"about_ca_topic_score_gemma":0.00033995655,"teacher_disagreement_score":0.1756516,"about_ca_system_score_codex":0.00025752402,"about_ca_system_score_gemma":0.00059094594,"threshold_uncertainty_score":0.9994627},"labels":[],"label_agreement":null},{"id":"W2801814764","doi":"10.1016/j.crhy.2018.09.005","title":"Robustness of spatial networks and networks of networks","year":2018,"lang":"en","type":"article","venue":"Comptes Rendus Physique","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Science and Technology Agency; Defense Threat Reduction Agency; Ministry of Science and Technology, Israel; Office of Naval Research; Azrieli Foundation; Israel Science Foundation","keywords":"Interdependent networks; Computer science; Resilience (materials science); Cascading failure; Robustness (evolution); Percolation (cognitive psychology); Embedding; Interdependence; Distributed computing; Complex network; Computer network; Electric power system; Power (physics); Artificial intelligence; Physics","score_opus":0.009720181565310794,"score_gpt":0.24581466662948123,"score_spread":0.23609448506417044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801814764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1242432,0.0006608173,0.87258834,0.000022212986,0.00018471041,0.00023145966,0.000006285795,0.00006686481,0.0019960897],"genre_scores_gemma":[0.9960172,0.00007044317,0.0015096486,0.000020185567,0.002195128,0.000023581935,0.000068178946,0.000040281437,0.000055357148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830395,0.00013831646,0.0005930456,0.00039781525,0.00016199208,0.00040488888],"domain_scores_gemma":[0.9983155,0.00018824542,0.0004995899,0.0006078474,0.00027819106,0.00011062922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002135927,0.0003109587,0.00072005315,0.00009563584,0.000117939475,0.00003020497,0.0003723609,0.00012027924,0.00041125595],"category_scores_gemma":[0.0000036570555,0.00030461946,0.00021593149,0.00043421742,0.0005063662,0.00009646529,0.00030990326,0.00032697004,0.0000011806445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012423261,0.00037085018,0.07908604,0.000032653366,0.0005608857,0.0000010114859,0.00007772832,0.74800295,0.00047557388,0.008825622,0.012350424,0.15009204],"study_design_scores_gemma":[0.0003369867,0.0001685207,0.01417959,0.00012355822,0.00011226332,9.5216626e-7,0.000030167577,0.9823656,0.0012646676,0.00069270295,0.00041758042,0.0003074204],"about_ca_topic_score_codex":0.00069961726,"about_ca_topic_score_gemma":0.00010732644,"teacher_disagreement_score":0.871774,"about_ca_system_score_codex":0.000015592123,"about_ca_system_score_gemma":0.000025762263,"threshold_uncertainty_score":0.9999406},"labels":[],"label_agreement":null},{"id":"W2802473464","doi":"10.3968/10278","title":"Study on the Main Factors Affecting the Network Public Opinion Recognition Hotness Evaluation","year":2018,"lang":"en","type":"article","venue":"Canadian social science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Public opinion; Government (linguistics); Opinion leadership; Perspective (graphical); Identification (biology); Public relations; Business; Computer science; Political science; Artificial intelligence; Law; Ecology","score_opus":0.10287693941624883,"score_gpt":0.3443100074114696,"score_spread":0.2414330679952208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802473464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9521633,0.0000029319226,0.00034311667,0.00083848217,0.00031748356,0.0006350835,0.000007232288,0.000022646665,0.045669757],"genre_scores_gemma":[0.9980601,9.536674e-8,0.0000088452225,0.00014682897,0.0017122241,0.000044266457,0.000011018646,0.000006148118,0.000010470752],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99851274,0.00032104063,0.00011079064,0.00023839166,0.00040755278,0.00040947416],"domain_scores_gemma":[0.99923366,0.0001412127,0.000094312585,0.0002068645,0.00021949869,0.000104434825],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0031798754,0.000091475835,0.00007904248,0.000059828017,0.003156089,0.00031725745,0.00045894206,0.000018330675,0.00031684863],"category_scores_gemma":[0.00007009607,0.000058268677,0.000049475333,0.001518033,0.00038449888,0.00014534045,0.000044375312,0.0001370335,0.000019922416],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053337026,0.0001192809,0.5506475,0.0000011095591,0.00010075394,4.9348216e-7,0.021338347,0.00001704164,0.000110242334,0.06626484,0.0279872,0.33340785],"study_design_scores_gemma":[0.0003372446,0.00030220562,0.8284713,0.00004617055,0.000114254115,4.012727e-7,0.10713997,0.0039015638,0.00038715682,0.047337558,0.011269179,0.00069301564],"about_ca_topic_score_codex":0.009835978,"about_ca_topic_score_gemma":0.023625676,"teacher_disagreement_score":0.33271486,"about_ca_system_score_codex":0.00031967193,"about_ca_system_score_gemma":0.0004106143,"threshold_uncertainty_score":0.99814165},"labels":[],"label_agreement":null},{"id":"W2803567385","doi":"10.1140/epjds/s13688-018-0166-4","title":"Prestige drives epistemic inequality in the diffusion of scientific ideas","year":2018,"lang":"en","type":"article","venue":"EPJ Data Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Science Foundation","keywords":"Prestige; Competition (biology); Quality (philosophy); Citation; Set (abstract data type); Sociology; Mechanism (biology); Work (physics); Computer science; Inequality; Epistemology; Positive economics; Public relations; Political science; Economics; Mathematics; Law; Physics","score_opus":0.053099800836707976,"score_gpt":0.3519476272919705,"score_spread":0.29884782645526253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803567385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9910631,0.000018301625,0.005951061,0.00014325444,0.00007648548,0.0001309862,0.000067825255,0.000013751649,0.0025352442],"genre_scores_gemma":[0.9983202,8.112905e-7,0.001468742,0.000015199395,0.00009687215,0.000004630196,0.000057058933,0.0000023373254,0.000034100638],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985731,0.00009532672,0.00024375778,0.00044036593,0.0004350599,0.00021238903],"domain_scores_gemma":[0.99785936,0.00009798099,0.0001313018,0.0017844382,0.00009269666,0.000034231784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029295094,0.00007182766,0.00011574535,0.00012021113,0.00030206778,0.00014802918,0.0027111717,0.000009085121,0.000100289544],"category_scores_gemma":[0.00007539338,0.000048301372,0.000023089653,0.0014851204,0.0018655725,0.0005790526,0.0010056853,0.000080815735,0.000012574265],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009497825,0.00037623043,0.72843975,0.000013481953,0.000009041855,7.6413914e-7,0.0033547769,0.0000088944,0.099992774,0.13343082,0.0050435974,0.029320383],"study_design_scores_gemma":[0.00035456454,0.00011788389,0.75227994,0.00019377677,0.00004191919,0.00000146569,0.001359179,0.07121553,0.024694296,0.1372088,0.012066352,0.0004662964],"about_ca_topic_score_codex":0.00064558524,"about_ca_topic_score_gemma":0.00015075704,"teacher_disagreement_score":0.07529848,"about_ca_system_score_codex":0.000011712694,"about_ca_system_score_gemma":0.00013147209,"threshold_uncertainty_score":0.687378},"labels":[],"label_agreement":null},{"id":"W2804503763","doi":"10.1145/3109761.3158412","title":"ivga","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Narodowe Centrum Nauki; Dalhousie University","keywords":"Visualization; Computer science; Graph drawing; Hyperlink; Graph; Interactive visualization; Theoretical computer science; Data visualization; Information retrieval; Data science; Data mining; World Wide Web; Web page","score_opus":0.016166658747384776,"score_gpt":0.309573230359802,"score_spread":0.29340657161241723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804503763","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0445478,0.0000027031617,0.037286375,0.0002425102,0.000022737398,0.000028359502,7.0827485e-7,0.0000520314,0.91781676],"genre_scores_gemma":[0.99061143,1.8956919e-7,0.0021893142,0.000018059145,0.00019187202,0.0000042231172,0.000001919332,0.000003102975,0.006979894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978197,0.0000031647562,0.000044256434,0.000067320805,0.00003412293,0.000069147936],"domain_scores_gemma":[0.99950886,0.0000049491227,0.000037487996,0.00041636822,0.000012619332,0.00001969324],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000034253386,0.00003458607,0.00005353325,0.000009169659,0.00018872309,0.00008803538,0.00020081381,0.0000049030255,0.0031752975],"category_scores_gemma":[9.293798e-7,0.000028668717,0.00004838444,0.000008612228,0.00001992655,0.000060815735,0.00007363444,0.000027329887,0.00009614784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.203895e-7,0.000026152158,0.3244853,3.8386597e-7,0.000038816393,3.4209648e-7,0.000010645962,0.0000016294787,0.00019611778,0.51147777,0.037701465,0.12606058],"study_design_scores_gemma":[0.00035633906,0.00002475019,0.18225257,0.0000122821,0.000055260425,2.594352e-7,0.00006154651,0.005240848,0.0152953295,0.42464915,0.37161803,0.00043362504],"about_ca_topic_score_codex":0.00034676233,"about_ca_topic_score_gemma":0.000009903424,"teacher_disagreement_score":0.94606364,"about_ca_system_score_codex":0.0000019040439,"about_ca_system_score_gemma":0.0000036358572,"threshold_uncertainty_score":0.9977359},"labels":[],"label_agreement":null},{"id":"W2805215047","doi":"10.1016/j.jtbi.2018.06.006","title":"Edge-based epidemic spreading in degree-correlated complex networks","year":2018,"lang":"en","type":"article","venue":"Journal of Theoretical Biology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Degree (music); Epidemic model; Degree distribution; Exponential growth; Population; Mathematics; Complex network; Basic reproduction number; Network model; Node (physics); Scale-free network; Statistical physics; Computer science; Statistics; Combinatorics; Physics; Demography; Artificial intelligence","score_opus":0.024642381992067634,"score_gpt":0.3113731357944114,"score_spread":0.28673075380234375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805215047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29578775,0.000113975715,0.6920412,0.00075432484,0.00030691584,0.000113515525,0.0000037389414,0.000027100565,0.010851469],"genre_scores_gemma":[0.9937766,0.0000036352099,0.0049449564,0.00023507826,0.0010054286,0.00000204166,0.0000111099625,0.000013399625,0.00000770143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982675,0.00040088216,0.0007248165,0.00016690663,0.00007485372,0.00036508645],"domain_scores_gemma":[0.99845654,0.00068831915,0.00036882545,0.00020114565,0.00017089689,0.00011424542],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010217369,0.00015864604,0.00052523764,0.00020936025,0.000055945493,0.00001654593,0.00037648936,0.00011661956,0.002939505],"category_scores_gemma":[0.000081224534,0.000120244425,0.00024121495,0.00032851187,0.0007756898,0.000039144645,0.00007692382,0.00050600775,0.000019144007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024595833,0.00015211385,0.17365472,0.0000019667993,0.00013423045,0.0000075385665,0.000028649287,0.00053740176,0.0025662673,0.78959346,0.0025369152,0.030540757],"study_design_scores_gemma":[0.0013155456,0.00090172526,0.009597273,0.00015658088,0.00014719031,0.000019217043,0.000037261674,0.29778543,0.0021482059,0.6849334,0.0026009716,0.00035720767],"about_ca_topic_score_codex":0.000020646596,"about_ca_topic_score_gemma":0.000004795938,"teacher_disagreement_score":0.6979889,"about_ca_system_score_codex":0.000048807444,"about_ca_system_score_gemma":0.00004217504,"threshold_uncertainty_score":0.99797195},"labels":[],"label_agreement":null},{"id":"W2805369415","doi":"10.1007/978-3-319-92871-5_11","title":"A Statistical Performance Analysis of Graph Clustering Algorithms","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Mitacs","keywords":"Computer science; Cluster analysis; Modularity (biology); Graph; Clustering coefficient; Statistical hypothesis testing; Data mining; Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Statistics","score_opus":0.01402015340812746,"score_gpt":0.2661269809264786,"score_spread":0.2521068275183511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805369415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002511931,0.000030698826,0.99474066,0.000010546215,0.00013336206,0.00012767807,0.000036553738,0.000034327793,0.0023742158],"genre_scores_gemma":[0.7382986,0.0000064912224,0.26114213,0.00004250962,0.000350339,0.0000047993135,0.00004463899,0.000018571842,0.00009195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979162,0.000017489885,0.0004905018,0.0007135313,0.00050894666,0.00035330356],"domain_scores_gemma":[0.998518,0.00021989101,0.00028767437,0.00069163385,0.00020323016,0.00007960294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042581582,0.00031286763,0.0007159853,0.0012209037,0.00010921956,0.0000837923,0.000811359,0.0000861842,0.0007226835],"category_scores_gemma":[0.0000051760876,0.00028831448,0.00023345163,0.0011349972,0.00077344617,0.00010291176,0.0004916674,0.00033004343,0.0000068556237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012160568,0.00005040518,0.009513789,0.000034201163,0.00072005036,0.000005309954,0.0004716093,0.08781298,0.000055002638,0.004749966,0.000042713982,0.8965318],"study_design_scores_gemma":[0.00006782526,0.00009206929,0.001545774,0.00012163649,0.0003315617,7.1070644e-7,1.9699618e-7,0.96001506,0.00038021876,0.036998205,0.00012475846,0.0003219663],"about_ca_topic_score_codex":0.00008062378,"about_ca_topic_score_gemma":0.000073384894,"teacher_disagreement_score":0.89620984,"about_ca_system_score_codex":0.0000629573,"about_ca_system_score_gemma":0.000103906954,"threshold_uncertainty_score":0.9999569},"labels":[],"label_agreement":null},{"id":"W2806147190","doi":"","title":"WSCAN-TFP: Weighted SCAN Clustering Algorithm for Team Formation Problem in Social Network.","year":2018,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Windsor","funders":"","keywords":"Cluster analysis; Computer science; Algorithm; Total factor productivity; Artificial intelligence; Economics; Productivity","score_opus":0.04144142364958922,"score_gpt":0.36868575279133015,"score_spread":0.32724432914174095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806147190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031435873,0.00010335695,0.9476254,0.00388098,0.00024395577,0.0033720154,0.00007061517,0.00025630998,0.013011515],"genre_scores_gemma":[0.9425032,0.000019676467,0.04074354,0.0001587659,0.014057791,0.0010403071,0.00014320447,0.00006296139,0.0012705508],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976721,0.0002482732,0.00035629183,0.000300087,0.00050005043,0.00092320447],"domain_scores_gemma":[0.99878097,0.00022407385,0.000097184646,0.00032417077,0.00050497794,0.00006863819],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0030975484,0.00017374851,0.00025583353,0.000064089196,0.0013868485,0.00019042751,0.0005409226,0.00007687281,0.0001203815],"category_scores_gemma":[0.0000051011903,0.00013729888,0.00029945147,0.0010556498,0.0003025377,0.00026845915,0.0003854028,0.00059816637,0.00001863745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052397718,0.00010306072,0.0010811883,0.00003952612,0.00022422634,2.1143386e-7,0.0067187753,0.00018270256,0.0002680299,0.008207918,0.6935912,0.28953075],"study_design_scores_gemma":[0.00069386046,0.00013251112,0.00037006763,0.00005877552,0.000025170471,4.6749344e-7,0.0013796485,0.8358825,0.0010125017,0.09229636,0.06789989,0.00024823984],"about_ca_topic_score_codex":0.0005835702,"about_ca_topic_score_gemma":0.00019083239,"teacher_disagreement_score":0.9110673,"about_ca_system_score_codex":0.00028908422,"about_ca_system_score_gemma":0.0001314763,"threshold_uncertainty_score":0.9999132},"labels":[],"label_agreement":null},{"id":"W2806355177","doi":"10.1007/978-3-319-92058-0_42","title":"Optimizing Scale-Free Network Robustness with the Great Deluge Algorithm","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Robustness (evolution); Computer science; Hill climbing; Metaheuristic; Simulated annealing; Mathematical optimization; Local optimum; Algorithm; Mathematics","score_opus":0.010511854167214538,"score_gpt":0.2276125258001681,"score_spread":0.21710067163295357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806355177","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011492862,0.00021165061,0.9935449,0.00031602127,0.00026535455,0.00036571207,0.000009121048,0.00010738099,0.0050649485],"genre_scores_gemma":[0.026954683,0.000008085404,0.9660689,0.00045884534,0.0055832816,0.000031374886,0.000026104852,0.00008697418,0.0007816984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720037,0.000038545288,0.00034140362,0.0010403377,0.00066825486,0.0007110787],"domain_scores_gemma":[0.99734074,0.0002827076,0.0003038425,0.0016841431,0.00027892756,0.0001096491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006143711,0.00056193536,0.0005689478,0.00021277479,0.0005458849,0.0004184827,0.0025257727,0.00013174674,0.0003198853],"category_scores_gemma":[0.0000028491336,0.0003680777,0.00017987279,0.00062492583,0.0012928318,0.00018199724,0.0012293811,0.00076505664,0.00001017594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008570645,0.000014947024,0.0002262949,0.0000058034543,0.00007088404,0.000010909769,0.00026075137,0.37757874,0.000001620181,0.0015973978,0.0012323876,0.6189917],"study_design_scores_gemma":[0.00025171315,0.00014384014,0.000038101003,0.0004869902,0.000102197526,0.000014492626,8.20555e-7,0.8946124,0.00013523498,0.09798289,0.005423822,0.00080751244],"about_ca_topic_score_codex":0.000060341496,"about_ca_topic_score_gemma":0.0002406316,"teacher_disagreement_score":0.6181842,"about_ca_system_score_codex":0.000111491005,"about_ca_system_score_gemma":0.00018730717,"threshold_uncertainty_score":0.9998771},"labels":[],"label_agreement":null},{"id":"W2806374619","doi":"10.1007/978-3-319-92058-0_64","title":"Detecting Overlapping Communities in Social Networks with Voronoi and Tolerance Rough Sets","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Voronoi diagram; Computer science; Closeness; Measure (data warehouse); Rough set; Centroidal Voronoi tessellation; Theoretical computer science; Mathematics; Data mining; Geometry","score_opus":0.015606209204999394,"score_gpt":0.25068753596876814,"score_spread":0.23508132676376875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806374619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016777966,0.00020796189,0.97959787,0.000049182487,0.00010699536,0.0002190097,0.0000030064425,0.00005532624,0.0029826972],"genre_scores_gemma":[0.9588373,0.000007825994,0.03997685,0.00015946206,0.00093666656,0.000009900195,0.00000963452,0.000030032354,0.000032385065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834156,0.00004479829,0.00033316528,0.000534332,0.00027829525,0.00046783287],"domain_scores_gemma":[0.9989137,0.00028551082,0.00024178435,0.0004121225,0.00009952195,0.00004736764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004721865,0.00037332886,0.0005146353,0.00028837527,0.00041722425,0.00026914195,0.0006097837,0.00012244422,0.00006360486],"category_scores_gemma":[0.000002515601,0.00034797148,0.00006453219,0.00032884695,0.0007889797,0.00020608478,0.000544464,0.0008188738,0.0000011250943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023895165,0.000024047693,0.0103700785,0.000025514955,0.00004374801,0.000008796764,0.0041756327,0.092226446,0.0000075330954,0.0027231702,0.000027744443,0.89034337],"study_design_scores_gemma":[0.00029417637,0.000106701526,0.0013014247,0.0009100222,0.000022487266,0.000005959015,0.000008039536,0.93533397,0.000047913833,0.060636662,0.00062943716,0.0007031949],"about_ca_topic_score_codex":0.00038550928,"about_ca_topic_score_gemma":0.001348599,"teacher_disagreement_score":0.9420593,"about_ca_system_score_codex":0.0001117226,"about_ca_system_score_gemma":0.00008569902,"threshold_uncertainty_score":0.99989724},"labels":[],"label_agreement":null},{"id":"W2807110764","doi":"10.1109/ictai.2017.00121","title":"Deep Fusion of Multiple Networks for Learning Latent Social Communities","year":2017,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Nvidia","keywords":"Computer science; Artificial intelligence; Deep learning; Machine learning; Data science","score_opus":0.03307098078445497,"score_gpt":0.29265910714058047,"score_spread":0.2595881263561255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807110764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1756414,0.000016298274,0.81581837,0.00007173815,0.000035954155,0.00016709491,0.0000022546583,0.000051647632,0.008195235],"genre_scores_gemma":[0.9961234,0.0000029817343,0.0030773326,0.000007129824,0.00026085536,0.000026043308,0.000055841505,0.000010806172,0.00043562683],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954814,0.000031609532,0.00015408453,0.00006675318,0.000057705176,0.00014170913],"domain_scores_gemma":[0.99936134,0.000099363286,0.00020633092,0.00023456798,0.00008069135,0.000017720035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014584734,0.00007876659,0.0001843972,0.000023279548,0.00084227347,0.000058700974,0.00025786896,0.000026416761,0.00023897203],"category_scores_gemma":[0.0000029878424,0.000072040195,0.00016305057,0.00001893154,0.00006702676,0.00006425748,0.00018725944,0.00010806826,7.851147e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048502818,0.0001387842,0.73255104,0.000013289271,0.00020857809,8.820306e-8,0.0009537167,0.008614554,0.0002665407,0.03167609,0.0019932135,0.22353561],"study_design_scores_gemma":[0.0003845453,0.00004040317,0.019544976,0.000015247278,0.00004520713,3.0283015e-8,0.0007511862,0.9724585,0.00040517747,0.0037995067,0.0024242094,0.00013103997],"about_ca_topic_score_codex":0.0013797228,"about_ca_topic_score_gemma":0.000288478,"teacher_disagreement_score":0.96384394,"about_ca_system_score_codex":0.000006415092,"about_ca_system_score_gemma":0.0000051822003,"threshold_uncertainty_score":0.6478172},"labels":[],"label_agreement":null},{"id":"W2808617184","doi":"10.1007/978-3-319-93372-6_25","title":"Sign Prediction in Signed Social Networks Using Inverse Squared Metric","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Metric (unit); Sign (mathematics); Computer science; Node (physics); Neighbourhood (mathematics); Context (archaeology); Metric space; Inverse; Algorithm; Sign test; Theoretical computer science; Topology (electrical circuits); Mathematics; Discrete mathematics; Wilcoxon signed-rank test; Statistics; Combinatorics","score_opus":0.020537586757774378,"score_gpt":0.2616725909505416,"score_spread":0.2411350041927672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808617184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016755601,0.000057376383,0.99499995,0.000024384202,0.00042148115,0.00034205592,0.000008242031,0.000080508406,0.0023904354],"genre_scores_gemma":[0.9492396,0.000001966931,0.04747684,0.00013509346,0.0029485668,0.000009099515,0.000035201,0.000041999523,0.00011160317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749833,0.000059982027,0.0005205386,0.000899948,0.00049705483,0.00052414637],"domain_scores_gemma":[0.9987939,0.00019778,0.00032210382,0.00043905803,0.00017072188,0.00007641189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006601107,0.0004093282,0.00054817833,0.0012139783,0.00025180492,0.00019340638,0.0007548071,0.00024028939,0.00039097082],"category_scores_gemma":[0.000010154778,0.00042074273,0.00018704496,0.0014315344,0.0004959183,0.00022182222,0.00043244133,0.00064965774,0.000009934287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003328027,0.000105876505,0.004287521,0.000020375219,0.0000895208,0.000019119883,0.0011636252,0.43473655,0.00019325175,0.0029991684,0.00065333507,0.5556984],"study_design_scores_gemma":[0.00020517253,0.00007120395,0.00020064239,0.00014320368,0.000036625748,0.0000010944016,7.068719e-7,0.9204666,0.00013454471,0.07810036,0.00025192313,0.00038793843],"about_ca_topic_score_codex":0.00017540925,"about_ca_topic_score_gemma":0.0001253036,"teacher_disagreement_score":0.94756407,"about_ca_system_score_codex":0.00038016064,"about_ca_system_score_gemma":0.00020740635,"threshold_uncertainty_score":0.99982446},"labels":[],"label_agreement":null},{"id":"W2809195697","doi":"10.1016/j.ins.2018.06.051","title":"Extension of neighbor-based link prediction methods for directed, weighted and temporal social networks","year":2018,"lang":"en","type":"article","venue":"Information Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Extension (predicate logic); Link (geometry); Computer science; Artificial intelligence; Social network analysis; Pattern recognition (psychology); Data mining; Mathematics; Social media; Computer network","score_opus":0.02830214709320063,"score_gpt":0.3576625848827984,"score_spread":0.3293604377895978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809195697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022758408,0.000013160287,0.97454953,0.00015278319,0.00008955248,0.00018158634,0.000014234565,0.00007096951,0.0021697725],"genre_scores_gemma":[0.89457375,8.2444507e-7,0.10500979,0.0000514361,0.00028732608,0.000019038205,0.00004946476,0.0000019379181,0.0000064564583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930596,0.000047504487,0.00030974206,0.00009515488,0.00012247874,0.00011914863],"domain_scores_gemma":[0.99924105,0.00011459586,0.0002642939,0.000074060124,0.0002804656,0.000025557378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081811793,0.00007043163,0.00013074915,0.00013150093,0.00034003356,0.000072436764,0.00010108239,0.000033123302,0.000047104204],"category_scores_gemma":[0.000013171443,0.000057137266,0.00005429116,0.00043030834,0.00027256945,0.00057686755,0.000028323711,0.000039687697,7.9330835e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003628176,0.000020013213,0.01895509,0.000009719195,0.000022700475,4.9243516e-9,0.00048063273,0.00019838936,0.00033176458,0.011809779,0.0021424685,0.96599317],"study_design_scores_gemma":[0.00019011943,0.00011376916,0.0067519452,0.000012504187,0.000018928795,8.36118e-8,0.0000977201,0.9751695,0.0022254232,0.0060670716,0.009283318,0.000069662594],"about_ca_topic_score_codex":0.0000753505,"about_ca_topic_score_gemma":0.0000028366662,"teacher_disagreement_score":0.97497106,"about_ca_system_score_codex":0.0000074718837,"about_ca_system_score_gemma":0.000041101557,"threshold_uncertainty_score":0.26152977},"labels":[],"label_agreement":null},{"id":"W2885426747","doi":"10.1016/j.cpc.2019.02.008","title":"Efficient sampling of spreading processes on complex networks using a composition and rejection algorithm","year":2019,"lang":"en","type":"article","venue":"Computer Physics Communications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"National Institute of General Medical Sciences; Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; National Science Foundation; National Institutes of Health; Canada First Research Excellence Fund","keywords":"Computer science; Algorithm; Computation; Node (physics); Sampling (signal processing); Scaling; Range (aeronautics); Markov process; Set (abstract data type); Complex network; Time complexity; Binary logarithm; Network dynamics; Markov chain; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.047592343405243494,"score_gpt":0.3107841496008659,"score_spread":0.26319180619562244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885426747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10799491,0.000060811755,0.89089805,0.000025285573,0.0000383664,0.00027694335,0.000012353605,0.00006299389,0.00063030724],"genre_scores_gemma":[0.7622125,0.000006720809,0.23745763,0.00002039405,0.00014506366,0.000010432951,0.00012937703,0.000015471527,0.000002399954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911493,0.00009412188,0.00028792224,0.00022745985,0.000118458855,0.00015713445],"domain_scores_gemma":[0.99833935,0.00028735775,0.00025393773,0.000886219,0.00019439038,0.000038713373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011530221,0.00015595948,0.00027430485,0.00008050145,0.00025404894,0.00006077343,0.00033190704,0.00002650687,0.000010695954],"category_scores_gemma":[7.174927e-7,0.0001703999,0.00007819373,0.00045826568,0.00009107558,0.00006303238,0.00038805912,0.00019125795,0.0000030570952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011186023,0.0007737438,0.010420961,0.00005890045,0.00022228804,6.434728e-8,0.0004943729,0.80340743,0.0041829105,0.04986767,0.00006795646,0.13049254],"study_design_scores_gemma":[0.00016972539,0.000039670496,0.001258,0.00018587349,0.000048004113,7.1539887e-7,0.000032322325,0.9956583,0.00018331097,0.0021771118,0.00009172325,0.000155293],"about_ca_topic_score_codex":0.00008032712,"about_ca_topic_score_gemma":0.0000011736619,"teacher_disagreement_score":0.6542176,"about_ca_system_score_codex":0.00003540594,"about_ca_system_score_gemma":0.00002480033,"threshold_uncertainty_score":0.69487065},"labels":[],"label_agreement":null},{"id":"W2885694481","doi":"10.1007/978-3-319-99368-3_6","title":"Tolerance Methods in Graph Clustering: Application to Community Detection in Social Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Cluster analysis; Robustness (evolution); Graph; Graph theory; Data mining; Modularity (biology); Community structure; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.02231476825603048,"score_gpt":0.32563675717918567,"score_spread":0.3033219889231552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885694481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013343199,0.000027503182,0.9965969,0.000057439578,0.00018663183,0.00044908485,0.0000016753409,0.00005072744,0.0012957605],"genre_scores_gemma":[0.84812665,0.0000017766673,0.15076204,0.00020589207,0.0007997478,0.00005480453,0.000009581524,0.000023228076,0.000016295748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981114,0.00018271308,0.00047032075,0.0006122347,0.00022920838,0.00039407908],"domain_scores_gemma":[0.99876356,0.00026437125,0.00020583824,0.00060850027,0.00010043082,0.000057288413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001540859,0.00031227287,0.00047388131,0.00074419257,0.00028042472,0.00011714189,0.0009542462,0.00017476904,0.000027301503],"category_scores_gemma":[0.000007939007,0.0003400571,0.00010641357,0.0011158813,0.0002812152,0.00014070816,0.00061933167,0.0011459751,0.0000038322532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001123699,0.0000305973,0.00056442356,0.0000067167657,0.0000053094027,5.1905715e-7,0.0006961873,0.13256401,0.00020035914,0.0006009875,0.000007020316,0.86531264],"study_design_scores_gemma":[0.0001365419,0.000061671075,0.0019993526,0.00015079364,0.000007118476,7.4536825e-7,0.0000011113237,0.7661493,0.0006262081,0.22983299,0.0006359934,0.0003982164],"about_ca_topic_score_codex":0.0006527517,"about_ca_topic_score_gemma":0.0043618535,"teacher_disagreement_score":0.8649144,"about_ca_system_score_codex":0.00024808,"about_ca_system_score_gemma":0.000050306866,"threshold_uncertainty_score":0.99990517},"labels":[],"label_agreement":null},{"id":"W2885726437","doi":"10.23919/acc.2018.8431268","title":"Curing with the Network Polya Contagion Model","year":2018,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Suite; Mathematical optimization; Computer science; Gradient descent; Curing (chemistry); Network structure; Distributed computing; Mathematics; Artificial intelligence; Artificial neural network","score_opus":0.008820675349826126,"score_gpt":0.23855103684888426,"score_spread":0.22973036149905812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885726437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075307325,0.000015317846,0.7727435,0.0005187071,0.00001486598,0.000111156594,6.410767e-7,0.00010645682,0.15118198],"genre_scores_gemma":[0.9916958,4.0241304e-7,0.0051572206,0.00021664282,0.0009248038,0.000014994776,0.0000033502631,0.000010823609,0.0019759212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949706,0.000015844169,0.00008082129,0.00013037043,0.00008394878,0.00019197336],"domain_scores_gemma":[0.9995942,0.000021585594,0.000043866054,0.00026526707,0.00004703931,0.000028021455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090909714,0.000086874505,0.000094783274,0.000008934783,0.00019091748,0.000041895804,0.00015458337,0.000009938072,0.00038058488],"category_scores_gemma":[1.7871659e-7,0.00004781534,0.000048600265,0.00014096721,0.00006940896,0.000052650466,0.00006140053,0.000072420786,0.000023512093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045074972,0.000058654892,0.05943463,0.0000013789772,0.00025485153,4.1005896e-7,0.00030278772,0.011668763,0.00021341581,0.74865156,0.1563798,0.022988666],"study_design_scores_gemma":[0.0003346172,0.0001239313,0.0015104046,0.00003041381,0.00011895251,7.7856316e-7,0.00018923107,0.89761245,0.0024493744,0.06400711,0.03324179,0.00038091157],"about_ca_topic_score_codex":0.00020643874,"about_ca_topic_score_gemma":0.000120951256,"teacher_disagreement_score":0.9163885,"about_ca_system_score_codex":0.0000068766167,"about_ca_system_score_gemma":0.000014074971,"threshold_uncertainty_score":0.41671374},"labels":[],"label_agreement":null},{"id":"W2886060527","doi":"10.1155/2018/3156137","title":"Studying the Topology of Transportation Systems through Complex Networks: Handle with Care","year":2018,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Computer science; Complex network; Perspective (graphical); Complex system; Resilience (materials science); Ranking (information retrieval); Set (abstract data type); Node (physics); Interpretation (philosophy); Network topology; Risk analysis (engineering); Management science; Data science; Scale (ratio); Topology (electrical circuits); Operations research; Artificial intelligence; Engineering; Business","score_opus":0.01652810661739773,"score_gpt":0.2808549543342496,"score_spread":0.2643268477168519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886060527","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67270195,0.00031726251,0.32638612,0.00003830401,0.00014197618,0.00020123618,0.000016943713,0.000011446175,0.00018475276],"genre_scores_gemma":[0.9933115,0.000022264041,0.006109675,0.000013315861,0.00042376923,0.000009376971,0.00008783087,0.000015215898,0.000007054162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99882454,0.00005020715,0.0006306978,0.00011618745,0.00023357128,0.00014481343],"domain_scores_gemma":[0.9982511,0.000064820684,0.00084892084,0.00014975041,0.00065673725,0.000028680317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012298451,0.00012995092,0.00034191672,0.000053784614,0.00013017966,0.000014605479,0.00016054139,0.000027152493,0.000045952645],"category_scores_gemma":[8.294598e-7,0.00008655163,0.0001303853,0.00028374448,0.0001314348,0.00026831834,9.645979e-7,0.00014643426,2.8019028e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009720246,0.00025301147,0.20117556,0.0001034249,0.0009215305,0.000010405533,0.033952024,0.7182738,0.0031379615,0.02488218,0.0002931268,0.016024932],"study_design_scores_gemma":[0.006397156,0.004666844,0.8392308,0.0010657079,0.0024154244,0.000011716563,0.110159405,0.0037123908,0.010271845,0.006101032,0.015093695,0.0008740236],"about_ca_topic_score_codex":0.00011918293,"about_ca_topic_score_gemma":0.0003868597,"teacher_disagreement_score":0.7145614,"about_ca_system_score_codex":0.000020460131,"about_ca_system_score_gemma":0.000037507027,"threshold_uncertainty_score":0.3529473},"labels":[],"label_agreement":null},{"id":"W2886138770","doi":"10.1109/icufn.2018.8437001","title":"Performance Evaluation of Community Detection Algorithms Based on Relationship Strength Measurement","year":2018,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Reliability (semiconductor); Field (mathematics); Algorithm; Community structure; The Internet; Focus (optics); Complex network; Function (biology); Data mining; Machine learning; Data science; Theoretical computer science; Artificial intelligence; Mathematics; World Wide Web; Statistics","score_opus":0.11122436357704166,"score_gpt":0.32532263328162686,"score_spread":0.2140982697045852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886138770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8659446,0.0000016266991,0.09330644,0.000019068215,0.000031512885,0.00017464277,0.0000016965585,0.000044936856,0.040475428],"genre_scores_gemma":[0.99844104,7.4150385e-8,0.0013746234,0.000011253475,0.000105037645,0.00002982977,0.00001584294,0.0000058017795,0.000016493002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878275,0.00034725698,0.00018470625,0.00007303682,0.00052945013,0.000082804836],"domain_scores_gemma":[0.9988073,0.0000679779,0.000109352,0.00034698474,0.0006473147,0.000021077632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021171048,0.000075153264,0.000090464244,0.000089365785,0.000229671,0.00001000908,0.00009473748,0.000018965386,0.00042498903],"category_scores_gemma":[0.000023226874,0.00006867882,0.000053162228,0.00023234574,0.000040273357,0.00005971823,0.000017128728,0.00013719307,0.000012317588],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030560528,0.00045594617,0.113644965,0.0000062466,0.00006042893,3.7074406e-9,0.00018236288,0.003504075,0.00092662044,0.0010586627,0.00037243808,0.8797577],"study_design_scores_gemma":[0.0002694022,0.00020617964,0.15125696,0.000020880596,0.00007555356,1.3808428e-8,0.000077508375,0.78753966,0.059098225,0.00131608,0.00006704668,0.000072495975],"about_ca_topic_score_codex":0.00030151723,"about_ca_topic_score_gemma":0.00011702253,"teacher_disagreement_score":0.8796852,"about_ca_system_score_codex":0.000086917695,"about_ca_system_score_gemma":0.00004316534,"threshold_uncertainty_score":0.46533316},"labels":[],"label_agreement":null},{"id":"W2888978441","doi":"10.1504/ijcm.2018.10015714","title":"Connectivity and closeness among international financial institutions: a network theory perspective","year":2018,"lang":"en","type":"article","venue":"International Journal of Comparative Management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Center for Interuniversity Research and Analysis on Organizations; Polytechnique Montréal; HEC Montréal","funders":"","keywords":"Perspective (graphical); Closeness; Network theory; Business; Finance; Computer science; Mathematics; Artificial intelligence; Statistics","score_opus":0.025901383217169914,"score_gpt":0.34823423167662976,"score_spread":0.32233284845945986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888978441","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50591195,0.00010829353,0.39024568,0.00049707067,0.0013102501,0.0001942773,0.00001268315,0.000021161522,0.10169863],"genre_scores_gemma":[0.99413514,0.00001618538,0.0029811335,0.00010102062,0.0025012537,0.0000124302705,0.000006256861,0.0000058422493,0.00024072472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987888,0.000128511,0.00037564454,0.00018386634,0.00038415036,0.00013906565],"domain_scores_gemma":[0.9982539,0.0001050352,0.00042318556,0.00010660936,0.0010552509,0.0000560157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049409526,0.00014810528,0.00024893743,0.00022934028,0.0001293949,0.00012846765,0.00046362734,0.000019477673,0.00036996993],"category_scores_gemma":[0.000013217321,0.00013416538,0.00013630652,0.00016218507,0.00032044438,0.00034456482,0.00026412783,0.00017005437,0.000008619044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022507276,0.00016602683,0.02924182,0.0000010530364,0.0013656875,0.000014988546,0.0008190703,0.0006420616,0.000014475363,0.95711774,0.0036361043,0.0067559],"study_design_scores_gemma":[0.0015579844,0.00020949075,0.21328671,0.00019639509,0.00017889975,0.000017527485,0.0023823837,0.0031426696,0.00041057312,0.72529244,0.052982587,0.00034231768],"about_ca_topic_score_codex":0.000036207366,"about_ca_topic_score_gemma":0.000032539225,"teacher_disagreement_score":0.4882232,"about_ca_system_score_codex":0.0001478614,"about_ca_system_score_gemma":0.000049374692,"threshold_uncertainty_score":0.54711056},"labels":[],"label_agreement":null},{"id":"W2891306020","doi":"10.1109/trustcom/bigdatase.2018.00270","title":"Large Scale and Parallel Sentiment Analysis Based on Label Propagation in Twitter Data","year":2018,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Lexicon; Scalability; Sentiment analysis; SPARK (programming language); Artificial intelligence; Big data; Graph; Machine learning; Natural language processing; Data mining; Theoretical computer science","score_opus":0.02789764092261867,"score_gpt":0.30807274103829935,"score_spread":0.2801751001156807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891306020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47801003,0.0000052899554,0.5110999,0.0004736823,0.000010704223,0.00023071315,0.000023380237,0.000050783412,0.010095559],"genre_scores_gemma":[0.98913693,3.029916e-7,0.009806537,0.0002045356,0.00009222367,0.0000151126105,0.00031642165,0.000006056108,0.00042187213],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991852,0.000047643258,0.00016540245,0.00032288398,0.00012235921,0.00015651116],"domain_scores_gemma":[0.9992867,0.000020919231,0.000050962746,0.0005760553,0.000031277523,0.000034059136],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026477463,0.00009351008,0.00016469671,0.00017402708,0.000053962507,0.00004602123,0.00015155232,0.000016419694,0.0011261335],"category_scores_gemma":[0.0000010276888,0.00007775447,0.000034430774,0.00049854675,0.00002740741,0.00007917084,0.00013338715,0.000055116652,0.000022546945],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002663663,0.0005709031,0.98390615,0.0000034093744,0.000270872,5.501183e-7,0.00017543923,0.00017191973,0.00015082138,0.0016501031,0.008580234,0.0044929804],"study_design_scores_gemma":[0.00042710686,0.000035837886,0.026759652,0.0000082132165,0.00017973686,1.568973e-8,0.00007021904,0.9694952,0.00050782453,0.0007462684,0.0016495724,0.00012037245],"about_ca_topic_score_codex":0.00024833146,"about_ca_topic_score_gemma":0.00044874262,"teacher_disagreement_score":0.9693233,"about_ca_system_score_codex":0.000012000622,"about_ca_system_score_gemma":0.000009614803,"threshold_uncertainty_score":0.999787},"labels":[],"label_agreement":null},{"id":"W2891465282","doi":"10.1186/s40649-018-0055-9","title":"Adding ReputationRank to member promotion using skyline operator in social networks","year":2018,"lang":"en","type":"article","venue":"Computational Social Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"Fundamental Research Funds for the Central Universities; Nanjing University of Aeronautics and Astronautics; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Skyline; Promotion (chess); Operator (biology); Computer science; Business; Political science; Biology; Data mining; Genetics","score_opus":0.03746973910793022,"score_gpt":0.34414050124532997,"score_spread":0.30667076213739974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891465282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11233618,0.000021534153,0.8848121,0.0004425551,0.00022301596,0.00040992314,0.000010253091,0.00011076466,0.0016336591],"genre_scores_gemma":[0.9743651,3.3743012e-7,0.01466137,0.00036588914,0.010123439,0.000053908814,0.00034082384,0.000045239285,0.00004388803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979041,0.00021243814,0.0006169677,0.00046475398,0.00032117037,0.00048055995],"domain_scores_gemma":[0.9990609,0.00011597966,0.00022635226,0.00010228202,0.0004001451,0.0000943276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048448076,0.00025741186,0.00038792213,0.00016865319,0.0008864328,0.00016366671,0.00020984105,0.00012637037,0.00047723463],"category_scores_gemma":[0.000010496546,0.0003008985,0.00017288784,0.0012739067,0.00010992734,0.00025243728,0.00015351344,0.00030452793,0.000015240441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038909187,0.0001488903,0.008501893,0.000002623122,0.000094597504,0.0000017483169,0.00065382535,0.94134444,0.00001455327,0.020662492,0.008157607,0.020378403],"study_design_scores_gemma":[0.0003839765,0.00004080256,0.013766372,0.000035478923,0.00004059422,6.5907614e-7,0.00008507081,0.97053057,0.0000060226675,0.013857421,0.0009231412,0.0003298678],"about_ca_topic_score_codex":0.00009246263,"about_ca_topic_score_gemma":0.000049785314,"teacher_disagreement_score":0.87015074,"about_ca_system_score_codex":0.000195439,"about_ca_system_score_gemma":0.00008111061,"threshold_uncertainty_score":0.9999443},"labels":[],"label_agreement":null},{"id":"W2893495395","doi":"10.1103/physreve.98.032309","title":"Universality of the stochastic block model","year":2018,"lang":"en","type":"article","venue":"Physical review. E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund","keywords":"Stochastic block model; Universality (dynamical systems); Inference; Computer science; Mathematics; Theoretical computer science; Imperfect; Mathematical optimization; Algorithm; Artificial intelligence","score_opus":0.01745927128462608,"score_gpt":0.3309987676151687,"score_spread":0.3135394963305426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893495395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7135843,0.0010648036,0.22147761,0.0014748354,0.00009806297,0.0011932715,0.000058296475,0.00013409958,0.060914744],"genre_scores_gemma":[0.9993251,0.000012755072,0.00018631389,0.00010267897,0.00025148754,0.000008485628,0.000002091552,0.000007287413,0.000103793245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993727,0.000053140488,0.0001536175,0.00014447053,0.00015359253,0.00012243063],"domain_scores_gemma":[0.9992336,0.000043035438,0.00012461805,0.0004622909,0.00010144252,0.000034998902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000908074,0.0000949113,0.0002659507,0.000009250991,0.000057270267,0.0000044491,0.0002967557,0.0000064794394,0.00007089405],"category_scores_gemma":[0.000009829653,0.00006241336,0.000268341,0.0002640611,0.00013910027,0.000034040575,0.00015145699,0.00009174155,0.000022926275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015880016,0.0009295607,0.0028030858,0.00027231622,0.0003433086,1.2974931e-7,0.00032030517,0.0024104347,0.0066335313,0.91493803,0.033025455,0.038307946],"study_design_scores_gemma":[0.00022458562,0.00007733701,0.001175093,0.0011481409,0.00073661323,2.2237008e-7,0.000017361372,0.4892813,0.00754183,0.49385622,0.0055489857,0.00039232924],"about_ca_topic_score_codex":0.000040693038,"about_ca_topic_score_gemma":0.0000022636852,"teacher_disagreement_score":0.48687086,"about_ca_system_score_codex":0.000011636694,"about_ca_system_score_gemma":0.000030452748,"threshold_uncertainty_score":0.2545143},"labels":[],"label_agreement":null},{"id":"W2893515363","doi":"10.1007/978-1-4939-7131-2_100178","title":"Complex Network Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.025020728623614583,"score_gpt":0.2668153201097611,"score_spread":0.24179459148614652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893515363","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000885285,0.000052446358,0.082582355,0.000033692362,0.00004603481,0.00015472446,0.000040954073,0.0002122785,0.9168687],"genre_scores_gemma":[0.026027448,0.00000799594,0.008837988,0.00015506436,0.00398631,0.000012655647,0.0013878196,0.0000782977,0.9595064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99823034,0.000018625546,0.0005096851,0.0005857687,0.000282646,0.00037296137],"domain_scores_gemma":[0.99829364,0.0000641814,0.00034935155,0.0009994932,0.00017259971,0.00012071203],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016672266,0.0004726662,0.0009886307,0.00029279914,0.00015463436,0.00008931353,0.00045091982,0.0001378958,0.28102046],"category_scores_gemma":[4.409494e-7,0.00044277147,0.0012602845,0.00025841632,0.00013591527,0.000037910304,0.0002660834,0.00027355668,0.0011078994],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003129023,0.0000104316405,0.0010672542,0.0000017782025,0.005540874,0.0000010014946,0.000008576318,0.00011770862,6.4868414e-7,0.55462414,0.43442976,0.004194678],"study_design_scores_gemma":[0.000047034166,0.000020005731,0.00013724079,0.00001511762,0.0031037321,1.1239506e-7,0.0000027429685,0.002633544,0.000002345199,0.2806739,0.712924,0.00044020545],"about_ca_topic_score_codex":0.00012182249,"about_ca_topic_score_gemma":0.00015481755,"teacher_disagreement_score":0.27991256,"about_ca_system_score_codex":0.000035825193,"about_ca_system_score_gemma":0.000030763298,"threshold_uncertainty_score":0.9998024},"labels":[],"label_agreement":null},{"id":"W2895591026","doi":"10.1109/mic.2018.053681359","title":"Response to “Scale Up or Scale Out for Graph Processing”","year":2018,"lang":"en","type":"article","venue":"IEEE Internet Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scale (ratio)","score_opus":0.027459543110567752,"score_gpt":0.3320207649042333,"score_spread":0.30456122179366557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895591026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47672448,0.0000048359625,0.521536,0.00012167355,0.00029256675,0.00022486057,0.000005616796,0.000138667,0.0009513449],"genre_scores_gemma":[0.96833193,4.948229e-8,0.025034433,0.0002596416,0.0014244952,0.00003436568,0.000006807968,0.000037953552,0.004870302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985436,0.000074224634,0.0003798989,0.00044133764,0.00014500933,0.00041590285],"domain_scores_gemma":[0.99898577,0.00018636178,0.00015475358,0.00030419178,0.00025154065,0.00011737915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052259176,0.00020789675,0.00029788297,0.00015650406,0.00015642973,0.00016414572,0.00043169525,0.000038175396,0.00015742247],"category_scores_gemma":[0.000014707587,0.00018396699,0.00017694262,0.00028878692,0.00007828691,0.00007223927,0.00015240301,0.00011585429,0.00008557021],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039644474,0.0003944548,0.03576512,0.000062304265,0.00030989418,0.000003502184,0.016333763,0.00033292983,0.019858865,0.00044220168,0.3020108,0.6205217],"study_design_scores_gemma":[0.002259023,0.0021587987,0.0030788162,0.0013358669,0.00022966441,0.000011111179,0.0012379983,0.40736237,0.27508333,0.008431291,0.29685286,0.001958834],"about_ca_topic_score_codex":0.00009591041,"about_ca_topic_score_gemma":0.00012925056,"teacher_disagreement_score":0.6185629,"about_ca_system_score_codex":0.00003774737,"about_ca_system_score_gemma":0.000047378926,"threshold_uncertainty_score":0.75019556},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.4537575266037598,"score_gpt":0.6426087668313554,"score_spread":0.18885124022759558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895935703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23826233,0.00024314651,0.7606894,0.000092080045,0.000034543882,0.00011205782,0.0000065906406,0.000006014613,0.00055388204],"genre_scores_gemma":[0.4058801,0.000011870232,0.5931743,0.000002715807,0.0008703738,0.000004107879,0.0000075210346,0.000013843846,0.000035193363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9748707,0.022577781,0.0010345739,0.00031948672,0.0007250857,0.00047240712],"domain_scores_gemma":[0.9892862,0.006915195,0.0008848542,0.0003194258,0.0023821436,0.00021222695],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.05384785,0.00018368466,0.0011481784,0.0009879487,0.00042906706,0.000072144445,0.000483053,0.00009367911,0.00019942177],"category_scores_gemma":[0.00031401508,0.0001520983,0.00042694533,0.0031219877,0.0007029707,0.0002553568,0.00030481888,0.00076255103,0.0000013243858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005965534,0.0003885547,0.023187198,0.00004038629,0.009054758,0.00000292616,0.05206988,0.00009118978,0.031518806,0.095462196,0.0040793214,0.78350824],"study_design_scores_gemma":[0.0011102078,0.003843168,0.054606386,0.00012626674,0.0027726553,0.0000020535037,0.044906758,0.0065115443,0.0459798,0.83010805,0.009471558,0.00056156446],"about_ca_topic_score_codex":0.0008823883,"about_ca_topic_score_gemma":0.000052467385,"teacher_disagreement_score":0.78294665,"about_ca_system_score_codex":0.000050313025,"about_ca_system_score_gemma":0.00016481616,"threshold_uncertainty_score":0.9742628},"labels":[],"label_agreement":null},{"id":"W2895981532","doi":"10.1016/j.knosys.2018.10.005","title":"Unsupervised cluster analyses of character networks in fiction: Community structure and centrality","year":2018,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Ministry of Science and Technology, Taiwan","keywords":"Betweenness centrality; Centrality; Character (mathematics); Clustering coefficient; Computer science; Cluster analysis; Complex network; Artificial intelligence; Community structure; Network analysis; Cluster (spacecraft); Hierarchical clustering; Network science; Mathematics; Statistics","score_opus":0.038341571199619257,"score_gpt":0.3203823031153995,"score_spread":0.2820407319157803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895981532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97082067,0.00039517137,0.025242819,0.000018818786,0.00023493482,0.00036749517,0.000047420443,0.00005445289,0.0028182496],"genre_scores_gemma":[0.9989738,9.836441e-7,0.000138528,0.000016376802,0.00065315596,0.000020536252,0.00011771924,0.000017446338,0.000061490566],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980147,0.0008455221,0.0005364816,0.00022645463,0.00011262525,0.00026424724],"domain_scores_gemma":[0.9987061,0.00019434885,0.00020749072,0.0005736236,0.00023805274,0.00008037464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000495201,0.00021513716,0.00051105046,0.00016440611,0.00016543258,0.000058662605,0.00022810845,0.000089817324,0.00018827128],"category_scores_gemma":[0.0000060006478,0.00019012725,0.000119411234,0.0005176475,0.00016953266,0.00009095005,0.00006528357,0.00033521248,0.000002838834],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015280575,0.0006709668,0.97656655,0.0003005632,0.00039171413,7.3710834e-7,0.0017375763,0.0027304702,0.007510747,0.0011800048,0.0037541708,0.005003665],"study_design_scores_gemma":[0.0030067207,0.00029507602,0.35726133,0.00088343956,0.0003369507,0.0000018713546,0.0011017994,0.6115103,0.017362854,0.00053098716,0.006801467,0.0009072652],"about_ca_topic_score_codex":0.0025202355,"about_ca_topic_score_gemma":0.0004940703,"teacher_disagreement_score":0.61930525,"about_ca_system_score_codex":0.000047413647,"about_ca_system_score_gemma":0.00004181627,"threshold_uncertainty_score":0.7753164},"labels":[],"label_agreement":null},{"id":"W2896057756","doi":"10.1038/sdata.2018.209","title":"In-depth data on the network structure and hourly activity of the Central Chilean power grid","year":2018,"lang":"en","type":"article","venue":"Scientific Data","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Instituto de Sistemas Complejos de Ingeniería; National Research Foundation of Korea; National Research Foundation; University of Calgary","keywords":"Computer science; Raw data; Grid; Filter (signal processing); Stability (learning theory); Data mining; Distributed computing; Focus (optics); Real-time computing; Data structure; Machine learning; Geography","score_opus":0.03140422013737429,"score_gpt":0.28508400135533163,"score_spread":0.2536797812179573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896057756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98549986,0.00002877312,0.0004986244,0.00092502916,0.0013344112,0.00033598772,0.00874062,0.000018438117,0.002618264],"genre_scores_gemma":[0.9982362,6.148324e-7,0.00018494629,0.000050429273,0.0005868529,9.0715804e-7,0.0008007045,0.0000075306243,0.000131859],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9986581,0.00012138311,0.00014286181,0.0005616941,0.0002421507,0.0002738175],"domain_scores_gemma":[0.9953682,0.00006704364,0.00013051089,0.0043688794,0.000029361046,0.0000359997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076487433,0.00011005954,0.00013569757,0.000023985494,0.00031220814,0.00018044928,0.002712721,0.000019089184,0.0005049843],"category_scores_gemma":[0.000019113015,0.000061140156,0.000026930453,0.0005363421,0.00053103274,0.00028708534,0.002633177,0.00019001578,0.000004301017],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001649482,0.00008361689,0.06337173,0.0000025966685,0.000064756336,2.3320938e-7,0.00017081323,0.000013953936,0.000711589,0.008270091,0.91530454,0.011989605],"study_design_scores_gemma":[0.0003507424,0.0000561512,0.6370185,0.00013768235,0.0001198253,0.0000012149825,0.00017242851,0.014708321,0.005790198,0.028760381,0.31247056,0.0004139657],"about_ca_topic_score_codex":0.0002763747,"about_ca_topic_score_gemma":0.000974272,"teacher_disagreement_score":0.602834,"about_ca_system_score_codex":0.00000771196,"about_ca_system_score_gemma":0.00004890771,"threshold_uncertainty_score":0.55292237},"labels":[],"label_agreement":null},{"id":"W2896275080","doi":"10.1145/3269206.3271790","title":"Inferring Probabilistic Contagion Models Over Networks Using Active Queries","year":2018,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; McMaster University; Defense Threat Reduction Agency; National Science Foundation","keywords":"Computer science; Inference; Probabilistic logic; Enhanced Data Rates for GSM Evolution; Cascade; Bayesian network; Machine learning; Data mining; Artificial intelligence; Theoretical computer science","score_opus":0.029463066192007645,"score_gpt":0.2935570718506355,"score_spread":0.26409400565862784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896275080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29501054,0.0000062367335,0.67821556,0.000007669918,0.000044660454,0.0001600951,0.0000018724176,0.000111237365,0.026442135],"genre_scores_gemma":[0.99452096,6.3381066e-7,0.004549175,0.000045049022,0.0006787193,0.00001735061,0.000011463485,0.000018873965,0.00015774586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991693,0.000036848887,0.00019945328,0.00023847137,0.000100666315,0.00025524493],"domain_scores_gemma":[0.9994359,0.00004308326,0.000091539,0.0002555769,0.00012090299,0.00005301413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008234303,0.00015347365,0.00020647717,0.000051507413,0.00016227848,0.00006105778,0.000116107876,0.000033832875,0.00081081607],"category_scores_gemma":[0.000002243276,0.00013847284,0.00009612107,0.00018660518,0.00011073336,0.00030055415,0.00012477372,0.00010967476,0.000004872481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008229861,0.00016700353,0.04489014,0.000007872141,0.00038228903,0.000001095962,0.00060393685,0.07641398,0.000945593,0.8471098,0.0012263393,0.028169643],"study_design_scores_gemma":[0.000124437,0.00003217746,0.00084105216,0.000026873406,0.00005228288,3.1676728e-7,0.0000683959,0.9015831,0.00096840016,0.095740214,0.00036189044,0.00020085888],"about_ca_topic_score_codex":0.0016590822,"about_ca_topic_score_gemma":0.00013284889,"teacher_disagreement_score":0.8251691,"about_ca_system_score_codex":0.000054666223,"about_ca_system_score_gemma":0.000028576394,"threshold_uncertainty_score":0.88778675},"labels":[],"label_agreement":null},{"id":"W2896445725","doi":"10.1038/s41562-018-0450-0","title":"Cyclic motifs in the Sardex monetary network","year":2018,"lang":"en","type":"article","venue":"Nature Human Behaviour","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Science Foundation Ireland; Office of Naval Research; Robert Wood Johnson Foundation; National Science Foundation","keywords":"Centrality; Database transaction; Robustness (evolution); Currency; Intermediary; Computer science; Social network (sociolinguistics); Digital currency; Financial transaction; Betweenness centrality; Business; Monetary economics; Economics; Finance; World Wide Web; Social media","score_opus":0.010212576194551258,"score_gpt":0.3003501753082055,"score_spread":0.2901375991136543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896445725","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.978462,0.00023080682,0.0003239006,0.00018235962,0.00010887605,0.00027088812,0.0000074930026,0.000087862776,0.020325836],"genre_scores_gemma":[0.99604803,9.796901e-7,0.00044202135,0.00033071206,0.0026283597,0.000034320434,0.000097006094,0.000022943292,0.00039565293],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986812,0.00012825233,0.00025607893,0.00030788404,0.0002481618,0.00037843006],"domain_scores_gemma":[0.9991649,0.000040158662,0.00009926195,0.0005977939,0.000056418943,0.000041470645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035928682,0.0001984616,0.00022475023,0.00008202212,0.00027898332,0.00007734583,0.0005898374,0.00013937069,0.00082800863],"category_scores_gemma":[0.000001918249,0.00015005085,0.00016441784,0.0004337067,0.00009532082,0.000071109076,0.00009769279,0.0009648386,0.000041708554],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006298942,0.0001834576,0.8701165,0.0000013759479,0.0000377315,0.000008281198,0.00052957213,0.00003994634,0.00019615445,0.019326562,0.10625232,0.003301808],"study_design_scores_gemma":[0.00033168323,0.00008822484,0.94436204,0.000037174515,0.00012447381,0.0000022045233,0.00017036535,0.0002807221,0.00027979928,0.03869959,0.015264331,0.00035937535],"about_ca_topic_score_codex":0.00037132847,"about_ca_topic_score_gemma":0.000473135,"teacher_disagreement_score":0.09098799,"about_ca_system_score_codex":0.00002401293,"about_ca_system_score_gemma":0.000011759226,"threshold_uncertainty_score":0.9066114},"labels":[],"label_agreement":null},{"id":"W2896509206","doi":"10.1038/s41598-018-33409-8","title":"The Competition of Homophily and Popularity in Growing and Evolving Social Networks","year":2018,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"National Key Research and Development Program of China; Foundation for Innovative Research Groups of the National Natural Science Foundation of China; National Natural Science Foundation of China","keywords":"Homophily; Popularity; Competition (biology); Data science; Computer science; Economic geography; Evolutionary biology; Biology; Psychology; Ecology; Geography; Social psychology","score_opus":0.008544064671684008,"score_gpt":0.25141361143667806,"score_spread":0.24286954676499406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896509206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99552727,0.00016735458,0.0025918619,0.000073487055,0.00032567236,0.000088197536,4.2144532e-7,0.000012694971,0.0012130243],"genre_scores_gemma":[0.9994604,0.0000013713131,0.0003206454,0.0000030814685,0.00014294959,0.000004078403,0.000009211936,0.0000037545155,0.000054488355],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921066,0.000040840318,0.0002571497,0.00023351399,0.00012160108,0.00013621211],"domain_scores_gemma":[0.999521,0.00002749766,0.00016271077,0.00018683921,0.00007989803,0.000022048607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010561702,0.000057744404,0.00011558066,0.00005112837,0.0005072043,0.00016633909,0.00004844383,0.00001810191,0.000018788547],"category_scores_gemma":[0.0000082202405,0.000046897825,0.000034167457,0.00025481317,0.00039562292,0.00012066992,0.0000972588,0.00007138778,1.3666636e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063134235,0.000059761052,0.9219424,0.000010352315,0.00003960566,0.00001107421,0.0006790585,0.00002203075,0.0026457242,0.042425707,0.0027297281,0.029428218],"study_design_scores_gemma":[0.00017601893,0.000034595592,0.39181322,0.00011396234,0.000055445824,0.000014156734,0.0005081305,0.03407474,0.0017238064,0.56548446,0.005720575,0.00028087263],"about_ca_topic_score_codex":0.00020648846,"about_ca_topic_score_gemma":0.0001210528,"teacher_disagreement_score":0.5301292,"about_ca_system_score_codex":0.000008902352,"about_ca_system_score_gemma":0.000013177358,"threshold_uncertainty_score":0.3901057},"labels":[],"label_agreement":null},{"id":"W2897975739","doi":"10.1109/ijcnn.2018.8489059","title":"A Self Fixing Intelligent Ant Clustering Algorithm For Graphs","year":2018,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Cluster analysis; ANT; Artificial intelligence; Computer network","score_opus":0.0164347910592321,"score_gpt":0.28547540019813855,"score_spread":0.26904060913890643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897975739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023868287,0.00001123171,0.9816657,0.000038556325,0.000071019596,0.00022243641,0.000004804542,0.00018278643,0.0154166715],"genre_scores_gemma":[0.6210639,0.0000017361331,0.37782863,0.00004880971,0.0005988054,0.000055300912,0.000013149423,0.000014964471,0.00037471796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993107,0.0000117763075,0.00018233886,0.00020146149,0.00006867553,0.0002250614],"domain_scores_gemma":[0.9995708,0.000041566964,0.000051578772,0.00020184058,0.0000858725,0.000048333386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012556076,0.00011034517,0.00014607479,0.00006822648,0.00012538499,0.00005069198,0.00014003666,0.000016743526,0.0004962377],"category_scores_gemma":[8.4157847e-7,0.00009742285,0.00015320597,0.00015504293,0.000025238773,0.000054135755,0.00009703141,0.000046242432,0.000019482653],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063167954,0.00015238726,0.0026473443,0.000011120005,0.0003254648,3.855928e-7,0.00040753107,0.00001194037,0.00030229453,0.06323155,0.0069300877,0.9259736],"study_design_scores_gemma":[0.00018927602,0.00014068402,0.000056772493,0.000024126786,0.00006914795,6.200869e-7,0.0002151017,0.8297319,0.019180428,0.08978153,0.060318958,0.00029146724],"about_ca_topic_score_codex":0.00010177094,"about_ca_topic_score_gemma":0.00002751333,"teacher_disagreement_score":0.9256821,"about_ca_system_score_codex":0.00001704147,"about_ca_system_score_gemma":0.0000146050115,"threshold_uncertainty_score":0.5433455},"labels":[],"label_agreement":null},{"id":"W2898537620","doi":"10.1109/asonam.2018.8508543","title":"Detecting Local Communities in Networks with Edge Uncertainty","year":2018,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Focus (optics); Ground truth; Estimator; Measure (data warehouse); Work (physics); Data mining; Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.01305860827828296,"score_gpt":0.2522527488477164,"score_spread":0.23919414056943347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898537620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2475779,0.000013283768,0.7048126,0.000023049553,0.000016662734,0.000082898594,5.3618646e-7,0.00009124409,0.04738186],"genre_scores_gemma":[0.9969714,6.2999567e-7,0.0024951994,0.00006259622,0.00028622043,0.000018096525,0.000012358229,0.000012216865,0.00014123716],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993578,0.00006587083,0.00015517765,0.00010754357,0.000068142035,0.00024543886],"domain_scores_gemma":[0.9994825,0.00009417075,0.00004652549,0.00028155893,0.000061419785,0.000033808985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018311005,0.00011168914,0.0001608909,0.00006245644,0.00012872768,0.000038571445,0.00017183735,0.000021518905,0.0008932409],"category_scores_gemma":[5.7572106e-7,0.00008734913,0.000038806545,0.00029801016,0.00018842972,0.000060552553,0.0000940682,0.00019030934,0.000008329861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088894405,0.00015938707,0.46428585,0.000004703263,0.00015781925,0.0000020875084,0.0012890565,0.04148749,0.000015413327,0.03347159,0.0023273365,0.45671037],"study_design_scores_gemma":[0.0004776405,0.00022097625,0.0034744823,0.0000925098,0.000030697312,0.0000011975407,0.007225464,0.97547156,0.00062109873,0.005151993,0.006836754,0.00039564865],"about_ca_topic_score_codex":0.008576073,"about_ca_topic_score_gemma":0.012113119,"teacher_disagreement_score":0.93398404,"about_ca_system_score_codex":0.000027909364,"about_ca_system_score_gemma":0.0000162262,"threshold_uncertainty_score":0.9980259},"labels":[],"label_agreement":null},{"id":"W2898613396","doi":"10.1109/asonam.2018.8508299","title":"A Statistical Framework for Handling Network Anomalies","year":2018,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Node (physics); Data mining; Feature (linguistics); Feature vector; Similarity (geometry); Exploit; Measure (data warehouse); Task (project management); Cluster analysis; Dirichlet distribution; Perspective (graphical); Statistical model; Artificial intelligence; Pattern recognition (psychology); Image (mathematics); Mathematics; Engineering","score_opus":0.018898894239565246,"score_gpt":0.3248309973232339,"score_spread":0.30593210308366864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898613396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005348237,0.000016869011,0.97871625,0.00008511653,0.00008144349,0.00015284594,0.0000135556575,0.00010959742,0.01547606],"genre_scores_gemma":[0.585715,2.6145e-7,0.41172695,0.00008182581,0.0021275787,0.000036040386,0.000020235968,0.000010105353,0.00028202252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924356,0.000018777393,0.0001731184,0.00019832332,0.00007148541,0.00029472722],"domain_scores_gemma":[0.9992602,0.0003460299,0.000048431677,0.0002080621,0.00008246804,0.000054819568],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014130621,0.000105028324,0.00017775381,0.000022252707,0.00019937281,0.000067254536,0.00012120323,0.00002910239,0.0026618887],"category_scores_gemma":[0.000011727169,0.00009201819,0.00008201057,0.00013872975,0.00008473036,0.000038638686,0.000054447533,0.00006999594,0.000038081966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013023419,0.000020469135,0.019457577,0.0000017546844,0.000059499274,8.8109694e-8,0.00002984862,0.000017229579,0.000007363872,0.93800884,0.025490878,0.016893415],"study_design_scores_gemma":[0.0001003508,0.000095102165,0.0010282196,0.00002192769,0.00004779726,1.253433e-7,0.00004549671,0.014256963,0.00048275676,0.9402189,0.043537132,0.000165185],"about_ca_topic_score_codex":0.000047660706,"about_ca_topic_score_gemma":0.00001604367,"teacher_disagreement_score":0.58036673,"about_ca_system_score_codex":0.0000075076678,"about_ca_system_score_gemma":0.000017208555,"threshold_uncertainty_score":0.9982498},"labels":[],"label_agreement":null},{"id":"W2901298730","doi":"","title":"A Net Diffusion Model of Mobile Application: Considering Self-referencing, Within-category Dependency, and Drop-out Process","year":2018,"lang":"en","type":"article","venue":"Journal of the Association for Information Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Dependency (UML); Process (computing); Computer science; Net (polyhedron); Diffusion process; Drop (telecommunication); Diffusion; Innovation diffusion; Artificial intelligence; Thermodynamics; Mathematics; Geometry; Physics; Knowledge management; Programming language; Telecommunications","score_opus":0.011476991720894846,"score_gpt":0.2568996009894721,"score_spread":0.24542260926857729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901298730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7286876,0.000039132137,0.26347774,0.00005578377,0.00044871963,0.0010260524,0.00003402849,0.000038227205,0.0061927503],"genre_scores_gemma":[0.9990489,0.0000024836806,0.0005217605,0.000014298675,0.0002076537,0.000045885798,0.000006486493,0.000005625381,0.00014691979],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985527,0.000045875517,0.00089975196,0.000051178213,0.00035441868,0.00009608498],"domain_scores_gemma":[0.9952129,0.000080955455,0.0034060471,0.0001305695,0.0011356901,0.000033807795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001028522,0.000086725624,0.00026333888,0.00010017643,0.0001563294,0.00008576008,0.00017199558,0.000051539286,0.000002579236],"category_scores_gemma":[0.000031145028,0.00006284685,0.00010687977,0.00012683087,0.00001536379,0.0005928455,0.0000407722,0.0001033647,0.0000018981499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021129873,0.0004208548,0.6542849,0.0010362677,0.0023526987,6.542991e-8,0.09693304,0.11412502,0.006859495,0.101495825,0.010887002,0.011393551],"study_design_scores_gemma":[0.0012500077,0.00016810399,0.0017630416,0.00020595574,0.00030431437,0.0000065003296,0.0045813504,0.96751046,0.006093858,0.012438177,0.0054352675,0.00024295812],"about_ca_topic_score_codex":0.000029505089,"about_ca_topic_score_gemma":0.000007664167,"teacher_disagreement_score":0.85338545,"about_ca_system_score_codex":0.00011429059,"about_ca_system_score_gemma":0.00012554665,"threshold_uncertainty_score":0.256282},"labels":[],"label_agreement":null},{"id":"W2902998067","doi":"10.1007/978-3-030-05411-3_37","title":"EvoNRL: Evolving Network Representation Learning Based on Random Walks","year":2018,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Random walk; Computer science; Representation (politics); Key (lock); Theoretical computer science; Dimension (graph theory); Range (aeronautics); Set (abstract data type); Network dynamics; Artificial intelligence; Network topology; Complex network; Machine learning; Topology (electrical circuits); Mathematics; Computer network; Discrete mathematics; Engineering","score_opus":0.07163494482764216,"score_gpt":0.3692768945621856,"score_spread":0.29764194973454344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902998067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056624347,0.0011113414,0.69144285,0.00011398774,0.000499219,0.0005653231,0.000011949151,0.00014952806,0.30604914],"genre_scores_gemma":[0.94026273,0.00013410495,0.018714594,0.00019123698,0.0029304826,0.00012547971,0.00045763166,0.000110457164,0.037073262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975605,0.00011490204,0.00076571247,0.00068560184,0.0005236781,0.00034961745],"domain_scores_gemma":[0.9962985,0.0022825373,0.00048705642,0.00030338555,0.00058189,0.00004663013],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00059378915,0.00042972315,0.00068063196,0.00026874462,0.0003287602,0.000060227718,0.0003002894,0.00009422678,0.00196353],"category_scores_gemma":[0.00008095222,0.0004427757,0.00029164212,0.00019975596,0.00032802287,0.00007518733,0.00023613528,0.00064005895,0.00015505253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006448456,0.000025685806,0.0013158632,0.00001814026,0.00030500136,0.000006038553,0.00030626793,0.9177291,1.0987822e-7,0.058685105,0.009364226,0.012180013],"study_design_scores_gemma":[0.00014911848,0.000093729,0.000074763346,0.0008081954,0.00006540238,3.9884958e-7,0.00015020091,0.46156833,0.0000071054274,0.532315,0.0043986,0.00036911268],"about_ca_topic_score_codex":0.000029581508,"about_ca_topic_score_gemma":0.000018715225,"teacher_disagreement_score":0.9402061,"about_ca_system_score_codex":0.00019073425,"about_ca_system_score_gemma":0.00007490959,"threshold_uncertainty_score":0.9998024},"labels":[],"label_agreement":null},{"id":"W2904378841","doi":"10.4171/owr/2017/57","title":"Network Models: Structure and Function","year":2018,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Random graph; Computer science; Giant component; Percolation (cognitive psychology); Complex network; Theoretical computer science; Focus (optics); Random walk; Component (thermodynamics); Connected component; Graph; Statistical physics; Mathematics; Artificial intelligence; Physics","score_opus":0.013908505285932909,"score_gpt":0.23339542544613534,"score_spread":0.21948692016020244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904378841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83140725,0.00033367975,0.10960386,0.000071370094,0.00036194356,0.0002306041,0.00000472295,0.00021239479,0.057774186],"genre_scores_gemma":[0.99487317,0.0000014287419,0.0027641007,0.00006602794,0.0016188038,0.00000998696,0.000041679195,0.000018041517,0.00060675776],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899507,0.000026522237,0.0002720085,0.00033219048,0.00013769465,0.00023649397],"domain_scores_gemma":[0.99925816,0.000013435568,0.00017976009,0.0003870486,0.00008924057,0.00007237467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014647494,0.00014461164,0.00018193219,0.000034909368,0.0001924203,0.000061807455,0.000049009708,0.000043052005,0.000745225],"category_scores_gemma":[0.00000177421,0.0001315205,0.000058021604,0.00018632528,0.000070369904,0.00014819481,0.000082745675,0.0001151604,0.000003658686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004086735,0.000083769104,0.6109629,0.000013600082,0.00041124973,0.00004220033,0.00023166405,0.0035040495,0.0006815394,0.09362884,0.10459385,0.18580547],"study_design_scores_gemma":[0.00009071763,0.000078688856,0.019549944,0.000022068058,0.00012868218,0.000032782562,0.000023049368,0.012388336,0.0005421515,0.91734487,0.04949901,0.00029968514],"about_ca_topic_score_codex":0.00017912772,"about_ca_topic_score_gemma":0.00003102564,"teacher_disagreement_score":0.82371604,"about_ca_system_score_codex":0.000011534317,"about_ca_system_score_gemma":0.00001919176,"threshold_uncertainty_score":0.8159691},"labels":[],"label_agreement":null},{"id":"W2905071171","doi":"10.5539/ijef.v11n1p8","title":"Spatial Correlation of Regional Economic Growth and Regional Coordinated Development Research -----An Empirical Study of Sichuan Province in China","year":2018,"lang":"en","type":"article","venue":"International Journal of Economics and Finance","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"China; Economic geography; Geography; Regional science; Empirical research; Positive correlation; Economic growth; Economics","score_opus":0.03658177533066612,"score_gpt":0.3329835660934797,"score_spread":0.29640179076281353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905071171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9984925,0.00003323403,0.00086280593,0.00023300237,0.00007124744,0.000104210194,0.0000058077344,0.0000011004427,0.00019612968],"genre_scores_gemma":[0.9986265,0.00007521482,0.0010242192,0.000007984631,0.0002343538,0.0000033193344,0.0000074346544,0.0000067182386,0.000014293386],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99890125,0.00006104482,0.0006640276,0.00017108259,0.00010354715,0.00009905613],"domain_scores_gemma":[0.9989513,0.000080636084,0.00056957075,0.000080977596,0.0002864969,0.000031005573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056120165,0.00008697536,0.00025347693,0.00028934577,0.000045037334,0.000026316251,0.00023443798,0.000030168243,0.000015019231],"category_scores_gemma":[0.000007770741,0.00008751865,0.000035619458,0.00005538835,0.00015974412,0.00021634343,0.00009519914,0.0001591321,3.8142093e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005977596,0.00085449003,0.92870677,0.000004894446,0.00023217457,0.0000033748076,0.0022153019,0.0020965957,0.000056889934,0.035298478,0.000244006,0.029689286],"study_design_scores_gemma":[0.0019711577,0.0010972414,0.8980388,0.00010606794,0.000016910377,0.00001501639,0.0004360943,0.071025796,0.00076137355,0.02483861,0.0015070019,0.00018591907],"about_ca_topic_score_codex":0.0007390238,"about_ca_topic_score_gemma":0.0007197859,"teacher_disagreement_score":0.068929195,"about_ca_system_score_codex":0.00007127659,"about_ca_system_score_gemma":0.00022004766,"threshold_uncertainty_score":0.3568907},"labels":[],"label_agreement":null},{"id":"W2905083768","doi":"10.1088/1742-5468/aaeb40","title":"Comparison of fitness and popularity: fitness-popularity dynamic network model","year":2018,"lang":"en","type":"article","venue":"Journal of Statistical Mechanics Theory and Experiment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Popularity; Computer science; Psychology; Social psychology","score_opus":0.021340006381973874,"score_gpt":0.35695064195000215,"score_spread":0.3356106355680283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905083768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1576575,0.00049225416,0.841496,0.000029690103,0.00008777083,0.00008173461,0.000026188152,0.0000070546507,0.00012182768],"genre_scores_gemma":[0.9501264,0.000018113607,0.04963485,0.000023640458,0.00015526568,0.000003780999,0.000008641214,0.0000133309995,0.000015951735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985188,0.00020240316,0.00064769766,0.00017668879,0.000231109,0.00022327261],"domain_scores_gemma":[0.9989124,0.00019823684,0.00040158464,0.00017123137,0.00016578319,0.00015074582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097144576,0.00017235169,0.000592233,0.00005793532,0.00015454124,0.000038767084,0.00014789251,0.00005578438,0.00015916086],"category_scores_gemma":[0.000024800533,0.00014657185,0.0000781909,0.00009166356,0.00013831505,0.000087464716,0.00014892558,0.00023584205,4.919277e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024982975,0.0002270009,0.0008866195,0.000016174188,0.00014147758,0.0000019388533,0.000380837,0.00021639428,0.0015035984,0.9864583,0.00019548695,0.009722325],"study_design_scores_gemma":[0.00028768598,0.0003756541,0.00011050592,0.000064426764,0.00013748473,0.0000042298707,0.00036153384,0.2125967,0.0028849535,0.78298414,0.000060160128,0.0001325227],"about_ca_topic_score_codex":0.000012306293,"about_ca_topic_score_gemma":0.0000029134842,"teacher_disagreement_score":0.7924689,"about_ca_system_score_codex":0.000024345974,"about_ca_system_score_gemma":0.000029076813,"threshold_uncertainty_score":0.5977026},"labels":[],"label_agreement":null},{"id":"W2905254322","doi":"10.1609/aaai.v33i01.3301582","title":"Learning Diffusions without Timestamps","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Timestamp; Node (physics); Computer science; Diffusion; Inference; Probabilistic logic; Process (computing); Data mining; Distributed computing; Theoretical computer science; Artificial intelligence; Computer network; Engineering","score_opus":0.03306045239926844,"score_gpt":0.2883744243641603,"score_spread":0.2553139719648918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905254322","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89097023,0.0000036308827,0.001766829,0.00042836968,0.000091220194,0.00033171705,0.000002595999,0.00007665907,0.10632877],"genre_scores_gemma":[0.99672383,0.0000042077068,0.00046056192,0.000030939427,0.000094544775,0.000019394607,0.000001663978,0.000016935766,0.0026479268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871004,0.000015087593,0.00037037185,0.00032019362,0.00029104613,0.00029329164],"domain_scores_gemma":[0.99905,0.000058980004,0.00032205274,0.00018922199,0.0003224753,0.00005724048],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026404054,0.00018533267,0.00027558146,0.00008397682,0.00017684541,0.00010097313,0.0006850878,0.00004000686,0.0019730588],"category_scores_gemma":[0.000035968053,0.00013755565,0.00017438641,0.00039613608,0.00012885928,0.0001198865,0.00027613575,0.00037970094,0.0002975859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036367815,0.00014675269,0.06218997,0.000012109998,0.000038837567,3.3673842e-8,0.00052336307,0.0001441259,0.08239282,0.8078027,0.00019001114,0.046522908],"study_design_scores_gemma":[0.000047742953,0.000282411,0.0017837246,0.00038841224,0.000071403134,6.7051843e-7,0.0025921708,0.07397978,0.587723,0.331585,0.0010748795,0.00047079343],"about_ca_topic_score_codex":0.00009065286,"about_ca_topic_score_gemma":0.000002710499,"teacher_disagreement_score":0.5053302,"about_ca_system_score_codex":0.000018505989,"about_ca_system_score_gemma":0.000041285715,"threshold_uncertainty_score":0.9989393},"labels":[],"label_agreement":null},{"id":"W2905398495","doi":"10.3968/10607","title":"Study of Exploring Hidden Relationship Among Commercial Bank Customers Based on Complex Network Theory","year":2018,"lang":"en","type":"article","venue":"Canadian social science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Database transaction; Complex network; Computer science; Transaction cost; Transaction data; Customer relationship management; Business; Transfer (computing); Marketing; Finance; World Wide Web; Database","score_opus":0.07335119109020341,"score_gpt":0.30526109044658617,"score_spread":0.23190989935638276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905398495","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83111435,0.0000010655297,0.00049551204,0.000048669874,0.00012308465,0.00024184972,0.0000099912695,0.000030491292,0.167935],"genre_scores_gemma":[0.99877495,3.1545362e-8,0.00015156958,0.00010346834,0.0008715487,0.000047250953,0.000006437063,0.00001089756,0.000033863864],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998579,0.00015783518,0.00020900347,0.0002745453,0.0003201497,0.00045945475],"domain_scores_gemma":[0.9991026,0.00013539976,0.000120063945,0.00026232403,0.00014710709,0.00023251047],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008920975,0.00011731896,0.00018898316,0.00023429186,0.0013474374,0.000061421226,0.000507499,0.000023748351,0.00040664303],"category_scores_gemma":[0.00002163951,0.00012634197,0.00006893385,0.0016115697,0.00090121065,0.00016215794,0.000049700255,0.00013298138,0.0000108478],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007172826,0.000048675025,0.8963701,6.79202e-7,0.000013293866,8.4557666e-7,0.0018642705,0.00006904808,0.000006287128,0.085352436,0.0027218366,0.0135453325],"study_design_scores_gemma":[0.00023816674,0.00013697504,0.9862591,0.000018334535,0.000041362124,2.6934236e-8,0.0048754327,0.0015706095,0.000030347606,0.0044496553,0.002136566,0.0002434302],"about_ca_topic_score_codex":0.015659345,"about_ca_topic_score_gemma":0.028702162,"teacher_disagreement_score":0.16790114,"about_ca_system_score_codex":0.00021196845,"about_ca_system_score_gemma":0.00029444086,"threshold_uncertainty_score":0.9999527},"labels":[],"label_agreement":null},{"id":"W2906400490","doi":"10.1109/jsyst.2018.2881558","title":"A New Approach for Contingency Analysis Based on Centrality Measures","year":2018,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Electric power system; Reliability engineering; Contingency; Electric power transmission; Context (archaeology); Computer science; Reliability (semiconductor); Centrality; Power-system protection; Network analysis; Network topology; Electric power; Electrical network; Power (physics); Engineering; Computer network; Electrical engineering; Mathematics","score_opus":0.039032149743770825,"score_gpt":0.30327120427148474,"score_spread":0.2642390545277139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906400490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042742565,0.000048397444,0.98610836,0.000036250072,0.00032729693,0.00029620525,0.000019675059,0.000045638306,0.0088439435],"genre_scores_gemma":[0.97806156,5.5829446e-7,0.016854236,0.0000212969,0.0043663173,0.000026176545,0.000015958241,0.000018934736,0.00063493825],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981916,0.00021738034,0.00053417584,0.00029147195,0.00038512444,0.00038024728],"domain_scores_gemma":[0.99853003,0.00007356628,0.00042927507,0.00038453823,0.0003628927,0.00021970292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011243195,0.0001980745,0.0005053127,0.00026864995,0.00032224433,0.0002528271,0.00031610866,0.000047656144,0.00029948133],"category_scores_gemma":[0.000009867463,0.00016405222,0.00066841376,0.00057468045,0.000026345717,0.00007681437,0.0000102708445,0.00019484098,0.00001013743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004908812,0.00084911357,0.37348396,0.00009127369,0.01323402,0.000005233284,0.00071673235,0.1504925,0.0023046758,0.009168058,0.36748865,0.081674926],"study_design_scores_gemma":[0.0023625174,0.00041038275,0.005449185,0.00015866946,0.0040803365,0.000008614142,0.00023195852,0.93251234,0.003144683,0.0026195198,0.04802316,0.0009986475],"about_ca_topic_score_codex":0.0005428633,"about_ca_topic_score_gemma":0.000016827786,"teacher_disagreement_score":0.9737873,"about_ca_system_score_codex":0.0000698473,"about_ca_system_score_gemma":0.00011649331,"threshold_uncertainty_score":0.66898555},"labels":[],"label_agreement":null},{"id":"W2911311653","doi":"10.1155/2019/9024745","title":"Approximating Betweenness Centrality to Identify Key Nodes in a Weighted Urban Complex Transportation Network","year":2019,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Ningbo; Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province","keywords":"Betweenness centrality; Centrality; Key (lock); Computer science; Node (physics); Flow network; Identification (biology); Complex network; Construct (python library); Data mining; Traffic flow (computer networking); Reliability (semiconductor); Network science; Computer network; Mathematical optimization; Mathematics; Engineering; Computer security; Statistics","score_opus":0.01268089645452958,"score_gpt":0.29084326108822967,"score_spread":0.2781623646337001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911311653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8898019,0.00003603329,0.10942123,0.00008567255,0.0001498837,0.00034710902,0.000028074966,0.00002463625,0.00010547243],"genre_scores_gemma":[0.9585009,0.000004869916,0.040838767,0.000031853277,0.00026888936,0.0000117383215,0.00030339655,0.000023743822,0.00001582535],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9977879,0.000068162364,0.0012379342,0.00023390097,0.00035107235,0.00032106077],"domain_scores_gemma":[0.9986411,0.00007078718,0.00077349367,0.00016911159,0.00023423298,0.00011128063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041621117,0.00020150743,0.0005396424,0.00018973833,0.00005796737,0.00003556168,0.00020329672,0.000043908556,0.00019648508],"category_scores_gemma":[0.000002422113,0.00020296885,0.00023824858,0.00072051963,0.000016221682,0.00054947875,0.000001985128,0.0002708269,0.0000048810157],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018189037,0.00014409804,0.80853236,0.000048795155,0.00010069286,0.000005646744,0.0024145949,0.16878098,0.0072750617,0.0036649075,0.000122047306,0.008728943],"study_design_scores_gemma":[0.0010160613,0.00007657149,0.9882816,0.00025369696,0.00009318156,3.035307e-7,0.00062622107,0.0009851013,0.0008759335,0.006877452,0.00068610464,0.00022773672],"about_ca_topic_score_codex":0.0000846732,"about_ca_topic_score_gemma":0.00018892578,"teacher_disagreement_score":0.1797493,"about_ca_system_score_codex":0.00006335461,"about_ca_system_score_gemma":0.000037266847,"threshold_uncertainty_score":0.827683},"labels":[],"label_agreement":null},{"id":"W2911529586","doi":"10.1145/3308558.3313729","title":"Generalists and Specialists: Using Community Embeddings to Quantify Activity Diversity in Online Platforms","year":2019,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Generalist and specialist species; Diversity (politics); Computer science; Construct (python library); Measure (data warehouse); Focus (optics); Data science; Space (punctuation); Online community; ENCODE; Work (physics); Through-the-lens metering; World Wide Web; Data mining; Lens (geology); Ecology; Sociology; Engineering; Biology","score_opus":0.07032294055671391,"score_gpt":0.3341642443670885,"score_spread":0.26384130381037463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911529586","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99351853,0.00000238133,0.004167347,0.000038671707,0.000029008019,0.00017780486,0.000021800886,0.000038018996,0.002006416],"genre_scores_gemma":[0.995233,7.3738425e-7,0.0044045984,0.00008297708,0.00008992049,0.0000010635906,0.000025437943,0.00000819466,0.00015406527],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999335,0.000043598324,0.0001369417,0.000176413,0.000113168484,0.00019491246],"domain_scores_gemma":[0.9994834,0.00005310315,0.000059963328,0.000301141,0.000031839365,0.00007051892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023921028,0.0001301337,0.0002603937,0.00011193601,0.00019669668,0.00004578269,0.00019783009,0.000030909916,0.00035840622],"category_scores_gemma":[0.0000026875682,0.0001229984,0.000059621987,0.0002587594,0.000025753017,0.00020126709,0.00094458077,0.00025752248,0.0000075143025],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022110531,0.00017486635,0.9862181,0.000005880365,0.000026822221,4.6586237e-7,0.00045506054,0.00021147463,0.0028804915,0.0070295497,0.00015902474,0.00281616],"study_design_scores_gemma":[0.0005950412,0.00006609053,0.9532106,0.00005336012,0.00003363874,7.388728e-7,0.0010171853,0.032197565,0.0028669268,0.008987239,0.00048626342,0.0004853658],"about_ca_topic_score_codex":0.0320646,"about_ca_topic_score_gemma":0.0033907974,"teacher_disagreement_score":0.033007506,"about_ca_system_score_codex":0.00007182744,"about_ca_system_score_gemma":0.000011887321,"threshold_uncertainty_score":0.97438097},"labels":[],"label_agreement":null},{"id":"W2911560513","doi":"","title":"Proceedings of the 18th Symposium on Communications & Networking","year":2015,"lang":"en","type":"article","venue":"Spring Simulation Multiconference","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Big data; The Internet; Computer science; Cloud computing; Entertainment; Social media; World Wide Web; Government (linguistics); Data science; Multimedia","score_opus":0.06777791713689756,"score_gpt":0.3194381093798728,"score_spread":0.25166019224297526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911560513","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95437926,0.000019012065,0.012557131,0.00032392735,0.00010737047,0.0003714151,0.0000028707332,0.00010146379,0.032137524],"genre_scores_gemma":[0.9977696,0.0000011624113,0.0019987896,0.000019524434,0.00011220462,0.000012688328,0.0000022891181,0.000009760112,0.00007397211],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934477,0.00002404519,0.00022635105,0.00013631904,0.0001468312,0.00012168525],"domain_scores_gemma":[0.99893206,0.0001240762,0.00020470918,0.00042906115,0.0002676119,0.000042456166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018195211,0.000095507356,0.00012772132,0.000042359225,0.000115509894,0.000045146084,0.00048130864,0.00002166387,0.000011720758],"category_scores_gemma":[0.000014870653,0.00007685424,0.00007033884,0.00021923493,0.00007246755,0.000083376566,0.00021735026,0.00014588056,0.0000056972185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012186249,0.00012601023,0.6361538,0.0000066293373,0.000046497174,1.7194287e-8,0.0007250816,0.15415311,0.0019239323,0.19841295,0.000058747468,0.008381031],"study_design_scores_gemma":[0.00025704436,0.000019717452,0.022546403,0.00012979125,0.000037893777,3.266615e-8,0.00014902133,0.96369654,0.0028264737,0.0070815575,0.003117805,0.00013773282],"about_ca_topic_score_codex":0.00019416574,"about_ca_topic_score_gemma":0.000008269579,"teacher_disagreement_score":0.80954343,"about_ca_system_score_codex":0.00002897472,"about_ca_system_score_gemma":0.000032216838,"threshold_uncertainty_score":0.31340247},"labels":[],"label_agreement":null},{"id":"W2912030618","doi":"10.1007/978-3-030-10928-8_7","title":"Social-Affiliation Networks: Patterns and the SOAR Model","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Soar; Computer science; Friendship; Recursion (computer science); Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.012262455753848522,"score_gpt":0.24790682841461623,"score_spread":0.2356443726607677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912030618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003411332,0.00012869568,0.9954331,0.000417082,0.0001256594,0.00031936317,0.000005416459,0.000039939187,0.0031896383],"genre_scores_gemma":[0.98974085,0.00001849469,0.008458569,0.00040976985,0.0009167994,0.000008920773,0.000019898951,0.000024708885,0.00040196988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984934,0.000028256038,0.0002749235,0.00058126095,0.0003289776,0.0002932052],"domain_scores_gemma":[0.9989577,0.00024393522,0.00022842389,0.00044596865,0.00008898367,0.000035008896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004940792,0.00028568335,0.00040541295,0.0001501057,0.0002421501,0.00023106196,0.00063292007,0.00010506196,0.000035006073],"category_scores_gemma":[0.0000028748889,0.00020776158,0.00014095688,0.00014606699,0.0004702874,0.000111707304,0.00048741556,0.0004987309,0.0000045641336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010165211,0.000010816262,0.0010724762,0.000009483537,0.000038626207,6.45845e-7,0.00057984516,0.40607965,0.0000024804835,0.13755958,0.00009682127,0.45453942],"study_design_scores_gemma":[0.00016779304,0.000008398018,0.0000773593,0.00005325806,0.000023178207,3.6751334e-7,2.2334969e-7,0.7725324,0.000009597421,0.2268132,0.00012998092,0.00018426],"about_ca_topic_score_codex":0.000058561505,"about_ca_topic_score_gemma":0.00005932919,"teacher_disagreement_score":0.98939973,"about_ca_system_score_codex":0.000057681063,"about_ca_system_score_gemma":0.000105813815,"threshold_uncertainty_score":0.84722716},"labels":[],"label_agreement":null},{"id":"W2912673080","doi":"10.30564/jmser.v1i1.74","title":"Chinese Journals' Chief Editors Should Enhance Their Response Rate to Authors","year":2018,"lang":"en","type":"article","venue":"Journal of Management Science & Engineering research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Citation; Lagging; Impact factor; Chinese academy of sciences; Citation database; Index (typography); Editor in chief; Citation index; Library science; China; Science Citation Index; Political science; History; Medicine; World Wide Web; Computer science; Management; Scopus; MEDLINE; Law; Economics","score_opus":0.03582053387526091,"score_gpt":0.40843581927816963,"score_spread":0.3726152854029087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912673080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.896679,0.00004653758,0.098453104,0.001818704,0.0012709552,0.0002411089,0.00000168586,0.000036765934,0.0014521364],"genre_scores_gemma":[0.98861164,0.0000130442195,0.006049807,0.000027107222,0.004567703,0.0000116610045,2.103042e-7,0.00002147837,0.0006973342],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99651694,0.0002347563,0.0005392771,0.00032259052,0.0015948111,0.00079160096],"domain_scores_gemma":[0.99767226,0.00035799624,0.00017658288,0.00049792166,0.00087168557,0.000423549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024639744,0.00019332347,0.0002912944,0.0022645656,0.0004466631,0.0004658069,0.0016967678,0.000026819309,0.00025194327],"category_scores_gemma":[0.00042350273,0.00014427719,0.00015614973,0.004398067,0.0002615151,0.0005642211,0.00061329664,0.00071492675,0.000038513583],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024830594,0.0010242526,0.026684614,0.000087425935,0.0009893299,0.00019201406,0.0048684073,0.06467763,0.5649888,0.011896095,0.21578707,0.106321275],"study_design_scores_gemma":[0.0011905514,0.0027574936,0.3859012,0.0015498513,0.000100943085,0.000027131797,0.0018519248,0.05673623,0.13450797,0.010692376,0.403182,0.0015023184],"about_ca_topic_score_codex":0.000011027759,"about_ca_topic_score_gemma":8.9864e-7,"teacher_disagreement_score":0.43048087,"about_ca_system_score_codex":0.00019812996,"about_ca_system_score_gemma":0.00010834373,"threshold_uncertainty_score":0.8539693},"labels":[],"label_agreement":null},{"id":"W2912860033","doi":"10.5430/wje.v9n1p118","title":"Research on the Cooperative Behavior of Academic Papers Published by Chinese Educational Scholars Based on Complex Networks","year":2019,"lang":"en","type":"article","venue":"World Journal of Education","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vocational education; Sociology; Educational research; Chinese education; Higher education; Quality (philosophy); Pedagogy; Epistemology; China; Political science; Law","score_opus":0.028331161311364293,"score_gpt":0.3773115062188396,"score_spread":0.34898034490747526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912860033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9594061,0.00013975982,0.00027259756,0.009180434,0.00041839867,0.0005450722,0.000011714435,0.0000067008764,0.030019222],"genre_scores_gemma":[0.99672157,0.0000058685537,0.00018018209,0.00040381544,0.0007041588,0.00004884036,0.00009261558,0.000017291894,0.0018256424],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998048,0.00044652328,0.00052286265,0.000182078,0.00059438375,0.00020616553],"domain_scores_gemma":[0.99732065,0.0008547118,0.00052775425,0.00035155876,0.0008486649,0.0000966501],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015607245,0.00014711054,0.0002552566,0.00048394137,0.00017125631,0.000103580045,0.0005219224,0.000039546172,0.00631209],"category_scores_gemma":[0.00006741016,0.00009919837,0.00015901079,0.0012128054,0.000093041046,0.00023246168,0.000031797714,0.0012966522,0.000015054575],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001993581,0.0022311758,0.50535744,0.000008031302,0.00014566131,1.16666165e-7,0.00023881384,0.011809033,0.007500444,0.057246324,0.4008454,0.014418159],"study_design_scores_gemma":[0.001685943,0.0010983894,0.90717703,0.0010696979,0.00023757211,0.000003523564,0.002839515,0.012411169,0.0025042063,0.012349597,0.05786994,0.0007534199],"about_ca_topic_score_codex":0.0000437529,"about_ca_topic_score_gemma":0.0000067606165,"teacher_disagreement_score":0.40181956,"about_ca_system_score_codex":0.00014731566,"about_ca_system_score_gemma":0.0006328574,"threshold_uncertainty_score":0.9945963},"labels":[],"label_agreement":null},{"id":"W2912985320","doi":"10.3968/10640","title":"Research on Educational Informatization Based on E-Context Theory: Taking Higher Mathematics as an Example","year":2018,"lang":"en","type":"article","venue":"Higher education of social science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Informatization; Context (archaeology); The Internet; Set (abstract data type); Mathematics education; Computer science; Order (exchange); Knowledge management; Sociology; World Wide Web; Psychology; Business","score_opus":0.07909462303643072,"score_gpt":0.4164640814596967,"score_spread":0.337369458423266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912985320","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16836818,0.0000030243307,0.0012793345,0.0007844956,0.00044290186,0.00027658453,0.000003853086,0.000041559564,0.8288001],"genre_scores_gemma":[0.99291766,1.10554076e-7,0.0014920797,0.0003217647,0.0011614871,0.000057135985,0.00003277783,0.000010855855,0.004006126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837494,0.00011615969,0.00025044515,0.00025173812,0.0007599019,0.00024682368],"domain_scores_gemma":[0.99826354,0.00022154812,0.0002786919,0.0003194094,0.00083440804,0.00008241104],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013545082,0.0001038425,0.000121656565,0.00035529365,0.0007404069,0.0001344411,0.00046171682,0.000034499844,0.008339678],"category_scores_gemma":[0.000019771589,0.00009788301,0.00004530557,0.0014273659,0.0006554957,0.0003568981,0.000043722775,0.00012976424,0.00013797941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009255704,0.0004569206,0.0006442911,0.00000429538,0.0000041207104,3.7143826e-9,0.0020906,0.0000069369694,0.0002391742,0.9865854,0.0027132898,0.007245708],"study_design_scores_gemma":[0.00026113229,0.00041417635,0.1768141,0.00014538028,0.000024398527,8.761867e-8,0.0037474125,0.0012590043,0.007847678,0.76348335,0.045623973,0.00037930137],"about_ca_topic_score_codex":0.00034398842,"about_ca_topic_score_gemma":0.0000019866432,"teacher_disagreement_score":0.82479393,"about_ca_system_score_codex":0.00015557362,"about_ca_system_score_gemma":0.0008078794,"threshold_uncertainty_score":0.9925668},"labels":[],"label_agreement":null},{"id":"W2913923297","doi":"10.1109/ssci.2018.8628788","title":"Ant Brood Clustering on Intel Xeon Multi-core: Challenges and Strategies","year":2018,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Research Manitoba","keywords":"Computer science; Xeon; Parallel computing; Swarm intelligence; Xeon Phi; Cluster analysis; Speedup; Particle swarm optimization; Ant colony; Parallelism (grammar); Data parallelism; Multi-core processor; Ant colony optimization algorithms; Artificial intelligence; Algorithm","score_opus":0.06678333221647328,"score_gpt":0.31841955389140686,"score_spread":0.2516362216749336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913923297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52603114,0.0006116351,0.23944925,0.00044765376,0.00014204775,0.00035001032,0.0000058881074,0.0004663226,0.23249608],"genre_scores_gemma":[0.99368685,0.000052140025,0.005629752,0.000031093277,0.00034339004,0.000010538417,0.000003405284,0.00001255159,0.00023026948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937737,0.000017208476,0.00013188849,0.0002339083,0.00007123553,0.00016839124],"domain_scores_gemma":[0.99962074,0.000034258363,0.000043338452,0.0002181169,0.00004006576,0.000043471075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000082824685,0.00013151999,0.00015541518,0.0000546122,0.00007329068,0.000060764087,0.00009246107,0.000023476408,0.00022794797],"category_scores_gemma":[0.0000014039948,0.000107373315,0.000044139277,0.00004934933,0.00006936958,0.00009655021,0.00010786586,0.00008359515,0.000021349082],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038939343,0.00030259875,0.0025356195,0.000022796909,0.00020160926,0.000001534993,0.001862788,0.00003407203,0.0023633342,0.31442893,0.0013472675,0.6768605],"study_design_scores_gemma":[0.0045355842,0.004031172,0.10957316,0.0008609041,0.00035786204,0.000010058187,0.037355687,0.50127405,0.047753826,0.21721284,0.07324527,0.0037895946],"about_ca_topic_score_codex":0.00017723588,"about_ca_topic_score_gemma":0.00053673855,"teacher_disagreement_score":0.6730709,"about_ca_system_score_codex":0.000008709956,"about_ca_system_score_gemma":0.000009037468,"threshold_uncertainty_score":0.43785566},"labels":[],"label_agreement":null},{"id":"W2914110129","doi":"10.1016/j.patrec.2019.02.005","title":"Community structure detection from networks with weighted modularity","year":2019,"lang":"en","type":"article","venue":"Pattern Recognition Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Clique percolation method; Modularity (biology); Community structure; Computer science; Benchmark (surveying); Maximization; Limit (mathematics); Metric (unit); Complex network; Partition (number theory); Data mining; Function (biology); Network science; Quality (philosophy); Artificial intelligence; Theoretical computer science; Cluster analysis; Mathematics; Mathematical optimization; Statistics","score_opus":0.008759762821355599,"score_gpt":0.20364186657657915,"score_spread":0.19488210375522355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914110129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64480984,0.0000028609704,0.35449615,0.00011640161,0.00007000297,0.00017697335,0.00007734373,0.00009041505,0.00016002415],"genre_scores_gemma":[0.9961514,4.6168583e-7,0.0010116006,0.0009402218,0.0003656773,0.000024652645,0.0014696096,0.000029156785,0.00000722157],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99890286,0.0002703265,0.00019486713,0.0002527519,0.00015551566,0.00022367209],"domain_scores_gemma":[0.9992349,0.00007547092,0.00015971789,0.00041169496,0.000062760686,0.000055432025],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000090772985,0.0002030834,0.00022797554,0.000073599695,0.00016942839,0.00008073735,0.00017323183,0.00005281449,0.0023186756],"category_scores_gemma":[5.406628e-7,0.00018554181,0.00009655239,0.00019101863,0.000034729117,0.00016819428,0.000056627225,0.0006300433,0.0000693006],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006703712,0.00012269123,0.39954287,0.000012429476,0.00046534487,0.0000021376773,0.00021236422,0.0010258866,0.020650038,0.0000032891721,0.00062382565,0.5772721],"study_design_scores_gemma":[0.005428336,0.00045462945,0.45902628,0.00057676004,0.0009858676,0.000009804912,0.00077430974,0.41553682,0.092083775,0.019894423,0.0019728912,0.0032560981],"about_ca_topic_score_codex":0.004266877,"about_ca_topic_score_gemma":0.000405217,"teacher_disagreement_score":0.574016,"about_ca_system_score_codex":0.000037787107,"about_ca_system_score_gemma":0.000004788406,"threshold_uncertainty_score":0.99859333},"labels":[],"label_agreement":null},{"id":"W2914381873","doi":"10.1007/978-981-13-6661-1_20","title":"A Modularity-Based Measure for Cluster Selection from Clustering Hierarchies","year":2019,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Modularity (biology); Hierarchical clustering of networks; Cluster analysis; Hierarchy; Hierarchical clustering; Measure (data warehouse); Computer science; Data mining; Single-linkage clustering; Selection (genetic algorithm); Context (archaeology); Cluster (spacecraft); Correlation clustering; Artificial intelligence; CURE data clustering algorithm; Geography","score_opus":0.03134754300511575,"score_gpt":0.28811249609853373,"score_spread":0.25676495309341796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914381873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014777908,0.000055592733,0.9435238,0.00028219185,0.00007669869,0.00056947,0.000058544378,0.000050833296,0.055235043],"genre_scores_gemma":[0.58590317,0.00006820945,0.41041088,0.00071805523,0.00022914556,0.00015084432,0.0011498587,0.000028772489,0.0013410387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989301,0.000024699155,0.00045832878,0.00020598246,0.00022349447,0.00015738879],"domain_scores_gemma":[0.99821585,0.0002330275,0.00026675264,0.0009202712,0.00032108047,0.000043004948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005441011,0.00017844666,0.00024715913,0.0005751482,0.00035712757,0.00033442528,0.0008914198,0.0000681219,0.000025412757],"category_scores_gemma":[0.0000061557294,0.00018693079,0.0000844046,0.0001924596,0.00027647626,0.0015056514,0.00059191935,0.00029885952,0.000011053708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029314815,0.00004422831,0.0023752472,0.00005907098,0.00006546007,1.3966181e-8,0.0011368087,0.016291106,0.000020131805,0.42910784,0.0010978995,0.54977286],"study_design_scores_gemma":[0.00028316013,0.000024164772,0.00042176567,0.00015790359,0.000018137609,2.1870841e-7,0.000007957336,0.9095934,0.00001464827,0.01798309,0.07129043,0.00020514047],"about_ca_topic_score_codex":0.000071228045,"about_ca_topic_score_gemma":0.000055917066,"teacher_disagreement_score":0.89330226,"about_ca_system_score_codex":0.00008501077,"about_ca_system_score_gemma":0.0002024495,"threshold_uncertainty_score":0.7622816},"labels":[],"label_agreement":null},{"id":"W2914669612","doi":"10.1155/2019/3928260","title":"Characterizing the Structure of the Railway Network in China: A Complex Weighted Network Approach","year":2019,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Betweenness centrality; Closeness; Centrality; Node (physics); Complex network; Topology (electrical circuits); Hierarchy; Computer science; Degree distribution; Scale (ratio); Data mining; Mathematics; Engineering; Geography; Statistics; Cartography; Structural engineering","score_opus":0.005984805522771478,"score_gpt":0.2266531521543074,"score_spread":0.22066834663153592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914669612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99117976,0.00008822109,0.007862511,0.00014586875,0.00018713267,0.00030080884,0.000010223587,0.0000065143813,0.00021896654],"genre_scores_gemma":[0.9919159,0.000009933375,0.0075053805,0.00004046277,0.00045258345,0.0000020111365,0.000044936034,0.000014935855,0.000013891783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99868137,0.00009415293,0.00066009536,0.00011759505,0.00024772345,0.00019904546],"domain_scores_gemma":[0.9986247,0.000057386304,0.0009706241,0.00022632688,0.0000953409,0.000025647363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022537993,0.00014009906,0.00036884073,0.0000436445,0.0000749201,0.000015067819,0.00031448103,0.000033054213,0.000110581466],"category_scores_gemma":[0.0000011455762,0.000082052415,0.0002409268,0.0005948345,0.000036555306,0.00019270457,0.00000737235,0.00038591115,2.6159685e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001849661,0.00008401733,0.35355633,0.00002794634,0.00018744644,7.565927e-7,0.0017174104,0.605274,0.023573378,0.008733342,0.00017955329,0.00648083],"study_design_scores_gemma":[0.00061377697,0.000043135416,0.9817659,0.00014145886,0.00007854712,0.0000013168477,0.0002353374,0.002164391,0.0008017231,0.012861776,0.0011840453,0.000108550346],"about_ca_topic_score_codex":0.0000190228,"about_ca_topic_score_gemma":0.000037247515,"teacher_disagreement_score":0.6282096,"about_ca_system_score_codex":0.000020918875,"about_ca_system_score_gemma":0.00003456525,"threshold_uncertainty_score":0.33460003},"labels":[],"label_agreement":null},{"id":"W2915436443","doi":"10.1101/562231","title":"Analyzing time-aggregated networks: the role of bootstrapping, permutation, and simulation","year":2019,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Bootstrapping (finance); Computer science; Node (physics); Permutation (music); Resampling; Stability (learning theory); Network structure; Social network analysis; Data mining; Null model; Social network (sociolinguistics); Theoretical computer science; Distributed computing; Artificial intelligence; Machine learning; Econometrics; Mathematics; Engineering; Social media","score_opus":0.006686849836987167,"score_gpt":0.22023572501214053,"score_spread":0.21354887517515336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915436443","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91079456,0.0022261527,0.08560603,0.000044024015,0.00011910791,0.00085269794,0.00007113369,0.00022417994,0.00006214998],"genre_scores_gemma":[0.9987881,0.000038219765,0.0006551713,0.0000138227115,0.0003796616,0.000051282397,0.0000023730922,0.000065736764,0.000005627489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981601,0.00016213153,0.0005636843,0.00058418006,0.00021716996,0.00031272293],"domain_scores_gemma":[0.9975825,0.00017041016,0.00078334945,0.00093101774,0.0004496293,0.000083116334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046582558,0.0003862367,0.0005495241,0.00018656229,0.00015662357,0.00017518057,0.0003862375,0.00017835238,0.000108082946],"category_scores_gemma":[0.000020495288,0.00035176656,0.00019506198,0.00049842906,0.00011069441,0.00011659872,0.0003528132,0.0004897809,0.000010178661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029412848,0.00014207192,0.28654286,0.000118151744,0.0013194156,0.0000013679759,0.00004561357,0.6423631,0.066271536,0.0028358297,0.00019243183,0.00013827586],"study_design_scores_gemma":[0.0001937779,0.000020340913,0.053341333,0.00030541728,0.00038637835,1.4326613e-9,0.000008134271,0.93102247,0.01290931,0.00009359766,0.0012215609,0.0004976826],"about_ca_topic_score_codex":0.00012307787,"about_ca_topic_score_gemma":6.859279e-7,"teacher_disagreement_score":0.28865942,"about_ca_system_score_codex":0.000051915267,"about_ca_system_score_gemma":0.00013854423,"threshold_uncertainty_score":0.9998934},"labels":[],"label_agreement":null},{"id":"W2915862757","doi":"10.1088/1742-5468/ab3ccd","title":"Quantum statistics in Network Geometry with Fractional Flavor","year":2019,"lang":"en","type":"article","venue":"Journal of Statistical Mechanics Theory and Experiment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Università di Catania; Institut Périmètre de physique théorique; Industry Canada; Government of Canada","keywords":"Simplicial complex; Simplicial manifold; Abstract simplicial complex; Simplicial homology; Simplicial approximation theorem; Complex network; Face (sociological concept); Topology (electrical circuits)","score_opus":0.006072058124213437,"score_gpt":0.2682895191478883,"score_spread":0.2622174610236748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915862757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06580459,0.00027758526,0.9334299,0.000022625427,0.00012282241,0.000102933336,0.00003189415,0.0000053072245,0.00020231538],"genre_scores_gemma":[0.9511122,0.000015860418,0.048569303,0.00004045124,0.00018843659,0.000005295906,0.000010794519,0.000014333439,0.00004330647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876577,0.00016564265,0.00042883455,0.00014643643,0.00026852533,0.00022480116],"domain_scores_gemma":[0.9987201,0.00070839137,0.00025054146,0.00011620892,0.00009160558,0.00011313665],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00084762735,0.00014253566,0.00035310362,0.000094398776,0.000049336584,0.000039344006,0.000101215715,0.0000306087,0.0016086624],"category_scores_gemma":[0.000015508149,0.00010933058,0.00003908117,0.00014374923,0.000029458022,0.000093539136,0.000046719768,0.00029513487,0.000008022049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046280454,0.00015130652,0.0015682599,0.0000072951434,0.00011610679,0.000015278925,0.00008484981,0.0005499126,0.00030600128,0.99332935,0.0005373767,0.0028714573],"study_design_scores_gemma":[0.0006949845,0.0006984332,0.00050193316,0.000087465945,0.00005967122,0.000014491568,0.0006263241,0.010909569,0.0005234902,0.984917,0.00078247103,0.00018419053],"about_ca_topic_score_codex":0.000009733051,"about_ca_topic_score_gemma":0.000001032525,"teacher_disagreement_score":0.8853076,"about_ca_system_score_codex":0.00004069929,"about_ca_system_score_gemma":0.000052655774,"threshold_uncertainty_score":0.999304},"labels":[],"label_agreement":null},{"id":"W2916876370","doi":"10.1371/journal.pcbi.1006761","title":"Phylogenies from dynamic networks","year":2019,"lang":"en","type":"article","venue":"PLoS Computational Biology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; National Institutes of Health; Aids Fonds","keywords":"Closeness; Tree (set theory); Dynamic network analysis; Computer science; Phylogenetic tree; Network analysis; Preferential attachment; Evolving networks; Artificial intelligence; Tree network; Machine learning; Complex network; Mathematics; Biology; Algorithm","score_opus":0.006230222771661135,"score_gpt":0.24232031080895433,"score_spread":0.2360900880372932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916876370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.819736,0.00013787694,0.17548762,0.00011649831,0.000104363266,0.00015003655,0.000081323065,0.00009906184,0.0040872237],"genre_scores_gemma":[0.9911183,0.0000012465771,0.007014998,0.00011702542,0.00020610791,0.000016568723,0.0014449862,0.000011359226,0.00006940293],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926037,0.00006186967,0.00018426603,0.00026039165,0.00006240923,0.00017070955],"domain_scores_gemma":[0.99939036,0.00027847243,0.00008779198,0.00015010369,0.000061613166,0.0000316507],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000037192305,0.000117996016,0.00021209547,0.000053150907,0.000048018133,0.000017557868,0.00016736313,0.00004094357,0.0030601763],"category_scores_gemma":[0.0000014822169,0.000111523215,0.00009682601,0.00011749035,0.00004451368,0.0000325549,0.0000843429,0.000112928166,0.00023254662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029518396,0.00021835457,0.6032442,0.0000030412934,0.0008829244,6.8180987e-7,0.00007103219,0.16487141,0.002928876,0.20210654,0.00082617544,0.024817256],"study_design_scores_gemma":[0.00017605713,0.000033581604,0.023822568,0.0000061052738,0.000025502413,1.5763538e-7,0.00001446192,0.69512916,0.000059737587,0.27989793,0.00068735785,0.00014738747],"about_ca_topic_score_codex":0.00006141876,"about_ca_topic_score_gemma":0.0000061950464,"teacher_disagreement_score":0.57942164,"about_ca_system_score_codex":0.000016446284,"about_ca_system_score_gemma":0.000018872184,"threshold_uncertainty_score":0.99785113},"labels":[],"label_agreement":null},{"id":"W2918700359","doi":"","title":"Detecting communities in social networks using concept interestingness.","year":2018,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Data science","score_opus":0.21095866026230492,"score_gpt":0.4626496586744962,"score_spread":0.2516909984121913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918700359","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9801861,0.0004525621,0.013287927,0.0007185831,0.00032837814,0.00182378,0.000104790306,0.00004018163,0.0030576847],"genre_scores_gemma":[0.99844235,0.000012115641,0.001039126,0.000009161939,0.0002735658,0.00006607414,0.0000047204494,0.000015720878,0.00013714365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99804485,0.00064491323,0.0003612755,0.00021685821,0.00025781934,0.0004742851],"domain_scores_gemma":[0.9948238,0.0012897955,0.00025097217,0.00028761907,0.0033189638,0.000028814651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081476266,0.0001686887,0.0004129887,0.00013043014,0.0010581855,0.00004974977,0.0004998846,0.000034231947,0.000035336016],"category_scores_gemma":[0.00030414743,0.00012985653,0.0000872503,0.0012525219,0.0012967363,0.00009486267,0.00050984084,0.00038300618,5.301165e-7],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025359343,0.0010343132,0.07231086,0.00026340192,0.002142336,0.0000021757544,0.16369617,0.036048923,0.008146929,0.46335635,0.0076787267,0.24278389],"study_design_scores_gemma":[0.0030405747,0.001006515,0.0008533615,0.0028497616,0.0000860323,2.1797352e-7,0.62554866,0.17269793,0.10026968,0.088002294,0.0048091672,0.00083582796],"about_ca_topic_score_codex":0.000096988806,"about_ca_topic_score_gemma":0.0013050999,"teacher_disagreement_score":0.46185246,"about_ca_system_score_codex":0.00016679095,"about_ca_system_score_gemma":0.0001350342,"threshold_uncertainty_score":0.8138814},"labels":[],"label_agreement":null},{"id":"W2921560389","doi":"10.1016/j.dam.2020.04.018","title":"The iterated local model for social networks","year":2020,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences; Ryerson University; U.S. Department of Energy","keywords":"Transitive relation; Mathematics; Iterated function; Sequence (biology); Bounded function; Combinatorics; Computer science; Discrete mathematics","score_opus":0.03387150273590973,"score_gpt":0.29586572179908155,"score_spread":0.26199421906317183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921560389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002781461,0.000036177404,0.9902762,0.00044905217,0.000051374747,0.001245253,0.0001364412,0.00019786795,0.0073294872],"genre_scores_gemma":[0.9257263,0.0000069208822,0.07033768,0.00009276315,0.0012059232,0.0013944522,0.0009279549,0.0001154019,0.00019258725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818957,0.000016980175,0.00065298425,0.0004651594,0.0002389302,0.00043638458],"domain_scores_gemma":[0.9985152,0.00021977608,0.00051070953,0.00057195587,0.00009935534,0.00008298672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025991304,0.00045033402,0.00067836285,0.0000318658,0.0004869012,0.00032236523,0.0007543806,0.0001797025,0.000023816714],"category_scores_gemma":[0.0000036342167,0.00034329246,0.00050666847,0.0001452605,0.00014406507,0.000018882927,0.00084846705,0.0006548822,0.000007672741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027986207,0.00006607513,0.0000030482688,0.00015087616,0.00061475625,2.1620527e-7,0.0017124204,0.070985794,0.000046415338,0.88867867,0.022710325,0.015003405],"study_design_scores_gemma":[0.000102153674,0.000003180964,6.869952e-7,0.000019894593,0.00014962173,3.140406e-8,0.0002621089,0.59437436,0.000038687343,0.40412524,0.00070045,0.00022360116],"about_ca_topic_score_codex":0.0000054896523,"about_ca_topic_score_gemma":0.0000033319823,"teacher_disagreement_score":0.9254482,"about_ca_system_score_codex":0.000044334716,"about_ca_system_score_gemma":0.00008179577,"threshold_uncertainty_score":0.9999019},"labels":[],"label_agreement":null},{"id":"W2921784731","doi":"10.1038/s41598-019-40801-5","title":"Timing Information Propagation in Interactive Networks","year":2019,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"DECIPHER; Computer science; Probabilistic logic; Information flow; Convergence (economics); Focus (optics); Robot; Simple (philosophy); Human–computer interaction; Artificial intelligence; Theoretical computer science; Distributed computing; Bioinformatics; Biology","score_opus":0.006739842598530259,"score_gpt":0.24516903738813264,"score_spread":0.2384291947896024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921784731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92620593,0.000007636997,0.04885184,0.000026596037,0.0015392166,0.00043468352,3.4930343e-7,0.000056612043,0.022877136],"genre_scores_gemma":[0.9988507,1.03624835e-7,0.00039057387,0.0000071301447,0.00004841878,0.000022166283,0.00014115589,0.0000038001303,0.0005359227],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909705,0.00002325857,0.0003525118,0.00021151608,0.00016704283,0.00014861787],"domain_scores_gemma":[0.999255,0.000016352493,0.00027373474,0.0003381344,0.000092255024,0.000024541838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059408834,0.000070577255,0.00010772174,0.00018208628,0.000060387276,0.00022278776,0.00006351751,0.00001783779,0.0004412758],"category_scores_gemma":[0.000006306898,0.00006667069,0.000052084633,0.00046838095,0.000023395045,0.0007879529,0.000054159234,0.0001056965,0.00005317828],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014745556,0.000118820586,0.82822496,0.000016402315,0.000045325934,0.000012450505,0.0017464198,0.034994837,0.0015296838,0.003875284,0.011804427,0.117616646],"study_design_scores_gemma":[0.00035000363,0.000043697233,0.049179547,0.00028235698,0.000035360907,0.000014032478,0.0010336062,0.79755545,0.009960243,0.07860321,0.062279426,0.0006630599],"about_ca_topic_score_codex":0.00008586434,"about_ca_topic_score_gemma":0.000009418041,"teacher_disagreement_score":0.7790454,"about_ca_system_score_codex":0.00004303961,"about_ca_system_score_gemma":0.00003334211,"threshold_uncertainty_score":0.48316607},"labels":[],"label_agreement":null},{"id":"W2924965132","doi":"10.3390/ijerph16061039","title":"A Two-Stage Decision Framework for Resolving Brownfield Conflicts","year":2019,"lang":"en","type":"article","venue":"International Journal of Environmental Research and Public Health","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Northwestern Polytechnical University; Northwestern University","keywords":"Brownfield; Negotiation; Conflict resolution; Stage (stratigraphy); Operations research; Preference; Computer science; Outcome (game theory); Intervention (counseling); Management science; Engineering; Political science; Economics; Microeconomics; Psychology; Civil engineering; Geology","score_opus":0.07181218748243046,"score_gpt":0.4263957059112552,"score_spread":0.35458351842882474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924965132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8664587,0.00051341567,0.12584089,0.004773119,0.00024407558,0.00034054066,0.000074076925,0.0000064206924,0.0017487559],"genre_scores_gemma":[0.9859617,0.00019216433,0.012752375,0.00024244389,0.00048743706,0.0000066684483,0.000016334494,0.000010846876,0.0003300602],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982498,0.00009913714,0.00039557813,0.0001574387,0.00076624,0.0003317845],"domain_scores_gemma":[0.9982984,0.0009445222,0.00023124545,0.00013424136,0.00011353021,0.0002780618],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018486334,0.00008045158,0.00018456786,0.00027385404,0.000105602114,0.00016760213,0.00037555362,0.000029161685,0.0014826113],"category_scores_gemma":[0.00008540456,0.000070208946,0.00009590031,0.000080936006,0.00006858049,0.0002346185,0.00016896903,0.00042324336,0.000011001402],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000347818,0.0008316319,0.21363378,0.000016607533,0.00037885847,0.0000075040593,0.00062581286,0.000035693123,0.0010000609,0.2164601,0.0030029248,0.5636592],"study_design_scores_gemma":[0.003754038,0.0025731837,0.039277148,0.00045001795,0.0000077138475,0.000031856238,0.0039575095,0.0035657578,0.00054632657,0.2772365,0.6682209,0.0003790928],"about_ca_topic_score_codex":0.000096928256,"about_ca_topic_score_gemma":0.000006653945,"teacher_disagreement_score":0.66521794,"about_ca_system_score_codex":0.00015326503,"about_ca_system_score_gemma":0.00013041042,"threshold_uncertainty_score":0.9994302},"labels":[],"label_agreement":null},{"id":"W2926359022","doi":"10.1007/978-3-030-16145-3_36","title":"Neighbor-Based Link Prediction with Edge Uncertainty","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Link (geometry); Enhanced Data Rates for GSM Evolution; Ground truth; Focus (optics); Artificial intelligence; Data mining","score_opus":0.009964904634420848,"score_gpt":0.22999973586383407,"score_spread":0.22003483122941322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2926359022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018137354,0.00005377328,0.98596025,0.00023767051,0.00028859894,0.00038193335,0.000024628773,0.0001169142,0.012754859],"genre_scores_gemma":[0.93778366,0.000002392047,0.059305076,0.00039767526,0.0017462285,0.000014600318,0.00011751299,0.000052804287,0.0005800642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978056,0.00001984069,0.00031746802,0.0009216439,0.0005386166,0.0003968599],"domain_scores_gemma":[0.99835324,0.00021816404,0.00024534733,0.0008916324,0.0002039949,0.000087617846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028875575,0.00041632948,0.00046093075,0.00040426682,0.00014048099,0.00019759842,0.0007901857,0.0001365939,0.00023242678],"category_scores_gemma":[0.000003407021,0.0003345587,0.00014523517,0.0003781471,0.0003936417,0.00014298518,0.00020761693,0.0006744671,0.000025293655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021237385,0.000030962266,0.0045032054,0.00002008886,0.00004558683,0.0000051942934,0.00006931329,0.38030022,0.000038900227,0.011856967,0.00010747172,0.6030009],"study_design_scores_gemma":[0.00038428113,0.00029802945,0.0004086087,0.000557768,0.000060911512,0.0000019510576,1.468755e-7,0.9153246,0.00058008754,0.07335171,0.008389602,0.00064224313],"about_ca_topic_score_codex":0.000081123486,"about_ca_topic_score_gemma":0.000055221437,"teacher_disagreement_score":0.9376023,"about_ca_system_score_codex":0.00017209859,"about_ca_system_score_gemma":0.0005749904,"threshold_uncertainty_score":0.99991065},"labels":[],"label_agreement":null},{"id":"W2928006388","doi":"10.3390/app9071396","title":"Multiple Correspondence Analysis of Emergencies Attended by Integrated Security Services","year":2019,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Categorical variable; Emergency response; Emergency management; Event (particle physics); Resource (disambiguation); Data science; Operations research; Machine learning; Medical emergency; Engineering; Medicine","score_opus":0.007336740000711961,"score_gpt":0.24875617893294247,"score_spread":0.2414194389322305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928006388","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98474485,0.000045686334,0.0024387785,0.000021424987,0.00003912641,0.00015893581,0.000053718763,0.000050396295,0.012447105],"genre_scores_gemma":[0.9990354,0.0000025657134,0.0006308697,0.000029936224,0.00001542944,0.000018733537,0.00008150086,0.0000045605175,0.00018100707],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863803,0.000038742422,0.00030847263,0.00040347487,0.00036625966,0.00024498737],"domain_scores_gemma":[0.99917233,0.00014771144,0.0002377694,0.00031318655,0.00008023389,0.00004875151],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004287752,0.00014980727,0.00038701907,0.00026823254,0.00012423568,0.000049742815,0.000643996,0.000028169741,0.002179912],"category_scores_gemma":[0.0000020874593,0.00012182031,0.00016354851,0.0032319415,0.00020565896,0.00012599706,0.000121723904,0.00009132494,0.000035442594],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021764848,0.00013990466,0.8991027,0.000011692938,0.0006037009,8.890851e-8,0.0008912205,0.0015415396,0.07730219,0.016347066,0.0016842447,0.0023539138],"study_design_scores_gemma":[0.0007272067,0.00021928051,0.06122237,0.000060679075,0.0017886667,1.9809674e-7,0.024245502,0.69000596,0.18835041,0.021221573,0.010716182,0.0014419632],"about_ca_topic_score_codex":0.0014127332,"about_ca_topic_score_gemma":0.00024863635,"teacher_disagreement_score":0.8378803,"about_ca_system_score_codex":0.000010725214,"about_ca_system_score_gemma":0.00003544653,"threshold_uncertainty_score":0.9987322},"labels":[],"label_agreement":null},{"id":"W29282234","doi":"","title":"Detecting Related Message Traffic","year":2004,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Internet privacy; Computer security; Advertising; Psychology; Social psychology; Business","score_opus":0.007800459681621567,"score_gpt":0.24084915189069758,"score_spread":0.233048692209076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29282234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8454458,0.000019374085,0.041991588,0.000118610864,0.000023297885,0.00008017503,5.388248e-7,0.00035480692,0.11196583],"genre_scores_gemma":[0.99530256,3.7313455e-7,0.003927368,0.000016910519,0.00006334443,0.000007399293,0.0000054340626,0.000010935351,0.00066566607],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994687,0.000013000855,0.00015319673,0.00014321679,0.00006894518,0.00015294696],"domain_scores_gemma":[0.99971676,0.000017851757,0.000043300355,0.00016881498,0.000017578179,0.000035679404],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008934181,0.000081268365,0.00010877895,0.000043668144,0.00008302985,0.000026130741,0.000096562726,0.00001839174,0.0013087018],"category_scores_gemma":[0.0000014076883,0.00007303977,0.00010102846,0.0002355178,0.000015093876,0.00005619382,0.000030065414,0.000108530796,0.00007021325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000940732,0.0003843977,0.009485897,0.0000069188986,0.00050776626,0.00001006196,0.00093008415,0.04906912,0.005391685,0.41034126,0.0016297351,0.52223366],"study_design_scores_gemma":[0.005469617,0.00034796336,0.008682351,0.00023017637,0.0005710974,0.000015604575,0.0029612654,0.047617037,0.1591965,0.7479488,0.023941338,0.0030182505],"about_ca_topic_score_codex":0.00011507062,"about_ca_topic_score_gemma":0.000016068927,"teacher_disagreement_score":0.5192154,"about_ca_system_score_codex":0.000019173305,"about_ca_system_score_gemma":0.000013655102,"threshold_uncertainty_score":0.9996042},"labels":[],"label_agreement":null},{"id":"W2939308308","doi":"10.1109/icassp.2019.8683631","title":"Scalable MCMC in Degree Corrected Stochastic Block Model","year":2019,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Inference; Computer science; Scalability; Markov chain Monte Carlo; Stochastic block model; Machine learning; Block (permutation group theory); Degree (music); Focus (optics); Artificial intelligence; Generative model; Theoretical computer science; Generative grammar; Mathematics; Cluster analysis","score_opus":0.017534059442878842,"score_gpt":0.24747131535634054,"score_spread":0.2299372559134617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939308308","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6487857,0.000011856826,0.23493329,0.000042027412,0.00004101314,0.00028642346,0.0000038326802,0.00013857785,0.11575726],"genre_scores_gemma":[0.9883854,1.7251575e-7,0.0033671567,0.000034792283,0.00004288487,0.000021784983,0.000015323152,0.000014575225,0.008117935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920726,0.00001800079,0.00019180556,0.00022949716,0.00010995594,0.00024349237],"domain_scores_gemma":[0.99951595,0.000043522672,0.000045132976,0.0003080687,0.00004211467,0.00004523973],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000082040206,0.00012200117,0.00021550043,0.000099262215,0.000024071034,0.000026159627,0.00016752518,0.000026403486,0.001720669],"category_scores_gemma":[0.000001704029,0.00011265916,0.00007561829,0.00031014826,0.000012683482,0.00006967806,0.00008635372,0.00013311597,0.00023289763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000439815,0.0005193142,0.19958918,0.00001112286,0.00013532363,0.0000010809637,0.00020187048,0.6896821,0.0027677629,0.0651394,0.01979251,0.022116298],"study_design_scores_gemma":[0.0002523109,0.000014762106,0.0012891162,0.000017007518,0.0000131509405,1.7741381e-7,0.000039568342,0.9886632,0.00029736728,0.009149183,0.000107280895,0.00015686578],"about_ca_topic_score_codex":0.00053143565,"about_ca_topic_score_gemma":0.00010409937,"teacher_disagreement_score":0.33959964,"about_ca_system_score_codex":0.000026658903,"about_ca_system_score_gemma":0.0000352052,"threshold_uncertainty_score":0.9991919},"labels":[],"label_agreement":null},{"id":"W2940867882","doi":"10.1007/978-3-030-11286-8_3","title":"On Detecting Multidimensional Communities","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Geography; Computer science","score_opus":0.01661429579870995,"score_gpt":0.26133930903103475,"score_spread":0.2447250132323248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940867882","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018828266,0.0008670282,0.42878002,0.00019473869,0.00079453265,0.0009815748,0.00005966497,0.00032191604,0.5661177],"genre_scores_gemma":[0.99084204,0.000013573366,0.0007773645,0.00035507148,0.0031577474,0.00001640142,0.0003378373,0.00012708454,0.0043728896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842906,0.000091555776,0.0004274275,0.0003438315,0.00028622962,0.0004219198],"domain_scores_gemma":[0.9978388,0.0012856789,0.00033849533,0.0004161662,0.000080285696,0.000040561983],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002075587,0.0005320795,0.00076342345,0.00017854296,0.00034599408,0.000050950213,0.00031009,0.0005224821,0.0015034535],"category_scores_gemma":[0.0000063259463,0.00054692867,0.0004492214,0.00009333524,0.00012591596,0.000032385688,0.00022556426,0.002248423,0.000038868773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012095624,0.000092343995,0.00264701,0.000026020016,0.00066319964,0.0000094747975,0.0010882373,0.23337995,0.000006356425,0.47844672,0.0035845358,0.2799352],"study_design_scores_gemma":[0.0009996016,0.00018649719,0.00025827857,0.001218798,0.0003095538,0.0000014775485,0.00005563968,0.10636034,0.000055378165,0.8450869,0.04318527,0.0022823103],"about_ca_topic_score_codex":0.0002383617,"about_ca_topic_score_gemma":0.00041331546,"teacher_disagreement_score":0.9889592,"about_ca_system_score_codex":0.00013089085,"about_ca_system_score_gemma":0.000055616776,"threshold_uncertainty_score":0.9996982},"labels":[],"label_agreement":null},{"id":"W2940953960","doi":"10.1002/9781118766804.wbiect130","title":"Social Network Analysis","year":2016,"lang":"en","type":"other","venue":"The International Encyclopedia of Communication Theory and Philosophy","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Social network (sociolinguistics); Social network analysis; Sociology; Data science; Social science; Social media; Computer science; World Wide Web; Social capital","score_opus":0.010878493603885257,"score_gpt":0.2869303791937274,"score_spread":0.2760518855898421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940953960","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034945428,0.00075955095,0.0058316495,0.0017169946,0.000058155147,0.00013355429,0.00009492205,0.000055534343,0.9913147],"genre_scores_gemma":[0.609153,0.002230217,0.0007519273,0.00022909076,0.0040085637,0.000098211094,0.0005777412,0.00017958034,0.38277167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988245,0.00038153355,0.00031177586,0.00016586673,0.00020913516,0.00010718628],"domain_scores_gemma":[0.9981712,0.0005272199,0.0005805004,0.0006266453,0.000069197784,0.000025229721],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00064282876,0.00018265515,0.00033806683,0.0001955673,0.00013064296,0.000022096872,0.0010878273,0.00006971082,0.0068775425],"category_scores_gemma":[0.000007497045,0.00012547517,0.00026709668,0.0002228751,0.00029577946,0.00003968848,0.00034990182,0.00018145423,0.000026096552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025326939,0.000027677217,0.00095831044,0.0000026400335,0.002159176,4.3811852e-8,0.000086527,0.0000072687994,6.6868785e-7,0.88216525,0.10915104,0.005416054],"study_design_scores_gemma":[0.00007011462,0.000003081367,0.0000926293,0.00003445639,0.00040707056,7.901958e-8,0.000008783563,0.000018670275,0.000001970202,0.6126145,0.38665518,0.00009347608],"about_ca_topic_score_codex":0.00008054486,"about_ca_topic_score_gemma":0.000015803624,"teacher_disagreement_score":0.60911804,"about_ca_system_score_codex":0.000010451072,"about_ca_system_score_gemma":0.0000182518,"threshold_uncertainty_score":0.9940303},"labels":[],"label_agreement":null},{"id":"W2943595118","doi":"","title":"Sub-optimal topological protection strategy from advanced malware","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nurses Association","funders":"","keywords":"Malware; Betweenness centrality; Computer science; Domino effect; Closeness; Set (abstract data type); Computer security; Software; Complex network; Order (exchange); Theoretical computer science; Distributed computing; Mathematics; Centrality; Business; Law","score_opus":0.013192174281005607,"score_gpt":0.25593284504542146,"score_spread":0.24274067076441586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943595118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45684698,0.000014594598,0.54270154,0.00012789012,0.00005926557,0.0001702238,0.0000010670457,0.00005064069,0.00002779164],"genre_scores_gemma":[0.88941026,5.8005423e-7,0.11015,0.00008171972,0.00029011615,0.000055501747,0.0000055023343,0.000005485607,8.027235e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870354,0.000044614982,0.00019280503,0.0005068222,0.00021059347,0.00034163502],"domain_scores_gemma":[0.9993654,0.000083845414,0.00007213935,0.0003218948,0.000089668814,0.00006708107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012623743,0.00015444336,0.00018138734,0.000107078784,0.00014419053,0.00019706033,0.00045383378,0.00004273557,0.00037145423],"category_scores_gemma":[0.0000086154205,0.00012639545,0.00006023928,0.0007225118,0.0002063726,0.00031757014,0.00019717545,0.0002598005,0.000029587332],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036101856,0.000047389593,0.009744704,0.0000010265993,0.0000053843523,0.0000011348101,0.00007429657,0.08420721,0.009706663,0.00021869334,0.000008141101,0.8959817],"study_design_scores_gemma":[0.00018025443,0.00013973321,0.035495393,0.000026327725,0.000004863679,0.0000011079236,0.0000032125074,0.79149777,0.057768457,0.11457257,0.00003322493,0.00027708523],"about_ca_topic_score_codex":0.0009235048,"about_ca_topic_score_gemma":0.000039462073,"teacher_disagreement_score":0.8957047,"about_ca_system_score_codex":0.0000488441,"about_ca_system_score_gemma":0.00004717433,"threshold_uncertainty_score":0.5154257},"labels":[],"label_agreement":null},{"id":"W2944743083","doi":"10.7763/ijmo.2019.v9.679","title":"A Framework for Social Network-Based Dynamic Modeling and Prediction of Communicable Diseases","year":2019,"lang":"en","type":"article","venue":"International Journal of Modeling and Optimization","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Social network (sociolinguistics); World Wide Web; Social media","score_opus":0.01790252756635167,"score_gpt":0.29390279494375515,"score_spread":0.27600026737740346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944743083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11396505,0.00020798587,0.88545215,0.00015680122,0.000085186024,0.00007591685,0.000028278382,0.000007961337,0.000020676016],"genre_scores_gemma":[0.85514873,0.000058614154,0.14449555,0.000018962319,0.00019950431,0.000003072562,0.00006323159,0.000008914843,0.0000034075224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931234,0.000028363816,0.00034514666,0.00008141438,0.0001594162,0.00007333983],"domain_scores_gemma":[0.9991117,0.00008383157,0.0002671929,0.000059171245,0.0004514107,0.000026682414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018828525,0.000071783616,0.00018075664,0.00009057498,0.00006567322,0.000045992805,0.00011714487,0.000035054443,0.000016228783],"category_scores_gemma":[0.000010933845,0.00006993282,0.000089865964,0.000050972667,0.00001521798,0.00014645485,0.000034157154,0.000098598335,4.237045e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001045064,0.00003987135,0.004006567,0.0000070375413,0.000111696274,5.0270557e-8,0.000059236572,0.99005526,0.000013719244,0.0033101817,0.000014419822,0.0022774253],"study_design_scores_gemma":[0.00047018478,0.000043979686,0.000025929756,0.00013205307,0.000077857476,5.76635e-7,0.00006677095,0.9692186,0.0000045309125,0.029901408,0.000007801518,0.0000503247],"about_ca_topic_score_codex":0.000017148486,"about_ca_topic_score_gemma":6.377102e-7,"teacher_disagreement_score":0.7411837,"about_ca_system_score_codex":0.00002134506,"about_ca_system_score_gemma":0.000033681634,"threshold_uncertainty_score":0.28517777},"labels":[],"label_agreement":null},{"id":"W2944992955","doi":"10.1109/mitp.2019.2910982","title":"Thick Data: A New Qualitative Analytics for Identifying Customer Insights","year":2019,"lang":"en","type":"article","venue":"IT Professional","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Analytics; Data science; Data analysis; Big data; Knowledge management; Data mining","score_opus":0.14514821415844434,"score_gpt":0.457182976612501,"score_spread":0.3120347624540567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944992955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29001397,0.0005245279,0.6446153,0.0055307057,0.0029546241,0.0037306666,0.0005500718,0.0004044878,0.05167566],"genre_scores_gemma":[0.9579883,0.0000013363589,0.011412845,0.00024021722,0.00070388394,0.00003585277,0.0007922639,0.000023865936,0.0288014],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986639,0.000108266395,0.0003173436,0.0003957189,0.00028041058,0.00023434356],"domain_scores_gemma":[0.9986188,0.00039842434,0.00018911538,0.00058330124,0.00012642852,0.00008396676],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038536603,0.00015522381,0.00027186947,0.000098117074,0.00014037506,0.000052151834,0.0004928798,0.00005061934,0.0013491653],"category_scores_gemma":[0.000013854189,0.00012681638,0.00012293198,0.00024362764,0.000027933122,0.00035729297,0.00036495214,0.00022141534,0.0002521554],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008946418,0.00027824548,0.0074887,0.00006347581,0.0006370442,8.152191e-7,0.009755143,0.00009069921,0.0014063644,0.29593554,0.677021,0.0072334674],"study_design_scores_gemma":[0.0019197842,0.00007756073,0.0014776026,0.0005412269,0.0003179957,5.5544604e-7,0.016112698,0.03369155,0.0012136103,0.36818516,0.5755364,0.0009258481],"about_ca_topic_score_codex":0.00010235427,"about_ca_topic_score_gemma":0.000024150306,"teacher_disagreement_score":0.66797435,"about_ca_system_score_codex":0.000025133022,"about_ca_system_score_gemma":0.0002207615,"threshold_uncertainty_score":0.99956375},"labels":[],"label_agreement":null},{"id":"W2945802090","doi":"","title":"Modularity clustering on trees","year":2012,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Modularity (biology); Computer science; Cluster analysis; Artificial intelligence; Evolutionary biology","score_opus":0.019260039093969606,"score_gpt":0.24545564114323246,"score_spread":0.22619560204926284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945802090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084085934,0.00125152,0.7747867,0.011106555,0.00042562082,0.0007263219,0.00013490804,0.00037775343,0.12710465],"genre_scores_gemma":[0.9235382,0.00023369766,0.051665727,0.00007219349,0.00026405323,0.00013439807,0.0009247122,0.000092042006,0.023074977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9899881,0.0067589027,0.0008400493,0.0010908666,0.0005366576,0.00078546075],"domain_scores_gemma":[0.99259335,0.0014174848,0.0008063029,0.003477924,0.0013352978,0.00036964967],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005232599,0.00068805914,0.000783377,0.00021378744,0.000628674,0.000545791,0.0016798959,0.00034878505,0.0010059411],"category_scores_gemma":[0.00018932662,0.00079069525,0.0007055682,0.0004707056,0.0003232903,0.0002060676,0.00238961,0.0013121604,0.0003574924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021218666,0.0022109495,0.015461319,0.00011327368,0.00048640513,0.0000025366248,0.0052679344,0.0018722416,0.0023356255,0.7152409,0.0022538772,0.2547337],"study_design_scores_gemma":[0.0015241243,0.0000020599473,0.06594534,0.009190239,0.0009027975,0.000009715722,0.00035406675,0.37684003,0.07176313,0.06112486,0.40901622,0.0033274132],"about_ca_topic_score_codex":0.004504419,"about_ca_topic_score_gemma":0.0031101767,"teacher_disagreement_score":0.83945227,"about_ca_system_score_codex":0.00030022638,"about_ca_system_score_gemma":0.00018706477,"threshold_uncertainty_score":0.99990726},"labels":[],"label_agreement":null},{"id":"W2946633185","doi":"10.1007/978-3-030-18305-9_64","title":"Event Prediction in Social Graphs Using 1-Dimensional Convolutional Neural Network","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Convolutional neural network; Event (particle physics); Artificial intelligence; Artificial neural network; Astrophysics","score_opus":0.017170540215327452,"score_gpt":0.26134238051139025,"score_spread":0.2441718402960628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946633185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009604262,0.00015337404,0.98744047,0.00009542037,0.00094271183,0.00037220793,0.00002647548,0.000054178516,0.0013109075],"genre_scores_gemma":[0.97744846,7.8685287e-7,0.020069873,0.00017607099,0.0020683706,0.0000051577604,0.00007428606,0.0000261109,0.00013088333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976638,0.0000408009,0.00046747428,0.0007505859,0.00059664034,0.0004807067],"domain_scores_gemma":[0.9991239,0.00015275559,0.00025132022,0.0002949243,0.00012195358,0.000055175842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044676798,0.00033855776,0.00044447745,0.00042947097,0.00024754868,0.00008612588,0.00047601736,0.00014859243,0.00021377557],"category_scores_gemma":[0.0000024998615,0.00034362834,0.00021510232,0.00046236708,0.00034056968,0.00015736876,0.00041000967,0.0006915174,0.00000863875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001174315,0.00003224891,0.012974017,0.0000064620667,0.000027973127,0.000004228242,0.000058743444,0.90923566,0.00005176238,0.035964247,0.00019036305,0.041442536],"study_design_scores_gemma":[0.00015124945,0.000028239621,0.0025354638,0.00013374102,0.000016281792,0.0000030390106,8.0264506e-8,0.7137955,0.000012570349,0.2828826,0.00019041223,0.00025083378],"about_ca_topic_score_codex":0.00008710053,"about_ca_topic_score_gemma":0.00004232991,"teacher_disagreement_score":0.9678442,"about_ca_system_score_codex":0.00025529155,"about_ca_system_score_gemma":0.0003478882,"threshold_uncertainty_score":0.9999016},"labels":[],"label_agreement":null},{"id":"W2947494489","doi":"10.1145/3299869.3319879","title":"Maximizing Welfare in Social Networks under A Utility Driven Influence Diffusion model","year":2019,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Maximization; Scalability; Greedy algorithm; Function (biology); Key (lock); Focus (optics)","score_opus":0.012405453407200714,"score_gpt":0.25847014457100936,"score_spread":0.24606469116380864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947494489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8252643,0.0000055409037,0.15639523,0.000213357,0.000013267446,0.00018190469,0.0000019552645,0.00007270388,0.017851768],"genre_scores_gemma":[0.9981142,9.186443e-7,0.0013894801,0.00008497253,0.00007493683,0.000017122258,0.000020316485,0.00001323305,0.00028476774],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901986,0.000042794793,0.00023775162,0.0002892312,0.0001309804,0.0002793896],"domain_scores_gemma":[0.99958307,0.000021432332,0.00007129291,0.00024639716,0.000040367304,0.00003745312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011314254,0.00014317955,0.00023954187,0.00006403693,0.00011527476,0.00004125116,0.00020021862,0.00005457144,0.000864155],"category_scores_gemma":[6.85018e-7,0.00013489206,0.00012207097,0.000258303,0.000025882136,0.00013654308,0.00021111306,0.00022353219,0.000014144013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018377626,0.00013608663,0.6046519,0.0000051155826,0.000032254346,3.5161597e-7,0.0001461723,0.2730267,0.00022685621,0.111309275,0.0003752658,0.010071647],"study_design_scores_gemma":[0.00021339791,0.000005457343,0.09239746,0.000011111573,0.000009142083,4.1737387e-8,0.0001307678,0.89009,0.00001676651,0.016813138,0.00016190327,0.00015083849],"about_ca_topic_score_codex":0.00048819018,"about_ca_topic_score_gemma":0.00008502445,"teacher_disagreement_score":0.6170633,"about_ca_system_score_codex":0.00003906235,"about_ca_system_score_gemma":0.000017504615,"threshold_uncertainty_score":0.9461891},"labels":[],"label_agreement":null},{"id":"W2947873226","doi":"","title":"A stochastic model of catalytic reaction networks","year":2010,"lang":"en","type":"article","venue":"European Conference on Complex Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Catalysis; Chemistry; Organic chemistry","score_opus":0.05181370874149475,"score_gpt":0.2691458727310148,"score_spread":0.21733216398952007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947873226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09201131,0.00000915384,0.70127577,0.000037061705,0.00035831012,0.0004378953,0.00004040847,0.00020079708,0.2056293],"genre_scores_gemma":[0.9983908,4.881289e-7,0.0003408729,0.00001194037,0.0004832897,0.000016200618,0.00008422214,0.000040738283,0.0006314699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985151,0.00015411084,0.00048764588,0.00034805853,0.00022846655,0.00026660852],"domain_scores_gemma":[0.99855876,0.00006867369,0.00035877625,0.00070765003,0.00019860202,0.00010752895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039892574,0.00023070275,0.00037900172,0.00011917872,0.00010413269,0.000086090586,0.00041898584,0.000028582532,0.0001293554],"category_scores_gemma":[0.000007821055,0.00021794147,0.0001310007,0.00017905972,0.00009268839,0.00007427593,0.000095557145,0.00038572022,0.00008132045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052385294,0.00033943934,0.00075229845,0.000035410256,0.00021126171,0.0000031243637,0.0002880788,0.18236743,0.0702897,0.7269263,0.0048648426,0.013869717],"study_design_scores_gemma":[0.00018912683,0.000049938215,0.00059629756,0.00007494041,0.000039333827,0.0000020753914,0.000070578186,0.99735343,0.000063994725,0.0009533014,0.00038378788,0.00022318093],"about_ca_topic_score_codex":0.00024550053,"about_ca_topic_score_gemma":0.000018077066,"teacher_disagreement_score":0.90637946,"about_ca_system_score_codex":0.000014884548,"about_ca_system_score_gemma":0.000042710868,"threshold_uncertainty_score":0.8887395},"labels":[],"label_agreement":null},{"id":"W2948172480","doi":"10.1007/978-981-13-8566-7_31","title":"A Palliative Care Simulator and Visualization Framework","year":2019,"lang":"en","type":"book-chapter","venue":"Smart innovation, systems and technologies","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Windsor","funders":"","keywords":"Computer science; Visualization; Cohesion (chemistry); Cluster analysis; Outlier; Identification (biology); Graph; Set (abstract data type); Data science; Machine learning; Resource (disambiguation); Artificial intelligence; Data mining; Theoretical computer science","score_opus":0.020437159148957943,"score_gpt":0.28295216469107737,"score_spread":0.26251500554211943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948172480","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045754123,0.043820675,0.43797836,0.0009974826,0.002016285,0.009472789,0.0010796807,0.0084470045,0.45043358],"genre_scores_gemma":[0.9839672,0.00015411615,0.00058575167,0.000015109876,0.00017681655,0.000057445886,0.00033477173,0.000058580954,0.014650219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858797,0.000011658095,0.00054700614,0.00048346014,0.0001913116,0.00017859136],"domain_scores_gemma":[0.9982817,0.00009864128,0.0005606621,0.00046448712,0.0005806419,0.000013878301],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011557702,0.00037240633,0.00057430606,0.00052491715,0.00016707885,0.00015852122,0.00015445598,0.00045241113,0.00003116969],"category_scores_gemma":[0.000022747976,0.00034309726,0.000053561194,0.00031446296,0.00015256395,0.00009280888,0.00022676315,0.00035544048,0.000008912808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025273714,0.000004400568,0.020029165,0.00013567237,0.00017060572,3.9156075e-7,0.000118967786,0.000012097379,0.0000058058517,0.9669948,0.00076962926,0.011755915],"study_design_scores_gemma":[0.00031673303,0.0001605382,0.0009852545,0.0019691251,0.00020710418,0.0000011321306,0.0034622103,0.001652172,0.00014152331,0.57959247,0.4103654,0.0011463424],"about_ca_topic_score_codex":0.000059460912,"about_ca_topic_score_gemma":0.0000051773222,"teacher_disagreement_score":0.93821305,"about_ca_system_score_codex":0.000047889243,"about_ca_system_score_gemma":0.000052006442,"threshold_uncertainty_score":0.9999021},"labels":[],"label_agreement":null},{"id":"W2949559065","doi":"10.48550/arxiv.1906.07159","title":"vGraph: A Generative Model for Joint Community Detection and Node Representation Learning","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Generative model; Node (physics); Representation (politics); Inference; Graph; Feature learning; Parameterized complexity; Generative grammar; Community structure; Joint probability distribution; Theoretical computer science; Machine learning; Artificial intelligence; Algorithm; Mathematics","score_opus":0.12889171662393864,"score_gpt":0.2329724560619568,"score_spread":0.10408073943801815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949559065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43001574,0.0000074514355,0.5688665,0.000006919046,0.000033294742,0.0002927872,0.000015570697,0.00006009435,0.0007016438],"genre_scores_gemma":[0.9966551,0.000023990708,0.001994384,0.000011881376,0.00008415896,0.000008662179,0.0001609993,0.000023300561,0.0010374875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988639,0.00027265036,0.00016904341,0.00047422003,0.000041309308,0.00017892764],"domain_scores_gemma":[0.9988616,0.000110675435,0.00029870457,0.00050449505,0.00016782839,0.000056688015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000244608,0.00022494255,0.00033485502,0.00019053192,0.00038870095,0.0000678081,0.00019821123,0.00011174115,0.000015424248],"category_scores_gemma":[0.000009289761,0.0002758299,0.00026067998,0.00018985604,0.000063442196,0.000123522,0.0005538727,0.0007845886,0.0000025931517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041170697,0.00005266662,0.012331746,0.000033011544,0.0002201501,4.775376e-7,0.000458028,0.9778467,0.00065847824,0.00697456,0.00009037823,0.0012926701],"study_design_scores_gemma":[0.00028747402,0.000031902066,0.00057882397,0.0000337376,0.00020412619,1.2405187e-7,0.00041402597,0.9133414,0.0009801588,0.08385396,0.000037078793,0.0002371896],"about_ca_topic_score_codex":0.0011689995,"about_ca_topic_score_gemma":0.00014116836,"teacher_disagreement_score":0.5668721,"about_ca_system_score_codex":0.000079318335,"about_ca_system_score_gemma":0.000041774412,"threshold_uncertainty_score":0.99996936},"labels":[],"label_agreement":null},{"id":"W2949843700","doi":"","title":"Mixed-Membership Stochastic Block-Models for Transactional Networks","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Generative model; Inference; Transactional leadership; Theoretical computer science; Block (permutation group theory); Data mining; Social network analysis; Stochastic block model; Social network (sociolinguistics); Transaction data; Generative grammar; Artificial intelligence; Social media; Database transaction; Cluster analysis; Database; World Wide Web; Mathematics","score_opus":0.07334723654462495,"score_gpt":0.20290120766507846,"score_spread":0.12955397112045353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949843700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043052174,0.000024993715,0.9530299,0.00003436797,0.0004446007,0.0005907737,0.00012413786,0.00019287622,0.0025061895],"genre_scores_gemma":[0.9960636,0.000005292078,0.0014690859,0.00002143774,0.0008759642,0.000016470027,0.000310197,0.000056385692,0.0011815809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981247,0.00006727464,0.00027574028,0.0009702477,0.00008066368,0.0004813666],"domain_scores_gemma":[0.9982648,0.00024372744,0.00029881968,0.0007784077,0.00022202735,0.00019220023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022779897,0.0004500109,0.00052448804,0.00020579791,0.00024854438,0.00007911579,0.0007318296,0.00035549505,0.00043814888],"category_scores_gemma":[0.0000028888117,0.00055410207,0.0007865182,0.00028307762,0.00013086919,0.0001420198,0.00025740592,0.0011764191,0.000010094741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005303291,0.00009805687,0.00017440271,0.00001630716,0.000326434,0.0000026273033,0.000023567882,0.82728744,0.0000058711316,0.17068486,0.0006865798,0.0006408414],"study_design_scores_gemma":[0.00032164657,0.000019063802,0.00002965715,0.000042077103,0.0004504671,4.6853376e-7,0.0000392621,0.74335843,0.000023531678,0.25499818,0.00029880062,0.0004184323],"about_ca_topic_score_codex":0.00022685995,"about_ca_topic_score_gemma":0.00015873826,"teacher_disagreement_score":0.9530114,"about_ca_system_score_codex":0.00009385551,"about_ca_system_score_gemma":0.00014342203,"threshold_uncertainty_score":0.99969107},"labels":[],"label_agreement":null},{"id":"W2950034323","doi":"10.21307/connections-2017-002","title":"Are We in Agreement? Benchmarking and Reliability Issues between Social Network Analytic Programs","year":2018,"lang":"en","type":"article","venue":"Connections","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Dental and Craniofacial Research; National Institutes of Health","keywords":"Betweenness centrality; Benchmarking; CLARITY; Computer science; Reliability (semiconductor); Closeness; Variety (cybernetics); Social network analysis; Centrality; Measure (data warehouse); Data science; Network analysis; Social network (sociolinguistics); Key (lock); Data mining; Artificial intelligence; Computer security; World Wide Web; Statistics; Mathematics; Social media; Business; Engineering","score_opus":0.03855043969690652,"score_gpt":0.32397636265484964,"score_spread":0.2854259229579431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950034323","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9805039,0.000114091745,0.012609279,0.0019046864,0.00011137852,0.0003816937,0.000008843279,0.00012959163,0.0042365035],"genre_scores_gemma":[0.9958279,0.000005001497,0.0011006932,0.000015997713,0.0028209246,0.00004707901,0.000025162453,0.0000090129615,0.0001482004],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990374,0.00008514911,0.00024030553,0.00028934493,0.00008620116,0.00026158537],"domain_scores_gemma":[0.99947697,0.00006712555,0.00013873269,0.0001918738,0.00007960013,0.00004567572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029006597,0.00012045033,0.00024530993,0.00007203672,0.00038211897,0.00006996639,0.00009338455,0.000038539936,0.00030630655],"category_scores_gemma":[0.0000065429545,0.0001252092,0.00008381586,0.0005852895,0.000145038,0.000078388926,0.00009447813,0.00014377435,0.0000076084593],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022952993,0.000047661455,0.9575395,0.000004248155,0.000053042982,2.3393675e-7,0.00020738135,0.00002235428,0.0000016575124,0.0026683665,0.004066164,0.035387106],"study_design_scores_gemma":[0.00030043017,0.00011275372,0.81107897,0.00011772421,0.00018513591,2.586625e-7,0.00074351917,0.004814947,0.000034190547,0.108063914,0.07418295,0.0003651979],"about_ca_topic_score_codex":0.0004746094,"about_ca_topic_score_gemma":0.0007729746,"teacher_disagreement_score":0.14646052,"about_ca_system_score_codex":0.000038618076,"about_ca_system_score_gemma":0.000012281023,"threshold_uncertainty_score":0.5105883},"labels":[],"label_agreement":null},{"id":"W2950067706","doi":"10.1016/j.jet.2012.05.007","title":"Homophily and long-run integration in social networks","year":2012,"lang":"en","type":"preprint","venue":"Journal of Economic Theory","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université Laval","funders":"National Science Foundation","keywords":"Homophily; Computer science; Type (biology); Preferential attachment; Process (computing); Degree distribution; Social network (sociolinguistics); Econometrics; Theoretical computer science; Mathematics; Complex network; Psychology; World Wide Web; Social media; Social psychology","score_opus":0.014649804768599112,"score_gpt":0.2740406262397904,"score_spread":0.2593908214711913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950067706","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8990219,0.0018629645,0.093219124,0.00016442558,0.00068271166,0.00017433736,0.000012168171,0.000013414132,0.0048489096],"genre_scores_gemma":[0.99501896,0.00007102009,0.00038502517,0.000020966667,0.0043876753,0.0000056731074,0.000016335038,0.000021345153,0.000073021554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987326,0.0001944463,0.0006890519,0.00015157516,0.00004597462,0.0001863339],"domain_scores_gemma":[0.9986284,0.00012604248,0.00099381,0.00015136076,0.00003800573,0.00006239692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013244293,0.00019847538,0.00056563923,0.00021988027,0.00005008952,0.000087440014,0.00024901592,0.00013156007,0.00035951496],"category_scores_gemma":[0.000003310302,0.00018860266,0.000287706,0.00003198454,0.00006353244,0.00015382703,0.0002422168,0.00089312205,0.0000036176282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024098635,0.00027409644,0.1588038,0.00003136206,0.0010060448,0.0000080304735,0.0015281965,0.013466331,0.000034217286,0.45461747,0.005114391,0.36487505],"study_design_scores_gemma":[0.0005149265,0.000030864547,0.040247746,0.0002368538,0.00028278938,0.000009566079,0.00029904765,0.006085339,0.000049371407,0.9514113,0.0004208133,0.00041139673],"about_ca_topic_score_codex":0.000025915055,"about_ca_topic_score_gemma":0.00001950936,"teacher_disagreement_score":0.4967938,"about_ca_system_score_codex":0.00014826201,"about_ca_system_score_gemma":0.000074065094,"threshold_uncertainty_score":0.76909935},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006026340354717904,"score_gpt":0.269356313451892,"score_spread":0.2633299730971741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950146322","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93119097,0.00004885414,0.06328074,0.0045503345,0.000027905618,0.0004937411,0.000041540516,0.00001774784,0.00034816016],"genre_scores_gemma":[0.997105,0.000058878322,0.00258769,0.0001830997,0.000024014033,0.000036697624,0.000002248863,9.594485e-7,0.0000013880581],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912196,0.000005557186,0.0003434768,0.00006661918,0.00028348152,0.00017887464],"domain_scores_gemma":[0.99889076,0.00005282786,0.0006456109,0.00016481582,0.00021605013,0.000029954694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012914407,0.00007175601,0.00012597008,0.00039397195,0.0006110576,0.00017049661,0.0006007427,0.000013681705,0.0000012722949],"category_scores_gemma":[0.000023236888,0.000039742616,0.00006226804,0.002782677,0.001482004,0.001803054,0.0001479975,0.0001374429,9.939286e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013740178,0.00006184104,0.07942268,0.000016490987,0.000034612087,1.4500797e-8,0.0037693086,0.0011729756,0.007986821,0.085390344,0.006715506,0.8154157],"study_design_scores_gemma":[0.000782873,0.00035914793,0.05918407,0.00006688409,0.00007349564,0.000030353896,0.06976124,0.03689148,0.015260628,0.028170906,0.78891313,0.0005057954],"about_ca_topic_score_codex":0.000020213825,"about_ca_topic_score_gemma":0.000001005073,"teacher_disagreement_score":0.8149099,"about_ca_system_score_codex":0.00008511676,"about_ca_system_score_gemma":0.00014695211,"threshold_uncertainty_score":0.5460505},"labels":[],"label_agreement":null},{"id":"W2950257936","doi":"10.1016/j.ipm.2019.102056","title":"User community detection via embedding of social network structure and temporal content","year":2019,"lang":"en","type":"article","venue":"Information Processing & Management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Embedding; User-generated content; Social network (sociolinguistics); Similarity (geometry); Social media; Information retrieval; Feature (linguistics); Social network analysis; Graph; World Wide Web; Machine learning; Artificial intelligence; Theoretical computer science","score_opus":0.010957973231198955,"score_gpt":0.25371273529418165,"score_spread":0.2427547620629827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950257936","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78174895,0.000010216626,0.21322073,0.00002341796,0.00005042929,0.0002989341,0.0000042382294,0.00006216333,0.0045809518],"genre_scores_gemma":[0.99735034,5.67349e-7,0.002405482,0.000051441584,0.000048928803,0.000010701734,0.000068173424,0.000005239939,0.000059121816],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993213,0.000038865837,0.0003136096,0.000058258072,0.00014388749,0.00012410809],"domain_scores_gemma":[0.9994326,0.00000949657,0.0003348289,0.00011700759,0.00008848403,0.000017540198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021599357,0.00009844624,0.00014986774,0.00008163361,0.00024833405,0.000100358135,0.00010333032,0.000024889348,0.00007121781],"category_scores_gemma":[6.356813e-7,0.00009491154,0.00004046763,0.00019176689,0.000025295905,0.000673614,0.0001268311,0.00014276244,0.0000035703133],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004872287,0.000047989848,0.06888395,0.0005669442,0.00022710557,7.4388694e-8,0.0029227352,0.0030135466,0.00024467916,0.0113776615,0.00045828108,0.9122083],"study_design_scores_gemma":[0.004058203,0.00027595804,0.5016392,0.0007820856,0.00068613846,0.000002597161,0.021609051,0.30835256,0.0060338434,0.09713995,0.057699475,0.0017209379],"about_ca_topic_score_codex":0.00010582482,"about_ca_topic_score_gemma":0.00000705908,"teacher_disagreement_score":0.91048735,"about_ca_system_score_codex":0.000025637679,"about_ca_system_score_gemma":0.000005622866,"threshold_uncertainty_score":0.38703802},"labels":[],"label_agreement":null},{"id":"W2950673019","doi":"10.48550/arxiv.1906.04863","title":"Statistical guarantees for local graph clustering","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Computer science; Clustering coefficient; Graph; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.050423694766113775,"score_gpt":0.2126768813890513,"score_spread":0.16225318662293753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950673019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042510755,0.000018487599,0.95341575,0.000013259865,0.0001720248,0.00046943215,0.00023027425,0.00012378141,0.0030462465],"genre_scores_gemma":[0.9956528,0.000010182115,0.0027992502,0.00001878919,0.00020296033,0.0000046953187,0.0003051422,0.000035345314,0.0009708359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985391,0.00006158969,0.00021695186,0.00077109144,0.000057691806,0.0003535814],"domain_scores_gemma":[0.9987549,0.00018718134,0.0001852519,0.0006685029,0.00011428723,0.000089869776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013576823,0.00031143162,0.00047832413,0.00017268928,0.00010631133,0.000059543876,0.00054295047,0.00013076514,0.0003280326],"category_scores_gemma":[0.000003203941,0.00036595188,0.00040810322,0.00018608083,0.00012488566,0.00007012021,0.00074396597,0.00039157105,0.000029194036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011292139,0.00012405503,0.016176894,0.00012844693,0.0005482561,0.000015189921,0.000047607664,0.6019607,0.0000109097355,0.3738805,0.0033337823,0.003660744],"study_design_scores_gemma":[0.00041216088,0.000046491947,0.0005371171,0.000086952954,0.00032667333,2.4917114e-7,0.00013237479,0.778617,0.000045420682,0.21753101,0.0018081152,0.0004564367],"about_ca_topic_score_codex":0.00034323966,"about_ca_topic_score_gemma":0.000054938984,"teacher_disagreement_score":0.95314205,"about_ca_system_score_codex":0.00008160635,"about_ca_system_score_gemma":0.00008080265,"threshold_uncertainty_score":0.99987924},"labels":[],"label_agreement":null},{"id":"W2950778219","doi":"10.3934/mbe.2019268","title":"Nearcasting forwarding behaviors and information propagation in Chinese Sina-Microblog","year":2019,"lang":"en","type":"article","venue":"Mathematical Biosciences & Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Microblogging; Social media; Computer science; Event (particle physics); China; Information Dissemination; Summative assessment; Simple (philosophy); Data science; World Wide Web; History; Statistics; Mathematics","score_opus":0.002948865908071848,"score_gpt":0.2156280045161526,"score_spread":0.21267913860808077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950778219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91128564,0.000005350157,0.0872459,0.000030087242,0.000024819283,0.00017571935,9.922828e-7,0.00004939476,0.0011820756],"genre_scores_gemma":[0.9904607,4.564197e-7,0.009481546,0.0000051757766,0.00002018929,0.000014434577,0.000003745338,0.000004466477,0.000009279461],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932325,0.000006994816,0.00023485081,0.00012148301,0.00012651512,0.00018691916],"domain_scores_gemma":[0.9997372,0.00006227762,0.000053463427,0.00009494931,0.000015894399,0.000036224712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029316026,0.00009927748,0.00015218514,0.000152437,0.000038308037,0.000107965105,0.00009791581,0.000019423143,0.000059917573],"category_scores_gemma":[0.000023882581,0.00008097897,0.00003241753,0.0004239888,0.000022939947,0.00057840167,0.00007481882,0.000090654576,0.000017425951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006228689,0.000153522,0.55147994,0.00033347993,0.000027623264,0.000001415296,0.0034639002,0.017065244,0.10421003,0.28925225,0.000014331571,0.033992015],"study_design_scores_gemma":[0.00018412163,0.00003560926,0.018808827,0.00018304453,0.000012293001,0.0000029189355,0.00030957066,0.97264355,0.0025553736,0.0048832544,0.0001187883,0.00026261684],"about_ca_topic_score_codex":0.000014638244,"about_ca_topic_score_gemma":5.246044e-7,"teacher_disagreement_score":0.9555783,"about_ca_system_score_codex":0.000019860381,"about_ca_system_score_gemma":0.000007989824,"threshold_uncertainty_score":0.33022267},"labels":[],"label_agreement":null},{"id":"W2950872513","doi":"10.1137/1.9781611973099.131","title":"The mixing time of the Newman–Watts small world","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mixing (physics); Random walk; Upper and lower bounds; Combinatorics; Small-world network; Order (exchange); Mathematics; Discrete mathematics; Computer science; Physics; Complex network; Mathematical analysis; Statistics","score_opus":0.02056658259031649,"score_gpt":0.25113146167980244,"score_spread":0.23056487908948595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950872513","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08601428,0.00082733965,0.047755152,0.0024072498,0.00068646256,0.0016247896,0.000040171184,0.00031154163,0.860333],"genre_scores_gemma":[0.96389407,0.0000027500032,0.0016421254,0.00004104607,0.0007625401,0.000048543767,0.000020337744,0.000026389687,0.033562172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998806,0.000120254816,0.0003725078,0.00023293735,0.00017635396,0.00029192548],"domain_scores_gemma":[0.9980727,0.00019845618,0.00037381216,0.0012338784,0.00007713285,0.000044012402],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003806275,0.00023121288,0.00031852466,0.000045878078,0.00018283828,0.000059369704,0.0010521644,0.000048798753,0.00106826],"category_scores_gemma":[0.0000029246587,0.000121732315,0.00051950157,0.00018675215,0.00009233211,0.000021261689,0.0018923923,0.0005049355,0.000042657273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031960917,0.00052591227,0.2379241,0.00010776867,0.0032732761,3.7678336e-7,0.0010198021,0.001604628,0.0014877438,0.355802,0.16630296,0.23191945],"study_design_scores_gemma":[0.00046104583,0.00002186207,0.042469688,0.0010724603,0.0015961833,7.1788173e-7,0.00026104297,0.02233472,0.033730786,0.41750368,0.47850338,0.002044448],"about_ca_topic_score_codex":0.0008088973,"about_ca_topic_score_gemma":0.00023398387,"teacher_disagreement_score":0.8778798,"about_ca_system_score_codex":0.000025709369,"about_ca_system_score_gemma":0.000053653763,"threshold_uncertainty_score":0.9998449},"labels":[],"label_agreement":null},{"id":"W2950903016","doi":"10.48550/arxiv.1512.06840","title":"Utility-based Link Recommendation for Online Social Networks","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Recommender system; Linkage (software); Bayesian network; Social network (sociolinguistics); Link (geometry); Revenue; Key (lock); Dependency (UML); Focus (optics); Link analysis; Information retrieval; Social media; Data mining; Data science; World Wide Web; Machine learning; Artificial intelligence; Computer network; Business; Computer security","score_opus":0.13709811757359394,"score_gpt":0.24932080715108854,"score_spread":0.1122226895774946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950903016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032921754,0.000010030392,0.96323687,0.00032723413,0.00021129861,0.00053498044,0.000369923,0.00020693,0.0021809672],"genre_scores_gemma":[0.9899206,0.0000037779625,0.0022498434,0.00007214718,0.0015178547,0.0000049281102,0.0057285544,0.00003630276,0.00046599415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984812,0.0001435405,0.00026901026,0.0007323791,0.00004620672,0.00032763137],"domain_scores_gemma":[0.9985366,0.00011610082,0.0003900286,0.00047088345,0.00037173714,0.000114661656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031410105,0.00032189378,0.0004630196,0.00015708308,0.00020324149,0.000059953403,0.0004867508,0.00023880486,0.0003475585],"category_scores_gemma":[0.000006492684,0.00040306835,0.0005038427,0.00032194628,0.000074716525,0.000080037426,0.00043807842,0.0005736302,0.0000056516965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066307874,0.0013409024,0.0444927,0.0001604038,0.0015004702,0.000009509796,0.00014245142,0.6297206,0.0000063248317,0.09987628,0.083211526,0.13887575],"study_design_scores_gemma":[0.0005667256,0.00002841955,0.00029014147,0.00002747728,0.00032030392,2.413823e-8,0.000044671906,0.9029202,0.000011615602,0.07605219,0.01937483,0.0003634169],"about_ca_topic_score_codex":0.00021880187,"about_ca_topic_score_gemma":0.00009568486,"teacher_disagreement_score":0.96098703,"about_ca_system_score_codex":0.00013127198,"about_ca_system_score_gemma":0.00021452013,"threshold_uncertainty_score":0.9998421},"labels":[],"label_agreement":null},{"id":"W2950998894","doi":"10.48550/arxiv.1406.0967","title":"Anisotropic interactions in a first-order aggregation model: a proof of\\n concept","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Order (exchange); Anisotropy; Proof of concept; Direct proof; Statistical physics; Mathematics; Theoretical physics; Computer science; Pure mathematics; Physics; Economics; Optics","score_opus":0.04753353585254781,"score_gpt":0.21896121649906242,"score_spread":0.1714276806465146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950998894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26943484,0.000011056296,0.7272849,0.00003185046,0.000046506426,0.00027307024,0.00001912999,0.000045928897,0.002852715],"genre_scores_gemma":[0.998005,0.000008155033,0.0011666071,0.000008000991,0.000077559576,0.000005314891,0.00009017662,0.000018653174,0.00062055886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989205,0.00007958934,0.00026344307,0.0004994932,0.00005178847,0.00018516509],"domain_scores_gemma":[0.99879676,0.00006155521,0.00036721805,0.0005563986,0.00016785387,0.000050227343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0000730095,0.00021903585,0.00038773782,0.00026843845,0.00005790385,0.00002086881,0.00036495546,0.000073932075,0.00020905976],"category_scores_gemma":[0.000005248753,0.00026661722,0.00021706376,0.00042918263,0.000080628095,0.0001395439,0.0004163182,0.0004162485,0.0000033629128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015701633,0.00013605473,0.015477253,0.000024645155,0.000094661766,0.0000021401167,0.00020258424,0.9231239,0.000006015576,0.060007107,0.00021700948,0.00069295586],"study_design_scores_gemma":[0.00027263185,0.000016416127,0.0001933637,0.00016515596,0.000105300074,9.7583786e-8,0.0000707792,0.9180929,0.00024121438,0.080328435,0.0002992575,0.00021447359],"about_ca_topic_score_codex":0.001013281,"about_ca_topic_score_gemma":0.00056905556,"teacher_disagreement_score":0.7285701,"about_ca_system_score_codex":0.000118855576,"about_ca_system_score_gemma":0.00009513035,"threshold_uncertainty_score":0.9999786},"labels":[],"label_agreement":null},{"id":"W2951211144","doi":"10.48550/arxiv.1404.7189","title":"It's a Small World for Random Surfers","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"PageRank; Logarithm; Upper and lower bounds; Graph; Combinatorics; Random graph; Tree (set theory); Mathematics; Selection (genetic algorithm); Computer science; Discrete mathematics; Theoretical computer science; Artificial intelligence; Mathematical analysis","score_opus":0.06817012862817036,"score_gpt":0.20396331863167055,"score_spread":0.1357931900035002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951211144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07426966,0.000017770348,0.8985749,0.00012769412,0.00020186816,0.0007602746,0.0000636635,0.00020354589,0.025780622],"genre_scores_gemma":[0.98844016,0.000009171573,0.0014512887,0.00009116195,0.00047204987,0.00001085271,0.00023104934,0.000043661857,0.009250625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982931,0.00012561798,0.00026125833,0.0008704636,0.000049598326,0.00039998113],"domain_scores_gemma":[0.99813664,0.0003156629,0.0003287067,0.000905893,0.00017038484,0.00014269342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033348412,0.00038591187,0.00065267255,0.00030757673,0.00015784992,0.000082812854,0.0007726555,0.000116932766,0.0003723862],"category_scores_gemma":[0.000007605793,0.00045038055,0.0008320371,0.0003591096,0.000089005836,0.000055340086,0.0006285835,0.00043833457,0.00003291352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094984873,0.0004970352,0.061131198,0.00026931643,0.0029957474,0.00002788614,0.0002503644,0.37093273,0.0000446585,0.48719594,0.06794516,0.0077601243],"study_design_scores_gemma":[0.0035687746,0.00006422094,0.00031229804,0.00025110002,0.0014514546,2.2168572e-7,0.000119015196,0.54984707,0.00024741283,0.3189335,0.123799495,0.0014054537],"about_ca_topic_score_codex":0.00042751603,"about_ca_topic_score_gemma":0.0003966441,"teacher_disagreement_score":0.9141705,"about_ca_system_score_codex":0.000095803436,"about_ca_system_score_gemma":0.00009471837,"threshold_uncertainty_score":0.9997948},"labels":[],"label_agreement":null},{"id":"W2951300682","doi":"10.1017/s0021900200004381","title":"Bounding the Size and Probability of Epidemics on Networks","year":2008,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Centre for Disease Control","funders":"Los Alamos National Laboratory; Centers for Disease Control and Prevention; Advanced Scientific Computing Research; Division of Mathematical Sciences; U.S. Department of Energy","keywords":"Mathematics; Bounding overwatch; Transmissibility (structural dynamics); Upper and lower bounds; Population; Probability distribution; Combinatorics; Marginal distribution; Statistics; Unimodality; Random variable; Mathematical analysis; Computer science","score_opus":0.022720868091109656,"score_gpt":0.2505995687641281,"score_spread":0.22787870067301844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951300682","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98598796,0.00005800725,0.009155822,0.0002335918,0.00004596387,0.00039346443,0.0000025229883,0.000013378441,0.004109266],"genre_scores_gemma":[0.99139833,0.000016304835,0.008214992,0.00004837613,0.0002921423,0.000012027377,7.684125e-7,0.000009867278,0.000007166852],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983377,0.00012943486,0.0008483033,0.00020376629,0.00026926887,0.00021156634],"domain_scores_gemma":[0.9975106,0.0009804422,0.00081205997,0.0004283378,0.00018537966,0.000083189436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021833633,0.00016727242,0.00051807024,0.000033707318,0.00019056063,0.000018942768,0.00029078536,0.00005198084,0.00006196592],"category_scores_gemma":[0.00007353791,0.00010826027,0.00023032802,0.00024903988,0.00039422905,0.00006780584,0.00009781939,0.0005082419,4.4643193e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001203998,0.0015053973,0.67377365,0.000117006566,0.0006794708,0.0000029733148,0.0017169295,0.030776432,0.00096727174,0.24027222,0.0028106868,0.04617396],"study_design_scores_gemma":[0.0006576078,0.00026551806,0.07627704,0.00006317622,0.00016133305,0.00001356526,0.00011752188,0.0039560827,0.0017937098,0.9147836,0.0016474479,0.00026339447],"about_ca_topic_score_codex":0.000017807195,"about_ca_topic_score_gemma":0.000003477975,"teacher_disagreement_score":0.6745114,"about_ca_system_score_codex":0.000063736305,"about_ca_system_score_gemma":0.00008116946,"threshold_uncertainty_score":0.44147256},"labels":[],"label_agreement":null},{"id":"W2951477924","doi":"10.1093/ve/vew029","title":"Reconstructing contact network parameters from viral phylogenies","year":2016,"lang":"en","type":"article","venue":"Virus Evolution","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; AIDS Vancouver","funders":"","keywords":"Approximate Bayesian computation; Preferential attachment; Inference; Computer science; Population; Transmission (telecommunications); Tree (set theory); Graphical model; Epidemic model; Network model; Data mining; Artificial intelligence; Complex network; Mathematics","score_opus":0.011866870434781069,"score_gpt":0.22935705018701524,"score_spread":0.21749017975223417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951477924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8349861,0.00011759703,0.16216666,0.000043684257,0.00019291641,0.00010580516,0.00004963983,0.0001375752,0.0022000624],"genre_scores_gemma":[0.9919524,0.000004587124,0.0070568183,0.000019744622,0.00083939533,0.00002398555,0.000022400664,0.000015666319,0.0000649641],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998954,0.00008828384,0.00026577385,0.00028055898,0.00010897006,0.0003024213],"domain_scores_gemma":[0.9992989,0.00015672707,0.00017590678,0.00027778238,0.000037610855,0.0000530838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000127171,0.0001510533,0.00021237627,0.0000479219,0.0001529607,0.00003402804,0.00013973888,0.000041731408,0.00058129436],"category_scores_gemma":[0.000007957387,0.00011688571,0.00016326136,0.0001404147,0.000054856595,0.00016880831,0.000059918533,0.00008347757,0.00009289945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061401995,0.00004508539,0.6562985,0.0000014253105,0.00035141458,9.0870356e-7,0.000054761254,0.00015050126,0.080654606,0.041589532,0.0063841552,0.21440768],"study_design_scores_gemma":[0.0016100587,0.00018868917,0.10634986,0.00030976342,0.00036159833,0.0000020132825,0.00020002491,0.009672087,0.052438047,0.8143993,0.013174063,0.0012944855],"about_ca_topic_score_codex":0.0023148875,"about_ca_topic_score_gemma":0.00007282673,"teacher_disagreement_score":0.7728098,"about_ca_system_score_codex":0.0000963477,"about_ca_system_score_gemma":0.000022642556,"threshold_uncertainty_score":0.6364766},"labels":[],"label_agreement":null},{"id":"W2951770249","doi":"10.1093/comnet/cnz043","title":"An unsupervised framework for comparing graph embeddings","year":2019,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Theoretical computer science; Artificial intelligence","score_opus":0.023040137691375067,"score_gpt":0.31281722665471623,"score_spread":0.28977708896334115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951770249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2550268,0.00011782526,0.74306786,0.00006542814,0.00026299377,0.00024035973,0.0000030008325,0.00003851733,0.001177221],"genre_scores_gemma":[0.9296379,0.0000072858857,0.06823294,0.00013688866,0.0018752994,0.000008224414,0.000029326708,0.000043074604,0.000029043182],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981576,0.00009192154,0.00079639297,0.00023418106,0.0002830883,0.00043681517],"domain_scores_gemma":[0.9979098,0.00033984063,0.0007353277,0.0004536957,0.0003601752,0.00020119551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005844903,0.00025562942,0.0007833348,0.0002016507,0.00014036504,0.00016775598,0.00069088273,0.00008351344,0.0008583929],"category_scores_gemma":[0.0000058500314,0.00023351178,0.00058277475,0.00038882947,0.000045421966,0.0003128385,0.00006393678,0.00052892364,0.0000060880097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004132242,0.0005321348,0.41178632,0.000031739884,0.0009372677,0.000003968277,0.00029998148,0.33064088,0.000883684,0.21277435,0.016697604,0.024998846],"study_design_scores_gemma":[0.0013427411,0.0005675916,0.016915012,0.00025180783,0.00023308593,0.000009545556,0.0003421611,0.77221537,0.00012308809,0.19589958,0.011586068,0.00051397283],"about_ca_topic_score_codex":0.000015392101,"about_ca_topic_score_gemma":0.000002452618,"teacher_disagreement_score":0.6748349,"about_ca_system_score_codex":0.00003433266,"about_ca_system_score_gemma":0.000035846784,"threshold_uncertainty_score":0.9522334},"labels":[],"label_agreement":null},{"id":"W2951802262","doi":"10.48550/arxiv.1702.04956","title":"Reflexive Regular Equivalence for Bipartite Data","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Bipartite graph; Adjacency matrix; Cluster analysis; Similarity (geometry); Equivalence (formal languages); Spectral clustering; Computer science; Non-negative matrix factorization; Mathematics; Data mining; Adjacency list; Artificial intelligence; Theoretical computer science; Algorithm; Pattern recognition (psychology); Graph; Matrix decomposition; Eigenvalues and eigenvectors; Discrete mathematics","score_opus":0.27590187228139046,"score_gpt":0.28969797248193757,"score_spread":0.013796100200547112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951802262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065114066,0.00015148938,0.9168895,0.00014109969,0.00035023244,0.0009752118,0.001247904,0.00028714913,0.014843348],"genre_scores_gemma":[0.9903209,0.00006748835,0.0023666746,0.000015370773,0.0005897941,0.0000050613953,0.0011716196,0.000036442623,0.005426603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978701,0.000072948606,0.00022208077,0.0013647671,0.0000726381,0.00039746673],"domain_scores_gemma":[0.99434555,0.00009656012,0.0005587309,0.0046800263,0.0001894579,0.00012970639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003760088,0.00034280753,0.0004911108,0.00013654679,0.0003581337,0.00015407283,0.0033756627,0.0001472807,0.00019443002],"category_scores_gemma":[0.00001883871,0.000407172,0.0003329409,0.00013307984,0.00019346464,0.00030732536,0.00448454,0.00040155026,0.000035979327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025863046,0.0003934378,0.030776223,0.00027736058,0.0022647579,0.000075362535,0.0001294357,0.0453816,0.00018810685,0.8492929,0.055135682,0.01582654],"study_design_scores_gemma":[0.00049019663,0.000046065983,0.00039582181,0.0002800041,0.00092812296,2.9714408e-7,0.000062787505,0.3653786,0.00029618698,0.5806222,0.050643913,0.0008558199],"about_ca_topic_score_codex":0.00040357115,"about_ca_topic_score_gemma":0.000046368597,"teacher_disagreement_score":0.9252069,"about_ca_system_score_codex":0.00007439121,"about_ca_system_score_gemma":0.00015192767,"threshold_uncertainty_score":0.999838},"labels":[],"label_agreement":null},{"id":"W2951813287","doi":"10.1016/j.ipm.2019.102054","title":"Compact group discovery in attributed graphs and social networks","year":2019,"lang":"en","type":"article","venue":"Information Processing & Management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology; Toronto Metropolitan University; University of Waterloo","funders":"","keywords":"Computer science; Task (project management); Node (physics); Set (abstract data type); Theoretical computer science; Group (periodic table); Time complexity; Combinatorics; Mathematics; Algorithm","score_opus":0.006334680114128278,"score_gpt":0.2343614577232908,"score_spread":0.22802677760916254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951813287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6324314,0.00007683792,0.32213223,0.00033175683,0.00010046425,0.0009428257,0.000010793264,0.00024675747,0.04372698],"genre_scores_gemma":[0.99914855,0.0000036866036,0.00035285339,0.00013691743,0.00001923448,0.000017379876,0.00021766691,0.000005362975,0.00009835606],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992471,0.000018432365,0.00030215358,0.00010472629,0.00014055189,0.00018708197],"domain_scores_gemma":[0.9996836,0.000009672707,0.0001679637,0.00009537143,0.000025964591,0.000017415741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020825434,0.00011476599,0.0001624131,0.00018804052,0.00009897684,0.00033658094,0.000105915984,0.000021942009,0.000043097225],"category_scores_gemma":[2.860545e-7,0.00011189324,0.0000441419,0.0003485032,0.00002175695,0.0016218609,0.00008210625,0.00010174487,0.000011125819],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044041724,0.00010952721,0.18165241,0.0002475108,0.0001383555,5.974378e-7,0.001034443,0.0066073886,0.000004885414,0.15890561,0.003391856,0.6478634],"study_design_scores_gemma":[0.0024639578,0.000049812446,0.55464494,0.00030562692,0.00012601403,6.2578545e-7,0.0029643162,0.36019608,0.000022506112,0.03771114,0.040692575,0.00082241156],"about_ca_topic_score_codex":0.000054654163,"about_ca_topic_score_gemma":0.000004053134,"teacher_disagreement_score":0.64704096,"about_ca_system_score_codex":0.000032153013,"about_ca_system_score_gemma":0.0000052121236,"threshold_uncertainty_score":0.45628738},"labels":[],"label_agreement":null},{"id":"W2952404326","doi":"10.48550/arxiv.1212.0146","title":"Efficient Community Detection in Large Networks using Content and Links","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Science Foundation","keywords":"Jaccard index; Computer science; Data mining; Cosine similarity; False positive paradox; False positives and false negatives; Graph; Link analysis; Similarity (geometry); Cluster analysis; Information retrieval; Theoretical computer science; Artificial intelligence","score_opus":0.10546896153586893,"score_gpt":0.21582352399834387,"score_spread":0.11035456246247494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952404326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63368875,0.00005966496,0.36559874,0.0000019852828,0.000076770826,0.00017874315,0.000008502494,0.000044045006,0.00034282732],"genre_scores_gemma":[0.9995935,0.000013242316,0.00012969633,0.000012391264,0.00014983717,0.0000012858883,0.00003585637,0.000019649791,0.000044546745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865544,0.00037624378,0.00020967651,0.00035340938,0.00004239751,0.00036283492],"domain_scores_gemma":[0.998937,0.00008741896,0.00023165125,0.0005625269,0.00007499086,0.00010640163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005102439,0.00025619217,0.0003714207,0.00020138713,0.00025295911,0.000042504693,0.00027977017,0.00025758424,0.000049044138],"category_scores_gemma":[0.0000032191592,0.000308317,0.0001691353,0.00031777564,0.00007320637,0.00004751696,0.0011839729,0.001930067,0.0000024328797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035725137,0.0003722128,0.22473419,0.0000257142,0.0001513369,0.0000059348,0.00023951365,0.76441354,0.00007746792,0.008306217,0.000005698777,0.0016324315],"study_design_scores_gemma":[0.00035702833,0.000011996581,0.017745912,0.0000967959,0.00017339252,3.996242e-7,0.00038541044,0.97807515,0.00006747502,0.0027471925,0.00003907863,0.0003001709],"about_ca_topic_score_codex":0.003842046,"about_ca_topic_score_gemma":0.0005713039,"teacher_disagreement_score":0.36590478,"about_ca_system_score_codex":0.0001832676,"about_ca_system_score_gemma":0.000025183354,"threshold_uncertainty_score":0.9999369},"labels":[],"label_agreement":null},{"id":"W2952412709","doi":"10.7717/peerj.3644","title":"Ecological interactions and the Netflix problem","year":2017,"lang":"en","type":"article","venue":"PeerJ","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Nvidia; Microsoft","keywords":"Ecology; Geography; Computer science; Biology","score_opus":0.017573770277962367,"score_gpt":0.30422748945120637,"score_spread":0.286653719173244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952412709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.532498,0.00006349233,0.012754436,0.01597493,0.00013498051,0.00045793602,0.000006475876,0.0001232713,0.43798646],"genre_scores_gemma":[0.9966285,0.0000021810151,0.0008542972,0.000039571576,0.0002105051,0.000041151347,0.000003154669,0.0000031218617,0.0022174707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996868,0.000019983374,0.0000745339,0.00009414111,0.00004079794,0.000083764106],"domain_scores_gemma":[0.9995401,0.000073310184,0.000073009665,0.00027050765,0.000021975742,0.00002111935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012980374,0.000050205443,0.000099483295,0.000009614103,0.0004251892,0.00016072806,0.00017521303,0.0000079437405,0.0004742589],"category_scores_gemma":[0.0000075409303,0.000029872996,0.000059325193,0.000014226503,0.00012808379,0.00006431841,0.00014539117,0.00009770658,0.000017436609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003079897,0.00013049661,0.17581718,0.0000030619112,0.00018908837,0.0000011273864,0.00029466144,0.000026559272,0.00014747606,0.65025467,0.042408045,0.13069682],"study_design_scores_gemma":[0.0010511145,0.00003192237,0.25192732,0.000016308886,0.00014359954,0.0000026624114,0.00013232273,0.012001021,0.00023990299,0.4228707,0.31135407,0.00022907164],"about_ca_topic_score_codex":0.00031159236,"about_ca_topic_score_gemma":0.000063413856,"teacher_disagreement_score":0.46413055,"about_ca_system_score_codex":0.0000040520863,"about_ca_system_score_gemma":0.00000464666,"threshold_uncertainty_score":0.51928025},"labels":[],"label_agreement":null},{"id":"W2952571016","doi":"10.48550/arxiv.1507.06524","title":"How to burn a graph","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Iterated function; Graph; Combinatorics; Computer science; Mathematics; Discrete mathematics","score_opus":0.0699347723596519,"score_gpt":0.19991509332045285,"score_spread":0.12998032096080095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952571016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41015688,0.000040038736,0.5651981,0.00026548962,0.00020065729,0.0004883373,0.000074321644,0.00031756182,0.023258591],"genre_scores_gemma":[0.99164367,0.0000061859582,0.0007709735,0.000037413793,0.0003641867,0.0000030138913,0.000086051026,0.00002986034,0.0070586735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853003,0.000085586114,0.00013503394,0.0008233436,0.000083398,0.00034262674],"domain_scores_gemma":[0.9982134,0.000030262365,0.00018218979,0.0010253254,0.00025151277,0.00029727374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016666976,0.00033750877,0.0004387035,0.00032414097,0.00008839783,0.00015227683,0.0008368183,0.000120893674,0.00016411919],"category_scores_gemma":[0.000005573187,0.00039374846,0.00039544262,0.0006657265,0.000057013363,0.00010577967,0.0013624071,0.0004698809,0.00007092726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001238115,0.00048098352,0.08152065,0.00006550095,0.0017171856,0.0001734278,0.0005500253,0.209516,0.00011092608,0.59088206,0.10860667,0.0062527815],"study_design_scores_gemma":[0.0005610591,0.000095187446,0.00070963125,0.00014931994,0.0006618615,6.2269544e-7,0.00062821055,0.040703896,0.00025208472,0.90977925,0.04500241,0.0014564717],"about_ca_topic_score_codex":0.00053697394,"about_ca_topic_score_gemma":0.00005612243,"teacher_disagreement_score":0.58148676,"about_ca_system_score_codex":0.00011875378,"about_ca_system_score_gemma":0.0001073791,"threshold_uncertainty_score":0.99985147},"labels":[],"label_agreement":null},{"id":"W2952920728","doi":"10.48550/arxiv.1304.3013","title":"The influence of repressive legislation on the structure of a social media network","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Legislation; Social media; Flexibility (engineering); Government (linguistics); Politics; Information flow; Political science; Public relations; Power (physics); Mass media; Social network (sociolinguistics); Sociology; Business; Law; Economics; Management","score_opus":0.0296110294060399,"score_gpt":0.190308104954114,"score_spread":0.16069707554807408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952920728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99523425,0.000016091424,0.0023336208,0.0000584698,0.000063375315,0.0002851588,0.000038786457,0.000021422002,0.00194884],"genre_scores_gemma":[0.999499,0.000013941676,0.00003988663,0.000009283834,0.0002883674,0.0000010773224,0.000029029225,0.000011177781,0.00010822218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989485,0.00020222971,0.00024074974,0.0003275828,0.00010176199,0.00017914487],"domain_scores_gemma":[0.99756503,0.00060048734,0.00083996594,0.0007099154,0.00025843605,0.000026184778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014577177,0.00018827539,0.00029882928,0.000047148395,0.00022245219,0.000027799893,0.00078131346,0.000108784916,0.00014200031],"category_scores_gemma":[0.000020745125,0.00013127334,0.00025331482,0.00032335686,0.0002769424,0.000058553687,0.00055791397,0.00047761988,0.0000027525136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030103654,0.000018730132,0.0071145394,0.0000070050864,0.00026947627,5.7913746e-7,0.00042440754,0.43514803,0.00012171423,0.5546923,0.0016750802,0.0004979898],"study_design_scores_gemma":[0.00019908891,0.000024959207,0.03953347,0.00016042257,0.0003543271,7.043382e-8,0.00042784493,0.030838849,0.0009153852,0.92657554,0.00065510627,0.00031491456],"about_ca_topic_score_codex":0.000296136,"about_ca_topic_score_gemma":0.00005965499,"teacher_disagreement_score":0.40430915,"about_ca_system_score_codex":0.000031265845,"about_ca_system_score_gemma":0.00006628145,"threshold_uncertainty_score":0.5353171},"labels":[],"label_agreement":null},{"id":"W2952952276","doi":"10.48550/arxiv.0903.1519","title":"Incorporating uncertainty into the study of animal social networks","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Environment Research Council; Killam Trusts; Dalhousie University; University of Otago","keywords":"Bootstrapping (finance); Null model; Null hypothesis; Variety (cybernetics); Computer science; Sampling (signal processing); Statistics; Social network analysis; Social network (sociolinguistics); Community structure; Econometrics; Machine learning; Data mining; Artificial intelligence; Mathematics","score_opus":0.035968121842,"score_gpt":0.307843463477814,"score_spread":0.271875341635814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952952276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99279237,0.000076509496,0.004590218,0.00019194861,0.00008357572,0.00064431154,0.000004089323,0.000092703835,0.0015242598],"genre_scores_gemma":[0.9975512,0.0000024604456,0.0002876926,0.00004544245,0.0018710484,0.00009712695,0.00008427619,0.000031406802,0.000029371748],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9979055,0.00032171872,0.0006866888,0.0005199101,0.00027851178,0.00028765126],"domain_scores_gemma":[0.99809223,0.00010289732,0.0008628791,0.0007125699,0.00018461085,0.000044833745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000578829,0.00036834547,0.00066777173,0.00007436974,0.0003611215,0.00006901921,0.0008261488,0.00013024983,0.00007740854],"category_scores_gemma":[0.0000067368715,0.0002920889,0.00034633247,0.00034464363,0.00011226341,0.00004619418,0.0011361806,0.0010475758,0.000004077656],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005053306,0.00062381703,0.95368445,0.000011905407,0.0005768049,0.0000022741187,0.0030039109,0.015521315,0.00009160077,0.0025005033,0.0012168564,0.022716047],"study_design_scores_gemma":[0.00098776,0.00086509174,0.8686481,0.00020035247,0.0011813919,3.0520653e-7,0.007881188,0.063782625,0.00019544653,0.054210164,0.0006854585,0.0013621274],"about_ca_topic_score_codex":0.0034324487,"about_ca_topic_score_gemma":0.00032363136,"teacher_disagreement_score":0.085036345,"about_ca_system_score_codex":0.000062775216,"about_ca_system_score_gemma":0.00008902894,"threshold_uncertainty_score":0.99995315},"labels":[],"label_agreement":null},{"id":"W2952997635","doi":"10.48550/arxiv.1608.01697","title":"Rumours spread slowly in a small world spatial network","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of Waterloo; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metric (unit); Metric space; Distance; Random graph; Combinatorics; Spatial network; Graph; Small-world network; Computer science; Mathematics; Polynomial; Complex network; Discrete mathematics; Theoretical computer science; Engineering; Shortest path problem; Mathematical analysis","score_opus":0.04889380926264271,"score_gpt":0.18997003895311665,"score_spread":0.14107622969047395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952997635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4181635,0.00006717868,0.51875174,0.00012962532,0.00044517266,0.0006446566,0.00006627399,0.0002915735,0.061440274],"genre_scores_gemma":[0.9929062,0.000017236438,0.0005497578,0.000032890162,0.0010714541,0.0000049474975,0.0000827682,0.000046806526,0.0052879364],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770975,0.00020018338,0.00033764148,0.0010440026,0.000064038126,0.0006444128],"domain_scores_gemma":[0.99820507,0.00014855682,0.0003657808,0.0010291422,0.00008841166,0.00016304295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026220066,0.0004692231,0.00064520695,0.00041333787,0.00010274928,0.000065658314,0.0009449396,0.00016025192,0.0007684761],"category_scores_gemma":[0.000003814847,0.0005027921,0.00049533596,0.000725919,0.00011503766,0.000088713416,0.0013570107,0.0007584176,0.00009459921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012951,0.00023417648,0.6259866,0.000028743183,0.0004253775,0.00013805946,0.000060981456,0.059531152,0.000012306079,0.29612198,0.0048193485,0.012511756],"study_design_scores_gemma":[0.0011521379,0.000045103174,0.021412902,0.0008453972,0.00041266135,4.2863792e-7,0.000040852734,0.060028665,0.000098895616,0.90515345,0.009364841,0.0014446664],"about_ca_topic_score_codex":0.0033146252,"about_ca_topic_score_gemma":0.0055934605,"teacher_disagreement_score":0.60903144,"about_ca_system_score_codex":0.00021974712,"about_ca_system_score_gemma":0.0001455806,"threshold_uncertainty_score":0.9997424},"labels":[],"label_agreement":null},{"id":"W2953683172","doi":"10.1016/j.inffus.2019.06.007","title":"Data fusion in heterogeneous networks","year":2019,"lang":"en","type":"article","venue":"Information Fusion","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; St. Francis Xavier University","funders":"Project 211; National Key Research and Development Program of China; National Postdoctoral Program for Innovative Talents; China Postdoctoral Science Foundation; Academy of Finland; National Natural Science Foundation of China","keywords":"Computer science; Sensor fusion; Fusion; Heterogeneous network; Artificial intelligence; Data mining; Telecommunications","score_opus":0.012949452088788133,"score_gpt":0.2545099375655203,"score_spread":0.24156048547673217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953683172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88549113,0.000038417213,0.079930134,0.00009910784,0.00024758143,0.00054782076,0.000055685847,0.00014344978,0.033446696],"genre_scores_gemma":[0.9973565,0.000009427842,0.00049050397,0.000108915134,0.00008833559,0.0000073758015,0.0018662177,0.0000052415203,0.000067527566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991924,0.000025731753,0.00034528133,0.000122039535,0.00015255832,0.00016197228],"domain_scores_gemma":[0.9991465,0.000025793403,0.0001402849,0.0006165332,0.00003844249,0.000032441105],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022241691,0.00009775874,0.00013209374,0.00012979827,0.000046468598,0.000064146465,0.00033529868,0.000038779614,0.0015254802],"category_scores_gemma":[0.0000023713285,0.00009158144,0.000038526596,0.00025869743,0.000007617036,0.00088050397,0.0004135662,0.0001232917,0.0003554198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006619292,0.00012215425,0.17252107,0.00002277902,0.000037399346,9.706976e-7,0.0004775589,0.08714223,0.00028983716,0.005038149,0.0180603,0.71622133],"study_design_scores_gemma":[0.0003537812,0.000023273955,0.0046402942,0.000041264946,0.000007361623,8.059149e-7,0.00007439009,0.87750745,0.00012818647,0.0006245995,0.11642696,0.00017162021],"about_ca_topic_score_codex":0.00016185195,"about_ca_topic_score_gemma":0.000023174262,"teacher_disagreement_score":0.7903652,"about_ca_system_score_codex":0.000022386283,"about_ca_system_score_gemma":0.000014224109,"threshold_uncertainty_score":0.99938726},"labels":[],"label_agreement":null},{"id":"W2954245993","doi":"10.21307/connections-2018-003","title":"A collection of tributes to Linton C. Freeman","year":2018,"lang":"en","type":"article","venue":"Connections","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Art","score_opus":0.014658828020314317,"score_gpt":0.28887359297604415,"score_spread":0.27421476495572983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954245993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5169744,0.000013038523,0.43878803,0.0006902047,0.0002323148,0.00028184825,0.000024043347,0.00015800778,0.04283815],"genre_scores_gemma":[0.9963106,3.0524137e-7,0.0020714542,0.00002268516,0.00047114605,0.000042566786,0.000010242743,0.000006572478,0.0010644139],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955446,0.000021513424,0.00014493249,0.00012572244,0.000053709922,0.00009966184],"domain_scores_gemma":[0.9994755,0.000048911912,0.00005114088,0.00019273728,0.00018931409,0.000042434884],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007457749,0.00005943167,0.000117390126,0.00012546181,0.0001603819,0.00001281832,0.00007482743,0.000015933156,0.0012231637],"category_scores_gemma":[0.000014787117,0.00006146393,0.00007870871,0.0006446798,0.000036904752,0.000033854252,0.00003499842,0.00004275007,0.000049264498],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008160606,0.0008353996,0.11387624,0.000013229716,0.00070404366,3.6653816e-7,0.002191943,0.0002771285,0.05233469,0.22918448,0.53731376,0.06318711],"study_design_scores_gemma":[0.0006368487,0.0010893965,0.016665427,0.000080216596,0.00024753594,0.000001894805,0.00065235986,0.008976666,0.54067487,0.07703671,0.353407,0.0005310748],"about_ca_topic_score_codex":0.0006955502,"about_ca_topic_score_gemma":0.00035464624,"teacher_disagreement_score":0.48834017,"about_ca_system_score_codex":0.00001824938,"about_ca_system_score_gemma":0.000020962518,"threshold_uncertainty_score":0.9996899},"labels":[],"label_agreement":null},{"id":"W2954416773","doi":"10.21307/connections-2018-002","title":"Techniques: Dichotomizing a Network","year":2018,"lang":"en","type":"article","venue":"Connections","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.012685131367832827,"score_gpt":0.2780440909624336,"score_spread":0.26535895959460076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954416773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023746964,0.00004745285,0.63790864,0.00027277318,0.0002767857,0.00029939154,0.000006291882,0.00096047163,0.3364812],"genre_scores_gemma":[0.9853939,0.000001586516,0.010286839,0.00011530752,0.0032422969,0.0001061503,0.00001094065,0.0000168396,0.0008261858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993097,0.00003400905,0.00016212376,0.00019640903,0.00006400334,0.00023375299],"domain_scores_gemma":[0.99940664,0.00006153235,0.00006196651,0.00031354162,0.00010211467,0.000054188167],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013608338,0.00010194918,0.00013472604,0.00006620444,0.00040965577,0.000048234706,0.00013610847,0.000025941521,0.0020839686],"category_scores_gemma":[0.0000058712317,0.00010306421,0.00011143075,0.00048672414,0.00008733977,0.000073990326,0.000065886925,0.00011361695,0.000119894095],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015303513,0.00016552518,0.05030865,0.0000033279966,0.00032997952,0.0000011428402,0.0002835304,0.000045943223,0.0018302349,0.49395043,0.2723139,0.18075204],"study_design_scores_gemma":[0.00016338677,0.00009180032,0.0014528524,0.00006341271,0.00010231294,0.000002670275,0.0001445712,0.0034227879,0.009706798,0.13281143,0.8516597,0.00037828085],"about_ca_topic_score_codex":0.0001593293,"about_ca_topic_score_gemma":0.000044975543,"teacher_disagreement_score":0.9616469,"about_ca_system_score_codex":0.000020179423,"about_ca_system_score_gemma":0.000021900256,"threshold_uncertainty_score":0.99882823},"labels":[],"label_agreement":null},{"id":"W2955437849","doi":"10.3390/mti3030046","title":"Information Processing and Overload in Group Conversation: A Graph-Based Prediction Model","year":2019,"lang":"en","type":"article","venue":"Multimodal Technologies and Interaction","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gradient boosting; Computer science; Random forest; Artificial intelligence; Conversation; Nonverbal communication; Task (project management); Information overload; Set (abstract data type); Regression; Machine learning; Feature (linguistics); Baseline (sea); Graph; Natural language processing; Mean squared error; Speech recognition; Psychology; Statistics; Mathematics; Communication; Linguistics","score_opus":0.00811250033285786,"score_gpt":0.24205028542123333,"score_spread":0.23393778508837548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955437849","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92445755,0.000032075994,0.07414816,0.00021007837,0.000035473597,0.00026638075,0.00000726836,0.0002847189,0.0005583178],"genre_scores_gemma":[0.9970301,0.000016127222,0.0028132715,0.000018033019,0.000009971821,0.000048237256,0.000053828968,0.0000044016883,0.0000060617867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994767,0.000009691596,0.00020065834,0.00013301172,0.00007279439,0.000107190106],"domain_scores_gemma":[0.9997069,0.000019031191,0.00011820574,0.000106154475,0.00003811999,0.000011590839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076740165,0.000102336395,0.00012099237,0.00025672294,0.00005039019,0.00007912855,0.000048787977,0.00006919927,0.00001658335],"category_scores_gemma":[0.000005774868,0.00009727169,0.000027338794,0.00017614714,0.00003875521,0.0009866187,0.00004675016,0.00017890861,0.000002288058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076746735,0.00006167547,0.20076995,0.000040766794,0.000016940105,8.937765e-8,0.00041374456,0.0070908265,0.0019722786,0.0026508984,0.00007125962,0.78683484],"study_design_scores_gemma":[0.00045105466,0.00005894899,0.009728451,0.00006925363,0.000008612064,4.20118e-7,0.0027919204,0.9820895,0.000985912,0.0034028974,0.0003137367,0.000099280325],"about_ca_topic_score_codex":0.0002451274,"about_ca_topic_score_gemma":0.000012815184,"teacher_disagreement_score":0.9749987,"about_ca_system_score_codex":0.000038821803,"about_ca_system_score_gemma":0.000008158761,"threshold_uncertainty_score":0.3966624},"labels":[],"label_agreement":null},{"id":"W2959486411","doi":"10.18280/isi.240104","title":"Network Adjacency Matrix Blocked-compressive Sensing: A Novel Algorithm for Link Prediction","year":2019,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Adjacency matrix; Algorithm; Computer science; Subspace topology; Link (geometry); Matrix (chemical analysis); Adjacency list; Diagonal; Distance matrix; Sorting; Diagonal matrix; Mathematics; Artificial intelligence; Theoretical computer science; Graph","score_opus":0.010380434821332735,"score_gpt":0.24009428940472535,"score_spread":0.2297138545833926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2959486411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02641748,0.000057502722,0.96549463,0.0000349342,0.00042842128,0.0010902031,0.00015301224,0.00029065306,0.0060331724],"genre_scores_gemma":[0.8853709,0.0000034982888,0.11184738,0.0000683541,0.0012378921,0.00010659559,0.001043243,0.000028224227,0.00029391478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998446,0.000030709827,0.0006909234,0.00019490378,0.00022329867,0.00041416974],"domain_scores_gemma":[0.9985342,0.00010479284,0.0005334492,0.00034834407,0.00040558315,0.000073619725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030645114,0.0002448576,0.00033874696,0.00015936991,0.00027761867,0.00022002227,0.00017888327,0.000099075245,0.000113151866],"category_scores_gemma":[0.000011834699,0.00024907754,0.00019814367,0.00039395643,0.000047379905,0.0013061803,0.00008352432,0.00016868277,0.00007567342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004647088,0.000048316964,0.0057507213,0.00012654743,0.00027103417,2.2055526e-7,0.0014349932,0.013368655,0.0003316019,0.011142541,0.00675674,0.96072215],"study_design_scores_gemma":[0.0010224258,0.00015460986,0.0021766424,0.00027751838,0.0001256012,0.0000074176664,0.0004041967,0.9390445,0.00080102857,0.022532726,0.033027064,0.00042628855],"about_ca_topic_score_codex":0.00010265165,"about_ca_topic_score_gemma":0.0000013173953,"teacher_disagreement_score":0.96029586,"about_ca_system_score_codex":0.00013537344,"about_ca_system_score_gemma":0.00006431161,"threshold_uncertainty_score":0.9999961},"labels":[],"label_agreement":null},{"id":"W2961403428","doi":"10.1142/s0218127419500962","title":"Bifurcation of Multiple Limit Cycles in an Epidemic Model on Adaptive Networks","year":2019,"lang":"en","type":"article","venue":"International Journal of Bifurcation and Chaos","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Bogdanov–Takens bifurcation; Homoclinic bifurcation; Hopf bifurcation; Saddle-node bifurcation; Transcritical bifurcation; Limit (mathematics); Biological applications of bifurcation theory; Bifurcation diagram; Pitchfork bifurcation; Infinite-period bifurcation; Codimension; Mathematical analysis; Period-doubling bifurcation; Bifurcation; Homoclinic orbit; Applied mathematics; Nonlinear system; Physics","score_opus":0.022266220798481545,"score_gpt":0.2982734364478228,"score_spread":0.2760072156493412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961403428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91878784,0.00005846198,0.08015681,0.00023840657,0.00010195678,0.000102499325,0.00000678106,0.0000062660474,0.0005410036],"genre_scores_gemma":[0.99835265,0.000049547914,0.001222784,0.000082029976,0.00021793204,0.000004646192,0.000023728493,0.0000089198975,0.000037764094],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990206,0.00005571228,0.00048012848,0.0001234952,0.0002360798,0.00008398661],"domain_scores_gemma":[0.99885046,0.00011217462,0.0005335389,0.00011207723,0.00034671076,0.00004502877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028388153,0.000094127805,0.00019796981,0.00030225006,0.000015097829,0.000020943184,0.00021922728,0.00003646266,0.00005969328],"category_scores_gemma":[0.000010684307,0.000086763124,0.00008482469,0.000104383194,0.000024184023,0.0002555292,0.000029067032,0.00016221442,0.000002496667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034557335,0.00046446326,0.5526283,0.0000047857147,0.00016612188,8.5274496e-7,0.0007019228,0.33319417,0.0028290702,0.033079144,0.000153103,0.076432504],"study_design_scores_gemma":[0.00066393515,0.00014333909,0.06221475,0.00013203759,0.000015898127,0.0000017367887,0.00023732,0.926334,0.0010742474,0.009012624,0.00007168346,0.000098378274],"about_ca_topic_score_codex":0.000054726705,"about_ca_topic_score_gemma":0.000026506325,"teacher_disagreement_score":0.5931399,"about_ca_system_score_codex":0.000038439335,"about_ca_system_score_gemma":0.00003548846,"threshold_uncertainty_score":0.35380977},"labels":[],"label_agreement":null},{"id":"W2962677525","doi":"10.1186/s13174-019-0113-z","title":"Thematic series on Social Network Analysis and Mining","year":2019,"lang":"en","type":"article","venue":"Journal of Internet Services and Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade Federal do Estado do Rio de Janeiro; Pontifícia Universidade Católica do Rio de Janeiro; Universidade do Estado de Santa Catarina; Universidade Federal de Minas Gerais; Universidade Presbiteriana Mackenzie; Universidade Federal do Piauí; Universidade de São Paulo; University of Toronto; Universidade Federal do Rio de Janeiro; University College London; Universidade Federal do ABC","keywords":"Computer science; Data science; Field (mathematics); Social network analysis; The Internet; Social network (sociolinguistics); Key (lock); Social computing; Crowdsourcing; Thematic analysis; World Wide Web; Knowledge management; Social media; Social science; Computer security; Sociology","score_opus":0.00830585947319104,"score_gpt":0.2644758127368361,"score_spread":0.2561699532636451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962677525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98877984,0.00011833469,0.008486533,0.00022008555,0.000011332578,0.00009400511,0.0000032420787,0.000008065153,0.0022785515],"genre_scores_gemma":[0.9976577,0.000016547545,0.0016378122,0.00007347968,0.0003680822,0.000009961255,0.0000062970994,0.0000057040666,0.00022437352],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994596,0.000017908782,0.00025811652,0.000096173564,0.000082466504,0.00008568642],"domain_scores_gemma":[0.99943167,0.00005222086,0.0003274582,0.00009039598,0.00006155654,0.0000366699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012184254,0.00008166664,0.00025277043,0.000086939406,0.000059058933,0.00007926341,0.00011872581,0.000017868335,0.00015699673],"category_scores_gemma":[1.820685e-7,0.000064313695,0.00010989085,0.00026443167,0.000018007866,0.0000896276,0.00004956388,0.00008411059,0.0000033927486],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008210161,0.00023654274,0.7095598,0.00016316569,0.004785789,9.2216794e-7,0.0028464585,0.0013930806,0.00028835604,0.18433519,0.0020842028,0.0942244],"study_design_scores_gemma":[0.002958336,0.0013302945,0.5045443,0.0013720605,0.011068095,0.000058639827,0.031681363,0.09016987,0.0014724965,0.22232872,0.13081239,0.0022033881],"about_ca_topic_score_codex":0.00003594657,"about_ca_topic_score_gemma":0.000024973007,"teacher_disagreement_score":0.20501545,"about_ca_system_score_codex":0.000005424886,"about_ca_system_score_gemma":0.000004646556,"threshold_uncertainty_score":0.26226366},"labels":[],"label_agreement":null},{"id":"W2962746665","doi":"10.1002/qre.2520","title":"Modeling and detecting change in temporal networks via the degree corrected stochastic block model","year":2019,"lang":"en","type":"article","venue":"Quality and Reliability Engineering International","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences","keywords":"Stochastic block model; Computer science; Parametric statistics; Cohesion (chemistry); Stochastic process; Representation (politics); Data mining; Block (permutation group theory); Network model; Dynamic network analysis; Artificial intelligence; Mathematics; Statistics","score_opus":0.037387686755493144,"score_gpt":0.2818581359577885,"score_spread":0.24447044920229538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962746665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58185285,0.000032565706,0.4176915,0.000116231466,0.000085713,0.0001442649,0.0000031989584,0.00003531944,0.000038350438],"genre_scores_gemma":[0.9981611,0.000002962565,0.0015699994,0.000027683296,0.00015867219,0.000038890852,0.000014766092,0.000011083449,0.000014838259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990953,0.000039575927,0.0003094095,0.00025636065,0.00013537807,0.00016397053],"domain_scores_gemma":[0.99949783,0.00017014045,0.000054688975,0.00017939576,0.00005997629,0.000037986643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061077357,0.00013297828,0.00018300457,0.000062584644,0.000049159327,0.000046109122,0.0001329012,0.000046847883,0.000018558863],"category_scores_gemma":[0.000026991942,0.00011092654,0.00005327964,0.0001069517,0.000020551064,0.00010973305,0.00012705487,0.00030485712,6.6779745e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010700084,0.000021659296,0.038042817,0.000009725113,0.00002123892,7.302525e-8,0.00022433422,0.95777845,0.000043315493,0.0012737446,0.0000011710964,0.002572796],"study_design_scores_gemma":[0.00016119318,0.000008375369,0.010612108,0.000041395924,0.000008555174,8.9637354e-7,0.000040073504,0.98752576,0.000005099191,0.0014623775,0.0000063200637,0.00012783962],"about_ca_topic_score_codex":0.0013325885,"about_ca_topic_score_gemma":0.000057378904,"teacher_disagreement_score":0.41630825,"about_ca_system_score_codex":0.00003809579,"about_ca_system_score_gemma":0.000008419568,"threshold_uncertainty_score":0.4523453},"labels":[],"label_agreement":null},{"id":"W2962884567","doi":"10.1109/cdc.2012.6425841","title":"Robustness of complex networks with implications for consensus and contagion","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Robustness (evolution); Random graph; Preferential attachment; Complex network; Computer science; Theoretical computer science; Graph; Random geometric graph; Spatial network; Mathematics; Combinatorics; Line graph; Voltage graph","score_opus":0.030691007527557584,"score_gpt":0.2895037351306987,"score_spread":0.2588127276031411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962884567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092552684,0.000043252177,0.9036694,0.00019053451,0.000008780813,0.00026248716,0.000012831957,0.000030141759,0.00322986],"genre_scores_gemma":[0.96792364,9.434662e-7,0.031730406,0.000016437516,0.000141219,0.000053721807,0.00004957316,0.0000084586745,0.00007562306],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9995835,0.000012927414,0.00013561448,0.000088193854,0.000026476791,0.00015328631],"domain_scores_gemma":[0.99950707,0.00011846695,0.00008523671,0.00015201383,0.00008615662,0.000051032184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008162843,0.00007423073,0.00016089734,0.0000246236,0.000060540664,0.000008974163,0.000047279867,0.000014339787,0.000064534084],"category_scores_gemma":[7.4166985e-7,0.000057941263,0.00003824623,0.000085539155,0.0000651175,0.000029384397,0.00002323943,0.000029548093,1.0431224e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035364214,0.00013796183,0.63019615,0.000009065504,0.00016785279,7.68133e-9,0.000029918481,0.004686687,0.00040008256,0.33845302,0.009569978,0.016313935],"study_design_scores_gemma":[0.0023769503,0.00028110496,0.5466087,0.00005502144,0.00064831635,0.000008200908,0.0005919018,0.4245019,0.0014109791,0.006179981,0.016503539,0.00083344063],"about_ca_topic_score_codex":0.000070187925,"about_ca_topic_score_gemma":0.000016040638,"teacher_disagreement_score":0.8753709,"about_ca_system_score_codex":0.0000043320306,"about_ca_system_score_gemma":0.000006930625,"threshold_uncertainty_score":0.23627762},"labels":[],"label_agreement":null},{"id":"W2963244227","doi":"10.1007/978-3-319-06608-0_12","title":"Inferring Attitude in Online Social Networks Based on Quadratic Correlation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Snapshot (computer storage); Artificial intelligence; Social network (sociolinguistics); Machine learning; Correlation; Sign (mathematics); Set (abstract data type); Quadratic equation; Social relationship; Data mining; Social media; World Wide Web; Mathematics; Social psychology; Psychology","score_opus":0.014384914638141205,"score_gpt":0.26664143107755933,"score_spread":0.25225651643941815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963244227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058966386,0.000018349667,0.9960747,0.00014470497,0.00024643666,0.00022727354,0.0000031299328,0.000056255823,0.0026394986],"genre_scores_gemma":[0.97581863,7.852645e-7,0.02229103,0.00044090356,0.0012786802,0.0000074923455,0.00007312287,0.000027893624,0.00006145999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980641,0.00004545417,0.0004389894,0.0006705352,0.00041298824,0.00036792347],"domain_scores_gemma":[0.9988158,0.00037734455,0.00025607157,0.00042350875,0.00007485788,0.000052442276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045773375,0.00035067936,0.00047721274,0.00055283925,0.0001552644,0.00013717702,0.0005844618,0.00016279292,0.00008823209],"category_scores_gemma":[0.000008509689,0.00034590875,0.00013991508,0.00038097653,0.00021075502,0.000073782416,0.00019718576,0.0008764896,0.0000072219004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000467661,0.00003151448,0.0050541316,0.0000051642046,0.0000058628257,0.0000020643602,0.000057392128,0.7222772,0.000002202505,0.0061047086,0.0000141867595,0.26644084],"study_design_scores_gemma":[0.00017564234,0.000052964275,0.0020412514,0.00031298527,0.000012693705,2.0707141e-7,9.096862e-8,0.9663608,0.000009413578,0.030501649,0.00021099416,0.0003212732],"about_ca_topic_score_codex":0.000080949976,"about_ca_topic_score_gemma":0.00036795135,"teacher_disagreement_score":0.97522897,"about_ca_system_score_codex":0.0001985617,"about_ca_system_score_gemma":0.00013147024,"threshold_uncertainty_score":0.99989927},"labels":[],"label_agreement":null},{"id":"W2963373420","doi":"10.1142/s2425038416300020","title":"Event identification in social networks","year":2017,"lang":"en","type":"article","venue":"Encyclopedia with Semantic Computing and Robotic Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Event (particle physics); Identification (biology); Computer science; Data science; Social media; Complex event processing; Social network (sociolinguistics); World Wide Web","score_opus":0.012267730497794005,"score_gpt":0.2935383517964765,"score_spread":0.2812706212986825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963373420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13096987,0.00005712792,0.8649314,0.00017510848,0.00013492975,0.00017005047,2.8719379e-7,0.00003989441,0.0035213542],"genre_scores_gemma":[0.997402,0.000027189873,0.0017423795,0.000010345565,0.000513122,0.0000071137547,0.0000061460387,0.000014022169,0.00027764888],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876755,0.000046773577,0.00036209647,0.00035339288,0.00013955719,0.0003306251],"domain_scores_gemma":[0.9991686,0.00008389933,0.00029802174,0.00034721268,0.000054428132,0.000047833782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040584223,0.0001697435,0.0002634666,0.00007621973,0.00082485186,0.00019291617,0.0003269369,0.00003575217,0.000030919284],"category_scores_gemma":[0.000011231673,0.00014733759,0.00005191203,0.00012641036,0.00013934233,0.00010327634,0.0001997313,0.00022934847,0.000006295799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016213964,0.00015356511,0.5419256,0.000030026471,0.00007739246,0.000012857044,0.0015060278,0.112486444,0.000009476725,0.03197773,0.00020232996,0.31160232],"study_design_scores_gemma":[0.0001131566,0.000031112024,0.22723478,0.0001932557,0.00005794222,0.0000034442262,0.00032977638,0.763877,0.000047295314,0.0077078016,0.000087608714,0.00031686953],"about_ca_topic_score_codex":0.00047567335,"about_ca_topic_score_gemma":0.000071621216,"teacher_disagreement_score":0.86643213,"about_ca_system_score_codex":0.00001715074,"about_ca_system_score_gemma":0.000022551056,"threshold_uncertainty_score":0.63441765},"labels":[],"label_agreement":null},{"id":"W2963643297","doi":"10.4230/lipics.itcs.2018.41","title":"Graph Clustering using Effective Resistance","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conductance; Inverse; Graph; Connection (principal bundle); Degree (music); Discrete mathematics; Physics; Geometry","score_opus":0.012682103788339588,"score_gpt":0.28431961830362557,"score_spread":0.27163751451528595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963643297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27648744,0.000028449336,0.7017124,0.00005099597,0.00041155922,0.0013404334,0.00027057072,0.00023870321,0.019459445],"genre_scores_gemma":[0.9662473,0.000002064439,0.03211435,0.00021616548,0.00076728617,0.00013516047,0.00019184317,0.000054674238,0.00027111892],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978886,0.000044274657,0.0008152122,0.00027062107,0.00029320706,0.00068805396],"domain_scores_gemma":[0.9983066,0.00010826723,0.00045116982,0.00064843294,0.00034396426,0.00014161077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041187898,0.00038414507,0.00048621473,0.00025271648,0.00054789835,0.00024119548,0.0004978648,0.000096100855,0.00015331098],"category_scores_gemma":[0.0000126282575,0.0003697721,0.00037307965,0.00045721437,0.0002086737,0.0006903848,0.00030290984,0.00028553276,0.00005778465],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034115533,0.0034841327,0.34167552,0.003663728,0.010372057,0.000019122877,0.06446937,0.0033417111,0.006558312,0.18284094,0.13198474,0.24817882],"study_design_scores_gemma":[0.009177152,0.0009632172,0.005248343,0.0018442542,0.0009474688,0.000023996896,0.004880349,0.47389218,0.026018439,0.050765373,0.42202264,0.0042165895],"about_ca_topic_score_codex":0.00006518471,"about_ca_topic_score_gemma":0.000083936655,"teacher_disagreement_score":0.6897599,"about_ca_system_score_codex":0.000111088,"about_ca_system_score_gemma":0.00003428627,"threshold_uncertainty_score":0.9998754},"labels":[],"label_agreement":null},{"id":"W2963690545","doi":"10.1016/j.dam.2017.07.016","title":"Burning a graph is hard","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph; Block graph; Line graph; Pathwidth","score_opus":0.02201358486141114,"score_gpt":0.2857251221677339,"score_spread":0.26371153730632274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963690545","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100599885,0.000019459983,0.42665318,0.00027094662,0.00004499027,0.00040889785,0.000028473387,0.00020504887,0.47176912],"genre_scores_gemma":[0.93512106,0.000002498553,0.06394329,0.000047025966,0.000181926,0.00007190637,0.000017829254,0.00003136581,0.00058308913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904734,0.0000042605056,0.00026149696,0.00023992259,0.00018900933,0.00025797065],"domain_scores_gemma":[0.9983938,0.000034439752,0.00034733376,0.001123249,0.00003093731,0.00007023903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015485096,0.0001904321,0.0003108885,0.000048450336,0.0004930503,0.00028501777,0.0005629898,0.00003266279,0.00068700995],"category_scores_gemma":[0.00000430852,0.0001686765,0.00018223902,0.000058730682,0.000089127985,0.000082899336,0.00023092428,0.00014359315,0.00011455467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004622884,0.00009931232,0.0026669567,0.0000453569,0.00026962213,0.0000012319532,0.0013864631,0.000011432867,0.003679229,0.9694502,0.008903699,0.013481886],"study_design_scores_gemma":[0.0003826698,0.000014175326,0.00091796526,0.00008018902,0.0002133976,6.532417e-7,0.0007290462,0.0057459995,0.012128187,0.9720461,0.0072067175,0.0005349056],"about_ca_topic_score_codex":0.000030724757,"about_ca_topic_score_gemma":0.0000014163189,"teacher_disagreement_score":0.8345212,"about_ca_system_score_codex":0.0000086493565,"about_ca_system_score_gemma":0.000011217003,"threshold_uncertainty_score":0.7522277},"labels":[],"label_agreement":null},{"id":"W2964173611","doi":"10.1145/3178876.3186111","title":"Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples","year":2018,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Azrieli Foundation; Israel Science Foundation; Sandia National Laboratories; Laboratory Directed Research and Development; U.S. Department of Energy; National Nuclear Security Administration; National Science Foundation","keywords":"Degree (music); Sublinear function; Degree distribution; Bounded function; Mathematics; Graph; Distribution (mathematics); Sample size determination; Random graph; Sampling (signal processing); Computer science; Algorithm; Discrete mathematics; Combinatorics; Statistics; Complex network","score_opus":0.14381463295392982,"score_gpt":0.35638553561002595,"score_spread":0.21257090265609613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964173611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021159712,0.000011328736,0.9771388,0.00053632114,0.00001501985,0.00031919157,0.000038337057,0.000040266394,0.0007409916],"genre_scores_gemma":[0.88789546,9.91695e-7,0.11151789,0.000019310286,0.0003282714,0.0000526645,0.000086124455,0.0000060749044,0.00009321698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954057,0.000018150515,0.000117745556,0.00012825582,0.000060736285,0.00013453282],"domain_scores_gemma":[0.9994285,0.0001976482,0.000054784723,0.00016102518,0.00013235227,0.00002570873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020075637,0.00006685419,0.00008124878,0.000018864821,0.00037493944,0.000100335725,0.000046863974,0.00001531382,0.0001346277],"category_scores_gemma":[0.000019497314,0.000043834665,0.000053402986,0.00016921914,0.000108929366,0.00012127081,0.00004460434,0.00004705205,0.0000014524977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021718382,0.000114062,0.0136568025,0.000008176215,0.00016368463,4.4610367e-8,0.000057033365,0.000019412992,0.0004949673,0.9492723,0.015420534,0.0207713],"study_design_scores_gemma":[0.00036653838,0.00010011691,0.003384374,0.00001321951,0.00030923373,0.0000034073303,0.00044068793,0.7466657,0.0057529933,0.15662192,0.08607653,0.0002652323],"about_ca_topic_score_codex":0.00027263875,"about_ca_topic_score_gemma":0.000041503066,"teacher_disagreement_score":0.86673576,"about_ca_system_score_codex":0.000008420476,"about_ca_system_score_gemma":0.000025519934,"threshold_uncertainty_score":0.2883769},"labels":[],"label_agreement":null},{"id":"W2965635372","doi":"10.24963/ijcai.2019/560","title":"Multi-scale Information Diffusion Prediction with Reinforced Recurrent Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute; Canadian Institute for Advanced Research; HEC Montréal","funders":"National Research Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Computer science; Diffusion; Diffusion process; Context (archaeology); Recurrent neural network; Artificial intelligence; Process (computing); Scale (ratio); Machine learning; Information cascade; Task (project management); Graph; Artificial neural network; Data mining; Theoretical computer science; Mathematics; Innovation diffusion; Statistics","score_opus":0.004658563920006255,"score_gpt":0.20952937057251378,"score_spread":0.20487080665250754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965635372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14505239,0.0000048213187,0.8378357,0.000022843155,0.000077339784,0.00036027585,0.000004162113,0.00017603491,0.016466428],"genre_scores_gemma":[0.9913662,0.000003448215,0.0067256116,0.000038175414,0.00010595446,0.000031832446,0.0003258694,0.000007744129,0.0013951717],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993217,0.000016152535,0.00023145537,0.00012129204,0.00014477155,0.00016465048],"domain_scores_gemma":[0.99948114,0.000014202927,0.00011945332,0.00025983373,0.00007667759,0.000048705933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000082798244,0.00011911646,0.00014359261,0.000067107314,0.00006450779,0.00006439629,0.000093118004,0.00003165586,0.0008770254],"category_scores_gemma":[4.7998213e-7,0.00008873971,0.00006368741,0.00019845735,0.000012820269,0.0005045474,0.00005466383,0.0001251297,0.000082012884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002254766,0.00016675692,0.6650814,0.0000253602,0.00019385296,1.5033798e-7,0.000588987,0.1437275,0.0008905129,0.008958984,0.013535031,0.16660602],"study_design_scores_gemma":[0.0005371481,0.00010552043,0.014790121,0.00003307718,0.000023669114,2.6044236e-7,0.000119807286,0.9767474,0.00023615517,0.00003670359,0.007238167,0.00013195002],"about_ca_topic_score_codex":0.00013359787,"about_ca_topic_score_gemma":0.000012228491,"teacher_disagreement_score":0.8463138,"about_ca_system_score_codex":0.000024940598,"about_ca_system_score_gemma":0.000011479945,"threshold_uncertainty_score":0.9602813},"labels":[],"label_agreement":null},{"id":"W2965853670","doi":"10.5465/ambpp.2019.13401abstract","title":"The Network Dynamics of Conventions","year":2019,"lang":"en","type":"article","venue":"Academy of Management Proceedings","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Convergence (economics); Computer science; Stochastic game; Process (computing); Convention; Network formation; Mathematical optimization; Distributed computing; Microeconomics; Mathematics; Economics","score_opus":0.0075802554019216055,"score_gpt":0.2503024185397885,"score_spread":0.2427221631378669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965853670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6043286,0.0002620676,0.011086216,0.003183043,0.000118026976,0.0015501821,0.000009747669,0.0001313551,0.3793308],"genre_scores_gemma":[0.9952465,0.000044554767,0.0013583325,0.000029599245,0.000075813456,0.000025370615,0.000004997092,0.0000104109995,0.0032043878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991308,0.0000056288877,0.00032575626,0.00015476326,0.00018789296,0.00019517915],"domain_scores_gemma":[0.9995013,0.000037807666,0.00031509032,0.00008279925,0.000041990483,0.000021025578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037329708,0.000094508534,0.00017927666,0.000037119873,0.00007775998,0.000019432428,0.00040226028,0.000025752945,0.00015512435],"category_scores_gemma":[9.79718e-7,0.00007598638,0.00013575357,0.00034169538,0.0000693547,0.000096692114,0.00022446098,0.00012323774,0.000011652646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006459616,0.000023583407,0.0539681,0.000040076906,0.0002277142,8.6577305e-9,0.000015609528,0.00005377313,0.00002269506,0.9151125,0.009685875,0.020843633],"study_design_scores_gemma":[0.00072120054,0.000092329195,0.058849704,0.00031074305,0.0005085626,2.473889e-7,0.0012703459,0.027060412,0.0013130471,0.7584537,0.15101272,0.00040694157],"about_ca_topic_score_codex":0.000008114902,"about_ca_topic_score_gemma":3.0864504e-7,"teacher_disagreement_score":0.390918,"about_ca_system_score_codex":0.000013176877,"about_ca_system_score_gemma":0.0000024685548,"threshold_uncertainty_score":0.30986348},"labels":[],"label_agreement":null},{"id":"W2966153325","doi":"10.1007/978-3-031-01874-9","title":"Community Search over Big Graphs","year":2019,"lang":"en","type":"book","venue":"Synthesis lectures on data management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Data science; Big data; World Wide Web; Theoretical computer science; Data mining","score_opus":0.05929447088745657,"score_gpt":0.3019880674766987,"score_spread":0.24269359658924214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966153325","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014810418,0.00016013613,0.0036851643,0.0001308871,0.00019860404,0.0010672978,0.0015889298,0.00021033148,0.99281055],"genre_scores_gemma":[0.12757061,0.00025294398,0.0015639932,0.0007405386,0.0012505947,0.00024545725,0.015556316,0.0003514418,0.85246813],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996815,0.00049403455,0.00045217978,0.0009328256,0.000775172,0.00053073623],"domain_scores_gemma":[0.9916935,0.0005928951,0.00025730918,0.0073157256,0.000045491728,0.000095100906],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009808829,0.00066028675,0.00079460396,0.0006143802,0.00034290692,0.0002704938,0.0042338255,0.0001511291,0.0028947606],"category_scores_gemma":[0.000010742405,0.0006049455,0.00035386608,0.00023655573,0.00011321514,0.000102511854,0.0037097046,0.0013390396,0.00045103184],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031322536,0.00020382971,0.00011701302,0.00017392266,0.002152425,0.0000053744593,0.00002327207,0.00008561578,0.0000021326375,0.054232966,0.7354086,0.20756352],"study_design_scores_gemma":[0.00016660933,0.000050812836,0.00046929525,0.0004986135,0.0008900044,1.893261e-7,0.000036173704,0.000333227,0.00010364238,0.0413262,0.9553548,0.0007704213],"about_ca_topic_score_codex":0.000526873,"about_ca_topic_score_gemma":0.000107070875,"teacher_disagreement_score":0.2199462,"about_ca_system_score_codex":0.00016819351,"about_ca_system_score_gemma":0.00008206512,"threshold_uncertainty_score":0.99964017},"labels":[],"label_agreement":null},{"id":"W2966701614","doi":"10.24963/ijcai.2019/914","title":"Event Prediction in Complex Social Graphs using One-Dimensional Convolutional Neural Network","year":2019,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"International Business Machines Corporation","keywords":"Computer science; Graph; Event (particle physics); Vertex (graph theory); Artificial intelligence; Convolutional neural network; Social network (sociolinguistics); Theoretical computer science; Machine learning; Data mining; Social media; World Wide Web","score_opus":0.029853922628131715,"score_gpt":0.2792700957568878,"score_spread":0.2494161731287561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966701614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9861201,0.000015609216,0.008930594,0.00010661002,0.00011683223,0.0002582283,0.000018848494,0.00008036036,0.004352785],"genre_scores_gemma":[0.9961633,1.1778813e-7,0.0027409422,0.00008895746,0.00053134596,0.00001075765,0.0002464141,0.000013009908,0.00020513528],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878424,0.000080125545,0.00032443646,0.0002579765,0.00024848233,0.0003047581],"domain_scores_gemma":[0.99963635,0.000038271482,0.00009978577,0.00012592114,0.000059018654,0.000040674888],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017813047,0.00013838791,0.00024058075,0.00008841356,0.00013445978,0.000024427447,0.00010475715,0.000038715803,0.005128264],"category_scores_gemma":[5.0439445e-7,0.0001452989,0.00017274405,0.00033787906,0.000041506435,0.00011101629,0.00009560437,0.00016891111,0.000034791505],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037173482,0.00020947262,0.7300146,0.0000038978483,0.000120080855,4.3065515e-7,0.00003256556,0.10006829,0.0018293983,0.1550464,0.0113552995,0.0012823502],"study_design_scores_gemma":[0.0004649669,0.000026252304,0.27446502,0.000014135596,0.000029631396,6.87893e-7,0.000026688758,0.682278,0.000023880528,0.041841846,0.000650922,0.0001779795],"about_ca_topic_score_codex":0.0004563625,"about_ca_topic_score_gemma":0.000034211833,"teacher_disagreement_score":0.5822097,"about_ca_system_score_codex":0.00006726265,"about_ca_system_score_gemma":0.00003778293,"threshold_uncertainty_score":0.9957812},"labels":[],"label_agreement":null},{"id":"W2967892553","doi":"10.1007/s00285-020-01518-6","title":"A modified Ising model of Barabási–Albert network with gene-type spins","year":2020,"lang":"en","type":"preprint","venue":"Journal of Mathematical Biology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"RWTH Aachen University; Deutsche Forschungsgemeinschaft","keywords":"Ising model; Statistical physics; Biological network; Spins; Phase transition; Monte Carlo method; Computer science; Physics; Complex system; Mathematics; Artificial intelligence; Bioinformatics; Biology; Quantum mechanics; Condensed matter physics","score_opus":0.05389661347976133,"score_gpt":0.3087222401159691,"score_spread":0.2548256266362078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967892553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13153693,0.00017807569,0.86398244,0.0005176001,0.00007652181,0.00019294661,0.000014483524,0.00001841552,0.0034826107],"genre_scores_gemma":[0.84593004,0.000022865559,0.15320142,0.00005590892,0.00071059586,0.0000046019613,0.000016977388,0.00002865891,0.000028920247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794,0.00013351446,0.0011597957,0.00026500312,0.00020531965,0.0002963715],"domain_scores_gemma":[0.9974515,0.00023304217,0.0014216675,0.00040134243,0.00034346577,0.0001489819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044058092,0.00031471904,0.0014726535,0.00010609536,0.00003948509,0.0000264755,0.00056527456,0.0001994703,0.00017683968],"category_scores_gemma":[0.000036241192,0.0002192939,0.00047126974,0.00018022416,0.00014485468,0.00003383568,0.00044643163,0.00090240536,0.0000050427975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000765094,0.0008841241,0.003221827,0.0005172833,0.004788996,0.000020766729,0.0006988718,0.4850784,0.009288955,0.4835121,0.0048423884,0.006381186],"study_design_scores_gemma":[0.00023414512,0.00027647908,0.000019796815,0.0003660712,0.00041391997,0.000009800419,0.000015603258,0.24284379,0.0007446783,0.7548034,0.0000640628,0.00020821008],"about_ca_topic_score_codex":0.000010770198,"about_ca_topic_score_gemma":0.0000011209756,"teacher_disagreement_score":0.71439314,"about_ca_system_score_codex":0.00003261987,"about_ca_system_score_gemma":0.00025013014,"threshold_uncertainty_score":0.8942546},"labels":[],"label_agreement":null},{"id":"W2968499159","doi":"10.1109/cibcb.2019.8791445","title":"Pandemic: A Graph Evolution Story","year":2019,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph; Pandemic; Theoretical computer science; Coronavirus disease 2019 (COVID-19); Data science; Infectious disease (medical specialty)","score_opus":0.007832933677122605,"score_gpt":0.24033747279144377,"score_spread":0.23250453911432117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968499159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6703121,0.000050062754,0.16358443,0.000047297755,0.00006426478,0.00015244071,0.0000017852692,0.0002304611,0.16555716],"genre_scores_gemma":[0.99369204,5.2987286e-7,0.0008431227,0.00002414438,0.00010069487,0.0000087462895,0.00000945619,0.000006014827,0.0053152787],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958706,0.000024594048,0.000075007825,0.00012831338,0.000071224254,0.00011382388],"domain_scores_gemma":[0.9996953,0.000021583939,0.00003277489,0.00020112764,0.000023755458,0.000025462785],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000097771524,0.000061971215,0.000094266405,0.00005195961,0.000032739215,0.000010626962,0.000084539985,0.0000143309735,0.0030989773],"category_scores_gemma":[3.9260865e-7,0.000054299424,0.00009416687,0.00012948061,0.000011196292,0.00005981039,0.000031984837,0.000085286694,0.00027738634],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023699024,0.000027244168,0.825482,0.0000012604938,0.00004239991,4.1383657e-8,0.000019233727,0.00004008477,0.0012629551,0.15355077,0.00988601,0.00968561],"study_design_scores_gemma":[0.0012525144,0.00016951481,0.25334492,0.000051728108,0.00016398779,0.0000014742103,0.00091073493,0.01788234,0.0018414824,0.49471214,0.22846659,0.0012025922],"about_ca_topic_score_codex":0.00017384565,"about_ca_topic_score_gemma":0.000008842458,"teacher_disagreement_score":0.5721371,"about_ca_system_score_codex":0.00002078907,"about_ca_system_score_gemma":0.000013207463,"threshold_uncertainty_score":0.99781233},"labels":[],"label_agreement":null},{"id":"W2969944961","doi":"10.1162/qss_a_00006","title":"Intellectual and social similarity among scholarly journals: An exploratory comparison of the networks of editors, authors and co-citations","year":2019,"lang":"en","type":"article","venue":"Quantitative Science Studies","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Similarity (geometry); Citation; Field (mathematics); Association (psychology); Interlocking; Editorial board; Library science; Sociology; Social science; Computer science; Mathematics; Epistemology; Engineering; Artificial intelligence; Philosophy","score_opus":0.10467017328342969,"score_gpt":0.42972936890547575,"score_spread":0.32505919562204605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969944961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99492025,0.00060374907,0.0038267153,0.000093239374,0.00020025429,0.00015004138,0.000010710594,0.000008835653,0.00018619865],"genre_scores_gemma":[0.99889976,0.0000156854,0.0009286933,0.0000062152358,0.0001300193,0.0000059684244,0.0000011307711,0.000004425378,0.00000812665],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987796,0.00020726527,0.00030690012,0.00022063595,0.00032540335,0.00016022912],"domain_scores_gemma":[0.9983197,0.00054414454,0.00032206278,0.00013116772,0.00064632937,0.000036593538],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012681305,0.00010787339,0.0003459145,0.00013612263,0.00076090114,0.00011592663,0.00024090857,0.000021770229,0.000015300659],"category_scores_gemma":[0.00019491209,0.00007774423,0.000055608394,0.00067484076,0.0031605,0.00089015556,0.00021224903,0.00024207613,3.7395392e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011557801,0.00008555728,0.896525,0.000013537671,0.00015153125,2.7711536e-8,0.07582237,0.00023342631,0.0022238386,0.022071864,0.0015274932,0.0013337507],"study_design_scores_gemma":[0.00029102905,0.00047498345,0.59553146,0.00016127432,0.00014239315,1.08303084e-7,0.35323367,0.03161082,0.0035188794,0.014489882,0.0002498905,0.00029559428],"about_ca_topic_score_codex":0.00003246138,"about_ca_topic_score_gemma":0.00004468797,"teacher_disagreement_score":0.3009936,"about_ca_system_score_codex":0.000016597798,"about_ca_system_score_gemma":0.00006813457,"threshold_uncertainty_score":0.9995523},"labels":[],"label_agreement":null},{"id":"W2970990147","doi":"10.3233/jifs-231817","title":"A shrinking synchronization clustering algorithm based on a linear weighted Vicsek model","year":2023,"lang":"en","type":"article","venue":"Journal of Intelligent & Fuzzy Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"sync; Cluster analysis; Computer science; Synchronization (alternating current); Algorithm; CURE data clustering algorithm; Canopy clustering algorithm; Correlation clustering; Artificial intelligence","score_opus":0.022269276451472725,"score_gpt":0.2828167022351432,"score_spread":0.2605474257836705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970990147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068940567,0.000082594735,0.9906641,0.00008685145,0.00038816038,0.00021648793,0.000009674167,0.000093775496,0.0015642537],"genre_scores_gemma":[0.98842573,0.000022367203,0.009976223,0.000032140066,0.0012171947,0.000014925454,0.000031686257,0.000044845718,0.00023489798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979221,0.000113791095,0.00092083117,0.0001985953,0.0005479409,0.00029671204],"domain_scores_gemma":[0.99841017,0.00012747187,0.00067294296,0.00027149587,0.0003982797,0.00011966666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007797766,0.0002184775,0.00045219852,0.0005784465,0.00012436965,0.00012637717,0.0003145746,0.000056133023,0.000043695953],"category_scores_gemma":[0.000009664033,0.00018811742,0.00031681615,0.0007547854,0.00001858081,0.00013040654,0.000064807515,0.00030946214,0.000048154474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028225466,0.00010444286,0.0011035642,0.000038999322,0.00018273617,0.000018296312,0.0002104106,0.9601808,0.0001253073,0.00084222516,0.0017795924,0.03538541],"study_design_scores_gemma":[0.00018828276,0.00012612675,0.000017250915,0.0005816684,0.00006300156,0.000005048569,0.00022518271,0.99561703,0.0005678443,0.0011366084,0.0012988888,0.00017307191],"about_ca_topic_score_codex":0.00005628601,"about_ca_topic_score_gemma":0.0000024615717,"teacher_disagreement_score":0.9815317,"about_ca_system_score_codex":0.00016986203,"about_ca_system_score_gemma":0.00011057165,"threshold_uncertainty_score":0.7671206},"labels":[],"label_agreement":null},{"id":"W2971325383","doi":"10.48550/arxiv.1906.07159","title":"vGraph: A Generative Model for Joint Community Detection and Node\\n Representation Learning","year":2019,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; HEC Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Generative model; Node (physics); Representation (politics); Inference; Graph; Feature learning; Parameterized complexity; Generative grammar; Community structure; Theoretical computer science; Machine learning; Joint probability distribution; Artificial intelligence; Algorithm; Mathematics","score_opus":0.1358008619107201,"score_gpt":0.23085242739542206,"score_spread":0.09505156548470195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971325383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43106186,0.000022542124,0.56736284,0.000013632922,0.00008294878,0.0007933063,0.00003250768,0.00007649998,0.0005538415],"genre_scores_gemma":[0.9943366,0.00022469932,0.0024790931,0.000022396001,0.00017223443,0.000017520193,0.00027805415,0.000059378788,0.0024100256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968223,0.0009350452,0.00048213996,0.0011979057,0.00009639846,0.0004662154],"domain_scores_gemma":[0.9969891,0.0003391384,0.0008892407,0.0011146459,0.0004985556,0.0001693582],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00068226457,0.00059635605,0.0008505757,0.00043310822,0.0013236823,0.00019819447,0.00045342307,0.00031754837,0.00003673222],"category_scores_gemma":[0.000029976623,0.00077836955,0.0007176163,0.00057761295,0.00022189696,0.00036788292,0.0011954216,0.0018556488,0.00001190526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019881368,0.00018516314,0.0119572915,0.00010001449,0.00060699706,0.0000014231454,0.0013391208,0.9711569,0.0017353497,0.009484375,0.000069552785,0.0031650092],"study_design_scores_gemma":[0.0008706312,0.00015522672,0.00091573206,0.000117344985,0.0007691559,5.8230665e-7,0.0015529834,0.9318393,0.0015870249,0.06142656,0.00012207264,0.00064342504],"about_ca_topic_score_codex":0.0015724893,"about_ca_topic_score_gemma":0.00029324918,"teacher_disagreement_score":0.56488377,"about_ca_system_score_codex":0.00026939818,"about_ca_system_score_gemma":0.0001323756,"threshold_uncertainty_score":0.99997646},"labels":[],"label_agreement":null},{"id":"W2971862287","doi":"10.3934/mbe.2019407","title":"Effect of adaptive rewiring delay in an SIS network epidemic model","year":2019,"lang":"en","type":"article","venue":"Mathematical Biosciences & Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Limit cycle; Limit (mathematics); Computer science; State space; Steady state (chemistry); Parameter space; Network model; Control theory (sociology); Term (time); Process (computing); State (computer science); Mathematics; Physics; Statistics; Algorithm; Mathematical analysis; Artificial intelligence; Control (management)","score_opus":0.008902651799058437,"score_gpt":0.26052263032357587,"score_spread":0.25161997852451745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971862287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71987814,0.000028173492,0.27901673,0.000005008694,0.000020566502,0.0001635384,0.0000011448969,0.000043500902,0.0008432177],"genre_scores_gemma":[0.9730209,7.8608673e-7,0.026882073,0.0000037900322,0.000043009415,0.000021884343,0.0000013613741,0.0000116809815,0.000014476594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884915,0.000043282205,0.0003369748,0.0002516278,0.0001838442,0.00033514472],"domain_scores_gemma":[0.9992051,0.00037382919,0.00007668225,0.00025967913,0.000017381934,0.000067323934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093436544,0.00015590455,0.0004022661,0.0001039834,0.000023471857,0.000022451168,0.00030056908,0.000032717533,0.000060295868],"category_scores_gemma":[0.000019003983,0.00012589867,0.00010080908,0.0005083563,0.00003774111,0.0001788029,0.00009378675,0.00013802685,0.000010999144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007943034,0.0000409804,0.019172577,0.000046298897,0.00001636698,4.6385205e-7,0.00015567653,0.8933336,0.0074489056,0.0779756,0.000013817187,0.0017877728],"study_design_scores_gemma":[0.000079568264,0.00011667553,0.00013896405,0.00013537919,0.000015509047,2.658031e-7,0.00001894029,0.98648083,0.0039843423,0.008893664,0.000004122395,0.0001317587],"about_ca_topic_score_codex":0.000015344798,"about_ca_topic_score_gemma":0.0000016532215,"teacher_disagreement_score":0.2531428,"about_ca_system_score_codex":0.000024331823,"about_ca_system_score_gemma":0.000011451223,"threshold_uncertainty_score":0.5133999},"labels":[],"label_agreement":null},{"id":"W2972184593","doi":"10.1145/3359147","title":"Causal Effects of Brevity on Style and Success in Social Media","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Human-Computer Interaction","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Salient; Social media; Style (visual arts); Observational study; Psychology; Order (exchange); Computer science; Social psychology; Artificial intelligence; Mathematics; History; World Wide Web; Business","score_opus":0.030841182731681592,"score_gpt":0.3251916011884502,"score_spread":0.2943504184567686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972184593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99753046,0.000010580254,0.00012095312,0.00014268873,0.0004990897,0.0004797972,0.000008363677,0.00002849497,0.0011795663],"genre_scores_gemma":[0.9986142,0.0000037697246,0.0003465624,0.000024143623,0.00090814364,0.000038821865,0.000014634034,0.000024205256,0.000025525753],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986081,0.000035281788,0.00045995688,0.00044496663,0.00028536475,0.00016632973],"domain_scores_gemma":[0.998198,0.0003278792,0.0009186209,0.00036432766,0.0001674482,0.000023761755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024720287,0.0002831044,0.00062238495,0.00026323204,0.000069405185,0.00008180616,0.0009740296,0.00011812906,0.000022055496],"category_scores_gemma":[0.000037784725,0.0002350351,0.00025394265,0.00013644819,0.000061337,0.00013129706,0.0018491114,0.00079548784,0.0000019826405],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013841417,0.005618982,0.48145005,0.011274521,0.0030233464,0.00000257131,0.023975104,0.002034566,0.04996939,0.09508469,0.07133743,0.2548452],"study_design_scores_gemma":[0.0024616811,0.0007906123,0.5489191,0.011186314,0.0006594567,0.0000021004507,0.00031144623,0.013622048,0.24545942,0.17448483,0.00057377195,0.00152927],"about_ca_topic_score_codex":0.000206393,"about_ca_topic_score_gemma":0.000010324977,"teacher_disagreement_score":0.25331593,"about_ca_system_score_codex":0.00008876604,"about_ca_system_score_gemma":0.000014077243,"threshold_uncertainty_score":0.9584453},"labels":[],"label_agreement":null},{"id":"W2972744182","doi":"10.23919/acc.2019.8815219","title":"A Mean-Field Team Approach to Minimize the Spread of Infection in a Network","year":2019,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Population; Computer science; Markov process; Markov chain; Stochastic process; Finite set; Convolution (computer science); Dynamic network analysis; Probability distribution; Mathematics","score_opus":0.010611629746228124,"score_gpt":0.24769268439108302,"score_spread":0.2370810546448549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972744182","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30649966,0.000011794702,0.18782091,0.000076375734,0.000039060298,0.00045188793,5.5532007e-7,0.000035861838,0.5050639],"genre_scores_gemma":[0.99214286,0.00000112047,0.0068314173,0.00010412631,0.00014113111,0.00004991815,0.0000037931427,0.000006837132,0.0007188023],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993619,0.000045526675,0.00019712384,0.00015051961,0.000090760106,0.0001542024],"domain_scores_gemma":[0.9994762,0.000106231986,0.000059661532,0.00031093624,0.000024608573,0.00002238102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022915687,0.000083503095,0.00018519681,0.000049975002,0.000020201202,0.000015163462,0.00012206741,0.000023017012,0.00024894116],"category_scores_gemma":[0.0000025475122,0.000056877598,0.00009994036,0.0004360265,0.000008140272,0.000039300747,0.00008491974,0.00010505739,0.000021396483],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027604437,0.00017916302,0.887296,0.0000060456523,0.0000652467,1.6085217e-8,0.00031508083,0.007907978,0.00010574446,0.07439452,0.018659502,0.011043074],"study_design_scores_gemma":[0.0028616951,0.0007464036,0.5507214,0.00037951613,0.0003189876,0.0000020920857,0.0021769977,0.25291914,0.014602105,0.090994604,0.0824615,0.0018155416],"about_ca_topic_score_codex":0.0033965777,"about_ca_topic_score_gemma":0.00012568322,"teacher_disagreement_score":0.6856432,"about_ca_system_score_codex":0.000010562794,"about_ca_system_score_gemma":0.000011941979,"threshold_uncertainty_score":0.5134632},"labels":[],"label_agreement":null},{"id":"W2973017024","doi":"10.1089/omi.2019.0130","title":"A New Web-Based Big Data Analytics for Dynamic Public Opinion Mapping in Digital Networks on Contested Biotechnology Fields","year":2019,"lang":"en","type":"article","venue":"OMICS A Journal of Integrative Biology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Agence Nationale de la Recherche","keywords":"Public opinion; Big data; Data science; Meaning (existential); Politics; Analytics; Variety (cybernetics); Public relations; Sociology; Political science; World Wide Web; Computer science; Psychology; Law; Artificial intelligence","score_opus":0.04723081238926345,"score_gpt":0.30469955872561166,"score_spread":0.2574687463363482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973017024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09409056,0.00015700712,0.90300316,0.0016394776,0.00041378912,0.00027394676,0.00011154436,0.000017600947,0.00029290534],"genre_scores_gemma":[0.99461293,0.000038612918,0.0044731447,0.00011594451,0.00028145334,0.0000047098947,0.00041176123,0.00001630905,0.00004512559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864197,0.00006333271,0.00064324716,0.0002948633,0.000060859504,0.00029573432],"domain_scores_gemma":[0.99804544,0.00056714733,0.0006443257,0.00044968043,0.00022542133,0.00006795594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036459122,0.0002230195,0.00062240916,0.00059337314,0.00003158651,0.00006929692,0.00076754217,0.00019607268,0.000036960377],"category_scores_gemma":[0.00012106552,0.00016529259,0.00020276644,0.00044468755,0.00007085964,0.00015556804,0.00013654753,0.00058579043,0.0000024214619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006231906,0.0005491488,0.1721355,0.000016020906,0.0012358727,0.0000048295024,0.00010940995,0.0030485992,0.003944191,0.14933726,0.005662437,0.66333354],"study_design_scores_gemma":[0.0037416941,0.0019026077,0.0007281928,0.00033376826,0.000048428938,0.0000083295745,0.0006160074,0.92399794,0.0006158484,0.030576678,0.036949117,0.00048141752],"about_ca_topic_score_codex":0.00003753216,"about_ca_topic_score_gemma":0.00010803838,"teacher_disagreement_score":0.92094934,"about_ca_system_score_codex":0.00010683303,"about_ca_system_score_gemma":0.00032199148,"threshold_uncertainty_score":0.6740436},"labels":[],"label_agreement":null},{"id":"W2974097540","doi":"10.22230/cjc.2019v44n3a3653","title":"Data Segregation and Algorithmic Amplification: A Conversation with Wendy Hui Kyong Chun","year":2019,"lang":"en","type":"article","venue":"Canadian Journal of Communication","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"Carleton University; University of Calgary; University of Alberta","funders":"","keywords":"Vision; Conversation; Sociology; Media studies; Politics; Power (physics); Library science; Art history; Management; Law; Art; Political science; Computer science","score_opus":0.020137307974808775,"score_gpt":0.2478742063984743,"score_spread":0.2277368984236655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974097540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9117994,0.0014661752,0.0721101,0.0052768607,0.000109421555,0.00067222136,0.000099026714,0.000028629902,0.008438216],"genre_scores_gemma":[0.9923408,0.000026595557,0.007158417,0.00003156023,0.00006084759,0.0000028938093,0.00030798223,0.00000992135,0.000060968243],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99932724,0.00009343433,0.00026106954,0.00010670433,0.00010686263,0.000104681836],"domain_scores_gemma":[0.9983,0.00006344655,0.00040188615,0.0008581509,0.00024442622,0.00013206866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040104068,0.00007992854,0.0001448715,0.00015928663,0.00011500625,0.000103441904,0.00052730547,0.000024617031,0.00021212705],"category_scores_gemma":[0.0000066529133,0.00007531873,0.00002320371,0.00018931946,0.00006401784,0.0005112386,0.000037259008,0.00017929287,0.000007745267],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005171035,0.00006995765,0.6431335,0.000028318522,0.0005676477,0.0000025686738,0.0033956224,0.00072271796,0.0005590804,0.09603218,0.0071059996,0.24833068],"study_design_scores_gemma":[0.004723881,0.0006196841,0.49304888,0.0011393056,0.0009592532,0.0001587944,0.008976172,0.15838803,0.001135187,0.064717114,0.26461405,0.0015196493],"about_ca_topic_score_codex":0.0026644266,"about_ca_topic_score_gemma":0.0041462258,"teacher_disagreement_score":0.25750807,"about_ca_system_score_codex":0.00006151087,"about_ca_system_score_gemma":0.00031402655,"threshold_uncertainty_score":0.4027834},"labels":[],"label_agreement":null},{"id":"W2977221592","doi":"10.1145/3341981.3350529","title":"MAISoN 2019","year":2019,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science","score_opus":0.003360177537901209,"score_gpt":0.229380143295209,"score_spread":0.2260199657573078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977221592","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28169188,0.000013038661,0.019154616,0.000097875476,0.00004370051,0.00009625475,0.0000016059586,0.00010198752,0.698799],"genre_scores_gemma":[0.9696497,3.110552e-7,0.0016373778,0.000042931,0.000094412964,0.0000030769545,0.000012497074,0.0000055485234,0.028554156],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996693,0.0000075017365,0.000069183676,0.00010104721,0.000053834145,0.00009913417],"domain_scores_gemma":[0.999731,0.000013061718,0.000020535072,0.00020118947,0.000013842424,0.000020379593],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0000388401,0.000050040835,0.00008173595,0.000023426655,0.000013739138,0.000016844515,0.000086763976,0.000008267343,0.021372186],"category_scores_gemma":[1.3535762e-7,0.000042000283,0.00006367069,0.000077910285,0.000004666563,0.000041608313,0.000037105452,0.00004104911,0.0018298087],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002491,0.000046576683,0.45922068,0.000001324891,0.000052970212,1.114653e-7,0.00002161159,0.00003545963,0.0013445752,0.36832288,0.13403255,0.036918774],"study_design_scores_gemma":[0.0007127128,0.000111612724,0.049076453,0.00002416206,0.0000645868,5.058354e-7,0.00027237998,0.015022049,0.018802226,0.11853148,0.796581,0.00080084667],"about_ca_topic_score_codex":0.00018565792,"about_ca_topic_score_gemma":0.0000017690212,"teacher_disagreement_score":0.6879578,"about_ca_system_score_codex":0.0000043243176,"about_ca_system_score_gemma":0.0000054350244,"threshold_uncertainty_score":0.9989474},"labels":[],"label_agreement":null},{"id":"W2978215649","doi":"10.1109/ijcnn.2019.8851730","title":"Spatial Event Prediction via Multivariate Time Series Analysis of Neighboring Social Units using Deep Neural Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Event (particle physics); Computer science; Artificial intelligence; Clique; Deep learning; Artificial neural network; Perceptron; Social network analysis; Social network (sociolinguistics); Node (physics); Time series; Machine learning; Data mining; Mathematics; Social media","score_opus":0.011089271637422753,"score_gpt":0.25159483189795906,"score_spread":0.2405055602605363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978215649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37361073,0.0000054164916,0.6254474,0.000007603346,0.000056777077,0.000119042896,0.000011207255,0.000057612513,0.00068422535],"genre_scores_gemma":[0.99814,2.907021e-7,0.0011162603,0.000006470253,0.0003893279,0.000005761038,0.00019057287,0.00001768203,0.0001336385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988316,0.000092288166,0.00040215705,0.0002483488,0.00018294407,0.00024264667],"domain_scores_gemma":[0.9992863,0.00003930966,0.00025567494,0.00021807957,0.00015883803,0.00004181],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014455208,0.00017233087,0.00045016463,0.00021147613,0.00011656625,0.000033646505,0.00013520579,0.000051618037,0.0017293937],"category_scores_gemma":[0.0000014549656,0.0001675375,0.00027874197,0.0012335407,0.000029225761,0.00020064847,0.000116016876,0.00012876902,0.00000380937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043975826,0.000069258225,0.31129286,0.000003926517,0.0020434894,2.59008e-7,0.00020386136,0.66349614,0.0028158876,0.0013524889,0.000019735387,0.018658102],"study_design_scores_gemma":[0.00015796791,0.000029553654,0.041617915,0.0000047711046,0.0010590882,1.10382615e-7,0.000050420218,0.9562729,0.00041593204,0.00023035197,0.000021892,0.0001390932],"about_ca_topic_score_codex":0.0023907966,"about_ca_topic_score_gemma":0.00007255941,"teacher_disagreement_score":0.62452924,"about_ca_system_score_codex":0.000040931598,"about_ca_system_score_gemma":0.000014152103,"threshold_uncertainty_score":0.9991832},"labels":[],"label_agreement":null},{"id":"W2980421046","doi":"10.2174/1574893614666191017100657","title":"Finding Community of Brain Networks Based on Neighbor Index and DPSO with Dynamic Crossover","year":2019,"lang":"en","type":"article","venue":"Current Bioinformatics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China","keywords":"Crossover; Computer science; Particle swarm optimization; Modularity (biology); Convergence (economics); Artificial neural network; Coding (social sciences); Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.01075751317308179,"score_gpt":0.2708412936275963,"score_spread":0.2600837804545145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980421046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7089482,0.000029011393,0.28641945,0.000035134053,0.0000713634,0.00034567565,0.000036957503,0.000046793906,0.0040674503],"genre_scores_gemma":[0.9983602,0.0000018151522,0.0013967471,0.00004498983,0.00002128877,0.0000064466917,0.00013323505,0.000011626014,0.000023628045],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991519,0.000054398395,0.00034668343,0.000078002326,0.00016738616,0.0002016488],"domain_scores_gemma":[0.9988651,0.00028344642,0.0003101861,0.0004348489,0.000052438907,0.000053957097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028057434,0.00016915613,0.00029432154,0.00010972654,0.000112707945,0.00006361047,0.00019033527,0.000033393586,0.00009811384],"category_scores_gemma":[0.00000540891,0.00013575703,0.00007707059,0.00023853884,0.0000801155,0.00014654169,0.00009935454,0.00039756112,0.000005810885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021527614,0.0005882549,0.75831115,0.0005154109,0.00020758246,2.2952905e-7,0.0014371221,0.06271161,0.000022552447,0.008689599,0.0029426995,0.16435853],"study_design_scores_gemma":[0.0006622824,0.00012692228,0.0123568475,0.00025186557,0.000026333346,1.8868762e-7,0.00018630018,0.98523337,0.00003702692,0.000298359,0.0006470707,0.00017345314],"about_ca_topic_score_codex":0.000026120411,"about_ca_topic_score_gemma":0.000006844719,"teacher_disagreement_score":0.9225217,"about_ca_system_score_codex":0.00002553108,"about_ca_system_score_gemma":0.00003096089,"threshold_uncertainty_score":0.5536011},"labels":[],"label_agreement":null},{"id":"W2981573289","doi":"10.1021/acs.organomet.9b00563","title":"An Information-Rich Graphical Representation of Catalytic Cycles","year":2019,"lang":"en","type":"article","venue":"Organometallics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Chemistry; Catalytic cycle; Catalysis; Representation (politics); Population; Reaction rate constant; Graphical user interface; Annotation; Kinetics; Computer science; Programming language; Organic chemistry; Artificial intelligence","score_opus":0.008432823466653413,"score_gpt":0.2653788683581322,"score_spread":0.25694604489147876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981573289","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97966903,0.00000621054,0.0123142935,0.000031844666,0.00002818067,0.00014160441,0.000012146783,0.00004430247,0.007752355],"genre_scores_gemma":[0.9978774,0.0000025372985,0.0016499195,0.000016847687,0.000045822548,0.000006417197,0.00032491313,0.000008457653,0.00006767346],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993053,0.000024676334,0.00027852601,0.00011589581,0.00016332835,0.00011227022],"domain_scores_gemma":[0.99925774,0.000035418772,0.00015469076,0.00041451846,0.00009389352,0.000043755088],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008791938,0.000087112676,0.0001938667,0.00015043111,0.000028892284,0.00003701289,0.00019304446,0.000025850508,0.0010771101],"category_scores_gemma":[0.0000041464345,0.00008385,0.00008514968,0.0006555499,0.000030598687,0.00050294324,0.0000417326,0.00007212564,0.000097971875],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009578304,0.00019234355,0.8553232,0.000020720809,0.00017878039,1.2504476e-7,0.0004904963,0.0004883911,0.005800892,0.11101417,0.00024007997,0.026241254],"study_design_scores_gemma":[0.0019141012,0.0005105915,0.689511,0.00006514573,0.0006461755,0.0000032886835,0.0032102875,0.03380697,0.14377102,0.10901138,0.01593092,0.0016191273],"about_ca_topic_score_codex":0.000116589574,"about_ca_topic_score_gemma":0.0000036516965,"teacher_disagreement_score":0.16581218,"about_ca_system_score_codex":0.000009163385,"about_ca_system_score_gemma":0.000021540229,"threshold_uncertainty_score":0.999836},"labels":[],"label_agreement":null},{"id":"W2982169658","doi":"10.1109/tbdata.2019.2948613","title":"PES: Priority Edge Sampling in Streaming Triangle Estimation","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Big Data","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Sampling (signal processing); Estimator; Enhanced Data Rates for GSM Evolution; Streaming algorithm; Metric (unit); Cluster analysis; Algorithm; Variance (accounting); Clustering coefficient; Theoretical computer science; Mathematics; Statistics; Artificial intelligence; Upper and lower bounds","score_opus":0.08562440375598687,"score_gpt":0.32429078161761027,"score_spread":0.2386663778616234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982169658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13495086,0.00001050672,0.8635093,0.00003855489,0.00022308457,0.00023331483,0.00023147,0.00006766645,0.00073522533],"genre_scores_gemma":[0.99299276,0.0000046443574,0.006441747,0.000011070893,0.00011700238,0.000017451286,0.00026472917,0.000014364823,0.00013622665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901575,0.000047381545,0.00025974386,0.00036122065,0.00013373222,0.00018218612],"domain_scores_gemma":[0.9987938,0.00013004184,0.00007272387,0.0009435544,0.000021462087,0.000038445178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024203763,0.00012851853,0.00021242641,0.0001778878,0.00008128691,0.000055568806,0.00036119463,0.000036050955,0.00029149294],"category_scores_gemma":[0.0000018804759,0.00013544878,0.0000676026,0.00036271964,0.000014843744,0.00028186582,0.000006629276,0.00023110808,0.000087702094],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025580384,0.00034230517,0.0028311398,0.000013866694,0.000065503424,4.6178977e-7,0.00011253686,0.014662533,0.0007070311,0.00020704282,0.00019086491,0.98084116],"study_design_scores_gemma":[0.00315933,0.00019671359,0.00867714,0.00051645277,0.0003263142,0.0000020592304,0.0005688474,0.94957685,0.015735857,0.0055910028,0.014427692,0.0012217119],"about_ca_topic_score_codex":0.0007105363,"about_ca_topic_score_gemma":0.00027379242,"teacher_disagreement_score":0.97961944,"about_ca_system_score_codex":0.000046593905,"about_ca_system_score_gemma":0.00004609705,"threshold_uncertainty_score":0.5523441},"labels":[],"label_agreement":null},{"id":"W2982295803","doi":"10.14778/3364324.3364330","title":"LINC","year":2019,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Cluster analysis; Theoretical computer science; Graph; Algorithm; Data mining; Artificial intelligence","score_opus":0.003710575606360767,"score_gpt":0.20465746596577183,"score_spread":0.20094689035941107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982295803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8479055,0.00002689722,0.000058995338,0.00029790576,0.000074674084,0.00033072414,0.0000027225587,0.000038705708,0.15126385],"genre_scores_gemma":[0.9971005,0.0000016208218,0.0007130739,0.00003469065,0.00010772226,0.000023579189,8.923303e-7,0.0000092118735,0.0020087194],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99936783,0.0000022097915,0.00016987903,0.00014207196,0.0001753966,0.00014259017],"domain_scores_gemma":[0.9996026,0.000012635572,0.0001578935,0.0001224572,0.00008020697,0.00002418735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116350995,0.0000901637,0.00014985859,0.00003251598,0.000037077923,0.000021495915,0.0003482012,0.000012970871,0.00052129716],"category_scores_gemma":[0.0000020267296,0.000060486138,0.00015562444,0.00017493693,0.000022686321,0.000061161234,0.00021433606,0.00008468955,0.000036277608],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015039342,0.0001829142,0.5947813,0.00003887872,0.00020091249,2.0793323e-8,0.00027614352,0.000027689024,0.07425597,0.3061601,0.013627154,0.01043392],"study_design_scores_gemma":[0.00081793533,0.000126612,0.018909736,0.00019453438,0.00017063195,9.725087e-7,0.0006294047,0.0015569674,0.7830499,0.1303304,0.063783996,0.00042895178],"about_ca_topic_score_codex":0.000068080975,"about_ca_topic_score_gemma":3.3207024e-7,"teacher_disagreement_score":0.7087939,"about_ca_system_score_codex":0.000018843157,"about_ca_system_score_gemma":0.000008512082,"threshold_uncertainty_score":0.5707838},"labels":[],"label_agreement":null},{"id":"W2983727063","doi":"10.1371/journal.pone.0224307","title":"Clustering via hypergraph modularity","year":2019,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowa Agencja Wymiany Akademickiej","keywords":"Hypergraph; Modularity (biology); Cluster analysis; Computer science; Theoretical computer science; Clustering coefficient; Heuristic; Function (biology); Simple (philosophy); Graph; Graph theory; Algorithm; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.021844200450596957,"score_gpt":0.21480253636173616,"score_spread":0.1929583359111392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983727063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95415056,0.000022138714,0.026490277,0.00006166389,0.000014436947,0.0001635952,0.0000031880422,0.000109005676,0.01898514],"genre_scores_gemma":[0.9903877,0.0000013607429,0.008670454,0.000031035903,0.00016122671,0.000016228718,0.000017365695,0.000013846033,0.00070078275],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999372,0.000019487828,0.00012152618,0.00017667178,0.00014854428,0.0001617354],"domain_scores_gemma":[0.9995275,0.000016690368,0.000044414,0.00033472214,0.00003703711,0.000039609928],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006570075,0.00008897368,0.00019593888,0.000047399517,0.000039286904,0.00002481518,0.00014053247,0.000019347597,0.0012156172],"category_scores_gemma":[7.703719e-7,0.000092288115,0.00008561949,0.00013906113,0.0000114546965,0.00006668297,0.0000979574,0.00011176706,0.00019593138],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014738879,0.0017525527,0.8523638,0.000052099687,0.0010298542,8.545739e-7,0.000089229005,0.00019358196,0.1255107,0.005196111,0.0002999609,0.013496465],"study_design_scores_gemma":[0.0013829805,0.00026389834,0.058148894,0.00042963919,0.00085340335,6.940559e-7,0.00009447028,0.6865801,0.16824514,0.08054298,0.0018715436,0.0015862496],"about_ca_topic_score_codex":0.0001331359,"about_ca_topic_score_gemma":0.0000063929224,"teacher_disagreement_score":0.79421496,"about_ca_system_score_codex":0.000010762796,"about_ca_system_score_gemma":0.000005241969,"threshold_uncertainty_score":0.9996974},"labels":[],"label_agreement":null},{"id":"W2984121413","doi":"10.1007/s41066-019-00207-0","title":"Overlapping community detection in social networks with Voronoi and tolerance neighborhood-based method","year":2019,"lang":"en","type":"article","venue":"Granular Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voronoi diagram; Clique percolation method; Cluster analysis; Partition (number theory); Intersection (aeronautics); Computer science; Data mining; Community structure; Hierarchical clustering of networks; Mathematics; Theoretical computer science; Algorithm; Correlation clustering; Artificial intelligence; CURE data clustering algorithm; Combinatorics; Geography","score_opus":0.009183566836904078,"score_gpt":0.25447295311976414,"score_spread":0.24528938628286007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984121413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45954567,0.000022145405,0.53963625,0.000014117878,0.000019471698,0.00013112194,5.1449206e-7,0.000047379475,0.00058332726],"genre_scores_gemma":[0.9895199,2.5063414e-7,0.0101753315,0.00005896873,0.00020100323,0.0000057006837,0.00001465475,0.00001995766,0.0000042250776],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987535,0.00039235086,0.00023127711,0.00023056612,0.00011189214,0.0002804321],"domain_scores_gemma":[0.999363,0.00019065848,0.00014862501,0.00022406472,0.00004025111,0.000033406282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000629354,0.00017242694,0.0003286291,0.000089424095,0.0003597521,0.00007018676,0.00013886266,0.000044653,0.000017272409],"category_scores_gemma":[0.0000017747395,0.00017456229,0.0000745308,0.0003878706,0.000030559575,0.00007689951,0.00009072842,0.0005302665,0.0000012541153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005781764,0.0001020004,0.59932846,0.000035606874,0.000058110887,0.0000012871885,0.0005911796,0.14819044,0.0009672791,0.0023075691,0.0000125141905,0.24834773],"study_design_scores_gemma":[0.0006649079,0.000044956098,0.07086238,0.000082573395,0.000023269631,6.3975375e-7,0.00015971511,0.92659205,0.0003118189,0.00096243294,0.000085068816,0.00021016703],"about_ca_topic_score_codex":0.0008555581,"about_ca_topic_score_gemma":0.0001009168,"teacher_disagreement_score":0.7784016,"about_ca_system_score_codex":0.00003667017,"about_ca_system_score_gemma":0.000015516256,"threshold_uncertainty_score":0.7118443},"labels":[],"label_agreement":null},{"id":"W2990018325","doi":"10.1177/0165551519888606","title":"Integrated framework for criminal network extraction from Web","year":2019,"lang":"en","type":"article","venue":"Journal of Information Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Variety (cybernetics); Newspaper; Key (lock); World Wide Web; Implementation; Process (computing); Social network analysis; Social media; Graph; Social network (sociolinguistics); Web application; Data science; Information retrieval; Computer security; Artificial intelligence","score_opus":0.016028633634726088,"score_gpt":0.3120985190501725,"score_spread":0.29606988541544643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990018325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34214804,0.000007454222,0.65519375,0.00005926181,0.00035627466,0.0000869848,0.0000055952587,0.000009637335,0.0021330337],"genre_scores_gemma":[0.87018687,0.0000027385067,0.12933533,0.000090243004,0.00035925285,0.000002409123,0.000007715244,0.000002189292,0.000013266257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891686,0.000013179632,0.00049766304,0.000058325597,0.00035396512,0.00015998544],"domain_scores_gemma":[0.99818426,0.00017060908,0.00076813175,0.00013698365,0.0006766505,0.000063345935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008784393,0.00007179628,0.0001528155,0.00019154458,0.000118614924,0.00021142751,0.00032660106,0.000024784043,0.00043415974],"category_scores_gemma":[0.000055263255,0.00005658985,0.000112051704,0.00061220047,0.000048942267,0.0030266927,0.000028320046,0.00020014253,0.00003527677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004237109,0.00015225203,0.10008059,0.00002739673,0.00019518638,5.153958e-7,0.0029563105,0.034755655,0.009243962,0.367777,0.025795182,0.45859227],"study_design_scores_gemma":[0.0014740514,0.0006123132,0.040359717,0.00064077973,0.00023562048,0.00001490506,0.0065712365,0.4270993,0.012605319,0.30561838,0.20408253,0.0006858559],"about_ca_topic_score_codex":0.000017253928,"about_ca_topic_score_gemma":5.7436864e-7,"teacher_disagreement_score":0.52803886,"about_ca_system_score_codex":0.00005706635,"about_ca_system_score_gemma":0.00023216344,"threshold_uncertainty_score":0.4753745},"labels":[],"label_agreement":null},{"id":"W2991027952","doi":"10.1111/coin.12249","title":"CSBF: A static ensemble fusion method based on the centrality score of complex networks","year":2019,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Centrality; Pairwise comparison; Artificial intelligence; Ensemble learning; Computer science; Classifier (UML); Weighting; Fusion; Machine learning; Pattern recognition (psychology); Data mining; Mathematics; Statistics","score_opus":0.04642834771364663,"score_gpt":0.3273409589880015,"score_spread":0.28091261127435485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991027952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03488469,0.000011813836,0.96154505,0.00028152112,0.000050136816,0.00033638853,0.000015195932,0.000030719857,0.002844497],"genre_scores_gemma":[0.96120757,8.028959e-7,0.038212445,0.0003182747,0.00005742977,0.000014938678,0.00011979991,0.0000114549375,0.000057262037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985946,0.00022382798,0.00037935743,0.00026425527,0.00031663408,0.00022135276],"domain_scores_gemma":[0.99768305,0.0015093455,0.00022481971,0.00033165718,0.00020458728,0.000046523153],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004886078,0.00015309655,0.00024154474,0.00006214656,0.0001009542,0.00003448654,0.0003306794,0.000023934514,0.002192328],"category_scores_gemma":[0.000010890601,0.000116296294,0.0001624435,0.00038276988,0.000068378824,0.000041518066,0.000081879654,0.0001727213,0.00004567253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020359847,0.000093476265,0.00888647,0.000008104262,0.000030275995,1.8307252e-7,0.000047289144,0.84246397,0.000055985754,0.12958223,0.00077479106,0.018036854],"study_design_scores_gemma":[0.000048814505,0.000051632473,0.0055716196,0.00005705246,0.000016699085,1.766685e-7,0.00006138819,0.9111429,0.0008420272,0.08186642,0.00023235645,0.00010891892],"about_ca_topic_score_codex":0.0001104081,"about_ca_topic_score_gemma":0.000002795951,"teacher_disagreement_score":0.9263229,"about_ca_system_score_codex":0.00002806397,"about_ca_system_score_gemma":0.00005616715,"threshold_uncertainty_score":0.9987198},"labels":[],"label_agreement":null},{"id":"W2991464965","doi":"10.1016/j.jtbi.2019.110090","title":"The influence of awareness on epidemic spreading on random networks","year":2019,"lang":"en","type":"article","venue":"Journal of Theoretical Biology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Basic reproduction number; Epidemic model; Outbreak; Demography; Population; Infection rate; Infectious disease (medical specialty); Disease; Biology; Environmental health; Medicine; Virology","score_opus":0.0061049755344824074,"score_gpt":0.2856314285467489,"score_spread":0.2795264530122665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991464965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9817896,0.0000618997,0.01487343,0.0003647041,0.00014578414,0.00008981018,0.0000018346329,0.0000054142706,0.0026675588],"genre_scores_gemma":[0.99946094,0.000028694525,0.000107065986,0.00010490061,0.00027438707,0.0000018845489,0.000001328253,0.0000071604672,0.000013615877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987235,0.00034976064,0.000516387,0.00010917398,0.000094999086,0.00020615352],"domain_scores_gemma":[0.99613357,0.0029973194,0.00045132352,0.0002495242,0.00011601047,0.000052271425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011505128,0.000111065645,0.00043139787,0.000060821858,0.00005712731,0.000011645064,0.00040209474,0.000059117385,0.00018314984],"category_scores_gemma":[0.000104675884,0.000059471833,0.00025634613,0.000110183464,0.0003351432,0.000023828334,0.000058711936,0.0003735129,0.0000100812795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050781964,0.00003955791,0.045088325,0.0000013675817,0.000116511466,4.6394226e-7,0.000009698079,0.0143833095,0.0010815808,0.9324697,0.00015066614,0.0061510033],"study_design_scores_gemma":[0.0013946438,0.0013566315,0.0068394253,0.00026411784,0.00011337982,0.00000588287,0.000045376357,0.013288408,0.0043635787,0.9703505,0.0017776026,0.00020044816],"about_ca_topic_score_codex":0.0000060313178,"about_ca_topic_score_gemma":2.3839443e-7,"teacher_disagreement_score":0.0382489,"about_ca_system_score_codex":0.000017244576,"about_ca_system_score_gemma":0.000024524528,"threshold_uncertainty_score":0.2425191},"labels":[],"label_agreement":null},{"id":"W2991480621","doi":"10.1016/j.ijinfomgt.2019.10.005","title":"Predicting semantic preferences in a socio-semantic system with collaborative filtering: A case study","year":2019,"lang":"en","type":"article","venue":"International Journal of Information Management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Collaborative filtering; Computer science; Preference; Semantics (computer science); Information retrieval; Neighbourhood (mathematics); Social network (sociolinguistics); Artificial intelligence; Data science; Natural language processing; Recommender system; World Wide Web; Social media; Mathematics","score_opus":0.008184783652716932,"score_gpt":0.263691499500754,"score_spread":0.2555067158480371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991480621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95355344,0.000004482527,0.039594937,0.000048380472,0.00014067972,0.0004638662,0.0000044139942,0.000016936176,0.0061728456],"genre_scores_gemma":[0.998329,0.0000016464611,0.0015172705,0.000014159585,0.000069701295,0.000022212102,0.0000070391457,0.000004391866,0.000034569748],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9986302,0.00005235367,0.00065377867,0.000072009374,0.0004898332,0.000101813865],"domain_scores_gemma":[0.9986893,0.000036363275,0.0007135604,0.00010248937,0.00043041416,0.000027892102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041950372,0.0001075241,0.00019233633,0.00046331808,0.00003479523,0.00018504544,0.00026699304,0.000011213881,0.000078784324],"category_scores_gemma":[0.000002231582,0.000084644686,0.000051339193,0.00024859264,0.000010407854,0.0009115452,0.00009863978,0.00011841555,0.000014423312],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015004635,0.00027643036,0.94385374,0.00009245647,0.0017053053,0.0004886755,0.0096068615,0.020946046,0.0000053251247,0.006862447,0.00015196469,0.015860705],"study_design_scores_gemma":[0.008793646,0.0014541037,0.08661282,0.0024946912,0.00043272364,0.0008117836,0.7548392,0.1412541,0.000121917314,0.0010699306,0.0014053445,0.00070978043],"about_ca_topic_score_codex":0.000234292,"about_ca_topic_score_gemma":0.000047457634,"teacher_disagreement_score":0.8572409,"about_ca_system_score_codex":0.00013418723,"about_ca_system_score_gemma":0.000033707824,"threshold_uncertainty_score":0.34517103},"labels":[],"label_agreement":null},{"id":"W2991942175","doi":"10.55016/ojs/cdm.v15i2.68115","title":"On irreversible spread of influence in edge-weighted graphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Mathematics; Undirected graph; Weighted network; Combinatorics; Graph; Process (computing); Graph theory; Topology (electrical circuits); Computer science; Discrete mathematics; Complex network; Artificial intelligence","score_opus":0.01114365547724431,"score_gpt":0.28134584542862057,"score_spread":0.27020218995137624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991942175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.728488,0.000029070687,0.2619705,0.0013352627,0.000019450179,0.00068837975,0.00042619745,0.00009688861,0.006946256],"genre_scores_gemma":[0.99465996,0.0000014050988,0.005072974,0.00010433861,0.000028628823,0.00004157128,0.000045187615,0.000011053188,0.000034866494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989883,0.000034440625,0.0004066671,0.00019290693,0.0001584834,0.00021920644],"domain_scores_gemma":[0.99908257,0.00017348168,0.00013684695,0.00031629117,0.00016847276,0.00012233811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012623866,0.0001460268,0.00035669687,0.00012830763,0.000054666845,0.000024611796,0.0002678866,0.000031507712,0.00020579732],"category_scores_gemma":[0.00010744999,0.0001371135,0.00013882913,0.00090497814,0.000045769328,0.00007315181,0.000106831365,0.0001389009,0.00006015038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020427948,0.00022755137,0.0060578096,0.000037913916,0.0000911032,0.0000015264643,0.0007966559,0.001107975,0.0019505591,0.98527133,0.003766719,0.0006703941],"study_design_scores_gemma":[0.0015391022,0.00041571056,0.0046448624,0.0006861458,0.0002590486,5.5442405e-7,0.00068921375,0.05473686,0.035785932,0.8969201,0.0034824808,0.0008400026],"about_ca_topic_score_codex":0.00004332173,"about_ca_topic_score_gemma":0.000005453659,"teacher_disagreement_score":0.26617196,"about_ca_system_score_codex":0.000033502973,"about_ca_system_score_gemma":0.00003547853,"threshold_uncertainty_score":0.5591326},"labels":[],"label_agreement":null},{"id":"W2996467117","doi":"10.1101/2019.12.15.876730","title":"Nonparametric Anomaly Detection on Time Series of Graphs","year":2019,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alberta Health","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Anomaly detection; Univariate; Nonparametric statistics; Change detection; Snapshot (computer storage); Test statistic; Statistic; Series (stratigraphy); Data mining; Statistical hypothesis testing; Artificial intelligence; Theoretical computer science; Machine learning; Multivariate statistics; Econometrics; Mathematics; Statistics","score_opus":0.008078320505200744,"score_gpt":0.20910469970546816,"score_spread":0.20102637920026742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996467117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98779446,0.0001553018,0.010111194,0.000024253924,0.00040208866,0.00073642965,0.00019078552,0.0003493951,0.00023607547],"genre_scores_gemma":[0.99660945,0.000020478878,0.0027983922,0.000018591865,0.000307334,0.00011819886,8.923443e-7,0.00010199184,0.000024670506],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976375,0.00013544991,0.00061159354,0.00083359407,0.00037604285,0.00040582335],"domain_scores_gemma":[0.9970324,0.00009472522,0.0007679148,0.001573212,0.0004127169,0.00011904814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038156178,0.00054107443,0.00084733096,0.00079513056,0.00009549592,0.000119180324,0.00056270725,0.0002690724,0.00025192904],"category_scores_gemma":[0.00002547462,0.00058954477,0.00044298204,0.0012860502,0.00009696036,0.00013401124,0.0003836548,0.00066056044,0.00015403837],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021168245,0.0010124943,0.13691983,0.0005329442,0.0021097513,0.000010178715,0.000013695214,0.0024914236,0.84265536,0.0125476625,0.0013464432,0.00014856496],"study_design_scores_gemma":[0.000340989,0.00023839316,0.084152386,0.00035969788,0.00035991214,2.817205e-9,0.0000017912075,0.002462863,0.9086675,0.00012512968,0.0022525692,0.001038757],"about_ca_topic_score_codex":0.00015767086,"about_ca_topic_score_gemma":0.000001097544,"teacher_disagreement_score":0.066012174,"about_ca_system_score_codex":0.00011236386,"about_ca_system_score_gemma":0.00018156161,"threshold_uncertainty_score":0.9996556},"labels":[],"label_agreement":null},{"id":"W2997309616","doi":"10.1007/978-3-030-33698-1_12","title":"A Model-Based Approach for Mining Anomalous Nodes in Networks","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Probabilistic logic; Node (physics); Data mining; Feature vector; Task (project management); Perspective (graphical); Feature (linguistics); Anomaly detection; Dirichlet distribution; Artificial intelligence; Mathematics; Engineering","score_opus":0.021158655802047687,"score_gpt":0.26223333970465074,"score_spread":0.24107468390260306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997309616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008737606,0.00095126405,0.9381422,0.00004414162,0.00013286313,0.0012151342,0.000036628488,0.000105015984,0.059285425],"genre_scores_gemma":[0.9675622,0.000013984006,0.024171805,0.00032854688,0.0040550805,0.0002304319,0.0013170032,0.00024879258,0.002072151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970042,0.00007073904,0.00080156425,0.0009742443,0.00025702332,0.0008922237],"domain_scores_gemma":[0.9981786,0.00062616676,0.0005111411,0.00050546636,0.000106445106,0.00007219874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004111102,0.000829853,0.001437196,0.00032292632,0.00019716234,0.00011025272,0.0005490498,0.0011088076,0.000099842204],"category_scores_gemma":[0.000009046799,0.0009062512,0.0007619034,0.00026452003,0.00014225871,0.000059476333,0.00015172397,0.0015023246,0.0000013489054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009479535,0.00006313411,0.003556011,0.000032020733,0.00012491555,0.0000019689037,0.00013693543,0.9296741,4.46686e-7,0.019025324,0.0007497312,0.046540637],"study_design_scores_gemma":[0.00070345664,0.00003685626,0.000036086185,0.00019260742,0.0001407932,1.8861287e-7,0.000005252816,0.95471644,0.0000014183369,0.042130724,0.0012135485,0.00082264777],"about_ca_topic_score_codex":0.00006252858,"about_ca_topic_score_gemma":0.00017366114,"teacher_disagreement_score":0.9674748,"about_ca_system_score_codex":0.00023836964,"about_ca_system_score_gemma":0.00018755787,"threshold_uncertainty_score":0.9993388},"labels":[],"label_agreement":null},{"id":"W2997422508","doi":"10.1155/2019/3032015","title":"Community Detection in Airline Networks: An Empirical Analysis of American vs. Southwest Airlines","year":2019,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Research and Development; National Natural Science Foundation of China","keywords":"Computer science; Modularity (biology); Community structure; Perspective (graphical); Maximization; Complex network; Operations research; Vulnerability (computing); Computer security; Artificial intelligence; Mathematical optimization; Engineering; Mathematics; World Wide Web; Statistics","score_opus":0.010784115761199971,"score_gpt":0.3035856778547688,"score_spread":0.29280156209356883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997422508","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8670072,0.000016302547,0.13279676,0.000024539935,0.000042655596,0.000077970726,0.00000973937,0.000010625749,0.000014192482],"genre_scores_gemma":[0.9945345,0.000012192929,0.005189565,0.00001992033,0.00008521689,0.0000027758065,0.00014050103,0.000011808096,0.0000035132691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99858385,0.00016285449,0.0008185919,0.0001077241,0.00019554349,0.0001314385],"domain_scores_gemma":[0.9984116,0.000094831455,0.0009539127,0.00022219199,0.0002594745,0.000057973026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038924284,0.00012580129,0.00061402423,0.00051544665,0.000037899743,0.000009264771,0.0001620406,0.000027963019,0.00004933664],"category_scores_gemma":[0.000003706854,0.00011783617,0.00031676717,0.0016487329,0.0000445142,0.0003348462,0.000003195078,0.00038050412,3.336016e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001580718,0.00017724422,0.4745145,0.00000342693,0.000203307,4.966145e-7,0.00055452087,0.50467217,0.000799529,0.000016595784,0.0000010707308,0.018899083],"study_design_scores_gemma":[0.00049712235,0.00043534077,0.96344286,0.000030304003,0.00058942003,2.1050474e-7,0.001895754,0.03185892,0.00070757,0.0003644473,0.00006577981,0.00011225656],"about_ca_topic_score_codex":0.00070861337,"about_ca_topic_score_gemma":0.0050553186,"teacher_disagreement_score":0.48892838,"about_ca_system_score_codex":0.000033326145,"about_ca_system_score_gemma":0.000023179979,"threshold_uncertainty_score":0.48052198},"labels":[],"label_agreement":null},{"id":"W2998475654","doi":"10.1609/aaai.v34i04.5835","title":"TellTail: Fast Scoring and Detection of Dense Subgraphs","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Pruning; Consistency (knowledge bases); Induced subgraph isomorphism problem; Graph; Ground truth; Theoretical computer science; Algorithm; Combinatorics; Mathematics; Artificial intelligence; Line graph","score_opus":0.05563683306484264,"score_gpt":0.27503513159488513,"score_spread":0.2193982985300425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998475654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9793294,0.000021085323,0.015601261,0.0004044032,0.000037103015,0.00022178002,0.000004096309,0.000039650185,0.004341194],"genre_scores_gemma":[0.9994901,0.000014199182,0.00034832105,0.000027457634,0.00008230077,0.000009948534,2.7344774e-7,0.000009888194,0.000017539505],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989854,0.000009100256,0.00038490747,0.00025768374,0.00019270927,0.0001701984],"domain_scores_gemma":[0.99918216,0.00003977476,0.00032058,0.00010025126,0.00029414904,0.000063082945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016471729,0.00013960703,0.00024297742,0.00006768013,0.00009723774,0.0000522708,0.0003396763,0.000030164609,0.00008002374],"category_scores_gemma":[0.00004735006,0.00011342926,0.00011387436,0.00046531355,0.00019508235,0.00010571468,0.00016851102,0.00017956174,0.0000056059125],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009796739,0.0000752775,0.0119790705,0.00004751817,0.00004875612,6.4326464e-8,0.00094231794,0.00003174449,0.5375299,0.23942788,0.000022030717,0.2097975],"study_design_scores_gemma":[0.000015323678,0.000113494134,0.00043239997,0.000106266205,0.000035412,2.3213777e-7,0.00094213174,0.015682483,0.924435,0.058102455,0.000025003183,0.00010977909],"about_ca_topic_score_codex":0.00010972667,"about_ca_topic_score_gemma":0.000007518393,"teacher_disagreement_score":0.38690516,"about_ca_system_score_codex":0.000006958459,"about_ca_system_score_gemma":0.000017865257,"threshold_uncertainty_score":0.46255112},"labels":[],"label_agreement":null},{"id":"W2999550809","doi":"10.1145/3341161.3343692","title":"Algorithm and application for signed graphlets","year":2019,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Popularity; Computer science; Graph; Data mining; Power graph analysis; Data modeling; Theoretical computer science; Data science; Artificial intelligence; Machine learning","score_opus":0.003257982729857261,"score_gpt":0.23763282372698877,"score_spread":0.23437484099713152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999550809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017899862,0.000011525226,0.9747233,0.00005471867,0.000007718193,0.0003513565,0.000004074113,0.00004678652,0.0069006947],"genre_scores_gemma":[0.9465621,4.6349558e-7,0.052417096,0.00003123339,0.000071843584,0.00009303413,0.00003725319,0.000005909371,0.00078102987],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970204,0.0000042936135,0.000066385066,0.00012346788,0.000030962296,0.00007285009],"domain_scores_gemma":[0.99978447,0.00002819305,0.000026337384,0.00011841791,0.000023774284,0.000018778745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004917821,0.000047572856,0.00007733967,0.00002506644,0.000027191209,0.000013915292,0.00004288695,0.000009916755,0.00016856994],"category_scores_gemma":[1.6167725e-7,0.000042225427,0.000041827945,0.000060478487,0.0000077557925,0.00003277152,0.000017718565,0.000017131617,0.000012607477],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025124389,0.000028766495,0.014321313,0.0000034578725,0.000041786185,7.450618e-9,0.000016287733,0.000005046126,0.0025737437,0.12830266,0.0015926609,0.85311174],"study_design_scores_gemma":[0.0010104659,0.00014507772,0.005148761,0.000009619418,0.00009218665,2.7128203e-7,0.00015559263,0.29763117,0.016493093,0.56961244,0.10920512,0.0004962105],"about_ca_topic_score_codex":0.000055827797,"about_ca_topic_score_gemma":0.0000011435749,"teacher_disagreement_score":0.9286623,"about_ca_system_score_codex":0.0000023147409,"about_ca_system_score_gemma":0.0000032629794,"threshold_uncertainty_score":0.18457226},"labels":[],"label_agreement":null},{"id":"W2999753255","doi":"10.1145/3248814","title":"Session details: Social networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Session (web analytics); Computer science; World Wide Web","score_opus":0.00879821717927094,"score_gpt":0.27056502396710796,"score_spread":0.26176680678783704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999753255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25878957,0.000006456384,0.5421034,0.0002476855,0.00017603228,0.000105531384,0.0000012931662,0.00026842262,0.19830157],"genre_scores_gemma":[0.99477077,2.3847468e-7,0.0028733527,0.00005396429,0.0012772984,0.000011470753,0.000016944958,0.000009995033,0.0009859812],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949175,0.000016064852,0.00011734271,0.00013370755,0.0000737605,0.00016737879],"domain_scores_gemma":[0.99971026,0.000022446726,0.000044006625,0.00015107643,0.000032913387,0.00003931165],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000937888,0.00008363192,0.000111788155,0.000026438533,0.00015121068,0.00004454856,0.00013083892,0.000036605314,0.0051584584],"category_scores_gemma":[7.7791475e-7,0.00006955772,0.000107386746,0.00013070574,0.000028218443,0.0000613019,0.00006666189,0.00023470393,0.000033645374],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071252316,0.00015130681,0.16460444,0.0000014143983,0.00009341637,7.5340733e-7,0.00007438288,0.00013498508,0.004186862,0.33454767,0.10500428,0.39119336],"study_design_scores_gemma":[0.0010775796,0.000063129235,0.077690415,0.000019015695,0.00024948732,0.0000018754016,0.00042555085,0.3367555,0.012461849,0.15523067,0.41439784,0.0016270871],"about_ca_topic_score_codex":0.00008390148,"about_ca_topic_score_gemma":0.000043736916,"teacher_disagreement_score":0.73598117,"about_ca_system_score_codex":0.0000031798725,"about_ca_system_score_gemma":0.000009723965,"threshold_uncertainty_score":0.99575096},"labels":[],"label_agreement":null},{"id":"W3002371932","doi":"10.1371/journal.pone.0227788","title":"Blind method for discovering number of clusters in multidimensional datasets by regression on linkage hierarchies generated from random data","year":2020,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Faculty of Health Sciences, Queen's University","keywords":"Computer science; Outlier; Cluster analysis; Data mining; Hierarchical clustering; Regression; Regression analysis; Exploratory data analysis; Artificial intelligence; Pattern recognition (psychology); Statistics; Mathematics; Machine learning","score_opus":0.08603208803713068,"score_gpt":0.33682157248979644,"score_spread":0.25078948445266575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002371932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8340243,0.000067343506,0.15384388,0.00045502756,0.000012184294,0.00052419084,0.010972944,0.000033370052,0.00006673898],"genre_scores_gemma":[0.6947474,0.000012069016,0.2716253,0.00012019421,0.00021748792,0.000041288735,0.033190526,0.000025974776,0.00001976075],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876815,0.0001335331,0.00032681672,0.00041148037,0.00021085086,0.00014916532],"domain_scores_gemma":[0.99882287,0.00045872063,0.00015150223,0.00047961052,0.00002520794,0.000062093306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018733453,0.00014815631,0.0004259852,0.000037634178,0.00004598798,0.000019936933,0.00030218804,0.00003187316,0.00014472447],"category_scores_gemma":[0.000036727182,0.0001277736,0.000054430904,0.00016355017,0.000023466357,0.00013480338,0.00034612484,0.00016127451,0.000003932182],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0064977016,0.0054470175,0.034620002,0.00018198615,0.0029312721,0.0000061031565,0.0011347436,0.0023703873,0.8588138,0.00074956747,0.06734488,0.019902531],"study_design_scores_gemma":[0.0053859814,0.000059689377,0.00015479502,0.00045036827,0.00026721283,3.0228076e-8,0.00006721451,0.7779076,0.21390031,0.00057210587,0.000956976,0.00027772874],"about_ca_topic_score_codex":0.0003177875,"about_ca_topic_score_gemma":0.000016853042,"teacher_disagreement_score":0.7755372,"about_ca_system_score_codex":0.000009537317,"about_ca_system_score_gemma":0.000017849405,"threshold_uncertainty_score":0.5210456},"labels":[],"label_agreement":null},{"id":"W3003831080","doi":"10.1080/23249935.2020.1720042","title":"Quantifying and classifying the robustness of bus transit networks","year":2020,"lang":"en","type":"article","venue":"Transportmetrica A Transport Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); Computer science; Network topology; Distributed computing; Computer network","score_opus":0.049788078605302225,"score_gpt":0.2738548344129579,"score_spread":0.22406675580765567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003831080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3957757,0.0003243815,0.6022658,0.0005315341,0.00004323088,0.00027562326,0.000016146538,0.00008437505,0.0006831988],"genre_scores_gemma":[0.9966939,0.000051995623,0.0029941464,0.00008156809,0.000121327656,0.000017082577,0.000013150322,0.000020888663,0.0000059358267],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9976614,0.000029064391,0.00060895266,0.0006058657,0.00059977843,0.0004948984],"domain_scores_gemma":[0.99893117,0.00012194726,0.00019660691,0.00035788896,0.00013962858,0.00025275815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006553058,0.00025722547,0.00048592142,0.00023652703,0.000402402,0.000041611493,0.00080803485,0.0000433915,0.00013898574],"category_scores_gemma":[0.0000051168645,0.00019326148,0.0002281622,0.005647378,0.0009709925,0.0003243733,0.000016789538,0.0003398997,6.524444e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000123993,0.00020700299,0.80295545,0.0001130204,0.00018099006,0.000014748715,0.002841743,0.118287146,0.0048897136,0.01771957,0.000053004376,0.0526136],"study_design_scores_gemma":[0.0012354519,0.000249909,0.5434922,0.00013871714,0.0008269225,0.0000047615686,0.0010975812,0.44287822,0.006462485,0.0003001951,0.0022461563,0.0010674025],"about_ca_topic_score_codex":0.00016062493,"about_ca_topic_score_gemma":0.000025358384,"teacher_disagreement_score":0.6009182,"about_ca_system_score_codex":0.000011878168,"about_ca_system_score_gemma":0.000112647016,"threshold_uncertainty_score":0.7880975},"labels":[],"label_agreement":null},{"id":"W3004293141","doi":"10.1017/nws.2020.45","title":"Artificial Benchmark for Community Detection (ABCD)—Fast random graph model with community structure","year":2021,"lang":"en","type":"article","venue":"Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Community structure; Benchmark (surveying); Random graph; Scalability; Graph; Theoretical computer science; Artificial intelligence; Complex network; Degree distribution; Algorithm; Machine learning; Mathematics","score_opus":0.020289072426919665,"score_gpt":0.2689334541712341,"score_spread":0.24864438174431444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004293141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.514788,0.00001735563,0.48301724,0.000029303525,0.00008083143,0.00022949735,0.000026948119,0.000065574735,0.001745273],"genre_scores_gemma":[0.9832982,0.0000011162051,0.016074257,0.00007977418,0.0003383549,0.00004761877,0.0001011579,0.00001602596,0.000043530606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820584,0.00037318352,0.000283513,0.0002827859,0.000335011,0.0005196895],"domain_scores_gemma":[0.998061,0.0003086619,0.00017162727,0.00091529894,0.0004219773,0.00012140886],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001376085,0.00021104167,0.0003164478,0.00008113059,0.0034102008,0.00023121304,0.0006920454,0.000046118428,0.0000595358],"category_scores_gemma":[0.00001909606,0.00018702222,0.00014347667,0.0017566979,0.00053587137,0.0002804678,0.00027044126,0.0008175599,8.138422e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047262112,0.00071249466,0.010267129,0.00004223565,0.000204891,0.0000013313245,0.0020249032,0.76868546,0.041196533,0.027366385,0.0020025373,0.14702348],"study_design_scores_gemma":[0.0007516316,0.00017558169,0.002345322,0.00008260837,0.00014969653,0.00000431199,0.00090016116,0.5953511,0.03238889,0.36689997,0.000426123,0.000524633],"about_ca_topic_score_codex":0.0004610464,"about_ca_topic_score_gemma":0.0027819958,"teacher_disagreement_score":0.46851018,"about_ca_system_score_codex":0.00005246312,"about_ca_system_score_gemma":0.00020979597,"threshold_uncertainty_score":0.9978872},"labels":[],"label_agreement":null},{"id":"W3004656262","doi":"10.1080/23789689.2019.1708175","title":"Temporal networks: a review and opportunities for infrastructure simulation","year":2020,"lang":"en","type":"review","venue":"Sustainable and Resilient Infrastructure","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interdependence; Computer science; Complex network; Representation (politics); Field (mathematics); Interdependent networks; Data science; Dimension (graph theory); Distributed computing; Topology (electrical circuits); Engineering","score_opus":0.022621995403715157,"score_gpt":0.3119773876830161,"score_spread":0.2893553922793009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004656262","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000024875455,0.9840067,0.012400555,0.000166612,0.000047685764,0.0026736266,0.00014339502,0.000090064204,0.00046887423],"genre_scores_gemma":[0.0003827115,0.99506885,0.0007078815,0.00027812016,0.00069057476,0.00030157986,0.0012050192,0.0000886796,0.0012766067],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99748504,0.00017146305,0.00081946,0.0007401451,0.00018342945,0.00060044316],"domain_scores_gemma":[0.9981946,0.00020833232,0.000661655,0.0004254868,0.00024843926,0.00026152146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023255001,0.00078601285,0.002354311,0.00020606205,0.0003803989,0.00020835506,0.00028899882,0.0002937971,0.00019695995],"category_scores_gemma":[0.000029859433,0.0006074005,0.00045452476,0.00041303464,0.0001560138,0.00020106186,0.00040865006,0.0006155624,3.976616e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000893435,0.000008030727,0.00004774685,0.03762135,0.0003637795,0.000012292376,0.00003926486,0.0006901266,6.504545e-9,0.008736682,0.03441427,0.9180575],"study_design_scores_gemma":[0.0001578132,0.00007474828,0.0000063792127,0.004454369,0.002696891,0.000008057592,0.00037491735,0.0022970282,3.7534246e-8,0.009145172,0.98022056,0.000564035],"about_ca_topic_score_codex":0.000018310946,"about_ca_topic_score_gemma":6.302705e-7,"teacher_disagreement_score":0.94580626,"about_ca_system_score_codex":0.00009074756,"about_ca_system_score_gemma":0.00033588294,"threshold_uncertainty_score":0.9996377},"labels":[],"label_agreement":null},{"id":"W3004683338","doi":"10.5539/nct.v5n1p37","title":"Modelling Malicious Attack in Social Networks","year":2020,"lang":"en","type":"article","venue":"Network and Communication Technologies","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Malware; Node (physics); Computer science; Fraction (chemistry); Social network (sociolinguistics); Computer network; Computer security; Unit (ring theory); Evolving networks; Complex network; Internet privacy; Social media; Mathematics; World Wide Web; Engineering","score_opus":0.04015076065452118,"score_gpt":0.2766194489721753,"score_spread":0.2364686883176541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004683338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17762749,0.011109315,0.7708027,0.017783402,0.00003432343,0.0007060733,0.000005565804,0.0029907846,0.018940363],"genre_scores_gemma":[0.99148464,0.0006415263,0.007489016,0.0001291819,0.00013493665,0.00006147183,0.000029334657,0.000015013931,0.000014889428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908787,0.00007371305,0.0002825924,0.00022043084,0.00007410708,0.00026128825],"domain_scores_gemma":[0.99936813,0.00007623203,0.00012428476,0.0003763972,0.000031405936,0.000023538383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001490889,0.00014853459,0.00026129285,0.00004872113,0.00027666692,0.000059822123,0.00051948393,0.000103299906,0.000023382026],"category_scores_gemma":[0.0000032353535,0.00015375396,0.000051052873,0.0005966287,0.00014033694,0.00008696604,0.0005124543,0.00044901308,0.0000032447263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029542993,0.00006226014,0.04971757,0.000008689025,0.000076274904,8.889505e-7,0.0005226041,0.52294254,0.000008698372,0.2049445,0.017036846,0.2046496],"study_design_scores_gemma":[0.00019550165,0.000026041802,0.00028337707,0.00002583357,0.000019525904,2.1928474e-7,0.00080436294,0.9291909,0.000020999361,0.055695586,0.013519496,0.00021818327],"about_ca_topic_score_codex":0.00006442823,"about_ca_topic_score_gemma":0.000011181222,"teacher_disagreement_score":0.81385714,"about_ca_system_score_codex":0.00001370386,"about_ca_system_score_gemma":0.000007583774,"threshold_uncertainty_score":0.6269905},"labels":[],"label_agreement":null},{"id":"W3005014916","doi":"","title":"A Journey through Dynamic Networks (with Excursions)","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Timeline; Period (music); Schematic; History; Visual arts; Genealogy; Library science; Art history; Art; Computer science; Engineering; Archaeology","score_opus":0.012490803208564239,"score_gpt":0.2522460310666096,"score_spread":0.23975522785804534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005014916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029902343,0.00055084145,0.87941325,0.0029236905,0.00012783508,0.00046730682,0.000045523033,0.00034259897,0.08622663],"genre_scores_gemma":[0.88888377,0.00018828016,0.103854254,0.000060819122,0.00013190607,0.00013145384,0.000992342,0.00008600685,0.0056711454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946738,0.0028658444,0.0005823623,0.00094312616,0.0004149186,0.00051997026],"domain_scores_gemma":[0.9935892,0.00068693043,0.0007715927,0.0028301866,0.0019431052,0.00017898888],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023707151,0.0005019911,0.0005864216,0.00015058872,0.00051584764,0.0005174252,0.0015305715,0.0002179568,0.0010871203],"category_scores_gemma":[0.000068992784,0.00047194885,0.0003731059,0.00053752336,0.00037921092,0.00015176533,0.001711654,0.001042241,0.00004439721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013661364,0.0046867044,0.049106434,0.00030119554,0.0034140237,0.000024575013,0.023036575,0.008164082,0.00051119295,0.60271966,0.07048596,0.23741296],"study_design_scores_gemma":[0.0018592894,0.0000037891189,0.0065221516,0.010480287,0.0010068647,0.000018847368,0.0006232765,0.6729578,0.008486298,0.18181393,0.11284011,0.0033873857],"about_ca_topic_score_codex":0.0020696556,"about_ca_topic_score_gemma":0.00119996,"teacher_disagreement_score":0.85898143,"about_ca_system_score_codex":0.00011682285,"about_ca_system_score_gemma":0.00024584663,"threshold_uncertainty_score":0.999826},"labels":[],"label_agreement":null},{"id":"W3005197571","doi":"10.1016/j.future.2020.02.023","title":"Diversified top-<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e545\" altimg=\"si6.svg\"><mml:mi>k</mml:mi></mml:math> maximal clique detection in Social Internet of Things","year":2020,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Clique; Relation (database); Equivalence relation; Equivalence (formal languages); Graph; Scalability; Theoretical computer science; Algorithm; Data mining; Database; Discrete mathematics; Mathematics; Combinatorics","score_opus":0.01706511292415001,"score_gpt":0.231583392614762,"score_spread":0.214518279690612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005197571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74895084,0.00006198922,0.24826477,0.0002034271,0.0021160466,0.00007699125,0.000020604966,0.000085935295,0.00021937887],"genre_scores_gemma":[0.9760788,0.000005657024,0.0026917944,0.00023375376,0.020509284,0.00008048846,0.0003434127,0.000037392998,0.000019430636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983283,0.00013307645,0.0005636016,0.00041206626,0.00031705532,0.00024585598],"domain_scores_gemma":[0.999087,0.000045145785,0.00045594166,0.0002555411,0.00007546069,0.00008091283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000275272,0.00021529957,0.00024330147,0.00008300464,0.00019612104,0.0002201468,0.0003029989,0.00021247144,0.000019233294],"category_scores_gemma":[0.0000050218528,0.0002514283,0.0002650859,0.0002381841,0.00004352218,0.0002762293,0.00026965764,0.00030804236,0.000049583294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058728918,0.00005602563,0.000104674946,0.000094286086,0.0001785781,0.0000092283835,0.0024676465,0.0018767212,0.0016469555,0.9825925,0.007182994,0.003731618],"study_design_scores_gemma":[0.00030512988,0.00016191778,0.00007467758,0.00006326829,0.000067345514,0.0000064804403,0.00027847945,0.985589,0.0050378656,0.000036864585,0.008180678,0.00019826763],"about_ca_topic_score_codex":0.0005347327,"about_ca_topic_score_gemma":0.00007884586,"teacher_disagreement_score":0.9837123,"about_ca_system_score_codex":0.000019790079,"about_ca_system_score_gemma":0.00006341099,"threshold_uncertainty_score":0.9999938},"labels":[],"label_agreement":null},{"id":"W3006659292","doi":"10.1007/s11134-021-09714-x","title":"The proportion of the population never hearing a rumour","year":2021,"lang":"en","type":"preprint","venue":"Queueing Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Limiting; Infinity; Constant (computer programming); Population; Mathematics; Statistics; Demography; Mathematical economics; Sociology; Computer science; Mathematical analysis; Engineering","score_opus":0.01630183490759951,"score_gpt":0.26383871107404366,"score_spread":0.24753687616644415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006659292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9758606,0.0007487996,0.019043662,0.00023912,0.0012121231,0.0010342124,0.0000076095853,0.000096006646,0.0017578747],"genre_scores_gemma":[0.99851376,0.0000036973224,0.00009997511,0.000004000325,0.0005602613,0.00010440229,0.00005233119,0.000022447228,0.00063913915],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99840564,0.0002572415,0.00055891054,0.00026202967,0.00034825844,0.00016791657],"domain_scores_gemma":[0.9982152,0.00004730488,0.00074835884,0.0008043664,0.00016414569,0.000020623227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005435648,0.0001667543,0.00032434106,0.000034640987,0.00024530434,0.00023840157,0.0003461938,0.00007567208,0.000010421828],"category_scores_gemma":[0.000010410354,0.000103390346,0.0003140896,0.00016906166,0.000027532102,0.000063930645,0.00050022756,0.00038092106,9.5299265e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008749746,0.00008851916,0.83195996,0.00046237913,0.00075110164,0.0000011898435,0.0005704946,0.047580987,0.0009898777,0.10266238,0.0011430987,0.013781238],"study_design_scores_gemma":[0.00053740665,0.000050410024,0.58565956,0.012614056,0.0011576108,0.0000105303225,0.0035452733,0.33663064,0.0069327233,0.03556034,0.015377717,0.0019237421],"about_ca_topic_score_codex":0.01408082,"about_ca_topic_score_gemma":0.0000964393,"teacher_disagreement_score":0.28904966,"about_ca_system_score_codex":0.0000779421,"about_ca_system_score_gemma":0.000082079285,"threshold_uncertainty_score":0.9924845},"labels":[],"label_agreement":null},{"id":"W3007021208","doi":"10.1109/bigdata47090.2019.9006450","title":"Predicting Influence Probabilities using Graph Convolutional Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Maximization; Computer science; Graph; Set (abstract data type); Expectation–maximization algorithm; Artificial intelligence; Machine learning; Data mining; Maximum likelihood; Theoretical computer science; Mathematical optimization; Mathematics; Statistics","score_opus":0.008868548912883046,"score_gpt":0.23782271630573865,"score_spread":0.2289541673928556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007021208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88015693,0.00002942531,0.108167924,0.000011022988,0.00004329772,0.00019090628,0.0000025348525,0.000120199365,0.011277726],"genre_scores_gemma":[0.9951393,4.932764e-7,0.0042303815,0.000033162003,0.00018957602,0.000013358747,0.000013577469,0.000010076692,0.00037005398],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917465,0.00003147282,0.00021435104,0.00021615677,0.0001305806,0.0002327937],"domain_scores_gemma":[0.99948454,0.00007148771,0.000081075596,0.0002302238,0.00009203857,0.000040624134],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014053096,0.00011386478,0.00015629236,0.00005125962,0.00009086179,0.000045281624,0.00013494628,0.000025660873,0.0011919546],"category_scores_gemma":[0.0000022238073,0.000105627056,0.00010775431,0.00021575605,0.000054585245,0.0001802757,0.00008986355,0.00012432563,0.000014742545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002245207,0.000016408181,0.82113963,0.0000029105304,0.00003940508,4.944876e-8,0.000019451669,0.1251557,0.00014521874,0.053111658,0.00010282139,0.0002645055],"study_design_scores_gemma":[0.00018293374,0.000027032354,0.040498424,0.00005082605,0.000037390248,9.2183365e-7,0.00019013353,0.9191072,0.000240961,0.03887357,0.0005247377,0.00026586792],"about_ca_topic_score_codex":0.00066329306,"about_ca_topic_score_gemma":0.000009534095,"teacher_disagreement_score":0.7939515,"about_ca_system_score_codex":0.000025139092,"about_ca_system_score_gemma":0.0000331166,"threshold_uncertainty_score":0.9997211},"labels":[],"label_agreement":null},{"id":"W3007479728","doi":"10.1145/3366030.3366077","title":"A Theoretical Approach to Discover Mutual Friendships from Social Graph Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia; University of Manitoba","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Computer science; Theoretical computer science; Graph; Graph theory; Mathematics; Combinatorics","score_opus":0.007003160054402971,"score_gpt":0.23258755549794935,"score_spread":0.2255843954435464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007479728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18917944,0.00000641183,0.53609055,0.000105611296,0.00005244506,0.00021666748,0.000017512666,0.00009741252,0.27423394],"genre_scores_gemma":[0.9937158,2.053389e-7,0.004555663,0.00019732313,0.0009137672,0.000040885232,0.00015837495,0.000024583254,0.00039339138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876094,0.00007464689,0.00021348697,0.00040698692,0.00019705748,0.00034690078],"domain_scores_gemma":[0.99940854,0.00008292698,0.00004534639,0.0003298185,0.000029315535,0.00010404409],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013160444,0.00018981795,0.00029984897,0.000056821176,0.000092589944,0.0000953715,0.0003018559,0.00005718118,0.0069550634],"category_scores_gemma":[0.000001337543,0.00015530079,0.00025059134,0.00032318057,0.00007921612,0.00008194959,0.00020493068,0.00022198005,0.00017763849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023158953,0.00012025575,0.025348354,5.98685e-7,0.00010406091,1.2012289e-7,0.00020671876,0.00048082412,0.000025113004,0.9619672,0.008967392,0.0027562107],"study_design_scores_gemma":[0.0009882175,0.00012071103,0.021797435,0.000019488109,0.00023059317,3.305434e-7,0.0015605441,0.2084689,0.00038638443,0.7547908,0.010354615,0.001281993],"about_ca_topic_score_codex":0.00018791374,"about_ca_topic_score_gemma":0.0000047464832,"teacher_disagreement_score":0.80453634,"about_ca_system_score_codex":0.000015110992,"about_ca_system_score_gemma":0.000014943252,"threshold_uncertainty_score":0.9939527},"labels":[],"label_agreement":null},{"id":"W3008920641","doi":"10.1007/978-3-030-48478-1_10","title":"Iterated Global Models for Complex Networks","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Iterated function; Node (physics); Focus (optics); Clique; Graph; Cardinality (data modeling); Chromatic scale; Computer science; Mathematics; Dominating set; Set (abstract data type); Discrete mathematics; Combinatorics; Vertex (graph theory); Data mining","score_opus":0.03591934002647342,"score_gpt":0.3052556370190101,"score_spread":0.2693362969925367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008920641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014936171,0.000092457274,0.9961184,0.0007103278,0.0004935603,0.0007401724,0.00007000629,0.00018742617,0.00009398224],"genre_scores_gemma":[0.6858704,0.0000013469522,0.31242454,0.00049213634,0.0009887576,0.00006254085,0.00014510108,0.000014961788,1.9410194e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712485,0.00006654667,0.00048797,0.0013179838,0.00035478166,0.0006478706],"domain_scores_gemma":[0.9983571,0.00019183203,0.00025296825,0.0007796732,0.00026043976,0.000157984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036755292,0.00044945566,0.0006488807,0.000138502,0.00020103238,0.0005861984,0.0017479091,0.00013820757,0.000031028005],"category_scores_gemma":[0.000011169006,0.00043842423,0.00027601095,0.0014062464,0.00027110052,0.00015056398,0.002060447,0.00061795936,0.0000019612426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000953646,0.000035748555,0.0014791924,0.000014004812,0.000028795546,0.0000013982886,0.00008696685,0.84122676,0.000026026131,0.002170839,0.00018278536,0.15473793],"study_design_scores_gemma":[0.00011799911,0.000026103164,0.00024273816,0.00006345364,0.000017010907,4.5834622e-7,1.7149242e-7,0.6365942,0.00007815371,0.36253726,0.0000506687,0.00027180157],"about_ca_topic_score_codex":0.00022182566,"about_ca_topic_score_gemma":0.000040936146,"teacher_disagreement_score":0.68437684,"about_ca_system_score_codex":0.00018271709,"about_ca_system_score_gemma":0.00028163625,"threshold_uncertainty_score":0.99980676},"labels":[],"label_agreement":null},{"id":"W3010129635","doi":"10.1007/s11761-020-00289-8","title":"Social network structure-based framework for innovation evaluation and propagation for new product development","year":2020,"lang":"en","type":"article","venue":"Service Oriented Computing and Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Popularity; Computer science; Sentiment analysis; Product (mathematics); Social network (sociolinguistics); Presentation (obstetrics); Component (thermodynamics); Maximization; Data science; Opinion leadership; Convergence (economics); New product development; Social network analysis; Social media; World Wide Web; Artificial intelligence; Marketing; Business","score_opus":0.03206852500567252,"score_gpt":0.3267701314647362,"score_spread":0.2947016064590637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010129635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049889736,0.00003536988,0.9450022,0.0030457694,0.00001562443,0.0018950729,0.0000113326805,0.00008539403,0.000019509682],"genre_scores_gemma":[0.79912686,1.0925348e-7,0.1979079,0.00039236678,0.0014597365,0.00031720195,0.0007798966,0.00001354781,0.0000023838363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991103,0.000021432239,0.0002696225,0.00033579394,0.00011036874,0.00015250444],"domain_scores_gemma":[0.99907374,0.00008462761,0.00021547056,0.000093511044,0.00048871775,0.000043941844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019578752,0.00011952302,0.00013750624,0.000036782,0.0005578677,0.000061803046,0.00006922727,0.000032656622,0.0000051269517],"category_scores_gemma":[0.000013777677,0.00012668983,0.000021425445,0.000811548,0.000012683101,0.000039320603,0.00003565857,0.00007842846,3.370172e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003834591,0.000037574264,0.0031947335,0.00011279719,0.00007894671,3.1649747e-9,0.00094856194,0.0056190584,0.0005471456,0.41844675,0.0010867142,0.56988937],"study_design_scores_gemma":[0.00091134873,0.00004370873,0.0023735631,0.000053535015,0.00017764923,8.232849e-8,0.00017375643,0.7646745,0.002418962,0.18914647,0.03971339,0.0003130663],"about_ca_topic_score_codex":0.000010781153,"about_ca_topic_score_gemma":0.0000047280396,"teacher_disagreement_score":0.7590554,"about_ca_system_score_codex":0.000019661757,"about_ca_system_score_gemma":0.00012813618,"threshold_uncertainty_score":0.5166261},"labels":[],"label_agreement":null},{"id":"W3010250604","doi":"10.1109/globecom38437.2019.9013412","title":"The Time Element of Temporal Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Reachability; Computer science; Mobile phone; Dimension (graph theory); Complex network; Phone; Sliding window protocol; Data mining; Theoretical computer science; Window (computing); Mathematics; World Wide Web","score_opus":0.003885048592400444,"score_gpt":0.22591672674111443,"score_spread":0.222031678148714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010250604","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22507137,0.00017642292,0.23610067,0.00053523056,0.00012650822,0.0007632327,0.000004532471,0.00015026363,0.53707176],"genre_scores_gemma":[0.9915443,0.0000012733759,0.00055643904,0.000016951972,0.000087619665,0.00000634011,0.000011188144,0.0000051184516,0.007770737],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995466,0.000020090685,0.00015657401,0.000079635225,0.00007879778,0.000118289485],"domain_scores_gemma":[0.9995681,0.000053878277,0.00007132689,0.0002616028,0.00002874161,0.000016370046],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000154387,0.000058007157,0.00010750865,0.000011338952,0.000037046073,0.000016056285,0.00015114226,0.000008575481,0.0030660804],"category_scores_gemma":[2.6959813e-7,0.000033997178,0.000090759815,0.00008900511,0.000017360573,0.000021452086,0.00006569544,0.000047187914,0.00008031964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016691141,0.00010118546,0.6138666,0.0000023482864,0.00024942268,9.111973e-8,0.000027365371,0.0038787574,0.0004517398,0.21469076,0.10181916,0.064895816],"study_design_scores_gemma":[0.00052595255,0.00017418478,0.009076446,0.00002694611,0.000082832295,1.5438927e-7,0.00020279098,0.6329408,0.0046391315,0.028067658,0.32385466,0.00040843323],"about_ca_topic_score_codex":0.00011255325,"about_ca_topic_score_gemma":0.0000047517296,"teacher_disagreement_score":0.76647294,"about_ca_system_score_codex":0.0000048113857,"about_ca_system_score_gemma":0.000008088213,"threshold_uncertainty_score":0.99784523},"labels":[],"label_agreement":null},{"id":"W3011191765","doi":"10.1145/3380928","title":"Continuous Influence Maximization","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Knowledge Discovery from Data","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maximization; Computer science; Benchmark (surveying); Mathematical optimization; Product (mathematics); Function (biology); Mathematics","score_opus":0.041078501605940246,"score_gpt":0.291683042845804,"score_spread":0.25060454123986375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011191765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056282673,0.00008864502,0.9383768,0.00055602775,0.00008491256,0.00019665158,0.0029392617,0.00017021415,0.001304808],"genre_scores_gemma":[0.99262077,0.00001625906,0.0041850586,0.00016798158,0.00025764445,0.000026138083,0.0025026042,0.000026966292,0.00019660586],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876577,0.00006299142,0.00027702836,0.0005761653,0.00013015933,0.00018790377],"domain_scores_gemma":[0.997926,0.00016317054,0.00008436337,0.0016677661,0.000058553655,0.00010017585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058887377,0.00019579357,0.00025455683,0.000051105326,0.00015323736,0.00016609448,0.0013439509,0.00003772815,0.0007697274],"category_scores_gemma":[0.000017470442,0.00019789033,0.00009920794,0.00040077118,0.00005185266,0.0010157361,0.00009347358,0.00022884949,0.0002676182],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044309063,0.002973827,0.04091348,0.00005839509,0.0023363184,0.000011894092,0.0029351695,0.016830951,0.008597204,0.0058334568,0.049735263,0.86933094],"study_design_scores_gemma":[0.008153361,0.0011123453,0.03485236,0.0008486583,0.004612334,0.0000031645536,0.0037516528,0.31522366,0.08678443,0.09504409,0.4429159,0.0066980426],"about_ca_topic_score_codex":0.00034387654,"about_ca_topic_score_gemma":0.000058088324,"teacher_disagreement_score":0.93633807,"about_ca_system_score_codex":0.000018437564,"about_ca_system_score_gemma":0.000056318957,"threshold_uncertainty_score":0.8427975},"labels":[],"label_agreement":null},{"id":"W3011894245","doi":"10.18280/ijdne.150103","title":"Dimension Reduction for Network Systems Using Structure Model Aggregation","year":2020,"lang":"en","type":"article","venue":"International Journal of Design & Nature and Ecodynamics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Reduction (mathematics); Dimension (graph theory); Computer science; Dimensionality reduction; Mathematics; Biological system; Artificial intelligence; Pure mathematics; Geometry; Biology","score_opus":0.018819054618100326,"score_gpt":0.27494790238927974,"score_spread":0.2561288477711794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011894245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09569519,0.000416088,0.9027058,0.00039801947,0.0005915484,0.00014068425,0.000023599156,0.000010328504,0.000018735964],"genre_scores_gemma":[0.9360212,0.000020356543,0.061343316,0.00006954508,0.0024851596,0.0000013051739,0.000035508216,0.000013759767,0.000009862547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918115,0.000035027395,0.00034380553,0.00012524614,0.00020994824,0.00010479439],"domain_scores_gemma":[0.99891007,0.000048953607,0.0004673861,0.000051869483,0.0004595864,0.00006212456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001684855,0.000111919275,0.00019534533,0.00007807464,0.000070469185,0.00009441615,0.00016171779,0.000088764,0.0000062122126],"category_scores_gemma":[0.000011536908,0.00009971384,0.00010772633,0.00009975687,0.0000145891945,0.0002336551,0.000030673607,0.00029296396,9.929919e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017714775,0.000014479666,0.00049043284,0.000006363518,0.0002810528,0.0000012815663,0.000101795515,0.97792464,0.0042327875,0.010438386,0.002389653,0.0039419536],"study_design_scores_gemma":[0.000282779,0.000054543292,0.00001779242,0.00006477782,0.00009610371,0.00002022574,0.000047626276,0.97062194,0.00029137114,0.028114421,0.0002961515,0.00009225364],"about_ca_topic_score_codex":0.0000046731557,"about_ca_topic_score_gemma":5.253312e-7,"teacher_disagreement_score":0.8413625,"about_ca_system_score_codex":0.000053485717,"about_ca_system_score_gemma":0.0000519633,"threshold_uncertainty_score":0.40662125},"labels":[],"label_agreement":null},{"id":"W3012286460","doi":"10.65109/lvjf2437","title":"Leveraging Communication Topologies Between Learning Agents in Deep Reinforcement Learning","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Network topology; Computer science; Reinforcement learning; Artificial intelligence; Machine learning; Benchmark (surveying); Distributed computing; Topology (electrical circuits); Theoretical computer science; Mathematics; Computer network","score_opus":0.07488800774223038,"score_gpt":0.3339669271243948,"score_spread":0.25907891938216443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012286460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16381492,0.00028855444,0.7382939,0.0011554955,0.000056462668,0.00068822486,8.702455e-7,0.0007280165,0.094973594],"genre_scores_gemma":[0.9948359,0.00010789165,0.00324079,0.00003617927,0.00017407975,0.00008412455,0.00080444437,0.000030263729,0.0006863044],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812406,0.00032517078,0.00058495987,0.00044446022,0.00021527697,0.00030605673],"domain_scores_gemma":[0.99881494,0.00016383914,0.0003970633,0.0005102313,0.000054523625,0.00005937362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038769664,0.00029927926,0.0005446746,0.00017469752,0.00019316272,0.00015589462,0.00066154706,0.000105793704,0.0008671971],"category_scores_gemma":[0.000024786794,0.00032574983,0.00020847481,0.00020653984,0.00004320486,0.00007648077,0.0027083585,0.0019708287,0.00002903915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040838254,0.00001622943,0.6167932,0.000028751701,0.0002148145,9.653223e-7,0.0015734986,0.35378632,0.000010918967,0.0032726014,0.0004450444,0.023853542],"study_design_scores_gemma":[0.0007380288,0.00010074357,0.07504467,0.0006909535,0.0003346098,1.7976163e-7,0.006979928,0.8007641,0.0009974273,0.09042191,0.022194596,0.0017328634],"about_ca_topic_score_codex":0.0026718408,"about_ca_topic_score_gemma":0.000022545128,"teacher_disagreement_score":0.831021,"about_ca_system_score_codex":0.00013653864,"about_ca_system_score_gemma":0.000041069827,"threshold_uncertainty_score":0.9999195},"labels":[],"label_agreement":null},{"id":"W3012968732","doi":"10.18280/jesa.520105","title":"Selection of Significant Community Structure Based on Network Partition-based Cluster","year":2019,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Partition (number theory); Community structure; Cluster (spacecraft); Selection (genetic algorithm); Computer science; Network structure; Data mining; Artificial intelligence; Statistics; Mathematics; Machine learning; Computer network; Combinatorics","score_opus":0.012675017440291642,"score_gpt":0.24978589466482748,"score_spread":0.23711087722453583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012968732","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93545425,0.000016862205,0.059984215,0.00008447837,0.00018284208,0.00035342874,0.000034132296,0.00014062352,0.0037491382],"genre_scores_gemma":[0.9925912,6.795957e-7,0.0067391833,0.00013958135,0.000343788,0.0000073368806,0.000040461724,0.000040048184,0.000097732925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739,0.0010773286,0.00063162897,0.00016859041,0.00039416263,0.00033829847],"domain_scores_gemma":[0.9981393,0.000388509,0.00068567245,0.0004188351,0.000257267,0.0001103997],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00067188207,0.00024756827,0.00046174455,0.00017433602,0.00039141378,0.0001308239,0.00032573583,0.000058792248,0.0023152174],"category_scores_gemma":[0.000016773789,0.0002100088,0.00028288818,0.0005112729,0.000070261725,0.00012986608,0.000040848536,0.0007112553,0.000028178383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015330332,0.0004375578,0.35931548,0.00016588473,0.00031889923,0.0000029585044,0.00013627418,0.5784554,0.004673587,0.0027675405,0.01120749,0.042365614],"study_design_scores_gemma":[0.00082015933,0.0005393864,0.35692278,0.0005662699,0.00012848822,0.000005859636,0.0000545145,0.62521046,0.0030274936,0.01183537,0.0005747377,0.00031447434],"about_ca_topic_score_codex":0.00013940354,"about_ca_topic_score_gemma":0.000022584692,"teacher_disagreement_score":0.05713691,"about_ca_system_score_codex":0.00011838587,"about_ca_system_score_gemma":0.00015043616,"threshold_uncertainty_score":0.9985968},"labels":[],"label_agreement":null},{"id":"W3014768785","doi":"10.36227/techrxiv.12061662.v1","title":"Identifying Social Media Influencers using Graph Analytics","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Influencer marketing; Social media; Computer science; Social network analysis; Graph; Analytics; Information sharing; Data science; Social network (sociolinguistics); Social media analytics; World Wide Web; Data mining; Theoretical computer science; Business","score_opus":0.10580329986459262,"score_gpt":0.347804998868497,"score_spread":0.24200169900390434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014768785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19487154,0.00008853092,0.78735113,0.00029252536,0.00044368356,0.00036179874,0.00009101597,0.0005353359,0.015964441],"genre_scores_gemma":[0.9802709,0.0000046240825,0.017771635,0.00006725049,0.0016171664,0.000013495526,0.00019144549,0.00003930759,0.00002416248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825585,0.000064163585,0.0004894286,0.00054364256,0.00034383452,0.00030306683],"domain_scores_gemma":[0.9990062,0.00006498871,0.0003552081,0.00034867038,0.00011811928,0.00010678571],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014179319,0.00033756692,0.00059277046,0.00021016371,0.00017919899,0.00026043828,0.00053441967,0.00012978725,0.0009274458],"category_scores_gemma":[0.0000070905085,0.00036113872,0.0006338138,0.00045942763,0.00008648311,0.00007413345,0.0012178422,0.0007389956,0.000015707292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007753773,0.0005360029,0.2511013,0.00074888824,0.014231466,0.00006472346,0.017323172,0.049813107,0.0072444463,0.4938509,0.078103416,0.08690508],"study_design_scores_gemma":[0.00025781195,0.0000068119984,0.0039866287,0.00016059121,0.001542092,3.291137e-7,0.0013700767,0.09466545,0.0012996695,0.8943211,0.0010245199,0.0013649025],"about_ca_topic_score_codex":0.000774679,"about_ca_topic_score_gemma":0.000042632946,"teacher_disagreement_score":0.7853994,"about_ca_system_score_codex":0.00007838731,"about_ca_system_score_gemma":0.00014534092,"threshold_uncertainty_score":0.9999858},"labels":[],"label_agreement":null},{"id":"W3014986256","doi":"10.18280/isi.250112","title":"Incentive Mechanism for P2P Networks Based on Feature Weighting and Game Theory","year":2020,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hunan University","keywords":"Incentive; Mechanism (biology); Weighting; Game theory; Computer science; Feature (linguistics); Microeconomics; Economics; Physics","score_opus":0.009652548595580259,"score_gpt":0.22282530796262603,"score_spread":0.21317275936704577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014986256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014601364,0.000020344749,0.9784367,0.00018916554,0.000048027538,0.00045618287,0.000031577478,0.0001430138,0.0060735936],"genre_scores_gemma":[0.9932779,0.0000021433837,0.0052727773,0.00083184126,0.00025008665,0.00010035844,0.0002357565,0.000013533994,0.000015585902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992076,0.000054338776,0.0002697754,0.00013647937,0.000117370975,0.00021439228],"domain_scores_gemma":[0.99925005,0.00014651558,0.00024638092,0.00012886492,0.00015136198,0.00007681558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022030139,0.00017029804,0.00020919919,0.00007690826,0.00020062432,0.00017588542,0.00011533984,0.00006113069,0.000036161673],"category_scores_gemma":[0.0000361866,0.00015767764,0.00009962071,0.00021557085,0.000043835065,0.0005786622,0.000048575243,0.00014991894,0.000005229873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024883036,0.000028776889,0.0019998788,0.00014758974,0.00015075039,4.0703023e-7,0.0037044527,0.0061262096,0.00008144541,0.70289165,0.0023372856,0.2822827],"study_design_scores_gemma":[0.00047442387,0.00014779074,0.0003610606,0.00012137607,0.000058191286,2.5841877e-7,0.0006375075,0.91504186,0.0013888406,0.079209164,0.0023161857,0.0002433105],"about_ca_topic_score_codex":0.000008858287,"about_ca_topic_score_gemma":6.731271e-7,"teacher_disagreement_score":0.97867656,"about_ca_system_score_codex":0.000048199076,"about_ca_system_score_gemma":0.000022909362,"threshold_uncertainty_score":0.64299077},"labels":[],"label_agreement":null},{"id":"W3015265379","doi":"10.48550/arxiv.2004.03016","title":"Graph Distances and Clustering","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Jaccard index; Vertex (graph theory); Cluster (spacecraft); Geodesic; Partition (number theory); Combinatorics; Cluster analysis; Mathematics; Graph; Computer science; Statistics; Geometry","score_opus":0.06044074658742093,"score_gpt":0.19195402147761045,"score_spread":0.13151327489018952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015265379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32272163,0.000095298186,0.6645551,0.000082517225,0.000087173954,0.00019213888,0.000042140025,0.00019495474,0.012029105],"genre_scores_gemma":[0.9988294,0.000057771267,0.00053970836,0.000020704005,0.00017121182,9.618734e-7,0.000045344892,0.000016856182,0.0003180309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989865,0.00004697859,0.0001267739,0.0006233406,0.000037253674,0.0001791842],"domain_scores_gemma":[0.9993023,0.000034827088,0.00014920444,0.0003663336,0.000036222184,0.00011107989],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00005364775,0.00022527388,0.0003097816,0.00008795623,0.00010386619,0.00006934033,0.0003394528,0.00006258497,0.00012559886],"category_scores_gemma":[0.0000014102261,0.0002660775,0.00018824832,0.00024678317,0.00009109013,0.00007629611,0.0010337381,0.00034951896,0.000008259869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001230097,0.00016688189,0.2497325,0.00027305778,0.0015189804,0.00015246942,0.00057056395,0.08929588,0.00014488367,0.64435667,0.0038332301,0.009831887],"study_design_scores_gemma":[0.0003582296,0.000034608118,0.0033793282,0.00015274496,0.00044985456,3.9690252e-7,0.00036149073,0.31323227,0.00009638418,0.67745805,0.003658097,0.0008185444],"about_ca_topic_score_codex":0.00029283002,"about_ca_topic_score_gemma":0.00006148264,"teacher_disagreement_score":0.6761078,"about_ca_system_score_codex":0.00002705316,"about_ca_system_score_gemma":0.00002561849,"threshold_uncertainty_score":0.99997914},"labels":[],"label_agreement":null},{"id":"W3015626305","doi":"10.22452/mjlis.vol25no1.7","title":"Macro-level collaboration network analysis and visualization with Essential Science Indicators: A case of social science","year":2020,"lang":"en","type":"article","venue":"Malaysian Journal of Library & Information Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; China Scholarship Council; National Natural Science Foundation of China","keywords":"Betweenness centrality; Centrality; Social network analysis; Field (mathematics); Clustering coefficient; Cluster analysis; Data science; Ranking (information retrieval); Regional science; Network science; Computer science; Network analysis; Similarity (geometry); Macro; Social network (sociolinguistics); Internationalization; Complex network; Average path length; Geography; World Wide Web; Information retrieval; Shortest path problem; Statistics; Business; Social media; Graph; Mathematics","score_opus":0.006711227098889307,"score_gpt":0.2646125725971509,"score_spread":0.25790134549826155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015626305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79103726,0.0000061884575,0.20625485,0.00032879604,0.000029864235,0.00011368598,0.000015536063,0.000017365524,0.0021964489],"genre_scores_gemma":[0.9906933,0.0000019874701,0.009017165,0.00011382033,0.00015779649,0.0000017848394,0.000007733284,0.0000040748523,0.0000023906691],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782586,0.0000370854,0.0007115161,0.0001802883,0.0009775722,0.00026765923],"domain_scores_gemma":[0.99754643,0.000024519552,0.0013583046,0.00013571291,0.0006894441,0.000245564],"candidate_categories":["bibliometrics","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012028514,0.000121049365,0.000281866,0.0016844386,0.00074459566,0.00087940204,0.00063530786,0.000017713803,0.0001068191],"category_scores_gemma":[0.000033730917,0.00010085642,0.0000700326,0.026222767,0.0019364568,0.016743358,0.00021606343,0.00012155099,9.937554e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002804906,0.00012799678,0.5416594,0.00006446725,0.00033197727,0.000030397532,0.03283588,0.019632345,0.008830978,0.36178267,0.000609828,0.033813547],"study_design_scores_gemma":[0.0022294056,0.0012819342,0.26276642,0.00015332701,0.0014428716,0.00028522732,0.021402813,0.5703717,0.13390511,0.0032312484,0.0016566621,0.0012732806],"about_ca_topic_score_codex":0.000005383273,"about_ca_topic_score_gemma":4.5663612e-7,"teacher_disagreement_score":0.55073935,"about_ca_system_score_codex":0.000030493075,"about_ca_system_score_gemma":0.001411356,"threshold_uncertainty_score":0.9970089},"labels":[],"label_agreement":null},{"id":"W3015885778","doi":"10.1007/978-3-030-45439-5_49","title":"Temporal Latent Space Modeling for Community Prediction","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"","keywords":"Computer science; Space (punctuation); Representation (politics); User modeling; Data mining; Machine learning; Probabilistic latent semantic analysis; Artificial intelligence; Information retrieval; User interface","score_opus":0.036437812354549584,"score_gpt":0.2669184827698297,"score_spread":0.23048067041528014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015885778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033205084,0.00004695094,0.9968733,0.000329205,0.0002162034,0.00041737143,0.000036282225,0.000116424555,0.001632183],"genre_scores_gemma":[0.87015724,0.0000021390472,0.1286508,0.00014881026,0.0008226119,0.000017470267,0.00009942811,0.000028955175,0.00007253241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852896,0.00003057037,0.00033814422,0.00051497214,0.00030551356,0.00028184277],"domain_scores_gemma":[0.99885094,0.00016747828,0.00016870958,0.0005671205,0.00015547649,0.0000902576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046414015,0.0003039231,0.00039938986,0.00020724948,0.00033874504,0.00015075796,0.00078214484,0.0000997131,0.000026401625],"category_scores_gemma":[0.000008768014,0.00029454508,0.0001946852,0.00020068994,0.00017085091,0.0001249738,0.00047330267,0.0008390909,0.000003951721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023943727,0.00006669061,0.0018427889,0.000053530905,0.0000828998,0.000002222877,0.0007359107,0.6906712,0.00011428513,0.029144583,0.00019662778,0.27706534],"study_design_scores_gemma":[0.0000906541,0.000071375194,0.0000089792475,0.00010809517,0.000021484646,4.642284e-7,3.1501742e-7,0.73847973,0.00014827841,0.2603597,0.000519699,0.00019124328],"about_ca_topic_score_codex":0.00020965008,"about_ca_topic_score_gemma":0.000056775425,"teacher_disagreement_score":0.8698252,"about_ca_system_score_codex":0.00011325195,"about_ca_system_score_gemma":0.00013726918,"threshold_uncertainty_score":0.99995065},"labels":[],"label_agreement":null},{"id":"W3016083451","doi":"10.1061/(asce)hz.2153-5515.0000493","title":"Network-of-Networks Framework for Multimodal Hazmat Transportation Risk Mitigation: Application to Used Nuclear Fuel in Canada","year":2020,"lang":"en","type":"article","venue":"Journal of Hazardous Toxic and Radioactive Waste","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McMaster University","funders":"","keywords":"Interdependence; Flow network; Hazardous waste; Process (computing); Transport engineering; Risk analysis (engineering); Computer science; Complex network; Shortest path problem; Multimodal transport; Operations research; Transportation planning; Engineering; Business; Graph; Mathematical optimization","score_opus":0.006826101723053881,"score_gpt":0.2279676396068823,"score_spread":0.22114153788382843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016083451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40451777,0.0001605182,0.594435,0.00048042307,0.00005221452,0.00029236323,0.00003440252,0.000005088531,0.00002225179],"genre_scores_gemma":[0.9705779,0.000026918373,0.028506752,0.00012573761,0.00071442424,0.000013905871,0.000011856942,0.000020905316,0.0000016017136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880064,0.00006303007,0.0005733193,0.0001783891,0.00018875375,0.00019590015],"domain_scores_gemma":[0.99873734,0.00020396482,0.0006474247,0.0001011854,0.00014237709,0.00016769663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019107819,0.00014924764,0.00045603863,0.00005055456,0.00007088445,0.000019639308,0.0001408154,0.00004932224,0.000017275688],"category_scores_gemma":[0.000012580313,0.00014016632,0.00013573536,0.0003128441,0.000026900154,0.000114988434,0.000009839978,0.0002940884,1.8913889e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012457238,0.00015787377,0.1396736,0.00007970529,0.0007921869,0.000009432539,0.0043701134,0.7427064,0.0010728951,0.010010482,0.003471208,0.09641036],"study_design_scores_gemma":[0.0038172295,0.0011029462,0.06412005,0.00052015897,0.0008585421,0.0000069246807,0.0070804637,0.88310754,0.002127743,0.03181031,0.004495102,0.0009529714],"about_ca_topic_score_codex":0.01384121,"about_ca_topic_score_gemma":0.015730005,"teacher_disagreement_score":0.5660601,"about_ca_system_score_codex":0.00011692929,"about_ca_system_score_gemma":0.0001734556,"threshold_uncertainty_score":0.99272573},"labels":[],"label_agreement":null},{"id":"W3017050587","doi":"10.48550/arxiv.2004.07150","title":"Provable Overlapping Community Detection in Weighted Graphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.0646322187262638,"score_gpt":0.1992809641976748,"score_spread":0.13464874547141098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017050587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88982517,0.000013078337,0.09993887,0.000023493556,0.000094651215,0.0003866163,0.000017590251,0.00023186984,0.009468679],"genre_scores_gemma":[0.9993112,0.000013840517,0.00023231932,0.000020460599,0.000078666526,0.0000039959723,0.00010151099,0.000025103136,0.00021287748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985052,0.00037685144,0.00023884283,0.00053830625,0.000059509548,0.00028134137],"domain_scores_gemma":[0.9987499,0.00007028128,0.00025767752,0.0007454963,0.00008052557,0.00009611951],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023052421,0.00029634844,0.00044220188,0.00031279394,0.00021725165,0.000058772523,0.0006366763,0.0001435549,0.0001418603],"category_scores_gemma":[0.0000048180405,0.00038142886,0.0003048413,0.0010058808,0.000068356276,0.00013803177,0.0010556501,0.0016471755,0.000021097856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042309792,0.0017940782,0.383662,0.0005299039,0.0021317874,0.00017687501,0.0019207537,0.09357292,0.0039501055,0.4913747,0.0015328658,0.018930923],"study_design_scores_gemma":[0.00051597494,0.000050550443,0.0068928683,0.00017161616,0.00020177347,2.580815e-7,0.0004801779,0.33170637,0.0012479367,0.6573883,0.00070805213,0.0006360828],"about_ca_topic_score_codex":0.006541227,"about_ca_topic_score_gemma":0.000751704,"teacher_disagreement_score":0.37676913,"about_ca_system_score_codex":0.00017175933,"about_ca_system_score_gemma":0.000071911134,"threshold_uncertainty_score":0.99986374},"labels":[],"label_agreement":null},{"id":"W3022704812","doi":"10.1002/cplx.20239","title":"A synthesis and a practical approach to complex systems","year":2008,"lang":"en","type":"article","venue":"Complexity","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Causation; Complex system; Management science; Data science; Epistemology; Artificial intelligence; Engineering; Philosophy","score_opus":0.13859904077432939,"score_gpt":0.32039500555137956,"score_spread":0.18179596477705018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022704812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44816616,0.000056887373,0.42822433,0.0005600283,0.00005429549,0.00079087727,0.00008566738,0.00033307393,0.121728696],"genre_scores_gemma":[0.9654964,0.0000015071868,0.033874355,0.00007230586,0.00024337148,0.00013745906,0.000022983608,0.00001826766,0.00013334186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998713,0.00013626934,0.0002602592,0.000385716,0.00020548662,0.0002992669],"domain_scores_gemma":[0.99903136,0.00017885689,0.00008165912,0.0004206533,0.00007554752,0.00021190553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001929346,0.00018867655,0.00040835576,0.00008648565,0.0003030389,0.0000655666,0.00014266968,0.000028931061,0.00017816834],"category_scores_gemma":[0.0000233482,0.00017886578,0.00009294814,0.0002757562,0.00020076778,0.00008397744,0.00021569077,0.00014561505,0.000035629626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008135053,0.0013112607,0.08200694,0.00006927362,0.00045396696,0.000018692475,0.0010473081,0.00020046308,0.0007098901,0.7626778,0.14641646,0.0050066207],"study_design_scores_gemma":[0.0011705017,0.0002527662,0.36521006,0.00013674934,0.00035961173,0.00052379665,0.0018342456,0.30486286,0.0010116932,0.039938983,0.2819915,0.002707219],"about_ca_topic_score_codex":0.00071871775,"about_ca_topic_score_gemma":0.000004629468,"teacher_disagreement_score":0.7227388,"about_ca_system_score_codex":0.000027761445,"about_ca_system_score_gemma":0.000032685635,"threshold_uncertainty_score":0.7293935},"labels":[],"label_agreement":null},{"id":"W3024970747","doi":"10.1007/s13278-020-00644-9","title":"A new approach for affinity relationship discovery in online forums","year":2020,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université de Sherbrooke","funders":"","keywords":"Context (archaeology); Markov chain; Computer science; Affinity maturation; Machine learning; Data mining; Chemistry; Biology","score_opus":0.042267124648456215,"score_gpt":0.2959836247082475,"score_spread":0.2537165000597913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024970747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13866407,0.0001224977,0.8587719,0.0005340075,0.0000120867635,0.00019501176,0.000026669552,0.000040857893,0.0016328996],"genre_scores_gemma":[0.9383785,0.0000038018345,0.05911412,0.00013078278,0.0016175999,0.000024888324,0.0005151462,0.000014753387,0.0002004181],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881023,0.00007253766,0.000348612,0.0003596569,0.00010510818,0.0003038325],"domain_scores_gemma":[0.9994153,0.00019249987,0.00016664047,0.00010326719,0.000027086548,0.000095232586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026329316,0.00015701565,0.00050570455,0.000098831166,0.00027144176,0.00010590291,0.0001223927,0.000056294077,0.000044096672],"category_scores_gemma":[0.000016772447,0.00016066285,0.00038987433,0.0017305905,0.000027108224,0.00013654782,0.00008650778,0.00016016682,4.238368e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043552038,0.000059598526,0.9318051,0.000008292334,0.00083592266,2.8273004e-7,0.0014423613,0.012185342,0.0000045839024,0.021565594,0.006414501,0.025634916],"study_design_scores_gemma":[0.0017729442,0.00009716688,0.26927006,0.000031302763,0.004866997,1.2202902e-7,0.007020226,0.6765735,0.000008835879,0.03503321,0.004305185,0.0010204278],"about_ca_topic_score_codex":0.00024213309,"about_ca_topic_score_gemma":0.00029332974,"teacher_disagreement_score":0.79971445,"about_ca_system_score_codex":0.000015773807,"about_ca_system_score_gemma":0.000040219125,"threshold_uncertainty_score":0.65516406},"labels":[],"label_agreement":null},{"id":"W3028931584","doi":"10.26181/5fc6ede2dafd9","title":"A Data-Driven Network Model for the Emerging COVID-19 Epidemics in Wuhan, Toronto and Italy","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Canadian Institutes of Health Research; La Trobe University; York University; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Pandemic; Megacity; Markov chain Monte Carlo; Transmission (telecommunications); Coronavirus disease 2019 (COVID-19); Public health; China; Geography; Node (physics); Markov chain; Epidemic model; Computer science; Environmental health; Medicine; Disease; Engineering; Telecommunications; Economics; Infectious disease (medical specialty); Bayesian probability; Artificial intelligence; Machine learning; Population","score_opus":0.2039801584160996,"score_gpt":0.2787630538240802,"score_spread":0.07478289540798058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028931584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008597149,0.00040174142,0.98868334,0.00059138064,0.00006719612,0.0007172042,0.0002813503,0.00009960372,0.0005610049],"genre_scores_gemma":[0.9947274,0.00029806804,0.0036209605,0.0002870166,0.00039052774,0.000009834806,0.0004048321,0.000032309697,0.00022909955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981453,0.000104291954,0.00029086688,0.0010368066,0.00005663515,0.0003661115],"domain_scores_gemma":[0.99780566,0.00045682222,0.00029188866,0.0012023496,0.00005145848,0.00019181176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004469894,0.00031361854,0.0004995871,0.000048386708,0.00022730361,0.000066573455,0.0013382016,0.00011386943,0.00004711966],"category_scores_gemma":[0.000030353967,0.00031549518,0.00020274617,0.00023972375,0.00009018364,0.00020170334,0.0029731763,0.00043551225,0.0000015614282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044007284,0.000023569124,0.013282486,0.000042832176,0.00025437403,0.0000053994013,0.00020739021,0.8931368,0.0000011448958,0.08483363,0.007622773,0.00054562016],"study_design_scores_gemma":[0.00025766864,0.000008650089,0.00009688175,0.00003688258,0.0003043264,1.1985325e-7,0.00025216874,0.85562205,3.0365132e-7,0.1391999,0.003951748,0.0002693075],"about_ca_topic_score_codex":0.0032374493,"about_ca_topic_score_gemma":0.0053283935,"teacher_disagreement_score":0.9861302,"about_ca_system_score_codex":0.00022793491,"about_ca_system_score_gemma":0.00022259649,"threshold_uncertainty_score":0.9999297},"labels":[],"label_agreement":null},{"id":"W3032915873","doi":"10.1016/j.joi.2020.101041","title":"Early-stage reciprocity in sustainable scientific collaboration","year":2020,"lang":"en","type":"article","venue":"Journal of Informetrics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Population and Public Health; China Postdoctoral Science Foundation; King Saud University","keywords":"Reciprocity (cultural anthropology); Sustainability; Teamwork; Altruism (biology); Sustainable development; Computer science; Knowledge management; Business; Political science; Sociology; Economics; Psychology; Management; Social psychology; Social science","score_opus":0.017741395700650812,"score_gpt":0.27440477691771387,"score_spread":0.25666338121706306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032915873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9585823,0.00007071118,0.031953946,0.00035562395,0.000078422585,0.00014259314,0.000004804761,0.000013013325,0.008798577],"genre_scores_gemma":[0.9960714,0.0000054128286,0.0029852786,0.00005645227,0.0001835084,0.0000014729442,0.0000041919243,0.000005600501,0.00068667694],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883884,0.000023213724,0.0005365516,0.000078630896,0.00033275434,0.00019003525],"domain_scores_gemma":[0.9985138,0.00006193089,0.0004960751,0.00009598664,0.00072996155,0.00010225042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007177897,0.00007856038,0.00021380378,0.0006826236,0.00008413639,0.0002766599,0.00022354335,0.000027440297,0.00012862355],"category_scores_gemma":[0.00019004961,0.00007095079,0.00009824798,0.0057001286,0.00002818584,0.0007429281,0.00006349855,0.0002492592,0.0000064397723],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018065648,0.0002649607,0.8275644,0.00008510716,0.0001452885,0.000049140934,0.005054066,0.005948918,0.00044879076,0.07810176,0.03944029,0.0427166],"study_design_scores_gemma":[0.0027046797,0.0010731223,0.07065767,0.00008227421,0.00011853847,0.0000027767894,0.015661849,0.018292792,0.009268406,0.012416641,0.868996,0.0007252058],"about_ca_topic_score_codex":0.000051902753,"about_ca_topic_score_gemma":0.0000040408418,"teacher_disagreement_score":0.82955575,"about_ca_system_score_codex":0.00010037732,"about_ca_system_score_gemma":0.0002521278,"threshold_uncertainty_score":0.2893289},"labels":[],"label_agreement":null},{"id":"W3033055443","doi":"10.48550/arxiv.2006.02643","title":"Universal Graph Compression: Stochastic Block Models","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Lossless compression; Adjacency matrix; Computer science; Stochastic block model; Theoretical computer science; Data compression; Graph; Cluster analysis; Algorithm; Data mining; Artificial intelligence","score_opus":0.08069557717156832,"score_gpt":0.19888259330709246,"score_spread":0.11818701613552414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033055443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07170051,0.00003970565,0.91048867,0.000110279834,0.00016529563,0.00039404075,0.00010543561,0.0004179033,0.01657816],"genre_scores_gemma":[0.9982373,0.00001155107,0.0004825834,0.000033335706,0.00031021645,0.0000016705965,0.0001632181,0.000044288983,0.000715849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803144,0.00013117363,0.00024507983,0.0010984901,0.00011469333,0.00037912178],"domain_scores_gemma":[0.998268,0.00006885516,0.000320802,0.0009189479,0.00014720889,0.00027615917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0000714053,0.00047276999,0.00060900155,0.00024258172,0.00019876497,0.000070421745,0.0010587479,0.00017491537,0.00036846253],"category_scores_gemma":[0.0000019252184,0.00056981895,0.0005823722,0.0006011277,0.00014612523,0.00016832282,0.0018383587,0.0009175374,0.000052219846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004318577,0.000092296126,0.0005240608,0.000018448414,0.0003853743,0.000046137626,0.00010440082,0.80244017,0.00001977076,0.19337401,0.0027404665,0.0002116924],"study_design_scores_gemma":[0.00030926135,0.0000226323,0.000054670643,0.000092732495,0.00038197212,3.453594e-7,0.0001738823,0.6287218,0.000023684579,0.3695082,0.00024468338,0.00046613382],"about_ca_topic_score_codex":0.00044698405,"about_ca_topic_score_gemma":0.000014084399,"teacher_disagreement_score":0.9265368,"about_ca_system_score_codex":0.00010143618,"about_ca_system_score_gemma":0.0001401654,"threshold_uncertainty_score":0.99967533},"labels":[],"label_agreement":null},{"id":"W3033367644","doi":"10.1007/978-3-030-48478-1_4","title":"A Scalable Unsupervised Framework for Comparing Graph Embeddings","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Graph embedding; Embedding; Scalability; Theoretical computer science; Graph; Vertex (graph theory); Topological graph theory; Artificial intelligence; Voltage graph; Line graph","score_opus":0.02260866034069164,"score_gpt":0.27252359084416317,"score_spread":0.24991493050347152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033367644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016145493,0.0001266796,0.99410635,0.00032167128,0.00027138478,0.00051582983,0.000012903546,0.00014873449,0.004334973],"genre_scores_gemma":[0.51222825,0.0000032319474,0.48607284,0.00045445716,0.0010567448,0.00003090471,0.000030943687,0.00004951651,0.000073112686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744534,0.000013762172,0.0004564167,0.0011178813,0.0004338433,0.00053275836],"domain_scores_gemma":[0.9982809,0.00047946375,0.00024171884,0.00067132595,0.00016691905,0.00015971473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031271885,0.00047641416,0.0007743636,0.00038802877,0.00026938732,0.00034073956,0.0013059197,0.00016215439,0.00013467764],"category_scores_gemma":[0.000020457699,0.0004702778,0.000342849,0.0005615624,0.00036136957,0.00014807816,0.00057917077,0.0007764486,0.000014974701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034485653,0.00006604219,0.003327637,0.00009648546,0.00015934372,0.000009309929,0.0006104651,0.036115464,0.00014168608,0.5485757,0.00041181687,0.41045156],"study_design_scores_gemma":[0.00012955195,0.000053652777,0.000022567967,0.00033863253,0.00003439911,6.6634243e-7,3.2059557e-7,0.2938038,0.00054211426,0.7030724,0.0015913084,0.00041053485],"about_ca_topic_score_codex":0.000039089762,"about_ca_topic_score_gemma":0.000013810513,"teacher_disagreement_score":0.5120668,"about_ca_system_score_codex":0.0000903665,"about_ca_system_score_gemma":0.00014978605,"threshold_uncertainty_score":0.9997749},"labels":[],"label_agreement":null},{"id":"W3033386295","doi":"10.1103/physreve.101.062302","title":"Thresholding normally distributed data creates complex networks","year":2020,"lang":"en","type":"article","venue":"Physical review. E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Army Research Office; Multidisciplinary University Research Initiative","keywords":"Thresholding; Computer science; Artificial intelligence; Image (mathematics)","score_opus":0.08022044107650235,"score_gpt":0.36491533690863215,"score_spread":0.2846948958321298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033386295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028632944,0.012609553,0.9162895,0.0139101315,0.00009286458,0.0019583718,0.0012011833,0.0010883312,0.024217134],"genre_scores_gemma":[0.9923517,0.0005424349,0.0008010435,0.0014536656,0.001449975,0.00003004152,0.0033364007,0.000028339275,0.000006395663],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984196,0.000086501146,0.0003705949,0.00053124764,0.00023026648,0.00036183078],"domain_scores_gemma":[0.9984985,0.0001412568,0.00017787864,0.00089127314,0.00007055073,0.00022053403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015254774,0.0002633945,0.0006763209,0.000012185867,0.00012211646,0.0000760286,0.0010482763,0.000015272997,0.000635374],"category_scores_gemma":[0.000030993986,0.00022653687,0.00024716972,0.00055170973,0.00005909085,0.00022927542,0.0008040986,0.00029201678,0.00009852308],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004054012,0.00072410965,0.052083254,0.00054012064,0.0008755045,0.000011579237,0.00009342085,0.0022782986,0.0018211157,0.10249563,0.6974476,0.1415888],"study_design_scores_gemma":[0.00025252247,0.00007163972,0.002840069,0.00051152,0.00057614624,4.733961e-7,0.000014776369,0.76824594,0.00021637628,0.007831735,0.21882103,0.00061776285],"about_ca_topic_score_codex":0.000049160168,"about_ca_topic_score_gemma":0.0000015449242,"teacher_disagreement_score":0.9637188,"about_ca_system_score_codex":0.000012970513,"about_ca_system_score_gemma":0.000020069523,"threshold_uncertainty_score":0.9237906},"labels":[],"label_agreement":null},{"id":"W3033688932","doi":"10.1371/journal.pone.0234023","title":"Quantify the role of superspreaders -opinion leaders- on COVID-19 information propagation in the Chinese Sina-microblog","year":2020,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Microblogging; Social media; Public opinion; Information Dissemination; Population; Psychological intervention; Computer science; Dissemination; Internet privacy; Environmental health; Medicine; Political science; Telecommunications; World Wide Web","score_opus":0.057205270261582335,"score_gpt":0.28055201214373315,"score_spread":0.2233467418821508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033688932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9659397,0.000070047834,0.0045826654,0.024876716,0.000010889494,0.0009941361,0.000024706038,0.000074007374,0.0034271458],"genre_scores_gemma":[0.9985082,0.000005874135,0.0001870674,0.0010071098,0.00011037156,0.000045368957,0.00012790709,0.0000057572083,0.0000023111606],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991906,0.00011858213,0.00024275755,0.00010279584,0.000230592,0.000114618226],"domain_scores_gemma":[0.9994549,0.00013324237,0.00012752271,0.00021197613,0.00004174523,0.000030619278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021802374,0.00010002593,0.00015555584,0.00005514338,0.00007840045,0.000035501424,0.00024964559,0.000025543804,0.000053816628],"category_scores_gemma":[0.00005240727,0.00006122784,0.000065229164,0.00042972504,0.00006729601,0.00017720026,0.000031433883,0.0001821829,0.000020030491],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005866072,0.0044059963,0.5285454,0.0006314998,0.0010488685,8.1276113e-7,0.18686591,0.0064893505,0.08658483,0.15390503,0.005940635,0.024995087],"study_design_scores_gemma":[0.005745635,0.0023456914,0.080999814,0.00093029015,0.0008901679,0.0000017074195,0.17038561,0.46089175,0.18435773,0.07113814,0.02014304,0.0021703914],"about_ca_topic_score_codex":0.000286725,"about_ca_topic_score_gemma":0.0000132360565,"teacher_disagreement_score":0.45440242,"about_ca_system_score_codex":0.000022864026,"about_ca_system_score_gemma":0.00003725751,"threshold_uncertainty_score":0.24967988},"labels":[],"label_agreement":null},{"id":"W3034080444","doi":"10.1287/moor.2022.1282","title":"Linear Programming and Community Detection","year":2022,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; York University; National Science Foundation","keywords":"Bisection method; Logarithm; Linear programming; Relaxation (psychology); Stochastic block model; Degree (music); Bisection; Semidefinite programming; Mathematics; Random graph; Graph; Mathematical optimization; Linear programming relaxation; Combinatorics; Discrete mathematics; Computer science; Statistics; Physics","score_opus":0.1433807337072273,"score_gpt":0.44252985491363594,"score_spread":0.2991491212064087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034080444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90085024,0.000073220355,0.09357304,0.00007846096,0.000027147718,0.0010543452,0.000053437918,0.000058137863,0.0042319754],"genre_scores_gemma":[0.93796515,0.000010182411,0.060948674,8.83832e-7,0.00007217406,0.00050717907,0.0001216733,0.000022134886,0.00035193676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812394,0.0007018472,0.00037999408,0.00017366066,0.00043382647,0.00018673758],"domain_scores_gemma":[0.9983703,0.0003479554,0.000064902066,0.0007638658,0.00040730558,0.00004565268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002837244,0.00012624249,0.00028999147,0.0003092816,0.0010398598,0.0001478877,0.00041736133,0.00005283459,0.00047762954],"category_scores_gemma":[0.00006966421,0.00012896342,0.00009269574,0.00033958262,0.00015383217,0.000045893066,0.0021895312,0.0022487293,0.0000027925855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064885025,0.017871441,0.011049709,0.0073801554,0.003619604,0.000006291073,0.09318802,0.14417467,0.023934405,0.3125158,0.0018696559,0.38432539],"study_design_scores_gemma":[0.00031006028,0.00039357407,0.0002885808,0.0003582243,0.00016245192,0.0000021063045,0.020183207,0.8221493,0.012444095,0.14033045,0.00278837,0.00058963493],"about_ca_topic_score_codex":0.0023409782,"about_ca_topic_score_gemma":0.00021604446,"teacher_disagreement_score":0.6779746,"about_ca_system_score_codex":0.000051190735,"about_ca_system_score_gemma":0.000097483826,"threshold_uncertainty_score":0.97697353},"labels":[],"label_agreement":null},{"id":"W3034945051","doi":"10.1371/journal.pcbi.1009351","title":"Targeted pandemic containment through identifying local contact network bottlenecks","year":2021,"lang":"en","type":"article","venue":"PLoS Computational Biology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Betweenness centrality; Bottleneck; Computer science; Population; Enhanced Data Rates for GSM Evolution; Transmission (telecommunications); Containment (computer programming); Centrality; Pandemic; Flow network; Distributed computing; Data mining; Mathematical optimization; Artificial intelligence; Coronavirus disease 2019 (COVID-19); Mathematics; Infectious disease (medical specialty); Statistics","score_opus":0.03013567752062095,"score_gpt":0.3004471367574068,"score_spread":0.27031145923678584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034945051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10608592,0.0006419675,0.89003295,0.00020584815,0.00014737384,0.00015285853,0.000037375656,0.00013875696,0.0025569368],"genre_scores_gemma":[0.980827,0.000009146322,0.016641703,0.00044628812,0.0005120465,0.000041558884,0.001445274,0.00001679313,0.000060221737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852014,0.00020472221,0.00039027337,0.0003981788,0.00013958356,0.00034711213],"domain_scores_gemma":[0.9990451,0.00037404126,0.00015502801,0.00017880756,0.00018928092,0.00005777178],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000116963805,0.00018379182,0.00036650896,0.000030547275,0.0001732385,0.000037989408,0.00015693755,0.000065256245,0.0014154499],"category_scores_gemma":[0.0000074926606,0.00018549232,0.00016771819,0.00023682936,0.00007638127,0.00007266767,0.00015697147,0.00020032917,0.000058080368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045097655,0.0003709427,0.4108839,0.000014356946,0.0015355955,0.00001798252,0.00019898188,0.059018586,0.003973826,0.5034912,0.0057637384,0.0146857565],"study_design_scores_gemma":[0.0010607991,0.00011647583,0.023428543,0.0000737194,0.00018046192,0.000010188746,0.00026469136,0.08796051,0.0024788652,0.8737589,0.010089489,0.0005773266],"about_ca_topic_score_codex":0.00007780214,"about_ca_topic_score_gemma":0.000016598575,"teacher_disagreement_score":0.8747411,"about_ca_system_score_codex":0.00007192217,"about_ca_system_score_gemma":0.00011438485,"threshold_uncertainty_score":0.9994974},"labels":[],"label_agreement":null},{"id":"W3035110996","doi":"10.21203/rs.3.rs-36564/v1","title":"Deep learning of stochastic contagion dynamics on complex networks","year":2020,"lang":"en","type":"preprint","venue":"Research Square (Research Square)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund","keywords":"Complex network; Dynamics (music); Computer science; Emotional contagion; Artificial intelligence; Statistical physics; Econometrics; Economics; Psychology; Physics; Neuroscience; World Wide Web","score_opus":0.10693100456709265,"score_gpt":0.4230319305828925,"score_spread":0.31610092601579987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035110996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0308718,0.0009959195,0.93740314,0.0024795171,0.00027726812,0.0068586445,0.00034402145,0.0006362811,0.020133408],"genre_scores_gemma":[0.9924588,0.00013943535,0.0008337808,0.000019657224,0.001798503,0.000865705,0.003186028,0.0002611411,0.00043694518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9813228,0.006277283,0.0015029112,0.002252169,0.0056963367,0.0029484546],"domain_scores_gemma":[0.9864425,0.005520248,0.00056410016,0.0023200903,0.0041675265,0.0009855058],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008425531,0.0009550106,0.0019125912,0.0022544183,0.0012051213,0.00063069945,0.0030272563,0.00061158114,0.0020498678],"category_scores_gemma":[0.00083335297,0.0009871792,0.0010651686,0.0032711849,0.0013321793,0.00015391188,0.0062021296,0.01455607,0.00022388049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014574694,0.0021596309,0.019654201,0.0018847513,0.0018289848,0.00011585235,0.0017786983,0.61928236,0.00038488253,0.20908053,0.022897094,0.11947556],"study_design_scores_gemma":[0.0006987047,0.0014538432,0.0029444778,0.0015688726,0.000063274216,9.531415e-7,0.0019964958,0.94665426,0.000074573276,0.04222607,0.0015404007,0.0007780581],"about_ca_topic_score_codex":0.0045136516,"about_ca_topic_score_gemma":0.00033862647,"teacher_disagreement_score":0.961587,"about_ca_system_score_codex":0.0012648023,"about_ca_system_score_gemma":0.0008563896,"threshold_uncertainty_score":0.99925786},"labels":[],"label_agreement":null},{"id":"W3035614938","doi":"10.1109/sisy47553.2019.9111498","title":"Complex Networks : Plenary Talk","year":2019,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Network topology; Computer science; The Internet; Complex network; Data science; Network science; Traffic generation model; Computer network; World Wide Web","score_opus":0.010933747951148208,"score_gpt":0.2462768866972854,"score_spread":0.2353431387461372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035614938","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18065725,0.000038031692,0.17629926,0.00017332358,0.00010058647,0.00031422617,0.0000046596715,0.00033945093,0.6420732],"genre_scores_gemma":[0.991312,9.544425e-7,0.002390073,0.00015297282,0.0002908458,0.000011291308,0.00008204508,0.000015398533,0.005744391],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927574,0.000024634586,0.00016515836,0.00020748071,0.0000963698,0.00023064019],"domain_scores_gemma":[0.9994607,0.00004191775,0.000051734904,0.00036235928,0.000029839415,0.00005342979],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007509829,0.00012021807,0.00019152282,0.00004085471,0.000047321664,0.000035765366,0.00019408333,0.000021381733,0.032515343],"category_scores_gemma":[2.727408e-7,0.00010575601,0.00013741695,0.0001822789,0.000019031413,0.000071033784,0.000117046366,0.000109604174,0.00032113495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017044324,0.00020343674,0.50595176,0.0000060480597,0.0002800986,0.0000021475,0.00003992584,0.0056823893,0.0012230603,0.23869431,0.17956473,0.06833502],"study_design_scores_gemma":[0.00063782954,0.00010634101,0.044121347,0.00002473182,0.00006779313,0.000001941261,0.00022483958,0.608218,0.0005388809,0.024609832,0.3206664,0.0007820423],"about_ca_topic_score_codex":0.00020909241,"about_ca_topic_score_gemma":0.000007351594,"teacher_disagreement_score":0.81065476,"about_ca_system_score_codex":0.000010197901,"about_ca_system_score_gemma":0.000008712939,"threshold_uncertainty_score":0.96836907},"labels":[],"label_agreement":null},{"id":"W3037350926","doi":"10.65109/biov1668","title":"Influence Maximization in Unknown Social Networks: Learning Policies for Effective Graph Sampling","year":2020,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Heuristics; Reinforcement learning; Graph; Machine learning; Maximization; Artificial intelligence; ENCODE; Social network (sociolinguistics); Theoretical computer science; Mathematical optimization; Social media","score_opus":0.01655058643609039,"score_gpt":0.2885943271339991,"score_spread":0.2720437406979087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037350926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25159806,0.000013584151,0.7468798,0.00025211123,0.000006741648,0.00031070143,0.0000012608973,0.000104753846,0.00083294936],"genre_scores_gemma":[0.9966313,0.0000017733843,0.0026444301,0.00015577732,0.00037984786,0.000113391456,0.00003937907,0.000014670425,0.000019409657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992993,0.00005273788,0.00018398484,0.00019367208,0.00006185456,0.0002084882],"domain_scores_gemma":[0.9996266,0.00014682586,0.00008239598,0.00004853509,0.00006122279,0.000034468692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109023276,0.00011150133,0.00019483594,0.000061204024,0.00015213725,0.000050844814,0.000099905876,0.000029594265,0.000029404666],"category_scores_gemma":[0.000016680957,0.000113149465,0.00010716136,0.00050367904,0.000025424251,0.00010341935,0.00005598127,0.00014860979,0.000001499888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030103141,0.000026939255,0.13230725,0.000010143263,0.00005980028,9.1007905e-8,0.0009420157,0.7742897,0.00035112232,0.060910057,0.00032117587,0.030751605],"study_design_scores_gemma":[0.0010225822,0.00017919407,0.06776094,0.000051255203,0.00009383969,9.4562026e-8,0.0007482582,0.88647276,0.0014389119,0.033541903,0.008058358,0.0006319321],"about_ca_topic_score_codex":0.00023583842,"about_ca_topic_score_gemma":0.000024629471,"teacher_disagreement_score":0.74503326,"about_ca_system_score_codex":0.000018785999,"about_ca_system_score_gemma":0.000009915043,"threshold_uncertainty_score":0.46141014},"labels":[],"label_agreement":null},{"id":"W3037831187","doi":"10.1016/j.tcs.2022.08.001","title":"APX-hardness and approximation for the k-burning number problem","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; Mathematics; APX; Generalization; Approximation algorithm; Sequence (biology); Binary logarithm; Running time; Graph; Discrete mathematics; Physics; Algorithm; Chemistry","score_opus":0.008813310435495127,"score_gpt":0.2630747561018924,"score_spread":0.2542614456663973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037831187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018820617,0.000009073717,0.97773737,0.0004396328,0.000080114805,0.00028679773,0.0000031626546,0.000044192242,0.0025790164],"genre_scores_gemma":[0.95576906,2.401739e-7,0.04385037,0.0000823225,0.00013548408,0.00013209146,0.0000031938748,0.000005330569,0.000021902804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912757,0.000052545885,0.00012094718,0.00025039018,0.00023849783,0.00021003549],"domain_scores_gemma":[0.99946284,0.00017937204,0.00004883616,0.00021002362,0.00005513598,0.000043794225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011072126,0.00007354993,0.00009402583,0.000029569275,0.0010544965,0.00015606551,0.00046043022,0.0000049879745,0.0002852372],"category_scores_gemma":[0.000003529924,0.000052032854,0.000043677846,0.00037904418,0.0006975546,0.00009167693,0.0005995848,0.00011692437,0.0000019705947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003951932,0.000018641347,0.00058722234,0.0000019060838,0.000005771524,5.7535082e-8,0.00020939914,0.00039785358,0.000045153876,0.93002224,0.00019833111,0.06850949],"study_design_scores_gemma":[0.0000722032,0.000028002243,0.00015418789,0.000002865112,0.0000124695625,0.0000018518347,0.000041682088,0.602345,0.00019362719,0.395326,0.0017521718,0.000069944406],"about_ca_topic_score_codex":0.000005342122,"about_ca_topic_score_gemma":6.054437e-8,"teacher_disagreement_score":0.9369485,"about_ca_system_score_codex":0.000018087963,"about_ca_system_score_gemma":0.000024464774,"threshold_uncertainty_score":0.81104416},"labels":[],"label_agreement":null},{"id":"W3037838531","doi":"10.1093/comjnl/bxaa049","title":"CutTheTail: An Accurate and Space-Efficient Heuristic Algorithm for Influence Maximization","year":2020,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computation; Heuristic; Algorithm; Maximization; Heuristics; Benchmark (surveying); Laptop; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.018313415048206064,"score_gpt":0.2635336879577786,"score_spread":0.24522027290957255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037838531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052421797,0.0000378311,0.94632167,0.000961319,0.000047587426,0.00014020763,0.0000058323126,0.00003249253,0.000031278265],"genre_scores_gemma":[0.87235516,0.0000054869115,0.12613602,0.00028765472,0.0011797989,0.000006399903,0.0000074668355,0.0000136911,0.000008317032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993336,0.00007775707,0.0001880551,0.00014130597,0.00010424095,0.00015500077],"domain_scores_gemma":[0.9994441,0.00006035994,0.00014601613,0.0001237925,0.00011219637,0.00011349005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019649677,0.0001063394,0.00014079455,0.000027550685,0.0002691543,0.00024105108,0.00023410136,0.000012242855,0.000030049718],"category_scores_gemma":[0.0000022381503,0.000074538184,0.00006748282,0.00011885633,0.000030771294,0.00009618726,0.00009219311,0.00016144541,0.0000027513884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023199202,0.00007050253,0.0015879193,0.0000065498375,0.00015197939,0.0000033870683,0.0012039841,0.15203445,0.000123883,0.007973379,0.0037977784,0.833023],"study_design_scores_gemma":[0.00021691203,0.00009611354,0.0009392692,0.000009580153,0.00004687153,0.0000107889055,0.000029331979,0.99014366,0.00007590846,0.006612896,0.0017232901,0.000095400464],"about_ca_topic_score_codex":0.0000048616603,"about_ca_topic_score_gemma":1.8032986e-7,"teacher_disagreement_score":0.8381092,"about_ca_system_score_codex":0.000008796448,"about_ca_system_score_gemma":0.000019746538,"threshold_uncertainty_score":0.30395788},"labels":[],"label_agreement":null},{"id":"W3041765104","doi":"10.1007/978-3-030-52705-1_32","title":"Detecting Overlapping Communities Using Distributed Neighbourhood Threshold in Social Networks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disjoint sets; Computer science; Neighbourhood (mathematics); Preprocessor; Node (physics); Modularity (biology); Algorithm; Boundary (topology); Data mining; Artificial intelligence; Mathematics; Discrete mathematics","score_opus":0.030228913554229006,"score_gpt":0.2676961226766297,"score_spread":0.23746720912240066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041765104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025393318,0.0001236373,0.9946214,0.000096166805,0.00019376281,0.0002465912,0.000016267939,0.0000967171,0.0020661582],"genre_scores_gemma":[0.98518014,0.0000031023421,0.012957761,0.00020121125,0.0015484549,0.000005770044,0.000056059645,0.00004305697,0.0000044215144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774975,0.000049823673,0.00056860334,0.00062350766,0.0004128433,0.0005954655],"domain_scores_gemma":[0.9987038,0.00029502797,0.00035651392,0.00046506024,0.00009932743,0.00008030717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043237218,0.0004823038,0.0007247776,0.00040572754,0.0005252308,0.00036799468,0.0011104154,0.00018562874,0.0000855827],"category_scores_gemma":[0.0000068477684,0.0005190666,0.00021616132,0.00076127,0.00039889256,0.00020362268,0.0010926776,0.0016053589,0.0000016500119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001640703,0.000044041422,0.011097404,0.00002940552,0.000083863306,0.00002708686,0.0014896506,0.68528795,0.000103911414,0.021261966,0.000015913685,0.2805424],"study_design_scores_gemma":[0.0001595969,0.00002575739,0.00036633638,0.00035795485,0.00002506529,0.0000020625457,0.000005325968,0.89433444,0.000059380734,0.10409896,0.00006851919,0.00049660134],"about_ca_topic_score_codex":0.00041256705,"about_ca_topic_score_gemma":0.0003142147,"teacher_disagreement_score":0.9826408,"about_ca_system_score_codex":0.0002948107,"about_ca_system_score_gemma":0.00017084829,"threshold_uncertainty_score":0.9997261},"labels":[],"label_agreement":null},{"id":"W3043197873","doi":"10.1162/isal_a_00327","title":"Localization, bistability and optimal seeding of contagions on higher-order networks","year":2020,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Seeding; Bistability; Computer science; Order (exchange); Optoelectronics; Materials science; Physics; Business","score_opus":0.017719267126485996,"score_gpt":0.25199767532968226,"score_spread":0.23427840820319626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043197873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03558046,0.000023923492,0.9523809,0.0006964702,0.000016174903,0.00011396402,0.000004506866,0.00007115567,0.011112447],"genre_scores_gemma":[0.99737614,0.0000021725511,0.0021780545,0.00020006111,0.00015922105,0.000005606034,0.000019895662,0.000007754811,0.000051084953],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994447,0.000024085715,0.00018728223,0.0001737166,0.00006968881,0.00010051053],"domain_scores_gemma":[0.99962413,0.000055419874,0.000060570237,0.00011234914,0.00008314368,0.00006437733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058855923,0.00008573266,0.00017153287,0.000018076647,0.00005345662,0.000018444338,0.000064151944,0.000019977122,0.0007951875],"category_scores_gemma":[0.0000036317285,0.00007630813,0.00004683984,0.0002547129,0.000054940778,0.00004118114,0.000057509158,0.00007252031,0.0000012624438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053303153,0.0001768592,0.49098983,0.000018380431,0.00019739107,5.676641e-7,0.0002915308,0.11952253,0.00016450058,0.36429474,0.016259996,0.008030379],"study_design_scores_gemma":[0.00041279595,0.00015916725,0.010124242,0.000021198408,0.00008114888,6.888757e-8,0.00022588717,0.96869874,0.0009441375,0.0022784031,0.016796745,0.00025748328],"about_ca_topic_score_codex":0.0001131098,"about_ca_topic_score_gemma":0.0000032633159,"teacher_disagreement_score":0.9617957,"about_ca_system_score_codex":0.0000055797354,"about_ca_system_score_gemma":0.000008658876,"threshold_uncertainty_score":0.87067455},"labels":[],"label_agreement":null},{"id":"W3044191208","doi":"10.1007/s10791-020-09379-9","title":"Robust keyword search in large attributed graphs","year":2020,"lang":"en","type":"article","venue":"Information Retrieval","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); Toronto Metropolitan University; University of Waterloo; Ontario Tech University","funders":"","keywords":"Scalability; Computer science; SPARK (programming language); Theoretical computer science; Set (abstract data type); Graph; Keyword search; Data mining; Information retrieval; Database","score_opus":0.0316519411098354,"score_gpt":0.26000995574858576,"score_spread":0.22835801463875036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044191208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6700756,0.000023736013,0.30580017,0.001735778,0.00007143352,0.00061277737,0.00016896734,0.00033222453,0.021179318],"genre_scores_gemma":[0.9984302,0.000001855208,0.000724249,0.00035250632,0.00006274371,0.000004680305,0.00039961928,0.000005377923,0.000018776982],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899304,0.00004124949,0.00037852972,0.00009519957,0.00024692435,0.0002450823],"domain_scores_gemma":[0.999545,0.000032311575,0.00008597859,0.00013836566,0.00010949534,0.000088896064],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028077708,0.00010246612,0.0001721506,0.00014606808,0.00006406277,0.00008397778,0.00017847012,0.000030567757,0.0009196281],"category_scores_gemma":[0.00001757921,0.000104563864,0.00009170584,0.001211732,0.000016888824,0.0006214853,0.00009380715,0.00023852763,0.00019610838],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051283726,0.0002535986,0.7076033,0.00008924984,0.00026956064,0.0000063423195,0.006181812,0.017368319,0.00024026903,0.17277454,0.037743744,0.056956433],"study_design_scores_gemma":[0.0042768675,0.0002875272,0.08356037,0.000064983506,0.000065143315,0.0000013971421,0.002301052,0.6729969,0.006315765,0.005333474,0.22376387,0.0010326556],"about_ca_topic_score_codex":0.00005231302,"about_ca_topic_score_gemma":0.000003286784,"teacher_disagreement_score":0.65562856,"about_ca_system_score_codex":0.000025835197,"about_ca_system_score_gemma":0.00003862363,"threshold_uncertainty_score":0.9999937},"labels":[],"label_agreement":null},{"id":"W3045484596","doi":"10.1371/journal.pone.0242401","title":"Kemeny-based testing for COVID-19","year":2020,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Horizon 2020 Framework Programme; Science Foundation Ireland; European Commission; University of Ontario Institute of Technology; Engineering and Physical Sciences Research Council; České Vysoké Učení Technické v Praze","keywords":"Contact tracing; Computer science; Graph; Coronavirus disease 2019 (COVID-19); Tracing; Constant (computer programming); Theoretical computer science; Infectious disease (medical specialty); Medicine; Disease","score_opus":0.1809511680773878,"score_gpt":0.3004159780933199,"score_spread":0.1194648100159321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045484596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20922415,0.000048179907,0.76519734,0.010937084,0.0000103838165,0.0012226874,0.00012472803,0.00083777437,0.012397695],"genre_scores_gemma":[0.8947887,7.123024e-8,0.10290585,0.0016508468,0.00041338612,0.00012015655,0.000064079875,0.000015604834,0.00004131635],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993877,0.000015813714,0.00014240749,0.00018688905,0.00011401641,0.00015321834],"domain_scores_gemma":[0.99935764,0.00022230261,0.00007095198,0.00013882434,0.00006320614,0.00014710028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007416697,0.0000849944,0.00017605895,0.00002187518,0.00009276296,0.000028133243,0.00013194772,0.000012739096,0.00037165103],"category_scores_gemma":[0.00009027355,0.00008993472,0.00007162761,0.00020136572,0.000015322394,0.000026413312,0.000034622204,0.00006348537,0.000016994767],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015483443,0.0034986234,0.75095254,0.0007311704,0.0017868592,0.0000039268184,0.000557325,0.0014676864,0.15452853,0.02854304,0.043774884,0.01400059],"study_design_scores_gemma":[0.0031703154,0.00096651766,0.0009989004,0.00020322241,0.0014793784,6.861477e-8,0.00017598145,0.7427153,0.15790541,0.06258918,0.028541043,0.0012546973],"about_ca_topic_score_codex":0.000045550612,"about_ca_topic_score_gemma":0.000001513982,"teacher_disagreement_score":0.7499536,"about_ca_system_score_codex":0.000018581175,"about_ca_system_score_gemma":0.000070830756,"threshold_uncertainty_score":0.40693182},"labels":[],"label_agreement":null},{"id":"W3045603294","doi":"10.1016/j.jneuroling.2020.100913","title":"Using network science to map what Montréal bilinguals talk about across languages and communicative contexts","year":2020,"lang":"en","type":"article","venue":"Journal of Neurolinguistics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"Eunice Kennedy Shriver National Institute of Child Health and Human Development; Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health","keywords":"Variety (cybernetics); Psychology; Neuroscience of multilingualism; Reading (process); Cognition; Linguistics; Computer science; Artificial intelligence","score_opus":0.034517544254236567,"score_gpt":0.37350990555272945,"score_spread":0.33899236129849286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045603294","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9750475,0.0039369194,0.019250384,0.00090013753,0.0003024912,0.0001780292,0.000017654567,0.000029267194,0.00033757952],"genre_scores_gemma":[0.9821052,0.00008941799,0.015117981,0.00087458506,0.0017864571,6.975569e-7,9.4647595e-7,0.000018828669,0.0000058887113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864125,0.00007907618,0.00048730173,0.00018259771,0.0002950571,0.00031470967],"domain_scores_gemma":[0.99818635,0.00022329188,0.0004726547,0.00024591916,0.00058359077,0.00028817466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048153495,0.00015634995,0.0003908139,0.000056325774,0.00029230223,0.00036290844,0.00050700415,0.000022081085,0.000012904312],"category_scores_gemma":[0.00029374546,0.00014068293,0.000101257494,0.00040302787,0.00020529063,0.0001521006,0.00041759666,0.00036324162,0.0000016713011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019703214,0.0013340716,0.16585912,0.00028956807,0.0019976837,0.010099478,0.093845814,0.25821775,0.084586844,0.024511581,0.016780078,0.3405077],"study_design_scores_gemma":[0.007863449,0.0057893666,0.020583566,0.0045337705,0.002363779,0.0023672516,0.037973277,0.45187035,0.017199362,0.0640906,0.3800829,0.0052823042],"about_ca_topic_score_codex":0.00007458841,"about_ca_topic_score_gemma":0.000010513482,"teacher_disagreement_score":0.36330283,"about_ca_system_score_codex":0.000021590502,"about_ca_system_score_gemma":0.00008204766,"threshold_uncertainty_score":0.5736883},"labels":[],"label_agreement":null},{"id":"W3047166675","doi":"10.1093/comnet/cnaa012","title":"A density-based statistical analysis of graph clustering algorithm performance","year":2020,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Null model; Clustering coefficient; Computer science; Graph; Axiom; Theoretical computer science; Data mining; Cluster (spacecraft); Algorithm; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.021786691844942908,"score_gpt":0.2666106937272401,"score_spread":0.2448240018822972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047166675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06177028,0.000055656306,0.937682,0.0001022579,0.000041507432,0.00006462882,0.000017354525,0.00001787789,0.0002484569],"genre_scores_gemma":[0.9143463,0.00000663712,0.08488919,0.00023534444,0.0004648984,0.0000014709981,0.000038527494,0.00001542402,0.0000022007296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818087,0.00011874335,0.0008993878,0.0001686871,0.00037128862,0.00026104908],"domain_scores_gemma":[0.99824804,0.00021171436,0.0008018944,0.00020533208,0.0003269209,0.0002061146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033226356,0.0001893633,0.0008990741,0.00024291039,0.000080383514,0.000042623564,0.0003484809,0.000039569775,0.0006144417],"category_scores_gemma":[0.00000682151,0.00017288954,0.00056400074,0.0014497925,0.00008912514,0.00009796921,0.00008474004,0.0003740058,0.0000011077956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011724292,0.000114284485,0.12243677,0.000015315893,0.0024027552,0.000010283594,0.00007824653,0.8083022,0.00007776767,0.00053492445,0.0027381747,0.063172035],"study_design_scores_gemma":[0.0003536053,0.000197194,0.038938068,0.000030372266,0.0014689682,0.0000014826185,0.000030314606,0.95773727,0.000059314825,0.00023474982,0.0007991346,0.00014955895],"about_ca_topic_score_codex":0.000023576013,"about_ca_topic_score_gemma":0.000005610629,"teacher_disagreement_score":0.8527928,"about_ca_system_score_codex":0.0000215242,"about_ca_system_score_gemma":0.000050452225,"threshold_uncertainty_score":0.7050231},"labels":[],"label_agreement":null},{"id":"W3047462403","doi":"10.1098/rspa.2019.0744","title":"Network comparison and the within-ensemble graph distance","year":2020,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Institut National d'Optique","funders":"","keywords":"Computer science","score_opus":0.011315127004732469,"score_gpt":0.22196937520814655,"score_spread":0.21065424820341408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047462403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95366323,0.00016367514,0.04129815,0.0025397383,0.000019329054,0.00022493878,0.0000015001311,0.000068677065,0.0020207742],"genre_scores_gemma":[0.99461776,0.0000011622952,0.0051072347,0.00006357939,0.00017769646,0.000012730435,8.531641e-8,0.0000053361678,0.000014387531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992655,0.0000040418786,0.00017442391,0.00017478479,0.00020737862,0.0001738864],"domain_scores_gemma":[0.999608,0.00016289261,0.00009889635,0.000043329692,0.000027000176,0.000059922568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002624517,0.000117541815,0.0002878569,0.0000032734426,0.00020098657,0.000093862785,0.00027200067,0.000014567137,0.0000030379597],"category_scores_gemma":[0.000023086182,0.00005926011,0.00015622872,0.00033370664,0.0006352173,0.00006469567,0.0002016098,0.00016524122,3.9637553e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073008773,0.000035622594,0.0026860752,0.00011144968,0.000054855176,6.3969123e-9,0.0034783264,0.006746948,0.00028698545,0.9853808,0.0010243002,0.00018729702],"study_design_scores_gemma":[0.00010626291,0.000021229247,0.00027780485,0.00005453997,0.00004790539,9.159989e-8,0.00034780396,0.7544781,0.0003573493,0.24419002,0.000041187217,0.00007768794],"about_ca_topic_score_codex":0.000005700368,"about_ca_topic_score_gemma":3.8037303e-8,"teacher_disagreement_score":0.74773115,"about_ca_system_score_codex":0.0000027000247,"about_ca_system_score_gemma":0.0000043125583,"threshold_uncertainty_score":0.2416557},"labels":[],"label_agreement":null},{"id":"W3047770989","doi":"10.1103/physreve.102.022301","title":"Dependency-based targeted attacks in interdependent networks","year":2020,"lang":"en","type":"article","venue":"Physical review. E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation","keywords":"Dependency (UML); Interdependent networks; Interdependence; Computer science; Vulnerability (computing); Exploit; Cascading failure; Percolation (cognitive psychology); Giant component; Fraction (chemistry); Distributed computing; Dependency graph; Complex network; Computer network; Computer security; Random graph; Theoretical computer science; Physics; Artificial intelligence","score_opus":0.01750148307033582,"score_gpt":0.3280336912341642,"score_spread":0.31053220816382837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047770989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15114287,0.014045242,0.77329403,0.011830498,0.000204333,0.003009587,0.000057706868,0.0008478518,0.04556788],"genre_scores_gemma":[0.99684596,0.000118180316,0.00041887217,0.0017802978,0.00062388123,0.000078375924,0.00009734271,0.000028279212,0.00000879297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984335,0.0002033267,0.00040006096,0.0004087883,0.0002294565,0.00032489424],"domain_scores_gemma":[0.99921656,0.00009464693,0.00014341879,0.00032864697,0.000045595873,0.00017110804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018276005,0.00023989828,0.00058394764,0.000031575466,0.000037427282,0.000029579742,0.00039978244,0.000017929795,0.0006357527],"category_scores_gemma":[0.000019590527,0.00021692975,0.00039152818,0.0005424078,0.000029768362,0.00007892446,0.00014922039,0.00041460892,0.00015051327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012487797,0.0026416793,0.24140571,0.0011550047,0.00055721443,0.00007954688,0.00049948174,0.01965853,0.0032447267,0.047232945,0.08627704,0.59712327],"study_design_scores_gemma":[0.0013016539,0.0002746916,0.008270314,0.0024599477,0.00043265976,4.8289945e-7,0.000042790998,0.9163148,0.0034191678,0.027592223,0.03837679,0.0015144977],"about_ca_topic_score_codex":0.00006165903,"about_ca_topic_score_gemma":0.000011384741,"teacher_disagreement_score":0.8966563,"about_ca_system_score_codex":0.00003079614,"about_ca_system_score_gemma":0.000030564737,"threshold_uncertainty_score":0.8846138},"labels":[],"label_agreement":null},{"id":"W3048080661","doi":"10.1109/mdm48529.2020.00057","title":"A Big Data Platform For Spatio-Temporal Social Event Discovery","year":2020,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Social media; Big data; Event (particle physics); Microblogging; Scalability; Data science; Data stream mining; Architecture; Information extraction; Streaming data; Natural disaster; Data mining; World Wide Web; Information retrieval; Database; Geography","score_opus":0.10747102606929988,"score_gpt":0.3196556294010569,"score_spread":0.21218460333175704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048080661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023051163,0.000008690786,0.9700172,0.0019152969,0.000049910304,0.0002953757,0.00031155217,0.000099882716,0.004250907],"genre_scores_gemma":[0.99141306,3.0731792e-7,0.0034773136,0.00022139665,0.0022332969,0.0000306616,0.0022456923,0.000013717333,0.00036457204],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992838,0.000007355538,0.00019213522,0.00025687105,0.00010186358,0.0001579955],"domain_scores_gemma":[0.9995742,0.000030979998,0.000076345765,0.00024906255,0.000022858472,0.00004658053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000079394886,0.000101476595,0.00017541427,0.000017246573,0.00010228612,0.000082926774,0.00034903322,0.000016822398,0.00025952468],"category_scores_gemma":[0.0000030868364,0.00008892384,0.00012303486,0.0001194054,0.000016912358,0.0002397002,0.00029498004,0.000059677655,0.000010490653],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012230792,0.00020077618,0.03658872,0.000027084883,0.00043616278,6.745595e-7,0.00041908617,0.000036766905,0.00013031061,0.14481917,0.55516756,0.2620514],"study_design_scores_gemma":[0.0011505882,0.00015872036,0.0014596974,0.000013148338,0.00023575507,1.2383498e-7,0.00062974065,0.14044867,0.0015641244,0.049970992,0.80369,0.0006784215],"about_ca_topic_score_codex":0.000234338,"about_ca_topic_score_gemma":0.000093618,"teacher_disagreement_score":0.96836185,"about_ca_system_score_codex":0.000010304487,"about_ca_system_score_gemma":0.000044084067,"threshold_uncertainty_score":0.3626209},"labels":[],"label_agreement":null},{"id":"W3048098161","doi":"10.11647/obp.0200","title":"Introducing Vigilant Audiences","year":2020,"lang":"en","type":"book","venue":"Open Book Publishers","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; International Centre for Comparative Criminology; Université Laval","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"History","score_opus":0.016857849383976064,"score_gpt":0.2641540732461829,"score_spread":0.24729622386220684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048098161","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020276207,0.00029664813,0.0012234139,0.0017765061,0.00023865135,0.000682051,0.00003722056,0.00014006173,0.99560344],"genre_scores_gemma":[0.00052004436,0.000011919868,0.0024111469,0.0010020031,0.0024847267,0.0001273529,0.00092025753,0.0000968227,0.99242574],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975334,0.00006571384,0.000533826,0.0010146231,0.0004037647,0.00044866226],"domain_scores_gemma":[0.9981644,0.00009998357,0.0005028395,0.0008617981,0.00013705145,0.00023394154],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036646528,0.00048171487,0.00087846175,0.0001465917,0.0002228706,0.0037370077,0.002632378,0.00012671578,0.014088245],"category_scores_gemma":[0.000018829487,0.00046197715,0.00033367408,0.00023124195,0.00012422013,0.0020540683,0.0016213789,0.0007388898,0.00030949994],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006829101,0.000017202272,0.000094518924,0.00000986854,0.0002943857,0.00000468168,0.00010692099,0.000018521836,0.0000036156446,0.03428315,0.94670004,0.018460292],"study_design_scores_gemma":[0.00013562824,0.00003874547,0.0000059612944,0.00011332713,0.00013972975,4.933185e-7,0.00008256376,0.00018837208,0.000025538051,0.023582952,0.97517216,0.00051450724],"about_ca_topic_score_codex":0.00036752824,"about_ca_topic_score_gemma":0.000028780076,"teacher_disagreement_score":0.028472168,"about_ca_system_score_codex":0.00018144319,"about_ca_system_score_gemma":0.0008559574,"threshold_uncertainty_score":0.9997832},"labels":[],"label_agreement":null},{"id":"W3048211499","doi":"10.1016/j.socnet.2023.02.002","title":"Analysing networks of networks","year":2023,"lang":"en","type":"article","venue":"Social Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Russian Science Foundation; University of Melbourne","keywords":"Exponential random graph models; Computer science; Interpersonal ties; Social network analysis; Social connectedness; Social network (sociolinguistics); Theoretical computer science; Network science; Graph; Random graph; Complex network; Psychology; Social psychology; World Wide Web","score_opus":0.013767270092399472,"score_gpt":0.28119599686938257,"score_spread":0.2674287267769831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048211499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0352236,0.00039213244,0.95019925,0.00015130782,0.0004526208,0.0003191958,0.00000903202,0.00063491723,0.012617974],"genre_scores_gemma":[0.99445736,0.000053237,0.00027808626,0.00006284774,0.0043672766,0.000038066843,0.00031272825,0.00006554353,0.00036482592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756575,0.00019059326,0.0006753572,0.0004415119,0.0002977934,0.00082897436],"domain_scores_gemma":[0.9986759,0.00022023328,0.00041829873,0.00041665172,0.0001525131,0.000116427225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065667,0.00032453274,0.0007147339,0.00020972153,0.00046160296,0.00008016617,0.0004503782,0.00019419435,0.00041556946],"category_scores_gemma":[0.0000054902534,0.00034583732,0.00065625494,0.003118797,0.00018378117,0.000119958706,0.0002796112,0.00053328986,0.000014009804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021950867,0.00006140249,0.04909709,0.000004577492,0.0005029147,0.0000036504455,0.0001424494,0.824355,0.000011832428,0.014278203,0.034466557,0.07705434],"study_design_scores_gemma":[0.00024306275,0.000022796132,0.012640843,0.000033495468,0.00021445585,2.0637519e-7,0.0002224487,0.97953147,0.000010185763,0.0045106024,0.0022101765,0.00036025594],"about_ca_topic_score_codex":0.00021080239,"about_ca_topic_score_gemma":0.00003390155,"teacher_disagreement_score":0.95923376,"about_ca_system_score_codex":0.000040047922,"about_ca_system_score_gemma":0.000030117084,"threshold_uncertainty_score":0.9998994},"labels":[],"label_agreement":null},{"id":"W3080545259","doi":"10.48550/arxiv.2008.10383","title":"The Homophily Principle in Social Network Analysis","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; Lakehead University","funders":"","keywords":"Homophily; Social media; Social network (sociolinguistics); Social network analysis; Sociology; Data science; Computer science; World Wide Web; Social science","score_opus":0.055558328935616255,"score_gpt":0.21936315363233475,"score_spread":0.16380482469671848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080545259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71766174,0.0001503118,0.2543422,0.0007529121,0.0002409937,0.00082668004,0.00008385857,0.00036136305,0.025579967],"genre_scores_gemma":[0.99814194,0.000032438402,0.00014417652,0.00003257695,0.00084839325,0.000004110545,0.00012790672,0.000023109385,0.000645346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981085,0.00023998867,0.0003088966,0.00080594764,0.00009095714,0.00044567682],"domain_scores_gemma":[0.99863786,0.00013759926,0.0003480286,0.000699053,0.000081399914,0.000096070165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000302208,0.0003168084,0.000599531,0.00018900269,0.000450603,0.000123052,0.0010559461,0.00013455545,0.00014164831],"category_scores_gemma":[0.0000045633974,0.00031538133,0.0008516192,0.0025671076,0.00012460897,0.00005972053,0.0015149157,0.00085501536,0.000027102184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041046624,0.00006439143,0.21263331,0.000007788093,0.0020859232,0.000032544747,0.000098727825,0.38813603,0.0000015000675,0.39394075,0.0023363312,0.00062168087],"study_design_scores_gemma":[0.00030621517,0.000016625783,0.041569293,0.000023582672,0.0021354947,5.8406556e-8,0.00015001782,0.40758592,0.0000066286716,0.5374205,0.010147958,0.00063767115],"about_ca_topic_score_codex":0.0005449477,"about_ca_topic_score_gemma":0.0005061563,"teacher_disagreement_score":0.28048024,"about_ca_system_score_codex":0.00013908351,"about_ca_system_score_gemma":0.00010827908,"threshold_uncertainty_score":0.99992985},"labels":[],"label_agreement":null},{"id":"W3082642148","doi":"10.37236/9239","title":"Counting Triangles in Power-Law Uniform Random Graphs","year":2020,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Australian Government","keywords":"Mathematics; Combinatorics; Random graph; Vertex (graph theory); Exponent; Degree distribution; Degree (music); Clustering coefficient; Discrete mathematics; Random regular graph; Graph; Chordal graph; Cluster analysis; 1-planar graph; Complex network; Statistics","score_opus":0.008283163270076962,"score_gpt":0.231851790648206,"score_spread":0.22356862737812902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082642148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92895216,0.0037908845,0.044903908,0.0059086382,0.00023196975,0.00040776,0.0000024953208,0.00005736333,0.015744839],"genre_scores_gemma":[0.99956197,0.00006128805,0.00001609342,0.00019109056,0.000129454,0.0000026062035,0.0000014096976,0.000016970662,0.000019132014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984703,0.00013566948,0.0005563192,0.00010062021,0.00030103,0.00043606866],"domain_scores_gemma":[0.9989274,0.00020948178,0.00048093303,0.00015909779,0.00015458663,0.000068460715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001076123,0.00014977383,0.0004108864,0.00008110831,0.00010683813,0.00005597263,0.00054133125,0.000029061373,0.000055492208],"category_scores_gemma":[0.000021500307,0.00010696252,0.00026600616,0.00073330774,0.000049944705,0.00015221727,0.000056895886,0.0008127386,0.0000031586121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011275887,0.0000733901,0.0015997714,0.0000023895384,0.00013402055,0.000002849389,0.00026201882,0.00017267003,0.00010293152,0.99660695,0.00041826433,0.0005119989],"study_design_scores_gemma":[0.0025633508,0.0003162405,0.00008006276,0.000023668483,0.000091342925,0.000005862807,0.00032827957,0.00073983055,0.0009369646,0.9833449,0.011425616,0.00014384136],"about_ca_topic_score_codex":0.000044258497,"about_ca_topic_score_gemma":0.0000091580305,"teacher_disagreement_score":0.070609815,"about_ca_system_score_codex":0.00010828585,"about_ca_system_score_gemma":0.00020146549,"threshold_uncertainty_score":0.4361805},"labels":[],"label_agreement":null},{"id":"W3083176779","doi":"10.1109/cec48606.2020.9185662","title":"Modelling of Vaccination Strategies for Epidemics using Evolutionary Computation","year":2020,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Brock University","funders":"","keywords":"Evolutionary computation; Vaccination; Computer science; Computation; Artificial intelligence; Biology; Virology; Algorithm","score_opus":0.10609753980923901,"score_gpt":0.32621287964838597,"score_spread":0.22011533983914694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083176779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050287228,0.000019134537,0.94825286,0.000087496795,0.0000076330425,0.00012833673,0.0000067650553,0.00003615761,0.001174408],"genre_scores_gemma":[0.7729801,4.4136834e-7,0.22685203,0.00001537775,0.000094785995,0.0000039736833,0.000044645654,0.0000049437012,0.0000037183406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956137,0.000015040763,0.0001999592,0.00010036731,0.000055755936,0.000067506146],"domain_scores_gemma":[0.9996533,0.00006088082,0.00010766214,0.00004024011,0.00011825957,0.000019666635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059589853,0.00005451412,0.00011906893,0.000027888875,0.000042248525,0.000011442742,0.000046888174,0.0000134002485,0.00004724429],"category_scores_gemma":[0.000001428725,0.00005642298,0.000074917334,0.00012278475,0.000005542046,0.00014066252,0.000016774191,0.000030128085,3.3428213e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056180947,0.000011705175,0.0013228678,0.000010455645,0.000022799206,7.747336e-9,0.00006807218,0.9079656,0.00029246646,0.087712266,0.00041661796,0.0021715316],"study_design_scores_gemma":[0.00007428106,0.000015076989,0.000023326018,0.000004033857,0.00002389351,2.2948617e-8,0.00024559285,0.87302476,0.00044789523,0.12603508,0.000057976722,0.000048032554],"about_ca_topic_score_codex":0.00010570908,"about_ca_topic_score_gemma":4.7487856e-7,"teacher_disagreement_score":0.72269285,"about_ca_system_score_codex":0.000011641537,"about_ca_system_score_gemma":0.00003336824,"threshold_uncertainty_score":0.23008624},"labels":[],"label_agreement":null},{"id":"W3083548150","doi":"10.1002/rsa.20306","title":"Edge flows in the complete random‐lengths network","year":2010,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Random graph; Mathematics; Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; struct; Random variable; Path (computing); Shortest path problem; Flow (mathematics); Limit (mathematics); Constant (computer programming); Path length; Graph; Discrete mathematics; Computer science; Geometry; Mathematical analysis; Statistics","score_opus":0.008304581060683752,"score_gpt":0.2488744036981109,"score_spread":0.24056982263742716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083548150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9241416,0.0012633201,0.055736486,0.0010153496,0.0012064342,0.0020277812,0.00010821188,0.00018743241,0.014313395],"genre_scores_gemma":[0.9915502,0.000025077094,0.005848675,0.00015627695,0.0022376417,0.00006286448,0.00005470883,0.00001944976,0.000045094388],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853873,0.00016996542,0.0003515435,0.00032500713,0.00020869008,0.00040603342],"domain_scores_gemma":[0.99890465,0.00047160286,0.0001108743,0.00040412488,0.0000360392,0.00007270221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006254289,0.0002594635,0.00049133616,0.000061385734,0.00029524288,0.00016665066,0.00036564108,0.00006309201,0.0005114831],"category_scores_gemma":[0.000010457964,0.00016419917,0.0001927805,0.00027927925,0.00010937877,0.00007638113,0.000088608715,0.0005916109,0.0000032436942],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009456762,0.00018855646,0.033000458,0.000036853085,0.00058329693,0.000030563046,0.0022017097,0.0023894124,0.002225266,0.17125013,0.022864286,0.7642838],"study_design_scores_gemma":[0.029837862,0.000115862735,0.037706196,0.000059445098,0.00033029105,0.00004465918,0.0005223746,0.15212676,0.00028147668,0.5478121,0.22983538,0.0013275812],"about_ca_topic_score_codex":0.00032001472,"about_ca_topic_score_gemma":0.00019331858,"teacher_disagreement_score":0.7629562,"about_ca_system_score_codex":0.000004360994,"about_ca_system_score_gemma":0.000016952434,"threshold_uncertainty_score":0.6695848},"labels":[],"label_agreement":null},{"id":"W3084273389","doi":"10.1016/j.csfx.2020.100031","title":"Topic reading dynamics of the Chinese Sina-Microblog","year":2020,"lang":"en","type":"article","venue":"Chaos Solitons & Fractals X","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Research Chairs","keywords":"Microblogging; Reading (process); Computer science; Social media; Sampling (signal processing); Dynamics (music); Key (lock); Set (abstract data type); World Wide Web; Telecommunications; Computer security; Linguistics; Acoustics; Physics","score_opus":0.008248377942770602,"score_gpt":0.24961593653372896,"score_spread":0.24136755859095835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084273389","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96861756,0.000067696514,0.009382123,0.0034200845,0.00011092473,0.0002452251,0.000052184376,0.00008711282,0.018017095],"genre_scores_gemma":[0.9985767,0.0000027886997,0.00046465115,0.0002002791,0.00046473893,0.000012344845,0.000035005494,0.000019658655,0.00022384668],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990854,0.00004982873,0.0002944602,0.00022085219,0.00012762177,0.0002217876],"domain_scores_gemma":[0.99917686,0.000074926415,0.00019704486,0.00042197315,0.000057087123,0.00007212156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007437291,0.00016483261,0.0003046563,0.000030581738,0.0001133632,0.000028416507,0.00041645448,0.00004042667,0.00033086218],"category_scores_gemma":[0.00001923694,0.00012045203,0.0002724909,0.00043389032,0.00008181721,0.00007563241,0.00023865096,0.00021869657,0.000014251477],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027075079,0.00034309315,0.8171883,0.000085878004,0.00048598685,0.0000036978604,0.0025612288,0.00040514203,0.040959958,0.09011749,0.007392282,0.040429853],"study_design_scores_gemma":[0.0026879844,0.00047677886,0.24788043,0.00066283846,0.001173417,0.000014196538,0.0036415455,0.2645496,0.15091403,0.26222062,0.06225795,0.0035205989],"about_ca_topic_score_codex":0.00016503698,"about_ca_topic_score_gemma":0.000016195978,"teacher_disagreement_score":0.56930786,"about_ca_system_score_codex":0.000029996225,"about_ca_system_score_gemma":0.00003545342,"threshold_uncertainty_score":0.49118912},"labels":[],"label_agreement":null},{"id":"W3086229732","doi":"10.1155/2020/2109423","title":"Construction of Regional Logistics Weighted Network Model and Its Robust optimization: Evidence from China","year":2020,"lang":"en","type":"article","venue":"Complexity","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Ministry of Education of the People's Republic of China; National Natural Science Foundation of China; Australian Research Council; Education Department of Hunan Province","keywords":"Construct (python library); Computer science; China; Index (typography); Operations research; Scale (ratio); Business; Complex network; Gravity model of trade; Weighted network; Industrial organization; Mathematics; Computer network; International trade; Geography","score_opus":0.12736054755465473,"score_gpt":0.2804059680266056,"score_spread":0.15304542047195088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086229732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052055318,0.00027597326,0.94622386,0.00063268055,0.000023580018,0.0001210357,0.00007125069,0.000064119144,0.0005321956],"genre_scores_gemma":[0.7817411,0.000029151719,0.21767013,0.000040332066,0.00035120622,0.000003819351,0.00014954263,0.0000078544035,0.0000068865907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914175,0.000056922196,0.00027060733,0.0002627855,0.00013657416,0.00013133517],"domain_scores_gemma":[0.99935603,0.0000760398,0.00019191319,0.00016689402,0.00012147291,0.000087636756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000641819,0.00012943582,0.00027272277,0.000017394725,0.00011279448,0.000024197818,0.00015982805,0.000031887,0.0004279553],"category_scores_gemma":[0.0000113403385,0.00013306476,0.000060886556,0.00025431905,0.0001686703,0.00011169737,0.00013970677,0.0001267758,0.0000016301049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038592974,0.00002396376,0.012142207,0.000010985328,0.00006890413,3.2415144e-7,0.00013186396,0.92112917,0.00006084372,0.061721843,0.004199374,0.00047196166],"study_design_scores_gemma":[0.0001112304,0.00001935264,0.0022895283,0.00004638977,0.000047369213,2.9599593e-7,0.00001563861,0.9392709,0.000070688024,0.057946615,0.00006550355,0.000116480616],"about_ca_topic_score_codex":0.00008716696,"about_ca_topic_score_gemma":0.0000060335383,"teacher_disagreement_score":0.7296858,"about_ca_system_score_codex":0.000010816151,"about_ca_system_score_gemma":0.000038665105,"threshold_uncertainty_score":0.5426223},"labels":[],"label_agreement":null},{"id":"W3086485949","doi":"10.5267/j.dsl.2020.8.003","title":"An overlapping community detection algorithm based on local community and information flow expansion (LCFE) in weighted directed networks","year":2020,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modularity (biology); Benchmark (surveying); Node (physics); Computer science; Measure (data warehouse); Function (biology); Information flow; Algorithm; Mutual information; Community structure; Complex network; Data mining; Process (computing); Weight function; Flow (mathematics); Mathematics; Artificial intelligence; Statistics","score_opus":0.013898981475417578,"score_gpt":0.26227353158944267,"score_spread":0.2483745501140251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086485949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46033353,0.0000013337415,0.5392249,0.00016799184,0.00004196518,0.000103302926,0.0000028884392,0.0000774358,0.00004663197],"genre_scores_gemma":[0.98220783,9.906304e-7,0.014680398,0.0029728026,0.00006402468,0.000012665893,0.000053992226,0.00000722162,9.590993e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811405,0.0005591672,0.00036965247,0.00020469165,0.00048064816,0.00027178993],"domain_scores_gemma":[0.99867123,0.00040646558,0.00013963184,0.0005205464,0.00009251698,0.00016957661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015343601,0.00017124462,0.00022470696,0.0003618403,0.0009166247,0.00026087146,0.0005140435,0.00004445968,0.000022575729],"category_scores_gemma":[0.000042893567,0.00016191535,0.000052177093,0.0019230186,0.00026169306,0.0014862596,0.00016945042,0.00087967166,0.000004372446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048704194,0.00007066323,0.00237484,0.0000015948267,0.000002819702,5.152435e-7,0.0006717894,0.03985233,0.0025519251,0.000015822816,0.00013998484,0.954269],"study_design_scores_gemma":[0.0003799955,0.000106004714,0.037863456,0.000050053415,0.0000057070724,2.3222809e-7,0.00046518556,0.9591953,0.0013523084,0.0001495981,0.00026890956,0.00016326275],"about_ca_topic_score_codex":0.0009418427,"about_ca_topic_score_gemma":0.00005512288,"teacher_disagreement_score":0.95410573,"about_ca_system_score_codex":0.0001072045,"about_ca_system_score_gemma":0.000026444612,"threshold_uncertainty_score":0.70500284},"labels":[],"label_agreement":null},{"id":"W3088093735","doi":"10.22230/cjc.2020v45n3a3587","title":"Tweeting Tsunami: Influence and Early Warning in British Columbia","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Communication","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Warning system; Early warning system; Event (particle physics); Geography; Key (lock); Computer science; Computer security; Telecommunications","score_opus":0.009638437906654074,"score_gpt":0.21737266598873112,"score_spread":0.20773422808207703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088093735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99783695,0.0005958393,0.00041648775,0.00048195285,0.0000042935985,0.000040304512,0.0000014881452,0.0000038087378,0.00061885297],"genre_scores_gemma":[0.99848604,0.000019560874,0.0013584244,0.00007823958,0.000038341575,0.0000014280805,0.0000023570203,0.0000061401556,0.000009453617],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999428,0.00009528366,0.00026746254,0.0000526416,0.000050892715,0.00010576727],"domain_scores_gemma":[0.99934155,0.000052135172,0.00019559008,0.00012095579,0.00009880895,0.00019095578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024155909,0.000034912246,0.0001321561,0.000045736604,0.00011772983,0.0002585969,0.00025891908,0.000016414355,0.000059664766],"category_scores_gemma":[0.000037079917,0.000060860995,0.00003236516,0.00019024232,0.000044903474,0.00018370643,0.00002756667,0.00026396653,6.6183486e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.809177e-7,0.0000021501971,0.9741155,0.0000015144108,0.000010047306,0.0000027973656,0.00065369403,0.00017911209,0.000043453212,0.000090440204,0.0003296905,0.024571102],"study_design_scores_gemma":[0.00019002192,0.000032117503,0.989703,0.00021025201,0.0000165862,0.0000053296912,0.00043284777,0.001333698,0.000012190014,0.0028720058,0.005093223,0.00009872529],"about_ca_topic_score_codex":0.28578988,"about_ca_topic_score_gemma":0.40046924,"teacher_disagreement_score":0.11467937,"about_ca_system_score_codex":0.000032509954,"about_ca_system_score_gemma":0.00014307325,"threshold_uncertainty_score":0.7189661},"labels":[],"label_agreement":null},{"id":"W3089235402","doi":"10.5430/jms.v11n3p55","title":"Exploring Interdisciplinary Relationships Among King Abdulaziz University Departments via ResearchGate: Network Analysis and Visualizations","year":2020,"lang":"en","type":"article","venue":"Journal of Management and Strategy","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"King Abdulaziz University","keywords":"Betweenness centrality; Centrality; Random graph; Degree distribution; Social network analysis; Clustering coefficient; Closeness; Vertex (graph theory); Network analysis; Network science; Computer science; Social network (sociolinguistics); Complex network; Graph; Data science; Theoretical computer science; Mathematics; Artificial intelligence; Combinatorics; World Wide Web; Cluster analysis; Physics; Social media","score_opus":0.10935165165860293,"score_gpt":0.3054147927550846,"score_spread":0.19606314109648165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089235402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7297904,0.00007525292,0.26647958,0.00018701129,0.000014733521,0.00009784003,0.0000016707603,0.000015574751,0.0033379388],"genre_scores_gemma":[0.9981996,0.00011070866,0.0014415004,0.0000058072237,0.00013599485,0.0000011435726,0.000011030061,0.000005992449,0.00008822105],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991717,0.00012930471,0.00025891623,0.00014007898,0.00015740808,0.00014258802],"domain_scores_gemma":[0.99948686,0.00004675736,0.00020336763,0.0000777355,0.000058397338,0.00012690676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003198264,0.00009266615,0.00021131343,0.00023584181,0.00031194946,0.00009029226,0.000114004964,0.000013974286,0.00004765968],"category_scores_gemma":[0.0000015739473,0.000090749534,0.00010587715,0.00085515575,0.000042485935,0.0004320475,0.00026151916,0.00018187606,6.0314284e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059243466,0.0000456306,0.95782626,0.000021115246,0.002080298,0.00004469362,0.00047052273,0.013616187,0.000009077721,0.013473859,0.00065608835,0.011697049],"study_design_scores_gemma":[0.000540194,0.00015097135,0.91690665,0.00006239389,0.0020959438,0.0000010573369,0.0051812087,0.063470274,0.000017606315,0.010536292,0.00080946815,0.00022793992],"about_ca_topic_score_codex":0.000018310822,"about_ca_topic_score_gemma":0.00003339764,"teacher_disagreement_score":0.2684092,"about_ca_system_score_codex":0.00001792732,"about_ca_system_score_gemma":0.000006055413,"threshold_uncertainty_score":0.37006584},"labels":[],"label_agreement":null},{"id":"W3090108601","doi":"10.1109/jiot.2020.3026995","title":"Social Interaction and Information Diffusion in Social Internet of Things: Dynamics, Cloud-Edge, Traceability","year":2020,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"China Scholarship Council; Chongqing Research Program of Basic Research and Frontier Technology; National Natural Science Foundation of China; Chongqing University of Posts and Telecommunications; St. Francis Xavier University","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Cloud computing; Traceability; The Internet; Diffusion; Data science; Artificial intelligence; World Wide Web","score_opus":0.013273484526414341,"score_gpt":0.2736638681415285,"score_spread":0.26039038361511413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090108601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.899761,0.000011765489,0.097099684,0.00073342415,0.00020811992,0.000115222974,0.000004912784,0.000029900682,0.002035931],"genre_scores_gemma":[0.99832696,0.0000044619896,0.0010813302,0.00012236602,0.0004111981,0.0000026199946,0.000017069526,0.000010897829,0.000023128861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983573,0.00012261471,0.00093598926,0.00014820998,0.00026603203,0.00016988699],"domain_scores_gemma":[0.99865025,0.00005985376,0.0009782126,0.00006570203,0.00018242482,0.00006353455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048663237,0.00017028443,0.00043149447,0.00017607717,0.000056720124,0.00010379339,0.00029280045,0.00008232799,0.0001770233],"category_scores_gemma":[0.000025148414,0.00016626528,0.00023342062,0.00017760172,0.00008599227,0.0016100953,0.00014020945,0.0007007108,0.0000022059348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021118019,0.0009875196,0.21285002,0.0004750735,0.0009895564,0.0000069585285,0.23708624,0.000122032754,0.006499429,0.034052137,0.0339901,0.47082913],"study_design_scores_gemma":[0.003998321,0.00094483275,0.03111242,0.0008262054,0.00035801143,0.000034483208,0.012257014,0.8822275,0.018854398,0.04442996,0.003902108,0.0010547547],"about_ca_topic_score_codex":0.0006327686,"about_ca_topic_score_gemma":0.000011274124,"teacher_disagreement_score":0.88210547,"about_ca_system_score_codex":0.00012160355,"about_ca_system_score_gemma":0.000028315679,"threshold_uncertainty_score":0.6780101},"labels":[],"label_agreement":null},{"id":"W3090314173","doi":"10.3233/faia200308","title":"Link Prediction by Analyzing Common Neighbors Based Subgraphs Using Convolutional Neural Network","year":2020,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Convolutional neural network; Link (geometry); Computer science; Artificial intelligence; Computer network","score_opus":0.032152770695778474,"score_gpt":0.2695331497449887,"score_spread":0.23738037904921022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090314173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082995044,0.001096613,0.9892901,0.00026541133,0.0001285389,0.00059482537,0.00028109166,0.000084612075,0.008175773],"genre_scores_gemma":[0.9599505,0.0002589363,0.028850172,0.000331192,0.004280648,0.00040077767,0.003975419,0.000148738,0.0018036204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829626,0.000032326185,0.000678681,0.0005529031,0.00017495274,0.00026490205],"domain_scores_gemma":[0.9991423,0.00006694111,0.00030674314,0.00029420282,0.000070289745,0.00011955392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001394641,0.0003144597,0.00046218644,0.00018893598,0.00030396224,0.00008978095,0.00023873123,0.00015702516,0.00014634985],"category_scores_gemma":[0.0000016303553,0.00037132276,0.00019513088,0.00030283703,0.00024106562,0.000083907085,0.00006942323,0.0005263656,0.0000066153784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042232463,0.00007895013,0.023899995,0.00002434281,0.00023922526,0.0000012457743,0.00004581069,0.04429929,0.00007596845,0.62871236,0.014963949,0.28761664],"study_design_scores_gemma":[0.000021083823,0.000020923115,0.00003239344,0.00006261684,0.00015801708,2.0568324e-7,0.00003680053,0.54295427,0.000104593724,0.42089838,0.035406675,0.00030405278],"about_ca_topic_score_codex":0.00010961374,"about_ca_topic_score_gemma":0.000024128838,"teacher_disagreement_score":0.96044,"about_ca_system_score_codex":0.00007207664,"about_ca_system_score_gemma":0.000057702422,"threshold_uncertainty_score":0.9998739},"labels":[],"label_agreement":null},{"id":"W3090461013","doi":"10.1109/ijcnn48605.2020.9207301","title":"Dynamic Network Link Prediction by Learning Effective Subgraphs using CNN-LSTM","year":2020,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Windsor","funders":"","keywords":"Computer science; Artificial intelligence; Construct (python library); Link (geometry); Convolutional neural network; Dynamic network analysis; Heuristic; Process (computing); Machine learning; Set (abstract data type); Artificial neural network; Data mining","score_opus":0.006617371965421524,"score_gpt":0.23792528196766635,"score_spread":0.23130791000224482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090461013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12325497,0.00014613837,0.8660755,0.00020682404,0.000059629518,0.00035158175,0.000007921119,0.00047477504,0.009422669],"genre_scores_gemma":[0.99396497,0.000004913444,0.005061437,0.000093598355,0.00053994625,0.0000249294,0.00013015095,0.00002850407,0.00015153372],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890256,0.00012152172,0.00022360662,0.00033313764,0.00013382311,0.00028534877],"domain_scores_gemma":[0.99952054,0.00007826597,0.00011356788,0.00013512246,0.00004763231,0.0001048432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013370534,0.0001772166,0.00024687924,0.000034731907,0.00021638825,0.00006165541,0.00012328559,0.00004465528,0.0005789557],"category_scores_gemma":[0.0000035184291,0.00017577146,0.00017711562,0.00045211977,0.000031394255,0.000113445625,0.00008807519,0.0003367341,0.000025292944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008772563,0.00012452318,0.5396623,0.000030680207,0.0011315214,0.0000027883673,0.000590458,0.1795478,0.016011136,0.0091790855,0.033409536,0.22022244],"study_design_scores_gemma":[0.0002531221,0.00013615881,0.0022779838,0.000026344887,0.0001470272,2.854016e-7,0.000116860734,0.9803406,0.00053795415,0.0026738308,0.013224294,0.00026551777],"about_ca_topic_score_codex":0.00017444254,"about_ca_topic_score_gemma":0.000003859493,"teacher_disagreement_score":0.87071,"about_ca_system_score_codex":0.00003421012,"about_ca_system_score_gemma":0.000013149267,"threshold_uncertainty_score":0.71677524},"labels":[],"label_agreement":null},{"id":"W3091083308","doi":"10.1016/j.idm.2020.08.015","title":"A hybrid model for HIV transmission among men who have sex with men","year":2020,"lang":"en","type":"article","venue":"Infectious Disease Modelling","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai Key Laboratory of Acupuncture Mechanism and Acupoint Function; International Development Research Centre","keywords":"Men who have sex with men; Human immunodeficiency virus (HIV); Transmission (telecommunications); Cellular automaton; Computer science; Affect (linguistics); Demography; Geography; Telecommunications; Psychology; Medicine; Sociology; Artificial intelligence; Virology; Communication","score_opus":0.015018660301668246,"score_gpt":0.23560942301726218,"score_spread":0.22059076271559394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091083308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04893701,0.000038594742,0.9398954,0.00016887428,0.0000018120822,0.00059285265,0.00006086028,0.00024974666,0.010054884],"genre_scores_gemma":[0.9955546,0.0000057015054,0.0028760615,0.00007466984,0.00024478507,0.00024835562,0.000119647935,0.00006526013,0.00081087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870056,0.000031418305,0.00025812356,0.00048828905,0.00019376489,0.00032784705],"domain_scores_gemma":[0.9991162,0.000038889448,0.0001071634,0.00024624218,0.00008744471,0.00040407586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007865067,0.0002668832,0.0003224246,0.00006028125,0.00023644711,0.00009689186,0.000150979,0.000022906312,0.00004934365],"category_scores_gemma":[0.0000011215152,0.00024238543,0.0002176565,0.00010065053,0.000038752256,0.00018630468,0.00003535096,0.00015110712,0.0000031054158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010541791,0.000086200416,0.0127437,0.0000337594,0.00015127189,0.0000022604452,0.0004637045,0.97928524,0.000021934238,0.0008588864,0.0031457553,0.003101882],"study_design_scores_gemma":[0.0006013862,0.00004610119,0.000017995637,0.00004431,0.00029518068,1.3583414e-7,0.000041686548,0.98219484,0.00031155942,0.015672836,0.0004575505,0.0003164021],"about_ca_topic_score_codex":0.00013112028,"about_ca_topic_score_gemma":0.0000017668619,"teacher_disagreement_score":0.94661766,"about_ca_system_score_codex":0.00003537212,"about_ca_system_score_gemma":0.00007598556,"threshold_uncertainty_score":0.9884191},"labels":[],"label_agreement":null},{"id":"W3092574271","doi":"10.1145/3320269.3384750","title":"Adversarial Attacks on Link Prediction Algorithms Based on Graph Neural Networks","year":2020,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Adversarial system; Computer science; Heuristics; Exploit; Link (geometry); Graph; Greedy algorithm; Computation; Heuristic; Algorithm; Artificial neural network; Margin (machine learning); Theoretical computer science; Artificial intelligence; Machine learning; Computer security","score_opus":0.016876680145470876,"score_gpt":0.24841388479946455,"score_spread":0.2315372046539937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092574271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040665893,0.0000065989248,0.96852607,0.0024788578,0.0002789761,0.00032376833,0.00002782197,0.00051209837,0.02377921],"genre_scores_gemma":[0.99322194,8.867829e-7,0.0012981994,0.0015543172,0.0035960486,0.000027064405,0.00021181296,0.000024242732,0.000065463624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988239,0.00006913908,0.00024405355,0.00038325536,0.00022789309,0.00025176638],"domain_scores_gemma":[0.99936986,0.00008490586,0.00008268185,0.0002761009,0.00004098542,0.0001454894],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008256146,0.00020681869,0.00022256895,0.00006660033,0.000117981224,0.000055919456,0.00018264251,0.000058089277,0.0010282435],"category_scores_gemma":[0.0000033752685,0.00018427036,0.00026139093,0.0003670707,0.000028106813,0.00006397864,0.0000413595,0.00033934525,0.000026085096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002120118,0.00016105386,0.014843378,0.0000029163266,0.0001237887,0.0000030656395,0.00004372299,0.8138353,0.000023298937,0.003515814,0.050567426,0.11666819],"study_design_scores_gemma":[0.000514769,0.00038161635,0.00093210576,0.00000942872,0.00004888792,4.113697e-8,0.000015054408,0.9927216,0.00017250322,0.00036240122,0.004679231,0.00016233095],"about_ca_topic_score_codex":0.00006299909,"about_ca_topic_score_gemma":0.0000019448073,"teacher_disagreement_score":0.98915535,"about_ca_system_score_codex":0.000018475946,"about_ca_system_score_gemma":0.000013493827,"threshold_uncertainty_score":0.99988496},"labels":[],"label_agreement":null},{"id":"W3092606344","doi":"10.1007/978-3-030-61255-9_16","title":"Canadian Federal Election and Hashtags that Do Not Belong","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Interpretability; Scalability; Modularity (biology); Simple (philosophy); Interpretation (philosophy); Social media; Social network analysis; Perspective (graphical); Data science; World Wide Web; Artificial intelligence","score_opus":0.012999323780317883,"score_gpt":0.23298521891374027,"score_spread":0.2199858951334224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092606344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072206196,0.0001390508,0.98759216,0.0014437642,0.0002534204,0.000267979,0.000012971087,0.000072227165,0.009496338],"genre_scores_gemma":[0.97937214,0.000007096164,0.018753208,0.00084000756,0.0007632893,0.0000061403034,0.000020533342,0.000027239046,0.00021031892],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982286,0.000015276142,0.00021454137,0.0008141671,0.00032235924,0.00040505597],"domain_scores_gemma":[0.9991346,0.00008625992,0.00012411144,0.0003440577,0.00007317534,0.0002377709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018476842,0.00033241915,0.00037079974,0.00040355616,0.0003442885,0.00048720028,0.0004903352,0.000113032176,0.0001281688],"category_scores_gemma":[0.000004304188,0.00032749557,0.00009872424,0.00025663737,0.00021877626,0.00015365238,0.00025007734,0.00059466675,0.000009703908],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005468904,0.000007161868,0.006807528,0.000010584084,0.000041188967,0.000017542636,0.00028531335,0.0012724574,0.00006691206,0.016739035,0.000248541,0.9744983],"study_design_scores_gemma":[0.0005276462,0.00030925334,0.003775268,0.00060295366,0.00010364076,0.00003158766,0.0000017750252,0.3000664,0.0047846125,0.6570537,0.030234993,0.0025081811],"about_ca_topic_score_codex":0.015794378,"about_ca_topic_score_gemma":0.032521006,"teacher_disagreement_score":0.9786501,"about_ca_system_score_codex":0.00023604662,"about_ca_system_score_gemma":0.0003857738,"threshold_uncertainty_score":0.9999177},"labels":[],"label_agreement":null},{"id":"W3094210543","doi":"10.1002/cjs.11573","title":"Local structure graph models with higher‐order dependence","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Sandia National Laboratories; U.S. Department of Energy; National Nuclear Security Administration; National Science Foundation","keywords":"Exponential random graph models; Random graph; Marginal distribution; Markov chain; Graph; Covariate; Mathematics; Mixed graph; Exponential family; Random field; Markov random field; Random variable; Statistical physics; Computer science; Applied mathematics; Discrete mathematics; Econometrics; Statistics; Line graph; Artificial intelligence; Voltage graph","score_opus":0.015002581911616363,"score_gpt":0.2112016067583057,"score_spread":0.19619902484668936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094210543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035344043,0.00008266532,0.9947463,0.0004085891,0.00004127299,0.00004267533,0.00038792987,0.000005278102,0.0007508712],"genre_scores_gemma":[0.9240579,0.0000017663301,0.07545606,0.00022978442,0.00019368266,4.609973e-7,0.000019073701,0.000015930038,0.000025321637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923307,0.000025046415,0.00024466834,0.000105345476,0.00017150598,0.00022039072],"domain_scores_gemma":[0.9987285,0.00003201127,0.00018910127,0.00009981859,0.00032817744,0.00062235666],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000037721053,0.00012356929,0.00022153497,0.000080580976,0.00008423478,0.000061959356,0.00023289004,0.000024754301,0.0011544368],"category_scores_gemma":[0.0000038298826,0.00010399403,0.0000413375,0.00028260003,0.000109584325,0.000110308145,0.000008899127,0.00029252397,0.0000019516497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058895308,0.000020119784,0.027530633,0.000029404364,0.00068504503,0.0005876613,0.0010251473,0.13311511,0.000060306844,0.6961146,0.09358628,0.04718682],"study_design_scores_gemma":[0.0014480572,0.00086763775,0.0055287755,0.00016293497,0.0007198459,0.00007104828,0.0009833553,0.09820961,0.00041046034,0.859706,0.03081398,0.001078319],"about_ca_topic_score_codex":0.0024690598,"about_ca_topic_score_gemma":0.0069041396,"teacher_disagreement_score":0.9205235,"about_ca_system_score_codex":0.00003611514,"about_ca_system_score_gemma":0.0006843196,"threshold_uncertainty_score":0.99975866},"labels":[],"label_agreement":null},{"id":"W3094243415","doi":"10.1089/big.2020.0086","title":"Classifying Dissemination Processes in Temporal Graphs","year":2020,"lang":"en","type":"article","venue":"Big Data","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Scalability; Theoretical computer science; Graph kernel; Graph; Lift (data mining); Machine learning; Artificial intelligence; Data mining; Kernel method; Support vector machine","score_opus":0.1329156020015627,"score_gpt":0.3348034003390676,"score_spread":0.2018877983375049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094243415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6953308,0.0010408009,0.26595205,0.00827566,0.00022877338,0.0011983709,0.0013233997,0.0007922439,0.025857924],"genre_scores_gemma":[0.997071,0.000005222317,0.0009992524,0.00003714176,0.00021551234,0.000009976208,0.001633858,0.0000074854383,0.000020496216],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994105,0.00001727413,0.00014217797,0.00023960807,0.000088270295,0.00010214166],"domain_scores_gemma":[0.99953115,0.00003390923,0.000056694593,0.00031952173,0.000022347105,0.00003636521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000790669,0.00006993443,0.00010497208,0.00004248873,0.000030690586,0.000042876185,0.00039876826,0.000012723933,0.00006148335],"category_scores_gemma":[0.00002277973,0.000067224806,0.000016755599,0.00052836456,0.0000142091785,0.00017733964,0.00025306598,0.0000758045,0.000008704324],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001134815,0.000114479524,0.69433683,0.000058719223,0.000037314443,0.0000033488514,0.0003651621,0.000008227876,0.00077083847,0.0026096788,0.045187637,0.25649643],"study_design_scores_gemma":[0.0016591336,0.00019604643,0.13400042,0.00084948447,0.00029653605,0.0000013618246,0.0025991776,0.12999329,0.011476356,0.04780913,0.6687751,0.0023439892],"about_ca_topic_score_codex":0.00011560389,"about_ca_topic_score_gemma":0.00008431696,"teacher_disagreement_score":0.6235874,"about_ca_system_score_codex":0.0000046207,"about_ca_system_score_gemma":0.000030245748,"threshold_uncertainty_score":0.2741348},"labels":[],"label_agreement":null},{"id":"W3094462252","doi":"10.1101/2020.10.17.20214312","title":"Echo chambers as early warning signals of widespread vaccine refusal in social-epidemiological networks","year":2020,"lang":"en","type":"preprint","venue":"medRxiv","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Warning system; Epidemiology; Outbreak; Disease; Infectious disease (medical specialty); Modularity (biology); Public health; Social network (sociolinguistics); Early warning system; Cluster analysis; Population; Computer science; Econometrics; Medicine; Environmental health; Psychology; Virology; Biology; Social media; Pathology; Artificial intelligence; Mathematics; Evolutionary biology; Telecommunications","score_opus":0.03916116851817469,"score_gpt":0.3246278116519312,"score_spread":0.2854666431337565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094462252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95824456,0.0002361332,0.03569456,0.0008091706,0.00012769566,0.00049545127,0.000017033835,0.0001795156,0.004195878],"genre_scores_gemma":[0.996644,0.000029707644,0.0017835901,0.00012423989,0.0010060221,0.00012309907,0.00016487861,0.000053777854,0.00007069251],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99641794,0.0007149466,0.0012045644,0.0008531323,0.00027879066,0.0005306311],"domain_scores_gemma":[0.9976805,0.00061975466,0.00094452343,0.0005104704,0.00010627033,0.00013849887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012987526,0.0005132629,0.0016979929,0.00014897862,0.00010604842,0.00005467292,0.0007183877,0.00035708686,0.00061701675],"category_scores_gemma":[0.000119611774,0.0004810171,0.0006461951,0.00050890853,0.00009148494,0.000054194436,0.0011538637,0.0017895271,0.000017409076],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095217416,0.00014032869,0.96535057,0.00004950124,0.0004452502,0.000019134572,0.00061830727,0.018567545,0.00071973697,0.004558627,0.0027072984,0.006728476],"study_design_scores_gemma":[0.0013341022,0.00040972218,0.52681684,0.0013033845,0.00065045344,0.0000014166152,0.00021846034,0.18275079,0.0022859282,0.27805188,0.0038874552,0.002289546],"about_ca_topic_score_codex":0.0013380744,"about_ca_topic_score_gemma":0.000018270839,"teacher_disagreement_score":0.43853372,"about_ca_system_score_codex":0.00006158286,"about_ca_system_score_gemma":0.000093393865,"threshold_uncertainty_score":0.99976414},"labels":[],"label_agreement":null},{"id":"W3094482902","doi":"10.18280/ria.340417","title":"Real-Time Opinion Prediction Method for Emergency Public Events in Social Media Networks Using Opinion Hit Matrix","year":2020,"lang":"en","type":"article","venue":"Revue d intelligence artificielle","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Public opinion; Computer science; Social media; Sentiment analysis; Ideology; Event (particle physics); Social network (sociolinguistics); Measure (data warehouse); Matrix (chemical analysis); TRACE (psycholinguistics); Data science; Data mining; Artificial intelligence; World Wide Web; Political science","score_opus":0.08435431171930585,"score_gpt":0.3612439984129118,"score_spread":0.276889686693606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094482902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081119435,0.000093028444,0.98945147,0.0005496366,0.00044634813,0.00055736734,0.00004021915,0.00012666902,0.00062333164],"genre_scores_gemma":[0.9747101,0.0001428644,0.020587444,0.000017224203,0.0037552523,0.00013065233,0.0004941044,0.00005922316,0.0001031475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978751,0.00017990415,0.0008057784,0.0005172647,0.00017045304,0.00045149712],"domain_scores_gemma":[0.99904335,0.0001774451,0.00029067317,0.00023176704,0.00013344991,0.0001232918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006058662,0.00022717634,0.0003898434,0.00014076338,0.00024303568,0.000032415144,0.00032297985,0.00010529592,0.00084035815],"category_scores_gemma":[0.000047521396,0.00025911664,0.0002814319,0.0009577914,0.00002384447,0.00021461946,0.00012331456,0.00021740199,0.00003465448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033009646,0.0011184266,0.043829527,0.00030037653,0.0004601796,0.0000017028233,0.008466396,0.559146,0.023665069,0.088747345,0.026180873,0.24775405],"study_design_scores_gemma":[0.00006836231,0.00004465713,0.00020433043,0.000045132085,0.000025252604,4.1297756e-7,0.0003746068,0.9871733,0.0010480013,0.007855288,0.002936534,0.00022411122],"about_ca_topic_score_codex":0.000118441465,"about_ca_topic_score_gemma":0.00000613766,"teacher_disagreement_score":0.968864,"about_ca_system_score_codex":0.00008198062,"about_ca_system_score_gemma":0.000044179527,"threshold_uncertainty_score":0.9999861},"labels":[],"label_agreement":null},{"id":"W3095942026","doi":"10.1561/9781680837391","title":"Extracting, Mining and Predicting Users’ Interests from Social Media","year":2020,"lang":"en","type":"book","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Popularity; Social media; Computer science; Benchmark (surveying); World Wide Web; Variety (cybernetics); Data science; Preference; User-generated content; Internet privacy; Artificial intelligence; Political science","score_opus":0.030649282225303585,"score_gpt":0.2654444813080602,"score_spread":0.23479519908275662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095942026","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014497467,0.00018926534,0.006562428,0.00019664981,0.00021889736,0.00022593662,0.000177461,0.00047164777,0.97746027],"genre_scores_gemma":[0.81480414,0.000014087179,0.013634803,0.00018713795,0.018013153,0.000038801594,0.0023974443,0.00022370506,0.15068676],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998684,0.00003765909,0.0003776103,0.0004862709,0.0001993215,0.00021513889],"domain_scores_gemma":[0.998804,0.0005345888,0.00035491024,0.0001650967,0.000039761522,0.000101696525],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008255027,0.00032052654,0.0005367834,0.000069594746,0.00013568919,0.00013638912,0.00022746282,0.00014032364,0.0021298465],"category_scores_gemma":[0.000015071054,0.0003309828,0.00019702355,0.000052128187,0.000058511494,0.00008745981,0.0003360956,0.00046090622,0.000013797674],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018628838,0.000038644623,0.036302797,0.000028724136,0.0013948032,0.000016073607,0.008477631,7.4750034e-7,0.000069588095,0.010425667,0.7306804,0.21254629],"study_design_scores_gemma":[0.0013885319,0.00009247047,0.0066257557,0.0013586343,0.0027582736,0.000002090563,0.0062924903,0.009317618,0.00035643237,0.13318093,0.83524394,0.0033828074],"about_ca_topic_score_codex":0.0001353381,"about_ca_topic_score_gemma":0.00020914341,"teacher_disagreement_score":0.8267735,"about_ca_system_score_codex":0.000041457355,"about_ca_system_score_gemma":0.0000882053,"threshold_uncertainty_score":0.9999142},"labels":[],"label_agreement":null},{"id":"W3098636080","doi":"","title":"NETWORKS AS RENORMALIZED MODELS FOR EMERGENT BEHAVIOR IN PHYSICAL SYSTEMS","year":2005,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique","keywords":"Aftershock; Induced seismicity; Complex network; Statistical physics; Merge (version control); Geology; Sunspot; Physics; Seismology; Computer science; Magnetic field","score_opus":0.030174742478612286,"score_gpt":0.3249338939956073,"score_spread":0.294759151516995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098636080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11287464,0.0004624285,0.86298376,0.00007716454,0.00044722026,0.0036420238,0.00008365089,0.00031840973,0.019110672],"genre_scores_gemma":[0.98765934,0.000027746344,0.0030614706,0.000018214883,0.0024449367,0.004248491,0.0006605628,0.0000693138,0.0018099406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976929,0.00009076047,0.00072255806,0.00072107086,0.00024322073,0.00052950805],"domain_scores_gemma":[0.99855363,0.00006833808,0.00031333163,0.0008128295,0.0001308143,0.00012104242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025967552,0.00048174217,0.00096920825,0.00017408082,0.000076273696,0.00012893025,0.0005331298,0.00018073322,0.00025385854],"category_scores_gemma":[0.0000013174617,0.0004617305,0.000737262,0.00016969394,0.000028234332,0.00009226903,0.00061591313,0.00059229945,0.000008995625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004120523,0.0006509437,0.0013779113,0.000031624386,0.000216469,0.0000012854183,0.000104297396,0.8948137,0.000014371346,0.08581357,0.006311157,0.010623455],"study_design_scores_gemma":[0.00035897075,0.000033851687,0.000064952044,0.00008501866,0.00027454103,2.4607596e-7,0.000054670032,0.9722085,0.000056381352,0.024483005,0.0018701876,0.00050966826],"about_ca_topic_score_codex":0.0036547247,"about_ca_topic_score_gemma":0.00009179678,"teacher_disagreement_score":0.8747847,"about_ca_system_score_codex":0.000115308954,"about_ca_system_score_gemma":0.000080560734,"threshold_uncertainty_score":0.99978346},"labels":[],"label_agreement":null},{"id":"W3098982997","doi":"","title":"Adjusting for Network Size and Composition Effects in Exponential-Family Random Graph Models.","year":2011,"lang":"en","type":"article","venue":"Research Online (University of Wollongong)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Fundação para a Ciência e a Tecnologia; National Sanitarium Association; University of Washington; National Institutes of Health; National Science Foundation","keywords":"Exponential random graph models; Homophily; Random graph; Exponential family; Mathematics; Exponential function; Social network (sociolinguistics); Graph; Theoretical computer science; Econometrics; Statistics; Computer science; Discrete mathematics; Combinatorics; Social media","score_opus":0.06679487743711192,"score_gpt":0.29622284454439307,"score_spread":0.22942796710728114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098982997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8762299,0.00019196789,0.12174872,0.00005740372,0.00001705567,0.00060942967,0.00002366661,0.00003249514,0.0010893792],"genre_scores_gemma":[0.9655531,0.000054402215,0.03412841,0.0000044924805,0.000099420584,0.0000038451794,0.000060388807,0.00001236835,0.000083575236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987031,0.0002423315,0.00015179373,0.00028640433,0.000222526,0.000393819],"domain_scores_gemma":[0.99872595,0.0006761992,0.00008946289,0.0002102979,0.00020011929,0.00009794847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081403047,0.0001188627,0.00034797407,0.00025296843,0.00025300955,0.000013828559,0.00025587218,0.000052672232,0.00003929641],"category_scores_gemma":[0.00001253121,0.00014042525,0.0001539688,0.0005991352,0.00017472255,0.00021429954,0.0002366497,0.00025080636,7.3166774e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01716659,0.009047717,0.24997184,0.0019204605,0.0035090544,0.00020622202,0.02218795,0.024882767,0.052762624,0.28284332,0.016486414,0.31901506],"study_design_scores_gemma":[0.015987093,0.0009096124,0.18963586,0.0011476867,0.0003518638,0.0000018048191,0.006752267,0.43932933,0.00092760596,0.3436632,0.00035126798,0.000942433],"about_ca_topic_score_codex":0.0031512151,"about_ca_topic_score_gemma":0.00036640986,"teacher_disagreement_score":0.41444653,"about_ca_system_score_codex":0.000028728318,"about_ca_system_score_gemma":0.000039691105,"threshold_uncertainty_score":0.57263756},"labels":[],"label_agreement":null},{"id":"W309977538","doi":"10.1007/978-3-319-16549-3_14","title":"An Experimental Evaluation of Multi-objective Evolutionary Algorithms for Detecting Critical Nodes in Complex Networks","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Evolutionary algorithm; Pairwise comparison; Benchmark (surveying); Algorithm; Complex network; Task (project management); Node (physics); Graph; Theoretical computer science; Artificial intelligence","score_opus":0.08116319810565686,"score_gpt":0.37909890846291655,"score_spread":0.2979357103572597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W309977538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013097868,0.0005018689,0.9969652,0.000015329313,0.00018755707,0.00065491773,0.00001902202,0.00003364501,0.00031265712],"genre_scores_gemma":[0.7659595,3.8681017e-7,0.23344189,0.000018251907,0.0004536582,0.000051751093,0.00005036861,0.000021478896,0.0000027408282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975703,0.00009909039,0.00049113785,0.00078153214,0.00067942933,0.0003785511],"domain_scores_gemma":[0.9980491,0.000437551,0.00021287252,0.000435892,0.0007774462,0.00008713844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015661141,0.00031520074,0.00049008324,0.00043358578,0.00014048503,0.00006817642,0.0005642538,0.00013463713,0.00006369757],"category_scores_gemma":[0.000049248294,0.00032519005,0.00013276146,0.00029112256,0.0005133075,0.0002359036,0.00023548571,0.00037435885,6.090806e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022967055,0.00020164662,0.0009889437,0.000009125216,0.000022606971,0.0000010600661,0.00054690684,0.6104461,0.0005361372,0.003222018,0.000011200808,0.3839913],"study_design_scores_gemma":[0.0004007268,0.00015151799,0.00044876014,0.00012221915,0.000030880354,0.0000014502461,0.000006049329,0.9195794,0.00086263445,0.07809407,0.0000124833305,0.00028979208],"about_ca_topic_score_codex":0.00014789305,"about_ca_topic_score_gemma":0.00008184921,"teacher_disagreement_score":0.7646497,"about_ca_system_score_codex":0.00046495357,"about_ca_system_score_gemma":0.00030098276,"threshold_uncertainty_score":0.99992},"labels":[],"label_agreement":null},{"id":"W3100780777","doi":"10.1007/s10115-017-1033-5","title":"Measuring in-network node similarity based on neighborhoods: a unified parametric approach","year":2017,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Similarity (geometry); Node (physics); Parametric statistics; Data mining; Computer science; Mathematics; Artificial intelligence; Theoretical computer science; Statistics; Engineering","score_opus":0.035922509109027265,"score_gpt":0.26357355829460927,"score_spread":0.227651049185582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100780777","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027854437,0.00022003979,0.11828813,0.000040963674,0.00026961789,0.00076008093,0.000016114016,0.00011713239,0.8524335],"genre_scores_gemma":[0.9991258,0.0000044417284,0.0003777813,0.000025002368,0.00026805326,0.0000834171,0.00005267543,0.000007360219,0.000055496268],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989369,0.0000812262,0.0004409619,0.00014623307,0.00016001717,0.00023467984],"domain_scores_gemma":[0.99886584,0.000078863515,0.0003296306,0.0005388466,0.000115691895,0.000071150396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006989116,0.00016337047,0.00030235277,0.0002566765,0.0003724841,0.00046074964,0.00025415234,0.00006203987,0.000010330271],"category_scores_gemma":[0.000026642114,0.00014800798,0.00007182231,0.0002919956,0.00003225714,0.00091834145,0.00007827558,0.00018442581,0.000031614218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008039953,0.00038202922,0.72442025,0.00040136444,0.00014408177,6.3559213e-7,0.0011577219,0.059307795,0.0000037540333,0.14670832,0.006690133,0.060703482],"study_design_scores_gemma":[0.000705482,0.000027796437,0.04609686,0.00017648148,0.000021246045,3.281978e-7,0.00015769467,0.9278237,0.000021003776,0.00037426062,0.024343051,0.00025205273],"about_ca_topic_score_codex":0.00021879752,"about_ca_topic_score_gemma":0.0000066840375,"teacher_disagreement_score":0.97127134,"about_ca_system_score_codex":0.00004456388,"about_ca_system_score_gemma":0.00004135212,"threshold_uncertainty_score":0.603559},"labels":[],"label_agreement":null},{"id":"W3101385294","doi":"10.1109/tcss.2020.3026515","title":"Corrections to “A Social Crowdsourcing Community Case Study: Interaction Patterns, Evolution, and Factors That Affect Them” [Jun 20 659-671]","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Social Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Calgary","funders":"","keywords":"Crowdsourcing; Affect (linguistics); Computer science; World Wide Web; Psychology; Communication","score_opus":0.06591660378111841,"score_gpt":0.31328156051983835,"score_spread":0.24736495673871994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101385294","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50819725,0.0000017973338,0.4906967,0.00012310705,0.00024955499,0.00040896566,0.00013083154,0.00012549016,0.00006633346],"genre_scores_gemma":[0.99908984,1.5296737e-7,0.00008375118,0.00005475941,0.0005219035,0.0001383915,0.00004635587,0.00003493249,0.000029895189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.9980077,0.0007280925,0.0003778866,0.00031898817,0.00033777315,0.00022956583],"domain_scores_gemma":[0.99898034,0.00040794144,0.00019247213,0.00010887569,0.00016377644,0.00014659826],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00023384615,0.00027418704,0.00039187164,0.00013397081,0.002704142,0.00022733325,0.00014041863,0.000067461486,0.00008851644],"category_scores_gemma":[0.0000022188635,0.00029740174,0.00021821566,0.0004847214,0.000047029036,0.0002005214,0.000009560647,0.0005961702,0.00001753886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002291912,0.0029701146,0.28101128,0.00012744355,0.0024898094,0.000042354273,0.11376149,0.57393724,0.00022418905,0.0011443304,0.0038007295,0.020261813],"study_design_scores_gemma":[0.0033363544,0.0013093947,0.106751904,0.0002170061,0.0013694315,0.00012348122,0.5060874,0.3756505,0.00037322735,0.001338438,0.0009846963,0.0024581363],"about_ca_topic_score_codex":0.01473357,"about_ca_topic_score_gemma":0.0008411458,"teacher_disagreement_score":0.49089262,"about_ca_system_score_codex":0.00023116104,"about_ca_system_score_gemma":0.000044120625,"threshold_uncertainty_score":0.9999478},"labels":[],"label_agreement":null},{"id":"W3102896499","doi":"10.3390/fi11020041","title":"A Scheme to Design Community Detection Algorithms in Various Networks","year":2019,"lang":"en","type":"article","venue":"Future Internet","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Scheme (mathematics); Phone; Focus (optics); Set (abstract data type); Graph; Similarity (geometry); Algorithm; Community structure; Theoretical computer science; Data mining; Distributed computing; Artificial intelligence","score_opus":0.011320237471714551,"score_gpt":0.2492181382243821,"score_spread":0.23789790075266756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102896499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2326757,0.000029723467,0.7642232,0.000060925508,0.0003038768,0.00036403473,0.0000020668353,0.00009154271,0.0022489028],"genre_scores_gemma":[0.98543984,8.450648e-7,0.013186462,0.00013810111,0.0007180971,0.000054460023,0.000022951635,0.000020353611,0.00041890037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990206,0.00022311788,0.00022029999,0.00019482862,0.0000965853,0.0002445809],"domain_scores_gemma":[0.9993477,0.000071123155,0.00006685888,0.00041047158,0.00004184091,0.00006204596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034525376,0.0001599512,0.00023156556,0.000120295685,0.000037114878,0.000057644393,0.0003336688,0.00006477281,0.0005771117],"category_scores_gemma":[0.0000023129758,0.00015641144,0.00008914859,0.00035502232,0.000010320032,0.00007124641,0.00016504122,0.00060785265,0.00012622839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047960985,0.0012057059,0.17641936,0.000032748878,0.00068803615,0.000013175763,0.0063759005,0.022858413,0.0054654176,0.011506868,0.045575067,0.7293797],"study_design_scores_gemma":[0.0014419695,0.00094265485,0.032579508,0.00025776098,0.00006946464,0.0000068762815,0.0013633829,0.8515546,0.010666803,0.010930316,0.088876665,0.001310055],"about_ca_topic_score_codex":0.002434633,"about_ca_topic_score_gemma":0.00048551953,"teacher_disagreement_score":0.82869613,"about_ca_system_score_codex":0.00006774465,"about_ca_system_score_gemma":0.000010896327,"threshold_uncertainty_score":0.63782734},"labels":[],"label_agreement":null},{"id":"W3105461218","doi":"","title":"Provable Overlapping Community Detection in Weighted Graphs","year":2020,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairwise comparison; Computer science; Node (physics); Task (project management); Community structure; Artificial intelligence; Social network analysis; Theoretical computer science; Machine learning; Mathematics; Combinatorics; Social media","score_opus":0.05348837911202976,"score_gpt":0.18182814974097153,"score_spread":0.12833977062894175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105461218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9284007,0.0000044080807,0.064081594,0.000029006293,0.000016445765,0.00013014163,0.0000025756706,0.00012006564,0.00721509],"genre_scores_gemma":[0.9996801,0.0000029701787,0.00010718637,0.00004825565,0.00003575782,8.1741786e-7,0.000011187616,0.000009478261,0.00010422826],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928427,0.00016265425,0.00011635605,0.00022057563,0.000032157255,0.00018399443],"domain_scores_gemma":[0.99952346,0.00004199583,0.000075940516,0.0002444177,0.00003805062,0.00007613669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114544826,0.00011479808,0.00016886945,0.000108443775,0.00017235098,0.00002131116,0.0002477583,0.000032328553,0.00015452736],"category_scores_gemma":[0.0000034307936,0.00013953497,0.000106084975,0.001163617,0.00003889643,0.00019607655,0.00012766977,0.00035672446,0.000022348815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023383327,0.0006483451,0.6007966,0.000056219702,0.00036591373,0.000048870017,0.001448244,0.016347947,0.01057216,0.3542957,0.0007760907,0.014410085],"study_design_scores_gemma":[0.0015439045,0.00019865595,0.021259395,0.000057553218,0.00013995537,4.7196124e-7,0.0019880303,0.76936364,0.008167975,0.19329455,0.0032681979,0.00071767234],"about_ca_topic_score_codex":0.0014883188,"about_ca_topic_score_gemma":0.00022781349,"teacher_disagreement_score":0.7530157,"about_ca_system_score_codex":0.00004566072,"about_ca_system_score_gemma":0.000016843407,"threshold_uncertainty_score":0.5690071},"labels":[],"label_agreement":null},{"id":"W3105546395","doi":"10.1007/978-3-319-89932-9_9","title":"Dynamics of Large-Scale Networks Following a Merger","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Network dynamics; Server; Observable; Dynamics (music); Network structure; Scale (ratio); Distributed computing; Computer network; Physics; Mathematics; Geography; Cartography","score_opus":0.007738008696039682,"score_gpt":0.25949241460835437,"score_spread":0.2517544059123147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105546395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035654395,0.001003596,0.912541,0.00012984754,0.00059644255,0.0004541432,0.000056294346,0.00012019287,0.084741965],"genre_scores_gemma":[0.983066,0.000047355214,0.0021385,0.00016767446,0.008857142,0.000034121284,0.0009848876,0.0002200157,0.004484267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971737,0.00008587575,0.0008990985,0.000687199,0.00038058162,0.0007735365],"domain_scores_gemma":[0.9982101,0.0003078483,0.00069263845,0.00055962557,0.00014447694,0.00008532647],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044171087,0.00070876075,0.0014173834,0.00020310776,0.00026938994,0.000052939416,0.0005500602,0.0009840592,0.002050304],"category_scores_gemma":[0.00000759637,0.0007462491,0.0012816485,0.00032305095,0.00020316495,0.000062230196,0.00033845843,0.0015161271,0.0000074068253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038867307,0.00070623367,0.041263975,0.00014464746,0.007584616,0.00007117433,0.0046820543,0.3298319,0.000013847214,0.27915883,0.049181316,0.28697273],"study_design_scores_gemma":[0.0007199213,0.00009327326,0.0001739292,0.00063073356,0.00091572275,6.155291e-7,0.000034615718,0.5839988,0.00001145294,0.39238048,0.019426191,0.0016142543],"about_ca_topic_score_codex":0.00008493647,"about_ca_topic_score_gemma":0.0014028702,"teacher_disagreement_score":0.98270947,"about_ca_system_score_codex":0.00018321307,"about_ca_system_score_gemma":0.00006196459,"threshold_uncertainty_score":0.99949884},"labels":[],"label_agreement":null},{"id":"W3106364367","doi":"10.1016/j.ipm.2020.102434","title":"User and item-aware estimation of review helpfulness","year":2020,"lang":"en","type":"article","venue":"Information Processing & Management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Independent Electricity System Operator; Università degli Studi di Torino","keywords":"Helpfulness; Computer science; Quality (philosophy); Recommender system; Data mining; Machine learning; Artificial intelligence; Psychology","score_opus":0.010431339372848732,"score_gpt":0.261754455847965,"score_spread":0.25132311647511624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106364367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039317166,0.0005870968,0.9808778,0.0014177912,0.000013727035,0.000499125,0.000006023718,0.00011699183,0.012549737],"genre_scores_gemma":[0.9941638,0.00006696822,0.0048192567,0.0007594618,0.000019437919,0.000047134705,0.000085977,0.0000042924194,0.000033644796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993457,0.000011221441,0.00034620217,0.00007265301,0.0001498779,0.000074347015],"domain_scores_gemma":[0.9995368,0.0000075800167,0.0002566848,0.00008963364,0.00007734011,0.0000319734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113697635,0.00008082054,0.00014496257,0.00005068802,0.000056757868,0.00006174469,0.0000896033,0.000009240309,0.00009999514],"category_scores_gemma":[0.000004097142,0.00007622642,0.000031414464,0.0002752909,0.000016254962,0.0007796958,0.00008168699,0.000041079715,0.00001120413],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003028009,0.000009759702,0.00050453166,0.0028982686,0.000029208586,7.800278e-8,0.00025936717,0.00052123726,8.4224115e-7,0.005661686,0.0037519708,0.98636],"study_design_scores_gemma":[0.0010713616,0.00008142264,0.007949864,0.007093225,0.0007305527,0.0000010169127,0.0016377476,0.7758739,0.0014267365,0.009458067,0.1938481,0.0008279742],"about_ca_topic_score_codex":0.000005856221,"about_ca_topic_score_gemma":9.532982e-8,"teacher_disagreement_score":0.9902321,"about_ca_system_score_codex":0.0000077600525,"about_ca_system_score_gemma":0.000008341128,"threshold_uncertainty_score":0.3108423},"labels":[],"label_agreement":null},{"id":"W3110151778","doi":"10.1155/2020/3976910","title":"Simulation Study on Cascading Failure of Multimodal Transport Network","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cascading failure; Scalability; Computer science; Node (physics); Transport network; Flow network; Multimodal transport; Computer network; Distributed computing; Engineering; Transport engineering; Mathematical optimization; Mathematics; Electric power system","score_opus":0.015113700737831347,"score_gpt":0.2882327332728946,"score_spread":0.27311903253506326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110151778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81797296,0.000018677434,0.18160619,0.00009631897,0.000047271114,0.00019699772,0.000008157149,0.000014950012,0.000038469017],"genre_scores_gemma":[0.9914689,0.0000018230587,0.008001907,0.000027821692,0.0004505863,0.0000030611277,0.000026989637,0.000017024186,0.0000018596263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9986606,0.000037211234,0.00073643617,0.00013626782,0.00030532398,0.00012414223],"domain_scores_gemma":[0.9988305,0.00010341428,0.00068362465,0.000090675596,0.00021376144,0.00007805518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001447462,0.0001357118,0.0003713815,0.000068319554,0.000046683443,0.000005727043,0.00011557773,0.000025102363,0.000062434854],"category_scores_gemma":[0.0000043326663,0.00012633842,0.0002332343,0.0003365795,0.000013875252,0.00025129665,0.0000011338724,0.00021056629,6.400881e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022967826,0.00018136826,0.097595446,0.00000682606,0.00012859257,0.0000061214632,0.0028507025,0.8932328,0.0013217262,0.00022644101,0.000017314103,0.0042029913],"study_design_scores_gemma":[0.0045108353,0.0027493911,0.94682246,0.00026129925,0.00068767846,4.0549745e-7,0.005992988,0.030607013,0.0042567127,0.0024336257,0.0011969343,0.00048067875],"about_ca_topic_score_codex":0.000012101221,"about_ca_topic_score_gemma":0.000026691285,"teacher_disagreement_score":0.8626258,"about_ca_system_score_codex":0.000014297976,"about_ca_system_score_gemma":0.00002439285,"threshold_uncertainty_score":0.5151931},"labels":[],"label_agreement":null},{"id":"W3110535306","doi":"10.1145/3423067","title":"BiNeTClus","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Intelligent Systems and Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Bipartite graph; Modularity (biology); Theoretical computer science; Transformation (genetics); Data mining; Graph","score_opus":0.02302654267139166,"score_gpt":0.2591309411811335,"score_spread":0.23610439850974185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110535306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020311467,0.00035171502,0.97274816,0.004407775,0.00011378844,0.00028540194,0.00001897189,0.00045610673,0.0013066249],"genre_scores_gemma":[0.9986294,0.000042318257,0.00086559233,0.00006055232,0.00008659007,0.000085831234,0.0000046598525,0.000015916914,0.00020916492],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991784,0.000020326745,0.00025232226,0.0002871371,0.00008224115,0.00017955423],"domain_scores_gemma":[0.9993972,0.000042714775,0.00006294663,0.00037207114,0.00004816687,0.00007690485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045487202,0.00014750611,0.0002415052,0.00019225614,0.00012951477,0.000032630673,0.00025994392,0.000077509394,0.00030174726],"category_scores_gemma":[0.0000042247793,0.00013528678,0.00006948048,0.0005423317,0.00007208606,0.00003631775,0.000015995909,0.00024555126,0.00007628041],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004256739,0.0003255903,0.008854496,0.0000625544,0.00081656914,0.000009379749,0.00037474997,0.0020686167,0.0021662244,0.22229078,0.0030635365,0.75992495],"study_design_scores_gemma":[0.0012748677,0.0019703812,0.00014923261,0.00028135005,0.000581282,0.00004423846,0.006930548,0.06383536,0.100862056,0.09312176,0.7290025,0.0019464243],"about_ca_topic_score_codex":0.00013575573,"about_ca_topic_score_gemma":0.0000038448807,"teacher_disagreement_score":0.9783179,"about_ca_system_score_codex":0.000012334414,"about_ca_system_score_gemma":0.000010826436,"threshold_uncertainty_score":0.5516835},"labels":[],"label_agreement":null},{"id":"W3111677499","doi":"10.2139/ssrn.3664022","title":"Network Centralization and Collective Adaptability to a Shifting Environment","year":2020,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Adaptability; Business; Computer science; Economics; Management","score_opus":0.010731247311177366,"score_gpt":0.2192733988520056,"score_spread":0.20854215154082825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111677499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20136853,0.00039008964,0.7951565,0.0016964461,0.000020791687,0.00025535538,0.0000023255288,0.000037881277,0.0010720897],"genre_scores_gemma":[0.99739933,0.00005651178,0.0016933967,0.00012891418,0.0006119352,0.000009498757,0.00000433748,0.000014563007,0.00008150485],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824816,0.00009731034,0.00021819008,0.00022262786,0.0001410821,0.0010726376],"domain_scores_gemma":[0.9996058,0.000030497873,0.000102260325,0.00008622599,0.00002458215,0.00015065844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004872334,0.00012505281,0.00017722689,0.00002398117,0.00024024138,0.000056383215,0.000116892625,0.000019571993,0.00015212901],"category_scores_gemma":[0.000007775572,0.00012311473,0.0000693174,0.00025119903,0.000015054271,0.00007700794,0.00007803796,0.0005600048,0.000007203007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021296414,0.00012447523,0.46461198,0.0000068345034,0.0007312866,0.0000014290229,0.0021645853,0.021578223,0.0006411966,0.38092622,0.002603109,0.1263977],"study_design_scores_gemma":[0.0006799008,0.00065006164,0.016134858,0.000025280558,0.0001756654,0.000009315047,0.0017792687,0.014953172,0.00020270514,0.9581707,0.006714952,0.0005040809],"about_ca_topic_score_codex":0.00003694128,"about_ca_topic_score_gemma":0.000026585647,"teacher_disagreement_score":0.7960308,"about_ca_system_score_codex":0.00037407776,"about_ca_system_score_gemma":0.00030739314,"threshold_uncertainty_score":0.5020473},"labels":[],"label_agreement":null},{"id":"W3114604258","doi":"10.1007/978-3-030-65347-7_2","title":"Efficient Community Detection by Exploiting Structural Properties of Real-World User-Item Graphs","year":2020,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Computer science; Cluster analysis; Community structure; Theoretical computer science; Graph; Algorithm; Data mining; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.09922098142906219,"score_gpt":0.33659847758390427,"score_spread":0.23737749615484208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114604258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2776459,0.011726535,0.44857183,0.00064452447,0.0017896388,0.004848785,0.00078913406,0.0010139719,0.25296968],"genre_scores_gemma":[0.9969641,0.000042829768,0.0014378901,0.000026648993,0.000100051344,0.000034950743,0.0000757687,0.000033325072,0.0012844556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981791,0.00010928775,0.0008300067,0.00032511383,0.00036037428,0.00019615763],"domain_scores_gemma":[0.9982589,0.00054646307,0.00052317104,0.00022806102,0.00040434086,0.0000390863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002494068,0.00035172547,0.0006416509,0.0002428025,0.00029134026,0.00002313682,0.00034495708,0.000047724938,0.000047693426],"category_scores_gemma":[0.000024744671,0.00033900476,0.00021511732,0.00022613714,0.00043784527,0.000037853715,0.00044293527,0.0006947138,0.000005469809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008924482,0.00010362897,0.001808869,0.00045933487,0.0015756031,0.0000034074822,0.004457615,0.27457485,0.00023048346,0.65724826,0.0007402448,0.0587085],"study_design_scores_gemma":[0.00015185753,0.00020420969,0.00025352524,0.0019230647,0.00021315673,0.000001474957,0.0045180777,0.20477186,0.0076413904,0.7784291,0.0007863192,0.0011059828],"about_ca_topic_score_codex":0.0005375027,"about_ca_topic_score_gemma":0.0002620264,"teacher_disagreement_score":0.7193182,"about_ca_system_score_codex":0.00013965408,"about_ca_system_score_gemma":0.000033039767,"threshold_uncertainty_score":0.9999062},"labels":[],"label_agreement":null},{"id":"W3114650575","doi":"10.1080/00031305.2020.1865199","title":"Hurdle Blockmodels for Sparse Network Modeling","year":2020,"lang":"en","type":"article","venue":"The American Statistician","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Model selection; Variety (cybernetics); Selection (genetic algorithm); Random graph; Goodness of fit; Exponential random graph models; Graph; Data mining; Theoretical computer science; Machine learning; Artificial intelligence","score_opus":0.04329076685591112,"score_gpt":0.3001625163344384,"score_spread":0.2568717494785273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114650575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017631212,0.000025372152,0.979324,0.0010447733,0.000019638595,0.00027025078,0.000104592466,0.00009293598,0.0014872623],"genre_scores_gemma":[0.9334259,0.0000025452405,0.06401696,0.0012934686,0.0010777788,0.00007389074,0.000046003268,0.000030672993,0.000032803295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989897,0.00006087274,0.00024321605,0.00023966611,0.00011914429,0.00034738678],"domain_scores_gemma":[0.99919593,0.00020496268,0.00018048345,0.00026232688,0.000056938046,0.00009936135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001311728,0.00015064691,0.00032069092,0.000014722623,0.00021938521,0.000048387406,0.00030740132,0.000006558869,0.00009768749],"category_scores_gemma":[0.000010132784,0.00012031805,0.00011526501,0.000323028,0.00010967064,0.00003121189,0.00008104471,0.00011429946,0.000017993521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013954964,0.000053452004,0.0018314369,0.000008581578,0.0003558046,0.0000015109812,0.00079444866,0.54007435,0.00013625399,0.1901683,0.056052227,0.21038407],"study_design_scores_gemma":[0.000094874325,0.00008245201,0.000043238342,0.000005798832,0.00010524665,9.854015e-8,0.00027798064,0.9330237,0.000021452563,0.062586494,0.0036037697,0.00015491046],"about_ca_topic_score_codex":0.0006106545,"about_ca_topic_score_gemma":0.00001742395,"teacher_disagreement_score":0.9157947,"about_ca_system_score_codex":0.00001129095,"about_ca_system_score_gemma":0.000029906601,"threshold_uncertainty_score":0.49064276},"labels":[],"label_agreement":null},{"id":"W3117477995","doi":"10.1016/j.amc.2020.125884","title":"Modelling the dynamic emotional information propagation and guiding the public sentiment in the Chinese Sina-microblog","year":2020,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Microblogging; Computer science; Social media; Summative assessment; Entropy (arrow of time); Affect (linguistics); Sentiment analysis; Event (particle physics); Cognitive psychology; Psychology; Artificial intelligence; World Wide Web; Communication","score_opus":0.017415116962294693,"score_gpt":0.24096963543115427,"score_spread":0.22355451846885957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117477995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26806384,0.000015909312,0.728051,0.0029043956,0.0000053579915,0.00036286816,0.0000013932389,0.000015439604,0.00057975866],"genre_scores_gemma":[0.9909676,0.0000056166214,0.008682616,0.00019084146,0.000036911853,0.000048261794,0.00006263617,0.000004695408,8.7628695e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942034,0.00002284397,0.00024342818,0.000087333756,0.000140593,0.000085439366],"domain_scores_gemma":[0.99959594,0.00012484404,0.0001487247,0.0000814472,0.000034041095,0.000015009289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003447651,0.00009221796,0.00009129586,0.00002888106,0.00023587997,0.00024637542,0.000101100944,0.0000140643215,0.0000041033522],"category_scores_gemma":[0.0000028206214,0.00004807205,0.000023929199,0.00023139695,0.000034463814,0.00012454849,0.000059239286,0.00007985275,0.0000022823046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007706091,0.000109592605,0.0004019339,0.000096800715,0.00008012775,1.5988549e-7,0.021715503,0.18496928,0.00044652904,0.71287596,0.0003032314,0.07899315],"study_design_scores_gemma":[0.000101692254,0.0000064625574,0.00016689244,0.00000800482,0.00001646662,0.0000010576803,0.0012466856,0.90160596,0.000009721993,0.09671114,0.00007464558,0.00005127631],"about_ca_topic_score_codex":0.000008908463,"about_ca_topic_score_gemma":0.0000014029883,"teacher_disagreement_score":0.72290367,"about_ca_system_score_codex":0.0000094821025,"about_ca_system_score_gemma":0.000009605224,"threshold_uncertainty_score":0.23758037},"labels":[],"label_agreement":null},{"id":"W3118297080","doi":"10.1038/s41598-020-79447-z","title":"Interplay between success and patterns of human collaboration: case study of a Thai Research Institute","year":2021,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Fonds National de la Recherche Luxembourg","keywords":"Centrality; Quality (philosophy); Data science; Computer science; Artifact (error); Task (project management); Productivity; Social network analysis; Knowledge management; Artificial intelligence; World Wide Web; Engineering; Social media","score_opus":0.05810451436207847,"score_gpt":0.4225041715612161,"score_spread":0.36439965719913764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118297080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9985025,0.000025185622,0.00039278876,0.000016188105,0.00021481416,0.00025035354,0.000009025429,0.000010477108,0.000578676],"genre_scores_gemma":[0.99930793,2.0017573e-7,0.000076812845,3.9065705e-7,0.00006962415,0.000018521076,0.000061138126,0.000005741329,0.00045966872],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983051,0.00015056774,0.000541696,0.00044023944,0.00042237522,0.00014005625],"domain_scores_gemma":[0.9981447,0.000042362022,0.00027420433,0.00072317483,0.0007605356,0.000055012155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014412253,0.00007668572,0.00025872578,0.00020014422,0.00027974925,0.00017489935,0.00009626298,0.000018146484,0.00012533835],"category_scores_gemma":[0.000014123821,0.000073448995,0.000043756285,0.0010142593,0.00018445452,0.00016492161,0.0002808178,0.00010965356,2.3901157e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.791415e-7,0.0002637046,0.99167955,0.000019193163,0.00007909268,0.0010477942,0.0026162884,0.000009770982,0.0021806194,0.00030438913,0.0004425273,0.0013561804],"study_design_scores_gemma":[0.002081995,0.0013157736,0.20689021,0.0009936122,0.00088711054,0.0009859693,0.21070103,0.0004952245,0.49997944,0.06503196,0.009222464,0.0014152342],"about_ca_topic_score_codex":0.0025704897,"about_ca_topic_score_gemma":0.0026476283,"teacher_disagreement_score":0.7847894,"about_ca_system_score_codex":0.000013839702,"about_ca_system_score_gemma":0.00013259386,"threshold_uncertainty_score":0.38858286},"labels":[],"label_agreement":null},{"id":"W3118634459","doi":"10.1016/j.eswa.2020.114552","title":"Edge-centric multi-view network representation for link mining in signed social networks","year":2021,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Metric (unit); Computer science; Node (physics); Link (geometry); Sign (mathematics); Inverse; Neighbourhood (mathematics); Representation (politics); Enhanced Data Rates for GSM Evolution; Theoretical computer science; Complex network; Artificial intelligence; Mathematics; Computer network; World Wide Web","score_opus":0.029012858899141302,"score_gpt":0.31807058504843005,"score_spread":0.28905772614928876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118634459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049491506,0.002123389,0.9943133,0.00026452236,0.000067242625,0.0016816589,0.000008805664,0.00010208398,0.00094408233],"genre_scores_gemma":[0.9522302,0.000022738539,0.030618062,0.00007153583,0.0037311711,0.012081104,0.0005786572,0.00004891836,0.00061756815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984808,0.00011836339,0.0004695094,0.00045330165,0.00012814316,0.0003498965],"domain_scores_gemma":[0.9989088,0.00019848169,0.00023801037,0.00038060918,0.0002100142,0.00006405673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019192604,0.00017790185,0.00037595967,0.00006258196,0.00033706147,0.00010596225,0.00016931983,0.000065586304,0.000039884035],"category_scores_gemma":[0.0000038458593,0.00017631607,0.00012045054,0.001133226,0.000029030194,0.00007980859,0.00005017114,0.000107226864,0.0000046906193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016333383,0.0019217833,0.14658302,0.0002198539,0.001377857,0.00001126666,0.005206695,0.20031244,0.0009484399,0.18061465,0.13798654,0.3246541],"study_design_scores_gemma":[0.0030933034,0.00006063374,0.003657975,0.00038036107,0.00019079099,0.000005715479,0.003797976,0.67851,0.00027452558,0.0012399743,0.30765718,0.0011315418],"about_ca_topic_score_codex":0.00017813197,"about_ca_topic_score_gemma":0.000076135984,"teacher_disagreement_score":0.9636952,"about_ca_system_score_codex":0.00006854602,"about_ca_system_score_gemma":0.00007688703,"threshold_uncertainty_score":0.71899605},"labels":[],"label_agreement":null},{"id":"W3118807972","doi":"10.1145/3429885.3429964","title":"Cheetah","year":2020,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); École de Technologie Supérieure","funders":"","keywords":"Computer science; Scalability; Cloud computing; Partition (number theory); Cluster analysis; Graph partition; Theoretical computer science; Unsupervised learning; Distributed computing; Data mining; Graph; Machine learning; Mathematics; Database","score_opus":0.01855828364008717,"score_gpt":0.2388557794243971,"score_spread":0.22029749578430993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118807972","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029743187,0.000011725875,0.26228872,0.0026048832,0.0000095632495,0.00006198479,0.0000014224105,0.00024351804,0.705035],"genre_scores_gemma":[0.99594134,1.3703061e-7,0.0029325925,0.00045085396,0.00025236953,0.0000032628398,0.000004817427,0.000003705784,0.00041094612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997643,0.000005181982,0.000055678163,0.00007673689,0.00003678672,0.00006128293],"domain_scores_gemma":[0.999862,0.0000057629954,0.000012546579,0.00006720748,0.000009406025,0.00004305365],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000013955515,0.000036524754,0.00005985438,0.000005709436,0.000016874172,0.0000122696865,0.00006962938,0.000004174631,0.00658784],"category_scores_gemma":[5.303968e-7,0.00003123491,0.000050515668,0.00009469275,0.0000060782086,0.000023185392,0.000032236097,0.00003344505,0.00016949703],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004759452,0.000049200426,0.10235495,0.0000027445867,0.00012735768,8.3881105e-7,0.00020570861,0.000058944293,0.002917666,0.5411148,0.23676652,0.116396524],"study_design_scores_gemma":[0.00043120823,0.00008195084,0.005832794,0.0000053853,0.000084643514,1.5103372e-7,0.00031484794,0.057384837,0.039332576,0.056681685,0.8392803,0.0005695891],"about_ca_topic_score_codex":0.000030349556,"about_ca_topic_score_gemma":4.613376e-7,"teacher_disagreement_score":0.96619815,"about_ca_system_score_codex":0.0000012866345,"about_ca_system_score_gemma":0.0000039396455,"threshold_uncertainty_score":0.9943203},"labels":[],"label_agreement":null},{"id":"W3119668743","doi":"10.1214/20-ejp574","title":"On a random walk that grows its own tree","year":2021,"lang":"en","type":"article","venue":"Electronic Journal of Probability","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Random walk; Bernoulli's principle; Tree (set theory); Combinatorics; Vertex (graph theory); Loop-erased random walk; Random walker algorithm; Random graph; Discrete mathematics; Heterogeneous random walk in one dimension; Random tree; Graph; Statistics; Computer science; Artificial intelligence","score_opus":0.014475388687861948,"score_gpt":0.2533799351183784,"score_spread":0.23890454643051648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119668743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9529137,0.00155631,0.0315775,0.0011590223,0.000111375884,0.00029027445,0.000004531381,0.000039813727,0.012347477],"genre_scores_gemma":[0.9985475,0.000031284566,0.00059834117,0.00004832129,0.00029975173,0.000009649194,0.000005138852,0.000014180586,0.00044586466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809676,0.00031409087,0.0004914056,0.00024647996,0.0003485939,0.0005026702],"domain_scores_gemma":[0.9986198,0.00022961292,0.000382304,0.0003663721,0.00030659666,0.00009530458],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011429485,0.00018294033,0.0004829836,0.00006316084,0.00008912143,0.000052278738,0.000287029,0.0000400124,0.0012224776],"category_scores_gemma":[0.00006747535,0.00014689761,0.0005366226,0.00026121305,0.000036500933,0.000122027785,0.00005844035,0.0007014124,0.000010442227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011724951,0.0026813648,0.028672056,0.000051197832,0.0018226451,0.000036962458,0.00034230246,0.0007407018,0.00567894,0.79589015,0.011402437,0.15150872],"study_design_scores_gemma":[0.0021715772,0.00042703486,0.001997839,0.00006259158,0.00018966585,0.00002855776,0.00004591159,0.0003692751,0.028695885,0.9561514,0.009609564,0.00025067927],"about_ca_topic_score_codex":0.000012793265,"about_ca_topic_score_gemma":0.00007242821,"teacher_disagreement_score":0.16026124,"about_ca_system_score_codex":0.00025854583,"about_ca_system_score_gemma":0.00055320206,"threshold_uncertainty_score":0.99969053},"labels":[],"label_agreement":null},{"id":"W3119699145","doi":"10.1007/978-3-030-66046-8_17","title":"A New Metric to Evaluate Communities in Social Networks Using Geodesic Distance","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Geodesic; Metric (unit); Mathematics; Computer science; Geometry; Engineering; Operations management","score_opus":0.039033687030454754,"score_gpt":0.3000970075186551,"score_spread":0.26106332048820036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119699145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026851083,0.00027613607,0.9965102,0.00023303126,0.00019003078,0.00034699772,0.000006346544,0.000059772145,0.0021089609],"genre_scores_gemma":[0.86190635,0.0000049983014,0.13589285,0.00053525623,0.0015028034,0.000008098251,0.000021362877,0.000043190936,0.00008510058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768144,0.000074427946,0.00049335114,0.00065854826,0.00055296527,0.0005392743],"domain_scores_gemma":[0.998669,0.000304039,0.00022892367,0.00054190896,0.000110549474,0.00014557963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005607234,0.00044239173,0.00070127955,0.0007954718,0.0002747351,0.0002939405,0.0013740844,0.00011628817,0.00013236186],"category_scores_gemma":[0.000008795555,0.0004564046,0.00017674261,0.0017085046,0.00023507154,0.00014480119,0.00091636035,0.00093025324,0.000006893225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012534424,0.00001428312,0.001051718,0.000008717522,0.000028261911,0.0000070014717,0.0008519916,0.4331151,0.0000079930505,0.013242673,0.00014055324,0.55151916],"study_design_scores_gemma":[0.00016477639,0.000044780416,0.00016631548,0.0002690491,0.000035091096,8.6450825e-7,0.0000014800493,0.8478143,0.000029798775,0.14958428,0.00135672,0.00053249596],"about_ca_topic_score_codex":0.00090524857,"about_ca_topic_score_gemma":0.00056511856,"teacher_disagreement_score":0.86163783,"about_ca_system_score_codex":0.00033790758,"about_ca_system_score_gemma":0.00033732466,"threshold_uncertainty_score":0.99978876},"labels":[],"label_agreement":null},{"id":"W3120652156","doi":"10.1080/17513758.2020.1867246","title":"On the basic reproduction number in semi-Markov switching networks","year":2021,"lang":"en","type":"article","venue":"Journal of Biological Dynamics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Markov chain; Reproduction; Basic reproduction number; Generality; Persistence (discontinuity); Extinction (optical mineralogy); Mathematics; Markov process; Position (finance); Computer science; Statistics; Applied mathematics; Biology; Demography; Economics; Ecology; Population; Engineering; Sociology","score_opus":0.014334530768336635,"score_gpt":0.2622452375650576,"score_spread":0.24791070679672095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120652156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9250162,0.000061675266,0.070671394,0.0011238758,0.00014923961,0.000047755435,0.0000014636012,0.0000098373275,0.0029185088],"genre_scores_gemma":[0.9984899,0.0000514597,0.0007367829,0.00012390451,0.0005171701,0.0000021161052,0.000010790976,0.0000061307182,0.00006175598],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989082,0.00022683782,0.00041380618,0.00017227694,0.000115705334,0.00016313173],"domain_scores_gemma":[0.9990059,0.00033398802,0.00029054456,0.0002269259,0.00010727632,0.00003534359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007712113,0.00010549489,0.00024829555,0.00003286684,0.000067725145,0.000041381016,0.00017282559,0.000056147714,0.00035757024],"category_scores_gemma":[0.00008265894,0.000061081584,0.00021043885,0.0003356176,0.000026561014,0.000048228878,0.00007072458,0.0006064352,0.0000031877044],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001376514,0.00064007816,0.6030877,0.00000333631,0.00025926114,0.00007349106,0.00006966444,0.031193933,0.00070026715,0.16850504,0.0029925634,0.19233702],"study_design_scores_gemma":[0.0007123774,0.00032248106,0.13487953,0.00030247713,0.00010691115,0.00012535247,0.0008245949,0.4883586,0.0004884261,0.3706314,0.0026780863,0.00056977116],"about_ca_topic_score_codex":0.000013512914,"about_ca_topic_score_gemma":0.000014753993,"teacher_disagreement_score":0.46820816,"about_ca_system_score_codex":0.00007178674,"about_ca_system_score_gemma":0.000024015853,"threshold_uncertainty_score":0.39151436},"labels":[],"label_agreement":null},{"id":"W3121300114","doi":"10.34961/4181","title":"A framework for analyzing contagion in assortative banking networks","year":2016,"lang":"en","type":"preprint","venue":"Arrow@dit (Dublin Institute of Technology)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Assortativity; Systemic risk; Cascade; Computer science; Random graph; Network theory; Complex network; Network topology; Statistical physics; Mathematics; Econometrics; Topology (electrical circuits); Graph; Theoretical computer science; Economics; Statistics; Physics; Combinatorics","score_opus":0.023032264593216525,"score_gpt":0.3133747585125732,"score_spread":0.2903424939193567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121300114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10825089,0.00060482515,0.8859958,0.0012531866,0.0008895617,0.0012574986,0.000117291755,0.00039886156,0.001232053],"genre_scores_gemma":[0.91263014,0.00006313598,0.08555952,0.000028212038,0.00061541685,0.000769197,0.0002271925,0.00006446697,0.000042737953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663794,0.000054515604,0.0012748488,0.0010711286,0.00023987198,0.00072170206],"domain_scores_gemma":[0.99653584,0.00026163395,0.0014344737,0.0013071838,0.00038880738,0.000072047034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006504774,0.0006258726,0.0014394616,0.001647639,0.0001484532,0.00007226969,0.001367428,0.0010544348,0.0000997563],"category_scores_gemma":[0.00016887127,0.00059940416,0.0006157763,0.001181453,0.00046328554,0.00024917425,0.0010068442,0.0016689685,0.0000041788653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000622261,0.00019003701,0.05800069,0.00007740728,0.0007807176,0.000007698507,0.00008256344,0.0044492125,0.00020337902,0.8876513,0.001085091,0.04740965],"study_design_scores_gemma":[0.00073775847,0.00007838066,0.0005023722,0.0026349677,0.00024923845,7.039226e-7,0.00008512204,0.009719007,0.0027426102,0.975473,0.0070399125,0.00073693495],"about_ca_topic_score_codex":0.00020308128,"about_ca_topic_score_gemma":0.00016831227,"teacher_disagreement_score":0.8043792,"about_ca_system_score_codex":0.00021345797,"about_ca_system_score_gemma":0.00021703876,"threshold_uncertainty_score":0.9996457},"labels":[],"label_agreement":null},{"id":"W3121606989","doi":"10.21203/rs.3.rs-145317/v1","title":"Hunting for Influential Nodes in Complex Networks Using Local Information","year":2021,"lang":"en","type":"preprint","venue":"Research Square","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Verafin (Canada); Memorial University of Newfoundland","funders":"","keywords":"Node (physics); Computer science; Degree (music); Set (abstract data type); Degree distribution; Evolving networks; Shortest path problem; Complex network; Function (biology); Theoretical computer science; Graph","score_opus":0.08754339065010275,"score_gpt":0.4233949316150601,"score_spread":0.33585154096495734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121606989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19525,0.00011202864,0.802408,0.000045056793,0.00006302859,0.001084498,0.000052664076,0.000057551588,0.0009271586],"genre_scores_gemma":[0.98728853,0.000008896266,0.009024104,0.000015143667,0.00069729623,0.00029214643,0.0026326394,0.000031189917,0.000010045011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972482,0.0003400138,0.0006699689,0.00040373558,0.00058254634,0.00075557304],"domain_scores_gemma":[0.9979765,0.00028541425,0.00021335526,0.0005514313,0.0008794282,0.00009387146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001508024,0.00025529496,0.0005008807,0.0005784655,0.00028178247,0.0006884616,0.00045261518,0.00019843096,0.00031541125],"category_scores_gemma":[0.00004399208,0.00028991365,0.00033168818,0.00068986043,0.00012113943,0.00034138808,0.0016372082,0.0013744809,0.000003685483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074453965,0.00018094937,0.09167983,0.00073153345,0.00023376083,0.0000034534207,0.0006651477,0.73762226,0.00011244682,0.004780298,0.0011780263,0.16273785],"study_design_scores_gemma":[0.00034646678,0.000019719782,0.008223877,0.0006993194,0.000025707508,2.620801e-7,0.0014074706,0.98349756,0.00018582132,0.0032690305,0.0020245023,0.00030025194],"about_ca_topic_score_codex":0.0046878452,"about_ca_topic_score_gemma":0.00026842416,"teacher_disagreement_score":0.7933839,"about_ca_system_score_codex":0.0002849639,"about_ca_system_score_gemma":0.00033365705,"threshold_uncertainty_score":0.9999553},"labels":[],"label_agreement":null},{"id":"W3121674998","doi":"10.1111/ectj.12096","title":"My friend far, far away: a random field approach to exponential random graph models","year":2017,"lang":"en","type":"article","venue":"Econometrics Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Université Laval","funders":"Eunice Kennedy Shriver National Institute of Child Health and Human Development; University of North Carolina at Chapel Hill; Social Sciences and Humanities Research Council of Canada; Fonds de Recherche du Québec-Société et Culture; University of Cambridge","keywords":"Exponential random graph models; Homophily; Estimator; Random graph; Computer science; Exponential function; Graph; Set (abstract data type); Theoretical computer science; Mathematics; Mathematical optimization; Applied mathematics; Econometrics; Statistics; Combinatorics","score_opus":0.04219228558657924,"score_gpt":0.2716649188249091,"score_spread":0.2294726332383299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121674998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038805656,0.00031185805,0.8853789,0.00021021128,0.00037156805,0.00029238508,0.000019560666,0.000035168043,0.07457469],"genre_scores_gemma":[0.9814376,0.00009410428,0.016534846,0.00009982939,0.0012916956,0.00005182159,0.000013903957,0.000033070766,0.00044312287],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803877,0.00008302589,0.0006707445,0.0004140733,0.00027122718,0.00052213133],"domain_scores_gemma":[0.99787885,0.00018498994,0.0006208861,0.0007841307,0.00014713692,0.0003839779],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010872663,0.00028904926,0.0006816266,0.0011323099,0.001084714,0.0012510443,0.0011144114,0.000078165394,0.0009293877],"category_scores_gemma":[0.000070335474,0.00027246133,0.00067322917,0.0005242527,0.000043867425,0.0006884411,0.00030184735,0.0005542416,0.0000334989],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020543218,0.0018244261,0.06788259,0.00003867171,0.0041314107,0.000039577786,0.002322022,0.031007236,0.00020963202,0.13010892,0.110621296,0.6497599],"study_design_scores_gemma":[0.04552283,0.00083311344,0.008851805,0.00013682041,0.0012739251,0.00012913726,0.0014344171,0.2226943,0.0020798738,0.508286,0.20456097,0.0041968115],"about_ca_topic_score_codex":0.00016819985,"about_ca_topic_score_gemma":0.0000053590215,"teacher_disagreement_score":0.94263196,"about_ca_system_score_codex":0.000052893705,"about_ca_system_score_gemma":0.00005893723,"threshold_uncertainty_score":0.9999839},"labels":[],"label_agreement":null},{"id":"W3122192759","doi":"10.21307/connections-2019.019","title":"Visualizing Multilevel Networks for the Analysis of Superposed Levels of Collective Agency","year":2020,"lang":"en","type":"article","venue":"Connections","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Agency (philosophy); Multilevel model; Computer science; Engineering; Sociology; Data science; Social science","score_opus":0.07528842232364989,"score_gpt":0.33125599214712004,"score_spread":0.25596756982347013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122192759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0496003,0.00009610452,0.94893414,0.00015914868,0.000035874175,0.00034828074,0.00022613705,0.0000300892,0.00056993676],"genre_scores_gemma":[0.99837613,0.0000030155418,0.0012498029,0.00003412224,0.00012832397,0.00008636304,0.00003249917,0.000010828325,0.00007891036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999246,0.000050345712,0.00032036865,0.00017673887,0.00007801927,0.00012854022],"domain_scores_gemma":[0.998502,0.0008315189,0.00018034544,0.00020454382,0.00024278874,0.0000387934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012696012,0.00009818883,0.00035199436,0.00011924951,0.00019953401,0.000012393963,0.00016926382,0.00002531615,0.00056097284],"category_scores_gemma":[0.00004347842,0.00008119716,0.0004915505,0.0015889466,0.000058544592,0.00003906762,0.000047434787,0.00007743141,4.0525708e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021041886,0.000832241,0.1008427,0.00006018308,0.043713752,4.3551438e-7,0.015816174,0.49532855,0.026992766,0.17223763,0.012504648,0.13146052],"study_design_scores_gemma":[0.00024345655,0.000057467085,0.029558908,0.000007872909,0.002605808,3.015129e-8,0.00060127187,0.96083695,0.003762673,0.001348328,0.0008658545,0.00011136906],"about_ca_topic_score_codex":0.00023493932,"about_ca_topic_score_gemma":0.00005533756,"teacher_disagreement_score":0.9487758,"about_ca_system_score_codex":0.000015998701,"about_ca_system_score_gemma":0.00004320839,"threshold_uncertainty_score":0.6142259},"labels":[],"label_agreement":null},{"id":"W3122610079","doi":"10.20944/preprints201902.0206.v1","title":"A Two-Stage Decision Framework for Resolving Brownfield Conflicts","year":2019,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Northwestern Polytechnical University; Northwestern University","keywords":"Brownfield; Negotiation; Stage (stratigraphy); Conflict resolution; Operations research; Preference; Computer science; Intervention (counseling); Outcome (game theory); Third stage; Management science; Engineering; Political science; Economics; Geography; Microeconomics; Civil engineering; Geology; Psychology","score_opus":0.12748489329844223,"score_gpt":0.40166404220410995,"score_spread":0.27417914890566775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122610079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42892075,0.000120222314,0.54279107,0.0001450645,0.0006224182,0.0017536095,0.00009634766,0.00030977733,0.025240768],"genre_scores_gemma":[0.9589561,0.000021173228,0.03618236,0.00014565476,0.0010827279,0.00055670325,0.00017903188,0.0001021861,0.0027740258],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964941,0.00011492875,0.0008448889,0.0015057705,0.00041653813,0.0006237783],"domain_scores_gemma":[0.99490106,0.0010789529,0.00069403223,0.0028708298,0.00028353263,0.00017156795],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009029116,0.0005851784,0.00094492856,0.00022633426,0.0001816928,0.00011703397,0.0013214435,0.00039496896,0.004048967],"category_scores_gemma":[0.000201948,0.0006267584,0.00086787087,0.00019729476,0.00006377997,0.00009600444,0.0033949986,0.001564685,0.00055979396],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019773497,0.0002701816,0.83939517,0.00021098951,0.0008039428,0.0000034119546,0.00079811155,0.008783431,0.0011998859,0.13755165,0.0009998908,0.009785582],"study_design_scores_gemma":[0.0015335677,0.00007276701,0.0464602,0.0028282835,0.00062542217,0.0000011354056,0.00031211704,0.023967326,0.037089035,0.7369154,0.14766666,0.002528092],"about_ca_topic_score_codex":0.000702094,"about_ca_topic_score_gemma":0.000018745517,"teacher_disagreement_score":0.792935,"about_ca_system_score_codex":0.000101164114,"about_ca_system_score_gemma":0.0001503409,"threshold_uncertainty_score":0.99961835},"labels":[],"label_agreement":null},{"id":"W3123386990","doi":"10.18280/isi.250606","title":"Assessment of Twitter Data Clusters with Cosine-Based Validation Metrics Using Hybrid Topic Models","year":2020,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cluster analysis; Computer science; Cosine similarity; Set (abstract data type); Data mining; Metric (unit); Trigonometric functions; Data set; Euclidean distance; Cluster (spacecraft); Artificial intelligence; Information retrieval; Pattern recognition (psychology); Mathematics; Engineering","score_opus":0.06814756327762954,"score_gpt":0.29707666321076953,"score_spread":0.22892909993313998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123386990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23905356,0.0000050005415,0.7586663,0.000039151586,0.000014448191,0.00020764816,0.000049884995,0.00004516242,0.0019188455],"genre_scores_gemma":[0.956761,6.381243e-7,0.041737646,0.0001356939,0.00006064922,0.000011226143,0.001282104,0.00000937839,0.0000016614247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891806,0.00004175206,0.00047934457,0.00013481404,0.00028244566,0.0001435969],"domain_scores_gemma":[0.9988578,0.000041089745,0.00044651754,0.00038004943,0.0002220113,0.000052517673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021262116,0.00013604213,0.00023294313,0.00016516469,0.000086937274,0.00012650473,0.0002788892,0.000020832213,0.00004628483],"category_scores_gemma":[0.000009630941,0.00012362332,0.00004791325,0.0005359174,0.00004670648,0.0018381999,0.000117930904,0.000088823865,0.0000015639388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000927561,0.00014101248,0.10317476,0.0007477269,0.0005403232,0.0000015492691,0.0024098596,0.8113562,0.000821117,0.0066522164,0.0022720408,0.07179044],"study_design_scores_gemma":[0.00031766592,0.000056614914,0.0006871777,0.00008138179,0.00008606062,5.0411165e-7,0.00021498447,0.99460936,0.0027534615,0.00079853396,0.00025167395,0.00014258196],"about_ca_topic_score_codex":0.00015585765,"about_ca_topic_score_gemma":7.2139767e-7,"teacher_disagreement_score":0.71770746,"about_ca_system_score_codex":0.00009080174,"about_ca_system_score_gemma":0.00012040116,"threshold_uncertainty_score":0.5041213},"labels":[],"label_agreement":null},{"id":"W3123769390","doi":"","title":"Network of Econophysicists: a weighted network to investigate the development of Econophysics","year":2013,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Betweenness centrality; Econophysics; Centrality; Construct (python library); Degree distribution; Computer science; Complex network; Mathematical economics; Mathematics; Combinatorics; Statistics; Computer network","score_opus":0.012833037261929166,"score_gpt":0.2271785699157664,"score_spread":0.21434553265383724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123769390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87331647,0.000037718673,0.08985833,0.00045775235,0.00010044146,0.00094091333,0.0000050841204,0.00008534634,0.03519792],"genre_scores_gemma":[0.9323314,6.1920224e-7,0.0663803,0.00028997942,0.00047601943,0.00014676776,0.000018847873,0.000021833528,0.00033422248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843854,0.00006038509,0.0007261481,0.00025115648,0.000145793,0.00037795195],"domain_scores_gemma":[0.998665,0.00013774793,0.00034414013,0.000554019,0.0001964855,0.00010260861],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022780684,0.0002167636,0.00046410455,0.000028930852,0.00012856317,0.00003229177,0.00047480763,0.00002744755,0.0009178552],"category_scores_gemma":[0.0000017965233,0.00015520559,0.00015560297,0.00061462814,0.00009237908,0.00010436303,0.00025623039,0.0001131603,0.0001028009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027390623,0.0003421054,0.056328084,0.000042148782,0.0013668312,1.5313319e-7,0.0017550341,0.025609287,0.0030320163,0.5982547,0.18032764,0.13291463],"study_design_scores_gemma":[0.00040713407,0.00013443355,0.021657828,0.00019164586,0.00015459566,1.4126907e-7,0.0003409446,0.019251294,0.037449084,0.89779943,0.02179452,0.0008189777],"about_ca_topic_score_codex":0.0003124393,"about_ca_topic_score_gemma":0.00004057707,"teacher_disagreement_score":0.29954472,"about_ca_system_score_codex":0.00002476591,"about_ca_system_score_gemma":0.00010477774,"threshold_uncertainty_score":0.99999547},"labels":[],"label_agreement":null},{"id":"W3124251198","doi":"10.1103/physrevlett.126.038301","title":"Inference, Model Selection, and the Combinatorics of Growing Trees","year":2021,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; James S. McDonnell Foundation","keywords":"Inference; Computer science; Selection (genetic algorithm); Model selection; Interpolation (computer graphics); Series (stratigraphy); Machine learning; Artificial intelligence; Algorithm; Theoretical computer science; Biology","score_opus":0.01388794743700437,"score_gpt":0.29243111907936753,"score_spread":0.27854317164236314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124251198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82346606,0.010364619,0.14295287,0.018629735,0.000046507437,0.0005801367,0.000008964784,0.00009112865,0.0038599595],"genre_scores_gemma":[0.9972628,0.00064678624,0.00028822472,0.0016802282,0.00006897492,0.000027790804,0.000006359623,0.0000065289883,0.000012333737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993661,0.00009618793,0.00017595534,0.0001383428,0.0001223356,0.000101044956],"domain_scores_gemma":[0.9994661,0.00018226895,0.00009039261,0.0001678123,0.00006826193,0.000025143745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012220522,0.00009253459,0.00035090582,0.000012427286,0.000056530385,0.000016555217,0.000094950134,0.0000030103931,0.000018094712],"category_scores_gemma":[0.000014891082,0.00006367434,0.00017409041,0.00032578886,0.000069569454,0.000076797594,0.000070510745,0.00011614924,0.0000013478386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004999493,0.00016101325,0.0055351364,0.00023217435,0.00021751098,4.2563835e-7,0.00012955036,0.0022295576,0.0058189053,0.97037125,0.004823737,0.010475752],"study_design_scores_gemma":[0.0010687525,0.000025769026,0.0011674841,0.0014541778,0.0010706735,0.0000012590857,0.000035125613,0.5883814,0.0061676092,0.39438912,0.0057361303,0.00050247734],"about_ca_topic_score_codex":0.000024158171,"about_ca_topic_score_gemma":0.0000012009117,"teacher_disagreement_score":0.58615184,"about_ca_system_score_codex":0.0000068052564,"about_ca_system_score_gemma":0.000017827875,"threshold_uncertainty_score":0.25965643},"labels":[],"label_agreement":null},{"id":"W3124711515","doi":"10.1016/j.jet.2012.05.007","title":"Homophily and Long Run Integration in Social Networks","year":2012,"lang":"en","type":"article","venue":"Bristol Research (University of Bristol)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":128,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université Laval","funders":"National Science Foundation","keywords":"Homophily; Computer science; Preferential attachment; Process (computing); Type (biology); Social network (sociolinguistics); Degree distribution; Network formation; Econometrics; Theoretical computer science; Complex network; Psychology; Mathematics; Social psychology; Social media; World Wide Web","score_opus":0.04254898363690852,"score_gpt":0.3141770282192076,"score_spread":0.2716280445822991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124711515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9248814,0.00050261273,0.06406232,0.00034689365,0.00002616898,0.00026424212,0.000010466758,0.000034651137,0.009871253],"genre_scores_gemma":[0.99857914,0.000029207476,0.00062744616,0.000003887945,0.0001984205,9.73853e-7,0.00003634531,0.000009897975,0.0005146909],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99869335,0.00025157494,0.00013287437,0.00020574141,0.00030048375,0.00041594924],"domain_scores_gemma":[0.9993538,0.000098868484,0.000090968824,0.00017759639,0.0001639081,0.00011484928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009298787,0.00009937823,0.0002494443,0.00033922133,0.0003635075,0.000027561928,0.00026574457,0.0000655442,0.00017618308],"category_scores_gemma":[0.000010017002,0.0001303403,0.0000921729,0.0007044256,0.0003336844,0.00033843063,0.00026499623,0.0004220306,0.000009851887],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015041171,0.0005735853,0.61742216,0.000030405003,0.00010258087,0.00001718321,0.0029906128,0.00004313978,0.00034618,0.035361856,0.034879822,0.30808204],"study_design_scores_gemma":[0.0013055853,0.0001398877,0.94178396,0.00014558496,0.00008024753,0.0000040121063,0.010749501,0.021353,0.00011577636,0.009094344,0.014650605,0.00057750393],"about_ca_topic_score_codex":0.003456207,"about_ca_topic_score_gemma":0.0006058245,"teacher_disagreement_score":0.32436177,"about_ca_system_score_codex":0.00011755601,"about_ca_system_score_gemma":0.00004071066,"threshold_uncertainty_score":0.5315123},"labels":[],"label_agreement":null},{"id":"W3124968424","doi":"10.1073/pnas.1722089115","title":"Diffusion in networks and the virtue of burstiness","year":2018,"lang":"en","type":"article","venue":"Proceedings of the National Academy of Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"Air Force Office of Scientific Research; U.S. Army; National Science Foundation","keywords":"Burstiness; Diffusion; Limiting; Information cascade; Business; Psychology; Computer science; Social psychology; Computer security; Network packet; Physics","score_opus":0.018051957145608543,"score_gpt":0.29112565006643326,"score_spread":0.27307369292082473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124968424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.991725,0.00005613966,0.000060026014,0.000987627,0.0000058995793,0.00010979982,0.0000015432638,0.0000031330933,0.0070507755],"genre_scores_gemma":[0.9994708,0.0000057058055,0.0003357223,0.00003705095,0.00011756803,0.0000053076565,4.627281e-8,0.0000014510947,0.000026406311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999233,0.000007121596,0.00022825017,0.000109529916,0.00035159444,0.00007048644],"domain_scores_gemma":[0.9993801,0.00013076609,0.00031598462,0.0000067223305,0.0001571243,0.000009304938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011281201,0.000050210238,0.00013269011,0.00007408836,0.000100261204,0.000010547585,0.0004404311,0.000021116795,0.000011507322],"category_scores_gemma":[0.0000457486,0.000026312044,0.00004418807,0.0006663684,0.00151791,0.00011569422,0.00017958414,0.00008421323,6.680663e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000350867,0.000046381632,0.17713699,0.000010979939,0.000016331105,3.3870884e-10,0.00020232878,0.00018496788,0.014693534,0.80451006,0.0003166766,0.002846653],"study_design_scores_gemma":[0.0005173151,0.000039964612,0.2738132,0.00018254387,0.000025654603,5.442275e-7,0.000295644,0.10707414,0.04724215,0.57061374,0.00010280723,0.00009231294],"about_ca_topic_score_codex":0.000045493252,"about_ca_topic_score_gemma":2.1659922e-7,"teacher_disagreement_score":0.23389633,"about_ca_system_score_codex":0.000004544768,"about_ca_system_score_gemma":0.000007294932,"threshold_uncertainty_score":0.5592803},"labels":[],"label_agreement":null},{"id":"W3125470479","doi":"10.33915/etd.1680","title":"Error and attack tolerance of complex real networks","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"RealNetworks (Canada)","funders":"","keywords":"Degree distribution; Modularity (biology); Computer science; Homogeneous; Scale-free network; Complex network; Hierarchical network model; Degree (music); Scale (ratio); Cluster analysis; Distributed computing; Artificial intelligence; Mathematics","score_opus":0.023003404833103314,"score_gpt":0.3209969197621518,"score_spread":0.29799351492904846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125470479","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32203338,0.00038261482,0.0066399346,0.000031173564,0.000117080075,0.0004414484,0.000038451824,0.00013592944,0.67018],"genre_scores_gemma":[0.984292,0.000070111724,0.0024947368,0.000015247167,0.00055215147,0.00002255203,0.002152335,0.00003076326,0.010370107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989699,0.000028775097,0.00039580977,0.0002841505,0.00013235821,0.0001889898],"domain_scores_gemma":[0.99923646,0.000042497064,0.00029740826,0.0002817954,0.00009014309,0.000051698302],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007186327,0.00023751703,0.0005127725,0.000071234106,0.00005598949,0.000025510004,0.00016388975,0.00010403196,0.0018281459],"category_scores_gemma":[5.334646e-7,0.00023035999,0.00013922482,0.00013818135,0.000032644944,0.000047121954,0.000028414821,0.00021368725,0.0000038837393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032733654,0.00069797685,0.092577234,0.00030325106,0.0016383985,0.000002505572,0.0011421462,0.01713083,0.0008758527,0.11595419,0.25083965,0.51851064],"study_design_scores_gemma":[0.0015152422,0.00024008763,0.34046465,0.00069094525,0.0012051999,0.0000012764184,0.002635613,0.54167116,0.0013893347,0.004050798,0.10337744,0.0027582867],"about_ca_topic_score_codex":0.00056477165,"about_ca_topic_score_gemma":0.0008987706,"teacher_disagreement_score":0.6622586,"about_ca_system_score_codex":0.000010582412,"about_ca_system_score_gemma":0.000022802235,"threshold_uncertainty_score":0.9990843},"labels":[],"label_agreement":null},{"id":"W3126259515","doi":"10.2196/25734","title":"Quantifying the Influence of Delay in Opinion Transmission of COVID-19 Information Propagation: Modeling Study","year":2021,"lang":"en","type":"article","venue":"Journal of Medical Internet Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"Fundamental Research Funds for the Central Universities; Communication University of China; National Natural Science Foundation of China","keywords":"Computer science; Transmission (telecommunications); Information Dissemination; Public opinion; Value of information; Information source (mathematics); Telecommunications; World Wide Web; Statistics; Artificial intelligence; Mathematics","score_opus":0.1274716670925525,"score_gpt":0.46681936444178196,"score_spread":0.3393476973492294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126259515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8418923,0.00012413827,0.15632255,0.0014353365,0.000018437288,0.00013112242,5.614258e-7,0.0000018847368,0.00007366815],"genre_scores_gemma":[0.99953425,0.00007278834,0.0002869287,0.000020489668,0.000068978516,0.000005146442,0.0000032804915,0.0000030275976,0.0000051383067],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649525,0.0006319047,0.0009487522,0.00007217319,0.0017195478,0.00013236268],"domain_scores_gemma":[0.99824125,0.0003945736,0.00026889524,0.00014853427,0.0008245156,0.00012222017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066939313,0.00005708207,0.00023248744,0.00025854268,0.000035021363,0.000033643886,0.00048538257,0.000042630807,0.00029498307],"category_scores_gemma":[0.0004912436,0.000036506335,0.00009168634,0.0005772965,0.000079904166,0.00024665677,0.0001464206,0.0007436427,7.207744e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011272132,0.003839823,0.32600588,0.0009293587,0.0008407703,0.00010831036,0.05394985,0.3072888,0.0039565708,0.021973431,0.0043895575,0.27559045],"study_design_scores_gemma":[0.0014848574,0.00054664543,0.0038534845,0.0014885503,0.00002678359,0.00002363603,0.012084556,0.971354,0.0027208754,0.0036890204,0.0026251466,0.00010243268],"about_ca_topic_score_codex":0.0010240393,"about_ca_topic_score_gemma":0.000057328543,"teacher_disagreement_score":0.66406524,"about_ca_system_score_codex":0.000054321918,"about_ca_system_score_gemma":0.00070076005,"threshold_uncertainty_score":0.32307988},"labels":[],"label_agreement":null},{"id":"W3126404394","doi":"10.1007/s13278-020-00718-8","title":"Modeling signed social networks using spectral embedding","year":2021,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Embedding; Computer science; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.02091834671576063,"score_gpt":0.2982792934682404,"score_spread":0.27736094675247974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126404394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4165333,0.00036075193,0.58136636,0.000052763848,0.000059935697,0.00005209737,0.000003873083,0.00007038313,0.0015005673],"genre_scores_gemma":[0.97940135,0.000012670833,0.0150756445,0.00007798993,0.005129993,0.000008831229,0.00014353334,0.000039388713,0.00011060405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976105,0.00021844148,0.00056174013,0.0005973904,0.00025851539,0.00075338676],"domain_scores_gemma":[0.999253,0.00007715278,0.00021917863,0.00017865161,0.00016182146,0.00011020595],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00047243582,0.00032264058,0.00088764506,0.00015906498,0.001607411,0.000297367,0.0001521598,0.00012485904,0.00038720813],"category_scores_gemma":[0.000004593163,0.00036840638,0.0008287889,0.0024547451,0.00007218731,0.00014608151,0.00022212307,0.00029714068,8.3144096e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017555487,0.000063668405,0.048087474,0.0000059016047,0.0046406006,0.000014222873,0.0015036956,0.9140343,0.00016612762,0.01098151,0.00051393005,0.01997099],"study_design_scores_gemma":[0.00019738666,0.0000067037413,0.00064903795,0.000016473192,0.0029549764,7.5069e-7,0.0017669229,0.99059266,0.000015110865,0.0033005564,0.00009559528,0.00040380788],"about_ca_topic_score_codex":0.0002673875,"about_ca_topic_score_gemma":0.00017877498,"teacher_disagreement_score":0.5662907,"about_ca_system_score_codex":0.00005656809,"about_ca_system_score_gemma":0.00006399776,"threshold_uncertainty_score":0.9998768},"labels":[],"label_agreement":null},{"id":"W3127108875","doi":"10.1016/j.physa.2021.125788","title":"COVID-19 information contact and participation analysis and dynamic prediction in the Chinese Sina-microblog","year":2021,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Research Chairs","keywords":"Microblogging; Social media; Reading (process); Coronavirus disease 2019 (COVID-19); Public opinion; Computer science; Data science; Information Dissemination; Internet privacy; World Wide Web; Political science; Medicine","score_opus":0.008384959654554242,"score_gpt":0.3029030866987282,"score_spread":0.2945181270441739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127108875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0609091,0.000058098776,0.9371793,0.000851402,0.0000042534884,0.00035650813,0.00046742818,0.000023106306,0.0001507893],"genre_scores_gemma":[0.99696314,0.00005468755,0.0015627608,0.00020184452,0.000023594132,0.00035614092,0.000828778,0.0000045167903,0.0000045509137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992313,0.00007574924,0.00025216583,0.00021045642,0.00010303226,0.0001273192],"domain_scores_gemma":[0.9992259,0.00033573242,0.00009287142,0.00016808839,0.000070012764,0.000107375374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015928425,0.00011165916,0.00019267558,0.00008075988,0.00019829182,0.00011715298,0.00005505962,0.000024101888,0.000051212275],"category_scores_gemma":[0.000046293684,0.00009049506,0.00003179503,0.0007217462,0.000018563143,0.00016012622,0.0000568375,0.000108739405,0.000002212461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005893905,0.00012702213,0.0025514036,0.000025949637,0.00012008236,2.8591103e-7,0.00042930397,0.00006418255,0.0008701437,0.97957003,0.00007366549,0.01616204],"study_design_scores_gemma":[0.0003050422,0.000039566872,0.058944102,0.000004880013,0.00054031226,0.0000015368065,0.0003083291,0.64717805,0.00004310552,0.290925,0.0015589565,0.00015112171],"about_ca_topic_score_codex":0.00009119715,"about_ca_topic_score_gemma":0.00011756132,"teacher_disagreement_score":0.93605405,"about_ca_system_score_codex":0.000022282238,"about_ca_system_score_gemma":0.000037365193,"threshold_uncertainty_score":0.36902812},"labels":[],"label_agreement":null},{"id":"W3127827681","doi":"10.1371/journal.pone.0246260","title":"A breeding pool of ideas: Analyzing interdisciplinary collaborations at the Complex Systems Summer School","year":2021,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Santa Fe Institute","keywords":"Homophily; Preference; Discipline; Composition (language); Prestige; Baseline (sea); Behavioural sciences; Psychology; Sociology; Social science; Biology","score_opus":0.06515757912188337,"score_gpt":0.29489497673233983,"score_spread":0.22973739761045647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127827681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.981775,0.0006593652,0.0068347156,0.0011770305,0.000031075524,0.00036291493,0.00011558516,0.00007071542,0.008973601],"genre_scores_gemma":[0.9972913,0.000006379658,0.0010036076,0.000020776837,0.00029974038,0.00006881772,0.00014591118,0.000017808356,0.0011456442],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883944,0.00011276787,0.00038573914,0.00022223008,0.00025552287,0.0001843264],"domain_scores_gemma":[0.9987393,0.00013499263,0.00020186255,0.0004564834,0.0004023749,0.00006497258],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018289797,0.00012588536,0.0003521911,0.00007133745,0.00029096275,0.00008807732,0.00020122995,0.000023460098,0.0010845914],"category_scores_gemma":[0.000017080589,0.00010594512,0.00012822206,0.00074090005,0.000059162125,0.00009339594,0.00053893996,0.00013866385,0.000031593718],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033137825,0.00201498,0.5306679,0.0001877455,0.0051804436,0.000007680032,0.0009151937,0.0014641224,0.39891306,0.031070355,0.028806696,0.0007387048],"study_design_scores_gemma":[0.0036464902,0.00057580945,0.09755764,0.006987614,0.010760468,0.000014646588,0.040146966,0.45413318,0.3409169,0.036473155,0.0053246086,0.0034625223],"about_ca_topic_score_codex":0.00012225006,"about_ca_topic_score_gemma":0.00010220647,"teacher_disagreement_score":0.45266905,"about_ca_system_score_codex":0.00007134762,"about_ca_system_score_gemma":0.00006953086,"threshold_uncertainty_score":0.9998286},"labels":[],"label_agreement":null},{"id":"W3127934374","doi":"10.1371/journal.pcbi.1008606","title":"Localization, epidemic transitions, and unpredictability of multistrain epidemics with an underlying genotype network","year":2021,"lang":"en","type":"article","venue":"PLoS Computational Biology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"National Institute of General Medical Sciences; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; Canada First Research Excellence Fund","keywords":"Biology; Population; Disease; Genotype; Epidemic model; Evolutionary biology; Host (biology); Pathogen; Susceptible individual; Genetics; Demography; Gene; Medicine; Sociology","score_opus":0.03484795344664504,"score_gpt":0.30166738564938117,"score_spread":0.26681943220273613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127934374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28324917,0.00010669926,0.7162043,0.00015617993,0.00000969657,0.00008464812,0.00005791665,0.000032860255,0.00009856898],"genre_scores_gemma":[0.9047485,0.0000038657577,0.09375344,0.00010209924,0.00008094576,0.000009986935,0.0012904448,0.000009041981,0.000001657567],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988447,0.00030486763,0.00034203636,0.00028431872,0.00007030623,0.00015377966],"domain_scores_gemma":[0.99896115,0.00043559074,0.0001319958,0.00014236612,0.00027062662,0.000058273657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021444203,0.00011108153,0.00027795174,0.000033431003,0.00011524462,0.000008524841,0.00006801021,0.000045313536,0.00011712371],"category_scores_gemma":[0.000017134571,0.00010587103,0.000041513795,0.00024803073,0.00019855784,0.000056987366,0.000027952228,0.00009981524,6.3025516e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030493353,0.00018417687,0.5374313,0.000021279511,0.00025693447,0.0000012896893,0.000111329915,0.30110782,0.000324237,0.15217964,0.000051811097,0.008299641],"study_design_scores_gemma":[0.00030340088,0.00010806322,0.03460113,0.00003137308,0.00008782796,0.000004908372,0.00009692722,0.6197598,0.00010752036,0.34464327,0.00010065622,0.00015515595],"about_ca_topic_score_codex":0.000055654895,"about_ca_topic_score_gemma":0.0000522826,"teacher_disagreement_score":0.6224508,"about_ca_system_score_codex":0.00001567963,"about_ca_system_score_gemma":0.000103951876,"threshold_uncertainty_score":0.43172953},"labels":[],"label_agreement":null},{"id":"W3128734400","doi":"10.48550/arxiv.2101.12334","title":"sGrapp: Butterfly Approximation in Streaming Graphs","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Bipartite graph; Theoretical computer science; Streaming algorithm; Graph; Mathematics; Upper and lower bounds","score_opus":0.0426476374795878,"score_gpt":0.19026040116389967,"score_spread":0.14761276368431187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128734400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84174424,0.000032084743,0.15238474,0.00001531514,0.000068616,0.00021242413,0.000017242908,0.000099879704,0.005425428],"genre_scores_gemma":[0.99840355,0.000025740053,0.0008108167,0.000013084863,0.00008083771,0.0000035017385,0.0003296812,0.000022449569,0.0003103346],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848586,0.00013853326,0.00024743832,0.00077707466,0.000066828325,0.0002842342],"domain_scores_gemma":[0.99884343,0.00005095886,0.00024151606,0.00069659314,0.000096133015,0.0000713592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015666636,0.00028960218,0.00040745715,0.00038782824,0.000079116035,0.00009983655,0.0004435815,0.00013166557,0.0002460254],"category_scores_gemma":[0.0000028851377,0.00037520647,0.00034370605,0.00078405143,0.000055180946,0.00016273616,0.000661676,0.00058084435,0.000008580187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003120282,0.00055053446,0.5244447,0.00011396128,0.0005547393,0.00015731194,0.0005005157,0.15559615,0.0002174782,0.3091054,0.0003732714,0.008354756],"study_design_scores_gemma":[0.0008998353,0.00003457105,0.02514098,0.0005873774,0.00047804724,8.5241317e-7,0.0019578205,0.48364338,0.0010163658,0.48451537,0.00030507497,0.0014203308],"about_ca_topic_score_codex":0.001493148,"about_ca_topic_score_gemma":0.00022182944,"teacher_disagreement_score":0.49930373,"about_ca_system_score_codex":0.000105567626,"about_ca_system_score_gemma":0.00008052557,"threshold_uncertainty_score":0.99987},"labels":[],"label_agreement":null},{"id":"W3128778098","doi":"10.1016/j.dam.2023.04.006","title":"The iterated local transitivity model for hypergraphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Vancouver Island University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transitive relation; Hypergraph; Iterated function; Mathematics; Order (exchange); Combinatorics; Homomorphism; Generative model; Generative grammar; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.01794489169670177,"score_gpt":0.27184067483851926,"score_spread":0.2538957831418175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128778098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014199462,0.000006369778,0.97797513,0.00016992334,0.000013651401,0.000486727,0.00005953656,0.00024157172,0.0068476023],"genre_scores_gemma":[0.98541147,0.0000037869731,0.013489055,0.000023273866,0.00007474261,0.00044520936,0.00013473674,0.000036016572,0.00038173114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907446,0.000008299708,0.00026299903,0.00019035011,0.00014913833,0.00031476017],"domain_scores_gemma":[0.9991913,0.00027114127,0.00008370119,0.00036238777,0.00004342594,0.000048030855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030384885,0.0001650864,0.00022907695,0.000045167635,0.0003205419,0.000082789404,0.00022432118,0.00003113255,0.0000127368785],"category_scores_gemma":[0.0000024470419,0.000116045936,0.00018981841,0.00034712398,0.00008896064,0.000032329932,0.000049728333,0.00009479287,0.000023160386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015303805,0.00005133946,0.00001363161,0.00003324969,0.00014924345,2.0419348e-7,0.00085520087,0.007861891,0.0019348202,0.965477,0.0047737667,0.01883435],"study_design_scores_gemma":[0.00012186595,0.0000048583647,0.0000047407284,0.000006998313,0.000049002832,6.799882e-8,0.00039069314,0.6710926,0.0011143577,0.3265459,0.0005599312,0.0001089525],"about_ca_topic_score_codex":0.000003859764,"about_ca_topic_score_gemma":0.000006831024,"teacher_disagreement_score":0.97121197,"about_ca_system_score_codex":0.000009810217,"about_ca_system_score_gemma":0.000019527613,"threshold_uncertainty_score":0.47322157},"labels":[],"label_agreement":null},{"id":"W3128963183","doi":"10.1007/978-3-030-75075-6_9","title":"Fast and Scalable Triangle Counting in Graph Streams: The Hybrid Approach","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Scalability; Computer science; Theoretical computer science; Graph; Categorization; Anomaly detection; Algorithm; Data mining; Artificial intelligence","score_opus":0.011580743408161571,"score_gpt":0.2156280494725052,"score_spread":0.20404730606434363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128963183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006586205,0.12206269,0.6399395,0.00018773427,0.00068351324,0.0029373995,0.00010016846,0.00014759184,0.22735524],"genre_scores_gemma":[0.9949354,0.00042495903,0.00016272231,0.00004103347,0.0012763662,0.00007360069,0.00021337494,0.00006214362,0.002810389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811137,0.00011927144,0.0005961756,0.00060006324,0.00019515432,0.00037793946],"domain_scores_gemma":[0.99872535,0.00043464135,0.00030026463,0.00043051096,0.000054352124,0.000054856566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006067371,0.0004388265,0.00095776294,0.00015912729,0.00014997042,0.00032592774,0.0001920914,0.00021118195,0.000039676706],"category_scores_gemma":[0.000006781922,0.00032671329,0.00014865115,0.00017521545,0.000112735506,0.000049799455,0.00015843511,0.0008830078,4.1089166e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005843384,0.00013722495,0.053444743,0.0004175117,0.00092393626,0.00006541365,0.00059391354,0.50561595,0.0000067013875,0.115994476,0.002169463,0.32057226],"study_design_scores_gemma":[0.0009366032,0.00005738555,0.00022750277,0.0023601907,0.00026480938,0.0000361014,0.00018966646,0.945298,0.0000064042274,0.03230548,0.017163666,0.0011541569],"about_ca_topic_score_codex":0.0009931918,"about_ca_topic_score_gemma":0.00036462993,"teacher_disagreement_score":0.9883492,"about_ca_system_score_codex":0.000039193008,"about_ca_system_score_gemma":0.00003193394,"threshold_uncertainty_score":0.9999185},"labels":[],"label_agreement":null},{"id":"W3130921348","doi":"10.1109/asonam49781.2020.9381460","title":"MONSTOR: An Inductive Approach for Estimating and Maximizing Influence over Unseen Networks","year":2020,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Maximization; Heuristic; Monte Carlo method; Machine learning; Set (abstract data type); Artificial intelligence; Social network (sociolinguistics); Competitor analysis; Mathematical optimization; Mathematics; Statistics; Social media","score_opus":0.024692188955603513,"score_gpt":0.2742732335696557,"score_spread":0.2495810446140522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130921348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1370791,0.000016534923,0.86031103,0.00004174479,0.000006805014,0.0002355736,0.0000032581993,0.00009860747,0.0022073488],"genre_scores_gemma":[0.6627216,2.6319873e-7,0.33679783,0.000118180236,0.00027679646,0.00004080621,0.000023270071,0.000011963994,0.000009316078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992362,0.000026503945,0.00017073762,0.00030899805,0.000067594185,0.00018992391],"domain_scores_gemma":[0.9995678,0.000053017917,0.000083733394,0.00014233534,0.000043265944,0.000109839166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094344105,0.00013366419,0.00019926895,0.000024319583,0.0001283254,0.00008068867,0.0001250781,0.000030189864,0.00003116756],"category_scores_gemma":[0.0000057924512,0.00012511697,0.00005607566,0.00015285022,0.000039931558,0.0002527467,0.00009289196,0.00013050498,3.344473e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007643458,0.00017473861,0.26282516,0.000045495213,0.00040961345,6.600657e-7,0.0021521389,0.45595717,0.00095714076,0.06276419,0.0034512738,0.21118599],"study_design_scores_gemma":[0.0001564549,0.00004438574,0.0013670818,0.000005669327,0.000039050676,1.4459032e-7,0.00023757473,0.99528676,0.00007799814,0.0024121078,0.0002131079,0.00015965001],"about_ca_topic_score_codex":0.00021018252,"about_ca_topic_score_gemma":0.000001893121,"teacher_disagreement_score":0.5393296,"about_ca_system_score_codex":0.000009649324,"about_ca_system_score_gemma":0.000011388496,"threshold_uncertainty_score":0.51021224},"labels":[],"label_agreement":null},{"id":"W3131107340","doi":"10.1093/comnet/cnac030","title":"Evaluating node embeddings of complex networks","year":2022,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Embedding; Graph; Theoretical computer science; Node (physics); Set (abstract data type); Graph embedding; Topological graph theory; Machine learning; Artificial intelligence; Data mining","score_opus":0.05553973968489292,"score_gpt":0.3535089458173422,"score_spread":0.2979692061324493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131107340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15696825,0.0010200416,0.8323494,0.00037603127,0.0006735985,0.00045806388,0.000030786763,0.000083925486,0.008039882],"genre_scores_gemma":[0.98088354,0.000015853559,0.016750291,0.00024348643,0.0018312436,0.000019461691,0.00007481361,0.00006202201,0.000119303986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99567896,0.00057967094,0.001809914,0.00031140598,0.000997911,0.0006221245],"domain_scores_gemma":[0.99563915,0.00048478995,0.0025895638,0.0005424679,0.00054665946,0.0001973469],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022015343,0.00036669557,0.0011383006,0.0003198142,0.0005302446,0.000083327526,0.00111269,0.000056069035,0.0063991514],"category_scores_gemma":[0.000016974516,0.00036850452,0.0008350482,0.0010110257,0.00013715618,0.00018677345,0.00065360905,0.0012079652,0.0000018033573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014703946,0.00025361637,0.018349037,0.0000073851097,0.00045595906,0.000007763016,0.00013240264,0.9073238,0.00057285884,0.0033278167,0.043716177,0.025706176],"study_design_scores_gemma":[0.0010146664,0.00048395424,0.007318106,0.000066420274,0.00029867288,0.00004415059,0.00035849595,0.96737945,0.000030097919,0.0046466123,0.017992763,0.00036663873],"about_ca_topic_score_codex":0.00007834585,"about_ca_topic_score_gemma":0.0000038777994,"teacher_disagreement_score":0.8239153,"about_ca_system_score_codex":0.00014406566,"about_ca_system_score_gemma":0.00011265597,"threshold_uncertainty_score":0.9998767},"labels":[],"label_agreement":null},{"id":"W3134061193","doi":"","title":"Correlation effects in large networks and mean-field limits","year":2010,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Correlation; Computer science; Statistics; Mathematics","score_opus":0.007240022064861881,"score_gpt":0.23109130351857263,"score_spread":0.22385128145371075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134061193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15870495,0.0005549345,0.8134846,0.0010898733,0.00017004907,0.0005154204,0.000011787003,0.00014884889,0.025319537],"genre_scores_gemma":[0.9876459,0.00010577444,0.010560369,0.00005537557,0.000071934846,0.00010023669,0.00043805692,0.00003597581,0.0009863575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963627,0.0019970278,0.00045364667,0.00062964496,0.000210156,0.00034681856],"domain_scores_gemma":[0.99577737,0.0018917142,0.00040090355,0.0012882118,0.00052106945,0.000120751094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029841033,0.00030897924,0.0004219365,0.00019845442,0.00019650222,0.0002711361,0.0005721535,0.0003103346,0.00014134932],"category_scores_gemma":[0.00020418158,0.0003433429,0.00016689475,0.00031303044,0.0000707489,0.00010410632,0.0009568562,0.0014106898,0.0000073336546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021960115,0.001013962,0.2866687,0.00014670288,0.00020501777,0.0000049150867,0.0052416357,0.0019297822,0.0005001613,0.46570876,0.0018238685,0.23673452],"study_design_scores_gemma":[0.0008582947,8.2930865e-7,0.038596097,0.002135728,0.00013065952,0.000001479541,0.00007053131,0.9047482,0.00662465,0.042110763,0.003943278,0.00077950937],"about_ca_topic_score_codex":0.0016053078,"about_ca_topic_score_gemma":0.0046017566,"teacher_disagreement_score":0.9028184,"about_ca_system_score_codex":0.00003828167,"about_ca_system_score_gemma":0.000070604896,"threshold_uncertainty_score":0.99990183},"labels":[],"label_agreement":null},{"id":"W3134117472","doi":"10.1007/978-3-030-68211-8_22","title":"APX-Hardness and Approximation for the k-Burning Number Problem","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; APX; Generalization; Approximation algorithm; Running time; Graph; Mathematics; Sequence (biology); Binary logarithm; Discrete mathematics; Physics; Algorithm; Chemistry; Mathematical analysis","score_opus":0.015196728174047318,"score_gpt":0.2623620611385883,"score_spread":0.24716533296454096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134117472","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000064914726,0.00022699742,0.99526733,0.000259166,0.00018850376,0.00045215312,0.000005123988,0.000034138244,0.0035016832],"genre_scores_gemma":[0.45251396,0.000026561624,0.5432005,0.00035573912,0.0018754593,0.00014252962,0.00006991201,0.00006115699,0.001754163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986627,0.000014413767,0.00024614867,0.0005721379,0.00025372265,0.0002508832],"domain_scores_gemma":[0.9988882,0.00033153148,0.0001759969,0.00040429752,0.00016135021,0.00003863853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004480881,0.00023624921,0.00029025294,0.000091778544,0.00028088,0.0003246684,0.00045401524,0.000067209694,0.00008162393],"category_scores_gemma":[0.000007435478,0.00017669513,0.00010701665,0.00019337203,0.00025376168,0.000113015376,0.00035185003,0.00032321847,0.0000020407408],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023185755,0.000010827401,0.0005367199,0.000028465507,0.000035429905,8.472862e-7,0.00027448268,0.004813018,0.00003178114,0.05450373,0.000088132365,0.93967426],"study_design_scores_gemma":[0.00016000816,0.000023861268,0.00007073795,0.0003327572,0.00006269772,0.0000057921807,0.0000012543693,0.530831,0.00060481904,0.45404154,0.013452953,0.0004126093],"about_ca_topic_score_codex":0.000023115368,"about_ca_topic_score_gemma":0.000013768987,"teacher_disagreement_score":0.9392616,"about_ca_system_score_codex":0.0000435139,"about_ca_system_score_gemma":0.000103112994,"threshold_uncertainty_score":0.72054183},"labels":[],"label_agreement":null},{"id":"W3135024503","doi":"10.1155/2021/5513311","title":"Analysing the Vulnerability of Public Transport Networks","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universidad Francisco de Vitoria","keywords":"Betweenness centrality; PageRank; Assortativity; Giant component; Complex network; Computer science; Robustness (evolution); Network science; Vulnerability (computing); Public transport; Degree (music); Centrality; Theoretical computer science; Mathematics; Computer security; Statistics; Transport engineering; Engineering; Random graph; Physics; Graph","score_opus":0.015055397177515108,"score_gpt":0.2786517457644746,"score_spread":0.2635963485869595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135024503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6507497,0.0002698757,0.34849632,0.00019862833,0.000067511486,0.00004531495,0.0000054369434,0.0000064440314,0.00016081266],"genre_scores_gemma":[0.9944608,0.00004010148,0.0052124457,0.000016745049,0.0001823071,0.0000024042295,0.000060175247,0.000009529481,0.000015460695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9985756,0.00009595289,0.00080411864,0.00011767432,0.00026597903,0.00014062105],"domain_scores_gemma":[0.99829614,0.00010521525,0.00068456127,0.00021365451,0.00064669386,0.000053729003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005231119,0.000104596,0.00033942645,0.00006892696,0.000077801546,0.0000136319195,0.00015356878,0.000025367452,0.00019331604],"category_scores_gemma":[0.0000070609744,0.00007834628,0.00042441787,0.00062180165,0.00005442386,0.00029932958,0.0000018163296,0.00025489458,1.2702439e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063943786,0.0003365678,0.34904018,0.00002146912,0.0006126066,0.000014595623,0.0008951407,0.52860963,0.0073439362,0.008837529,0.00004682908,0.10417759],"study_design_scores_gemma":[0.0009902735,0.00010544834,0.9571847,0.00011282125,0.00085527985,0.000004955323,0.002237382,0.0026135957,0.014504176,0.018608999,0.0025281378,0.00025423907],"about_ca_topic_score_codex":0.000014944017,"about_ca_topic_score_gemma":0.00010030478,"teacher_disagreement_score":0.6081445,"about_ca_system_score_codex":0.000018927763,"about_ca_system_score_gemma":0.00009320228,"threshold_uncertainty_score":0.31948686},"labels":[],"label_agreement":null},{"id":"W3135419330","doi":"10.1007/978-3-030-91445-5_11","title":"RevDet: Robust and Memory Efficient Event Detection and Tracking in Large News Feeds","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Event (particle physics); Cluster analysis; Data mining; Redundancy (engineering); Ground truth; Tracking (education); Task (project management); Artificial intelligence; Focus (optics); Robustness (evolution); Machine learning","score_opus":0.012680521811543562,"score_gpt":0.2479529390415176,"score_spread":0.23527241722997405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135419330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015027436,0.0008236897,0.98278695,0.00008824797,0.00016837673,0.00023659943,0.0000032410398,0.000029273342,0.0008361755],"genre_scores_gemma":[0.9868094,0.000025874153,0.0126245525,0.00009696128,0.0003347682,0.0000073644765,0.000005743457,0.000019779642,0.000075613374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820584,0.000034072873,0.00033961618,0.0008007725,0.0002830142,0.0003367008],"domain_scores_gemma":[0.99919957,0.00013910033,0.0001562092,0.00036046453,0.00007255839,0.000072077666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005085325,0.00028817472,0.00040924264,0.00043136018,0.00015278466,0.000208658,0.00024701818,0.00010397644,0.00004372829],"category_scores_gemma":[0.000008928014,0.0002822944,0.00007898,0.00035267428,0.00017824631,0.000083913284,0.0004505232,0.0005318859,8.4228054e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000357709,0.000032430107,0.001481075,0.00002060452,0.000012576519,0.000011749561,0.00037481208,0.0454454,0.00021271354,0.00096032495,0.0000021204976,0.9514426],"study_design_scores_gemma":[0.0005228768,0.00009819152,0.003949563,0.0010571004,0.00005121674,0.0000204407,0.0000071518216,0.96202135,0.0036513873,0.026952146,0.0007843418,0.000884232],"about_ca_topic_score_codex":0.00012254859,"about_ca_topic_score_gemma":0.0007701807,"teacher_disagreement_score":0.9717819,"about_ca_system_score_codex":0.000108432025,"about_ca_system_score_gemma":0.000074728334,"threshold_uncertainty_score":0.9999629},"labels":[],"label_agreement":null},{"id":"W3138596474","doi":"10.1108/lht-08-2020-0186","title":"Social network analysis and data visualization of MIS international collaboration in Taiwan","year":2021,"lang":"en","type":"article","venue":"Library Hi Tech","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Social network analysis; Centrality; Publication; Library science; China; Productivity; World Wide Web; Computer science; Data science; Knowledge management; Political science; Social media","score_opus":0.014738084411852526,"score_gpt":0.3240294987852545,"score_spread":0.30929141437340196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138596474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6556253,0.00083329855,0.29166636,0.007463052,0.00023401275,0.00056588906,0.0007722992,0.00038982963,0.042449947],"genre_scores_gemma":[0.98868406,0.00001022313,0.0061700423,0.00003748266,0.00028270818,0.000006018658,0.0046111057,0.000008959659,0.00018940498],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999241,0.00006845884,0.00025126108,0.00023678622,0.000115356466,0.00008711554],"domain_scores_gemma":[0.99954516,0.000021104928,0.00012205376,0.00025284357,0.000041306586,0.00001752469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084750674,0.00007118682,0.00019217542,0.00015180225,0.000042194337,0.00007094181,0.00021485292,0.00003178102,0.00051890354],"category_scores_gemma":[0.000003912989,0.0000811028,0.00004203613,0.002127399,0.000023046376,0.00051873905,0.00024611325,0.0000525446,5.0476945e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009841768,0.00008402351,0.92691797,0.000004810204,0.0003698736,0.0000015795572,0.0001660988,0.00020464299,0.00029849823,0.052843045,0.010759862,0.008339727],"study_design_scores_gemma":[0.0015324162,0.000058639944,0.40366077,0.0001219459,0.0014981384,0.000001055324,0.0021763667,0.33036572,0.016572224,0.1417805,0.10119352,0.0010387222],"about_ca_topic_score_codex":0.00002923596,"about_ca_topic_score_gemma":0.00004795409,"teacher_disagreement_score":0.52325726,"about_ca_system_score_codex":0.000006282797,"about_ca_system_score_gemma":0.000044519093,"threshold_uncertainty_score":0.568163},"labels":[],"label_agreement":null},{"id":"W3138656762","doi":"10.1016/j.knosys.2021.106942","title":"Efficient parallel computing on the game theory-aware robust influence maximization problem","year":2021,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Robustness (evolution); Mathematical optimization; Maximization; Interval (graph theory); Traverse; Robust optimization; Speedup; Mathematics","score_opus":0.017967813978058248,"score_gpt":0.2492843736900572,"score_spread":0.23131655971199896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138656762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11527147,0.00032924596,0.86883235,0.00016639833,0.00019141282,0.0007538499,0.000018307192,0.00024720826,0.014189767],"genre_scores_gemma":[0.9982714,4.4114648e-7,0.000596148,0.000044798064,0.00035944008,0.00011081229,0.00007057985,0.00003468377,0.00051166874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977479,0.00073797547,0.00047099777,0.00044423447,0.00025173533,0.0003471339],"domain_scores_gemma":[0.9979353,0.0005929638,0.00025751142,0.00067685643,0.00046158402,0.00007579143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007968622,0.00026149178,0.00034047986,0.000086356275,0.00031173424,0.00021827349,0.0003320339,0.000053438813,0.00010973979],"category_scores_gemma":[0.000022217666,0.00019451616,0.0001964012,0.000680037,0.00006700175,0.0000242193,0.00009939319,0.0002489895,0.00012315263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010512764,0.00022422294,0.003711785,0.000049692208,0.00007147402,0.000002204635,0.0002611773,0.9031922,0.000100444006,0.089576185,0.0008910282,0.0019090603],"study_design_scores_gemma":[0.00036682645,0.00004073038,0.0005151483,0.000584951,0.000060638467,0.0000011585165,0.00044973774,0.9932885,0.0008962629,0.0012438203,0.0022512067,0.00030098416],"about_ca_topic_score_codex":0.000054508124,"about_ca_topic_score_gemma":0.000010249105,"teacher_disagreement_score":0.88299996,"about_ca_system_score_codex":0.00009283927,"about_ca_system_score_gemma":0.00016918826,"threshold_uncertainty_score":0.7932139},"labels":[],"label_agreement":null},{"id":"W3139621838","doi":"10.1093/comjnl/bxab032","title":"Advanced Data Mining Tools and Methods for Social Computing","year":2021,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Cornerstone; Data science; Computer science; Social computing; Big data; Knowledge management; Social media; World Wide Web; Data mining","score_opus":0.09376561811692588,"score_gpt":0.4239916224342266,"score_spread":0.33022600431730076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139621838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011722236,0.000237408,0.98680735,0.0006971821,0.000169217,0.00006561305,0.000011383944,0.000020419035,0.00026921454],"genre_scores_gemma":[0.117548786,0.0000039092765,0.8797151,0.00015049221,0.0025004055,0.0000014983094,0.000040420047,0.000011414403,0.000027966718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990895,0.00023197467,0.00023174667,0.00018373344,0.00007183607,0.00019121177],"domain_scores_gemma":[0.9988851,0.00054616336,0.00015700448,0.0002625275,0.00010931763,0.00003988982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095927017,0.00009750607,0.00021241503,0.000022768489,0.0005789717,0.0003447737,0.00042098973,0.00001445862,0.000041335563],"category_scores_gemma":[0.0000080140335,0.00007458884,0.000089362424,0.00010669575,0.000026809927,0.0001538333,0.00064646447,0.00019180244,3.7773097e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004078816,0.000011016722,0.0003247375,0.0000021768517,0.000121843404,9.793656e-7,0.00031286172,0.00008404073,0.00019429131,0.0026507091,0.005456112,0.99083716],"study_design_scores_gemma":[0.001167795,0.000059858015,0.0036477621,0.00008399861,0.00028219892,0.00012929969,0.00069737306,0.8494678,0.0010017083,0.051245768,0.0918002,0.00041620075],"about_ca_topic_score_codex":0.0000010574769,"about_ca_topic_score_gemma":4.9140044e-7,"teacher_disagreement_score":0.99042094,"about_ca_system_score_codex":0.000009211378,"about_ca_system_score_gemma":0.00004064233,"threshold_uncertainty_score":0.44530407},"labels":[],"label_agreement":null},{"id":"W3139834472","doi":"10.2991/ijcis.d.210329.001","title":"Dynamic Relationship Network Analysis Based on Louvain Algorithm for Large-Scale Group Decision Making","year":2021,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Ministry of Education, India; Natural Science Foundation of Hubei Province; National Natural Science Foundation of China","keywords":"Centrality; Cohesion (chemistry); Computer science; Node (physics); Group decision-making; Construct (python library); Function (biology); Network analysis; Stability (learning theory); Group cohesiveness; Scale (ratio); Data mining; Algorithm; Theoretical computer science; Mathematics; Statistics; Machine learning; Psychology; Social psychology; Engineering","score_opus":0.01698120617941321,"score_gpt":0.3342009664028597,"score_spread":0.31721976022344645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139834472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030125612,0.00018741672,0.99501616,0.00015410742,0.001035853,0.00016316616,0.00009863945,0.000022072723,0.00030999994],"genre_scores_gemma":[0.74503964,0.0000021493872,0.25384858,0.000089333065,0.00067073654,0.000016687743,0.00026379246,0.000016856004,0.000052233972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970468,0.00019797192,0.0011998102,0.00029989486,0.0010118153,0.00024368682],"domain_scores_gemma":[0.99412525,0.002463332,0.0009395207,0.00019573425,0.0021911548,0.000085027445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115501,0.00020420723,0.00045551767,0.0005913468,0.00016473004,0.00027187105,0.0005115532,0.00006139351,0.0002291827],"category_scores_gemma":[0.00007208557,0.00020045559,0.00074926496,0.0009379095,0.00002751902,0.00018402473,0.000060171613,0.00026005894,0.000010527522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054631877,0.00019885795,0.011451354,0.0000035996266,0.00093726703,0.000013124842,0.000050982664,0.92886925,0.0000016433646,0.023966672,0.00043129674,0.034021292],"study_design_scores_gemma":[0.00022447587,0.00006294258,0.003974478,0.00027173173,0.00023363042,0.000013011377,0.00020336793,0.910188,0.000008529151,0.08377679,0.00087855046,0.0001644689],"about_ca_topic_score_codex":0.000010391394,"about_ca_topic_score_gemma":0.000016489288,"teacher_disagreement_score":0.7420271,"about_ca_system_score_codex":0.00021287007,"about_ca_system_score_gemma":0.00016952651,"threshold_uncertainty_score":0.81743413},"labels":[],"label_agreement":null},{"id":"W3143012963","doi":"10.1128/msphere.01019-20","title":"Evenness-Richness Scatter Plots: a Visual and Insightful Representation of Shannon Entropy Measurements for Ecological Community Analysis","year":2021,"lang":"en","type":"article","venue":"mSphere","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Species evenness; Species richness; Diversity index; Mathematics; Statistics; Alpha diversity; Entropy (arrow of time); Generalized entropy index; Ecology; Physics; Biology; Cluster analysis","score_opus":0.052794688104532285,"score_gpt":0.33644407582456104,"score_spread":0.28364938772002873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143012963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92812854,0.000066793546,0.07096867,0.00006840487,0.000017580682,0.00017585816,0.000018017612,0.000026899981,0.0005292254],"genre_scores_gemma":[0.9969106,0.0000025306153,0.0025616197,0.000028816346,0.00006369221,0.00007432354,0.00025945154,0.000010032447,0.00008896474],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99888,0.00029706236,0.00029552795,0.00021609262,0.00015872731,0.00015256027],"domain_scores_gemma":[0.9990553,0.00016247922,0.00016378559,0.0002973923,0.00027746038,0.00004357843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021234926,0.00012277182,0.00039631687,0.000053920907,0.00015439205,0.00004248587,0.0001236244,0.00004208261,0.00061489653],"category_scores_gemma":[0.000019241415,0.0001144485,0.00022101197,0.0006819775,0.000046056433,0.00008779919,0.00013684604,0.000117424395,0.0000014696267],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003822537,0.00072179316,0.9767608,0.000028665856,0.0015100528,7.729851e-7,0.0003013641,0.00016192488,0.00794601,0.00068428536,0.00044116567,0.01140493],"study_design_scores_gemma":[0.0018025896,0.00022212627,0.8808762,0.00006589848,0.0033815685,9.537079e-7,0.003405324,0.017003188,0.07293869,0.018830292,0.0009002142,0.0005729996],"about_ca_topic_score_codex":0.0003075856,"about_ca_topic_score_gemma":0.00041048662,"teacher_disagreement_score":0.09588466,"about_ca_system_score_codex":0.000024183122,"about_ca_system_score_gemma":0.00002358301,"threshold_uncertainty_score":0.6732686},"labels":[],"label_agreement":null},{"id":"W3143558502","doi":"10.1109/asonam49781.2020.9381341","title":"A Theoretical Approach for Discovery of Friends from Directed Social Graphs","year":2020,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Computer science; Big data; Data science; Social network (sociolinguistics); Theoretical computer science; Knowledge graph; Graph; Social media; Graph theory; World Wide Web; Information retrieval; Data mining; Mathematics; Combinatorics","score_opus":0.015229297673374423,"score_gpt":0.2537301869051732,"score_spread":0.23850088923179877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143558502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06296205,0.000010021261,0.8853741,0.00025020662,0.000008643849,0.00018032828,0.00016671812,0.00012511564,0.05092279],"genre_scores_gemma":[0.9692177,2.1380421e-7,0.030124228,0.00005603846,0.0002633007,0.000040154166,0.00026378955,0.000011401992,0.000023136716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938107,0.000029106399,0.00017783958,0.00019700067,0.00009066467,0.00012432059],"domain_scores_gemma":[0.9996932,0.00007939575,0.00005906419,0.00009693109,0.000035874382,0.000035543155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004137527,0.00009385342,0.0002466546,0.000019166111,0.000046418794,0.000025718058,0.00014362656,0.000024536985,0.0007477422],"category_scores_gemma":[0.000003175976,0.00007699814,0.00026126928,0.00019345852,0.000103198676,0.00005432504,0.000061950006,0.00006093218,6.6352663e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003997163,0.00008513089,0.0031221989,0.0000034976238,0.0001812951,3.0589195e-8,0.00021997267,0.0000025927354,0.0015130125,0.9894706,0.003654772,0.0017069092],"study_design_scores_gemma":[0.00074421475,0.00010290889,0.001719303,0.000005081205,0.00035650027,1.982664e-8,0.00086252217,0.16688001,0.014813022,0.81352097,0.0006436381,0.0003517882],"about_ca_topic_score_codex":0.0000754576,"about_ca_topic_score_gemma":5.853553e-7,"teacher_disagreement_score":0.90625566,"about_ca_system_score_codex":0.000002497503,"about_ca_system_score_gemma":0.000012563653,"threshold_uncertainty_score":0.8187252},"labels":[],"label_agreement":null},{"id":"W3144969346","doi":"10.1016/j.ins.2022.05.035","title":"Semi-supervised clustering with inaccurate pairwise annotations","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Pairwise comparison; Computer science; Cluster analysis; Class (philosophy); Relational database; Data mining; Stochastic block model; Link (geometry); Block (permutation group theory); Machine learning; Artificial intelligence; Mathematics","score_opus":0.019955369848768296,"score_gpt":0.2664773533025454,"score_spread":0.2465219834537771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144969346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58242285,0.000011572074,0.32631072,0.00082864624,0.00009297092,0.00034248419,0.000048882237,0.00022559272,0.089716256],"genre_scores_gemma":[0.99744946,3.069871e-7,0.0021542907,0.00018145607,0.00002400675,0.00008972729,0.000041520096,0.0000018019939,0.000057444664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992776,0.000030656174,0.00019151626,0.00007646244,0.0002941347,0.00012962995],"domain_scores_gemma":[0.99965054,0.000032380907,0.00012508224,0.00010783441,0.000056471275,0.000027683027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003133917,0.000062064966,0.000069874775,0.00014892161,0.00077107805,0.0001667144,0.00023418023,0.0000040419895,0.00080296805],"category_scores_gemma":[0.00000234401,0.000051655417,0.000029969056,0.00084739807,0.000064680156,0.0012121302,0.00011716205,0.000072488,0.000016968163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031976386,0.000090896145,0.08833807,0.000013968353,0.00006846123,7.6667817e-7,0.011428391,0.6513978,0.00015500389,0.038499586,0.011980171,0.19799492],"study_design_scores_gemma":[0.00031064707,0.00015028995,0.0033458434,0.000009810793,0.000016030961,0.0000030082356,0.012132812,0.9229903,0.00020702982,0.002996016,0.057579793,0.00025839152],"about_ca_topic_score_codex":0.0001767682,"about_ca_topic_score_gemma":0.000011759091,"teacher_disagreement_score":0.41502658,"about_ca_system_score_codex":0.00002258284,"about_ca_system_score_gemma":0.00006691596,"threshold_uncertainty_score":0.8791937},"labels":[],"label_agreement":null},{"id":"W3145631682","doi":"10.2139/ssrn.3502849","title":"‘The Company We Keep:’ Endogenous Network Formation and Peer Effects in Customer Churn","year":2019,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Business; Industrial organization; Endogeny; Marketing; Customer retention; Peer-to-peer; Computer science; Computer network; Chemistry","score_opus":0.00624198947188061,"score_gpt":0.22268344191597073,"score_spread":0.2164414524440901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145631682","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9181085,0.010266231,0.055768415,0.001168377,0.00032327752,0.0008634764,0.0000015417521,0.000073867,0.013426263],"genre_scores_gemma":[0.99764085,0.0007733809,0.0001430314,0.000021491578,0.00044477286,0.000014198772,0.0000057253424,0.000018108618,0.0009384695],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976625,0.00013910419,0.00029579378,0.00014272539,0.00023896173,0.0015209544],"domain_scores_gemma":[0.99935067,0.00016232017,0.00018506621,0.00018121785,0.000067588204,0.000053154043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013697963,0.0001572096,0.00023365609,0.00007823671,0.00027536709,0.00012322255,0.00022279705,0.000033933422,0.000038933787],"category_scores_gemma":[0.0000037308266,0.00011829448,0.000109371875,0.00025494103,0.000023771583,0.00019288133,0.00005916011,0.0012029437,0.000049379403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006549542,0.00006508184,0.08878195,0.0000130365925,0.00033192066,0.00000202634,0.00032909578,0.001172102,0.00045462305,0.43566066,0.0010742253,0.47204977],"study_design_scores_gemma":[0.0016172067,0.000288146,0.004448323,0.00010781603,0.00011317351,0.00016207725,0.0010164833,0.01050866,0.0002396942,0.9413984,0.039648645,0.0004513725],"about_ca_topic_score_codex":0.000083426894,"about_ca_topic_score_gemma":0.00037406475,"teacher_disagreement_score":0.5057377,"about_ca_system_score_codex":0.00026542778,"about_ca_system_score_gemma":0.00019373074,"threshold_uncertainty_score":0.52262586},"labels":[],"label_agreement":null},{"id":"W3147273484","doi":"10.1109/ipdps.2006.1639553","title":"Network decontamination with local immunization","year":2006,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Asynchronous communication; Upper and lower bounds; Tree (set theory); Computer science; Torus; Constant (computer programming); Task (project management); Vertex (graph theory); Immunization; Server; Distributed computing; Computer network; Mathematics; Graph; Theoretical computer science; Engineering; Combinatorics; Medicine","score_opus":0.0027270933747322325,"score_gpt":0.19388535054475775,"score_spread":0.19115825717002552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147273484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026468415,0.000012832679,0.8830611,0.000040809315,0.000008066086,0.00006382463,3.4297193e-7,0.000080437945,0.09026418],"genre_scores_gemma":[0.9903311,1.6434507e-7,0.007895249,0.000024241912,0.00026966,0.00001222003,0.000116580646,0.000008695072,0.0013420482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995933,0.000017828685,0.00010761208,0.000096429234,0.00006870623,0.000116089555],"domain_scores_gemma":[0.9997415,0.000017428638,0.000047649322,0.00012794473,0.00005343641,0.000012058476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056005403,0.00006678568,0.00007821965,0.00002436935,0.00007180052,0.000028554887,0.000058710815,0.000011836467,0.0005667063],"category_scores_gemma":[1.2695213e-7,0.000053997006,0.000024774256,0.00022282933,0.00002112708,0.00007630496,0.000016964696,0.00003868538,0.000013602279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008895524,0.00007460904,0.23110303,0.0000011060474,0.000034433753,4.0722153e-7,0.000010322553,0.032814015,0.000044355453,0.65874165,0.015973952,0.061193213],"study_design_scores_gemma":[0.0014465969,0.0002415335,0.2939297,0.00007122616,0.00023768864,0.0000026412442,0.0003213473,0.28310502,0.0063032135,0.36220688,0.051026534,0.0011075928],"about_ca_topic_score_codex":0.0008452582,"about_ca_topic_score_gemma":0.00019881275,"teacher_disagreement_score":0.9638627,"about_ca_system_score_codex":0.0000153038,"about_ca_system_score_gemma":0.000009251119,"threshold_uncertainty_score":0.62050366},"labels":[],"label_agreement":null},{"id":"W3147322397","doi":"10.21307/connections-2019-004","title":"Linton C. Freeman Interview by Katherine Faust, July 27, 2018","year":2019,"lang":"en","type":"article","venue":"Connections","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"FAUST; Psychoanalysis; Computer science; Art history; Psychology; Art","score_opus":0.013318923201136807,"score_gpt":0.2581148578422168,"score_spread":0.24479593464108002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147322397","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3596377,0.00097595825,0.2548973,0.0023287649,0.0016256074,0.001170974,0.00018526714,0.000973347,0.37820506],"genre_scores_gemma":[0.98280483,0.000010826491,0.00037428393,0.00009191851,0.0002928207,0.0000388851,0.00007996412,0.000020954229,0.016285487],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992686,0.000044328088,0.0001990321,0.00023601898,0.00007254091,0.0001795049],"domain_scores_gemma":[0.99933803,0.000048705835,0.000077800985,0.00042408513,0.000054086013,0.00005728445],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000105216364,0.00013148737,0.0002019115,0.000058036927,0.00008820139,0.000046243502,0.00017988498,0.000028653874,0.006769423],"category_scores_gemma":[0.0000026143086,0.00012847631,0.00016681656,0.00023355687,0.00002609903,0.00008462245,0.00008359404,0.00015098465,0.001232722],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004811887,0.00032512116,0.01601083,0.000021004533,0.00037288814,4.219098e-7,0.0001948547,0.00007921565,0.004501322,0.028456796,0.9158775,0.034155183],"study_design_scores_gemma":[0.0001791589,0.000069600996,0.00028192348,0.000038404836,0.00005786045,7.5320185e-7,0.00013347375,0.0011719477,0.0016219014,0.0060491636,0.990189,0.00020679783],"about_ca_topic_score_codex":0.0003146814,"about_ca_topic_score_gemma":0.000041330866,"teacher_disagreement_score":0.62316716,"about_ca_system_score_codex":0.000026419408,"about_ca_system_score_gemma":0.0000125374445,"threshold_uncertainty_score":0.9995449},"labels":[],"label_agreement":null},{"id":"W3149818399","doi":"","title":"“Two Is a Crowd” - Optimal Trend Adoption in Social Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Social network (sociolinguistics); Computer science; Social network analysis; Process (computing); Graph; Work (physics); Data science; Social media; World Wide Web; Engineering; Theoretical computer science","score_opus":0.018042553676007676,"score_gpt":0.29641683249284856,"score_spread":0.2783742788168409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3149818399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49539888,0.00016162614,0.3391874,0.0002491141,0.00011483978,0.0002209751,0.000008084458,0.00019598738,0.16446307],"genre_scores_gemma":[0.9941348,0.0000014556821,0.0034705957,0.00007981816,0.0016217778,0.000026003832,0.000039380804,0.000012743799,0.0006134507],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919623,0.000037469028,0.00019127062,0.00013627678,0.00008884435,0.00034987894],"domain_scores_gemma":[0.9997367,0.000018960194,0.00005693288,0.00012192692,0.000012625779,0.000052857496],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015879248,0.000118629025,0.00017015586,0.00007593239,0.00008259926,0.000034719837,0.00009586002,0.000033770622,0.0027162645],"category_scores_gemma":[3.1958547e-7,0.00011453895,0.00012685578,0.00028338126,0.000022717462,0.00017850198,0.000063299616,0.0001412213,0.000022005986],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033121814,0.00056757627,0.62932116,0.0000028758475,0.00014117222,6.3495804e-7,0.00110349,0.002947214,0.000104030565,0.15727475,0.08317782,0.12532616],"study_design_scores_gemma":[0.004290466,0.00014817568,0.33057395,0.000067196546,0.00043325935,0.0000029198134,0.0025244113,0.5091345,0.0023336709,0.0151090585,0.13267806,0.0027043535],"about_ca_topic_score_codex":0.00027213583,"about_ca_topic_score_gemma":0.000036057292,"teacher_disagreement_score":0.50618726,"about_ca_system_score_codex":0.00002801176,"about_ca_system_score_gemma":0.000006644455,"threshold_uncertainty_score":0.9981954},"labels":[],"label_agreement":null},{"id":"W3151096421","doi":"10.1017/9781108649018.003","title":"Structural Properties of Networks","year":2021,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Northern British Columbia","funders":"","keywords":"Diversity (politics); Computer science; Task (project management); Complex network; Focus (optics); Function (biology); Graph; Scale (ratio); Spectral properties; Theoretical computer science; Mathematics; Sociology; Geography; Cartography; Economics; World Wide Web; Management; Physics","score_opus":0.022805610408789635,"score_gpt":0.19318875127393434,"score_spread":0.1703831408651447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151096421","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013874428,0.00036552487,0.0019777734,0.0000028984266,0.00007766006,0.00021725091,0.000082338236,0.000072379524,0.9958167],"genre_scores_gemma":[0.19650148,0.000014105031,0.00010278839,0.0000058266023,0.00023625906,5.071395e-7,0.000091391645,0.000032067604,0.8030156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897647,0.000033933393,0.00023093911,0.0003677701,0.00018045012,0.00021045229],"domain_scores_gemma":[0.9988051,0.00001989234,0.0003108651,0.00055164867,0.00023303485,0.00007944593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000041795745,0.0003182507,0.0005616107,0.00009795486,0.00010960266,0.000030145346,0.0004039029,0.0001439539,0.000045778263],"category_scores_gemma":[7.277338e-7,0.00034611556,0.00041803604,0.000011578774,0.00020664521,0.000048654012,0.00046639558,0.00038023485,9.617592e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026034986,0.0000049492724,0.000032712076,0.0000351628,0.00048753287,0.000018445326,0.00001562006,0.00008698347,0.00008680705,0.989134,0.007335381,0.0027363552],"study_design_scores_gemma":[0.00064670894,0.000059712736,0.000040927607,0.0009819313,0.0013862978,0.0000047142125,0.000114061346,0.0063077887,0.005787351,0.00011645063,0.98322666,0.0013273788],"about_ca_topic_score_codex":0.0003051733,"about_ca_topic_score_gemma":0.0000019553636,"teacher_disagreement_score":0.98901755,"about_ca_system_score_codex":0.000053774336,"about_ca_system_score_gemma":0.00007669358,"threshold_uncertainty_score":0.9998991},"labels":[],"label_agreement":null},{"id":"W3152021761","doi":"10.18280/ts.380101","title":"A Profile Analysis of User Interaction in Social Media Using Deep Learning","year":2021,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Centrality; Reciprocity (cultural anthropology); Modularity (biology); Social media; Social network analysis; Convolutional neural network; Artificial intelligence; Set (abstract data type); Data set; Social network (sociolinguistics); Machine learning; Data mining; Data science; World Wide Web; Mathematics; Statistics","score_opus":0.0270475019801725,"score_gpt":0.2969126585499478,"score_spread":0.2698651565697753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152021761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94589305,0.000015698568,0.052927956,0.000016381451,0.000017195449,0.000059515576,0.00000641458,0.000018731986,0.0010450863],"genre_scores_gemma":[0.99775684,7.6499816e-7,0.0018145901,0.0000071528716,0.00018643042,0.000013474515,0.00018858821,0.000008649944,0.000023484019],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990134,0.00012795716,0.00034122835,0.00018541358,0.00017919163,0.00015279444],"domain_scores_gemma":[0.99956393,0.000086081454,0.0001673711,0.00007137799,0.00008779732,0.000023455175],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017960863,0.00009770014,0.00030569054,0.00027456836,0.000064549764,0.00002738594,0.000068889334,0.000022819826,0.0054684356],"category_scores_gemma":[0.0000042890647,0.0001064952,0.00023251746,0.0010881361,0.00001907127,0.00009581591,0.00004712317,0.00014194023,0.0000017973404],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008418588,0.0009772193,0.7275769,0.000027501666,0.0042185015,0.000013757194,0.0068557477,0.06885778,0.07769051,0.010440225,0.00023275589,0.103024915],"study_design_scores_gemma":[0.000867009,0.00003757265,0.1749165,0.00006258253,0.0024279351,4.8705596e-7,0.004834693,0.7939728,0.019994833,0.0011165512,0.0013369429,0.0004320826],"about_ca_topic_score_codex":0.00011213951,"about_ca_topic_score_gemma":0.00018276271,"teacher_disagreement_score":0.72511506,"about_ca_system_score_codex":0.00005083696,"about_ca_system_score_gemma":0.000026245707,"threshold_uncertainty_score":0.9954407},"labels":[],"label_agreement":null},{"id":"W3154290858","doi":"","title":"Graph Meta Network for Multi-Behavior Recommendation with Interaction Heterogeneity and Diversity","year":2021,"lang":"en","type":"article","venue":"International ACM SIGIR Conference on Research and Development in Information Retrieval","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Diversity (politics); Sociology","score_opus":0.21402456605805764,"score_gpt":0.4028547213879218,"score_spread":0.18883015532986414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154290858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87924635,0.000015716612,0.11689376,0.0010663308,0.00016177993,0.0007257324,0.00008190756,0.000040722432,0.0017676739],"genre_scores_gemma":[0.97176284,0.000036276273,0.027161041,0.00006131557,0.000036201043,0.000113013506,0.00077106815,0.000003919324,0.000054310203],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99891573,0.00006347325,0.00029107602,0.00019488773,0.00033620358,0.00019865455],"domain_scores_gemma":[0.99867076,0.00025295606,0.00010865141,0.00011274374,0.0007858762,0.000068998765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005916121,0.000115534625,0.00015915932,0.0002487697,0.000289134,0.00025137202,0.00016040284,0.00003572714,0.0002158408],"category_scores_gemma":[0.00007462499,0.00010175786,0.000031967367,0.000226777,0.00005190159,0.0006193235,0.00039604036,0.00021159668,0.0000047441736],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014117956,0.00053010497,0.7926294,0.0000434692,0.0011875471,0.0000041066633,0.0011095214,0.0001679771,0.000096345495,0.03780075,0.0014432757,0.16357571],"study_design_scores_gemma":[0.009796474,0.0010484762,0.78892225,0.0004292295,0.00024318087,0.00002382927,0.0047169435,0.051109366,0.02677435,0.03171367,0.08354318,0.0016790394],"about_ca_topic_score_codex":0.00006737281,"about_ca_topic_score_gemma":0.00015180859,"teacher_disagreement_score":0.16189666,"about_ca_system_score_codex":0.00007631337,"about_ca_system_score_gemma":0.000111782116,"threshold_uncertainty_score":0.4149565},"labels":[],"label_agreement":null},{"id":"W3157597133","doi":"10.3389/frma.2021.690986","title":"Editorial: Research Collaboration and Networks: Characteristics, Evolution and Trends","year":2021,"lang":"en","type":"editorial","venue":"Frontiers in Research Metrics and Analytics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Front (military); Political science; Sociology; Regional science; Geography","score_opus":0.047902783401363606,"score_gpt":0.41424913087478954,"score_spread":0.3663463474734259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157597133","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004962108,0.018710723,0.028720807,0.000306514,0.9489886,0.000576308,0.0005070325,0.00004810248,0.0016456977],"genre_scores_gemma":[0.03091792,0.013282483,0.0019375029,0.0000018393898,0.95086306,0.000061975516,0.0012116933,0.00006538198,0.0016581421],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939894,0.0011304535,0.0006734547,0.0010030944,0.0022921823,0.00091140444],"domain_scores_gemma":[0.9940058,0.0019915495,0.00021555499,0.0005223589,0.0029479167,0.00031681333],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.008136649,0.00035335036,0.000955351,0.0045523318,0.0005367797,0.001207202,0.00033954156,0.00072125444,0.000016991662],"category_scores_gemma":[0.0018766754,0.0003727278,0.00008172812,0.00858041,0.0006060205,0.00020258522,0.0007625167,0.0033356973,4.927582e-7],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004091274,0.00007712581,0.012694497,0.00006251909,0.00015555597,0.000006371326,0.00005128586,0.000011244497,0.0000012065642,0.001213302,0.9515701,0.03411586],"study_design_scores_gemma":[0.0004847691,0.00016330545,0.0005895444,0.00020458749,0.0001078369,1.3976012e-7,0.0011452627,0.05892643,0.000002281456,0.0071081663,0.9308772,0.0003904917],"about_ca_topic_score_codex":0.00078055536,"about_ca_topic_score_gemma":0.00011093407,"teacher_disagreement_score":0.058915183,"about_ca_system_score_codex":0.00045682734,"about_ca_system_score_gemma":0.0005011448,"threshold_uncertainty_score":0.99987245},"labels":[],"label_agreement":null},{"id":"W3158355779","doi":"10.1155/2021/8881106","title":"Demonstration of Participation Networks in Urban Transport Policy of Public and Private Sectors through Social Media: The Case of Bike-Sharing Pricing Strategy in China","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"China Scholarship Council; National Natural Science Foundation of China; New York University","keywords":"Viewpoints; Social media; Business; Public relations; Scope (computer science); Stakeholder; Social network analysis; Information sharing; China; Social network (sociolinguistics); Bridge (graph theory); Marketing; Knowledge management; Political science; Computer science","score_opus":0.020612571970028717,"score_gpt":0.2995632443777093,"score_spread":0.2789506724076806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158355779","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96279204,0.00012570905,0.036841415,0.00006591143,0.000018395845,0.00009712386,0.000007802635,0.0000026465375,0.000048942737],"genre_scores_gemma":[0.9988652,0.00005930157,0.00093227206,0.000001976437,0.00008928751,0.000004111222,0.000038870676,0.000008418441,6.020435e-7],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985543,0.00006883063,0.0010034058,0.00010520186,0.00013963779,0.00012863758],"domain_scores_gemma":[0.99876916,0.000081840495,0.0008812419,0.00007708213,0.00016703417,0.000023638015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035479854,0.00009593027,0.0003467304,0.0001633578,0.000028327393,0.000006586822,0.00006638347,0.000040292325,0.000007996965],"category_scores_gemma":[0.000009631185,0.00008403023,0.0001038851,0.00078766205,0.00005519403,0.00042265968,0.0000025443492,0.00019435566,4.167046e-9],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076834265,0.00022849621,0.69141984,0.00006800604,0.00009166216,0.000035032073,0.011884556,0.23819457,0.0071018883,0.02984146,7.928372e-7,0.02105687],"study_design_scores_gemma":[0.0007856081,0.00005853291,0.9767157,0.00014010721,0.00009288886,0.000004457525,0.0021062358,0.0029568225,0.0072197677,0.009837553,0.0000020138282,0.000080314],"about_ca_topic_score_codex":0.00029115088,"about_ca_topic_score_gemma":0.0030418935,"teacher_disagreement_score":0.28529587,"about_ca_system_score_codex":0.00002647363,"about_ca_system_score_gemma":0.00009372687,"threshold_uncertainty_score":0.34266534},"labels":[],"label_agreement":null},{"id":"W3158596226","doi":"","title":"Network Analysis of SFU Course Registrations","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Statistic; Class size; Class (philosophy); Simple (philosophy); Graph; Course (navigation); Computer science; Theoretical computer science; Mathematics; Statistics; Mathematics education; Artificial intelligence; Physics","score_opus":0.05740958810092206,"score_gpt":0.21392709528483325,"score_spread":0.1565175071839112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158596226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45721763,0.00012364863,0.5215132,0.000040349933,0.0001088763,0.00020241213,0.00010180795,0.00010575779,0.020586332],"genre_scores_gemma":[0.9968698,0.00003116543,0.00093861256,0.000014767052,0.00018918217,0.0000015295101,0.00080800866,0.000016558488,0.0011303665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984952,0.00014350454,0.00032443038,0.00069307664,0.000081771606,0.00026199175],"domain_scores_gemma":[0.997709,0.00009403432,0.0005369888,0.0012700352,0.0002938716,0.00009607187],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017811479,0.00026343943,0.00074552296,0.00025276837,0.000114934985,0.000057541474,0.0005540618,0.00013109326,0.0010956294],"category_scores_gemma":[0.0000032858188,0.00033546847,0.000957073,0.0023709561,0.00011957115,0.00008161516,0.00059745245,0.00040650004,0.0000040194786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056612166,0.00015921086,0.12900731,0.000010753188,0.0050003827,0.000017475804,0.000047027414,0.7682174,0.000011030511,0.09589552,0.001464549,0.0001636745],"study_design_scores_gemma":[0.0003295923,0.000034838275,0.035036188,0.00017691204,0.029349385,2.427592e-7,0.0005724271,0.848544,0.0001619856,0.08431152,0.0006250236,0.0008578957],"about_ca_topic_score_codex":0.0010408227,"about_ca_topic_score_gemma":0.0003294082,"teacher_disagreement_score":0.53965217,"about_ca_system_score_codex":0.000055823602,"about_ca_system_score_gemma":0.00021107876,"threshold_uncertainty_score":0.99990976},"labels":[],"label_agreement":null},{"id":"W3158609166","doi":"10.1038/s41598-021-88692-9","title":"Hunting for vital nodes in complex networks using local information","year":2021,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Verafin (Canada); Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Node (physics); Set (abstract data type); Degree (music); Degree distribution; Evolving networks; Shortest path problem; Complex network; Distributed computing; Computer network; Theoretical computer science; Graph","score_opus":0.021629107896844506,"score_gpt":0.28196755513851324,"score_spread":0.2603384472416687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158609166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23855887,0.000022977714,0.75919294,0.000018104705,0.00053118216,0.00015824156,0.0000022608497,0.00003518444,0.0014802278],"genre_scores_gemma":[0.9884932,1.1546586e-7,0.010709885,0.000014386929,0.0001263865,0.000017318065,0.00054409326,0.0000072792395,0.00008733245],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870354,0.000024964169,0.0005282184,0.00029063053,0.00018053455,0.000272142],"domain_scores_gemma":[0.9990847,0.00003200599,0.00025976793,0.000362736,0.00021894282,0.000041848336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071162055,0.00009880925,0.00018186097,0.00012298784,0.00024048722,0.0003951526,0.00007001972,0.000027400776,0.00016206618],"category_scores_gemma":[0.000015534695,0.0001061646,0.00012839511,0.0006165893,0.000079924124,0.00041709875,0.000098890734,0.00008168649,0.000001825037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014380281,0.00026761804,0.39744753,0.000062347935,0.00012177475,0.00008511349,0.0006047174,0.2886007,0.013377227,0.0087819295,0.01511737,0.27551928],"study_design_scores_gemma":[0.00019206834,0.0000061020846,0.00428538,0.00006742628,0.00003811627,0.000023082279,0.0006411628,0.92414033,0.01144689,0.026369143,0.032481402,0.00030889155],"about_ca_topic_score_codex":0.00018321969,"about_ca_topic_score_gemma":0.000059488495,"teacher_disagreement_score":0.7499343,"about_ca_system_score_codex":0.000046190646,"about_ca_system_score_gemma":0.00009217544,"threshold_uncertainty_score":0.4329267},"labels":[],"label_agreement":null},{"id":"W3158748375","doi":"10.5539/ep.v10n2p1","title":"Global Research Collaboration for Vapour Intrusion","year":2021,"lang":"en","type":"article","venue":"Environment and Pollution","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Social network analysis; Collaborative network; Productivity; Intrusion; Regional science; China; Social network (sociolinguistics); Network analysis; Political science; Economic growth; Knowledge management; Engineering; Computer science; Geography; Economics; World Wide Web; Social media","score_opus":0.02215673357395427,"score_gpt":0.33120727553094864,"score_spread":0.3090505419569944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158748375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8554724,0.00057098217,0.13468784,0.0025219393,0.00007910526,0.0003923491,0.000103961574,0.000032830798,0.0061386195],"genre_scores_gemma":[0.9964612,0.0000423405,0.0023167909,0.00002012703,0.00025876137,0.000036339236,0.00012943451,0.0000038333615,0.00073118083],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994527,0.000067228175,0.000091525304,0.00016119868,0.00009919059,0.000128143],"domain_scores_gemma":[0.9997903,0.000017097047,0.000026605001,0.00010986303,0.000022777373,0.00003331724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019552038,0.00005382131,0.00006919022,0.000022700726,0.00019067993,0.000040810606,0.000029341452,0.000023939023,0.00027607524],"category_scores_gemma":[0.0000035895212,0.00005536757,0.000030602107,0.00015147109,0.000032061063,0.000057844718,0.000056995497,0.000038404087,0.000009204134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121804864,0.00036612232,0.0943416,0.00001755957,0.00013811192,0.0000017952293,0.0005241479,0.0009208479,0.016440239,0.38237843,0.04022631,0.46452302],"study_design_scores_gemma":[0.001151273,0.00019748256,0.06746069,0.000031414747,0.00010070768,0.0000015171527,0.001588725,0.011492937,0.019228,0.34163722,0.5567221,0.00038793555],"about_ca_topic_score_codex":0.000024675335,"about_ca_topic_score_gemma":0.000013823619,"teacher_disagreement_score":0.51649576,"about_ca_system_score_codex":0.00006382169,"about_ca_system_score_gemma":0.000020130814,"threshold_uncertainty_score":0.30228302},"labels":[],"label_agreement":null},{"id":"W3160073959","doi":"10.1155/2021/5551718","title":"Evolutionary Prediction of Nonstationary Event Popularity Dynamics of Weibo Social Network Using Time-Series Characteristics","year":2021,"lang":"en","type":"article","venue":"Discrete Dynamics in Nature and Society","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Xihua University; Jiangsu Development and Reform Commission; National Natural Science Foundation of China","keywords":"Popularity; Computer science; Social media; Event (particle physics); Microblogging; Time series; Scalability; Series (stratigraphy); Social network (sociolinguistics); Volatility (finance); Machine learning; Artificial intelligence; Data mining; Econometrics; Mathematics; World Wide Web; Database; Psychology","score_opus":0.004708659074497356,"score_gpt":0.2512113216893261,"score_spread":0.24650266261482873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160073959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9112174,0.00050787284,0.08309764,0.0002707371,0.00021222097,0.00025716913,0.0032523517,0.00003756418,0.0011470679],"genre_scores_gemma":[0.9790377,0.000054369564,0.016157988,0.000017024031,0.00019945546,0.0000045658426,0.0044504767,0.0000138870955,0.00006453409],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893576,0.00007679707,0.00041388674,0.00021361477,0.00018896456,0.00017097175],"domain_scores_gemma":[0.99933195,0.000047310634,0.00025828514,0.00014906682,0.00018729307,0.000026122767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018999907,0.00014062323,0.0003443675,0.00002827002,0.00015283006,0.000013164487,0.00008565329,0.00019489131,0.000026478761],"category_scores_gemma":[0.0000064438536,0.00015693101,0.00024899282,0.00037029985,0.00014397269,0.0001205924,0.00013388401,0.00042482198,6.958898e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036537265,0.00018840937,0.65330255,0.000106768835,0.00035623013,0.000002167286,0.0005457074,0.0011624247,0.00018997685,0.3412255,0.0005205222,0.0023632233],"study_design_scores_gemma":[0.00018476932,0.000021797372,0.1290068,0.00008287671,0.00011444518,0.0000018275766,0.0010966343,0.82193875,0.000014837702,0.04734436,0.000046269804,0.00014664906],"about_ca_topic_score_codex":0.000060513703,"about_ca_topic_score_gemma":0.000041930038,"teacher_disagreement_score":0.8207763,"about_ca_system_score_codex":0.00016617739,"about_ca_system_score_gemma":0.00009742156,"threshold_uncertainty_score":0.6399461},"labels":[],"label_agreement":null},{"id":"W3161090734","doi":"10.48550/arxiv.2105.09197","title":"Uniform Embeddings for Robinson Similarity Matrices","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Embedding; Adjacency matrix; Diagonal; Matrix (chemical analysis); Vertex (graph theory); Discrete mathematics; Row; Adjacency list; Similarity (geometry); Distance matrices in phylogeny; Graph; Computer science; Geometry","score_opus":0.050533425509625605,"score_gpt":0.2136446783543481,"score_spread":0.1631112528447225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161090734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4666877,0.0000769521,0.5250293,0.000043737382,0.00016512496,0.00049452734,0.00012338502,0.000222967,0.0071563],"genre_scores_gemma":[0.99407953,0.00006169774,0.0034817404,0.000030051484,0.00030096344,0.0000057321386,0.0004997495,0.000036802838,0.0015037174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983253,0.000058734215,0.00024673468,0.00091885857,0.00006776759,0.00038262212],"domain_scores_gemma":[0.9983242,0.00011802064,0.0003527797,0.0008065627,0.0002736383,0.00012478215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019879053,0.00037080742,0.0005430287,0.00019934417,0.00021030457,0.00016817775,0.00071422954,0.00019716985,0.00048182273],"category_scores_gemma":[0.0000061977275,0.00045579544,0.0007067267,0.00047474142,0.00006322075,0.00018893435,0.0010318267,0.00050556596,0.000009205589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001761256,0.0009306277,0.079395466,0.0005465343,0.0026794018,0.00009821241,0.0005387605,0.34325042,0.00017918058,0.55067664,0.015734274,0.0057943156],"study_design_scores_gemma":[0.0010422783,0.00008401398,0.0009842371,0.00034954256,0.001727319,8.9184215e-7,0.0012371822,0.7202703,0.0016804705,0.25239664,0.018440465,0.0017866835],"about_ca_topic_score_codex":0.00068857835,"about_ca_topic_score_gemma":0.000090950314,"teacher_disagreement_score":0.52739185,"about_ca_system_score_codex":0.00015866007,"about_ca_system_score_gemma":0.00015257698,"threshold_uncertainty_score":0.99978936},"labels":[],"label_agreement":null},{"id":"W3161223164","doi":"10.1088/1674-1056/abff2d","title":"Detection of influential nodes with multi-scale information*","year":2021,"lang":"en","type":"article","venue":"Chinese Physics B","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Betweenness centrality; Centrality; Computer science; Robustness (evolution); Node (physics); Closeness; Complex network; Position (finance); Degree (music); Scale-free network; Scale (ratio); Data mining; Perspective (graphical); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Physics","score_opus":0.005479515175278709,"score_gpt":0.24011932957764287,"score_spread":0.23463981440236417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161223164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5575414,0.000007735805,0.44086114,0.0000073503656,0.000020146994,0.000045527857,0.000011101036,0.000030765434,0.0014748807],"genre_scores_gemma":[0.9945272,7.238944e-7,0.0051348903,0.000016066397,0.00017444474,0.000015203471,0.00008735154,0.000008467034,0.00003565805],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947935,0.00001816872,0.0001816593,0.0000969624,0.00012440234,0.00009944637],"domain_scores_gemma":[0.9993559,0.000018548832,0.00012791555,0.00023852338,0.00023048735,0.000028595381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003184013,0.000110019406,0.00017701661,0.000029318926,0.00006111495,0.000033595614,0.00007992506,0.000014941251,0.000057025558],"category_scores_gemma":[0.0000022947636,0.000089012196,0.000100798985,0.0004215381,0.000034880428,0.00034878496,0.000058328296,0.00008632896,0.000011429688],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007714823,0.0008580522,0.6207098,0.00009788864,0.0006311749,0.0000012301728,0.0019920745,0.009375196,0.12561403,0.0068539595,0.00013655727,0.23365289],"study_design_scores_gemma":[0.002267397,0.00007938122,0.16445903,0.00009101801,0.00024008974,0.0000025236968,0.00038821678,0.09165217,0.70692796,0.031368192,0.0017890217,0.00073498476],"about_ca_topic_score_codex":0.00011040466,"about_ca_topic_score_gemma":0.000028289289,"teacher_disagreement_score":0.58131397,"about_ca_system_score_codex":0.000008810694,"about_ca_system_score_gemma":0.00003378404,"threshold_uncertainty_score":0.3629812},"labels":[],"label_agreement":null},{"id":"W3161683959","doi":"10.1109/icassp39728.2021.9413940","title":"Centrality Based Number of Cluster Estimation in Graph Clustering","year":2021,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Centrality; Cluster analysis; Clustering coefficient; Graph; Computer science; Graph theory; Probabilistic logic; Measure (data warehouse); Mathematics; Data mining; Theoretical computer science; Algorithm; Artificial intelligence; Combinatorics","score_opus":0.0121140107075349,"score_gpt":0.29046945984648065,"score_spread":0.2783554491389457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161683959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27871543,0.000003436441,0.7027081,0.00014225714,0.000015935642,0.00006086308,0.0000029625025,0.000024150233,0.018326834],"genre_scores_gemma":[0.9623196,2.3749487e-7,0.03745608,0.00004332177,0.000015189163,0.0000065024456,0.000040488496,0.000004628695,0.0001139462],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994311,0.000050991588,0.0002115412,0.000121238314,0.000077529236,0.00010762055],"domain_scores_gemma":[0.99966884,0.000037685317,0.000050441424,0.00017886056,0.000043756096,0.00002042767],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000103907514,0.000061084924,0.00013618359,0.000031151547,0.000013910568,0.000013661868,0.000051449137,0.0000149471925,0.00207163],"category_scores_gemma":[0.0000024687388,0.000061229046,0.000085585176,0.00026108781,0.000012512282,0.000056115874,0.00004158291,0.00005142371,0.0000048087545],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011859992,0.00026217496,0.9385542,0.000028099206,0.000045828754,0.0000013794743,0.00007868479,0.02181722,0.000588118,0.016830668,0.00076200016,0.021019718],"study_design_scores_gemma":[0.00059934653,0.000005509228,0.056700267,0.00006404684,0.000032121836,4.169674e-7,0.000091166155,0.88926697,0.025040966,0.027604492,0.00039707974,0.0001976374],"about_ca_topic_score_codex":0.00038049297,"about_ca_topic_score_gemma":0.00014509335,"teacher_disagreement_score":0.881854,"about_ca_system_score_codex":0.000012280836,"about_ca_system_score_gemma":0.000021202142,"threshold_uncertainty_score":0.99884063},"labels":[],"label_agreement":null},{"id":"W3162796453","doi":"10.21307/connections-2019-005","title":"Who Dunnit: The Party Mystery Game for Analyzing Network Structure and Information Flow","year":2019,"lang":"en","type":"article","venue":"Connections","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Information flow; Flow (mathematics); Cognitive science; Artificial intelligence; Psychology","score_opus":0.006597794666484868,"score_gpt":0.22829301241685554,"score_spread":0.22169521775037068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162796453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54495424,0.00014524342,0.44956535,0.0007246427,0.00036057655,0.00093466125,0.000106169675,0.00013085506,0.0030782723],"genre_scores_gemma":[0.9983483,0.000003339163,0.000778445,0.00009918042,0.00043237675,0.000047132748,0.00009161309,0.0000064957817,0.00019310733],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951124,0.000031195337,0.00015916643,0.00010024589,0.000047626978,0.00015052392],"domain_scores_gemma":[0.9994427,0.00015186591,0.00008746957,0.00021948513,0.00007109912,0.000027392243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012278264,0.00008748527,0.00013206975,0.000041319374,0.00023706941,0.00011580915,0.000078004996,0.0000255215,0.00025502773],"category_scores_gemma":[0.000005410485,0.00006526262,0.00008270026,0.00021037104,0.00002154379,0.00032193266,0.000040333452,0.0001002657,0.0000084795],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003885045,0.000036287358,0.3208508,0.000071287934,0.0009150415,9.38999e-8,0.0019676364,0.09317059,0.00018910838,0.3146364,0.06129002,0.20683387],"study_design_scores_gemma":[0.0006521755,0.00007676653,0.03086323,0.00007861073,0.00028424713,0.0000024938681,0.0005542764,0.3904655,0.00024272077,0.06593142,0.5104335,0.00041508433],"about_ca_topic_score_codex":0.000027202412,"about_ca_topic_score_gemma":0.000025523339,"teacher_disagreement_score":0.4533941,"about_ca_system_score_codex":0.000010715716,"about_ca_system_score_gemma":0.000014014801,"threshold_uncertainty_score":0.27923748},"labels":[],"label_agreement":null},{"id":"W3163389462","doi":"10.3233/mas-210513","title":"Social network analysis and community detection on spread of COVID-19","year":2021,"lang":"en","type":"article","venue":"Model Assisted Statistics and Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Centrality; Exponential random graph models; Social network analysis; Coronavirus disease 2019 (COVID-19); Computer science; Coronavirus; Social network (sociolinguistics); Econometrics; Network analysis; Index (typography); Community structure; Graph; Data science; Random graph; Data mining; Statistics; Mathematics; Theoretical computer science; Social media; World Wide Web","score_opus":0.0365176281554098,"score_gpt":0.33281440484852004,"score_spread":0.2962967766931102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163389462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013100831,0.000020434514,0.9851312,0.00010083591,0.000002223967,0.000106006715,0.00050315616,0.000023668985,0.0010116417],"genre_scores_gemma":[0.9771748,0.000011354464,0.022047319,0.00005657918,0.00005190233,0.000093684226,0.0004733195,0.000007544626,0.000083456456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927807,0.00013552152,0.0002197727,0.00016835923,0.000090992544,0.00010729424],"domain_scores_gemma":[0.99915695,0.00026716013,0.00014263422,0.00023932834,0.00011259374,0.00008130428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016263865,0.00009667098,0.00023748525,0.00006574063,0.00069431384,0.000039754075,0.00006319139,0.00003207075,0.00002419849],"category_scores_gemma":[0.000008379477,0.0001055216,0.00006279575,0.00057600794,0.000086604145,0.000016442744,0.00007035824,0.00018654214,3.6031943e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025322623,0.0006991239,0.01468451,0.00006981881,0.0014603646,6.1127884e-7,0.0005541757,0.04447548,0.0009107694,0.7113879,0.002186211,0.22354576],"study_design_scores_gemma":[0.0002768829,0.000034253175,0.015589167,0.0000055518713,0.0014529253,5.367535e-7,0.0002920144,0.5880943,0.00040200131,0.3910982,0.002516195,0.00023796764],"about_ca_topic_score_codex":0.00045231133,"about_ca_topic_score_gemma":0.00079550163,"teacher_disagreement_score":0.964074,"about_ca_system_score_codex":0.000020483134,"about_ca_system_score_gemma":0.000044594224,"threshold_uncertainty_score":0.5340171},"labels":[],"label_agreement":null},{"id":"W3163617982","doi":"10.51685/jqd.2021.017","title":"The Times They Are Rarely A-Changin'","year":2021,"lang":"en","type":"article","venue":"Journal of Quantitative Description Digital Media","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; National Science Foundation; Charles Koch Foundation; Craig Newmark Philanthropies; John S. and James L. Knight Foundation; William and Flora Hewlett Foundation","keywords":"Circadian rhythm; Ideology; Baseline (sea); Period (music); Rhythm; Construct (python library); Social media; Presidential system; Doubling time; History; Demography; Psychology; Computer science; Biology; Sociology; Political science; Neuroscience; Medicine; Politics; Art; Aesthetics; Internal medicine","score_opus":0.03822457438936527,"score_gpt":0.28221154196006226,"score_spread":0.243986967570697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163617982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.826063,0.005478268,0.13342142,0.0035206287,0.0017027005,0.0002403384,0.00019500342,0.000076850956,0.029301839],"genre_scores_gemma":[0.99760056,0.00004720939,0.0013137365,0.000034321478,0.0003854053,0.0000030233339,0.00002054188,0.000014512501,0.0005806878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880904,0.000098644,0.00045803157,0.00011175905,0.00033889138,0.00018363787],"domain_scores_gemma":[0.997816,0.00054376095,0.0005892406,0.0001600348,0.0008029903,0.00008793445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003114339,0.00013027448,0.000267018,0.00009065488,0.00013969369,0.00042078763,0.0002048052,0.000022591053,0.00013529079],"category_scores_gemma":[0.00023807425,0.000087271,0.00030826282,0.00024865658,0.0000802775,0.00065657165,0.00005564505,0.0002228805,0.000033843262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032162466,0.00080482813,0.07403538,0.000018619858,0.0021313005,0.00019209643,0.005709803,0.00025563018,0.003978449,0.65300405,0.12361123,0.13593698],"study_design_scores_gemma":[0.0015460758,0.00050621846,0.05318545,0.00061856053,0.0003886769,0.00010279574,0.037736505,0.0017949116,0.0075564226,0.7710605,0.12468194,0.0008219306],"about_ca_topic_score_codex":0.0000039556135,"about_ca_topic_score_gemma":0.000017180022,"teacher_disagreement_score":0.17153761,"about_ca_system_score_codex":0.000034025845,"about_ca_system_score_gemma":0.00008012549,"threshold_uncertainty_score":0.4057665},"labels":[],"label_agreement":null},{"id":"W3168218185","doi":"","title":"Optimal Non-Convex Exact Recovery in Stochastic Block Model via Projected Power Method","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Stochastic block model; Initialization; Mathematics; Complement (music); Logarithm; Regular polygon; Combinatorics; Limit (mathematics); Block (permutation group theory); Binary logarithm; Mathematical optimization; Discrete mathematics; Applied mathematics; Computer science; Statistics; Cluster analysis; Mathematical analysis","score_opus":0.03127098717628542,"score_gpt":0.21083665561717227,"score_spread":0.17956566844088684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168218185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39040312,0.000005882245,0.60638016,0.000010839333,0.00002142877,0.000117515614,0.0000069918565,0.0000478958,0.0030061663],"genre_scores_gemma":[0.98644334,0.0000021539825,0.011581648,0.000028839795,0.00004284674,0.0000021980288,0.000029734392,0.000023648574,0.0018455781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986464,0.000118916454,0.00020192978,0.0006163776,0.000064790416,0.00035162052],"domain_scores_gemma":[0.99906915,0.000102246006,0.00011283098,0.00049084803,0.00013136338,0.00009355114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001622184,0.00022062768,0.00035473867,0.00021443739,0.00008186802,0.000033626548,0.0002712463,0.000070925715,0.00040208473],"category_scores_gemma":[0.000006935447,0.0002673066,0.00022145282,0.0010820767,0.000040282426,0.00022123694,0.0002139253,0.00027958158,0.000028757497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058173853,0.00022967547,0.0033419263,0.00000398853,0.00015094288,0.00007310341,0.00012653263,0.98801684,0.0013405776,0.00595123,0.0002749689,0.00043204002],"study_design_scores_gemma":[0.0005029639,0.000035361172,0.00054601993,0.000027271786,0.00009591903,0.0000018450767,0.00017101681,0.9843554,0.001210489,0.012700295,0.00004459784,0.00030883987],"about_ca_topic_score_codex":0.00022625468,"about_ca_topic_score_gemma":0.000043538283,"teacher_disagreement_score":0.59604025,"about_ca_system_score_codex":0.00010461501,"about_ca_system_score_gemma":0.00016339454,"threshold_uncertainty_score":0.9999779},"labels":[],"label_agreement":null},{"id":"W3168384230","doi":"10.1103/physrevlett.127.158301","title":"Universal Nonlinear Infection Kernel from Heterogeneous Exposure on Higher-Order Networks","year":2021,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; Canada First Research Excellence Fund; China Scholarship Council; National Institute of General Medical Sciences; Royal Society","keywords":"Leverage (statistics); Nonlinear system; Kernel (algebra); Hypergraph; Linear model","score_opus":0.012301415126087253,"score_gpt":0.27078966599778925,"score_spread":0.258488250871702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168384230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9410086,0.0048115477,0.04481168,0.0059340657,0.0003924282,0.00049600337,0.00004933668,0.00031322325,0.0021830893],"genre_scores_gemma":[0.98877263,0.0007691664,0.0006567806,0.0072648274,0.0020644865,0.000031428157,0.0003563895,0.000036009154,0.000048309954],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986891,0.00017131683,0.0002346222,0.00043142732,0.00021012074,0.0002633808],"domain_scores_gemma":[0.9990972,0.00012205428,0.00012777376,0.00048597544,0.00007507815,0.00009187741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051486517,0.0002484803,0.0004745841,0.000022545799,0.0000815042,0.000044183478,0.00014439538,0.000014530484,0.0007073346],"category_scores_gemma":[0.0000043679106,0.00023380815,0.0004114016,0.00041093247,0.000040486262,0.000077322635,0.000094171744,0.0003093986,0.00010044689],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016030649,0.006410448,0.07411083,0.00073028216,0.0059262644,0.0005955674,0.00030110232,0.18961605,0.023506077,0.02304264,0.20971899,0.46588144],"study_design_scores_gemma":[0.0023122868,0.0004499229,0.019230243,0.005842195,0.00309842,0.0000055388005,0.000016145537,0.17548437,0.0071213534,0.0065353583,0.7763699,0.0035342542],"about_ca_topic_score_codex":0.0001970578,"about_ca_topic_score_gemma":0.0000064456267,"teacher_disagreement_score":0.5666509,"about_ca_system_score_codex":0.00004740264,"about_ca_system_score_gemma":0.000018625118,"threshold_uncertainty_score":0.953442},"labels":[],"label_agreement":null},{"id":"W3168396738","doi":"10.1109/ispa-bdcloud-socialcom-sustaincom51426.2020.00125","title":"Identifying the Right Person in Social Networks with Double Metaphone Codes","year":2020,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spell; Pronunciation; Computer science; Spelling; Linguistics; Cluster analysis; Context (archaeology); Natural language processing; Artificial intelligence; Sociology; History","score_opus":0.03457110862378915,"score_gpt":0.2718381355484209,"score_spread":0.23726702692463175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168396738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17399018,0.0002566132,0.69728553,0.006399925,0.000046660884,0.0006287519,0.0000043718,0.00030652498,0.12108146],"genre_scores_gemma":[0.9977436,0.0000013224374,0.001208861,0.0001978982,0.0005228219,0.000030371382,0.000014805346,0.000012681449,0.00026763717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929965,0.00004427684,0.0001326646,0.00019517305,0.00012649913,0.00020174745],"domain_scores_gemma":[0.99973303,0.000033303197,0.00006296562,0.000110903755,0.000024162517,0.00003560542],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012435013,0.000117044685,0.00020924848,0.00002560758,0.00019021986,0.00010329881,0.00020235768,0.000019020545,0.0010696041],"category_scores_gemma":[3.0669497e-7,0.00007048302,0.000098572375,0.00048767397,0.00004615133,0.00008871597,0.000053350203,0.00020155813,0.000010467111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057081337,0.0004099606,0.22359924,0.000031822907,0.0020152093,0.000026368432,0.014683729,0.014909285,0.0011400451,0.57422537,0.14204364,0.02634452],"study_design_scores_gemma":[0.009757851,0.00038655664,0.052054778,0.0001621898,0.001641385,0.000003824221,0.030323068,0.79687667,0.019053616,0.024328096,0.062021602,0.003390361],"about_ca_topic_score_codex":0.0005347383,"about_ca_topic_score_gemma":0.00022874896,"teacher_disagreement_score":0.8237534,"about_ca_system_score_codex":0.000011909276,"about_ca_system_score_gemma":0.000012505784,"threshold_uncertainty_score":0.99984354},"labels":[],"label_agreement":null},{"id":"W3168631394","doi":"10.1145/3460620.3460632","title":"Detecting Overlapping Communities in Social Networks Using A Modified Segmentation by Weighted Aggregation Approach","year":2021,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Benchmark (surveying); Computer science; Cluster analysis; Segmentation; Community structure; Measure (data warehouse); Social network analysis; Data mining; Artificial intelligence; Hierarchical clustering; Machine learning; Mathematics; Social media; Geography","score_opus":0.03338914729590718,"score_gpt":0.2818649101546364,"score_spread":0.2484757628587292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168631394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37238184,0.000047495312,0.6211064,0.000009467521,0.000012684641,0.0000855541,0.0000018062648,0.000048709495,0.006306048],"genre_scores_gemma":[0.9809492,0.0000027413055,0.018351007,0.000032166216,0.00017492991,0.000024166873,0.00038570995,0.000014584491,0.00006549534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990511,0.00020334724,0.00027524898,0.0001496222,0.000113552254,0.00020713358],"domain_scores_gemma":[0.99959385,0.00006516222,0.00012672898,0.00013059248,0.00006374243,0.00001992969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019357429,0.00012116795,0.00019403445,0.00007508251,0.0002992902,0.00011001201,0.000081640566,0.00004324253,0.00015040448],"category_scores_gemma":[0.0000012287304,0.00013756858,0.00007912884,0.0004922336,0.000022872853,0.0001684653,0.00008085237,0.00020056016,3.44074e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008087527,0.0012839177,0.13836218,0.000087662396,0.0009440904,0.00000475874,0.012642531,0.16383669,0.043376576,0.06911217,0.0031757785,0.5670928],"study_design_scores_gemma":[0.0002828536,0.0000035167245,0.00017091412,0.00002492701,0.00002742093,4.6418094e-7,0.006465229,0.9870723,0.0032887168,0.002469315,0.000032324802,0.00016205784],"about_ca_topic_score_codex":0.0016181369,"about_ca_topic_score_gemma":0.00009709001,"teacher_disagreement_score":0.8232356,"about_ca_system_score_codex":0.000070190355,"about_ca_system_score_gemma":0.000023632569,"threshold_uncertainty_score":0.56098837},"labels":[],"label_agreement":null},{"id":"W3170111791","doi":"10.1155/2021/8810254","title":"Analysis of Network Robustness in Weighted and Unweighted Approaches: A Case Study of the Air Transport Network in the Belt and Road Region","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Beijing Technology and Business University; China Postdoctoral Science Foundation; Chinese Academy of Sciences","keywords":"Betweenness centrality; Centrality; Robustness (evolution); Aviation; Computer science; Network science; Closeness; Network controllability; Complex network; Shortest path problem; Transport engineering; Mathematical optimization; Operations research; Data mining; Graph; Mathematics; Statistics; Engineering; Theoretical computer science","score_opus":0.01823861188149601,"score_gpt":0.252761510246532,"score_spread":0.23452289836503598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170111791","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906498,0.0004481606,0.008517006,0.00006834992,0.000026644755,0.00026879454,0.0000038729554,0.0000026665725,0.0000146702805],"genre_scores_gemma":[0.9985445,0.000057924575,0.001283624,0.000008679614,0.00005738869,0.000011222796,0.000025317673,0.000008754168,0.0000025627328],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99823946,0.00024213987,0.0009493962,0.00017870929,0.00024341128,0.00014690758],"domain_scores_gemma":[0.9987386,0.00011138829,0.00074755476,0.00022131689,0.00015175884,0.000029371831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050224684,0.00014204893,0.00059635664,0.00017683553,0.00006347036,0.0000066231673,0.00012584285,0.000038681577,0.0000042300912],"category_scores_gemma":[0.0000019482393,0.00009613575,0.0001891739,0.0026206768,0.000053892836,0.00016529676,0.0000047036638,0.00026322255,2.2562037e-9],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007751245,0.00029170836,0.5121123,0.000012137105,0.000366462,0.000119573044,0.0046275244,0.47798866,0.00001244017,0.00020530226,0.000002009592,0.004184336],"study_design_scores_gemma":[0.0012066314,0.0001070855,0.9719738,0.00012955628,0.0016324745,0.00002405638,0.014365128,0.009543358,0.00003123667,0.00087612896,0.000009194147,0.00010139837],"about_ca_topic_score_codex":0.00034049593,"about_ca_topic_score_gemma":0.0134136155,"teacher_disagreement_score":0.4684453,"about_ca_system_score_codex":0.000014092433,"about_ca_system_score_gemma":0.000041735348,"threshold_uncertainty_score":0.74851125},"labels":[],"label_agreement":null},{"id":"W3171290486","doi":"10.1007/s13278-021-00759-7","title":"Evaluating metrics in link streams","year":2021,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Betweenness centrality; Centrality; Computer science; Correctness; Node (physics); Theoretical computer science; Benchmark (surveying); Closeness; Mathematical proof; Algorithm; Data mining; Mathematics","score_opus":0.03565725741821606,"score_gpt":0.34748516296772486,"score_spread":0.3118279055495088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171290486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9597374,0.0011600422,0.030267963,0.00022707466,0.0000516843,0.000079967635,0.0000058830656,0.0000504215,0.008419534],"genre_scores_gemma":[0.98374027,0.000028234821,0.014584562,0.000054635286,0.001198507,0.000014347579,0.00011995473,0.000013853902,0.00024564363],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984033,0.00020551115,0.00041302896,0.00038557206,0.00022282856,0.00036976126],"domain_scores_gemma":[0.99925905,0.00021298908,0.000179831,0.00017063078,0.00011699582,0.000060507067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007472918,0.000162391,0.00055930344,0.00023965615,0.000304951,0.000118017706,0.000096995114,0.000059443955,0.0003577469],"category_scores_gemma":[0.00002122036,0.00017575805,0.00034291015,0.005046056,0.000035331315,0.00006549128,0.0001477489,0.00018931345,0.0000014286675],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002987547,0.00003123583,0.56028885,0.0000024840724,0.0009850238,0.000004607319,0.0005118926,0.0046804743,0.000025227988,0.0042279973,0.000261021,0.4289782],"study_design_scores_gemma":[0.0013917434,0.00008534812,0.23019505,0.00010921422,0.008835872,9.887211e-7,0.0073156767,0.7044891,0.00023182163,0.04098634,0.004902068,0.001456777],"about_ca_topic_score_codex":0.0002706899,"about_ca_topic_score_gemma":0.0005198099,"teacher_disagreement_score":0.69980866,"about_ca_system_score_codex":0.000028993743,"about_ca_system_score_gemma":0.000051196188,"threshold_uncertainty_score":0.7167205},"labels":[],"label_agreement":null},{"id":"W3171876400","doi":"10.1007/s00778-021-00679-0","title":"A fractional memory-efficient approach for online continuous-time influence maximization","year":2021,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Maximization; Computer science; Mathematical optimization; Mathematics","score_opus":0.010919874059083779,"score_gpt":0.2582131317671943,"score_spread":0.2472932577081105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171876400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1341439,0.00008488826,0.8637192,0.00043667408,0.0000464047,0.00013692048,0.000025015288,0.000027285867,0.0013796752],"genre_scores_gemma":[0.9196953,0.0000055219784,0.077435054,0.00015789513,0.0012630747,0.000024778732,0.00015082593,0.000020767626,0.0012467912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913144,0.000088803965,0.00025726456,0.0001378537,0.00020227066,0.00018234883],"domain_scores_gemma":[0.9991004,0.00009883421,0.00020531811,0.00018881542,0.00035343744,0.00005320475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035076766,0.000102595644,0.00016856138,0.000045495108,0.00033488002,0.00012819348,0.00019559251,0.000021390913,0.0006691922],"category_scores_gemma":[0.000018465917,0.000074654214,0.00018124108,0.00020312391,0.000030640822,0.000067207795,0.00005465712,0.00024488737,0.00000772772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011809207,0.0012833186,0.004177218,0.000012395496,0.0007750993,0.000006001822,0.00040212553,0.84686744,0.01123306,0.009478392,0.018928917,0.10671795],"study_design_scores_gemma":[0.0012176274,0.00007007688,0.0039509297,0.000049895934,0.00032800235,0.0001474991,0.00065927755,0.9514089,0.0061920243,0.017214058,0.018365072,0.0003966082],"about_ca_topic_score_codex":0.000012224685,"about_ca_topic_score_gemma":6.447234e-7,"teacher_disagreement_score":0.78628415,"about_ca_system_score_codex":0.000031526597,"about_ca_system_score_gemma":0.00009685852,"threshold_uncertainty_score":0.73271847},"labels":[],"label_agreement":null},{"id":"W3172233806","doi":"10.1137/20m1328762","title":"Impact of Varying Community Networks on Disease Invasion","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation; National Science Foundation","keywords":"Focus (optics); Path (computing); Mathematics; Applied mathematics; Star (game theory); Value (mathematics); Combinatorics; Computer science; Topology (electrical circuits); Statistical physics; Physics; Mathematical analysis; Statistics; Computer network","score_opus":0.02943290778303313,"score_gpt":0.3039876039996853,"score_spread":0.2745546962166521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172233806","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7549092,0.00004516862,0.20367996,0.000051679155,0.000055932793,0.00020953071,0.0000145036365,0.00005362752,0.04098041],"genre_scores_gemma":[0.9926286,0.000016993572,0.006987061,0.00004650414,0.0002206297,0.0000067513133,0.000026572725,0.000028669914,0.00003822827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882686,0.000094854084,0.00046246636,0.00010857295,0.00028352768,0.00022371276],"domain_scores_gemma":[0.9983548,0.00036197036,0.00042704935,0.0005605773,0.00010513048,0.00019048106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043238886,0.00019924331,0.0003950706,0.0000910804,0.0002659773,0.00007359061,0.00025902744,0.00003378673,0.00053501973],"category_scores_gemma":[0.000017428043,0.00015860735,0.000384607,0.00026965773,0.00003385595,0.00003852418,0.00011139782,0.0008118491,0.000012845443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061001116,0.01339675,0.008617143,0.00026701065,0.0023781487,0.0000742295,0.0019000712,0.24016476,0.007519897,0.63954574,0.013860107,0.071666144],"study_design_scores_gemma":[0.002452653,0.00068546017,0.008418067,0.0018145491,0.0007183619,0.0000261619,0.00103511,0.10231945,0.009052799,0.871957,0.0003724125,0.0011479846],"about_ca_topic_score_codex":0.000005026359,"about_ca_topic_score_gemma":5.144873e-7,"teacher_disagreement_score":0.2377194,"about_ca_system_score_codex":0.000069316775,"about_ca_system_score_gemma":0.00009764536,"threshold_uncertainty_score":0.64678204},"labels":[],"label_agreement":null},{"id":"W3179039111","doi":"10.1103/physrevresearch.4.013123","title":"Predicting the diversity of early epidemic spread on networks","year":2022,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; Canada First Research Excellence Fund; University of Vermont; National Science Foundation","keywords":"Randomness; Basic reproduction number; Probabilistic logic; Weighting; Computer science; Branching process; Epidemic model; Econometrics; Preparedness; Population; Statistical physics; Statistics; Mathematics; Artificial intelligence; Economics; Demography","score_opus":0.10382224423395851,"score_gpt":0.42204604537193985,"score_spread":0.3182238011379813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3179039111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96246094,0.0083459,0.0013903748,0.0016819664,0.000060737133,0.0016595745,0.00004269726,0.000077759345,0.024280077],"genre_scores_gemma":[0.9988797,0.00037532175,0.000013360085,0.00008739315,0.00034892373,0.00015319111,0.000012269288,0.000011241279,0.0001186579],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970989,0.0011752849,0.00022907826,0.00026229766,0.00087600015,0.00035841405],"domain_scores_gemma":[0.9977357,0.0013799042,0.0001221539,0.0005746391,0.00012318506,0.00006445851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002464963,0.00010372643,0.00035281674,0.000048513695,0.00086438976,0.000013603208,0.00083261897,0.0000068474646,0.0004419119],"category_scores_gemma":[0.000059264163,0.000073882606,0.0002987101,0.0009689839,0.00013818266,0.000041159168,0.0022245848,0.0010710428,0.000016960948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012773066,0.0015923582,0.41824266,0.00039377916,0.00055554364,0.000004958788,0.00089875783,0.0046854415,0.00025469981,0.23549159,0.08389086,0.2538616],"study_design_scores_gemma":[0.0012516443,0.0039827283,0.11050206,0.004995682,0.00105863,0.00000241524,0.0010113098,0.32757893,0.0010834276,0.41855836,0.12834257,0.0016322259],"about_ca_topic_score_codex":0.0010048717,"about_ca_topic_score_gemma":0.0000021888725,"teacher_disagreement_score":0.3228935,"about_ca_system_score_codex":0.000053707347,"about_ca_system_score_gemma":0.00003202219,"threshold_uncertainty_score":0.66482747},"labels":[],"label_agreement":null},{"id":"W3179274894","doi":"10.1002/qre.2944","title":"Monitoring dynamic networks: A simulation‐based strategy for comparing monitoring methods and a comparative study","year":2021,"lang":"en","type":"article","venue":"Quality and Reliability Engineering International","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; City University of Hong Kong; National Science Foundation","keywords":"Variety (cybernetics); Computer science; Context (archaeology); Dynamic network analysis; Data mining; Artificial intelligence; Computer network","score_opus":0.09820103649548916,"score_gpt":0.4492626000142635,"score_spread":0.3510615635187743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3179274894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47265643,0.00009119113,0.5267978,0.000027726908,0.00015533535,0.00016773764,0.000005930987,0.00005125689,0.00004658426],"genre_scores_gemma":[0.9400111,0.0000033194174,0.059594665,0.0000018145489,0.00024866167,0.000080046644,0.00002465632,0.00001016332,0.000025586469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873716,0.00014156578,0.0004242283,0.0003802345,0.00014692187,0.00016990793],"domain_scores_gemma":[0.99814564,0.0012503148,0.0000994185,0.00019821765,0.00023903779,0.000067358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078331155,0.00017451007,0.00034930385,0.00006476361,0.00012361036,0.00014230396,0.000105063635,0.00003731348,0.000013151759],"category_scores_gemma":[0.00007546522,0.00018723465,0.000092169204,0.00013765151,0.00002656786,0.00012656667,0.00009488108,0.00019224825,1.4599368e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017390483,0.00013928433,0.21258228,0.000022163136,0.0001342343,2.689381e-7,0.00019312536,0.78164506,0.00019998838,0.0009463712,6.1925147e-7,0.004119232],"study_design_scores_gemma":[0.00040904112,0.000027877953,0.14609055,0.000051180297,0.000040087194,1.6278888e-7,0.0006105451,0.85138637,0.00047744854,0.00066852017,0.00007784718,0.00016036254],"about_ca_topic_score_codex":0.000070175134,"about_ca_topic_score_gemma":0.0000031712054,"teacher_disagreement_score":0.46735466,"about_ca_system_score_codex":0.00006476551,"about_ca_system_score_gemma":0.000022345503,"threshold_uncertainty_score":0.7635208},"labels":[],"label_agreement":null},{"id":"W3181502090","doi":"10.1007/978-3-030-67044-3_11","title":"Analysis of Link Prediction Algorithms in Hashtag Graphs","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Brandon University","funders":"","keywords":"Computer science; PageRank; Categorization; Vertex (graph theory); Graph; Social media; Information retrieval; Link (geometry); Link analysis; Data mining; Theoretical computer science; Artificial intelligence; Algorithm; World Wide Web","score_opus":0.012803445880236554,"score_gpt":0.26025599608511246,"score_spread":0.24745255020487592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181502090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006283542,0.0039064307,0.9090377,0.00023914666,0.00043197328,0.0006860179,0.0002787137,0.00014072808,0.08465092],"genre_scores_gemma":[0.99151945,0.00020451237,0.0011754008,0.00007779929,0.0029172057,0.00004176232,0.0025617164,0.000086150016,0.0014160278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769646,0.000096674536,0.0008839958,0.0006153231,0.00032979145,0.00037773413],"domain_scores_gemma":[0.99858344,0.00029076636,0.000521693,0.0004066915,0.0001491647,0.000048235303],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028232345,0.00045802526,0.0014626064,0.0008596792,0.00009123071,0.00004128748,0.00028429565,0.00072226004,0.0010375067],"category_scores_gemma":[0.000008287034,0.0005120204,0.0010900125,0.0014058257,0.000137943,0.00004478675,0.00014228192,0.0013654596,7.498773e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045634,0.0001451318,0.091810614,0.000029254285,0.0063086017,0.00002379449,0.00072514074,0.27602175,0.000007029584,0.048705284,0.00065554236,0.57552224],"study_design_scores_gemma":[0.0009870784,0.000104412284,0.014002325,0.0007425246,0.007363065,5.309258e-7,0.000030494002,0.5628132,0.000045126053,0.3982645,0.013894396,0.0017523024],"about_ca_topic_score_codex":0.0003474787,"about_ca_topic_score_gemma":0.0014209646,"teacher_disagreement_score":0.9908911,"about_ca_system_score_codex":0.0001252524,"about_ca_system_score_gemma":0.000069096175,"threshold_uncertainty_score":0.99987566},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08536638279729919,"score_gpt":0.37846973025257286,"score_spread":0.29310334745527367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184867432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38084945,0.05690759,0.41562456,0.06468871,0.00042395215,0.003353398,0.000962301,0.0005915054,0.07659853],"genre_scores_gemma":[0.9839169,0.000070558046,0.015619375,0.000092018156,0.00005824099,0.00006126604,0.00012921602,0.0000057556977,0.000046699657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999412,0.0001252753,0.0001883144,0.00011041897,0.00007189142,0.00009212281],"domain_scores_gemma":[0.9979985,0.0007870447,0.00010423106,0.0008465967,0.00024177878,0.000021860345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022143772,0.00006588775,0.00014553679,0.000021601889,0.00040752214,0.00003650904,0.00044753912,0.000049825812,0.000034034336],"category_scores_gemma":[0.00006926477,0.000050328825,0.00010285936,0.00016650482,0.00016453686,0.000036345595,0.0003540364,0.00033733234,2.5448054e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034825352,0.00011644114,0.07442181,0.0000069361968,0.00020117602,8.0155e-8,0.00037608383,0.000009924161,0.0050897105,0.9066018,0.0041847797,0.00898778],"study_design_scores_gemma":[0.0012761216,0.00007509333,0.23604804,0.00022372566,0.0011243949,0.000013093964,0.009408814,0.037236936,0.0132397525,0.35056955,0.3501222,0.0006622698],"about_ca_topic_score_codex":0.00006356079,"about_ca_topic_score_gemma":0.00033096704,"teacher_disagreement_score":0.6030674,"about_ca_system_score_codex":0.000007245826,"about_ca_system_score_gemma":0.00002589199,"threshold_uncertainty_score":0.3134372},"labels":[],"label_agreement":null},{"id":"W3187432685","doi":"10.1109/iwcmc51323.2021.9498714","title":"DisNet: A General Framework for Dissolving Networks","year":2021,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Homogenization (climate); Node (physics); Distributed computing; Fragmentation (computing); A priori and a posteriori; Complex network; Engineering; Structural engineering; Operating system","score_opus":0.012675081482352248,"score_gpt":0.2958805998419279,"score_spread":0.28320551835957564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187432685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008404339,0.00013396538,0.9819471,0.00021980723,0.00008240668,0.00010925641,0.000005780815,0.00009509609,0.009002227],"genre_scores_gemma":[0.8257796,0.0000034948314,0.17052735,0.00014616424,0.0012448706,0.0000703575,0.00009573714,0.000019321782,0.0021130594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920726,0.000023212753,0.00017619209,0.0002487803,0.000070844355,0.00027371498],"domain_scores_gemma":[0.999352,0.00015094336,0.00005000006,0.00031095426,0.0000736596,0.00006245456],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007200742,0.00011857679,0.00019141924,0.000019353767,0.00012244777,0.000090883776,0.000119748096,0.00003697282,0.0017919191],"category_scores_gemma":[0.000007659122,0.00011072924,0.000230112,0.00020841809,0.00001597714,0.0000513553,0.00009130941,0.00011609636,0.0000046009995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004372935,0.0000698884,0.028672438,0.0000027349774,0.0001327115,0.0000010385965,0.000029048762,0.002704167,0.00008916436,0.9208855,0.012057941,0.035350963],"study_design_scores_gemma":[0.00023746,0.00002631605,0.0028506636,0.000047844303,0.000118985794,7.516685e-7,0.00013583784,0.43472865,0.0024647368,0.51564294,0.043289684,0.00045614308],"about_ca_topic_score_codex":0.00003796699,"about_ca_topic_score_gemma":0.000014995374,"teacher_disagreement_score":0.8173753,"about_ca_system_score_codex":0.000011822294,"about_ca_system_score_gemma":0.000020929489,"threshold_uncertainty_score":0.9991206},"labels":[],"label_agreement":null},{"id":"W3187489836","doi":"","title":"On compressing weighted time-evolving graphs","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Bounded function; Snapshot (computer storage); Algorithm; Lossy compression; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.010030744536284915,"score_gpt":0.2539365410155592,"score_spread":0.24390579647927427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187489836","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44638124,0.00007016354,0.035470653,0.00005159616,0.000062047286,0.000112707436,0.0000033792396,0.0003044201,0.5175438],"genre_scores_gemma":[0.993256,2.4724972e-7,0.0047308668,0.000053580527,0.00020172943,0.0000074476698,0.000028116636,0.000013632746,0.001708429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993394,0.00003561417,0.0001292725,0.000118480355,0.00011000201,0.00026723978],"domain_scores_gemma":[0.9995364,0.00007985273,0.000052063024,0.00022786054,0.00002621111,0.00007764342],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010171166,0.000112353475,0.00014451663,0.000076253535,0.00011585597,0.00004432036,0.000111598,0.000017127004,0.008484021],"category_scores_gemma":[9.694098e-7,0.00009406317,0.000110264904,0.00017162343,0.000020655387,0.00014425216,0.00005261388,0.00009568261,0.0003991603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072378825,0.00038518046,0.09877262,0.0000022914346,0.00018312951,2.838386e-7,0.00011390641,0.00001625824,0.006005924,0.73191285,0.13296308,0.02963722],"study_design_scores_gemma":[0.0019015028,0.00022954537,0.043754376,0.00036029582,0.00057948235,0.0000030249275,0.0003076769,0.16719854,0.13488601,0.5384373,0.1089983,0.0033439691],"about_ca_topic_score_codex":0.00004175977,"about_ca_topic_score_gemma":4.163406e-7,"teacher_disagreement_score":0.5468747,"about_ca_system_score_codex":0.000011085225,"about_ca_system_score_gemma":0.000004351907,"threshold_uncertainty_score":0.99242234},"labels":[],"label_agreement":null},{"id":"W3189263697","doi":"10.1007/s12652-021-03374-8","title":"Gravity algorithm for the community detection of large-scale network","year":2021,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computational intelligence; Scale (ratio); Algorithm; Artificial intelligence; Physics","score_opus":0.027507928532986017,"score_gpt":0.3034913464251229,"score_spread":0.2759834178921369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189263697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19680959,0.00040924727,0.8024992,0.000022262293,0.00013271323,0.00007448469,0.0000026271337,0.000006034879,0.0000438862],"genre_scores_gemma":[0.97492707,0.0000337063,0.024439154,0.000035757665,0.00053649035,0.0000012377137,0.000003104222,0.000007396438,0.000016097552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891394,0.00015737387,0.0005286398,0.00008289498,0.00014184792,0.00017529518],"domain_scores_gemma":[0.9981997,0.000536514,0.00055324676,0.00017990504,0.0004937101,0.000036899957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013115065,0.00009672493,0.00029688288,0.00004079743,0.00058914983,0.000059899754,0.00021369307,0.000022520897,0.000027472308],"category_scores_gemma":[0.000012963273,0.000074494594,0.00023911,0.0002027383,0.000054341835,0.00006041633,0.00014927462,0.00037027663,2.4363936e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035098124,0.00036571705,0.0034651156,0.000025343972,0.0004112205,0.0000014076196,0.002411692,0.0046301093,0.0019840589,0.0055143023,0.000245138,0.9809108],"study_design_scores_gemma":[0.0007705594,0.0006854551,0.005203985,0.00047428056,0.0006664271,0.00004298591,0.014257601,0.7152712,0.12928136,0.12623982,0.006702403,0.00040393954],"about_ca_topic_score_codex":0.000063394305,"about_ca_topic_score_gemma":0.000045004075,"teacher_disagreement_score":0.98050684,"about_ca_system_score_codex":0.000015873899,"about_ca_system_score_gemma":0.000026886184,"threshold_uncertainty_score":0.4531324},"labels":[],"label_agreement":null},{"id":"W3190449926","doi":"10.48550/arxiv.2108.00529","title":"BigGraphVis: Leveraging Streaming Algorithms and GPU Acceleration for Visualizing Big Graphs","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Visualization; Speedup; Graph drawing; Leverage (statistics); Computation; Graph Layout; Graphics processing unit; Streaming algorithm; Graph; CUDA; Theoretical computer science; Graphics; Power graph analysis; Software; Data visualization; Parallel computing; Algorithm; Data mining; Computer graphics (images); Artificial intelligence","score_opus":0.09481140810072615,"score_gpt":0.2347458032608984,"score_spread":0.13993439516017225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190449926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5498115,0.000104929735,0.44918826,0.000011828015,0.00011474336,0.0002631039,0.000023234114,0.00010479887,0.00037760235],"genre_scores_gemma":[0.99594223,0.000109282846,0.0030762067,0.000019799794,0.00027307612,0.000008065364,0.00036038095,0.000037968995,0.00017300868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982926,0.00009007385,0.0002524884,0.0009661197,0.00006778968,0.00033089038],"domain_scores_gemma":[0.9987975,0.00011595835,0.00028925776,0.0004889194,0.00020061413,0.00010777514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019530654,0.0003561572,0.0004546225,0.00038112685,0.00032317164,0.00028889012,0.0002992685,0.0001312847,0.000044958328],"category_scores_gemma":[0.0000049209134,0.00045112288,0.00039201602,0.0005092247,0.00006697034,0.00019139325,0.0006309124,0.000357055,7.7001135e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011954729,0.0007565783,0.23285015,0.0006309932,0.0045878626,0.00011679731,0.0023925386,0.09082594,0.0021468252,0.3641315,0.00081548997,0.30062574],"study_design_scores_gemma":[0.0011885152,0.0000706136,0.0040281364,0.0005874759,0.0011759327,0.000001485732,0.003183,0.8188004,0.002602687,0.16600253,0.00082505523,0.0015341935],"about_ca_topic_score_codex":0.00071199815,"about_ca_topic_score_gemma":0.000062091116,"teacher_disagreement_score":0.7279744,"about_ca_system_score_codex":0.00006600317,"about_ca_system_score_gemma":0.00008613899,"threshold_uncertainty_score":0.99979407},"labels":[],"label_agreement":null},{"id":"W3190849533","doi":"10.1007/s13042-021-01400-x","title":"Weakly-supervised learning for community detection based on graph convolution in attributed networks","year":2021,"lang":"en","type":"article","venue":"International Journal of Machine Learning and Cybernetics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Science Foundation of Zhejiang Province","keywords":"Computer science; Graph; Artificial intelligence; Feature learning; Semi-supervised learning; Community structure; Machine learning; Theoretical computer science; Data mining; Mathematics","score_opus":0.011789618233017243,"score_gpt":0.2739264792811901,"score_spread":0.2621368610481729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190849533","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5456611,0.00022815733,0.45321324,0.00029661087,0.0001604557,0.000060658193,0.000004396851,0.000020175421,0.0003552026],"genre_scores_gemma":[0.9981133,0.000056795132,0.0013444585,0.000053275395,0.00021969767,0.000004173319,0.00010474902,0.000014338434,0.000089243375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998709,0.00046926018,0.00037022834,0.000102756,0.00021742554,0.00013128895],"domain_scores_gemma":[0.99863535,0.0004905207,0.00030146813,0.00006701038,0.00045700165,0.000048662474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007256685,0.000117786854,0.00021745205,0.00018968685,0.00014197813,0.0000775515,0.00014335863,0.000047648842,0.0000615094],"category_scores_gemma":[0.00013185242,0.000119150944,0.00015172026,0.00016836292,0.000029275325,0.000054323285,0.000047562036,0.0010328223,4.240048e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026728216,0.00029979047,0.33433935,0.0000067283704,0.00021767561,0.00000895098,0.000151831,0.53916776,0.0015280521,0.0005722002,0.00005409501,0.12338631],"study_design_scores_gemma":[0.0014751311,0.0003069106,0.022763126,0.00013579648,0.000057514826,0.000010308194,0.00021682713,0.96717775,0.001210038,0.0019552608,0.004551591,0.00013976614],"about_ca_topic_score_codex":0.0001979036,"about_ca_topic_score_gemma":0.000094567775,"teacher_disagreement_score":0.45245215,"about_ca_system_score_codex":0.000052971383,"about_ca_system_score_gemma":0.000031274056,"threshold_uncertainty_score":0.48588344},"labels":[],"label_agreement":null},{"id":"W3191854875","doi":"10.32920/ryerson.14657001.v1","title":"Retweet Prediction Based on User Behavior","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Baseline (sea); Matrix decomposition; Regularization (linguistics); Focus (optics); Field (mathematics); Social network (sociolinguistics); Artificial intelligence; Machine learning; Factorization; Non-negative matrix factorization; User information; Information retrieval; Social media; World Wide Web; Information system; Mathematics","score_opus":0.018016111410142425,"score_gpt":0.27688073867342305,"score_spread":0.25886462726328063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191854875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35755932,0.00003104316,0.4784026,0.00031766415,0.0007491411,0.0012348081,0.00030498364,0.0009951068,0.16040531],"genre_scores_gemma":[0.98823065,0.0000012617489,0.006981356,0.00008488043,0.00065770507,0.0003433377,0.001998945,0.000033432854,0.0016684642],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986383,0.00007849494,0.00030032094,0.0005407801,0.00025661502,0.00018551413],"domain_scores_gemma":[0.99872756,0.000038003018,0.00013824391,0.0009205297,0.000109663626,0.000065975735],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012842397,0.00026025836,0.00033840333,0.00011238479,0.00006213855,0.0001544616,0.0002343933,0.00012854824,0.0066907047],"category_scores_gemma":[0.0000018880962,0.00025451666,0.000390639,0.00013014092,0.00001987397,0.000033962893,0.00031376668,0.0005536403,0.000017326402],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032074262,0.0018918676,0.8163499,0.000060364287,0.0005607931,0.000018385652,0.00008811217,0.02051162,0.0003529084,0.009303861,0.10280628,0.048023827],"study_design_scores_gemma":[0.001999542,0.0004590466,0.30874208,0.0017762634,0.0043862574,0.0000010892661,0.00046162622,0.5641391,0.030175349,0.0122253345,0.071423374,0.0042109187],"about_ca_topic_score_codex":0.00041498148,"about_ca_topic_score_gemma":0.000017249504,"teacher_disagreement_score":0.63067126,"about_ca_system_score_codex":0.00005725423,"about_ca_system_score_gemma":0.000099090794,"threshold_uncertainty_score":0.9999907},"labels":[],"label_agreement":null},{"id":"W3194415976","doi":"10.1007/s10878-021-00794-2","title":"A new metric to compare local community detection algorithms in social networks using geodesic distance","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Geodesic; Theory of computation; Metric (unit); Computer science; Algorithm; Equivalence of metrics; Metric space; Mathematics; Theoretical computer science; Discrete mathematics; Convex metric space; Geometry","score_opus":0.019148137395329702,"score_gpt":0.29009733340416777,"score_spread":0.27094919600883804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194415976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018287374,0.000074072144,0.9806068,0.000044006254,0.0007397557,0.00009273367,0.000001436498,0.000013622122,0.00014018948],"genre_scores_gemma":[0.95123994,0.0000038377043,0.047442082,0.000017246244,0.0012554899,0.0000016626781,0.000014350187,0.000017092958,0.0000082800725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839365,0.00042990397,0.0005928363,0.000108850094,0.00028193157,0.00019284392],"domain_scores_gemma":[0.99871725,0.000106104846,0.0004398697,0.00014082679,0.00048948283,0.00010645395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049591507,0.00014091156,0.0004163499,0.0002701962,0.00024130437,0.00010522361,0.00019174952,0.00004549168,0.00006694879],"category_scores_gemma":[0.000026610358,0.00015624655,0.00016348528,0.001917687,0.000018302948,0.00024253338,0.00007977619,0.0005289323,4.0613637e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007076124,0.000177231,0.002189534,0.0000029646276,0.00005778047,0.0000038380717,0.0001500423,0.97683513,0.00004373001,0.0017198108,0.00027105704,0.018478146],"study_design_scores_gemma":[0.0015292526,0.00009395283,0.0011787874,0.00007901877,0.00011900513,0.0000058544806,0.00036211964,0.9852598,0.0010585128,0.009772798,0.0003141396,0.00022679404],"about_ca_topic_score_codex":0.0004230092,"about_ca_topic_score_gemma":0.000031573145,"teacher_disagreement_score":0.9331647,"about_ca_system_score_codex":0.00031183116,"about_ca_system_score_gemma":0.00016385427,"threshold_uncertainty_score":0.6371549},"labels":[],"label_agreement":null},{"id":"W3196387978","doi":"","title":"Scalable Local Community Detection With Mapreduce for Large Networks","year":2017,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Scalability; Metric (unit); Big data; Graph; Data mining; Distributed computing; Theoretical computer science; Database; Engineering","score_opus":0.009370546340206974,"score_gpt":0.26112389337664715,"score_spread":0.2517533470364402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196387978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08672813,0.00012185888,0.9114538,0.00006562801,0.000058166508,0.00016155664,0.0000033794354,0.00003711049,0.0013703835],"genre_scores_gemma":[0.9979431,0.000036390175,0.00063564355,0.000012489729,0.00067062106,0.000032453372,0.000012480918,0.000030337449,0.00062649103],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977543,0.00011074714,0.00019870685,0.00014404122,0.0001301428,0.0016620639],"domain_scores_gemma":[0.99886954,0.000051724204,0.00032256823,0.0005392373,0.00014079521,0.000076164106],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016168864,0.00016905661,0.00023091161,0.000052181105,0.0026867227,0.00024684682,0.0005768821,0.000047625315,0.0000446418],"category_scores_gemma":[0.0000057885363,0.00014273127,0.00016854535,0.00006967487,0.00005642461,0.0002661053,0.00009266986,0.002091751,0.0000032571556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004942082,0.00060454744,0.03370694,0.000010781445,0.0015385037,0.0000010363975,0.00012011306,0.002607344,0.0003382108,0.29009837,0.00088802027,0.6695919],"study_design_scores_gemma":[0.0039718933,0.0021038512,0.0047395574,0.000113952105,0.0005616983,0.00010765575,0.0036234222,0.10504052,0.0036991523,0.8646184,0.010486109,0.0009337915],"about_ca_topic_score_codex":0.0006561061,"about_ca_topic_score_gemma":0.0042329207,"teacher_disagreement_score":0.91121495,"about_ca_system_score_codex":0.00029256407,"about_ca_system_score_gemma":0.000337746,"threshold_uncertainty_score":0.9986116},"labels":[],"label_agreement":null},{"id":"W3196729251","doi":"10.5121/csit.2022.120913","title":"Data Visualization of Graph-Based Threat Detection System","year":2022,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Visualization; Graph; Network security; Node (physics); Graph drawing; Data visualization; Data mining; Overlay; Computer security; Computer network; Theoretical computer science","score_opus":0.02730215620793985,"score_gpt":0.29164517029506964,"score_spread":0.2643430140871298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196729251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027486509,0.000013144214,0.9668722,0.00000884856,0.000038284354,0.00013010432,0.000069022644,0.0001312371,0.0052506584],"genre_scores_gemma":[0.9986477,1.1047558e-7,0.000717909,0.000006686548,0.000043138753,0.000030259223,0.0004940996,0.00000801362,0.0000521091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993886,0.00007102143,0.0001655724,0.00015902046,0.00014755299,0.00006823572],"domain_scores_gemma":[0.99935895,0.000021724047,0.000103492144,0.00046966493,0.000032027696,0.000014130805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018479809,0.00005568613,0.00010820175,0.00009222234,0.000120473574,0.000009592486,0.00023159858,0.0000061557303,0.00065052113],"category_scores_gemma":[6.3377445e-7,0.000055276287,0.00005037558,0.0003995315,0.000010419742,0.000053424716,0.00017074714,0.000039247425,0.0000013254593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013662931,0.0011353575,0.2402496,0.00017339565,0.00073165057,0.0000019060708,0.00014904157,0.033841416,0.040006753,0.5776161,0.014839082,0.09111908],"study_design_scores_gemma":[0.00044246874,0.00014266171,0.0012703394,0.000018159873,0.00019134078,6.3320493e-7,0.0008792301,0.92307323,0.06277435,0.0033084746,0.0076314593,0.0002676538],"about_ca_topic_score_codex":0.000521717,"about_ca_topic_score_gemma":0.000028060682,"teacher_disagreement_score":0.9711612,"about_ca_system_score_codex":0.000022763445,"about_ca_system_score_gemma":0.000015044258,"threshold_uncertainty_score":0.712275},"labels":[],"label_agreement":null},{"id":"W3196754906","doi":"10.1109/tnnls.2021.3106156","title":"Full-Scale Information Diffusion Prediction With Reinforced Recurrent Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute; Canadian Institute for Advanced Research","funders":"Fundamental Research Funds for the Central Universities; National Research Foundation Singapore; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Computer science; Diffusion; Diffusion process; Context (archaeology); Recurrent neural network; Artificial intelligence; Process (computing); Machine learning; Task (project management); Scale (ratio); Reinforcement learning; Artificial neural network; Data mining; Innovation diffusion; Physics","score_opus":0.0057956832635849284,"score_gpt":0.20438947687987374,"score_spread":0.19859379361628882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196754906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106019944,0.00014263987,0.8923796,0.000044022272,0.00050963036,0.00026608707,0.0000065976337,0.00020890564,0.00042258756],"genre_scores_gemma":[0.99848527,0.00007852931,0.00010807532,0.00003041639,0.00039332997,0.000090978196,0.00012161816,0.00002303742,0.00066876237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848956,0.00023516719,0.0004380757,0.00028651953,0.00023439001,0.00031630538],"domain_scores_gemma":[0.9991551,0.00011077297,0.00021972977,0.00024139952,0.0001475584,0.00012543601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001954065,0.00025232247,0.00032253104,0.00010322055,0.0006362441,0.00030140896,0.000077714656,0.00009542503,0.000074135634],"category_scores_gemma":[9.724179e-7,0.00021712965,0.0001227474,0.0004496855,0.00004250518,0.00042167428,0.000004135153,0.0008473403,0.0000032358175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115413546,0.000027529277,0.0007602958,0.000013269386,0.00006945719,0.0000012753412,0.00010904349,0.95356786,0.000040277137,0.00008356139,0.00019622961,0.04501577],"study_design_scores_gemma":[0.00045537966,0.00036195244,0.00035378075,0.00017395009,0.000100290614,0.000021731359,0.00041741616,0.99533635,0.000034569115,0.0000028253066,0.0025205081,0.00022124728],"about_ca_topic_score_codex":0.00014193666,"about_ca_topic_score_gemma":0.000026162888,"teacher_disagreement_score":0.8924653,"about_ca_system_score_codex":0.0000354647,"about_ca_system_score_gemma":0.000016799839,"threshold_uncertainty_score":0.885429},"labels":[],"label_agreement":null},{"id":"W3196779261","doi":"","title":"Hierarchical clustering for the identification of communities in networks","year":2011,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Identification (biology); Cluster analysis; Computer science; Hierarchical clustering; Data mining; Artificial intelligence","score_opus":0.024388250351414363,"score_gpt":0.25108879155997904,"score_spread":0.22670054120856467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196779261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021873325,0.00190889,0.96541697,0.0037523473,0.00022015594,0.0011572053,0.000089705594,0.00007110839,0.0055103116],"genre_scores_gemma":[0.96722126,0.0010051385,0.026625006,0.000027234022,0.00008409376,0.0004979113,0.00087799085,0.000061895356,0.0035994586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9910735,0.006069201,0.0015414717,0.0005426652,0.00027883286,0.0004943386],"domain_scores_gemma":[0.9883466,0.005736778,0.0013127932,0.0029208802,0.0015834706,0.00009950495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.010332946,0.00041656257,0.0006690087,0.00021878144,0.00050329085,0.0002689893,0.0022608496,0.00025998472,0.00017997768],"category_scores_gemma":[0.000231168,0.00040932928,0.00053571374,0.00051062263,0.000747599,0.00013287435,0.0018162403,0.0010625484,0.000007548747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005430395,0.0010307446,0.010698222,0.00021419804,0.00039067012,3.7984367e-7,0.019288244,0.015746562,0.00061752286,0.7762047,0.0005084625,0.17524597],"study_design_scores_gemma":[0.0005257811,9.216359e-7,0.010059044,0.0023221013,0.00024124152,0.0000014308354,0.0009233502,0.921279,0.0070283087,0.042443465,0.014684404,0.00049092056],"about_ca_topic_score_codex":0.011108089,"about_ca_topic_score_gemma":0.012803416,"teacher_disagreement_score":0.94534796,"about_ca_system_score_codex":0.00012897789,"about_ca_system_score_gemma":0.00018326698,"threshold_uncertainty_score":0.99983585},"labels":[],"label_agreement":null},{"id":"W3197475923","doi":"10.3934/mbe.2021365","title":"The role of proactive behavior on COVID-19 infordemic in the Chinese Sina-Microblog: a modeling study","year":2021,"lang":"en","type":"article","venue":"Mathematical Biosciences & Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Microblogging; Parameterized complexity; Social media; Computer science; Coronavirus disease 2019 (COVID-19); Sensitivity (control systems); World Wide Web; Algorithm; Engineering; Medicine","score_opus":0.013133660336190449,"score_gpt":0.293606688041515,"score_spread":0.28047302770532456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197475923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9650076,0.000042942025,0.03365658,0.000098426084,0.000014883264,0.0003775671,0.0000025789586,0.000027724782,0.0007717134],"genre_scores_gemma":[0.9986594,0.0000012398881,0.0011465746,0.000016648488,0.000025409643,0.0001360493,0.000001355632,0.0000059208996,0.0000074503414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900717,0.00004794692,0.0002974805,0.00018128764,0.00025388904,0.00021222646],"domain_scores_gemma":[0.9991629,0.00040687027,0.000055260363,0.0003006132,0.000031378568,0.00004295275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006410792,0.00012601836,0.0001891578,0.00006166637,0.00012638167,0.000079167105,0.00041443753,0.00001722564,0.00001999376],"category_scores_gemma":[0.000119069446,0.000068313544,0.00008086681,0.00073218206,0.000053917287,0.00006199931,0.000106345506,0.00017607174,0.0000018379767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038074035,0.0056339223,0.10085907,0.000082515624,0.00029049703,0.000025873866,0.035777844,0.23953086,0.048096932,0.5492695,0.000028915012,0.020366017],"study_design_scores_gemma":[0.00020374544,0.000104328035,0.0015431445,0.00003803963,0.00006331604,0.0000038114163,0.013500869,0.9480678,0.0020866904,0.034056738,0.000111485555,0.00022004393],"about_ca_topic_score_codex":0.000045590765,"about_ca_topic_score_gemma":0.0000131783145,"teacher_disagreement_score":0.7085369,"about_ca_system_score_codex":0.000028679053,"about_ca_system_score_gemma":0.00005327701,"threshold_uncertainty_score":0.27857456},"labels":[],"label_agreement":null},{"id":"W3197751840","doi":"10.1109/access.2021.3131987","title":"Identifying Influential Nodes in Two-Mode Data Networks Using Formal Concept Analysis","year":2021,"lang":"en","type":"preprint","venue":"IEEE Access","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Betweenness centrality; Centrality; Computer science; Network science; Bipartite graph; Network theory; Closeness; Theoretical computer science; Key (lock); Network analysis; Node (physics); Data mining; Exploit; Formal concept analysis; Formalism (music); Complex network; Topology (electrical circuits); Mathematics; Computer security; Algorithm; Combinatorics; Graph","score_opus":0.1045938054224565,"score_gpt":0.44562220307268197,"score_spread":0.34102839765022547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197751840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43145022,0.00025992445,0.5673811,0.000005584455,0.00032405378,0.00019128616,0.00011449046,0.000058510876,0.00021484234],"genre_scores_gemma":[0.9887468,0.000020456644,0.005141289,0.000044009117,0.0015300951,0.000045046945,0.004406077,0.000052054053,0.000014123473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633586,0.0002460927,0.0010198611,0.0012826935,0.00041847443,0.00069700624],"domain_scores_gemma":[0.9963514,0.00009701744,0.00071967323,0.0025401118,0.00018366279,0.00010809674],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00050810445,0.00051247416,0.0012148599,0.0006399291,0.00019288065,0.0018330412,0.003207097,0.00015697353,0.00055453787],"category_scores_gemma":[0.000006199986,0.0005883367,0.0005852835,0.0016970141,0.000088695815,0.0016186042,0.007330939,0.001140581,0.000001333655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008995546,0.000082618,0.18662383,0.000022307144,0.0020210347,0.000013847726,0.00015277664,0.80441535,0.000059351318,0.00009873179,0.0001342267,0.0063669295],"study_design_scores_gemma":[0.0003205678,0.0000016338253,0.006450392,0.00021826725,0.0024731667,4.6396175e-7,0.00011492966,0.98778194,0.0006409085,0.0013396036,0.00003254914,0.00062556966],"about_ca_topic_score_codex":0.030499168,"about_ca_topic_score_gemma":0.0045484533,"teacher_disagreement_score":0.5622398,"about_ca_system_score_codex":0.00012075948,"about_ca_system_score_gemma":0.00019695896,"threshold_uncertainty_score":0.9996568},"labels":[],"label_agreement":null},{"id":"W3197871027","doi":"10.1109/isit45174.2021.9518134","title":"When to Use Graph Side Information in Matrix Completion","year":2021,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Cluster analysis; Computer science; Graph; Matrix completion; Algorithm; Theoretical computer science; Data mining; Artificial intelligence","score_opus":0.014727153880958927,"score_gpt":0.2669050498345081,"score_spread":0.25217789595354917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197871027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44796193,0.000005324031,0.5322429,0.0007873758,0.00003142257,0.00018766346,0.000011448114,0.000103197286,0.018668735],"genre_scores_gemma":[0.97575796,8.139545e-7,0.023358412,0.0002304976,0.000033425265,0.000018088931,0.00017427294,0.000003795095,0.00042272042],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945396,0.000029298393,0.00021358556,0.00008876263,0.00009537532,0.00011899168],"domain_scores_gemma":[0.9996327,0.000032604137,0.00003602248,0.00018047106,0.00008038752,0.00003777944],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000073589,0.000067108034,0.00011662325,0.00012780908,0.000028556127,0.000105415194,0.0000625661,0.000013573894,0.0009192194],"category_scores_gemma":[0.000005103204,0.00006846279,0.00006053918,0.00032806952,0.0000051427355,0.0003876313,0.00006650464,0.000058006062,0.00009386622],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002276877,0.0001930463,0.45363614,0.000012924666,0.000092475806,0.0000033991987,0.0010683005,0.0046064616,0.0022918377,0.4009151,0.07594138,0.061216187],"study_design_scores_gemma":[0.0010668144,0.00006768529,0.31446153,0.00010553587,0.00006987107,0.0000024054182,0.0013305236,0.030178597,0.0149666825,0.17668127,0.46011317,0.00095593004],"about_ca_topic_score_codex":0.0014209594,"about_ca_topic_score_gemma":0.00030540721,"teacher_disagreement_score":0.52779603,"about_ca_system_score_codex":0.000019961735,"about_ca_system_score_gemma":0.00001612657,"threshold_uncertainty_score":0.9999941},"labels":[],"label_agreement":null},{"id":"W3203172674","doi":"","title":"Universal nonlinear infection kernel from heterogeneous exposure on higher-order networks","year":2021,"lang":"en","type":"article","venue":"Queen Mary Research Online (Queen Mary University of London)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; Canada First Research Excellence Fund; China Scholarship Council; Royal Society","keywords":"Nonlinear system; Leverage (statistics); Statistical physics; Computer science; Corollary; Kernel (algebra); Econometrics; Biological system; Biology; Theoretical computer science; Mathematics; Physics; Artificial intelligence; Pure mathematics; Quantum mechanics","score_opus":0.022562339298515706,"score_gpt":0.2804749195543008,"score_spread":0.2579125802557851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203172674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97061086,0.0002358302,0.01240774,0.002652336,0.00020229931,0.0005830019,0.00072708674,0.0002640679,0.012316757],"genre_scores_gemma":[0.9669531,0.0007429376,0.0097275395,0.00010675649,0.0011865911,0.0000018113001,0.004586613,0.000073504125,0.016621128],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99640876,0.0009760124,0.0003516241,0.0008140285,0.00077546143,0.00067413645],"domain_scores_gemma":[0.9971589,0.0005371178,0.00019758641,0.0009331279,0.00088878855,0.00028446902],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038722376,0.00035046882,0.0006028123,0.00037719143,0.00041574068,0.00006112159,0.00063306704,0.00021005335,0.004713793],"category_scores_gemma":[0.00001667642,0.00042335803,0.00040001134,0.001271917,0.0003207763,0.00032257676,0.00086793536,0.001206518,0.000055042558],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030320806,0.006553266,0.738833,0.00013207195,0.0040515354,0.0027924175,0.0003627238,0.04328223,0.0011762928,0.0067899073,0.07935328,0.113641195],"study_design_scores_gemma":[0.0075715547,0.0024341976,0.31865376,0.0007794959,0.00077760423,0.000009192089,0.0014123948,0.05956216,0.0024914828,0.009630449,0.5941209,0.0025567831],"about_ca_topic_score_codex":0.020737605,"about_ca_topic_score_gemma":0.00084009516,"teacher_disagreement_score":0.51476765,"about_ca_system_score_codex":0.00025924746,"about_ca_system_score_gemma":0.00039392593,"threshold_uncertainty_score":0.99982184},"labels":[],"label_agreement":null},{"id":"W3205262389","doi":"10.1109/bigdataservice52369.2021.00012","title":"Incremental Community Detection in Distributed Dynamic Graph","year":2021,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Cluster analysis; Graph; Data stream mining; Analytics; Data mining; Dynamic data; Streaming data; Algorithm; Theoretical computer science; Machine learning; Database","score_opus":0.00997805292370231,"score_gpt":0.2621508305970996,"score_spread":0.2521727776733973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205262389","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8534083,0.0000110308665,0.14236869,0.00003139587,0.000015147646,0.00004701701,0.000013933789,0.00005732729,0.004047189],"genre_scores_gemma":[0.99918014,0.0000011279423,0.00044236044,0.000016898304,0.0000138143605,0.000012700676,0.00027823084,0.000004907393,0.00004982425],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99944633,0.00015195728,0.00013929313,0.000088325294,0.000060011833,0.000114092385],"domain_scores_gemma":[0.9996607,0.000033815173,0.000029221612,0.0002227209,0.000030917843,0.00002264773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010840961,0.00006817247,0.000107078704,0.000047494337,0.000099026176,0.000025188483,0.000082784696,0.000015393185,0.0006173388],"category_scores_gemma":[0.0000021944636,0.000071622264,0.00007100335,0.00043242925,0.000016932358,0.00005288457,0.00010173708,0.00021504324,0.0000062177305],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040289535,0.0024912797,0.5800396,0.000022582048,0.00045072712,0.000014429396,0.00047344732,0.00071109796,0.11716582,0.017336775,0.0014672197,0.2797867],"study_design_scores_gemma":[0.001503764,0.00009636569,0.49703345,0.00006008051,0.00010570445,0.0000043601285,0.006708267,0.054253835,0.28963628,0.14764972,0.002122175,0.0008259861],"about_ca_topic_score_codex":0.002731194,"about_ca_topic_score_gemma":0.0057610627,"teacher_disagreement_score":0.2789607,"about_ca_system_score_codex":0.00004535719,"about_ca_system_score_gemma":0.000011084549,"threshold_uncertainty_score":0.6759427},"labels":[],"label_agreement":null},{"id":"W3205378782","doi":"10.1080/08982112.2021.1974034","title":"The interdisciplinary nature of network monitoring: Advantages and disadvantages","year":2021,"lang":"en","type":"article","venue":"Quality Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Management science; Data science; Engineering; Computer science","score_opus":0.007941840872076568,"score_gpt":0.3265496635091291,"score_spread":0.31860782263705256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205378782","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94819236,0.0061655054,0.04335478,0.00036858628,0.00037935513,0.000101441176,0.000013165124,0.0001159888,0.0013088055],"genre_scores_gemma":[0.996276,0.000059108672,0.003095162,0.0000025009765,0.0004359317,0.000008915006,0.000008880785,0.0000122801375,0.00010120991],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993029,0.000039349223,0.00023244333,0.00015020171,0.00010103364,0.0001740661],"domain_scores_gemma":[0.99926025,0.00032192626,0.00006758987,0.00027068486,0.000043091793,0.000036436457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023721428,0.00010765683,0.00018993374,0.000014927548,0.000112129725,0.000037394966,0.000114689894,0.000031861524,0.000011627765],"category_scores_gemma":[0.000013331386,0.000086718035,0.000086382075,0.0001578756,0.000029730056,0.000060825114,0.00032125975,0.00024037586,3.4543461e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028138995,0.00010967154,0.63763666,0.00017916922,0.00071522995,0.000009347462,0.00090814795,0.019309334,0.015793523,0.24640574,0.0010736795,0.07783136],"study_design_scores_gemma":[0.00097004074,0.00012265297,0.6984967,0.0011584978,0.0003601715,0.000013308559,0.011032539,0.025375538,0.13363065,0.08227594,0.044667266,0.0018967274],"about_ca_topic_score_codex":0.000005980841,"about_ca_topic_score_gemma":0.0000020802838,"teacher_disagreement_score":0.1641298,"about_ca_system_score_codex":0.000009459901,"about_ca_system_score_gemma":0.000008498019,"threshold_uncertainty_score":0.3536259},"labels":[],"label_agreement":null},{"id":"W3205605696","doi":"10.1080/23789689.2021.1974675","title":"Mixed strategy for power grid resilience enhancement under cyberattack","year":2021,"lang":"en","type":"article","venue":"Sustainable and Resilient Infrastructure","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Robustness (evolution); Computer science; Centrality; Grid; Network topology; Distributed computing; Vulnerability (computing); Resilience (materials science); Computer network; Computer security; Mathematics","score_opus":0.008964121943325038,"score_gpt":0.2655688899466811,"score_spread":0.2566047680033561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205605696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8420396,0.001455826,0.13113618,0.0007582203,0.0004050139,0.0011068555,0.00007185557,0.00011272192,0.022913754],"genre_scores_gemma":[0.9839925,0.000028007922,0.0027190472,0.00014961591,0.00033074582,0.00007929986,0.00015726816,0.000023093156,0.0125204185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982731,0.000062057574,0.0003131618,0.0005343264,0.00020496674,0.0006124189],"domain_scores_gemma":[0.9988395,0.00006939755,0.00011676962,0.00041656586,0.00042562163,0.00013212902],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001443918,0.00026188715,0.00030765845,0.00008170754,0.00039144556,0.00018991443,0.00017163744,0.000079702666,0.0011315296],"category_scores_gemma":[0.000012186884,0.00022963813,0.00013732535,0.00036343513,0.00009863171,0.00016739812,0.0001958529,0.0001955253,0.0000025411368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013641037,0.00024778498,0.011217892,0.00021236342,0.00040326428,0.00004562902,0.00041465386,0.017649405,0.005146651,0.73176754,0.21643458,0.016323801],"study_design_scores_gemma":[0.0018056806,0.00044802038,0.021517696,0.000092591275,0.00023169104,0.000011346667,0.0320774,0.0018713127,0.06549954,0.5019461,0.373274,0.0012246264],"about_ca_topic_score_codex":0.000048313676,"about_ca_topic_score_gemma":0.000009684005,"teacher_disagreement_score":0.22982144,"about_ca_system_score_codex":0.00007296544,"about_ca_system_score_gemma":0.0002451411,"threshold_uncertainty_score":0.99978155},"labels":[],"label_agreement":null},{"id":"W3205640022","doi":"10.1080/08982112.2021.1974033","title":"Foundations of network monitoring: Definitions and applications","year":2021,"lang":"en","type":"article","venue":"Quality Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ambiguity; CLARITY; Field (mathematics); Data science; Computer science; Network monitoring; Point (geometry); Management science; Risk analysis (engineering); Engineering; Business; Mathematics","score_opus":0.048600685322355654,"score_gpt":0.31331340448779155,"score_spread":0.2647127191654359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205640022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044102795,0.00023188697,0.95132715,0.000050519557,0.00003412931,0.00007710431,0.0000163526,0.00008190916,0.004078166],"genre_scores_gemma":[0.9712428,0.000013142155,0.028275307,0.0000024665949,0.00031837265,0.00006434044,0.00004411773,0.000007446125,0.000032018645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995304,0.00001637906,0.00019368748,0.00010524936,0.00005710733,0.00009722449],"domain_scores_gemma":[0.9995386,0.00012661678,0.000045268902,0.00019045355,0.00006564409,0.000033397253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000980938,0.000058767826,0.0001231516,0.000023656417,0.00006260159,0.000020146954,0.000043647633,0.000013514669,0.000059221606],"category_scores_gemma":[0.0000066538737,0.00007224053,0.000053193624,0.00026297366,0.000013535137,0.000040408384,0.000042480347,0.00006448623,0.0000017570352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.5304765e-7,0.00004271603,0.048284244,0.000022828106,0.00008587033,1.2057819e-7,0.000052366802,0.0116101,0.00181185,0.9321905,0.000066861336,0.005832195],"study_design_scores_gemma":[0.0010375071,0.000048950027,0.34141153,0.00044411924,0.00065637386,0.000006826303,0.0016849873,0.034966018,0.044699218,0.4412993,0.13184084,0.0019043532],"about_ca_topic_score_codex":0.000033062675,"about_ca_topic_score_gemma":0.000001989869,"teacher_disagreement_score":0.92714,"about_ca_system_score_codex":0.000007808424,"about_ca_system_score_gemma":0.000016306103,"threshold_uncertainty_score":0.29458833},"labels":[],"label_agreement":null},{"id":"W3205806023","doi":"10.1109/cibcb49929.2021.9562847","title":"A Comparison of Novel Representations for Evolving Epidemic Networks","year":2021,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Adjacency matrix; Aperiodic graph; Representation (politics); Computer science; String (physics); Theoretical computer science; Adjacency list; Generator (circuit theory); Algorithm; Mathematics; Graph; Combinatorics","score_opus":0.06447377350428957,"score_gpt":0.40125251224480096,"score_spread":0.3367787387405114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205806023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007000277,0.0001259415,0.97998714,0.000110061694,0.00002969773,0.000120215205,0.0000074805484,0.000035390567,0.012583769],"genre_scores_gemma":[0.91202235,9.0608813e-7,0.08707158,0.000020412408,0.00015240013,0.00003970772,0.00009214176,0.000008234329,0.0005922526],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929523,0.000019878247,0.0003223095,0.00016756609,0.00006128431,0.00013373312],"domain_scores_gemma":[0.999059,0.00032919945,0.00012703799,0.00026164763,0.00019371095,0.000029409197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011199716,0.00006822999,0.00024987033,0.000030202418,0.00006244678,0.000017592942,0.0000887352,0.000018484838,0.0005644613],"category_scores_gemma":[0.000019601423,0.0000692908,0.00017988807,0.00023134614,0.000018719424,0.000049890004,0.000060581442,0.00006355311,6.932198e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067711417,0.0005560944,0.6501045,0.000011925314,0.00030105663,1.13887054e-7,0.00014821455,0.070773676,0.0045697596,0.19067548,0.069210514,0.013641857],"study_design_scores_gemma":[0.00023026715,0.000010865038,0.0035765127,0.000018567047,0.00007141981,1.4255953e-7,0.00038403226,0.9828502,0.0067271953,0.0045053377,0.0015327447,0.00009270734],"about_ca_topic_score_codex":0.00013808614,"about_ca_topic_score_gemma":0.000036420464,"teacher_disagreement_score":0.91207653,"about_ca_system_score_codex":0.00000836791,"about_ca_system_score_gemma":0.000026559375,"threshold_uncertainty_score":0.6180455},"labels":[],"label_agreement":null},{"id":"W3206556971","doi":"10.1080/08982112.2021.1974036","title":"Broader impacts of network monitoring: Its role in government, industry, technology, and beyond","year":2021,"lang":"en","type":"article","venue":"Quality Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Government (linguistics); Business; Engineering; Risk analysis (engineering); Computer security; Engineering management; Computer science","score_opus":0.01294060369167549,"score_gpt":0.2792957351660798,"score_spread":0.2663551314744043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206556971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954434,0.00087586266,0.0023414283,0.00009695714,0.00003953876,0.000060129612,0.000008300977,0.000052186337,0.0010822149],"genre_scores_gemma":[0.9974348,0.000009874559,0.0023102749,0.000004043473,0.00016592977,0.000011295837,0.0000036417937,0.000012899417,0.00004722678],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991596,0.000023356752,0.00027808826,0.00017463815,0.00013413453,0.00023020909],"domain_scores_gemma":[0.99957937,0.00005449028,0.0000762697,0.000211217,0.00003013364,0.00004853037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002062749,0.000117087926,0.0002522336,0.000056888653,0.000019986262,0.000018229952,0.00008864436,0.0000988786,0.00003739358],"category_scores_gemma":[0.000022812885,0.00013626403,0.00004462824,0.00060754525,0.000014735575,0.00006678703,0.00013967756,0.00033342023,5.480588e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030092433,0.000062850566,0.9313218,0.000034557648,0.00009963416,0.0000024128422,0.000144623,0.0073629133,0.02418197,0.029713267,0.000051265157,0.0070217275],"study_design_scores_gemma":[0.0011183548,0.00006638902,0.5034886,0.0005899741,0.00010451651,0.000004559464,0.003033371,0.021575335,0.45079082,0.012142454,0.0060309954,0.001054618],"about_ca_topic_score_codex":0.000052344447,"about_ca_topic_score_gemma":0.0000056851673,"teacher_disagreement_score":0.42783317,"about_ca_system_score_codex":0.000038447324,"about_ca_system_score_gemma":0.000017210317,"threshold_uncertainty_score":0.5556686},"labels":[],"label_agreement":null},{"id":"W3206575254","doi":"10.1080/08982112.2021.1974032","title":"The past, present, and future of network monitoring: A panel discussion","year":2021,"lang":"en","type":"article","venue":"Quality Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Data science; Complex network; Computer science; Network science; Management science; Operations research; Engineering; World Wide Web","score_opus":0.022551228069627168,"score_gpt":0.2852210527427808,"score_spread":0.26266982467315364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206575254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7582251,0.00917438,0.21842572,0.008578606,0.0013858797,0.0004984729,0.00002771696,0.00041301493,0.0032711439],"genre_scores_gemma":[0.9929266,0.00004227248,0.0021320852,0.0000016101428,0.00468739,0.000012614905,0.0000072362986,0.000010955979,0.0001792305],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935305,0.0000468761,0.00020456278,0.00012515062,0.00010846013,0.00016188153],"domain_scores_gemma":[0.9994914,0.00011122298,0.000060457754,0.000257638,0.000039176888,0.00004010131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002109052,0.000088561945,0.00015411346,0.000010441842,0.00008350219,0.000036980207,0.00008580936,0.000019966894,0.000013125984],"category_scores_gemma":[0.0000021737417,0.000055395776,0.000075680604,0.0001700746,0.000014279446,0.0000376426,0.00010702025,0.0001115805,3.1122184e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022887203,0.00013166672,0.40695763,0.00016846044,0.0006250622,0.0000038705775,0.0010919234,0.02317698,0.006915695,0.134353,0.0057923454,0.42076048],"study_design_scores_gemma":[0.0005540671,0.000039986073,0.29079613,0.00025911533,0.00016973804,0.0000025484433,0.002935907,0.032414135,0.01186688,0.014146427,0.64602435,0.00079070835],"about_ca_topic_score_codex":0.000024817271,"about_ca_topic_score_gemma":6.5960717e-7,"teacher_disagreement_score":0.640232,"about_ca_system_score_codex":0.0000066927514,"about_ca_system_score_gemma":0.000008335359,"threshold_uncertainty_score":0.22589742},"labels":[],"label_agreement":null},{"id":"W3206808214","doi":"10.48550/arxiv.2110.08385","title":"Robust Correlation Clustering with Asymmetric Noise","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Correlation clustering; Mathematics; Clustering coefficient; Graph; Computer science; Graph partition; Theoretical computer science; Combinatorics; Algorithm; Artificial intelligence","score_opus":0.05486950618209576,"score_gpt":0.17911875692620677,"score_spread":0.124249250744111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206808214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24931793,0.000028495791,0.7369963,0.000009333436,0.00008750741,0.00017554035,0.000008664449,0.00012184689,0.013254366],"genre_scores_gemma":[0.99561346,0.000017612634,0.002487655,0.000011752046,0.00017958308,0.0000018789727,0.00024422136,0.000033155193,0.0014106832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986089,0.00009047527,0.00018142811,0.0007740028,0.000082546954,0.00026264825],"domain_scores_gemma":[0.9986141,0.000064505184,0.0002881782,0.00074105914,0.00018854204,0.00010364451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000109302804,0.00030500698,0.00038631304,0.00033238082,0.00013615718,0.0001226196,0.00039376822,0.0001227377,0.00033540282],"category_scores_gemma":[0.0000032924931,0.00034465373,0.00025106024,0.0010753698,0.00005294916,0.00016445847,0.0008111319,0.00058272504,0.000018898436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022063898,0.000080679994,0.08351632,0.000021540272,0.0002689469,0.00004613989,0.000046687375,0.90790313,0.0000045557,0.006424145,0.00015243259,0.0015133723],"study_design_scores_gemma":[0.0003811318,0.00003180536,0.0062231855,0.0001889179,0.00049960637,0.0000011564895,0.00030351506,0.9886574,0.00006251684,0.002873683,0.00021471498,0.00056235463],"about_ca_topic_score_codex":0.00074400025,"about_ca_topic_score_gemma":0.00014717036,"teacher_disagreement_score":0.7462955,"about_ca_system_score_codex":0.00014752152,"about_ca_system_score_gemma":0.000115361836,"threshold_uncertainty_score":0.9999005},"labels":[],"label_agreement":null},{"id":"W3207951730","doi":"10.1080/08982112.2021.1974035","title":"Research in network monitoring: Connections with SPM and new directions","year":2021,"lang":"en","type":"article","venue":"Quality Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Framing (construction); Data science; Dissemination; Computer science; Management science; Process (computing); Operations research; Engineering; Telecommunications","score_opus":0.08839421435576572,"score_gpt":0.37634759608405555,"score_spread":0.2879533817282898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207951730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7949918,0.0010870531,0.19651507,0.00085069175,0.00021234406,0.00019178282,0.0000040443033,0.00027684946,0.005870364],"genre_scores_gemma":[0.9906594,0.000012930032,0.008357514,0.0000018714874,0.0006427913,0.000023362798,0.0000054014504,0.000012745455,0.00028394963],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999224,0.00006990185,0.00015300144,0.00019204209,0.000118947835,0.00024210727],"domain_scores_gemma":[0.9994194,0.00023074806,0.000017697734,0.00019567097,0.0000587541,0.000077728626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037789685,0.00007860394,0.00014833677,0.00008314507,0.00009522661,0.000060992053,0.000048187394,0.000020809315,0.000040803232],"category_scores_gemma":[0.000009834672,0.000083904706,0.000029407573,0.000901747,0.000014874025,0.00006418922,0.00005590976,0.00028076398,0.0000018388026],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001340562,0.00015311768,0.5750095,0.00004244113,0.00025803945,0.00001431771,0.0005558331,0.1648522,0.0012866851,0.22408906,0.0012016707,0.03252369],"study_design_scores_gemma":[0.0020356495,0.00018548364,0.7080607,0.001416299,0.00014549006,0.000022982322,0.0045720544,0.060652178,0.021764055,0.049075738,0.15008841,0.0019809692],"about_ca_topic_score_codex":0.001335778,"about_ca_topic_score_gemma":0.0001519956,"teacher_disagreement_score":0.19566762,"about_ca_system_score_codex":0.00003639929,"about_ca_system_score_gemma":0.000046453144,"threshold_uncertainty_score":0.34215346},"labels":[],"label_agreement":null},{"id":"W3208996391","doi":"","title":"Social Network Analysis","year":2010,"lang":"en","type":"article","venue":"TRAILS: Teaching Resources and Innovations Library for Sociology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Social network (sociolinguistics); Reading (process); Social network analysis; Computer science; Class (philosophy); Data science; World Wide Web; Artificial intelligence; Social media; Linguistics","score_opus":0.015007130049739158,"score_gpt":0.2891333721227894,"score_spread":0.27412624207305025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208996391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9594411,0.000041577554,0.028994452,0.00257498,0.00005762572,0.00018793509,0.000063566215,0.00024121765,0.008397543],"genre_scores_gemma":[0.9799849,9.75121e-7,0.016444277,0.000349616,0.0018568304,0.00007649287,0.0006742926,0.000026149166,0.0005865008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888337,0.00008723431,0.0003529877,0.00030024495,0.000058077236,0.00031811566],"domain_scores_gemma":[0.9992891,0.00026809346,0.00018627677,0.00018554968,0.000029717508,0.000041240783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037981404,0.00016508512,0.00036234182,0.000230774,0.0010093414,0.00010196179,0.00022184169,0.000119866585,0.0003573021],"category_scores_gemma":[0.000009510506,0.00015641552,0.00025079475,0.00056332117,0.00026542318,0.00024505425,0.00009045337,0.0005872019,0.0000013671837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009452685,0.000042980784,0.122483596,0.0000036405152,0.0006667969,7.860578e-8,0.0016999514,0.000037273567,0.00018020187,0.8339786,0.023983791,0.016913624],"study_design_scores_gemma":[0.00035950763,0.00007043918,0.05626677,0.0000035553999,0.00054128777,5.339884e-7,0.00063919765,0.0054907193,0.000025958318,0.36233604,0.5738904,0.0003756016],"about_ca_topic_score_codex":0.00003100899,"about_ca_topic_score_gemma":0.0000061626115,"teacher_disagreement_score":0.5499066,"about_ca_system_score_codex":0.0000031551676,"about_ca_system_score_gemma":0.000018814577,"threshold_uncertainty_score":0.776314},"labels":[],"label_agreement":null},{"id":"W3209260493","doi":"10.1371/journal.pcbi.1009537","title":"The network structure affects the fixation probability when it couples to the birth-death dynamics in finite population","year":2021,"lang":"en","type":"article","venue":"PLoS Computational Biology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Institutes of Health Research","keywords":"Fixation (population genetics); Birth–death process; Random graph; Population; Complex network; Statistical physics; Exponent; Mathematics; Scale-free network; Computer science; Combinatorics; Physics; Graph; Demography","score_opus":0.01588962579965464,"score_gpt":0.26033096148695023,"score_spread":0.2444413356872956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209260493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8665524,0.00018612543,0.11044397,0.02105568,0.00018411608,0.0009560603,0.0001325148,0.00006178359,0.00042733247],"genre_scores_gemma":[0.99460435,0.0000025025133,0.0032983785,0.0004081357,0.00036710332,0.0000722691,0.0012026367,0.000008943298,0.00003565238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998708,0.00042720578,0.00025830336,0.0002595742,0.00013220044,0.00021470661],"domain_scores_gemma":[0.99775016,0.0016619039,0.00014054251,0.0002750974,0.00014836049,0.000023947201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031402535,0.00012964253,0.00016145637,0.000021214824,0.00039860097,0.0000763079,0.00025861777,0.000044476084,0.000086386775],"category_scores_gemma":[0.000069478585,0.000071167204,0.00007366897,0.00036333498,0.000051977226,0.00003469385,0.00014372735,0.00020426617,0.0000052821997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013229314,0.00002840495,0.2940405,0.00000268021,0.00006729687,1.9177226e-7,0.00010871607,0.4247424,0.000009633575,0.27306348,0.00073217176,0.0071913023],"study_design_scores_gemma":[0.00006373591,0.000016850578,0.10949599,0.000009584184,0.000014536334,3.7765608e-7,0.000046273854,0.42180777,0.0000075344637,0.46672854,0.0017396064,0.00006919967],"about_ca_topic_score_codex":0.00014972904,"about_ca_topic_score_gemma":0.0034596613,"teacher_disagreement_score":0.19366509,"about_ca_system_score_codex":0.00009442832,"about_ca_system_score_gemma":0.000060686445,"threshold_uncertainty_score":0.30657566},"labels":[],"label_agreement":null},{"id":"W3210318427","doi":"10.5539/ijef.v13n12p14","title":"Relationships between Scientific Collaboration Ego Network and Academic Influence: An Empirical Examination of Intelligence Science Scholar in China","year":2021,"lang":"en","type":"article","venue":"International Journal of Economics and Finance","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Id, ego and super-ego; Research Object; Social network analysis; Connection (principal bundle); China; Social network (sociolinguistics); Network structure; Field (mathematics); Psychology; Network science; Computer science; Data science; Sociology; Mathematics education; Social psychology; Complex network; Social science; Political science; Regional science; Mathematics; World Wide Web; Theoretical computer science; Law","score_opus":0.03589507300242987,"score_gpt":0.3316308672814697,"score_spread":0.2957357942790398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210318427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99649495,0.0002697465,0.0027227758,0.00024961054,0.00011305671,0.000039953313,0.000010866181,0.0000014373092,0.0000976144],"genre_scores_gemma":[0.9945533,0.00039297531,0.004841787,0.000008911936,0.000176968,0.0000014077447,0.000010430355,0.0000037703514,0.00001044415],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989801,0.00007083952,0.00054398866,0.00018810152,0.00011939445,0.000097581855],"domain_scores_gemma":[0.99874187,0.00008559684,0.0004777138,0.00009627925,0.00055807433,0.000040471274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018611259,0.00006896604,0.0001706155,0.00023237168,0.00013137904,0.0001818408,0.00024855838,0.00003944898,0.00000586834],"category_scores_gemma":[0.000093011375,0.00007499849,0.000026329477,0.000437052,0.00021857492,0.0011218142,0.00009114397,0.00034516634,2.903678e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013357289,0.00004669736,0.80534726,0.0000022440327,0.000027425744,0.0000017778658,0.0009677147,0.04742803,0.0003111349,0.083670475,0.000013987424,0.062169876],"study_design_scores_gemma":[0.00014815376,0.0000353002,0.87869686,0.0000804419,0.000011896612,0.0000061310448,0.00020674976,0.032559086,0.0020535782,0.08548119,0.0006301423,0.00009048278],"about_ca_topic_score_codex":0.0000093982,"about_ca_topic_score_gemma":0.000022217715,"teacher_disagreement_score":0.07334957,"about_ca_system_score_codex":0.00006158427,"about_ca_system_score_gemma":0.0002457065,"threshold_uncertainty_score":0.30583498},"labels":[],"label_agreement":null},{"id":"W3211484594","doi":"10.23977/jeis.2021.61008","title":"A New Link Isolation Algorithm based on Complex Network Theory for Preventing Cascading Failures in Power Grid","year":2021,"lang":"en","type":"article","venue":"Journal of Electronics and Information Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cascading failure; Computer science; Betweenness centrality; Isolation (microbiology); Electric power system; Vulnerability (computing); Metric (unit); Distributed computing; Joint (building); Centrality; Construct (python library); Power-system protection; Power (physics); Algorithm; Reliability engineering; Computer network; Computer security; Engineering; Mathematics","score_opus":0.007973196951051854,"score_gpt":0.27058948660228255,"score_spread":0.2626162896512307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211484594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008838295,0.00010711392,0.98895806,0.0004812146,0.00007022169,0.000104629384,0.000002081146,0.0000054180705,0.0014329661],"genre_scores_gemma":[0.92877203,0.000016278163,0.07071048,0.00021319241,0.00025854696,0.000002363328,0.0000098166,0.0000033224958,0.000013958652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899113,0.000031784686,0.00043726113,0.00007490891,0.00023358605,0.00023135215],"domain_scores_gemma":[0.99899596,0.00013633675,0.0004202483,0.00008539972,0.00030358825,0.00005845229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001606722,0.00007395747,0.00014939035,0.00020954992,0.00017500768,0.0002134393,0.00013227212,0.00001792402,0.00005162012],"category_scores_gemma":[0.00004468375,0.000065301385,0.00007703649,0.00063098094,0.000024788395,0.0014885504,0.000027744307,0.00016568886,3.812991e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007616011,0.000048886544,0.0031993657,0.000012263443,0.000037094273,6.345465e-7,0.0006206079,0.05612779,0.0012917798,0.29390293,0.0027634131,0.6419191],"study_design_scores_gemma":[0.0006710763,0.0002510049,0.0035922525,0.000105428415,0.000021798845,0.0000058154064,0.00017618336,0.90779066,0.0013650302,0.038937278,0.046936076,0.00014737033],"about_ca_topic_score_codex":0.00000454466,"about_ca_topic_score_gemma":0.000002799956,"teacher_disagreement_score":0.91993374,"about_ca_system_score_codex":0.00006702658,"about_ca_system_score_gemma":0.0004691434,"threshold_uncertainty_score":0.26629132},"labels":[],"label_agreement":null},{"id":"W3213331957","doi":"10.23977/jaip.2020.040106","title":"Research on the Rock-paper-scissors Game and Cooperation","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Practice","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Participant observation; MATLAB; Computer science; Software; Basis (linear algebra); Artificial intelligence; Mathematics","score_opus":0.12663347789601279,"score_gpt":0.43193384088752557,"score_spread":0.30530036299151275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213331957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3737881,0.001009759,0.5133934,0.077057555,0.00053705287,0.00039135778,0.000005045167,0.000030353256,0.033787414],"genre_scores_gemma":[0.99725026,0.000113364316,0.0014488803,0.00032555358,0.00068934617,0.0000035343194,9.472504e-7,0.000008620202,0.00015946555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99809015,0.0006671334,0.00046648792,0.000146208,0.00045132844,0.00017867323],"domain_scores_gemma":[0.9955334,0.0024272872,0.00029092302,0.00021800799,0.001461062,0.00006931775],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027964646,0.0000864955,0.00015769764,0.0001038041,0.0002650295,0.00032399717,0.0001945229,0.000029117042,0.0009816372],"category_scores_gemma":[0.000813046,0.0000607927,0.00008435129,0.00059445837,0.00006284173,0.0004926011,0.0000774586,0.00073716306,0.000058021113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026252924,0.00062132714,0.00013310331,0.0000037807324,0.00023427479,0.000053941,0.0014832949,0.006346162,0.013000667,0.78159523,0.005246281,0.1910194],"study_design_scores_gemma":[0.000080062506,0.0009206823,0.00015720079,0.00022460497,0.0002987831,0.00016271017,0.04806989,0.041080903,0.39802402,0.284154,0.22639981,0.0004273246],"about_ca_topic_score_codex":0.00005346078,"about_ca_topic_score_gemma":0.000017590191,"teacher_disagreement_score":0.6234622,"about_ca_system_score_codex":0.00003143557,"about_ca_system_score_gemma":0.00014236776,"threshold_uncertainty_score":0.9999316},"labels":[],"label_agreement":null},{"id":"W3213695764","doi":"","title":"Local Hyper-Flow Diffusion","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypergraph; Cluster analysis; Computer science; Mathematical optimization; Mathematics; Flow (mathematics); Interpretation (philosophy); Theoretical computer science; Algorithm; Discrete mathematics; Artificial intelligence","score_opus":0.010921004371104577,"score_gpt":0.2441491110590466,"score_spread":0.23322810668794203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213695764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1040904,0.00032380037,0.8632712,0.0002399046,0.00036526326,0.0002261958,0.00001543262,0.00037654195,0.031091297],"genre_scores_gemma":[0.99849,0.000001166146,0.0005674392,0.000106851134,0.00019295125,0.000030063682,0.00020945733,0.0000076968545,0.00039437972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990202,0.000040364706,0.00041846352,0.000109615845,0.00023346249,0.00017789699],"domain_scores_gemma":[0.99926966,0.000016956166,0.0002044231,0.00017965389,0.00027351803,0.00005578882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009853998,0.00012317197,0.00018185098,0.00006721212,0.0002001755,0.00039623815,0.00010906631,0.00003527615,0.00011665927],"category_scores_gemma":[0.0000044381804,0.000110643334,0.000074609314,0.00033562205,0.000025701853,0.0010974321,0.000060620852,0.00012517335,0.00006026063],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009050571,0.00006044921,0.007140832,0.00018064579,0.000028301936,0.0000015669522,0.000760202,0.018343586,0.0005290466,0.004254452,0.006594924,0.9620969],"study_design_scores_gemma":[0.0001970536,0.0000110954525,0.00034139352,0.000094228475,0.000019551308,0.0000112155885,0.001063217,0.9392053,0.0011631827,0.00024061846,0.057477348,0.00017582698],"about_ca_topic_score_codex":0.00007341339,"about_ca_topic_score_gemma":0.0000014596096,"teacher_disagreement_score":0.9619211,"about_ca_system_score_codex":0.000030854808,"about_ca_system_score_gemma":0.000059855753,"threshold_uncertainty_score":0.4511904},"labels":[],"label_agreement":null},{"id":"W3214014018","doi":"10.15866/ireci.v2i2.16432","title":"Visually Mining Relational Data","year":2018,"lang":"en","type":"article","venue":"International Journal on Computer and Communications Networks Computational Intelligence and Data Analytics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Exploit; Computer science; Clustering coefficient; Cluster analysis; Relational database; Data mining; Focus (optics); Zoom; Raw data; Metric (unit); Graph; Data science; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Information retrieval; Artificial intelligence; Engineering","score_opus":0.15681109616144662,"score_gpt":0.40742271408979114,"score_spread":0.2506116179283445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214014018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015998082,0.00030697402,0.99432486,0.001988756,0.00028553576,0.000080796846,0.00016434549,0.000038662634,0.0012102745],"genre_scores_gemma":[0.82799053,0.00047247057,0.16564645,0.0007834923,0.0020740698,0.0000022821357,0.0029748757,0.000016325866,0.000039490536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980272,0.00014127164,0.0006617045,0.0005053239,0.0004571758,0.0002073263],"domain_scores_gemma":[0.99639577,0.0008747737,0.0003280924,0.0015582236,0.0006886668,0.0001544798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075092184,0.00021580078,0.00022603894,0.00025952904,0.00059106766,0.00061349384,0.003536899,0.00005129249,0.0001494559],"category_scores_gemma":[0.00002506322,0.00020950928,0.000049862436,0.00027529872,0.00041878692,0.000724521,0.0035977063,0.00043568865,0.00001541108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006155297,0.0003845484,0.01879192,0.000002262127,0.0011642294,0.000007906025,0.00022763471,0.1009911,6.0646573e-7,0.29225537,0.025079567,0.5610333],"study_design_scores_gemma":[0.00013121586,0.00008517447,0.002623555,0.0000769416,0.000069905676,0.000060983468,0.000077202094,0.9528297,7.897721e-7,0.024751335,0.019088555,0.00020461743],"about_ca_topic_score_codex":0.000026336744,"about_ca_topic_score_gemma":0.000020265235,"teacher_disagreement_score":0.85183865,"about_ca_system_score_codex":0.000029106106,"about_ca_system_score_gemma":0.000097086835,"threshold_uncertainty_score":0.8543541},"labels":[],"label_agreement":null},{"id":"W3214022335","doi":"10.1140/epjs/s11734-022-00470-4","title":"Detecting contagious spreading of urban innovations on the global city network","year":2022,"lang":"en","type":"preprint","venue":"The European Physical Journal Special Topics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"Deutsche Forschungsgemeinschaft; Horizon 2020 Framework Programme; H2020 European Research Council; Leibniz-Gemeinschaft; Bundesministerium für Bildung und Forschung; Princeton University","keywords":"Sustainability; Globe; Process (computing); Business; Economic geography; Industrial organization; Economic system; Computer science; Economics","score_opus":0.031701564986762625,"score_gpt":0.28890983728706404,"score_spread":0.2572082723003014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214022335","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20728332,0.00003954354,0.0029937283,0.0010475368,0.0012601682,0.00042574565,0.000062092084,0.0000659335,0.7868219],"genre_scores_gemma":[0.83756757,0.000005026412,0.00014868857,0.00011324468,0.16191562,0.0000064788437,0.00001359928,0.000030941443,0.0001988249],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720985,0.0011222875,0.00058310525,0.00026776962,0.00047853278,0.00033843168],"domain_scores_gemma":[0.99792004,0.00029366818,0.00090938015,0.0006651743,0.0001471709,0.00006456461],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001147281,0.00029685744,0.00045290578,0.000035132245,0.0009262908,0.00021359872,0.0013513035,0.00002529085,0.00032323113],"category_scores_gemma":[0.000039267943,0.00019213751,0.00056758925,0.0005128867,0.00013592187,0.00003454805,0.0015515172,0.0023324385,0.00000833078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006622919,0.0004043941,0.014080175,0.000010428448,0.0010252395,0.000023702238,0.0013920505,0.019677058,0.000027786135,0.42357835,0.04870118,0.4910134],"study_design_scores_gemma":[0.00029965778,0.0001769017,0.011919779,0.00021548067,0.00041350932,0.000007201107,0.00044140941,0.0011335388,0.00013064721,0.8223582,0.16231371,0.00058999885],"about_ca_topic_score_codex":0.000056436686,"about_ca_topic_score_gemma":0.0000070020687,"teacher_disagreement_score":0.7866231,"about_ca_system_score_codex":0.0001759462,"about_ca_system_score_gemma":0.0000723047,"threshold_uncertainty_score":0.99996924},"labels":[],"label_agreement":null},{"id":"W3214570550","doi":"10.2196/33617","title":"Utility of Facebook’s Social Connectedness Index in Modeling COVID-19 Spread: Exponential Random Graph Modeling Study","year":2021,"lang":"en","type":"article","venue":"JMIR Public Health and Surveillance","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Diabetes and Digestive and Kidney Diseases","keywords":"Social connectedness; Exponential random graph models; Population; Covariate; Social media; Odds; Pandemic; Statistics; Coronavirus disease 2019 (COVID-19); Demography; Computer science; Random graph; Graph; Mathematics; Medicine; Psychology; Logistic regression; Sociology; Social psychology; Disease; Infectious disease (medical specialty); World Wide Web","score_opus":0.06920288907593304,"score_gpt":0.35329741604539733,"score_spread":0.2840945269694643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214570550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7682792,0.00015886656,0.22948399,0.0007309883,0.000038766088,0.00081074436,0.00003255557,0.000059787013,0.00040511176],"genre_scores_gemma":[0.99926585,0.000018646795,0.00008283328,0.00017774786,0.0001154852,0.00019511646,0.00011402677,0.000015944299,0.000014327543],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968786,0.000939345,0.000829127,0.0005258436,0.00029933522,0.00052773324],"domain_scores_gemma":[0.9987249,0.00015717308,0.00021039574,0.00030882115,0.00021832889,0.00038040217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017862462,0.00021161782,0.00079672324,0.00019051503,0.00027349708,0.000080054604,0.00017457012,0.00006287054,0.00012848739],"category_scores_gemma":[0.00007000671,0.00022399747,0.00013444388,0.0006368248,0.00005432087,0.00012608903,0.00015185039,0.00028326327,4.5508781e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018527685,0.0006914352,0.97874975,0.00011350891,0.00009097801,0.0000034303844,0.0039799795,0.0029407965,0.000008842232,0.0012600021,0.00023576128,0.011740238],"study_design_scores_gemma":[0.0040628286,0.000045016255,0.011294121,0.0000108759505,0.0000024394922,8.5604853e-7,0.0068095876,0.97349674,0.0000013111081,0.0033260123,0.00065980497,0.00029043562],"about_ca_topic_score_codex":0.0034455098,"about_ca_topic_score_gemma":0.002101546,"teacher_disagreement_score":0.9705559,"about_ca_system_score_codex":0.000044453805,"about_ca_system_score_gemma":0.0011177276,"threshold_uncertainty_score":0.91343516},"labels":[],"label_agreement":null},{"id":"W3214612592","doi":"10.1016/j.neucom.2021.03.140","title":"Edge-aided control dynamics for information diffusion in social Internet of Things","year":2021,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Chongqing Basic Science and Advanced Technology Research Program","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Curse of dimensionality; The Internet; Edge computing; Control (management); Scope (computer science); Diffusion; Theoretical computer science; Artificial intelligence; World Wide Web","score_opus":0.007222701916070797,"score_gpt":0.24551116056855077,"score_spread":0.23828845865247997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214612592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44456637,0.0000028941413,0.55287266,0.00010263829,0.000044918757,0.00015904788,0.000004408698,0.000030332954,0.0022167256],"genre_scores_gemma":[0.99701893,1.32413e-7,0.0026099044,0.00012255272,0.00013023103,0.000009452514,0.00007972197,0.000007120744,0.000021969588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992768,0.000040882172,0.0003507005,0.00010842909,0.00008355354,0.0001396215],"domain_scores_gemma":[0.9994678,0.0001249769,0.00020505821,0.00007758038,0.00010996081,0.000014630971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013160445,0.00008092857,0.00020526415,0.00007414531,0.000053053187,0.000036365698,0.000100256504,0.000024748899,0.000015204797],"category_scores_gemma":[0.000013719333,0.00008896762,0.00011720702,0.00018623314,0.0000119364995,0.0001527167,0.000092101545,0.00011225187,8.747117e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007071987,0.00026312532,0.14263344,0.00011909112,0.000091214584,0.0000016818901,0.0031148263,0.0016756263,0.0041404595,0.1429967,0.0016250185,0.7032681],"study_design_scores_gemma":[0.0008311938,0.000021502397,0.007598948,0.000039661696,0.00002073484,3.7664316e-7,0.00014814507,0.9833856,0.0015050634,0.005290117,0.0010566562,0.00010199816],"about_ca_topic_score_codex":0.00007208406,"about_ca_topic_score_gemma":0.000007193151,"teacher_disagreement_score":0.98170996,"about_ca_system_score_codex":0.000024352214,"about_ca_system_score_gemma":0.000021894706,"threshold_uncertainty_score":0.36279944},"labels":[],"label_agreement":null},{"id":"W32585693","doi":"10.1093/jac/dkaa211","title":"Visualizing Reciprocal and Non-Reciprocal Relationships in an Online Community","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"National Health and Medical Research Council","keywords":"Reciprocal; Identity (music); Online community; Visualization; Social psychology; Computer science; Psychology; World Wide Web; Artificial intelligence","score_opus":0.0875218989838368,"score_gpt":0.35179202381061203,"score_spread":0.26427012482677525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32585693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9680408,0.000011484106,0.025044225,0.00015397431,0.000006349161,0.00011406368,0.0000028438344,0.00007406057,0.0065521896],"genre_scores_gemma":[0.99017036,0.0000013871371,0.009421448,0.00010816825,0.00010206097,0.000005867277,0.00011058019,0.000007751836,0.00007237754],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991018,0.00023437571,0.00025462254,0.00015395973,0.00008201319,0.00017319276],"domain_scores_gemma":[0.9994489,0.0001123297,0.000049608858,0.00027565513,0.000036228288,0.00007729513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004444667,0.000117952135,0.0001915675,0.00010629717,0.00021749867,0.000049300827,0.00014098833,0.000041831463,0.00007550015],"category_scores_gemma":[0.000008093564,0.00011287298,0.00003880004,0.00028145622,0.000033253753,0.00020644203,0.000056402332,0.0005735679,0.0000030888448],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027814624,0.0011518273,0.820875,0.0000034937134,0.0000192467,0.000001063829,0.0011519449,0.00009858085,0.00087365776,0.031318147,0.00045805113,0.14402117],"study_design_scores_gemma":[0.00045610397,0.0002424431,0.8818731,0.00004919542,0.00002504281,7.54902e-7,0.0019821525,0.050956804,0.00047099797,0.06317707,0.00045062747,0.00031571306],"about_ca_topic_score_codex":0.0006929607,"about_ca_topic_score_gemma":0.0011432418,"teacher_disagreement_score":0.14370546,"about_ca_system_score_codex":0.000021535367,"about_ca_system_score_gemma":0.00001468014,"threshold_uncertainty_score":0.46028265},"labels":[],"label_agreement":null},{"id":"W32942423","doi":"10.1103/physreve.102.022301","title":"ВОССТАНОВЛЕНИЕ ПЛОДОРОДИЯ ЭРОДИРОВАННЫХ КАРБОНАТНЫХ ПОЧВ","year":2014,"lang":"en","type":"article","venue":"Фундаментальные исследования (Fundamental Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation","keywords":"Mathematics","score_opus":0.058412056497131215,"score_gpt":0.4068385973318605,"score_spread":0.3484265408347293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32942423","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4245646,0.00040989748,0.02223287,0.0018700085,0.00071736757,0.0018573751,0.00015415992,0.0011284988,0.5470652],"genre_scores_gemma":[0.9824979,0.000026791116,0.0021139018,0.00025838218,0.0018833485,0.00022739837,0.00027367787,0.00017792272,0.012540687],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9924641,0.0010525213,0.00093637995,0.0013428178,0.0020714004,0.0021327392],"domain_scores_gemma":[0.9958144,0.00090824347,0.0002551872,0.0018094863,0.000433,0.0007797208],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003397663,0.00067558454,0.0008404124,0.0007814215,0.0012484626,0.0006967029,0.0017204861,0.00018401995,0.013423417],"category_scores_gemma":[0.00014691682,0.00066632,0.0006154536,0.0016751945,0.0008062242,0.0005594684,0.0013877263,0.0015903617,0.0032486345],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002461755,0.0018245351,0.07114087,0.00009492349,0.00081346266,0.000034050234,0.0010336918,0.00011439039,0.015055934,0.2814518,0.27354982,0.35464036],"study_design_scores_gemma":[0.002056482,0.0008693234,0.013797973,0.00023829936,0.00013162964,0.000013748483,0.0016089944,0.008170076,0.013125737,0.14227141,0.81600994,0.0017063954],"about_ca_topic_score_codex":0.0019801415,"about_ca_topic_score_gemma":0.00014009773,"teacher_disagreement_score":0.5579333,"about_ca_system_score_codex":0.0003885666,"about_ca_system_score_gemma":0.00016817637,"threshold_uncertainty_score":0.9995788},"labels":[],"label_agreement":null},{"id":"W36429626","doi":"10.3390/ijerph192214907","title":"Comparative Study of Sampling Methods for Online Social Networks","year":2013,"lang":"en","type":"article","venue":"International Journal of Environmental Research and Public Health","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Sampling (signal processing); Computer science; Social network (sociolinguistics); Systematic sampling; Data science; Random walk; Node (physics); Raw data; Data mining; Population; Statistics; World Wide Web; Mathematics; Social media; Telecommunications","score_opus":0.22942725854203472,"score_gpt":0.5399423607958066,"score_spread":0.3105151022537719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36429626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8422517,0.0001921095,0.15559779,0.0014273208,0.00005126268,0.00036401453,0.000031402553,0.0000022385868,0.000082134204],"genre_scores_gemma":[0.9816241,0.000047316742,0.017712023,0.0000349965,0.00050268305,0.000017966298,0.000030953644,0.00000639631,0.000023564346],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983749,0.00036018432,0.0004976619,0.000110652596,0.00041389637,0.00024273747],"domain_scores_gemma":[0.99872804,0.0004905597,0.00033738368,0.000060617374,0.00022127447,0.00016214716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00171217,0.000073084506,0.0002761379,0.00021637032,0.00013366214,0.00007473122,0.00028765795,0.000017297049,0.00030851536],"category_scores_gemma":[0.000016959593,0.00006211039,0.00007459128,0.00009173987,0.000108293476,0.00018726528,0.00013776234,0.0002872342,5.145193e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008422558,0.005026155,0.042288177,0.000005511706,0.0008348983,4.0046527e-7,0.0021139344,0.00009688865,0.00054413517,0.0022557152,0.0018987128,0.9448512],"study_design_scores_gemma":[0.0077961655,0.010929443,0.70981145,0.00011713037,0.00004649721,0.000017753036,0.09133142,0.050414894,0.00024522902,0.074455366,0.054244757,0.00058991543],"about_ca_topic_score_codex":0.00024873565,"about_ca_topic_score_gemma":0.000012942702,"teacher_disagreement_score":0.9442613,"about_ca_system_score_codex":0.00011165187,"about_ca_system_score_gemma":0.000079299585,"threshold_uncertainty_score":0.33780268},"labels":[],"label_agreement":null},{"id":"W376461604","doi":"10.1016/j.physa.2015.05.103","title":"Revisiting node-based SIR models in complex networks with degree correlations","year":2015,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Deanship of Scientific Research, King Faisal University","keywords":"Degree (music); Epidemic model; Node (physics); Correlation; Population; Mathematics; Complex network; Degree distribution; Statistical physics; Statistics; Combinatorics; Physics; Demography","score_opus":0.05781439656854167,"score_gpt":0.29293213849491323,"score_spread":0.23511774192637155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W376461604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047246847,0.000041907362,0.99587226,0.00034652773,0.0000045136876,0.00050782046,0.0001327588,0.00006577264,0.0025559852],"genre_scores_gemma":[0.947331,0.0000035122528,0.051513463,0.00008663913,0.0001468034,0.00047249722,0.00041007515,0.000026223546,0.000009780295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882275,0.000052809937,0.00030259616,0.0003658078,0.00018040999,0.00027564337],"domain_scores_gemma":[0.99893874,0.00028458718,0.00012671741,0.0002787367,0.00017949654,0.00019172727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014868155,0.00018820958,0.00029385442,0.00006573396,0.00015421765,0.00006732816,0.00014716887,0.000030475547,0.000041342224],"category_scores_gemma":[0.000007750575,0.00017479349,0.000036617766,0.000489291,0.000027125325,0.00010032672,0.00006758336,0.00021495186,0.000008691364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010368313,0.000121885656,0.0002204617,0.0000060585876,0.00002106586,4.0143473e-7,0.000025909792,0.038526837,0.000025060419,0.95013094,0.00034776458,0.010563269],"study_design_scores_gemma":[0.00029498377,0.000028745593,0.0002153279,0.00002036985,0.000054992004,2.8667165e-7,0.000048677884,0.7961609,0.0000074916106,0.2022831,0.00071309716,0.00017205325],"about_ca_topic_score_codex":0.00007575948,"about_ca_topic_score_gemma":0.000016656933,"teacher_disagreement_score":0.9468585,"about_ca_system_score_codex":0.000035165336,"about_ca_system_score_gemma":0.000061766434,"threshold_uncertainty_score":0.71278715},"labels":[],"label_agreement":null},{"id":"W4200067354","doi":"10.13001/ela.2022.5913","title":"Families of graphs with twin pendent paths and the Braess edge","year":2021,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Universitetet i Oslo; University of Manitoba","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Constant (computer programming); Random graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Random walk; Random regular graph; Context (archaeology); Undirected graph; Pathwidth; Line graph; Computer science; Statistics; Artificial intelligence; Geography","score_opus":0.004516494244874784,"score_gpt":0.22593601391469612,"score_spread":0.22141951966982132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200067354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792438,0.0042324397,0.015136167,0.00041912944,0.000025454618,0.000080034435,0.0000024688159,0.0000074142754,0.0008531051],"genre_scores_gemma":[0.998733,0.00036750187,0.00055402366,0.0000377857,0.00018503542,0.0000023654165,0.0000032118082,0.000012996154,0.00010409929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988813,0.00013297725,0.00037783393,0.00011143215,0.00024079473,0.0002557017],"domain_scores_gemma":[0.999027,0.00012878318,0.00036286633,0.00019615325,0.00024278139,0.000042425294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050656946,0.00012190882,0.00037716868,0.0000733249,0.00007399292,0.000028386781,0.00019063754,0.000019526027,0.000108159846],"category_scores_gemma":[0.000008020107,0.000073797106,0.00020065682,0.00028759174,0.00013690827,0.000080781196,0.000058925896,0.00040325796,6.582819e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047312316,0.00037177137,0.054971572,0.000029681687,0.00239239,0.000023534343,0.001266178,0.00020558387,0.0021076368,0.90470374,0.0007903058,0.03266446],"study_design_scores_gemma":[0.01392067,0.0023376122,0.015369628,0.0005579733,0.0024920173,0.00055989047,0.007852834,0.003946336,0.12082496,0.8128994,0.018115124,0.0011235437],"about_ca_topic_score_codex":0.00004076095,"about_ca_topic_score_gemma":0.000031385014,"teacher_disagreement_score":0.11871733,"about_ca_system_score_codex":0.000019532255,"about_ca_system_score_gemma":0.00029332284,"threshold_uncertainty_score":0.30093586},"labels":[],"label_agreement":null},{"id":"W4200118502","doi":"10.31235/osf.io/nzjqm","title":"The company you keep: How network disciplinary diversity enhances the productivity of researchers","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Productivity; Diversity (politics); Seniority; Closure (psychology); Discipline; Argument (complex analysis); Social capital; Knowledge management; Public relations; Business; Political science; Sociology; Economics; Computer science; Economic growth; Social science","score_opus":0.06254688442352516,"score_gpt":0.3197706343098393,"score_spread":0.25722374988631413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200118502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9335567,0.0017197533,0.031651385,0.01108257,0.0005245752,0.0013921144,0.000039931874,0.00013757749,0.019895392],"genre_scores_gemma":[0.99345356,0.00006345689,0.00090903166,0.0000071144013,0.0010458934,0.00006646301,0.0000694949,0.000015778345,0.004369195],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974533,0.00066422654,0.00026985112,0.00060371915,0.00056094286,0.000447968],"domain_scores_gemma":[0.9970984,0.00051191373,0.000382937,0.0016338344,0.00030836245,0.0000645532],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016669027,0.00028043558,0.0005048278,0.00003113762,0.0013597825,0.00029479296,0.0015714624,0.00007248185,0.0002403972],"category_scores_gemma":[0.000020068748,0.0001593615,0.00050923205,0.00041590075,0.00061290275,0.00008872145,0.012459886,0.0010698781,0.0000021773774],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031444337,0.0014547262,0.5498151,0.00032075628,0.00856575,0.000009513528,0.00781519,0.02001878,0.00080116064,0.056617968,0.2001484,0.15411817],"study_design_scores_gemma":[0.0006715103,0.00026419628,0.2505893,0.0011056815,0.0018570508,0.0000018104092,0.03509433,0.034423612,0.01744326,0.6271571,0.028496489,0.002895672],"about_ca_topic_score_codex":0.0013547492,"about_ca_topic_score_gemma":0.0006486729,"teacher_disagreement_score":0.5705391,"about_ca_system_score_codex":0.000050559647,"about_ca_system_score_gemma":0.00015636385,"threshold_uncertainty_score":0.99994034},"labels":[],"label_agreement":null},{"id":"W4200275001","doi":"10.1002/cjs.11676","title":"Graphon estimation via nearest‐neighbour algorithm and two‐dimensional fused‐lasso denoising","year":2021,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stochastic block model; Algorithm; Piecewise; Estimator; Lasso (programming language); Regularization (linguistics); Degree (music); Mathematics; Bounded function; Computer science; Graph; Block (permutation group theory); Mathematical optimization; Combinatorics; Artificial intelligence; Statistics","score_opus":0.00812115436692936,"score_gpt":0.23287432032054894,"score_spread":0.22475316595361958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200275001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037808042,0.00033608067,0.9611018,0.00014962253,0.00015794559,0.000038201426,0.00021351782,0.0000052678556,0.00018953465],"genre_scores_gemma":[0.70605874,0.0000034852244,0.2935468,0.00006314162,0.00019833041,5.982882e-7,0.00006899182,0.0000137499665,0.000046140507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991058,0.00006031793,0.00033550675,0.000116752715,0.00015941363,0.00022222029],"domain_scores_gemma":[0.9987402,0.000119794226,0.00022593347,0.000109828026,0.00041119053,0.00039303626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016287918,0.00011496256,0.00022171995,0.00017438896,0.00019241343,0.00013028983,0.00008144837,0.00002486085,0.00040700097],"category_scores_gemma":[0.00002599556,0.00012218428,0.00005818038,0.00020483066,0.00007152835,0.00010199043,0.00001580331,0.00021033254,0.0000034192299],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007590867,0.000053115546,0.0377149,0.00001717826,0.00042382526,0.0008575367,0.00037083315,0.010456131,0.00048377312,0.036265943,0.021888414,0.8914608],"study_design_scores_gemma":[0.0015937679,0.00021253548,0.040132448,0.00030066827,0.000647119,0.0005562249,0.00025443794,0.5096774,0.0020266988,0.4361009,0.0077041383,0.000793658],"about_ca_topic_score_codex":0.003372877,"about_ca_topic_score_gemma":0.0032929385,"teacher_disagreement_score":0.8906671,"about_ca_system_score_codex":0.00006650129,"about_ca_system_score_gemma":0.00068261835,"threshold_uncertainty_score":0.50988036},"labels":[],"label_agreement":null},{"id":"W4200408522","doi":"10.36334/modsim.2021.a1.alhuzali","title":"Multi-way correspondence analysis approach to examine Nobel Prize data from 1901 to 2018","year":2021,"lang":"en","type":"article","venue":"MODSIM2021, 24th International Congress on Modelling and Simulation.","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.11602832093756546,"score_gpt":0.3484036466525837,"score_spread":0.23237532571501826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200408522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15270369,0.00006185068,0.8446593,0.00017042166,0.000279604,0.00018975306,0.000646915,0.000057307137,0.0012311083],"genre_scores_gemma":[0.90560085,0.000007744954,0.08742654,0.00027194136,0.00033782137,0.00003333561,0.0026222963,0.000026177573,0.0036732869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749064,0.00009359606,0.0005003363,0.0010972752,0.0005615096,0.000256649],"domain_scores_gemma":[0.99768966,0.00043990376,0.00015272699,0.0010276657,0.00048175117,0.00020828612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031365617,0.00028256717,0.00043342853,0.00038422178,0.00017928146,0.0003192662,0.0007066614,0.000061532635,0.00049594714],"category_scores_gemma":[0.000055679808,0.00029297324,0.00012557345,0.00075156835,0.00003116254,0.00024452893,0.00053007976,0.00020331173,0.000044910576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075667354,0.0002528743,0.00834218,0.0000022226932,0.00075580616,0.000002984968,0.00014542458,0.98542815,0.00015893839,0.00064198364,0.0006160011,0.003577775],"study_design_scores_gemma":[0.00036673405,0.00001750468,0.0026177648,0.000038914884,0.00024272586,1.677699e-7,0.000060417722,0.99084127,0.00026153246,0.0006092535,0.004629318,0.00031436802],"about_ca_topic_score_codex":0.0005054394,"about_ca_topic_score_gemma":0.00006504359,"teacher_disagreement_score":0.7572328,"about_ca_system_score_codex":0.00005597287,"about_ca_system_score_gemma":0.000042875643,"threshold_uncertainty_score":0.99995226},"labels":[],"label_agreement":null},{"id":"W4200435172","doi":"10.31234/osf.io/y9kqc","title":"Bridging Interpersonal and Ecological Dynamics of Cognition through a Systems Framework of Bilingualism","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université du Québec à Montréal; McGill University","funders":"Canada Research Chairs","keywords":"Interpersonal communication; Cognition; Neuroscience of multilingualism; Psychology; Interpersonal relationship; Bridging (networking); Social cognition; Cognitive psychology; Cognitive science; Computer science; Social psychology","score_opus":0.0194275510504222,"score_gpt":0.299074110520329,"score_spread":0.2796465594699068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200435172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47127658,0.0001801343,0.52523124,0.00003183559,0.00009232901,0.00017774028,0.00006942428,0.000030315357,0.0029104059],"genre_scores_gemma":[0.9766926,0.000027387252,0.022614747,0.000012605449,0.00018434583,0.000028932034,0.00039377043,0.000013720275,0.000031902106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870086,0.00010354721,0.00053501624,0.00035853236,0.00016457244,0.00013745074],"domain_scores_gemma":[0.99882394,0.00020155645,0.0004371047,0.00028273845,0.00022516881,0.000029482628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018683902,0.00019926584,0.00069857127,0.00006403043,0.00002823682,0.000058375354,0.0001554892,0.00017974807,0.0003191574],"category_scores_gemma":[0.000018111345,0.00018420792,0.00025300376,0.000121436795,0.00011671246,0.000036059308,0.00067349407,0.00046153876,2.639011e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073273295,0.0016449852,0.07647394,0.0022666098,0.0042858864,0.000016964337,0.005110065,0.005393535,0.00068009,0.8650183,0.0004424026,0.03859396],"study_design_scores_gemma":[0.00031633064,0.00012588894,0.0019214053,0.004319032,0.0009133113,0.0000060123944,0.0073478394,0.78663516,0.0021244856,0.19548152,0.000038690257,0.000770354],"about_ca_topic_score_codex":0.0010707015,"about_ca_topic_score_gemma":0.000035078534,"teacher_disagreement_score":0.7812416,"about_ca_system_score_codex":0.000031043288,"about_ca_system_score_gemma":0.00006722559,"threshold_uncertainty_score":0.7511781},"labels":[],"label_agreement":null},{"id":"W4200451379","doi":"10.33423/jabe.v23i5.4568","title":"Chinese WeChat Users and Their Behavioural Features: A Case Study Based on the Grounded Theory","year":2021,"lang":"en","type":"article","venue":"Journal of Applied Business and Economics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Personality psychology; Perspective (graphical); Connection (principal bundle); Personality; China; Computer science; Social media; Psychology; World Wide Web; Internet privacy; Social psychology; Artificial intelligence; Political science; Engineering","score_opus":0.012456470078371255,"score_gpt":0.23112659260619592,"score_spread":0.21867012252782467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200451379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9972303,0.000053494226,0.0016408282,0.0002995685,0.0000506638,0.00013023804,0.0000063730486,0.000006115027,0.00058245525],"genre_scores_gemma":[0.9993488,0.000020619043,0.00021588441,0.00016829863,0.00020488928,0.000008781847,0.0000038117576,0.000016011254,0.000012877162],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993559,0.00004002956,0.000283011,0.00015637979,0.000042638985,0.00012205652],"domain_scores_gemma":[0.99915737,0.0002148254,0.00027161287,0.00021140829,0.00008816291,0.000056637473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041840153,0.00017657095,0.00033611245,0.000071659684,0.00019529126,0.00021502066,0.00010402264,0.000028168648,0.000056283843],"category_scores_gemma":[0.0000035502892,0.00010469358,0.00008913384,0.00013693301,0.000063168,0.000089389614,0.000070984875,0.00021354647,2.7517095e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025704422,0.005187144,0.4369147,0.00008594475,0.0035412034,0.0012886354,0.0129051,0.013523313,0.00080507237,0.22632864,0.0013452439,0.29550454],"study_design_scores_gemma":[0.013634742,0.0008128086,0.35604316,0.00024907547,0.001924712,0.0031332537,0.20431277,0.031696267,0.0015808715,0.38203517,0.0019680557,0.002609124],"about_ca_topic_score_codex":0.00006512794,"about_ca_topic_score_gemma":0.00008742147,"teacher_disagreement_score":0.29289544,"about_ca_system_score_codex":0.00002129124,"about_ca_system_score_gemma":0.000053560747,"threshold_uncertainty_score":0.426928},"labels":[],"label_agreement":null},{"id":"W4205195778","doi":"10.20873/uft.2447-4266.2021v7n3a7en","title":"SOCIAL NETWORK ANALYSIS TECHNIQUES (SNA): an applied research method to investigate the role of the Canadian Ministry of Health in combating COVID-19","year":2021,"lang":"en","type":"article","venue":"Revista Observatório","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Social network analysis; Government (linguistics); Christian ministry; Coronavirus disease 2019 (COVID-19); Pandemic; Public relations; Public health; Product (mathematics); Social network (sociolinguistics); Social media; Data science; Political science; Sociology; Computer science; World Wide Web; Medicine; Law","score_opus":0.10262879094064875,"score_gpt":0.42159188170021566,"score_spread":0.3189630907595669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205195778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89414644,0.00229418,0.032701485,0.04980794,0.000050604514,0.0049180835,0.0003984461,0.00020329829,0.01547949],"genre_scores_gemma":[0.98048246,0.0000047818476,0.018112184,0.0009663501,0.00015527433,0.00009331676,0.00010217372,0.00002121603,0.00006222509],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957598,0.002062939,0.00081568444,0.00040659966,0.00041044655,0.0005445291],"domain_scores_gemma":[0.9977557,0.00039256882,0.00041082484,0.00091076747,0.00026677694,0.000263361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058512907,0.00017717444,0.0007666836,0.0001942572,0.0007053747,0.00011096793,0.00083166565,0.000070054746,0.000069314614],"category_scores_gemma":[0.000078937235,0.00013731563,0.00028327724,0.0057177227,0.00019012425,0.000039679195,0.00034126872,0.0004981706,6.606199e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014504411,0.00012045695,0.61835504,0.00009629914,0.00047178796,0.0000012864299,0.0032459926,0.0034340583,0.0014864053,0.31494758,0.004512119,0.05331449],"study_design_scores_gemma":[0.00046049256,0.00015413726,0.20196037,0.00043043838,0.00080475205,0.0000013322469,0.009283514,0.011193644,0.01219645,0.17766929,0.58480537,0.0010402174],"about_ca_topic_score_codex":0.21295491,"about_ca_topic_score_gemma":0.229889,"teacher_disagreement_score":0.58029324,"about_ca_system_score_codex":0.00033806832,"about_ca_system_score_gemma":0.0023348508,"threshold_uncertainty_score":0.7922861},"labels":[],"label_agreement":null},{"id":"W4205541117","doi":"10.1109/bigdata52589.2021.9671349","title":"Intersection Representation of Big Data Networks and Triangle Counting","year":2021,"lang":"en","type":"article","venue":"2021 IEEE International Conference on Big Data (Big Data)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Intersection (aeronautics); Enumeration; Scalability; Data structure; Representation (politics); Theoretical computer science; Cluster analysis; Set (abstract data type); Enhanced Data Rates for GSM Evolution; Big data; Algorithm; Data mining; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.3391835867248633,"score_gpt":0.38336133464529065,"score_spread":0.044177747920427335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205541117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043044757,0.00023446184,0.9002609,0.0015730102,0.0077124406,0.00047959154,0.02512498,0.00009863072,0.021471212],"genre_scores_gemma":[0.8981417,0.00023395667,0.00087517366,0.00005862444,0.0034979691,0.000008970265,0.09686918,0.000018799337,0.0002956224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973932,0.00016641722,0.00060254696,0.0011425522,0.00048344597,0.00021185161],"domain_scores_gemma":[0.9954107,0.00022904293,0.00045751044,0.0034318638,0.00040178312,0.00006909167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063636585,0.00021679989,0.0003753554,0.00016461419,0.000102011545,0.00034293567,0.002346917,0.00006306468,0.0005238589],"category_scores_gemma":[0.00016655459,0.00023164504,0.00004551303,0.0004018129,0.000095222036,0.0008106986,0.0030109752,0.0003021272,0.000014209352],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100323065,0.00026460583,0.008952423,0.000014712598,0.0006457647,0.000013751585,0.000045720226,0.00013354376,0.0025226614,0.0068943873,0.048539795,0.9318723],"study_design_scores_gemma":[0.0016892754,0.00008101424,0.0029418117,0.00063545484,0.0003972738,0.00001617593,0.0012448147,0.90998316,0.004430056,0.0045126686,0.073315755,0.0007525286],"about_ca_topic_score_codex":0.001341606,"about_ca_topic_score_gemma":0.0012706674,"teacher_disagreement_score":0.9311198,"about_ca_system_score_codex":0.000033909655,"about_ca_system_score_gemma":0.0001897616,"threshold_uncertainty_score":0.9446211},"labels":[],"label_agreement":null},{"id":"W4205591125","doi":"10.2196/preprints.25734","title":"Quantifying the Influence of Delay in Opinion Transmission of COVID-19 Information Propagation: Modeling Study (Preprint)","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"","keywords":"Preprint; Transmission (telecommunications); Computer science; Public opinion; Coronavirus disease 2019 (COVID-19); Information Dissemination; Social media; Interval (graph theory); Telecommunications; World Wide Web; Medicine; Mathematics; Political science; Law","score_opus":0.06576950806805565,"score_gpt":0.348335218894282,"score_spread":0.28256571082622634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205591125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4723986,0.000014289446,0.526043,0.00021516462,0.0000123971395,0.0010532609,0.000004731773,0.000033408975,0.00022514859],"genre_scores_gemma":[0.99689347,0.00001576592,0.0028141376,0.000029531406,0.00002957714,0.00012977033,0.00007856235,0.000008169412,0.0000010192027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979896,0.00019278788,0.0011092456,0.00026088662,0.00033340874,0.00011405946],"domain_scores_gemma":[0.9985857,0.00008939276,0.0005786034,0.00049908005,0.00019169945,0.00005551016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078947673,0.00019244321,0.00042577044,0.0001720437,0.000059275506,0.000038829894,0.00048692708,0.00006430914,0.00006490189],"category_scores_gemma":[0.000028319699,0.00014509234,0.00016018466,0.00036167633,0.00003094725,0.00021554349,0.00047294615,0.00043037726,0.0000014070989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003507176,0.00010873088,0.030848583,0.00023695179,0.00006457012,9.013669e-8,0.0059347535,0.9530901,0.00016588462,0.0032600109,0.0000152297625,0.0062400596],"study_design_scores_gemma":[0.00029314117,0.000048827376,0.0027013572,0.00024926948,0.000044000837,1.1217942e-7,0.0025063031,0.9842291,0.0004863614,0.009162024,0.00010925533,0.00017027304],"about_ca_topic_score_codex":0.004806431,"about_ca_topic_score_gemma":0.00004878007,"teacher_disagreement_score":0.5244948,"about_ca_system_score_codex":0.000049586903,"about_ca_system_score_gemma":0.0002820781,"threshold_uncertainty_score":0.7265918},"labels":[],"label_agreement":null},{"id":"W4205862653","doi":"10.1016/j.joi.2021.101226","title":"Similarity network fusion for scholarly journals","year":2022,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université du Québec à Trois-Rivières","funders":"Institute for New Economic Thinking","keywords":"Modularity (biology); Computer science; Similarity (geometry); Field (mathematics); Exploit; Layer (electronics); Network analysis; Data science; Information retrieval; Social network analysis; Data mining; Artificial intelligence; World Wide Web; Mathematics; Social media; Image (mathematics)","score_opus":0.06518887915472281,"score_gpt":0.3373750823072736,"score_spread":0.27218620315255077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205862653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.929109,0.0028011156,0.049321525,0.005990342,0.00034191782,0.0037135775,0.0011579186,0.00024548732,0.007319147],"genre_scores_gemma":[0.9914098,0.00003821319,0.0054506836,0.000018984292,0.00047152213,0.000010440273,0.00032403134,0.000023368659,0.002252976],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968197,0.00062071293,0.00026485897,0.0005892725,0.0009966324,0.00070884154],"domain_scores_gemma":[0.9975423,0.00026865708,0.00022566596,0.0007812132,0.0010055866,0.00017653655],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0046053967,0.0001609537,0.00038061067,0.00045732473,0.0023213974,0.00010564594,0.0012483931,0.00003663407,0.0018661703],"category_scores_gemma":[0.00008453933,0.00019521062,0.00028890162,0.0015462096,0.00026367346,0.00056996866,0.0016343115,0.001102475,0.000016821588],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007871111,0.0013632332,0.07984398,0.00009706509,0.000747602,0.000034598866,0.0024180776,0.005634384,0.010025813,0.00936547,0.8146127,0.07506998],"study_design_scores_gemma":[0.0012012246,0.0005855787,0.012498952,0.000053666205,0.00009110945,0.0000049180067,0.0031269,0.0014509697,0.0013920976,0.03686878,0.9422578,0.00046799236],"about_ca_topic_score_codex":0.0014793745,"about_ca_topic_score_gemma":0.000058504775,"teacher_disagreement_score":0.12764513,"about_ca_system_score_codex":0.00021822048,"about_ca_system_score_gemma":0.00029693733,"threshold_uncertainty_score":0.99904627},"labels":[],"label_agreement":null},{"id":"W4205969642","doi":"10.1145/3495011","title":"sGrapp: Butterfly Approximation in Streaming Graphs","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Knowledge Discovery from Data","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Bipartite graph; Theoretical computer science; Streaming algorithm; Graph; Mathematics; Upper and lower bounds","score_opus":0.034768323639447415,"score_gpt":0.2913620502884173,"score_spread":0.25659372664896984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205969642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3186788,0.0001851852,0.66899437,0.00020145338,0.00029131983,0.00043840657,0.008857011,0.00014741014,0.0022060168],"genre_scores_gemma":[0.99128985,0.000008632991,0.0022618417,0.000025410502,0.00007788634,0.00020375712,0.005833315,0.00002754909,0.00027174872],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984317,0.00016912825,0.00034169253,0.0006127123,0.00020024207,0.00024453556],"domain_scores_gemma":[0.997589,0.00021625799,0.00009572983,0.0020371282,0.000019239533,0.000042625757],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002256185,0.00020235425,0.0002481447,0.00030618277,0.0003551564,0.000109361725,0.0013791379,0.000023582714,0.001126247],"category_scores_gemma":[0.0000036731317,0.00022571886,0.00012730081,0.0007959368,0.00003814382,0.0007656152,0.00017925518,0.000431032,0.000025761983],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026776153,0.007529104,0.048944194,0.00003366795,0.0010953879,0.000011291012,0.002732551,0.009087197,0.002555304,0.011475436,0.010778426,0.9054897],"study_design_scores_gemma":[0.0076403916,0.0007592749,0.0461773,0.00047027657,0.0018543934,0.0000064366077,0.0163635,0.21653031,0.014497528,0.593302,0.09747471,0.004923868],"about_ca_topic_score_codex":0.0015664075,"about_ca_topic_score_gemma":0.00052877114,"teacher_disagreement_score":0.9005658,"about_ca_system_score_codex":0.00007732025,"about_ca_system_score_gemma":0.000058642458,"threshold_uncertainty_score":0.99978685},"labels":[],"label_agreement":null},{"id":"W4206469886","doi":"10.1145/3487351.3489473","title":"A mathematical model for friend discovery from dynamic social graphs","year":2021,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Computer science; Social network (sociolinguistics); Focus (optics); Dynamic network analysis; Theoretical computer science; Social graph; Big data; Data science; Social media; World Wide Web; Data mining; Computer network","score_opus":0.016146415793862303,"score_gpt":0.2886641858024161,"score_spread":0.2725177700085538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206469886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08751743,0.0000116253295,0.9024339,0.00018542224,0.00000998591,0.0000864915,0.0001605732,0.0000520436,0.009542581],"genre_scores_gemma":[0.9499963,4.9813286e-7,0.046467263,0.000039906008,0.00009063292,0.000061311315,0.00025340993,0.000014877075,0.0030758232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993343,0.000013943549,0.00017382376,0.00021801797,0.000092140755,0.0001678027],"domain_scores_gemma":[0.99963385,0.0000758014,0.00004028321,0.00017663509,0.00004404474,0.000029367506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000041643383,0.000103527425,0.00021226575,0.000021553698,0.00009939378,0.00008808455,0.000098819415,0.000025848016,0.0006699477],"category_scores_gemma":[0.0000021992998,0.00009403055,0.00029289862,0.000101119964,0.000025790223,0.00010224042,0.00007532841,0.00006160047,0.000007766696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068650897,0.00017233845,0.00032640286,0.0000048868637,0.0001828352,5.1496045e-7,0.00023757489,0.00012470176,0.0010434724,0.9885003,0.005158619,0.004241465],"study_design_scores_gemma":[0.00009209043,0.0000021673036,0.000035981477,0.0000032113437,0.000046722667,3.9292434e-8,0.00012368914,0.4453848,0.00038877976,0.55372834,0.00011976555,0.000074394986],"about_ca_topic_score_codex":0.00002306841,"about_ca_topic_score_gemma":0.000044527733,"teacher_disagreement_score":0.86247885,"about_ca_system_score_codex":0.000012683014,"about_ca_system_score_gemma":0.000038662474,"threshold_uncertainty_score":0.7335458},"labels":[],"label_agreement":null},{"id":"W4206524171","doi":"10.1016/j.tcs.2018.07.013","title":"How to choose friends strategically","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Viral marketing; Product (mathematics); Set (abstract data type); Maximization; Computer science; Join (topology); Social network (sociolinguistics); Combinatorics; Alice (programming language); Time complexity; Mathematics; Contrast (vision); Discrete mathematics; Mathematical optimization; Artificial intelligence; Graph; Social media; World Wide Web","score_opus":0.009369950261705692,"score_gpt":0.2678645503272397,"score_spread":0.25849460006553404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206524171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13985565,0.0000011772642,0.829636,0.0008231075,0.0000992824,0.00008782492,0.0000016707529,0.000099357836,0.029395955],"genre_scores_gemma":[0.9278217,5.9582977e-8,0.07088461,0.00026217522,0.00095807965,0.0000066259695,0.0000010355725,0.0000067877727,0.000058918115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985259,0.00003974616,0.0001364315,0.00047718053,0.00036702523,0.0004536947],"domain_scores_gemma":[0.99886775,0.000051984796,0.00003305174,0.00051582605,0.00022736668,0.00030404143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004994809,0.00013627861,0.00016081342,0.000108217624,0.00030271724,0.0005319305,0.0009745036,0.00001685133,0.00067993934],"category_scores_gemma":[0.000006720715,0.000107312415,0.000065410706,0.0010275919,0.0020585833,0.00018861853,0.0005186289,0.00011130764,0.000117693315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044585872,0.000023578548,0.00020613335,3.4407802e-7,0.000005396713,6.2464954e-7,0.00009063685,0.000007704548,0.0006618947,0.9521995,0.00026402925,0.046535667],"study_design_scores_gemma":[0.00013410077,0.00044846965,0.0020612022,0.000019851472,0.000018533803,0.0000019501929,0.00003330284,0.11703734,0.0154728135,0.8614196,0.0029753419,0.000377481],"about_ca_topic_score_codex":0.0000069963944,"about_ca_topic_score_gemma":6.5314543e-7,"teacher_disagreement_score":0.7879661,"about_ca_system_score_codex":0.000026607207,"about_ca_system_score_gemma":0.000062759435,"threshold_uncertainty_score":0.75849366},"labels":[],"label_agreement":null},{"id":"W4206593497","doi":"10.1007/s11042-021-11857-1","title":"The homophily principle in social network analysis: A survey","year":2022,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":93,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; Lakehead University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Homophily; Computer science; Social media; Social network (sociolinguistics); Data science; Sociology; World Wide Web; Social science","score_opus":0.024975376884982727,"score_gpt":0.30090420194153616,"score_spread":0.2759288250565534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206593497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75155985,0.0024996628,0.21349397,0.0037682354,0.00018094348,0.006566176,0.0029963169,0.0005281803,0.018406644],"genre_scores_gemma":[0.99583256,0.000009486503,0.0006302503,0.000031589854,0.00034324898,0.0024180748,0.00052877143,0.00000910037,0.0001969253],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990112,0.00015711496,0.00024216008,0.0002310912,0.00013238177,0.00022600892],"domain_scores_gemma":[0.99920857,0.0003691582,0.000104010396,0.00024954334,0.00003063019,0.00003805914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061900046,0.000093984105,0.00018487795,0.000059152404,0.0012050525,0.00009103,0.00024548595,0.000013652665,0.0001365919],"category_scores_gemma":[0.000003588642,0.00008168359,0.000102897335,0.0014851306,0.000059765352,0.000034485725,0.00023043968,0.00019895557,0.0000037584884],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015189614,0.00020490521,0.77989036,0.0000013352917,0.00044673643,2.954673e-7,0.00022451938,0.005312291,0.000017369608,0.054183487,0.004649101,0.1550544],"study_design_scores_gemma":[0.00020796328,0.000009143113,0.7678147,7.203829e-7,0.00014742598,1.18225984e-7,0.00016456954,0.035766542,0.0000035766916,0.012300312,0.18340728,0.00017769175],"about_ca_topic_score_codex":0.00042704737,"about_ca_topic_score_gemma":0.00049903896,"teacher_disagreement_score":0.24427268,"about_ca_system_score_codex":0.000025222404,"about_ca_system_score_gemma":0.00002548045,"threshold_uncertainty_score":0.92684114},"labels":[],"label_agreement":null},{"id":"W4206923042","doi":"10.1111/coin.12502","title":"A deep learning and heuristic methodology for predicting breakups in social network structures","year":2022,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Breakup; Artificial intelligence; Heuristic; False positive paradox; Statement (logic); Scripting language; Social network (sociolinguistics); Machine learning; Social psychology; Psychology; Social media; Epistemology; World Wide Web","score_opus":0.04982887560549292,"score_gpt":0.36071245255421003,"score_spread":0.3108835769487171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206923042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018182,0.00022373945,0.98099095,0.00005680013,0.000054869477,0.0001587381,0.000004857828,0.00003462064,0.00029343765],"genre_scores_gemma":[0.92341983,0.0000010659775,0.07599859,0.000037044345,0.00032683864,0.00010047312,0.00006798575,0.000010143379,0.000038017923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989531,0.0002505462,0.0002526996,0.00022657478,0.00010923969,0.00020784778],"domain_scores_gemma":[0.99856913,0.0011985343,0.0001227782,0.00003518012,0.000051742107,0.000022625489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005197282,0.00009102314,0.00018186665,0.0000739667,0.00054366235,0.000026144195,0.00011611158,0.000015042152,0.00022319623],"category_scores_gemma":[0.000028747578,0.00010700496,0.00005987859,0.00024804947,0.000048202863,0.000027977601,0.0001888058,0.00024108276,3.554779e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018290812,0.0000123050395,0.031736195,0.0000043232258,0.0000270897,5.053816e-7,0.00039060996,0.74610466,0.000002946099,0.15421025,0.00009590251,0.067396924],"study_design_scores_gemma":[0.000041822095,0.000030759154,0.003944554,0.0000027728329,0.000011035613,0.0000019190647,0.00034464317,0.5115065,0.000005595506,0.4834729,0.0005668545,0.00007061069],"about_ca_topic_score_codex":0.000048699254,"about_ca_topic_score_gemma":0.000008421352,"teacher_disagreement_score":0.90523785,"about_ca_system_score_codex":0.000031246447,"about_ca_system_score_gemma":0.000024008787,"threshold_uncertainty_score":0.4363536},"labels":[],"label_agreement":null},{"id":"W4206988418","doi":"10.1093/comnet/cnac003","title":"An empirical comparison of connectivity-based distances on a graph and their computational scalability","year":2021,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Jaccard index; Pairwise comparison; Vertex (graph theory); Computer science; Distance matrix; Scalability; Geodesic; Computation; Neighbourhood (mathematics); Cluster analysis; Inverse; Cluster (spacecraft); Distance; Mathematics; Shortest path problem; Theoretical computer science; Algorithm; Graph; Artificial intelligence","score_opus":0.031846712804735285,"score_gpt":0.34889928119773794,"score_spread":0.31705256839300267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206988418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50472754,0.00019819956,0.4945382,0.00017691434,0.00004060489,0.000050399696,0.000012779529,0.000010830723,0.0002445371],"genre_scores_gemma":[0.992229,0.0000024837245,0.007304595,0.000110690635,0.00029207693,0.0000021066164,0.000045597553,0.000012114359,0.0000013225778],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981964,0.00040529546,0.00072874327,0.000213499,0.0002696832,0.00018635615],"domain_scores_gemma":[0.9975925,0.000879531,0.0006543565,0.00024665467,0.00048813884,0.00013878918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047275866,0.000188153,0.0007327402,0.000102693186,0.00012433178,0.00006425818,0.00019360307,0.000045608427,0.00017078668],"category_scores_gemma":[0.000012159648,0.00015193589,0.0002914773,0.00038753156,0.00019595084,0.00010518007,0.000036808797,0.00036796945,1.8698758e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001699203,0.0011986762,0.53780586,0.000011409143,0.0001949859,0.0000024709545,0.0001448393,0.43272966,0.00013548408,0.0041100695,0.001684708,0.021811897],"study_design_scores_gemma":[0.00070431235,0.00047621204,0.18943682,0.00009358854,0.00006747031,0.000004636826,0.00031133392,0.7621193,0.0005000669,0.04503292,0.001063175,0.00019013896],"about_ca_topic_score_codex":0.000008756249,"about_ca_topic_score_gemma":0.000021267142,"teacher_disagreement_score":0.48750147,"about_ca_system_score_codex":0.000025761885,"about_ca_system_score_gemma":0.0001005918,"threshold_uncertainty_score":0.6195766},"labels":[],"label_agreement":null},{"id":"W4207043199","doi":"10.33889/ijmems.2022.7.1.003","title":"Exploration of Network Theory to Evaluate Organizational Resilience","year":2022,"lang":"en","type":"article","venue":"International Journal of Mathematical Engineering and Management Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Organizational network analysis; Telecommunications network; Organizational communication; Robustness (evolution); Resilience (materials science); Communication theory; Network theory; Computer science; Organizational structure; Organizational theory; Knowledge management; Communications system; Emergency management; Telecommunications; Organizational learning; Management","score_opus":0.014434834334095746,"score_gpt":0.2797710772171248,"score_spread":0.26533624288302904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207043199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03639142,0.00003094134,0.9607866,0.0004677539,0.00014015038,0.00007108536,0.0000017466356,0.000008693373,0.0021016258],"genre_scores_gemma":[0.95788944,0.0000053793933,0.04185675,0.00003209395,0.00010147284,0.000007652813,9.232153e-7,0.000003356865,0.0001029297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990394,0.00002805125,0.0002599063,0.00007321447,0.0005277875,0.00007164577],"domain_scores_gemma":[0.9996028,0.000098918164,0.00013078378,0.000044612785,0.00009280473,0.000030093279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011282349,0.000048906637,0.00009707601,0.00015730191,0.00006458632,0.00003187645,0.00031947464,0.0000032904907,0.00032494086],"category_scores_gemma":[0.000024587433,0.000041794854,0.000034905966,0.00027190708,0.000029394621,0.0001382982,0.00019671992,0.00004872422,0.0000010032123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065372624,0.000032707496,0.00021261793,0.0000048220136,0.000063085274,0.0000010877935,0.00013393554,0.3902794,0.00007394513,0.60623354,0.00038054943,0.0025777826],"study_design_scores_gemma":[0.0002910664,0.00020988366,0.0007414547,0.00015435925,0.000079529906,0.00001221067,0.0010928467,0.15215379,0.00036810478,0.8408915,0.0038366334,0.00016862804],"about_ca_topic_score_codex":7.98916e-7,"about_ca_topic_score_gemma":4.323551e-8,"teacher_disagreement_score":0.921498,"about_ca_system_score_codex":0.000016003223,"about_ca_system_score_gemma":0.000011596571,"threshold_uncertainty_score":0.35578746},"labels":[],"label_agreement":null},{"id":"W4207069029","doi":"10.4236/am.2022.131007","title":"Solving Electrical Circuits via Graph Theory","year":2022,"lang":"en","type":"article","venue":"Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Simple (philosophy); Electronic circuit; Electrical network; Computer science; Set (abstract data type); Graph; Graph theory; Network analysis; Theoretical computer science; Mathematics; Electrical engineering; Engineering; Programming language; Epistemology","score_opus":0.009886767753297861,"score_gpt":0.23027217755011814,"score_spread":0.22038540979682028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207069029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01869302,0.000043277327,0.8750291,0.00002061805,0.000028805338,0.00030496233,0.000005559471,0.00021728434,0.10565737],"genre_scores_gemma":[0.98611367,7.975687e-7,0.013160989,0.000072562165,0.00011378697,0.0002594635,0.000024302726,0.000033490756,0.00022096513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895203,0.000030539293,0.0002703353,0.00020715751,0.00026248684,0.000277423],"domain_scores_gemma":[0.9992096,0.00020413182,0.00014328031,0.00037573185,0.000017829867,0.00004945518],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042036595,0.00014787502,0.00024787727,0.00010113598,0.00032292638,0.000030765605,0.00032171753,0.000016440597,0.0020095578],"category_scores_gemma":[0.0000023192063,0.00015207409,0.00013543505,0.00045700243,0.000028334727,0.000022330261,0.00022627655,0.00027079575,0.000034065946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018730557,0.00022914572,0.00012397516,0.000007505231,0.00009321999,7.602745e-7,0.0003926962,0.00010352656,0.0027483655,0.96152294,0.002086548,0.03268945],"study_design_scores_gemma":[0.00012640812,0.00001812545,0.000015172634,0.0000027010553,0.00007820977,0.0000031064214,0.00032550737,0.005307733,0.00128771,0.99069875,0.0019324551,0.00020410698],"about_ca_topic_score_codex":0.000004617311,"about_ca_topic_score_gemma":2.6692226e-7,"teacher_disagreement_score":0.96742064,"about_ca_system_score_codex":0.00003648489,"about_ca_system_score_gemma":0.00002098683,"threshold_uncertainty_score":0.99890274},"labels":[],"label_agreement":null},{"id":"W4210242106","doi":"10.1016/j.cnsns.2022.106312","title":"Impact of co-evolution of negative vaccine-related information, vaccination behavior and epidemic spreading in multilayer networks","year":2022,"lang":"en","type":"article","venue":"Communications in Nonlinear Science and Numerical Simulation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Tianjin Research Innovation Project for Postgraduate Students; National Natural Science Foundation of China","keywords":"Vaccination; Epidemic model; Herd immunity; Markov chain; Herd behavior; Diffusion; Computer science; Econometrics; Medicine; Environmental health; Mathematics; Virology; Statistics; Geography; Physics","score_opus":0.01963418131141332,"score_gpt":0.3639152388151148,"score_spread":0.34428105750370147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210242106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9711098,0.00007678807,0.028275236,0.00003503591,0.000008770549,0.00031369753,0.0000134671745,0.000010232582,0.00015697119],"genre_scores_gemma":[0.9970029,0.000013608541,0.0028759504,0.0000034934233,0.0000047055737,0.00003845788,0.00005665811,0.000003268229,9.536914e-7],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989323,0.00014339101,0.00051527756,0.000121387304,0.00016997919,0.00011768011],"domain_scores_gemma":[0.99876815,0.0003620552,0.0003225787,0.00031972709,0.00019758973,0.000029880495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087894604,0.00007491065,0.00018154197,0.00042873467,0.00020112637,0.00001536063,0.0002766523,0.000022004908,0.000038535192],"category_scores_gemma":[0.00009705067,0.00007610777,0.000035027548,0.0018305572,0.00010260493,0.00058328145,0.00027649588,0.00020584997,1.9209537e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012431102,0.0001133745,0.65633637,0.000001362343,0.0000044238095,1.4015545e-8,0.00041756398,0.3124679,0.00015808153,0.00077143044,0.000001938414,0.029715098],"study_design_scores_gemma":[0.0002117489,0.000032375196,0.4241455,0.000006003003,0.0000064653127,1.4252184e-7,0.00014130342,0.5749057,0.000018229766,0.0004841819,0.000008800716,0.00003954588],"about_ca_topic_score_codex":0.0011740822,"about_ca_topic_score_gemma":0.000013797333,"teacher_disagreement_score":0.2624378,"about_ca_system_score_codex":0.00021079522,"about_ca_system_score_gemma":0.000076756805,"threshold_uncertainty_score":0.3103585},"labels":[],"label_agreement":null},{"id":"W4210291257","doi":"10.32920/19071809.v1","title":"Iterated Models for Social Networks","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Toronto Metropolitan University","funders":"","keywords":"Iterated function; Mathematics; Cardinality (data modeling); Combinatorics; Graph; Discrete mathematics; Transitive relation; Computer science","score_opus":0.041748778158397934,"score_gpt":0.3142260809157091,"score_spread":0.27247730275731114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210291257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009620433,0.000055894114,0.95060426,0.00013772506,0.00017116523,0.0006209671,0.0001299634,0.0002484112,0.047069542],"genre_scores_gemma":[0.98342067,0.00000265504,0.0073727914,0.00009916601,0.0016540036,0.0012194025,0.0028029515,0.00005219031,0.0033761691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987155,0.000060749506,0.00032714504,0.0004634652,0.0001375213,0.00029560344],"domain_scores_gemma":[0.9992599,0.000055564287,0.00019764045,0.00034617737,0.00010122579,0.000039512943],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019019548,0.0002632418,0.00043681203,0.000080498176,0.0002847231,0.00013774983,0.00042455198,0.00009398039,0.0043762373],"category_scores_gemma":[4.9443497e-7,0.00027758456,0.00055865955,0.00014397278,0.00001988842,0.00004169705,0.0010605346,0.0005395565,0.0000013240772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002083521,0.000100333426,0.00035522023,0.00001406816,0.0004902812,2.9110677e-7,0.00012393657,0.63165677,0.00000203151,0.21319702,0.13880958,0.01522961],"study_design_scores_gemma":[0.00010312401,0.000009029855,0.000013697093,0.0000052762293,0.00009570551,2.1452276e-8,0.000037499947,0.7519756,0.000007966712,0.23342665,0.014073588,0.00025184028],"about_ca_topic_score_codex":0.00024412986,"about_ca_topic_score_gemma":0.0000064488986,"teacher_disagreement_score":0.98245865,"about_ca_system_score_codex":0.000057953424,"about_ca_system_score_gemma":0.000063366,"threshold_uncertainty_score":0.99996763},"labels":[],"label_agreement":null},{"id":"W4210399325","doi":"10.1016/j.dajour.2022.100027","title":"Common-knowledge networks for university strategic research planning","year":2022,"lang":"en","type":"article","venue":"Decision Analytics Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Foundation for Innovation; Ontario Research Foundation","keywords":"Multidisciplinary approach; Heuristic; Knowledge management; Similarity (geometry); Cluster analysis; Collaborative network; Measure (data warehouse); Institution; Scale (ratio); Computer science; Knowledge flow; Data science; Sociology; Data mining; Geography; Artificial intelligence; Social science","score_opus":0.14622862243805745,"score_gpt":0.41252773549497757,"score_spread":0.2662991130569201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210399325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062656134,0.00026693885,0.9156011,0.00009961313,0.00023217015,0.00019125384,0.000026306847,0.00003538418,0.020891096],"genre_scores_gemma":[0.9932785,0.000009349409,0.0051125754,0.000013576588,0.00049928256,0.0000033378915,0.000029008188,0.000019166198,0.0010351769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981674,0.00034253774,0.00034027098,0.00023451232,0.0004874485,0.0004278146],"domain_scores_gemma":[0.99805504,0.0009028388,0.00017909512,0.00029580825,0.00038247168,0.0001847447],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026917667,0.000127832,0.0002752384,0.0005447053,0.0020779164,0.00019163838,0.0007239221,0.000029761179,0.0016689894],"category_scores_gemma":[0.000009194982,0.00013238561,0.00031444003,0.0010958129,0.000045783145,0.00008359561,0.0004439856,0.0011571642,0.0000066476955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048230772,0.00053871074,0.030557165,0.000004152875,0.00055217656,0.000104487786,0.0004306061,0.38379818,0.000032118915,0.1754705,0.29289776,0.11513183],"study_design_scores_gemma":[0.00079365645,0.00021097435,0.00048787732,0.000028701326,0.000090849935,0.000020901582,0.004261039,0.6920719,0.0000075143366,0.1640253,0.13777192,0.00022934355],"about_ca_topic_score_codex":0.000015182739,"about_ca_topic_score_gemma":0.000007824881,"teacher_disagreement_score":0.9306224,"about_ca_system_score_codex":0.00021726638,"about_ca_system_score_gemma":0.00015701966,"threshold_uncertainty_score":0.9992436},"labels":[],"label_agreement":null},{"id":"W4210428184","doi":"10.36227/techrxiv.19069553","title":"Cooperation and Competition Coupled Diffusion of Multi-Feature on Multiplex Networks and its Control","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Qilu University of Technology; Shandong Academy of Sciences; Natural Science Foundation of Shandong Province; National Natural Science Foundation of China; CancerCare Manitoba Foundation","keywords":"Diffusion; Competition (biology); Feature (linguistics); Computer science; Mathematical optimization; Control (management); Mathematics; Artificial intelligence; Physics","score_opus":0.01224993257380087,"score_gpt":0.25904925237938037,"score_spread":0.2467993198055795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210428184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70705104,0.00076361565,0.2890754,0.0002248154,0.00015098283,0.001652054,0.00017745692,0.0001387619,0.0007658784],"genre_scores_gemma":[0.9972264,0.0001266903,0.0009227014,0.00007062282,0.00018155374,0.00013332724,0.0009539649,0.000025012308,0.00035973568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987492,0.00013989286,0.00031544935,0.0004681907,0.00016873515,0.0001585459],"domain_scores_gemma":[0.9990944,0.00014424621,0.0002860331,0.00028261298,0.00012827214,0.00006441829],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018921838,0.00028953448,0.00053924083,0.000110794936,0.00016912719,0.00005911133,0.00012469236,0.00012877239,0.00059515866],"category_scores_gemma":[0.0000058019377,0.00026632057,0.0001123737,0.00009551666,0.000040900155,0.00003814702,0.00043300664,0.0006001558,4.4368082e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001326692,0.002657323,0.11915271,0.00044044948,0.0019887881,0.0000070977326,0.000770395,0.62051904,0.020845061,0.19888636,0.0035551365,0.029850971],"study_design_scores_gemma":[0.0011990343,0.00007962766,0.010706091,0.00008542873,0.00012581937,2.1410844e-7,0.000050539205,0.9866574,0.00012731421,0.0003908945,0.00032518903,0.0002524805],"about_ca_topic_score_codex":0.0002471891,"about_ca_topic_score_gemma":0.000054071406,"teacher_disagreement_score":0.36613834,"about_ca_system_score_codex":0.000028249902,"about_ca_system_score_gemma":0.000020540281,"threshold_uncertainty_score":0.9999789},"labels":[],"label_agreement":null},{"id":"W4210551655","doi":"10.1007/s41870-022-00873-5","title":"Assessing the impact of the density and sparsity of the network on community detection using a Gaussian mixture random partition graph generator","year":2022,"lang":"en","type":"article","venue":"International Journal of Information Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Gaussian; Similarity (geometry); Generator (circuit theory); Partition (number theory); Mutual information; Data mining; Random graph; Algorithm; Community structure; Graph; Graph partition; Pattern recognition (psychology); Artificial intelligence; Theoretical computer science; Mathematics; Statistics","score_opus":0.012432865983533655,"score_gpt":0.28789009093949175,"score_spread":0.2754572249559581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210551655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9637931,0.00001336449,0.035445668,0.0003796376,0.00017161472,0.000098425946,0.000009404091,0.00000644243,0.00008234419],"genre_scores_gemma":[0.9996274,0.0000024451506,0.0002492194,0.000044155797,0.00006802576,0.000002831705,0.0000027158887,0.0000024265385,7.86193e-7],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99893093,0.00028178023,0.0004169146,0.000029803596,0.0002700425,0.00007053116],"domain_scores_gemma":[0.99817413,0.00008164076,0.0012370638,0.00018693139,0.00030963984,0.000010565698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070439454,0.00006991429,0.00014384137,0.00013981794,0.00046198443,0.000039615126,0.00049082213,0.000032029027,0.000022385608],"category_scores_gemma":[0.00003691884,0.000038118986,0.00020323021,0.00040394743,0.00012604323,0.0002673783,0.00026746333,0.0005808991,6.379894e-8],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031920493,0.00020090397,0.74907947,0.000008127019,0.0010984502,4.6133442e-7,0.0011643532,0.18296853,0.010775779,0.013704313,0.00066656066,0.04001387],"study_design_scores_gemma":[0.0026669046,0.0004316529,0.6591103,0.0002497872,0.00030963105,0.00025202372,0.0040592337,0.07358849,0.098973855,0.15950501,0.00058319024,0.0002699214],"about_ca_topic_score_codex":0.00021305046,"about_ca_topic_score_gemma":0.000016671362,"teacher_disagreement_score":0.1458007,"about_ca_system_score_codex":0.00009932348,"about_ca_system_score_gemma":0.00006151412,"threshold_uncertainty_score":0.35532573},"labels":[],"label_agreement":null},{"id":"W4210619106","doi":"10.1109/cdc45484.2021.9683048","title":"Large Scale Systems and SIR Models: A Featured Graphon Approach","year":2021,"lang":"en","type":"article","venue":"2021 60th IEEE Conference on Decision and Control (CDC)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Adjacency matrix; Graph; Computer science; Adjacency list; Limiting; Computation; Vertex (graph theory); Convergence (economics); Sequence (biology); Theoretical computer science; Random graph; Limit (mathematics); Discrete mathematics; Combinatorics; Mathematics; Algorithm","score_opus":0.02338660034588295,"score_gpt":0.260094600701532,"score_spread":0.23670800035564907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210619106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1712459,0.0028024933,0.8018535,0.0002928894,0.00028218748,0.0006334727,0.0001827977,0.00009919378,0.022607606],"genre_scores_gemma":[0.9970182,0.00022932359,0.0011891188,0.00014577353,0.00020172958,0.000092230985,0.000051398005,0.000023102757,0.0010490986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796385,0.00018179913,0.0003845204,0.00073052855,0.00035636328,0.00038295702],"domain_scores_gemma":[0.9986133,0.00018030682,0.00014164232,0.00055679167,0.00028719864,0.0002207614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003321354,0.0003156708,0.00066661293,0.00013589636,0.0002315459,0.00044917056,0.00019130971,0.00011559539,0.00021314115],"category_scores_gemma":[0.000010478356,0.00027122535,0.00017115661,0.00032494866,0.000063082975,0.00015376053,0.00009169336,0.0003093919,0.0000111859845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009910299,0.0020629987,0.012778619,0.00010884308,0.001216067,0.00007691022,0.0015917935,0.0026663372,0.008120912,0.51959693,0.022903297,0.42788628],"study_design_scores_gemma":[0.00433988,0.00013308763,0.0013773848,0.00027654087,0.00022376994,0.000012335757,0.0020855635,0.9326297,0.00038947596,0.052180625,0.0056657107,0.0006859],"about_ca_topic_score_codex":0.000058980164,"about_ca_topic_score_gemma":0.000033121112,"teacher_disagreement_score":0.9299634,"about_ca_system_score_codex":0.000016051943,"about_ca_system_score_gemma":0.00008388359,"threshold_uncertainty_score":0.999974},"labels":[],"label_agreement":null},{"id":"W4210677012","doi":"10.32920/19071809","title":"Iterated Models for Social Networks","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Toronto Metropolitan University","funders":"","keywords":"Iterated function; Mathematics; Combinatorics; Cardinality (data modeling); Graph; Discrete mathematics; Transitive relation; Computer science","score_opus":0.041748778158397934,"score_gpt":0.3142260809157091,"score_spread":0.27247730275731114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210677012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009620433,0.000055894114,0.95060426,0.00013772506,0.00017116523,0.0006209671,0.0001299634,0.0002484112,0.047069542],"genre_scores_gemma":[0.98342067,0.00000265504,0.0073727914,0.00009916601,0.0016540036,0.0012194025,0.0028029515,0.00005219031,0.0033761691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987155,0.000060749506,0.00032714504,0.0004634652,0.0001375213,0.00029560344],"domain_scores_gemma":[0.9992599,0.000055564287,0.00019764045,0.00034617737,0.00010122579,0.000039512943],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019019548,0.0002632418,0.00043681203,0.000080498176,0.0002847231,0.00013774983,0.00042455198,0.00009398039,0.0043762373],"category_scores_gemma":[4.9443497e-7,0.00027758456,0.00055865955,0.00014397278,0.00001988842,0.00004169705,0.0010605346,0.0005395565,0.0000013240772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002083521,0.000100333426,0.00035522023,0.00001406816,0.0004902812,2.9110677e-7,0.00012393657,0.63165677,0.00000203151,0.21319702,0.13880958,0.01522961],"study_design_scores_gemma":[0.00010312401,0.000009029855,0.000013697093,0.0000052762293,0.00009570551,2.1452276e-8,0.000037499947,0.7519756,0.000007966712,0.23342665,0.014073588,0.00025184028],"about_ca_topic_score_codex":0.00024412986,"about_ca_topic_score_gemma":0.0000064488986,"teacher_disagreement_score":0.98245865,"about_ca_system_score_codex":0.000057953424,"about_ca_system_score_gemma":0.000063366,"threshold_uncertainty_score":0.99996763},"labels":[],"label_agreement":null},{"id":"W4210803304","doi":"10.1016/j.neunet.2022.01.014","title":"Signed network representation with novel node proximity evaluation","year":2022,"lang":"en","type":"article","venue":"Neural Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Node (physics); Representation (politics); Computer science; Metric (unit); Enhanced Data Rates for GSM Evolution; Key (lock); Sign (mathematics); Theoretical computer science; Code (set theory); Data mining; Topology (electrical circuits); Artificial intelligence; Algorithm; Mathematics","score_opus":0.026727508421042573,"score_gpt":0.28596421299512403,"score_spread":0.25923670457408143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210803304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21510911,0.00016804245,0.7745532,0.0004894642,0.00036748833,0.0016705967,0.00001984886,0.00034220697,0.0072800326],"genre_scores_gemma":[0.9956194,6.260765e-7,0.0019089957,0.00020824926,0.0010754867,0.00060974,0.00041515994,0.00003436001,0.0001279545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798894,0.00028048686,0.00029512527,0.00045425617,0.000582743,0.0003984685],"domain_scores_gemma":[0.99897724,0.000105254054,0.00025629584,0.00046319992,0.0001291239,0.00006885912],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00054996414,0.00020111674,0.00024635968,0.000052364096,0.0005887581,0.00007278686,0.0002639954,0.0000255887,0.0013989181],"category_scores_gemma":[0.000003420364,0.00019014825,0.00012503786,0.00086582743,0.000039707884,0.00019338467,0.00021433047,0.00041202272,0.0000014187686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082393744,0.00009742949,0.044265024,9.129807e-7,0.000069097594,9.607569e-7,0.00003600275,0.9255746,0.00005021188,0.0013839608,0.0062718983,0.022167519],"study_design_scores_gemma":[0.00059469504,0.000106599575,0.005434088,0.0000056813515,0.00014231111,0.0000028546365,0.00006688036,0.9902211,0.000028766333,0.002156825,0.0010083901,0.00023185101],"about_ca_topic_score_codex":0.00018302887,"about_ca_topic_score_gemma":0.00002597693,"teacher_disagreement_score":0.7805103,"about_ca_system_score_codex":0.00008380531,"about_ca_system_score_gemma":0.000036693076,"threshold_uncertainty_score":0.9995139},"labels":[],"label_agreement":null},{"id":"W4210833968","doi":"10.1007/978-1-4614-6170-8_100924","title":"Multidimensional Social Networks","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Sociology; Psychology","score_opus":0.012359451062744052,"score_gpt":0.23978045740485232,"score_spread":0.22742100634210827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210833968","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036106317,0.000030846884,0.24867809,0.00005101154,0.00006312561,0.00009475001,0.0000064356755,0.00011742586,0.7509547],"genre_scores_gemma":[0.09976907,0.0000030988783,0.002212645,0.00015850358,0.0040586656,0.000010955069,0.0003862817,0.000075365155,0.8933254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989086,0.000013570336,0.00030148673,0.0003476233,0.00020318649,0.00022556074],"domain_scores_gemma":[0.99932,0.000061701714,0.00019849997,0.00027188385,0.000085809,0.00006214313],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000103071594,0.00033092662,0.00047075396,0.0000735222,0.00015248008,0.000026620639,0.00016947248,0.00016886945,0.01943754],"category_scores_gemma":[3.4816253e-7,0.00031054483,0.00047254763,0.000018549812,0.000067402754,0.000016567266,0.00016609307,0.0003937425,0.00028838008],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024523542,0.000006197686,0.000046891513,0.0000011293644,0.00016042354,4.6726285e-7,0.000003333824,0.00009480541,9.752587e-7,0.8226401,0.1471202,0.029923016],"study_design_scores_gemma":[0.000115686475,0.000012603478,0.000026871046,0.000024797737,0.00013709988,2.1093501e-7,0.000001387177,0.011798434,0.0000054968864,0.07472137,0.9127228,0.00043323214],"about_ca_topic_score_codex":0.000037900365,"about_ca_topic_score_gemma":0.0000070047968,"teacher_disagreement_score":0.7656026,"about_ca_system_score_codex":0.000023922385,"about_ca_system_score_gemma":0.000022852882,"threshold_uncertainty_score":0.9999347},"labels":[],"label_agreement":null},{"id":"W4210974481","doi":"10.32920/ryerson.14657931.v1","title":"Re-ranking the Twitter search result","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Ranking (information retrieval); Computer science; Rank (graph theory); Set (abstract data type); Information retrieval; Outlier; Limit (mathematics); Test (biology); Social media; Learning to rank; World Wide Web; Artificial intelligence; Mathematics","score_opus":0.04831853456467021,"score_gpt":0.3252501068925958,"score_spread":0.2769315723279256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210974481","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18932487,0.00031984015,0.25360355,0.006695209,0.00033381148,0.0007813854,0.000017868975,0.0003591225,0.5485643],"genre_scores_gemma":[0.98992723,0.000008488658,0.004168915,0.00028230055,0.0010453167,0.000069684975,0.00019211156,0.000027800943,0.0042781755],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983979,0.00019017012,0.0003180279,0.000492769,0.00031455272,0.0002866055],"domain_scores_gemma":[0.9982948,0.00013530641,0.00010104009,0.0012678474,0.00015970804,0.000041321124],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00049336714,0.00023028161,0.0003206326,0.00006059173,0.00015616202,0.0004178842,0.0006605849,0.000078460056,0.004933424],"category_scores_gemma":[0.0000030972585,0.00015658281,0.00040144374,0.00019706252,0.000053878346,0.00003010325,0.001903901,0.0010124272,0.000029642111],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005638809,0.0006585281,0.13155787,0.00020222955,0.0055702864,0.00004650593,0.0124986265,0.015210007,0.0009010802,0.07653198,0.55016553,0.20660098],"study_design_scores_gemma":[0.0019138117,0.00012227411,0.02761173,0.0028137737,0.0025837226,0.000004337272,0.038561206,0.18040776,0.05303648,0.36882785,0.31678152,0.007335516],"about_ca_topic_score_codex":0.0022206607,"about_ca_topic_score_gemma":0.00011604427,"teacher_disagreement_score":0.8006023,"about_ca_system_score_codex":0.00003512078,"about_ca_system_score_gemma":0.00009933301,"threshold_uncertainty_score":0.9959762},"labels":[],"label_agreement":null},{"id":"W4211016178","doi":"10.32920/ryerson.14657931","title":"Re-ranking the Twitter search result","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Ranking (information retrieval); Computer science; Rank (graph theory); Set (abstract data type); Information retrieval; Outlier; Limit (mathematics); Test (biology); Learning to rank; Social media; Data mining; World Wide Web; Artificial intelligence; Mathematics","score_opus":0.04831853456467021,"score_gpt":0.3252501068925958,"score_spread":0.2769315723279256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211016178","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18932487,0.00031984015,0.25360355,0.006695209,0.00033381148,0.0007813854,0.000017868975,0.0003591225,0.5485643],"genre_scores_gemma":[0.98992723,0.000008488658,0.004168915,0.00028230055,0.0010453167,0.000069684975,0.00019211156,0.000027800943,0.0042781755],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983979,0.00019017012,0.0003180279,0.000492769,0.00031455272,0.0002866055],"domain_scores_gemma":[0.9982948,0.00013530641,0.00010104009,0.0012678474,0.00015970804,0.000041321124],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00049336714,0.00023028161,0.0003206326,0.00006059173,0.00015616202,0.0004178842,0.0006605849,0.000078460056,0.004933424],"category_scores_gemma":[0.0000030972585,0.00015658281,0.00040144374,0.00019706252,0.000053878346,0.00003010325,0.001903901,0.0010124272,0.000029642111],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005638809,0.0006585281,0.13155787,0.00020222955,0.0055702864,0.00004650593,0.0124986265,0.015210007,0.0009010802,0.07653198,0.55016553,0.20660098],"study_design_scores_gemma":[0.0019138117,0.00012227411,0.02761173,0.0028137737,0.0025837226,0.000004337272,0.038561206,0.18040776,0.05303648,0.36882785,0.31678152,0.007335516],"about_ca_topic_score_codex":0.0022206607,"about_ca_topic_score_gemma":0.00011604427,"teacher_disagreement_score":0.8006023,"about_ca_system_score_codex":0.00003512078,"about_ca_system_score_gemma":0.00009933301,"threshold_uncertainty_score":0.9959762},"labels":[],"label_agreement":null},{"id":"W4211169459","doi":"10.2200/s00928ed1v01y201906dtm061","title":"Community Search over Big Graphs","year":2019,"lang":"en","type":"article","venue":"Synthesis lectures on data management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Simple (philosophy); Big data; Data science; Theoretical computer science; Data mining; Epistemology","score_opus":0.04453751509950703,"score_gpt":0.3008058352079312,"score_spread":0.25626832010842415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211169459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6115687,0.0001018762,0.015259512,0.00074077805,0.00029309487,0.0016216015,0.00052761676,0.00045291884,0.3694339],"genre_scores_gemma":[0.99747854,0.000013677236,0.00091129553,0.00022342836,0.00009462039,0.000042737858,0.0003723738,0.000029221857,0.00083407806],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99830544,0.0003450525,0.00020988543,0.0004380744,0.00036718886,0.00033435563],"domain_scores_gemma":[0.9961081,0.00026323713,0.00006947351,0.0034806044,0.000020276671,0.00005832053],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007004587,0.00022269615,0.00026727043,0.00023789577,0.00021165771,0.00014102882,0.0018485112,0.00002850192,0.0026185766],"category_scores_gemma":[0.0000069951616,0.00019380836,0.00011626192,0.00035341457,0.000042434367,0.00011271516,0.0014895629,0.0003623681,0.00027771032],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000960828,0.00085910445,0.03207347,0.00011782232,0.0019042887,0.000004880302,0.00011829829,0.0006635907,0.00025957258,0.11163558,0.12854294,0.72372437],"study_design_scores_gemma":[0.0014155649,0.00031468642,0.15436594,0.00057495513,0.0011633405,8.6579286e-7,0.0013427815,0.012202133,0.013803349,0.0889413,0.7234346,0.0024404672],"about_ca_topic_score_codex":0.00091096555,"about_ca_topic_score_gemma":0.00006248473,"teacher_disagreement_score":0.7212839,"about_ca_system_score_codex":0.0000321643,"about_ca_system_score_gemma":0.00000919868,"threshold_uncertainty_score":0.99829316},"labels":[],"label_agreement":null},{"id":"W4212800683","doi":"10.31730/osf.io/54qrz","title":"The Importance of Representing the Physical Universe or Virtual Universes in Functional State Space to the Progress of Physics","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Alberta","keywords":"Universe; Representation (politics); Object (grammar); Space (punctuation); Physical system; Virtual reality; Physical law; Metaverse; Physics; Theoretical physics; Computer science; Cognitive science; Human–computer interaction; Data science; Epistemology; Artificial intelligence; Psychology; Astronomy; Philosophy","score_opus":0.024166907391541422,"score_gpt":0.2924854944633353,"score_spread":0.2683185870717939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212800683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96488464,0.00007345611,0.018073363,0.0026254815,0.00022617204,0.0017478176,0.00018608177,0.000074401796,0.012108594],"genre_scores_gemma":[0.996482,0.000011340777,0.00024598473,0.000015856023,0.00024762438,0.00008920288,0.00003768353,0.000020331277,0.0028499658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982766,0.00026430812,0.00037281192,0.00038248862,0.00046141312,0.00024240813],"domain_scores_gemma":[0.9976116,0.0005746456,0.00057923875,0.0010487112,0.00015607166,0.000029722205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048690772,0.0002241599,0.00036885566,0.00004961412,0.00024399918,0.000043390864,0.0009203475,0.000021703463,0.00027623074],"category_scores_gemma":[0.000012780763,0.00011388291,0.000317869,0.0006704844,0.0002915407,0.000053263062,0.002849872,0.0006089519,0.0000012988293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056542497,0.00077657227,0.108260795,0.000040875042,0.0012412807,0.000006985151,0.0043960107,0.30066505,0.0001301252,0.5086164,0.01580326,0.059497267],"study_design_scores_gemma":[0.0028936812,0.0010199604,0.06881144,0.0008341006,0.0017713711,0.000002781093,0.13425443,0.33629593,0.016964845,0.2854342,0.14833872,0.0033785717],"about_ca_topic_score_codex":0.000778288,"about_ca_topic_score_gemma":0.0002975524,"teacher_disagreement_score":0.22318217,"about_ca_system_score_codex":0.00006191964,"about_ca_system_score_gemma":0.00024038207,"threshold_uncertainty_score":0.46440104},"labels":[],"label_agreement":null},{"id":"W4212997340","doi":"10.5220/0010820800003116","title":"Efficient Removal of Weak Associations in Consensus Clustering","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 14th International Conference on Agents and Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Cluster analysis; Computer science; Artificial intelligence","score_opus":0.07706705037104292,"score_gpt":0.3269461373103809,"score_spread":0.249879086939338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212997340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9683212,0.000005537694,0.00076679274,0.0010369595,0.00017445377,0.00016858867,0.000054064913,0.000009329992,0.029463043],"genre_scores_gemma":[0.9993535,0.0000020443283,0.0003647958,0.000024031084,0.000039161678,0.000017535256,0.0000030138774,0.000004998948,0.00019087456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900055,0.000014501751,0.00038441218,0.00016853576,0.00031364753,0.00011837449],"domain_scores_gemma":[0.9993614,0.00003974152,0.00033145095,0.000059351918,0.00018754667,0.000020499088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031925604,0.00008363541,0.00014512884,0.000117382726,0.00012121222,0.00003002461,0.00035771882,0.000012342432,0.00044696248],"category_scores_gemma":[0.000029599192,0.00007376879,0.0000712732,0.00022211528,0.00007807978,0.0000174676,0.00034795492,0.00016064369,8.7008124e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004907552,0.0002662935,0.015837379,0.000005974592,0.000051021452,3.6426798e-7,0.0006105219,0.007965938,0.0051908465,0.9556788,0.00011531617,0.014228434],"study_design_scores_gemma":[0.00008779841,0.00009460513,0.0074968566,0.000118586795,0.000028026774,0.000003489744,0.0053150523,0.8458431,0.019186284,0.12109805,0.0005172839,0.00021089945],"about_ca_topic_score_codex":0.0001973424,"about_ca_topic_score_gemma":0.000010593046,"teacher_disagreement_score":0.83787715,"about_ca_system_score_codex":0.000044327287,"about_ca_system_score_gemma":0.000023797864,"threshold_uncertainty_score":0.48939258},"labels":[],"label_agreement":null},{"id":"W4213394396","doi":"10.48550/arxiv.1204.6624","title":"Theorems about Ergodicity and Class-Ergodicity of Chains with\\n Applications in Known Consensus Models","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Ergodicity; Class (philosophy); Mathematics; Property (philosophy); Statistical physics; Limiting; Chain (unit); Consensus; Applied mathematics; Discrete mathematics; Mathematical economics; Computer science; Multi-agent system; Statistics; Physics; Artificial intelligence","score_opus":0.046825488952824096,"score_gpt":0.19954797964587387,"score_spread":0.15272249069304977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213394396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68059963,0.00010491693,0.30840456,0.0000138575215,0.000014079337,0.00045054106,0.00007114901,0.000057041565,0.0102842115],"genre_scores_gemma":[0.9989546,0.000058810063,0.0005785392,0.0000066565285,0.00007938313,0.000008794957,0.000073549556,0.000023246923,0.00021643646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858326,0.00012682188,0.00027947334,0.00062387285,0.0000746226,0.00031196108],"domain_scores_gemma":[0.9984761,0.0001485002,0.00037334466,0.0007523141,0.00011275741,0.00013702127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022931857,0.000323394,0.0005817746,0.00025289814,0.00009568568,0.000021360953,0.00039117242,0.0001626133,0.00004978738],"category_scores_gemma":[0.0000018926539,0.00032928443,0.00016448535,0.00044839524,0.00043430907,0.00007700223,0.00054787524,0.00054701103,0.0000017327422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047918707,0.00025172677,0.1446174,0.000040603336,0.00018985437,0.0000030066128,0.00018475714,0.07843097,0.000025796473,0.7757055,0.000037541467,0.0004649102],"study_design_scores_gemma":[0.0009835134,0.00005117169,0.01863552,0.0002725125,0.00065318565,0.0000010374064,0.00057812926,0.51740557,0.00035382604,0.45972243,0.00042698684,0.00091614126],"about_ca_topic_score_codex":0.0017955368,"about_ca_topic_score_gemma":0.00035577008,"teacher_disagreement_score":0.43897456,"about_ca_system_score_codex":0.00008607815,"about_ca_system_score_gemma":0.00011172638,"threshold_uncertainty_score":0.9999159},"labels":[],"label_agreement":null},{"id":"W4213398296","doi":"","title":"Homophily, influence and the decay of segregation in self-organizing networks","year":2016,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Homophily; Psychology; Social psychology; Statistical physics; Cognitive psychology; Computer science; Physics","score_opus":0.004279520045811226,"score_gpt":0.1976528415973671,"score_spread":0.19337332155155587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213398296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83062446,0.0002584921,0.15833184,0.00309086,0.0000122402325,0.0002080587,0.0000031920324,0.00006624367,0.0074045807],"genre_scores_gemma":[0.9939405,0.00010267719,0.0056605586,0.00001554364,0.000010368859,0.000019112558,0.000007920372,0.000010717522,0.00023264461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99779004,0.0014432565,0.00028890313,0.00020755165,0.00012222069,0.00014801558],"domain_scores_gemma":[0.99732536,0.0013637585,0.00022430625,0.00058652594,0.00046169764,0.000038362366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024498438,0.00010196068,0.00017669766,0.00007079608,0.00011837992,0.00005674551,0.00033430837,0.00003276604,0.000044274184],"category_scores_gemma":[0.00009206927,0.000069042966,0.000057723973,0.000406707,0.00019661324,0.00013571962,0.0002161427,0.00010202268,0.0000022589627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012250107,0.00015507279,0.16633835,0.000009007749,0.000055456054,2.6604616e-7,0.00296031,0.00008175024,0.0035518184,0.730844,0.00009335074,0.09589834],"study_design_scores_gemma":[0.008298501,0.0000020705743,0.3053557,0.0041871327,0.0002654294,0.000008357864,0.0006213527,0.12946308,0.3105388,0.23365943,0.006268644,0.0013315005],"about_ca_topic_score_codex":0.0007882792,"about_ca_topic_score_gemma":0.0003562757,"teacher_disagreement_score":0.4971846,"about_ca_system_score_codex":0.000022049811,"about_ca_system_score_gemma":0.000030495226,"threshold_uncertainty_score":0.28154907},"labels":[],"label_agreement":null},{"id":"W4213443684","doi":"10.1073/pnas.2120180119","title":"Information overload and resilience in facing foundational issues","year":2022,"lang":"en","type":"letter","venue":"Proceedings of the National Academy of Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Information overload; Resilience (materials science); Computer science; Data science; Political science; Cognitive science; Psychology; World Wide Web; Physics","score_opus":0.023947128785921094,"score_gpt":0.3057174924526083,"score_spread":0.28177036366668723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213443684","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33835334,0.00037094785,0.000034795838,0.6011554,0.00007273199,0.0011517103,0.0002963484,0.00005453254,0.05851019],"genre_scores_gemma":[0.9841425,0.000016488886,0.001067898,0.014064783,0.0003703502,0.000039672585,0.000007928057,0.0000041505687,0.000286253],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807155,0.000009838973,0.00041311016,0.00016415428,0.0012102377,0.00013108767],"domain_scores_gemma":[0.99904543,0.00012208783,0.0006720159,0.000008392559,0.00014257935,0.000009471768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086823,0.00011010582,0.00019109042,0.00035260204,0.00019308148,0.000059975573,0.0006641137,0.00006977291,0.00016274877],"category_scores_gemma":[0.00006222209,0.00008702104,0.000067576424,0.00075200014,0.00041443788,0.00084711885,0.00030110616,0.0005564797,5.3693935e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018271403,0.000050266797,0.08285048,0.00026403504,0.00008310042,1.2471409e-8,0.0013956781,0.00086296163,0.003172362,0.19448826,0.7109574,0.005857142],"study_design_scores_gemma":[0.0002850595,0.0000737101,0.044872466,0.00038138495,0.0000477367,0.0000038393714,0.0010492146,0.006958839,0.0078055593,0.601383,0.336654,0.00048517605],"about_ca_topic_score_codex":0.00008253661,"about_ca_topic_score_gemma":6.878411e-8,"teacher_disagreement_score":0.64578915,"about_ca_system_score_codex":0.0000457459,"about_ca_system_score_gemma":0.000039215724,"threshold_uncertainty_score":0.3548615},"labels":[],"label_agreement":null},{"id":"W4214715582","doi":"10.1140/epjs/s11734-022-00482-0","title":"Marketing consumer durables on random networks with dynamic advertising rate and individual consciousness","year":2022,"lang":"en","type":"article","venue":"The European Physical Journal Special Topics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Postdoctoral Research Foundation of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Purchasing; Population; Advertising; Consciousness; Consumer behaviour; Marketing; Economics; Computer science; Microeconomics; Business; Psychology; Sociology","score_opus":0.00829450217248371,"score_gpt":0.22870037100044913,"score_spread":0.22040586882796542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214715582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8477658,0.00017197433,0.0036252125,0.00086125033,0.00038037891,0.0003738521,0.000023094488,0.00008087129,0.14671753],"genre_scores_gemma":[0.9833743,0.000018131657,0.00009528292,0.00012307503,0.016057273,0.000004324837,0.000009812062,0.00003526723,0.0002825071],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99719024,0.0017866305,0.00024376006,0.00020517064,0.0002881464,0.00028604316],"domain_scores_gemma":[0.99906474,0.0003799271,0.00023498342,0.00019394279,0.000040831426,0.00008556304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001273802,0.0001905229,0.0002746598,0.00004469317,0.0012346439,0.00023609752,0.00035317268,0.000007147642,0.00014329092],"category_scores_gemma":[0.000010317713,0.00012805249,0.00011933472,0.00019975871,0.00015732263,0.00006891163,0.00029754257,0.0008444959,0.0000034554755],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066839624,0.00019612157,0.003184862,0.0000033949902,0.00040866667,0.000083702755,0.00068283407,0.014472538,0.00006175493,0.0025811885,0.0044847503,0.9731718],"study_design_scores_gemma":[0.024831763,0.0023082173,0.23298164,0.0007558798,0.0033461098,0.0006931786,0.008142255,0.09267193,0.0002826858,0.10095781,0.5281216,0.004906943],"about_ca_topic_score_codex":0.0000060096104,"about_ca_topic_score_gemma":0.0000034996624,"teacher_disagreement_score":0.9682648,"about_ca_system_score_codex":0.00003665568,"about_ca_system_score_gemma":0.000022984623,"threshold_uncertainty_score":0.94960076},"labels":[],"label_agreement":null},{"id":"W4214732297","doi":"10.17762/de.vol2022iss1.9078","title":"Spam Detection on Summarized Graph","year":2022,"lang":"en","type":"article","venue":"Design Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Automatic summarization; Popularity; Computer science; Microblogging; Social media; Graph; Information retrieval; Social graph; Visualization; Data mining; World Wide Web; Theoretical computer science","score_opus":0.011146495471530534,"score_gpt":0.20078492651941876,"score_spread":0.18963843104788822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214732297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020251615,0.000014049979,0.97863907,0.000010198518,0.00009326081,0.00012261461,0.0000022871525,0.00022144565,0.0006454807],"genre_scores_gemma":[0.9959947,5.984404e-7,0.0036398075,0.000011026342,0.0001209628,0.00014549689,0.000010219264,0.000020522946,0.000056683282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944663,0.000035430847,0.00010278384,0.00014058436,0.00012186376,0.00015269384],"domain_scores_gemma":[0.9997098,0.00005856707,0.000029827992,0.00016329742,0.000009142167,0.000029369521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016429633,0.000095730764,0.00010680647,0.00014305067,0.0001216527,0.000023972432,0.000108353386,0.000008447329,0.0003598199],"category_scores_gemma":[0.000002048129,0.0001107213,0.00008741352,0.00031743673,0.0000033041238,0.00003863179,0.00004669142,0.0001789354,0.0000064953033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003129641,0.00006983705,0.00049722195,0.0000031403142,0.00011482092,0.0000032212838,0.00006636347,0.9158529,0.036555454,0.007121921,0.00086267304,0.038821142],"study_design_scores_gemma":[0.0005036904,0.00021755413,0.0006032,0.00001722746,0.00006038,0.000001876947,0.000059599304,0.90598273,0.07248314,0.0052824263,0.014286387,0.0005017748],"about_ca_topic_score_codex":0.000040449944,"about_ca_topic_score_gemma":3.3201107e-7,"teacher_disagreement_score":0.97574306,"about_ca_system_score_codex":0.000041093313,"about_ca_system_score_gemma":0.0000055989185,"threshold_uncertainty_score":0.45150837},"labels":[],"label_agreement":null},{"id":"W4220735151","doi":"10.26599/tst.2021.9010051","title":"Approximation Algorithm for the Balanced 2-Correlation Clustering Problem","year":2022,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Cluster analysis; Vertex (graph theory); Similarity (geometry); Partition (number theory); Series (stratigraphy); Set (abstract data type); Algorithm; Computer science; Combinatorics; Mathematics; Artificial intelligence; Graph","score_opus":0.01066192649364501,"score_gpt":0.2645979031093727,"score_spread":0.2539359766157277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220735151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064148465,0.000034852263,0.9905484,0.0009985475,0.00011502309,0.00055690785,0.0000059921135,0.00026862547,0.001056849],"genre_scores_gemma":[0.9128327,5.845792e-7,0.08628104,0.000032975837,0.000064308355,0.00060870993,0.000012024694,0.000009411632,0.00015829109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892384,0.000016991342,0.00019652494,0.00031775728,0.00023145929,0.00031341644],"domain_scores_gemma":[0.99932134,0.000054538632,0.00016654613,0.00035841065,0.000080746184,0.000018401119],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007219869,0.000095158284,0.00012101056,0.00038963716,0.0014724348,0.00006401193,0.0006920801,0.000021183618,0.00008396319],"category_scores_gemma":[0.000008451314,0.000080398044,0.00005584191,0.0021934789,0.00036023048,0.00015302023,0.00042588744,0.00020914116,0.000003060608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035765838,0.000047268393,0.0016239957,0.000001932502,0.000014925707,1.3149821e-7,0.00023005856,0.013654024,0.0060304697,0.05402075,0.00027596636,0.9240969],"study_design_scores_gemma":[0.00014052255,0.00005965428,0.0001105493,0.000004049346,0.00001971039,0.0000030005845,0.0006802873,0.9345064,0.002512882,0.053980857,0.007870701,0.000111396206],"about_ca_topic_score_codex":0.000040179122,"about_ca_topic_score_gemma":0.0000024939438,"teacher_disagreement_score":0.9239855,"about_ca_system_score_codex":0.0001345782,"about_ca_system_score_gemma":0.000080104735,"threshold_uncertainty_score":0.9998275},"labels":[],"label_agreement":null},{"id":"W4220766722","doi":"10.1371/journal.pone.0265929","title":"Multiple correspondence analysis as a tool for examining Nobel Prize data from 1901 to 2018","year":2022,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nobel laureate; Residence; Contingency table; Categorical variable; Demography; Classics; Library science; Psychology; History; Sociology; Philosophy; Mathematics; Statistics; Computer science","score_opus":0.12118706899414058,"score_gpt":0.29909498962688424,"score_spread":0.17790792063274366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220766722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8953479,0.000040794785,0.101254664,0.00012452649,0.000025943556,0.00060751167,0.0019157578,0.00011104011,0.00057188986],"genre_scores_gemma":[0.94597036,0.0000010041456,0.049183827,0.00016142211,0.0002729867,0.000529994,0.0025631452,0.000026116128,0.0012911389],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822825,0.00009358887,0.00031446476,0.00064612285,0.00042646498,0.00029112623],"domain_scores_gemma":[0.99770683,0.0005785805,0.00015368027,0.0014061149,0.00006938117,0.00008543324],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037800276,0.00016306488,0.00044619583,0.00020397703,0.00029297266,0.0000782084,0.0010132254,0.000017320535,0.0041494407],"category_scores_gemma":[0.00008161996,0.00018749356,0.0001230353,0.0009636218,0.00001737547,0.0001342953,0.0012986448,0.00015918263,0.00006688251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007909021,0.0059402427,0.8180131,0.000025745916,0.01797375,0.000008879645,0.0014007253,0.0030496456,0.08788438,0.00082299794,0.034983933,0.029105753],"study_design_scores_gemma":[0.0018065624,0.00071067445,0.061313912,0.00010234948,0.011357479,2.556017e-7,0.0010648611,0.88011855,0.014237401,0.0047652437,0.02293671,0.0015860223],"about_ca_topic_score_codex":0.0013712271,"about_ca_topic_score_gemma":0.00012706651,"teacher_disagreement_score":0.8770689,"about_ca_system_score_codex":0.00005646708,"about_ca_system_score_gemma":0.000052814994,"threshold_uncertainty_score":0.9967609},"labels":[],"label_agreement":null},{"id":"W4221088439","doi":"10.1111/cars.12377","title":"Big data, computational social science, and other recent innovations in social network analysis","year":2022,"lang":"en","type":"article","venue":"Canadian Review of Sociology/Revue canadienne de sociologie","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia","funders":"","keywords":"Humanities; Social network (sociolinguistics); Social network analysis; Sociology; Computer science; World Wide Web; Social capital; Social media; Social science; Philosophy","score_opus":0.0853835915910642,"score_gpt":0.31941800538420706,"score_spread":0.23403441379314285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221088439","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9315717,0.015489525,0.0018555796,0.024789786,0.0006555117,0.0019397744,0.0067668934,0.00011763289,0.01681356],"genre_scores_gemma":[0.9931812,0.00016734442,0.00057523214,0.0040928004,0.000568979,0.00014714897,0.0012278261,0.000017595377,0.000021835152],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99723876,0.00045798047,0.0006263216,0.0005794208,0.00012182496,0.0009756869],"domain_scores_gemma":[0.99848646,0.00019982341,0.0003852743,0.00036415766,0.00034261146,0.00022166295],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0043163258,0.00020072242,0.00077319634,0.00065092166,0.0013106763,0.000015494054,0.0009548344,0.00008570179,0.00060498883],"category_scores_gemma":[0.00014267891,0.00023645391,0.00015044012,0.0036986757,0.0013432571,0.00006428714,0.00036994126,0.000556231,0.000001249183],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045918473,0.00004976719,0.61358887,0.00016173371,0.0007961301,0.000008825545,0.0032252402,0.0007703817,0.00000863255,0.28787184,0.0554104,0.03810361],"study_design_scores_gemma":[0.0005646964,0.00008637803,0.5311574,0.00016221109,0.0011885107,0.0000058108276,0.009405814,0.0042882417,4.857501e-7,0.19312161,0.2590279,0.0009909509],"about_ca_topic_score_codex":0.018567255,"about_ca_topic_score_gemma":0.056683004,"teacher_disagreement_score":0.2036175,"about_ca_system_score_codex":0.0016300292,"about_ca_system_score_gemma":0.00265186,"threshold_uncertainty_score":0.9999895},"labels":[],"label_agreement":null},{"id":"W4223419920","doi":"10.1016/j.chaos.2022.112035","title":"Controlling COVID-19 transmission with isolation of influential nodes","year":2022,"lang":"en","type":"article","venue":"Chaos Solitons & Fractals","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Centrality; Isolation (microbiology); TOPSIS; Transmission (telecommunications); Identification (biology); Epidemic model; Node (physics); Complex network; Ranking (information retrieval); Population; Data mining; Operations research; Artificial intelligence; Statistics; Mathematics; Medicine; Biology; Bioinformatics; Engineering; Telecommunications; Environmental health; Ecology","score_opus":0.013697482391751222,"score_gpt":0.28302684464501604,"score_spread":0.2693293622532648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4223419920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4806711,0.00014043246,0.51654714,0.00032790515,0.00003300004,0.0003380115,0.00006129326,0.00009077496,0.0017903338],"genre_scores_gemma":[0.9973739,0.0000023432387,0.0020219223,0.00011781352,0.0001555003,0.000104743456,0.000116583506,0.000021090787,0.00008614649],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880046,0.00012148057,0.00034060256,0.00023960424,0.00027943327,0.0002184132],"domain_scores_gemma":[0.9991468,0.00014324373,0.00026955825,0.00026352762,0.000058929647,0.00011790344],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026045126,0.0001492855,0.0003219092,0.00013369587,0.00035830305,0.000025774638,0.00019331828,0.000023121594,0.0021521726],"category_scores_gemma":[0.0000055402893,0.00013804408,0.0001649293,0.0002968147,0.00005872181,0.00011618649,0.00006794479,0.00019513081,0.000002166672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022551639,0.0025317841,0.3074705,0.00021177015,0.0020878355,0.000023383876,0.010877334,0.2444303,0.26658577,0.0514414,0.005844521,0.10624022],"study_design_scores_gemma":[0.0133342855,0.0018095874,0.012123014,0.00024956604,0.001957264,0.000026696653,0.008161952,0.38572228,0.109443605,0.08390257,0.3800963,0.00317288],"about_ca_topic_score_codex":0.0005213853,"about_ca_topic_score_gemma":0.0000042926818,"teacher_disagreement_score":0.5167028,"about_ca_system_score_codex":0.000059720176,"about_ca_system_score_gemma":0.00014397937,"threshold_uncertainty_score":0.99876},"labels":[],"label_agreement":null},{"id":"W4223589989","doi":"10.1155/2022/2069112","title":"Vulnerability Analysis of Urban Rail Transit Network considering Cascading Failure Evolution","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Beijing Jiaotong University; National Natural Science Foundation of China","keywords":"Cascading failure; Vulnerability (computing); Vulnerability assessment; Beijing; Betweenness centrality; Computer science; Urban rail transit; Transport engineering; Engineering; Reliability engineering; Computer security; Electric power system; Geography; Centrality; China","score_opus":0.008293226414032634,"score_gpt":0.2506442127052501,"score_spread":0.24235098629121749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4223589989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7288425,0.00015363579,0.27071053,0.000046965077,0.00007340553,0.00008843335,0.000032255997,0.000013310775,0.000038970193],"genre_scores_gemma":[0.98989546,0.0000032383489,0.009836271,0.000008421557,0.00013904757,0.000009791684,0.00008895399,0.000011906539,0.0000069333532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9983038,0.0001223161,0.0008764621,0.00016004531,0.00036476448,0.00017265903],"domain_scores_gemma":[0.998554,0.00011079438,0.00089519937,0.00016276752,0.00022041085,0.000056811576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055114063,0.00012855123,0.00053698773,0.00032227862,0.00018791347,0.000009588834,0.0001396994,0.000020058264,0.00042373379],"category_scores_gemma":[0.0000039423694,0.00013716686,0.0005897164,0.0014468619,0.000032883945,0.00026597158,0.000004615606,0.00032138795,8.784013e-8],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008735294,0.0000717813,0.12959477,0.000008045314,0.00092626957,0.0000029977828,0.0011823875,0.8604371,0.0030788437,0.0027637407,0.00008169928,0.001765011],"study_design_scores_gemma":[0.0032334155,0.0007603547,0.8772843,0.00014811978,0.013557167,0.000008151036,0.015937703,0.034075268,0.004464675,0.044315297,0.0052606943,0.00095489365],"about_ca_topic_score_codex":0.000073230505,"about_ca_topic_score_gemma":0.00018799263,"teacher_disagreement_score":0.82636184,"about_ca_system_score_codex":0.000105396146,"about_ca_system_score_gemma":0.00006030976,"threshold_uncertainty_score":0.55935025},"labels":[],"label_agreement":null},{"id":"W4224313461","doi":"10.1145/3485447.3512205","title":"FirmCore Decomposition of Multilayer Networks","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM Web Conference 2022","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Modular decomposition; Computer science; Decomposition; Approximation algorithm; Matching (statistics); Key (lock); Core (optical fiber); Cograph; Theoretical computer science; Time complexity; Algorithm; Graph; Mathematics; Pathwidth; Line graph","score_opus":0.0151240366878883,"score_gpt":0.2636987550694495,"score_spread":0.2485747183815612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224313461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990764,0.00005417376,0.0005116968,0.000632828,0.000093482704,0.00029180045,0.000036504185,0.000041713993,0.0075737527],"genre_scores_gemma":[0.9982671,0.0000045183538,0.0012969719,0.000030045598,0.00007463423,0.00009571636,0.000011708299,0.000013113489,0.00020619438],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989947,0.00001741513,0.0003109689,0.00020872979,0.00029174914,0.00017640408],"domain_scores_gemma":[0.9988838,0.00004966885,0.00044317538,0.000369882,0.00022408566,0.000029375138],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026794837,0.00012477807,0.00025193076,0.00007065936,0.00020477167,0.000021827464,0.0016200575,0.00001817128,0.0019074642],"category_scores_gemma":[0.0000217541,0.00010705174,0.00020161606,0.00045430392,0.00007026025,0.00008580692,0.002082644,0.00028475895,7.5932275e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016736462,0.0006696751,0.56960946,0.00007105788,0.00045191988,2.633067e-7,0.0011322178,0.0036703444,0.18723348,0.16173948,0.050666727,0.024587998],"study_design_scores_gemma":[0.0015799592,0.00050838065,0.0358745,0.0002232005,0.0006308927,0.000007227934,0.005264836,0.5810378,0.10982675,0.24736157,0.01658898,0.0010958769],"about_ca_topic_score_codex":0.000081051345,"about_ca_topic_score_gemma":0.0000021169376,"teacher_disagreement_score":0.5773675,"about_ca_system_score_codex":0.000028375418,"about_ca_system_score_gemma":0.000044829776,"threshold_uncertainty_score":0.9990049},"labels":[],"label_agreement":null},{"id":"W4225815186","doi":"10.1109/snams53716.2021.9732134","title":"A New Fast Local Community Detection Algorithm Using the Number of Common Neighbours","year":2021,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Metric (unit); Algorithm; Community structure; Local community; Complex network; Mathematics; World Wide Web","score_opus":0.018758143103129787,"score_gpt":0.30044389762414503,"score_spread":0.28168575452101524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225815186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12471347,0.000011030013,0.8655662,0.00003872929,0.00002557705,0.0000434936,0.0000031502082,0.000029666715,0.009568699],"genre_scores_gemma":[0.9791668,6.335463e-7,0.020380793,0.000031763353,0.00012209674,0.0000020266148,0.000012924569,0.000009375506,0.00027357464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927723,0.0002226541,0.00018387739,0.00008259094,0.000108934786,0.00012471486],"domain_scores_gemma":[0.99929905,0.000091894486,0.00008470488,0.00040508658,0.000080814796,0.00003843765],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014269176,0.000090275906,0.00017600074,0.000016086,0.00020231053,0.000033188247,0.00015705195,0.000023031933,0.0012765904],"category_scores_gemma":[0.0000011285576,0.00006999154,0.0001403053,0.00031316318,0.00005221103,0.00005426557,0.0001591886,0.00026816747,0.0000046002287],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003510217,0.00015103913,0.017105114,0.0000030253386,0.00015343935,5.684382e-7,0.00022767417,0.00042182565,0.0013604034,0.005567367,0.00044104317,0.97456497],"study_design_scores_gemma":[0.0007617164,0.00005496114,0.011147421,0.00008837692,0.00044881558,0.000027586688,0.011441693,0.56343544,0.31445748,0.09352958,0.0040271613,0.00057978363],"about_ca_topic_score_codex":0.019455433,"about_ca_topic_score_gemma":0.0007557757,"teacher_disagreement_score":0.9739852,"about_ca_system_score_codex":0.000024485176,"about_ca_system_score_gemma":0.000047730005,"threshold_uncertainty_score":0.99963635},"labels":[],"label_agreement":null},{"id":"W4225874520","doi":"10.1016/j.eswa.2022.117053","title":"GCNFusion: An efficient graph convolutional network based model for information diffusion","year":2022,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Python (programming language); Feature selection; Graph; Theoretical computer science; Artificial intelligence; Machine learning; Data mining","score_opus":0.01161583337314033,"score_gpt":0.24962203986743425,"score_spread":0.23800620649429394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225874520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020104933,0.000080059355,0.99482816,0.00010968449,0.0000458687,0.0018071054,0.00015578922,0.00015909667,0.00080374425],"genre_scores_gemma":[0.96340257,4.4550893e-7,0.014160553,0.00013141937,0.00035119167,0.019960355,0.0018751273,0.000017581033,0.000100735866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988443,0.000053822245,0.0003291761,0.00023470192,0.00030851536,0.00022947525],"domain_scores_gemma":[0.99902004,0.000055384913,0.00022333901,0.0004515014,0.00016093768,0.00008878293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023401315,0.00014642798,0.00017909241,0.00010490244,0.0011615723,0.000062653125,0.00024387357,0.000020776599,0.00008586489],"category_scores_gemma":[5.756717e-7,0.00013408011,0.00009242595,0.00044502394,0.00003235628,0.0001078985,0.00006967842,0.000096239106,0.0000042110687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026989492,0.00015414965,0.00045870346,0.0000050151766,0.000019459589,1.6274472e-8,0.0001742443,0.8593999,0.000046513007,0.132325,0.006746583,0.00064340647],"study_design_scores_gemma":[0.00036765457,0.000048752645,0.000055245648,0.000008132388,0.000017417617,6.7417506e-7,0.0003689939,0.9264419,0.0000067291594,0.0010469165,0.07147175,0.00016582415],"about_ca_topic_score_codex":0.00016655591,"about_ca_topic_score_gemma":0.000007526578,"teacher_disagreement_score":0.9806676,"about_ca_system_score_codex":0.0000831013,"about_ca_system_score_gemma":0.00010090937,"threshold_uncertainty_score":0.8933992},"labels":[],"label_agreement":null},{"id":"W4225912309","doi":"10.5267/j.ijdns.2022.4.006","title":"Information diffusion model with homogeneous continuous time Markov chain on Indonesian Twitter users","year":2022,"lang":"en","type":"article","venue":"International Journal of Data and Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Horizon 2020 Framework Programme; Universitas Padjadjaran","keywords":"Influencer marketing; Homogeneous; Computer science; Markov chain; Microblogging; Markov process; Indonesian; Process (computing); Social media; Logarithm; Diffusion; Data mining; Information retrieval; World Wide Web; Mathematics; Machine learning; Statistics","score_opus":0.010951380719744773,"score_gpt":0.2596209175828379,"score_spread":0.24866953686309312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225912309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9089416,0.000026001251,0.08837708,0.0008732281,0.0001696809,0.00010682906,0.00009863831,0.000012213851,0.0013946962],"genre_scores_gemma":[0.99538827,0.000008875828,0.0038359629,0.0003477212,0.00026557836,0.0000030029928,0.000083510145,0.000004570624,0.00006248552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864435,0.000033042124,0.0002733412,0.00012684402,0.00076814863,0.00015428539],"domain_scores_gemma":[0.99911064,0.000043889297,0.0003704522,0.00022576538,0.000180923,0.00006834175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007548731,0.00008855698,0.00013665776,0.00020003671,0.00025340664,0.0001741177,0.0011772658,0.000007929644,0.00011404982],"category_scores_gemma":[0.0000047045837,0.00006979553,0.000030132249,0.00025853107,0.00010595939,0.0008828463,0.00064021855,0.00018571455,0.0000017883893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013702202,0.0004909445,0.13995036,0.000004046352,0.00047165816,0.000053198535,0.0014779295,0.313048,0.0012092262,0.007124762,0.051282614,0.48351702],"study_design_scores_gemma":[0.0008813668,0.00035098215,0.003858523,0.0000662696,0.000048639336,0.000114138835,0.0003255503,0.97763485,0.00008644532,0.0029791363,0.013407509,0.00024659827],"about_ca_topic_score_codex":0.000018212206,"about_ca_topic_score_gemma":0.0000012678312,"teacher_disagreement_score":0.66458684,"about_ca_system_score_codex":0.000049428636,"about_ca_system_score_gemma":0.000107093285,"threshold_uncertainty_score":0.28461793},"labels":[],"label_agreement":null},{"id":"W4226056692","doi":"10.1016/j.dam.2023.10.012","title":"Graph clustering with Boltzmann machines","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Solver; Maximization; Mathematics; Heuristic; Mathematical optimization; Graph; Heuristics; Algorithm; Computer science; Discrete mathematics; Statistics","score_opus":0.01215023620294657,"score_gpt":0.25582615627109767,"score_spread":0.24367592006815111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226056692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13576694,0.000011307933,0.7082011,0.0001234796,0.00003099996,0.00055108237,0.000026532243,0.0010131435,0.15427539],"genre_scores_gemma":[0.95794725,0.0000025801478,0.041114006,0.000022388127,0.00014292006,0.00015187092,0.00011391573,0.000054338623,0.00045073562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990468,0.000005869546,0.00023567058,0.00022175026,0.00020095806,0.00028897112],"domain_scores_gemma":[0.99931926,0.000061021397,0.00011654842,0.00042171794,0.000022124772,0.00005931711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001320204,0.00020155279,0.00027981517,0.00011965654,0.00012678867,0.000069845846,0.00022487472,0.000023003135,0.00017288931],"category_scores_gemma":[0.0000010470347,0.00015421156,0.00009342818,0.00056864443,0.00004842855,0.000044710767,0.00014790887,0.000112167065,0.00012287087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003517176,0.000207284,0.00425382,0.0002907227,0.0007652526,0.0000104879655,0.0029425572,0.004494664,0.0051646987,0.9421296,0.0118984515,0.027807267],"study_design_scores_gemma":[0.0010058295,0.000078130666,0.0011825605,0.00020712189,0.00042155618,0.000003974596,0.0032152003,0.22570306,0.0041196886,0.7582082,0.0044682357,0.0013864405],"about_ca_topic_score_codex":0.000018643646,"about_ca_topic_score_gemma":0.0000111269355,"teacher_disagreement_score":0.82218033,"about_ca_system_score_codex":0.000007407852,"about_ca_system_score_gemma":0.000009013013,"threshold_uncertainty_score":0.6288565},"labels":[],"label_agreement":null},{"id":"W4226244403","doi":"10.1145/3498851.3498966","title":"A Web Intelligence Solution to Support Recommendations from the Web","year":2021,"lang":"en","type":"article","venue":"IEEE/WIC/ACM International Conference on Web Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Computer science; Web intelligence; World Wide Web; Web modeling; Data Web; Social Semantic Web; Web standards; Web page; Web mapping; Web development; Web mining; Web engineering; Web navigation; Big data; Web analytics; Web service; Data mining","score_opus":0.08935352757827801,"score_gpt":0.36093569564513234,"score_spread":0.2715821680668543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226244403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06827463,0.0000963477,0.74308693,0.059131783,0.0045998497,0.0010998381,0.001938732,0.000525697,0.12124618],"genre_scores_gemma":[0.9869275,0.00025422554,0.006815505,0.0015716695,0.00097487675,0.00019738931,0.0006073014,0.000038820803,0.0026126958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99657047,0.00024061953,0.00090487004,0.0009686076,0.00074963423,0.0005657915],"domain_scores_gemma":[0.9963211,0.00070641894,0.00032510815,0.0013205598,0.0011053743,0.00022145257],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00052089576,0.0004446292,0.0003963908,0.00021528726,0.00036023208,0.0004835024,0.002330934,0.0001013617,0.02504467],"category_scores_gemma":[0.00022824417,0.00040244852,0.0003296023,0.0007620354,0.00016773542,0.00029784642,0.0006488865,0.0006685635,0.0019434833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011823462,0.0007776844,0.008387708,0.000006594208,0.00070238777,0.000026199628,0.0010876538,0.0013330335,0.026846644,0.51768893,0.10540526,0.33761963],"study_design_scores_gemma":[0.00035671683,0.00044192738,0.00087977457,0.00082753436,0.00024467212,0.000019314446,0.0045993207,0.26147348,0.1577189,0.24737251,0.32407308,0.001992776],"about_ca_topic_score_codex":0.00053402316,"about_ca_topic_score_gemma":0.0012420216,"teacher_disagreement_score":0.9186529,"about_ca_system_score_codex":0.000210359,"about_ca_system_score_gemma":0.0007607892,"threshold_uncertainty_score":0.99984276},"labels":[],"label_agreement":null},{"id":"W4229780670","doi":"10.1002/0471667196.ess7005.pub2","title":"Cluster Randomization","year":2005,"lang":"en","type":"other","venue":"Encyclopedia of Statistical Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Citation; Encyclopedia; Library science; Computer science","score_opus":0.006662341244515863,"score_gpt":0.2798306361277294,"score_spread":0.27316829488321354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229780670","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000552331,0.0000900523,0.26549807,0.00003454327,0.00006538734,0.00014212946,0.0000934926,0.000042213396,0.7340286],"genre_scores_gemma":[0.0125857685,0.00029769895,0.19802895,0.000058136837,0.0026969295,0.00005874454,0.00022207297,0.00016852465,0.7858832],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988893,0.000063043044,0.00027686538,0.00027053608,0.00030764134,0.00019259498],"domain_scores_gemma":[0.99931276,0.000245747,0.00022343313,0.00014033527,0.000020169002,0.00005753662],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022219724,0.00015481774,0.00035466647,0.00013902225,0.000047206053,0.000023105826,0.00026482635,0.00004961829,0.04153438],"category_scores_gemma":[0.000023619557,0.000121282144,0.000067798515,0.00024934544,0.0003679461,0.00003661411,0.00006240484,0.00008730047,0.00006336084],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057267835,0.00005027186,0.0014750183,0.000009882884,0.00003529964,2.3833934e-7,0.000020567099,0.00003059789,5.8299463e-7,0.106035195,0.81222075,0.080115885],"study_design_scores_gemma":[0.0004180385,0.000035303558,0.00019388786,0.0000684218,0.000086564374,1.1975973e-7,0.000018209303,0.0018220993,0.000005408148,0.014365074,0.9827479,0.00023898842],"about_ca_topic_score_codex":0.00049157755,"about_ca_topic_score_gemma":0.000063888954,"teacher_disagreement_score":0.17052716,"about_ca_system_score_codex":0.000007053209,"about_ca_system_score_gemma":0.00005651539,"threshold_uncertainty_score":0.95934176},"labels":[],"label_agreement":null},{"id":"W4229958791","doi":"10.1093/acrefore/9780190228613.013.126","title":"Information Visibility","year":2017,"lang":"en","type":"reference-entry","venue":"Oxford Research Encyclopedia of Communication","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Visibility; Transparency (behavior); Secrecy; Accountability; Data science; Computer science; Internet privacy; Political science; Computer security; Geography; Law","score_opus":0.052549640168231444,"score_gpt":0.38502872106310365,"score_spread":0.3324790808948722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229958791","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008412058,0.0011808398,0.0015019726,0.00021876663,0.000090583395,0.000721008,0.00017764291,0.000051257244,0.9952167],"genre_scores_gemma":[0.292442,0.61335075,0.0056474777,0.000013479756,0.0010891341,0.0007684312,0.013838522,0.00008269505,0.072767526],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967311,0.00076238665,0.0008361859,0.00022181713,0.0010142067,0.0004342825],"domain_scores_gemma":[0.9927697,0.0006009023,0.00094528426,0.0042682313,0.0013031691,0.00011270546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023702844,0.0002658777,0.00059131405,0.0005185925,0.00062491756,0.00020681521,0.0027924238,0.00024658855,0.00075849966],"category_scores_gemma":[0.00023176447,0.00025397685,0.00027062092,0.00033864993,0.0004266183,0.00078952644,0.0014425396,0.0017005698,0.00005004409],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018399262,0.0001148672,0.003616095,0.000113327755,0.00010099839,5.7499978e-8,0.00023350703,0.0000027907233,1.6348444e-7,0.008485358,0.18738495,0.7999295],"study_design_scores_gemma":[0.00015433757,0.000045948862,0.0020648416,0.00042792023,0.000042750733,1.1393726e-7,0.00015313138,0.00019251017,0.000014405512,0.041958056,0.9547431,0.00020289575],"about_ca_topic_score_codex":0.001914987,"about_ca_topic_score_gemma":0.00009505471,"teacher_disagreement_score":0.9224492,"about_ca_system_score_codex":0.00014088838,"about_ca_system_score_gemma":0.0006052233,"threshold_uncertainty_score":0.99999124},"labels":[],"label_agreement":null},{"id":"W4230192772","doi":"10.1007/978-1-4614-6170-8_100623","title":"Querying and Sampling Social Networks","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sampling (signal processing); Computer science; Data science; Sociology; Telecommunications","score_opus":0.024188282426881865,"score_gpt":0.2622817303452822,"score_spread":0.2380934479184003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230192772","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012911964,0.000082669125,0.42255986,0.000028871296,0.000026846234,0.00006896244,0.000002542452,0.000082687264,0.57713467],"genre_scores_gemma":[0.48292825,0.00003096518,0.004546104,0.00017765553,0.005806627,0.000015133665,0.000197357,0.00012589806,0.506172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991083,0.000009898602,0.00025505683,0.00031728655,0.00010649901,0.00020294168],"domain_scores_gemma":[0.9994779,0.0000723359,0.00017153061,0.0001831966,0.000042693966,0.000052331412],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012657268,0.0002747214,0.00043536318,0.00007153801,0.00019011067,0.00008743457,0.000120645476,0.0001343697,0.0017502102],"category_scores_gemma":[4.6719524e-7,0.0002714406,0.00020703235,0.00001653025,0.000057936228,0.000022637027,0.00016284369,0.00034196125,0.0000149756415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015266347,0.000001975126,0.00023055694,0.0000039843003,0.00013038132,1.8816016e-7,0.000011705805,0.000050392184,0.0000010788397,0.8681414,0.006829587,0.1245972],"study_design_scores_gemma":[0.00013393005,0.0000164786,0.00006950715,0.00009792759,0.00026508953,5.939435e-7,0.000010037638,0.010099515,0.0000038009175,0.27246583,0.7160932,0.00074410107],"about_ca_topic_score_codex":0.0000630506,"about_ca_topic_score_gemma":0.000013873067,"teacher_disagreement_score":0.7092636,"about_ca_system_score_codex":0.000016691465,"about_ca_system_score_gemma":0.000011713347,"threshold_uncertainty_score":0.9999738},"labels":[],"label_agreement":null},{"id":"W4230700600","doi":"10.1007/978-1-4614-6170-8_100923","title":"Layered Social Networks","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sociology","score_opus":0.013490117059590384,"score_gpt":0.23782283404284613,"score_spread":0.22433271698325574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230700600","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011962254,0.000028589497,0.2970737,0.000048803126,0.000047360772,0.0000899048,0.0000059318463,0.00013405588,0.70257044],"genre_scores_gemma":[0.20958407,0.000003931557,0.0004715845,0.00011354238,0.004130463,0.000010958037,0.00022575591,0.00006925806,0.78539044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897605,0.000013199876,0.0002952266,0.00032396344,0.00015810637,0.00023345438],"domain_scores_gemma":[0.99930036,0.00003925187,0.00021004754,0.00032790203,0.000066146415,0.000056277844],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000095752235,0.0003227312,0.000504682,0.00007125156,0.00012793281,0.00005618609,0.0002581507,0.00017471051,0.017018264],"category_scores_gemma":[2.716709e-7,0.00031044692,0.0004742654,0.00002236826,0.000052648353,0.000016933893,0.00014228189,0.00037541185,0.00022004836],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018804319,0.0000040081472,0.000041571715,0.0000014273098,0.00017088943,3.4194952e-7,0.0000042283336,0.000055195742,3.7698965e-7,0.7771945,0.17541212,0.04711344],"study_design_scores_gemma":[0.00008420851,0.000011905166,0.000013287701,0.00001848438,0.00011745198,1.277644e-7,0.000001716077,0.0040081744,0.0000034628104,0.1456389,0.84972274,0.00037954678],"about_ca_topic_score_codex":0.000046020665,"about_ca_topic_score_gemma":0.000014639599,"teacher_disagreement_score":0.6743106,"about_ca_system_score_codex":0.00002305197,"about_ca_system_score_gemma":0.000018874905,"threshold_uncertainty_score":0.99993473},"labels":[],"label_agreement":null},{"id":"W4230779220","doi":"10.1007/978-1-4939-7131-2_100744","title":"Network Properties","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.02896361762647399,"score_gpt":0.22739820864316437,"score_spread":0.1984345910166904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230779220","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011269604,0.00020576014,0.00567042,0.00004326188,0.0000784585,0.00017111808,0.0000045797156,0.0001906813,0.99362445],"genre_scores_gemma":[0.013715896,0.0000055485534,0.0017138898,0.00011330127,0.0048845126,0.000015664938,0.000057488633,0.00006257935,0.9794311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905634,0.0000071076693,0.0002569096,0.00030249445,0.00014843109,0.00022870996],"domain_scores_gemma":[0.99921733,0.000012794358,0.00014003245,0.00048142285,0.00009736968,0.000051031348],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000078852216,0.00028986615,0.000365802,0.000045925102,0.00009430681,0.000055684486,0.000244939,0.00008765759,0.0558928],"category_scores_gemma":[3.0501303e-7,0.00023007147,0.00023692615,0.000022058195,0.000100644655,0.000034731984,0.00017734463,0.00019841206,0.0011952929],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029721941,0.000004708079,0.00005958806,0.0000029108014,0.00016633068,3.7733616e-7,0.00001150683,0.000005450341,0.0000017133532,0.54145265,0.45226133,0.0060304985],"study_design_scores_gemma":[0.000023151511,0.000018617397,0.0000015270334,0.0000720704,0.000071978764,1.4308782e-7,0.0000022400181,0.00010170364,0.000025516192,0.3662401,0.6332154,0.00022750828],"about_ca_topic_score_codex":0.000039044786,"about_ca_topic_score_gemma":0.000013743266,"teacher_disagreement_score":0.18095411,"about_ca_system_score_codex":0.000017639324,"about_ca_system_score_gemma":0.00003333274,"threshold_uncertainty_score":0.9995824},"labels":[],"label_agreement":null},{"id":"W4230871670","doi":"10.1007/978-1-4939-7131-2_101158","title":"Social Network Analysis and Recommendation","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Social network analysis; Computer science; Sociology; World Wide Web; Social media","score_opus":0.018267977055305355,"score_gpt":0.2778360078773246,"score_spread":0.25956803082201924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230871670","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040033887,0.000016936308,0.065258786,0.00015109466,0.000025186091,0.00009959565,0.00001742688,0.00008420691,0.93430674],"genre_scores_gemma":[0.07405188,0.000023734534,0.005566053,0.00016412608,0.0066646067,0.000017028284,0.002156018,0.000070251015,0.9112863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990948,0.000016446118,0.000279097,0.000343179,0.000095924,0.00017059897],"domain_scores_gemma":[0.9994106,0.0000375098,0.00023888091,0.00018740502,0.00008077624,0.000044779274],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014995072,0.00023892462,0.00048234803,0.00017359956,0.00018522397,0.000071573326,0.00009948485,0.000107041335,0.04199032],"category_scores_gemma":[3.1100166e-7,0.00023483137,0.00035587198,0.00012283785,0.00006925224,0.000042088337,0.00013322792,0.0001666366,0.00006510922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060567536,0.000010038606,0.0026609106,0.0000030285144,0.004689699,1.622047e-7,0.000047128633,0.0000029710725,5.1524927e-7,0.5911396,0.289547,0.11189286],"study_design_scores_gemma":[0.000057323115,0.000016509537,0.00020514692,0.000007782348,0.0024804776,6.556006e-8,0.000005677988,0.0008455806,0.000004039841,0.40606555,0.5899912,0.000320646],"about_ca_topic_score_codex":0.00007341425,"about_ca_topic_score_gemma":0.00012103371,"teacher_disagreement_score":0.3004442,"about_ca_system_score_codex":0.000020852776,"about_ca_system_score_gemma":0.000012518889,"threshold_uncertainty_score":0.95888543},"labels":[],"label_agreement":null},{"id":"W4231286170","doi":"10.1002/9781118445112.stat00330","title":"Cluster Randomization","year":2014,"lang":"en","type":"other","venue":"Wiley StatsRef: Statistics Reference Online","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Citation; Encyclopedia; Library science; Computer science; Information retrieval","score_opus":0.015514410846117209,"score_gpt":0.29316133275780226,"score_spread":0.27764692191168505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231286170","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005407334,0.00016602936,0.8172218,0.00003343276,0.00015777562,0.00045553924,0.010090367,0.00029486002,0.17157476],"genre_scores_gemma":[0.0037905688,0.0005548534,0.3528865,0.00023510956,0.002620764,0.00012512453,0.057336196,0.0010943583,0.5813565],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99765396,0.00020698475,0.00063872186,0.00062455947,0.00041976932,0.00045599008],"domain_scores_gemma":[0.99794555,0.0002234739,0.0007194737,0.000775608,0.00017394844,0.00016192942],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018233227,0.00057389616,0.00094324164,0.0003347179,0.00008258762,0.00009692243,0.0004423754,0.00019480397,0.01796385],"category_scores_gemma":[0.000031159896,0.00052941137,0.00011945018,0.00024589198,0.00012620391,0.00003752201,0.0001580683,0.00047383987,0.00035573126],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037579768,0.00014750274,0.00027476862,0.000047288628,0.00023470775,0.0000016005404,0.000015092813,0.000052129617,0.000003768713,0.0440382,0.9125045,0.04264288],"study_design_scores_gemma":[0.0017632495,0.00006354861,0.000030961583,0.00036950424,0.00032055785,4.9924637e-7,0.000016594968,0.011667411,0.0000052372357,0.027983462,0.9570594,0.0007196022],"about_ca_topic_score_codex":0.00072127086,"about_ca_topic_score_gemma":0.000691038,"teacher_disagreement_score":0.46433532,"about_ca_system_score_codex":0.000046059737,"about_ca_system_score_gemma":0.00011331276,"threshold_uncertainty_score":0.99971575},"labels":[],"label_agreement":null},{"id":"W4231475449","doi":"10.1007/978-94-007-0753-5_103925","title":"Social Network","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Northern British Columbia","funders":"","keywords":"Sociology","score_opus":0.01566388954279583,"score_gpt":0.25523723714112795,"score_spread":0.23957334759833213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231475449","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011287307,0.000028921633,0.05534559,0.00008784758,0.000046687033,0.00009331541,0.0000040434584,0.00015114424,0.94424134],"genre_scores_gemma":[0.026907824,0.000001982887,0.0010812334,0.00012772268,0.008492791,0.000008829062,0.00015933851,0.00006184438,0.9631584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990985,0.000010050479,0.00024742886,0.00027058754,0.00014981354,0.00022365437],"domain_scores_gemma":[0.9994223,0.00003352667,0.00017607398,0.0002743828,0.00004961877,0.00004405774],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009756379,0.00026828467,0.0004370093,0.00004113955,0.00013436642,0.000041187952,0.00021619245,0.00011622808,0.015513427],"category_scores_gemma":[1.8233365e-7,0.00025727117,0.00041644557,0.00002024345,0.00004666048,0.000012512391,0.00012859098,0.00027556162,0.00046526105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.822477e-7,0.0000016158453,0.000042627587,0.0000011159468,0.00010469902,1.6458914e-7,0.0000026093326,0.0000044895482,1.2725994e-7,0.6478183,0.3257149,0.026308542],"study_design_scores_gemma":[0.000026625426,0.0000052539604,0.000004858667,0.000010481872,0.000067965026,4.8185072e-8,3.815125e-7,0.000077385375,0.0000010864403,0.4146211,0.5850106,0.00017420169],"about_ca_topic_score_codex":0.000026196805,"about_ca_topic_score_gemma":0.000010041748,"teacher_disagreement_score":0.25929573,"about_ca_system_score_codex":0.00001735255,"about_ca_system_score_gemma":0.000019529525,"threshold_uncertainty_score":0.99998796},"labels":[],"label_agreement":null},{"id":"W4231633160","doi":"10.1007/978-1-4614-6170-8_100857","title":"Trend Detection","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.010961926888433922,"score_gpt":0.22681130086767415,"score_spread":0.21584937397924023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231633160","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000599532,0.000012226233,0.14582919,0.000009160361,0.000039006864,0.000055565582,0.0000042059605,0.00012027395,0.8539244],"genre_scores_gemma":[0.20411354,0.0000019693002,0.00031110866,0.000020358688,0.00087349716,0.000006469712,0.0000868839,0.000032118525,0.79455405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939936,0.000005382182,0.00017407937,0.00021987266,0.000097739336,0.00010358953],"domain_scores_gemma":[0.9995009,0.00002130057,0.00011595487,0.00030961516,0.000014441254,0.000037792248],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000048085276,0.00019074656,0.00024742924,0.00009464536,0.000046631474,0.000027085267,0.00010457524,0.00007177771,0.010201377],"category_scores_gemma":[1.7349879e-7,0.00017530035,0.0002520731,0.000014423997,0.000021090584,0.0000138583555,0.000047294838,0.00017117622,0.00019661254],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.922869e-7,0.0000023146476,0.000010228806,0.0000013486341,0.00008127426,1.2149648e-7,0.0000020083912,0.0000010336072,0.000015413427,0.6149862,0.007283779,0.37761533],"study_design_scores_gemma":[0.00003706954,0.000016978382,0.0000051914512,0.000013787588,0.00008527808,1.8053458e-7,8.1654133e-7,0.0002729451,0.00035193894,0.1886316,0.8103909,0.00019333609],"about_ca_topic_score_codex":0.00006422825,"about_ca_topic_score_gemma":0.00010542774,"teacher_disagreement_score":0.8031071,"about_ca_system_score_codex":0.000016551621,"about_ca_system_score_gemma":0.0000049825294,"threshold_uncertainty_score":0.9907034},"labels":[],"label_agreement":null},{"id":"W4232066048","doi":"10.1007/978-1-4939-7131-2_101160","title":"Social Network Analysis Packages","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Social network analysis; Sociology; Computer science; Social science; Social capital","score_opus":0.017282519507026046,"score_gpt":0.2738606140864461,"score_spread":0.25657809457942005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232066048","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002413077,0.000063863255,0.032815784,0.00007452818,0.000041771156,0.00012590119,0.000029526014,0.00019857353,0.9666259],"genre_scores_gemma":[0.056185994,0.0000077043405,0.0018330334,0.00008795754,0.008274735,0.000013544218,0.00064819906,0.00007331585,0.9328755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984277,0.000021171272,0.0004184866,0.00050960487,0.0002710689,0.00035198126],"domain_scores_gemma":[0.9988598,0.00005009149,0.00033794908,0.0005292215,0.00014797613,0.00007495129],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001652359,0.00042749356,0.0008902018,0.00023652555,0.00024225118,0.00009613862,0.00035026544,0.0001807059,0.08327849],"category_scores_gemma":[4.3162342e-7,0.00040181674,0.0013748306,0.00022614568,0.00013607966,0.00004041156,0.00021755797,0.00029486182,0.00054644473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028009906,0.000009088591,0.0009251435,0.0000017581791,0.0053427424,9.054876e-7,0.000025568894,0.000014217978,3.1425697e-7,0.5688085,0.41928664,0.005582321],"study_design_scores_gemma":[0.000046229463,0.000015675203,0.000109624976,0.000011100284,0.0037432304,5.3795656e-8,0.00000615728,0.0002504032,0.000005264853,0.4475159,0.5478495,0.0004468719],"about_ca_topic_score_codex":0.000068477326,"about_ca_topic_score_gemma":0.000103420985,"teacher_disagreement_score":0.12856285,"about_ca_system_score_codex":0.000034119683,"about_ca_system_score_gemma":0.00003166858,"threshold_uncertainty_score":0.99984336},"labels":[],"label_agreement":null},{"id":"W4232385799","doi":"10.32920/ryerson.14665824","title":"Visualizing real-world networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; The Internet; Data science; Voting; Complex network; Process (computing); Software; Visualization; Network science; World Wide Web; Distributed computing; Data mining","score_opus":0.02348800576857517,"score_gpt":0.3271759632286108,"score_spread":0.30368795746003563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232385799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011642354,0.00019482568,0.6308699,0.000079504964,0.0003079098,0.00024704184,0.0000053434287,0.00043687574,0.35621622],"genre_scores_gemma":[0.98210686,0.00005675972,0.009655293,0.000081824786,0.001754386,0.00009158452,0.00070675137,0.000054615626,0.0054919138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981832,0.000111536494,0.00047248643,0.0006594741,0.00019979429,0.00037349205],"domain_scores_gemma":[0.9984787,0.00007732214,0.00024798393,0.00096298975,0.00013017817,0.00010284452],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021526538,0.00036678094,0.0006272843,0.00015705604,0.00010035053,0.00035502444,0.00042338687,0.00010504095,0.005656585],"category_scores_gemma":[0.0000013563545,0.00037508892,0.00054903654,0.00037041624,0.000032464723,0.000052414453,0.001669579,0.00078926026,0.000011857538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014507966,0.00058953837,0.29185602,0.000104724415,0.0030082606,0.00003351911,0.00032552582,0.12356828,0.000082481645,0.3190472,0.13836573,0.12300419],"study_design_scores_gemma":[0.00042135085,0.000029799821,0.012822341,0.0010693806,0.0010674457,8.0635e-7,0.00065777544,0.8727582,0.002040903,0.060268655,0.045615587,0.0032477705],"about_ca_topic_score_codex":0.006044988,"about_ca_topic_score_gemma":0.0007885296,"teacher_disagreement_score":0.9704645,"about_ca_system_score_codex":0.00006157133,"about_ca_system_score_gemma":0.00009597101,"threshold_uncertainty_score":0.9998701},"labels":[],"label_agreement":null},{"id":"W4232396449","doi":"10.1007/978-1-4939-7131-2_100117","title":"Cohesive Subgroup, Community Detection","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Political science","score_opus":0.021299596055693468,"score_gpt":0.24848462288165604,"score_spread":0.2271850268259626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232396449","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065973436,0.000014585287,0.043620314,0.0000096648955,0.00006218591,0.00018365815,0.000014620063,0.00020004853,0.9552352],"genre_scores_gemma":[0.48205543,0.00000359339,0.00047093534,0.000044033055,0.0008850017,0.000014599136,0.00016551488,0.00005287685,0.516308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991742,0.00004775584,0.00026079765,0.00020613743,0.00014711892,0.00016400093],"domain_scores_gemma":[0.99875444,0.000088028275,0.00021677272,0.0007181442,0.00016336305,0.00005926328],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017614024,0.00029251628,0.00036384616,0.000111450914,0.00026832503,0.00004890384,0.0002953692,0.00012914371,0.020894129],"category_scores_gemma":[0.0000012210812,0.00028348516,0.0003010363,0.00003075804,0.000116117975,0.000049270115,0.00019752224,0.000659474,0.0006054012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003176169,0.00011411299,0.00046518087,0.000025057903,0.0013149293,0.0000019005156,0.00029107535,0.0000016079023,0.00033576682,0.7831813,0.068087906,0.14614938],"study_design_scores_gemma":[0.00011522465,0.00012801465,0.00007222351,0.00006287407,0.00025911944,8.50467e-7,0.000061191975,0.00016243076,0.0036853142,0.66617095,0.328727,0.00055482524],"about_ca_topic_score_codex":0.00082336314,"about_ca_topic_score_gemma":0.00054368057,"teacher_disagreement_score":0.4813957,"about_ca_system_score_codex":0.000053836287,"about_ca_system_score_gemma":0.000019006264,"threshold_uncertainty_score":0.99996173},"labels":[],"label_agreement":null},{"id":"W4232638630","doi":"10.1007/978-1-4614-6170-8_110059","title":"Event Analysis on Social Media","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Event (particle physics); Social media; Media event; Computer science; Sociology; Media studies; World Wide Web; Physics; Astrophysics","score_opus":0.020553064391001734,"score_gpt":0.26846705912840546,"score_spread":0.24791399473740372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232638630","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029430976,0.000012725363,0.04067857,0.00008707563,0.00004516117,0.00008343617,0.000036006593,0.000111413305,0.9589162],"genre_scores_gemma":[0.45654643,0.000003936057,0.0003096426,0.00009335535,0.0024385396,0.000013926619,0.0007403549,0.000052613173,0.53980124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986739,0.000019906909,0.00035790642,0.00041433444,0.00033657113,0.00019735369],"domain_scores_gemma":[0.99903005,0.00013259856,0.0002612981,0.0004365405,0.000070641836,0.00006888521],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013870504,0.0003424065,0.00076949765,0.00037816184,0.000098991426,0.000040389154,0.00026474785,0.00012773479,0.026758572],"category_scores_gemma":[0.0000012084242,0.00030624535,0.0012922976,0.00009803245,0.00004509835,0.00001158597,0.00009400838,0.0003006541,0.00041081992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032255673,0.000013874128,0.000074326985,0.0000014250242,0.002278968,4.81753e-7,0.000023381037,0.000024727962,5.3437066e-7,0.89343315,0.04552525,0.058620654],"study_design_scores_gemma":[0.00013664589,0.00002446354,0.00030887505,0.00002495074,0.004835823,4.2256534e-8,0.000009622862,0.0009201214,0.000030359708,0.25583225,0.7371212,0.00075558445],"about_ca_topic_score_codex":0.0000412173,"about_ca_topic_score_gemma":0.00008816634,"teacher_disagreement_score":0.691596,"about_ca_system_score_codex":0.000043141477,"about_ca_system_score_gemma":0.00002020426,"threshold_uncertainty_score":0.99993896},"labels":[],"label_agreement":null},{"id":"W4232722795","doi":"10.1007/978-1-4939-7131-2_101162","title":"Social Network Data","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Social network (sociolinguistics); Computer science; Business; World Wide Web; Social media","score_opus":0.057118831592816534,"score_gpt":0.3100567676819831,"score_spread":0.25293793608916654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232722795","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013878386,0.00005186962,0.014693078,0.00008758441,0.00007195854,0.00011988083,0.00008141734,0.00015151578,0.98474133],"genre_scores_gemma":[0.003292575,0.0000051835314,0.0032755737,0.000103597195,0.018439854,0.0000046026357,0.002683277,0.00007505032,0.9721203],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987828,0.000009714193,0.0002784977,0.0004970976,0.00018275695,0.00024910126],"domain_scores_gemma":[0.9985305,0.00002967563,0.00019715048,0.0011278823,0.00006824518,0.00004651438],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001559859,0.0002845607,0.00041038162,0.00003952148,0.00016717904,0.00006516628,0.0009029867,0.00011894831,0.054342628],"category_scores_gemma":[3.8823802e-7,0.00027117986,0.00018938654,0.000029271387,0.00009963207,0.00006202488,0.0010073594,0.0002566452,0.00085035665],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011673113,0.0000032347198,0.00002566324,9.0287836e-7,0.00016643837,2.974803e-7,0.00000474717,2.7400137e-7,7.631097e-8,0.43236452,0.55816257,0.009270072],"study_design_scores_gemma":[0.000026131354,0.0000058685405,0.0000027361439,0.000013131581,0.00011292699,7.313195e-8,0.0000014745823,0.00019291147,6.1349897e-7,0.387577,0.6118794,0.00018773772],"about_ca_topic_score_codex":0.00004703785,"about_ca_topic_score_gemma":0.000044260578,"teacher_disagreement_score":0.053716797,"about_ca_system_score_codex":0.000015620875,"about_ca_system_score_gemma":0.000043643144,"threshold_uncertainty_score":0.999974},"labels":[],"label_agreement":null},{"id":"W4232873591","doi":"10.1017/s0001867800007692","title":"The Mixing Time of the Newman-Watts Small-World Model","year":2015,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Mixing (physics); Upper and lower bounds; Random walk; Combinatorics; Logarithm; Graph; Small-world network; Order (exchange); Random graph; Binary logarithm; Discrete mathematics; Statistical physics; Mathematical analysis; Complex network; Statistics","score_opus":0.023467631182763748,"score_gpt":0.26857203660776013,"score_spread":0.2451044054249964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232873591","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38861457,0.0010123388,0.10359654,0.0008172334,0.00015760129,0.003005107,0.000022929737,0.00020372952,0.50257],"genre_scores_gemma":[0.98928106,0.0000029459368,0.010207207,0.00002361704,0.000059899754,0.00013633065,0.0000034357558,0.000010379352,0.00027512145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885803,0.000074756936,0.00037345814,0.00026638585,0.00018567672,0.00024171695],"domain_scores_gemma":[0.9987806,0.0001887972,0.00019040098,0.0007403883,0.000057568795,0.00004226142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075514807,0.0001410314,0.00022809861,0.000024082376,0.000109005996,0.000015589989,0.0005613817,0.00001984431,0.000016127122],"category_scores_gemma":[0.00001376636,0.00008548916,0.00010188182,0.0004303089,0.00023161671,0.000068187335,0.00026327872,0.00020065464,0.000005443661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011832772,0.00033473398,0.091746375,0.000032701555,0.000054843073,8.80229e-8,0.00060658314,0.18159245,0.00048684422,0.55618757,0.0006316795,0.16820781],"study_design_scores_gemma":[0.00018514924,0.0000065284075,0.00048552133,0.000017727685,0.000014912561,4.106689e-8,0.000049750877,0.047778353,0.0027727573,0.9411527,0.0074139433,0.00012264238],"about_ca_topic_score_codex":0.000051722745,"about_ca_topic_score_gemma":0.00044087588,"teacher_disagreement_score":0.6006665,"about_ca_system_score_codex":0.00006504728,"about_ca_system_score_gemma":0.000067699926,"threshold_uncertainty_score":0.34861466},"labels":[],"label_agreement":null},{"id":"W4234384890","doi":"10.1109/asonam.2016.7752349","title":"Big data mining of social networks for friend recommendation","year":2016,"lang":"en","type":"article","venue":"2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Big data; Computer science; Data science; World Wide Web; Data mining","score_opus":0.07381743422395404,"score_gpt":0.3655441414783744,"score_spread":0.29172670725442035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234384890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036604516,0.00020154743,0.9520513,0.001319804,0.00075526396,0.00027846664,0.0004552518,0.00004717504,0.008286688],"genre_scores_gemma":[0.9915318,0.00050053524,0.0041206386,0.0000559799,0.0024736107,0.00007096485,0.0008032953,0.000025326877,0.00041787606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977414,0.00013171879,0.00075602176,0.00069969526,0.0002756271,0.00039553823],"domain_scores_gemma":[0.9978586,0.00062616466,0.0007821989,0.00035933594,0.00030897165,0.00006474385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007397221,0.0002948809,0.0006805922,0.00028765752,0.00027635536,0.000097003176,0.00084684626,0.0001237666,0.00054129015],"category_scores_gemma":[0.0000556025,0.0002478087,0.00026639405,0.0006050244,0.00018908971,0.00042386327,0.00029876406,0.00016130575,0.0000010894958],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018070108,0.00013404999,0.038671695,0.0000060018356,0.0010379256,5.1687266e-7,0.00033932683,0.0010069248,0.000052435367,0.02600562,0.0048506116,0.92771417],"study_design_scores_gemma":[0.0032458422,0.00023474876,0.012817693,0.00050160557,0.0014426967,5.6179186e-7,0.0029348778,0.88599956,0.00009484383,0.01774655,0.07356383,0.001417187],"about_ca_topic_score_codex":0.000055687473,"about_ca_topic_score_gemma":0.000362929,"teacher_disagreement_score":0.95492727,"about_ca_system_score_codex":0.00006819789,"about_ca_system_score_gemma":0.000054782857,"threshold_uncertainty_score":0.99999744},"labels":[],"label_agreement":null},{"id":"W4234451580","doi":"10.1090/stml/061/06","title":"Random graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.016145638392258674,"score_gpt":0.24423930744426137,"score_spread":0.22809366905200268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234451580","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004426149,0.00020145692,0.005446539,0.00005267598,0.000051119543,0.00047014776,0.000039728897,0.00032492887,0.99336916],"genre_scores_gemma":[0.01937266,0.0000482019,0.004834821,0.00011082638,0.00060638017,0.00008512422,0.00022188792,0.00019357745,0.9745265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983067,0.000024222667,0.00060515164,0.00041617537,0.0003692362,0.000278515],"domain_scores_gemma":[0.99872833,0.00015813278,0.00024667176,0.0006946937,0.000020256364,0.00015192051],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009405772,0.00046917264,0.00085490686,0.00015398159,0.000059931346,0.00010814602,0.0006498403,0.00013089734,0.05849455],"category_scores_gemma":[0.0000011416033,0.00038840782,0.0007206635,0.00004546748,0.00012607692,0.00017063778,0.0005630944,0.00041956676,0.0013301678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011815625,0.000111498346,0.00022500737,0.000030278792,0.00048694236,0.000007092053,0.00008180581,1.09516115e-7,6.424102e-7,0.9597778,0.03684799,0.0024190643],"study_design_scores_gemma":[0.00025288513,0.000028266955,0.00001689708,0.00019809308,0.0002640573,7.504094e-7,0.000008136371,0.000011115059,0.000022432328,0.90225536,0.09657417,0.00036781357],"about_ca_topic_score_codex":0.0000013148829,"about_ca_topic_score_gemma":9.594596e-8,"teacher_disagreement_score":0.059726186,"about_ca_system_score_codex":0.0000067766114,"about_ca_system_score_gemma":0.000029514158,"threshold_uncertainty_score":0.99985677},"labels":[],"label_agreement":null},{"id":"W4234489182","doi":"10.1007/978-1-4939-7131-2_100753","title":"Network Structure Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.010552366918876387,"score_gpt":0.2366649256798566,"score_spread":0.22611255876098021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234489182","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003485576,0.00009692682,0.037891123,0.00002579793,0.00007028298,0.00013726369,0.0000856036,0.00016147034,0.96149665],"genre_scores_gemma":[0.06212741,0.0000039628117,0.005674687,0.00013587519,0.0049178237,0.0000048955253,0.0010710317,0.00007057113,0.92599374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985099,0.000013338675,0.0003899602,0.00053272437,0.00024653558,0.00030752766],"domain_scores_gemma":[0.9985258,0.000039278417,0.00030198813,0.00089748326,0.00014234832,0.000093128],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000079903184,0.00043807368,0.0008067515,0.00024151945,0.000119071556,0.00008004455,0.00038194619,0.00017987443,0.22840247],"category_scores_gemma":[3.877081e-7,0.00038512866,0.00083987234,0.00022213755,0.00008945382,0.000037052323,0.00019744404,0.00033067272,0.00024810474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037913762,0.000005196977,0.0014761279,0.000002274556,0.0060955435,0.0000011422113,0.000013510588,0.00025030127,0.0000010857784,0.6712503,0.31605366,0.0048470655],"study_design_scores_gemma":[0.00003396664,0.000014755775,0.000050175804,0.000014107593,0.003188213,1.1321283e-7,0.0000020724278,0.00061418785,0.0000073404685,0.57396,0.42173442,0.00038065042],"about_ca_topic_score_codex":0.00007086996,"about_ca_topic_score_gemma":0.00017079375,"teacher_disagreement_score":0.22815436,"about_ca_system_score_codex":0.000029309002,"about_ca_system_score_gemma":0.000031345626,"threshold_uncertainty_score":0.99986005},"labels":[],"label_agreement":null},{"id":"W4234894698","doi":"10.1198/106186002321018849","title":"Detecting Clusters and Nonlinearity in Three-Dimensional Dynamic Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Nonlinear system; Theoretical computer science; Algorithm; Physics","score_opus":0.010451391268419685,"score_gpt":0.2540165866985389,"score_spread":0.2435651954301192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234894698","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7034807,0.00018774669,0.29594028,0.00025960352,0.000027726415,0.00004115404,0.000032144264,0.000004561213,0.000026035073],"genre_scores_gemma":[0.92041296,0.000011075561,0.07947339,0.00004730788,0.000038581726,6.6461587e-7,0.000008011276,0.0000051235447,0.0000028902107],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991223,0.000043416072,0.00039659982,0.000103958795,0.00021864536,0.00011502985],"domain_scores_gemma":[0.9990946,0.00045559788,0.00019662986,0.0000334246,0.00013349643,0.000086254615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018986099,0.00009654896,0.00021506949,0.00018144277,0.000085816675,0.00003754277,0.000052882722,0.000025833177,0.000053972664],"category_scores_gemma":[0.000014739582,0.00008419348,0.000054866792,0.00021456461,0.00010445687,0.00006782459,0.000037199283,0.00027701375,3.494462e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109335786,0.0006243716,0.5217487,0.00004536051,0.00038110468,0.00007706467,0.00022635714,0.041836012,0.00004396408,0.1306576,0.00091612124,0.303334],"study_design_scores_gemma":[0.00029321623,0.00005791899,0.09520152,0.000019662073,0.000021101427,0.000017827851,0.0000077621335,0.49234104,6.015458e-7,0.41194898,0.00002739998,0.00006297014],"about_ca_topic_score_codex":0.000033898184,"about_ca_topic_score_gemma":0.000060660746,"teacher_disagreement_score":0.45050502,"about_ca_system_score_codex":0.000008888466,"about_ca_system_score_gemma":0.000010531428,"threshold_uncertainty_score":0.34333107},"labels":[],"label_agreement":null},{"id":"W4234995558","doi":"10.1109/asonam.2016.7752337","title":"Retweet prediction considering user's difference as an author and retweeter","year":2016,"lang":"en","type":"article","venue":"2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Field (mathematics); Social network (sociolinguistics); Social network analysis; Data science; Significant difference; Social influence; Social media; World Wide Web; Psychology; Mathematics; Statistics","score_opus":0.03138906469607681,"score_gpt":0.3349104635776121,"score_spread":0.3035213988815353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234995558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8970032,0.0002227898,0.093774445,0.0008280986,0.0003307615,0.00018605881,0.000095824806,0.00009647057,0.007462395],"genre_scores_gemma":[0.9953622,0.0007019153,0.0016181624,0.00008199892,0.00089503365,0.00005382614,0.000068599526,0.000021358579,0.0011969114],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978944,0.00016250362,0.00053205,0.00071305205,0.00033783846,0.00036013275],"domain_scores_gemma":[0.9987094,0.00031458872,0.00035206528,0.0002999452,0.00018692519,0.0001371205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040778893,0.00031065653,0.00054001424,0.0002635825,0.00025381756,0.00019440586,0.00036836785,0.00011902969,0.00062752544],"category_scores_gemma":[0.000041123658,0.0002469816,0.00015684025,0.00037436298,0.00024059034,0.000507268,0.0001611701,0.00022628022,0.0000033406052],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014499266,0.000117356096,0.64279836,0.0000053421213,0.00083609927,0.0000057867665,0.00060775096,0.0003868659,0.00042479378,0.08155894,0.0005705075,0.27254316],"study_design_scores_gemma":[0.003916712,0.00079708133,0.44408923,0.0015741516,0.0017829058,0.000007319565,0.003171731,0.32502857,0.00044005638,0.19520873,0.02129484,0.0026886843],"about_ca_topic_score_codex":0.00011738923,"about_ca_topic_score_gemma":0.00025061172,"teacher_disagreement_score":0.3246417,"about_ca_system_score_codex":0.000066386136,"about_ca_system_score_gemma":0.00003885666,"threshold_uncertainty_score":0.9999983},"labels":[],"label_agreement":null},{"id":"W4235014373","doi":"10.1109/asonam.2016.7752343","title":"Understanding alliance and opposition among violent groups","year":2016,"lang":"en","type":"article","venue":"2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Opposition (politics); Alliance; Situational ethics; Political science; Political economy; Computer science; Social psychology; Sociology; Psychology; Politics","score_opus":0.05710934282861807,"score_gpt":0.3243031271787189,"score_spread":0.2671937843501008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235014373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32916546,0.0004760718,0.65580845,0.0009605857,0.00030270565,0.00020120993,0.00004909215,0.00006532038,0.012971093],"genre_scores_gemma":[0.9956821,0.0023767462,0.00086601253,0.000059190294,0.0006079394,0.00004396773,0.000043893462,0.000015594416,0.0003045358],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836725,0.00009762749,0.0004076898,0.0005319387,0.00028352143,0.0003119502],"domain_scores_gemma":[0.9990651,0.00023490173,0.0003249618,0.00018266295,0.000104397484,0.00008795637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031926765,0.00025073678,0.00042788958,0.00018224827,0.00023663606,0.00014680122,0.00029885277,0.00007944637,0.0003816057],"category_scores_gemma":[0.000012824518,0.00020195858,0.00016591742,0.00038571272,0.00023143378,0.0004318004,0.00012201197,0.000162475,0.0000022642005],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112718044,0.00012002725,0.5833185,0.00000594466,0.0009755099,0.0000053789877,0.00035749152,0.0014105943,0.0001763812,0.26385477,0.0007484233,0.14891429],"study_design_scores_gemma":[0.0038857805,0.00034479948,0.2334366,0.0024890534,0.0014908519,0.0000023412667,0.0048447037,0.44254437,0.00019574957,0.30298525,0.005172489,0.0026080133],"about_ca_topic_score_codex":0.000058640933,"about_ca_topic_score_gemma":0.00036861433,"teacher_disagreement_score":0.66651666,"about_ca_system_score_codex":0.00014517448,"about_ca_system_score_gemma":0.00001990691,"threshold_uncertainty_score":0.8235632},"labels":[],"label_agreement":null},{"id":"W4235043887","doi":"10.1007/978-0-387-39940-9_2212","title":"Cluster Stability","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster (spacecraft); Stability (learning theory); Computer science; Operating system; Machine learning","score_opus":0.0169924352882942,"score_gpt":0.24680324886184596,"score_spread":0.22981081357355176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235043887","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012374036,0.00084433984,0.005198214,0.000020288204,0.00031947487,0.000777252,0.0020216587,0.00010285155,0.9905922],"genre_scores_gemma":[0.07507849,0.00053379656,0.0030000368,0.00004362185,0.0058278823,0.00011709937,0.0087705245,0.00023537625,0.9063932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974657,0.00007338124,0.0010394702,0.0006253911,0.000493298,0.0003027216],"domain_scores_gemma":[0.99709165,0.00016268289,0.000766921,0.0016522162,0.00018944847,0.00013706494],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000479488,0.0005067641,0.0010357923,0.00018234391,0.000061492094,0.00003214068,0.00049066974,0.00014692124,0.0022737845],"category_scores_gemma":[0.000007914654,0.0004852286,0.00040358177,0.0000633661,0.000095462914,0.000152572,0.00023720332,0.0004471085,0.00011933396],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006412192,0.00031712875,0.0030594792,0.00066733843,0.0010877232,0.000016686374,0.00022306803,0.00005586612,0.00006272244,0.62935567,0.30629656,0.05879367],"study_design_scores_gemma":[0.00021077802,0.000051577994,0.00002676688,0.0005241321,0.00028466643,0.0000012488089,0.000029196079,0.0002371216,0.000036469068,0.007163971,0.9908645,0.00056954497],"about_ca_topic_score_codex":0.00047848668,"about_ca_topic_score_gemma":0.000027499042,"teacher_disagreement_score":0.684568,"about_ca_system_score_codex":0.00005864092,"about_ca_system_score_gemma":0.00012241458,"threshold_uncertainty_score":0.9997599},"labels":[],"label_agreement":null},{"id":"W4235139872","doi":"10.1007/978-1-4939-7131-2_100358","title":"Evolving Community Detection","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Geography; Computer science","score_opus":0.022890692321346984,"score_gpt":0.25473409804423697,"score_spread":0.23184340572288997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235139872","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018325046,0.000017804505,0.060397197,0.0000052284518,0.00005148194,0.00009884406,0.000004954072,0.00018007532,0.93906116],"genre_scores_gemma":[0.45260054,0.0000016021899,0.00074648426,0.000020635329,0.0007604698,0.0000061999563,0.000059821894,0.00003717541,0.54576707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936366,0.000030133424,0.00020801433,0.00015495357,0.00011503997,0.00012821429],"domain_scores_gemma":[0.9990191,0.000057748006,0.00015070922,0.0006043526,0.0001265226,0.000041606538],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017029169,0.00021653272,0.00025901012,0.00009570379,0.0002549348,0.00005253082,0.00023282874,0.00009010233,0.0348767],"category_scores_gemma":[0.0000012401696,0.00021173494,0.0002296504,0.000022799146,0.00006463775,0.000051427967,0.00018851951,0.00056058046,0.00041765269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012167359,0.00009006031,0.00048278813,0.000028688179,0.001145273,0.0000010089929,0.00028787475,0.0000020973305,0.0004096381,0.560426,0.12587956,0.31123483],"study_design_scores_gemma":[0.000068682384,0.00006734959,0.000052929812,0.00008318723,0.00016975965,4.865582e-7,0.000037254264,0.00067714555,0.0014682509,0.6938476,0.30308285,0.00044450958],"about_ca_topic_score_codex":0.0006043193,"about_ca_topic_score_gemma":0.00029456898,"teacher_disagreement_score":0.45241728,"about_ca_system_score_codex":0.00004386809,"about_ca_system_score_gemma":0.0000148516865,"threshold_uncertainty_score":0.96600556},"labels":[],"label_agreement":null},{"id":"W4235255053","doi":"10.1007/978-1-4614-6170-8_359","title":"User Behavior in Online Social Networks, Influencing Factors","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Psychology; Computer science; Internet privacy; Human–computer interaction; Sociology","score_opus":0.02025426537903985,"score_gpt":0.2714772398200022,"score_spread":0.25122297444096237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235255053","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07381992,0.0001192947,0.036797967,0.0000677108,0.0002724382,0.0010918879,0.00014191029,0.00055100344,0.8871379],"genre_scores_gemma":[0.7697582,0.0000055196633,0.00052832,0.00007653964,0.0017992228,0.000023279636,0.0009046718,0.0001103091,0.2267939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99848086,0.000021460497,0.000543887,0.0004167561,0.00020527633,0.00033177613],"domain_scores_gemma":[0.9992015,0.00006109812,0.00027543408,0.00032951555,0.00006514932,0.00006734906],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000098902405,0.00044900048,0.0006952276,0.00021857386,0.00008794111,0.000055332475,0.00030356974,0.00023993895,0.0040357714],"category_scores_gemma":[8.6248616e-7,0.00042609955,0.00041770685,0.000059152346,0.000055034772,0.0000499815,0.00018942733,0.00066304475,0.000022355383],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011094856,0.00014187866,0.1875363,0.000012039441,0.00032010145,0.0000068603013,0.00012717208,0.00034649303,0.00001374808,0.73379093,0.016370319,0.061323088],"study_design_scores_gemma":[0.0011625997,0.00016787191,0.08969588,0.00044199248,0.0015663406,8.681792e-7,0.0002151065,0.0046121296,0.000060139722,0.048843525,0.84861994,0.004613606],"about_ca_topic_score_codex":0.00069705874,"about_ca_topic_score_gemma":0.00068213977,"teacher_disagreement_score":0.83224964,"about_ca_system_score_codex":0.00008919503,"about_ca_system_score_gemma":0.00003708297,"threshold_uncertainty_score":0.9998191},"labels":[],"label_agreement":null},{"id":"W4235339307","doi":"10.1007/978-1-4939-7131-2_100179","title":"Complex Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.025918501059217645,"score_gpt":0.2596560915504595,"score_spread":0.23373759049124185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235339307","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021134226,0.000045761633,0.15412357,0.000026428901,0.00006092235,0.00014026847,0.000012928316,0.00018712805,0.84540087],"genre_scores_gemma":[0.03503005,0.000009421228,0.0027343526,0.00015116675,0.0035377839,0.000009766302,0.0004915513,0.000084911466,0.957951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988585,0.000008651165,0.00032808157,0.00038678266,0.00016495661,0.00025303251],"domain_scores_gemma":[0.99892676,0.000038455946,0.000198787,0.00063710654,0.00011205283,0.00008685725],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008138354,0.00036209938,0.00047372808,0.000091038586,0.00009483443,0.00006121065,0.00033262218,0.00012732456,0.19168836],"category_scores_gemma":[2.7044698e-7,0.00033693633,0.00038158929,0.000029100127,0.00012172322,0.000031090647,0.00021271901,0.00028649467,0.00091076706],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018664483,0.0000069696616,0.00008565008,0.0000012102084,0.00019648782,6.5532004e-7,0.0000040619825,0.000021932088,6.6158316e-7,0.50875753,0.47976077,0.011162202],"study_design_scores_gemma":[0.000052211635,0.000022023463,0.000016869895,0.000029098235,0.00010296692,3.0767447e-7,0.000002190721,0.0057199886,0.0000037648856,0.19086325,0.8028486,0.00033874248],"about_ca_topic_score_codex":0.00004536826,"about_ca_topic_score_gemma":0.000019969928,"teacher_disagreement_score":0.3230878,"about_ca_system_score_codex":0.000024794042,"about_ca_system_score_gemma":0.000020829639,"threshold_uncertainty_score":0.99990827},"labels":[],"label_agreement":null},{"id":"W4235573628","doi":"10.1007/978-1-4939-7131-2_101349","title":"Time-Aware Social Network-Based Social Profiling","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Profiling (computer programming); Computer science; Data science","score_opus":0.018611945661332036,"score_gpt":0.2615484270129281,"score_spread":0.24293648135159604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235573628","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005459575,0.000018862693,0.021692565,0.00014555022,0.00009341548,0.00039841296,0.0000878142,0.00042803594,0.97708076],"genre_scores_gemma":[0.03335762,7.808473e-7,0.0042341934,0.00031659915,0.02938844,0.00006251044,0.0022308708,0.00025628338,0.9301527],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99811584,0.000032637075,0.00047387223,0.00055262947,0.0003425152,0.00048253476],"domain_scores_gemma":[0.99896145,0.00005094323,0.00039701423,0.00029589125,0.00022699975,0.000067704415],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020188582,0.00052720297,0.00074334955,0.000100187535,0.0005341667,0.00009369874,0.00037507646,0.00030630874,0.04250869],"category_scores_gemma":[5.295147e-7,0.00053492613,0.0007807004,0.00006765414,0.00022877638,0.000046769856,0.00018457121,0.0004717,0.0009384792],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025971429,0.000037668047,0.00011480216,0.000017599941,0.0006051576,0.00000232696,0.000053572076,0.000028110053,0.000009336228,0.3232777,0.66235507,0.013472699],"study_design_scores_gemma":[0.00044944015,0.00008021285,0.000013497317,0.00011201669,0.00070469576,2.1122283e-7,0.000020261654,0.008401983,0.00016574444,0.26843363,0.72001123,0.0016070891],"about_ca_topic_score_codex":0.000019537229,"about_ca_topic_score_gemma":0.00000972261,"teacher_disagreement_score":0.057656158,"about_ca_system_score_codex":0.00007797433,"about_ca_system_score_gemma":0.00016302538,"threshold_uncertainty_score":0.9998394},"labels":[],"label_agreement":null},{"id":"W4235849778","doi":"10.24124/2019/58933","title":"A comparison of social network analysis software &amp; application to Nigeria corporate system","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Social network analysis; Software; Knowledge management; Social network (sociolinguistics); Focus (optics); Network analysis; Computer science; Data science; Business; Engineering; World Wide Web; Social media","score_opus":0.020093809667105562,"score_gpt":0.3222558476591726,"score_spread":0.30216203799206703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235849778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14787075,0.000050174098,0.8379325,0.000009156082,0.00016946495,0.0010551506,0.00009719691,0.00026617595,0.012549402],"genre_scores_gemma":[0.97036904,2.812193e-7,0.007881087,0.0000072475245,0.00045476685,0.00022810049,0.0150123155,0.000048355992,0.005998815],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9977795,0.00009570268,0.0009234206,0.000546911,0.0003564019,0.00029805422],"domain_scores_gemma":[0.99710065,0.000064286716,0.0017210491,0.00062487804,0.00041390507,0.000075214804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023084437,0.00036555593,0.0015363944,0.00036126535,0.0001490303,0.0000621541,0.00040597963,0.00018280935,0.00044588905],"category_scores_gemma":[0.000002050412,0.00037751437,0.0007250723,0.0020801108,0.000013334183,0.000039403276,0.00005602831,0.00021658427,0.0001525347],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023079591,0.00035548245,0.81800675,0.00051575166,0.009492618,1.6438793e-7,0.0024715774,0.036327425,0.00059563783,0.055122446,0.053237483,0.023643862],"study_design_scores_gemma":[0.002985579,0.00073135894,0.51764435,0.0020636502,0.07468861,5.7828476e-7,0.045893706,0.19464579,0.009167076,0.023454338,0.11385369,0.014871244],"about_ca_topic_score_codex":0.00054753746,"about_ca_topic_score_gemma":0.0013332127,"teacher_disagreement_score":0.8300514,"about_ca_system_score_codex":0.00008250378,"about_ca_system_score_gemma":0.00007766546,"threshold_uncertainty_score":0.9998677},"labels":[],"label_agreement":null},{"id":"W4235852247","doi":"10.1007/978-1-4939-7131-2_101142","title":"Social Media Analysis and Mining","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Social media; Computer science; Data science; World Wide Web","score_opus":0.022374126799397476,"score_gpt":0.2672376917890786,"score_spread":0.2448635649896811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235852247","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007760754,0.000043777178,0.0068265134,0.000035943212,0.000019104978,0.00005338667,0.000023655079,0.00008201563,0.9921395],"genre_scores_gemma":[0.31315693,0.000011715063,0.00548725,0.000051620016,0.0039042414,0.000010239093,0.0005469493,0.000069962334,0.6767611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908656,0.000008772019,0.00024818594,0.0003395603,0.00016320705,0.00015369235],"domain_scores_gemma":[0.9993868,0.000089983194,0.0001764228,0.0002152014,0.0000748884,0.000056698602],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009518586,0.00024517707,0.000555686,0.00029529122,0.000112281494,0.000059782295,0.0001326982,0.00010380252,0.02404558],"category_scores_gemma":[0.0000010292441,0.00023104285,0.00039674123,0.000091518545,0.000120984536,0.000029806144,0.00014755687,0.00013174726,0.000044625638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067313554,0.00001653677,0.0042762514,0.000006517687,0.008829816,0.0000023099449,0.00096987194,5.334201e-7,0.000004244548,0.7824339,0.11047109,0.09298216],"study_design_scores_gemma":[0.00023796645,0.00003243639,0.0012306735,0.000042227348,0.012447177,3.5728453e-7,0.00019715623,0.0010377852,0.000054303015,0.5401679,0.4431827,0.0013692912],"about_ca_topic_score_codex":0.00003583679,"about_ca_topic_score_gemma":0.00018816892,"teacher_disagreement_score":0.3327116,"about_ca_system_score_codex":0.000012908472,"about_ca_system_score_gemma":0.00001603877,"threshold_uncertainty_score":0.9768466},"labels":[],"label_agreement":null},{"id":"W4235871652","doi":"10.1007/978-1-4939-7131-2_100694","title":"Multidimensional Social Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sociology; Computer science; Psychology","score_opus":0.01576195994374591,"score_gpt":0.25344810456239986,"score_spread":0.23768614461865395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235871652","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016582213,0.00004113289,0.068568416,0.000041184347,0.00009801626,0.00012628753,0.000014128667,0.00014466798,0.93094957],"genre_scores_gemma":[0.034186188,0.0000035480994,0.0030493897,0.0001199069,0.006610287,0.000010336882,0.00038535357,0.00007708856,0.9555579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988965,0.000009989833,0.00029130554,0.00036415082,0.000204328,0.00023377247],"domain_scores_gemma":[0.9993097,0.00003962211,0.00018721334,0.0002724885,0.00013080092,0.0000601271],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000086673404,0.0003265696,0.00040692277,0.000075070326,0.0001746408,0.000028526722,0.00017587953,0.0001723303,0.08520903],"category_scores_gemma":[2.9948453e-7,0.00030536676,0.00043170262,0.000023157663,0.00012111236,0.000030129415,0.00020282675,0.00032430066,0.0006153623],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040837776,0.00001146123,0.000041897674,9.110643e-7,0.00022982722,8.224245e-7,0.000011009314,0.000013872674,0.0000012853773,0.61700886,0.37316695,0.009509031],"study_design_scores_gemma":[0.00011013403,0.000020002151,0.000023412904,0.000027809625,0.00014625689,2.6118136e-7,0.000004180554,0.0050712284,0.000011792393,0.1289752,0.8651599,0.00044981728],"about_ca_topic_score_codex":0.000031194675,"about_ca_topic_score_gemma":0.00000934864,"teacher_disagreement_score":0.49199295,"about_ca_system_score_codex":0.000028016415,"about_ca_system_score_gemma":0.000031988784,"threshold_uncertainty_score":0.99993986},"labels":[],"label_agreement":null},{"id":"W4236342053","doi":"10.32920/ryerson.14665329.v1","title":"Characterization of user networks in Facebook","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Degree distribution; Weibull distribution; World Wide Web; Graph; Log-normal distribution; Complex network; Theoretical computer science; Mathematics; Statistics","score_opus":0.011686428939996397,"score_gpt":0.2520379447406019,"score_spread":0.24035151580060554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236342053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4656036,0.0000124505395,0.5172644,0.000028462422,0.000064035885,0.00039639662,0.00000857777,0.000040582232,0.016581487],"genre_scores_gemma":[0.9962377,0.000014190178,0.001078911,0.000018260309,0.00016883948,0.00010807423,0.0010178951,0.00001659596,0.0013395295],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905646,0.000064720545,0.00038172482,0.000271698,0.000091583555,0.00013379048],"domain_scores_gemma":[0.9992579,0.000018022447,0.00022124154,0.00040339938,0.00007619243,0.000023194356],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010803532,0.00015836924,0.00040036943,0.00009741841,0.000010841038,0.000044498665,0.00018287156,0.000092061426,0.003884244],"category_scores_gemma":[7.501126e-7,0.00016550344,0.00017260779,0.00014623892,0.000016858121,0.000041172203,0.0004916119,0.0003073559,0.0000028286256],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003217747,0.0009679513,0.7150679,0.0001914178,0.0010734274,0.000007549243,0.00084999355,0.07142652,0.03981508,0.048917707,0.0013005057,0.12034972],"study_design_scores_gemma":[0.0011559977,0.000055410936,0.32602826,0.0022155524,0.00050416717,5.388386e-7,0.00048434603,0.5420754,0.081548505,0.025309324,0.01776841,0.0028541095],"about_ca_topic_score_codex":0.00030082333,"about_ca_topic_score_gemma":0.00004809534,"teacher_disagreement_score":0.5306341,"about_ca_system_score_codex":0.000020018351,"about_ca_system_score_gemma":0.00004901036,"threshold_uncertainty_score":0.9970263},"labels":[],"label_agreement":null},{"id":"W4236419281","doi":"10.1007/978-1-4614-6170-8_100973","title":"Directed Network","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.01017000448306239,"score_gpt":0.22402630235790094,"score_spread":0.21385629787483856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236419281","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013765231,0.000078617864,0.049938828,0.000031289936,0.00007760921,0.00012695578,0.0000059675995,0.0004796247,0.94925976],"genre_scores_gemma":[0.009675643,0.0000069776397,0.0035954278,0.00009396745,0.003280715,0.000011714454,0.000243067,0.00007290689,0.9830196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989789,0.000012717517,0.00028590893,0.0003311108,0.00015124126,0.0002400886],"domain_scores_gemma":[0.9990662,0.000066293775,0.00018491231,0.0005401104,0.0000698245,0.00007266041],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009660567,0.00031541867,0.00048883655,0.000057438327,0.00007508397,0.000041270574,0.00023645128,0.000106333406,0.027370898],"category_scores_gemma":[5.177053e-7,0.00028889943,0.0003486262,0.00003200098,0.000038227638,0.000013914832,0.00012959042,0.00027761984,0.0005376142],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010995678,0.0000024222097,0.00011335401,0.0000014174451,0.00015286359,3.0680783e-7,0.0000012257623,0.00001797761,3.841438e-7,0.7000062,0.2708453,0.028857503],"study_design_scores_gemma":[0.000034982182,0.000009020653,0.0000115280955,0.00003874133,0.000095332216,1.07637796e-7,2.2293185e-7,0.0005905972,0.00000411902,0.27719977,0.72176296,0.0002526015],"about_ca_topic_score_codex":0.000055071563,"about_ca_topic_score_gemma":0.000019630077,"teacher_disagreement_score":0.4509177,"about_ca_system_score_codex":0.00001734711,"about_ca_system_score_gemma":0.000019607929,"threshold_uncertainty_score":0.9999563},"labels":[],"label_agreement":null},{"id":"W4236430477","doi":"10.1007/978-1-4614-6170-8_100082","title":"Network Structure Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.0082793596404076,"score_gpt":0.22371118068127066,"score_spread":0.21543182104086306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236430477","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000081510425,0.00007795404,0.16764958,0.00003423792,0.000048595208,0.000110485074,0.00004188894,0.00014056145,0.83188856],"genre_scores_gemma":[0.16455927,0.0000033138904,0.003952634,0.00017185004,0.0028922355,0.000004963862,0.0010269585,0.00006602837,0.8273227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985278,0.000018094443,0.00040353043,0.00050861307,0.00024515745,0.0002967564],"domain_scores_gemma":[0.99853367,0.00006104889,0.00032011885,0.00089548813,0.000093479764,0.000096227566],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000949141,0.00044388944,0.0009328128,0.00023649119,0.00010403851,0.000074700394,0.00036803138,0.00017626914,0.0593955],"category_scores_gemma":[4.5033e-7,0.00039163334,0.00091894,0.0001781105,0.000049897964,0.000020394666,0.0001617766,0.00040109846,0.00011631037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017820798,0.0000022006416,0.0012877998,0.0000022040053,0.003333421,5.0793176e-7,0.0000032074165,0.001327603,6.440952e-7,0.8956594,0.08627634,0.012104933],"study_design_scores_gemma":[0.000039426923,0.000010297445,0.00006352689,0.000013913688,0.003303875,1.0116144e-7,7.6179373e-7,0.0015809789,0.0000037851557,0.4713733,0.52320486,0.0004051956],"about_ca_topic_score_codex":0.00008614773,"about_ca_topic_score_gemma":0.00012808303,"teacher_disagreement_score":0.4369285,"about_ca_system_score_codex":0.000025056846,"about_ca_system_score_gemma":0.000022421555,"threshold_uncertainty_score":0.99985355},"labels":[],"label_agreement":null},{"id":"W4236496783","doi":"10.4018/978-1-61350-474-1.ch001","title":"Investigating the Properties of a Social Bookmarking and Tagging Network","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Bookmarking; Computer science; Friendship; Similarity (geometry); Social network (sociolinguistics); World Wide Web; Set (abstract data type); Meaning (existential); Popularity; Information retrieval; Social media; Social psychology; Artificial intelligence; Psychology","score_opus":0.030697724933811486,"score_gpt":0.23455676085875884,"score_spread":0.20385903592494736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236496783","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014741808,0.00049230317,0.00036147816,0.000034461216,0.00004892246,0.00027495288,0.000014497289,0.00006940176,0.9972298],"genre_scores_gemma":[0.9904338,0.0000010433719,0.00046229322,0.00012348079,0.0009765263,0.00002044753,0.000002364593,0.000036185753,0.007943848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988088,0.00003481366,0.0004069624,0.00028239054,0.00019349482,0.00027353934],"domain_scores_gemma":[0.9990997,0.000022709306,0.00049309194,0.00026005218,0.000074481206,0.00005001158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001958433,0.00031800353,0.0004804708,0.000024974348,0.00030140154,0.000062505955,0.00026929186,0.00010433323,0.000044686785],"category_scores_gemma":[0.0000022542454,0.000241239,0.00022543407,0.00002013612,0.00034758667,0.000026835658,0.00034487084,0.00029301204,0.0000028914274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044698204,0.000002305993,0.00043106303,0.000020759735,0.00023869638,4.67118e-7,0.00030710685,0.000002577954,0.000029680628,0.98378885,0.0014322175,0.013741788],"study_design_scores_gemma":[0.00009753257,0.000020567335,0.000071824754,0.00058029895,0.00029730072,0.0000017666338,0.00004542373,0.00012984443,0.00012149195,0.9761765,0.022104856,0.00035259256],"about_ca_topic_score_codex":0.00030918652,"about_ca_topic_score_gemma":0.00003602532,"teacher_disagreement_score":0.98928595,"about_ca_system_score_codex":0.0000326091,"about_ca_system_score_gemma":0.00007710644,"threshold_uncertainty_score":0.98374414},"labels":[],"label_agreement":null},{"id":"W4236508359","doi":"10.31235/osf.io/5kez8","title":"Mathematical Modeling and Inference for Degree-capped Ego-centric Network Sampling","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Inference; Estimator; Computer science; Sampling (signal processing); Social network (sociolinguistics); Degree (music); Social network analysis; Cluster analysis; Respondent; Data mining; Network analysis; Econometrics; Statistics; Machine learning; Artificial intelligence; Mathematics; Social media; Engineering","score_opus":0.09681001953123566,"score_gpt":0.34478672023335877,"score_spread":0.2479767007021231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236508359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019480614,0.00013251435,0.97093624,0.000037349473,0.00005135338,0.00069527596,0.000017462264,0.00017053395,0.008478632],"genre_scores_gemma":[0.74322873,0.000012012581,0.25478116,0.000020116315,0.0013770976,0.00018021453,0.00012086687,0.000037665886,0.00024209399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814147,0.000036538248,0.00054884754,0.00062417955,0.00016176888,0.00048722644],"domain_scores_gemma":[0.99857527,0.00032161706,0.00020887457,0.00057439465,0.00019719453,0.00012264894],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004087791,0.0003721019,0.0006447746,0.00009092093,0.00018512302,0.00022928069,0.00035084662,0.00015282589,0.0010825275],"category_scores_gemma":[0.000020978552,0.00033844923,0.00026393586,0.00013612419,0.000054030712,0.00004829543,0.0010661029,0.0003591838,0.000023783374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012938178,0.00046599685,0.015299141,0.00083134294,0.00194232,8.608396e-7,0.00033990314,0.19806775,0.000022651415,0.5810452,0.010757538,0.19109792],"study_design_scores_gemma":[0.00008981493,0.000013889502,0.000011153721,0.00014375872,0.00012762922,1.4789546e-7,0.000012415349,0.5874658,0.0000098023975,0.41154563,0.00034774683,0.00023219305],"about_ca_topic_score_codex":0.000072397066,"about_ca_topic_score_gemma":0.000006133072,"teacher_disagreement_score":0.72374815,"about_ca_system_score_codex":0.000028889526,"about_ca_system_score_gemma":0.00007356314,"threshold_uncertainty_score":0.9999068},"labels":[],"label_agreement":null},{"id":"W4236721362","doi":"10.1017/s0021900200002357","title":"An urn model arising from all-optical networks","year":2006,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Mathematics; Independent and identically distributed random variables; Combinatorics; Factorial; Generating function; Random variable; Integer (computer science); Probability-generating function; Moment-generating function; Function (biology); Joint probability distribution; Multivariate statistics; Probability theory; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.013021914087138015,"score_gpt":0.25467624821332946,"score_spread":0.24165433412619144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236721362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53139645,0.000018929513,0.46193737,0.00005148724,0.000024371257,0.000108482236,0.0000035864261,0.000027194845,0.0064321198],"genre_scores_gemma":[0.9003647,7.830176e-7,0.09851433,0.00004068383,0.0010300464,0.0000057207217,0.000022987846,0.000016333983,0.000004425865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837756,0.000044445034,0.00076256506,0.0002539472,0.00028421427,0.00027728235],"domain_scores_gemma":[0.9987775,0.00009369017,0.00043666497,0.0004154092,0.00014400609,0.00013274713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065831724,0.00018704963,0.0004382663,0.00005145465,0.0000808583,0.00010464087,0.00033461186,0.00007441088,0.00013107438],"category_scores_gemma":[0.0000022048705,0.00016144056,0.00024342629,0.00014278076,0.00007975926,0.0001651209,0.00005813626,0.00048323467,0.0000023016044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020395155,0.0011042253,0.028029716,0.0000045551396,0.00020920226,0.0000022691781,0.00010149833,0.8435753,0.0041013737,0.0914847,0.0018842255,0.029298957],"study_design_scores_gemma":[0.00025550232,0.000035569763,0.002565124,0.000008372335,0.00012924225,5.8358097e-7,0.000022105545,0.3430678,0.0013243399,0.65222657,0.00020921693,0.00015560206],"about_ca_topic_score_codex":0.00009729701,"about_ca_topic_score_gemma":0.000021324044,"teacher_disagreement_score":0.56074184,"about_ca_system_score_codex":0.000080590056,"about_ca_system_score_gemma":0.000066049935,"threshold_uncertainty_score":0.6583355},"labels":[],"label_agreement":null},{"id":"W4236864731","doi":"10.32920/ryerson.14657058","title":"Hybrid Distributed Techniques for Lower-dimensional Representation of Documents in the Scientific Literature","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Curse of dimensionality; Representation (politics); Viewpoints; Information retrieval; Benchmark (surveying); Citation; Data mining; Artificial intelligence; Pairwise comparison; Machine learning; Graph; Data science; Theoretical computer science; World Wide Web","score_opus":0.016167085548354204,"score_gpt":0.3133002238730757,"score_spread":0.2971331383247215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236864731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63701385,0.0004406886,0.3525917,0.0008212312,0.0005618928,0.0036141244,0.0021792834,0.00015667241,0.0026205706],"genre_scores_gemma":[0.97004896,0.0000031885438,0.013137325,0.00002404665,0.00015256295,0.00041639266,0.01594736,0.000013398546,0.00025677617],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982337,0.00014236193,0.0005104834,0.00057092257,0.0003473257,0.00019525962],"domain_scores_gemma":[0.99822617,0.00016045141,0.000307094,0.0008611786,0.00042052905,0.000024564959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005391076,0.0002190986,0.00039893738,0.00017759728,0.00009211818,0.0004485608,0.00048715936,0.000069698224,0.00018761885],"category_scores_gemma":[0.000016221446,0.0001645124,0.00041522115,0.0004988517,0.000079057725,0.00010836111,0.0004816645,0.00035461312,4.3453014e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005854952,0.00835062,0.06337197,0.0013772761,0.0031335955,0.00008684051,0.0049038106,0.010530446,0.02593166,0.1395111,0.62214756,0.12006963],"study_design_scores_gemma":[0.0010827434,0.00017762728,0.0060102865,0.003293705,0.0006657811,0.0000062217478,0.0009199712,0.037426095,0.33816853,0.5948973,0.015685966,0.0016658106],"about_ca_topic_score_codex":0.00015197288,"about_ca_topic_score_gemma":0.00001454313,"teacher_disagreement_score":0.6064616,"about_ca_system_score_codex":0.000035000543,"about_ca_system_score_gemma":0.0000923825,"threshold_uncertainty_score":0.67086214},"labels":[],"label_agreement":null},{"id":"W4237056663","doi":"10.1007/978-1-4614-6170-8_100719","title":"Social Network Representation","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Representation (politics); Computer science; Sociology; Political science","score_opus":0.024366185888368527,"score_gpt":0.2914124026608087,"score_spread":0.26704621677244017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237056663","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000033004806,0.000016985376,0.08540229,0.00009862885,0.000047142577,0.000118409174,0.000003005136,0.00012972878,0.9141805],"genre_scores_gemma":[0.044345528,0.0000027046926,0.0012784923,0.000085319254,0.0072143334,0.000013446472,0.00035632504,0.000053043306,0.9466508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908096,0.000015814274,0.0002681579,0.00029387648,0.00016676346,0.00017442119],"domain_scores_gemma":[0.9993511,0.000042947056,0.00022365867,0.0002848401,0.00006268025,0.00003481784],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000093317205,0.00021737523,0.00036426747,0.000046265093,0.00013016858,0.000046441495,0.00016084235,0.000099386365,0.008663618],"category_scores_gemma":[4.0502428e-7,0.00021730599,0.00034474535,0.000028688588,0.0000388536,0.000020919062,0.000099694975,0.00021495132,0.00025591982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014650777,0.0000018470947,0.00014413288,0.00000108194,0.00010060471,1.6906738e-7,0.0000057658344,0.000016942695,4.3137283e-7,0.6937159,0.27417648,0.03183518],"study_design_scores_gemma":[0.00003940222,0.000005658114,0.00002177933,0.000010900283,0.00008403236,6.344591e-8,0.0000012623286,0.00021763357,0.000004723573,0.48753247,0.51191086,0.00017118355],"about_ca_topic_score_codex":0.000056710127,"about_ca_topic_score_gemma":0.000012110073,"teacher_disagreement_score":0.2377344,"about_ca_system_score_codex":0.000018559642,"about_ca_system_score_gemma":0.000015444717,"threshold_uncertainty_score":0.9922426},"labels":[],"label_agreement":null},{"id":"W4237060534","doi":"10.1109/asonam.2016.7752399","title":"Stream clustering of tweets","year":2016,"lang":"en","type":"article","venue":"2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Partition (number theory); Cluster analysis; Social media; Process (computing); Data mining; Plan (archaeology); Cluster (spacecraft); Information retrieval; Data science; Machine learning; World Wide Web","score_opus":0.025249568505512375,"score_gpt":0.3295063109840421,"score_spread":0.30425674247852974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237060534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4057141,0.0005520836,0.53614044,0.00092003966,0.0005788508,0.00025720784,0.0001408617,0.00008535007,0.055611044],"genre_scores_gemma":[0.99608326,0.000730697,0.0018011323,0.000031643296,0.000601119,0.00002860166,0.000034490036,0.000015029527,0.00067402667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983514,0.00008360007,0.00053600094,0.00043466093,0.00030408573,0.00029024106],"domain_scores_gemma":[0.9987872,0.00026811898,0.0004370767,0.00024998028,0.00019329257,0.00006432031],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028899705,0.00023407074,0.0005433541,0.0002684735,0.00010868667,0.00005516447,0.00046991184,0.000070690716,0.00091558293],"category_scores_gemma":[0.000020218367,0.00018239842,0.0002601135,0.0004861714,0.00016185478,0.0002626963,0.00015887155,0.00013470376,0.0000032074909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001291314,0.00019435526,0.37025565,0.0000073509623,0.001304827,0.0000031819995,0.0003494617,0.005277412,0.00035720147,0.048440754,0.000815746,0.5728649],"study_design_scores_gemma":[0.0055930186,0.0005618637,0.14372705,0.0024910273,0.0021327902,0.000002161655,0.0036494515,0.7215996,0.0012678144,0.08966132,0.026119757,0.0031941484],"about_ca_topic_score_codex":0.0001096502,"about_ca_topic_score_gemma":0.00034884398,"teacher_disagreement_score":0.7163222,"about_ca_system_score_codex":0.00005498853,"about_ca_system_score_gemma":0.000031841613,"threshold_uncertainty_score":0.99999774},"labels":[],"label_agreement":null},{"id":"W4237081553","doi":"10.1017/s0021900200002515","title":"Navigation in small-world networks: a scale-free continuum model","year":2006,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Defense Advanced Research Projects Agency; Centre de Recherches Mathématiques; Scuola Normale Superiore","keywords":"Mathematics; Scale (ratio); Preferential attachment; Connection (principal bundle); Scale invariance; Statistical physics; Percolation (cognitive psychology); Small-world network; Complex network; Combinatorics; Geography; Statistics; Physics; Geometry; Psychology","score_opus":0.010206989251881703,"score_gpt":0.2274660986008347,"score_spread":0.21725910934895298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237081553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.818669,0.00003502174,0.16378143,0.00014381165,0.000035762576,0.00033918346,0.0000040160094,0.000027784898,0.01696398],"genre_scores_gemma":[0.9658296,6.0898356e-7,0.03356593,0.000020001078,0.00047391548,0.000024307536,0.000012054287,0.000013768236,0.00005979435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983848,0.00004992251,0.0009118511,0.00021088349,0.00018351412,0.0002590338],"domain_scores_gemma":[0.9987112,0.00007776199,0.00057294074,0.0003957453,0.00018136985,0.00006097993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001031559,0.00017100727,0.00044168197,0.00013075935,0.00005200031,0.00005366372,0.00037295255,0.00004531694,0.000046111138],"category_scores_gemma":[0.0000036234408,0.00015501055,0.00021811096,0.00047245238,0.00007033992,0.00010460485,0.0000970985,0.00043229986,0.0000012353953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046546388,0.0014285379,0.29195434,0.000042552016,0.0001128278,0.0000037377388,0.00018804494,0.5415707,0.0011094707,0.12545213,0.00911002,0.028562168],"study_design_scores_gemma":[0.0007232673,0.000021558959,0.007138894,0.000049204948,0.00005165932,9.055303e-7,0.000016652019,0.100105725,0.0008965514,0.8904531,0.00037371012,0.00016876237],"about_ca_topic_score_codex":0.00012546772,"about_ca_topic_score_gemma":0.0009725239,"teacher_disagreement_score":0.765001,"about_ca_system_score_codex":0.00012062797,"about_ca_system_score_gemma":0.00006488426,"threshold_uncertainty_score":0.6321147},"labels":[],"label_agreement":null},{"id":"W4237311408","doi":"10.32920/ryerson.14660925","title":"Domination number within on-line social networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Domination analysis; Line (geometry); Upper and lower bounds; Combinatorics; Graph; Computer science; Discrete mathematics; Mathematics; Theoretical computer science","score_opus":0.02557003619041839,"score_gpt":0.3180228334858797,"score_spread":0.2924527972954613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237311408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046650983,0.000018376117,0.8238121,0.00038930555,0.00043505008,0.00030530427,0.000012726233,0.00023570593,0.12814045],"genre_scores_gemma":[0.9882148,0.000002947949,0.0051818998,0.00013301808,0.002846117,0.00009243819,0.0010590071,0.00003670997,0.0024330497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985306,0.00010903923,0.00040455116,0.0005025077,0.00023282816,0.00022045239],"domain_scores_gemma":[0.9990206,0.000056654007,0.00028998006,0.00041589877,0.00016911479,0.00004780538],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023589053,0.00029922073,0.0004647842,0.000051703042,0.00013138464,0.00021590355,0.0002623943,0.0001786365,0.0049075563],"category_scores_gemma":[0.0000027386423,0.00029391094,0.00041078427,0.00017910081,0.00003456045,0.00004039415,0.00056476746,0.000795707,0.000031053114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064163876,0.0011048425,0.017158082,0.000051177874,0.0019909723,0.000012794524,0.0010202272,0.37054858,0.000026110487,0.3610204,0.11516178,0.13184088],"study_design_scores_gemma":[0.00063570024,0.000035941484,0.0018991547,0.00024616165,0.0004933938,7.642651e-7,0.00050133816,0.90820193,0.0014421812,0.081701234,0.0033664855,0.0014757017],"about_ca_topic_score_codex":0.00032047398,"about_ca_topic_score_gemma":0.00004996024,"teacher_disagreement_score":0.94156384,"about_ca_system_score_codex":0.00006132743,"about_ca_system_score_gemma":0.00007364202,"threshold_uncertainty_score":0.9999513},"labels":[],"label_agreement":null},{"id":"W4237428540","doi":"10.1007/978-1-4939-7131-2_100726","title":"Network Diagram","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Diagram; Computer science; Database","score_opus":0.016199466968578487,"score_gpt":0.24297727822584073,"score_spread":0.22677781125726224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237428540","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003798561,0.000099223,0.02995437,0.000035173947,0.00010551604,0.00015527668,0.0000097459715,0.00020448108,0.9694324],"genre_scores_gemma":[0.0075643137,0.0000077964605,0.0029106,0.00014240829,0.006741918,0.000014822612,0.00019050231,0.00006998157,0.9823577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989477,0.000007889824,0.00027539986,0.00034659787,0.00015663881,0.0002657804],"domain_scores_gemma":[0.99906594,0.000037155583,0.00016908142,0.0005796488,0.000073500574,0.00007465843],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000094386145,0.00031633818,0.00040710458,0.000052519055,0.00008666891,0.000053757434,0.000269129,0.000112033216,0.094148435],"category_scores_gemma":[3.2677335e-7,0.00028535735,0.000328175,0.000026722702,0.00008426508,0.000028622031,0.00017909282,0.00024274056,0.0015898574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010640135,0.0000042590727,0.00010385858,9.773631e-7,0.00012048788,4.7999015e-7,0.0000032963603,0.0000028435725,1.3138173e-7,0.54502636,0.43636948,0.01836674],"study_design_scores_gemma":[0.000022456503,0.000015590816,0.0000045290517,0.000026139083,0.000071093746,1.0054091e-7,6.4835126e-7,0.00009538967,0.0000031646246,0.46208343,0.5374814,0.00019600964],"about_ca_topic_score_codex":0.000039643022,"about_ca_topic_score_gemma":0.000019560835,"teacher_disagreement_score":0.10111198,"about_ca_system_score_codex":0.000019199866,"about_ca_system_score_gemma":0.00002610629,"threshold_uncertainty_score":0.9999599},"labels":[],"label_agreement":null},{"id":"W4238028577","doi":"10.1007/978-1-4939-7131-2_100699","title":"Multilayered Social Network","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.02095749094030548,"score_gpt":0.26466408888395776,"score_spread":0.2437065979436523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238028577","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018638639,0.000036674,0.008630796,0.000043572243,0.000106576015,0.00017298665,0.000021293201,0.0002086674,0.9907608],"genre_scores_gemma":[0.02921089,0.0000029505456,0.0033636831,0.000098059856,0.012007763,0.000014067659,0.00015505734,0.00008769953,0.9550598],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987957,0.000011244534,0.0003247624,0.00037954884,0.00018679026,0.00030195163],"domain_scores_gemma":[0.9992137,0.000032118685,0.00023068022,0.0003536742,0.000110534085,0.000059284186],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009775455,0.0003517316,0.00048980874,0.00005614552,0.00019419244,0.00005500622,0.00028305248,0.00016327441,0.06910683],"category_scores_gemma":[3.2802888e-7,0.00033863125,0.0004775344,0.000031618503,0.0001006284,0.00003137682,0.0001972928,0.0002795754,0.0009811575],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042663596,0.00000783655,0.000057792728,0.0000017776531,0.00027409298,6.340409e-7,0.000023289365,0.0000035291498,0.0000010394979,0.44547424,0.5393037,0.014847783],"study_design_scores_gemma":[0.00007091347,0.0000137678235,0.000011923381,0.000021358399,0.00011239958,1.0033072e-7,0.000003442573,0.0002786412,0.000007988124,0.30071765,0.6984483,0.00031350434],"about_ca_topic_score_codex":0.000041692954,"about_ca_topic_score_gemma":0.00002748911,"teacher_disagreement_score":0.15914458,"about_ca_system_score_codex":0.000029095117,"about_ca_system_score_gemma":0.000034079,"threshold_uncertainty_score":0.9999066},"labels":[],"label_agreement":null},{"id":"W4238964971","doi":"10.32920/ryerson.14665329","title":"Characterization of user networks in Facebook","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Degree distribution; Weibull distribution; World Wide Web; Graph; Log-normal distribution; Complex network; Theoretical computer science; Mathematics; Statistics","score_opus":0.011686428939996397,"score_gpt":0.2520379447406019,"score_spread":0.24035151580060554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238964971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4656036,0.0000124505395,0.5172644,0.000028462422,0.000064035885,0.00039639662,0.00000857777,0.000040582232,0.016581487],"genre_scores_gemma":[0.9962377,0.000014190178,0.001078911,0.000018260309,0.00016883948,0.00010807423,0.0010178951,0.00001659596,0.0013395295],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905646,0.000064720545,0.00038172482,0.000271698,0.000091583555,0.00013379048],"domain_scores_gemma":[0.9992579,0.000018022447,0.00022124154,0.00040339938,0.00007619243,0.000023194356],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010803532,0.00015836924,0.00040036943,0.00009741841,0.000010841038,0.000044498665,0.00018287156,0.000092061426,0.003884244],"category_scores_gemma":[7.501126e-7,0.00016550344,0.00017260779,0.00014623892,0.000016858121,0.000041172203,0.0004916119,0.0003073559,0.0000028286256],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003217747,0.0009679513,0.7150679,0.0001914178,0.0010734274,0.000007549243,0.00084999355,0.07142652,0.03981508,0.048917707,0.0013005057,0.12034972],"study_design_scores_gemma":[0.0011559977,0.000055410936,0.32602826,0.0022155524,0.00050416717,5.388386e-7,0.00048434603,0.5420754,0.081548505,0.025309324,0.01776841,0.0028541095],"about_ca_topic_score_codex":0.00030082333,"about_ca_topic_score_gemma":0.00004809534,"teacher_disagreement_score":0.5306341,"about_ca_system_score_codex":0.000020018351,"about_ca_system_score_gemma":0.00004901036,"threshold_uncertainty_score":0.9970263},"labels":[],"label_agreement":null},{"id":"W4239049870","doi":"10.1109/asonam.2014.6921599","title":"SSRM: Structural social role mining for dynamic social networks","year":2014,"lang":"en","type":"article","venue":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Betweenness centrality; Centrality; Social network (sociolinguistics); Automatic summarization; Leverage (statistics); Data science; Social network analysis; Dynamic network analysis; Computer science; Community structure; Complex network; Trustworthiness; Social media; Artificial intelligence; World Wide Web; Computer security","score_opus":0.014431478084511796,"score_gpt":0.32845742176657466,"score_spread":0.3140259436820629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239049870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32614356,0.00065899733,0.65236175,0.0013703132,0.0014101482,0.00064209563,0.0001943492,0.00020959576,0.017009204],"genre_scores_gemma":[0.99119604,0.00015971067,0.00333174,0.00017484512,0.003909208,0.00014338407,0.00062680326,0.000051175397,0.00040706823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968199,0.00023680291,0.0008238615,0.00089728675,0.00047497894,0.0007471276],"domain_scores_gemma":[0.99804693,0.00044697677,0.0007843156,0.00026404564,0.0003480667,0.000109652974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074955437,0.0005279004,0.0010401288,0.0003339538,0.0009130973,0.00033555046,0.00083714817,0.00024194598,0.00056400377],"category_scores_gemma":[0.000031793817,0.0005452583,0.0006464471,0.00055824284,0.00027208746,0.00036685675,0.00021196107,0.00047014887,0.000004532746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004731352,0.00021945014,0.13596839,0.000023565804,0.0028909838,0.0000021986384,0.0022633297,0.058529913,0.000071387636,0.19670855,0.013528219,0.5893209],"study_design_scores_gemma":[0.00086300605,0.00007892245,0.016240316,0.0000423925,0.00051367766,3.9177252e-7,0.0011988089,0.95691794,0.000004695828,0.017329251,0.006132801,0.00067777315],"about_ca_topic_score_codex":0.00011221312,"about_ca_topic_score_gemma":0.0007618976,"teacher_disagreement_score":0.898388,"about_ca_system_score_codex":0.00013438455,"about_ca_system_score_gemma":0.00004529533,"threshold_uncertainty_score":0.9996999},"labels":[],"label_agreement":null},{"id":"W4239157520","doi":"10.1007/978-1-4614-6170-8_100861","title":"Evolving Community Detection","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.01795532983380879,"score_gpt":0.24092109947102303,"score_spread":0.22296576963721423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239157520","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040374252,0.000013572317,0.22999512,0.0000066023053,0.00003358357,0.00007529269,0.0000022811798,0.00014856328,0.7696846],"genre_scores_gemma":[0.5733481,0.0000011928189,0.0004584303,0.000023306913,0.00039619752,0.000005615045,0.000051274623,0.0000310281,0.42568484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993576,0.000041119525,0.00021538777,0.00014786032,0.00011439958,0.00012366944],"domain_scores_gemma":[0.9990208,0.00009049573,0.00015991283,0.00060301315,0.000082724444,0.000043034466],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002032534,0.00021946784,0.00030009975,0.00009379313,0.0002220472,0.000049012408,0.00022435513,0.00008828114,0.00757286],"category_scores_gemma":[0.000001445909,0.00021537142,0.00025170707,0.000018206738,0.000035701,0.000028185192,0.00015409014,0.0006826992,0.00019536058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020834314,0.0000138663845,0.0001560372,0.000010184683,0.0002277665,1.634808e-7,0.000024727982,0.0000041890007,0.00008895296,0.7210152,0.010913066,0.26754376],"study_design_scores_gemma":[0.0000870376,0.000050821152,0.000073697694,0.00008922247,0.00019172762,4.7215096e-7,0.000014791833,0.001930842,0.0008230523,0.5379279,0.45829424,0.0005161905],"about_ca_topic_score_codex":0.00073290314,"about_ca_topic_score_gemma":0.00022014078,"teacher_disagreement_score":0.57330775,"about_ca_system_score_codex":0.000037307094,"about_ca_system_score_gemma":0.000010566389,"threshold_uncertainty_score":0.99333435},"labels":[],"label_agreement":null},{"id":"W4239394528","doi":"10.1007/978-1-4939-7131-2_101145","title":"Social Network","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Sociology","score_opus":0.01990111836079321,"score_gpt":0.2691626419771706,"score_spread":0.24926152361637738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239394528","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000047321296,0.00003276021,0.009019335,0.000058498164,0.0000621766,0.0001056836,0.000007770117,0.00015746724,0.9905516],"genre_scores_gemma":[0.007887283,0.0000021913468,0.0014566435,0.00009101853,0.013596572,0.000007947249,0.0001520952,0.00006064059,0.9767456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990869,0.0000072614157,0.00023857292,0.00028423726,0.00015070249,0.00023229118],"domain_scores_gemma":[0.99941844,0.000020955576,0.0001654757,0.0002750291,0.00007755178,0.000042539636],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008115332,0.00026453688,0.00037446633,0.000042048414,0.00015519426,0.000044313976,0.00022484,0.00011875204,0.074985504],"category_scores_gemma":[1.5537655e-7,0.00025272372,0.00037835643,0.000025615573,0.00008687522,0.000023567822,0.00015891503,0.00022426764,0.0010370329],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010743765,0.0000024803144,0.000030212968,7.1151806e-7,0.0001226772,2.3967962e-7,0.000007400929,4.6836635e-7,1.3636397e-7,0.53238463,0.46116173,0.0062882216],"study_design_scores_gemma":[0.000022502589,0.000007636915,0.0000037337088,0.000010542294,0.00006481009,5.3827147e-8,0.0000010926385,0.000027974607,0.0000021695962,0.4597279,0.53997016,0.0001613946],"about_ca_topic_score_codex":0.00002133254,"about_ca_topic_score_gemma":0.000013634535,"teacher_disagreement_score":0.07880844,"about_ca_system_score_codex":0.000020528683,"about_ca_system_score_gemma":0.000027898315,"threshold_uncertainty_score":0.9999925},"labels":[],"label_agreement":null},{"id":"W4239409154","doi":"10.22215/etd/2012-06831","title":"On measuring influence and its properties in social networks","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Humanities; Computer science; Political science; Art","score_opus":0.024824670797142002,"score_gpt":0.2638512979825556,"score_spread":0.23902662718541356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239409154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96681434,0.00040719213,0.0001110481,0.000007350968,0.00004034215,0.00019564574,9.055906e-7,0.00004849939,0.03237466],"genre_scores_gemma":[0.9966329,0.0000068993395,0.000016006872,0.000012008619,0.00034317374,0.000074928765,0.000078864934,0.000022579645,0.0028126517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992048,0.000035148612,0.0002090538,0.00020105939,0.00012762888,0.00022230863],"domain_scores_gemma":[0.99970603,0.000019305182,0.00010388764,0.00008521402,0.000053815293,0.00003175226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010955803,0.00019391548,0.00026300224,0.000106358646,0.000100958176,0.00004505486,0.00010293122,0.00008982975,0.00014523062],"category_scores_gemma":[0.000002628997,0.00017020281,0.000062914136,0.00012553886,0.000008727453,0.000098384255,0.000025437432,0.00029729868,0.0000060539137],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005599264,0.0012571088,0.2301142,0.00056548556,0.001111037,0.0000044466515,0.0077438755,0.013764904,0.004674525,0.42187133,0.005007787,0.31332535],"study_design_scores_gemma":[0.0013544322,0.00015281423,0.8968947,0.0025993574,0.00060003565,5.8400497e-7,0.0023965917,0.049814433,0.015217095,0.025128027,0.0018697851,0.0039721685],"about_ca_topic_score_codex":0.00020404444,"about_ca_topic_score_gemma":0.00021373149,"teacher_disagreement_score":0.6667805,"about_ca_system_score_codex":0.000022940018,"about_ca_system_score_gemma":0.000017950744,"threshold_uncertainty_score":0.69406694},"labels":[],"label_agreement":null},{"id":"W4240002048","doi":"10.1109/asonam.2014.6921602","title":"A semantic model for academic social network analysis","year":2014,"lang":"en","type":"article","venue":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Social network (sociolinguistics); Construct (python library); Data science; Social network analysis; Foundation (evidence); Semantic data model; Artificial intelligence; Knowledge management; World Wide Web; Social media; Political science; Programming language","score_opus":0.028535130806629973,"score_gpt":0.3484171722931093,"score_spread":0.31988204148647936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240002048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03684265,0.00027212303,0.9560545,0.0006357604,0.0002647879,0.00026503074,0.00007062806,0.000077976314,0.0055165295],"genre_scores_gemma":[0.9893814,0.00048717458,0.0057623405,0.00025701144,0.0027926604,0.00017967471,0.000448001,0.000037067643,0.00065471436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680907,0.00020714202,0.0008778656,0.0009188408,0.00049083284,0.0006962548],"domain_scores_gemma":[0.99795556,0.00048281715,0.0007520192,0.00035638863,0.0003293348,0.00012390259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011406536,0.00046805173,0.0012134417,0.00055269286,0.00055640494,0.00019713232,0.00087031117,0.0001988264,0.00037017866],"category_scores_gemma":[0.000035309997,0.00047635502,0.00089369604,0.0013449016,0.00019751849,0.00031554743,0.00019207947,0.00052347657,0.0000068342742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016127204,0.00012613309,0.14876221,0.000011382365,0.0045379917,8.9378216e-7,0.0005562792,0.5909481,0.000013937183,0.19191474,0.012419468,0.050547604],"study_design_scores_gemma":[0.0004658142,0.00003686929,0.005051704,0.000032748438,0.002196174,1.5375848e-7,0.00017586912,0.948322,0.0000026122666,0.04057634,0.0026566405,0.00048309594],"about_ca_topic_score_codex":0.00009203118,"about_ca_topic_score_gemma":0.00072688743,"teacher_disagreement_score":0.9525387,"about_ca_system_score_codex":0.000086819935,"about_ca_system_score_gemma":0.000045845165,"threshold_uncertainty_score":0.9997688},"labels":[],"label_agreement":null},{"id":"W4240166623","doi":"10.22215/etd/2016-11356","title":"Network Kriging - Predicting the Attributes of Nodes in a Network","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Kriging; Exploit; Node (physics); Computer science; Data mining; Machine learning; Engineering; Computer security","score_opus":0.011718772297637367,"score_gpt":0.26802711055139555,"score_spread":0.2563083382537582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240166623","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3737829,0.0038911577,0.048884444,0.00043746055,0.0013424432,0.002172649,0.00008322711,0.00049960305,0.5689061],"genre_scores_gemma":[0.9925102,0.000022635157,0.0010572164,0.00002128572,0.002133248,0.000099258374,0.00042792628,0.000040909417,0.0036872926],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826825,0.00010919387,0.00064222317,0.00030788867,0.00021149943,0.00046097444],"domain_scores_gemma":[0.9984357,0.0004840025,0.00053213345,0.00041625206,0.00010086261,0.00003104814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055071525,0.00028200177,0.0005433763,0.000073253716,0.0001642476,0.000042580818,0.0004236047,0.000096021424,0.000768943],"category_scores_gemma":[0.000008259794,0.00017767283,0.00024755244,0.0005364998,0.000033486016,0.00006918254,0.00007296146,0.0003228763,0.0000058020764],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006031587,0.0000673416,0.84933823,0.00005799567,0.00046501268,9.52445e-7,0.00037379438,0.0050163763,0.00008020786,0.06736598,0.032931805,0.04424196],"study_design_scores_gemma":[0.0017525788,0.00017302037,0.18586268,0.011919927,0.0015615012,0.0000011772563,0.0050230618,0.03136,0.003325458,0.7287613,0.027085235,0.0031740468],"about_ca_topic_score_codex":0.00080121105,"about_ca_topic_score_gemma":0.00048533067,"teacher_disagreement_score":0.6634756,"about_ca_system_score_codex":0.000022040229,"about_ca_system_score_gemma":0.00007271226,"threshold_uncertainty_score":0.8419387},"labels":[],"label_agreement":null},{"id":"W4240323299","doi":"10.1007/978-1-4939-7131-2_100582","title":"Large-Scale Network","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Scale (ratio); Computer science; Geography; Cartography","score_opus":0.011320617819041302,"score_gpt":0.24167560509231492,"score_spread":0.2303549872732736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240323299","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010176408,0.00008902232,0.05797606,0.000028228931,0.000108170854,0.0001473301,0.000027824031,0.00019494237,0.94141823],"genre_scores_gemma":[0.003270985,0.00000843798,0.0052714846,0.00013536145,0.006318586,0.000011767276,0.00026495982,0.000077761346,0.98464066],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875754,0.000008949973,0.00030456937,0.00039816176,0.00017749844,0.00035328692],"domain_scores_gemma":[0.99896526,0.00002957068,0.00017821569,0.000647603,0.00009383578,0.000085520165],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013985507,0.00033232916,0.0004527974,0.0000564383,0.00012126575,0.000049830945,0.0002915754,0.00012979154,0.13429107],"category_scores_gemma":[2.3132206e-7,0.0003070296,0.00040198406,0.000035502228,0.000060038285,0.000034512414,0.000245015,0.00027044036,0.0017141006],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001805819,0.000009277396,0.00017029101,0.0000016094915,0.00015254201,4.947209e-7,0.000019859055,0.000003750986,2.7396086e-7,0.47206426,0.52541006,0.0021657955],"study_design_scores_gemma":[0.000043578588,0.000014833202,0.0000047413046,0.00003454703,0.00008341825,1.3383169e-7,0.0000057516686,0.0002777881,0.000005884519,0.34868097,0.65061563,0.00023271093],"about_ca_topic_score_codex":0.000016013175,"about_ca_topic_score_gemma":0.00006679856,"teacher_disagreement_score":0.13257696,"about_ca_system_score_codex":0.000020722882,"about_ca_system_score_gemma":0.000028326767,"threshold_uncertainty_score":0.9999382},"labels":[],"label_agreement":null},{"id":"W4240629830","doi":"10.21742/ijarbms.2020.4.1.04","title":"Identifying Social Media Influencers using Graph Based Analytics","year":2020,"lang":"en","type":"article","venue":"International Journal of Advanced Research in Big Data Management System","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Influencer marketing; Computer science; Social media; Data science; Graph; Social network analysis; Conversation; Analytics; Social media analytics; Social network (sociolinguistics); Information sharing; World Wide Web; Data mining; Theoretical computer science","score_opus":0.3640857918619506,"score_gpt":0.4542945299302598,"score_spread":0.0902087380683092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240629830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10247243,0.00021008262,0.8891464,0.0028919126,0.0014255737,0.00056054234,0.00026472745,0.00005772744,0.0029705963],"genre_scores_gemma":[0.985431,0.000018751238,0.013065815,0.000043256812,0.0013319713,0.00000434141,0.00008525096,0.00001556843,0.000004042609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678814,0.0002470455,0.0007516935,0.0002948709,0.0016354359,0.00028283574],"domain_scores_gemma":[0.9984204,0.00018652272,0.00043349463,0.00030174447,0.0005473306,0.00011049734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017388677,0.00012499257,0.00027877078,0.00095503096,0.00009879353,0.00022027723,0.0022481275,0.000023474553,0.00003044582],"category_scores_gemma":[0.000043661348,0.00012182598,0.000115569586,0.0010040518,0.0000772685,0.0006131476,0.00085673895,0.00043508635,0.0000049841883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014721359,0.0007449792,0.07024891,0.0009464074,0.005747168,0.0027060919,0.0019266317,0.19339573,0.004770181,0.08276375,0.012583842,0.6226942],"study_design_scores_gemma":[0.013725833,0.00026429846,0.02031027,0.007744401,0.000694796,0.00002960481,0.056747403,0.8028719,0.0022504774,0.029461117,0.06401457,0.0018853722],"about_ca_topic_score_codex":0.000044811743,"about_ca_topic_score_gemma":0.000010955403,"teacher_disagreement_score":0.8829586,"about_ca_system_score_codex":0.00028692718,"about_ca_system_score_gemma":0.00008371104,"threshold_uncertainty_score":0.4967919},"labels":[],"label_agreement":null},{"id":"W4240710003","doi":"10.1002/9780470515143.index","title":"Index","year":2007,"lang":"en","type":"paratext","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Index (typography); Library science; Humanities; Computer science; Art; World Wide Web","score_opus":0.012749801871801667,"score_gpt":0.29957844968235503,"score_spread":0.28682864781055334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240710003","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000329275,0.0000985293,0.23937704,0.0000138653,0.00020431665,0.0000832098,0.000014524422,0.000042221363,0.7601334],"genre_scores_gemma":[0.11738967,0.000007860554,0.0010550845,0.0000959972,0.002426844,0.000017186556,0.00055860064,0.000036660393,0.87841207],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990607,0.000016147249,0.00024377822,0.00026564448,0.00015554094,0.00025819443],"domain_scores_gemma":[0.9993332,0.000034813947,0.0001207322,0.00039468624,0.000056197056,0.000060352617],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009669258,0.0002257155,0.00033496827,0.00016565129,0.00004710169,0.000048215465,0.00026724377,0.00010796033,0.18894479],"category_scores_gemma":[2.8260092e-7,0.0002024913,0.00023851971,0.00022017243,0.000026812488,0.000025424975,0.00011145395,0.0003431342,0.013403016],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013186888,0.000023046361,0.0005355684,0.0000029712537,0.00010858455,2.7793678e-7,0.0000034790787,0.00001652671,0.0000023222328,0.004704509,0.97204095,0.022560416],"study_design_scores_gemma":[0.000048484104,0.0000062332274,0.00004214152,0.000017233713,0.000027828537,9.586626e-8,0.00001042399,0.00019462833,0.00021585019,0.0019259492,0.9972665,0.00024468478],"about_ca_topic_score_codex":0.0006935355,"about_ca_topic_score_gemma":0.000013476384,"teacher_disagreement_score":0.23832196,"about_ca_system_score_codex":0.00002208438,"about_ca_system_score_gemma":0.000044634595,"threshold_uncertainty_score":0.9873652},"labels":[],"label_agreement":null},{"id":"W4240758720","doi":"10.32920/14668887","title":"Dimensionality of Social Networks Using Motifs and Eigenvalues","year":2021,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; National Science Foundation","keywords":"Curse of dimensionality; Eigenvalues and eigenvectors; Dimension (graph theory); Exploit; Logarithm; Metric (unit); Intrinsic dimension; Computer science; Complex network; Social network (sociolinguistics); Space (punctuation); Distribution (mathematics); Theoretical computer science; Mathematics; Artificial intelligence; Social media; Combinatorics; Physics; Engineering; Computer security; World Wide Web","score_opus":0.019201407795605325,"score_gpt":0.2892014757661063,"score_spread":0.27000006797050097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240758720","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8684299,0.000115807605,0.12589811,0.000047132144,0.000018161636,0.000034112265,0.0000035173616,0.000022068934,0.005431203],"genre_scores_gemma":[0.9931244,0.0000013953019,0.006507953,0.000022854261,0.00015618943,9.400401e-7,0.000016010423,0.000005342827,0.00016490671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949604,0.000047642185,0.00015045938,0.00013118454,0.00007666926,0.00009802602],"domain_scores_gemma":[0.9997096,0.00003280055,0.00005635389,0.00009880066,0.00007929856,0.000023156068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000913459,0.000064544554,0.00016785214,0.000014677155,0.000079302445,0.000014631175,0.000034567987,0.00001891279,0.0007437101],"category_scores_gemma":[0.0000012252826,0.00006147828,0.00007991171,0.0001286337,0.00004472588,0.00003374092,0.00010761093,0.000051061274,3.636564e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013183209,0.000333666,0.3846582,0.000019296704,0.0005941849,0.0000033975605,0.00033488253,0.0034569404,0.011808878,0.56101924,0.003365025,0.034393124],"study_design_scores_gemma":[0.00069126365,0.000033282828,0.14098078,0.000056060155,0.00048301587,0.0000036373801,0.0009677614,0.6676135,0.042573802,0.14254482,0.0033046938,0.0007473862],"about_ca_topic_score_codex":0.00016489979,"about_ca_topic_score_gemma":0.0000067829883,"teacher_disagreement_score":0.66415656,"about_ca_system_score_codex":0.0000060455586,"about_ca_system_score_gemma":0.000021148158,"threshold_uncertainty_score":0.81431043},"labels":[],"label_agreement":null},{"id":"W4241290236","doi":"10.1007/978-1-4614-6170-8_100271","title":"Network Diagram","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Diagram; Computer science; Database","score_opus":0.012514032320073283,"score_gpt":0.22877222399893887,"score_spread":0.2162581916788656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241290236","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.324663e-7,0.00008044736,0.15078475,0.000048496982,0.00007278774,0.00012592845,0.00000466014,0.00018025152,0.84870183],"genre_scores_gemma":[0.025728453,0.000007040677,0.0021582658,0.00019938794,0.004193824,0.000016430437,0.0001991167,0.000071217575,0.96742624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896187,0.000010915605,0.00028561067,0.0003299682,0.00015571516,0.0002559077],"domain_scores_gemma":[0.99905807,0.000059408172,0.00017989583,0.0005782797,0.000047041016,0.0000773161],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000113432674,0.0003208133,0.00047502818,0.000051380615,0.0000750541,0.0000499661,0.00025877767,0.0001096534,0.019817704],"category_scores_gemma":[3.833623e-7,0.00029048597,0.00036117018,0.000021124524,0.000045290933,0.000015200536,0.00014494451,0.0002981706,0.00071362074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.167722e-7,0.000002567523,0.00013541042,0.0000014176862,0.00009514751,3.0496068e-7,0.0000010758117,0.000025159774,1.13402116e-7,0.69446623,0.23719428,0.06807756],"study_design_scores_gemma":[0.000026561416,0.000010729708,0.000005888424,0.000025987381,0.00007453719,9.000473e-8,2.2647687e-7,0.0002634645,0.0000015846739,0.41034234,0.5890371,0.00021149954],"about_ca_topic_score_codex":0.000048690003,"about_ca_topic_score_gemma":0.00001441011,"teacher_disagreement_score":0.35184282,"about_ca_system_score_codex":0.000016235514,"about_ca_system_score_gemma":0.000018282186,"threshold_uncertainty_score":0.9999547},"labels":[],"label_agreement":null},{"id":"W4241551364","doi":"10.1007/978-1-4614-6170-8_100999","title":"Social Network Analysis Packages","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.013917012708803139,"score_gpt":0.2611688104646958,"score_spread":0.24725179775589268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241551364","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000061498445,0.000052884057,0.14176375,0.0000995949,0.000029879131,0.00010424544,0.000015179014,0.00017728398,0.8577511],"genre_scores_gemma":[0.1459432,0.0000065431072,0.0013008754,0.00011091282,0.0050225575,0.0000138422465,0.0006284483,0.00006936293,0.8469043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984418,0.000028390581,0.00043248257,0.00048750077,0.00026963372,0.0003401653],"domain_scores_gemma":[0.9988616,0.00007655253,0.0003574141,0.000528103,0.000098945624,0.00007736596],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001951625,0.00043295702,0.0010231644,0.00023195424,0.00021268609,0.000090011585,0.00033812478,0.00017724189,0.020353671],"category_scores_gemma":[4.987498e-7,0.0004083334,0.0014990214,0.00018287526,0.000077666315,0.000022845335,0.00017975275,0.0003551232,0.00026551526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001705377,0.0000050051967,0.0010239402,0.0000021370993,0.0037554668,5.230375e-7,0.000008098079,0.000088459135,2.3940115e-7,0.8011852,0.17727862,0.01665061],"study_design_scores_gemma":[0.000053266678,0.000011071192,0.00013775821,0.00001092985,0.0038681633,4.8184738e-8,0.0000023620687,0.00062071945,0.0000027964456,0.3388739,0.655945,0.00047398548],"about_ca_topic_score_codex":0.000082347615,"about_ca_topic_score_gemma":0.000078498386,"teacher_disagreement_score":0.4786664,"about_ca_system_score_codex":0.000029306211,"about_ca_system_score_gemma":0.000022956017,"threshold_uncertainty_score":0.99983686},"labels":[],"label_agreement":null},{"id":"W4241878779","doi":"10.5771/0949-6181-2006-4-381","title":"News / Information","year":2006,"lang":"en","type":"article","venue":"Journal of East European Management Studies","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Variety (cybernetics); Theme (computing); Presentation (obstetrics); Estonian; Middle East; Regional science; Geography; Computer science; Library science; Political science; Management science; Data science; World Wide Web; Engineering; Artificial intelligence; Linguistics; Archaeology","score_opus":0.014112771512118826,"score_gpt":0.25195309682663186,"score_spread":0.23784032531451305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241878779","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035967063,0.0005745746,0.09351942,0.0009637193,0.00026567807,0.00017557264,0.0000027240742,0.000055922897,0.8684753],"genre_scores_gemma":[0.99460953,0.000053549913,0.0036449993,0.000080056605,0.00065588835,0.000001091611,0.0000039128035,0.000008061345,0.0009428904],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911255,0.00006309675,0.00048004626,0.000050450635,0.00018225162,0.00011160969],"domain_scores_gemma":[0.9992351,0.000010680133,0.0004657786,0.00011546658,0.00015318324,0.000019777211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031800714,0.00009761741,0.00017874404,0.00017094509,0.000084485655,0.0000715896,0.00016826835,0.0000029192065,0.00004977921],"category_scores_gemma":[0.000002303863,0.00007693,0.00013773683,0.00015821583,0.000025548547,0.000330062,0.00015102886,0.000073427436,0.00006415679],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003541077,0.00020519638,0.05649063,0.000056553512,0.002069522,0.00004053367,0.00048684687,0.0027621456,0.000020471634,0.114166394,0.54771334,0.27595294],"study_design_scores_gemma":[0.00093557057,0.000109830566,0.05687182,0.0001651656,0.0004746494,0.0000041601984,0.0053725494,0.00014243407,0.000027668357,0.021192448,0.9144094,0.00029431202],"about_ca_topic_score_codex":0.0000066688735,"about_ca_topic_score_gemma":9.4264647e-7,"teacher_disagreement_score":0.9586425,"about_ca_system_score_codex":0.00001921924,"about_ca_system_score_gemma":0.0000023069204,"threshold_uncertainty_score":0.31371143},"labels":[],"label_agreement":null},{"id":"W4242060137","doi":"10.1504/ijcm.2018.094479","title":"Connectivity and closeness among international financial institutions: a network theory perspective","year":2018,"lang":"en","type":"article","venue":"International Journal of Comparative Management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Center for Interuniversity Research and Analysis on Organizations; Polytechnique Montréal; HEC Montréal","funders":"","keywords":"Betweenness centrality; Closeness; Financial networks; Multinational corporation; Centrality; Systemic risk; Network theory; Sample (material); Perspective (graphical); Business; Complex network; Financial risk; Financial economics; Economics; Finance; Financial crisis; Computer science; Artificial intelligence; Mathematics","score_opus":0.025901383217169914,"score_gpt":0.34823423167662976,"score_spread":0.32233284845945986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242060137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50591195,0.00010829353,0.39024568,0.00049707067,0.0013102501,0.0001942773,0.00001268315,0.000021161522,0.10169863],"genre_scores_gemma":[0.99413514,0.00001618538,0.0029811335,0.00010102062,0.0025012537,0.0000124302705,0.000006256861,0.0000058422493,0.00024072472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987888,0.000128511,0.00037564454,0.00018386634,0.00038415036,0.00013906565],"domain_scores_gemma":[0.9982539,0.0001050352,0.00042318556,0.00010660936,0.0010552509,0.0000560157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049409526,0.00014810528,0.00024893743,0.00022934028,0.0001293949,0.00012846765,0.00046362734,0.000019477673,0.00036996993],"category_scores_gemma":[0.000013217321,0.00013416538,0.00013630652,0.00016218507,0.00032044438,0.00034456482,0.00026412783,0.00017005437,0.000008619044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022507276,0.00016602683,0.02924182,0.0000010530364,0.0013656875,0.000014988546,0.0008190703,0.0006420616,0.000014475363,0.95711774,0.0036361043,0.0067559],"study_design_scores_gemma":[0.0015579844,0.00020949075,0.21328671,0.00019639509,0.00017889975,0.000017527485,0.0023823837,0.0031426696,0.00041057312,0.72529244,0.052982587,0.00034231768],"about_ca_topic_score_codex":0.000036207366,"about_ca_topic_score_gemma":0.000032539225,"teacher_disagreement_score":0.4882232,"about_ca_system_score_codex":0.0001478614,"about_ca_system_score_gemma":0.000049374692,"threshold_uncertainty_score":0.54711056},"labels":[],"label_agreement":null},{"id":"W4242267886","doi":"10.32920/ryerson.14657001","title":"Retweet Prediction Based on User Behavior","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Baseline (sea); Matrix decomposition; Regularization (linguistics); Focus (optics); Field (mathematics); Factorization; Social network (sociolinguistics); Artificial intelligence; Machine learning; Non-negative matrix factorization; User information; Information retrieval; Social media; World Wide Web; Information system; Mathematics","score_opus":0.018016111410142425,"score_gpt":0.27688073867342305,"score_spread":0.25886462726328063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242267886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35755932,0.00003104316,0.4784026,0.00031766415,0.0007491411,0.0012348081,0.00030498364,0.0009951068,0.16040531],"genre_scores_gemma":[0.98823065,0.0000012617489,0.006981356,0.00008488043,0.00065770507,0.0003433377,0.001998945,0.000033432854,0.0016684642],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986383,0.00007849494,0.00030032094,0.0005407801,0.00025661502,0.00018551413],"domain_scores_gemma":[0.99872756,0.000038003018,0.00013824391,0.0009205297,0.000109663626,0.000065975735],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012842397,0.00026025836,0.00033840333,0.00011238479,0.00006213855,0.0001544616,0.0002343933,0.00012854824,0.0066907047],"category_scores_gemma":[0.0000018880962,0.00025451666,0.000390639,0.00013014092,0.00001987397,0.000033962893,0.00031376668,0.0005536403,0.000017326402],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032074262,0.0018918676,0.8163499,0.000060364287,0.0005607931,0.000018385652,0.00008811217,0.02051162,0.0003529084,0.009303861,0.10280628,0.048023827],"study_design_scores_gemma":[0.001999542,0.0004590466,0.30874208,0.0017762634,0.0043862574,0.0000010892661,0.00046162622,0.5641391,0.030175349,0.0122253345,0.071423374,0.0042109187],"about_ca_topic_score_codex":0.00041498148,"about_ca_topic_score_gemma":0.000017249504,"teacher_disagreement_score":0.63067126,"about_ca_system_score_codex":0.00005725423,"about_ca_system_score_gemma":0.000099090794,"threshold_uncertainty_score":0.9999907},"labels":[],"label_agreement":null},{"id":"W4242272206","doi":"10.32920/ryerson.14665824.v1","title":"Visualizing real-world networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; The Internet; Data science; Voting; Complex network; Process (computing); Visualization; Software; World Wide Web; Distributed computing; Data mining; Operating system","score_opus":0.02348800576857517,"score_gpt":0.3271759632286108,"score_spread":0.30368795746003563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242272206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011642354,0.00019482568,0.6308699,0.000079504964,0.0003079098,0.00024704184,0.0000053434287,0.00043687574,0.35621622],"genre_scores_gemma":[0.98210686,0.00005675972,0.009655293,0.000081824786,0.001754386,0.00009158452,0.00070675137,0.000054615626,0.0054919138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981832,0.000111536494,0.00047248643,0.0006594741,0.00019979429,0.00037349205],"domain_scores_gemma":[0.9984787,0.00007732214,0.00024798393,0.00096298975,0.00013017817,0.00010284452],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021526538,0.00036678094,0.0006272843,0.00015705604,0.00010035053,0.00035502444,0.00042338687,0.00010504095,0.005656585],"category_scores_gemma":[0.0000013563545,0.00037508892,0.00054903654,0.00037041624,0.000032464723,0.000052414453,0.001669579,0.00078926026,0.000011857538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014507966,0.00058953837,0.29185602,0.000104724415,0.0030082606,0.00003351911,0.00032552582,0.12356828,0.000082481645,0.3190472,0.13836573,0.12300419],"study_design_scores_gemma":[0.00042135085,0.000029799821,0.012822341,0.0010693806,0.0010674457,8.0635e-7,0.00065777544,0.8727582,0.002040903,0.060268655,0.045615587,0.0032477705],"about_ca_topic_score_codex":0.006044988,"about_ca_topic_score_gemma":0.0007885296,"teacher_disagreement_score":0.9704645,"about_ca_system_score_codex":0.00006157133,"about_ca_system_score_gemma":0.00009597101,"threshold_uncertainty_score":0.9998701},"labels":[],"label_agreement":null},{"id":"W4242331502","doi":"10.32920/ryerson.14657058.v1","title":"Hybrid Distributed Techniques for Lower-dimensional Representation of Documents in the Scientific Literature","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Curse of dimensionality; Representation (politics); Viewpoints; Information retrieval; Citation; Benchmark (surveying); Data mining; Artificial intelligence; Machine learning; Graph; Pairwise comparison; Data science; Natural language processing; Theoretical computer science; World Wide Web","score_opus":0.016167085548354204,"score_gpt":0.3133002238730757,"score_spread":0.2971331383247215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242331502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63701385,0.0004406886,0.3525917,0.0008212312,0.0005618928,0.0036141244,0.0021792834,0.00015667241,0.0026205706],"genre_scores_gemma":[0.97004896,0.0000031885438,0.013137325,0.00002404665,0.00015256295,0.00041639266,0.01594736,0.000013398546,0.00025677617],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982337,0.00014236193,0.0005104834,0.00057092257,0.0003473257,0.00019525962],"domain_scores_gemma":[0.99822617,0.00016045141,0.000307094,0.0008611786,0.00042052905,0.000024564959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005391076,0.0002190986,0.00039893738,0.00017759728,0.00009211818,0.0004485608,0.00048715936,0.000069698224,0.00018761885],"category_scores_gemma":[0.000016221446,0.0001645124,0.00041522115,0.0004988517,0.000079057725,0.00010836111,0.0004816645,0.00035461312,4.3453014e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005854952,0.00835062,0.06337197,0.0013772761,0.0031335955,0.00008684051,0.0049038106,0.010530446,0.02593166,0.1395111,0.62214756,0.12006963],"study_design_scores_gemma":[0.0010827434,0.00017762728,0.0060102865,0.003293705,0.0006657811,0.0000062217478,0.0009199712,0.037426095,0.33816853,0.5948973,0.015685966,0.0016658106],"about_ca_topic_score_codex":0.00015197288,"about_ca_topic_score_gemma":0.00001454313,"teacher_disagreement_score":0.6064616,"about_ca_system_score_codex":0.000035000543,"about_ca_system_score_gemma":0.0000923825,"threshold_uncertainty_score":0.67086214},"labels":[],"label_agreement":null},{"id":"W4242434750","doi":"10.1090/gsm/089/03","title":"Random graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Graduate studies in mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.12276182827169291,"score_gpt":0.32830942945929137,"score_spread":0.20554760118759846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242434750","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032979983,0.0026297772,0.001390128,0.00007349903,0.00020185612,0.0006373179,0.00003460953,0.00015476228,0.99454826],"genre_scores_gemma":[0.08225141,0.019489348,0.039696667,0.0000853835,0.001357883,0.00036023266,0.00019815385,0.0004486912,0.85611224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981007,0.000022649558,0.00080807816,0.00037456572,0.0003778505,0.00031617197],"domain_scores_gemma":[0.99835896,0.00036126687,0.0004480603,0.00062753266,0.00015967918,0.000044517477],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028173593,0.0005366742,0.0013516225,0.00028221554,0.00014039554,0.000018214101,0.0003239229,0.000086627966,0.00020253098],"category_scores_gemma":[0.000016595375,0.00047405998,0.00050048303,0.00009990666,0.0003666976,0.000036480447,0.00029839022,0.00049590686,0.00009790794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013604153,0.00014997191,0.00015517506,0.0002918742,0.002645866,0.000058748636,0.0047571105,0.00003984042,0.0000012403656,0.79439,0.18963753,0.007859013],"study_design_scores_gemma":[0.00048497232,0.000021513015,0.0000040872696,0.00063025247,0.00025182922,0.00000402271,0.00029134582,0.00024211673,0.0000101409505,0.96485543,0.03268832,0.00051596947],"about_ca_topic_score_codex":0.000008336186,"about_ca_topic_score_gemma":0.0000107922115,"teacher_disagreement_score":0.17046541,"about_ca_system_score_codex":0.00006112453,"about_ca_system_score_gemma":0.000023772582,"threshold_uncertainty_score":0.9997711},"labels":[],"label_agreement":null},{"id":"W4242769978","doi":"10.1007/978-1-4939-7131-2_101365","title":"Topic Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.01254844098113075,"score_gpt":0.23690016095087993,"score_spread":0.22435171996974917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242769978","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000054597394,0.000084744526,0.106016554,0.000022989068,0.00008997192,0.00010366078,0.0000036803503,0.00012752955,0.8935454],"genre_scores_gemma":[0.01995428,0.000010878082,0.0010593694,0.00008676848,0.0035852457,0.000007713027,0.00011251368,0.00004509526,0.9751381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991752,0.000005288617,0.000231651,0.00029065553,0.00011462114,0.00018261053],"domain_scores_gemma":[0.99921954,0.000025004825,0.0001241705,0.00050485926,0.00006917005,0.00005725538],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005577044,0.00025279901,0.0003231307,0.000062950996,0.000058242615,0.00004233229,0.00023236695,0.00011270003,0.104084566],"category_scores_gemma":[2.3176416e-7,0.00022926403,0.00028541902,0.000019344632,0.000060381026,0.000025682457,0.000140872,0.0002339224,0.0005147743],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011000385,0.000005405265,0.0001494062,0.0000012936588,0.00017007512,7.27128e-7,0.0000051434467,0.000012280922,2.0666887e-7,0.71481663,0.25523788,0.029599864],"study_design_scores_gemma":[0.000034530975,0.00001689857,0.00000779601,0.000027983546,0.00007619925,1.6101244e-7,0.0000014378558,0.0012811628,0.000006786432,0.23422165,0.76409435,0.00023106596],"about_ca_topic_score_codex":0.00003356278,"about_ca_topic_score_gemma":0.000014494429,"teacher_disagreement_score":0.5088565,"about_ca_system_score_codex":0.000018311499,"about_ca_system_score_gemma":0.000017221546,"threshold_uncertainty_score":0.93491155},"labels":[],"label_agreement":null},{"id":"W4243674401","doi":"10.1007/978-1-4939-7131-2_100369","title":"Exploratory Network Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Exploratory analysis; Computer science; Data science","score_opus":0.01827795345272122,"score_gpt":0.24617774696934908,"score_spread":0.22789979351662787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243674401","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017339782,0.00014857351,0.06727549,0.000016866645,0.00007145039,0.00012928067,0.000021643726,0.00021795831,0.9321014],"genre_scores_gemma":[0.017009981,0.000016606295,0.0036129728,0.00011864632,0.0047423425,0.000024819987,0.00054460455,0.00008614354,0.9738439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984034,0.000019650246,0.00044620142,0.0005505147,0.00025871652,0.00032157323],"domain_scores_gemma":[0.9983823,0.00005114295,0.00031101418,0.00097469834,0.00016508138,0.00011577084],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019245045,0.00043109962,0.0008227066,0.00029565612,0.00012357996,0.00007165331,0.0003744923,0.00014313801,0.13029903],"category_scores_gemma":[4.5808767e-7,0.00040625528,0.0010798061,0.000239781,0.00010680025,0.000061007857,0.00023022805,0.00028111946,0.0011434255],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037198338,0.000012391789,0.0010800269,0.000002202995,0.0064625023,0.000001708869,0.000026260115,0.00011460513,4.6728343e-7,0.5629409,0.42442733,0.004927884],"study_design_scores_gemma":[0.00004180518,0.000020365263,0.000019903257,0.000022771828,0.0031233702,5.4976226e-8,0.000008788159,0.0006568011,0.000008351161,0.29967266,0.69595456,0.00047056377],"about_ca_topic_score_codex":0.000034068144,"about_ca_topic_score_gemma":0.000100430734,"teacher_disagreement_score":0.27152726,"about_ca_system_score_codex":0.000035245106,"about_ca_system_score_gemma":0.000044057117,"threshold_uncertainty_score":0.99983895},"labels":[],"label_agreement":null},{"id":"W4243772034","doi":"10.1007/978-1-4939-7131-2_100865","title":"People-Content-Network Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Content (measure theory); Mathematics","score_opus":0.02552245340218706,"score_gpt":0.24527634947630483,"score_spread":0.21975389607411777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243772034","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009298026,0.00011203837,0.063171215,0.00004405372,0.000083542174,0.00020650892,0.000036461257,0.0002247999,0.9360284],"genre_scores_gemma":[0.043141793,0.000014397051,0.0037262845,0.000094669595,0.0032607068,0.000022418326,0.00070146174,0.00008054354,0.94895774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980104,0.000019508021,0.0005721649,0.0006647276,0.00031789206,0.00041533986],"domain_scores_gemma":[0.9980462,0.000103457154,0.00040457558,0.0010715753,0.00023862516,0.00013555949],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001959015,0.0005236539,0.0011271235,0.00033929705,0.00014661484,0.00010024169,0.0004713857,0.00016844919,0.14925894],"category_scores_gemma":[0.0000013814238,0.00047611058,0.0015589712,0.00029697057,0.000084338084,0.00005585372,0.00026868875,0.000321143,0.0010432273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008819786,0.000024304916,0.010948427,0.0000045383367,0.011753656,0.0000015975913,0.000049947204,0.000073822484,0.0000013501699,0.7323222,0.23868906,0.0061222226],"study_design_scores_gemma":[0.0001685543,0.00006172011,0.0007769012,0.00006579592,0.010731652,4.0182536e-7,0.000034856945,0.002164859,0.000016639033,0.35351512,0.6311888,0.0012746733],"about_ca_topic_score_codex":0.0003625554,"about_ca_topic_score_gemma":0.0010135313,"teacher_disagreement_score":0.39249977,"about_ca_system_score_codex":0.000042683456,"about_ca_system_score_gemma":0.000038213,"threshold_uncertainty_score":0.99976903},"labels":[],"label_agreement":null},{"id":"W4244145141","doi":"10.1007/978-1-4939-7131-2_100282","title":"Directed Network","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.013157107011071645,"score_gpt":0.23781566633417867,"score_spread":0.22465855932310702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244145141","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000057385178,0.00008862929,0.008071349,0.000020748255,0.000102798214,0.00014306782,0.0000114013565,0.0004973112,0.99105895],"genre_scores_gemma":[0.0027944613,0.000007658966,0.0048009716,0.00006653879,0.005228974,0.000010477983,0.00023058092,0.00007102414,0.9867893],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896586,0.000009196196,0.00027570096,0.0003477866,0.00015213936,0.00024934462],"domain_scores_gemma":[0.9990641,0.00004148619,0.00017380672,0.0005413843,0.00010906268,0.00007016712],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000080412006,0.00031102487,0.00041899856,0.00005871466,0.0000866837,0.000044401415,0.00024591052,0.00010863985,0.12629823],"category_scores_gemma":[4.414047e-7,0.00028380446,0.00031681475,0.000040469793,0.00007107377,0.000026192993,0.00016009416,0.00022607499,0.0011977984],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018245299,0.0000044907274,0.00009729722,0.0000010927544,0.00021635888,5.397875e-7,0.000004196198,0.000002276384,4.976464e-7,0.4434747,0.5478745,0.008322191],"study_design_scores_gemma":[0.0000288314,0.000012768745,0.000008648105,0.000037975944,0.00008862835,1.17167076e-7,6.216617e-7,0.00020870328,0.0000080160235,0.35410857,0.6452689,0.00022819587],"about_ca_topic_score_codex":0.000044831846,"about_ca_topic_score_gemma":0.000026639886,"teacher_disagreement_score":0.12510043,"about_ca_system_score_codex":0.000020506692,"about_ca_system_score_gemma":0.000027988599,"threshold_uncertainty_score":0.99996144},"labels":[],"label_agreement":null},{"id":"W4244451909","doi":"10.3410/f.726889766.793530447","title":"Faculty Opinions recommendation of Increased spatiotemporal resolution reveals highly dynamic dense tubular matrices in the peripheral ER.","year":2017,"lang":"en","type":"dataset","venue":"Faculty Opinions – Post-Publication Peer Review of the Biomedical Literature","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Resolution (logic); Peripheral; Computer science; High resolution; Geology; Artificial intelligence; Remote sensing","score_opus":0.022744042510115924,"score_gpt":0.35866801004979837,"score_spread":0.33592396753968246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244451909","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015596022,0.00084896805,0.00017284411,0.078050554,0.00025738258,0.0015264506,0.91902596,0.000029821527,0.0000724388],"genre_scores_gemma":[0.0013293596,0.00015746303,0.000967317,0.00089127483,0.0003613277,0.000352965,0.9956315,0.000025029147,0.00028375527],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946417,0.0012150513,0.0018033686,0.00066116033,0.0012954847,0.00038322245],"domain_scores_gemma":[0.99194425,0.00019352292,0.0027528848,0.0022827582,0.0026784274,0.00014812966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026947875,0.0005504204,0.0010794963,0.0003986919,0.00042764514,0.0002887093,0.002629657,0.00042158295,0.00037894223],"category_scores_gemma":[0.0013217384,0.00034144032,0.0007849471,0.0016025123,0.00034009622,0.0004199433,0.00047537358,0.0011575293,0.000016597973],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013834396,0.00034368312,0.00012578958,0.0013336935,0.00013349931,2.7844763e-7,0.00009052055,4.5123107e-7,0.0000017415123,0.00043804472,0.99596727,0.0015512124],"study_design_scores_gemma":[0.00044676487,0.00007229969,0.007070918,0.0059714746,0.00026164603,0.0000065741165,0.000035859397,0.0001546231,0.0000032115563,0.00031026878,0.9853457,0.00032065716],"about_ca_topic_score_codex":0.0010685747,"about_ca_topic_score_gemma":0.00006556857,"teacher_disagreement_score":0.07715928,"about_ca_system_score_codex":0.00015722452,"about_ca_system_score_gemma":0.0003793154,"threshold_uncertainty_score":0.99990374},"labels":[],"label_agreement":null},{"id":"W4244664043","doi":"10.34105/j.kmel.2010.02.027","title":"The dynamics of interactivity modeling for e-learning","year":2010,"lang":"en","type":"article","venue":"Knowledge Management & E-Learning An International Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity Western University","funders":"","keywords":"Interactivity; Computer science; Context (archaeology); The Internet; Multimedia; Vocabulary; E learning; Experiential learning; Knowledge management; Mathematics education; World Wide Web; Psychology","score_opus":0.011149259454382074,"score_gpt":0.3172432294739178,"score_spread":0.30609397001953575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244664043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13782872,0.000017307939,0.80100244,0.00017294403,0.001090077,0.00015960999,0.000003025564,0.00006468248,0.059661195],"genre_scores_gemma":[0.98644984,0.000019898527,0.009707225,0.0000042379224,0.0010749069,0.000026941609,0.00004599024,0.000027853466,0.002643123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987162,0.0001297294,0.00042264728,0.0002088883,0.00028054215,0.00024204663],"domain_scores_gemma":[0.9985367,0.0002278842,0.00038628347,0.00018305756,0.00059438794,0.000071695074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001145765,0.00015585938,0.00017254747,0.00020623588,0.00057556975,0.00040066696,0.0008685454,0.000030336707,0.00019842948],"category_scores_gemma":[0.000051264175,0.00013006439,0.00025218376,0.00011860375,0.000041988933,0.0003165334,0.0002676998,0.0009317216,0.000008038192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008773502,0.00020345385,0.023278749,0.000008387055,0.0007817623,0.0000017454782,0.00036248125,0.02057798,0.00020199522,0.32880875,0.00028281746,0.6254041],"study_design_scores_gemma":[0.00034986562,0.00006796339,0.00047766924,0.000048097052,0.00007310833,0.000004401862,0.0015868692,0.9612399,0.00007249634,0.011834248,0.02409483,0.00015058095],"about_ca_topic_score_codex":0.000022921155,"about_ca_topic_score_gemma":0.000075731135,"teacher_disagreement_score":0.9406619,"about_ca_system_score_codex":0.000066936496,"about_ca_system_score_gemma":0.000026848882,"threshold_uncertainty_score":0.53038716},"labels":[],"label_agreement":null},{"id":"W4244993196","doi":"10.1007/978-1-4939-7131-2_101164","title":"Social Network Mining","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Social network (sociolinguistics); Data science; World Wide Web; Social media","score_opus":0.024104226772628735,"score_gpt":0.2732779920219102,"score_spread":0.24917376524928148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244993196","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002496994,0.0000378274,0.0076313117,0.00004786864,0.00007034981,0.0000982156,0.000006334538,0.00015892184,0.9919242],"genre_scores_gemma":[0.012958702,0.0000018741224,0.004061144,0.00009091614,0.013831702,0.000008948315,0.00014980909,0.00007223192,0.9688247],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989775,0.000008679644,0.00027489697,0.0003141397,0.00016053437,0.0002642623],"domain_scores_gemma":[0.99937385,0.000033718195,0.00020400292,0.0002653235,0.000077223754,0.000045856785],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010222344,0.0002866157,0.00041378822,0.000051539602,0.000186634,0.00005379554,0.00022961794,0.00012594345,0.045825366],"category_scores_gemma":[2.6728148e-7,0.00028188922,0.0003681708,0.000030355437,0.00008514,0.000028031835,0.00017863105,0.00019816688,0.00044102827],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015289713,0.0000028221873,0.00008573915,0.0000010989162,0.00016754509,4.3137322e-7,0.000026551064,0.0000010039633,2.1468301e-7,0.48341578,0.50526977,0.011027506],"study_design_scores_gemma":[0.000035312216,0.000012017932,0.000006311667,0.000026103648,0.00010004405,1.0164487e-7,0.00000583264,0.000082091996,0.0000028165653,0.3427099,0.656777,0.00024248275],"about_ca_topic_score_codex":0.00001707653,"about_ca_topic_score_gemma":0.00001539286,"teacher_disagreement_score":0.15150723,"about_ca_system_score_codex":0.000022105343,"about_ca_system_score_gemma":0.000031286203,"threshold_uncertainty_score":0.99996334},"labels":[],"label_agreement":null},{"id":"W4245066673","doi":"10.1007/978-1-4614-6170-8_100301","title":"Art About Networks","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.00913642623333545,"score_gpt":0.2271537891578958,"score_spread":0.21801736292456037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245066673","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.8263002e-7,0.000077415185,0.3609005,0.00002344366,0.000055235458,0.0000925665,0.0000035160738,0.00013017647,0.63871676],"genre_scores_gemma":[0.021272995,0.000021153239,0.000961144,0.00017648164,0.0023547679,0.000014001147,0.00031917903,0.000076562,0.97480375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888295,0.000010081657,0.00033349078,0.0003695389,0.0001599199,0.00024399042],"domain_scores_gemma":[0.9989422,0.000053216303,0.0002051086,0.0006440833,0.00006658608,0.00008878242],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000109513436,0.00035635562,0.00051045517,0.00008633701,0.000067185174,0.000063535415,0.0002798143,0.00014599886,0.030005133],"category_scores_gemma":[3.8305473e-7,0.000328731,0.000437476,0.000022148959,0.00005336028,0.00002032139,0.00013855123,0.0003950027,0.0011184178],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010029689,0.0000032280743,0.00007851216,0.0000014066287,0.0001241563,3.8105784e-7,0.0000010273575,0.00012970813,1.4421053e-7,0.66145945,0.3022272,0.03597377],"study_design_scores_gemma":[0.00004975096,0.000013252642,0.000010055216,0.000055131768,0.00011084537,2.3756422e-7,4.5296574e-7,0.005175872,0.00000284158,0.09029732,0.90394735,0.00033688988],"about_ca_topic_score_codex":0.000020523972,"about_ca_topic_score_gemma":0.000013234982,"teacher_disagreement_score":0.60172015,"about_ca_system_score_codex":0.000019480056,"about_ca_system_score_gemma":0.00001735001,"threshold_uncertainty_score":0.9999165},"labels":[],"label_agreement":null},{"id":"W4245606502","doi":"10.1007/978-1-4614-6170-8_100925","title":"Multiplex Social Networks","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multiplex; Biology; Genetics","score_opus":0.01438849169639523,"score_gpt":0.24045717911105427,"score_spread":0.22606868741465905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245606502","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012777691,0.00002726424,0.28974792,0.000032370266,0.000051091043,0.00011257736,0.000006901986,0.00015257005,0.709868],"genre_scores_gemma":[0.1815433,0.000004079712,0.0008260284,0.00011168975,0.004552467,0.000014330598,0.00029054054,0.00008146975,0.81257606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988731,0.000013855664,0.00032522,0.0003627171,0.00016926948,0.00025580666],"domain_scores_gemma":[0.99923354,0.000054713215,0.00022683117,0.00034869337,0.00007329531,0.000062917716],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000099241544,0.00036138206,0.00052935595,0.00008034181,0.00014363085,0.000056563753,0.00027617053,0.00018787496,0.029743597],"category_scores_gemma":[4.3385322e-7,0.00034752686,0.000531684,0.000022692899,0.00006872014,0.000019035397,0.00016197826,0.00041467373,0.00022848506],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022631755,0.000005567365,0.00009745752,0.0000018393214,0.00018308003,3.8470367e-7,0.000005007147,0.0000714623,6.0519073e-7,0.7012357,0.22931273,0.06908388],"study_design_scores_gemma":[0.00011305622,0.000011572557,0.00002867299,0.000020503743,0.00013761672,1.3146546e-7,0.0000019979711,0.010901571,0.0000036210245,0.07979526,0.90854377,0.0004422214],"about_ca_topic_score_codex":0.00006918009,"about_ca_topic_score_gemma":0.00001920523,"teacher_disagreement_score":0.67923105,"about_ca_system_score_codex":0.00002556094,"about_ca_system_score_gemma":0.000017310444,"threshold_uncertainty_score":0.99989766},"labels":[],"label_agreement":null},{"id":"W4246727043","doi":"10.1007/978-1-4939-7131-2_100349","title":"Event Analysis on Social Media","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Event (particle physics); Social media; History; Computer science; World Wide Web; Physics","score_opus":0.025410334488111464,"score_gpt":0.28128381464595303,"score_spread":0.25587348015784156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246727043","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010106712,0.000014047794,0.008214104,0.000060507755,0.00005772512,0.00009232506,0.00006334123,0.000114477836,0.9912824],"genre_scores_gemma":[0.2584856,0.000005520183,0.00052230665,0.00008934674,0.0047466615,0.000016287237,0.00090956973,0.000066362954,0.7351584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986637,0.000014910722,0.00034651114,0.00043258964,0.00033826398,0.0002040238],"domain_scores_gemma":[0.9990567,0.000087369495,0.00024734094,0.00043742798,0.000104437386,0.00006673352],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011748459,0.0003381423,0.0006717074,0.00038478913,0.00011262098,0.0000430266,0.00027380718,0.0001301516,0.10254637],"category_scores_gemma":[0.0000010467878,0.00030145163,0.0011868832,0.00012079087,0.00007818585,0.000020107815,0.00011321834,0.00025022752,0.0008214152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072834728,0.000034576227,0.00009253964,0.0000016483706,0.0044944785,0.0000011436719,0.00009956284,0.000005782987,9.672168e-7,0.78459513,0.18132985,0.02933701],"study_design_scores_gemma":[0.00012561693,0.000036404166,0.00025860485,0.000026805084,0.0049451296,4.979553e-8,0.000025697329,0.00039852128,0.00005888715,0.3942098,0.59916186,0.0007526144],"about_ca_topic_score_codex":0.000034667166,"about_ca_topic_score_gemma":0.00011532765,"teacher_disagreement_score":0.41783202,"about_ca_system_score_codex":0.000050271432,"about_ca_system_score_gemma":0.000027692147,"threshold_uncertainty_score":0.99995655},"labels":[],"label_agreement":null},{"id":"W4246793224","doi":"10.32920/ryerson.14660925.v1","title":"Domination number within on-line social networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Domination analysis; Line (geometry); Combinatorics; Upper and lower bounds; Graph; Discrete mathematics; Mathematics; Computer science; Theoretical computer science","score_opus":0.02557003619041839,"score_gpt":0.3180228334858797,"score_spread":0.2924527972954613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246793224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046650983,0.000018376117,0.8238121,0.00038930555,0.00043505008,0.00030530427,0.000012726233,0.00023570593,0.12814045],"genre_scores_gemma":[0.9882148,0.000002947949,0.0051818998,0.00013301808,0.002846117,0.00009243819,0.0010590071,0.00003670997,0.0024330497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985306,0.00010903923,0.00040455116,0.0005025077,0.00023282816,0.00022045239],"domain_scores_gemma":[0.9990206,0.000056654007,0.00028998006,0.00041589877,0.00016911479,0.00004780538],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023589053,0.00029922073,0.0004647842,0.000051703042,0.00013138464,0.00021590355,0.0002623943,0.0001786365,0.0049075563],"category_scores_gemma":[0.0000027386423,0.00029391094,0.00041078427,0.00017910081,0.00003456045,0.00004039415,0.00056476746,0.000795707,0.000031053114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064163876,0.0011048425,0.017158082,0.000051177874,0.0019909723,0.000012794524,0.0010202272,0.37054858,0.000026110487,0.3610204,0.11516178,0.13184088],"study_design_scores_gemma":[0.00063570024,0.000035941484,0.0018991547,0.00024616165,0.0004933938,7.642651e-7,0.00050133816,0.90820193,0.0014421812,0.081701234,0.0033664855,0.0014757017],"about_ca_topic_score_codex":0.00032047398,"about_ca_topic_score_gemma":0.00004996024,"teacher_disagreement_score":0.94156384,"about_ca_system_score_codex":0.00006132743,"about_ca_system_score_gemma":0.00007364202,"threshold_uncertainty_score":0.9999513},"labels":[],"label_agreement":null},{"id":"W4246863611","doi":"10.1007/978-1-4939-7131-2_100619","title":"Longitudinal Network Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.01964131516042364,"score_gpt":0.261272069313851,"score_spread":0.24163075415342736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246863611","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023810635,0.0001049739,0.09414811,0.000022126856,0.0000613214,0.0001215142,0.00002222424,0.00016675606,0.90532917],"genre_scores_gemma":[0.041461814,0.0000099010185,0.0045882002,0.000047756323,0.004549581,0.000012217902,0.0005268808,0.00006431906,0.94873935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829185,0.000013470887,0.00045122165,0.00060949137,0.00027675627,0.00035718887],"domain_scores_gemma":[0.9984458,0.00005493224,0.0003142367,0.0009064081,0.00016659946,0.00011200513],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001739028,0.00044596993,0.00086981937,0.00028630425,0.00013883565,0.00008827484,0.00038435363,0.00013940386,0.17830978],"category_scores_gemma":[4.866251e-7,0.00041150994,0.0012431552,0.00025052164,0.00011489009,0.000045382385,0.00023763927,0.00029372002,0.00092088943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005229873,0.000014051465,0.010481307,0.0000023553685,0.008739694,0.0000026981008,0.0000082652095,0.00016349203,1.8955907e-7,0.6918142,0.28404078,0.004727728],"study_design_scores_gemma":[0.000059245696,0.00003456051,0.00040954846,0.000031515796,0.0061654258,2.6304264e-7,0.0000025333798,0.001418391,0.0000050332333,0.385873,0.605372,0.0006284938],"about_ca_topic_score_codex":0.000119093274,"about_ca_topic_score_gemma":0.00017852349,"teacher_disagreement_score":0.32133123,"about_ca_system_score_codex":0.000035831818,"about_ca_system_score_gemma":0.000034136385,"threshold_uncertainty_score":0.999857},"labels":[],"label_agreement":null},{"id":"W4246989799","doi":"10.1007/978-1-4939-7131-2_100651","title":"Meta Path-Based Heterogeneous Social Network Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Social network analysis; Path (computing); Computer science; Path analysis (statistics); Computer network; World Wide Web; Machine learning; Social media","score_opus":0.03303154616689442,"score_gpt":0.2618538282541617,"score_spread":0.2288222820872673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246989799","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040006424,0.00034785114,0.19565396,0.00008281831,0.000084591935,0.00034377235,0.00017003817,0.00038090086,0.8028961],"genre_scores_gemma":[0.2163923,0.00000956179,0.0086659435,0.0005724064,0.0089040045,0.000118569,0.0024668246,0.0002548496,0.76261556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99767023,0.000051440922,0.0006386622,0.00075785833,0.00040721457,0.00047460382],"domain_scores_gemma":[0.99823785,0.00008189108,0.00052481453,0.0008292836,0.00020924471,0.0001168961],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024327074,0.00067972275,0.0017136426,0.0002951097,0.00028741334,0.0001202052,0.00049394276,0.00023869752,0.09950912],"category_scores_gemma":[4.2424315e-7,0.00060011045,0.0041009015,0.00026209783,0.00015408202,0.000032834494,0.00018852165,0.00032312307,0.00028288123],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005266316,0.0001513165,0.0007578611,0.000021585816,0.3143833,0.000024932642,0.00006922681,0.0071751447,0.0000040332447,0.37064558,0.2974795,0.009234844],"study_design_scores_gemma":[0.0002041981,0.00008524144,0.000017677585,0.000017899303,0.13164337,3.0062026e-7,0.0000032748267,0.0115807345,0.00007204603,0.24733576,0.6075478,0.0014916682],"about_ca_topic_score_codex":0.00012853615,"about_ca_topic_score_gemma":0.00015743464,"teacher_disagreement_score":0.3100683,"about_ca_system_score_codex":0.00005128938,"about_ca_system_score_gemma":0.00006674497,"threshold_uncertainty_score":0.99964505},"labels":[],"label_agreement":null},{"id":"W4247108616","doi":"10.1007/978-1-4939-7131-2_100586","title":"Layered Social Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Sociology","score_opus":0.01760973932425916,"score_gpt":0.25284904816867704,"score_spread":0.23523930884441788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247108616","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005721284,0.00003955322,0.0955391,0.000040784613,0.00007651194,0.0001244438,0.00001357059,0.00017136463,0.90398896],"genre_scores_gemma":[0.08491988,0.000004880378,0.0007087197,0.00009295073,0.007307053,0.000011187709,0.00024357071,0.00007671101,0.90663505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896467,0.000009682066,0.00028514626,0.00033947124,0.0001589907,0.00024201449],"domain_scores_gemma":[0.9992928,0.000025079651,0.00019798812,0.00032862942,0.00010109827,0.00005441883],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008028331,0.00031842917,0.00043572852,0.00007271308,0.00014680978,0.000060217295,0.00026790224,0.0001783096,0.07566474],"category_scores_gemma":[2.3315268e-7,0.00030521894,0.00043282914,0.000027992699,0.0000951722,0.000030877552,0.00017400693,0.0003084394,0.00047024776],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032511405,0.000007704524,0.000038178376,0.0000011913093,0.00025434003,6.248202e-7,0.000014557403,0.000008223144,5.1435455e-7,0.54346627,0.44051668,0.01568845],"study_design_scores_gemma":[0.000075569194,0.000017915074,0.000010865306,0.000019587089,0.00011823388,1.4960675e-7,0.0000049069668,0.0016047297,0.0000070224087,0.22668397,0.7710854,0.0003716498],"about_ca_topic_score_codex":0.000037928923,"about_ca_topic_score_gemma":0.000019579726,"teacher_disagreement_score":0.33056873,"about_ca_system_score_codex":0.000027083634,"about_ca_system_score_gemma":0.000026507256,"threshold_uncertainty_score":0.99994},"labels":[],"label_agreement":null},{"id":"W4247401305","doi":"10.1007/978-1-4939-7131-2_100942","title":"Querying and Sampling Social Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Sampling (signal processing); Data science; Telecommunications","score_opus":0.03072999589963666,"score_gpt":0.2768203275751046,"score_spread":0.24609033167546795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247401305","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058044963,0.00011983013,0.21645004,0.000026393362,0.000044954188,0.00010012138,0.000005851813,0.00011155447,0.7830832],"genre_scores_gemma":[0.24986257,0.000044955013,0.007899201,0.00017627589,0.011674972,0.000018351348,0.0002514931,0.00016455016,0.72990763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990976,0.000007436276,0.00024701326,0.00033118247,0.00010703669,0.00020975657],"domain_scores_gemma":[0.9994924,0.000047857346,0.00016244431,0.00018356813,0.000062981555,0.0000507217],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010746594,0.00027133687,0.0003803949,0.000072824,0.00021594037,0.000093133276,0.00012477716,0.00013690034,0.007197225],"category_scores_gemma":[4.0546644e-7,0.0002672286,0.00019028739,0.000020327461,0.00009994716,0.00003920187,0.00019587934,0.00028518625,0.000029920437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004563526,0.0000065101467,0.000383176,0.0000061186583,0.00034037713,5.913861e-7,0.000065765504,0.000015853713,0.000002591311,0.87478065,0.037964612,0.08642919],"study_design_scores_gemma":[0.00012280422,0.000024341372,0.000058256344,0.0001047309,0.00027015703,6.962701e-7,0.000026593736,0.0044031506,0.000007336629,0.41749212,0.5767508,0.0007389902],"about_ca_topic_score_codex":0.00005297283,"about_ca_topic_score_gemma":0.000018115601,"teacher_disagreement_score":0.53878623,"about_ca_system_score_codex":0.000019399042,"about_ca_system_score_gemma":0.00001601134,"threshold_uncertainty_score":0.999978},"labels":[],"label_agreement":null},{"id":"W4247420201","doi":"10.1109/asonam.2016.7752277","title":"Dynamics of large scale networks following a merger","year":2016,"lang":"en","type":"article","venue":"2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Server; Network dynamics; Dynamics (music); Network topology; Network structure; Distributed computing; Computer network; Physics; Mathematics","score_opus":0.014043518471828066,"score_gpt":0.3189464344121986,"score_spread":0.30490291594037056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247420201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28777647,0.00053207704,0.6956865,0.0008994281,0.00060878426,0.0001977515,0.00011725857,0.000062646766,0.014119095],"genre_scores_gemma":[0.9958889,0.00072410115,0.0017247765,0.000055643308,0.0006591048,0.000042450694,0.00010666542,0.000023738947,0.0007746279],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978135,0.0001270952,0.00067293417,0.0005478549,0.0003861636,0.00045242862],"domain_scores_gemma":[0.99857616,0.0003144137,0.0005088372,0.00031388717,0.00020097446,0.00008573006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005436234,0.00030335502,0.0007293707,0.0002912557,0.00018481108,0.000068253445,0.00056843547,0.000115446404,0.0007242329],"category_scores_gemma":[0.00002251879,0.00024057047,0.00052949536,0.0007822835,0.00014012132,0.00032475987,0.0001889976,0.00021160216,0.000002611603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014907136,0.0003440334,0.663669,0.000006273787,0.0024271444,0.000005726627,0.00044396587,0.010425608,0.000115236304,0.12473928,0.0011449552,0.19652973],"study_design_scores_gemma":[0.0014836814,0.00009072543,0.018557498,0.0005169494,0.0008074493,3.5446908e-7,0.0013338879,0.9559817,0.00004764712,0.017525202,0.0028301978,0.0008247343],"about_ca_topic_score_codex":0.0000771129,"about_ca_topic_score_gemma":0.00092503725,"teacher_disagreement_score":0.94555604,"about_ca_system_score_codex":0.000096982934,"about_ca_system_score_gemma":0.000037262424,"threshold_uncertainty_score":0.9810179},"labels":[],"label_agreement":null},{"id":"W4247472419","doi":"10.1007/978-1-4939-7131-2_100754","title":"Network Text Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.01502959864367268,"score_gpt":0.24617850806649477,"score_spread":0.2311489094228221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247472419","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000086604805,0.00010601363,0.068215154,0.00003473359,0.00005169062,0.00012804134,0.000021031838,0.00017551226,0.93125916],"genre_scores_gemma":[0.020886913,0.0000074414215,0.0041194567,0.0001338695,0.0038394276,0.000012190576,0.00047592327,0.00006487072,0.9704599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844664,0.00001418633,0.00043253656,0.0005371181,0.00024262522,0.0003268845],"domain_scores_gemma":[0.9984736,0.000058505397,0.00029800975,0.00092830526,0.00014138785,0.00010018096],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015435617,0.0004164339,0.0008176051,0.0002699589,0.000121194964,0.00008038965,0.00038340915,0.0001428664,0.19611372],"category_scores_gemma":[4.638582e-7,0.00038021957,0.0010419113,0.00023936153,0.00009831171,0.00003864816,0.00022030878,0.00027089383,0.0013769985],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029157018,0.000009324877,0.0010287022,0.0000014641878,0.004517263,9.577665e-7,0.000009356835,0.000093663395,2.5802294e-7,0.6092354,0.37789032,0.007210365],"study_design_scores_gemma":[0.000034425393,0.000017825196,0.000041232033,0.000017629014,0.003019546,7.902992e-8,0.00000254976,0.00080673717,0.0000032237303,0.37892166,0.61675406,0.00038105264],"about_ca_topic_score_codex":0.000103585684,"about_ca_topic_score_gemma":0.00010119232,"teacher_disagreement_score":0.23886372,"about_ca_system_score_codex":0.00003076039,"about_ca_system_score_gemma":0.000031735974,"threshold_uncertainty_score":0.999865},"labels":[],"label_agreement":null},{"id":"W4247489101","doi":"10.1007/978-1-4939-7131-2_101331","title":"Temporal Social Network Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Social network analysis; Computer science; Geography; World Wide Web; Social media","score_opus":0.0169561665591618,"score_gpt":0.2638360013432192,"score_spread":0.24687983478405742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247489101","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029009265,0.000042129584,0.04117351,0.00005293292,0.000059260885,0.00013455855,0.000037570833,0.00019347748,0.9582775],"genre_scores_gemma":[0.06974308,0.00000266816,0.0032636083,0.0000903989,0.008771612,0.000013049834,0.0010613464,0.0000724435,0.9169818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983709,0.000019859466,0.0004672208,0.0005149743,0.00028042457,0.00034661268],"domain_scores_gemma":[0.9988649,0.000032874996,0.00037304123,0.0005042914,0.0001453218,0.00007956823],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001793495,0.00042561017,0.0009028738,0.00024265781,0.00023477791,0.00008854245,0.00035749446,0.00018479292,0.09764999],"category_scores_gemma":[3.0852368e-7,0.00040530783,0.0014156785,0.0002366746,0.00013051473,0.000042406486,0.00021767303,0.0003051229,0.0005041011],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050473054,0.000012581874,0.0028803314,0.0000019050277,0.0056852633,0.0000012360196,0.000025963309,0.000018548562,1.9100096e-7,0.5449011,0.4412662,0.005201678],"study_design_scores_gemma":[0.00005496931,0.000017863988,0.000097909106,0.000009916713,0.0031149872,6.122325e-8,0.0000056821505,0.00052610197,0.0000020448688,0.35083476,0.6448746,0.00046113224],"about_ca_topic_score_codex":0.00017365135,"about_ca_topic_score_gemma":0.00019704754,"teacher_disagreement_score":0.20360836,"about_ca_system_score_codex":0.000039178696,"about_ca_system_score_gemma":0.000044406566,"threshold_uncertainty_score":0.9998399},"labels":[],"label_agreement":null},{"id":"W4247539686","doi":"10.32920/ryerson.14655462.v1","title":"Models And Mining Of On-Line Social Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Logarithm; Dimension (graph theory); Property (philosophy); Degree distribution; Line (geometry); Computer science; Power law; Distribution (mathematics); Power (physics); Degree (music); Spectral power distribution; Feature (linguistics); Statistical physics; Complex network; Mathematics; Physics; Combinatorics; Statistics; Mathematical analysis; World Wide Web; Optics; Geometry","score_opus":0.05303127236350695,"score_gpt":0.31209027644387777,"score_spread":0.2590590040803708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247539686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1562761,0.00016682311,0.8101038,0.000090208596,0.0000569269,0.00012858318,0.000011283021,0.00005409658,0.03311222],"genre_scores_gemma":[0.99094254,0.000015607438,0.007969947,0.000032474043,0.0006006251,0.000020129988,0.0001593703,0.000018508908,0.0002407895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907434,0.000043698343,0.00029355352,0.0003230734,0.00011785113,0.00014747294],"domain_scores_gemma":[0.999378,0.000056367753,0.0001883766,0.00025875343,0.00008534691,0.00003313448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011550677,0.000188081,0.00048055287,0.000056079472,0.00005156889,0.000054868193,0.00014282853,0.00009876765,0.00029596532],"category_scores_gemma":[7.913827e-7,0.00018578148,0.00021358834,0.00008482807,0.000040514027,0.000025922782,0.00066006253,0.00030923812,1.7116413e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017192664,0.00020774905,0.0034303197,0.00004468603,0.0008206116,0.0000017297716,0.0005900077,0.81409365,0.000013589051,0.07640552,0.0054971725,0.09887778],"study_design_scores_gemma":[0.00010254224,0.000017200156,0.00014434927,0.000100332,0.00011256821,7.425766e-8,0.00022603391,0.9751963,0.0001434806,0.023670346,0.00006855079,0.00021819635],"about_ca_topic_score_codex":0.00021993375,"about_ca_topic_score_gemma":0.000014614107,"teacher_disagreement_score":0.83466643,"about_ca_system_score_codex":0.00000994243,"about_ca_system_score_gemma":0.000037929072,"threshold_uncertainty_score":0.7575949},"labels":[],"label_agreement":null},{"id":"W4248749049","doi":"10.4018/978-1-59904-990-8.ch024","title":"Hyperlink Structure Inspired by Web Usage","year":2009,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Hyperlink; Computer science; Visualization; World Wide Web; Information retrieval; The Internet; Link analysis; Graph; Web navigation; Web mining; Web application; Web page; Data mining; Theoretical computer science","score_opus":0.009068820492698597,"score_gpt":0.23464565182178468,"score_spread":0.22557683132908607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248749049","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059330225,0.00036147734,0.00033114813,0.000042616433,0.0000998978,0.0003272413,0.0011499638,0.0002665517,0.9968278],"genre_scores_gemma":[0.84207165,0.0000023558512,0.0009188362,0.00038618303,0.0011328629,0.000009408765,0.00020988227,0.000073402676,0.15519544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980457,0.000021854476,0.00048501565,0.0006482039,0.0003753569,0.00042388475],"domain_scores_gemma":[0.9985838,0.000017995444,0.0003376046,0.0007893398,0.00009268028,0.00017859926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000052709514,0.0006667741,0.0007572739,0.00006679655,0.00013090929,0.00012732648,0.0005673623,0.0003387508,0.0008269866],"category_scores_gemma":[0.0000010675241,0.00066548417,0.00049579993,0.00003206691,0.00009144404,0.00003886365,0.00016008732,0.00052075216,0.00007586758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009748676,0.000011183202,0.00010331386,0.0000050360854,0.000200671,0.000008060113,0.0000074538125,0.000002721568,0.00018450386,0.85658234,0.055641998,0.08724299],"study_design_scores_gemma":[0.00019451228,0.000048039656,0.000014028146,0.000057865993,0.00019149893,0.0000023745492,0.0000017246215,0.000054682823,0.00012083595,0.5682219,0.43056414,0.00052835414],"about_ca_topic_score_codex":0.00009908371,"about_ca_topic_score_gemma":0.000048365808,"teacher_disagreement_score":0.84163237,"about_ca_system_score_codex":0.00014684927,"about_ca_system_score_gemma":0.00013609405,"threshold_uncertainty_score":0.9995796},"labels":[],"label_agreement":null},{"id":"W4248964596","doi":"10.1007/978-1-4939-7131-2_356","title":"Relative Validity Criteria for Community Mining Algorithms","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Data mining; Data science; Algorithm","score_opus":0.12017568520493715,"score_gpt":0.3489625451085441,"score_spread":0.22878685990360692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248964596","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014684445,0.0000132192745,0.2383776,0.000029439589,0.00010344892,0.00035656168,0.00020619748,0.00013833115,0.76062834],"genre_scores_gemma":[0.024549583,0.000003402549,0.10085444,0.00008137842,0.002405019,0.0000882321,0.0013182932,0.000124319,0.8705753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883336,0.00008086645,0.00039923683,0.00030130486,0.00014218493,0.00024307764],"domain_scores_gemma":[0.998123,0.00047088,0.0003107161,0.00073231914,0.00028744433,0.00007567855],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005215975,0.00038298598,0.0005870529,0.000101372076,0.00039987944,0.00007338185,0.00039397014,0.00016250118,0.013183679],"category_scores_gemma":[0.000006660655,0.0003711991,0.00048664582,0.000027591843,0.0001499604,0.000102849925,0.00028438965,0.00047654356,0.0000692976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025889494,0.0000869199,0.00014714399,0.00003249708,0.0010393286,6.4046196e-7,0.0008518961,5.573626e-7,0.000014730326,0.6091769,0.36434138,0.02428214],"study_design_scores_gemma":[0.00015461136,0.00015651001,0.000012491773,0.00010892734,0.00028427414,2.7589417e-7,0.00008949713,0.0011599847,0.00013845282,0.6183993,0.37904787,0.00044780027],"about_ca_topic_score_codex":0.00017577664,"about_ca_topic_score_gemma":0.00004036854,"teacher_disagreement_score":0.13752316,"about_ca_system_score_codex":0.000051212854,"about_ca_system_score_gemma":0.000039729795,"threshold_uncertainty_score":0.999874},"labels":[],"label_agreement":null},{"id":"W4248990401","doi":"10.1007/978-1-4939-7131-2_100751","title":"Network Similarity","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Similarity (geometry); Computer science; Artificial intelligence","score_opus":0.021481835714020594,"score_gpt":0.2502094762118869,"score_spread":0.22872764049786629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248990401","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000503223,0.0000681642,0.021316333,0.000051338513,0.00009372392,0.00014495535,0.000016230513,0.00019132032,0.9781129],"genre_scores_gemma":[0.005812152,0.00000525203,0.0045429706,0.00022649505,0.005986898,0.000008383934,0.00019009072,0.000064358064,0.9831634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998904,0.000009289021,0.00028595285,0.00036920953,0.0001694478,0.00026210377],"domain_scores_gemma":[0.998988,0.00004111112,0.00017441569,0.0006207614,0.000101188256,0.00007457852],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001233246,0.0003204428,0.00042900906,0.000048209193,0.00010611797,0.00004998374,0.00028709468,0.00013435801,0.11078922],"category_scores_gemma":[4.358608e-7,0.00029971448,0.0003262276,0.000029468094,0.00008926414,0.00003261101,0.00022073103,0.00030966825,0.00092302606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015596098,0.00000476842,0.00014014028,0.0000013199016,0.00012260703,6.241274e-7,0.0000034159739,0.0000038864873,1.7583505e-7,0.53403926,0.46210295,0.0035793064],"study_design_scores_gemma":[0.000023039875,0.000012284445,0.000005880319,0.000023460796,0.000074134754,1.1517883e-7,7.007333e-7,0.000100249876,0.0000040226673,0.48796135,0.5116028,0.00019196022],"about_ca_topic_score_codex":0.00004118159,"about_ca_topic_score_gemma":0.00002647833,"teacher_disagreement_score":0.10986619,"about_ca_system_score_codex":0.000022656302,"about_ca_system_score_gemma":0.000033383858,"threshold_uncertainty_score":0.9999455},"labels":[],"label_agreement":null},{"id":"W4249327984","doi":"10.1145/2463656","title":"Proceedings of the 4th International Workshop on Modeling Social Media","year":2013,"lang":"en","type":"paratext","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Social media; Computer science; World Wide Web; Context (archaeology); Recommender system; Social media optimization; Social computing; Data science","score_opus":0.028137796651883856,"score_gpt":0.28490071675441725,"score_spread":0.2567629201025334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249327984","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051165908,0.0000171658,0.0051093143,0.0003879399,0.0005761261,0.00021032707,0.000036278103,0.000026208692,0.98852],"genre_scores_gemma":[0.87565595,0.000010770912,0.00054121896,0.000058717917,0.0037296899,0.00007400572,0.00015130542,0.000037321184,0.11974101],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888504,0.000008403675,0.0003310749,0.00025456861,0.00035459342,0.00016635138],"domain_scores_gemma":[0.99922925,0.00005424227,0.0002923627,0.0001215053,0.000277169,0.000025453262],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007672587,0.0002183778,0.00032789208,0.00009702991,0.000083104045,0.00008233837,0.0007007269,0.00010781676,0.013673191],"category_scores_gemma":[0.000004577103,0.0001473942,0.00033799055,0.00017480216,0.000043396452,0.000060909035,0.00025148588,0.0004102247,0.00030866466],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004942183,0.00005615024,0.00004272283,0.000006276019,0.00022132837,7.539043e-9,0.00019748509,0.00081806036,0.000042111926,0.034681108,0.95747477,0.0064550363],"study_design_scores_gemma":[0.0011351577,0.000041261024,0.0001460702,0.0017447757,0.00069798296,4.973916e-7,0.003619024,0.4474158,0.003675046,0.11886679,0.42010966,0.0025479444],"about_ca_topic_score_codex":0.000101971746,"about_ca_topic_score_gemma":0.000004080999,"teacher_disagreement_score":0.87053937,"about_ca_system_score_codex":0.00003946973,"about_ca_system_score_gemma":0.00003926948,"threshold_uncertainty_score":0.98722845},"labels":[],"label_agreement":null},{"id":"W4249962862","doi":"10.1007/978-1-4939-7131-2_101377","title":"Trend Detection","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.014154454075155259,"score_gpt":0.24056772223734574,"score_spread":0.22641326816219048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249962862","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027330098,0.000015014332,0.028419383,0.0000066008515,0.000056444936,0.00006827724,0.00000879294,0.00013585702,0.9712623],"genre_scores_gemma":[0.078582056,0.0000024756162,0.00047889183,0.00001647861,0.0016003309,0.000006613973,0.00009415623,0.000035789686,0.9191832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993914,0.000003877532,0.00016779838,0.00023102309,0.000098318254,0.000107612745],"domain_scores_gemma":[0.9995084,0.000013261184,0.00010892531,0.000310346,0.000022619159,0.00003647275],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000039904517,0.00018805703,0.00021181107,0.000096695396,0.000053942764,0.00002914416,0.000108756365,0.000073342504,0.05058599],"category_scores_gemma":[1.4758031e-7,0.00017217854,0.00022882933,0.000018286984,0.00003945554,0.000026157524,0.000058517166,0.00013903847,0.00043886632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004605685,0.000012018007,0.000024305678,0.0000028979377,0.0003219885,5.978689e-7,0.000019314066,3.588215e-7,0.000055685417,0.5265605,0.06892652,0.40407124],"study_design_scores_gemma":[0.000031952408,0.000025286541,0.000004054506,0.0000141693745,0.00008300466,2.0620757e-7,0.0000023973375,0.0000999605,0.0007181125,0.28008908,0.71874905,0.00018275085],"about_ca_topic_score_codex":0.000052357853,"about_ca_topic_score_gemma":0.00014338469,"teacher_disagreement_score":0.64982253,"about_ca_system_score_codex":0.000019630796,"about_ca_system_score_gemma":0.000007136143,"threshold_uncertainty_score":0.9502819},"labels":[],"label_agreement":null},{"id":"W4250045028","doi":"10.1007/978-1-4614-6170-8_100583","title":"Social Network Mining","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Social network (sociolinguistics); Data science; Computer science; Mining engineering; Geology; World Wide Web; Social media","score_opus":0.01921930690446592,"score_gpt":0.25992401539473986,"score_spread":0.24070470849027395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250045028","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000064678275,0.000033909873,0.043561842,0.00007108806,0.0000539617,0.000087975575,0.00000342954,0.00015418242,0.95602715],"genre_scores_gemma":[0.0414274,0.000001697753,0.003036175,0.00012495428,0.008803693,0.000009861757,0.0001562554,0.00007336083,0.9463666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989892,0.000011845949,0.00028464862,0.00029976232,0.00015964314,0.00025489723],"domain_scores_gemma":[0.999368,0.000052849347,0.00021646352,0.00026473327,0.00005048502,0.0000474313],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012202483,0.00029050233,0.00047944186,0.000050511615,0.00016254425,0.00005019216,0.00022126139,0.00012339742,0.010037015],"category_scores_gemma":[3.116493e-7,0.00028673204,0.00040354172,0.000024238794,0.00004701472,0.000015361215,0.00014599926,0.00024137765,0.00020628641],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010019277,0.0000016628389,0.000106086474,0.0000014932068,0.00012751638,2.6747767e-7,0.000008726818,0.000007679451,1.7842585e-7,0.6732875,0.28882125,0.037636615],"study_design_scores_gemma":[0.00004195156,0.000008499698,0.000008240127,0.000026244728,0.000105922154,9.245733e-8,0.0000021705232,0.00021958939,0.0000014794872,0.26087984,0.738442,0.00026397535],"about_ca_topic_score_codex":0.000020711534,"about_ca_topic_score_gemma":0.000011501842,"teacher_disagreement_score":0.44962075,"about_ca_system_score_codex":0.000018796905,"about_ca_system_score_gemma":0.00002225627,"threshold_uncertainty_score":0.99995846},"labels":[],"label_agreement":null},{"id":"W4250121752","doi":"10.1109/wi.2007.4427163","title":"Geographically-Sensitive Link Analysis","year":2007,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Link analysis; Web page; Ranking (information retrieval); World Wide Web; Geographic information system; Exploit; Information retrieval; Linkage (software); Web search engine; Web navigation; Geography; Cartography","score_opus":0.005754118645797308,"score_gpt":0.26205233808437417,"score_spread":0.25629821943857684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250121752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10754408,0.0000069787984,0.763774,0.00015450966,0.0000121628345,0.000060563634,0.0000027884953,0.00013612033,0.12830883],"genre_scores_gemma":[0.98905087,8.6194547e-7,0.009760301,0.000113149195,0.00029802552,0.000002787062,0.000049299266,0.0000076154374,0.0007171024],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991098,0.000021599333,0.00023366378,0.0002298071,0.00014454912,0.0002605867],"domain_scores_gemma":[0.9993393,0.00010259328,0.000063826876,0.0002985999,0.0001035758,0.00009211427],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036636193,0.00011367706,0.00023485399,0.0003690436,0.000076397744,0.00003190561,0.00011609528,0.000029204093,0.0016423527],"category_scores_gemma":[0.0000017974053,0.00009962034,0.00044378891,0.0017938527,0.000044714685,0.000042615873,0.000057558977,0.00011690206,0.000033706692],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012306898,0.00009423719,0.73765314,7.2105064e-7,0.0030831252,0.000005868758,0.00006110293,0.00010375388,0.0005334025,0.16298206,0.0010621896,0.094408095],"study_design_scores_gemma":[0.00043877767,0.00008167114,0.8742829,0.000009124165,0.0038883153,7.455068e-7,0.000509146,0.016815972,0.018035786,0.054204956,0.030699018,0.001033585],"about_ca_topic_score_codex":0.00058062014,"about_ca_topic_score_gemma":0.00020023658,"teacher_disagreement_score":0.8815068,"about_ca_system_score_codex":0.000008519054,"about_ca_system_score_gemma":0.000006570933,"threshold_uncertainty_score":0.99927026},"labels":[],"label_agreement":null},{"id":"W4250313673","doi":"10.1007/978-1-4614-6170-8_110016","title":"Exploratory Network Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Exploratory analysis; Computer science; Data science","score_opus":0.014425723582656104,"score_gpt":0.23322567765793556,"score_spread":0.21879995407527947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250313673","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037996151,0.000111917754,0.24431536,0.000020959851,0.000046287212,0.00009747513,0.000009924887,0.00017770981,0.75521654],"genre_scores_gemma":[0.05261993,0.000015007196,0.0027201674,0.00016212816,0.0030145368,0.000027189775,0.0005641578,0.00008708674,0.9407898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841845,0.000026644293,0.00046170538,0.00052561844,0.00025726933,0.00031031968],"domain_scores_gemma":[0.9983903,0.000079439465,0.00032966252,0.00097253104,0.00010844517,0.00011961485],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022851706,0.00043681383,0.00095111673,0.00028948195,0.00010800369,0.0000668705,0.00036084774,0.00014027074,0.030993424],"category_scores_gemma":[5.3192565e-7,0.00041310795,0.0011812849,0.00019231591,0.000059618877,0.00003359186,0.00018867404,0.00034089046,0.00053638127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017894615,0.00000537111,0.0009631946,0.0000021837889,0.00361747,7.777342e-7,0.0000063836947,0.0006209738,2.8359534e-7,0.8568302,0.12536894,0.012582464],"study_design_scores_gemma":[0.000047402144,0.000013893193,0.000024602474,0.000021945385,0.0031621512,4.8006008e-8,0.0000031581744,0.0016499078,0.000004208102,0.20304182,0.7915415,0.00048933865],"about_ca_topic_score_codex":0.000041419575,"about_ca_topic_score_gemma":0.00007533446,"teacher_disagreement_score":0.66617256,"about_ca_system_score_codex":0.000030143758,"about_ca_system_score_gemma":0.000031527037,"threshold_uncertainty_score":0.9998321},"labels":[],"label_agreement":null},{"id":"W4250642291","doi":"10.1007/978-1-4614-6170-8_100221","title":"Network Clustering","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cluster analysis; Computer science; Artificial intelligence","score_opus":0.015853231243313583,"score_gpt":0.23310753617405067,"score_spread":0.21725430493073708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250642291","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.3945615e-7,0.00004123158,0.29940575,0.00002775269,0.000062954954,0.00008152043,0.0000022361955,0.00012855257,0.7002495],"genre_scores_gemma":[0.01808262,0.0000038351436,0.004758208,0.00016592244,0.0039276863,0.000009630047,0.000099274665,0.00007278379,0.97288007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990504,0.000008126629,0.0002771582,0.00029941878,0.00013175812,0.0002331415],"domain_scores_gemma":[0.9991978,0.00004394306,0.0001657114,0.0004912394,0.00004002157,0.00006131474],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000106570194,0.00028723667,0.0004219576,0.000050723673,0.000075743876,0.000048873142,0.00023297495,0.00008999591,0.014891223],"category_scores_gemma":[2.5696272e-7,0.00027338444,0.00027635178,0.0000186232,0.00002952267,0.000016388125,0.00021824223,0.00025961417,0.00040434758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013208189,0.0000016848757,0.00007540072,0.0000032943656,0.00010879579,4.2159732e-7,0.0000022473673,0.00025319206,4.2873666e-7,0.83666015,0.12269093,0.040202137],"study_design_scores_gemma":[0.0000355121,0.000010238863,0.0000034837276,0.00005922228,0.00007220987,2.1250555e-7,5.102696e-7,0.0020656465,0.0000017740141,0.279328,0.7181636,0.0002596099],"about_ca_topic_score_codex":0.000040275518,"about_ca_topic_score_gemma":0.000025216319,"teacher_disagreement_score":0.5954727,"about_ca_system_score_codex":0.000018321105,"about_ca_system_score_gemma":0.000013625876,"threshold_uncertainty_score":0.9999718},"labels":[],"label_agreement":null},{"id":"W4251040165","doi":"10.1007/978-1-4939-7131-2_101071","title":"Signed Social Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sociology","score_opus":0.014689555810410612,"score_gpt":0.24681987419918366,"score_spread":0.23213031838877304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251040165","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003836692,0.000033809,0.14653021,0.00003605447,0.000066414315,0.00012641597,0.000009445631,0.00016790428,0.8530259],"genre_scores_gemma":[0.06274435,0.0000028706606,0.00075795985,0.000101538615,0.0074372734,0.000012118919,0.00024683896,0.000079648606,0.9286174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894565,0.000010543075,0.00028919295,0.0003466131,0.00016373434,0.0002442845],"domain_scores_gemma":[0.9992937,0.000031193325,0.00020001552,0.00031702954,0.00010303969,0.000055055163],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008657354,0.00032776222,0.00044276207,0.00007506354,0.00015559337,0.000060533584,0.0002690744,0.0001795086,0.084158875],"category_scores_gemma":[2.4467107e-7,0.00031320017,0.00044368397,0.000029059942,0.00010734681,0.000032095006,0.00016585492,0.000276331,0.00045534398],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035570317,0.000008222543,0.000020673517,0.0000012172108,0.00024557504,6.279243e-7,0.000015676114,0.0000044366434,9.485274e-7,0.57824785,0.40439954,0.01705168],"study_design_scores_gemma":[0.000081331265,0.000027485044,0.0000059183208,0.00002101833,0.00017643992,1.2671178e-7,0.0000055031346,0.0014597888,0.000010341866,0.31078452,0.6869892,0.00043834816],"about_ca_topic_score_codex":0.000030612726,"about_ca_topic_score_gemma":0.000013531842,"teacher_disagreement_score":0.28258964,"about_ca_system_score_codex":0.000027836044,"about_ca_system_score_gemma":0.000027343032,"threshold_uncertainty_score":0.999932},"labels":[],"label_agreement":null},{"id":"W4251201864","doi":"10.1007/978-1-4939-7131-2_101362","title":"Topic Information Diffusion","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Diffusion; Computer science; Information retrieval; Physics; Thermodynamics","score_opus":0.008387042066699723,"score_gpt":0.22168852662320768,"score_spread":0.21330148455650796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251201864","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008397963,0.0000075165835,0.025351895,0.000030560666,0.00005622662,0.00011156886,0.000008027777,0.00009642322,0.9742538],"genre_scores_gemma":[0.013562726,0.0000061090086,0.0011271151,0.00010907068,0.0009242384,0.000006977496,0.00040127992,0.00001503657,0.98384744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944335,0.000002840832,0.00022710522,0.000104516876,0.00012800502,0.000094187446],"domain_scores_gemma":[0.99944514,0.000010913292,0.00014162452,0.0002915441,0.00007832431,0.00003247844],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0000378491,0.00015873383,0.00018308354,0.000092549904,0.000052377625,0.00004759575,0.00013087246,0.0000709311,0.051230986],"category_scores_gemma":[3.8189566e-7,0.00013727407,0.00015080631,0.000014411051,0.00002664247,0.00012175871,0.000111398986,0.00011767473,0.0012358676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014305726,0.000004506868,0.000113638,0.0000039489305,0.00005593493,7.99157e-8,0.000038414488,2.5327387e-7,0.0000019593588,0.79933524,0.101119004,0.09932561],"study_design_scores_gemma":[0.00004076435,0.000014076472,0.000020433585,0.000023591501,0.000032419408,7.582206e-8,0.0000044454405,0.00018153628,0.000026252812,0.19941926,0.8001001,0.00013706648],"about_ca_topic_score_codex":0.000045634693,"about_ca_topic_score_gemma":0.0000059335734,"teacher_disagreement_score":0.69898105,"about_ca_system_score_codex":0.000018796392,"about_ca_system_score_gemma":0.000014969628,"threshold_uncertainty_score":0.99954176},"labels":[],"label_agreement":null},{"id":"W4251482342","doi":"10.1007/978-3-662-60723-7_49","title":"Social Network Analysis","year":2021,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Transparency (behavior); Social network analysis; Extant taxon; Politics; Social network (sociolinguistics); Data science; Space (punctuation); Network science; Political science; Sociology; Social science; Computer science; Complex network; Social media; World Wide Web; Law; Biology","score_opus":0.01721540674529622,"score_gpt":0.2680483980556243,"score_spread":0.2508329913103281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251482342","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000054324446,0.00017266715,0.03635591,0.00009273077,0.00003332882,0.00007945799,0.000018168299,0.00012209605,0.9631202],"genre_scores_gemma":[0.02650593,0.00000978964,0.0018489292,0.00009392131,0.003828453,0.000011116313,0.0012209609,0.00005408815,0.9664268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860203,0.000019671568,0.00038133067,0.00047077617,0.00024718526,0.0002789863],"domain_scores_gemma":[0.99907047,0.000044010085,0.0002407005,0.00045311503,0.00012932018,0.00006239589],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010721663,0.00034646923,0.00089131173,0.0001651837,0.00017599743,0.00009276367,0.00024059833,0.00014797204,0.05324054],"category_scores_gemma":[3.2597876e-7,0.0003531995,0.0016333266,0.00026344773,0.00004739412,0.000027228549,0.00021622045,0.00034706885,0.00010564097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011153015,0.000008759729,0.00061653653,0.0000015990862,0.0057214624,0.000002950348,0.000007412603,0.0000986894,2.9894593e-7,0.87563795,0.10868611,0.009217141],"study_design_scores_gemma":[0.000050821065,0.000005648241,0.00008580285,0.0000140827,0.0051014363,1.0036082e-7,0.000006486795,0.00048062464,0.0000042351926,0.26704597,0.72671473,0.0004900936],"about_ca_topic_score_codex":0.00007687299,"about_ca_topic_score_gemma":0.0000995321,"teacher_disagreement_score":0.6180286,"about_ca_system_score_codex":0.000033830587,"about_ca_system_score_gemma":0.000051484436,"threshold_uncertainty_score":0.999892},"labels":[],"label_agreement":null},{"id":"W4251488057","doi":"10.1007/978-1-4614-6170-8_100588","title":"Network Similarity","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Similarity (geometry); Computer science; Artificial intelligence","score_opus":0.01666540669033963,"score_gpt":0.23586006165268952,"score_spread":0.21919465496234988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251488057","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011397848,0.00005704322,0.11561111,0.00007300101,0.000066798006,0.00012137926,0.0000080227055,0.00017407902,0.8838874],"genre_scores_gemma":[0.019950226,0.000004788423,0.0034084972,0.00031994688,0.003761541,0.000009376047,0.0002004221,0.000066095265,0.97227913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989183,0.000012835244,0.0002965156,0.00035153417,0.00016844763,0.00025239054],"domain_scores_gemma":[0.9989875,0.00006561823,0.00018553443,0.0006192982,0.00006482254,0.00007721742],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001480588,0.00032495713,0.00050037575,0.0000471554,0.00009195889,0.000046460777,0.00027604998,0.0001315088,0.023713779],"category_scores_gemma":[5.109325e-7,0.0003050831,0.00035889904,0.000023314587,0.000048078593,0.000017334978,0.0001787368,0.00038004812,0.0004143582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010620784,0.0000029070666,0.0001840553,0.0000019330641,0.00009789695,4.008455e-7,0.0000011286257,0.000034525958,1.532685e-7,0.73080915,0.25466818,0.014198629],"study_design_scores_gemma":[0.000026810789,0.000008334555,0.0000075100074,0.000022966506,0.000076496486,1.0155539e-7,2.4136355e-7,0.0002715935,0.0000019837116,0.44433928,0.55504084,0.00020381417],"about_ca_topic_score_codex":0.00005060323,"about_ca_topic_score_gemma":0.000019520643,"teacher_disagreement_score":0.3003727,"about_ca_system_score_codex":0.000019179713,"about_ca_system_score_gemma":0.000023405426,"threshold_uncertainty_score":0.99994016},"labels":[],"label_agreement":null},{"id":"W4251608452","doi":"10.1007/978-1-4939-7131-2_100581","title":"Large Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.011467375063360305,"score_gpt":0.24391643632207768,"score_spread":0.2324490612587174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251608452","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002665009,0.00008014561,0.22884281,0.000013380376,0.00006656808,0.00010130974,0.000015154616,0.0001420042,0.770736],"genre_scores_gemma":[0.03662142,0.000011474752,0.0007589223,0.00011074972,0.0033618568,0.000008857459,0.00028089588,0.00006871203,0.9587771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989948,0.000006633993,0.00025855802,0.00033458316,0.00013597454,0.00026940642],"domain_scores_gemma":[0.99910265,0.000026539417,0.00015497848,0.0005587482,0.00008597073,0.000071138704],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00010360941,0.00029845227,0.0003731139,0.00007530296,0.00008411519,0.000046784782,0.0002556625,0.00013231965,0.13924992],"category_scores_gemma":[2.7210515e-7,0.00027280202,0.00034524084,0.000024229059,0.00004859249,0.00003103628,0.00020559318,0.00028458162,0.000863418],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001266046,0.000008563884,0.00008601999,9.1501977e-7,0.0001604283,6.3672496e-7,0.000006789951,0.000005269786,1.098499e-7,0.66057175,0.33588058,0.003277648],"study_design_scores_gemma":[0.000053641263,0.000015438127,0.0000036807855,0.000029571633,0.00008795024,1.4652294e-7,0.00000353331,0.002536438,0.000004135807,0.19816537,0.7988355,0.0002645799],"about_ca_topic_score_codex":0.000014950088,"about_ca_topic_score_gemma":0.000023001126,"teacher_disagreement_score":0.46295494,"about_ca_system_score_codex":0.000018330671,"about_ca_system_score_gemma":0.00001891223,"threshold_uncertainty_score":0.9999724},"labels":[],"label_agreement":null},{"id":"W4251705797","doi":"10.1007/978-1-4614-6170-8_100745","title":"Large-Scale Network","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Scale (ratio); Computer science; Geography; Cartography","score_opus":0.009040710410524799,"score_gpt":0.2296378030628482,"score_spread":0.2205970926523234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251705797","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000022555134,0.00006824849,0.22354716,0.000035839825,0.00007098907,0.00011287795,0.000012891464,0.00016174636,0.775988],"genre_scores_gemma":[0.010744645,0.000007725354,0.0039875917,0.00018796638,0.004056832,0.000013102768,0.00027920207,0.00007980368,0.98064315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987752,0.000012208467,0.00031535918,0.00037996285,0.00017651469,0.0003407853],"domain_scores_gemma":[0.9989686,0.000046314486,0.00018908658,0.0006461681,0.00006137037,0.00008844913],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016687193,0.00033682713,0.00052454317,0.00005530821,0.00010564295,0.00004649407,0.0002809635,0.00012716971,0.031737883],"category_scores_gemma":[2.6962857e-7,0.00031229632,0.00044053484,0.000028358832,0.000033182794,0.000018920024,0.00020030291,0.00032928403,0.0008024646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001135018,0.00000524394,0.00020179078,0.0000020965758,0.00011136565,2.9422532e-7,0.000006264536,0.000027439482,2.1829796e-7,0.7268321,0.26549938,0.0073126936],"study_design_scores_gemma":[0.000052791,0.000010706663,0.0000063076072,0.000035429945,0.00009007175,1.2419035e-7,0.0000021846374,0.0007563714,0.0000031531906,0.28223813,0.7165464,0.00025834123],"about_ca_topic_score_codex":0.000019425703,"about_ca_topic_score_gemma":0.000049929695,"teacher_disagreement_score":0.451047,"about_ca_system_score_codex":0.000017629769,"about_ca_system_score_gemma":0.000020160829,"threshold_uncertainty_score":0.9999755},"labels":[],"label_agreement":null},{"id":"W4251731244","doi":"10.32920/ryerson.14654559.v1","title":"Modelling Negative Correlation in Complex Networks Via Anti-Transitivity","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transitive relation; Mathematics; Iterated function; Complement (music); Bounded function; Combinatorics; Constant (computer programming); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.027789058171127937,"score_gpt":0.26868213330780577,"score_spread":0.24089307513667785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251731244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08926956,0.000054491076,0.9012194,0.000051166593,0.000090219815,0.00037804228,0.000010541648,0.00011419124,0.008812373],"genre_scores_gemma":[0.97533566,0.00001741808,0.022810964,0.000032012613,0.00033627992,0.00005548241,0.0013157558,0.000034162167,0.00006226971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979989,0.00024032594,0.00054523186,0.0006789728,0.00019926981,0.0003372856],"domain_scores_gemma":[0.99886334,0.00014810565,0.0002493072,0.0005212355,0.0001529987,0.00006498999],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002844862,0.00037443233,0.0007460096,0.00015291118,0.000085891006,0.00015283005,0.00023306378,0.00018627262,0.0010599664],"category_scores_gemma":[0.0000013020564,0.0004164521,0.00035421926,0.00037404613,0.000050111194,0.00012118205,0.00041505412,0.0010978272,0.000004141495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004946172,0.00011429448,0.02052218,0.000010122966,0.00012070184,0.000003332736,0.00019292458,0.9716563,0.000018107296,0.0018737176,0.0001361416,0.0053472305],"study_design_scores_gemma":[0.00015039812,0.0000052854807,0.0034482353,0.000116129464,0.00007204286,2.506685e-7,0.00010126568,0.98001206,0.00007910299,0.015590456,0.000036560614,0.0003882239],"about_ca_topic_score_codex":0.0074219797,"about_ca_topic_score_gemma":0.00039235322,"teacher_disagreement_score":0.8860661,"about_ca_system_score_codex":0.00008290541,"about_ca_system_score_gemma":0.00006622564,"threshold_uncertainty_score":0.9998532},"labels":[],"label_agreement":null},{"id":"W4251845444","doi":"10.4018/978-1-4666-6114-1.ch035","title":"Social Network Integration in Document Summarization","year":2014,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Automatic summarization; Computer science; Social media; Multi-document summarization; Event (particle physics); Information retrieval; Context (archaeology); Social network (sociolinguistics); World Wide Web; Microblogging; Data science","score_opus":0.011556664798314182,"score_gpt":0.2620186051772968,"score_spread":0.2504619403789826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251845444","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006240563,0.00002894537,0.044192053,0.000041193645,0.00010587997,0.0003062704,0.00001612278,0.00009082576,0.9551563],"genre_scores_gemma":[0.9525157,8.9173665e-7,0.0006957027,0.0001121151,0.0025364913,0.00004299701,0.00018002144,0.00004252824,0.043873556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860406,0.000040210147,0.00046758127,0.00036960546,0.0002406731,0.00027787618],"domain_scores_gemma":[0.999282,0.000020875073,0.00031493363,0.00025701153,0.00007631305,0.000048849222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016530284,0.00034286754,0.00047096264,0.00006135782,0.00010135027,0.00009818552,0.00021367846,0.00019391728,0.00016951175],"category_scores_gemma":[0.0000011723075,0.00036294022,0.0002534541,0.000037496335,0.000044486587,0.000028641145,0.00011810399,0.00028039765,0.00004984212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010102436,0.000004483973,0.00038414114,0.0000031318652,0.00005647553,9.372195e-7,0.000020898426,0.000058938967,0.0000013375206,0.9262324,0.01059096,0.062636204],"study_design_scores_gemma":[0.00015743842,0.000022397096,0.00009136493,0.00013262613,0.00008227179,2.0897146e-7,0.0000034849454,0.0003183326,0.000008758258,0.9560378,0.042828504,0.00031679607],"about_ca_topic_score_codex":0.00026308294,"about_ca_topic_score_gemma":0.00040328558,"teacher_disagreement_score":0.9524533,"about_ca_system_score_codex":0.00023874282,"about_ca_system_score_gemma":0.000057234323,"threshold_uncertainty_score":0.9998823},"labels":[],"label_agreement":null},{"id":"W4252027226","doi":"10.15353/joci.v12i2.3219","title":"Open Data Intermediaries in Developing Countries","year":2016,"lang":"en","type":"article","venue":"The Journal of Community Informatics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"International Development Research Centre","keywords":"Intermediary; Business; Grassroots; Social capital; Open data; Capital (architecture); Industrial organization; Computer science; Marketing; World Wide Web; Political science; Geography","score_opus":0.07140554424817427,"score_gpt":0.3457310237497503,"score_spread":0.27432547950157604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252027226","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7053717,0.000034412617,0.283268,0.006093066,0.00007624961,0.00015810934,0.00003056181,0.000011037527,0.0049568526],"genre_scores_gemma":[0.99694777,0.00012451338,0.0024099848,0.00043257003,0.00004953266,7.855625e-7,0.000008113947,0.0000044140106,0.000022341444],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99874234,0.0002965737,0.0006839911,0.0000069619414,0.00014961313,0.00012052049],"domain_scores_gemma":[0.99750024,0.0009546201,0.00058749376,0.0007938732,0.00013913731,0.00002463838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033206113,0.00007969805,0.00022698617,0.00008459909,0.00018803623,0.00012803751,0.0044640703,0.000014819099,0.00007844674],"category_scores_gemma":[0.000050089617,0.000039927952,0.000026428985,0.00014005763,0.00018507059,0.0013015204,0.0030326047,0.00035172713,0.000007548261],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037161057,0.0003193382,0.0764073,0.00009757894,0.0009633516,9.4516224e-7,0.25082937,0.00015277411,0.000044170192,0.18619694,0.16120371,0.32341293],"study_design_scores_gemma":[0.0025041297,0.00023632085,0.011363093,0.0019151857,0.00023531956,0.00004679077,0.14304684,0.0012348085,0.001604815,0.18640916,0.6508335,0.00057006907],"about_ca_topic_score_codex":0.00015501739,"about_ca_topic_score_gemma":0.00013115053,"teacher_disagreement_score":0.48962978,"about_ca_system_score_codex":0.00004077553,"about_ca_system_score_gemma":0.00014907205,"threshold_uncertainty_score":0.82954276},"labels":[],"label_agreement":null},{"id":"W4252056038","doi":"10.4018/978-1-4666-5019-0.ch006","title":"Social Network Integration in Document Summarization","year":2013,"lang":"en","type":"book-chapter","venue":"Advances in data mining and database management book series","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Automatic summarization; Computer science; Social media; Multi-document summarization; Event (particle physics); Information retrieval; Social network (sociolinguistics); Context (archaeology); World Wide Web; Microblogging; Data science","score_opus":0.019994973493085242,"score_gpt":0.28605726422653344,"score_spread":0.26606229073344817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252056038","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005129362,0.00841539,0.03081317,0.00029655636,0.0002041949,0.0012342111,0.000769542,0.00012735146,0.9580883],"genre_scores_gemma":[0.009527203,0.065722,0.14841679,0.00051815435,0.0027614392,0.00068762177,0.1869543,0.00027259754,0.5851399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982869,0.000036221583,0.0005190841,0.00068954163,0.00019938117,0.00026884692],"domain_scores_gemma":[0.99884427,0.000052432537,0.0002838337,0.00076546374,0.000022316068,0.000031660315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031969958,0.00034139783,0.00040739556,0.00021908234,0.00012573811,0.00014368483,0.0004412901,0.00005542948,0.0005373928],"category_scores_gemma":[0.000003071,0.00035786047,0.000033333883,0.000096664975,0.00010772352,0.0029738592,0.0013727832,0.00019935268,0.000010296437],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027595632,0.000017359773,0.0007023969,0.000073215175,0.00006722325,0.000009291274,0.00007649048,0.000058536563,3.4708086e-7,0.6547133,0.0363313,0.307923],"study_design_scores_gemma":[0.00024414988,0.000018528104,0.00006039961,0.00082730496,0.000102417886,2.6574037e-7,0.0002321082,0.0008852446,0.0000022143463,0.053169064,0.9440411,0.00041722038],"about_ca_topic_score_codex":0.00007229014,"about_ca_topic_score_gemma":0.00080794015,"teacher_disagreement_score":0.9077098,"about_ca_system_score_codex":0.000043695316,"about_ca_system_score_gemma":0.000011210625,"threshold_uncertainty_score":0.99988735},"labels":[],"label_agreement":null},{"id":"W4252138793","doi":"10.1007/978-1-4614-7163-9_356-1","title":"Relative Validity Criteria for Community Mining Algorithms","year":2017,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Data mining; Algorithm","score_opus":0.1457631750780938,"score_gpt":0.3652299218462669,"score_spread":0.2194667467681731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252138793","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038810376,0.00001940513,0.15349258,0.00004880863,0.00010928823,0.00037018856,0.00024096086,0.00011082924,0.84556913],"genre_scores_gemma":[0.04193768,0.000005210234,0.04724741,0.000037431324,0.0012842162,0.000080259146,0.0010378425,0.000096277065,0.9082737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891806,0.00006472376,0.00035270787,0.00029201168,0.00013804046,0.0002344713],"domain_scores_gemma":[0.99761575,0.0004269271,0.0004920668,0.0011778094,0.00021112249,0.00007629412],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005235058,0.00038439845,0.00065388856,0.000084949876,0.0008182004,0.00014542189,0.0006132219,0.00016435278,0.0029826148],"category_scores_gemma":[0.000010899057,0.00037473452,0.0005516995,0.0000074242685,0.00013325404,0.0001446996,0.000344439,0.0005993312,0.000029197638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017758177,0.00006374483,0.00021938243,0.000030842784,0.0008835572,0.0000011323943,0.0003587336,8.690149e-7,0.000009718262,0.8273999,0.10585015,0.0651642],"study_design_scores_gemma":[0.00017898162,0.000083961575,0.000034652836,0.00013979107,0.00030930547,2.9232984e-7,0.00003728627,0.0009716818,0.000077384335,0.6026572,0.3950468,0.00046265323],"about_ca_topic_score_codex":0.00037857718,"about_ca_topic_score_gemma":0.00006281177,"teacher_disagreement_score":0.28919664,"about_ca_system_score_codex":0.000044811855,"about_ca_system_score_gemma":0.00004624418,"threshold_uncertainty_score":0.9998705},"labels":[],"label_agreement":null},{"id":"W4253402737","doi":"10.1007/978-1-4939-7131-2_101168","title":"Social Network Randomization","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Randomization; Computer science; Psychology; Sociology; Medicine; Randomized controlled trial; Internal medicine","score_opus":0.014360738145293183,"score_gpt":0.25758160234651506,"score_spread":0.24322086420122188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253402737","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037769614,0.000028922665,0.08248784,0.00004424403,0.000061988176,0.00018559908,0.000005203763,0.0001312653,0.91705114],"genre_scores_gemma":[0.01044154,0.000004959337,0.0015171893,0.000072215786,0.011478232,0.0000148306,0.000387561,0.00006208895,0.9760214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991218,0.000014660203,0.00028221033,0.00025354052,0.00014675004,0.00018104081],"domain_scores_gemma":[0.9993987,0.000034470042,0.00021911158,0.00021008585,0.000104543506,0.0000330753],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013044736,0.00024034691,0.0004313868,0.000049692568,0.00016303883,0.00004935119,0.00015695373,0.00011653592,0.042736314],"category_scores_gemma":[4.5021176e-7,0.00022560701,0.00035644893,0.00003152459,0.000064501735,0.00003230795,0.00009259106,0.00016056027,0.00040222896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014779669,0.000003330181,0.000024617138,0.0000010809891,0.00016256515,1.3338827e-7,0.000012140771,0.0000069163893,2.1900136e-7,0.56764853,0.42608804,0.0060376255],"study_design_scores_gemma":[0.00028374407,0.000007286891,0.000002097807,0.0000150816595,0.00012664543,5.1974624e-8,0.0000011609392,0.00024725634,0.0000037022132,0.48517746,0.51394874,0.00018674317],"about_ca_topic_score_codex":0.000014135654,"about_ca_topic_score_gemma":0.000010322506,"teacher_disagreement_score":0.08786071,"about_ca_system_score_codex":0.000020974172,"about_ca_system_score_gemma":0.000026189773,"threshold_uncertainty_score":0.95813876},"labels":[],"label_agreement":null},{"id":"W4253477673","doi":"10.32920/ryerson.14655462","title":"Models And Mining Of On-Line Social Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Logarithm; Dimension (graph theory); Property (philosophy); Degree distribution; Line (geometry); Computer science; Power law; Distribution (mathematics); Power (physics); Degree (music); Spectral power distribution; Feature (linguistics); Statistical physics; Complex network; Mathematics; Physics; Combinatorics; Statistics; Mathematical analysis; Optics; World Wide Web; Geometry","score_opus":0.05303127236350695,"score_gpt":0.31209027644387777,"score_spread":0.2590590040803708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253477673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1562761,0.00016682311,0.8101038,0.000090208596,0.0000569269,0.00012858318,0.000011283021,0.00005409658,0.03311222],"genre_scores_gemma":[0.99094254,0.000015607438,0.007969947,0.000032474043,0.0006006251,0.000020129988,0.0001593703,0.000018508908,0.0002407895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907434,0.000043698343,0.00029355352,0.0003230734,0.00011785113,0.00014747294],"domain_scores_gemma":[0.999378,0.000056367753,0.0001883766,0.00025875343,0.00008534691,0.00003313448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011550677,0.000188081,0.00048055287,0.000056079472,0.00005156889,0.000054868193,0.00014282853,0.00009876765,0.00029596532],"category_scores_gemma":[7.913827e-7,0.00018578148,0.00021358834,0.00008482807,0.000040514027,0.000025922782,0.00066006253,0.00030923812,1.7116413e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017192664,0.00020774905,0.0034303197,0.00004468603,0.0008206116,0.0000017297716,0.0005900077,0.81409365,0.000013589051,0.07640552,0.0054971725,0.09887778],"study_design_scores_gemma":[0.00010254224,0.000017200156,0.00014434927,0.000100332,0.00011256821,7.425766e-8,0.00022603391,0.9751963,0.0001434806,0.023670346,0.00006855079,0.00021819635],"about_ca_topic_score_codex":0.00021993375,"about_ca_topic_score_gemma":0.000014614107,"teacher_disagreement_score":0.83466643,"about_ca_system_score_codex":0.00000994243,"about_ca_system_score_gemma":0.000037929072,"threshold_uncertainty_score":0.7575949},"labels":[],"label_agreement":null},{"id":"W4253842689","doi":"10.1007/978-1-4939-7131-2_100723","title":"Network Clustering","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cluster analysis; Computer science; Artificial intelligence","score_opus":0.02010331379004455,"score_gpt":0.2463088758287072,"score_spread":0.22620556203866266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253842689","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027939695,0.000057813926,0.090268314,0.000022905488,0.000103626975,0.00011422884,0.000005306754,0.00016578422,0.9092592],"genre_scores_gemma":[0.005273786,0.00000420989,0.0063417065,0.000117566866,0.006254411,0.000008619388,0.00009425125,0.00007093523,0.98183453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990377,0.000005882979,0.00026729435,0.0003144692,0.00013254154,0.000242111],"domain_scores_gemma":[0.9992026,0.000027541557,0.00015578809,0.0004924027,0.00006246241,0.000059222308],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000088786,0.00028324977,0.00036180427,0.0000518593,0.00008739372,0.000052578467,0.00024229716,0.000091945076,0.071927175],"category_scores_gemma":[2.1924505e-7,0.00026857693,0.00025121242,0.000023534174,0.000054788576,0.000030823623,0.00026948567,0.00021157193,0.0009006417],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029297485,0.000004174242,0.000086782486,0.0000033986703,0.00020581084,9.915733e-7,0.000010271394,0.000043122716,7.431347e-7,0.5303014,0.4537955,0.015544892],"study_design_scores_gemma":[0.000029847137,0.000014753266,0.0000026687392,0.00005915751,0.00006843821,2.3566221e-7,0.0000014481798,0.0007470906,0.0000035176822,0.3713281,0.6275056,0.00023913235],"about_ca_topic_score_codex":0.00003277338,"about_ca_topic_score_gemma":0.000034198503,"teacher_disagreement_score":0.17371011,"about_ca_system_score_codex":0.000021636812,"about_ca_system_score_gemma":0.000019430252,"threshold_uncertainty_score":0.99997663},"labels":[],"label_agreement":null},{"id":"W4253913757","doi":"10.36334/modsim.2019.b5.alhuzali","title":"Correspondence analysis approach to examine the Nobel Prize","year":2019,"lang":"en","type":"article","venue":"El Sawah, S. (ed.) MODSIM2019, 23rd International Congress on Modelling and Simulation.","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.02098727090676983,"score_gpt":0.2958141347576292,"score_spread":0.27482686385085936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253913757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33193883,0.00008632904,0.6573864,0.0001687571,0.00034538895,0.00044928896,0.000051130508,0.000078611636,0.009495229],"genre_scores_gemma":[0.9873704,0.000022104086,0.00397037,0.00023756671,0.00035063928,0.00006029021,0.000225219,0.000033733868,0.0077297245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975364,0.00013605352,0.0005349959,0.00074385974,0.0007246772,0.00032401393],"domain_scores_gemma":[0.9978482,0.000665668,0.00026970013,0.0006634236,0.0004186804,0.00013432116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005540671,0.00034178104,0.00044819823,0.00043166368,0.00025404088,0.00029106755,0.0006556653,0.00007674618,0.0007474141],"category_scores_gemma":[0.000021846863,0.00027436393,0.0002766119,0.0005626853,0.00006595893,0.0002530505,0.0001801267,0.00033459978,0.00013956738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010693103,0.0001249718,0.019328117,0.0000037906022,0.0006121016,3.7814067e-7,0.00016450114,0.9619139,0.000033668188,0.014649827,0.0007767526,0.0022850863],"study_design_scores_gemma":[0.00036773528,0.000047173544,0.0019357327,0.000031047402,0.00019236634,3.2975802e-7,0.00006501715,0.98506427,0.000057350906,0.0025223373,0.009394249,0.00032239978],"about_ca_topic_score_codex":0.00024283849,"about_ca_topic_score_gemma":0.0000047545545,"teacher_disagreement_score":0.6554315,"about_ca_system_score_codex":0.00006407259,"about_ca_system_score_gemma":0.000033801116,"threshold_uncertainty_score":0.99997085},"labels":[],"label_agreement":null},{"id":"W4253918505","doi":"10.1007/978-1-4939-7131-2_100036","title":"Art About Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.011609541834187045,"score_gpt":0.23995672438034626,"score_spread":0.2283471825461592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253918505","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019006967,0.000111004025,0.14758381,0.00002027864,0.00009263013,0.00013286648,0.000008357563,0.00017247423,0.8518767],"genre_scores_gemma":[0.006581654,0.00002344176,0.0012932023,0.00012884659,0.0037277874,0.0000127470885,0.00030700653,0.00007565325,0.98784965],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886954,0.0000073797983,0.0003220328,0.00038729317,0.00016081144,0.00025297163],"domain_scores_gemma":[0.9989396,0.000033906643,0.00019326946,0.0006455119,0.00010192303,0.00008582057],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009167056,0.00035157267,0.00044041526,0.00008808149,0.00007718317,0.00006809917,0.00029037954,0.00014901526,0.12798579],"category_scores_gemma":[3.2832048e-7,0.00032316448,0.00039902297,0.000027756285,0.000096785894,0.000037109367,0.00016958539,0.00032408567,0.002389525],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016332986,0.00000584827,0.000067530425,0.0000011036636,0.0001741095,6.557839e-7,0.000003339269,0.000018003973,1.8501684e-7,0.42648947,0.5620425,0.011195659],"study_design_scores_gemma":[0.000043011514,0.000019275853,0.000007901203,0.00005635621,0.000107559514,2.6847528e-7,0.0000012523557,0.0019891267,0.0000055603227,0.13827698,0.85917485,0.0003178822],"about_ca_topic_score_codex":0.000016927917,"about_ca_topic_score_gemma":0.000017722381,"teacher_disagreement_score":0.29713237,"about_ca_system_score_codex":0.00002292832,"about_ca_system_score_gemma":0.000024410727,"threshold_uncertainty_score":0.99992204},"labels":[],"label_agreement":null},{"id":"W4254581494","doi":"10.1007/978-1-4614-6170-8_100055","title":"Topic Networks","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.00944523433376101,"score_gpt":0.2217540753780046,"score_spread":0.21230884104424358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254581494","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010372319,0.00005943413,0.32295027,0.000027381722,0.000053773856,0.00007275994,0.0000015260916,0.00009724754,0.6767366],"genre_scores_gemma":[0.06335398,0.000009519358,0.0007632259,0.000117600655,0.0021617196,0.00000827545,0.000113799615,0.000044439446,0.93342745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999186,0.0000073015885,0.00024018428,0.00027675545,0.000113942435,0.00017585042],"domain_scores_gemma":[0.9992208,0.00003986602,0.00013206924,0.000503669,0.00004433738,0.00005927324],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006691262,0.00025635105,0.00037678878,0.00006156758,0.00005049311,0.00003934982,0.00022342583,0.00011031264,0.022177791],"category_scores_gemma":[2.7154235e-7,0.00023336211,0.00031393237,0.000015313477,0.000032565524,0.0000136600665,0.00011410724,0.00028693225,0.00023110988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.393051e-7,0.0000023729922,0.00014094918,0.000001362921,0.0000977775,3.3619528e-7,0.000001224564,0.000078194935,1.2960469e-7,0.8494852,0.07004646,0.08014542],"study_design_scores_gemma":[0.00004015717,0.00001147296,0.0000099403505,0.00002739126,0.000078595345,1.4198079e-7,4.9567393e-7,0.0034553618,0.0000033466176,0.15582521,0.84030265,0.00024520553],"about_ca_topic_score_codex":0.000041253865,"about_ca_topic_score_gemma":0.0000106908465,"teacher_disagreement_score":0.7702562,"about_ca_system_score_codex":0.000015512807,"about_ca_system_score_gemma":0.000012082893,"threshold_uncertainty_score":0.9787161},"labels":[],"label_agreement":null},{"id":"W4254592161","doi":"10.3410/f.1147151.604277","title":"Faculty Opinions recommendation of Detecting compensatory dynamics in competitive communities under environmental forcing.","year":2009,"lang":"en","type":"dataset","venue":"Faculty Opinions – Post-Publication Peer Review of the Biomedical Literature","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Forcing (mathematics); Dynamics (music); Environmental science; Computer science; Psychology; Climatology; Geology","score_opus":0.022569437457292497,"score_gpt":0.32581284713745984,"score_spread":0.30324340968016733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254592161","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005722893,0.00028466212,0.00035298822,0.019422386,0.00017050319,0.0009199098,0.97856885,0.000028954031,0.0002460378],"genre_scores_gemma":[0.0025371793,0.00007843822,0.00064559816,0.001136913,0.00015940756,0.00011401354,0.9951851,0.000023122651,0.00012022489],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963216,0.0006522241,0.001498634,0.00039840478,0.0008056345,0.00032346908],"domain_scores_gemma":[0.99594176,0.00024412267,0.0015593051,0.0011501437,0.00097436894,0.00013030341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009963306,0.0004892342,0.0010178351,0.00040312865,0.00025543105,0.00009252604,0.0013245107,0.00030776623,0.00051208923],"category_scores_gemma":[0.00018470794,0.00037906054,0.00055317715,0.0011990565,0.00036009203,0.00024127838,0.0005596521,0.0013480283,0.000009404275],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000579348,0.00041782486,0.0001493976,0.0007290687,0.00014041897,7.275826e-8,0.00011454867,0.0000014875538,4.1900893e-7,0.0026756665,0.99230474,0.003460549],"study_design_scores_gemma":[0.0004070667,0.000072368806,0.002726237,0.006919809,0.00014691801,0.0000044548055,0.00074215705,0.0002953573,0.0000071657287,0.00024201078,0.9881027,0.0003337901],"about_ca_topic_score_codex":0.00041140665,"about_ca_topic_score_gemma":0.0001424591,"teacher_disagreement_score":0.018285472,"about_ca_system_score_codex":0.0003421491,"about_ca_system_score_gemma":0.00019001917,"threshold_uncertainty_score":0.9998661},"labels":[],"label_agreement":null},{"id":"W4254788872","doi":"10.1007/978-1-4939-7131-2_100705","title":"Multiplex Social Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multiplex; Biology; Genetics","score_opus":0.018747315066005067,"score_gpt":0.25551244666458345,"score_spread":0.23676513159857837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254788872","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000060700936,0.000037515463,0.09111195,0.00002692743,0.000082008846,0.00015492976,0.000015679912,0.00019397058,0.908371],"genre_scores_gemma":[0.07050475,0.000004966765,0.001215035,0.00008973265,0.007890762,0.000014359412,0.00030770144,0.00008853771,0.91988415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886024,0.000010176224,0.00031415958,0.00038003767,0.00017021789,0.00026516244],"domain_scores_gemma":[0.9992289,0.000035021505,0.00021385406,0.0003494689,0.00011191827,0.000060852894],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008329595,0.00035658613,0.0004572291,0.000082005405,0.00016471003,0.00006061906,0.0002866053,0.00019173804,0.12635],"category_scores_gemma":[3.7264527e-7,0.0003416953,0.0004854109,0.000028374267,0.00012395711,0.000034676694,0.00019798975,0.00034100012,0.00048802778],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043705786,0.000011948551,0.00010033349,0.000001716901,0.00030428995,7.851934e-7,0.000019226696,0.000011975268,9.232605e-7,0.36226708,0.6111704,0.026106922],"study_design_scores_gemma":[0.00010500947,0.000017986515,0.000024305204,0.00002246849,0.0001433295,1.5914682e-7,0.0000058993014,0.00454692,0.000007592709,0.13359685,0.86108136,0.00044810583],"about_ca_topic_score_codex":0.000056989295,"about_ca_topic_score_gemma":0.000025666435,"teacher_disagreement_score":0.24991095,"about_ca_system_score_codex":0.000029997056,"about_ca_system_score_gemma":0.00002428176,"threshold_uncertainty_score":0.9999035},"labels":[],"label_agreement":null},{"id":"W4254977877","doi":"10.1109/asonam.2014.6921568","title":"Using triads to identify local community structure in social networks","year":2014,"lang":"en","type":"article","venue":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Metric (unit); Outlier; Data mining; Node (physics); Ground truth; Community structure; Quality (philosophy); Social network analysis; Theoretical computer science; Machine learning; Artificial intelligence; Mathematics; Social media; World Wide Web; Statistics; Engineering","score_opus":0.04127421258932179,"score_gpt":0.3844273552788576,"score_spread":0.3431531426895358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254977877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39355165,0.00014360661,0.60103315,0.00026164655,0.00046412158,0.00022253433,0.000044434317,0.00004733582,0.004231545],"genre_scores_gemma":[0.99512476,0.0000974387,0.002249183,0.00022860189,0.0019304273,0.000032949116,0.00022395886,0.00003235129,0.00008030941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968234,0.0007183298,0.0008144506,0.0006138573,0.00045950353,0.0005705096],"domain_scores_gemma":[0.998336,0.00040783125,0.00050320587,0.00038233574,0.00024192443,0.00012871045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011668978,0.00043147092,0.0009672614,0.0005159241,0.0005742302,0.00027109808,0.0009271419,0.00021353878,0.00061705895],"category_scores_gemma":[0.00003777142,0.00044991303,0.000331846,0.0010558517,0.00022243173,0.000324252,0.00033771092,0.0009629658,0.0000045227303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029788347,0.00030687012,0.2374754,0.000012374592,0.000967919,0.0000036699842,0.0014260281,0.5108488,0.00012288873,0.059326496,0.0045686215,0.18464305],"study_design_scores_gemma":[0.0008662905,0.00007284302,0.045752548,0.00011163245,0.00030399283,5.0993197e-7,0.0012764157,0.93176574,0.000013692876,0.016497629,0.0026829992,0.00065571984],"about_ca_topic_score_codex":0.0010624538,"about_ca_topic_score_gemma":0.003937543,"teacher_disagreement_score":0.60157317,"about_ca_system_score_codex":0.00018266383,"about_ca_system_score_gemma":0.000041345163,"threshold_uncertainty_score":0.99979526},"labels":[],"label_agreement":null},{"id":"W4255079770","doi":"10.31234/osf.io/bmry2","title":"Using Network Science to Map What Montréal Bilinguals Talk about Across Languages and Communicative Contexts","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Variety (cybernetics); Psychology; Neuroscience of multilingualism; Reading (process); Linguistics; Cognition; Computer science; Artificial intelligence","score_opus":0.03836186963067636,"score_gpt":0.38980267254530043,"score_spread":0.3514408029146241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255079770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84553707,0.019397214,0.122982234,0.0022238311,0.00040192984,0.0021672056,0.00015616862,0.00054338365,0.0065909643],"genre_scores_gemma":[0.9562565,0.000118243275,0.042369846,0.00040285065,0.00057288544,0.000048680773,0.000050889237,0.000035072193,0.00014499846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977311,0.00012195536,0.000447794,0.0008252589,0.00030362062,0.00057029334],"domain_scores_gemma":[0.9978848,0.00016943677,0.0002974325,0.001144929,0.0002373141,0.0002660963],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006512926,0.0003956344,0.00071725104,0.000075785145,0.0005219866,0.0012681086,0.0011099858,0.00008394345,0.00012035167],"category_scores_gemma":[0.000017630835,0.00036827583,0.00017577603,0.00045528047,0.00044694435,0.00025626647,0.0064878576,0.00061121327,0.000010885158],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021552884,0.00057604624,0.0436725,0.00033757635,0.002554915,0.000060736766,0.052677218,0.063498214,0.015488353,0.1002261,0.014282868,0.70640993],"study_design_scores_gemma":[0.0028041175,0.0005518755,0.020894878,0.011814889,0.0015827507,0.000017434108,0.107499376,0.36021164,0.043063655,0.35925162,0.08114917,0.011158599],"about_ca_topic_score_codex":0.0064935144,"about_ca_topic_score_gemma":0.00060185,"teacher_disagreement_score":0.69525135,"about_ca_system_score_codex":0.00007855088,"about_ca_system_score_gemma":0.00014299335,"threshold_uncertainty_score":0.9998769},"labels":[],"label_agreement":null},{"id":"W4255226672","doi":"10.1007/978-1-4614-6170-8_100796","title":"Longitudinal Network Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.015731249464413555,"score_gpt":0.24855577097245812,"score_spread":0.23282452150804456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255226672","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050234617,0.00007607216,0.29395851,0.000026439287,0.000038239825,0.00008815828,0.0000098133005,0.00013080188,0.70566696],"genre_scores_gemma":[0.11581904,0.000008508013,0.003289363,0.000062028805,0.0027515206,0.000012721503,0.00051871093,0.000061812694,0.8774763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998313,0.000018251601,0.00046686394,0.00058197096,0.00027520824,0.00034470978],"domain_scores_gemma":[0.9984521,0.0000852338,0.00033303574,0.00090438937,0.00010950434,0.00011570878],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002063654,0.00045186514,0.001005318,0.00028029343,0.00012138677,0.00008238508,0.0003703478,0.00013661441,0.044332348],"category_scores_gemma":[5.6478683e-7,0.00041843616,0.0013596682,0.00020103525,0.00006421734,0.000025002135,0.00019480918,0.00035598167,0.00043206775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024631206,0.0000059642275,0.009116271,0.0000022841782,0.004791489,0.0000012021746,0.0000019688175,0.0008635025,1.1256064e-7,0.8966158,0.0767913,0.011807611],"study_design_scores_gemma":[0.000066239125,0.000023276954,0.00049867074,0.000029962881,0.006156171,2.2663913e-7,8.989369e-7,0.003504927,0.0000025022805,0.25686938,0.73220325,0.00064450345],"about_ca_topic_score_codex":0.00014483053,"about_ca_topic_score_gemma":0.00013397641,"teacher_disagreement_score":0.65541196,"about_ca_system_score_codex":0.00003066649,"about_ca_system_score_gemma":0.000024444822,"threshold_uncertainty_score":0.9998267},"labels":[],"label_agreement":null},{"id":"W4255249263","doi":"10.32920/ryerson.14654559","title":"Modelling Negative Correlation in Complex Networks Via Anti-Transitivity","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transitive relation; Mathematics; Iterated function; Complement (music); Bounded function; Combinatorics; Correlation; Discrete mathematics; Mathematical analysis","score_opus":0.027789058171127937,"score_gpt":0.26868213330780577,"score_spread":0.24089307513667785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255249263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08926956,0.000054491076,0.9012194,0.000051166593,0.000090219815,0.00037804228,0.000010541648,0.00011419124,0.008812373],"genre_scores_gemma":[0.97533566,0.00001741808,0.022810964,0.000032012613,0.00033627992,0.00005548241,0.0013157558,0.000034162167,0.00006226971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979989,0.00024032594,0.00054523186,0.0006789728,0.00019926981,0.0003372856],"domain_scores_gemma":[0.99886334,0.00014810565,0.0002493072,0.0005212355,0.0001529987,0.00006498999],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002844862,0.00037443233,0.0007460096,0.00015291118,0.000085891006,0.00015283005,0.00023306378,0.00018627262,0.0010599664],"category_scores_gemma":[0.0000013020564,0.0004164521,0.00035421926,0.00037404613,0.000050111194,0.00012118205,0.00041505412,0.0010978272,0.000004141495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004946172,0.00011429448,0.02052218,0.000010122966,0.00012070184,0.000003332736,0.00019292458,0.9716563,0.000018107296,0.0018737176,0.0001361416,0.0053472305],"study_design_scores_gemma":[0.00015039812,0.0000052854807,0.0034482353,0.000116129464,0.00007204286,2.506685e-7,0.00010126568,0.98001206,0.00007910299,0.015590456,0.000036560614,0.0003882239],"about_ca_topic_score_codex":0.0074219797,"about_ca_topic_score_gemma":0.00039235322,"teacher_disagreement_score":0.8860661,"about_ca_system_score_codex":0.00008290541,"about_ca_system_score_gemma":0.00006622564,"threshold_uncertainty_score":0.9998532},"labels":[],"label_agreement":null},{"id":"W4255345861","doi":"10.1007/978-1-4939-7131-2_101169","title":"Social Network Representation","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Representation (politics); Social network (sociolinguistics); Computer science; Sociology; Political science; World Wide Web; Social media","score_opus":0.030376026859135607,"score_gpt":0.3054717165608952,"score_spread":0.2750956897017596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255345861","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013168706,0.000019645118,0.01628044,0.00006899768,0.0000635682,0.00013694503,0.0000057332627,0.00013863044,0.98327285],"genre_scores_gemma":[0.014081943,0.0000029893583,0.0017052446,0.0000622534,0.011336163,0.00001223703,0.00034277316,0.000052346564,0.97240406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907297,0.0000116233505,0.00025905625,0.00030788832,0.00016769725,0.00018078988],"domain_scores_gemma":[0.9993468,0.000027518636,0.00021088897,0.00028547423,0.00009565733,0.000033679473],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007837105,0.00021449743,0.00031470612,0.00004722835,0.00014921241,0.0000497697,0.00016692125,0.00010142794,0.03954796],"category_scores_gemma":[3.480493e-7,0.00021366659,0.00031480353,0.000035852816,0.000069998154,0.000038087193,0.000121823774,0.00017684618,0.00054645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021187473,0.0000029678993,0.000111355184,7.568363e-7,0.00012520223,2.584142e-7,0.000016565251,0.0000021346752,4.9311467e-7,0.5262055,0.46470106,0.008831592],"study_design_scores_gemma":[0.000034476325,0.0000082742545,0.000017407658,0.0000112468915,0.000082430015,7.2304914e-8,0.0000035064288,0.000085201864,0.000009325005,0.56082314,0.43876153,0.00016339078],"about_ca_topic_score_codex":0.0000467037,"about_ca_topic_score_gemma":0.000016177128,"teacher_disagreement_score":0.03900151,"about_ca_system_score_codex":0.00002176621,"about_ca_system_score_gemma":0.000021649932,"threshold_uncertainty_score":0.96133},"labels":[],"label_agreement":null},{"id":"W4255375868","doi":"10.1007/978-1-4939-7131-2_100701","title":"Multiple Aligned Social Network Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Social network analysis; Computer science; World Wide Web; Social media","score_opus":0.015384639895735843,"score_gpt":0.2542198019006648,"score_spread":0.23883516200492894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255375868","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005275887,0.000044040313,0.06271763,0.00004666306,0.000066977664,0.00019701693,0.00005786926,0.00023867346,0.9365784],"genre_scores_gemma":[0.13461053,0.000004585355,0.0042186496,0.00011882065,0.007961515,0.000025574409,0.0012631201,0.000096760785,0.8517004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814755,0.000026452672,0.00051692437,0.000600121,0.0003022558,0.00040671777],"domain_scores_gemma":[0.9986479,0.000086839966,0.0003956969,0.00059673656,0.00018112412,0.00009165829],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018803233,0.00048157506,0.0009967164,0.00025589383,0.0002874369,0.00009257895,0.00040426824,0.00021163894,0.062611446],"category_scores_gemma":[9.58592e-7,0.00046626592,0.0015342941,0.0002522968,0.00012961913,0.00004536314,0.00024775157,0.00018063698,0.0004978997],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014619646,0.00002967169,0.0035078886,0.0000037196185,0.011185535,0.0000018615013,0.000068212306,0.00008055567,0.0000030338228,0.49710613,0.47955242,0.008446343],"study_design_scores_gemma":[0.00016407887,0.000028666476,0.0001747069,0.00001749537,0.0053846654,8.758607e-8,0.0000123690825,0.0030507287,0.000018826922,0.28524965,0.7050825,0.0008162211],"about_ca_topic_score_codex":0.00019472632,"about_ca_topic_score_gemma":0.00033099827,"teacher_disagreement_score":0.22553009,"about_ca_system_score_codex":0.000045939705,"about_ca_system_score_gemma":0.000037607715,"threshold_uncertainty_score":0.9997789},"labels":[],"label_agreement":null},{"id":"W4256220071","doi":"10.1007/978-1-4939-7131-2_100709","title":"Multirelational Social Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Sociology","score_opus":0.01718303508309061,"score_gpt":0.25501199956411646,"score_spread":0.23782896448102586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256220071","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006229677,0.000026319041,0.12713417,0.000037618436,0.000066573484,0.00010254589,0.000015595848,0.00011456105,0.87249637],"genre_scores_gemma":[0.072158895,0.0000021041096,0.001689806,0.000064213724,0.006905745,0.000010114117,0.00053965126,0.00005703731,0.9185724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990869,0.000007840463,0.00026740524,0.0002860545,0.0001770258,0.00017473391],"domain_scores_gemma":[0.99942327,0.000039848837,0.00018261436,0.00020194968,0.00010956864,0.000042765074],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006926097,0.00025666025,0.00030103608,0.000069295456,0.00016343361,0.000039950457,0.00017534324,0.0001644535,0.08501181],"category_scores_gemma":[3.0778335e-7,0.0002515968,0.00035584276,0.00002208872,0.00009981847,0.00003587292,0.00011823397,0.00029012142,0.00047699947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024667427,0.000007869914,0.00014942074,7.006724e-7,0.00020756984,3.329678e-7,0.000013393048,0.00003114224,1.964327e-7,0.7468415,0.23988536,0.012860063],"study_design_scores_gemma":[0.000093007686,0.000012264474,0.00008534881,0.000018436984,0.00012288643,1.7311254e-7,0.0000028908057,0.01179139,0.0000019465283,0.28479654,0.7027094,0.00036573285],"about_ca_topic_score_codex":0.00002046569,"about_ca_topic_score_gemma":0.000009304564,"teacher_disagreement_score":0.46282405,"about_ca_system_score_codex":0.00002910849,"about_ca_system_score_gemma":0.000027948072,"threshold_uncertainty_score":0.9999936},"labels":[],"label_agreement":null},{"id":"W4256380542","doi":"10.3233/ida-120564","title":"Guest Editorial","year":2013,"lang":"es","type":"editorial","venue":"Intelligent Data Analysis","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; Universidade Federal de Minas Gerais; KU Leuven; Università degli Studi di Pavia; Institut National des Sciences Appliquées de Lyon; Institute of Genetics; Indian National Science Academy","keywords":"Political science","score_opus":0.02963828349743141,"score_gpt":0.3297877078129713,"score_spread":0.30014942431553987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256380542","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049853137,0.00084194733,0.059170727,0.00011176894,0.92562455,0.0007013732,0.011725333,0.00025721252,0.0015172376],"genre_scores_gemma":[0.001893299,0.0016099507,0.00089033344,0.000015152851,0.8233712,0.00012349235,0.16980621,0.0001490584,0.0021413418],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9887987,0.0005982806,0.0026361248,0.0035699096,0.0030137035,0.0013833311],"domain_scores_gemma":[0.9838803,0.0016277063,0.0018784293,0.010471949,0.0015423757,0.0005992684],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0016861272,0.0016858205,0.0035274706,0.0018555104,0.0004895269,0.002162654,0.008536471,0.0013150274,0.0072343983],"category_scores_gemma":[0.0003756755,0.0016537844,0.0024844164,0.004562817,0.0003331475,0.0009093137,0.0048832865,0.0024854923,0.005693595],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035020374,0.00048483495,0.002095336,0.000042188738,0.033825144,0.0000056223844,0.000052097952,0.00021683046,0.000010874138,0.00032588025,0.95584446,0.0070617157],"study_design_scores_gemma":[0.0001708223,0.00007715441,0.000021697131,0.00010826445,0.03855627,7.7002106e-8,0.000101847516,0.010633128,0.00011280333,0.0006955065,0.9480524,0.001470024],"about_ca_topic_score_codex":0.017189462,"about_ca_topic_score_gemma":0.0006707828,"teacher_disagreement_score":0.15808089,"about_ca_system_score_codex":0.0003562795,"about_ca_system_score_gemma":0.00057333277,"threshold_uncertainty_score":0.99998146},"labels":[],"label_agreement":null},{"id":"W4256595825","doi":"10.1109/asonam.2014.6921553","title":"Community evolution prediction in dynamic social networks","year":2014,"lang":"en","type":"article","venue":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Predictability; Computer science; Transition (genetics); Event (particle physics); Key (lock); Community structure; Data mining; Social network (sociolinguistics); Artificial intelligence; Data science; Machine learning; Social media; Computer security; World Wide Web","score_opus":0.01614665540871207,"score_gpt":0.31566186473270347,"score_spread":0.2995152093239914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256595825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30817875,0.00034596876,0.6685986,0.00054735126,0.0007219544,0.0002971592,0.00006411801,0.0001228704,0.02112327],"genre_scores_gemma":[0.9969915,0.00029117055,0.0006791191,0.00007904105,0.0011252875,0.0000780458,0.00046071282,0.000025536066,0.00026957848],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972322,0.0006422784,0.00072496926,0.0005368839,0.00039145633,0.00047219748],"domain_scores_gemma":[0.99856627,0.00030421762,0.0005128352,0.00033031794,0.00020805377,0.000078333265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012598846,0.00035761952,0.00070851925,0.0004513665,0.000528781,0.00016512742,0.0006577634,0.00019278684,0.0004537928],"category_scores_gemma":[0.000031586937,0.0003830888,0.00029684335,0.0007910934,0.00021665642,0.00038704125,0.00019817837,0.00087603956,0.000008041331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019863351,0.0004950317,0.57786787,0.000012077689,0.0008071747,0.0000015890487,0.0009523736,0.17344083,0.00003349174,0.096778706,0.005390098,0.14402215],"study_design_scores_gemma":[0.0005420683,0.0000612731,0.123643644,0.00006638152,0.0001829886,2.552683e-7,0.00069044845,0.85866374,0.0000013823304,0.014371604,0.0014416687,0.00033452283],"about_ca_topic_score_codex":0.00067908084,"about_ca_topic_score_gemma":0.003717619,"teacher_disagreement_score":0.6888128,"about_ca_system_score_codex":0.00024178487,"about_ca_system_score_gemma":0.000032508535,"threshold_uncertainty_score":0.9998621},"labels":[],"label_agreement":null},{"id":"W4281392476","doi":"10.1109/iciset54810.2022.9775821","title":"A Study on Paper and Author Ranking","year":2022,"lang":"en","type":"article","venue":"2022 International Conference on Innovations in Science, Engineering and Technology (ICISET)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Ranking (information retrieval); PageRank; Computer science; Citation; Rank (graph theory); Information retrieval; Quality (philosophy); Data science; Journal ranking; Simple (philosophy); Index (typography); Learning to rank; World Wide Web; Mathematics; Epistemology","score_opus":0.02424499781765664,"score_gpt":0.30517739917966713,"score_spread":0.2809324013620105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281392476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905388,0.0000079267475,0.0014850926,0.0017712978,0.0001603114,0.00019844582,0.000015800673,0.00011675939,0.0057055955],"genre_scores_gemma":[0.9990505,0.0000015409062,0.00046310993,0.00004484466,0.000025373542,0.00025429775,0.000010912686,0.0000072877365,0.00014213947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988748,0.000013588051,0.00024270253,0.00036586676,0.00032683118,0.00017623098],"domain_scores_gemma":[0.9995366,0.000039971503,0.00006957054,0.0002095739,0.00012420552,0.000020130723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053522195,0.00011833164,0.00013701784,0.0019036959,0.00030499685,0.00007881732,0.0004083701,0.000021186515,0.00025487717],"category_scores_gemma":[0.000038914724,0.00012511281,0.000013770935,0.002536283,0.000141314,0.00011130943,0.0003593909,0.000456592,0.0000014053061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004353499,0.00013271537,0.032184895,4.9674793e-7,0.000020450572,0.0000030405483,0.0001658352,0.00087277754,0.0026755508,0.9573668,0.00007995843,0.0064930907],"study_design_scores_gemma":[0.0036059555,0.0018772798,0.13996276,0.00020858692,0.000067341694,0.000043396605,0.024302993,0.5280237,0.003167968,0.27262917,0.02421445,0.0018963597],"about_ca_topic_score_codex":0.000019657724,"about_ca_topic_score_gemma":0.000003057492,"teacher_disagreement_score":0.6847377,"about_ca_system_score_codex":0.000078538826,"about_ca_system_score_gemma":0.0000565849,"threshold_uncertainty_score":0.51019526},"labels":[],"label_agreement":null},{"id":"W4281918014","doi":"10.1109/noms54207.2022.9789847","title":"Dynamic Local Community Detection Algorithms","year":2022,"lang":"en","type":"article","venue":"NOMS 2022-2022 IEEE/IFIP Network Operations and Management Symposium","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Community structure; Local community; Algorithm; Social network (sociolinguistics); Evolving networks; Complex network; Data mining; Machine learning; Social media; Mathematics; World Wide Web","score_opus":0.007151134400385785,"score_gpt":0.2383714287419942,"score_spread":0.23122029434160843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281918014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056041427,0.00037617507,0.9218176,0.00075188756,0.0014657772,0.0017284985,0.00012174867,0.0004069741,0.017289884],"genre_scores_gemma":[0.9889315,0.00019772854,0.002650019,0.00031423217,0.00037153138,0.0013710161,0.0005992471,0.00005560348,0.00550916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756885,0.0005659211,0.00048147803,0.00050952804,0.00037025844,0.00050396874],"domain_scores_gemma":[0.9988981,0.000059971997,0.0001141529,0.0007556371,0.000053880267,0.00011824975],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00085809274,0.00033038433,0.0003402714,0.00021492624,0.0037615397,0.00022353629,0.00045433096,0.000039014358,0.00116174],"category_scores_gemma":[5.8290993e-7,0.00037675217,0.0001786063,0.0009705323,0.000111297784,0.00021625965,0.00084383314,0.0007874671,0.00001588725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059553462,0.0008796092,0.0015978139,0.000044419958,0.0011459853,0.000014471622,0.00071609305,0.82840383,0.0012955301,0.026324078,0.025169129,0.114349514],"study_design_scores_gemma":[0.00082632015,0.00030418052,0.00092326815,0.000022080732,0.00048729402,0.000008106471,0.0033307364,0.8909679,0.00013686423,0.0033940955,0.0988191,0.00078004587],"about_ca_topic_score_codex":0.00093869644,"about_ca_topic_score_gemma":0.0005835298,"teacher_disagreement_score":0.93289006,"about_ca_system_score_codex":0.00022098413,"about_ca_system_score_gemma":0.000024355439,"threshold_uncertainty_score":0.99986845},"labels":[],"label_agreement":null},{"id":"W4283030730","doi":"10.1142/s0129183123500146","title":"The evolution of international grain trade pattern based on complex network and entropy","year":2022,"lang":"en","type":"article","venue":"International Journal of Modern Physics C","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Complex network; International trade; Position (finance); Economics; Economic geography; Business; Computer science","score_opus":0.012722518799695666,"score_gpt":0.2608580944382263,"score_spread":0.24813557563853061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283030730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05982757,0.0001482427,0.9330683,0.0039751804,0.0009819902,0.00014365303,0.00013807054,0.000016667967,0.0017003247],"genre_scores_gemma":[0.99798197,0.000006687833,0.00057445955,0.00014091638,0.0012054874,0.000009002239,0.00004129482,0.000014034209,0.000026168313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983297,0.0001332125,0.00045183333,0.00012584729,0.00082319067,0.00013622252],"domain_scores_gemma":[0.9987365,0.00020289069,0.00069248624,0.00014176895,0.00018652211,0.000039860282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003939242,0.00011937157,0.00018398838,0.000080334314,0.00016862358,0.000058843056,0.0006660968,0.000011109579,0.00012962452],"category_scores_gemma":[0.000006000881,0.000099965015,0.0002294523,0.00010226962,0.000070759255,0.00009058988,0.000160673,0.00028909778,4.6502566e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051863515,0.00085598254,0.1219201,0.0000036703218,0.0014295345,0.000010988316,0.00038241962,0.30122888,0.0027882028,0.1793247,0.014481478,0.3770554],"study_design_scores_gemma":[0.0010535785,0.0001804302,0.013317864,0.000038937203,0.000059132384,0.000007902329,0.000151476,0.72141254,0.00022657747,0.25343752,0.009958077,0.00015598038],"about_ca_topic_score_codex":0.0000425495,"about_ca_topic_score_gemma":0.0000028989837,"teacher_disagreement_score":0.9381544,"about_ca_system_score_codex":0.00018142594,"about_ca_system_score_gemma":0.00006989315,"threshold_uncertainty_score":0.4076455},"labels":[],"label_agreement":null},{"id":"W4283364764","doi":"10.1162/qss_a_00184","title":"Center–periphery structure in research communities","year":2022,"lang":"en","type":"article","venue":"Quantitative Science Studies","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Thomas and Stacey Siebel Foundation; University of Victoria; Grainger Foundation; Washington University in St. Louis; Google","keywords":"Field (mathematics); Pipeline (software); Data science; Citation; Subject (documents); Cluster analysis; Community structure; Center (category theory); Computer science; Geography; Library science; Ecology; Artificial intelligence; Biology; Mathematics","score_opus":0.31198559172603607,"score_gpt":0.5164166050925184,"score_spread":0.20443101336648234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283364764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99097884,0.000716283,0.00016013028,0.00031341927,0.000109943605,0.00017545866,0.000049125396,0.00002782425,0.0074689905],"genre_scores_gemma":[0.99823207,0.000017255194,0.0014579449,0.000028424607,0.000027209395,0.00008723155,0.000007823809,0.0000062286144,0.00013583446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9980759,0.00046090694,0.00018904834,0.00023044152,0.00063665,0.00040703855],"domain_scores_gemma":[0.9989725,0.00035358997,0.000059488728,0.00027428914,0.00031204446,0.000028083456],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018422772,0.00010146185,0.00021767779,0.00047118522,0.0019210665,0.00005854806,0.00066674856,0.000004745403,0.00042065582],"category_scores_gemma":[0.000035707646,0.00009184687,0.000043426306,0.0024945934,0.0018568598,0.00021898835,0.0012976454,0.00046667756,0.0000036265178],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026205526,0.00020514906,0.31366655,0.000010016246,0.00010373885,0.0000035877333,0.06252708,0.0012250157,0.0023346043,0.6096808,0.0033647043,0.006852576],"study_design_scores_gemma":[0.00028737728,0.00032077273,0.024508575,0.00004249376,0.0000074432737,8.128982e-7,0.7871696,0.003292029,0.00078585034,0.17543325,0.007855436,0.00029638546],"about_ca_topic_score_codex":0.00072209927,"about_ca_topic_score_gemma":0.0004085833,"teacher_disagreement_score":0.7246425,"about_ca_system_score_codex":0.00017711308,"about_ca_system_score_gemma":0.0000975688,"threshold_uncertainty_score":0.9993783},"labels":[],"label_agreement":null},{"id":"W4283514089","doi":"10.1007/s12652-022-04104-4","title":"E-ware: a big data system for the incremental discovery of spatio-temporal events from microblogs","year":2022,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Big data; Event (particle physics); Geospatial analysis; Cluster analysis; Scalability; Social media; Microblogging; Data stream mining; Knowledge extraction; Data mining; Automatic summarization; Data science; Artificial intelligence; Machine learning; World Wide Web; Geography; Database","score_opus":0.0693148976956604,"score_gpt":0.296337177339616,"score_spread":0.2270222796439556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283514089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5989997,0.00040226133,0.3999261,0.000041433104,0.0003078168,0.00018960748,0.000110607514,0.000006873342,0.000015643423],"genre_scores_gemma":[0.99644625,0.00000782282,0.002824044,0.000022169657,0.00055212964,0.0000035267128,0.000120046876,0.000011075617,0.000012935084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855864,0.00009683279,0.00074144144,0.00018222496,0.00027369955,0.00014715863],"domain_scores_gemma":[0.99823576,0.00031324266,0.0010053109,0.00030641377,0.00011104139,0.000028206203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090674823,0.00011909003,0.0003288267,0.00009035262,0.00042185874,0.00007307246,0.0007738223,0.000010786082,0.00004436455],"category_scores_gemma":[0.000006892644,0.0000915748,0.00016106301,0.00013800144,0.000041160336,0.00013573673,0.00083078665,0.00020623294,2.5422995e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021505705,0.002542716,0.3483729,0.00034923124,0.007315006,0.000026815402,0.013005098,0.02104808,0.017770668,0.04094748,0.013490454,0.532981],"study_design_scores_gemma":[0.005505234,0.0035605067,0.009299563,0.0026030014,0.003924355,0.0001302605,0.096459046,0.71963745,0.0747729,0.047154065,0.034816023,0.0021376165],"about_ca_topic_score_codex":0.0007754676,"about_ca_topic_score_gemma":0.000025796915,"teacher_disagreement_score":0.6985893,"about_ca_system_score_codex":0.000055851102,"about_ca_system_score_gemma":0.000054020195,"threshold_uncertainty_score":0.3734312},"labels":[],"label_agreement":null},{"id":"W4285033312","doi":"10.22215/etd/2022-15056","title":"Understanding and Predicting User Engagement Behaviour on Twitter with a Cognitive and Machine Learning Model","year":2022,"lang":"en","type":"dissertation","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"User engagement; Cognition; Affect (linguistics); Perception; Subjectivity; Psychology; Computer science; Cognitive psychology; Sentiment analysis; Human–computer interaction; Artificial intelligence; World Wide Web; Communication; Epistemology","score_opus":0.07329888662960532,"score_gpt":0.3011026973426069,"score_spread":0.2278038107130016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285033312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9106873,0.00005240471,0.061023954,0.000022494154,0.0000183125,0.00048257495,0.000029337933,0.00011775105,0.027565846],"genre_scores_gemma":[0.99090075,0.00001046941,0.00061177334,0.000027591392,0.000040875668,0.00010949527,0.0012812566,0.000047105346,0.006970672],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989807,0.000075342796,0.0001676726,0.0003896692,0.00021595918,0.00017062685],"domain_scores_gemma":[0.99957275,0.000100754696,0.00016584498,0.00008280309,0.000030122315,0.000047695452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001817691,0.00024884666,0.00025428197,0.00015095802,0.00043742568,0.00010234481,0.00005037417,0.000035155597,0.0006071733],"category_scores_gemma":[0.000002268923,0.00021738715,0.000045917426,0.00009385142,0.00001743959,0.0000590347,0.00006850049,0.000700947,3.3848016e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003794095,0.00022095695,0.9632212,0.00008554004,0.0012242241,0.000010057901,0.010099221,0.004086104,0.000060696486,0.015860217,0.00051232165,0.0042400584],"study_design_scores_gemma":[0.004577204,0.0016959367,0.03206136,0.00182879,0.005083861,0.0000047156127,0.21901804,0.7176321,0.0010658442,0.013414022,0.0004505432,0.0031675906],"about_ca_topic_score_codex":0.00026596859,"about_ca_topic_score_gemma":0.00018219191,"teacher_disagreement_score":0.93115985,"about_ca_system_score_codex":0.000054275526,"about_ca_system_score_gemma":0.000026472408,"threshold_uncertainty_score":0.8864791},"labels":[],"label_agreement":null},{"id":"W4285079561","doi":"10.1109/csci54926.2021.00279","title":"Effects of Different Recommendation Algorithms on Structure of Social Networks","year":2021,"lang":"en","type":"article","venue":"2021 International Conference on Computational Science and Computational Intelligence (CSCI)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Cosine similarity; Computer science; Cluster analysis; Similarity (geometry); Social network (sociolinguistics); Graph; Recommender system; Data mining; Information retrieval; Clustering coefficient; Data science; Social media; Theoretical computer science; World Wide Web; Machine learning; Artificial intelligence","score_opus":0.0218055392401534,"score_gpt":0.31982320419521865,"score_spread":0.29801766495506526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285079561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1911778,0.000020829864,0.79779655,0.0016893684,0.00057072495,0.00031128174,0.00015388544,0.000028785129,0.008250794],"genre_scores_gemma":[0.9945546,0.000009951986,0.0045884484,0.00016898263,0.00020897317,0.000011494986,0.00038650198,0.000009558672,0.00006149651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974681,0.00009881871,0.000559673,0.0005484261,0.0010860151,0.00023895565],"domain_scores_gemma":[0.99678487,0.00057319045,0.00039808915,0.00010788974,0.0020466857,0.00008929822],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023666408,0.0002297184,0.00032425034,0.00030748462,0.00026915543,0.00013199523,0.0004219976,0.00004975679,0.0017296085],"category_scores_gemma":[0.000057950194,0.00021992325,0.000120420504,0.00073139346,0.00044891328,0.00022123852,0.0002047126,0.00023060782,0.0000052593173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037374877,0.00031939952,0.00070190075,0.000012239468,0.000105368716,0.0000016014563,0.00017665119,0.14291383,0.0011054944,0.7704067,0.00017837489,0.08404106],"study_design_scores_gemma":[0.0001865551,0.00012228082,0.011857365,0.00008750641,0.000023243872,0.0000022912634,0.0002298852,0.7401261,0.011643436,0.23544872,0.000071784416,0.00020087809],"about_ca_topic_score_codex":0.000026059646,"about_ca_topic_score_gemma":0.0000044745802,"teacher_disagreement_score":0.8033768,"about_ca_system_score_codex":0.00009003087,"about_ca_system_score_gemma":0.00033398342,"threshold_uncertainty_score":0.99918294},"labels":[],"label_agreement":null},{"id":"W4285190060","doi":"10.1007/978-3-030-97162-5_6","title":"Network Models","year":2022,"lang":"en","type":"book-chapter","venue":"Springer texts in business and economics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of New Brunswick","funders":"","keywords":"Subject (documents); Euler's formula; Graph theory; Mathematics; Bridge (graph theory); Graph; Calculus (dental); Mathematical economics; Computer science; Discrete mathematics; Combinatorics; Library science; Mathematical analysis","score_opus":0.01992415038128226,"score_gpt":0.21014967686297517,"score_spread":0.1902255264816929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285190060","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036559333,0.0010822152,0.0013481199,0.000163809,0.0003123267,0.00029363474,0.000048428697,0.000066484434,0.99302906],"genre_scores_gemma":[0.7241949,0.0066797347,0.005960164,0.00052018795,0.005822826,0.0002781693,0.00068567065,0.00059130293,0.25526705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869376,0.000007835444,0.00044068779,0.00050648325,0.00005369264,0.00029751964],"domain_scores_gemma":[0.9991913,0.000036855105,0.00025346744,0.00043464103,0.000030638334,0.00005312317],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017473532,0.00034590735,0.00059248164,0.00016288496,0.00013113715,0.000086712695,0.0002484447,0.000098408294,0.002841344],"category_scores_gemma":[4.5099927e-7,0.00041276342,0.00011506473,0.000055674864,0.00005912387,0.00016599508,0.00052386656,0.00036577552,0.0000119186725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008275485,0.000013438323,0.0012825915,0.000012718921,0.000071847186,0.000002112145,0.000018828685,0.05428121,8.98298e-8,0.9139353,0.0007719258,0.029601635],"study_design_scores_gemma":[0.00013247838,0.0000053663707,0.00049178855,0.000053695556,0.00004519644,7.492861e-7,0.000003446133,0.006424308,2.549165e-7,0.6316812,0.36073285,0.00042867],"about_ca_topic_score_codex":0.00024793277,"about_ca_topic_score_gemma":0.00012593015,"teacher_disagreement_score":0.737762,"about_ca_system_score_codex":0.000091740614,"about_ca_system_score_gemma":0.00005453548,"threshold_uncertainty_score":0.9998324},"labels":[],"label_agreement":null},{"id":"W4285275121","doi":"10.1007/978-3-031-08757-8_34","title":"Intersection Representation of Big Data Networks and Triangle Enumeration","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Enumeration; Adjacency matrix; Sparse matrix; Matrix exponential; Computer science; Matrix (chemical analysis); Matrix representation; Graph; Algorithm; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.04218794373737904,"score_gpt":0.28765478835607416,"score_spread":0.2454668446186951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285275121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030597445,0.00013347258,0.9967437,0.00005501658,0.000450612,0.00019839017,0.000013393625,0.000022819186,0.002076628],"genre_scores_gemma":[0.9865724,0.000020954423,0.012112514,0.00003943485,0.0008961913,0.0000067666797,0.0002596667,0.000014750488,0.00007732103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986213,0.000036935282,0.00032404254,0.0006185743,0.00026362404,0.00013552478],"domain_scores_gemma":[0.99868786,0.00019081775,0.00029164276,0.0007379958,0.00006276493,0.000028936436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042643226,0.00015886265,0.00030084403,0.00032300848,0.000119041506,0.000082847575,0.0005447257,0.000049143608,0.0001332892],"category_scores_gemma":[0.000010957354,0.000162137,0.00005472656,0.00033674052,0.00017632723,0.0002079221,0.0008828346,0.00031581408,3.9629697e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008398438,0.000013426811,0.0007569158,0.000004586692,0.000022588243,8.7691456e-7,0.00011487812,0.03977686,0.000048804453,0.003934112,0.00005394581,0.9552646],"study_design_scores_gemma":[0.0001785505,0.000087536195,0.00017097314,0.000083754705,0.000044385106,0.0000025748636,0.0000010699209,0.9306521,0.00038352053,0.06644427,0.0017102901,0.00024098573],"about_ca_topic_score_codex":0.00026815175,"about_ca_topic_score_gemma":0.000103870385,"teacher_disagreement_score":0.98626643,"about_ca_system_score_codex":0.000056674817,"about_ca_system_score_gemma":0.00006667423,"threshold_uncertainty_score":0.6611755},"labels":[],"label_agreement":null},{"id":"W4285290135","doi":"10.1007/978-3-031-08757-8_43","title":"A Sparse Matrix Approach for Covering Large Complex Networks by Cliques","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Heuristics; Clique; Pairwise comparison; Computer science; Benchmark (surveying); Theoretical computer science; Graph; Algorithm; Scalability; Computation; Heuristic; Mathematics; Mathematical optimization; Artificial intelligence; Combinatorics","score_opus":0.01887177657334158,"score_gpt":0.27372450926857533,"score_spread":0.25485273269523373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285290135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030148876,0.0003778844,0.9919919,0.000063468724,0.00020484702,0.000764581,0.00014402303,0.00014541781,0.006277748],"genre_scores_gemma":[0.53421813,0.000033636203,0.4608623,0.00065901503,0.001879329,0.00020576245,0.0011666934,0.00013884125,0.0008362884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697804,0.00003850915,0.00052600045,0.0011938451,0.0004995112,0.0007640859],"domain_scores_gemma":[0.9983088,0.0003081157,0.00035501446,0.00079929666,0.00011244277,0.00011638141],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077347696,0.00053260213,0.00073668826,0.00033089772,0.0004718003,0.00027818428,0.0013837251,0.00013235913,0.0005293004],"category_scores_gemma":[0.0000057914986,0.0005464158,0.00033709695,0.00037350212,0.00026477597,0.0001745274,0.0011091839,0.00079850445,0.0000020367454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005264264,0.00026746106,0.0014630083,0.00007810709,0.00019893177,0.0000074196973,0.0003090386,0.576355,0.00010318274,0.12969486,0.0068402886,0.28463003],"study_design_scores_gemma":[0.00024507826,0.00009348235,0.000010371446,0.00004690365,0.000039155464,0.0000022992704,4.8463636e-7,0.8906439,0.00006293927,0.04415065,0.06411054,0.0005941826],"about_ca_topic_score_codex":0.00007919971,"about_ca_topic_score_gemma":0.000013722503,"teacher_disagreement_score":0.534188,"about_ca_system_score_codex":0.00021860654,"about_ca_system_score_gemma":0.00012867327,"threshold_uncertainty_score":0.99969876},"labels":[],"label_agreement":null},{"id":"W4285357590","doi":"10.4018/ijcini.20211001.oa9","title":"Cyber Threat Hunting","year":2022,"lang":"en","type":"article","venue":"International Journal of Cognitive Informatics and Natural Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Canadian Nuclear Laboratories","funders":"Lawrence Berkeley National Laboratory; Government of Canada; Canadian Nuclear Laboratories; Defense Advanced Research Projects Agency; Mitacs; University of Manitoba","keywords":"Computer science; Computer security; Situation awareness; Visualization; Intelligence analysis; Event (particle physics); Artificial intelligence; Cyber-attack; Human–computer interaction; Machine learning","score_opus":0.012916360003880507,"score_gpt":0.3009066349432626,"score_spread":0.28799027493938206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285357590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.824409,0.0005461721,0.16254456,0.00023728312,0.000842725,0.00012797986,0.000047212096,0.000016947672,0.011228125],"genre_scores_gemma":[0.99756986,0.000035689693,0.0018184312,0.00021481112,0.00023416185,0.000004058264,0.000017965664,0.0000050986087,0.00009995048],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880356,0.000029006878,0.00055535545,0.000048798538,0.00044213628,0.00012113592],"domain_scores_gemma":[0.99846834,0.00024521258,0.0005440527,0.000041574953,0.0006599622,0.00004088016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035803276,0.000095535,0.00015230387,0.0002042542,0.0001355479,0.00009201093,0.00032540734,0.00000965403,0.00068647676],"category_scores_gemma":[0.000031069987,0.00008231633,0.00012487426,0.00013447399,0.000051627605,0.0003573703,0.00029648177,0.00040264465,0.0000038905605],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017622054,0.000146923,0.036815196,0.000005483049,0.0009145281,0.000021246908,0.0034137443,0.0009692816,0.00010076555,0.039405953,0.00064415194,0.91738653],"study_design_scores_gemma":[0.00361099,0.0019026054,0.028297339,0.001590644,0.0010178874,0.0019626548,0.12268767,0.33289486,0.051966533,0.39222378,0.05886842,0.0029766215],"about_ca_topic_score_codex":0.00002665916,"about_ca_topic_score_gemma":0.0000011477778,"teacher_disagreement_score":0.9144099,"about_ca_system_score_codex":0.000034101307,"about_ca_system_score_gemma":0.000033407476,"threshold_uncertainty_score":0.7516439},"labels":[],"label_agreement":null},{"id":"W4285605397","doi":"10.24963/ijcai.2022/296","title":"HashNWalk: Hash and Random Walk Based Anomaly Detection in Hyperedge Streams","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology; National Research Foundation of Korea; National Research Foundation","keywords":"Anomaly detection; Computer science; Hash function; Random walk; Constant (computer programming); Data stream; Anomaly (physics); Graph; Theoretical computer science; Data mining; Mathematics; Statistics","score_opus":0.03953152171979173,"score_gpt":0.26529762752541886,"score_spread":0.22576610580562712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285605397","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97862864,0.00001414069,0.0070413817,0.0035001466,0.00042172323,0.0005469521,0.000043472326,0.00006263133,0.009740941],"genre_scores_gemma":[0.999175,0.000004943229,0.00033803075,0.00010257898,0.0001122339,0.0001457581,0.000007186738,0.00001622005,0.00009801125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982013,0.000032979573,0.00060480443,0.00040957128,0.00050362677,0.00024773355],"domain_scores_gemma":[0.99898314,0.00010197307,0.00041448828,0.0001502334,0.00029816813,0.000051999665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060011767,0.00021246575,0.00029432576,0.00029129756,0.0003247825,0.00013192096,0.0006645803,0.000033831537,0.0007453682],"category_scores_gemma":[0.000061908904,0.00018606766,0.00016676125,0.00042589215,0.00016035666,0.00015620323,0.00041230433,0.000436586,0.0000061643455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018190383,0.0016096457,0.05973791,0.00006270224,0.00022365461,0.0000021659189,0.0017661513,0.0050996724,0.06422441,0.55745864,0.00036201382,0.307634],"study_design_scores_gemma":[0.0003665304,0.00034559786,0.0049437415,0.00020857836,0.0000560497,0.0000044940557,0.0021784094,0.42037195,0.3875403,0.18256293,0.0009600883,0.00046131655],"about_ca_topic_score_codex":0.0006699635,"about_ca_topic_score_gemma":0.00017265353,"teacher_disagreement_score":0.4152723,"about_ca_system_score_codex":0.00012587303,"about_ca_system_score_gemma":0.00004527215,"threshold_uncertainty_score":0.8161259},"labels":[],"label_agreement":null},{"id":"W4285724845","doi":"10.1561/1500000078","title":"Extracting, Mining and Predicting Users’ Interests from Social Media","year":2020,"lang":"en","type":"article","venue":"Foundations and Trends® in Information Retrieval","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Social media; Computer science; Data science; Internet privacy; Data mining; World Wide Web","score_opus":0.032603337030492494,"score_gpt":0.28779582309129603,"score_spread":0.2551924860608035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285724845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9875245,0.000013716109,0.007165938,0.00053439,0.00005357552,0.0000521196,0.0000644801,0.0000627452,0.0045285453],"genre_scores_gemma":[0.9974157,0.0000027928386,0.0016142537,0.00005442441,0.00024431603,0.0000043156506,0.0006515764,0.0000048551024,0.000007735243],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999291,0.000024388868,0.00034495082,0.00011074006,0.00011499,0.000113935595],"domain_scores_gemma":[0.9995066,0.00015889331,0.00018024804,0.00005485569,0.00004111073,0.00005831624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010256693,0.00009623645,0.00013943457,0.00015978361,0.00017943751,0.00021582979,0.000058730875,0.000034972134,0.0004882913],"category_scores_gemma":[0.000045977606,0.000102240236,0.000034696743,0.00039661775,0.00003910955,0.0008865989,0.000070813185,0.00013058154,0.000004378576],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006112266,0.000030717452,0.35316437,0.000010682474,0.00010422147,6.316396e-7,0.04055019,0.000031021034,0.00004153892,0.0072174943,0.0019922273,0.5967958],"study_design_scores_gemma":[0.002608856,0.00007927931,0.77081203,0.00009353551,0.00017891507,0.0000017826958,0.02018661,0.1669497,0.00022595361,0.0040893094,0.034083072,0.0006909674],"about_ca_topic_score_codex":0.000101848156,"about_ca_topic_score_gemma":0.00006737773,"teacher_disagreement_score":0.5961048,"about_ca_system_score_codex":0.000014862674,"about_ca_system_score_gemma":0.000012606707,"threshold_uncertainty_score":0.5346447},"labels":[],"label_agreement":null},{"id":"W4286518217","doi":"10.18280/ria.360311","title":"Ensemble Assisted Multi-Feature Learnt Social Media Link Prediction Model Using Machine Learning Techniques","year":2022,"lang":"en","type":"article","venue":"Revue d intelligence artificielle","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Visvesvaraya Technological University","keywords":"Computer science; Artificial intelligence; Feature selection; Jaccard index; Support vector machine; Ensemble learning; Machine learning; Cosine similarity; Classifier (UML); Robustness (evolution); Pattern recognition (psychology); Data mining; Feature extraction","score_opus":0.06147590036955676,"score_gpt":0.3010919865552362,"score_spread":0.23961608618567948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286518217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038741432,0.00018263613,0.9579727,0.0003388981,0.00013384163,0.00037004997,0.00007579233,0.0005101643,0.0016744606],"genre_scores_gemma":[0.9696542,0.0000095604255,0.027571628,0.000029866487,0.00049161166,0.00011489697,0.0002542707,0.0000517818,0.0018221573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817365,0.00020663705,0.00045564718,0.00048471906,0.00029012168,0.00038923984],"domain_scores_gemma":[0.9991302,0.00010153319,0.00026931945,0.00030960247,0.0001169998,0.00007238431],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052933104,0.00024581933,0.0003350904,0.00019780116,0.0011658686,0.000075028714,0.00034772887,0.00007326796,0.0007423429],"category_scores_gemma":[0.000022906666,0.00027794385,0.00027344693,0.00067293696,0.000067219735,0.000120879195,0.00034141674,0.00097258436,0.000014772123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004984708,0.00046743118,0.004315367,0.000024840203,0.0001266305,0.0000075651146,0.0038004727,0.71255845,0.08413137,0.004224019,0.0010665867,0.18922743],"study_design_scores_gemma":[0.000036952446,0.00004232111,0.00002735642,0.000019081252,0.00006470901,0.00000543917,0.00093267474,0.95090985,0.037821136,0.002322744,0.0075695836,0.00024815195],"about_ca_topic_score_codex":0.00015071324,"about_ca_topic_score_gemma":0.000022298302,"teacher_disagreement_score":0.9309128,"about_ca_system_score_codex":0.0001616582,"about_ca_system_score_gemma":0.000058570793,"threshold_uncertainty_score":0.9999673},"labels":[],"label_agreement":null},{"id":"W4287531039","doi":"10.48550/arxiv.2105.06553","title":"Tuning the Clustering Coefficient of Generalized Circulant Networks","year":2021,"lang":"en","type":"preprint","venue":"Archive ouverte UNIGE (University of Geneva)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Circulant matrix; Clustering coefficient; Cluster analysis; Mathematics; Computer science; Statistics; Algorithm","score_opus":0.014563236643895175,"score_gpt":0.21423091193026747,"score_spread":0.1996676752863723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287531039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21705654,0.00018797077,0.7795814,0.00006174883,0.000121068115,0.00025538023,0.00006959459,0.00003144787,0.0026348257],"genre_scores_gemma":[0.9865127,0.00015425192,0.012557466,0.000022464297,0.00010648601,0.0000011110881,0.00044026223,0.00002382889,0.00018138078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830794,0.00034078004,0.000287622,0.0004683842,0.00029163552,0.00030366174],"domain_scores_gemma":[0.99808794,0.000119464545,0.0005675364,0.00095773506,0.00018308162,0.00008426199],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002701227,0.00027671288,0.0006894961,0.00017356552,0.00024036969,0.000030178548,0.0010525648,0.000083499544,0.00033308333],"category_scores_gemma":[0.0000031895604,0.00029319557,0.00066813733,0.00027094752,0.00027545652,0.000042522017,0.0026873345,0.0005021228,0.0000010309523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010020765,0.00030184086,0.010947392,0.00015364744,0.0025963555,0.000034443885,0.009957201,0.93633455,0.005067587,0.00803002,0.0031525027,0.023324259],"study_design_scores_gemma":[0.00036892202,0.000027338454,0.003686063,0.00028600876,0.0004265381,9.051604e-7,0.0039119283,0.98834604,0.00019063882,0.0012308517,0.0011947413,0.000330046],"about_ca_topic_score_codex":0.0041984534,"about_ca_topic_score_gemma":0.00082013634,"teacher_disagreement_score":0.7694562,"about_ca_system_score_codex":0.000050740913,"about_ca_system_score_gemma":0.00016643098,"threshold_uncertainty_score":0.999952},"labels":[],"label_agreement":null},{"id":"W4287868424","doi":"10.48550/arxiv.2002.04834","title":"On the Performance Analysis of Epidemic Routing in Non-Sparse Delay\\n Tolerant Networks","year":2020,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Pairwise comparison; Supercritical fluid; Percolation (cognitive psychology); Node (physics); Poisson distribution; Routing (electronic design automation); Function (biology); Computer science; Probability density function; Statistical physics; Topology (electrical circuits); Mathematical optimization; Mathematics; Physics; Statistics; Computer network; Combinatorics; Artificial intelligence","score_opus":0.05796273054546278,"score_gpt":0.2010968552582777,"score_spread":0.14313412471281492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287868424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7267061,0.000026462645,0.27135256,0.00008356865,0.00007844965,0.0005308974,0.000026360942,0.000037681544,0.0011579044],"genre_scores_gemma":[0.99891245,0.00037679833,0.000094627314,0.00012185391,0.00017475645,0.000005789179,0.0001327773,0.000046637502,0.0001343118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99545777,0.00063222204,0.0012005126,0.001708289,0.00018107529,0.00082015083],"domain_scores_gemma":[0.9949666,0.0011116089,0.0015962927,0.001894207,0.0002173872,0.00021386388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011912283,0.0008175673,0.0020216652,0.00086013594,0.00031740312,0.00007034453,0.0019510004,0.00032461507,0.00047247656],"category_scores_gemma":[0.00002595002,0.00080044736,0.0017571142,0.0064547667,0.00029001271,0.00017196879,0.0015425883,0.0021626789,0.00003336903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015344075,0.00017548882,0.17274384,0.00002385582,0.0027890746,0.000026356867,0.000285531,0.77678424,0.000014010875,0.04608064,0.00008283071,0.0008407191],"study_design_scores_gemma":[0.0003735597,0.0000982011,0.024288824,0.00043368322,0.0041628666,1.5985889e-7,0.00032478385,0.9668947,0.000059810623,0.0026835152,0.000032241198,0.0006476611],"about_ca_topic_score_codex":0.0013827544,"about_ca_topic_score_gemma":0.00025328077,"teacher_disagreement_score":0.27220634,"about_ca_system_score_codex":0.00034610028,"about_ca_system_score_gemma":0.00015398863,"threshold_uncertainty_score":0.99944466},"labels":[],"label_agreement":null},{"id":"W4288080130","doi":"10.14778/3407790.3407823","title":"Hypergraph motifs","year":2020,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"National Supercomputing Center, Korea Institute of Science and Technology Information; Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology; Iran Telecommunication Research Center; National Research Foundation of Korea","keywords":"Hypergraph; Computer science; Theoretical computer science; Motif (music); Combinatorics; Mathematics","score_opus":0.010777552812729326,"score_gpt":0.20393807135097922,"score_spread":0.1931605185382499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288080130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8878644,0.00010554649,0.0008976586,0.0063366555,0.00007421095,0.0005780227,0.000013230708,0.00015995927,0.103970304],"genre_scores_gemma":[0.9983946,0.0000028871318,0.0010799345,0.00017335484,0.00019085241,0.000027061424,0.0000010473848,0.000011000612,0.000119245145],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992916,0.0000029614966,0.00019458044,0.00017100041,0.0001904111,0.00014945336],"domain_scores_gemma":[0.9996204,0.000009924761,0.00015131671,0.00008065535,0.00007899123,0.00005870767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006799145,0.000108442124,0.00016959078,0.000024318271,0.00006278013,0.00002517776,0.00040414164,0.000012605679,0.00018670342],"category_scores_gemma":[0.000006009543,0.000075434575,0.00020052791,0.00032046207,0.000040931747,0.000061326464,0.000228174,0.000098680444,0.000008315842],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000419236,0.0003035304,0.38780767,0.00008652248,0.0005510876,1.5846135e-7,0.0015872724,0.00009722258,0.18430103,0.33059654,0.0722881,0.022338936],"study_design_scores_gemma":[0.00079326465,0.00016969931,0.008224536,0.000101056,0.0003100349,8.531273e-7,0.0009829891,0.0039666956,0.85703236,0.075957656,0.051977605,0.0004832352],"about_ca_topic_score_codex":0.00004778497,"about_ca_topic_score_gemma":2.2147206e-7,"teacher_disagreement_score":0.67273134,"about_ca_system_score_codex":0.000010640118,"about_ca_system_score_gemma":0.000007875927,"threshold_uncertainty_score":0.30761325},"labels":[],"label_agreement":null},{"id":"W4289655131","doi":"10.1109/isit50566.2022.9834759","title":"Modeling Network Contagion Via Interacting Finite Memory Pólya Urns","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Markov chain; Mathematics; Aperiodic graph; Homogeneous; Markov process; Combinatorics; Statistics","score_opus":0.009533213423982735,"score_gpt":0.25254985012945236,"score_spread":0.24301663670546964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107589446,0.000019983896,0.7628575,0.00068390433,0.0037443251,0.00056982733,0.00016302228,0.000354943,0.12401706],"genre_scores_gemma":[0.9956257,0.0000045712113,0.00028160715,0.0011209804,0.0009991698,0.00024559622,0.0008934259,0.000026708674,0.0008022947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976169,0.00025945797,0.00083706965,0.0002538391,0.00071007095,0.00032265388],"domain_scores_gemma":[0.99849284,0.00038781337,0.0004926952,0.00035473847,0.00019205608,0.000079869635],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001142097,0.00026333914,0.00025497732,0.00027009158,0.0006405525,0.00020998837,0.0006827891,0.00003689227,0.005766346],"category_scores_gemma":[0.00001715324,0.00028984304,0.00028597363,0.00032818396,0.000026159363,0.0011171979,0.00033470764,0.0006224677,0.00018391098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023377368,0.00007555523,0.0005040776,0.0000037825298,0.00023666871,0.0000014091822,0.001115921,0.9245724,0.00023641576,0.06039405,0.0036215384,0.00900441],"study_design_scores_gemma":[0.00048827607,0.00008534625,0.000017459171,0.00003527933,0.000045062123,0.000006520338,0.0015138694,0.95967823,0.00056215876,0.021898447,0.015324286,0.00034506776],"about_ca_topic_score_codex":0.00015658396,"about_ca_topic_score_gemma":0.000004067809,"teacher_disagreement_score":0.8880362,"about_ca_system_score_codex":0.00036081354,"about_ca_system_score_gemma":0.000039043047,"threshold_uncertainty_score":0.99995536},"labels":[],"label_agreement":null},{"id":"W4289655252","doi":"10.1109/isit50566.2022.9834449","title":"The Optimal Sample Complexity of Matrix Completion with Hierarchical Similarity Graphs","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"National Science Foundation","keywords":"Matrix completion; Computer science; Stochastic block model; Recommender system; Matrix (chemical analysis); Rank (graph theory); Low-rank approximation; Computational complexity theory; Similarity (geometry); Context (archaeology); Sample complexity; Theoretical computer science; Algorithm; Mathematics; Combinatorics; Artificial intelligence; Machine learning; Cluster analysis","score_opus":0.012004994005159106,"score_gpt":0.2644584007602411,"score_spread":0.252453406755082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49964353,0.000020515517,0.4446167,0.004136541,0.0011124057,0.001252724,0.0028955403,0.00029069552,0.046031356],"genre_scores_gemma":[0.9971742,0.000004313121,0.0011251562,0.00021778463,0.00011414,0.00016529296,0.0010530119,0.000012711962,0.00013339914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977595,0.00030749603,0.00061970134,0.00017635441,0.00091664796,0.00022027508],"domain_scores_gemma":[0.9982465,0.0005814899,0.0005187905,0.00037070678,0.0002240851,0.00005841478],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010220362,0.00018993435,0.00022456406,0.0001784069,0.0008165217,0.0001260052,0.00075199414,0.000023603805,0.0021965937],"category_scores_gemma":[0.000013467552,0.00015178,0.00020687812,0.00035171435,0.00027120538,0.00038364367,0.0002344374,0.00044632767,0.000016791617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069313776,0.00014534176,0.002973001,0.000004750899,0.00024767808,3.3470639e-7,0.00044059593,0.036203504,0.00017914547,0.9543259,0.0027189918,0.0020675834],"study_design_scores_gemma":[0.002397861,0.0010331277,0.0073448704,0.000043786808,0.00016562664,0.000020180027,0.0029546628,0.21114348,0.004268742,0.62912416,0.14060326,0.00090024347],"about_ca_topic_score_codex":0.00018907724,"about_ca_topic_score_gemma":0.000008960052,"teacher_disagreement_score":0.49753067,"about_ca_system_score_codex":0.00015231973,"about_ca_system_score_gemma":0.000047923873,"threshold_uncertainty_score":0.9987155},"labels":[],"label_agreement":null},{"id":"W4289655275","doi":"10.1109/isit50566.2022.9834685","title":"Graph-assisted Matrix Completion in a Multi-clustered Graph Model","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Exploit; Leverage (statistics); Matrix completion; Cluster analysis; Graph; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.018443456043826037,"score_gpt":0.2851759283114796,"score_spread":0.26673247226765356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2978917,0.000019967129,0.66026497,0.0010972373,0.001223298,0.0011582149,0.0009852181,0.00038705656,0.03697233],"genre_scores_gemma":[0.99572766,0.0000049040727,0.0008934275,0.0005036272,0.000086817476,0.00044709706,0.0014183692,0.000020848169,0.00089723244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766856,0.0002531355,0.0008227449,0.0002593918,0.00072802894,0.000268128],"domain_scores_gemma":[0.9988457,0.00011770727,0.00047361295,0.0003488823,0.00014682386,0.000067268404],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008460565,0.00025185512,0.00026872626,0.0007743681,0.0003390098,0.00014314287,0.00066868385,0.00004130579,0.0020995822],"category_scores_gemma":[0.0000068478244,0.00027849874,0.00028584615,0.0006206941,0.00004565234,0.0007405287,0.00022589546,0.00044042122,0.00008110625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005254521,0.00060875475,0.0036088857,0.000012108777,0.0002673317,0.0000023862262,0.0017468921,0.67201525,0.0020161392,0.30847427,0.006014892,0.004707638],"study_design_scores_gemma":[0.0020727585,0.00010450899,0.0017580556,0.000031362586,0.000042553707,0.000007082971,0.0009829308,0.9332152,0.0006631279,0.054893043,0.0057244585,0.00050493935],"about_ca_topic_score_codex":0.00015324348,"about_ca_topic_score_gemma":0.000015076998,"teacher_disagreement_score":0.697836,"about_ca_system_score_codex":0.00036887638,"about_ca_system_score_gemma":0.0000420955,"threshold_uncertainty_score":0.99996674},"labels":[],"label_agreement":null},{"id":"W4290071406","doi":"10.1109/tsipb.2017.2742940","title":"Characterization and Inference of Graph Diffusion Processes from Observations of Stationnary Signals","year":2017,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Inference; Characterization (materials science); Graph; Computer science; Diffusion; Statistical physics; Artificial intelligence; Theoretical computer science; Materials science; Physics; Nanotechnology; Thermodynamics","score_opus":0.02666237904586857,"score_gpt":0.26077028836023425,"score_spread":0.23410790931436568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290071406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6284977,0.00016484677,0.36936888,0.00042355334,0.00002036181,0.00021720772,0.00036499675,0.000035552104,0.00090686535],"genre_scores_gemma":[0.97758996,0.0003792561,0.017873665,0.0000059448685,0.000018259067,0.000053699005,0.0037031595,0.00001769816,0.000358362],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99782956,0.00089527725,0.0005350449,0.0003867237,0.00023538324,0.000118020966],"domain_scores_gemma":[0.9939537,0.00088858075,0.0014348732,0.0011565819,0.002509643,0.000056597797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087381736,0.00019684125,0.00039632997,0.0001478037,0.00020118253,0.00014027911,0.00062587555,0.00009363782,0.000111928275],"category_scores_gemma":[0.00034370326,0.0002109443,0.00010490411,0.00021219083,0.00020572459,0.00017909685,0.0007798954,0.00020567361,6.2681386e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022790604,0.0013508691,0.53449625,0.00067527546,0.00042945365,3.9467474e-7,0.013517158,0.00014369233,0.28769696,0.06903955,0.00013251291,0.09249508],"study_design_scores_gemma":[0.00053644227,0.000001277841,0.4958292,0.006558551,0.00030405773,1.7499072e-7,0.00019318057,0.024990335,0.3332258,0.13680422,0.0009014358,0.00065534405],"about_ca_topic_score_codex":0.0031941663,"about_ca_topic_score_gemma":0.00044711953,"teacher_disagreement_score":0.3514952,"about_ca_system_score_codex":0.00001204625,"about_ca_system_score_gemma":0.00020784006,"threshold_uncertainty_score":0.8602059},"labels":[],"label_agreement":null},{"id":"W4291269620","doi":"10.1371/journal.pone.0106052.s001","title":"File S1 - Dimensionality of Social Networks Using Motifs and Eigenvalues","year":2015,"lang":"en","type":"dataset","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Curse of dimensionality; Eigenvalues and eigenvectors; Artificial intelligence; Computer science; Pattern recognition (psychology); Mathematics; Physics; Quantum mechanics","score_opus":0.018563388047071725,"score_gpt":0.26025250756489243,"score_spread":0.2416891195178207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291269620","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003907651,0.0006656956,0.028603962,0.0002583804,0.00008057583,0.00034951663,0.96249235,0.00008390295,0.003557957],"genre_scores_gemma":[0.025767561,0.000043174663,0.008509988,0.000017640205,0.00011189092,0.000021899517,0.9649487,0.000029566125,0.0005495723],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959816,0.0024189414,0.0005042165,0.00046869644,0.0003583278,0.00026827175],"domain_scores_gemma":[0.9961251,0.00071852363,0.00067791075,0.001044866,0.0013113269,0.00012229627],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002218039,0.00029029718,0.0005344393,0.00012238494,0.0003068902,0.00012043636,0.0005835058,0.00016488021,0.0023238445],"category_scores_gemma":[0.000121489145,0.00030935678,0.00020000206,0.0003468988,0.00029712563,0.000089581314,0.00076731667,0.00037123196,0.000010166679],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045610204,0.00024256634,0.00044949376,0.000026530699,0.00013407237,4.9920067e-7,0.000242246,0.000041597723,0.000033004177,0.004761569,0.98940927,0.004654564],"study_design_scores_gemma":[0.00030613077,5.325796e-7,0.00048120602,0.0006070731,0.00028777824,0.0000017574688,0.00007374228,0.032303076,0.0009588604,0.0067424905,0.9577015,0.00053583086],"about_ca_topic_score_codex":0.0049397456,"about_ca_topic_score_gemma":0.00041968233,"teacher_disagreement_score":0.03226148,"about_ca_system_score_codex":0.000054426597,"about_ca_system_score_gemma":0.00016265408,"threshold_uncertainty_score":0.99993587},"labels":[],"label_agreement":null},{"id":"W4293056555","doi":"10.1101/2022.08.22.504699","title":"From components to communities: bringing network science to clustering for genomic epidemiology","year":2022,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Canadian Institutes of Health Research","keywords":"Cluster analysis; Pairwise comparison; Connected component; Computer science; Giant component; Graph; Context (archaeology); Clustering coefficient; Data mining; Markov chain; Node (physics); Theoretical computer science; Biology; Artificial intelligence; Random graph; Machine learning","score_opus":0.04092285689588584,"score_gpt":0.28913878353234346,"score_spread":0.2482159266364576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293056555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7090766,0.00014474112,0.28730375,0.00019746207,0.0010163158,0.0013715369,0.0005263126,0.00033703784,0.0000262447],"genre_scores_gemma":[0.88239735,0.0000062475715,0.11368449,0.00063491595,0.0019044979,0.0012227679,0.0000061891405,0.00013896506,0.000004593978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9958821,0.00032235874,0.0009435458,0.0012488957,0.0003106764,0.0012924012],"domain_scores_gemma":[0.9957132,0.00064860005,0.00053920323,0.002273319,0.00031978788,0.00050590193],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025638638,0.0006355546,0.0011924155,0.0005235576,0.0010497416,0.00026142204,0.002509157,0.00012663683,0.00033464484],"category_scores_gemma":[0.00006320476,0.00080835697,0.00032902975,0.0009968485,0.00015570059,0.0001109196,0.0063237697,0.0008663373,0.000030348037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022706491,0.0003874078,0.21747226,0.00023774109,0.0014383387,0.00000930026,0.00058735494,0.4484683,0.31401446,0.008541851,0.008494637,0.0001212994],"study_design_scores_gemma":[0.0018587813,0.0004694273,0.39075953,0.0028677615,0.0011097736,1.8161682e-8,0.00037471738,0.36929923,0.021574842,0.0012318784,0.20221105,0.008243014],"about_ca_topic_score_codex":0.004154298,"about_ca_topic_score_gemma":0.000027244156,"teacher_disagreement_score":0.2924396,"about_ca_system_score_codex":0.0007233782,"about_ca_system_score_gemma":0.0003624794,"threshold_uncertainty_score":0.99943674},"labels":[],"label_agreement":null},{"id":"W4293223548","doi":"10.11159/mhci22.114","title":"Social Media Event Detection UsingSpacy Named Entity Recognition and Spectral Embeddings","year":2022,"lang":"en","type":"article","venue":"Proceedings of the World Congress on Electrical Engineering and Computer Systems and Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Social media; Event (particle physics); Artificial intelligence; Named-entity recognition; Natural language processing; Pattern recognition (psychology); World Wide Web; Engineering; Task (project management); Physics","score_opus":0.010491427381061699,"score_gpt":0.22156936468413135,"score_spread":0.21107793730306965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293223548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9978704,0.000067091365,0.0014768802,0.000059637372,0.0002805272,0.00012997523,0.0000024831893,0.000038470356,0.000074573494],"genre_scores_gemma":[0.9995689,0.0000025158836,0.0001347432,0.00000769247,0.00022378535,0.000022968812,3.9160616e-7,0.0000058468195,0.00003318934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910146,0.000008176431,0.00016652994,0.00025443436,0.00027512538,0.00019427501],"domain_scores_gemma":[0.9996559,0.000050069386,0.0001250761,0.00003942663,0.000073107076,0.000056423465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036129903,0.000106804284,0.000179224,0.0001972163,0.0004388737,0.00016538962,0.00016120767,0.000010708332,0.0000020750326],"category_scores_gemma":[0.000008400606,0.00008922633,0.000040077535,0.0007357508,0.00008921749,0.000117184005,0.00019463089,0.00020477343,6.186749e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002332553,0.0006093971,0.05042781,0.00048646107,0.00041984982,0.0000027097065,0.004132904,0.004826291,0.10783185,0.27205127,0.0025231927,0.556455],"study_design_scores_gemma":[0.00026460132,0.000110837274,0.007822762,0.000082860366,0.000039714243,0.00001447655,0.000057535577,0.98388845,0.005347628,0.0014777794,0.000656302,0.00023702931],"about_ca_topic_score_codex":0.00004405967,"about_ca_topic_score_gemma":0.0000012425968,"teacher_disagreement_score":0.9790622,"about_ca_system_score_codex":0.000043315013,"about_ca_system_score_gemma":0.000011101843,"threshold_uncertainty_score":0.36385438},"labels":[],"label_agreement":null},{"id":"W4293997852","doi":"10.1145/3555659","title":"Anticipated versus Actual Effects of Platform Design Change: A Case Study of Twitter's Character Limit","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM on Human-Computer Interaction","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Counterfactual thinking; Computer science; Limit (mathematics); Character (mathematics); Unintended consequences; Intervention (counseling); Counterfactual conditional; Human–computer interaction; World Wide Web; Psychology; Social psychology; Political science; Mathematics","score_opus":0.16115285519412562,"score_gpt":0.3611459613885243,"score_spread":0.19999310619439867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293997852","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9983856,0.000002946992,0.00018886212,0.000034593202,0.00037907512,0.00088483625,0.0000031292695,0.00003632134,0.000084636355],"genre_scores_gemma":[0.99901885,3.5344019e-7,0.00042836778,0.000023118746,0.00029131878,0.00019333567,0.0000046796717,0.000023575381,0.00001637519],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987136,0.000039199553,0.0004611995,0.00027816766,0.00033200547,0.00017583068],"domain_scores_gemma":[0.99825394,0.0002555042,0.00088041,0.00038983513,0.00019206575,0.000028239263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025039475,0.00020058481,0.0003952859,0.00026001205,0.00018927653,0.00003041377,0.00078097504,0.000023737794,0.000082952094],"category_scores_gemma":[0.000016972865,0.00016728305,0.00019532222,0.00033593256,0.000031441774,0.0002651011,0.0009795703,0.0003274023,8.71961e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011352987,0.03928798,0.10116815,0.0015420935,0.0117246695,0.00012530122,0.2447741,0.002469874,0.3377369,0.003959976,0.023557324,0.22230063],"study_design_scores_gemma":[0.012631269,0.030844599,0.029047797,0.0011555293,0.0025505729,0.00014278397,0.028591653,0.044961903,0.8438986,0.004009572,0.0006011928,0.0015645344],"about_ca_topic_score_codex":0.0004720334,"about_ca_topic_score_gemma":0.0000032244432,"teacher_disagreement_score":0.5061617,"about_ca_system_score_codex":0.00007005701,"about_ca_system_score_gemma":0.00000780794,"threshold_uncertainty_score":0.6821605},"labels":[],"label_agreement":null},{"id":"W4294405730","doi":"10.1007/s43069-022-00156-6","title":"A Literature Review on Correlation Clustering: Cross-disciplinary Taxonomy with Bibliometric Analysis","year":2022,"lang":"en","type":"review","venue":"Operations Research Forum","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Cluster analysis; Taxonomy (biology); Discipline; Computer science; Data science; Set (abstract data type); Cross disciplinary; Bibliometrics; Information retrieval; Data mining; Management science; Artificial intelligence; Social science; Sociology; Engineering; Biology","score_opus":0.16849762507913518,"score_gpt":0.4663325407691728,"score_spread":0.2978349156900376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294405730","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015509495,0.9735361,0.012901379,0.000118109725,0.000039135837,0.0031295265,0.00036024983,0.00007225281,0.009841701],"genre_scores_gemma":[0.00010067499,0.9759228,0.0012091249,0.0000290516,0.00022605651,0.007679549,0.008928642,0.00007759242,0.0058264886],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949032,0.0011227021,0.0009223257,0.0010190716,0.0012836573,0.00074901554],"domain_scores_gemma":[0.99690056,0.0005452807,0.0002183143,0.0015755342,0.0005606442,0.00019967007],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["bibliometrics"],"category_scores_codex":[0.0019607625,0.00054496044,0.0017856124,0.068598755,0.0017291866,0.0011970232,0.0009796082,0.00013217259,0.006044296],"category_scores_gemma":[0.00006411453,0.00040631279,0.0011570096,0.29313362,0.00013240922,0.0004003675,0.00088195136,0.0021537,0.000120290206],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011031907,0.00029864002,0.00040577754,0.0051746834,0.0022867958,0.000019569756,0.000018761237,0.00567462,2.1730514e-8,0.0022049034,0.017046733,0.96685845],"study_design_scores_gemma":[0.00008855455,0.00022783862,0.000019822153,0.015184993,0.0015710786,0.000005626716,0.000021006452,0.006728745,7.4484134e-8,0.000027634313,0.9757156,0.0004090551],"about_ca_topic_score_codex":0.00008361175,"about_ca_topic_score_gemma":0.00011812118,"teacher_disagreement_score":0.9664494,"about_ca_system_score_codex":0.00038689745,"about_ca_system_score_gemma":0.00053664745,"threshold_uncertainty_score":0.99983984},"labels":[{"model":"gemma","categories":["bibliometrics"],"domain":null,"study_design":"not_applicable","genre":"review","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":["bibliometrics"],"domain":null,"study_design":"design_other","genre":"review","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W4294770356","doi":"10.3233/ida-216149","title":"Influence maximization based on network representation learning in social network","year":2022,"lang":"en","type":"article","venue":"Intelligent Data Analysis","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Random walk; Social network (sociolinguistics); Maximization; Representation (politics); Node (physics); Heuristic; Embedding; Theoretical computer science; Social network analysis; Artificial intelligence; Machine learning; Mathematical optimization; Mathematics; World Wide Web","score_opus":0.03793808942495143,"score_gpt":0.32821877821153894,"score_spread":0.2902806887865875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294770356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067282796,0.000090487294,0.9291046,0.0003700876,0.00006734751,0.00035524584,0.00010990923,0.00017861484,0.0024408852],"genre_scores_gemma":[0.9893088,0.0000075490116,0.0016002639,0.00017205733,0.0004543354,0.00008376219,0.008239003,0.000019841991,0.00011441549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738425,0.00058369775,0.0005359832,0.00066145585,0.00047101133,0.00036357206],"domain_scores_gemma":[0.99848056,0.00021371833,0.00032710814,0.0008758242,0.000058801143,0.00004401696],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009938279,0.00018132769,0.00038846853,0.00041122452,0.0006186622,0.00009599956,0.00079075387,0.000026925089,0.0015741375],"category_scores_gemma":[0.000023561932,0.000211364,0.00022345703,0.005425426,0.000029061372,0.00017113533,0.0005996786,0.0004449659,0.000013524825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024868048,0.00006416998,0.3329353,7.8524266e-7,0.00025996676,0.0000017729438,0.00004078947,0.65454006,0.0000016491322,0.0017976674,0.0029611974,0.0073717614],"study_design_scores_gemma":[0.00009532747,0.000028616352,0.016749036,0.0000063088805,0.00056912855,4.380604e-8,0.00014791955,0.9651062,0.000016816026,0.0034764928,0.013589174,0.00021493691],"about_ca_topic_score_codex":0.0010839803,"about_ca_topic_score_gemma":0.00017199838,"teacher_disagreement_score":0.92750436,"about_ca_system_score_codex":0.00011711076,"about_ca_system_score_gemma":0.000052563348,"threshold_uncertainty_score":0.99933857},"labels":[],"label_agreement":null},{"id":"W4295073676","doi":"10.11144/javeriana.uh90.cncn","title":"The cohesion of National and Cultural networks during periods of stress","year":2022,"lang":"en","type":"article","venue":"Universitas Humanística","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catalan; Cohesion (chemistry); Ideology; Collective identity; Clustering coefficient; Group cohesiveness; Identity (music); Sociology; Politics; Cultural identity; Social psychology; Computer science; Psychology; Political science; Humanities; Cluster analysis; Law; Artificial intelligence; Feeling","score_opus":0.006714544177776707,"score_gpt":0.22499712477351452,"score_spread":0.21828258059573782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295073676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848538,0.00018512136,0.0009160073,0.000034778714,0.00002204453,0.00008196503,0.000045372108,0.00001388181,0.0138470065],"genre_scores_gemma":[0.9996279,0.0000048819747,0.000100563906,0.0000015669774,0.00003235399,0.0000013544294,0.000023403934,0.000003078332,0.00020492892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995553,0.000038561586,0.00009770867,0.00008064249,0.00014987313,0.000077919394],"domain_scores_gemma":[0.999676,0.00006271542,0.000091316164,0.00008022709,0.00007289965,0.000016826405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007010412,0.0000499231,0.00008730193,0.00003640443,0.00043940745,0.000009376135,0.00013334544,0.0000067021574,0.00085281266],"category_scores_gemma":[0.0000018185456,0.000042700573,0.00005008599,0.000101699676,0.000101125,0.000037946902,0.00021781321,0.00007925898,1.8764808e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019328698,0.00027625644,0.096648134,0.00003182991,0.0005558476,0.000004065984,0.0025009515,0.038232714,0.0026776209,0.84347284,0.012092511,0.0033139547],"study_design_scores_gemma":[0.00572665,0.0011537989,0.43486625,0.0002682163,0.0014686246,0.000012785738,0.15849885,0.30473328,0.00926344,0.039530635,0.04246296,0.0020145297],"about_ca_topic_score_codex":0.00003847256,"about_ca_topic_score_gemma":0.0000020393925,"teacher_disagreement_score":0.8039422,"about_ca_system_score_codex":0.000025989417,"about_ca_system_score_gemma":0.000013189471,"threshold_uncertainty_score":0.93377006},"labels":[],"label_agreement":null},{"id":"W4295709232","doi":"10.1016/j.bdr.2022.100348","title":"Properties and Performance of the ABCDe Random Graph Model with Community Structure","year":2022,"lang":"en","type":"article","venue":"Big Data Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Benchmark (surveying); Graph; Random graph; Generator (circuit theory); Community structure; Theoretical computer science; Algorithm; Power (physics); Mathematics","score_opus":0.2926327152332855,"score_gpt":0.3403536589814936,"score_spread":0.04772094374820812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295709232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9981864,0.00013093381,0.00044592295,0.00009348643,0.0000064532583,0.0002515653,0.00044132193,0.0000088167735,0.00043507465],"genre_scores_gemma":[0.9993693,0.000009366124,0.0002165478,0.0000067912674,0.000026408467,0.00003396889,0.00016780291,0.000008010852,0.0001617741],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986427,0.0005093995,0.000103857856,0.00013757305,0.00043821655,0.0001682826],"domain_scores_gemma":[0.9984882,0.00006509013,0.000041384737,0.0012983446,0.000082786224,0.000024216519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010243226,0.00006479949,0.00012434805,0.00006917853,0.0009403332,0.00003422753,0.0012068056,0.000008067802,0.00004101394],"category_scores_gemma":[0.0000050939448,0.00003755979,0.000018320448,0.00043348566,0.00027612504,0.00008432148,0.002981962,0.0007090568,1.2923769e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004184498,0.0010676176,0.63099146,0.0004895264,0.000994935,0.000001368472,0.0057104887,0.024365887,0.023244405,0.00837888,0.027993705,0.27257723],"study_design_scores_gemma":[0.0026410983,0.0005437561,0.015185762,0.00014273405,0.00009741518,0.0000051943516,0.0033064764,0.9478521,0.010373708,0.011250165,0.008189968,0.0004116776],"about_ca_topic_score_codex":0.001736769,"about_ca_topic_score_gemma":0.00019587249,"teacher_disagreement_score":0.9234862,"about_ca_system_score_codex":0.000010862994,"about_ca_system_score_gemma":0.000095205636,"threshold_uncertainty_score":0.72323775},"labels":[],"label_agreement":null},{"id":"W4298000617","doi":"10.1007/s12652-022-04418-3","title":"Missing nodes detection for complex networks based on graph convolutional networks","year":2022,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Postdoctoral Research Foundation of China; Federation for the Humanities and Social Sciences","keywords":"Missing data; Computer science; Inference; Graph; Data mining; Node (physics); Complex network; Theoretical computer science; Artificial intelligence; Machine learning","score_opus":0.03442046492274199,"score_gpt":0.2866244748148441,"score_spread":0.2522040098921021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298000617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03754797,0.00017715977,0.96162206,0.00006646701,0.00026196943,0.00017315806,0.0000033085548,0.000025905876,0.000121976],"genre_scores_gemma":[0.99061245,0.0000050381614,0.008339191,0.0002265745,0.0007611483,0.0000073965984,0.000019742462,0.000019066778,0.000009403112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983996,0.00013393936,0.0006667025,0.00021940745,0.00029007718,0.00029027084],"domain_scores_gemma":[0.99840516,0.00043822627,0.0007105647,0.00013013254,0.0002327073,0.0000832339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009161546,0.00018050955,0.00035562803,0.00025500436,0.0011359348,0.00012509798,0.00024939774,0.000025251782,0.00020503177],"category_scores_gemma":[0.000008982234,0.0001807355,0.0003145781,0.00028181565,0.00006735109,0.00007082193,0.00010542092,0.00045732374,2.4438614e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018327146,0.00016362075,0.0020783774,0.0000061039786,0.00009965822,0.0000018702447,0.00009072974,0.88560575,0.00025653394,0.0054471996,0.00035919782,0.10570768],"study_design_scores_gemma":[0.00032788463,0.000448123,0.00075352367,0.000062585765,0.00007648453,0.000009406449,0.00028903468,0.98855156,0.00028918163,0.007740764,0.0012717786,0.0001796959],"about_ca_topic_score_codex":0.000022431754,"about_ca_topic_score_gemma":0.0000018959034,"teacher_disagreement_score":0.9532829,"about_ca_system_score_codex":0.000085161715,"about_ca_system_score_gemma":0.000034627818,"threshold_uncertainty_score":0.8736808},"labels":[],"label_agreement":null},{"id":"W4298003741","doi":"10.3390/sym14102029","title":"K-Means Clustering Algorithm Based on Memristive Chaotic System and Sparrow Search Algorithm","year":2022,"lang":"en","type":"article","venue":"Symmetry","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"Natural Science Foundation of Hunan Province","keywords":"Cluster analysis; Computer science; Chaotic; Algorithm; Local optimum; Centroid; CHAOS (operating system); Data mining; CURE data clustering algorithm; Correlation clustering; Artificial intelligence","score_opus":0.01102833353631682,"score_gpt":0.24789584613087554,"score_spread":0.2368675125945587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298003741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075872685,0.00010621488,0.9752149,0.00016360887,0.00022056777,0.00046547005,0.00023007998,0.00026748673,0.015744435],"genre_scores_gemma":[0.9734872,6.286679e-7,0.025588343,0.000067769244,0.0003446711,0.00010289049,0.0000876857,0.00003809708,0.00028273175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998347,0.00021675079,0.00023280828,0.0004316133,0.000416451,0.00035540728],"domain_scores_gemma":[0.99924886,0.00013788158,0.00008537295,0.0003711577,0.000046146237,0.0001105695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047603823,0.00020782092,0.0003126307,0.00025371072,0.00044774933,0.000064596694,0.00023004768,0.000024479636,0.00035282617],"category_scores_gemma":[0.000002027037,0.00021969674,0.00012813596,0.00052018336,0.00004512133,0.00004417075,0.00031036328,0.00039651885,0.000014015089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003827466,0.00038784012,0.010179708,0.00009695224,0.0003798696,0.000061551276,0.00038589342,0.010598008,0.00008760105,0.010097687,0.0028262471,0.9648604],"study_design_scores_gemma":[0.0003399118,0.00014109083,0.0006529243,0.000039779945,0.00005351694,0.0000036199804,0.0014244167,0.9949105,0.000306938,0.00025700143,0.00162525,0.00024509354],"about_ca_topic_score_codex":0.00042028623,"about_ca_topic_score_gemma":0.0000024832302,"teacher_disagreement_score":0.9843125,"about_ca_system_score_codex":0.00017636902,"about_ca_system_score_gemma":0.000043045093,"threshold_uncertainty_score":0.8958973},"labels":[],"label_agreement":null},{"id":"W4298021564","doi":"10.48550/arxiv.1010.1437","title":"Mixed-Membership Stochastic Block-Models for Transactional Networks","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Generative model; Inference; Transactional leadership; Theoretical computer science; Block (permutation group theory); Data mining; Stochastic block model; Social network analysis; Transaction data; Social network (sociolinguistics); Generative grammar; Machine learning; Artificial intelligence; Social media; Database transaction; Database; Cluster analysis; World Wide Web; Mathematics","score_opus":0.07334723654462495,"score_gpt":0.20290120766507846,"score_spread":0.12955397112045353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298021564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043052174,0.000024993715,0.9530299,0.00003436797,0.0004446007,0.0005907737,0.00012413786,0.00019287622,0.0025061895],"genre_scores_gemma":[0.9960636,0.000005292078,0.0014690859,0.00002143774,0.0008759642,0.000016470027,0.000310197,0.000056385692,0.0011815809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981247,0.00006727464,0.00027574028,0.0009702477,0.00008066368,0.0004813666],"domain_scores_gemma":[0.9982648,0.00024372744,0.00029881968,0.0007784077,0.00022202735,0.00019220023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022779897,0.0004500109,0.00052448804,0.00020579791,0.00024854438,0.00007911579,0.0007318296,0.00035549505,0.00043814888],"category_scores_gemma":[0.0000028888117,0.00055410207,0.0007865182,0.00028307762,0.00013086919,0.0001420198,0.00025740592,0.0011764191,0.000010094741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005303291,0.00009805687,0.00017440271,0.00001630716,0.000326434,0.0000026273033,0.000023567882,0.82728744,0.0000058711316,0.17068486,0.0006865798,0.0006408414],"study_design_scores_gemma":[0.00032164657,0.000019063802,0.00002965715,0.000042077103,0.0004504671,4.6853376e-7,0.0000392621,0.74335843,0.000023531678,0.25499818,0.00029880062,0.0004184323],"about_ca_topic_score_codex":0.00022685995,"about_ca_topic_score_gemma":0.00015873826,"teacher_disagreement_score":0.9530114,"about_ca_system_score_codex":0.00009385551,"about_ca_system_score_gemma":0.00014342203,"threshold_uncertainty_score":0.99969107},"labels":[],"label_agreement":null},{"id":"W4298027294","doi":"10.48550/arxiv.1009.1686","title":"Statistical Behavior of Embeddedness and Communities of Overlapping\\n Cliques in Online Social Networks","year":2010,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Victoria","funders":"","keywords":"Embeddedness; Degree distribution; Computer science; Preferential attachment; Social network (sociolinguistics); Distribution (mathematics); Complex network; Node (physics); Tree (set theory); Hierarchical network model; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Sociology; Artificial intelligence; Mathematics; Social media; Social science; World Wide Web","score_opus":0.058955107031977934,"score_gpt":0.2433563138883041,"score_spread":0.18440120685632616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298027294","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8964548,0.000045864697,0.1021314,0.000007784305,0.00009871782,0.0004286566,0.0004845238,0.000029294719,0.00031893965],"genre_scores_gemma":[0.9975963,0.00035513766,0.0012025026,0.000007140256,0.00017287438,0.0000033712981,0.00054664596,0.000039851493,0.00007613943],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973787,0.0005217772,0.0009059122,0.0006227617,0.000114432994,0.0004564257],"domain_scores_gemma":[0.99716455,0.0004750842,0.0010609725,0.00079228537,0.00037677336,0.00013033312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042092404,0.0005393381,0.0015036387,0.0004249418,0.00017507175,0.00003938582,0.0008537694,0.00052428653,0.00030982617],"category_scores_gemma":[0.000007929091,0.0007001653,0.00037760756,0.0005566394,0.0014371964,0.00015796148,0.0017764481,0.0019420108,6.4169706e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033657285,0.002377706,0.6778761,0.00028409777,0.0004759213,0.000035565383,0.0018295295,0.020965284,0.0001901929,0.2896458,0.00005127267,0.005931935],"study_design_scores_gemma":[0.0019055658,0.00033188434,0.3429071,0.0008469326,0.0021313543,0.000001563699,0.009531059,0.5974009,0.00018361249,0.043180548,0.0001376381,0.0014418269],"about_ca_topic_score_codex":0.0066671683,"about_ca_topic_score_gemma":0.003712539,"teacher_disagreement_score":0.5764356,"about_ca_system_score_codex":0.00009018118,"about_ca_system_score_gemma":0.00019216341,"threshold_uncertainty_score":0.99994755},"labels":[],"label_agreement":null},{"id":"W4298270085","doi":"10.1145/2339530.2339717","title":"The Untold Story of the Clones: Content-agnostic Factors that Impact YouTube Video Popularity","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Popularity; Upload; Computer science; Internet privacy; Social media; World Wide Web; Content (measure theory); Multimedia; Psychology; Mathematics; Social psychology","score_opus":0.10197615433175919,"score_gpt":0.21124237740090945,"score_spread":0.10926622306915026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298270085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898231,0.0001277045,0.007872145,0.00004557606,0.00031935656,0.0006134397,0.00011648506,0.000078387806,0.0010037904],"genre_scores_gemma":[0.9983858,0.000056521585,0.000018026722,0.000013000668,0.00009708229,0.000003167445,0.000058317524,0.0000307522,0.0013373226],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998055,0.00049980916,0.00027689472,0.0006051191,0.00015630072,0.0004068735],"domain_scores_gemma":[0.9966977,0.00055068335,0.00068016845,0.0017167882,0.00022780288,0.00012684887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026176815,0.0004485449,0.00056603755,0.00010685649,0.00052623736,0.000094684576,0.0016562309,0.0001730408,0.00022750173],"category_scores_gemma":[0.00003751769,0.0002878389,0.0011471498,0.00033983373,0.00029787875,0.00014873402,0.0014581204,0.0011758265,0.000013279842],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022730197,0.000111307265,0.94579035,0.000020720874,0.000817189,0.0000025178392,0.0001849779,0.008578048,0.000042172316,0.042483084,0.0016399535,0.0003069263],"study_design_scores_gemma":[0.0008767525,0.000111689704,0.84905076,0.0004616085,0.0022672156,7.7568177e-7,0.0037086832,0.041301727,0.0012339331,0.09705434,0.002376514,0.0015559791],"about_ca_topic_score_codex":0.012959752,"about_ca_topic_score_gemma":0.00034558328,"teacher_disagreement_score":0.09673959,"about_ca_system_score_codex":0.00020697257,"about_ca_system_score_gemma":0.00015531719,"threshold_uncertainty_score":0.9999574},"labels":[],"label_agreement":null},{"id":"W4299843524","doi":"10.21428/594757db.c6794307","title":"NICASN: Non-negative Matrix Factorization and Independent Component Analysis for Clustering Social Networks","year":2022,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Cluster analysis; Computer science; Non-negative matrix factorization; Initialization; Social network (sociolinguistics); Component (thermodynamics); Matrix decomposition; Clustering coefficient; Hierarchical clustering; Independent component analysis; Data mining; Artificial intelligence; Social media; World Wide Web","score_opus":0.014649179816322435,"score_gpt":0.2856010071252792,"score_spread":0.2709518273089568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299843524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05399872,0.000010759458,0.94478285,0.00008269042,0.000039705945,0.00031732375,0.000036268546,0.000049488393,0.0006822172],"genre_scores_gemma":[0.99637103,0.0000011348224,0.0026011022,0.00002658005,0.00023815014,0.00019058808,0.0002778896,0.000014302532,0.00027924744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990522,0.000062437764,0.00024892838,0.00027079709,0.00016946609,0.00019611823],"domain_scores_gemma":[0.99953485,0.00009323091,0.0001548214,0.00012600815,0.00004909597,0.0000419907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019692269,0.00013118879,0.00029510076,0.00014866264,0.00055199617,0.00006929169,0.00012983978,0.000020914462,0.0006358513],"category_scores_gemma":[9.4780034e-7,0.00013675778,0.00022641047,0.00051966,0.000019657753,0.000061586004,0.00032906543,0.00013733971,3.8373986e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015539254,0.00035845707,0.31739396,0.000015192377,0.0051812925,0.0000011403282,0.001720949,0.6327049,0.00045209628,0.021137903,0.003875878,0.017002821],"study_design_scores_gemma":[0.00039470234,0.00004634682,0.021304075,0.0000011121523,0.0005391959,1.614918e-7,0.000733642,0.9734112,0.00007825719,0.0022412192,0.0010354359,0.00021464414],"about_ca_topic_score_codex":0.0003485579,"about_ca_topic_score_gemma":0.000066814675,"teacher_disagreement_score":0.94237226,"about_ca_system_score_codex":0.000068596426,"about_ca_system_score_gemma":0.000011770258,"threshold_uncertainty_score":0.6962126},"labels":[],"label_agreement":null},{"id":"W4299859418","doi":"10.48550/arxiv.1407.6076","title":"Stability of Epidemic Models over Directed Graphs: A Positive Systems\\n Approach","year":2014,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Multidisciplinary University Research Initiative","keywords":"Uniqueness; Basic reproduction number; Network topology; Exponential stability; Markov chain; Convergence (economics); Mathematical proof; Epidemic model; Stability (learning theory); Equilibrium point; Complex network; Stability theory; Mathematics; Applied mathematics; Topology (electrical circuits); Computer science; Statistical physics; Population; Physics; Mathematical analysis; Combinatorics; Differential equation","score_opus":0.06793007930854923,"score_gpt":0.19691863718728872,"score_spread":0.12898855787873947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299859418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49308234,0.00012692726,0.49754542,0.000003430852,0.00013319284,0.0012040655,0.00031920284,0.00019881458,0.007386587],"genre_scores_gemma":[0.99789625,0.00017727978,0.0008190924,0.00001059042,0.00018560274,0.0000132031955,0.0004927851,0.00008910855,0.00031608864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925865,0.002033042,0.0013788788,0.0027721955,0.00027825218,0.0009511342],"domain_scores_gemma":[0.9926208,0.000693718,0.0022505259,0.002979278,0.001029411,0.0004262625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013740022,0.0011902915,0.0026717603,0.0006259634,0.00030824015,0.000101095386,0.0017471139,0.00062930246,0.00019100947],"category_scores_gemma":[0.000024547177,0.0014206524,0.0019227954,0.0017813229,0.0007215915,0.0004367408,0.0018737434,0.0014579957,0.000016048461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025385912,0.0008865051,0.044018205,0.00041936425,0.0018915714,0.000006521623,0.00031312,0.58827287,0.00012036973,0.3634871,0.00019590183,0.00013463151],"study_design_scores_gemma":[0.0007196678,0.000101408405,0.002426436,0.00048521592,0.0016772737,7.9701e-7,0.00041767597,0.9111557,0.00019118923,0.08170161,0.000050681476,0.0010723313],"about_ca_topic_score_codex":0.006442983,"about_ca_topic_score_gemma":0.000029164696,"teacher_disagreement_score":0.5048139,"about_ca_system_score_codex":0.0005488834,"about_ca_system_score_gemma":0.00032866249,"threshold_uncertainty_score":0.9988243},"labels":[],"label_agreement":null},{"id":"W4299903950","doi":"10.48550/arxiv.1706.07828","title":"Inferring Structural Characteristics of Networks with Strong and Weak\\n Ties from Fixed-Choice Surveys","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Estimator; Econometrics; Network topology; Social network (sociolinguistics); Variety (cybernetics); Computer science; Jackknife resampling; Degree distribution; Clustering coefficient; Cluster analysis; Interpersonal ties; Respondent; Statistics; Data mining; Mathematics; Complex network; Artificial intelligence; Social media","score_opus":0.04576086828340868,"score_gpt":0.20475923805865082,"score_spread":0.15899836977524212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299903950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8430397,0.00003830721,0.15523595,0.0000039296983,0.00008368721,0.00014992723,0.00015892144,0.00005062449,0.0012389764],"genre_scores_gemma":[0.99864256,0.000032467207,0.00035737304,0.0000018607899,0.00031616888,8.8667605e-7,0.00033701188,0.00002822426,0.0002834303],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99865395,0.00017157607,0.00023581392,0.0006051991,0.00007091286,0.0002625234],"domain_scores_gemma":[0.9979104,0.00018741826,0.00073891337,0.0009028759,0.00015675045,0.000103660735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017979105,0.00035200085,0.0006412261,0.000107046566,0.00020608942,0.00012824744,0.0005815533,0.00014125851,0.00011590638],"category_scores_gemma":[0.000007614426,0.00036540008,0.00014633512,0.00009158213,0.00024085915,0.00018268461,0.0010372193,0.000598692,0.0000010469286],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025034946,0.0000174401,0.9598554,0.000022504766,0.00049976713,0.000006870541,0.000047361442,0.030492982,0.0000060465973,0.006134729,0.00002675902,0.0028651145],"study_design_scores_gemma":[0.00037662027,0.00003822537,0.7466462,0.00027784883,0.0005175096,2.2523939e-7,0.00010790783,0.24345382,0.000040163355,0.007917174,0.00008556736,0.00053873373],"about_ca_topic_score_codex":0.007141194,"about_ca_topic_score_gemma":0.0005785378,"teacher_disagreement_score":0.21320917,"about_ca_system_score_codex":0.000043524422,"about_ca_system_score_gemma":0.00006517876,"threshold_uncertainty_score":0.9998798},"labels":[],"label_agreement":null},{"id":"W4300422063","doi":"10.1007/978-3-642-27848-8_152-2","title":"Fully Dynamic Connectivity","year":2015,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science","score_opus":0.015524780981067793,"score_gpt":0.2677711492939692,"score_spread":0.2522463683129014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300422063","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011843878,0.0006871169,0.013759748,0.000039476607,0.00027715813,0.0003120855,0.00023715726,0.000117703385,0.9844511],"genre_scores_gemma":[0.020673836,0.00031155083,0.010707112,0.00001464643,0.0017540535,0.000043480406,0.00065444305,0.00018718318,0.9656537],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816924,0.000027859574,0.0005531373,0.00050622533,0.0004548261,0.00028870103],"domain_scores_gemma":[0.99817395,0.00011087957,0.000544841,0.000714947,0.00030526533,0.00015013771],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027543365,0.0004729163,0.0008831709,0.00020054965,0.0000532623,0.000019007179,0.0004244659,0.00019057417,0.0029405712],"category_scores_gemma":[0.0000071619224,0.00048354955,0.00043169985,0.00007028713,0.00014318433,0.00008811768,0.00023209804,0.00049639866,0.00012868442],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025890342,0.00018085334,0.00053202757,0.000051857452,0.0011375911,0.000019404752,0.00021281952,0.000066955785,0.000010752818,0.27143478,0.07350902,0.652818],"study_design_scores_gemma":[0.00024396228,0.00010640674,0.000068340436,0.000097744676,0.00028260026,0.0000014471834,0.000017907423,0.0012966037,0.000013414779,0.29926783,0.6980014,0.0006023631],"about_ca_topic_score_codex":0.0001502509,"about_ca_topic_score_gemma":0.000026635103,"teacher_disagreement_score":0.65221566,"about_ca_system_score_codex":0.000089720175,"about_ca_system_score_gemma":0.00020996928,"threshold_uncertainty_score":0.99976164},"labels":[],"label_agreement":null},{"id":"W4300912324","doi":"","title":"Using mathematical programming to refine heuristic solutions for network clustering","year":2014,"lang":"en","type":"book-chapter","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Heuristic; Cluster analysis; Artificial intelligence","score_opus":0.03633394661792697,"score_gpt":0.2673900866345403,"score_spread":0.23105614001661332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300912324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003805306,0.00011833931,0.83348185,0.00061167753,0.00004608876,0.00060298824,0.000028818,0.00016387898,0.16490832],"genre_scores_gemma":[0.06326296,0.000014537996,0.7486079,0.00008416482,0.000451514,0.0002173859,0.0006411175,0.00019142132,0.18652901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99757373,0.00044201608,0.00061794644,0.00057268643,0.00024834098,0.000545293],"domain_scores_gemma":[0.9960136,0.0010569071,0.00043540666,0.0012963805,0.0010073091,0.00019040177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029944642,0.00036196335,0.0005455238,0.00014336198,0.00067723385,0.00025242227,0.0006004665,0.00013129353,0.00034791967],"category_scores_gemma":[0.00013853949,0.00040238816,0.00036642034,0.00014333824,0.000109047374,0.000045291723,0.0006759389,0.00030252594,0.000038727067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050489543,0.000063434425,0.00003794158,0.000061821185,0.000119301294,3.5712873e-7,0.00029068274,0.000806815,0.000045085486,0.92204696,0.002337561,0.074185014],"study_design_scores_gemma":[0.00031227915,0.0000014667353,0.00001063169,0.003669774,0.00037583508,0.0000042345323,0.000018190833,0.28795904,0.00019993089,0.18450615,0.52211386,0.00082861277],"about_ca_topic_score_codex":0.00013540208,"about_ca_topic_score_gemma":0.00033010048,"teacher_disagreement_score":0.7375408,"about_ca_system_score_codex":0.00009696698,"about_ca_system_score_gemma":0.00007752549,"threshold_uncertainty_score":0.9998428},"labels":[],"label_agreement":null},{"id":"W4300953116","doi":"10.1007/978-1-4614-6170-8_358","title":"Topic Modeling in Online Social Media, User Features, and Social Networks for","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Social media; Computer science; World Wide Web; Data science; Internet privacy","score_opus":0.029078956225694286,"score_gpt":0.26569367101197294,"score_spread":0.23661471478627866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300953116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013400009,0.00058089267,0.7671455,0.0011312008,0.00028868104,0.0011178942,0.0002183164,0.0002394307,0.22793804],"genre_scores_gemma":[0.7196142,0.000049944563,0.0076940544,0.00048592343,0.021262942,0.000098609744,0.0037003662,0.00021673826,0.2468772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988684,0.000014923107,0.00034751682,0.00036948812,0.0001289888,0.00027067587],"domain_scores_gemma":[0.99951655,0.00011098234,0.00013559984,0.00013270086,0.000068729365,0.000035411416],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013373043,0.0003103973,0.0006142641,0.00011204811,0.0001371337,0.00005399783,0.00016299731,0.00028689974,0.00027199948],"category_scores_gemma":[0.0000013204015,0.00030610187,0.00027300388,0.000022546637,0.000043185137,0.000029354684,0.00012329988,0.0004433864,0.0000010353846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017196639,0.000020024589,0.000086857464,0.000015653492,0.00014110097,4.236035e-7,0.00015499773,0.0002769955,6.500511e-7,0.8742138,0.016351469,0.1087208],"study_design_scores_gemma":[0.001227789,0.000036526337,0.00012380735,0.00011352388,0.00043183012,5.288552e-7,0.00010955659,0.26838666,0.0000018885029,0.5071321,0.2211558,0.0012799973],"about_ca_topic_score_codex":0.00010833304,"about_ca_topic_score_gemma":0.001130592,"teacher_disagreement_score":0.7594515,"about_ca_system_score_codex":0.000034326677,"about_ca_system_score_gemma":0.000025180418,"threshold_uncertainty_score":0.9999391},"labels":[],"label_agreement":null},{"id":"W4301354846","doi":"10.1007/978-1-4939-7131-2_387","title":"Temporal Analysis on Static and Dynamic Social Networks Topologies","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Network topology; Computer science; Computer network","score_opus":0.01330068589508506,"score_gpt":0.27629424397647284,"score_spread":0.2629935580813878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301354846","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011023377,0.00008960582,0.098669,0.0002694863,0.00006448409,0.0002806016,0.00007449341,0.0002595344,0.8991905],"genre_scores_gemma":[0.6387673,0.000019077077,0.0012794762,0.000101816055,0.00075257785,0.000013926385,0.0005945395,0.000046467336,0.35842484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986851,0.000024044015,0.0003585309,0.00049253495,0.00018072454,0.00025905026],"domain_scores_gemma":[0.99914235,0.00009217943,0.00028230913,0.00035611584,0.00007091388,0.000056155557],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012315088,0.00039644932,0.0007760476,0.00031636053,0.00018621262,0.00009568822,0.0002003672,0.00016212289,0.010576311],"category_scores_gemma":[8.8197174e-7,0.0003466952,0.0004723077,0.000112722315,0.00025492336,0.00003721033,0.00016935277,0.00030654558,0.00002835065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059127888,0.0000856155,0.00443678,0.000017482967,0.013854612,0.000008222288,0.00023816168,0.00038942162,9.760461e-7,0.7756751,0.12822402,0.07701048],"study_design_scores_gemma":[0.00040041568,0.0003970313,0.0012662251,0.0000799736,0.008255857,4.7956576e-7,0.000248659,0.10059277,0.0000047681856,0.7805691,0.10622521,0.0019595118],"about_ca_topic_score_codex":0.00016039808,"about_ca_topic_score_gemma":0.00020742272,"teacher_disagreement_score":0.637665,"about_ca_system_score_codex":0.000045824905,"about_ca_system_score_gemma":0.000021238237,"threshold_uncertainty_score":0.9998985},"labels":[],"label_agreement":null},{"id":"W4302994826","doi":"10.1007/978-1-4939-7131-2_100666","title":"Mining Social Media Data","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Social media; Data science; Computer science; World Wide Web","score_opus":0.07676596322715966,"score_gpt":0.30124303027859456,"score_spread":0.2244770670514349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302994826","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020010915,0.000030180876,0.00462039,0.000048567672,0.00008835409,0.00006446127,0.00015144423,0.00012063517,0.99485594],"genre_scores_gemma":[0.0155952675,0.000005583375,0.009066772,0.00007536727,0.014307026,0.0000060052575,0.005693515,0.000111165085,0.9551393],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989149,0.0000074792783,0.00025942962,0.00044135435,0.00020027974,0.00017655847],"domain_scores_gemma":[0.99878556,0.000086098065,0.0001784971,0.0008396121,0.00006474527,0.000045496952],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001302514,0.00024680924,0.00037163484,0.00007525519,0.00010270282,0.00005446146,0.0007739487,0.00010317043,0.059974693],"category_scores_gemma":[0.0000018908239,0.00023511969,0.00014526739,0.000021119928,0.00009724147,0.00006564556,0.0007950999,0.00017911194,0.00041411363],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014549963,0.0000056393847,0.000025921394,0.0000017090553,0.00020703266,7.174161e-7,0.00009740572,1.7784314e-8,0.0000010410079,0.29855904,0.65567863,0.0454214],"study_design_scores_gemma":[0.000051100556,0.0000050990966,0.0000062316158,0.000024843735,0.00017588257,1.24311e-7,0.00003301459,0.00018193638,0.000008569361,0.1296649,0.86956036,0.00028792745],"about_ca_topic_score_codex":0.00002091881,"about_ca_topic_score_gemma":0.000077162775,"teacher_disagreement_score":0.21388173,"about_ca_system_score_codex":0.000013882218,"about_ca_system_score_gemma":0.000043998065,"threshold_uncertainty_score":0.9587903},"labels":[],"label_agreement":null},{"id":"W4306317001","doi":"10.1145/3511808.3557529","title":"SEERa: A Framework for Community Prediction","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information &amp; Knowledge Management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science","score_opus":0.05973768506499032,"score_gpt":0.32152476974497834,"score_spread":0.261787084679988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306317001","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06561154,0.000007842567,0.100449316,0.0026495478,0.0011911244,0.0018750896,0.00045722513,0.00021394755,0.82754433],"genre_scores_gemma":[0.9889442,0.0000037538152,0.007905508,0.000117217256,0.00012242615,0.0007792645,0.0002448336,0.0000091662305,0.0018736768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885356,0.000023099183,0.00045559724,0.00011469141,0.0004045917,0.00014844998],"domain_scores_gemma":[0.9984981,0.00007604139,0.0004843037,0.00029088062,0.00062116067,0.00002953791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006172297,0.00014799855,0.00015057262,0.0002433148,0.0005615407,0.00014333162,0.0015162927,0.000023283163,0.00071466976],"category_scores_gemma":[0.00006390405,0.00013339313,0.00016963722,0.00030928012,0.00004475588,0.0004034192,0.0013812337,0.00038699355,0.000028546889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000631025,0.00018980521,0.0026233182,0.00005817962,0.00020249182,2.2340803e-9,0.0016269124,0.00016712377,0.000031541156,0.96393126,0.021262538,0.009843716],"study_design_scores_gemma":[0.00067369617,0.00010162988,0.002951357,0.00018401856,0.00011225195,6.370142e-7,0.006855366,0.010121207,0.00035477185,0.5679298,0.41044652,0.00026873642],"about_ca_topic_score_codex":0.000019643845,"about_ca_topic_score_gemma":0.00000303959,"teacher_disagreement_score":0.92333263,"about_ca_system_score_codex":0.00017264509,"about_ca_system_score_gemma":0.000020679125,"threshold_uncertainty_score":0.78251326},"labels":[],"label_agreement":null},{"id":"W4306317391","doi":"10.1145/3511808.3557572","title":"CS-MLGCN: Multiplex Graph Convolutional Networks for Community Search in Multiplex Networks","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information &amp; Knowledge Management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Graph; Embedding; Theoretical computer science; Data mining; Artificial intelligence","score_opus":0.06545522068589847,"score_gpt":0.3190323919863216,"score_spread":0.2535771713004231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306317391","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26884314,0.00007536358,0.23681729,0.0031282362,0.0022216858,0.0068973205,0.0005371604,0.0003712265,0.48110858],"genre_scores_gemma":[0.99485797,0.000013584837,0.0023008615,0.00012418005,0.00014232533,0.00092084514,0.0005895734,0.00001557751,0.0010350809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980693,0.0000682845,0.0007728967,0.00020847817,0.00054191326,0.00033911256],"domain_scores_gemma":[0.99806213,0.00017988986,0.00050952693,0.00035623132,0.00083617936,0.000056052882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012845225,0.00025106923,0.00027295822,0.00050596136,0.0006118739,0.00017201754,0.0021410296,0.000044465945,0.0005722326],"category_scores_gemma":[0.000053134565,0.000237973,0.00025553655,0.0006410531,0.000120243276,0.0004884071,0.0021099693,0.00070982805,0.000014375977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037639635,0.0007489483,0.040545765,0.000109034445,0.00044706135,3.533912e-8,0.0020751166,0.07975708,0.000044874647,0.8354535,0.022599237,0.017842932],"study_design_scores_gemma":[0.0026861061,0.00011049098,0.025241712,0.00023743401,0.0000806457,0.0000012066238,0.006910369,0.8485467,0.00008208704,0.03551621,0.07998988,0.0005971566],"about_ca_topic_score_codex":0.00016308507,"about_ca_topic_score_gemma":0.00007761661,"teacher_disagreement_score":0.7999373,"about_ca_system_score_codex":0.0002932643,"about_ca_system_score_gemma":0.00003672539,"threshold_uncertainty_score":0.9704257},"labels":[],"label_agreement":null},{"id":"W4307210240","doi":"10.1002/cjs.11735","title":"Asymptotic theory in bipartite graph models with a growing number of parameters","year":2022,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Guizhou Normal University; National Natural Science Foundation of China","keywords":"Bipartite graph; Poisson distribution; Degree (music); Mathematics; Consistency (knowledge bases); Estimator; Moment (physics); Asymptotic distribution; Popularity; Infinity; Set (abstract data type); Class (philosophy); Measure (data warehouse); Graph; Applied mathematics; Discrete mathematics; Computer science; Statistics; Artificial intelligence; Mathematical analysis; Data mining","score_opus":0.01318720182377934,"score_gpt":0.22452834831980362,"score_spread":0.21134114649602428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307210240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5279081,0.000070758724,0.47010005,0.000045527726,0.0000566106,0.000082428596,0.0002783424,0.0000029306386,0.001455286],"genre_scores_gemma":[0.9712242,0.0000013274476,0.028668454,0.000038967002,0.00002000753,0.0000044216663,0.000010335695,0.00001352193,0.000018771243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990942,0.000119071,0.00034603296,0.00007575151,0.00016156437,0.00020341713],"domain_scores_gemma":[0.99922854,0.00012984582,0.00026379537,0.00011434394,0.00009266,0.0001708015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003543831,0.00008571146,0.00023798828,0.0002540728,0.00007992559,0.000019401801,0.00018149291,0.000008673947,0.00061584753],"category_scores_gemma":[0.0000064850005,0.000082990795,0.000062224375,0.00036389037,0.00007485319,0.00010210678,0.000014896968,0.0002429927,4.5067193e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049222766,0.00005808853,0.2042901,0.00001221471,0.00030781527,0.00016440207,0.0013619008,0.10544329,0.000024366022,0.6791236,0.0018591608,0.007305838],"study_design_scores_gemma":[0.0007190426,0.00026559256,0.002975291,0.00011273431,0.00023473547,0.000051950778,0.002665659,0.01681155,0.000164438,0.97510785,0.00057931937,0.0003118234],"about_ca_topic_score_codex":0.004744173,"about_ca_topic_score_gemma":0.002575828,"teacher_disagreement_score":0.4433161,"about_ca_system_score_codex":0.00008260147,"about_ca_system_score_gemma":0.00046114408,"threshold_uncertainty_score":0.7171802},"labels":[],"label_agreement":null},{"id":"W4309259885","doi":"10.1142/s0219525922500102","title":"BENCHMARKING THE INFLUENTIAL NODES IN COMPLEX NETWORKS","year":2022,"lang":"en","type":"article","venue":"Advances in Complex Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Benchmarking; Heuristics; Benchmark (surveying); Computer science; Set (abstract data type); Variety (cybernetics); Resilience (materials science); Complex network; Machine learning; Data mining; Artificial intelligence; Marketing","score_opus":0.016738183666595463,"score_gpt":0.28702449483253323,"score_spread":0.27028631116593776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309259885","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5233835,0.02306752,0.33005065,0.00067991606,0.0036467905,0.005959418,0.00024762476,0.0007267881,0.11223781],"genre_scores_gemma":[0.9979998,0.000023044624,0.0004428819,0.00008713658,0.0006728416,0.0005083124,0.00018663895,0.000027672791,0.00005165932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973626,0.0005543497,0.0007423911,0.00043446076,0.00038270527,0.0005234674],"domain_scores_gemma":[0.9987649,0.00030491783,0.00030861027,0.0005421254,0.000036927624,0.000042567186],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077605766,0.0002508166,0.0004857758,0.00019652607,0.00044994874,0.00010689412,0.00080497406,0.000022598211,0.00097404903],"category_scores_gemma":[0.000003528999,0.00022363236,0.00014046837,0.0010374689,0.00010665702,0.00022340233,0.00054475566,0.0005204586,0.0000042250776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021633628,0.00009882815,0.24961077,0.000012346233,0.000032252647,0.0000056010063,0.00020501239,0.69939226,0.00004879759,0.033863187,0.0017095864,0.014999738],"study_design_scores_gemma":[0.00052979734,0.00004483425,0.028263997,0.000042494754,0.000016698325,0.0000051126776,0.0012829452,0.68806326,0.0000026900855,0.004531268,0.276848,0.00036893014],"about_ca_topic_score_codex":0.0019905947,"about_ca_topic_score_gemma":0.0004979619,"teacher_disagreement_score":0.47461632,"about_ca_system_score_codex":0.00016522428,"about_ca_system_score_gemma":0.000025298932,"threshold_uncertainty_score":0.9999392},"labels":[],"label_agreement":null},{"id":"W4309269440","doi":"10.54097/hset.v16i.2628","title":"Graph Generation and Diffusion using Random Walks","year":2022,"lang":"en","type":"article","venue":"Highlights in Science Engineering and Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Random graph; Random walk; Computer science; Block graph; Network topology; Random geometric graph; Graph; Line graph; Mathematics; Discrete mathematics; Theoretical computer science; Voltage graph; Pathwidth; Statistics","score_opus":0.008153674208542237,"score_gpt":0.22444063420890037,"score_spread":0.21628696000035813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309269440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9813596,0.00015143162,0.018008526,0.00017182993,0.00007679416,0.00007640744,0.0000014316472,0.000089992966,0.00006399747],"genre_scores_gemma":[0.9963073,0.000015391339,0.0035910336,0.0000034156756,0.000038896324,0.00002732159,0.0000017426596,0.000005205474,0.000009650926],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993232,0.00000942057,0.00012309042,0.00025050156,0.000112043825,0.00018174987],"domain_scores_gemma":[0.9997711,0.000015195134,0.000032128577,0.00013897191,0.000016468326,0.000026111076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024446062,0.00008045152,0.00012623564,0.00071038405,0.00031716647,0.000030356872,0.00013815578,0.000019770387,0.000011660027],"category_scores_gemma":[0.0000047016733,0.00007593182,0.000012733391,0.0012139131,0.00013612978,0.000078916026,0.00025080546,0.00013729907,3.1410423e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004136986,0.00005100097,0.014756521,0.0000035107014,0.000010546449,0.0000050033677,0.00020720891,0.014287885,0.49190184,0.46896514,0.00004284088,0.009764335],"study_design_scores_gemma":[0.00056097424,0.00004880598,0.0008600944,0.000012134778,0.000013699934,0.0000136931885,0.00012750688,0.966507,0.017708711,0.008387136,0.0055155535,0.00024468274],"about_ca_topic_score_codex":0.00006845716,"about_ca_topic_score_gemma":0.0000031775212,"teacher_disagreement_score":0.9522191,"about_ca_system_score_codex":0.000029546942,"about_ca_system_score_gemma":0.000015050695,"threshold_uncertainty_score":0.30964097},"labels":[],"label_agreement":null},{"id":"W4309985245","doi":"10.5281/zenodo.7362926","title":"LIVE*** 2022 57th Vanier Cup LIVE BROADCAST TV","year":2022,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Telecommunications; Computer science","score_opus":0.022245473972343232,"score_gpt":0.24430003393682218,"score_spread":0.22205455996447895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309985245","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14334793,0.00047047468,0.031087413,0.0014314158,0.00036850164,0.0018573748,0.0015888588,0.0034899085,0.81635815],"genre_scores_gemma":[0.9919014,0.000016840926,0.00028284788,0.00011807386,0.0003523218,3.3508817e-7,0.0024425355,0.0010416919,0.0038439548],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791443,0.00047711175,0.0002638521,0.00047170685,0.00046670294,0.0004061729],"domain_scores_gemma":[0.99882793,0.000026876694,0.00014577308,0.0005697882,0.00028297148,0.00014665106],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005628721,0.0001704988,0.0001913313,0.0002137808,0.0034841453,0.00044891692,0.0011635001,0.000020213622,0.28677103],"category_scores_gemma":[0.00003386895,0.00019836234,0.00012961809,0.0007270209,0.000091879636,0.00016976554,0.0029718524,0.00048527817,0.0057195127],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059273327,0.00044558686,0.00017439834,0.000012883445,0.00019798505,0.0000143682255,0.0026495196,0.00047536605,0.0014949999,0.024379168,0.7676528,0.20244361],"study_design_scores_gemma":[0.00026824963,0.00018539996,0.000279084,0.000006495063,0.000030257506,0.000016299207,0.0013913707,0.0016366949,0.00011091529,0.0015971664,0.9942553,0.00022273637],"about_ca_topic_score_codex":0.00014968474,"about_ca_topic_score_gemma":2.99309e-7,"teacher_disagreement_score":0.8485535,"about_ca_system_score_codex":0.0001642299,"about_ca_system_score_gemma":0.000005706397,"threshold_uncertainty_score":0.99781317},"labels":[],"label_agreement":null},{"id":"W4309985653","doi":"10.5281/zenodo.7362921","title":"[[LIVE!FREE]] Laval Rouge et Or vs Saskatchewan Huskies Live Free Streaming","year":2022,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"ROUGE; Art; Computer science","score_opus":0.02425638602268276,"score_gpt":0.25296385754749406,"score_spread":0.2287074715248113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309985653","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36682767,0.000354751,0.068780705,0.0064791455,0.0004930439,0.0033712108,0.0069990503,0.007878268,0.53881615],"genre_scores_gemma":[0.9894477,0.000013612606,0.0016536372,0.00014695307,0.00029640956,4.641518e-7,0.0022346696,0.001059286,0.0051472704],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977097,0.00058273255,0.00030102945,0.00047781022,0.0005046801,0.00042403053],"domain_scores_gemma":[0.9984465,0.00005309322,0.00017045121,0.00093602465,0.0002561249,0.00013777026],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006603501,0.00020302812,0.000238454,0.00019847826,0.0026695095,0.0005823166,0.001903367,0.00002580416,0.07557042],"category_scores_gemma":[0.00010586235,0.00021197011,0.0001243787,0.0006019095,0.000108233195,0.00023191415,0.0053167325,0.00047758236,0.0010297345],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023882753,0.00055226195,0.00028139885,0.000032021107,0.00032402296,0.000030707328,0.010485168,0.0005339531,0.0011243715,0.020388598,0.87592185,0.090086795],"study_design_scores_gemma":[0.0006905539,0.00042674053,0.0007767421,0.000021580025,0.000054380947,0.000019886897,0.008870599,0.0015533491,0.0003019908,0.003128182,0.9838069,0.00034909736],"about_ca_topic_score_codex":0.0006044559,"about_ca_topic_score_gemma":0.000019928933,"teacher_disagreement_score":0.62262005,"about_ca_system_score_codex":0.00015124968,"about_ca_system_score_gemma":0.000016553658,"threshold_uncertainty_score":0.99974805},"labels":[],"label_agreement":null},{"id":"W4310220416","doi":"10.1093/comnet/cnac054","title":"Controllability of a class of swarm signalling networks","year":2022,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"China Scholarship Council","keywords":"Controllability; Degree (music); Computer science; Class (philosophy); Fraction (chemistry); Degree distribution; Swarm behaviour; Complex network; Modal; Distribution (mathematics); Mathematical optimization; Topology (electrical circuits); Mathematics; Applied mathematics; Artificial intelligence; Combinatorics; Physics; Mathematical analysis","score_opus":0.015717435576237556,"score_gpt":0.25922754359335876,"score_spread":0.2435101080171212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310220416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22852078,0.0012890126,0.7672017,0.00014822377,0.000306422,0.0003037562,0.000022354596,0.000023412063,0.0021843219],"genre_scores_gemma":[0.9967557,0.0000149867265,0.002239074,0.00005634527,0.0008479701,0.0000105245945,0.000018292396,0.000028241204,0.00002884807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660414,0.0004813457,0.0017450018,0.00020012925,0.00060128537,0.00036810976],"domain_scores_gemma":[0.9958138,0.00059953245,0.0025094547,0.00039140906,0.00056075916,0.00012507135],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017300417,0.00023682612,0.0011690593,0.00020606097,0.00017601326,0.00002335858,0.0007382785,0.000047875663,0.0014611593],"category_scores_gemma":[0.000012479071,0.00022693496,0.0008272561,0.0007413282,0.00014994346,0.00010224998,0.00030142668,0.00082081516,2.2470182e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033083925,0.00038410418,0.027232392,0.000010287245,0.0004727568,0.0000036017132,0.00007824092,0.955147,0.0005982165,0.0047706794,0.0043075355,0.0066643446],"study_design_scores_gemma":[0.0016290541,0.0007182,0.0047022365,0.00006331614,0.0003942478,0.000014220859,0.0003711555,0.970955,0.0003059368,0.010916466,0.00962912,0.00030102636],"about_ca_topic_score_codex":0.00006617146,"about_ca_topic_score_gemma":0.0000054733564,"teacher_disagreement_score":0.7682349,"about_ca_system_score_codex":0.00008176693,"about_ca_system_score_gemma":0.000111978356,"threshold_uncertainty_score":0.99945164},"labels":[],"label_agreement":null},{"id":"W4310276756","doi":"10.1007/s10115-022-01792-4","title":"DNETC: dynamic network embedding preserving both triadic closure evolution and community structures","year":2022,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Sichuan Province Science and Technology Support Program; National Natural Science Foundation of China","keywords":"Computer science; Embedding; Closure (psychology); Dynamic network analysis; Focus (optics); Theoretical computer science; Social network (sociolinguistics); Artificial intelligence; Algorithm; Topology (electrical circuits); Mathematics","score_opus":0.0101272855086007,"score_gpt":0.2636848183653573,"score_spread":0.2535575328567566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310276756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88450736,0.005339028,0.06252137,0.000034232326,0.00062837097,0.0010421188,0.00009816674,0.0002688195,0.045560565],"genre_scores_gemma":[0.9992148,0.000010774263,0.00010426508,0.000010713432,0.00018420411,0.000090373054,0.00020914998,0.000008003334,0.0001676961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867475,0.00049369066,0.00041454664,0.00008833183,0.00013764201,0.00019104402],"domain_scores_gemma":[0.9992681,0.00011240504,0.00025069862,0.00024313135,0.000068006724,0.000057650697],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009189199,0.00013671047,0.00023675608,0.00013361289,0.0013563087,0.00017972372,0.00016563735,0.000030642655,0.00007265012],"category_scores_gemma":[0.0000065864633,0.00013519992,0.00005148439,0.00030488966,0.000029067081,0.0008271933,0.00035688665,0.0003996407,0.000003054316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017645351,0.00023875438,0.27924943,0.0010930046,0.0009572668,5.898127e-7,0.038642634,0.08806117,0.00012433152,0.41617808,0.0922626,0.08301569],"study_design_scores_gemma":[0.00086359924,0.00014587482,0.023470316,0.00009487736,0.000091759364,0.000011562044,0.010731151,0.768951,0.0000040635778,0.007873772,0.18735786,0.00040415276],"about_ca_topic_score_codex":0.00046846332,"about_ca_topic_score_gemma":0.000023071341,"teacher_disagreement_score":0.68088984,"about_ca_system_score_codex":0.0000808317,"about_ca_system_score_gemma":0.000032806038,"threshold_uncertainty_score":0.9999438},"labels":[],"label_agreement":null},{"id":"W4310448352","doi":"10.1109/tcss.2022.3219608","title":"Guest Editorial Special Issue on Advanced Cognitive Computing for Data-Driven Computational Social Systems","year":2022,"lang":"en","type":"editorial","venue":"IEEE Transactions on Computational Social Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Data science; Cognitive computing; Cognition; Cognitive science; Psychology; Neuroscience","score_opus":0.0232310697476242,"score_gpt":0.3267943721942665,"score_spread":0.3035633024466423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310448352","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004611375,0.000016215474,0.37373284,0.00005122746,0.6032938,0.0017383365,0.020119132,0.00023066023,0.0007717007],"genre_scores_gemma":[0.07090881,0.0000016278598,0.0004417819,0.000019061505,0.89553297,0.00078763906,0.031583797,0.0002029645,0.00052138563],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99178416,0.0008181122,0.0016585464,0.0016948408,0.0032529857,0.0007913556],"domain_scores_gemma":[0.9908778,0.005399539,0.0015296815,0.00036737847,0.0016509817,0.00017459643],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009159961,0.0009944196,0.0016990717,0.00048236363,0.0038360201,0.00066024077,0.0011785419,0.0006860656,0.00030451908],"category_scores_gemma":[0.00003025589,0.0012205342,0.0008168039,0.0006862459,0.00021632892,0.0003031655,0.000046888777,0.002030261,0.000089499765],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033306374,0.00044351383,0.000001973036,0.0000917854,0.00097398803,0.0000019610711,0.00033960113,0.3688413,4.3876105e-7,0.0009778426,0.6251741,0.0028204436],"study_design_scores_gemma":[0.002672513,0.0003454927,0.000006057452,0.00022345141,0.0006242848,8.687742e-7,0.000893817,0.17103617,0.0000013166787,0.000648566,0.8224679,0.0010795656],"about_ca_topic_score_codex":0.00079352723,"about_ca_topic_score_gemma":0.00002774108,"teacher_disagreement_score":0.37329105,"about_ca_system_score_codex":0.0009981309,"about_ca_system_score_gemma":0.0010160551,"threshold_uncertainty_score":0.99902445},"labels":[],"label_agreement":null},{"id":"W4311491436","doi":"10.1145/3572408","title":"sGrow: Explaining the Scale-Invariant Strength Assortativity of Streaming Butterflies","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on the Web","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Burstiness; Computer science; Assortativity; Theoretical computer science; Complex network; Network packet","score_opus":0.017797554072511233,"score_gpt":0.25027783330305714,"score_spread":0.2324802792305459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311491436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90019614,0.000029294344,0.09413231,0.0026018778,0.000089313864,0.00026727762,0.00023454768,0.00008823347,0.0023609886],"genre_scores_gemma":[0.99872744,0.000004760902,0.0007569646,0.000062108615,0.00004941335,0.00017396674,0.000010287457,0.000015325673,0.0001997549],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988761,0.00028303452,0.00022800546,0.00017874001,0.00025472965,0.00017940265],"domain_scores_gemma":[0.99807614,0.0009945353,0.00014570239,0.0007327467,0.000027986018,0.00002286163],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045512078,0.00013053825,0.00017357168,0.00006825855,0.0008766577,0.00003104407,0.00058676716,0.000011967917,0.0015934858],"category_scores_gemma":[0.000007054425,0.000086623535,0.00020010516,0.0003726986,0.00007821412,0.00006014388,0.00003538562,0.00040565897,0.0000037606394],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027914197,0.0035960698,0.04173066,0.000036335296,0.0039380463,0.0000070462356,0.01811708,0.07770017,0.0319201,0.097724475,0.006262446,0.7186884],"study_design_scores_gemma":[0.0037811042,0.0022077663,0.042099632,0.0005357021,0.0041487045,0.00002925519,0.16112085,0.19692697,0.30242825,0.22189826,0.060916647,0.0039068647],"about_ca_topic_score_codex":0.000327248,"about_ca_topic_score_gemma":0.000100573554,"teacher_disagreement_score":0.7147816,"about_ca_system_score_codex":0.000028610475,"about_ca_system_score_gemma":0.000038426067,"threshold_uncertainty_score":0.9993192},"labels":[],"label_agreement":null},{"id":"W4312051729","doi":"10.1093/comnet/cnac050","title":"Modularity of the ABCD random graph model with community structure","year":2022,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Community structure; Modularity (biology); Random graph; Computer science; Clique percolation method; Graph; Theoretical computer science; Algorithm; Mathematics; Combinatorics","score_opus":0.015242635359691042,"score_gpt":0.23832019864301532,"score_spread":0.2230775632833243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312051729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54389113,0.00013483835,0.45454735,0.00015279613,0.00009118081,0.00019610317,0.00004376808,0.000013239163,0.00092961127],"genre_scores_gemma":[0.9963419,0.0000024790131,0.0032712438,0.00010185788,0.00020538532,0.000004828539,0.000017984708,0.000020072834,0.000034235287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978622,0.0007138754,0.0005928187,0.000094296796,0.0005147574,0.00022202852],"domain_scores_gemma":[0.9978842,0.00015870508,0.0010558558,0.0005861685,0.00024751975,0.000067544905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007367821,0.00018293074,0.00055843155,0.00009694878,0.00067377667,0.00003142533,0.0010393895,0.00002732391,0.00036105327],"category_scores_gemma":[0.0000028400837,0.00012023001,0.00044187345,0.00056811195,0.0001476464,0.000089143556,0.00040553696,0.0016752863,4.1034507e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023899418,0.00016333094,0.017723532,0.0000045360284,0.0003181302,8.2654e-7,0.0001856656,0.97172326,0.00021476703,0.0035992379,0.0043993895,0.0014283289],"study_design_scores_gemma":[0.002128633,0.00023745076,0.012275535,0.000051140494,0.00032835372,0.000032865995,0.00038584007,0.8825423,0.00011561108,0.10034564,0.0013218538,0.00023473891],"about_ca_topic_score_codex":0.0001590295,"about_ca_topic_score_gemma":0.000045094537,"teacher_disagreement_score":0.45245078,"about_ca_system_score_codex":0.00004360664,"about_ca_system_score_gemma":0.00008583611,"threshold_uncertainty_score":0.72783786},"labels":[],"label_agreement":null},{"id":"W4313343015","doi":"10.1007/978-3-031-22105-7_38","title":"An Evolving Network Model from Clique Extension","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Frustum; Clique; Computer science; Extension (predicate logic); Set (abstract data type); Clique problem; Theoretical computer science; Graph; Mathematics; Combinatorics; Chordal graph; Geometry","score_opus":0.015913068523936768,"score_gpt":0.2610833883358573,"score_spread":0.24517031981192056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000523037,0.00026486508,0.99286914,0.000075316326,0.00033754003,0.0002368533,0.000020487792,0.00013810988,0.005534635],"genre_scores_gemma":[0.6955909,0.000010722432,0.30181327,0.00048244404,0.0017904713,0.000015574871,0.00012227318,0.000054693886,0.00011962585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710274,0.000049235827,0.00043122002,0.0013012419,0.00059903495,0.0005165413],"domain_scores_gemma":[0.9979066,0.00024645726,0.0002742149,0.0012937412,0.00014965059,0.00012931626],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005582072,0.00043823902,0.0005452238,0.00027460326,0.0004207516,0.00026364232,0.0014266854,0.00012115014,0.0010305501],"category_scores_gemma":[0.0000054617867,0.00044089463,0.00019536055,0.00034261693,0.00023575727,0.00033585055,0.0009602503,0.0009980969,0.0000069959888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043874697,0.000022680488,0.00040734987,0.0000016660367,0.000016194646,0.0000067773503,0.00011825099,0.7729059,0.00009036281,0.013239863,0.00014591085,0.21304065],"study_design_scores_gemma":[0.00004357168,0.00003415448,0.00006686938,0.00007027529,0.000016571475,5.23698e-7,9.6471936e-8,0.60506994,0.000048036956,0.39375964,0.0005952312,0.0002950867],"about_ca_topic_score_codex":0.00029451156,"about_ca_topic_score_gemma":0.000090982794,"teacher_disagreement_score":0.6950679,"about_ca_system_score_codex":0.00019031952,"about_ca_system_score_gemma":0.00026081532,"threshold_uncertainty_score":0.99988264},"labels":[],"label_agreement":null},{"id":"W4313427655","doi":"10.3390/a16010022","title":"Stochastic Local Community Detection in Networks","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Vertex (graph theory); Computer science; Theoretical computer science; Local community; Binary number; Algorithm; Mathematics; Graph","score_opus":0.017022459714544733,"score_gpt":0.2738733043787054,"score_spread":0.25685084466416064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313427655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09911753,0.00001317892,0.8996887,0.00002246658,0.00008163308,0.00010663047,0.0000024658502,0.00020925372,0.00075812516],"genre_scores_gemma":[0.999303,0.0000012513536,0.00025392408,0.000012801364,0.00021748828,0.00005167083,0.000053617205,0.000015091638,0.00009114285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992322,0.00012872196,0.0001726342,0.0001237398,0.00009219109,0.00025056236],"domain_scores_gemma":[0.9994869,0.00013778065,0.000042275264,0.00026694508,0.00002466903,0.00004139365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034579568,0.00010293762,0.00016061465,0.0001354731,0.00014514792,0.000024119778,0.00016340837,0.000034523695,0.000080505524],"category_scores_gemma":[0.0000030931797,0.0001084766,0.00007104108,0.0008830531,0.00004562282,0.000058001457,0.00011649527,0.00041557814,0.00006203665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006159152,0.000086138294,0.0029779163,0.0000021940073,0.000044068838,0.0000036166844,0.00018570384,0.11197515,0.000038185288,0.00054542127,0.0005063921,0.8836291],"study_design_scores_gemma":[0.00016938966,0.000029182964,0.009605392,0.00001465799,0.000013244768,5.8734116e-7,0.00038105107,0.97958463,0.00012535597,0.009741819,0.00020291147,0.0001317916],"about_ca_topic_score_codex":0.002376955,"about_ca_topic_score_gemma":0.00033543352,"teacher_disagreement_score":0.90018547,"about_ca_system_score_codex":0.000036141064,"about_ca_system_score_gemma":0.000008937284,"threshold_uncertainty_score":0.4423547},"labels":[],"label_agreement":null},{"id":"W4313445979","doi":"10.1007/978-3-031-04394-9_69","title":"Social Network Analysis","year":2023,"lang":"en","type":"book-chapter","venue":"Springer texts in education","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Sociometry; Social network analysis; Sociology; Publishing; Social science; Psychology; Social psychology; Political science; Social capital; Law","score_opus":0.017219373510878197,"score_gpt":0.2993565285534395,"score_spread":0.2821371550425613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313445979","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009820082,0.0002636163,0.0011906154,0.00022802358,0.00057285465,0.00034487687,0.000012845385,0.0002210911,0.99618405],"genre_scores_gemma":[0.3627019,0.0000354639,0.0009452672,0.000053170286,0.0062214346,0.000118199656,0.000735253,0.00011578241,0.6290735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857295,0.00002425554,0.00043868655,0.0004628752,0.00021955323,0.0002816622],"domain_scores_gemma":[0.99909276,0.000041782503,0.00031531358,0.00042098304,0.00008266788,0.00004647987],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024445643,0.00028594627,0.000514853,0.0006404257,0.00011606588,0.00006459132,0.00026803772,0.00015037513,0.0015379393],"category_scores_gemma":[0.000002138824,0.00033794472,0.00046483087,0.00054173946,0.000042335945,0.00005221962,0.00012144671,0.00040641296,0.0002496597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034654627,0.00006909502,0.016958686,0.000011753619,0.0009720052,6.113763e-7,0.00020881458,0.0004784066,0.0000014168673,0.79883194,0.038165033,0.14429878],"study_design_scores_gemma":[0.000065504086,0.000007180734,0.016737973,0.00010697432,0.0013170185,5.8580486e-8,0.000036621896,0.00026621026,0.000004013555,0.7375642,0.24330199,0.000592276],"about_ca_topic_score_codex":0.0001998146,"about_ca_topic_score_gemma":0.00025733208,"teacher_disagreement_score":0.36711055,"about_ca_system_score_codex":0.00014669592,"about_ca_system_score_gemma":0.000179179,"threshold_uncertainty_score":0.99990726},"labels":[],"label_agreement":null},{"id":"W4313889524","doi":"10.1186/s13634-022-00960-6","title":"Autoregressive graph Volterra models and applications","year":2023,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Identifiability; Computer science; Autoregressive model; Graph; Theoretical computer science; Volterra series; Identification (biology); Artificial intelligence; Machine learning; Nonlinear system; Mathematics; Econometrics","score_opus":0.020709863382114346,"score_gpt":0.3212073614156174,"score_spread":0.30049749803350306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313889524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021913119,0.0051969653,0.95808506,0.00022314132,0.000054691394,0.0002686306,0.0000071672353,0.00019249828,0.014058711],"genre_scores_gemma":[0.99749386,0.00023437358,0.0016018588,0.000050611277,0.00045164008,0.000051134983,0.0000069914868,0.000021498932,0.00008803936],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988479,0.00005340355,0.0003364345,0.00024880626,0.00023485508,0.00027860634],"domain_scores_gemma":[0.9993697,0.000089288624,0.00026465493,0.000101078294,0.000081224556,0.000094083254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002714099,0.00016544377,0.00022045986,0.0003460631,0.00034452855,0.00015983367,0.00019755389,0.000023752851,0.000048873862],"category_scores_gemma":[0.0000025239208,0.00014285934,0.0000730854,0.0006678152,0.000085593376,0.0007429231,0.00005093512,0.00040985277,0.0000076841725],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002196511,0.00006481519,0.00644077,0.00002024406,0.000018818193,0.000014053819,0.0002647141,0.04400498,0.00018510222,0.009400425,0.00022167934,0.93934244],"study_design_scores_gemma":[0.0005238051,0.00008943728,0.0012246014,0.0005529086,0.00003414786,0.000020543124,0.00062847685,0.19142012,0.00041299904,0.7929629,0.011702305,0.00042771283],"about_ca_topic_score_codex":0.0000018687467,"about_ca_topic_score_gemma":0.0000015825719,"teacher_disagreement_score":0.97558075,"about_ca_system_score_codex":0.000028472905,"about_ca_system_score_gemma":0.000037997725,"threshold_uncertainty_score":0.5825635},"labels":[],"label_agreement":null},{"id":"W4315435069","doi":"10.1371/journal.pone.0280277","title":"On the effectiveness of random walks for modeling epidemics on networks","year":2023,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Gruppo Nazionale per il Calcolo Scientifico; Natural Sciences and Engineering Research Council of Canada; Università di Pisa; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Random walk; Centrality; PageRank; Markov chain; Computer science; Ranking (information retrieval); Node (physics); Simple random sample; Simple (philosophy); Markov chain Monte Carlo; Theoretical computer science; Statistics; Artificial intelligence; Mathematics; Machine learning; Physics; Bayesian probability; Medicine","score_opus":0.058414294264333824,"score_gpt":0.2725349739513624,"score_spread":0.21412067968702858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315435069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.783497,0.0000142901845,0.21428473,0.00009817279,0.000017012033,0.0006887262,0.000012406722,0.00008547884,0.0013022043],"genre_scores_gemma":[0.99901295,0.000007297618,0.00034409302,0.000031546322,0.000195164,0.00030328237,0.000050291466,0.000022074244,0.000033306518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991218,0.00018624446,0.00019286873,0.00017054059,0.00014201993,0.00018653153],"domain_scores_gemma":[0.99585897,0.0036701467,0.00007562649,0.00029961948,0.000072594594,0.000023054401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011906791,0.00010770319,0.00032827538,0.00005526083,0.00009216836,0.000011741587,0.00016450507,0.000029068508,0.000023707496],"category_scores_gemma":[0.00006268694,0.000077936944,0.00017191078,0.00024510722,0.000018224342,0.000018096895,0.000042125142,0.00014124073,0.0000075436596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012482732,0.0009375442,0.003783474,0.00009850721,0.0013997711,2.6310983e-7,0.00006427309,0.7564168,0.0026517056,0.22870113,0.0008208987,0.0038773362],"study_design_scores_gemma":[0.00045448783,0.00007165699,0.00009543758,0.00029994882,0.00011548939,4.498585e-9,0.000010117119,0.9049583,0.0056096967,0.088301055,0.0000060291736,0.00007774818],"about_ca_topic_score_codex":0.000033704284,"about_ca_topic_score_gemma":0.0000010409699,"teacher_disagreement_score":0.21551597,"about_ca_system_score_codex":0.000014958106,"about_ca_system_score_gemma":0.000008180318,"threshold_uncertainty_score":0.31781763},"labels":[],"label_agreement":null},{"id":"W4316810597","doi":"10.21203/rs.3.rs-2471638/v1","title":"Artificial Benchmark for Community Detection with Outliers (ABCD+o)","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Outlier; Benchmark (surveying); Community structure; Graph; Computer science; Artificial intelligence; Mathematics; Statistics; Theoretical computer science; Geography; Cartography","score_opus":0.14464540961809963,"score_gpt":0.42568849554567256,"score_spread":0.28104308592757293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316810597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6579701,0.00007372535,0.32520851,0.000594005,0.00035602867,0.006264173,0.00091137434,0.0009641608,0.007657914],"genre_scores_gemma":[0.9944303,0.0000054391994,0.0011608899,0.0000037516359,0.0008944922,0.0017712199,0.0010963634,0.000082288156,0.0005552274],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969298,0.0008486728,0.0003453819,0.000491166,0.0007035286,0.00068140414],"domain_scores_gemma":[0.9968628,0.00090667146,0.00014443007,0.0011982288,0.0007447268,0.00014313337],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0028399366,0.00027649716,0.00042908176,0.0005064551,0.0010431507,0.0002894734,0.0006748608,0.00016343246,0.00015981647],"category_scores_gemma":[0.00006722032,0.0002565141,0.00031906832,0.0006792672,0.00019701224,0.00005621715,0.0010769855,0.0027664239,0.000039042978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002231894,0.0029601795,0.10142092,0.0040749814,0.0048386385,0.00002217107,0.007063823,0.017754564,0.0035132042,0.030378975,0.07042682,0.7553138],"study_design_scores_gemma":[0.0007443578,0.0018365056,0.020100024,0.0019363078,0.00036427152,8.182294e-7,0.010675124,0.04988466,0.01934568,0.8731922,0.020034507,0.0018855772],"about_ca_topic_score_codex":0.0059261685,"about_ca_topic_score_gemma":0.0024592811,"teacher_disagreement_score":0.8428132,"about_ca_system_score_codex":0.00020913809,"about_ca_system_score_gemma":0.00023704409,"threshold_uncertainty_score":0.99998873},"labels":[],"label_agreement":null},{"id":"W4317767745","doi":"10.14778/3570690.3570700","title":"FirmTruss Community Search in Multilayer Networks","year":2022,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Community structure; Homophily; Theoretical computer science; Approximation algorithm; Mathematical optimization; Algorithm; Mathematics","score_opus":0.01712011195363708,"score_gpt":0.25401919604076983,"score_spread":0.23689908408713276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317767745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98727757,0.00004621638,0.00013503291,0.0002832355,0.000051777522,0.000423897,0.000008468025,0.00003226161,0.011741573],"genre_scores_gemma":[0.9991479,0.000002513561,0.00028861273,0.00005389192,0.000059367536,0.00018844075,0.0000045745583,0.000013992305,0.00024072554],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989715,0.000057586207,0.00027082718,0.00014284707,0.00029832663,0.0002589174],"domain_scores_gemma":[0.9995155,0.000058604986,0.00014041206,0.00019319974,0.000059800524,0.000032494143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007919746,0.000118791664,0.0002031512,0.00008451203,0.000372327,0.000024642302,0.00079292466,0.000013187935,0.00039351307],"category_scores_gemma":[0.0000040735886,0.00009704953,0.00014628578,0.0005387555,0.00005060262,0.00005867445,0.0013925815,0.0007094116,9.889073e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007793749,0.0012401119,0.91497236,0.00003294164,0.000173086,2.6493112e-7,0.003001417,0.018941114,0.0055871517,0.0333086,0.007966531,0.014698475],"study_design_scores_gemma":[0.006327161,0.00094627566,0.31492037,0.00040344408,0.00039639525,0.000010812161,0.03755207,0.33591494,0.15964647,0.10204114,0.039611682,0.0022292614],"about_ca_topic_score_codex":0.0019946888,"about_ca_topic_score_gemma":0.000015819458,"teacher_disagreement_score":0.600052,"about_ca_system_score_codex":0.000108669905,"about_ca_system_score_gemma":0.000015026021,"threshold_uncertainty_score":0.43086922},"labels":[],"label_agreement":null},{"id":"W4318003361","doi":"10.1007/978-3-031-21131-7_12","title":"Structure of Core-Periphery Communities","year":2023,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Core (optical fiber); Community structure; Computer science; Topology (electrical circuits); Common core; Network structure; Economic geography; Geography; Theoretical computer science; Mathematics; Telecommunications; Combinatorics","score_opus":0.138372157483628,"score_gpt":0.3789560542211828,"score_spread":0.2405838967375548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318003361","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005886615,0.008900004,0.16551629,0.0002614099,0.0025223615,0.0019182797,0.0023328846,0.00062152813,0.8120406],"genre_scores_gemma":[0.9721889,0.0002548735,0.003994658,0.00002829341,0.0002380136,0.000012412705,0.00034486534,0.000050668157,0.022887336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862814,0.00002324477,0.0006458184,0.00021774531,0.00030581895,0.00017925457],"domain_scores_gemma":[0.9980467,0.00091042346,0.0003409958,0.00027966575,0.0004007086,0.000021528442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000121180936,0.00029726423,0.00063617446,0.00024355877,0.00009763056,0.000012090208,0.00039018155,0.000070624264,0.00062386325],"category_scores_gemma":[0.00000796647,0.0002998617,0.00018145074,0.00013355022,0.00059191464,0.000036713842,0.00043953874,0.00040979212,0.000021900594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072602074,0.00001411473,0.0008375223,0.00006610053,0.0005931002,0.0000028566203,0.0012669903,0.08143811,0.0000012642605,0.9036908,0.0017174574,0.010364436],"study_design_scores_gemma":[0.000027145385,0.000030824165,0.00007100734,0.0005395816,0.000046195117,6.4167136e-7,0.0017253511,0.006085234,0.00003589956,0.9900768,0.001105061,0.00025630544],"about_ca_topic_score_codex":0.00013579377,"about_ca_topic_score_gemma":0.00021274357,"teacher_disagreement_score":0.9663023,"about_ca_system_score_codex":0.000063980006,"about_ca_system_score_gemma":0.00005738478,"threshold_uncertainty_score":0.99994534},"labels":[],"label_agreement":null},{"id":"W4318003508","doi":"10.1007/978-3-031-21131-7_17","title":"Community Detection Supported by Node Embeddings (Searching for a Suitable Method)","year":2023,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Initialization; Cluster analysis; Computer science; Partition (number theory); Embedding; Graph partition; Algorithm; Theoretical computer science; Graph; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.14233007700742983,"score_gpt":0.43832797068798485,"score_spread":0.295997893680555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318003508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008824207,0.0002353342,0.97760254,0.00008509919,0.00018213964,0.00054922333,0.00022785498,0.00014812658,0.020881446],"genre_scores_gemma":[0.6077272,0.0003019306,0.16788669,0.00024312307,0.00096921716,0.0010345281,0.0030544144,0.00038835406,0.21839452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980955,0.00012913471,0.0006721244,0.00041610227,0.00031827856,0.0003688179],"domain_scores_gemma":[0.9953065,0.0035731327,0.00032041484,0.0002685529,0.00048434804,0.000047047582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015251469,0.00035323665,0.0006221099,0.0003104646,0.0005302224,0.000054411325,0.00040068603,0.0000968738,0.000099740886],"category_scores_gemma":[0.000088057815,0.00038825406,0.00026249563,0.00019039355,0.00019290474,0.00008366902,0.00048282326,0.00091525685,0.00003065484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009141909,0.00017566638,0.00027902375,0.00036904262,0.0027994819,0.00000523454,0.00392516,0.1625162,0.00007986093,0.5617001,0.030117713,0.23794109],"study_design_scores_gemma":[0.00006838739,0.00006277779,0.000010814096,0.0002779199,0.00008048253,8.109129e-7,0.00091421726,0.097245306,0.0004101689,0.8941733,0.0063915616,0.00036425696],"about_ca_topic_score_codex":0.00042996136,"about_ca_topic_score_gemma":0.00019710467,"teacher_disagreement_score":0.80971587,"about_ca_system_score_codex":0.00018967695,"about_ca_system_score_gemma":0.00005716073,"threshold_uncertainty_score":0.99985695},"labels":[],"label_agreement":null},{"id":"W4318828902","doi":"10.1109/icdm54844.2022.00046","title":"Revisiting Link Prediction on Heterogeneous Graphs with a Multi-view Perspective","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Data Mining (ICDM)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Link (geometry); Perspective (graphical); Margin (machine learning); Theoretical computer science; Representation (politics); Graph; Artificial intelligence; Linkage (software); Aggregate (composite); Machine learning; Node (physics); Dependency (UML); Relation (database); Data mining","score_opus":0.11426592174975071,"score_gpt":0.3509309027107834,"score_spread":0.23666498096103272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318828902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7448757,0.00045491627,0.10184592,0.00992134,0.003275781,0.002898175,0.01928445,0.0013283843,0.11611532],"genre_scores_gemma":[0.99419945,0.000021498108,0.0022026165,0.00018995622,0.00051914906,0.00017240449,0.002202206,0.000031236017,0.00046147086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788296,0.00015981006,0.00032929215,0.0007660287,0.0006333844,0.00022850797],"domain_scores_gemma":[0.99856293,0.00010411791,0.00029652286,0.0007702609,0.00020069152,0.00006549279],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003745465,0.00023702579,0.00025225952,0.00023837785,0.0003511485,0.00015482902,0.0011506589,0.000021799417,0.0030995803],"category_scores_gemma":[0.000019585052,0.0002331919,0.00009499288,0.0002816647,0.000049515253,0.00019154813,0.00046409748,0.00048771698,0.000020311309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022894077,0.002352435,0.057537645,0.000048106787,0.005715624,0.000263469,0.004860092,0.025729002,0.0031626625,0.42277944,0.028698651,0.44656348],"study_design_scores_gemma":[0.0027909956,0.001424799,0.0015399681,0.00071105774,0.0003307677,0.000053101507,0.0074155857,0.9520836,0.0008255924,0.005803618,0.025766453,0.0012544798],"about_ca_topic_score_codex":0.00021408134,"about_ca_topic_score_gemma":0.000022712082,"teacher_disagreement_score":0.9263546,"about_ca_system_score_codex":0.00018660437,"about_ca_system_score_gemma":0.00009028974,"threshold_uncertainty_score":0.99781173},"labels":[],"label_agreement":null},{"id":"W4319587066","doi":"10.1109/icdmw58026.2022.00144","title":"Active Keyword Selection to Track Evolving Topics on Twitter","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Data Mining Workshops (ICDMW)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Leverage (statistics); Information retrieval; Social media; Selection (genetic algorithm); World Wide Web; Data science; Relevance (law); Topic model; Artificial intelligence","score_opus":0.114280160644088,"score_gpt":0.36053029324438085,"score_spread":0.24625013260029285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319587066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7445323,0.000022784476,0.058530197,0.013265555,0.0046347305,0.0013011908,0.0020720167,0.00059424166,0.17504698],"genre_scores_gemma":[0.9876631,0.0000029284984,0.002379852,0.00080191024,0.0011324136,0.00019144232,0.0014309242,0.00003351605,0.006363906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764097,0.00014465128,0.00036697777,0.0008095254,0.0007168276,0.00032103204],"domain_scores_gemma":[0.99860626,0.00017697636,0.00021352731,0.00074783847,0.00015645895,0.00009892914],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003465781,0.00026204155,0.00025807114,0.00031558427,0.00035666695,0.0002334931,0.0015726528,0.000037087157,0.018780192],"category_scores_gemma":[0.0000389701,0.00029354627,0.00010120218,0.0004900668,0.000026558422,0.00028095325,0.00072781503,0.00068586686,0.00007685934],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047150088,0.00069454964,0.011983232,0.000004421833,0.0006993281,0.000016127628,0.0017472752,0.007901585,0.0013840686,0.023272248,0.4411512,0.5106745],"study_design_scores_gemma":[0.0015067075,0.0010863313,0.016512007,0.00033980416,0.00023474274,0.00001351024,0.0068253987,0.61704135,0.003619511,0.007105956,0.34352034,0.0021943583],"about_ca_topic_score_codex":0.000112532034,"about_ca_topic_score_gemma":0.00004947818,"teacher_disagreement_score":0.60913974,"about_ca_system_score_codex":0.00025965774,"about_ca_system_score_gemma":0.00009284055,"threshold_uncertainty_score":0.99995166},"labels":[],"label_agreement":null},{"id":"W4319988572","doi":"10.1007/978-3-031-21131-7_22","title":"Winner Does Not Take All: Contrasting Centrality in Adversarial Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Adversarial system; Centrality; PageRank; Key (lock); Computer science; Dominance (genetics); Theoretical computer science; Node (physics); Graph; Network science; Complex network; Artificial intelligence; Computer security; Mathematics; Combinatorics; Engineering; World Wide Web","score_opus":0.10820839549817796,"score_gpt":0.3690246951033868,"score_spread":0.26081629960520886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319988572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011819233,0.0022940396,0.80921763,0.0016364665,0.006087948,0.0029514786,0.00061696244,0.00076307973,0.17525049],"genre_scores_gemma":[0.9786097,0.0002813806,0.0027115345,0.00015854565,0.0014493163,0.000071041504,0.00035031151,0.000076381664,0.016291827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728036,0.0000666101,0.0010625792,0.0006846345,0.000402308,0.00050349237],"domain_scores_gemma":[0.9974498,0.0016222211,0.0003830996,0.00023503353,0.0002552351,0.000054569162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006108141,0.00045538566,0.0008097214,0.0002564408,0.00011416504,0.000043640488,0.00037104357,0.00012807625,0.00022641174],"category_scores_gemma":[0.000046532517,0.00041766773,0.00024704746,0.00018730818,0.00033795682,0.00008153007,0.00044329496,0.0007448002,0.000035733225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039127957,0.000038010636,0.0028679504,0.000028216768,0.0006146382,0.00003116095,0.00044719942,0.48063254,3.6607616e-7,0.49589533,0.0009551215,0.018450325],"study_design_scores_gemma":[0.00018806205,0.00002983508,0.0007906336,0.0007757481,0.00009790053,6.8779747e-7,0.00044115496,0.17588802,0.00001203557,0.8181039,0.0029627637,0.00070922635],"about_ca_topic_score_codex":0.0002187099,"about_ca_topic_score_gemma":0.00049507787,"teacher_disagreement_score":0.9774277,"about_ca_system_score_codex":0.00021892988,"about_ca_system_score_gemma":0.000068162684,"threshold_uncertainty_score":0.9998275},"labels":[],"label_agreement":null},{"id":"W4319993349","doi":"10.1007/978-3-031-21131-7_1","title":"Modularity of the ABCD Random Graph Model with Community Structure","year":2023,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Community structure; Random graph; Modularity (biology); Graph; Clique percolation method; Computer science; Theoretical computer science; Mathematics; Algorithm; Combinatorics","score_opus":0.087563472982037,"score_gpt":0.34008655127742066,"score_spread":0.2525230782953837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319993349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044991835,0.00083405967,0.9172099,0.00023480943,0.0003319764,0.0013517234,0.00081588957,0.00014531845,0.07457711],"genre_scores_gemma":[0.98794127,0.000042724787,0.0049080034,0.000029025803,0.000068187815,0.000020646932,0.0001019123,0.00003523864,0.0068529956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860084,0.00008526839,0.00050002814,0.00024697874,0.00039939873,0.00016749337],"domain_scores_gemma":[0.9979836,0.00073825463,0.00036672995,0.0004524522,0.00043823067,0.000020786416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029257016,0.00030063262,0.000590975,0.00013914559,0.00026511808,0.000013145524,0.0005847267,0.00006608751,0.000034414315],"category_scores_gemma":[0.0000117430445,0.00021169738,0.0002240396,0.0002034252,0.000709886,0.00003635156,0.000570869,0.0008811711,0.0000022632962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019631987,0.000017412225,0.0003631995,0.000038026872,0.000433178,4.8939796e-7,0.0004977862,0.627753,4.898127e-7,0.3692225,0.00021571685,0.0014385501],"study_design_scores_gemma":[0.000089025205,0.000019920202,0.00011677966,0.0004149186,0.000079497535,4.6232643e-7,0.00022483493,0.090582944,0.0000305895,0.90821755,0.00003769116,0.00018577464],"about_ca_topic_score_codex":0.00018012845,"about_ca_topic_score_gemma":0.0004399533,"teacher_disagreement_score":0.98344207,"about_ca_system_score_codex":0.00005267531,"about_ca_system_score_gemma":0.00008150652,"threshold_uncertainty_score":0.86327684},"labels":[],"label_agreement":null},{"id":"W4319994446","doi":"10.1007/978-3-031-21131-7_13","title":"Outliers in the ABCD Random Graph Model with Community Structure (ABCD+o)","year":2023,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Outlier; Graph; Community structure; Random graph; Computer science; Benchmark (surveying); Algorithm; Mathematics; Artificial intelligence; Theoretical computer science; Combinatorics; Cartography","score_opus":0.10000855832932473,"score_gpt":0.355228489337524,"score_spread":0.2552199310081993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319994446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003722372,0.0018030558,0.78012615,0.00086853676,0.00042716786,0.0027087268,0.00064532884,0.00030717146,0.2093915],"genre_scores_gemma":[0.989179,0.00012434939,0.004436817,0.0001560413,0.00014284535,0.00008823885,0.0003398729,0.000055840515,0.005476959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981401,0.00015161624,0.00058925507,0.000354379,0.0004792718,0.00028535258],"domain_scores_gemma":[0.9973431,0.0016810047,0.00026405757,0.0004337462,0.0002511812,0.000026899103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063337095,0.00042147352,0.0006504798,0.00032616773,0.00031764535,0.000045966124,0.000740702,0.00007997963,0.000043806413],"category_scores_gemma":[0.000013698063,0.00030460476,0.00017847015,0.0003107579,0.0005771372,0.00006094367,0.0003196635,0.0013654175,0.000011409078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003811734,0.000027099988,0.00035914747,0.000027024458,0.00034039398,0.0000064996057,0.0032365313,0.6544091,8.566201e-8,0.33750325,0.0007936203,0.0032591326],"study_design_scores_gemma":[0.00016434389,0.00003884577,0.00008881154,0.00035944785,0.00006446116,0.0000012841017,0.0024575216,0.0627305,0.0000018152165,0.93359196,0.0001903151,0.00031067256],"about_ca_topic_score_codex":0.0002427054,"about_ca_topic_score_gemma":0.0012725786,"teacher_disagreement_score":0.98545665,"about_ca_system_score_codex":0.00009171176,"about_ca_system_score_gemma":0.000079909725,"threshold_uncertainty_score":0.99994063},"labels":[],"label_agreement":null},{"id":"W4319994629","doi":"10.1007/978-3-031-21131-7_25","title":"Statistical Network Similarity","year":2023,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Memorial University of Newfoundland; University of Toronto","funders":"","keywords":"Similarity (geometry); Artificial intelligence; Computer science; Data mining","score_opus":0.13250050782956208,"score_gpt":0.39779622931192654,"score_spread":0.26529572148236447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319994629","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005660221,0.0011430192,0.66352296,0.00018662847,0.0006289111,0.00038261668,0.00021118527,0.0002049063,0.33371413],"genre_scores_gemma":[0.3805409,0.0021431998,0.15301542,0.00068243797,0.008406688,0.0003829833,0.0031970004,0.0005018785,0.4511295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979769,0.00003707247,0.0006905043,0.0005339246,0.00039428682,0.00036729695],"domain_scores_gemma":[0.99732804,0.0018795035,0.00021661585,0.00024134666,0.00028144004,0.0000530318],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003861412,0.0003624295,0.0006384525,0.00014949321,0.00016399604,0.000030824915,0.00030774326,0.00008489675,0.0007855081],"category_scores_gemma":[0.000028937595,0.00038140884,0.0001670941,0.00015980277,0.00040658278,0.000037587273,0.0005118108,0.00056669465,0.00032585225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005304119,0.00001346419,0.00038993184,0.000018773284,0.0003392943,0.000017303328,0.000063866835,0.14349402,7.637931e-9,0.8140875,0.028093012,0.013477484],"study_design_scores_gemma":[0.000025007972,0.000024738223,0.00013536014,0.00025916373,0.00005415965,5.833432e-7,0.000052818697,0.019149724,5.889775e-7,0.96900475,0.010968294,0.00032483382],"about_ca_topic_score_codex":0.000032059965,"about_ca_topic_score_gemma":0.00006691767,"teacher_disagreement_score":0.5105075,"about_ca_system_score_codex":0.000112422305,"about_ca_system_score_gemma":0.00007639939,"threshold_uncertainty_score":0.9998638},"labels":[],"label_agreement":null},{"id":"W4321201998","doi":"10.1007/s41109-023-00539-6","title":"Distributed Identification of Central Nodes with Less Communication","year":2023,"lang":"en","type":"article","venue":"Applied Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Centrality; Closeness; Node (physics); Computer science; Network controllability; Betweenness centrality; Graph; Distributed computing; Computer network; Theoretical computer science; Mathematics; Engineering","score_opus":0.014008948170932045,"score_gpt":0.25767539939023737,"score_spread":0.24366645121930533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321201998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7857847,0.000020550002,0.2080951,0.0001075738,0.000033722645,0.00030745607,0.000019372925,0.00021408044,0.0054174154],"genre_scores_gemma":[0.9980684,0.00000645938,0.0016122429,0.000006723512,0.00006457726,0.000045001263,0.0001625584,0.0000071742193,0.000026867723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989055,0.000019042225,0.00024058067,0.00023390148,0.00027649818,0.0003245166],"domain_scores_gemma":[0.9990251,0.000065263586,0.00021117686,0.00055595965,0.00009229361,0.000050189614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005784893,0.000085966465,0.00013750857,0.00006995826,0.00030049882,0.000063524,0.0005898504,0.000013211608,0.000017791535],"category_scores_gemma":[0.0000021146898,0.00007601933,0.000030556956,0.0028616104,0.0004373858,0.00011219168,0.00015582895,0.00007719291,0.0000103364555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033430933,0.00010767154,0.13665374,0.000010748815,0.00005879846,2.6185438e-7,0.00038578323,0.1114767,0.018871238,0.6825961,0.004571942,0.045233622],"study_design_scores_gemma":[0.0005817379,0.000038187813,0.6335667,0.000107349566,0.00013016275,5.767904e-7,0.0014358616,0.1959348,0.055550065,0.1100747,0.0018905893,0.00068925787],"about_ca_topic_score_codex":0.0000584149,"about_ca_topic_score_gemma":0.000010654135,"teacher_disagreement_score":0.5725214,"about_ca_system_score_codex":0.00002336296,"about_ca_system_score_gemma":0.00005308755,"threshold_uncertainty_score":0.30999783},"labels":[],"label_agreement":null},{"id":"W4321393097","doi":"10.48550/arxiv.2302.09055","title":"Geometric description of clustering in directed networks","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Natural Sciences and Engineering Research Council of Canada; Agencia Estatal de Investigación; Canada First Research Excellence Fund; Institució Catalana de Recerca i Estudis Avançats; Generalitat de Catalunya","keywords":"Cluster analysis; Computer science; Complex network; Generative grammar; Entropy (arrow of time); Reciprocity (cultural anthropology); Theoretical computer science; Topology (electrical circuits); Assortativity; Artificial intelligence; Mathematics","score_opus":0.09324576034576544,"score_gpt":0.20335837265951423,"score_spread":0.11011261231374879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321393097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43845382,0.000029393383,0.5596354,0.0000042867096,0.00013923549,0.00019358013,0.000012003127,0.00020261915,0.0013296404],"genre_scores_gemma":[0.99845415,0.0000660043,0.0002882738,0.0000024923431,0.00011853795,0.0000021985268,0.00011787298,0.000029154337,0.0009212991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987221,0.000106768515,0.00029335398,0.0005521583,0.000053505297,0.00027216465],"domain_scores_gemma":[0.9989037,0.00009689545,0.0003089067,0.0005372065,0.00009647939,0.000056804543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002302334,0.00022517404,0.0004507413,0.00096354855,0.000041492483,0.0000281784,0.00044489623,0.0001399818,0.00010461526],"category_scores_gemma":[0.000007475146,0.00028945494,0.00025667847,0.0023504552,0.000048197304,0.000087275235,0.0009572332,0.00048628665,0.000009705224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017879474,0.00006214743,0.2050948,0.000025533427,0.00011659843,0.000012872101,0.000024606887,0.79149437,0.000011737674,0.0020487818,0.0002577768,0.0008329024],"study_design_scores_gemma":[0.00022251293,0.000014061402,0.042078346,0.00017217714,0.00011420057,7.157682e-8,0.00006386586,0.940887,0.000027088563,0.016112387,0.000037228354,0.00027109988],"about_ca_topic_score_codex":0.0029649734,"about_ca_topic_score_gemma":0.0007082873,"teacher_disagreement_score":0.56000036,"about_ca_system_score_codex":0.00013537929,"about_ca_system_score_gemma":0.000038093232,"threshold_uncertainty_score":0.9999558},"labels":[],"label_agreement":null},{"id":"W4322009295","doi":"10.1002/rsa.21144","title":"Kemeny's constant for nonbacktracking random walks","year":2023,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Random walk; Constant (computer programming); Vertex (graph theory); Combinatorics; Mathematics; Discrete mathematics; Simple random sample; Random regular graph; Graph; Random graph; Simple (philosophy); Statistics; Computer science; Line graph; 1-planar graph; Demography","score_opus":0.01448669002151564,"score_gpt":0.28364847749616545,"score_spread":0.2691617874746498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322009295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2872507,0.0012602882,0.6944885,0.0009576677,0.000987928,0.0035274895,0.00066848437,0.0010710355,0.00978791],"genre_scores_gemma":[0.990122,0.000057694157,0.008331651,0.000051281153,0.0008383453,0.00012983743,0.00018945463,0.00003316599,0.0002465497],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986933,0.000047234866,0.00033037656,0.00036282215,0.00016566584,0.00040060343],"domain_scores_gemma":[0.99906313,0.0004260989,0.00012309196,0.00021834517,0.00007299072,0.000096347954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035908038,0.00023663788,0.00050564023,0.000119292425,0.0003278968,0.00014080374,0.0001482038,0.000048519145,0.00023011019],"category_scores_gemma":[0.000013195812,0.00018980599,0.0002491425,0.0002673067,0.000088529516,0.0000767984,0.00007942184,0.00013220728,0.0000039670376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010704134,0.00005448827,0.0058528483,0.00009262915,0.001168445,0.0000131682955,0.00074061606,0.00056993146,0.0030023728,0.13125831,0.021111615,0.8350652],"study_design_scores_gemma":[0.03691564,0.00015826327,0.002824634,0.00009856771,0.0004943461,0.0000097067095,0.0008158512,0.12484975,0.004132593,0.7613487,0.06716093,0.0011910116],"about_ca_topic_score_codex":0.00007923826,"about_ca_topic_score_gemma":0.000005502921,"teacher_disagreement_score":0.83387417,"about_ca_system_score_codex":0.000009846248,"about_ca_system_score_gemma":0.000022816292,"threshold_uncertainty_score":0.77400637},"labels":[],"label_agreement":null},{"id":"W4322750377","doi":"10.1007/978-3-031-23717-1_20","title":"Biased Random Walks on the Scientific Landscape","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Random walk; Statistical physics; Geography; Mathematics; Physics; Statistics","score_opus":0.035349702341003444,"score_gpt":0.24650306877481565,"score_spread":0.21115336643381222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322750377","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009730877,0.00002013664,0.00100454,0.00040017592,0.00020527099,0.00034653232,0.000048389364,0.0002725447,0.9976051],"genre_scores_gemma":[0.06739046,0.000004040071,0.000042602765,0.000081943,0.0005760154,0.000037886464,0.0003162193,0.000063636755,0.9314872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870265,0.000023770415,0.00026979798,0.0004361353,0.0003454248,0.00022221726],"domain_scores_gemma":[0.99846613,0.00042232603,0.00014913219,0.0008357378,0.00007552317,0.000051138904],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00043007845,0.00028999915,0.00036669566,0.00019998962,0.00029409197,0.00025090948,0.00041957086,0.00007370744,0.01752728],"category_scores_gemma":[0.0000038837316,0.00017697489,0.0004707632,0.00010761005,0.00010818449,0.000020465317,0.00013682018,0.0003535094,0.0020889167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102174945,0.000009447918,0.000027742977,0.0000017251583,0.00016492914,0.000001236491,0.000012981454,0.000011407351,0.0000065988825,0.6968853,0.29671735,0.0061511043],"study_design_scores_gemma":[0.0003872142,0.00002523277,0.000014203728,0.00012418842,0.0001673543,1.2676787e-7,0.000021380563,0.0016820084,0.00013515352,0.31163868,0.6854032,0.00040124444],"about_ca_topic_score_codex":0.000030386067,"about_ca_topic_score_gemma":0.00003062929,"teacher_disagreement_score":0.38868585,"about_ca_system_score_codex":0.000012668066,"about_ca_system_score_gemma":0.000043461903,"threshold_uncertainty_score":0.9986881},"labels":[],"label_agreement":null},{"id":"W4322760429","doi":"10.48550/arxiv.2302.14698","title":"Heuristic Modularity Maximization Algorithms for Community Detection Rarely Return an Optimal Partition or Anything Similar","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Modularity (biology); Partition (number theory); Heuristics; Graph partition; Maximization; Computer science; Heuristic; Complex network; Algorithm; Partition problem; Theoretical computer science; Mathematics; Mathematical optimization; Graph; Combinatorics","score_opus":0.175844094625707,"score_gpt":0.25565850438837084,"score_spread":0.07981440976266385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322760429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3355573,0.0000034073832,0.6632632,0.000014135523,0.00013754216,0.00045326204,0.00013804737,0.00036685972,0.00006621145],"genre_scores_gemma":[0.9933563,0.00001803023,0.004325313,0.0000140965585,0.00031811063,0.000016951937,0.001561642,0.000059766757,0.0003297728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981129,0.00048699114,0.00030566426,0.00067500275,0.00008798878,0.00033140712],"domain_scores_gemma":[0.99799883,0.00023903186,0.00039082396,0.0009426738,0.00029979364,0.00012881921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061982876,0.0003443532,0.0004384645,0.00024741277,0.00071773556,0.00014573235,0.00054893305,0.0002381533,0.00008284087],"category_scores_gemma":[0.000043510143,0.0004086617,0.00031231076,0.0004918026,0.000078448305,0.00032744938,0.0005903024,0.00096322235,0.000006316827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041245046,0.00043613062,0.0059529124,0.00016027919,0.00045098024,0.000022067587,0.0003786534,0.9823355,0.00011021885,0.004181645,0.000294115,0.005265046],"study_design_scores_gemma":[0.0003576979,0.00013009136,0.0012905473,0.00007746456,0.00038235993,4.761202e-7,0.00030968533,0.91367054,0.00056685787,0.082686715,0.00011520207,0.00041234645],"about_ca_topic_score_codex":0.0014724358,"about_ca_topic_score_gemma":0.00044149757,"teacher_disagreement_score":0.65893793,"about_ca_system_score_codex":0.00021614396,"about_ca_system_score_gemma":0.00008271515,"threshold_uncertainty_score":0.9998365},"labels":[],"label_agreement":null},{"id":"W4322761487","doi":"10.1049/cit2.12205","title":"Guest Editorial: Special issue on machine learning and deep learning algorithms for complex networks","year":2023,"lang":"en","type":"editorial","venue":"CAAI Transactions on Intelligence Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Artificial intelligence; Computer science; Machine learning; Deep learning; Feature (linguistics); Artificial neural network; Deep neural networks; Range (aeronautics); Node (physics); Engineering","score_opus":0.01676770270441815,"score_gpt":0.3111845275297921,"score_spread":0.29441682482537396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322761487","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014747011,0.00007385414,0.46294078,0.00011031371,0.5350929,0.00043225515,0.00011590622,0.00085744454,0.0003750776],"genre_scores_gemma":[0.0014031342,0.0008555574,0.0018495232,0.000006414909,0.9915247,0.0006447228,0.0011089586,0.00022059285,0.0023864203],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99651814,0.00013160736,0.00079383305,0.0012081611,0.00050699443,0.000841274],"domain_scores_gemma":[0.99614054,0.0023238193,0.0004419246,0.00053148536,0.00042584073,0.00013637559],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.00048329151,0.0007728141,0.001078952,0.0010864377,0.00093137746,0.00015240167,0.0006940144,0.0014457982,0.0006615493],"category_scores_gemma":[0.00017195831,0.00084206596,0.0004027165,0.001120045,0.0003966439,0.00007459885,0.000049208164,0.004833627,0.00013213132],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094445844,0.00012259564,0.000015623053,0.000027345948,0.00032259093,0.0000033070066,0.000051833176,0.011788756,0.000006891869,0.00042888886,0.6471866,0.33995113],"study_design_scores_gemma":[0.00021672646,0.00088577234,3.6749444e-7,0.00014053127,0.00024804813,6.910398e-7,0.00028165086,0.04500392,0.0003207716,0.0030945728,0.94914556,0.00066141377],"about_ca_topic_score_codex":0.00017945476,"about_ca_topic_score_gemma":0.0001334018,"teacher_disagreement_score":0.46109125,"about_ca_system_score_codex":0.00018247224,"about_ca_system_score_gemma":0.00007114879,"threshold_uncertainty_score":0.9998505},"labels":[],"label_agreement":null},{"id":"W4323322991","doi":"10.48550/arxiv.2303.01667","title":"Generalizing Lloyd's algorithm for graph clustering","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration; U.S. Department of Energy","keywords":"Cluster analysis; Computer science; Theoretical computer science; Graph; Sparse matrix; Algorithm; Artificial intelligence","score_opus":0.10797098546263531,"score_gpt":0.22442351158227927,"score_spread":0.11645252611964396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323322991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02781023,0.000022515276,0.96984386,0.000026767137,0.0003312337,0.0004481386,0.00013468116,0.00044362526,0.00093896047],"genre_scores_gemma":[0.9773035,0.000040239338,0.017872505,0.000022926875,0.0007705952,0.000014705865,0.00039577766,0.00008365609,0.003496079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983059,0.00006025598,0.00023989174,0.0009086209,0.000060583494,0.00042473027],"domain_scores_gemma":[0.99866784,0.00009426381,0.00025410607,0.0007409879,0.0001289607,0.000113829556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020722338,0.00033820208,0.00045562582,0.00032157724,0.00021882736,0.00009226665,0.0006627765,0.00014137758,0.00008197466],"category_scores_gemma":[0.000002574058,0.00044578777,0.000674147,0.00045019935,0.000058975154,0.00009226562,0.0011949486,0.0003755772,0.000028323437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038657654,0.00020613175,0.01436432,0.0001652967,0.002296685,0.0000766101,0.00020327696,0.7941274,0.00012844395,0.10856583,0.010997712,0.06882964],"study_design_scores_gemma":[0.00028516483,0.000018938828,0.00020093912,0.000086268774,0.0003006333,1.801482e-7,0.00009722661,0.8297976,0.00011885442,0.16680288,0.001794984,0.0004962936],"about_ca_topic_score_codex":0.0009515552,"about_ca_topic_score_gemma":0.0000871034,"teacher_disagreement_score":0.95197135,"about_ca_system_score_codex":0.000095448646,"about_ca_system_score_gemma":0.000058352114,"threshold_uncertainty_score":0.9997994},"labels":[],"label_agreement":null},{"id":"W4324387388","doi":"10.1016/j.eswa.2023.119791","title":"Dynamic community detection including node attributes","year":2023,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agenția Națională pentru Cercetare și Dezvoltare; Instituto de Sistemas Complejos de Ingeniería; Fondo Nacional de Desarrollo Científico y Tecnológico; Agencia Nacional de Investigación y Desarrollo; Canadian Bureau for International Education; McGill University","keywords":"Computer science; Joins; Node (physics); Cluster analysis; Task (project management); Data mining; Dynamic network analysis; Community structure; Social network (sociolinguistics); State (computer science); Artificial intelligence; Machine learning; Algorithm; Mathematics; Computer network","score_opus":0.03269509715805709,"score_gpt":0.3108842685189088,"score_spread":0.27818917136085175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324387388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056116905,0.00011528627,0.9387485,0.00016318726,0.00003835982,0.00080355647,0.000030352414,0.0009108874,0.0030729685],"genre_scores_gemma":[0.9951487,0.000004746363,0.00085687375,0.000012589114,0.00014951073,0.0032771043,0.00021671252,0.000026087206,0.0003076859],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914896,0.000104706094,0.00022011678,0.00018151425,0.00013589606,0.00020877994],"domain_scores_gemma":[0.9989883,0.00013528783,0.00011995848,0.00060986646,0.0000885942,0.00005802921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002396115,0.00013337226,0.00018816185,0.00012758942,0.00079324277,0.000070049195,0.00024515975,0.000029646824,0.000019922929],"category_scores_gemma":[0.0000018372489,0.00011903228,0.000057868485,0.00094395515,0.00003989973,0.000078272016,0.00010197828,0.00019360789,0.00012672422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115946335,0.002440555,0.23946677,0.00045088623,0.003417301,0.0000059944105,0.01428068,0.04343105,0.23204708,0.16351417,0.06945051,0.23137906],"study_design_scores_gemma":[0.0013233405,0.00018134565,0.022719454,0.00039622997,0.00019962547,0.000016516076,0.019273119,0.5072848,0.0110201305,0.010711122,0.4248696,0.002004735],"about_ca_topic_score_codex":0.0026656666,"about_ca_topic_score_gemma":0.00014027345,"teacher_disagreement_score":0.9390318,"about_ca_system_score_codex":0.000071324605,"about_ca_system_score_gemma":0.000017199414,"threshold_uncertainty_score":0.6101062},"labels":[],"label_agreement":null},{"id":"W4327500525","doi":"10.1109/snams58071.2022.10062846","title":"A Fast Local Community Detection Algorithm in Signed Social Networks","year":2022,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Node (physics); Local community; Community structure; Social network (sociolinguistics); Complex network; Algorithm; Theoretical computer science; World Wide Web; Mathematics; Combinatorics; Political science; Social media; Law; Engineering","score_opus":0.009634778494865421,"score_gpt":0.24381652655534447,"score_spread":0.23418174806047906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327500525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031652622,0.0000066714138,0.96171904,0.00003692527,0.00003662488,0.000115289826,0.000005156983,0.000096701304,0.0063309916],"genre_scores_gemma":[0.99868137,1.3756839e-7,0.00073493,0.000060156715,0.00018189907,0.00011451213,0.000055809338,0.000012059903,0.00015912432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892765,0.0004386222,0.00018547989,0.00011813827,0.00012595455,0.000204176],"domain_scores_gemma":[0.9996799,0.000055044155,0.00005801067,0.00016200366,0.000019453742,0.000025541618],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037380419,0.00009863618,0.00016545116,0.0000829047,0.0006677147,0.00002461811,0.0001994623,0.000019579344,0.0015278114],"category_scores_gemma":[4.3766372e-7,0.000111013396,0.00010672523,0.00050237216,0.000037896032,0.00004703761,0.0003109388,0.00063903775,0.0000028487843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001374563,0.0002831499,0.002387989,7.473725e-7,0.000040883893,9.621294e-7,0.00035335735,0.017463364,0.00006190348,0.0015347789,0.0012242174,0.9766349],"study_design_scores_gemma":[0.00040175454,0.00009689475,0.0031263407,0.0000016965382,0.00002158121,6.9675787e-7,0.0044618957,0.9803493,0.0002757904,0.008617197,0.0024137262,0.00023309386],"about_ca_topic_score_codex":0.0050801476,"about_ca_topic_score_gemma":0.0006320579,"teacher_disagreement_score":0.9764018,"about_ca_system_score_codex":0.00010994013,"about_ca_system_score_gemma":0.000014397016,"threshold_uncertainty_score":0.99938494},"labels":[],"label_agreement":null},{"id":"W4327810336","doi":"10.1145/3543873.3587654","title":"CS-TGN: Community Search via Temporal Graph Neural Networks","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Snapshot (computer storage); Graph; Data mining; Disjoint sets; Ground truth; Embedding; Community structure; Web search query; Theoretical computer science; Machine learning; Information retrieval; Artificial intelligence; Search engine","score_opus":0.06448810453640626,"score_gpt":0.32614610141873124,"score_spread":0.261657996882325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327810336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11813004,0.00009022241,0.86471766,0.00046043642,0.00055786787,0.0008489165,0.000063425774,0.0016043558,0.013527099],"genre_scores_gemma":[0.99296343,0.000009614142,0.0020779262,0.000075733544,0.0010371387,0.00014115412,0.0018842141,0.00009902058,0.0017117355],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703956,0.00076843187,0.0006129671,0.00055022916,0.00037176564,0.0006570507],"domain_scores_gemma":[0.997227,0.0002657251,0.0002203227,0.0019204655,0.00017883236,0.00018761428],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000995888,0.00053197454,0.00076842506,0.00028976018,0.00046621085,0.0002656278,0.0014012122,0.00022901568,0.0010792279],"category_scores_gemma":[0.00000278582,0.00051749364,0.0007783956,0.0006027449,0.0001577802,0.000070670736,0.0040412364,0.0038632522,0.000058706566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004234858,0.0006360231,0.54398024,0.00011174752,0.0016912648,0.000014342839,0.0004332923,0.294901,0.000017352957,0.00739677,0.09830766,0.05246795],"study_design_scores_gemma":[0.00020669178,0.00005779984,0.013089844,0.000084358646,0.00017295724,7.2312594e-7,0.0002923075,0.8919112,0.00007370067,0.09244207,0.0007735162,0.0008948107],"about_ca_topic_score_codex":0.034259845,"about_ca_topic_score_gemma":0.0009536897,"teacher_disagreement_score":0.8748334,"about_ca_system_score_codex":0.000052726886,"about_ca_system_score_gemma":0.00005773635,"threshold_uncertainty_score":0.99983394},"labels":[],"label_agreement":null},{"id":"W4328136169","doi":"10.1016/j.jocs.2023.102002","title":"A link prediction method based on topological nearest-neighbors similarity in directed networks","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Basic Public Welfare Research Program of Zhejiang Province; National Natural Science Foundation of China; Zhejiang Office of Philosophy and Social Science","keywords":"Similarity (geometry); Computer science; Link (geometry); Benchmark (surveying); Robustness (evolution); Field (mathematics); Data mining; Distance matrix; Node (physics); k-nearest neighbors algorithm; Enhanced Data Rates for GSM Evolution; Topology (electrical circuits); Artificial intelligence; Algorithm; Mathematics","score_opus":0.019146567164580464,"score_gpt":0.33489030719160146,"score_spread":0.315743740027021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328136169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1977386,0.000007935931,0.7992863,0.00142074,0.00017564902,0.00009970223,0.00000559806,0.000075252785,0.0011902454],"genre_scores_gemma":[0.96622974,9.3772326e-7,0.033351548,0.000090132016,0.00030634645,0.0000029647777,0.000007163684,0.0000038476687,0.00000732257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985748,0.00014396747,0.0003846538,0.00017126472,0.00051932014,0.00020600964],"domain_scores_gemma":[0.99864537,0.0006634957,0.00023295214,0.00008578756,0.00028029387,0.000092119495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017780962,0.00008618573,0.00018641823,0.0004305032,0.00015290968,0.000070682596,0.00029061598,0.00002811688,0.00009407562],"category_scores_gemma":[0.00007994011,0.00007028757,0.000104618535,0.0022711179,0.00012349628,0.0001657517,0.00005002073,0.00030349987,0.000002790967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020758687,0.00005688983,0.03563532,6.0766183e-7,0.000006145778,0.0000043268838,0.000022916458,0.94742346,0.000021989918,0.0032899186,0.0003836495,0.013133993],"study_design_scores_gemma":[0.00014968566,0.00007647585,0.26658306,0.000021226497,0.0000056487274,0.0000010863554,0.000009881716,0.69867057,0.000020494128,0.034280438,0.0001374523,0.000043994743],"about_ca_topic_score_codex":0.000021608936,"about_ca_topic_score_gemma":0.0000021848978,"teacher_disagreement_score":0.76849115,"about_ca_system_score_codex":0.000079671496,"about_ca_system_score_gemma":0.00020456106,"threshold_uncertainty_score":0.28662437},"labels":[],"label_agreement":null},{"id":"W4360765107","doi":"10.1109/asonam55673.2022.10068570","title":"NetDriller-V3: A Powerful Social Network Analysis Tool","year":2022,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Social network analysis; Data science; World Wide Web; Social media","score_opus":0.007947139441690506,"score_gpt":0.2520642871814805,"score_spread":0.24411714773978999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360765107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3555451,0.00016999041,0.31168187,0.0015753985,0.00034532242,0.0006999153,0.000103729435,0.0015388317,0.32833982],"genre_scores_gemma":[0.99291676,4.7949e-7,0.0017178557,0.00027060928,0.00084755773,0.000067900655,0.00015803591,0.000025786107,0.003995004],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849844,0.0001430251,0.00031146483,0.0003372352,0.0003123501,0.00039749738],"domain_scores_gemma":[0.9993947,0.000050680013,0.00013380745,0.00033258015,0.000041945623,0.00004629257],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031358504,0.00016988629,0.00038774198,0.00016124995,0.00064834143,0.000065581306,0.00033884152,0.000017773411,0.028108712],"category_scores_gemma":[8.5482645e-7,0.00017592726,0.00065914664,0.0023319272,0.00002956804,0.000056669785,0.0004414607,0.0002337949,0.000041527353],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003351536,0.00026653532,0.25692615,0.0000014662012,0.004515161,0.0000042362685,0.00033404795,0.028876029,0.000036774007,0.20414086,0.4858748,0.018990418],"study_design_scores_gemma":[0.00060052006,0.00012338065,0.034864374,0.0000017379286,0.0028374682,9.182773e-7,0.0010532999,0.07583669,0.00004881075,0.06249914,0.8209847,0.0011489544],"about_ca_topic_score_codex":0.00041081745,"about_ca_topic_score_gemma":0.000037596677,"teacher_disagreement_score":0.63737166,"about_ca_system_score_codex":0.000055757435,"about_ca_system_score_gemma":0.000033379372,"threshold_uncertainty_score":0.97277975},"labels":[],"label_agreement":null},{"id":"W4361018126","doi":"10.2139/ssrn.4401866","title":"Integrating Social Media Data: Venues, Groups and Activities","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Social media; Business; Computer science; World Wide Web","score_opus":0.0209063892034339,"score_gpt":0.2837472410326227,"score_spread":0.2628408518291888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361018126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9585203,0.0011107982,0.0375004,0.0005764928,0.0002105779,0.00009707119,0.000048354636,0.0002073402,0.0017286642],"genre_scores_gemma":[0.9974735,0.0002648385,0.00017198376,0.0000064912,0.0018341052,0.000004305916,0.00010125063,0.000018868226,0.00012465485],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842966,0.00006836279,0.00016586581,0.00017482009,0.00015822677,0.001003076],"domain_scores_gemma":[0.9995561,0.000114288974,0.00011840573,0.00015382879,0.00002128164,0.00003605543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010025345,0.00011393982,0.00017657118,0.000103821454,0.0003377775,0.00010322002,0.00030352743,0.000025896199,0.0000327801],"category_scores_gemma":[0.000012930851,0.00010602429,0.000060803945,0.00025896507,0.00003966894,0.00025010307,0.0001901252,0.0010752028,0.000007629678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011929101,0.000021559195,0.008528598,0.000003023704,0.00033275812,0.0000022822721,0.001062871,0.0000021968592,0.0003740119,0.47624636,0.0041875727,0.50922686],"study_design_scores_gemma":[0.00030160707,0.000042528587,0.0022721132,0.000022871842,0.00010175737,0.00002145908,0.011978056,0.001347782,0.00007058213,0.9780949,0.0055003245,0.00024603598],"about_ca_topic_score_codex":0.000051053754,"about_ca_topic_score_gemma":0.00042518493,"teacher_disagreement_score":0.5089808,"about_ca_system_score_codex":0.00010200498,"about_ca_system_score_gemma":0.00029568071,"threshold_uncertainty_score":0.46712807},"labels":[],"label_agreement":null},{"id":"W4362549982","doi":"10.1007/s10489-023-04555-y","title":"Deep reinforcement learning-based approach for rumor influence minimization in social networks","year":2023,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"National Natural Science Foundation of China","keywords":"Rumor; Computer science; Reinforcement learning; Blocking (statistics); Minification; Artificial intelligence; Social network (sociolinguistics); Control (management); Social media; Computer network; World Wide Web; Law","score_opus":0.019375128782948742,"score_gpt":0.2789804399020868,"score_spread":0.2596053111191381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362549982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033665085,0.0000063638026,0.9920461,0.000025254427,0.0000151301865,0.0005724035,6.397953e-7,0.00016259671,0.0038049696],"genre_scores_gemma":[0.9936314,0.000003460929,0.0047432296,0.00006469556,0.00019166252,0.00082148577,0.00040520364,0.000024420558,0.00011440642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986958,0.000025274916,0.00037554698,0.0003330269,0.00015238623,0.00041795385],"domain_scores_gemma":[0.999451,0.00012940829,0.00014981408,0.00016895916,0.00006215097,0.000038711445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030462458,0.00016880014,0.00022139227,0.00016132966,0.00021423347,0.000049171555,0.00026252068,0.00005532213,0.000083659],"category_scores_gemma":[0.0000085867405,0.00018353036,0.000097280084,0.0009964483,0.000055375658,0.00005077318,0.00008000373,0.0001912168,0.000020309297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027082597,0.000032150907,0.002205598,0.00000997128,0.00001619415,1.2695206e-7,0.00015850163,0.9479076,0.0000377605,0.03173338,0.00035824953,0.017513365],"study_design_scores_gemma":[0.00010779915,0.000024187417,0.00038437828,0.000007599411,0.000015187889,2.1999083e-8,0.00029573086,0.9928457,0.0012014618,0.004240744,0.00068301393,0.00019416315],"about_ca_topic_score_codex":0.000041623105,"about_ca_topic_score_gemma":0.00000417165,"teacher_disagreement_score":0.99026495,"about_ca_system_score_codex":0.000045120465,"about_ca_system_score_gemma":0.000028036851,"threshold_uncertainty_score":0.7484151},"labels":[],"label_agreement":null},{"id":"W4363650222","doi":"10.5465/amj.2022.0105","title":"Coherence within and across Categories: The Dynamic Viability of Product Categories on Kickstarter","year":2023,"lang":"en","type":"article","venue":"Academy of Management Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Optimal distinctiveness theory; Product category; Extant taxon; Argument (complex analysis); Product (mathematics); Coherence (philosophical gambling strategy); Salience (neuroscience); Cognitive psychology; Psychology; Social psychology; Mathematics; Statistics; Evolutionary biology","score_opus":0.017671407962644003,"score_gpt":0.3060747584083741,"score_spread":0.2884033504457301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4363650222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99386925,0.00006731867,0.0019988127,0.0022330305,0.00006002812,0.00036131215,0.000012113692,0.00003714306,0.0013610205],"genre_scores_gemma":[0.99897385,0.000037611302,0.00038963658,0.00003505811,0.00008111383,0.000017704691,0.000003986163,0.000010062741,0.00045095317],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987086,0.000094954856,0.00044977615,0.00020818251,0.00030541353,0.00023308593],"domain_scores_gemma":[0.99925756,0.00008709517,0.000377,0.00019304102,0.000045486893,0.000039785016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012498558,0.0001403246,0.00024328985,0.000081042126,0.00020752948,0.00004799145,0.0003756278,0.000022641962,0.00007749666],"category_scores_gemma":[0.000006259716,0.000095410476,0.00009066496,0.00041483308,0.00022993835,0.00011311375,0.00021764658,0.00035248025,0.0000045545303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037770226,0.0005283324,0.35759917,0.0006749872,0.0038086544,0.000010563672,0.018074611,0.004756762,0.0029653995,0.2330341,0.033273943,0.34489578],"study_design_scores_gemma":[0.00073547114,0.00020027284,0.3851149,0.00016987819,0.00027468402,0.0000052142564,0.009215512,0.0029711917,0.009763611,0.5852598,0.005843872,0.00044560194],"about_ca_topic_score_codex":0.000041343093,"about_ca_topic_score_gemma":0.0000046715973,"teacher_disagreement_score":0.3522257,"about_ca_system_score_codex":0.000018026298,"about_ca_system_score_gemma":0.000010007781,"threshold_uncertainty_score":0.38907263},"labels":[],"label_agreement":null},{"id":"W4366003831","doi":"10.1007/s41060-023-00389-6","title":"Statistical power, accuracy, reproducibility and robustness of a graph clusterability test","year":2023,"lang":"en","type":"article","venue":"International Journal of Data Science and Analytics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Toronto","funders":"University of Toronto","keywords":"Statistical hypothesis testing; Statistic; Mathematics; Graph; Test statistic; Cluster analysis; Robustness (evolution); Computer science; Combinatorics; Statistics; Algorithm","score_opus":0.05412285085499116,"score_gpt":0.38137613758015304,"score_spread":0.32725328672516185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366003831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95227224,0.000033411096,0.045829058,0.0010569638,0.00013357145,0.000057673646,0.00044180805,0.0000094697425,0.00016582348],"genre_scores_gemma":[0.9955401,0.000051287803,0.0042349156,0.000013603501,0.00012112044,2.947799e-7,0.000029296,0.000002694199,0.000006709284],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998343,0.0000274486,0.00047616713,0.00038369757,0.00064971106,0.000119992656],"domain_scores_gemma":[0.9975092,0.0005151119,0.0003310913,0.000593378,0.00096490496,0.00008631509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038699585,0.00007263874,0.00019610267,0.00025531306,0.00006591366,0.000115777,0.0009124395,0.000011795114,0.0000408714],"category_scores_gemma":[0.0014639383,0.00005840627,0.000032974887,0.0006008916,0.0005910999,0.000821996,0.0007148783,0.000121299025,4.0504682e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054074884,0.00044880455,0.89349264,0.00002124716,0.00024802078,0.000016161363,0.00020352175,0.0006438497,0.00247601,0.008623743,0.006215223,0.08755672],"study_design_scores_gemma":[0.0008751815,0.00029524812,0.6101856,0.00017918696,0.00023885313,0.000059345602,0.0011861888,0.33667904,0.0012228141,0.046082467,0.0026248228,0.00037123397],"about_ca_topic_score_codex":0.000045661658,"about_ca_topic_score_gemma":0.0000066384255,"teacher_disagreement_score":0.3360352,"about_ca_system_score_codex":0.000018517821,"about_ca_system_score_gemma":0.00018444176,"threshold_uncertainty_score":0.23817386},"labels":[],"label_agreement":null},{"id":"W4366200499","doi":"10.1109/tkde.2023.3267854","title":"Hiding From Centrality Measures: A Stackelberg Game Perspective","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; National Science Foundation of Sri Lanka; Multidisciplinary University Research Initiative; Hong Kong Polytechnic University; National Natural Science Foundation of China; Narodowe Centrum Nauki; York University; New York University Abu Dhabi; National Science Foundation","keywords":"Centrality; Betweenness centrality; Computer science; Ranking (information retrieval); Stackelberg competition; Node (physics); Closeness; Social network (sociolinguistics); Theoretical computer science; Katz centrality; Mathematical optimization; Artificial intelligence; Mathematics; Mathematical economics; Social media; Statistics","score_opus":0.04118757028655001,"score_gpt":0.3047716404612869,"score_spread":0.2635840701747369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366200499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034217063,0.00022019976,0.9634258,0.000047159676,0.00019536278,0.00012220757,0.00072824594,0.00041856407,0.00062535226],"genre_scores_gemma":[0.998729,0.00006721932,0.00066610216,0.0000034380462,0.00021497528,0.000023477502,0.00014211025,0.000025447827,0.00012825086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905103,0.000026425321,0.00016536166,0.00041096853,0.000100406854,0.00024581453],"domain_scores_gemma":[0.9991181,0.00015175229,0.000024382016,0.0005652418,0.000045940633,0.00009461499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014393995,0.00017070619,0.00019940583,0.00015074822,0.000107547734,0.00006124346,0.00024199777,0.000032870754,0.00012052834],"category_scores_gemma":[0.000002814117,0.00017951518,0.00007068847,0.00044056028,0.000018377912,0.00022443573,0.000012060292,0.00021910419,0.000058505106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024915056,0.0024228906,0.004954836,0.00024753122,0.007580029,0.000047324225,0.023478901,0.1681431,0.043136954,0.033166353,0.03116957,0.68540335],"study_design_scores_gemma":[0.0009476339,0.00006049977,0.0017465941,0.00025875616,0.0004696134,0.0000012617631,0.0018197822,0.9318205,0.019655693,0.0031256033,0.039072372,0.001021663],"about_ca_topic_score_codex":0.0004741513,"about_ca_topic_score_gemma":0.000079823985,"teacher_disagreement_score":0.96451193,"about_ca_system_score_codex":0.00004922046,"about_ca_system_score_gemma":0.000023199233,"threshold_uncertainty_score":0.73204166},"labels":[],"label_agreement":null},{"id":"W4366309494","doi":"10.1109/access.2023.3268030","title":"Embedding and Trajectories of Temporal Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Access","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Japan Society for the Promotion of Science; Canada Research Chairs; Air Force Office of Scientific Research; Japan Science and Technology Agency; Sumitomo Foundation; National Science Foundation","keywords":"Embedding; Computer science; Temporal database; Trajectory; Scaling; Node (physics); Theoretical computer science; Sequence (biology); Artificial intelligence; Data mining; Mathematics","score_opus":0.026379817703463565,"score_gpt":0.3383292193140964,"score_spread":0.3119494016106328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366309494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9491696,0.00004209937,0.049110644,0.000026304997,0.00010712737,0.00007930287,0.0000056199274,0.00011966634,0.0013396634],"genre_scores_gemma":[0.9993089,0.000007349305,0.00022363922,0.00000699323,0.00030801276,0.000013876623,0.000017042576,0.000010683986,0.00010353928],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946725,0.000019276356,0.00015717479,0.00013407838,0.0000769415,0.00014526072],"domain_scores_gemma":[0.9996481,0.00006463322,0.00007903742,0.0001463428,0.000031268446,0.000030600608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010933198,0.00008008149,0.00017170509,0.00007557375,0.000056812012,0.000057349655,0.00017432506,0.000019128769,0.0000737952],"category_scores_gemma":[0.00000144158,0.000075354605,0.000054472155,0.00043798433,0.00004118001,0.00015367653,0.00007978798,0.00006679763,0.0000016746171],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010672904,0.000030289155,0.9413632,0.000018491992,0.00013510669,0.0000020820341,0.00019060161,0.012373662,0.00035711538,0.0036177093,0.013600415,0.028300626],"study_design_scores_gemma":[0.0008116758,0.00009438198,0.15243353,0.00018674048,0.00022321928,0.000001169928,0.0005584909,0.7545333,0.020423684,0.063473076,0.006322394,0.0009383616],"about_ca_topic_score_codex":0.00034812844,"about_ca_topic_score_gemma":0.000015121001,"teacher_disagreement_score":0.7889297,"about_ca_system_score_codex":0.0000036862157,"about_ca_system_score_gemma":0.000008670628,"threshold_uncertainty_score":0.30728716},"labels":[],"label_agreement":null},{"id":"W4366339426","doi":"10.1093/pnasnexus/pgad136","title":"Dimension matters when modeling network communities in hyperbolic spaces","year":2023,"lang":"en","type":"article","venue":"PNAS Nexus","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Salient; Curse of dimensionality; Dimension (graph theory); Hyperbolic geometry; Cluster analysis; Navigability; Computer science; Key (lock); Space (punctuation); Curvature; Similarity (geometry); Clustering coefficient; Hierarchical network model; Mathematics; Theoretical computer science; Geography; Artificial intelligence; Pure mathematics; Geometry; Image (mathematics); Differential geometry","score_opus":0.030597875748125742,"score_gpt":0.2666950844859741,"score_spread":0.23609720873784837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366339426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9822979,0.00021997857,0.008317514,0.0012793781,0.00012710993,0.00019565424,0.000004499082,0.00039980086,0.00715819],"genre_scores_gemma":[0.99799436,0.000015217297,0.0010297371,0.00024132716,0.00028794142,0.00003956449,0.000102866084,0.000026849504,0.00026211338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902993,0.000098139695,0.00022375766,0.00014743797,0.00012620064,0.0003745376],"domain_scores_gemma":[0.99941975,0.00010698672,0.000051840158,0.00035365648,0.00002384712,0.00004391747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025434195,0.00014567186,0.0002428227,0.00013827308,0.00013856699,0.00007118909,0.00021857455,0.000027114675,0.00019431472],"category_scores_gemma":[0.0000012348092,0.00014634401,0.00008545045,0.0004233462,0.00003017232,0.000099769575,0.00021952216,0.0001891733,0.000093210816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019962243,0.00007852285,0.12138448,0.000016227457,0.000122045545,0.000007415093,0.005000744,0.7861721,0.00016328375,0.017053,0.053982176,0.016000038],"study_design_scores_gemma":[0.00018175831,0.00001364915,0.0007748128,0.00009607865,0.000025078703,3.43604e-7,0.0018496792,0.8931286,0.000035354013,0.0962897,0.00736848,0.00023646154],"about_ca_topic_score_codex":0.004104206,"about_ca_topic_score_gemma":0.00030210667,"teacher_disagreement_score":0.12060966,"about_ca_system_score_codex":0.000022054255,"about_ca_system_score_gemma":0.000011924381,"threshold_uncertainty_score":0.6204359},"labels":[],"label_agreement":null},{"id":"W4366828699","doi":"10.1080/00207179.2023.2204969","title":"A comparison of centrality measures and their role in controlling the spread in epidemic networks","year":2023,"lang":"en","type":"article","venue":"International Journal of Control","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Ontario Tech University","funders":"Engineering and Physical Sciences Research Council; Research Center for Informatics, Czech Technical University in Prague; European Commission; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Centrality; Epidemic model; Computer science; Mathematical economics; Econometrics; Mathematics; Sociology; Statistics; Demography","score_opus":0.021955085368513694,"score_gpt":0.3283331487289689,"score_spread":0.3063780633604552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366828699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9364931,0.0011937622,0.060222976,0.0015347259,0.00013509076,0.00015074176,0.000010302763,0.000008050803,0.00025127555],"genre_scores_gemma":[0.9995989,0.000036619487,0.00003144535,0.000045307785,0.00027019787,0.0000054621364,0.0000025745564,0.000005370728,0.0000041311373],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866515,0.00019685637,0.00071057555,0.0000783847,0.00020578706,0.00014325221],"domain_scores_gemma":[0.99850863,0.0007237505,0.000475385,0.00007936342,0.00018370335,0.000029177561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012708927,0.000088555906,0.00040828425,0.00018392439,0.000017265374,0.000029446011,0.00031761968,0.000024315677,0.000017545475],"category_scores_gemma":[0.000047833797,0.0000589658,0.00014359981,0.00016301232,0.000043704287,0.000083541374,0.00003401514,0.00027367755,3.948397e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018494614,0.00007093997,0.8904843,8.508277e-7,0.00024975857,0.0000022948047,0.0003960978,0.072170794,0.0008937465,0.002729137,0.00013874097,0.032678407],"study_design_scores_gemma":[0.0027046937,0.00004254705,0.24263544,0.00016598268,0.00003781128,0.0000026987623,0.0008143457,0.7258829,0.00043676962,0.02637989,0.00079840666,0.000098521334],"about_ca_topic_score_codex":0.00025148454,"about_ca_topic_score_gemma":0.00014238515,"teacher_disagreement_score":0.6537121,"about_ca_system_score_codex":0.000031976473,"about_ca_system_score_gemma":0.00002849161,"threshold_uncertainty_score":0.24045555},"labels":[],"label_agreement":null},{"id":"W4366967256","doi":"10.1109/cbase57816.2022.00015","title":"Dynamic Community Detection in Weighted Graph Stream","year":2022,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Data stream clustering; Graph; CURE data clustering algorithm; Correlation clustering; Quality (philosophy); Machine learning; Artificial intelligence; Theoretical computer science","score_opus":0.008145666853225932,"score_gpt":0.2477288088192394,"score_spread":0.23958314196601346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366967256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96154016,0.0000080300415,0.021901911,0.000030116116,0.000028661074,0.000101433994,0.000007127357,0.0001038856,0.016278671],"genre_scores_gemma":[0.9990559,4.980162e-7,0.0004455889,0.00001936676,0.0000093042545,0.00007542051,0.00006325886,0.0000074674695,0.0003231983],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932075,0.00024458164,0.00013585533,0.00009014,0.00008808779,0.00012058628],"domain_scores_gemma":[0.99963427,0.00003575623,0.000042158186,0.00025685277,0.0000119562355,0.000019027975],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020604112,0.000070453716,0.00010548098,0.00014687996,0.00029302915,0.00001305571,0.00016980602,0.000007858204,0.0020520347],"category_scores_gemma":[4.2573797e-7,0.00007444476,0.00007324755,0.0005362438,0.000014127215,0.00003933598,0.00017673887,0.00039420425,0.000003660008],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007075989,0.0025928095,0.2790079,0.000009554474,0.0002875219,0.000003711426,0.0011050552,0.0023026306,0.007404271,0.033534985,0.0027365107,0.6709443],"study_design_scores_gemma":[0.0014563754,0.00045044188,0.10980774,0.000013154088,0.000096834425,0.0000028082181,0.008648111,0.34739655,0.008924071,0.5089431,0.013292831,0.00096797285],"about_ca_topic_score_codex":0.006406424,"about_ca_topic_score_gemma":0.0021356426,"teacher_disagreement_score":0.6699763,"about_ca_system_score_codex":0.000060336984,"about_ca_system_score_gemma":0.00000836163,"threshold_uncertainty_score":0.99886024},"labels":[],"label_agreement":null},{"id":"W4366967388","doi":"10.1109/cbase57816.2022.00021","title":"DynaMo Analyzation: Dynamic Community Detection by Incrementally Maximizing Modularity Analyzation","year":2022,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dynamo; Modularity (biology); Computer science; Artificial intelligence; Physics; Magnetic field","score_opus":0.006599748795957947,"score_gpt":0.23952447451658634,"score_spread":0.2329247257206284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366967388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37112716,0.000014773557,0.6231518,0.00008484061,0.00003252514,0.00017540058,0.000034914658,0.00016208728,0.0052165524],"genre_scores_gemma":[0.99660146,0.000001083018,0.0015549446,0.00007431483,0.000028720253,0.00008854993,0.0013024376,0.000018748384,0.0003297263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984407,0.00051947584,0.00031615107,0.00022009529,0.0002966567,0.00020692057],"domain_scores_gemma":[0.99920934,0.000041982617,0.00018696589,0.00044007084,0.000070436945,0.00005119428],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006510028,0.00015451643,0.00019606018,0.00016284625,0.0013419448,0.00007941105,0.00031284906,0.000020651854,0.0027901386],"category_scores_gemma":[0.0000032790178,0.00018097668,0.00014193948,0.0008071155,0.000028679156,0.00018926225,0.0003650777,0.00047191314,0.000003926331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017228616,0.0036869084,0.27232745,0.000048835667,0.0021152685,0.0000028143734,0.0013853614,0.0827741,0.17985456,0.021839289,0.008648007,0.4271451],"study_design_scores_gemma":[0.00044200048,0.00012776961,0.007848023,0.0000036395954,0.00016893477,0.0000014929492,0.0019270644,0.96479195,0.0032680174,0.017901193,0.0030744623,0.0004454553],"about_ca_topic_score_codex":0.0052375416,"about_ca_topic_score_gemma":0.0008468314,"teacher_disagreement_score":0.88201785,"about_ca_system_score_codex":0.00027420465,"about_ca_system_score_gemma":0.00001720276,"threshold_uncertainty_score":0.99995816},"labels":[],"label_agreement":null},{"id":"W4366997883","doi":"10.1093/ve/vead026","title":"From components to communities: bringing network science to clustering for molecular epidemiology","year":2023,"lang":"en","type":"article","venue":"Virus Evolution","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Canadian Institutes of Health Research","keywords":"Cluster analysis; Pairwise comparison; Connected component; Computer science; Cluster (spacecraft); Graph; Node (physics); Markov chain; Context (archaeology); Component (thermodynamics); Data mining; Clustering coefficient; Set (abstract data type); Theoretical computer science; Artificial intelligence; Biology; Machine learning; Computer network","score_opus":0.05540046150865375,"score_gpt":0.34179654571048873,"score_spread":0.286396084201835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366997883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44608355,0.000014133763,0.5530793,0.00010868538,0.00011066027,0.0002213663,0.000022634082,0.00012674676,0.00023290608],"genre_scores_gemma":[0.9750914,7.0919543e-7,0.023960158,0.00021722472,0.00043885314,0.0001374765,0.00010647279,0.000017698532,0.000030024847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987378,0.00009046593,0.00026944553,0.00026173686,0.00011390694,0.00052660843],"domain_scores_gemma":[0.99904823,0.00028375853,0.00007384157,0.00039726883,0.00007428239,0.00012260184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008858483,0.00012247691,0.00024714993,0.00023048055,0.00041601967,0.000033708762,0.00039711638,0.000023077588,0.00003365381],"category_scores_gemma":[0.000024967634,0.00014089988,0.00009307874,0.001019575,0.000053880038,0.00007992345,0.00047468924,0.00008587388,0.00008579937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007512826,0.0000551226,0.058165874,0.000011254604,0.00013491348,8.6842124e-7,0.0015511544,0.7860726,0.08609753,0.028589243,0.017530994,0.021715282],"study_design_scores_gemma":[0.00018734873,0.0000673297,0.03866595,0.00014024934,0.000037203437,1.5732883e-7,0.0004483505,0.8944282,0.0013112376,0.055308945,0.009065103,0.00033993396],"about_ca_topic_score_codex":0.009622095,"about_ca_topic_score_gemma":0.00021560358,"teacher_disagreement_score":0.5291192,"about_ca_system_score_codex":0.00013923862,"about_ca_system_score_gemma":0.00002378655,"threshold_uncertainty_score":0.9969729},"labels":[],"label_agreement":null},{"id":"W4367147746","doi":"10.1109/hipc56025.2022.00028","title":"IMpart: A Partitioning-based Parallel Approach to Accelerate Influence Maximization","year":2022,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Pacific Northwest National Laboratory","keywords":"Computer science; Maximization; Greedy algorithm; Graph partition; Graph; Parallel computing; Theoretical computer science; Speedup; Key (lock); Set (abstract data type); Shared memory; Distributed computing; Mathematical optimization; Algorithm; Mathematics","score_opus":0.015220261853601995,"score_gpt":0.25185821670964215,"score_spread":0.23663795485604014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367147746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12627077,0.0000057774246,0.8425469,0.00031284743,0.000016658487,0.0003681098,0.000014607282,0.0002084981,0.030255836],"genre_scores_gemma":[0.97993386,8.994593e-8,0.018096318,0.0006053012,0.000052238072,0.0007023332,0.00018192438,0.000013034204,0.00041489062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990971,0.00006933941,0.00019355345,0.0002513444,0.0001824098,0.00020625487],"domain_scores_gemma":[0.99952346,0.000017933939,0.000067354384,0.00026591387,0.000052659223,0.00007265466],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014905726,0.00010824452,0.00013553479,0.00008918157,0.0003123539,0.00007841994,0.00021341031,0.000008356886,0.0019375212],"category_scores_gemma":[0.000001886573,0.00011200589,0.00007812664,0.0005526918,0.000012741069,0.00008603273,0.00014213342,0.00010906568,0.00002598922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013710993,0.00017179188,0.021110043,0.0000016749774,0.00002271055,1.9732906e-7,0.00006775581,0.938977,0.0001234306,0.029367262,0.009291838,0.0008525938],"study_design_scores_gemma":[0.00061697623,0.00014303587,0.010285615,0.00000660532,0.000058646085,7.03806e-7,0.00028315923,0.93380183,0.0012881281,0.0142894,0.038624965,0.0006009194],"about_ca_topic_score_codex":0.00022036144,"about_ca_topic_score_gemma":0.0000043107684,"teacher_disagreement_score":0.8536631,"about_ca_system_score_codex":0.000037916136,"about_ca_system_score_gemma":0.000041146606,"threshold_uncertainty_score":0.99897486},"labels":[],"label_agreement":null},{"id":"W4367852399","doi":"10.1093/pnasnexus/pgad150","title":"Dimension reduction of dynamics on modular and heterogeneous directed networks","year":2023,"lang":"en","type":"article","venue":"PNAS Nexus","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; Université Laval","keywords":"Adjacency matrix; Observable; Dynamical systems theory; Computer science; Dimension (graph theory); Modular design; Reduction (mathematics); Network dynamics; System dynamics; Theoretical computer science; Ode; Representation (politics); Mathematics; Graph; Applied mathematics; Artificial intelligence; Discrete mathematics; Pure mathematics","score_opus":0.009167344276582053,"score_gpt":0.24236945992395756,"score_spread":0.2332021156473755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367852399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880751,0.000068398214,0.010136502,0.00004640795,0.00010796716,0.0001364411,0.0000069804173,0.00026309417,0.0011591316],"genre_scores_gemma":[0.99917567,0.000015118864,0.00032485952,0.0000055725386,0.00014580274,0.0000121318935,0.00012707325,0.00001722138,0.00017657781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993493,0.000039947212,0.00016062276,0.00019836852,0.00009754822,0.0001542274],"domain_scores_gemma":[0.9995829,0.0000345332,0.0000813194,0.00022382535,0.000038405597,0.000039048307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007999428,0.000104281724,0.00017513646,0.00009025339,0.00006523071,0.000014439039,0.00005964342,0.000031376476,0.000024273219],"category_scores_gemma":[0.0000020658158,0.00010211617,0.00006704895,0.0003565946,0.0000321325,0.000028794271,0.0000634775,0.000084785774,0.000005104962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012213885,0.00031066436,0.015660826,0.000027510812,0.00050833734,0.000012044733,0.00031598518,0.6042217,0.007881624,0.026230233,0.0048507885,0.3398581],"study_design_scores_gemma":[0.0001131315,0.00006320961,0.0018535291,0.000025043277,0.000038499522,0.0000012405487,0.000025646312,0.9876064,0.0023230931,0.0076479274,0.00018983535,0.00011242447],"about_ca_topic_score_codex":0.000120869336,"about_ca_topic_score_gemma":0.0000059271033,"teacher_disagreement_score":0.3833847,"about_ca_system_score_codex":0.000019026154,"about_ca_system_score_gemma":0.000004619482,"threshold_uncertainty_score":0.4164177},"labels":[],"label_agreement":null},{"id":"W4375950726","doi":"10.1002/cjce.24953","title":"Cascading failure invulnerability analysis of chemical material network considering failure propagation capability","year":2023,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cascading failure; Flammable liquid; Enhanced Data Rates for GSM Evolution; Process (computing); Network topology; Computer science; Explosive material; Fault (geology); Topology (electrical circuits); Reliability engineering; Nonlinear system; Engineering; Computer network; Artificial intelligence","score_opus":0.00940280814538951,"score_gpt":0.21530880720484688,"score_spread":0.20590599905945736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4375950726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9975062,0.000015845335,0.0018298923,0.0003800076,0.00007883114,0.00010285544,0.000025448344,0.000032785072,0.00002815445],"genre_scores_gemma":[0.9980422,1.3832585e-7,0.0013425894,0.0000083796285,0.0005424809,0.000007065513,0.0000360785,0.000019247851,0.0000017922366],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99849236,0.00005380487,0.0006618136,0.00016740475,0.00022348178,0.00040115215],"domain_scores_gemma":[0.99873966,0.00022032752,0.0002682,0.0003009185,0.0001982988,0.0002725753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088234135,0.00018096036,0.00055665505,0.0002684555,0.000075056254,0.00006821712,0.00034377995,0.000079597354,0.0002540733],"category_scores_gemma":[0.00012569314,0.00015042776,0.00038006608,0.0015644205,0.0001160835,0.00010348124,0.000050368446,0.00043877773,0.0000010669346],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033705244,0.000028717528,0.0458971,0.000101538724,0.0033013255,0.000018688552,0.0011049988,0.40994838,0.529299,0.0054321624,0.0030680052,0.0017663692],"study_design_scores_gemma":[0.00043234855,0.000032380645,0.0025709772,0.00023085717,0.0021772885,0.00002102047,0.0001631243,0.3259925,0.66053814,0.0062313955,0.0009404463,0.0006695543],"about_ca_topic_score_codex":0.0019030956,"about_ca_topic_score_gemma":0.00050805556,"teacher_disagreement_score":0.13123912,"about_ca_system_score_codex":0.00019262594,"about_ca_system_score_gemma":0.0002150673,"threshold_uncertainty_score":0.6134266},"labels":[],"label_agreement":null},{"id":"W4376608015","doi":"10.1007/978-3-031-32296-9_12","title":"The Iterated Local Transitivity Model for Tournaments","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Transitive relation; Iterated function; Tournament; Computer science; Generative model; Generative grammar; Graph; Theoretical computer science; Artificial intelligence; Mathematical economics; Mathematics; Combinatorics","score_opus":0.0227167863133305,"score_gpt":0.2724438188482939,"score_spread":0.2497270325349634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376608015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057945676,0.000031165204,0.99794847,0.00036757038,0.00022378085,0.00037563787,0.000030463694,0.000080012185,0.00088495185],"genre_scores_gemma":[0.9583679,0.000008780527,0.03847685,0.00023076573,0.0007380654,0.000049566726,0.000039402294,0.00005624485,0.0020324672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829745,0.00001593205,0.00030855692,0.0005943503,0.00035868547,0.000425038],"domain_scores_gemma":[0.9986877,0.00045729126,0.0001407187,0.00048909266,0.0001597711,0.0000654344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057069573,0.00029058257,0.00032205673,0.00017279657,0.00040422988,0.0002804758,0.00080868043,0.00008394956,0.000010731745],"category_scores_gemma":[0.000005242966,0.0002161502,0.00020429137,0.00024202798,0.0004177821,0.00009453328,0.00021294843,0.000409396,0.000006277993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008751097,0.0000119648785,0.000023351466,0.0000050805797,0.00003420047,0.0000018172021,0.00015723167,0.26050338,0.000023571773,0.0173344,0.00010528662,0.72179097],"study_design_scores_gemma":[0.000075881144,0.000020616317,0.000006044504,0.00006853262,0.000013800256,3.498748e-7,1.1410449e-7,0.6862917,0.0001633005,0.31279418,0.0004014955,0.00016399955],"about_ca_topic_score_codex":0.000023434726,"about_ca_topic_score_gemma":0.00012714314,"teacher_disagreement_score":0.95947164,"about_ca_system_score_codex":0.00009981128,"about_ca_system_score_gemma":0.00018083423,"threshold_uncertainty_score":0.881435},"labels":[],"label_agreement":null},{"id":"W4376608266","doi":"10.1007/978-3-031-32296-9_4","title":"Modularity Based Community Detection in Hypergraphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Modularity (biology); Computer science; Hypergraph; Scalability; Graph; Obstacle; Theoretical computer science; Function (biology); Community structure; Algorithm; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.02156529488096081,"score_gpt":0.25681810889774537,"score_spread":0.23525281401678455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376608266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004212152,0.000017925,0.9923579,0.000068599,0.0002522334,0.00023924962,0.000008243507,0.00014527234,0.002698412],"genre_scores_gemma":[0.98391473,0.0000018856188,0.01559794,0.00012032467,0.0002148391,0.000014900453,0.00002452976,0.00003112311,0.00007971573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982271,0.000095283816,0.00035750706,0.0005557235,0.00039273856,0.00037164462],"domain_scores_gemma":[0.9983587,0.00041007946,0.00015625932,0.00091015414,0.000100282836,0.00006450599],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009805412,0.0003251314,0.00042968694,0.00092499185,0.0002583291,0.00012870703,0.00096264674,0.00014662699,0.000044137578],"category_scores_gemma":[0.000015341564,0.00033366866,0.00017366304,0.00089425733,0.00034798754,0.00011090951,0.00045460078,0.0014999078,0.000013593146],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008206741,0.000083366445,0.004471592,0.000022263988,0.0000211505,0.000009343604,0.00017818664,0.07640299,0.00029733666,0.004291605,0.000009180674,0.9142048],"study_design_scores_gemma":[0.00015856946,0.000056236913,0.0022273792,0.00020254946,0.000013035097,6.183161e-7,3.4161147e-7,0.5395612,0.0020466244,0.45517373,0.0001622488,0.00039747165],"about_ca_topic_score_codex":0.001387278,"about_ca_topic_score_gemma":0.002753997,"teacher_disagreement_score":0.9797026,"about_ca_system_score_codex":0.00015526422,"about_ca_system_score_gemma":0.00012747952,"threshold_uncertainty_score":0.99991155},"labels":[],"label_agreement":null},{"id":"W4376654364","doi":"10.48550/arxiv.2305.08750","title":"Fast and Attributed Change Detection on Dynamic Graphs with Density of States","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Snapshot (computer storage); Computer science; Scalability; Embedding; Robustness (evolution); Graph embedding; Theoretical computer science; Graph; Data mining; Distributed computing; Algorithm; Artificial intelligence; Database","score_opus":0.06258465063255421,"score_gpt":0.19654381501978332,"score_spread":0.1339591643872291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376654364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.862002,0.0000056960957,0.13738906,0.00001185353,0.00003337382,0.0002581078,0.000086172695,0.00013039108,0.00008334011],"genre_scores_gemma":[0.9994714,0.000062005936,0.000084633386,0.000005029007,0.000023764544,0.0000028574148,0.0001740408,0.000023387267,0.0001528557],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990201,0.00006948369,0.00012560564,0.00054073194,0.00005909471,0.00018500125],"domain_scores_gemma":[0.9990817,0.000060741208,0.0002438486,0.0004255983,0.0001242782,0.00006386692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010093515,0.00023252355,0.00035684288,0.00029608794,0.00009111148,0.000019160047,0.00018537535,0.00008278562,0.000016716644],"category_scores_gemma":[0.0000011362686,0.00024305923,0.00013168315,0.0005589938,0.00010631902,0.00006151473,0.00036470484,0.00031257907,0.000005030701],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005195066,0.00039596413,0.8627735,0.00023150547,0.0021096524,0.00008459724,0.00043811358,0.08423897,0.0003179605,0.026235241,0.00010081278,0.022554172],"study_design_scores_gemma":[0.0010985467,0.00049346004,0.2973335,0.00054163253,0.0011773168,0.0000010773449,0.0006659556,0.5160226,0.0028375203,0.17860956,0.000073695264,0.0011450887],"about_ca_topic_score_codex":0.0018115221,"about_ca_topic_score_gemma":0.00092892884,"teacher_disagreement_score":0.56544,"about_ca_system_score_codex":0.00005723509,"about_ca_system_score_gemma":0.00001820732,"threshold_uncertainty_score":0.9911668},"labels":[],"label_agreement":null},{"id":"W4377291738","doi":"10.1007/s41109-023-00552-9","title":"Artificial benchmark for community detection with outliers (ABCD+o)","year":2023,"lang":"en","type":"article","venue":"Applied Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowa Agencja Wymiany Akademickiej","keywords":"Outlier; Benchmark (surveying); Graph; Computer science; Algorithm; Artificial intelligence; Theoretical computer science","score_opus":0.02278584467634691,"score_gpt":0.27435481168246406,"score_spread":0.25156896700611714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377291738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66631573,0.0000045003435,0.30983883,0.00006276992,0.00017504203,0.0008399288,0.000008153124,0.0005079275,0.022247108],"genre_scores_gemma":[0.99552125,6.218199e-7,0.0035502058,0.000047673893,0.00050668634,0.00026357695,0.000035018536,0.000016821885,0.00005816287],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985724,0.000032999094,0.00020450902,0.00031930523,0.00028342998,0.00058733666],"domain_scores_gemma":[0.9990074,0.00021373211,0.00011657168,0.0004829122,0.00008233598,0.00009703278],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014654703,0.00015175821,0.00018849676,0.00013052438,0.0016308763,0.0001279451,0.0005168871,0.000025450627,0.000036056103],"category_scores_gemma":[0.0000053277663,0.0001352618,0.000065486056,0.0029108976,0.000414056,0.000113417445,0.00016111747,0.0002362063,0.000027416932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024622335,0.00020198381,0.012954474,0.000018610912,0.00013819072,7.864423e-7,0.0011601165,0.065140076,0.026789581,0.20296912,0.012741059,0.6776398],"study_design_scores_gemma":[0.00083010184,0.0005547926,0.025553623,0.00007468962,0.000253297,0.0000015597697,0.00322895,0.21156274,0.066607825,0.6668476,0.022759443,0.0017254066],"about_ca_topic_score_codex":0.00010430061,"about_ca_topic_score_gemma":0.0001196361,"teacher_disagreement_score":0.67591435,"about_ca_system_score_codex":0.000042235777,"about_ca_system_score_gemma":0.00006916794,"threshold_uncertainty_score":0.99966884},"labels":[],"label_agreement":null},{"id":"W4378174996","doi":"10.1007/978-3-031-33614-0_14","title":"NODDLE: Node2vec Based Deep Learning Model for Link Prediction","year":2023,"lang":"en","type":"preprint","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Lakehead University","keywords":"Computer science; Artificial intelligence; Deep learning; Stochastic gradient descent; Machine learning; Artificial neural network; Feature learning; Representation (politics); Economic shortage; Graph; Data mining; Theoretical computer science","score_opus":0.034189837986185814,"score_gpt":0.27337159539391476,"score_spread":0.23918175740772896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378174996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018211709,0.00005073239,0.9962806,0.00060053275,0.00026287942,0.00064714934,0.00017090612,0.00013411566,0.000031905678],"genre_scores_gemma":[0.32638565,0.000008326964,0.67289364,0.000026852176,0.0002166268,0.0001575686,0.00029426676,0.000014514478,0.0000025327963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893075,0.000015863354,0.00053482567,0.00014850694,0.00015381716,0.00021625552],"domain_scores_gemma":[0.99865097,0.0003212211,0.00040173545,0.00041133835,0.00018390919,0.000030820156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043835526,0.00021200565,0.00031539676,0.0001746978,0.00090947346,0.0001847214,0.0009931575,0.00012304694,5.317484e-7],"category_scores_gemma":[0.000038923026,0.00018570042,0.00029739647,0.00034056,0.0001621763,0.00012502915,0.0007771517,0.00047204297,1.2191784e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011426665,0.000013611443,0.00009335828,0.00013094286,0.00007126214,2.2055282e-9,0.0007317671,0.9836028,0.000007880876,0.0015151248,0.0000333938,0.013798702],"study_design_scores_gemma":[0.00014249704,0.000020449994,0.000083231804,0.00012711418,0.00008503268,1.1725793e-7,0.00000757314,0.9958855,0.00007347434,0.002456302,0.0009472427,0.00017147798],"about_ca_topic_score_codex":0.00008015949,"about_ca_topic_score_gemma":0.000050510887,"teacher_disagreement_score":0.3245645,"about_ca_system_score_codex":0.00004403368,"about_ca_system_score_gemma":0.0001359638,"threshold_uncertainty_score":0.7572643},"labels":[],"label_agreement":null},{"id":"W4378419882","doi":"10.1007/978-3-031-33374-3_2","title":"Fast and Attributed Change Detection on Dynamic Graphs with Density of States","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Canadian Institute for Advanced Research; McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Snapshot (computer storage); Scalability; Embedding; Robustness (evolution); Graph embedding; Theoretical computer science; Graph; Data mining; Algorithm; Artificial intelligence; Database","score_opus":0.015272859584902012,"score_gpt":0.2403515029826993,"score_spread":0.2250786433977973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378419882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015494278,0.00002177957,0.98385936,0.000047086214,0.00008500473,0.00026605613,0.000022359724,0.00007372399,0.00013033386],"genre_scores_gemma":[0.9931333,0.00001529206,0.0066305157,0.000043348347,0.00007434923,0.00000949728,0.00002969339,0.00002305113,0.000040918472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986853,0.000015863068,0.00019914698,0.000557668,0.00030855782,0.00023344382],"domain_scores_gemma":[0.9991048,0.00016325222,0.00019368443,0.0003586863,0.00013000259,0.000049566563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021766611,0.0002585281,0.00037358457,0.0004944603,0.000108025764,0.000052882395,0.00026933366,0.00006849361,0.000007834251],"category_scores_gemma":[0.0000021489489,0.00021441033,0.00006473988,0.0005062103,0.0003739244,0.000077053686,0.00021044126,0.00031896128,0.0000021244211],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018905901,0.000019713685,0.0043051993,0.000020315645,0.000048194775,0.0000054345483,0.0001999134,0.0044114655,0.00013830476,0.0020566813,0.0000018389879,0.98877406],"study_design_scores_gemma":[0.00041765315,0.0008478011,0.019432802,0.0009916334,0.00010617694,0.0000066901566,0.0000016569315,0.5451373,0.007585346,0.4244482,0.00008795225,0.0009368156],"about_ca_topic_score_codex":0.00018628941,"about_ca_topic_score_gemma":0.00066972943,"teacher_disagreement_score":0.9878372,"about_ca_system_score_codex":0.000049113496,"about_ca_system_score_gemma":0.00003167367,"threshold_uncertainty_score":0.87433994},"labels":[],"label_agreement":null},{"id":"W4379140848","doi":"10.1016/j.asoc.2023.110486","title":"A multi-objective genetic algorithm for compression of weighted graphs to simplify epidemic analysis","year":2023,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compression (physics); Distortion (music); Algorithm; Data compression; Mathematical optimization; Mathematics","score_opus":0.017220786713748326,"score_gpt":0.30313684976329686,"score_spread":0.28591606304954853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379140848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17811906,0.000016604834,0.8208178,0.0000144561345,0.000028538083,0.00059167336,0.000036330828,0.00023640416,0.00013911506],"genre_scores_gemma":[0.6892086,6.509656e-7,0.3104284,0.000032447275,0.00008751957,0.000074834854,0.00012876427,0.000024970512,0.000013779675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816686,0.000054176868,0.000594352,0.0005451489,0.00019168136,0.00044777212],"domain_scores_gemma":[0.99833685,0.0006846299,0.0003175482,0.0004034499,0.00014577685,0.00011173159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003886682,0.0002428906,0.00069624296,0.0006190517,0.00023124456,0.00002679488,0.00032800616,0.00005486115,0.00002431937],"category_scores_gemma":[0.000007188176,0.0002457357,0.00044019156,0.0029809366,0.00004054192,0.000020374,0.00029217516,0.00014176768,0.000013999039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002783746,0.00021714062,0.03707518,0.00003117346,0.0027498903,9.912457e-7,0.0011752824,0.099355556,0.01096707,0.0028087331,0.0018012128,0.84378994],"study_design_scores_gemma":[0.00041058142,0.000028590339,0.02027441,0.000025762132,0.00047863703,8.012436e-8,0.00023446105,0.96630955,0.0027989247,0.008985003,0.00018401773,0.00026996023],"about_ca_topic_score_codex":0.00019165874,"about_ca_topic_score_gemma":0.0000063515176,"teacher_disagreement_score":0.866954,"about_ca_system_score_codex":0.000026518788,"about_ca_system_score_gemma":0.000022289816,"threshold_uncertainty_score":0.99999946},"labels":[],"label_agreement":null},{"id":"W4379258818","doi":"10.4230/lipics.approx/random.2023.58","title":"Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Streaming algorithm; Mathematics; Combinatorics; Vertex (graph theory); Graph partition; Partition (number theory); Frustration; Discrete mathematics; Graph; Algorithm; Upper and lower bounds","score_opus":0.14761540040996254,"score_gpt":0.28669426307099405,"score_spread":0.1390788626610315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379258818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7008509,0.000013898298,0.2978576,0.000019051118,0.00019821823,0.0006798829,0.0001293712,0.00014024322,0.00011082501],"genre_scores_gemma":[0.99724525,0.000003370073,0.0017013844,0.0000049917294,0.0005475665,0.00001815791,0.0003298968,0.000041780662,0.00010760547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976338,0.00021057058,0.0003805427,0.0011099216,0.000113928436,0.0005512343],"domain_scores_gemma":[0.9984268,0.00033056975,0.0004418194,0.000513872,0.00021121299,0.000075717806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005784142,0.00037859028,0.0005911793,0.00018842475,0.0002745252,0.00007428479,0.00057792757,0.00017062835,0.00008213316],"category_scores_gemma":[0.000020532772,0.0004576961,0.00044632918,0.0006120174,0.000100904224,0.00006463139,0.000921429,0.00063273206,0.000003668822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043570446,0.00004698627,0.046026867,0.00004008618,0.0001530054,0.000006999518,0.00023568577,0.942883,0.000012241113,0.007360091,0.00006968796,0.0031217437],"study_design_scores_gemma":[0.00049167906,0.000024844248,0.008185446,0.00008018564,0.0001453013,3.777154e-8,0.00062686374,0.9472893,0.000030904182,0.042723585,0.000006654671,0.00039520956],"about_ca_topic_score_codex":0.0006877054,"about_ca_topic_score_gemma":0.00014945415,"teacher_disagreement_score":0.29639435,"about_ca_system_score_codex":0.00041352012,"about_ca_system_score_gemma":0.00013448019,"threshold_uncertainty_score":0.99978745},"labels":[],"label_agreement":null},{"id":"W4379983135","doi":"10.32920/23458238.v1","title":"The Iterated Local Directed Transitivity Model","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Transitive relation; Iterated function; Directed graph; Combinatorics; Transitive reduction; Mathematics; Undirected graph; Eigenvalues and eigenvectors; Graph; Adjacency matrix; Discrete mathematics; Strongly connected component; Line graph; Voltage graph","score_opus":0.030030120439390632,"score_gpt":0.2865987302365409,"score_spread":0.2565686097971503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379983135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071803266,0.000026938931,0.9762792,0.0006593858,0.000095403644,0.0003057552,0.000081606086,0.0012614803,0.014109916],"genre_scores_gemma":[0.99103755,0.000010660517,0.0016130132,0.000023784685,0.00023991996,0.00015275022,0.0003458427,0.000042775802,0.006533705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986624,0.0001123577,0.00030631718,0.00043149898,0.00019124328,0.00029619783],"domain_scores_gemma":[0.99887913,0.00015982303,0.00010211169,0.0006717087,0.00012808428,0.000059126185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028387012,0.00027229756,0.00033847205,0.000056280656,0.00021647906,0.00019975117,0.00040494875,0.000092432856,0.00013101519],"category_scores_gemma":[0.000002135228,0.0001901246,0.0003455412,0.00022226005,0.00008859625,0.000027971277,0.00044054998,0.0006055285,0.0000393955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006640565,0.00030824324,0.0021620754,0.000044489407,0.0022633586,0.000007141985,0.0005275208,0.5338892,0.00027669728,0.10939028,0.1303044,0.22076021],"study_design_scores_gemma":[0.000051439038,0.0000032138196,0.00020517182,0.000027217286,0.0000712275,4.1890168e-8,0.000024464109,0.89316225,0.00039872035,0.10503017,0.00081675674,0.00020931315],"about_ca_topic_score_codex":0.0011514862,"about_ca_topic_score_gemma":0.0003317986,"teacher_disagreement_score":0.9838572,"about_ca_system_score_codex":0.000035575475,"about_ca_system_score_gemma":0.000097008844,"threshold_uncertainty_score":0.7753056},"labels":[],"label_agreement":null},{"id":"W4380080441","doi":"10.32920/23458238","title":"The Iterated Local Directed Transitivity Model","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Transitive relation; Iterated function; Directed graph; Combinatorics; Transitive reduction; Mathematics; Undirected graph; Eigenvalues and eigenvectors; Graph; Adjacency matrix; Discrete mathematics; Strongly connected component; Line graph; Voltage graph","score_opus":0.030030120439390632,"score_gpt":0.2865987302365409,"score_spread":0.2565686097971503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380080441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071803266,0.000026938931,0.9762792,0.0006593858,0.000095403644,0.0003057552,0.000081606086,0.0012614803,0.014109916],"genre_scores_gemma":[0.99103755,0.000010660517,0.0016130132,0.000023784685,0.00023991996,0.00015275022,0.0003458427,0.000042775802,0.006533705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986624,0.0001123577,0.00030631718,0.00043149898,0.00019124328,0.00029619783],"domain_scores_gemma":[0.99887913,0.00015982303,0.00010211169,0.0006717087,0.00012808428,0.000059126185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028387012,0.00027229756,0.00033847205,0.000056280656,0.00021647906,0.00019975117,0.00040494875,0.000092432856,0.00013101519],"category_scores_gemma":[0.000002135228,0.0001901246,0.0003455412,0.00022226005,0.00008859625,0.000027971277,0.00044054998,0.0006055285,0.0000393955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006640565,0.00030824324,0.0021620754,0.000044489407,0.0022633586,0.000007141985,0.0005275208,0.5338892,0.00027669728,0.10939028,0.1303044,0.22076021],"study_design_scores_gemma":[0.000051439038,0.0000032138196,0.00020517182,0.000027217286,0.0000712275,4.1890168e-8,0.000024464109,0.89316225,0.00039872035,0.10503017,0.00081675674,0.00020931315],"about_ca_topic_score_codex":0.0011514862,"about_ca_topic_score_gemma":0.0003317986,"teacher_disagreement_score":0.9838572,"about_ca_system_score_codex":0.000035575475,"about_ca_system_score_gemma":0.000097008844,"threshold_uncertainty_score":0.7753056},"labels":[],"label_agreement":null},{"id":"W4380884856","doi":"10.1016/j.chemolab.2023.104896","title":"A key review on graph data science: The power of graphs in scientific studies","year":2023,"lang":"en","type":"review","venue":"Chemometrics and Intelligent Laboratory Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Alberta","keywords":"Computer science; Visualization; Theoretical computer science; Graph drawing; Data science; Power graph analysis; Data visualization; Graph; Biological network; Popularity; Data mining; Mathematics","score_opus":0.19352480887168022,"score_gpt":0.41910726820589744,"score_spread":0.22558245933421722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380884856","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006000873,0.9971207,0.000032212723,0.000010544992,0.00066989486,0.0013336915,0.00041883864,0.000034160155,0.00031998253],"genre_scores_gemma":[0.0010870675,0.9983451,0.000012477247,0.000013614139,0.00007848768,0.00016346104,0.0001384696,0.000041538584,0.00011981922],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99593973,0.000250444,0.0014879447,0.0010424755,0.0008748936,0.00040450704],"domain_scores_gemma":[0.9950589,0.00069561554,0.0010458381,0.0023234943,0.00077351124,0.00010262053],"candidate_categories":["metaepi_narrow","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.007348974,0.00046553116,0.0022874277,0.003142361,0.00025920224,0.00028232424,0.0020985035,0.00008057158,0.000016125252],"category_scores_gemma":[0.00044284572,0.00028570864,0.00026901098,0.033376392,0.0008816074,0.00017621102,0.0009807863,0.0004600573,0.000023097613],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039428337,0.0005461617,0.0006703278,0.12970966,0.002521755,0.000011101554,0.00059233786,0.000007814448,0.000003291493,0.08433038,0.09377254,0.6878307],"study_design_scores_gemma":[0.000028490425,0.000040367242,0.0000021316541,0.04779623,0.0004194754,4.9583394e-7,0.00041199726,0.0000309132,0.00000848049,0.00027306142,0.95068485,0.00030352495],"about_ca_topic_score_codex":0.000043331365,"about_ca_topic_score_gemma":0.0000031122224,"teacher_disagreement_score":0.8569123,"about_ca_system_score_codex":0.00009948598,"about_ca_system_score_gemma":0.00044885458,"threshold_uncertainty_score":0.9999595},"labels":[],"label_agreement":null},{"id":"W4380985995","doi":"10.1371/journal.pcbi.1011188","title":"Distinguishing between different percolation regimes in noisy dynamic networks with an application to epileptic seizures","year":2023,"lang":"en","type":"article","venue":"PLoS Computational Biology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Army Research Office; National Institute of Biomedical Imaging and Bioengineering; National Institute of Neurological Disorders and Stroke; National Institutes of Health","keywords":"Percolation (cognitive psychology); Percolation theory; Computer science; Percolation threshold; Complex network; Continuum percolation theory; Epilepsy; Neuroscience; Directed percolation; Markov chain; Random graph; Statistical physics; Artificial intelligence; Graph; Physics; Topology (electrical circuits); Psychology; Machine learning; Theoretical computer science; Mathematics; Percolation critical exponents; Combinatorics","score_opus":0.013499752779253084,"score_gpt":0.29112621222923907,"score_spread":0.277626459449986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380985995","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61760324,0.000003755494,0.3817476,0.00017515944,0.000009363642,0.00023066257,0.000012690847,0.000115781804,0.00010173134],"genre_scores_gemma":[0.99041003,4.6245924e-7,0.005943587,0.000036041383,0.00020874385,0.00015754769,0.0032102796,0.000018392502,0.0000149083335],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893063,0.00011447379,0.0002602304,0.0003612609,0.00010214306,0.00023124658],"domain_scores_gemma":[0.9992565,0.00033810225,0.00010497991,0.0001580327,0.00007836957,0.000064040774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012467016,0.00014640599,0.00024506464,0.00021103256,0.000104654704,0.00003606652,0.00016602423,0.00004388509,0.000020780419],"category_scores_gemma":[0.000008448226,0.00012938696,0.00003710575,0.00053849065,0.00003464208,0.00006126583,0.000073035844,0.00013882418,0.000016238655],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018112081,0.00006618996,0.61741674,0.000004574086,0.000061521096,6.483584e-7,0.00015242817,0.35790026,0.000104097424,0.008231622,0.000046437795,0.01599735],"study_design_scores_gemma":[0.00010074002,0.00007594813,0.37611222,0.00001670655,0.000017355671,1.7341989e-7,0.00003282918,0.60076904,0.0000054307584,0.022725916,0.000029750776,0.00011391245],"about_ca_topic_score_codex":0.00011969391,"about_ca_topic_score_gemma":0.000121589816,"teacher_disagreement_score":0.375804,"about_ca_system_score_codex":0.000056050947,"about_ca_system_score_gemma":0.000018256847,"threshold_uncertainty_score":0.5276247},"labels":[],"label_agreement":null},{"id":"W4382338480","doi":"10.1007/978-3-031-36027-5_48","title":"Heuristic Modularity Maximization Algorithms for Community Detection Rarely Return an Optimal Partition or Anything Similar","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Toronto","funders":"University of Toronto","keywords":"Computer science; Partition (number theory); Modularity (biology); Maximization; Heuristic; Algorithm; Partition problem; Artificial intelligence; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.04970978773629333,"score_gpt":0.29851895620924224,"score_spread":0.2488091684729489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382338480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014692604,0.0000138673895,0.9971294,0.000058002013,0.00036032937,0.00054613146,0.000046173303,0.00024716658,0.00012969717],"genre_scores_gemma":[0.7956154,0.0000062600075,0.2027396,0.00011156858,0.0009552199,0.000054942393,0.0003319872,0.000067061235,0.00011798376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980013,0.00011050502,0.0004391413,0.0006707196,0.00038766026,0.00039070114],"domain_scores_gemma":[0.9980017,0.0005437731,0.0003021345,0.00076126435,0.00029466214,0.00009646458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011426791,0.00036365498,0.00044326848,0.00039883546,0.0007525891,0.00032721795,0.0007173912,0.000186229,0.000038689588],"category_scores_gemma":[0.00006493388,0.0003478956,0.0001528446,0.0004412958,0.00024647405,0.00036886154,0.00033815205,0.0009130622,0.0000027922688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061025414,0.0000840019,0.00015792022,0.000052581236,0.00004548736,0.000005746346,0.00056236086,0.24629955,0.0001649064,0.001339188,0.000020270694,0.751207],"study_design_scores_gemma":[0.00014663344,0.0002133828,0.0001192868,0.00013817863,0.000041538493,0.000002424858,0.0000011910385,0.82675564,0.0014416616,0.17067823,0.00012454992,0.00033727442],"about_ca_topic_score_codex":0.00017930334,"about_ca_topic_score_gemma":0.0003371975,"teacher_disagreement_score":0.7943898,"about_ca_system_score_codex":0.00017714563,"about_ca_system_score_gemma":0.00012702764,"threshold_uncertainty_score":0.9998973},"labels":[],"label_agreement":null},{"id":"W4383067313","doi":"10.1093/comnet/cnad024","title":"PageRank centrality with non-local random walk-based teleportation","year":2023,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Centrality; PageRank; Computer science; Katz centrality; Network science; Random walk; Measure (data warehouse); Theoretical computer science; Teleportation; Network theory; Flexibility (engineering); Node (physics); Complex network; Data mining; Quantum entanglement; Mathematics; World Wide Web; Physics; Quantum","score_opus":0.01279907006304856,"score_gpt":0.2633192313849608,"score_spread":0.25052016132191224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383067313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.135468,0.000036531626,0.8628171,0.00027795217,0.00011886942,0.00017927548,0.000004043963,0.000068438014,0.0010297957],"genre_scores_gemma":[0.99563366,0.000008348075,0.0031123536,0.00009696102,0.00095392985,0.000009374652,0.000090656,0.000029895184,0.00006479201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980343,0.0001397584,0.0007806839,0.0001832151,0.0004498067,0.00041223533],"domain_scores_gemma":[0.9982028,0.00026116878,0.0007749516,0.0002713275,0.00032264058,0.00016711213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000757986,0.00022475122,0.00058529846,0.00019025811,0.00015896394,0.00009030977,0.00028014614,0.00004911007,0.00046176757],"category_scores_gemma":[0.0000045935667,0.00017347244,0.00035435095,0.000836967,0.00009635015,0.00015138922,0.000029770934,0.0004148011,0.000008364222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053867843,0.00015833028,0.06916305,0.000010916168,0.00040524467,0.00006369841,0.00006829595,0.8415268,0.000109672954,0.0005708347,0.042640936,0.044743553],"study_design_scores_gemma":[0.0035876685,0.0002368991,0.08626839,0.00013745768,0.0002586221,0.000010980872,0.00013066805,0.8974523,0.0002152311,0.0026007404,0.0087663,0.00033472473],"about_ca_topic_score_codex":0.000057559722,"about_ca_topic_score_gemma":0.00001896346,"teacher_disagreement_score":0.86016566,"about_ca_system_score_codex":0.000046585188,"about_ca_system_score_gemma":0.00010263606,"threshold_uncertainty_score":0.7074},"labels":[],"label_agreement":null},{"id":"W4383216495","doi":"10.1016/j.ins.2023.119371","title":"DyHNet: Learning dynamic heterogeneous network representations","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ryerson University","keywords":"Computer science; Node (physics); Task (project management); Semantics (computer science); Representation (politics); Artificial intelligence; Baseline (sea); State (computer science); Machine learning","score_opus":0.017741590963126184,"score_gpt":0.32159697203193816,"score_spread":0.303855381068812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383216495","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.578838,0.000038440856,0.2617002,0.00092104083,0.00039807925,0.00044413123,0.000014412483,0.0014255061,0.1562202],"genre_scores_gemma":[0.9985515,0.000004607258,0.0009131399,0.00004850018,0.000072161725,0.000026007647,0.00008627099,0.000002421685,0.00029542577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991909,0.000032541404,0.0002394923,0.00009420701,0.00022867785,0.00021412627],"domain_scores_gemma":[0.9995915,0.000078031924,0.0001331037,0.00011365773,0.000050609477,0.00003306622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041392227,0.00006474562,0.00007889192,0.00015829076,0.0005187843,0.00021338994,0.00020331792,0.000012494544,0.0002805332],"category_scores_gemma":[0.000011081837,0.00005907132,0.00006066414,0.0014073609,0.00008012606,0.0007321939,0.00008028212,0.00007098362,0.00041302814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012430386,0.000004830482,0.04436999,0.0000021729466,0.000021814405,2.3904968e-7,0.0007086173,0.850854,0.000020151641,0.009987405,0.008870538,0.08515904],"study_design_scores_gemma":[0.0000706232,0.00002744813,0.009687222,0.0000107673595,0.000009299587,9.839046e-7,0.0009671518,0.93303686,0.00007965823,0.018726088,0.037236493,0.00014742803],"about_ca_topic_score_codex":0.000100421756,"about_ca_topic_score_gemma":0.00001062372,"teacher_disagreement_score":0.41971347,"about_ca_system_score_codex":0.00001028272,"about_ca_system_score_gemma":0.000027263619,"threshold_uncertainty_score":0.5308779},"labels":[],"label_agreement":null},{"id":"W4383219129","doi":"10.1109/dsp58604.2023.10167903","title":"CoPo: Self-supervised Contrastive Learning for Popularity Prediction in MEC Networks","year":2023,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Concordia University","funders":"","keywords":"Popularity; Computer science; Artificial intelligence; Machine learning; Psychology","score_opus":0.012609411503802693,"score_gpt":0.2644022376774746,"score_spread":0.25179282617367194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383219129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14550751,0.000018185028,0.8443552,0.00012731158,0.000094292074,0.0007221659,0.000012863597,0.0009861346,0.008176278],"genre_scores_gemma":[0.9962468,0.00000349459,0.0021574257,0.000024099634,0.00028677535,0.00018995619,0.00036448185,0.000018268325,0.0007086868],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990586,0.000067124245,0.00024152077,0.00024521686,0.00009118257,0.00029633864],"domain_scores_gemma":[0.99957067,0.00014469806,0.000055797547,0.0001217785,0.00006149492,0.00004557676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034070894,0.00012204096,0.00022336034,0.000107419444,0.00012372185,0.000039458537,0.00009688359,0.000047054516,0.00024465137],"category_scores_gemma":[0.000007952486,0.000121745026,0.00012373953,0.0005114817,0.00001201293,0.000088931876,0.000053548025,0.0001993179,0.000012971584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000419684,0.00013424481,0.87171197,0.000009342438,0.00020148954,0.0000011817347,0.00019612948,0.062827215,0.00008955878,0.025436398,0.0154172275,0.02393327],"study_design_scores_gemma":[0.00048953417,0.00004733612,0.029695816,0.000013754974,0.0000386072,7.142037e-8,0.00020172457,0.9611926,0.00006811391,0.0054619387,0.0026689272,0.00012158024],"about_ca_topic_score_codex":0.0003870384,"about_ca_topic_score_gemma":0.000075758995,"teacher_disagreement_score":0.8983654,"about_ca_system_score_codex":0.000038253063,"about_ca_system_score_gemma":0.000016904714,"threshold_uncertainty_score":0.4964618},"labels":[],"label_agreement":null},{"id":"W4383268132","doi":"10.1007/978-3-031-33617-1","title":"Generative Methods for Social Media Analysis","year":2023,"lang":"en","type":"book","venue":"SpringerBriefs in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Toronto Metropolitan University; McGill University; Dalhousie University","funders":"","keywords":"Generative grammar; Social media; Computer science; Generative model; Data science; State (computer science); Sociology; Artificial intelligence; World Wide Web; Algorithm","score_opus":0.04806835798391879,"score_gpt":0.3757150712599458,"score_spread":0.327646713276027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383268132","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056199053,0.00003213811,0.98185974,0.000069805465,0.0005370614,0.00028083092,0.000035061003,0.00014270509,0.01698643],"genre_scores_gemma":[0.00498774,0.000006844453,0.961589,0.00010539584,0.0052544624,0.00023526826,0.00021261984,0.00008772405,0.027520947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972274,0.000093176684,0.0005498698,0.0011067282,0.00042746036,0.00059538824],"domain_scores_gemma":[0.99791974,0.0008038572,0.00033934158,0.0005817313,0.0002532778,0.000102029735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021589918,0.00035877447,0.00086579076,0.0013533401,0.00029953037,0.00028171955,0.0013357695,0.00010821856,0.00016394771],"category_scores_gemma":[0.000022923634,0.00038589176,0.00063695293,0.0028165572,0.00049953815,0.00014916806,0.00085175346,0.00036973893,0.000013895247],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073314077,0.000061055965,0.00048526833,0.000027747852,0.0010702745,0.000004027025,0.0017616533,0.0034717296,0.00007383392,0.19733776,0.012638765,0.78306055],"study_design_scores_gemma":[0.00031590732,0.00004269648,0.0020981848,0.00007820238,0.00090606953,2.2012242e-7,0.000013714074,0.62407446,0.00090386823,0.34024307,0.03009806,0.0012255585],"about_ca_topic_score_codex":0.00003644547,"about_ca_topic_score_gemma":0.00008677278,"teacher_disagreement_score":0.781835,"about_ca_system_score_codex":0.0002629617,"about_ca_system_score_gemma":0.00057890033,"threshold_uncertainty_score":0.9998593},"labels":[],"label_agreement":null},{"id":"W4383268177","doi":"10.1007/978-3-031-33617-1_1","title":"Introduction","year":2023,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Toronto Metropolitan University; McGill University; Dalhousie University","funders":"","keywords":"Scope (computer science); Data science; Social media; Generative grammar; Dynamics (music); Computer science; Sociology; Artificial intelligence; World Wide Web","score_opus":0.01556782979359114,"score_gpt":0.24941725661029912,"score_spread":0.23384942681670798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383268177","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048195364,0.00003951744,0.49527955,0.0007724243,0.0029615446,0.00048398026,0.000009895584,0.00067996216,0.49929115],"genre_scores_gemma":[0.20592958,0.00008530181,0.094407454,0.00030728016,0.043341786,0.00009704105,0.0001104213,0.00038732684,0.6553338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785024,0.000008960515,0.00037378486,0.0009056903,0.00047763044,0.00038367778],"domain_scores_gemma":[0.99876606,0.000041734533,0.0001810745,0.00081528723,0.00011429371,0.00008152505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065700884,0.00027392607,0.00035003157,0.0006126322,0.000138298,0.00017460306,0.00084406073,0.000060803315,0.00064817216],"category_scores_gemma":[0.0000033549688,0.0002982724,0.0001392431,0.00043134732,0.0003809602,0.0001863802,0.0007711648,0.00043860154,0.00035256494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015525583,0.000013565939,0.0003161041,0.0000071050745,0.000021773736,0.0000064994206,0.00004677803,0.0009281776,0.00003229915,0.79396987,0.0039691427,0.20068714],"study_design_scores_gemma":[0.00024068536,0.00008925328,0.0017835089,0.00033124068,0.000051455336,0.000003886015,0.0000030354436,0.06719172,0.0006539501,0.60184705,0.32637167,0.001432521],"about_ca_topic_score_codex":0.000069913054,"about_ca_topic_score_gemma":0.000016074011,"teacher_disagreement_score":0.4008721,"about_ca_system_score_codex":0.00012794825,"about_ca_system_score_gemma":0.00013396566,"threshold_uncertainty_score":0.99994695},"labels":[],"label_agreement":null},{"id":"W4383268533","doi":"10.1007/978-3-031-33617-1_5","title":"Mining and Modelling Complex Networks","year":2023,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Toronto Metropolitan University; McGill University; Dalhousie University","funders":"","keywords":"Metadata; Computer science; Data science; Complex network; Field (mathematics); Network science; Data mining; World Wide Web; Mathematics","score_opus":0.042898623616458575,"score_gpt":0.2622660733251133,"score_spread":0.21936744970865474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383268533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007963885,0.00006736724,0.92036116,0.000041306896,0.0002900012,0.00020781893,0.0000034335171,0.00020142042,0.078031115],"genre_scores_gemma":[0.735283,0.00013595774,0.23738036,0.00020991746,0.0029635301,0.000033139546,0.000044223525,0.0002107096,0.02373912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975269,0.000013193598,0.00048417022,0.0010002212,0.00042279443,0.00055274786],"domain_scores_gemma":[0.9987692,0.00014188241,0.00022641663,0.0006230779,0.00009646783,0.00014294642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072092965,0.00038415418,0.00053279754,0.00050788367,0.00025382216,0.000304802,0.000781339,0.00008871396,0.00009985791],"category_scores_gemma":[0.0000014179114,0.00042663806,0.00012201523,0.00034988453,0.0005395923,0.00017665635,0.0012620194,0.00040137675,0.000012710097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044025423,0.000018462073,0.0021352225,0.000021543925,0.000061792496,0.000024874033,0.0002246264,0.26837707,0.000008941578,0.45754316,0.0005969573,0.27098292],"study_design_scores_gemma":[0.00008804039,0.000019429079,0.00023064749,0.00025457505,0.000017530741,0.0000013702324,0.0000022936215,0.960967,0.000005359268,0.034287784,0.0036988978,0.00042705136],"about_ca_topic_score_codex":0.00010428421,"about_ca_topic_score_gemma":0.000024948125,"teacher_disagreement_score":0.73448664,"about_ca_system_score_codex":0.000070607115,"about_ca_system_score_gemma":0.000085170126,"threshold_uncertainty_score":0.99981856},"labels":[],"label_agreement":null},{"id":"W4383560516","doi":"10.54254/2755-2721/5/20230674","title":"Analysis of China’s aviation network and the key node","year":2023,"lang":"en","type":"article","venue":"Applied and Computational Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Centrality; Aviation; Node (physics); Key (lock); Degree distribution; Network analysis; Commercial aviation; Computer science; Network science; Complex network; Aviation engineering; Transport engineering; Engineering; Computer security; Civil aviation; Mathematics; Aerospace engineering","score_opus":0.004192663045602268,"score_gpt":0.20203170233698092,"score_spread":0.19783903929137867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383560516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3523134,0.000058501777,0.6463549,0.00014510492,0.000014616812,0.00009908243,0.0000061947408,0.00007845936,0.00092971313],"genre_scores_gemma":[0.9969024,0.0000042456877,0.0028791765,0.000011313,0.00007246876,0.000018814786,0.00009733975,0.0000053389435,0.000008894734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996001,0.0000066755965,0.0001318621,0.000096819516,0.000083275285,0.00008127734],"domain_scores_gemma":[0.99971163,0.00015049921,0.000046858182,0.00005885333,0.000014699855,0.000017456872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015285658,0.000064261985,0.00016454478,0.00009779041,0.000057279332,0.000020048297,0.000041234856,0.000010234505,0.000009959226],"category_scores_gemma":[0.0000011801798,0.00005200453,0.000050433217,0.0006986851,0.000023954713,0.000017876187,0.00004437312,0.000046317648,7.628515e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030541887,0.000002130558,0.0026456714,0.0000023576188,0.00027912512,2.8921272e-8,0.00012219466,0.6974651,0.000012311064,0.2964517,0.0000292322,0.0029870712],"study_design_scores_gemma":[0.00015166287,0.0000013299583,0.13138272,0.0000029763753,0.00017174141,5.0315013e-8,0.000016422217,0.8471123,0.000004445417,0.02104733,0.00006228549,0.00004674485],"about_ca_topic_score_codex":0.000032721793,"about_ca_topic_score_gemma":7.487737e-7,"teacher_disagreement_score":0.644589,"about_ca_system_score_codex":0.0000027940275,"about_ca_system_score_gemma":0.000003874553,"threshold_uncertainty_score":0.2120683},"labels":[],"label_agreement":null},{"id":"W4383900569","doi":"10.1007/978-3-031-37616-0_13","title":"A Decentralized Resource Allocation Protocol in Social Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Protocol (science); Resource allocation; Distributed computing; Resource (disambiguation); Negotiation; Resource management (computing); Controller (irrigation); Multi-agent system; Computer network; Artificial intelligence","score_opus":0.019882479830470173,"score_gpt":0.2940028339879764,"score_spread":0.27412035415750624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383900569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017560216,0.000007700001,0.9849761,0.00022453988,0.0000855795,0.011206978,0.0000024487738,0.00012772126,0.003351355],"genre_scores_gemma":[0.80550927,0.000011560155,0.12444426,0.001824191,0.012449964,0.051726945,0.0003338892,0.00053608866,0.0031638418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977147,0.000047628713,0.0004811485,0.00079160626,0.0004457682,0.0005191788],"domain_scores_gemma":[0.99897325,0.00018833464,0.00025481966,0.00043621287,0.00008523929,0.00006214513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061752327,0.00034193773,0.00045423055,0.0005033273,0.00018008443,0.0001860477,0.0008452952,0.00016879871,0.00009080459],"category_scores_gemma":[0.000007886134,0.00033959936,0.00015002991,0.0007949348,0.00027961604,0.00009779927,0.0004375746,0.000692167,0.000012564073],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003397336,0.00006105941,0.0014295595,0.000024344972,0.000032654665,0.000014624823,0.00041063718,0.13123012,0.000020872028,0.04845905,0.00059050764,0.8176926],"study_design_scores_gemma":[0.00055878685,0.000050441493,0.0006324117,0.00041577205,0.000018107932,7.826661e-7,4.260517e-7,0.6601462,0.000104096725,0.3234434,0.013950056,0.00067955465],"about_ca_topic_score_codex":0.000074823416,"about_ca_topic_score_gemma":0.0001354318,"teacher_disagreement_score":0.86053187,"about_ca_system_score_codex":0.00018704982,"about_ca_system_score_gemma":0.00016889363,"threshold_uncertainty_score":0.9999056},"labels":[],"label_agreement":null},{"id":"W4384830543","doi":"10.1098/rspa.2023.0159","title":"Exact and rapid linear clustering of networks with dynamic programming","year":2023,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; James S. McDonnell Foundation","keywords":"Cluster analysis; Heuristics; Computer science; Dimension (graph theory); Algorithm; Time complexity; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.007173016283890647,"score_gpt":0.22782898242662758,"score_spread":0.22065596614273694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384830543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97781384,0.000025170011,0.021636667,0.00007740982,0.000006907843,0.00012525635,9.307275e-7,0.00006530066,0.00024852966],"genre_scores_gemma":[0.9863408,0.000003389906,0.0135632735,0.0000020554005,0.000046209585,0.000013407371,2.5855996e-7,0.000007898955,0.000022676428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993204,0.0000018037183,0.00014102952,0.00016080716,0.00018125698,0.00019473697],"domain_scores_gemma":[0.999704,0.00009595699,0.00008057503,0.000044857738,0.00003286183,0.000041722546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023193922,0.000111011344,0.00023340894,0.000017630526,0.00010546295,0.000036819696,0.00016281393,0.000017805536,0.000002560645],"category_scores_gemma":[0.000008984403,0.000065687615,0.000105275016,0.00047687883,0.00030852822,0.000070097325,0.00019258306,0.00010728797,1.555284e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064965105,0.0011830729,0.04839875,0.00686899,0.001603207,5.3285834e-7,0.017557044,0.52675045,0.021338513,0.2794038,0.0006306214,0.09620005],"study_design_scores_gemma":[0.000059491827,0.00005902701,0.0013969503,0.00018384548,0.000037205235,2.944145e-7,0.0003116715,0.99339265,0.00036950668,0.0040959814,0.000009446634,0.000083906525],"about_ca_topic_score_codex":0.0000065076606,"about_ca_topic_score_gemma":6.185415e-8,"teacher_disagreement_score":0.4666422,"about_ca_system_score_codex":0.0000041229823,"about_ca_system_score_gemma":0.0000046787295,"threshold_uncertainty_score":0.26786634},"labels":[],"label_agreement":null},{"id":"W4385060395","doi":"10.3934/nhm.2023068","title":"Influence maximization in social networks using role-based embedding","year":2023,"lang":"en","type":"article","venue":"Networks and Heterogeneous Media","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Heuristic; Embedding; Maximization; Representation (politics); Machine learning; Categorization; Artificial intelligence; Social network (sociolinguistics); Similarity (geometry); Theoretical computer science; Node (physics); Mathematical optimization; Social media; Mathematics","score_opus":0.015702652511608843,"score_gpt":0.2776511470186265,"score_spread":0.2619484945070176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385060395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91020906,0.00022986985,0.08906112,0.000025134923,0.00007156355,0.00016500817,0.0000040684026,0.00015280022,0.00008137191],"genre_scores_gemma":[0.9982025,0.000033450062,0.00048528373,0.00007719324,0.0009975506,0.0000319508,0.00012952273,0.00003688329,0.000005633448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985847,0.00008617422,0.00033723432,0.00034032285,0.0001568196,0.0004947774],"domain_scores_gemma":[0.9994465,0.00012607373,0.00012899838,0.00016249814,0.000046489993,0.000089405046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002442296,0.00021172522,0.00031111905,0.00019143967,0.00024816443,0.0000943037,0.00014252914,0.00010738496,0.000043252174],"category_scores_gemma":[0.0000044087383,0.00022712123,0.00009940535,0.0007676829,0.000061481805,0.00008290052,0.00010313166,0.00023146106,0.0000025085587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011870764,0.000016900467,0.071468726,0.000002961235,0.000021134929,0.0000070597166,0.00009490439,0.9113627,0.00004508827,0.00020608814,0.000100170786,0.0166624],"study_design_scores_gemma":[0.00026271536,0.000010484357,0.0064506293,0.000043203698,0.00003308449,0.000001005121,0.000037845162,0.9915114,0.000050658036,0.0012012873,0.0001792357,0.00021843001],"about_ca_topic_score_codex":0.00013651345,"about_ca_topic_score_gemma":0.000078375255,"teacher_disagreement_score":0.08857583,"about_ca_system_score_codex":0.00003726818,"about_ca_system_score_gemma":0.000023870007,"threshold_uncertainty_score":0.9261735},"labels":[],"label_agreement":null},{"id":"W4385260528","doi":"10.1088/2632-072x/ace602","title":"Hierarchical team structure and multidimensional localization (or siloing) on networks","year":2023,"lang":"en","type":"article","venue":"Journal of Physics Complexity","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Google; National Science Foundation","keywords":"Bridging (networking); Computer science; Core (optical fiber); Organizational structure; Phenomenon; Popularity; Knowledge management; Theoretical computer science; Psychology; Physics; Political science","score_opus":0.030698345978612984,"score_gpt":0.29429259193915763,"score_spread":0.26359424596054465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385260528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.664405,0.0000207327,0.33448812,0.00021394104,0.00019621913,0.00016076818,0.000036246525,0.00007630236,0.0004026469],"genre_scores_gemma":[0.99459857,0.000006536297,0.0038202927,0.00010462783,0.0013533237,0.0000013660288,0.000052455514,0.000021126038,0.000041733107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987193,0.000110127105,0.00040599564,0.0001823923,0.00034873156,0.00023346466],"domain_scores_gemma":[0.99893457,0.00023019222,0.0003550272,0.00018180581,0.00017092563,0.00012746645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021949052,0.0001848928,0.00037983464,0.000108772045,0.00019939584,0.000048668306,0.00015649613,0.000041455776,0.00013442751],"category_scores_gemma":[0.000012488923,0.00014054027,0.00016414498,0.0004994365,0.00013426498,0.00012761558,0.00012206896,0.0004603185,0.0000042150573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070476794,0.00070508034,0.07354039,0.00004051398,0.0008033541,0.000031139625,0.00055359164,0.24730647,0.0023948012,0.5274735,0.041415,0.1050314],"study_design_scores_gemma":[0.0008394128,0.0003218608,0.022021903,0.000117305426,0.00009350375,0.0000100910875,0.00006601139,0.6643735,0.0012479551,0.30803883,0.0025685728,0.00030102237],"about_ca_topic_score_codex":0.000013978485,"about_ca_topic_score_gemma":0.000003549215,"teacher_disagreement_score":0.41706708,"about_ca_system_score_codex":0.000030825122,"about_ca_system_score_gemma":0.000049119084,"threshold_uncertainty_score":0.5731066},"labels":[],"label_agreement":null},{"id":"W4385326222","doi":"10.1002/smj.3527","title":"Giant cluster formation and integrating role of bridges in social diffusion","year":2023,"lang":"en","type":"article","venue":"Strategic Management Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; University of Michigan; University of Wisconsin-Madison; Institute of Management Research, College of Business Administration Seoul National University; University of Pennsylvania","keywords":"Cluster (spacecraft); Giant component; Aggregate (composite); Social network (sociolinguistics); Diffusion; Economic geography; Business; Affect (linguistics); Network structure; Data science; Computer science; Industrial organization; Social media; Geography; Sociology; World Wide Web; Physics; Distributed computing; Nanotechnology; Theoretical computer science; Communication","score_opus":0.016598887173814067,"score_gpt":0.27116369676961055,"score_spread":0.25456480959579647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385326222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88548243,0.000026074094,0.006639282,0.00018531074,0.000026174908,0.00013254119,0.0000021992105,0.000025844844,0.10748014],"genre_scores_gemma":[0.9989921,0.00003063397,0.00072380836,0.000005538015,0.00012533915,0.000005587583,0.000012357556,0.0000048766683,0.00009974452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993324,0.00004711651,0.0002711361,0.000078200916,0.0001314719,0.00013963255],"domain_scores_gemma":[0.99974304,0.00001204942,0.00015207515,0.0000490761,0.000023045845,0.000020690251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032387217,0.000073860865,0.00012288017,0.00021411075,0.00010915674,0.00007553154,0.000082037135,0.000013438676,0.00008995332],"category_scores_gemma":[3.3989724e-7,0.00006370796,0.000052657233,0.00024554157,0.00001379322,0.000102909,0.00008502146,0.00012539158,0.000002242683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023765293,0.00006500022,0.01724301,0.000057959573,0.00009761943,0.000008334504,0.0010855248,0.00011236402,0.0016690544,0.8259375,0.00070534827,0.1529945],"study_design_scores_gemma":[0.0005780076,0.00003838282,0.015462971,0.00013041418,0.000044728164,0.0000024639965,0.023976585,0.11628113,0.00020536054,0.84293985,0.00019632679,0.00014377583],"about_ca_topic_score_codex":0.000039607992,"about_ca_topic_score_gemma":0.000017324572,"teacher_disagreement_score":0.15285073,"about_ca_system_score_codex":0.000017645076,"about_ca_system_score_gemma":0.0000051837374,"threshold_uncertainty_score":0.25979352},"labels":[],"label_agreement":null},{"id":"W4385347722","doi":"10.31235/osf.io/bfmy2","title":"Complements and Competitors: The Co-functionality and Co-diffusion of Languages on a Collaborative Coding Platform","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Computer science; Coding (social sciences); Competitor analysis; Population; Diffusion of innovations; Cohesion (chemistry); Data science; Mathematics; Business; Marketing; Sociology; Statistics","score_opus":0.04348599185683612,"score_gpt":0.35608649076591803,"score_spread":0.3126004989090819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385347722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9675136,0.0000917206,0.006067872,0.0004018235,0.00010586647,0.00106888,0.0011493434,0.00015300569,0.023447884],"genre_scores_gemma":[0.9982678,0.000037555183,0.00045750922,0.000036469504,0.00020556698,0.000057854933,0.00064723287,0.00001597625,0.00027401207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988717,0.000079347315,0.00032036562,0.0003331119,0.00025564941,0.0001398233],"domain_scores_gemma":[0.9988532,0.00041977924,0.000283083,0.00029397476,0.000107041815,0.000042890755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033963803,0.00022025728,0.00039921084,0.0000895443,0.00019091317,0.00008575091,0.00015397907,0.000053072763,0.00035839775],"category_scores_gemma":[0.000006179634,0.00015476288,0.00007549507,0.00012723422,0.00016620601,0.000030731146,0.00046890404,0.0002792146,0.0000040034856],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018569714,0.00041657517,0.46324947,0.00029066225,0.001985445,0.000002768603,0.0031682553,0.00029809334,0.000993693,0.46901265,0.050672174,0.009724526],"study_design_scores_gemma":[0.0052554146,0.0010076314,0.61183864,0.0029881827,0.0013633696,0.0000027991869,0.05670282,0.04605315,0.01948384,0.19991457,0.052086696,0.00330286],"about_ca_topic_score_codex":0.00097109465,"about_ca_topic_score_gemma":0.000109217646,"teacher_disagreement_score":0.26909807,"about_ca_system_score_codex":0.000025420683,"about_ca_system_score_gemma":0.000038067068,"threshold_uncertainty_score":0.6311047},"labels":[],"label_agreement":null},{"id":"W4385488096","doi":"10.1109/tcss.2023.3293351","title":"Guest Editorial Special Issue on Social Computing and Societies 5.0: Toward Social Intelligence via Cyber Movement Organizations","year":2023,"lang":"en","type":"editorial","venue":"IEEE Transactions on Computational Social Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Anhui University; Beijing Normal University; Chinese Academy of Sciences; York University","keywords":"Social media; Social computing; Computer science; ICTS; Data science; Internet privacy; Social network (sociolinguistics); World Wide Web; Human–computer interaction; Information and Communications Technology","score_opus":0.01543207593233706,"score_gpt":0.29494041205802835,"score_spread":0.27950833612569126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385488096","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004328527,0.0000066878156,0.27677336,0.00027601793,0.7201062,0.00056654285,0.0011846158,0.00034955173,0.0006937453],"genre_scores_gemma":[0.053287726,0.000007006667,0.00013878188,0.000031494263,0.94456726,0.00012832435,0.0010393088,0.00017423484,0.0006258658],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947021,0.00039179073,0.0011528546,0.0009503307,0.0021634027,0.00063951075],"domain_scores_gemma":[0.9961782,0.0016136407,0.0007233409,0.00015486155,0.0012008416,0.00012912165],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00054574467,0.0007733853,0.0010978213,0.00033204356,0.0030816903,0.0005913291,0.0004641712,0.0008567231,0.0001801192],"category_scores_gemma":[0.000018927298,0.0009130715,0.0005334433,0.0010703664,0.00030868163,0.0001445394,0.00002713066,0.0015652775,0.0002138747],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004676149,0.00028052277,0.0000028908303,0.00006629095,0.0007187746,0.0000012046826,0.002689722,0.01948667,0.0000036631568,0.0012740325,0.97026384,0.005165621],"study_design_scores_gemma":[0.0010273416,0.0002195769,0.000054276967,0.00020594324,0.0006975019,3.6693893e-7,0.0026164013,0.011085015,0.000056433568,0.0095757935,0.9725966,0.001864761],"about_ca_topic_score_codex":0.0009257188,"about_ca_topic_score_gemma":0.000052792686,"teacher_disagreement_score":0.27663457,"about_ca_system_score_codex":0.00064998923,"about_ca_system_score_gemma":0.0004270761,"threshold_uncertainty_score":0.999332},"labels":[],"label_agreement":null},{"id":"W4385687128","doi":"10.1093/comnet/cnad028","title":"Hypergraph Artificial Benchmark for Community Detection (h–ABCD)","year":2023,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Hypergraph; Benchmark (surveying); Computer science; Community structure; Graph; Ground truth; Random graph; Algorithm; Theoretical computer science; Artificial intelligence; Discrete mathematics; Mathematics; Combinatorics; Cartography","score_opus":0.04547895218473307,"score_gpt":0.3071416032323553,"score_spread":0.2616626510476222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385687128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2871298,0.000062888765,0.7102544,0.00019537871,0.00048864784,0.00024549846,0.000011888762,0.00010234055,0.0015092094],"genre_scores_gemma":[0.99572766,0.000011445941,0.0016979412,0.000055370325,0.0023512444,0.000017803626,0.00005925551,0.000028089511,0.000051217798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983343,0.00024545973,0.00071708823,0.00011340958,0.00022962729,0.0003601137],"domain_scores_gemma":[0.9981385,0.0005362593,0.0005734802,0.00030573533,0.00033214764,0.00011387008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012737022,0.00018367665,0.00045068533,0.00030300897,0.00050771027,0.00009183804,0.00041104492,0.00006201972,0.00019166595],"category_scores_gemma":[0.00001834927,0.00017216036,0.000559803,0.0008539359,0.00006723538,0.00014111878,0.000091826274,0.0006213368,0.000005859461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056752923,0.00065742485,0.020369032,0.000035825786,0.0013516797,0.0000081554845,0.00045890696,0.17571183,0.007279351,0.015780393,0.18581113,0.5919688],"study_design_scores_gemma":[0.001158203,0.0008578743,0.03810963,0.000121889854,0.00045857189,0.000019852057,0.0009171013,0.63334715,0.0015425887,0.24234147,0.080455594,0.0006700797],"about_ca_topic_score_codex":0.000059362028,"about_ca_topic_score_gemma":0.000055435445,"teacher_disagreement_score":0.70859784,"about_ca_system_score_codex":0.000035034664,"about_ca_system_score_gemma":0.00003011448,"threshold_uncertainty_score":0.70204955},"labels":[],"label_agreement":null},{"id":"W4385852306","doi":"10.20944/preprints202308.1161.v1","title":"Augmented Gravity Model of Trade with Social Network Analysis","year":2023,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Gravity model of trade; Economics; Trade barrier; International trade; International economics; Economic integration; Bilateral trade; Openness to experience; International free trade agreement; Globalization; Free trade; China; Geography","score_opus":0.12064341435060735,"score_gpt":0.3510251221400022,"score_spread":0.23038170778939485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385852306","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8680002,0.000014485201,0.12703522,0.00035193935,0.00006930161,0.0006212241,0.00020363349,0.00042043012,0.0032835824],"genre_scores_gemma":[0.9960477,0.000008366118,0.0019260831,0.000016362419,0.00044287663,0.0002341465,0.00062791596,0.00007296605,0.00062358193],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.996831,0.00019403503,0.00080897805,0.0011108796,0.00053181575,0.00052331237],"domain_scores_gemma":[0.9973832,0.00007101109,0.0008880149,0.0014087767,0.00013531966,0.000113689515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069720956,0.0005103256,0.0013575525,0.00033972366,0.00017963331,0.000027550943,0.0008843215,0.00020227717,0.00045919823],"category_scores_gemma":[0.0000054678294,0.0005082934,0.0011533014,0.0013445617,0.00015913512,0.00005359974,0.0017490328,0.00091115176,0.000040143954],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004392627,0.00016191318,0.6608651,0.000036793,0.005493443,0.0000010290655,0.0003022559,0.32908016,0.00021370089,0.0032438727,0.0002751371,0.00028263408],"study_design_scores_gemma":[0.00046847734,0.000021007787,0.584526,0.00015460777,0.008036913,1.30112e-7,0.00011664563,0.26290295,0.0033926324,0.1391286,0.00015802735,0.0010940464],"about_ca_topic_score_codex":0.0011291523,"about_ca_topic_score_gemma":0.00016996608,"teacher_disagreement_score":0.13588472,"about_ca_system_score_codex":0.00008967739,"about_ca_system_score_gemma":0.00016060221,"threshold_uncertainty_score":0.99973685},"labels":[],"label_agreement":null},{"id":"W4386010710","doi":"10.5267/j.ijdns.2023.8.004","title":"Non-homogeneous continuous time Markov chain model for information dissemination on Indonesian Twitter users","year":2023,"lang":"en","type":"article","venue":"International Journal of Data and Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Horizon 2020 Framework Programme; Universitas Padjadjaran","keywords":"Markov chain; Constant (computer programming); Continuous-time Markov chain; Computer science; Markov process; Homogeneous; Intensity (physics); Markov model; Markov property; Statistical physics; Mathematics; Statistics; Physics; Machine learning","score_opus":0.0168242676900681,"score_gpt":0.3175494412432826,"score_spread":0.3007251735532145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386010710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6196085,0.000013711557,0.37739423,0.0012497255,0.00041404748,0.00025853285,0.00020358166,0.00003136425,0.0008263069],"genre_scores_gemma":[0.9951796,0.000016560616,0.003789185,0.00011589962,0.000525707,0.000005103488,0.00024695147,0.000005300669,0.000115677074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998887,0.000010446531,0.0003289983,0.00014154121,0.00045563641,0.00017637052],"domain_scores_gemma":[0.9989491,0.000118640026,0.0003329264,0.00018633543,0.000347409,0.00006556068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011074864,0.00008684215,0.00013812578,0.00028073604,0.00012681128,0.0002208201,0.0009003326,0.000017689172,0.00001419034],"category_scores_gemma":[0.000023602279,0.00007451006,0.000047007128,0.0003229078,0.0000815797,0.0011419529,0.00023570098,0.000085011576,0.000006749659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041253402,0.00013490315,0.0360431,0.0000097973425,0.000319563,0.000009836625,0.0011275369,0.061877333,0.0020673864,0.0057160864,0.17662138,0.7156605],"study_design_scores_gemma":[0.00023687698,0.000051598614,0.0028571063,0.00007257823,0.00001963787,0.00000536546,0.000055340537,0.9918555,0.00016702354,0.0025757765,0.002010224,0.00009298603],"about_ca_topic_score_codex":0.0000044021217,"about_ca_topic_score_gemma":9.995714e-7,"teacher_disagreement_score":0.92997813,"about_ca_system_score_codex":0.000029364617,"about_ca_system_score_gemma":0.000065899985,"threshold_uncertainty_score":0.3038432},"labels":[],"label_agreement":null},{"id":"W4386123456","doi":"10.14778/3611479.3611516","title":"Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem","year":2023,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cluster analysis; Probabilistic logic; Theoretical computer science; Correlation clustering; Computer science; Mathematics; Algorithm; Artificial intelligence","score_opus":0.02037009250056965,"score_gpt":0.27360625782669246,"score_spread":0.2532361653261228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386123456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9965221,0.000012972541,0.0010718977,0.00013931977,0.00021257438,0.00066193123,0.000020582265,0.0001521508,0.0012064683],"genre_scores_gemma":[0.99781615,0.0000015731923,0.0017700705,0.00003381035,0.00019075998,0.000046823992,0.000005762328,0.000030869753,0.000104186736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983408,0.000011134536,0.00038408613,0.00033344436,0.0003305329,0.0005999929],"domain_scores_gemma":[0.99933034,0.000040434767,0.00021636553,0.00017811575,0.00013342453,0.000101320154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032010363,0.00022516944,0.00029201535,0.00014980262,0.0002596536,0.000096209274,0.0005165204,0.000028190072,0.000070867056],"category_scores_gemma":[0.000025546131,0.00016729317,0.00025912866,0.00089724245,0.000049223145,0.00011411724,0.00070459396,0.00015152915,0.0000044899625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018375908,0.00021274283,0.31328404,0.00039975453,0.0008624966,0.0000010663455,0.008271181,0.019683402,0.12258802,0.5069573,0.0033646293,0.024191603],"study_design_scores_gemma":[0.0017872029,0.00015206666,0.053569052,0.0011750472,0.00070232875,0.00000754171,0.0056290524,0.41303736,0.15345983,0.36669376,0.0022655104,0.0015212622],"about_ca_topic_score_codex":0.00013790997,"about_ca_topic_score_gemma":0.000005705366,"teacher_disagreement_score":0.39335394,"about_ca_system_score_codex":0.000089064175,"about_ca_system_score_gemma":0.000020041663,"threshold_uncertainty_score":0.68220174},"labels":[],"label_agreement":null},{"id":"W4386397972","doi":"10.1016/j.dam.2023.08.015","title":"The iterative independent model","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Bounded function; Random graph; Cluster analysis; Discrete mathematics; Graph","score_opus":0.017420651430295933,"score_gpt":0.2782653337915683,"score_spread":0.2608446823612724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386397972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045464836,0.000015845402,0.7174606,0.00032767098,0.000038497103,0.000663151,0.000033780158,0.0005110295,0.2354846],"genre_scores_gemma":[0.9882806,0.000005516225,0.009683943,0.00002365449,0.00009696902,0.00023078414,0.000052078365,0.000028829143,0.0015976392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990614,0.00000841518,0.0002565064,0.00017049312,0.0002350393,0.0002681538],"domain_scores_gemma":[0.99922264,0.00015375651,0.000113898386,0.00043381858,0.000030639654,0.000045270026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002525744,0.00014900464,0.00017815812,0.000043387223,0.0002967788,0.00012551375,0.000301414,0.000023245879,0.000056152654],"category_scores_gemma":[0.0000029294567,0.00009866597,0.00010659628,0.00030607844,0.000054183227,0.000034833076,0.00018843864,0.00013691568,0.0001881667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023495759,0.00002207555,0.000037546473,0.000006470828,0.00008391535,2.998857e-7,0.0010461856,0.00212792,0.0006987813,0.9860288,0.0062474143,0.0036982545],"study_design_scores_gemma":[0.00008352618,0.0000037879008,0.000018745955,0.00000797385,0.0000316914,9.6241784e-8,0.001090464,0.38904804,0.0012371569,0.607379,0.0009696179,0.00012985722],"about_ca_topic_score_codex":0.0000033331082,"about_ca_topic_score_gemma":0.0000028754662,"teacher_disagreement_score":0.9428158,"about_ca_system_score_codex":0.000013998804,"about_ca_system_score_gemma":0.000018716717,"threshold_uncertainty_score":0.40234816},"labels":[],"label_agreement":null},{"id":"W4386419832","doi":"10.1007/s13278-023-01115-7","title":"Fast local community discovery relying on the strength of links","year":2023,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Machine Intelligence Institute; Canadian Institute for Advanced Research","keywords":"Computer science; Node (physics); Graph; Set (abstract data type); Data mining; Community structure; Theoretical computer science; Outlier; Artificial intelligence; Mathematics","score_opus":0.02454573867931035,"score_gpt":0.2811854526579256,"score_spread":0.25663971397861524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386419832","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96937466,0.000037311685,0.025099972,0.000217684,0.000029032815,0.00007642204,0.00001675842,0.00006299401,0.0050851693],"genre_scores_gemma":[0.99888295,0.000015526117,0.00017711005,0.00005690444,0.0004815958,0.000014604794,0.000112903654,0.000014101849,0.0002442851],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986445,0.00035747868,0.0003298011,0.00017865196,0.0001945113,0.0002950754],"domain_scores_gemma":[0.9987165,0.00068755023,0.00023424775,0.00027918693,0.00004574175,0.000036811623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009174288,0.00015804965,0.000457061,0.00013960597,0.0010189308,0.00008208782,0.0002227805,0.00006927353,0.000064242304],"category_scores_gemma":[0.000008577496,0.00012067953,0.00041736636,0.0023151,0.00017742853,0.000061156694,0.00021832525,0.000515186,0.000002210998],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005765607,0.00023038,0.5149264,0.000021758087,0.008720102,0.0000023030163,0.00984957,0.032824203,0.00008437054,0.13043196,0.016052531,0.28679878],"study_design_scores_gemma":[0.001059063,0.00035628845,0.3641564,0.0004007612,0.010608741,3.082512e-7,0.12115824,0.42897,0.00055746763,0.06651773,0.0044271383,0.0017878726],"about_ca_topic_score_codex":0.0006244042,"about_ca_topic_score_gemma":0.00025221062,"teacher_disagreement_score":0.3961458,"about_ca_system_score_codex":0.0000135558985,"about_ca_system_score_gemma":0.000016710372,"threshold_uncertainty_score":0.7836895},"labels":[],"label_agreement":null},{"id":"W4386430032","doi":"10.1007/978-981-99-5837-5_14","title":"A Cluster-Constrained Graph Convolutional Network for Protein-Protein Association Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Scalability; Graph; Metis; Community structure; Cluster analysis; Data mining; Theoretical computer science; Artificial intelligence; World Wide Web","score_opus":0.012294366123686583,"score_gpt":0.2435560661772338,"score_spread":0.2312617000535472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386430032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011351122,0.00007168924,0.9956511,0.00039204137,0.00051264034,0.0017601477,0.000052920284,0.00022410612,0.0012218232],"genre_scores_gemma":[0.63220346,0.000006175706,0.3495724,0.0005859954,0.010548058,0.0007940934,0.00057917926,0.0001995194,0.0055110916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672496,0.000050385614,0.00063853426,0.0010555778,0.0006510008,0.0008795412],"domain_scores_gemma":[0.99773943,0.00056507636,0.00063752156,0.0005605908,0.00037908793,0.00011826162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014084997,0.0005107558,0.0006583543,0.00039447617,0.00041324212,0.00026949763,0.0008690865,0.00030503428,0.00007875667],"category_scores_gemma":[0.000042341984,0.00052118197,0.00040908385,0.0007097155,0.0003309727,0.00014623711,0.0004077249,0.000763013,0.00001353335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004550836,0.000054622607,0.0010446603,0.00004364002,0.00029021254,0.0000052150876,0.00007738046,0.54204416,0.00010380996,0.2267867,0.0015923359,0.22791177],"study_design_scores_gemma":[0.00026727456,0.00006973337,0.000055490644,0.00036425845,0.000033808657,5.6008105e-7,1.18560145e-7,0.42882678,0.000054535867,0.5689813,0.00091160386,0.00043451926],"about_ca_topic_score_codex":0.000055465363,"about_ca_topic_score_gemma":0.00013490803,"teacher_disagreement_score":0.6460787,"about_ca_system_score_codex":0.00034610965,"about_ca_system_score_gemma":0.0003325253,"threshold_uncertainty_score":0.999724},"labels":[],"label_agreement":null},{"id":"W4386634662","doi":"10.1109/tit.2023.3314048","title":"Universal Graph Compression: Stochastic Block Models","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adjacency matrix; Lossless compression; Computer science; Cluster analysis; Adjacency list; Data compression; Asymptotically optimal algorithm; Algorithm; Discrete mathematics; Graph; Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.012661189230647275,"score_gpt":0.23654637498944184,"score_spread":0.22388518575879457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386634662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004409064,0.0000016510979,0.98240304,0.000056090576,0.00016071416,0.00016766947,0.000060758513,0.00046131908,0.012279721],"genre_scores_gemma":[0.9991053,0.0000023402804,0.00021950506,0.000056928264,0.000038238257,0.000049141516,0.000045792796,0.000009813734,0.00047297325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992182,0.000058101567,0.00025437068,0.00009691664,0.0001892614,0.00018311663],"domain_scores_gemma":[0.99940586,0.00011044355,0.00009120072,0.00025665818,0.00007151572,0.00006430501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018121181,0.00013334506,0.0001331281,0.0004215033,0.0002831131,0.00004989304,0.00016255207,0.000037474136,0.0005415087],"category_scores_gemma":[4.4132332e-7,0.00013019792,0.0001563721,0.0006254596,0.000050437346,0.0007668775,0.0000024670746,0.00019030872,0.0003915475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044484786,0.000038875423,0.0000012497185,0.0000046909545,0.00008767613,1.7757947e-7,0.0008196027,0.8861665,0.000023749673,0.06835015,0.0019074435,0.042555355],"study_design_scores_gemma":[0.00077505433,0.00007114215,0.00002978297,0.00007348888,0.0001320261,0.0000015716818,0.0028339154,0.6838936,0.002312302,0.30778566,0.0016572403,0.00043417377],"about_ca_topic_score_codex":0.00001937881,"about_ca_topic_score_gemma":0.0000010455258,"teacher_disagreement_score":0.9946962,"about_ca_system_score_codex":0.000025167728,"about_ca_system_score_gemma":0.000025635194,"threshold_uncertainty_score":0.5929141},"labels":[],"label_agreement":null},{"id":"W4386703538","doi":"10.13052/rp-9788770040723.064","title":"Using Machine Learning to Analyse User Psychology in Social Media","year":2023,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Global Health Research","funders":"","keywords":"Social media; Computer science; Human–computer interaction; Data science; Artificial intelligence; World Wide Web; Cognitive science; Psychology","score_opus":0.06781421428193057,"score_gpt":0.389844926066226,"score_spread":0.32203071178429543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386703538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9740625,0.0000048302827,0.017632674,0.00035381163,0.000036499852,0.00006900994,0.00000305126,0.0001802489,0.007657393],"genre_scores_gemma":[0.99572265,7.3540383e-7,0.003472358,0.00009046978,0.00031343158,0.000009279881,0.000044778004,0.000014689541,0.00033161443],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992002,0.00007361848,0.00018888767,0.00020762895,0.000088574474,0.00024107502],"domain_scores_gemma":[0.99972683,0.000060206276,0.000038204547,0.00011190815,0.00002102938,0.00004184436],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002197993,0.000092271366,0.00020002517,0.0003388771,0.00008259288,0.00002096534,0.00012397536,0.000026202892,0.0012349417],"category_scores_gemma":[0.000007080796,0.00009031736,0.00008671942,0.0013456743,0.000013508611,0.00003759631,0.00010702765,0.00016119491,0.0001054849],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013611716,0.000059695816,0.9534824,0.0000015009333,0.00008992127,0.000006330349,0.001079844,0.0029582675,0.004652244,0.0073816017,0.008243638,0.022030981],"study_design_scores_gemma":[0.0018288513,0.00008445041,0.4574763,0.000042387455,0.00023165252,0.0000013312097,0.0029644372,0.4032378,0.0028715914,0.057469614,0.07221256,0.0015790603],"about_ca_topic_score_codex":0.00061088207,"about_ca_topic_score_gemma":0.0006363743,"teacher_disagreement_score":0.4960061,"about_ca_system_score_codex":0.000017921619,"about_ca_system_score_gemma":0.000009537257,"threshold_uncertainty_score":0.9996781},"labels":[],"label_agreement":null},{"id":"W4386880480","doi":"10.1017/9781139794985","title":"Network Analysis","year":2023,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nova Scotia Health Authority","funders":"","keywords":"Social network analysis; Network analysis; Computer science; Data science; Key (lock); Social network (sociolinguistics); Network science; Organizational network analysis; Sample (material); Focus (optics); Management science; World Wide Web; Social media; Complex network; Knowledge management; Engineering; Computer security","score_opus":0.017810520995881467,"score_gpt":0.21624890202165442,"score_spread":0.19843838102577296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386880480","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002884914,0.000039945426,0.016807029,0.000006216392,0.000116490985,0.00027648473,0.0003221491,0.00052627927,0.98187655],"genre_scores_gemma":[0.0011224189,0.000008644325,0.00021125462,0.000023326736,0.0010629838,0.0000028420386,0.001104878,0.0000712011,0.9963924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981441,0.00010194597,0.00027175574,0.0006823463,0.0002984859,0.0005013886],"domain_scores_gemma":[0.99820334,0.0001438924,0.00035609625,0.0009785462,0.00014865476,0.00016945032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016086572,0.0004477328,0.00088277285,0.00046201618,0.00026815405,0.00007804423,0.00079955376,0.00020411961,0.00003771811],"category_scores_gemma":[0.000001296741,0.0005566701,0.0010642253,0.00021714887,0.00013644685,0.000050949442,0.0006940577,0.00055151735,0.00005377715],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009872999,0.000006756667,0.00012900856,0.000009168541,0.0029153733,0.00003302633,0.00000682479,0.00031140237,4.7581435e-7,0.43269965,0.5632729,0.00060552463],"study_design_scores_gemma":[0.00016673213,0.000014603425,0.00009898775,0.000057173464,0.0062593697,2.046994e-7,0.000015084316,0.0014058067,0.000008529534,0.00031081363,0.99108195,0.0005807604],"about_ca_topic_score_codex":0.00045069732,"about_ca_topic_score_gemma":0.000008722976,"teacher_disagreement_score":0.43238884,"about_ca_system_score_codex":0.00020208108,"about_ca_system_score_gemma":0.00017549015,"threshold_uncertainty_score":0.9996885},"labels":[],"label_agreement":null},{"id":"W4386906443","doi":"10.1017/9781139794985.006","title":"How Are Social Network Data Visualized?","year":2023,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nova Scotia Health Authority","funders":"","keywords":"Palette (painting); Field (mathematics); Visualization; Computer science; Data science; Power (physics); Artificial intelligence","score_opus":0.05974373323508856,"score_gpt":0.26314011617937627,"score_spread":0.20339638294428772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386906443","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013567514,0.00004447802,0.0062416354,0.000066655884,0.000184153,0.00036193087,0.0017734147,0.00050112495,0.990813],"genre_scores_gemma":[0.002127052,0.000020052516,0.00017018347,0.00002572248,0.0024790713,0.0000014366537,0.0019745063,0.0001152726,0.9930867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980532,0.000063668325,0.00020623396,0.0008743878,0.0003392943,0.00046324197],"domain_scores_gemma":[0.99778295,0.000085411135,0.0005213288,0.0013270029,0.00014981092,0.00013350649],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015573783,0.000500175,0.00074161286,0.00014424551,0.0004691259,0.00019046072,0.0015959681,0.0002539217,0.000018106664],"category_scores_gemma":[0.0000021714907,0.0006261624,0.0003994134,0.000030338286,0.00020370435,0.00013830629,0.002499005,0.00061838736,0.000022270799],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001577138,0.0000053357526,0.000016431675,0.000014773432,0.00043765706,0.000043786826,0.000007653642,0.0000018712741,0.0000011032137,0.59567875,0.40170825,0.002068643],"study_design_scores_gemma":[0.0002755925,0.000011213873,0.000023072856,0.00012386248,0.0006757654,5.3113223e-7,0.000059499038,0.0004109379,0.000008808491,0.00055128284,0.997255,0.0006044106],"about_ca_topic_score_codex":0.00019878037,"about_ca_topic_score_gemma":0.000011074812,"teacher_disagreement_score":0.5955468,"about_ca_system_score_codex":0.000087714856,"about_ca_system_score_gemma":0.00007779379,"threshold_uncertainty_score":0.99961895},"labels":[],"label_agreement":null},{"id":"W4386906490","doi":"10.1017/9781139794985.017","title":"Models for Network Diffusion","year":2023,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nova Scotia Health Authority","funders":"","keywords":"Affect (linguistics); Node (physics); Diffusion; Computer science; Network structure; Key (lock); Position (finance); Social network (sociolinguistics); Mechanism (biology); Data science; Sociology; Social media; World Wide Web; Epistemology; Computer security; Communication; Theoretical computer science; Business; Engineering; Physics; Philosophy","score_opus":0.03207677902062802,"score_gpt":0.21742950461848518,"score_spread":0.18535272559785715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386906490","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000153542,0.000026924103,0.10098464,0.000007093743,0.00013498135,0.0006036859,0.00038022076,0.0003316438,0.8975155],"genre_scores_gemma":[0.0017019125,0.00002315254,0.00070881954,0.000017055081,0.0009029318,0.0000059104223,0.00044808717,0.000100456826,0.99609166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866986,0.000020271658,0.00021445272,0.0005362255,0.00018485353,0.0003743431],"domain_scores_gemma":[0.9987539,0.00012780265,0.0002556779,0.00058720016,0.0001517679,0.00012363725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010309606,0.00038282885,0.0005199011,0.00012873083,0.0002930769,0.000045779958,0.00049126893,0.00018974284,0.000010419016],"category_scores_gemma":[7.287125e-7,0.0004623944,0.00058285287,0.000014572286,0.00008945418,0.000060777475,0.00052344386,0.00031121803,0.000010246406],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032814518,0.0000055925643,0.0000028816974,0.000018263612,0.00024016944,0.0000071011887,0.000007868188,0.00037832107,0.00000316033,0.8238608,0.17257944,0.0028635599],"study_design_scores_gemma":[0.00036886206,0.000032513075,0.000002289978,0.00017555774,0.0005077527,2.9416134e-7,0.000011053165,0.017922986,0.00002241166,0.009268737,0.9711492,0.0005383379],"about_ca_topic_score_codex":0.00017014773,"about_ca_topic_score_gemma":0.0000028366974,"teacher_disagreement_score":0.8145921,"about_ca_system_score_codex":0.0000781344,"about_ca_system_score_gemma":0.00005260825,"threshold_uncertainty_score":0.9997828},"labels":[],"label_agreement":null},{"id":"W4386906518","doi":"10.1017/9781139794985.005","title":"How Are Social Network Data Collected?","year":2023,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nova Scotia Health Authority","funders":"","keywords":"Key (lock); Data science; Nominalism; Computer science; Social network (sociolinguistics); Data collection; Missing data; Social network analysis; Management science; Sociology; Epistemology; Machine learning; World Wide Web; Computer security; Social science; Economics; Social media","score_opus":0.051495630412061386,"score_gpt":0.22792689031856822,"score_spread":0.17643125990650682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386906518","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014568289,0.000036994486,0.003470999,0.00006897432,0.00016788514,0.0003918449,0.0021221966,0.00047410047,0.99325246],"genre_scores_gemma":[0.0020008322,0.000016593123,0.00016552774,0.000020311261,0.0020668907,0.0000015591959,0.0018711167,0.000103658334,0.9937535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981604,0.000058131354,0.00019215641,0.00082745857,0.00031277665,0.00044904192],"domain_scores_gemma":[0.99786365,0.0000908832,0.0004812734,0.0012578205,0.0001807197,0.00012568162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000121192235,0.00046952508,0.00069740665,0.00015169966,0.0005616852,0.00018495461,0.001525005,0.00025264535,0.000016562113],"category_scores_gemma":[0.000002486325,0.0005961319,0.00034163447,0.000044377655,0.00019134334,0.000113065864,0.002177992,0.00063988066,0.00001686537],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014865365,0.0000046460423,0.000016650323,0.000011420722,0.0004368564,0.00004347937,0.0000071637096,0.0000026534901,9.105113e-7,0.51224166,0.48603827,0.0011814157],"study_design_scores_gemma":[0.0002554812,0.000012029822,0.00004321893,0.0001107472,0.0006527317,5.837226e-7,0.000051500137,0.00043494662,0.0000074379586,0.0004048399,0.99745405,0.0005724078],"about_ca_topic_score_codex":0.00021612839,"about_ca_topic_score_gemma":0.000026168753,"teacher_disagreement_score":0.5118368,"about_ca_system_score_codex":0.00010971539,"about_ca_system_score_gemma":0.00011346621,"threshold_uncertainty_score":0.999649},"labels":[],"label_agreement":null},{"id":"W4386906555","doi":"10.1017/9781139794985.014","title":"Networks and Culture","year":2023,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nova Scotia Health Authority","funders":"","keywords":"Sociology; Epistemology; Social structure; Political science; Politics","score_opus":0.016056476930855726,"score_gpt":0.2015195327186076,"score_spread":0.18546305578775185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386906555","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002118304,0.0000885087,0.005906461,0.0000072434495,0.000070102935,0.00022184911,0.00012269274,0.00027234215,0.9932896],"genre_scores_gemma":[0.0033757538,0.00008377669,0.000098399745,0.000015787075,0.00041308018,9.0545757e-7,0.00017389798,0.000054922068,0.99578345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902946,0.000020268933,0.00013936294,0.0004424955,0.00013403526,0.00023436939],"domain_scores_gemma":[0.9991789,0.0000395653,0.0001650963,0.00040692821,0.00008313343,0.00012638801],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00005604546,0.00032959366,0.00039488147,0.00010930902,0.0001805473,0.00005577512,0.00029459162,0.00019526988,0.000012054539],"category_scores_gemma":[5.670163e-7,0.00037529442,0.00023033966,0.000012065109,0.0001460142,0.000042217496,0.000498934,0.00048777674,0.000008950589],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009319733,0.0000027151614,0.00001837978,0.00000947794,0.000250933,0.000029771354,0.00001430159,0.000014316879,0.0000021275,0.8411795,0.15540625,0.0030629293],"study_design_scores_gemma":[0.00018349147,0.000019225632,0.000014475871,0.000105958046,0.00036118572,0.0000011688782,0.000018752711,0.0010385886,0.000015482601,0.00036023994,0.99746996,0.00041145037],"about_ca_topic_score_codex":0.00015878331,"about_ca_topic_score_gemma":0.0000022800625,"teacher_disagreement_score":0.8420637,"about_ca_system_score_codex":0.00003913648,"about_ca_system_score_gemma":0.000022759921,"threshold_uncertainty_score":0.9998699},"labels":[],"label_agreement":null},{"id":"W4386906624","doi":"10.1017/9781139794985.004","title":"What Is a Social Network?","year":2023,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nova Scotia Health Authority","funders":"","keywords":"Computer science; Sociology","score_opus":0.02579876408825009,"score_gpt":0.22610415595907662,"score_spread":0.20030539187082652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386906624","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023350052,0.00006665383,0.0014070466,0.000045386238,0.00029709926,0.00030325414,0.00019497634,0.0003736719,0.9972886],"genre_scores_gemma":[0.0009273271,0.000076922785,0.000078894496,0.00007650795,0.0016079432,0.0000018564939,0.00020958048,0.000093257775,0.99692774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984659,0.000035384874,0.00022239721,0.00058075844,0.00027615146,0.00041938445],"domain_scores_gemma":[0.99888194,0.000058794663,0.00029497375,0.0005073633,0.00013987548,0.000117060394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000100087316,0.00043388523,0.0005806713,0.00014134808,0.00038128608,0.00016921783,0.0005783839,0.00023927088,0.000065829074],"category_scores_gemma":[3.1112825e-7,0.0005567448,0.00064924016,0.000023383222,0.00016932271,0.00014363464,0.0006997412,0.00054642453,0.00007671431],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013704465,0.0000040662744,0.000004795161,0.000009902192,0.00039258637,0.000022263275,0.000041852814,0.0000029013129,0.000001344211,0.67262286,0.32166216,0.005221579],"study_design_scores_gemma":[0.00020909934,0.000014861373,0.000008573134,0.00015630678,0.0004682668,4.741443e-7,0.00006346384,0.0001403333,0.00002379982,0.0012416323,0.9971465,0.00052669324],"about_ca_topic_score_codex":0.00018026629,"about_ca_topic_score_gemma":0.0000027711637,"teacher_disagreement_score":0.67548436,"about_ca_system_score_codex":0.00009948252,"about_ca_system_score_gemma":0.00007063503,"threshold_uncertainty_score":0.9996884},"labels":[],"label_agreement":null},{"id":"W4387251487","doi":"10.1109/cibcb56990.2023.10264878","title":"Comparison of Representations to Evolve Weighted Contact Networks with Epidemic Properties","year":2023,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; University of Guelph","funders":"","keywords":"Computer science; Artificial intelligence; Theoretical computer science","score_opus":0.04667722490280646,"score_gpt":0.3453136742870726,"score_spread":0.29863644938426614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387251487","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64514667,0.000043968077,0.33365816,0.00044256402,0.00003208975,0.00057441177,0.0000060877373,0.0003828636,0.019713195],"genre_scores_gemma":[0.9944477,0.0000011753957,0.0041755196,0.000025899024,0.00009243778,0.00008640581,0.000053944506,0.0000150325395,0.0011018955],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990879,0.000049057297,0.00031867262,0.00020601646,0.00013356551,0.00020477168],"domain_scores_gemma":[0.9992772,0.00011074487,0.00010750328,0.0003236166,0.00011686601,0.00006411154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012528816,0.00011259771,0.00032686762,0.00012060322,0.00007411854,0.000020918575,0.0001560105,0.000018091845,0.0003707163],"category_scores_gemma":[0.0000040639475,0.000080609534,0.00008098154,0.00083025126,0.000028135195,0.0000630507,0.000078928024,0.000093465074,0.00003154387],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004847723,0.000101815276,0.88916695,0.0000061569576,0.0002677312,4.75192e-7,0.00048031012,0.02819119,0.0012858323,0.015855892,0.059398293,0.00519686],"study_design_scores_gemma":[0.00047208523,0.00031466092,0.07940252,0.00016582439,0.00018872914,2.9192216e-7,0.0027647386,0.89126664,0.018929426,0.0027613044,0.003260166,0.0004736301],"about_ca_topic_score_codex":0.00089328317,"about_ca_topic_score_gemma":0.00011652816,"teacher_disagreement_score":0.86307544,"about_ca_system_score_codex":0.000014168516,"about_ca_system_score_gemma":0.000020886564,"threshold_uncertainty_score":0.40590838},"labels":[],"label_agreement":null},{"id":"W4387404654","doi":"10.1080/02564602.2023.2258490","title":"Performance Analysis of a Multicore Approach Proposed for Efficient Community Detection and Recommendation System","year":2023,"lang":"en","type":"article","venue":"IETE Technical Review","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Carter G. Woodson Institute for African-American and African Studies, University of Virginia; Grantová Agentura České Republiky; Workplace Safety and Insurance Board","keywords":"Computer science; Multi-core processor; Computer architecture; Parallel computing","score_opus":0.0432048549251967,"score_gpt":0.3222771678058349,"score_spread":0.27907231288063816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387404654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5312267,0.0013441124,0.45910934,0.00016102432,0.000042138825,0.004573925,0.00010669042,0.0009810245,0.002455087],"genre_scores_gemma":[0.9962327,0.00043015258,0.0027777203,0.000010903243,0.00001586816,0.00029663375,0.00021842445,0.00001058973,0.0000070310825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895525,0.00016015736,0.00045389924,0.00017993576,0.00010744478,0.00014328814],"domain_scores_gemma":[0.9990555,0.0001880723,0.00024451307,0.00036623934,0.00010683039,0.00003882581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001360371,0.00011810745,0.0005452916,0.00017663413,0.00015518366,0.000011101708,0.00015052265,0.000034029476,0.000010447611],"category_scores_gemma":[0.00003093821,0.00009826269,0.0002703818,0.0017297077,0.00004336702,0.00002975702,0.000100351834,0.00016418428,0.0000016464536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003492511,0.0003601257,0.004862699,0.0088626435,0.0010334103,7.1148996e-8,0.000068579575,0.0010695945,0.0037514765,0.0018992535,0.0004768994,0.9775803],"study_design_scores_gemma":[0.00019817895,0.00011702378,0.008863123,0.0010675063,0.0026892878,5.158813e-7,0.00007376473,0.98435766,0.000712879,0.000049730894,0.0016796489,0.00019067114],"about_ca_topic_score_codex":0.000052129322,"about_ca_topic_score_gemma":0.0000057979105,"teacher_disagreement_score":0.98328805,"about_ca_system_score_codex":0.000040141244,"about_ca_system_score_gemma":0.00000910365,"threshold_uncertainty_score":0.40070364},"labels":[],"label_agreement":null},{"id":"W4387568951","doi":"10.1016/j.tra.2023.103838","title":"Towards analyzing the robustness of the Integrated Global Transportation Network Abstraction (IGTNA)","year":2023,"lang":"en","type":"article","venue":"Transportation Research Part A Policy and Practice","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Robustness (evolution); Interconnectivity; Flow network; Aviation; Scalability; Computer science; Transport engineering; Complex network; Engineering","score_opus":0.08155512086474098,"score_gpt":0.4248053558378969,"score_spread":0.34325023497315593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387568951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92844886,0.00022961784,0.031123055,0.028362272,0.00026480143,0.0015245891,0.00052049523,0.00024528883,0.009281042],"genre_scores_gemma":[0.99845934,0.00014967856,0.00031447108,0.000042992175,0.00048937363,0.00008360839,0.00025611126,0.000011976908,0.00019242609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99786973,0.00060686463,0.00040657606,0.00023362164,0.0005147275,0.00036845563],"domain_scores_gemma":[0.9979383,0.0010286984,0.00024451836,0.0002897075,0.00043085986,0.00006794458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023431862,0.00013231857,0.00017751216,0.00009940247,0.0005316487,0.000078214725,0.00024367253,0.000055077784,0.000108509645],"category_scores_gemma":[0.00012234856,0.00008864505,0.00012744225,0.00348756,0.0002170421,0.00036429692,0.000008275632,0.0004370108,0.000005397347],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010224152,0.00037474252,0.123954296,0.00016127813,0.001192138,0.000008762368,0.005025001,0.24943213,0.0006501121,0.46808046,0.047674708,0.10242394],"study_design_scores_gemma":[0.0005260633,0.00008316266,0.7913372,0.00014859189,0.00036200127,0.0000013253823,0.0044546505,0.011788823,0.0004234566,0.018323513,0.17227077,0.00028046398],"about_ca_topic_score_codex":0.009169275,"about_ca_topic_score_gemma":0.0020458496,"teacher_disagreement_score":0.6673829,"about_ca_system_score_codex":0.00003624612,"about_ca_system_score_gemma":0.0002495824,"threshold_uncertainty_score":0.9974288},"labels":[],"label_agreement":null},{"id":"W4387673980","doi":"10.1038/s42256-023-00735-0","title":"Forecasting the future of artificial intelligence with machine learning-based link prediction in an exponentially growing knowledge network","year":2023,"lang":"en","type":"article","venue":"Nature Machine Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alpha Technologies (Canada); Centre de Santé et de Services Sociaux Cavendish; University of Toronto","funders":"Templeton World Charity Foundation; Fundação para a Ciência e a Tecnologia; Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa; Ministério da Ciência, Tecnologia e Ensino Superior; Max-Planck-Gesellschaft; National Science Foundation","keywords":"Computer science; Benchmark (surveying); Artificial intelligence; Machine learning; Data science; Field (mathematics); Task (project management); Deep learning; Graph; Network science; Complex network; Theoretical computer science","score_opus":0.018700645347449526,"score_gpt":0.28709456819910234,"score_spread":0.2683939228516528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387673980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15426324,0.0022870912,0.83978325,0.00075233274,0.0006506652,0.00085356337,0.00004946741,0.0004996284,0.00086077297],"genre_scores_gemma":[0.99521446,0.000016145668,0.0024104165,0.000037990932,0.0018666516,0.000054853703,0.00030436067,0.000047609166,0.000047505306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764085,0.00029503772,0.0006708618,0.0005136537,0.00035623886,0.00052337954],"domain_scores_gemma":[0.99854225,0.00040138236,0.00031375556,0.00046991164,0.00019483766,0.000077848475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012114082,0.00033289572,0.00038422097,0.00028546844,0.00031479035,0.00007864548,0.0006648429,0.0001743951,0.00019359739],"category_scores_gemma":[0.00003056833,0.00023998815,0.00017107894,0.0025615569,0.00012537024,0.00021522035,0.0001744851,0.0018787081,0.000010189011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015209812,0.00012376164,0.06270662,0.000027132857,0.00006197333,0.000007335281,0.00049667107,0.4901567,0.00017554432,0.012674993,0.00007443055,0.43334273],"study_design_scores_gemma":[0.00004585524,0.00022864013,0.0010737483,0.00017966302,0.000053813837,0.000001647228,0.00035038052,0.9785673,0.005187179,0.013007752,0.0010611283,0.00024287518],"about_ca_topic_score_codex":0.00022277945,"about_ca_topic_score_gemma":0.0015194318,"teacher_disagreement_score":0.8409512,"about_ca_system_score_codex":0.00003983931,"about_ca_system_score_gemma":0.00008256286,"threshold_uncertainty_score":0.9786433},"labels":[],"label_agreement":null},{"id":"W4387842356","doi":"10.1016/j.datak.2023.102238","title":"User-generated short-text classification using cograph editing-based network clustering with an application in invoice categorization","year":2023,"lang":"en","type":"article","venue":"Data & Knowledge Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Ontario Ministry of Research and Innovation; Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Foundation for Innovation","keywords":"Computer science; Categorization; Cluster analysis; Invoice; Information retrieval; Product (mathematics); Natural language processing; Data mining; Artificial intelligence; World Wide Web","score_opus":0.04509888621521016,"score_gpt":0.2994695044326596,"score_spread":0.25437061821744944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387842356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14864871,0.000034106655,0.85044855,0.000008973858,0.00008235434,0.0002820742,0.00003766047,0.00039801525,0.000059553666],"genre_scores_gemma":[0.9744105,0.0000025942918,0.013885153,0.000003597253,0.0009449064,0.00010654708,0.010579822,0.000061504696,0.0000054178913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986285,0.000053117907,0.00033671275,0.00050590286,0.00012811783,0.00034764095],"domain_scores_gemma":[0.9989326,0.000059227423,0.00009000693,0.00074772607,0.00009489142,0.000075565265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042949215,0.00021613514,0.00021807117,0.00031792722,0.00010390033,0.000107000145,0.0004192852,0.00005477976,0.00000864954],"category_scores_gemma":[0.000007270851,0.0002388418,0.000027046295,0.0025653988,0.000017610704,0.00044434404,0.0001498386,0.00018664612,0.000008932822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015000875,0.00010671815,0.08540051,0.00005273158,0.000064933076,0.0000013556082,0.00014861878,0.8631446,0.00877,0.0014542888,0.0004267107,0.040414546],"study_design_scores_gemma":[0.00015338078,0.000013630881,0.0071028722,0.000076398734,0.00004178211,2.4651865e-7,0.00006493321,0.9900123,0.00037918965,0.000025622954,0.0018844744,0.00024520096],"about_ca_topic_score_codex":0.00019835611,"about_ca_topic_score_gemma":0.0007040629,"teacher_disagreement_score":0.8365634,"about_ca_system_score_codex":0.00006777749,"about_ca_system_score_gemma":0.000047632304,"threshold_uncertainty_score":0.9739686},"labels":[],"label_agreement":null},{"id":"W4387860588","doi":"10.1142/s0218339024500086","title":"MODELING AND ANALYZING DYNAMIC INFORMATION PROPAGATION ON SINA WEIBO IN A SEMI-DIRECTED NETWORK","year":2023,"lang":"en","type":"article","venue":"Journal of Biological Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Microblogging; Dissemination; Computer science; Information Dissemination; Social media; Data mining; Data science; World Wide Web","score_opus":0.01879298941251342,"score_gpt":0.26430129903842925,"score_spread":0.24550830962591583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387860588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96488625,0.000108917025,0.03446049,0.000055520683,0.000077191886,0.00014158348,0.0000019575004,0.000051215895,0.0002168486],"genre_scores_gemma":[0.9995391,0.000031131938,0.0001764155,0.0000063505786,0.00020698282,0.000007210997,0.000023213892,0.0000032833611,0.0000063164507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989324,0.00013918625,0.00057230005,0.00007797211,0.000117297684,0.0001608084],"domain_scores_gemma":[0.9994197,0.000083648265,0.00030474938,0.00006394207,0.00008685361,0.00004113702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000800349,0.00009049135,0.0002805883,0.00019132668,0.00005677741,0.00006585343,0.00008012744,0.00005096374,0.000005061912],"category_scores_gemma":[0.000021165048,0.00006135775,0.00007184465,0.0005609981,0.000011869885,0.00016121576,0.000030528427,0.00018796418,0.000004255737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090473106,0.00004860055,0.12298644,0.000023605477,0.000108329165,0.0000055757596,0.00015920807,0.8395064,0.0006976943,0.0024854357,0.0003271031,0.03356113],"study_design_scores_gemma":[0.00016424764,0.00013390892,0.00900877,0.00020403725,0.000010796701,0.0000029454025,0.0001460159,0.98828375,0.000006017589,0.001807039,0.00015447146,0.0000780148],"about_ca_topic_score_codex":0.000063962514,"about_ca_topic_score_gemma":0.0000041026033,"teacher_disagreement_score":0.14877734,"about_ca_system_score_codex":0.00005092194,"about_ca_system_score_gemma":0.000012867295,"threshold_uncertainty_score":0.25020966},"labels":[],"label_agreement":null},{"id":"W4388217605","doi":"10.1038/s41567-023-02246-6","title":"Geometric description of clustering in directed networks","year":2023,"lang":"en","type":"article","venue":"Nature Physics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Cluster analysis; Complex network; Topology (electrical circuits); Reciprocity (cultural anthropology); Assortativity; Interdependent networks; Entropy (arrow of time); Computer science; Node (physics); Theoretical computer science; Physics; Artificial intelligence; Mathematics","score_opus":0.014991643892266938,"score_gpt":0.2684816137545744,"score_spread":0.2534899698623075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388217605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68105537,0.00037332514,0.30900988,0.00005927172,0.0003538898,0.00038346104,0.0000181525,0.0006312952,0.0081153605],"genre_scores_gemma":[0.99871963,0.00001145576,0.0006342399,0.000012098953,0.00037618697,0.000015771471,0.00011063062,0.000017322636,0.000102688726],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923193,0.000034989484,0.0001994039,0.00017538099,0.00014602856,0.0002122407],"domain_scores_gemma":[0.999518,0.0000758278,0.00010259945,0.00021211976,0.000066639244,0.000024857403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014191687,0.000111182686,0.00022536595,0.00024113768,0.000030404524,0.00001769233,0.00014863213,0.0000784621,0.000024913808],"category_scores_gemma":[0.000006340321,0.00011310908,0.00010702078,0.003917733,0.000017427788,0.00009390695,0.00009655852,0.00041797364,0.000005727798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048720744,0.00038302975,0.46792668,0.000057452442,0.0002629944,0.0000052604014,0.0003032513,0.19317766,0.0037187228,0.017687052,0.016647127,0.29978204],"study_design_scores_gemma":[0.00041410208,0.000029097195,0.14779598,0.00010016336,0.000051383166,1.4391168e-7,0.000058554604,0.8221177,0.0023699359,0.025723927,0.0010170247,0.00032198033],"about_ca_topic_score_codex":0.00011001806,"about_ca_topic_score_gemma":0.00003423989,"teacher_disagreement_score":0.62894005,"about_ca_system_score_codex":0.00002626137,"about_ca_system_score_gemma":0.0000104758365,"threshold_uncertainty_score":0.46124545},"labels":[],"label_agreement":null},{"id":"W4388303805","doi":"10.1007/s10479-023-05655-1","title":"Vulnerability analysis of China’s air and high-speed rail composite express network under different node attack strategies","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Vulnerability (computing); Computer science; Node (physics); Position (finance); Computer network; Vulnerability assessment; Topology (electrical circuits); Flow network; China; Computer security; Psychological resilience; Engineering; Business; Structural engineering; Geography; Mathematics","score_opus":0.15763595444865758,"score_gpt":0.4511901562351217,"score_spread":0.29355420178646413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388303805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99045193,0.00008917122,0.0069955024,0.0012314776,0.000012752931,0.0002529859,0.000104042934,0.000039462913,0.0008226761],"genre_scores_gemma":[0.9986839,0.000087698194,0.00038936987,0.000013292767,0.000093688905,0.00004129038,0.00039545223,0.000013528683,0.00028174795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9977316,0.00053362636,0.00048904674,0.00034925606,0.00049929623,0.0003971628],"domain_scores_gemma":[0.99827427,0.0003196363,0.00006151093,0.0006121598,0.0006379536,0.0000944517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011222229,0.00015507087,0.0005555162,0.00055020733,0.0003630316,0.00012360011,0.00030675493,0.000045143013,0.00038800685],"category_scores_gemma":[0.000014297613,0.00013393401,0.00021271687,0.0025687062,0.00030565576,0.00019867436,0.00032054982,0.00027035948,0.0000043420973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034378005,0.0002626088,0.053796876,0.000030016672,0.0015736733,4.8241185e-7,0.00040034327,0.9103254,0.004519959,0.024449214,0.0036344482,0.000972566],"study_design_scores_gemma":[0.00021311421,0.00009451261,0.6448741,0.000041450323,0.00019303692,5.6542333e-8,0.0006981309,0.33821252,0.006998117,0.008345006,0.00013567264,0.00019428947],"about_ca_topic_score_codex":0.0032075727,"about_ca_topic_score_gemma":0.00045394906,"teacher_disagreement_score":0.5910772,"about_ca_system_score_codex":0.0000110202,"about_ca_system_score_gemma":0.000066100794,"threshold_uncertainty_score":0.546167},"labels":[],"label_agreement":null},{"id":"W4388421529","doi":"10.1145/3631609","title":"Laplacian Change Point Detection for Single and Multi-view Dynamic Graphs","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Knowledge Discovery from Data","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute; Canadian Institute for Advanced Research; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Anomaly detection; Laplacian matrix; Snapshot (computer storage); Laplace operator; Embedding; Theoretical computer science; Graph; Algorithm; Data mining; Artificial intelligence; Mathematics","score_opus":0.09321852727549758,"score_gpt":0.335970799174395,"score_spread":0.24275227189889742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388421529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05113339,0.0004360422,0.9386553,0.00024359701,0.0003607133,0.00082117616,0.007877279,0.00033603574,0.00013646709],"genre_scores_gemma":[0.99258745,0.00012002211,0.0028422065,0.00002228388,0.00012007026,0.00032118472,0.0036055646,0.000041761134,0.00033943585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987683,0.000053745312,0.00023733114,0.0005968026,0.00008222154,0.00026155091],"domain_scores_gemma":[0.9982471,0.0002588322,0.0000709272,0.0013168775,0.00003936082,0.00006694474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001606441,0.00021685132,0.0002615508,0.00020648997,0.000294201,0.00013516344,0.0005313893,0.00005152387,0.0000774448],"category_scores_gemma":[0.000008750712,0.0002185579,0.0001410436,0.0004790481,0.000054565622,0.0006474492,0.000074742,0.00015154573,0.00005431413],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050085102,0.0005948372,0.00038983993,0.000037956735,0.00035330726,8.1201455e-7,0.00037904596,0.000015458822,0.003246224,0.00017020655,0.00062206475,0.99414015],"study_design_scores_gemma":[0.009509834,0.0014951897,0.032308284,0.0016067016,0.0046305354,0.000007846293,0.0048567895,0.6067781,0.039533865,0.15308234,0.14103039,0.00516016],"about_ca_topic_score_codex":0.0004873243,"about_ca_topic_score_gemma":0.003308335,"teacher_disagreement_score":0.98898,"about_ca_system_score_codex":0.0000359563,"about_ca_system_score_gemma":0.000016514807,"threshold_uncertainty_score":0.8912533},"labels":[],"label_agreement":null},{"id":"W4388491187","doi":"10.1007/s11222-023-10342-z","title":"Online estimation and community detection of network point processes for event streams","year":2023,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Inference; Computer science; Event (particle physics); Data mining; Point process; Scalability; Regret; Machine learning; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.01715036860203964,"score_gpt":0.30551085085369634,"score_spread":0.28836048225165667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388491187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36237758,0.000021352873,0.6373754,0.000008361253,0.000012521213,0.00008247726,0.00008536069,0.000024944826,0.000011975933],"genre_scores_gemma":[0.9526683,0.000007107945,0.046979293,0.0000036599024,0.00007924796,0.0000044974154,0.00024553467,0.000006855075,0.000005494066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955547,0.000041430852,0.0001786927,0.0000788352,0.00004127659,0.00010428972],"domain_scores_gemma":[0.99919957,0.00048880477,0.00012584623,0.0000707484,0.00009321895,0.000021809743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025620425,0.00006563381,0.00013082149,0.00003049393,0.00026358257,0.000023061593,0.000035478046,0.000011062697,0.0000013594516],"category_scores_gemma":[0.000027486945,0.000066052395,0.000014588725,0.00016851493,0.000027464817,0.000019855497,0.00007162734,0.000079635094,8.843732e-8],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000089868445,0.00008334241,0.008408659,0.0002131637,0.00006090337,9.5910174e-8,0.00042302176,0.01521282,0.000117445365,0.010801095,0.00026599242,0.96440446],"study_design_scores_gemma":[0.00012161098,0.000095367446,0.009953989,0.00006521502,0.000036948175,2.3022879e-7,0.00029302086,0.88370174,0.00021000685,0.10541563,0.000038352147,0.00006788485],"about_ca_topic_score_codex":0.00018728325,"about_ca_topic_score_gemma":0.00007623299,"teacher_disagreement_score":0.9643366,"about_ca_system_score_codex":0.0000044840417,"about_ca_system_score_gemma":0.000011890893,"threshold_uncertainty_score":0.26935384},"labels":[],"label_agreement":null},{"id":"W4388584741","doi":"10.48550/arxiv.2311.05059","title":"Symmetry breaking in optimal transport networks","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Army Research Office; National Science Foundation","keywords":"Dimension (graph theory); Node (physics); Computer science; Layer (electronics); Set (abstract data type); Mathematical optimization; Atlanta; Order (exchange); Topology (electrical circuits); Mathematics; Engineering; Combinatorics; Economics; Geography","score_opus":0.05981319575339871,"score_gpt":0.20394458361015436,"score_spread":0.14413138785675564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388584741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5354852,0.000024790092,0.45927763,0.000019187673,0.00017392018,0.00024869377,0.00002683064,0.0003025848,0.0044411942],"genre_scores_gemma":[0.99769574,0.000037133017,0.00036967598,0.000011062152,0.00031974926,0.0000032883518,0.0002348531,0.000055565873,0.0012729008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981158,0.00008813995,0.00031344115,0.00093975855,0.000067685105,0.00047521217],"domain_scores_gemma":[0.99877006,0.00008956919,0.00022806594,0.00074447895,0.000059861628,0.00010794389],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026718475,0.0003697932,0.000547052,0.00043302655,0.000088518755,0.000038669543,0.0007325915,0.00021804874,0.00022416242],"category_scores_gemma":[0.000001716723,0.00047674694,0.00045642763,0.0010251108,0.00007401848,0.000104526145,0.0005997846,0.0010069546,0.000033691587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019493542,0.00006952258,0.21645394,0.000016008931,0.00017723897,0.00013212557,0.00003850748,0.7440907,0.0000014113409,0.037916828,0.0002569985,0.0008272418],"study_design_scores_gemma":[0.0004417118,0.00002507468,0.02533963,0.0002994618,0.0003168622,4.552095e-7,0.00021413155,0.9289311,0.000018742543,0.043209527,0.00037994693,0.00082334754],"about_ca_topic_score_codex":0.0024743911,"about_ca_topic_score_gemma":0.00029343303,"teacher_disagreement_score":0.4622106,"about_ca_system_score_codex":0.00014054996,"about_ca_system_score_gemma":0.000079232384,"threshold_uncertainty_score":0.99976844},"labels":[],"label_agreement":null},{"id":"W4388841598","doi":"10.1016/j.rico.2023.100339","title":"Optimal control of a rumor propagation model in online social network by considering influential nodes","year":2023,"lang":"en","type":"article","venue":"Results in Control and Optimization","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Rumor; Homogeneous; Control (management); Government (linguistics); Computer science; Internet privacy; Public relations; Computer security; Sociology; Political science; Artificial intelligence; Mathematics","score_opus":0.010528877455105176,"score_gpt":0.2581281791946921,"score_spread":0.24759930173958694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388841598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23309319,0.000060880964,0.7655672,0.0003645488,0.000020625745,0.0004475266,0.00022520656,0.00006148424,0.00015937233],"genre_scores_gemma":[0.9921825,0.000018294037,0.007208174,0.000030461226,0.00012976945,0.00004333729,0.00035418774,0.0000136016715,0.000019702533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987625,0.00008811398,0.0005659816,0.00022575642,0.00012590359,0.00023175687],"domain_scores_gemma":[0.9994722,0.00012106677,0.00021877095,0.000088210756,0.00007359994,0.00002617798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003811594,0.00012797574,0.00033215867,0.00014305033,0.000066426706,0.00003133419,0.00006755749,0.000056301622,0.0000049156356],"category_scores_gemma":[0.000026725387,0.00013186199,0.000051976276,0.00043168338,0.000048391914,0.00012803123,0.000031520834,0.00011800398,3.2003754e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030106457,0.00006414438,0.0052784346,0.0000072378034,0.000030884792,6.0139837e-7,0.0001448313,0.9896974,0.00035903638,0.00064186397,0.00026893435,0.0032055664],"study_design_scores_gemma":[0.0043079085,0.00002197443,0.001535945,0.000042374337,0.00002955123,8.783073e-8,0.000056982182,0.9929448,0.00004004458,0.0008863594,0.000016436972,0.000117569674],"about_ca_topic_score_codex":0.00013675583,"about_ca_topic_score_gemma":0.000039401024,"teacher_disagreement_score":0.7590893,"about_ca_system_score_codex":0.00002248737,"about_ca_system_score_gemma":0.00003740024,"threshold_uncertainty_score":0.5377176},"labels":[],"label_agreement":null},{"id":"W4388856670","doi":"10.1038/s41467-023-43337-5","title":"The D-Mercator method for the multidimensional hyperbolic embedding of real networks","year":2023,"lang":"en","type":"article","venue":"Nature Communications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Agencia Estatal de Investigación; Canada First Research Excellence Fund; Institució Catalana de Recerca i Estudis Avançats; Ministerio de Economía y Competitividad; Generalitat de Catalunya; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Mercator projection; Curse of dimensionality; Subspace topology; Hyperbolic space; Embedding; Computer science; Hyperbolic geometry; Mathematics; Algorithm; Artificial intelligence; Geometry; Geography; Cartography; Differential geometry","score_opus":0.026093853942949934,"score_gpt":0.3852912536427652,"score_spread":0.35919739969981523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388856670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02116088,0.019260976,0.89228743,0.043926746,0.0011035975,0.0046538245,0.00036295253,0.0011242834,0.016119286],"genre_scores_gemma":[0.9481845,0.00050089,0.050440412,0.00005751872,0.00018631284,0.00027989224,0.00014437515,0.000017609564,0.0001885118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999204,0.00016383104,0.00023064329,0.000114071474,0.0001128619,0.00017462253],"domain_scores_gemma":[0.992712,0.005350039,0.0001461138,0.0015888361,0.00017822844,0.000024771665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081647764,0.00009147417,0.00014095806,0.000042200423,0.000952365,0.000024699286,0.001105633,0.000066335066,0.000009920437],"category_scores_gemma":[0.00003895184,0.000055252774,0.00019799836,0.00057267933,0.00011449493,0.000029271536,0.0004436904,0.00049986044,0.00000284391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014347801,0.00006741938,0.004090673,0.0000023720909,0.000417285,2.5375149e-8,0.00025395115,0.0059784683,0.0006506809,0.8284209,0.06567812,0.094425805],"study_design_scores_gemma":[0.00011131099,0.0000074346963,0.0062206844,0.000011560056,0.00010721223,1.8658115e-7,0.00031759354,0.8064056,0.000193055,0.0047285035,0.18181147,0.00008541121],"about_ca_topic_score_codex":0.00021451646,"about_ca_topic_score_gemma":0.00023199242,"teacher_disagreement_score":0.9270236,"about_ca_system_score_codex":0.0000127300345,"about_ca_system_score_gemma":0.000032490865,"threshold_uncertainty_score":0.7324918},"labels":[],"label_agreement":null},{"id":"W4389128584","doi":"10.1371/journal.pone.0292018","title":"A network community structure similarity index for weighted networks","year":2023,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Western University","keywords":"Jaccard index; Community structure; Similarity (geometry); Data mining; Computer science; Complex network; Enhanced Data Rates for GSM Evolution; Index (typography); Network analysis; Weighted network; Identification (biology); Artificial intelligence; Mathematics; Cluster analysis; Statistics; World Wide Web","score_opus":0.048633925951714584,"score_gpt":0.26151710739871076,"score_spread":0.21288318144699617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389128584","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92405146,0.000059594433,0.07128864,0.00046479926,0.0000692952,0.0010362975,0.00016632525,0.0009111061,0.0019524953],"genre_scores_gemma":[0.99193186,0.0000035363412,0.005358888,0.00018720089,0.0012889922,0.00012284153,0.0008241056,0.000040261693,0.00024230732],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986585,0.00017331893,0.00026813344,0.00021240299,0.00019948518,0.00048820872],"domain_scores_gemma":[0.9986795,0.00035426157,0.00012808289,0.00061291596,0.00013615187,0.00008904632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034344636,0.00020164002,0.0004144241,0.000072726165,0.0005326293,0.00006692877,0.00039226215,0.00009088827,0.00033121096],"category_scores_gemma":[0.000009606355,0.0002044312,0.00014676503,0.00083807454,0.00004998621,0.0000721537,0.00024243428,0.0006174004,0.000008824443],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029739755,0.0034860696,0.67306733,0.00022389364,0.005794104,0.0000034395305,0.0006767223,0.019932525,0.0019335563,0.041561406,0.23249246,0.020531071],"study_design_scores_gemma":[0.00061455794,0.00010108945,0.022285968,0.00014427128,0.00044532554,6.4126475e-8,0.00008275222,0.55415714,0.000788796,0.4195977,0.0012944663,0.00048791178],"about_ca_topic_score_codex":0.00021714918,"about_ca_topic_score_gemma":0.000119032775,"teacher_disagreement_score":0.6507814,"about_ca_system_score_codex":0.000025720034,"about_ca_system_score_gemma":0.000021833765,"threshold_uncertainty_score":0.83364624},"labels":[],"label_agreement":null},{"id":"W4389306584","doi":"10.1038/s41598-023-48081-w","title":"Hypergraph reconstruction from uncertain pairwise observations","year":2023,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Université Laval; James S. McDonnell Foundation","keywords":"Pairwise comparison; Computer science; Inference; Hypergraph; Bayesian network; Graph; Series (stratigraphy); Bayesian inference; Bayesian probability; Theoretical computer science; Gibbs sampling; Artificial intelligence; Algorithm; Data mining; Mathematics; Combinatorics","score_opus":0.035189790767131204,"score_gpt":0.2646179630760669,"score_spread":0.2294281723089357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389306584","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99100584,0.000021619815,0.002503161,0.0001944414,0.0025837908,0.00014727825,0.000011195428,0.0004151765,0.0031175106],"genre_scores_gemma":[0.9928719,0.0000011525424,0.0027551993,0.0000075679613,0.00023212183,0.00004867268,0.00070211315,0.000011661847,0.0033696308],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985954,0.00003766541,0.00036559982,0.0005303119,0.00025179153,0.00021923862],"domain_scores_gemma":[0.9988349,0.00004513106,0.00019800429,0.00073346304,0.00011990991,0.00006859861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055031484,0.00010356871,0.00014484579,0.00020868293,0.00038466338,0.00021107122,0.000109973094,0.000024978193,0.00076522015],"category_scores_gemma":[0.000016095304,0.000101235266,0.0001575373,0.0016725702,0.00011650726,0.0001724643,0.000067179455,0.00008130672,0.00007454569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016408236,0.00004960436,0.74258417,0.0000026754467,0.00009593388,0.0000452319,0.0001571653,0.0006864105,0.014071505,0.002602323,0.17878936,0.06091395],"study_design_scores_gemma":[0.000075762524,0.0000070842866,0.04955876,0.00004339643,0.00006543052,0.0000063746475,0.00034588578,0.010129597,0.0065653683,0.83810353,0.094795205,0.0003035868],"about_ca_topic_score_codex":0.0006194178,"about_ca_topic_score_gemma":0.0000510991,"teacher_disagreement_score":0.83550125,"about_ca_system_score_codex":0.000020332405,"about_ca_system_score_gemma":0.000063728396,"threshold_uncertainty_score":0.83786243},"labels":[],"label_agreement":null},{"id":"W4389523864","doi":"10.18653/v1/2023.lchange-1.5","title":"A longitudinal study about gradual changes in the Iranian Online Public Sphere pre and post of ‘Mahsa Moment’: Focusing on Twitter","year":2023,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute","funders":"","keywords":"Event (particle physics); Cyberspace; Meaning (existential); Word (group theory); Computer science; Moment (physics); Cluster analysis; Artificial intelligence; History; World Wide Web; Linguistics; The Internet; Epistemology; Philosophy","score_opus":0.060845472574804056,"score_gpt":0.326747989761991,"score_spread":0.26590251718718694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389523864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99657404,0.000014837961,0.00016436784,0.0019928217,0.000011948311,0.00037990607,0.0000140015045,0.000046554964,0.0008014981],"genre_scores_gemma":[0.99930435,0.00000240121,0.000115839975,0.00007838577,0.00015785212,0.000035011446,0.000043401065,0.000012506308,0.0002502633],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990339,0.000092306705,0.00020117866,0.00023747089,0.0002130367,0.00022207046],"domain_scores_gemma":[0.99949944,0.0000747175,0.00007680815,0.00027334262,0.00004606884,0.000029609842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002702273,0.00014057776,0.00022235695,0.00015184264,0.000071929215,0.00007636688,0.00018786412,0.000016701712,0.00016785129],"category_scores_gemma":[0.0000025498716,0.00009430506,0.000053697204,0.00058803905,0.00003666606,0.00005897545,0.000097408956,0.00013443742,0.000003002086],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020776159,0.0008590348,0.9635663,0.000010358178,0.00013256706,0.0000065547024,0.0025837258,0.000012895508,0.00023688904,0.00266802,0.00078836054,0.029114528],"study_design_scores_gemma":[0.00040922832,0.00034081386,0.9912212,0.0000356005,0.00004365857,5.8607037e-7,0.005926406,0.0005274836,0.000109287445,0.00083757605,0.00041584735,0.0001323404],"about_ca_topic_score_codex":0.0011375054,"about_ca_topic_score_gemma":0.0038966634,"teacher_disagreement_score":0.028982187,"about_ca_system_score_codex":0.000010927758,"about_ca_system_score_gemma":0.000012086255,"threshold_uncertainty_score":0.38456488},"labels":[],"label_agreement":null},{"id":"W4389611245","doi":"10.1016/j.eswa.2023.122902","title":"Integrating social media data: Venues, groups and activities","year":2023,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Interoperability; Ontology; Social media; Variety (cybernetics); Task (project management); Semantics (computer science); Data science; World Wide Web; Data integration; Ontology-based data integration; Knowledge management; Database; Semantic Web; Artificial intelligence","score_opus":0.0336398441966502,"score_gpt":0.3020800828935923,"score_spread":0.2684402386969421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389611245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17519562,0.00313186,0.79050535,0.0015846962,0.0003623503,0.0036297746,0.0012860115,0.0029058077,0.021398505],"genre_scores_gemma":[0.9958981,0.000008251002,0.0008061913,0.000006888572,0.001291416,0.0012195492,0.0006586442,0.000019218656,0.000091693735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993186,0.000031347252,0.00014117168,0.00024909558,0.00011588774,0.0001439125],"domain_scores_gemma":[0.9993395,0.000136646,0.00008886869,0.00037326597,0.000024927971,0.000036798552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001238039,0.00009965265,0.0001651107,0.00006082612,0.0002880465,0.000087899716,0.00021200773,0.000020988577,0.000009680142],"category_scores_gemma":[0.0000021321603,0.00008482788,0.000018958308,0.00033835255,0.000059316586,0.00012397073,0.00012244348,0.00008457839,0.000014055569],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017888158,0.00017755566,0.020330112,0.00007501365,0.0005616127,0.0000027089075,0.01954977,0.000037952046,0.0036937252,0.62134284,0.19024254,0.14396825],"study_design_scores_gemma":[0.00067206536,0.000036774607,0.0050996845,0.00020853663,0.00013592439,0.000007699328,0.05412651,0.026328476,0.0003993683,0.009094216,0.90285695,0.0010338133],"about_ca_topic_score_codex":0.00024374697,"about_ca_topic_score_gemma":0.00004487346,"teacher_disagreement_score":0.8207025,"about_ca_system_score_codex":0.000013776541,"about_ca_system_score_gemma":0.000020101485,"threshold_uncertainty_score":0.34591806},"labels":[],"label_agreement":null},{"id":"W4389663047","doi":"10.1016/j.trpro.2023.11.344","title":"A novel systematic analysis of the network of H2020 project participants in Road Transport research topics","year":2023,"lang":"en","type":"article","venue":"Transportation research procedia","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovatia (Canada)","funders":"Horizon 2020; HORIZON EUROPE Framework Programme; Horizon 2020 Framework Programme","keywords":"Automotive industry; Centrality; Social network analysis; Key (lock); Network analysis; Core (optical fiber); Transport engineering; Engineering; Business; Telecommunications; Computer science; Computer security; Social media","score_opus":0.2056962445865576,"score_gpt":0.45540820643014,"score_spread":0.2497119618435824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389663047","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99646187,0.000046886937,0.00092594064,0.00018602626,0.000022491357,0.0017816492,0.0000782455,0.00005250778,0.000444413],"genre_scores_gemma":[0.9986031,0.000015203146,0.00022220526,0.0000026380303,0.000065986795,0.00064027996,0.00011786614,0.000021176982,0.00031151526],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9962435,0.00035568228,0.0009859091,0.00033513678,0.0013918515,0.0006879681],"domain_scores_gemma":[0.9980787,0.00035820057,0.00019696729,0.00050436874,0.00079762697,0.00006414239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004690866,0.00012896108,0.0006402369,0.0007059307,0.00012566587,0.00001411354,0.00054775033,0.000061829574,0.00006166922],"category_scores_gemma":[0.000082647566,0.00009874036,0.00030312734,0.016991837,0.00021920612,0.00008730021,0.000022514076,0.00048228662,0.0000040760715],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054246982,0.0003115879,0.95472795,0.0031707163,0.0009620151,0.000002986711,0.006136483,0.013579731,0.0009948338,0.018889925,0.00071547006,0.00045406775],"study_design_scores_gemma":[0.0002870799,0.000053131986,0.9669714,0.0011252192,0.0003984599,1.249191e-8,0.0021799447,0.026012307,0.00084373826,0.00196611,0.000047919442,0.00011468248],"about_ca_topic_score_codex":0.00393562,"about_ca_topic_score_gemma":0.00719309,"teacher_disagreement_score":0.016923815,"about_ca_system_score_codex":0.000041039337,"about_ca_system_score_gemma":0.00035608394,"threshold_uncertainty_score":0.8164014},"labels":[],"label_agreement":null},{"id":"W4389831635","doi":"10.1007/s13278-023-01172-y","title":"Community detection in social networks by spectral embedding of typed graphs","year":2023,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Similarity (geometry); Embedding; Merge (version control); Data mining; Set (abstract data type); Cluster analysis; Graph; Community structure; Artificial intelligence; Theoretical computer science; Information retrieval; Machine learning; Mathematics; Image (mathematics)","score_opus":0.014929895361190904,"score_gpt":0.2907132545255954,"score_spread":0.2757833591644045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389831635","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.978014,0.0000783001,0.020404655,0.000035966015,0.00003807718,0.00008082435,0.000008476784,0.00008058394,0.0012591202],"genre_scores_gemma":[0.9989403,0.000019636836,0.00021711024,0.000013246781,0.00053200783,0.00001593667,0.00017351862,0.000017905244,0.00007033471],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984472,0.00034560126,0.00042922405,0.0002131141,0.00014960974,0.0004152874],"domain_scores_gemma":[0.9993867,0.0001407,0.00026058816,0.00012498545,0.000045476485,0.00004154774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008977238,0.00017432845,0.00060047256,0.00032440544,0.0007720261,0.00004736329,0.00014735552,0.00009141282,0.00005879692],"category_scores_gemma":[0.0000042974084,0.00019460473,0.00038057662,0.0045655537,0.000104585575,0.00006907581,0.00012442924,0.00036569062,7.1016575e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007338316,0.00017457595,0.8023324,0.000019260286,0.0037262521,0.00000219027,0.0061100167,0.027803268,0.0006499594,0.006408708,0.010987083,0.14171292],"study_design_scores_gemma":[0.0010490643,0.00011049586,0.34858873,0.0000580481,0.0032323303,2.3553328e-7,0.013016189,0.5980772,0.00026861703,0.033804014,0.0007762818,0.0010188103],"about_ca_topic_score_codex":0.0011748057,"about_ca_topic_score_gemma":0.0010927434,"teacher_disagreement_score":0.5702739,"about_ca_system_score_codex":0.000025540861,"about_ca_system_score_gemma":0.000010322638,"threshold_uncertainty_score":0.79357505},"labels":[],"label_agreement":null},{"id":"W4389914549","doi":"10.32920/24625164.v1","title":"Community Analysis of Networks of Twitter Keywords","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Social media; Computer science; Parsing; World Wide Web; Internet privacy; Social network analysis; Social network (sociolinguistics); Artificial intelligence","score_opus":0.06624995312519918,"score_gpt":0.3349114581515234,"score_spread":0.26866150502632424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389914549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3979259,0.00004704978,0.5806937,0.00007658145,0.00011611278,0.0002835939,0.00012366526,0.0001925754,0.020540828],"genre_scores_gemma":[0.99528176,0.000010587602,0.0022928114,0.000015726919,0.00012236545,0.000034612993,0.0010033846,0.000029346711,0.0012094065],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981512,0.0003224658,0.0008170472,0.00026203349,0.00023386595,0.00021337635],"domain_scores_gemma":[0.99706334,0.00026159076,0.0007011175,0.0016909542,0.00023365319,0.000049369282],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006991414,0.00026855417,0.0013102518,0.00065219885,0.0000562332,0.000022752227,0.000823307,0.00013658394,0.0014630427],"category_scores_gemma":[0.0000045875245,0.00025346378,0.0012863176,0.0015536131,0.00011232758,0.000020086305,0.001916159,0.0009229228,0.0000030059787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018462724,0.00048726037,0.5949414,0.0000979907,0.026764162,4.4539752e-7,0.00059772044,0.345931,0.000060935334,0.008148241,0.016798984,0.006153415],"study_design_scores_gemma":[0.00021993103,0.000059356546,0.22039941,0.0002519935,0.015304061,2.96492e-8,0.00079794694,0.7035558,0.0010061847,0.057013668,0.0005621453,0.00082943233],"about_ca_topic_score_codex":0.01711943,"about_ca_topic_score_gemma":0.00054998446,"teacher_disagreement_score":0.59735584,"about_ca_system_score_codex":0.000020359701,"about_ca_system_score_gemma":0.000038464943,"threshold_uncertainty_score":0.9999918},"labels":[],"label_agreement":null},{"id":"W4390451063","doi":"10.1007/978-3-031-50959-9_17","title":"Three-Way Social Network Analysis: Triadic Measures at Three Levels","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Set (abstract data type); Social network analysis; Value (mathematics); Node (physics); Social network (sociolinguistics); Artificial intelligence; Data science; Cognitive psychology; Machine learning; Psychology; World Wide Web","score_opus":0.043719339478051684,"score_gpt":0.27896878094413546,"score_spread":0.2352494414660838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390451063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030816105,0.00024360717,0.99403006,0.00022977896,0.0005267132,0.00040134077,0.000036899964,0.0002695736,0.003953896],"genre_scores_gemma":[0.94932157,0.000009553024,0.040805377,0.000326874,0.008005946,0.00005566516,0.00013047075,0.00014795223,0.0011966048],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551475,0.000045747216,0.0007684298,0.0015168969,0.0011941282,0.0009600252],"domain_scores_gemma":[0.997529,0.0004889705,0.0005263641,0.0010630818,0.0002417155,0.00015090265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001363312,0.00070713245,0.0012985236,0.0010023863,0.00075509807,0.00033693053,0.0017968765,0.0002808316,0.0004167786],"category_scores_gemma":[0.0000130559965,0.0006560904,0.00090355467,0.0024897167,0.0006803689,0.00013968446,0.0012777194,0.00089667604,0.000085753534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026264936,0.00003652123,0.013168241,0.00001398869,0.0015340073,0.000025278316,0.0002887427,0.17061569,0.000031498617,0.035632204,0.0012846062,0.777343],"study_design_scores_gemma":[0.00027560367,0.000058316607,0.008534486,0.0001428209,0.000787652,0.00000122869,2.028446e-7,0.19801715,0.000075948614,0.78939635,0.0016743786,0.0010358552],"about_ca_topic_score_codex":0.00022445427,"about_ca_topic_score_gemma":0.0066835308,"teacher_disagreement_score":0.95322466,"about_ca_system_score_codex":0.00030805613,"about_ca_system_score_gemma":0.00023454531,"threshold_uncertainty_score":0.999589},"labels":[],"label_agreement":null},{"id":"W4390597156","doi":"10.5383/juspn.17.02.006","title":"Some Results on Colored Network Contraction","year":2022,"lang":"en","type":"article","venue":"Journal of Ubiquitous Systems and Pervasive Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Scalability; Leverage (statistics); Node (physics); Distributed computing; Graph; Theoretical computer science; Colored; Property (philosophy); Artificial intelligence; Engineering; Database","score_opus":0.012612228035950907,"score_gpt":0.24706371041568484,"score_spread":0.23445148237973393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390597156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90048313,0.028472532,0.04020596,0.0021036048,0.014627575,0.0024183264,0.00022534617,0.00021344358,0.011250089],"genre_scores_gemma":[0.9887117,0.00017161712,0.00007562573,0.00015594457,0.010455476,0.000036456953,0.00002506147,0.000027332017,0.00034075705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976167,0.0004228767,0.0009212532,0.0002370933,0.00043086073,0.0003711888],"domain_scores_gemma":[0.99766845,0.00041623687,0.0013071039,0.00023916436,0.00021955752,0.0001494749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012981308,0.00022219833,0.00061772874,0.00012863938,0.0005875489,0.0001290523,0.0002471092,0.000057050194,0.00006515697],"category_scores_gemma":[0.000010014511,0.00019572272,0.0002666998,0.0002730495,0.000040340667,0.00016449418,0.000113957205,0.0007832384,0.0000012630773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008397552,0.00017267685,0.004704455,0.000009127727,0.00048023078,0.00005074428,0.0002066453,0.83189493,0.00005407884,0.01343911,0.14278728,0.005360982],"study_design_scores_gemma":[0.0077626375,0.0075730653,0.010807218,0.0007703142,0.000980425,0.0007072656,0.0057192016,0.3261796,0.00007100212,0.0129978545,0.6248408,0.0015906442],"about_ca_topic_score_codex":0.00021802171,"about_ca_topic_score_gemma":0.000008046655,"teacher_disagreement_score":0.5057153,"about_ca_system_score_codex":0.00011818135,"about_ca_system_score_gemma":0.00007026236,"threshold_uncertainty_score":0.7981341},"labels":[],"label_agreement":null},{"id":"W4390723483","doi":"10.48550/arxiv.2401.03536","title":"Clique counts for network similarity","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clique; Similarity (geometry); Cluster analysis; Graph; Mathematics; Computer science; Similarity measure; Data mining; Combinatorics; Artificial intelligence","score_opus":0.0662492768312642,"score_gpt":0.21699817950392386,"score_spread":0.15074890267265967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390723483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04018925,0.00027055416,0.8024765,0.00013847782,0.0012021315,0.0010348425,0.00036428162,0.00066114997,0.15366276],"genre_scores_gemma":[0.99261874,0.000018371502,0.0006977249,0.000036672118,0.00091144984,0.000004222076,0.00018544972,0.00002907109,0.0054982835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903595,0.00003659618,0.00013116568,0.0005247328,0.000033619996,0.0002379246],"domain_scores_gemma":[0.9992379,0.00006918685,0.000101555284,0.00046788898,0.00006104103,0.00006240952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015324668,0.00020536952,0.00027061117,0.00007010338,0.00008118994,0.000054861306,0.00035067997,0.00013156817,0.0003872491],"category_scores_gemma":[0.0000019350452,0.00024049639,0.0003789775,0.00022281935,0.000043059652,0.00002468279,0.0006670862,0.00046515107,0.00011318962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001865874,0.00004641432,0.004363002,0.0000631125,0.00043391413,0.000011837736,0.00001583161,0.04824799,0.0000011593016,0.82975835,0.11566305,0.0013766573],"study_design_scores_gemma":[0.00007755502,0.000010645459,0.00006155619,0.00007128739,0.00029057614,8.0324675e-8,0.00000932617,0.16908987,0.000012743759,0.7667963,0.06332365,0.00025644453],"about_ca_topic_score_codex":0.00007805115,"about_ca_topic_score_gemma":0.000018087205,"teacher_disagreement_score":0.95242953,"about_ca_system_score_codex":0.00007139628,"about_ca_system_score_gemma":0.000099509205,"threshold_uncertainty_score":0.9807158},"labels":[],"label_agreement":null},{"id":"W4390895158","doi":"10.7202/1110062ar","title":"La recherche de positions équivalentes dans un réseau : définitions, essais et limites","year":2023,"lang":"fr","type":"article","venue":"Nouvelles perspectives en sciences sociales","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Psychology; Epistemology; Philosophy","score_opus":0.22122463203959503,"score_gpt":0.4413842412160257,"score_spread":0.22015960917643068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390895158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6922123,0.015317034,0.0638169,0.07633791,0.0004770069,0.0009226311,0.0010979513,0.0013714874,0.14844678],"genre_scores_gemma":[0.95542604,0.0050170966,0.035086803,0.000111332294,0.0007795518,0.00010974647,0.00008309467,0.00004436455,0.0033419912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9926744,0.0048082327,0.00042172527,0.00078444317,0.00048408765,0.0008271283],"domain_scores_gemma":[0.9906336,0.008431235,0.00023605264,0.00031651798,0.0002160173,0.00016657973],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.005315414,0.00039069646,0.0004414792,0.00037166578,0.0015314703,0.0004807071,0.0008121578,0.0003203181,0.0005462068],"category_scores_gemma":[0.00059692503,0.0004189165,0.00052611966,0.0030434018,0.003702266,0.00044847294,0.00036947904,0.00086858333,0.00021757283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006436972,0.0006087926,0.009613075,0.000023079388,0.00031360908,0.000010740254,0.17334925,0.0004217316,0.0026884452,0.79455274,0.009421103,0.008991014],"study_design_scores_gemma":[0.00023264253,0.00015287111,0.013572603,0.00024868103,0.00027671107,0.0000079902065,0.5465417,0.0029410147,0.0016644498,0.42494434,0.008786081,0.0006309025],"about_ca_topic_score_codex":0.0015396116,"about_ca_topic_score_gemma":0.00052348303,"teacher_disagreement_score":0.37319246,"about_ca_system_score_codex":0.0012349243,"about_ca_system_score_gemma":0.002358561,"threshold_uncertainty_score":0.99982625},"labels":[],"label_agreement":null},{"id":"W4390941196","doi":"10.1103/physrevresearch.6.013067","title":"Mastering percolation-like games with deep learning","year":2024,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); Computer science; Artificial intelligence; Reinforcement learning; Machine learning","score_opus":0.05244092152896761,"score_gpt":0.42860841949706385,"score_spread":0.37616749796809623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390941196","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32224387,0.21470842,0.12642418,0.0043774494,0.00017313295,0.004471045,0.000016841243,0.0017900178,0.32579505],"genre_scores_gemma":[0.9965515,0.0011223884,0.0004201334,0.000020428217,0.000518707,0.00019512426,0.00002397858,0.000031986237,0.0011157132],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983084,0.00024941744,0.00016312847,0.0003597092,0.00054684083,0.00037247018],"domain_scores_gemma":[0.99910045,0.00036436398,0.000022691669,0.00027180003,0.0001463087,0.0000944008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006213052,0.00013546826,0.000289658,0.00009750668,0.00016057858,0.00018762969,0.00021541357,0.000009505864,0.00076628744],"category_scores_gemma":[0.000015922213,0.00009837832,0.00015535149,0.0010042668,0.000079712605,0.00016428425,0.00016516878,0.0007014156,0.00032054825],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009746822,0.00013725118,0.005749852,0.0014783717,0.00023153223,0.000014205903,0.00033348548,0.00017710579,0.001084579,0.06178419,0.0036448499,0.92535484],"study_design_scores_gemma":[0.00012566504,0.00027405733,0.0014407629,0.008252388,0.00017716156,0.0000031383656,0.00017954968,0.18589531,0.00037293215,0.023848968,0.7789127,0.00051734474],"about_ca_topic_score_codex":0.00007186392,"about_ca_topic_score_gemma":0.0000048438387,"teacher_disagreement_score":0.92483747,"about_ca_system_score_codex":0.000044691267,"about_ca_system_score_gemma":0.000049532526,"threshold_uncertainty_score":0.839031},"labels":[],"label_agreement":null},{"id":"W4391054883","doi":"10.14778/3632093.3632118","title":"MOSER: Scalable Network Motif Discovery Using Serial Test","year":2023,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Motif (music); Computer science; Scalability; Graph; Theoretical computer science; Cluster analysis; Network motif; Data mining; Artificial intelligence; Complex network; Database","score_opus":0.015416777603827437,"score_gpt":0.24724935576746154,"score_spread":0.23183257816363412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391054883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9890305,0.00003203181,0.00047316513,0.00026641312,0.00026082937,0.0004947503,0.000023085488,0.00017146532,0.009247768],"genre_scores_gemma":[0.9964565,0.000007057895,0.0012896243,0.000022850485,0.0009109462,0.000043758228,0.000006224649,0.000027846467,0.0012351912],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99870455,0.000006370225,0.00032493327,0.0002652242,0.00029071345,0.00040818853],"domain_scores_gemma":[0.9993604,0.000055806733,0.0002631982,0.00017461162,0.00009801474,0.000047982136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003045972,0.00018224231,0.00027555157,0.000060214632,0.00021773513,0.00012511271,0.00046029486,0.00002869323,0.00007905178],"category_scores_gemma":[0.000014532356,0.00013648924,0.00022513051,0.00092640374,0.0000630686,0.00024617935,0.00056000316,0.0001297626,0.000011881866],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004471805,0.00028340225,0.76311165,0.00008436435,0.00040567768,4.34707e-7,0.00026890947,0.013670171,0.10594386,0.04980777,0.063122146,0.0032569],"study_design_scores_gemma":[0.0023582673,0.00030346462,0.041336637,0.0011747996,0.00106501,0.000005563926,0.0013209124,0.14300703,0.47372147,0.3150952,0.018900689,0.0017109514],"about_ca_topic_score_codex":0.00025472412,"about_ca_topic_score_gemma":0.0000024695878,"teacher_disagreement_score":0.721775,"about_ca_system_score_codex":0.000053113956,"about_ca_system_score_gemma":0.000026639716,"threshold_uncertainty_score":0.5565869},"labels":[],"label_agreement":null},{"id":"W4391127496","doi":"10.61091/ars157-05","title":"Tutte polynomial of self-similar network models with applications","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tutte polynomial; Polynomial; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.009928133510105717,"score_gpt":0.23704206009602746,"score_spread":0.22711392658592175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9116455,0.00013437672,0.026425086,0.00040694207,0.00036475732,0.0015095265,0.000049942588,0.0015433229,0.057920594],"genre_scores_gemma":[0.99638593,0.000005478434,0.003129488,0.00001581387,0.00007426289,0.00018351233,0.00005453042,0.000027581676,0.00012337227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990419,0.000035396148,0.00023473206,0.00023281491,0.00017291663,0.00028224965],"domain_scores_gemma":[0.99917835,0.00007169882,0.00013670562,0.00046140616,0.000088183646,0.00006367927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016027203,0.00014360575,0.0002604278,0.0000745713,0.00012443574,0.00002159843,0.00026583616,0.00003214539,0.000045426652],"category_scores_gemma":[4.908551e-7,0.0001364498,0.00010249,0.0009674291,0.000042467065,0.00009089499,0.00010885217,0.00011824852,0.000027208685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009136771,0.00009578574,0.0151728345,0.0000060130046,0.00018306996,5.7319784e-7,0.000074641815,0.0067195436,0.000037580154,0.95229006,0.024451036,0.0009597123],"study_design_scores_gemma":[0.00047057637,0.000060498063,0.0013296047,0.000021708689,0.000118648575,2.600191e-7,0.000046692363,0.026136307,0.0004390922,0.96260375,0.0085375225,0.00023532732],"about_ca_topic_score_codex":0.000072499875,"about_ca_topic_score_gemma":0.0000032639387,"teacher_disagreement_score":0.084740505,"about_ca_system_score_codex":0.000018837463,"about_ca_system_score_gemma":0.000050784554,"threshold_uncertainty_score":0.5564261},"labels":[],"label_agreement":null},{"id":"W4391319804","doi":"10.52783/jes.694","title":"A Network-Centred Optimization Technique for Operative Target Selection","year":2024,"lang":"en","type":"article","venue":"Journal of Electrical Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Selection (genetic algorithm); Computer science; Artificial intelligence","score_opus":0.013142849175115143,"score_gpt":0.27690572476103337,"score_spread":0.2637628755859182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391319804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020922573,0.0015799172,0.9964726,0.00008879062,0.00022601587,0.00053597154,0.000003681312,0.00004981215,0.00083398813],"genre_scores_gemma":[0.9618932,0.000009077226,0.034861136,0.000011502168,0.0028012334,0.00010440223,0.000013233429,0.000025677802,0.00028054274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987362,0.00011563032,0.0005628323,0.00014966572,0.00018596563,0.00024970504],"domain_scores_gemma":[0.9991346,0.00014836756,0.00023904436,0.00006646259,0.0003385734,0.00007297694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041811672,0.00013402538,0.00034589876,0.0001735894,0.00009561349,0.00019590893,0.0001287606,0.00005839704,0.00007451337],"category_scores_gemma":[0.000013575508,0.00010534993,0.00023997063,0.0008261065,0.000008905543,0.00017844416,0.000012104551,0.00025979066,0.000001570372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001380358,0.00020528497,0.0015780159,0.000052575004,0.0007686067,0.0000067524807,0.000114538605,0.8153395,0.005439147,0.07417551,0.095823154,0.0063588787],"study_design_scores_gemma":[0.00022245284,0.0004569351,0.000013872108,0.00018984695,0.00014856462,0.000036782847,0.00001833224,0.96629924,0.0019499122,0.0060375864,0.024451025,0.00017547296],"about_ca_topic_score_codex":0.000030838542,"about_ca_topic_score_gemma":3.7765378e-7,"teacher_disagreement_score":0.961684,"about_ca_system_score_codex":0.00017279244,"about_ca_system_score_gemma":0.000114862065,"threshold_uncertainty_score":0.42960453},"labels":[],"label_agreement":null},{"id":"W4391667800","doi":"10.12893/gjcpi.2016.3.3","title":"Mapping the Networks in Hyperlink Movies Rethinking the Concept of Cartography through Network Narratives","year":2016,"lang":"en","type":"article","venue":"Glocalism Journal of Culture Politics and Innovation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Hyperlink; Narrative; Phenomenon; Context (archaeology); Kinship; Social network (sociolinguistics); Sociology; Computer science; World Wide Web; Geography; Epistemology; Art; Social media; Literature; Web page; Anthropology","score_opus":0.021853477324364205,"score_gpt":0.2658016869973273,"score_spread":0.2439482096729631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391667800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37692255,0.0033127023,0.61106837,0.0064181895,0.00023339063,0.0002244083,0.000008392389,0.0000111449945,0.0018008457],"genre_scores_gemma":[0.99714524,0.000073813004,0.001496646,0.00036325565,0.0008848087,0.0000029262055,0.000004123926,0.0000065983863,0.000022592098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987651,0.00013781944,0.0006470902,0.000084908985,0.00017565304,0.00018939596],"domain_scores_gemma":[0.99860257,0.00012360358,0.000645618,0.00013746411,0.00047519637,0.000015559803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005962768,0.000118507036,0.00025175963,0.000085885855,0.00020358157,0.00005118916,0.00018438403,0.00005083132,0.000008398547],"category_scores_gemma":[0.000015829746,0.000052005722,0.00009371606,0.0010299961,0.00032722086,0.00017531196,0.000044960918,0.00027351602,4.6363308e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006101446,0.000014914919,0.010411224,0.0000030861308,0.00011509358,4.3161324e-7,0.010515043,0.0009387788,0.0003517043,0.9689232,0.0022135202,0.00650692],"study_design_scores_gemma":[0.0005326147,0.000098033306,0.0041146465,0.00052375393,0.000050973587,0.0000097998445,0.007405724,0.0015140646,0.0008785717,0.93198514,0.052701637,0.00018506516],"about_ca_topic_score_codex":0.00005997591,"about_ca_topic_score_gemma":0.0000064219844,"teacher_disagreement_score":0.6202227,"about_ca_system_score_codex":0.000013974275,"about_ca_system_score_gemma":0.000032557367,"threshold_uncertainty_score":0.21207318},"labels":[],"label_agreement":null},{"id":"W4391720860","doi":"10.1007/978-3-031-17299-1_3672","title":"Heterogeneous Socializing Network Index","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Northern British Columbia","funders":"","keywords":"Index (typography); Psychology; Computer science; World Wide Web","score_opus":0.02652656486982845,"score_gpt":0.26171287625087103,"score_spread":0.23518631138104257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391720860","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000066766365,0.00008699772,0.015206742,0.000043122385,0.0001874325,0.00019572572,0.000017844033,0.00059284334,0.9836626],"genre_scores_gemma":[0.03463038,0.000026222902,0.00050206913,0.00010638957,0.0044919946,0.000025948037,0.00023606773,0.00018331344,0.9597976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854183,0.000013892835,0.00038684875,0.0004277495,0.00024836068,0.00038130255],"domain_scores_gemma":[0.99908817,0.00007404657,0.00023577847,0.00045713378,0.00006365515,0.00008123806],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012937906,0.00038484443,0.00055112876,0.000100250814,0.00016861907,0.00008160061,0.00030025642,0.00017554345,0.006864021],"category_scores_gemma":[5.8863264e-7,0.0003959613,0.00057283556,0.00006648893,0.000051435505,0.000027332768,0.00029512285,0.00037671113,0.0006932977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002639198,0.000005777412,0.0004855523,0.0000048588286,0.000614177,0.000008136455,0.000011387757,0.0006537873,6.298033e-7,0.8654212,0.10300495,0.02978691],"study_design_scores_gemma":[0.000054307548,0.000011383897,0.000011341516,0.00006984625,0.00012540558,4.1192322e-7,0.0000032449414,0.00092028495,0.0000057408665,0.64013517,0.35822892,0.00043395878],"about_ca_topic_score_codex":0.00014069722,"about_ca_topic_score_gemma":0.00009089394,"teacher_disagreement_score":0.25522396,"about_ca_system_score_codex":0.000042253985,"about_ca_system_score_gemma":0.00004686538,"threshold_uncertainty_score":0.9998492},"labels":[],"label_agreement":null},{"id":"W4391775153","doi":"10.1016/j.physa.2024.129576","title":"Exploring cascading failure processes of interdependent multi-modal public transit networks","year":2024,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Interdependence; Modal; Cascading failure; Public transport; Computer science; Engineering; Transport engineering; Political science; Physics; Materials science","score_opus":0.06476848572592944,"score_gpt":0.29834778836684656,"score_spread":0.2335793026409171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391775153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016962064,0.00024689047,0.9969583,0.00022144178,0.000020929263,0.00034210354,0.00019860362,0.00011035286,0.0002051816],"genre_scores_gemma":[0.9901895,0.00007243713,0.008737999,0.000007884954,0.00021244216,0.00063644047,0.00010179811,0.000030528732,0.00001098874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989172,0.000031836913,0.0003013762,0.00037348902,0.0001399104,0.0002361899],"domain_scores_gemma":[0.9992657,0.00024795503,0.00006242665,0.00017859803,0.00012769333,0.000117679374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011949524,0.0001715246,0.00024654044,0.000081321654,0.00013204794,0.00012792002,0.00016604316,0.000021113028,0.00007069621],"category_scores_gemma":[0.000008255636,0.00016145824,0.00007126092,0.00047773076,0.000021484238,0.00020959102,0.0000905575,0.000204258,0.0000077225195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017054693,0.00013129128,0.000008462946,0.00011229174,0.00011261143,5.6716493e-7,0.00019283615,0.000090464404,0.0011891684,0.9437905,0.000073126364,0.05429699],"study_design_scores_gemma":[0.00015976325,0.00005587989,0.000041513613,0.00014462332,0.00022659005,0.0000015746112,0.00043798095,0.9039773,0.0020290634,0.08626082,0.006323526,0.0003413991],"about_ca_topic_score_codex":0.000021097236,"about_ca_topic_score_gemma":0.000016766824,"teacher_disagreement_score":0.98849326,"about_ca_system_score_codex":0.000016944481,"about_ca_system_score_gemma":0.00003815429,"threshold_uncertainty_score":0.6584076},"labels":[],"label_agreement":null},{"id":"W4391880018","doi":"10.3389/fbloc.2024.1342956","title":"Data depth and core-based trend detection on blockchain transaction networks","year":2024,"lang":"en","type":"article","venue":"Frontiers in Blockchain","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Novo Nordisk Fonden; Novo Nordisk","keywords":"Blockchain; Core (optical fiber); Database transaction; Computer science; Database; Computer security; Telecommunications","score_opus":0.02181649601089358,"score_gpt":0.2691606885155901,"score_spread":0.24734419250469653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391880018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07831947,0.00089604454,0.9184772,0.00016388632,0.0006853958,0.00030469603,0.000089903275,0.00025128102,0.0008121679],"genre_scores_gemma":[0.995068,0.00001144455,0.0039848173,0.000048662267,0.00046883052,0.000050396335,0.00016244485,0.00004140355,0.00016400829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984109,0.00010112709,0.00031780414,0.0006565921,0.00017998798,0.00033359235],"domain_scores_gemma":[0.9991739,0.00009918084,0.000060754657,0.00057059433,0.000011788253,0.000083824765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047046406,0.00025697768,0.00030494458,0.00043259768,0.00011027104,0.000097076634,0.0002661943,0.000094255716,0.000051918076],"category_scores_gemma":[0.000003918393,0.0002588662,0.00009113786,0.00067739957,0.00007022588,0.00004299071,0.00004494144,0.0004296898,0.0000019041793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012476824,0.00015436858,0.017303428,0.000030304489,0.00021025339,0.00001617417,0.00013045564,0.062111367,0.00012776689,0.0007318434,0.01273812,0.90632117],"study_design_scores_gemma":[0.000338907,0.00007481978,0.00070926023,0.00011408689,0.00008967113,0.0000010179032,0.000117531235,0.98750985,0.00044058214,0.002580797,0.0077624884,0.00026101345],"about_ca_topic_score_codex":0.00022138956,"about_ca_topic_score_gemma":0.0006437769,"teacher_disagreement_score":0.92539847,"about_ca_system_score_codex":0.00008605854,"about_ca_system_score_gemma":0.000026642956,"threshold_uncertainty_score":0.99998635},"labels":[],"label_agreement":null},{"id":"W4391935648","doi":"10.1007/978-3-031-53468-3_25","title":"Empirical Study of Graph Spectra and Their Limitations","year":2024,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Memorial University of Newfoundland; University of Toronto","funders":"","keywords":"Graph; Computer science; Spectral line; Combinatorics; Mathematics; Theoretical computer science; Physics","score_opus":0.15667859471508397,"score_gpt":0.39316387073151676,"score_spread":0.2364852760164328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391935648","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01935073,0.026772238,0.20609455,0.00082171574,0.0009267847,0.0028891028,0.00030292437,0.00029933566,0.7425426],"genre_scores_gemma":[0.9921367,0.00024593997,0.0014157238,0.000014420297,0.00014945587,0.000037072423,0.000029220724,0.00002635135,0.0059451163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986706,0.000022437656,0.0005757804,0.00040510876,0.00019252046,0.00013357356],"domain_scores_gemma":[0.998365,0.0010553895,0.00016054073,0.00016871457,0.00022347196,0.000026890271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016524343,0.00027595082,0.0005149549,0.00033862249,0.00007380057,0.000021123069,0.00016440712,0.00003919703,0.00006361143],"category_scores_gemma":[0.000008615799,0.00023808083,0.00013418542,0.00016932139,0.0003013138,0.000032736254,0.00028837178,0.00032707,0.000010755735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000108489,0.00024561974,0.0027103086,0.0000624025,0.0018291237,0.000008607382,0.009266354,0.021600826,3.85308e-7,0.94584507,0.001222906,0.017197544],"study_design_scores_gemma":[0.00003544434,0.00014845292,0.00026622208,0.00021055073,0.000090641544,9.462191e-7,0.004730518,0.0032954002,0.0000057545412,0.99010205,0.0009143453,0.00019966705],"about_ca_topic_score_codex":0.000023497774,"about_ca_topic_score_gemma":0.000107519445,"teacher_disagreement_score":0.97278595,"about_ca_system_score_codex":0.000038406008,"about_ca_system_score_gemma":0.000032807962,"threshold_uncertainty_score":0.9708654},"labels":[],"label_agreement":null},{"id":"W4391989463","doi":"","title":"Community detection and analysis in social networks.","year":2012,"lang":"en","type":"article","venue":"INRIA a CCSD electronic archive server","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Social network analysis; Data science; World Wide Web; Social media","score_opus":0.010133012351807712,"score_gpt":0.25921908819474276,"score_spread":0.24908607584293505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391989463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90380555,0.00015128037,0.094367154,0.000034199,0.000016662654,0.0001315542,0.000005008366,0.000051078,0.0014375063],"genre_scores_gemma":[0.99931955,0.000009136817,0.00011248888,0.00003794625,0.00034305907,0.000040341984,0.0000875251,0.000016503525,0.00003345739],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983037,0.0005236747,0.00024532535,0.00016491984,0.000104004175,0.0006583522],"domain_scores_gemma":[0.99944156,0.00011664851,0.00010667235,0.00024499043,0.000019810383,0.0000703143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005980069,0.00017526717,0.00032493327,0.00025296005,0.00033523687,0.000031290892,0.00017265101,0.00004184388,0.00015011233],"category_scores_gemma":[0.0000033275785,0.00018158906,0.00019916926,0.0008872452,0.000065681015,0.00017687278,0.00017179476,0.00073314103,0.000004177772],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000796139,0.00039434762,0.87994874,0.000007051184,0.0016455292,2.9985603e-7,0.0020350278,0.00097313477,0.00047427468,0.078242876,0.00028746636,0.03591163],"study_design_scores_gemma":[0.0006066756,0.00008122865,0.8820048,0.000008432989,0.00079807197,9.89706e-7,0.00027408317,0.05491623,0.0002502384,0.056398775,0.0042034113,0.00045708794],"about_ca_topic_score_codex":0.0015964174,"about_ca_topic_score_gemma":0.008499185,"teacher_disagreement_score":0.095513985,"about_ca_system_score_codex":0.00008787601,"about_ca_system_score_gemma":0.000022010547,"threshold_uncertainty_score":0.7404987},"labels":[],"label_agreement":null},{"id":"W4392098640","doi":"10.1007/s40747-024-01352-z","title":"Bi-DNE: bilayer evolutionary pattern preserved embedding for dynamic networks","year":2024,"lang":"en","type":"article","venue":"Complex & Intelligent Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Sichuan Province Science and Technology Support Program; National Natural Science Foundation of China","keywords":"Embedding; Computer science; Network formation; Node (physics); Process (computing); Network topology; Dynamic network analysis; Topology (electrical circuits); Evolutionary algorithm; Range (aeronautics); Artificial intelligence; Theoretical computer science; Distributed computing; Mathematics; Engineering; Computer network","score_opus":0.03712383603290929,"score_gpt":0.32800025239265146,"score_spread":0.29087641635974215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392098640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006567745,0.0043223104,0.98421764,0.00011544314,0.0013229911,0.0012565271,0.00012617187,0.0005537065,0.0015174649],"genre_scores_gemma":[0.99369603,0.000022872355,0.00080901996,0.000026209627,0.0016177375,0.000650705,0.000696584,0.000093705006,0.0023871032],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748296,0.0001368466,0.00079858326,0.00069168216,0.00027767656,0.00061223767],"domain_scores_gemma":[0.9985045,0.00036835746,0.00015961037,0.00064967555,0.00017486165,0.00014299623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041071736,0.0003903426,0.0005278204,0.0002542988,0.00024688037,0.00039114367,0.0005502355,0.000086722976,0.0007941879],"category_scores_gemma":[0.000006252453,0.0003616364,0.00056059746,0.0004680103,0.00006137002,0.00016771231,0.00021472988,0.00026734686,0.0001190426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000860213,0.0005914141,0.035329726,0.0013003043,0.0039514657,0.000025569936,0.0006826778,0.27293992,0.0022592924,0.073533595,0.49811468,0.11118533],"study_design_scores_gemma":[0.00007731331,0.00004678145,0.00038798217,0.00035236691,0.0001061825,0.0000036245365,0.00016714493,0.87163544,0.000056864803,0.0024671932,0.12434869,0.00035042397],"about_ca_topic_score_codex":0.0004626386,"about_ca_topic_score_gemma":0.00003181333,"teacher_disagreement_score":0.9871283,"about_ca_system_score_codex":0.00019830391,"about_ca_system_score_gemma":0.00005312862,"threshold_uncertainty_score":0.99988353},"labels":[],"label_agreement":null},{"id":"W4392175469","doi":"10.1109/globecom54140.2023.10437007","title":"Modeling Viral Information Spreading via Directed Acyclic Graph Diffusion","year":2023,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Directed acyclic graph; Directed graph; Diffusion; Graph; Theoretical computer science; Algorithm; Physics","score_opus":0.01010143968478668,"score_gpt":0.24737972403950464,"score_spread":0.23727828435471796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392175469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54528654,0.0000019694376,0.4430898,0.000037229638,0.000034209268,0.00009362775,0.00000212959,0.00086570985,0.010588773],"genre_scores_gemma":[0.99790215,0.000003399281,0.0014723594,0.00002735975,0.0001060648,0.000024552919,0.00024993543,0.000009175685,0.00020499657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927706,0.000020354844,0.00024226547,0.00011312366,0.00013740303,0.00020978239],"domain_scores_gemma":[0.9996545,0.0000229912,0.000047763184,0.00018685924,0.00004384764,0.000044089407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108890315,0.000109209774,0.00013538235,0.0002423166,0.00014202167,0.000069791415,0.00011986024,0.000024070683,0.00026270418],"category_scores_gemma":[0.0000024824976,0.00009873408,0.00011527531,0.00062414317,0.000008737062,0.00041484687,0.000110944755,0.0000884409,0.00016603927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044351174,0.00018600804,0.07578331,0.00003423101,0.00040231517,0.0000016158696,0.0018402266,0.10027975,0.024991306,0.07035193,0.016984735,0.70910025],"study_design_scores_gemma":[0.00010413861,0.0000064984483,0.00078539306,0.00001068819,0.000017324217,7.994037e-8,0.00007759426,0.9755342,0.00079707947,0.022020914,0.00052019383,0.00012586736],"about_ca_topic_score_codex":0.0008120188,"about_ca_topic_score_gemma":0.000013090512,"teacher_disagreement_score":0.8752545,"about_ca_system_score_codex":0.000014154237,"about_ca_system_score_gemma":0.0000058834576,"threshold_uncertainty_score":0.4026259},"labels":[],"label_agreement":null},{"id":"W4392252314","doi":"10.1007/978-3-031-53499-7_32","title":"Linear Stochastic Processes on Networks and Low Rank Graph Limits","year":2024,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Limit (mathematics); Generalization; Rank (graph theory); Simple (philosophy); Computer science; Theoretical computer science; Graph theory; Graph; Linear system; Stochastic process; Function (biology); Mathematical optimization; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.054641999332855545,"score_gpt":0.3455517548119526,"score_spread":0.29090975547909703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392252314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001079003,0.024056416,0.885841,0.0002839846,0.00061544933,0.00082617963,0.00008719977,0.00021198677,0.08796985],"genre_scores_gemma":[0.9722017,0.0010739855,0.0017210314,0.00012533623,0.001201639,0.00010984276,0.0001569139,0.000091914306,0.023317631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983247,0.000014047924,0.00051667076,0.00060845696,0.00028789174,0.00024824936],"domain_scores_gemma":[0.99810064,0.0011697062,0.00017201573,0.00017058662,0.0003389422,0.00004812054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016380224,0.00042696876,0.0005491295,0.00030706413,0.00012868618,0.000048546302,0.00020829722,0.00008297324,0.00008009973],"category_scores_gemma":[0.000021970838,0.00039967077,0.00012793357,0.00021162332,0.00036607732,0.000044158547,0.00022311721,0.0005704568,0.00004802465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000150824435,0.000025598989,0.000021185007,0.00012696073,0.00043443756,0.000008532745,0.0001757993,0.5650922,2.7286987e-8,0.4224238,0.000826355,0.0108500235],"study_design_scores_gemma":[0.00003920516,0.00008076777,0.000005196019,0.0020065792,0.00010424543,0.0000017962567,0.00009507284,0.12506956,0.0000034547068,0.87150735,0.00070654444,0.00038023572],"about_ca_topic_score_codex":0.000008299622,"about_ca_topic_score_gemma":0.000022984694,"teacher_disagreement_score":0.9720938,"about_ca_system_score_codex":0.000055596298,"about_ca_system_score_gemma":0.000062650826,"threshold_uncertainty_score":0.9998455},"labels":[],"label_agreement":null},{"id":"W4392252421","doi":"10.1007/978-3-031-53499-7_11","title":"Classification Supported by Community-Aware Node Features","year":2024,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Node (physics); Computer science; Complex network; Community structure; Artificial intelligence; Theoretical computer science; Mathematics; Engineering; World Wide Web; Combinatorics","score_opus":0.09178226474314023,"score_gpt":0.38236629316990156,"score_spread":0.29058402842676134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392252421","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016561055,0.010614194,0.1714354,0.0012625766,0.00080539536,0.00091129186,0.00090717094,0.00043959057,0.81345874],"genre_scores_gemma":[0.8415872,0.00035722056,0.0018491923,0.00015880459,0.00037228045,0.00009944307,0.002776177,0.000086948785,0.15271275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998288,0.000059775375,0.0006379176,0.0004262884,0.00034829724,0.00023975807],"domain_scores_gemma":[0.9982169,0.00077091897,0.0002475567,0.00036634714,0.00035571313,0.000042513715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003186108,0.00040827415,0.0005232044,0.00025990797,0.00024793594,0.0000648984,0.000450185,0.00011082451,0.00041154123],"category_scores_gemma":[0.000009646832,0.0004126433,0.00021158425,0.00015794742,0.0003758395,0.000060822596,0.00040741827,0.0012222314,0.00016106977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008561649,0.000070145485,0.00024102893,0.00010110536,0.00084311195,0.000006102178,0.0008238309,0.006069811,0.0000032189062,0.8904298,0.08621462,0.015188689],"study_design_scores_gemma":[0.000031318545,0.000030328174,0.0000703595,0.00054751756,0.00011383124,0.0000018597793,0.0010818313,0.0093524745,0.000038057547,0.95991015,0.028396431,0.0004258152],"about_ca_topic_score_codex":0.00012675102,"about_ca_topic_score_gemma":0.000072189105,"teacher_disagreement_score":0.8414216,"about_ca_system_score_codex":0.00019178099,"about_ca_system_score_gemma":0.00006246959,"threshold_uncertainty_score":0.9998326},"labels":[],"label_agreement":null},{"id":"W4392384843","doi":"10.1145/3616855.3635694","title":"Temporal Graph Analysis with TGX","year":2024,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Samsung; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Python (programming language); Graph; Node (physics); Data mining; Theoretical computer science; Programming language","score_opus":0.006143539471746161,"score_gpt":0.250863628545124,"score_spread":0.24472008907337783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392384843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062102444,0.00011860022,0.801901,0.00020738301,0.00002076746,0.00008879315,0.000010438154,0.0005112812,0.13503931],"genre_scores_gemma":[0.99175674,7.7944117e-7,0.005011087,0.000020078069,0.00012002087,0.000016366213,0.00006913022,0.0000105603085,0.0029952344],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993957,0.000014630852,0.00011787478,0.00022168703,0.00011329228,0.00013677934],"domain_scores_gemma":[0.9996581,0.000023382028,0.000018082641,0.00023037495,0.000026656679,0.000043403485],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000073036405,0.00010215063,0.00017186913,0.00026771912,0.00004110967,0.00011957209,0.000098271805,0.000011176625,0.0035326704],"category_scores_gemma":[1.4850445e-7,0.00006909417,0.00020938455,0.0021057988,0.000026339714,0.00007782467,0.000027444154,0.00007947925,0.00003651793],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071555614,0.000073346346,0.63322943,0.000007493757,0.0065734936,0.000011018367,0.000076226104,0.00058487535,0.00004968451,0.30780518,0.026035821,0.025546247],"study_design_scores_gemma":[0.00066588353,0.00040365956,0.04574736,0.00015055606,0.01790755,0.0000035812043,0.00097425474,0.27992302,0.0055006915,0.23121817,0.41476622,0.0027390486],"about_ca_topic_score_codex":0.0008409978,"about_ca_topic_score_gemma":0.00016813516,"teacher_disagreement_score":0.9296543,"about_ca_system_score_codex":0.0000070281503,"about_ca_system_score_gemma":0.00002012827,"threshold_uncertainty_score":0.99737823},"labels":[],"label_agreement":null},{"id":"W4392576186","doi":"10.48550/arxiv.2403.03666","title":"Provable Filter for Real-world Graph Clustering","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Electronic Science and Technology of China; Institute for Catastrophic Loss Reduction","keywords":"Cluster analysis; Computer science; Graph; Filter (signal processing); Mathematics; Artificial intelligence; Theoretical computer science; Computer vision","score_opus":0.06739655861578381,"score_gpt":0.22295118226197705,"score_spread":0.15555462364619324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392576186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15770802,0.00007587742,0.7180334,0.00013288949,0.0007396364,0.0018103566,0.00030597954,0.00092686986,0.12026697],"genre_scores_gemma":[0.9744208,0.00001921953,0.001686104,0.000017288354,0.00046931548,0.000017569122,0.00018000696,0.000055952667,0.023133779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837416,0.000042335014,0.00023059864,0.00092486735,0.00005191713,0.00037610668],"domain_scores_gemma":[0.9987664,0.000074483294,0.00017597957,0.000778336,0.000107361084,0.000097410666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016689376,0.0003484884,0.00042972277,0.0004095356,0.00013083153,0.0001303628,0.0005593951,0.000099596786,0.0003388328],"category_scores_gemma":[0.0000015044858,0.00039916596,0.00063893397,0.00055228546,0.00005919797,0.00007234219,0.0015630325,0.0005200684,0.000044948996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013401499,0.00023740655,0.016240776,0.0007355387,0.002071398,0.000060929106,0.00019686011,0.20301993,0.0001177482,0.7322997,0.040540326,0.0043453556],"study_design_scores_gemma":[0.0002401473,0.00002844551,0.00014080675,0.00026449075,0.00062425586,1.6544597e-7,0.000059084457,0.34510162,0.00028446494,0.64375526,0.008909387,0.0005918604],"about_ca_topic_score_codex":0.0013291725,"about_ca_topic_score_gemma":0.000526005,"teacher_disagreement_score":0.81671274,"about_ca_system_score_codex":0.000121679775,"about_ca_system_score_gemma":0.00009184006,"threshold_uncertainty_score":0.99984604},"labels":[],"label_agreement":null},{"id":"W4392846003","doi":"10.1145/3625007.3627337","title":"USIWO: A Local Community Search Algorithm for Uncertain Graphs","year":2023,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Theoretical computer science; Probabilistic logic; Graph; Node (physics); Partition (number theory); Algorithm; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.052000272016950996,"score_gpt":0.3432341042255604,"score_spread":0.2912338322086094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392846003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03599803,0.000004845839,0.9556151,0.00014181109,0.000024174584,0.00027955647,0.00004353984,0.00035030005,0.0075426246],"genre_scores_gemma":[0.9773266,0.0000014753045,0.020022666,0.000056549048,0.000104844694,0.00012666588,0.00031363338,0.000019705843,0.002027887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991573,0.00011759806,0.00015509638,0.00013689918,0.00012655623,0.00030653956],"domain_scores_gemma":[0.9991915,0.00027631433,0.000024298432,0.00035686608,0.000086396925,0.00006460591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005354427,0.000109421264,0.00017525927,0.0001237134,0.0003140069,0.000040917068,0.00027185798,0.000024830098,0.00042593223],"category_scores_gemma":[0.0000017267259,0.00009912945,0.0001896851,0.0006826121,0.000072827694,0.000045669618,0.00017260152,0.00021268344,0.000055589408],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054283823,0.00013272354,0.0047286213,0.000008545969,0.000164625,6.971618e-7,0.00022379473,0.00040902296,0.00008263844,0.0653257,0.048263017,0.88065517],"study_design_scores_gemma":[0.0004199886,0.000105478655,0.0013965413,0.0000140895,0.000043096814,2.7267265e-7,0.002590127,0.7915183,0.0019430574,0.1868788,0.014803189,0.00028707422],"about_ca_topic_score_codex":0.0038264038,"about_ca_topic_score_gemma":0.00009384268,"teacher_disagreement_score":0.9413285,"about_ca_system_score_codex":0.000018568415,"about_ca_system_score_gemma":0.000028702647,"threshold_uncertainty_score":0.57844037},"labels":[],"label_agreement":null},{"id":"W4392846446","doi":"10.1145/3625007.3627595","title":"Understanding Characteristics of Catalyst Users in the WallStreetBets Community","year":2023,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Catalysis; Chemistry","score_opus":0.13149728380581086,"score_gpt":0.30533710090530686,"score_spread":0.173839817099496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392846446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9746083,0.0000010886309,0.0066972743,0.00017109627,0.00001485766,0.000096460026,0.000016570462,0.000054887085,0.018339451],"genre_scores_gemma":[0.9996773,0.0000015804751,0.000059102098,0.000020716214,0.000025829953,0.0000075197436,0.0001383656,0.000005688905,0.00006387552],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993892,0.0001324304,0.0001874291,0.000058991278,0.00010366639,0.00012832676],"domain_scores_gemma":[0.9993334,0.00024135015,0.000067148736,0.00032910236,0.000015231354,0.0000137584175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004861374,0.0000664168,0.0001425505,0.00009282919,0.00009567591,0.000020049747,0.00028997392,0.000013250978,0.000094738825],"category_scores_gemma":[0.0000044379008,0.00004860528,0.00006374977,0.000572719,0.00004263495,0.000037539245,0.00008947776,0.00017649597,0.000008163401],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006276807,0.00016492828,0.86421645,0.000017578046,0.00009637788,0.0000020122652,0.0033073714,0.00004650052,0.0003928653,0.1209093,0.0076180953,0.0032222744],"study_design_scores_gemma":[0.00054784474,0.000086269494,0.8088909,0.00012340782,0.0001252344,5.402143e-7,0.05499087,0.012306912,0.0017565811,0.11913913,0.0015420254,0.0004903005],"about_ca_topic_score_codex":0.001963496,"about_ca_topic_score_gemma":0.0004374103,"teacher_disagreement_score":0.055325527,"about_ca_system_score_codex":0.000024587585,"about_ca_system_score_gemma":0.000010537256,"threshold_uncertainty_score":0.29682317},"labels":[],"label_agreement":null},{"id":"W4392975259","doi":"10.2139/ssrn.4766923","title":"Mapping Technology Firm Networks: Leveraging Social Network Analysis for Strategic Insight","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Social network analysis; Business; Knowledge management; Process management; Computer science; Industrial organization; Data science; Social media; World Wide Web","score_opus":0.01966862818705841,"score_gpt":0.2752482714508808,"score_spread":0.25557964326382243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392975259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030499347,0.0140031,0.9511812,0.0010040991,0.00059137953,0.0005675181,0.000023194112,0.00037000174,0.0017601653],"genre_scores_gemma":[0.9873209,0.00057506876,0.0025315857,0.000032086165,0.008289955,0.00020523532,0.00027146592,0.00012332216,0.0006503536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99337566,0.00015922435,0.0010777039,0.00097159494,0.0003471525,0.004068673],"domain_scores_gemma":[0.998076,0.000103056176,0.00087822106,0.0005436653,0.00029496627,0.00010406604],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002127316,0.00074157695,0.0013885031,0.0014142459,0.0008388387,0.00057790783,0.0011229091,0.00048621796,0.00013065101],"category_scores_gemma":[0.0000039571464,0.0007452777,0.0020906387,0.0029138746,0.00008441805,0.000070605645,0.0010687417,0.009210615,0.000008459713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036126043,0.000080543636,0.00707329,0.000051974443,0.029305935,0.00000669432,0.00026378356,0.2131597,0.000014589778,0.7018721,0.0015962996,0.046538986],"study_design_scores_gemma":[0.00021402206,0.000052910713,0.00005816091,0.000111479785,0.002758898,0.000009708458,0.0011381606,0.11324756,0.0000037182133,0.87993205,0.0018451923,0.00062816613],"about_ca_topic_score_codex":0.0001324429,"about_ca_topic_score_gemma":0.00038691665,"teacher_disagreement_score":0.95682156,"about_ca_system_score_codex":0.0012662851,"about_ca_system_score_gemma":0.0023705412,"threshold_uncertainty_score":0.9994998},"labels":[],"label_agreement":null},{"id":"W4393554370","doi":"10.5281/zenodo.3249976","title":"Augmented dataset of rumours and non-rumours for rumour detection","year":2019,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Computer security; Data science","score_opus":0.026261459130591136,"score_gpt":0.2733914804583533,"score_spread":0.24713002132776218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393554370","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005064502,0.00003060002,0.01124513,0.000060780858,0.0000745249,0.0008729693,0.9864436,0.00010429725,0.0006616944],"genre_scores_gemma":[0.022866486,0.000041136187,0.00019721738,0.000023718912,0.00024411308,2.9572888e-7,0.9758662,0.00064233964,0.00011846913],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816316,0.00017438487,0.00043801992,0.0005581838,0.00030206257,0.0003641636],"domain_scores_gemma":[0.99816275,0.000047736878,0.00045426347,0.00082086807,0.0003877398,0.0001266247],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00059270544,0.00027386274,0.00041297256,0.00037921872,0.00082474266,0.00036791796,0.0009754411,0.000100133955,0.0046161814],"category_scores_gemma":[0.00006444189,0.00029594035,0.00012118788,0.00037740907,0.00012754224,0.00015796348,0.0012210404,0.00034604943,0.0006366195],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062196785,0.00011393882,0.0000032054093,0.00014119902,0.0001671541,6.2930224e-7,0.000025392428,0.000019594601,0.00060340785,0.00007252815,0.98100764,0.017783111],"study_design_scores_gemma":[0.0004943591,0.0002778942,0.00006214485,0.00007470953,0.00017494384,0.000005452618,0.00009413819,0.0005835085,0.00062710594,0.00016296179,0.9971745,0.00026829654],"about_ca_topic_score_codex":0.00015778022,"about_ca_topic_score_gemma":0.0000022093163,"teacher_disagreement_score":0.022360034,"about_ca_system_score_codex":0.00007127461,"about_ca_system_score_gemma":0.000006482262,"threshold_uncertainty_score":0.9999493},"labels":[],"label_agreement":null},{"id":"W4394043181","doi":"10.5281/zenodo.3269768","title":"Augmented dataset of rumours and non-rumours for rumour detection","year":2019,"lang":"en","type":"dataset","venue":"Figshare","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; History","score_opus":0.028276298004556485,"score_gpt":0.3018340423387899,"score_spread":0.2735577443342334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394043181","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019886025,0.00006238748,0.000095601936,0.000009476256,0.000049532067,0.0007553921,0.99896085,0.000018922383,0.000027943786],"genre_scores_gemma":[0.0022591494,0.0000032504718,0.000101489895,0.000024075087,0.0003463297,0.00037576724,0.9968087,0.00003218235,0.000049069167],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866104,0.00003115719,0.00038714032,0.00045147,0.00018284582,0.00028633684],"domain_scores_gemma":[0.9983487,0.00014585156,0.0005866318,0.00072388747,0.00011829833,0.00007661019],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007755046,0.00033377315,0.0005524014,0.00018785744,0.000082364444,0.000063029554,0.00042144075,0.00014607473,0.033140488],"category_scores_gemma":[0.00003518915,0.00033817123,0.00019921984,0.00016531524,0.000010678125,0.00009770231,0.00030340254,0.0002604803,0.00021409015],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016630678,0.000046185756,0.000017090246,0.00032106065,0.00014853316,4.2091952e-7,0.000002434385,0.000008883844,0.000024518766,8.023515e-7,0.9976754,0.0017380328],"study_design_scores_gemma":[0.00031035094,0.000098221564,0.00010635094,0.0009248902,0.00020672425,6.5365873e-7,0.00001681538,0.0005202682,0.0008763642,0.00006723862,0.996547,0.0003251624],"about_ca_topic_score_codex":0.0001768704,"about_ca_topic_score_gemma":0.00006667984,"teacher_disagreement_score":0.0329264,"about_ca_system_score_codex":0.000027237018,"about_ca_system_score_gemma":0.00005808724,"threshold_uncertainty_score":0.999907},"labels":[],"label_agreement":null},{"id":"W4394200641","doi":"10.6084/m9.figshare.19896211","title":"Popularity Adjusted Block Models are Generalized Random Dot Product Graphs","year":2022,"lang":"en","type":"dataset","venue":"Figshare","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Popularity; Dot product; Block (permutation group theory); Product (mathematics); Computer science; Combinatorics; Mathematics; Psychology; Geometry; Social psychology","score_opus":0.05175085411019605,"score_gpt":0.2773906454827552,"score_spread":0.22563979137255916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394200641","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018910307,0.00051848684,0.0000022770707,0.000039150415,0.0000927707,0.0010060092,0.99784034,0.00019919152,0.0002828721],"genre_scores_gemma":[0.0004532961,0.000013008137,0.00007199287,0.00009639548,0.0007072636,0.0021483009,0.99607104,0.00006604133,0.00037266136],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99688464,0.00033185064,0.0005995867,0.001002693,0.0005882441,0.000593005],"domain_scores_gemma":[0.9970423,0.00008157684,0.0007567183,0.0017476778,0.00020603983,0.00016569722],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014134635,0.000658243,0.0011001984,0.0002979235,0.00036800897,0.00015472998,0.0012481842,0.00014339066,0.83376235],"category_scores_gemma":[0.00005934522,0.0006717978,0.0007952185,0.00069812924,0.000010891594,0.00013412238,0.00096849835,0.0010823195,0.00026702584],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003550228,0.0001683799,0.000024108149,0.00013900011,0.0003625721,0.000016172733,0.0000046900323,0.00084595353,8.574134e-7,0.000016090464,0.99824506,0.00014163375],"study_design_scores_gemma":[0.00078067783,0.000018715853,0.00003019578,0.00040896074,0.0002933363,0.0000022686593,0.000008653055,0.00065948855,0.00002243039,0.0016301189,0.9954185,0.00072668074],"about_ca_topic_score_codex":0.0011281655,"about_ca_topic_score_gemma":0.00021265993,"teacher_disagreement_score":0.8334953,"about_ca_system_score_codex":0.000080717495,"about_ca_system_score_gemma":0.00013176407,"threshold_uncertainty_score":0.99957335},"labels":[],"label_agreement":null},{"id":"W4394433425","doi":"10.6084/m9.figshare.96161.v1","title":"Scaling and Citations","year":2012,"lang":"en","type":"dataset","venue":"Open MIND","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scaling; Information retrieval; Computer science; Mathematics; Geometry","score_opus":0.04670896529734481,"score_gpt":0.35518716047239657,"score_spread":0.30847819517505176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394433425","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035326864,0.00007642087,0.00027656925,0.000021762798,0.000034694556,0.00019738586,0.9941699,8.315219e-7,0.0048691775],"genre_scores_gemma":[0.001934261,0.0000060741286,0.005003454,0.000008107832,0.00036605407,0.00002642525,0.99222547,0.000007570203,0.00042258322],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993982,0.000029951207,0.00015754675,0.00019948205,0.00006952935,0.00014534287],"domain_scores_gemma":[0.99941635,0.00006322535,0.00011533398,0.0003182287,0.000023845983,0.00006299701],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015179753,0.00012955283,0.00021660882,0.00005840915,0.000099627236,0.00023310728,0.0003330764,0.000044179345,0.019178525],"category_scores_gemma":[0.0000028471113,0.00012607999,0.000046902052,0.00009385711,0.000028235105,0.00009703808,0.00038345857,0.00015482456,0.00044029014],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.922766e-7,0.00002779564,0.00012256212,0.000001568621,0.00005820698,2.2164092e-7,0.0000151253225,5.0551887e-7,0.0000013302872,0.000026892807,0.9261349,0.07360989],"study_design_scores_gemma":[0.00005101093,0.0000051509037,0.00003174696,0.000028862465,0.00016334241,2.6353516e-7,0.00003095663,0.000018231987,0.00001787798,0.00038221586,0.9991236,0.00014677139],"about_ca_topic_score_codex":0.00048262646,"about_ca_topic_score_gemma":0.000063335814,"teacher_disagreement_score":0.07346312,"about_ca_system_score_codex":0.000007594974,"about_ca_system_score_gemma":0.000026864684,"threshold_uncertainty_score":0.98171806},"labels":[],"label_agreement":null},{"id":"W4394566534","doi":"10.1016/j.jocs.2024.102283","title":"Analyzing modularity maximization in approximation, heuristic, and graph neural network algorithms for community detection","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; University of Toronto","funders":"","keywords":"Modularity (biology); Heuristic; Computer science; Maximization; Artificial neural network; Graph; Algorithm; Theoretical computer science; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.020075415100593307,"score_gpt":0.30094373188961965,"score_spread":0.28086831678902635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394566534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27361718,0.00009078937,0.72601026,0.00008330634,0.00008421587,0.000072323404,0.000002079576,0.000010148598,0.00002967313],"genre_scores_gemma":[0.9478218,0.000002404318,0.051951427,0.000010319162,0.00019744482,0.0000038880157,0.000006743028,0.000004192515,0.0000017996337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913967,0.00008473597,0.00034223447,0.00010508472,0.00019892832,0.0001293657],"domain_scores_gemma":[0.9991382,0.000273136,0.00016539119,0.000056778328,0.00031826456,0.00004827807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016326085,0.000070284674,0.0001362766,0.00029572748,0.00031048394,0.00020778547,0.00015144148,0.00001376098,0.00000462777],"category_scores_gemma":[0.000028753666,0.00006474096,0.00006566782,0.0010668944,0.000113810645,0.00047785,0.000041314182,0.00022059918,1.3419815e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010576112,0.0000428672,0.009503187,0.000014598688,0.000021908261,5.3107857e-7,0.00016506121,0.886949,0.00016961982,0.011271062,0.000050709146,0.09180089],"study_design_scores_gemma":[0.000082657556,0.000033306755,0.025871692,0.000029545005,0.000014651618,0.0000053994563,0.000027543643,0.6893895,0.00005675126,0.28442246,0.00002163302,0.000044873505],"about_ca_topic_score_codex":0.00004857325,"about_ca_topic_score_gemma":0.000010935343,"teacher_disagreement_score":0.6742046,"about_ca_system_score_codex":0.000052052812,"about_ca_system_score_gemma":0.00007629663,"threshold_uncertainty_score":0.26400596},"labels":[],"label_agreement":null},{"id":"W4394709401","doi":"10.48550/arxiv.2404.06175","title":"Fundamental interactions in self-organized critical dynamics on higher-order networks","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agencia Estatal de Investigación; Basque Center for Applied Mathematics; Javna Agencija za Raziskovalno Dejavnost RS; Ministerio de Ciencia, Innovación y Universidades","keywords":"Order (exchange); Dynamics (music); Statistical physics; Computer science; Physics; Economics","score_opus":0.03781810406005593,"score_gpt":0.23280123611421777,"score_spread":0.19498313205416185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394709401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6608148,0.000096254014,0.24897376,0.00092304,0.0027854485,0.00095001346,0.00022963545,0.0013516669,0.08387533],"genre_scores_gemma":[0.99669755,0.000014805589,0.00044968148,0.000047888672,0.00041266286,0.000004468493,0.00026631824,0.00005438809,0.0020522708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982441,0.00013253861,0.00027695368,0.0008976313,0.00006888033,0.00037990775],"domain_scores_gemma":[0.9988478,0.00021419881,0.00010344794,0.00061778515,0.00009497711,0.00012178388],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000111172885,0.00038636007,0.00043836416,0.00036580607,0.000106752406,0.00013925522,0.00045711076,0.00013766871,0.0013228531],"category_scores_gemma":[0.000004063429,0.00046371686,0.00031818417,0.0008481535,0.00009043423,0.0000825886,0.0012889706,0.001690816,0.00013682334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006029758,0.00070367707,0.01769707,0.00004577345,0.00054659613,0.00019926968,0.00007102688,0.16473542,0.000003568183,0.81293935,0.0024356134,0.0005623388],"study_design_scores_gemma":[0.00028339538,0.0000318231,0.0009158432,0.00022369066,0.00035897514,5.925178e-7,0.00015783748,0.8486199,0.00000738976,0.14796464,0.0009357161,0.0005002404],"about_ca_topic_score_codex":0.0005885492,"about_ca_topic_score_gemma":0.00033534356,"teacher_disagreement_score":0.68388444,"about_ca_system_score_codex":0.0006997388,"about_ca_system_score_gemma":0.000093552204,"threshold_uncertainty_score":0.9997814},"labels":[],"label_agreement":null},{"id":"W4395957779","doi":"10.1007/978-3-031-59205-8_12","title":"Clique Counts for Network Similarity","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Clique; Similarity (geometry); Computer science; Cluster analysis; Graph; Similarity measure; Theoretical computer science; Data mining; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.015670880399434445,"score_gpt":0.27634787012281387,"score_spread":0.26067698972337944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395957779","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000041680023,0.00025462452,0.95873755,0.00014611785,0.0006404366,0.00024487294,0.00002149811,0.00007700691,0.03987373],"genre_scores_gemma":[0.47948682,0.000037082213,0.4859733,0.0019884247,0.017980581,0.00010345629,0.00022485148,0.00020202351,0.014003473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987125,0.0000055955893,0.00021949137,0.0005542855,0.00020728422,0.00030088492],"domain_scores_gemma":[0.99919206,0.00019138677,0.00008367752,0.00039850074,0.00008682797,0.0000475663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033357463,0.00023135194,0.0002904117,0.0001386187,0.00009799887,0.00015354964,0.0005177406,0.000102287486,0.00020897236],"category_scores_gemma":[0.0000031584511,0.00021207913,0.0001664197,0.00019119072,0.00017938894,0.00004681047,0.0002629441,0.00040735624,0.000041632753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043002965,0.000014263834,0.00020720904,0.000034921286,0.00005659954,0.0000049638356,0.000050334256,0.0215317,0.0000036794609,0.47490305,0.0062111462,0.49697784],"study_design_scores_gemma":[0.0000287604,0.000021098973,0.0000057771713,0.00013841061,0.000021349902,5.74662e-7,1.6532763e-8,0.14663827,0.00003862618,0.75755125,0.095353626,0.00020225032],"about_ca_topic_score_codex":0.000009927889,"about_ca_topic_score_gemma":0.000019556624,"teacher_disagreement_score":0.49677557,"about_ca_system_score_codex":0.000070487324,"about_ca_system_score_gemma":0.00013452297,"threshold_uncertainty_score":0.8648336},"labels":[],"label_agreement":null},{"id":"W4395957784","doi":"10.1007/978-3-031-59205-8_6","title":"Efficient Computation of K-Edge Connected Components: An Empirical Analysis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computation; Enhanced Data Rates for GSM Evolution; Identification (biology); Key (lock); Theoretical computer science; Strengths and weaknesses; Algorithm; Artificial intelligence","score_opus":0.022347296513214317,"score_gpt":0.30400866079465416,"score_spread":0.28166136428143984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395957784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018554362,0.00014757398,0.9781971,0.0000782157,0.0002351014,0.00025431687,0.000032370695,0.00011445553,0.0023865323],"genre_scores_gemma":[0.9666308,9.968422e-7,0.032749433,0.0000632684,0.0003052048,0.000005294476,0.00015330946,0.000029698347,0.000061950785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971677,0.000045590794,0.00068845815,0.001068587,0.00067390664,0.0003557432],"domain_scores_gemma":[0.99828875,0.0002616358,0.0003340762,0.0006783722,0.00031173512,0.00012540119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047892006,0.00041956644,0.00086671195,0.0015878519,0.00011136189,0.00016473576,0.00078726857,0.000132244,0.00014176228],"category_scores_gemma":[0.0000058506484,0.00038404015,0.00040272847,0.0018023447,0.0005384967,0.000062181054,0.0004437386,0.0005321895,0.000015164174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010365514,0.00015019195,0.002625238,0.00003177968,0.00045914567,0.000009781962,0.000528645,0.8892091,0.00021283013,0.011113776,0.000018080163,0.095631085],"study_design_scores_gemma":[0.000099094636,0.00007845286,0.0008652369,0.00015874235,0.0003728957,0.0000010039388,5.3345735e-7,0.91525793,0.00028522348,0.08243522,0.000097177945,0.000348517],"about_ca_topic_score_codex":0.00012586942,"about_ca_topic_score_gemma":0.000058157064,"teacher_disagreement_score":0.9480765,"about_ca_system_score_codex":0.00014185291,"about_ca_system_score_gemma":0.00013744201,"threshold_uncertainty_score":0.9998612},"labels":[],"label_agreement":null},{"id":"W4395957817","doi":"10.1007/978-3-031-59205-8_8","title":"How to Cool a Graph","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Iterated function; Graph; Transitive relation; Cartesian coordinate system; Discrete mathematics; Theoretical computer science; Combinatorics; Mathematics; Geometry","score_opus":0.011798039455449862,"score_gpt":0.24820539178769419,"score_spread":0.23640735233224433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395957817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006769051,0.00018975417,0.98573416,0.0009427975,0.00043899514,0.00029746557,0.000013615857,0.00013202813,0.012183478],"genre_scores_gemma":[0.85441685,0.0000056045847,0.1339207,0.00080505357,0.002616879,0.000038043967,0.000023607849,0.00008394755,0.008089319],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978959,0.000008057323,0.00023579056,0.0009853301,0.00046008948,0.00041483415],"domain_scores_gemma":[0.99879855,0.00012044338,0.00008953357,0.00074141397,0.00011437435,0.00013570722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024426624,0.00038640955,0.00042231756,0.000764732,0.000106527834,0.0006531529,0.0010272225,0.00009075604,0.00011568849],"category_scores_gemma":[0.0000049673167,0.0003428984,0.00021904417,0.0006822989,0.00024844168,0.00010844474,0.0007207691,0.0005778992,0.00006412845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005083075,0.000020122137,0.0001465709,0.000022857676,0.00006785474,0.00002775444,0.00030538658,0.0071495012,0.00013720806,0.14109804,0.0009854813,0.8500341],"study_design_scores_gemma":[0.000058557514,0.00008426597,0.000021569036,0.00042212635,0.00004271874,0.0000033827407,2.8946783e-7,0.035260335,0.0009390064,0.92258286,0.039941877,0.00064302323],"about_ca_topic_score_codex":0.000042189033,"about_ca_topic_score_gemma":0.000059455684,"teacher_disagreement_score":0.85434914,"about_ca_system_score_codex":0.00009044706,"about_ca_system_score_gemma":0.00011677735,"threshold_uncertainty_score":0.9999023},"labels":[],"label_agreement":null},{"id":"W4395959011","doi":"10.1007/978-3-031-59205-8_4","title":"Impact of Market Design and Trading Network Structure on Market Efficiency","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Computer science; Industrial organization; Business","score_opus":0.01148023501637361,"score_gpt":0.2587345699247131,"score_spread":0.2472543349083395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395959011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012108682,0.00042335203,0.9828892,0.000026183892,0.00025974502,0.00037748856,0.000025682259,0.000055888308,0.014731604],"genre_scores_gemma":[0.9435734,0.0000101976175,0.055231895,0.0000345246,0.0007234487,0.0000035547773,0.0000061130922,0.00004126333,0.00037560464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997757,0.000044315646,0.00040376763,0.0008956021,0.00042995423,0.00046936798],"domain_scores_gemma":[0.99837357,0.00065052684,0.00022568877,0.00057648844,0.000071525894,0.000102176135],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063320005,0.00048970385,0.0006127799,0.00048123085,0.00012706038,0.0001955684,0.0006868749,0.00013975136,0.0007457115],"category_scores_gemma":[0.0000072942134,0.00038691275,0.0002442204,0.00054015114,0.00042585217,0.000083118866,0.00031965427,0.0006912264,0.0000013690868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009648696,0.000057612753,0.003100769,0.00009712588,0.00030086865,0.00002881388,0.00039019977,0.33102027,0.0001653312,0.02007567,0.0032059862,0.64146084],"study_design_scores_gemma":[0.000083856095,0.00023981235,0.0005854963,0.0006880766,0.00004769746,0.000005050913,8.315878e-8,0.62835884,0.00012286857,0.36938828,0.00012077381,0.00035917165],"about_ca_topic_score_codex":0.000028416813,"about_ca_topic_score_gemma":0.0000049194405,"teacher_disagreement_score":0.94236255,"about_ca_system_score_codex":0.00013187487,"about_ca_system_score_gemma":0.00018465934,"threshold_uncertainty_score":0.99985826},"labels":[],"label_agreement":null},{"id":"W4395961398","doi":"10.1007/978-3-031-59205-8_5","title":"Network Embedding Exploration Tool (NEExT)","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Embedding; Artificial intelligence","score_opus":0.019126833493558117,"score_gpt":0.27229839481899004,"score_spread":0.25317156132543195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395961398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052572217,0.0003204259,0.97916937,0.0001971596,0.0007592739,0.00025259645,0.0000045340507,0.00016918045,0.019074908],"genre_scores_gemma":[0.742449,0.000020191588,0.2425556,0.000564813,0.0099874055,0.000053180684,0.000088825465,0.00012674996,0.0041542584],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775594,0.000013684435,0.00041915377,0.0009014133,0.00045396612,0.0004558587],"domain_scores_gemma":[0.998854,0.00017900101,0.00016530829,0.00063705846,0.00010292876,0.0000617402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004547639,0.00039575482,0.00041932455,0.00035963612,0.00018597927,0.00047280735,0.0007171335,0.00011713587,0.000246458],"category_scores_gemma":[0.0000042654947,0.00037097972,0.00018145415,0.00051239476,0.00022091503,0.0002990959,0.00057378435,0.0006708384,0.00009068464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002959082,0.000010424064,0.00011316289,0.000015427118,0.000036043017,0.0000122693655,0.00020797567,0.2320286,0.000022633427,0.14306864,0.0006051848,0.6238767],"study_design_scores_gemma":[0.000031154614,0.000024708275,0.000003971064,0.00031346316,0.000024297955,0.0000011727789,1.4793937e-7,0.3606394,0.00009116454,0.63350606,0.0050622686,0.0003022393],"about_ca_topic_score_codex":0.000022082006,"about_ca_topic_score_gemma":0.000021950756,"teacher_disagreement_score":0.7423964,"about_ca_system_score_codex":0.00014384942,"about_ca_system_score_gemma":0.00014229462,"threshold_uncertainty_score":0.99987423},"labels":[],"label_agreement":null},{"id":"W4396234574","doi":"10.61091/jcmcc119-12","title":"Choosing Friends in Everyday Life by using Graph Theory","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Everyday life; Psychology; Sociology; Aesthetics; Epistemology; Art; Philosophy","score_opus":0.011118738226230844,"score_gpt":0.2696931677615046,"score_spread":0.25857442953527376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396234574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9174524,0.0020954285,0.07104755,0.000059720667,0.0073484625,0.00020775113,0.000004867282,0.000068596375,0.0017152472],"genre_scores_gemma":[0.99566716,0.0000154656,0.0024251316,0.000011679398,0.0018226432,0.0000014395164,0.0000024654905,0.000047907153,0.0000061371356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974382,0.00018994707,0.0012339955,0.00026134736,0.00049839326,0.0003781323],"domain_scores_gemma":[0.99801624,0.0008127624,0.00057381723,0.0002066657,0.00019915611,0.0001913717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022789396,0.00031893712,0.0008022206,0.0004257414,0.00018441076,0.0004468698,0.0003465393,0.00010362668,0.000041452353],"category_scores_gemma":[0.00007171438,0.0002911733,0.00029928004,0.0007458822,0.00008049804,0.00030999287,0.00019743163,0.00070524553,0.0000012485297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003688526,0.00037084077,0.0010071899,0.00010263783,0.00032587993,0.000017283726,0.00093837536,0.000119618395,0.0010192543,0.9910717,0.00059757225,0.0043927487],"study_design_scores_gemma":[0.0012558114,0.00015875796,0.000028001372,0.000850636,0.0002221241,0.000017699022,0.00046987235,0.037567686,0.00061194564,0.9577016,0.00077693857,0.0003389295],"about_ca_topic_score_codex":0.000037928436,"about_ca_topic_score_gemma":1.5724268e-7,"teacher_disagreement_score":0.07821476,"about_ca_system_score_codex":0.000094142924,"about_ca_system_score_gemma":0.00017918611,"threshold_uncertainty_score":0.99995404},"labels":[],"label_agreement":null},{"id":"W4396646263","doi":"10.1038/s41467-024-48068-9","title":"Symmetry breaking in optimal transport networks","year":2024,"lang":"en","type":"article","venue":"Nature Communications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Army Research Office; Air Force Office of Scientific Research; U.S. Department of Defense; National Science Foundation","keywords":"Computer science; Task (project management); Transport network; Atlanta; Topology (electrical circuits); Function (biology); Symmetry (geometry); Network topology; Mathematical optimization; Distributed computing; Computer network; Mathematics; Economics; Combinatorics; Geometry; Geography","score_opus":0.011688848583499691,"score_gpt":0.3101828622870159,"score_spread":0.29849401370351625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396646263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14543456,0.104543835,0.38755533,0.01132295,0.00088737253,0.001427481,0.00013506396,0.0022734152,0.34642],"genre_scores_gemma":[0.9907067,0.000094546376,0.008586355,0.00005194255,0.00015637394,0.000051007075,0.00022423935,0.000019628824,0.00010922225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992886,0.00005908609,0.0002197502,0.00017742674,0.000084652725,0.00017046982],"domain_scores_gemma":[0.9987072,0.0001887606,0.000030220046,0.0010077333,0.00003338369,0.000032707965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020968074,0.000110721354,0.00014588684,0.00016738496,0.000104877974,0.000053184373,0.000734033,0.00010620224,0.00011428533],"category_scores_gemma":[0.0000022155195,0.00011129832,0.0001324456,0.0008949225,0.000051126197,0.00011038706,0.00013601183,0.001320598,0.000008766588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036198112,0.00016306186,0.081365995,0.000008002237,0.00015716295,0.0000037587886,0.00023269973,0.0021718126,0.000048211947,0.833644,0.0061842226,0.07601751],"study_design_scores_gemma":[0.00022792278,0.000024732115,0.040647123,0.00039193276,0.0001977729,0.0000043047853,0.00024141534,0.5377305,0.00009742438,0.01183616,0.4079916,0.0006090983],"about_ca_topic_score_codex":0.00014179591,"about_ca_topic_score_gemma":0.00029449828,"teacher_disagreement_score":0.8452721,"about_ca_system_score_codex":0.00003674701,"about_ca_system_score_gemma":0.000033130735,"threshold_uncertainty_score":0.57374144},"labels":[],"label_agreement":null},{"id":"W4396674232","doi":"10.32920/25761552","title":"Adversarial Networks and Low-key Leaders","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Adversarial system; Key (lock); Dominance (genetics); PageRank; Vertex (graph theory); Computer science; Ranking (information retrieval); Political science; Theoretical computer science; Computer security; Artificial intelligence; Graph","score_opus":0.013623608700344837,"score_gpt":0.26849997726471597,"score_spread":0.2548763685643711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396674232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08006075,0.0030420502,0.5241181,0.0019561471,0.0029514434,0.0014896774,0.00008786421,0.0017892808,0.38450468],"genre_scores_gemma":[0.9933542,0.000024784506,0.0015371299,0.00006073911,0.0024443371,0.000050565963,0.00015447647,0.00004244675,0.0023313307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986843,0.000038859907,0.00028427303,0.00058407965,0.00013353695,0.00027493856],"domain_scores_gemma":[0.9992993,0.000049399885,0.00008283774,0.00044265314,0.000036486243,0.00008930837],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001403933,0.00031833866,0.00040663828,0.00010831914,0.00005628845,0.00020779966,0.00023439774,0.00015434975,0.001012016],"category_scores_gemma":[0.0000011556089,0.00029354554,0.0002844319,0.00012167423,0.00010508648,0.00002501521,0.0017030538,0.00093937473,0.00003804931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055155724,0.00021242467,0.010140017,0.00037016638,0.00390964,0.000021578126,0.0010174965,0.051056072,0.000050722694,0.39971146,0.3826967,0.15075856],"study_design_scores_gemma":[0.00034121686,0.000031608946,0.00025741837,0.0005017169,0.00089379086,8.8960803e-7,0.00048226,0.58628523,0.00014822971,0.39127296,0.01855427,0.0012304337],"about_ca_topic_score_codex":0.0007457516,"about_ca_topic_score_gemma":0.00003256688,"teacher_disagreement_score":0.9132934,"about_ca_system_score_codex":0.00002765553,"about_ca_system_score_gemma":0.00006105244,"threshold_uncertainty_score":0.99995166},"labels":[],"label_agreement":null},{"id":"W4396674307","doi":"10.32920/25761552.v1","title":"Adversarial Networks and Low-key Leaders","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Adversarial system; Key (lock); Dominance (genetics); PageRank; Vertex (graph theory); Computer science; Ranking (information retrieval); Political science; Theoretical computer science; Computer security; Artificial intelligence; Graph","score_opus":0.013623608700344837,"score_gpt":0.26849997726471597,"score_spread":0.2548763685643711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396674307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08006075,0.0030420502,0.5241181,0.0019561471,0.0029514434,0.0014896774,0.00008786421,0.0017892808,0.38450468],"genre_scores_gemma":[0.9933542,0.000024784506,0.0015371299,0.00006073911,0.0024443371,0.000050565963,0.00015447647,0.00004244675,0.0023313307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986843,0.000038859907,0.00028427303,0.00058407965,0.00013353695,0.00027493856],"domain_scores_gemma":[0.9992993,0.000049399885,0.00008283774,0.00044265314,0.000036486243,0.00008930837],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001403933,0.00031833866,0.00040663828,0.00010831914,0.00005628845,0.00020779966,0.00023439774,0.00015434975,0.001012016],"category_scores_gemma":[0.0000011556089,0.00029354554,0.0002844319,0.00012167423,0.00010508648,0.00002501521,0.0017030538,0.00093937473,0.00003804931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055155724,0.00021242467,0.010140017,0.00037016638,0.00390964,0.000021578126,0.0010174965,0.051056072,0.000050722694,0.39971146,0.3826967,0.15075856],"study_design_scores_gemma":[0.00034121686,0.000031608946,0.00025741837,0.0005017169,0.00089379086,8.8960803e-7,0.00048226,0.58628523,0.00014822971,0.39127296,0.01855427,0.0012304337],"about_ca_topic_score_codex":0.0007457516,"about_ca_topic_score_gemma":0.00003256688,"teacher_disagreement_score":0.9132934,"about_ca_system_score_codex":0.00002765553,"about_ca_system_score_gemma":0.00006105244,"threshold_uncertainty_score":0.99995166},"labels":[],"label_agreement":null},{"id":"W4396811638","doi":"10.1002/jgt.23106","title":"Sharp threshold for embedding balanced spanning trees in random geometric graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Spanning tree; Embedding; Random graph; Discrete mathematics; Graph; Computer science","score_opus":0.013372051844963158,"score_gpt":0.29692687222800784,"score_spread":0.2835548203830447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396811638","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5598809,0.007554951,0.4281752,0.00012253117,0.0004045163,0.00028534525,0.000015956095,0.0000646324,0.0034959784],"genre_scores_gemma":[0.9971885,0.000057074503,0.00221413,0.000022151433,0.00037886304,0.000016762246,0.0000047430126,0.000024966514,0.0000928249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987665,0.0000744582,0.00055534986,0.00016321588,0.00018644513,0.00025402312],"domain_scores_gemma":[0.99880224,0.00068475265,0.00022479024,0.00014268866,0.000083201114,0.0000623364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017901213,0.00015752288,0.0004432023,0.0016536391,0.000067731475,0.00012211034,0.00026856712,0.000035489036,0.00016839149],"category_scores_gemma":[0.000024773863,0.00012546116,0.00069722236,0.0014474767,0.000041667143,0.00023621188,0.000034149856,0.00032704262,0.0000013542232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010346931,0.0002716187,0.06584121,0.000079671954,0.0016713728,0.0000570176,0.00088185497,0.0074122753,0.00451968,0.7712541,0.008935052,0.13804142],"study_design_scores_gemma":[0.0015339861,0.0001286791,0.0024208785,0.0005154616,0.00021762724,0.000007880489,0.00038362533,0.008740707,0.0012210881,0.9826842,0.0019147389,0.00023114703],"about_ca_topic_score_codex":0.000006602384,"about_ca_topic_score_gemma":0.000002571323,"teacher_disagreement_score":0.4373076,"about_ca_system_score_codex":0.000029568735,"about_ca_system_score_gemma":0.000042221156,"threshold_uncertainty_score":0.51161575},"labels":[],"label_agreement":null},{"id":"W4396909838","doi":"10.1109/tnnls.2024.3398253","title":"Robust Temporal Link Prediction in Dynamic Complex Networks via Stable Gated Models With Reinforcement Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Computer science; Reinforcement learning; Artificial intelligence; Graph; Machine learning; Theoretical computer science","score_opus":0.018274546102358392,"score_gpt":0.22922697345984216,"score_spread":0.21095242735748376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396909838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019964907,0.00041160826,0.9777794,0.000050840135,0.0003220267,0.0005287499,0.0000036370238,0.0005109884,0.00042783347],"genre_scores_gemma":[0.99744457,0.000056172892,0.00018245353,0.000011643986,0.00030766547,0.00011923961,0.00014066041,0.00007680735,0.0016607721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976541,0.00036036578,0.00059229875,0.0005909853,0.00026037052,0.00054189586],"domain_scores_gemma":[0.9992677,0.00017135119,0.00015369772,0.00021403271,0.00006479923,0.00012843672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045171572,0.0003861472,0.00047347634,0.00028556128,0.0005315656,0.0003888201,0.00012166046,0.0001261408,0.00010377231],"category_scores_gemma":[4.2556857e-7,0.00034103982,0.0001344648,0.0006447325,0.000066228466,0.00036668024,0.000005304875,0.0018361027,0.000003072354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075518576,0.000032978565,0.0012507905,0.00003796193,0.00016463721,0.000009428259,0.00012067274,0.97841924,0.00002019321,0.00014300393,0.00006833759,0.019657252],"study_design_scores_gemma":[0.00038032685,0.00034778126,0.00013308658,0.00046193824,0.000104613595,0.000013439232,0.00022928731,0.997137,0.000002360608,0.00001886894,0.00084652845,0.0003247417],"about_ca_topic_score_codex":0.001593214,"about_ca_topic_score_gemma":0.0001279131,"teacher_disagreement_score":0.97759694,"about_ca_system_score_codex":0.00010979012,"about_ca_system_score_gemma":0.000022259017,"threshold_uncertainty_score":0.99990416},"labels":[],"label_agreement":null},{"id":"W4396915429","doi":"10.36939/ir.202405151657","title":"On Temporal Bipartite Graphs and Their Application in Disease Spread Prediction","year":2024,"lang":"en","type":"dissertation","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Bipartite graph; Reachability; Computer science; Theoretical computer science; Graph; Clique-width; Path (computing); Algorithm; Voltage graph; Combinatorics; Mathematics; Line graph","score_opus":0.005921447715033161,"score_gpt":0.25519009712456286,"score_spread":0.2492686494095297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396915429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9780655,0.00041617878,0.0026513536,0.000064524844,0.00012706147,0.0007229294,0.00012415358,0.00029543,0.017532863],"genre_scores_gemma":[0.9921312,0.000017625927,0.000040840834,0.000011343498,0.000094702664,0.0003514775,0.0053022234,0.000028199243,0.0020224145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912786,0.000022903025,0.00024254808,0.00039064893,0.00009494895,0.00012110302],"domain_scores_gemma":[0.9995573,0.000029036426,0.000082133054,0.00024161697,0.000025285803,0.00006460766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007820417,0.00021330944,0.00020031945,0.00027733453,0.000038611255,0.00006466253,0.000076947596,0.00005592358,0.000088215325],"category_scores_gemma":[0.0000011783934,0.00017491495,0.00011280962,0.0002910074,0.000013831398,0.000055254528,0.000016132937,0.00020918447,0.000018884397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031167327,0.00059205835,0.22878593,0.00033782906,0.00042044144,0.0000028244988,0.0014863441,0.00022177407,0.0005858752,0.5623302,0.015532443,0.18939263],"study_design_scores_gemma":[0.00022826545,0.00006544018,0.06303307,0.00051800744,0.00021291843,7.7218004e-8,0.0005723401,0.04559634,0.0005769415,0.8814497,0.007224387,0.0005225406],"about_ca_topic_score_codex":0.0005740015,"about_ca_topic_score_gemma":0.0005836578,"teacher_disagreement_score":0.31911948,"about_ca_system_score_codex":0.00002072294,"about_ca_system_score_gemma":0.000027122773,"threshold_uncertainty_score":0.71328247},"labels":[],"label_agreement":null},{"id":"W4397022511","doi":"10.1142/s0219525924500048","title":"IMine: A CUSTOMIZABLE FRAMEWORK FOR INFLUENCE MINING IN COMPLEX NETWORKS","year":2024,"lang":"en","type":"article","venue":"Advances in Complex Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Maximization; Personalization; Premise; Interface (matter); Distributed computing; Domain (mathematical analysis); Mathematical optimization; Mathematics","score_opus":0.022084211362429072,"score_gpt":0.3393724822723389,"score_spread":0.31728827090990985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4397022511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033009224,0.011937584,0.9466066,0.000102472855,0.0005506466,0.0014539792,0.000060580547,0.00034895018,0.005929965],"genre_scores_gemma":[0.9726762,0.00006730464,0.025414683,0.000046611716,0.0007571735,0.00072863774,0.00013766199,0.00005630839,0.00011541955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743307,0.00012720589,0.00088072434,0.0006622163,0.00021446876,0.00068230374],"domain_scores_gemma":[0.99810547,0.0010751723,0.00017773255,0.00048279934,0.00007805616,0.00008077259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054868124,0.00034370777,0.0007196035,0.0003342721,0.0001110858,0.0002482265,0.0004959989,0.00008959506,0.00013240604],"category_scores_gemma":[0.000025593454,0.00034610686,0.00017688246,0.0012234106,0.00009202592,0.00049557036,0.00013418632,0.00036421517,0.0000120154245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047042613,0.00010007639,0.06972283,0.0003108362,0.000081081664,0.000014405454,0.00036405138,0.59095174,0.00009554242,0.3119612,0.004160548,0.022190636],"study_design_scores_gemma":[0.00030739818,0.000044905817,0.0015038113,0.00093565474,0.000023586133,0.0000028528482,0.0004420461,0.8136043,0.000007720578,0.029763468,0.15295261,0.0004116769],"about_ca_topic_score_codex":0.00051976,"about_ca_topic_score_gemma":0.00019560667,"teacher_disagreement_score":0.939667,"about_ca_system_score_codex":0.00014521775,"about_ca_system_score_gemma":0.00004407217,"threshold_uncertainty_score":0.9998991},"labels":[],"label_agreement":null},{"id":"W4398171124","doi":"10.2139/ssrn.4836028","title":"Self-Similarity of Communities of the Abcd Model","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Similarity (geometry); Self-similarity; Geography; Computer science; Mathematics; Artificial intelligence; Geometry","score_opus":0.012762743706456728,"score_gpt":0.2636948349229433,"score_spread":0.2509320912164866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398171124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73652196,0.009767836,0.21906123,0.0009786015,0.0005402379,0.0008260121,0.00023237609,0.00018584791,0.03188588],"genre_scores_gemma":[0.99681145,0.0007532468,0.0017700715,0.0000076839315,0.00023233084,0.000011162551,0.00001267584,0.000033736167,0.00036765536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785185,0.00019433485,0.0005977575,0.00014746515,0.00033636406,0.00087224296],"domain_scores_gemma":[0.9983406,0.00005251898,0.00063004706,0.0007376503,0.00020836155,0.000030811025],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001287695,0.00025645902,0.00052741944,0.0001372163,0.00012851557,0.000046603294,0.0012188647,0.00010688604,0.000050086514],"category_scores_gemma":[0.0000019706313,0.00018948595,0.00081735157,0.00018306548,0.000089555775,0.000030649368,0.0015326426,0.0063607804,0.0000011058079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013759743,0.00017284622,0.0055898083,0.00014496903,0.0026357474,1.3606318e-7,0.00097666,0.011301301,0.00006791621,0.972577,0.0004888415,0.0060310233],"study_design_scores_gemma":[0.000082074475,0.000029017134,0.000046608744,0.00018865326,0.00048858573,0.0000040543364,0.0008336134,0.05865015,0.00044051657,0.9389587,0.00012823552,0.00014977454],"about_ca_topic_score_codex":0.0007194048,"about_ca_topic_score_gemma":0.00075491285,"teacher_disagreement_score":0.26028946,"about_ca_system_score_codex":0.00032301474,"about_ca_system_score_gemma":0.0031551956,"threshold_uncertainty_score":0.99593157},"labels":[],"label_agreement":null},{"id":"W4398222731","doi":"10.1038/s41598-024-62271-0","title":"Static graph approximations of dynamic contact networks for epidemic forecasting","year":2024,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Canadian Institute for International Peace and Security; Mila - Quebec Artificial Intelligence Institute","funders":"Fonds de recherche du Québec – Nature et technologies; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Graph; Network analysis; Node (physics); Theoretical computer science","score_opus":0.022646682022176484,"score_gpt":0.29453836940886613,"score_spread":0.2718916873866897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398222731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08162272,0.00031033644,0.91404366,0.000052948697,0.0014984054,0.00057105353,0.000019422128,0.00012981212,0.0017516171],"genre_scores_gemma":[0.9899782,6.61651e-7,0.00891233,0.0000033092042,0.0000739125,0.00012105061,0.00034592868,0.000018708914,0.0005459081],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984188,0.00002886347,0.00065400446,0.00047001024,0.00016928473,0.0002590237],"domain_scores_gemma":[0.99879557,0.00025831244,0.00029120542,0.00046844763,0.00013361314,0.00005284205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013600419,0.000121575555,0.0002492587,0.00022255507,0.00018817595,0.00019129305,0.00010550958,0.000023751909,0.00013035108],"category_scores_gemma":[0.00003120596,0.00011031667,0.00028707754,0.0007178875,0.00009006676,0.00014475874,0.000043900305,0.00009654168,0.0000011114646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002711751,0.0005262946,0.037422877,0.0011053885,0.0018184817,0.00012167064,0.0018164432,0.095618196,0.011062503,0.16730629,0.18588045,0.4972943],"study_design_scores_gemma":[0.000028528058,0.00001309957,0.00009774755,0.00013660362,0.00008725795,0.000004590424,0.000055624216,0.7377119,0.0003174649,0.25817975,0.0032640577,0.00010336415],"about_ca_topic_score_codex":0.000044284337,"about_ca_topic_score_gemma":0.000015336078,"teacher_disagreement_score":0.9083555,"about_ca_system_score_codex":0.00003117204,"about_ca_system_score_gemma":0.00007888787,"threshold_uncertainty_score":0.44985834},"labels":[],"label_agreement":null},{"id":"W4399190889","doi":"10.3389/fdata.2024.1379921","title":"From theory to practice: insights and hurdles in collecting social media data for social science research","year":2024,"lang":"en","type":"article","venue":"Frontiers in Big Data","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Social media; Scripting language; Data science; Data collection; Public relations; Set (abstract data type); Frontier; Social computing; World Wide Web; Computer science; Sociology; Political science; Social science","score_opus":0.20240120159991856,"score_gpt":0.4471566180623417,"score_spread":0.24475541646242313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399190889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08779833,0.006218819,0.8721437,0.005915427,0.0047260313,0.002632797,0.010933542,0.0002347469,0.009396607],"genre_scores_gemma":[0.90799934,0.00003295909,0.08542269,0.00005399016,0.0038631682,0.00007666499,0.0024379748,0.00003156843,0.0000816724],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99787533,0.0002554781,0.00024816033,0.00086953485,0.00037686303,0.00037463495],"domain_scores_gemma":[0.9978179,0.0012405034,0.00004377503,0.00076668366,0.000077021374,0.000054121683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004076187,0.00011207998,0.00023493289,0.00059538055,0.0004397275,0.00042544564,0.0017534624,0.000045848767,0.000011233119],"category_scores_gemma":[0.0007251034,0.00011183348,0.000017354092,0.0019039266,0.00032241424,0.0008164834,0.0027361864,0.0003675073,0.0000018799234],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008964088,0.00007023062,0.0017566992,0.000012716018,0.00006898075,0.00000526246,0.007922005,6.1738325e-7,0.0002454498,0.012776356,0.45016196,0.52689004],"study_design_scores_gemma":[0.00041028418,0.000020724356,0.0014767853,0.00013392039,0.00007217854,1.6422322e-7,0.024403995,0.026043989,0.00014556228,0.36935854,0.5776016,0.00033224156],"about_ca_topic_score_codex":0.00053943467,"about_ca_topic_score_gemma":0.00035460785,"teacher_disagreement_score":0.820201,"about_ca_system_score_codex":0.00012564426,"about_ca_system_score_gemma":0.0003429395,"threshold_uncertainty_score":0.4560437},"labels":[],"label_agreement":null},{"id":"W4399263858","doi":"10.1007/978-3-031-43601-7_4","title":"Slow-Growing Trees","year":2024,"lang":"en","type":"book-chapter","venue":"Studies in systems, decision and control","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science","score_opus":0.031279894909860974,"score_gpt":0.31831557787519904,"score_spread":0.28703568296533805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399263858","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044255477,0.19378588,0.0062523247,0.00016626304,0.0018188842,0.0011594504,0.00012457032,0.00021470453,0.79603535],"genre_scores_gemma":[0.7906963,0.0009459362,0.00006522623,0.000047923182,0.001110012,0.00012018519,0.000011752457,0.00006232643,0.20694034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979647,0.000033597957,0.0008253284,0.00058805844,0.00033552048,0.00025281758],"domain_scores_gemma":[0.9985662,0.0006378678,0.00020440215,0.00040752423,0.00012288854,0.00006111979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004785175,0.0004472222,0.0013144556,0.00032230694,0.00011677201,0.00012303145,0.00020031144,0.00012060152,0.00009663186],"category_scores_gemma":[0.000012000687,0.0003547319,0.00029182626,0.00006827861,0.00012315923,0.00006603418,0.0002447479,0.00037229276,0.00008419923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060190574,0.000020458074,0.00069622276,0.00013406377,0.0024183847,0.000079588666,0.0003643634,0.00007694725,0.00001060609,0.84447765,0.03747833,0.11418319],"study_design_scores_gemma":[0.00097545184,0.00006665979,0.000031900643,0.004296585,0.0005558812,0.000005216252,0.001398574,0.0019575388,0.0000013746896,0.27747464,0.712574,0.00066220306],"about_ca_topic_score_codex":0.000059117545,"about_ca_topic_score_gemma":0.00003747633,"teacher_disagreement_score":0.79025376,"about_ca_system_score_codex":0.000078637335,"about_ca_system_score_gemma":0.00002078418,"threshold_uncertainty_score":0.99989045},"labels":[],"label_agreement":null},{"id":"W4399341473","doi":"10.1038/s41598-024-63278-3","title":"No free lunch for avoiding clustering vulnerabilities in distributed systems","year":2024,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Computer science; Distributed computing; Resilience (materials science); Complex system; Cluster (spacecraft); Argument (complex analysis); Data mining; Data science; Theoretical computer science; Machine learning; Artificial intelligence","score_opus":0.01628543147412223,"score_gpt":0.27144180570104304,"score_spread":0.25515637422692083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399341473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34811687,0.0012090923,0.61862975,0.00012781296,0.017537456,0.001566094,0.00014423046,0.00065341906,0.012015262],"genre_scores_gemma":[0.99368227,3.4736496e-7,0.00059842266,0.0000011834425,0.00039009654,0.00022392062,0.00027032825,0.0000180086,0.004815417],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982326,0.000051131934,0.00054603413,0.0006273661,0.00022671346,0.00031614053],"domain_scores_gemma":[0.9988394,0.00015246769,0.000101916434,0.00073219975,0.00012239623,0.000051617397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020351133,0.00013650212,0.00023214593,0.00019336495,0.00025235504,0.0009348852,0.00016481461,0.000028654353,0.00010523281],"category_scores_gemma":[0.00006400769,0.00012601884,0.00016049479,0.00053879456,0.00007032445,0.00018916964,0.00014306958,0.00014916186,0.000007762076],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031557294,0.00036628623,0.111087754,0.0018199007,0.0005200244,0.00042108182,0.0021953925,0.051260486,0.019425565,0.06848207,0.73104215,0.013347713],"study_design_scores_gemma":[0.00013760649,0.000028012,0.00020439699,0.0006802178,0.00006181109,0.000018164208,0.0006258251,0.49389124,0.0022891473,0.13234074,0.36925134,0.0004714856],"about_ca_topic_score_codex":0.0003233076,"about_ca_topic_score_gemma":0.000054959673,"teacher_disagreement_score":0.6455654,"about_ca_system_score_codex":0.00009489144,"about_ca_system_score_gemma":0.00007635802,"threshold_uncertainty_score":0.9015119},"labels":[],"label_agreement":null},{"id":"W4399372405","doi":"10.1109/icmcis61231.2024.10540798","title":"Link Analysis of Conflict through Signed Spectral Embedding: The Russo-Ukrainian War","year":2024,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"","keywords":"Embedding; Link (geometry); Computer science; Similarity (geometry); Representation (politics); Theoretical computer science; Link analysis; Artificial intelligence; Space (punctuation); Social network analysis; Machine learning; Image (mathematics); Social media; World Wide Web; Political science; Law","score_opus":0.02119157285970626,"score_gpt":0.32040756389325675,"score_spread":0.2992159910335505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399372405","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25922725,0.0014684832,0.32820433,0.0054622917,0.0003465403,0.00077918544,0.0001390723,0.0009850805,0.40338776],"genre_scores_gemma":[0.99553037,0.0000117950385,0.0019797871,0.0000839038,0.0004139585,0.000017544604,0.000069503054,0.000018701989,0.0018744244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987752,0.00006434264,0.00038175524,0.0003169438,0.0002069578,0.00025483355],"domain_scores_gemma":[0.9990376,0.00023815622,0.000081955695,0.0005511376,0.000050547056,0.000040558345],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026900193,0.00018020651,0.000417928,0.00017952998,0.00008964776,0.00008117066,0.0003401973,0.00003462438,0.005062135],"category_scores_gemma":[0.0000032760468,0.000115524075,0.00073850766,0.0017340675,0.00009616139,0.00009975876,0.00008691389,0.0001804965,0.000030427529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026346986,0.00020360202,0.009115106,0.000034452387,0.026578587,0.000011997788,0.018941065,0.005090899,0.003594292,0.8777104,0.019596322,0.039096933],"study_design_scores_gemma":[0.00021634634,0.00011488404,0.0020672663,0.000052406853,0.0074269385,7.615177e-7,0.0013581263,0.6000145,0.013101739,0.026565144,0.3484636,0.0006182988],"about_ca_topic_score_codex":0.00079407607,"about_ca_topic_score_gemma":0.000051389754,"teacher_disagreement_score":0.85114527,"about_ca_system_score_codex":0.00001939392,"about_ca_system_score_gemma":0.000035392015,"threshold_uncertainty_score":0.99584734},"labels":[],"label_agreement":null},{"id":"W4399485408","doi":"10.1109/tetc.2024.3395072","title":"Special Section on Community Detection in Time-Varying Information and Computing Networks: Theory, Models, and Applications","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Special section; Section (typography); Information theory; Computer network; Theoretical computer science; Distributed computing","score_opus":0.014218988460876223,"score_gpt":0.26694012987588955,"score_spread":0.25272114141501334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399485408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11664244,0.000025375819,0.8809303,0.000035014524,0.00033914985,0.00023177697,0.0000023125308,0.0001361341,0.0016575115],"genre_scores_gemma":[0.99760836,0.000015663538,0.00087614765,0.00002993486,0.0014152465,0.000017236513,0.000008541547,0.000013442426,0.00001544896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989319,0.00019644127,0.00037107663,0.0001946199,0.00011435454,0.00019161303],"domain_scores_gemma":[0.99936396,0.0003488526,0.000067401146,0.0001634817,0.000024000174,0.000032305375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070825143,0.00015580682,0.00017166241,0.00042873088,0.00046469644,0.00017866338,0.000096488,0.00006154894,0.000011878637],"category_scores_gemma":[0.0000014757852,0.00017978526,0.00005069025,0.00054809026,0.000036549955,0.000288445,0.00001137233,0.00087548007,0.0000018288724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000872325,0.000038329854,0.00016043898,0.000017139258,0.00001685882,1.9162094e-7,0.0007696447,0.4903189,0.000009443333,0.002044082,0.000007910927,0.5066083],"study_design_scores_gemma":[0.00017483889,0.000030808053,0.0002999645,0.00021622016,0.000018997831,0.0000018733667,0.0002357927,0.9902942,0.00014981044,0.007947991,0.00047541966,0.00015408694],"about_ca_topic_score_codex":0.0003151184,"about_ca_topic_score_gemma":0.00009131737,"teacher_disagreement_score":0.8809659,"about_ca_system_score_codex":0.00010532295,"about_ca_system_score_gemma":0.000012076769,"threshold_uncertainty_score":0.73314303},"labels":[],"label_agreement":null},{"id":"W4399680526","doi":"10.5267/j.ijiec.2024.4.001","title":"Change point analysis of events in social networks: An online convex optimization approach","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Point (geometry); Regular polygon; Convex optimization; Computer science; Mathematics","score_opus":0.05895128934521809,"score_gpt":0.31425913128745614,"score_spread":0.25530784194223805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399680526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08641258,0.000050089962,0.9127387,0.00016328519,0.00043819167,0.000086074746,0.000048605656,0.000024868332,0.000037602065],"genre_scores_gemma":[0.9860054,0.0000046724485,0.011475171,0.0000083672085,0.0020828608,0.0000058459304,0.0004008778,0.000013664877,0.0000031152765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988064,0.000049679846,0.00064104295,0.000115690775,0.0002849448,0.00010222402],"domain_scores_gemma":[0.99927235,0.0001041732,0.00024030454,0.000057643978,0.0002824202,0.000043103722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029748576,0.000109101034,0.00031154582,0.0013003199,0.000019819701,0.000043164935,0.00025753674,0.000054256885,0.00006776456],"category_scores_gemma":[0.000014467411,0.000111905625,0.00025281348,0.0012019266,0.00001305487,0.00031397567,0.000038148395,0.00029873938,1.333574e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000124330545,0.0001822837,0.0044687386,0.0000018169491,0.0014897927,0.000002673751,0.00026267,0.98291504,0.000009392491,0.0033097442,0.000049688322,0.007295706],"study_design_scores_gemma":[0.0003075791,0.000028198428,0.0032524986,0.00007850951,0.00031500476,0.0000018838217,0.0000837241,0.9956243,0.0000068003465,0.00016940743,0.000047042166,0.00008504783],"about_ca_topic_score_codex":0.00009187144,"about_ca_topic_score_gemma":0.0000035289934,"teacher_disagreement_score":0.90126354,"about_ca_system_score_codex":0.00009513354,"about_ca_system_score_gemma":0.000055755234,"threshold_uncertainty_score":0.45633787},"labels":[],"label_agreement":null},{"id":"W4399708994","doi":"10.1007/s13278-024-01281-2","title":"Predicting properties of nodes via community-aware features","year":2024,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Narodowa Agencja Wymiany Akademickiej","keywords":"Node (physics); Computer science; Value (mathematics); Data mining; Artificial intelligence; Machine learning","score_opus":0.016850683541569867,"score_gpt":0.2649264580893739,"score_spread":0.248075774547804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399708994","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9642297,0.0026519403,0.03015082,0.000081552724,0.000056917746,0.000090905734,0.000012141374,0.00014955297,0.0025764557],"genre_scores_gemma":[0.9980771,0.000017256856,0.00074102153,0.000017227885,0.00086730154,0.000015917469,0.00005544303,0.000019386549,0.0001893646],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988203,0.00021655677,0.00033664555,0.00020468602,0.0001610628,0.000260725],"domain_scores_gemma":[0.9994661,0.00012609463,0.00012683298,0.00016617058,0.00007216602,0.000042618016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005394753,0.00017430582,0.00050171063,0.0001790053,0.0006591202,0.00013404351,0.00015366424,0.000054826378,0.00006570766],"category_scores_gemma":[0.000003472314,0.00015106752,0.00040115358,0.0013810346,0.000123298,0.00009631746,0.00016076896,0.00032188342,5.9229484e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027662381,0.000112850335,0.7429978,0.0001812667,0.012689415,0.0000026424925,0.017081052,0.003309663,0.0010254489,0.008344424,0.0027334727,0.2114943],"study_design_scores_gemma":[0.00086973474,0.00028542182,0.17237125,0.002222314,0.035771444,0.000004576824,0.05400512,0.68596107,0.004053753,0.036528938,0.0050614574,0.0028649382],"about_ca_topic_score_codex":0.0015558099,"about_ca_topic_score_gemma":0.0003622921,"teacher_disagreement_score":0.6826514,"about_ca_system_score_codex":0.000013300884,"about_ca_system_score_gemma":0.000021861142,"threshold_uncertainty_score":0.6160355},"labels":[],"label_agreement":null},{"id":"W4399733018","doi":"10.22148/001c.117486","title":"Poet-Composer Collaborations in Modern Egyptian Song: A Social Network Analysis Approach to Music History","year":2024,"lang":"en","type":"article","venue":"Journal of Cultural Analytics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Musical; Narrative; Context (archaeology); Social network analysis; Suite; Centrality; Social network (sociolinguistics); Literature; History; Art; Computer science; World Wide Web; Archaeology; Social media","score_opus":0.0414461494911035,"score_gpt":0.2857449999835815,"score_spread":0.244298850492478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399733018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4667948,0.0031528918,0.50192976,0.002507381,0.0007303308,0.00044689214,0.00004761275,0.00013670835,0.024253648],"genre_scores_gemma":[0.9904661,0.000009743984,0.006792069,0.00009277902,0.0017768181,0.000006449338,0.000038919585,0.00001768477,0.00079941336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820757,0.00010151903,0.00076339336,0.00023215635,0.00038261217,0.00031273454],"domain_scores_gemma":[0.99898845,0.000056290428,0.00026834733,0.00015779324,0.0003859676,0.00014316893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004086745,0.00021685062,0.0006396955,0.00057670125,0.000104367115,0.00018180526,0.00031384858,0.00005997827,0.00018902699],"category_scores_gemma":[0.0000062229296,0.0001709801,0.0007085388,0.0031354523,0.000044563818,0.00028993102,0.00004914048,0.00043042802,0.000006608664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081121965,0.000520434,0.01025754,0.000033840548,0.0069447113,0.00003797482,0.0138497325,0.6018003,0.0005162456,0.04392866,0.31278363,0.009245798],"study_design_scores_gemma":[0.00044056654,0.00014109972,0.0052073803,0.00011017628,0.005414324,0.000008896293,0.004137405,0.8680818,0.00002398174,0.016432857,0.09923904,0.0007624911],"about_ca_topic_score_codex":0.00007828084,"about_ca_topic_score_gemma":0.00016412194,"teacher_disagreement_score":0.5236713,"about_ca_system_score_codex":0.000417926,"about_ca_system_score_gemma":0.00016660511,"threshold_uncertainty_score":0.6972366},"labels":[],"label_agreement":null},{"id":"W4399794459","doi":"10.48550/arxiv.2406.10711","title":"Symmetry-driven embedding of networks in hyperbolic space","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Embedding; Symmetry (geometry); Space (punctuation); Hyperbolic space; Mathematics; Theoretical physics; Pure mathematics; Computer science; Physics; Geometry; Artificial intelligence","score_opus":0.036042663148122434,"score_gpt":0.21104159438411318,"score_spread":0.17499893123599075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399794459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8678428,0.00025062653,0.11336679,0.000031992102,0.00021766718,0.00031430006,0.000029244724,0.0001542896,0.017792298],"genre_scores_gemma":[0.99834347,0.000062676474,0.00046585102,0.0000063273274,0.00024671294,0.0000018543539,0.00004683374,0.000039276405,0.00078700687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845254,0.00010293821,0.00029343905,0.000747703,0.00006659959,0.00033678507],"domain_scores_gemma":[0.9987842,0.000094558374,0.0002474117,0.0007155239,0.00007278139,0.000085512605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016816035,0.000324359,0.000607341,0.00050542114,0.000039771738,0.00004231188,0.000605888,0.00017955844,0.00018453045],"category_scores_gemma":[0.0000033988351,0.00038988824,0.0004315288,0.0010407581,0.00008861096,0.000054157572,0.001745101,0.0009686646,0.000022317708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013141083,0.000077966564,0.041895807,0.000059725924,0.0002668989,0.000040460232,0.00007716744,0.7282437,0.00001933012,0.22816311,0.0004823162,0.0006603565],"study_design_scores_gemma":[0.000163701,0.000015158526,0.00081113697,0.00039587362,0.00026293733,2.5099814e-7,0.00014696784,0.88369447,0.000081594146,0.11381195,0.00026114492,0.0003548131],"about_ca_topic_score_codex":0.0011887249,"about_ca_topic_score_gemma":0.00009411086,"teacher_disagreement_score":0.15545076,"about_ca_system_score_codex":0.00013549335,"about_ca_system_score_gemma":0.00008579306,"threshold_uncertainty_score":0.9998553},"labels":[],"label_agreement":null},{"id":"W4399991192","doi":"10.48550/arxiv.2406.15233","title":"Critical point representation of the mutual information in the sparse stochastic block model","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Stochastic block model; Representation (politics); Bounded function; Limit (mathematics); Mathematics; Critical point (mathematics); Block (permutation group theory); Focus (optics); Node (physics); CLARITY; Mutual information; Point (geometry); Applied mathematics; Computer science; Mathematical optimization; Combinatorics; Mathematical analysis; Statistics","score_opus":0.05624047816462558,"score_gpt":0.23002323898254123,"score_spread":0.17378276081791566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399991192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69674253,0.000011344705,0.29625118,0.0003026695,0.00011505435,0.0004723934,0.000058271842,0.000046176443,0.006000358],"genre_scores_gemma":[0.9996627,0.00000192907,0.00010639478,0.000028451099,0.00006039153,0.0000036772174,0.00003116854,0.000007324852,0.00009798976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910414,0.0001273304,0.0002583408,0.00025658627,0.000105756066,0.00014782169],"domain_scores_gemma":[0.9989169,0.0001526026,0.00014952559,0.00064715534,0.000108488464,0.000025319076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002010598,0.00015571492,0.00020429977,0.00015584892,0.00006123121,0.000058072677,0.00056348834,0.00007225271,0.000031517848],"category_scores_gemma":[0.00002413991,0.000119579905,0.00026366214,0.0005140142,0.00013217458,0.00014905358,0.00086569635,0.0005815987,0.000015260666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011389481,0.000040375453,0.00056279474,0.000022196193,0.00004039198,0.0000013619509,0.0006251919,0.7371353,0.0000049620817,0.26094985,0.0004729764,0.00013324399],"study_design_scores_gemma":[0.00006716397,0.000005597018,0.00021902366,0.0000682921,0.00014726691,2.6517154e-7,0.0004902814,0.6829845,0.000032685046,0.3158938,0.000007841287,0.00008332304],"about_ca_topic_score_codex":0.0004159623,"about_ca_topic_score_gemma":0.00003781104,"teacher_disagreement_score":0.30292013,"about_ca_system_score_codex":0.000061956016,"about_ca_system_score_gemma":0.000098848446,"threshold_uncertainty_score":0.4876327},"labels":[],"label_agreement":null},{"id":"W4400153793","doi":"10.1007/978-3-031-60916-9_10","title":"Conclusion","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science","score_opus":0.01070657448857438,"score_gpt":0.26696995845121724,"score_spread":0.25626338396264287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400153793","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013446531,0.0031188352,0.24937648,0.0003725599,0.0004934994,0.0003419687,0.00002848986,0.00023226472,0.74602246],"genre_scores_gemma":[0.93247795,0.00008072552,0.0004402066,0.0003047396,0.016142182,0.000033545904,0.0005062943,0.0002067625,0.049807597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998382,0.000024732566,0.00042928444,0.0005400873,0.00024000533,0.00038392935],"domain_scores_gemma":[0.9992286,0.00020214809,0.00018410037,0.00027997393,0.000053845233,0.00005133985],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014934978,0.00049064856,0.0006851017,0.00015866153,0.00018582337,0.000093572875,0.00029387668,0.00058374787,0.0023401396],"category_scores_gemma":[0.000002497327,0.0004858169,0.00052259926,0.00015652913,0.00012165988,0.000028867033,0.00033899382,0.0016641723,0.000066393506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020359232,0.00002370125,0.00031004517,0.000025241321,0.00040763413,0.000031960502,0.00032709833,0.009542638,0.0000038726894,0.681163,0.018259946,0.2898845],"study_design_scores_gemma":[0.00009381805,0.000015235872,0.00000875705,0.00021931273,0.0001667448,4.1751815e-7,0.0000015969911,0.009664278,0.000006578362,0.7836995,0.20566262,0.00046112805],"about_ca_topic_score_codex":0.00007162517,"about_ca_topic_score_gemma":0.00012526319,"teacher_disagreement_score":0.9324645,"about_ca_system_score_codex":0.00013520975,"about_ca_system_score_gemma":0.000043707943,"threshold_uncertainty_score":0.9997594},"labels":[],"label_agreement":null},{"id":"W4400153800","doi":"10.1007/978-3-031-60916-9_1","title":"Introduction","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Philosophy","score_opus":0.008657129300061338,"score_gpt":0.2518431792257263,"score_spread":0.24318604992566495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400153800","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010129006,0.0025501472,0.39079803,0.0018822609,0.0011927421,0.0003812524,0.000022265704,0.00031639577,0.6028468],"genre_scores_gemma":[0.7408663,0.00010237206,0.00085455744,0.00024499014,0.13435462,0.0000648998,0.001004551,0.00030904374,0.12219866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984643,0.00002244445,0.00039413283,0.0005805823,0.00019852845,0.00034003772],"domain_scores_gemma":[0.99934715,0.000100450234,0.00016904714,0.00029020986,0.000054513952,0.000038599283],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014928516,0.00043480747,0.0005784423,0.00017876351,0.0001321627,0.00009849341,0.00021675957,0.00047605013,0.0032960935],"category_scores_gemma":[0.0000030215103,0.0004457936,0.00043303554,0.00017970795,0.00010267055,0.00003620482,0.00014139207,0.0016381507,0.00008665357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016530574,0.0000203453,0.00013276347,0.000019511783,0.0003971425,0.0000094763645,0.00016964009,0.016123142,0.0000027019305,0.6651504,0.065461606,0.25249672],"study_design_scores_gemma":[0.000050803435,0.000011376619,0.0000070134533,0.00006446205,0.0001492244,4.5437795e-7,0.0000012522365,0.0045520146,0.000006293708,0.6287903,0.36602798,0.00033877563],"about_ca_topic_score_codex":0.000044827535,"about_ca_topic_score_gemma":0.00008887121,"teacher_disagreement_score":0.7408562,"about_ca_system_score_codex":0.00013921034,"about_ca_system_score_gemma":0.000030932544,"threshold_uncertainty_score":0.9997994},"labels":[],"label_agreement":null},{"id":"W4400153810","doi":"10.1007/978-3-031-60916-9_2","title":"Background","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Philosophy","score_opus":0.017492592936056834,"score_gpt":0.2776290844046581,"score_spread":0.2601364914686013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400153810","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016018359,0.002945561,0.23902912,0.00027313133,0.00047505758,0.00029366242,0.00002839468,0.00021347175,0.7567256],"genre_scores_gemma":[0.8897055,0.00008272402,0.0007268037,0.0003254041,0.023340043,0.000050690214,0.0005872552,0.00029373154,0.08488787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822366,0.000024714294,0.0004598156,0.0005991698,0.00024203776,0.0004505897],"domain_scores_gemma":[0.99916077,0.00021869513,0.00018426798,0.00032719702,0.000052456642,0.000056611887],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015251558,0.00055216596,0.00073905196,0.00017343396,0.00015337818,0.00015036458,0.00033343278,0.0005983461,0.003052191],"category_scores_gemma":[0.0000015113616,0.0005604694,0.0005966076,0.00018330791,0.00013458934,0.000037979164,0.00022397714,0.0018466763,0.00010840603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015199455,0.000023964658,0.0002557814,0.000025212643,0.00053874555,0.000027226199,0.00017407646,0.006901243,0.0000012329981,0.8062206,0.017838823,0.1679779],"study_design_scores_gemma":[0.00008303289,0.0000139101385,0.000013610284,0.00017353488,0.00019268047,4.9432816e-7,0.0000026435941,0.0052241636,0.0000026650125,0.78331167,0.21047248,0.00050910324],"about_ca_topic_score_codex":0.00008105461,"about_ca_topic_score_gemma":0.00018627939,"teacher_disagreement_score":0.88968945,"about_ca_system_score_codex":0.000149446,"about_ca_system_score_gemma":0.000046911107,"threshold_uncertainty_score":0.9996847},"labels":[],"label_agreement":null},{"id":"W4400153819","doi":"10.1007/978-3-031-60916-9_4","title":"Social Network Data","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Social network (sociolinguistics); Computer science; Data science; World Wide Web; Social media","score_opus":0.029096243169155437,"score_gpt":0.30459565246033976,"score_spread":0.2754994092911843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400153819","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005270368,0.00570165,0.2982741,0.0012291124,0.0010189957,0.00067861157,0.00023218589,0.00049350614,0.6923666],"genre_scores_gemma":[0.7927838,0.00017089554,0.0017973696,0.0008061693,0.14797926,0.00007991977,0.008711841,0.00069246313,0.046978287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967391,0.00006370075,0.0007494858,0.0011840453,0.00041462004,0.00084902893],"domain_scores_gemma":[0.9982889,0.00032212198,0.00036977784,0.00086908665,0.00007372464,0.000076334254],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043553443,0.0008180666,0.0011894116,0.00015380708,0.00046671752,0.00023858315,0.0012955618,0.0009601507,0.0015679592],"category_scores_gemma":[0.000005295231,0.0008616121,0.00057884905,0.0003579352,0.00023793566,0.00009027379,0.001322349,0.0028475006,0.00008032987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031029747,0.00003166787,0.00037870032,0.000031145955,0.00094645325,0.000033797245,0.00025170462,0.012438069,3.1035492e-7,0.5751003,0.21772012,0.19303672],"study_design_scores_gemma":[0.00010779584,0.0000107565465,0.000016622758,0.00014806825,0.00036545037,5.114259e-7,0.0000020889731,0.015380979,3.290148e-7,0.6585015,0.324834,0.0006319174],"about_ca_topic_score_codex":0.00010517144,"about_ca_topic_score_gemma":0.00045340878,"teacher_disagreement_score":0.7927785,"about_ca_system_score_codex":0.00015449368,"about_ca_system_score_gemma":0.00010105621,"threshold_uncertainty_score":0.99945295},"labels":[],"label_agreement":null},{"id":"W4400153840","doi":"10.1007/978-3-031-60916-9_8","title":"Scaling Up","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Scaling; Mathematics; Geometry","score_opus":0.013855076540526503,"score_gpt":0.2722354594575082,"score_spread":0.25838038291698173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400153840","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020861467,0.0035380835,0.39180067,0.00027030436,0.00089795433,0.00033623428,0.000028272687,0.0002896383,0.60281795],"genre_scores_gemma":[0.9276647,0.000072586976,0.000590292,0.0002365144,0.019604737,0.00003827124,0.000408162,0.00024315157,0.051141568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820757,0.000025101417,0.00047876476,0.0005888752,0.00024435803,0.00045531374],"domain_scores_gemma":[0.9991275,0.0002690647,0.00019128053,0.00029950106,0.000055927656,0.00005673751],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017428643,0.0005301992,0.00073420856,0.0001797095,0.00017531414,0.00013722526,0.00032070422,0.0005931161,0.0016807313],"category_scores_gemma":[0.0000040169953,0.0005410931,0.000614291,0.00018563087,0.000117285796,0.00003294272,0.00022265763,0.0019005631,0.0000632933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001689899,0.000016463453,0.00026247042,0.000027962937,0.0005115541,0.000019556523,0.00038071652,0.01748457,0.0000015217873,0.50981075,0.010418012,0.46104953],"study_design_scores_gemma":[0.00009678306,0.000008518013,0.000010033381,0.00028889353,0.00022355023,4.642191e-7,0.000003112025,0.015233953,0.000007748566,0.8358644,0.14769748,0.00056506373],"about_ca_topic_score_codex":0.00007429236,"about_ca_topic_score_gemma":0.00007941021,"teacher_disagreement_score":0.92764384,"about_ca_system_score_codex":0.00012691884,"about_ca_system_score_gemma":0.00004455851,"threshold_uncertainty_score":0.99970406},"labels":[],"label_agreement":null},{"id":"W4400429019","doi":"10.1016/j.mbs.2024.109248","title":"Efficient and scalable prediction of stochastic reaction–diffusion processes using graph neural networks","year":2024,"lang":"en","type":"article","venue":"Mathematical Biosciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Leverhulme Trust","keywords":"Scalability; Computer science; Computation; Graph; Population; Reaction–diffusion system; Monte Carlo method; Artificial neural network; Diffusion; Theoretical computer science; Statistical physics; Algorithm; Artificial intelligence; Mathematics; Physics","score_opus":0.01850403913367971,"score_gpt":0.26743590749442475,"score_spread":0.24893186836074505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400429019","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55297196,0.00017542369,0.4462314,0.000025657244,0.000056050707,0.00010384987,0.0000052609475,0.00006129436,0.00036909754],"genre_scores_gemma":[0.9981876,0.0000016554113,0.0016921952,0.0000029579335,0.0000784175,0.000008734201,0.0000023357013,0.0000055128007,0.000020581543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914724,0.000019401112,0.00023461685,0.00023124677,0.0002088815,0.00015863986],"domain_scores_gemma":[0.9995864,0.0001564459,0.000058540212,0.00010002532,0.000047913072,0.000050686594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023260158,0.00009817174,0.000159816,0.00011963633,0.00012931736,0.00009686293,0.000092047034,0.000023256496,0.000047570484],"category_scores_gemma":[0.000018151935,0.00007007245,0.000049533202,0.00079772394,0.00023261187,0.00007589706,0.0000646492,0.000076580676,9.764174e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008169978,0.0033457242,0.018991474,0.003903913,0.00051003846,0.0000090653475,0.0048864787,0.27321038,0.15944138,0.40342015,0.0007509576,0.13144873],"study_design_scores_gemma":[0.000026324615,0.000033535758,0.0001241487,0.00018728424,0.000052294858,0.0000026716327,0.00013457278,0.97393215,0.00035940253,0.025081467,0.0000051358597,0.00006099052],"about_ca_topic_score_codex":0.000027272366,"about_ca_topic_score_gemma":7.927744e-7,"teacher_disagreement_score":0.7007218,"about_ca_system_score_codex":0.0000090208805,"about_ca_system_score_gemma":0.000023913628,"threshold_uncertainty_score":0.28574717},"labels":[],"label_agreement":null},{"id":"W4400867599","doi":"10.1007/s11192-024-05078-0","title":"Navigating geopolitical storms: assessing the robustness of Canada’s 5G research network in the wake of the Huawei conflict","year":2024,"lang":"en","type":"article","venue":"Scientometrics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Geopolitics; Wake; Storm; Robustness (evolution); Political science; Regional science; Computer science; Sociology; Meteorology; Geography; Politics; Engineering; Law; Aerospace engineering","score_opus":0.07914980132810835,"score_gpt":0.4294486770892403,"score_spread":0.35029887576113194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400867599","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9796622,0.0010562342,0.0046816347,0.0014689607,0.00047440088,0.00040495757,0.000019911908,0.000017468868,0.012214234],"genre_scores_gemma":[0.99927074,0.0000025196946,0.00022305503,0.000029854727,0.00033240768,0.000014537394,0.0000037448444,0.000009990279,0.00011315556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966992,0.00047243695,0.00039669752,0.00023264225,0.001582244,0.0006167621],"domain_scores_gemma":[0.9965236,0.0024228303,0.000104804436,0.0005795568,0.00032044598,0.000048724345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007954184,0.0001040139,0.00019689192,0.00026375972,0.000422625,0.0002464863,0.0011418901,0.00002987918,0.000044545523],"category_scores_gemma":[0.00026600447,0.000051674037,0.00011787037,0.017730646,0.00043248813,0.000087315755,0.00029566197,0.00085527205,3.908463e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053309946,0.00026039162,0.33150715,0.00018248837,0.0002183579,0.0000072970097,0.004944264,0.05564729,0.00022884787,0.4824545,0.049424566,0.07511951],"study_design_scores_gemma":[0.00043612777,0.00010651613,0.2943071,0.0019886321,0.00021629508,0.0000081686985,0.022207232,0.5745411,0.002799066,0.03144473,0.07123482,0.0007101666],"about_ca_topic_score_codex":0.077270195,"about_ca_topic_score_gemma":0.013166003,"teacher_disagreement_score":0.51889384,"about_ca_system_score_codex":0.00015086615,"about_ca_system_score_gemma":0.00089544104,"threshold_uncertainty_score":0.9288743},"labels":[],"label_agreement":null},{"id":"W4400906093","doi":"10.1016/j.cognition.2024.105845","title":"Using network science to provide insights into the structure of event knowledge","year":2024,"lang":"en","type":"article","venue":"Cognition","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Population Health Research Institute; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Event (particle physics); Centrality; Psychology; Event structure; Experiential learning; Action (physics); Data science; Cognitive psychology; Computer science; Linguistics","score_opus":0.020683748726279406,"score_gpt":0.32150203642503306,"score_spread":0.30081828769875363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400906093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84776276,0.00059044245,0.14801209,0.000060954473,0.00019409822,0.00031743193,0.0000035658925,0.000058009224,0.0030006426],"genre_scores_gemma":[0.99762225,0.0000011593843,0.0017748787,0.000019350073,0.00053610787,0.00000629774,0.000010868108,0.0000074307936,0.000021635413],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994125,0.0000291664,0.0001391196,0.00017663372,0.00012007137,0.000122549],"domain_scores_gemma":[0.9996127,0.000040906198,0.00003577076,0.00014616939,0.00013136282,0.000033099128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115565905,0.00007325059,0.00008571307,0.00008630391,0.00017209664,0.00007181776,0.0001480729,0.000012277897,0.00007188623],"category_scores_gemma":[0.000004911399,0.000051001498,0.00005423143,0.000990952,0.00008798851,0.000108446664,0.00010690466,0.00008340774,0.000007917821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017850196,0.000088900124,0.0011823878,0.00008758971,0.00017022264,0.0000012441101,0.007902218,0.0065654865,0.34120697,0.105434135,0.0034099931,0.533933],"study_design_scores_gemma":[0.00010047739,0.00007292514,0.0009975535,0.0007822251,0.0002781468,9.791252e-7,0.0003602053,0.1489042,0.27447596,0.5499786,0.023740288,0.0003084394],"about_ca_topic_score_codex":0.00003327112,"about_ca_topic_score_gemma":0.00003802254,"teacher_disagreement_score":0.53362453,"about_ca_system_score_codex":0.000033268057,"about_ca_system_score_gemma":0.000103425446,"threshold_uncertainty_score":0.20797807},"labels":[],"label_agreement":null},{"id":"W4401171689","doi":"10.1155/2024/5910244","title":"Vulnerability Analysis of China‐Europe Railway Express Network Based on Improved Nonlinear Load‐Capacity Model","year":2024,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"China; Vulnerability (computing); Nonlinear system; Vulnerability assessment; Computer science; Transport engineering; Engineering; Computer security; Geography; Medicine","score_opus":0.010654932989267783,"score_gpt":0.2684841788596431,"score_spread":0.2578292458703753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401171689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50534135,0.000054166136,0.4941,0.00004922671,0.000079987665,0.000098001125,0.000076198914,0.000025731926,0.00017529786],"genre_scores_gemma":[0.947862,0.000010293409,0.051748406,0.000017999635,0.00021377135,0.0000062675126,0.000098692755,0.000020624333,0.00002192867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981999,0.00007571424,0.0008944656,0.00024621727,0.00039894434,0.00018479017],"domain_scores_gemma":[0.9985569,0.00013248561,0.0005253463,0.00028036442,0.00042400786,0.00008086048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005634689,0.00019528915,0.0005796082,0.00026614615,0.000057365058,0.000030412139,0.00018326993,0.000039960418,0.00011633664],"category_scores_gemma":[0.000010097665,0.00016711127,0.0006901603,0.0013450183,0.00004412214,0.00029874025,0.0000030836086,0.00037126755,4.5508216e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019998729,0.00018336074,0.003916124,0.00003101827,0.0006411682,0.0000023281073,0.00029319478,0.98168635,0.005595274,0.0006765327,0.00004290353,0.006731734],"study_design_scores_gemma":[0.00038410435,0.00016239057,0.026367001,0.00012757124,0.001592878,9.405956e-8,0.000023687253,0.9649741,0.0027306308,0.0031100472,0.00036145406,0.00016606507],"about_ca_topic_score_codex":0.000030554456,"about_ca_topic_score_gemma":0.0000340975,"teacher_disagreement_score":0.44252065,"about_ca_system_score_codex":0.00005515966,"about_ca_system_score_gemma":0.00012483966,"threshold_uncertainty_score":0.68146},"labels":[],"label_agreement":null},{"id":"W4401226393","doi":"10.1137/23m1576700","title":"Graph Neural Reaction Diffusion Models","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Council for Higher Education; United States - Israel Binational Science Foundation","keywords":"Mathematics; Reaction–diffusion system; Graph; Artificial neural network; Applied mathematics; Computer science; Discrete mathematics; Mathematical analysis; Artificial intelligence","score_opus":0.02543312327666727,"score_gpt":0.2930484830361527,"score_spread":0.26761535975948547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401226393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7633827,0.00020420918,0.22554606,0.0002386329,0.0026278184,0.00008822149,0.0000027745546,0.00020141782,0.007708184],"genre_scores_gemma":[0.99722475,0.000002022814,0.00084368204,0.000020573198,0.0011406265,7.241454e-7,0.000011920732,0.00001848256,0.0007372359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983732,0.00008778119,0.0003791209,0.00038517304,0.00045502317,0.00031967324],"domain_scores_gemma":[0.99928176,0.000105972314,0.00013649144,0.00024690546,0.00010852523,0.00012036584],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010130843,0.00015809001,0.00017495725,0.00047778367,0.00072329276,0.001417717,0.00025355432,0.000023741793,0.00013939178],"category_scores_gemma":[0.0000037889856,0.00013074951,0.00031219903,0.0009101883,0.000059092432,0.0003174964,0.00010586779,0.0005552697,0.000047315712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018641918,0.0002111267,0.0011021288,0.000018570432,0.00016017025,0.00004763116,0.0009757051,0.047843087,0.018500209,0.06244823,0.029258512,0.83941597],"study_design_scores_gemma":[0.00008981743,0.000032463195,0.0002396416,0.00020262197,0.000031330717,0.000026379339,0.00010864055,0.92423993,0.000368745,0.0650524,0.009440306,0.00016775072],"about_ca_topic_score_codex":0.000013381509,"about_ca_topic_score_gemma":0.0000011611319,"teacher_disagreement_score":0.87639683,"about_ca_system_score_codex":0.000057323166,"about_ca_system_score_gemma":0.000042976935,"threshold_uncertainty_score":0.9996189},"labels":[],"label_agreement":null},{"id":"W4401343059","doi":"10.3389/fphy.2024.1435767","title":"Building a network with assortative mixing starting from preference functions, with application to the spread of epidemics","year":2024,"lang":"en","type":"article","venue":"Frontiers in Physics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; George & Fay Yee Centre for Healthcare Innovation","funders":"University of Manitoba","keywords":"Assortativity; Mixing (physics); Mixing patterns; Degree (music); Computer science; Statistical physics; Degree distribution; Property (philosophy); Epidemic model; Complex network; Mathematics; Econometrics; Physics; Population; Demography","score_opus":0.012020800734993134,"score_gpt":0.25118754488899286,"score_spread":0.23916674415399974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401343059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07478795,0.00022761319,0.9239545,0.000098149954,0.000069401256,0.0003259478,0.000030384965,0.000054551492,0.00045153615],"genre_scores_gemma":[0.83381224,0.000002198704,0.16545023,0.00002991363,0.0004726946,0.00014099955,0.00004665098,0.000021857728,0.000023215256],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989726,0.00006401706,0.00024674155,0.00031957944,0.00017553706,0.00022151113],"domain_scores_gemma":[0.9992587,0.00016930274,0.00014852705,0.000325717,0.0000641382,0.000033615113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022325706,0.00015474042,0.0002611785,0.000044148786,0.00008482794,0.00004929167,0.00019878776,0.000020246636,0.0000044733897],"category_scores_gemma":[0.00000342588,0.000108345965,0.000053231248,0.000947916,0.000046118465,0.0001363626,0.000052810465,0.0002459039,0.0000017911638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008085446,0.000057600504,0.37841925,0.000017192247,0.0005249988,7.047643e-7,0.0014103658,0.23767303,0.00022688946,0.0254843,0.013277685,0.34282714],"study_design_scores_gemma":[0.00027627006,0.0001554324,0.00801158,0.001131921,0.00042010762,1.042046e-7,0.0016978851,0.52694225,0.0028878602,0.45183548,0.006093972,0.0005471361],"about_ca_topic_score_codex":0.00054796244,"about_ca_topic_score_gemma":0.00010011745,"teacher_disagreement_score":0.75902426,"about_ca_system_score_codex":0.000059092377,"about_ca_system_score_gemma":0.000050585142,"threshold_uncertainty_score":0.44182202},"labels":[],"label_agreement":null},{"id":"W4401399010","doi":"10.36253/979-12-215-0413-2.21","title":"Multi-level structure of the First Tuesday communities after the 2000 dot-com crash: A social network analysis of economic actors based on web archives","year":2024,"lang":"en","type":"book-chapter","venue":"Proceedings e report","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Crash; Social network analysis; World Wide Web; Computer science; Social media","score_opus":0.01996137310799117,"score_gpt":0.25181349329501546,"score_spread":0.23185212018702428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401399010","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24893314,0.0008450335,0.0006087135,0.0018127788,0.0011308081,0.0034155373,0.004984174,0.00043139892,0.7378384],"genre_scores_gemma":[0.9743926,0.000012683555,0.00024113533,0.000042219217,0.0006112156,0.000045576657,0.00016052574,0.00008270964,0.024411324],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791527,0.000014367775,0.0010058399,0.00041618414,0.0003577496,0.0002905926],"domain_scores_gemma":[0.99753875,0.00015728538,0.0015240269,0.0006046841,0.00013405675,0.00004119892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025828122,0.0005325771,0.0011269482,0.0003712622,0.00027147346,0.000102745114,0.00075498293,0.00016561625,0.0008342957],"category_scores_gemma":[0.0000036591036,0.00034620584,0.0015802342,0.0002508987,0.00046789233,0.000049813836,0.00037956022,0.0008214836,0.0000017772848],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003752393,0.0002672815,0.790728,0.00078349723,0.03819668,0.000016780912,0.0104869865,0.0070197578,0.00023549609,0.12705281,0.020677725,0.004159796],"study_design_scores_gemma":[0.0012238708,0.00027520137,0.18974464,0.005413098,0.051592465,0.000025662224,0.0015360536,0.19410618,0.0009135873,0.19406809,0.35663563,0.0044655176],"about_ca_topic_score_codex":0.00020856241,"about_ca_topic_score_gemma":0.0004434515,"teacher_disagreement_score":0.72545946,"about_ca_system_score_codex":0.00010441886,"about_ca_system_score_gemma":0.00022412886,"threshold_uncertainty_score":0.99989897},"labels":[],"label_agreement":null},{"id":"W4401585219","doi":"10.1155/2024/1129799","title":"Recognizing Critical Stations in Urban Rail Transit Networks Based on the PCA‐TPE Method: Shanghai Metro as an Example","year":2024,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Urban rail transit; Transport engineering; Transit (satellite); Rail transit; Light rail transit; Metro station; Public transport; Urban transit; Computer science; Environmental science; Engineering; Civil engineering","score_opus":0.029448620694297767,"score_gpt":0.3311308560389535,"score_spread":0.3016822353446557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401585219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101870194,0.00016524926,0.8965352,0.0008297112,0.00014584241,0.00016010675,0.000015951346,0.000036926445,0.00024080162],"genre_scores_gemma":[0.94621736,0.000009970227,0.05319082,0.00014326081,0.0002915089,0.000022435306,0.00008680466,0.000028308148,0.000009536538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844146,0.00020436771,0.000625348,0.00022397649,0.00028862356,0.00021621467],"domain_scores_gemma":[0.9984234,0.0010190412,0.0001432468,0.00016500533,0.00016099152,0.00008829135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082749623,0.00016407072,0.00027927358,0.0002874911,0.000099537414,0.00008830722,0.00015656522,0.000040615112,0.00034672357],"category_scores_gemma":[0.000014962578,0.0001286932,0.0002398358,0.0006877146,0.00003132183,0.0005050489,0.0000012407733,0.0005063763,0.0000016951609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026905627,0.00032544095,0.0026765352,0.000029310731,0.0001587516,0.000051819534,0.00328487,0.8143368,0.0016525822,0.08733173,0.00031993195,0.08956321],"study_design_scores_gemma":[0.0019901465,0.0014576913,0.043056104,0.0014536598,0.0011348394,0.0000047438166,0.00734541,0.65766054,0.0046587316,0.2722169,0.008094629,0.0009266197],"about_ca_topic_score_codex":0.0001483981,"about_ca_topic_score_gemma":0.0003133957,"teacher_disagreement_score":0.8443472,"about_ca_system_score_codex":0.00005379935,"about_ca_system_score_gemma":0.00008234295,"threshold_uncertainty_score":0.5247956},"labels":[],"label_agreement":null},{"id":"W4401628471","doi":"10.1016/j.trip.2024.101201","title":"Clustering bike sharing stations using Quantum Machine Learning: A case study of Toronto, Canada","year":2024,"lang":"en","type":"article","venue":"Transportation Research Interdisciplinary Perspectives","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; York University","keywords":"Cluster analysis; Computer science; Bike sharing; Artificial intelligence; Machine learning; Transport engineering; Engineering","score_opus":0.07006281606277118,"score_gpt":0.42576447173356996,"score_spread":0.3557016556707988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401628471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9814734,0.00062818005,0.016418299,0.00007199768,0.000054178072,0.00043425502,0.0000794143,0.00008152223,0.0007587473],"genre_scores_gemma":[0.99918485,0.000008132233,0.0003540237,4.7447432e-7,0.00009917686,0.000064048676,0.000050939456,0.000034470413,0.00020387805],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9981445,0.00015477107,0.00043124426,0.00048890925,0.0004689173,0.0003116767],"domain_scores_gemma":[0.9991054,0.00017715605,0.000069306014,0.0002495435,0.00030403887,0.000094544106],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044059273,0.00016998338,0.00024782986,0.00020931198,0.000478608,0.0000981479,0.00020534253,0.000020735579,0.0009720737],"category_scores_gemma":[0.000003936234,0.00016715353,0.00010555931,0.00048498783,0.00008011296,0.00033128227,0.00010687929,0.00045172224,7.9949285e-7],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031853642,0.0025932344,0.18380596,0.00046755932,0.002739004,0.0041265655,0.66074103,0.11004017,0.0034455492,0.022753533,0.00063624495,0.008332615],"study_design_scores_gemma":[0.00021642956,0.0003191095,0.005363166,0.00012981515,0.00008120178,0.000011251599,0.51512355,0.47738117,0.00006405472,0.0010726483,0.000055050714,0.00018253192],"about_ca_topic_score_codex":0.88893867,"about_ca_topic_score_gemma":0.9404106,"teacher_disagreement_score":0.36734098,"about_ca_system_score_codex":0.00042889078,"about_ca_system_score_gemma":0.00024814447,"threshold_uncertainty_score":0.9999412},"labels":[],"label_agreement":null},{"id":"W4401726049","doi":"10.1155/2024/9093078","title":"Research on Chaotic Characteristics of Cascade Failure in Rail Transit Networks considering Nonlinear Load Fluctuations","year":2024,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gansu Education Department; National Natural Science Foundation of China","keywords":"Cascade; Chaotic; Nonlinear system; Transit (satellite); Computer science; Statistical physics; Control theory (sociology); Engineering; Transport engineering; Physics; Public transport","score_opus":0.02173268385439327,"score_gpt":0.3267277149732487,"score_spread":0.30499503111885545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401726049","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87599254,0.00021150144,0.12311992,0.00026211757,0.00012510126,0.0001569387,0.000025875854,0.0000161925,0.000089824694],"genre_scores_gemma":[0.9938995,0.000070616115,0.005628634,0.0000068133836,0.00030422152,0.0000062444897,0.000048320235,0.000019441579,0.000016199023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99847656,0.000060487844,0.000743435,0.0001435184,0.00039052626,0.00018544997],"domain_scores_gemma":[0.99907106,0.00024976349,0.0001965687,0.00011436797,0.00031548602,0.00005275166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053468667,0.000115420364,0.00031581358,0.0003810475,0.000044484073,0.000027589256,0.00010619437,0.000045734225,0.00008187045],"category_scores_gemma":[0.000007544264,0.00010983803,0.00016681862,0.00067657046,0.000048654132,0.00023024237,0.0000019980444,0.00061886467,0.000001284508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027929494,0.0003180262,0.0057199686,0.00016064856,0.00029655767,0.00011786886,0.004648841,0.9054045,0.012280975,0.015177469,0.0001825381,0.05541329],"study_design_scores_gemma":[0.0062005916,0.0022570288,0.62766194,0.011228477,0.0011818901,0.000034299766,0.012250852,0.2390648,0.029095963,0.05165125,0.01767427,0.0016986263],"about_ca_topic_score_codex":0.000022811626,"about_ca_topic_score_gemma":0.00017577148,"teacher_disagreement_score":0.6663397,"about_ca_system_score_codex":0.00007206794,"about_ca_system_score_gemma":0.0001421029,"threshold_uncertainty_score":0.4479065},"labels":[],"label_agreement":null},{"id":"W4401797871","doi":"10.1007/978-3-031-59999-6_6","title":"CELL-DEVS Modelling of Individual Behaviour Towards Influencers in Social Media","year":2024,"lang":"en","type":"book-chapter","venue":"Simulation foundations, methods and applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Influencer marketing; DEVS; Social media; Computer science; Business; World Wide Web; Simulation; Modeling and simulation; Marketing","score_opus":0.0864278428585039,"score_gpt":0.4015882797276879,"score_spread":0.315160436869184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401797871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045351728,0.00044007282,0.86273676,0.000061199156,0.000041894466,0.0006982562,0.00032929383,0.0000812151,0.1351578],"genre_scores_gemma":[0.82666695,0.00008016217,0.15675479,0.00002123054,0.00088323746,0.00042705616,0.002429268,0.00010447471,0.012632834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983637,0.000050514598,0.0007550526,0.00042551517,0.0002572691,0.00014798406],"domain_scores_gemma":[0.99865395,0.00044284252,0.00039992473,0.0002659789,0.00018510247,0.000052228414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005676352,0.00026468618,0.00043417758,0.00045638098,0.00019704529,0.0001100175,0.00020029713,0.00017142128,0.00038042833],"category_scores_gemma":[0.0000045760457,0.00029615953,0.00018336292,0.00024373163,0.00013272883,0.00011708999,0.00012848624,0.0003761006,0.000011786839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002993218,0.000039606777,0.0002484949,0.00003903446,0.00009305704,9.3976304e-8,0.0006034295,0.050272707,0.000013673503,0.8178485,0.000089235364,0.13074917],"study_design_scores_gemma":[0.00017730122,0.0000084098865,0.00027307903,0.00006783691,0.0005420589,1.13764315e-7,0.00018002314,0.079790734,0.000047328725,0.86336523,0.05515683,0.00039105132],"about_ca_topic_score_codex":0.000053873555,"about_ca_topic_score_gemma":0.000008825388,"teacher_disagreement_score":0.8262134,"about_ca_system_score_codex":0.000057566955,"about_ca_system_score_gemma":0.00011422161,"threshold_uncertainty_score":0.99994904},"labels":[],"label_agreement":null},{"id":"W4401995714","doi":"10.1007/s10588-024-09386-x","title":"Modeling and analyzing network dynamics of COVID-19 vaccine information propagation in the Chinese Sina Microblog","year":2024,"lang":"en","type":"article","venue":"Computational and Mathematical Organization Theory","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Microblogging; Social media; Coronavirus disease 2019 (COVID-19); Dynamics (music); Computer science; Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2); Data science; World Wide Web; Physics; Medicine","score_opus":0.004852093464308798,"score_gpt":0.24707165101851652,"score_spread":0.24221955755420774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401995714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12265926,0.00010662621,0.8762821,0.00059201557,0.000009766687,0.00015812053,0.0000064977653,0.000035199628,0.00015039196],"genre_scores_gemma":[0.99398345,0.0000062956956,0.005567124,0.00009276916,0.000051133316,0.0000061107153,0.000279748,0.000007585283,0.0000057637617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992942,0.000090517795,0.0003339899,0.00010169192,0.000102892,0.000076669],"domain_scores_gemma":[0.99931365,0.00043576976,0.00006216143,0.0000656358,0.00009123182,0.00003156947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060847553,0.00009193218,0.00014200619,0.0001072934,0.0000948136,0.00009597659,0.00006725213,0.000023927756,0.000077048004],"category_scores_gemma":[0.00007990455,0.00006371849,0.000022505985,0.00070920965,0.000032301326,0.00022176502,0.000049386723,0.000080859674,0.0000024002627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004221146,0.000021866692,0.0028628819,0.0001246336,0.000024084495,2.0838675e-7,0.0010880858,0.13678785,0.0000063329835,0.85598046,0.000036587855,0.0030627884],"study_design_scores_gemma":[0.00005668693,0.0000049111504,0.00042425777,0.000026667029,0.00001868909,0.0000029546004,0.00013781009,0.5106987,0.0000011913038,0.48858684,0.0000044010844,0.00003691107],"about_ca_topic_score_codex":0.000006530923,"about_ca_topic_score_gemma":0.000002227919,"teacher_disagreement_score":0.87132424,"about_ca_system_score_codex":0.000022199672,"about_ca_system_score_gemma":0.000041432682,"threshold_uncertainty_score":0.25983647},"labels":[],"label_agreement":null},{"id":"W4402047046","doi":"10.1016/j.ins.2024.121394","title":"Experimental evaluation of the effect of community structures on link prediction","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Galatasaray Üniversitesi; Providence Health Care","keywords":"Link (geometry); Computer science; Data mining; Computer network","score_opus":0.03280480671375124,"score_gpt":0.36198096131836743,"score_spread":0.3291761546046162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402047046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9862023,0.000021641512,0.0011013929,0.0000335846,0.00011332556,0.00015917818,0.000011626156,0.00001737452,0.0123395575],"genre_scores_gemma":[0.9999103,9.753587e-8,0.000028170756,0.0000060636985,0.000030119669,0.000012731847,0.000009825643,7.2005594e-7,0.0000019475672],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991445,0.00018254762,0.00018072121,0.00002629274,0.00042678276,0.000039166982],"domain_scores_gemma":[0.9996156,0.00010559531,0.00009962256,0.00011937068,0.000053292115,0.000006528482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013519482,0.00004081642,0.000059081765,0.0000793883,0.00013615443,0.000042245134,0.00016665495,0.0000103424545,0.00010085062],"category_scores_gemma":[0.000013891949,0.000023279223,0.000055972596,0.00032371713,0.00011660248,0.0003795331,0.000036649333,0.00007292365,0.0000019170345],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024957393,0.00003724879,0.028481387,0.000076114804,0.00010641756,4.504112e-9,0.013449746,0.069781035,0.0074993847,0.061032932,0.0029892228,0.8165215],"study_design_scores_gemma":[0.00018312903,0.00042615228,0.028337011,0.00009332316,0.00006172933,2.0980869e-7,0.0015043323,0.29790765,0.6605065,0.010329629,0.0005891269,0.00006124796],"about_ca_topic_score_codex":0.00012647743,"about_ca_topic_score_gemma":9.4254557e-7,"teacher_disagreement_score":0.8164603,"about_ca_system_score_codex":0.00001670831,"about_ca_system_score_gemma":0.00003146064,"threshold_uncertainty_score":0.11042436},"labels":[],"label_agreement":null},{"id":"W4402162138","doi":"10.1093/comnet/cnae035","title":"Performance of community detection algorithms supported by node embeddings","year":2024,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Community structure; Partition (number theory); Cluster analysis; Algorithm; Embedding; Complex network; Artificial intelligence; Mathematics","score_opus":0.01644240105669042,"score_gpt":0.28135729733893694,"score_spread":0.2649148962822465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402162138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6503716,0.00037923997,0.34739226,0.00006167955,0.0002279461,0.000075737706,0.000010663295,0.000047907222,0.001432947],"genre_scores_gemma":[0.9976342,0.000047816786,0.001508443,0.000032319444,0.0006330289,0.0000030057695,0.000033068587,0.000027038383,0.00008111911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842304,0.0001729885,0.0007826263,0.0000925495,0.0002806366,0.0002481365],"domain_scores_gemma":[0.99871314,0.00019615123,0.00048745528,0.0002590013,0.0002519463,0.000092301154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081149535,0.00018545185,0.00046172316,0.00018361528,0.00016092381,0.00007789387,0.0003829931,0.000057658788,0.00046335283],"category_scores_gemma":[0.000003710069,0.00016510008,0.00033254284,0.0005297533,0.00008726399,0.00025671904,0.00008977649,0.00092737813,0.0000027942613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022445004,0.00068895495,0.028866949,0.00015277206,0.0019231898,0.000009857923,0.00089360675,0.06064666,0.028212834,0.00065254857,0.17469177,0.7030364],"study_design_scores_gemma":[0.00031086302,0.00037013832,0.0051378235,0.00022840616,0.0002369413,0.00003124937,0.0001693248,0.96767837,0.0061628064,0.0010983627,0.01834236,0.00023335486],"about_ca_topic_score_codex":0.0001026627,"about_ca_topic_score_gemma":0.000004266688,"teacher_disagreement_score":0.9070317,"about_ca_system_score_codex":0.00005133745,"about_ca_system_score_gemma":0.000038573973,"threshold_uncertainty_score":0.6732586},"labels":[],"label_agreement":null},{"id":"W4402265031","doi":"10.1109/tqcebt59414.2024.10545096","title":"Multi-Layered Ontology Models for Dynamic Knowledge Representation in Social Network Analysis","year":2024,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Ontology; Computer science; Representation (politics); Social network analysis; Knowledge representation and reasoning; Knowledge management; Data science; Information retrieval; Artificial intelligence; World Wide Web; Social media","score_opus":0.043753362608853916,"score_gpt":0.3807175991185724,"score_spread":0.33696423650971846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402265031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01137832,0.00023597539,0.9827731,0.00017636338,0.00006327543,0.00028187278,0.000014063842,0.00015155064,0.0049254717],"genre_scores_gemma":[0.9764589,0.0000029454065,0.021242945,0.000011116624,0.00030582907,0.0001953141,0.0002520162,0.000017007344,0.0015139492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887073,0.00007656211,0.00032625525,0.0003888945,0.000058375957,0.00027920186],"domain_scores_gemma":[0.99954504,0.00015076347,0.000047843005,0.00017363692,0.000054731667,0.000027967246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021458649,0.0001339375,0.0003565997,0.00029644312,0.00009340237,0.000066542154,0.0001336177,0.00005324204,0.00015545521],"category_scores_gemma":[0.000001596435,0.00013126431,0.0004184646,0.0014700668,0.000023657774,0.00012108035,0.000056636618,0.00010823419,0.000008484009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000616342,0.00045444272,0.043152053,0.00003967645,0.004654279,0.0000032445791,0.0016158621,0.27518582,0.00030112956,0.5215581,0.01643856,0.13653521],"study_design_scores_gemma":[0.00016793731,0.000008054918,0.0016497516,0.000005948593,0.00034144102,4.8823917e-8,0.000093269446,0.8956608,0.00001440873,0.101526186,0.00040863157,0.00012350891],"about_ca_topic_score_codex":0.00050005683,"about_ca_topic_score_gemma":0.0036734724,"teacher_disagreement_score":0.96508056,"about_ca_system_score_codex":0.00006528433,"about_ca_system_score_gemma":0.00003423436,"threshold_uncertainty_score":0.53528035},"labels":[],"label_agreement":null},{"id":"W4402538968","doi":"10.1007/978-3-031-72260-8_1","title":"The Effect of News Dissemination on Infection Dynamics: An Evolutionary Epidemic Model in a Network Setting","year":2024,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dynamics (music); Computer science; Evolutionary dynamics; Epidemic model; Demography; Psychology; Sociology","score_opus":0.01260301993496556,"score_gpt":0.3160415232490798,"score_spread":0.30343850331411426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402538968","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011826598,0.0010156863,0.4400195,0.001135887,0.0004304239,0.0022431621,0.000081979684,0.00021014364,0.54303664],"genre_scores_gemma":[0.9906038,0.0006674722,0.0076727294,0.000036641613,0.00008283474,0.000083149345,0.00032955312,0.000012093479,0.0005117166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987751,0.000063485204,0.00063344097,0.00016574925,0.00021133269,0.0001508692],"domain_scores_gemma":[0.99804103,0.00060910074,0.00032122506,0.0008834735,0.0001136948,0.000031452782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015576034,0.0001581183,0.00020770598,0.00050614617,0.0003341718,0.00014786329,0.0006562077,0.00005838949,0.0000026850278],"category_scores_gemma":[0.000015278238,0.00012860885,0.00006106742,0.0004096361,0.00035169022,0.0013240145,0.0005317637,0.00043978146,0.000004677516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005641491,0.000007307542,0.003508698,0.000018973782,0.0000076099122,1.8774346e-8,0.00025688505,0.06798655,5.179158e-7,0.61474526,0.00024465212,0.31321788],"study_design_scores_gemma":[0.0000547785,0.00005702469,0.0010823227,0.00044090388,0.0000110647625,4.675845e-7,0.000009579947,0.93265724,0.0000017613667,0.06416041,0.0014192702,0.000105189196],"about_ca_topic_score_codex":0.000086407,"about_ca_topic_score_gemma":0.00010261505,"teacher_disagreement_score":0.9787772,"about_ca_system_score_codex":0.00020231969,"about_ca_system_score_gemma":0.00006672914,"threshold_uncertainty_score":0.5244517},"labels":[],"label_agreement":null},{"id":"W4402813091","doi":"10.1007/978-3-031-64373-6_4","title":"Network Induction","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on learning, networks, and algorithms","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; University of Guelph; Brock University; St. Francis Xavier University","funders":"","keywords":"Computer science","score_opus":0.010450429304070634,"score_gpt":0.22900751361021884,"score_spread":0.2185570843061482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402813091","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007735146,0.014698006,0.031733036,0.00042591168,0.0014415852,0.00074509624,0.000033268134,0.0011129936,0.9497327],"genre_scores_gemma":[0.18309605,0.001987812,0.0012138411,0.000303719,0.028408192,0.00020334759,0.00036454207,0.00062949245,0.78379303],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969869,0.00011396388,0.00058825087,0.0011809303,0.00042418775,0.00070574036],"domain_scores_gemma":[0.99812204,0.00060706935,0.0004488979,0.00054137385,0.00008136373,0.00019927257],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047097224,0.00095758145,0.0010704387,0.00029845946,0.0005237388,0.00035944904,0.00031666775,0.0005200103,0.0025238942],"category_scores_gemma":[0.000015320798,0.0008636598,0.00054920843,0.00016376225,0.00020238395,0.00006987501,0.0002015886,0.0024969508,0.00015427082],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049971517,0.000039296287,0.00021515493,0.000050232837,0.0015298232,0.00002605675,0.00008429301,0.045392647,0.0000018394827,0.19358064,0.07967192,0.6793581],"study_design_scores_gemma":[0.00009258278,0.00016267436,0.000046466594,0.0009837907,0.00076847704,0.000007830691,0.00001840695,0.023637312,0.000011943693,0.16192949,0.8112355,0.001105563],"about_ca_topic_score_codex":0.00007213243,"about_ca_topic_score_gemma":0.000010983707,"teacher_disagreement_score":0.73156357,"about_ca_system_score_codex":0.00007684887,"about_ca_system_score_gemma":0.000043536227,"threshold_uncertainty_score":0.9998043},"labels":[],"label_agreement":null},{"id":"W4403040363","doi":"10.22541/au.172777705.53121056/v1","title":"A space-for-time approach for evaluating community keystoneness in metacommunities under disturbance","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Disturbance (geology); Space (punctuation); Computer science; Spacetime; Ecology; Physics; Biology; Quantum mechanics","score_opus":0.09037297294437514,"score_gpt":0.3668602831977367,"score_spread":0.2764873102533616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403040363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12862307,0.0008255715,0.8280071,0.0002605184,0.0001248937,0.0031160484,0.0003777573,0.00037704495,0.038288016],"genre_scores_gemma":[0.88322425,0.0000030731505,0.10708041,0.000025847152,0.00022368698,0.0035906576,0.0019108077,0.00008390292,0.0038573628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773204,0.00059973437,0.0006016245,0.00044663053,0.00020889516,0.00041108648],"domain_scores_gemma":[0.99723196,0.0009403392,0.00025006064,0.001331466,0.00019690764,0.000049256396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002228654,0.00048855005,0.00097205787,0.00024963293,0.00032014571,0.00028512944,0.0009583195,0.00015230048,0.0001147757],"category_scores_gemma":[0.000016894686,0.00045942081,0.000652622,0.0002533724,0.000106031664,0.00005276259,0.0023542615,0.0015790971,0.0000043407304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025714634,0.002333514,0.004214176,0.0050473013,0.005533404,4.5523672e-7,0.008430033,0.19451916,0.0010127962,0.7339199,0.014515206,0.030216921],"study_design_scores_gemma":[0.0002925802,0.000041674874,0.00016867604,0.00026975232,0.00043954854,1.3790388e-7,0.0021590495,0.4710377,0.00038243306,0.524336,0.0003386375,0.00053383596],"about_ca_topic_score_codex":0.0051545952,"about_ca_topic_score_gemma":0.0001658562,"teacher_disagreement_score":0.7546012,"about_ca_system_score_codex":0.00017974057,"about_ca_system_score_gemma":0.00016150865,"threshold_uncertainty_score":0.9997858},"labels":[],"label_agreement":null},{"id":"W4403045105","doi":"10.1016/j.cor.2024.106857","title":"Influence optimization in networks: New formulations and valid inequalities","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematical optimization; Computer science; Inequality; Mathematics; Mathematical analysis","score_opus":0.05765346506212987,"score_gpt":0.3920126234720113,"score_spread":0.33435915840988145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403045105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0870275,0.00037660287,0.91099846,0.0005942324,0.000034523637,0.00027094156,0.0000037332836,0.00007925087,0.0006147801],"genre_scores_gemma":[0.9727669,0.00004303778,0.026269086,0.000022574015,0.00027508865,0.00005700456,0.000089197405,0.000013551989,0.000463579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988954,0.0001568642,0.00025044222,0.0002609696,0.00018869509,0.00024763469],"domain_scores_gemma":[0.9993103,0.00026082815,0.000007404524,0.00020671565,0.0001379937,0.00007674678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047765422,0.00009440703,0.00012235242,0.00044135028,0.0002441678,0.00065500673,0.0001558772,0.000029590543,0.00011041017],"category_scores_gemma":[0.000012553843,0.000094064235,0.000034376608,0.0011126652,0.000065483226,0.0004605971,0.00017054468,0.00027982486,0.000008422486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012238904,0.000014823572,0.001986433,0.000004913215,0.00001715266,9.301474e-7,0.00048283907,0.89194596,0.000012042855,0.09225864,0.0017352791,0.011539792],"study_design_scores_gemma":[0.000081022714,0.000020591398,0.0009055865,0.00008935656,0.000004995241,5.6380435e-7,0.00007744545,0.9929272,0.000023104834,0.004510685,0.0012660499,0.00009341297],"about_ca_topic_score_codex":0.001509019,"about_ca_topic_score_gemma":0.00018218704,"teacher_disagreement_score":0.8857394,"about_ca_system_score_codex":0.000054307933,"about_ca_system_score_gemma":0.00014237897,"threshold_uncertainty_score":0.6316245},"labels":[],"label_agreement":null},{"id":"W4403587905","doi":"10.1093/comnet/cnae041","title":"Modularity based community detection in hypergraphs","year":2024,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Modularity (biology); Computer science; Theoretical computer science; Evolutionary biology","score_opus":0.02080883243451563,"score_gpt":0.28173336459266696,"score_spread":0.2609245321581513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403587905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25965443,0.00047131677,0.7373991,0.00012838496,0.0002572368,0.000091114656,0.0000026718487,0.000054281678,0.0019414397],"genre_scores_gemma":[0.9974769,0.000008735391,0.0017766852,0.000058142887,0.0006305649,0.000004389613,0.000010181091,0.000020359934,0.000014087216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844056,0.00041680172,0.00058997865,0.00010764805,0.00021131885,0.00023366403],"domain_scores_gemma":[0.9990464,0.00029293913,0.00019259886,0.0002666497,0.00012072849,0.00008070228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011027602,0.00016142282,0.00036920502,0.00037528458,0.00012766094,0.00012636792,0.00032052243,0.000056104138,0.0002667495],"category_scores_gemma":[0.000006211457,0.00014685935,0.0003622497,0.0008117549,0.000053527277,0.0001811636,0.00005726073,0.0013138561,0.000002412228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018115611,0.0008921552,0.0763833,0.00006323368,0.000598838,0.000065643035,0.00027450526,0.4659853,0.0024309945,0.0089856945,0.009948504,0.43419066],"study_design_scores_gemma":[0.00032079808,0.00012162819,0.02731664,0.00018047303,0.00007608751,0.000010272893,0.00006627328,0.9398539,0.00026111072,0.023914037,0.0077009243,0.00017787432],"about_ca_topic_score_codex":0.00029125792,"about_ca_topic_score_gemma":0.00015956987,"teacher_disagreement_score":0.7378224,"about_ca_system_score_codex":0.00007358329,"about_ca_system_score_gemma":0.000048280053,"threshold_uncertainty_score":0.59887505},"labels":[],"label_agreement":null},{"id":"W4403694688","doi":"10.18280/ria.380501","title":"Clustering-Based: Assessing the Impact of Overlapping Nodes and Centrality Measures on Influencer Detection in Social Networks","year":2024,"lang":"en","type":"article","venue":"Revue d intelligence artificielle","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Centrality; Cluster analysis; Data mining; Social network analysis; Computer science; Cluster (spacecraft); Artificial intelligence; Social media; Statistics; Mathematics; Computer network; World Wide Web","score_opus":0.041757642060387026,"score_gpt":0.3471763242508679,"score_spread":0.3054186821904809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403694688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.504536,0.0001892375,0.49441445,0.000057248653,0.000043089047,0.000117061114,0.000002521822,0.00003378965,0.0006066539],"genre_scores_gemma":[0.99970174,0.0000080408145,0.000058585207,0.000009602666,0.00018118249,0.000014353506,0.000002737377,0.000011146483,0.000012623632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906003,0.00009827934,0.0003088876,0.00022880851,0.00009788861,0.00020610567],"domain_scores_gemma":[0.9994833,0.00020857848,0.000079824094,0.00016613804,0.000037920527,0.000024230678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047124256,0.00012648919,0.00017769844,0.00009576455,0.00014846036,0.00015522956,0.0001130816,0.000037970847,0.00006837747],"category_scores_gemma":[0.000010192478,0.00009509495,0.00016028182,0.00047371117,0.00008883603,0.00010826815,0.00004103716,0.00024277104,0.0000023363225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011600271,0.00004963602,0.018688127,0.000023180317,0.000042392774,9.1348574e-7,0.00041902042,0.77754676,0.0025055138,0.00086368975,0.000029756617,0.19981942],"study_design_scores_gemma":[0.000014008743,0.000027201058,0.0108157,0.00019897308,0.00001674941,4.055532e-7,0.00023603548,0.9799375,0.0068549695,0.0017377088,0.00006250615,0.00009825719],"about_ca_topic_score_codex":0.0007593922,"about_ca_topic_score_gemma":0.00006655523,"teacher_disagreement_score":0.49516577,"about_ca_system_score_codex":0.00007161194,"about_ca_system_score_gemma":0.000030623156,"threshold_uncertainty_score":0.38778594},"labels":[],"label_agreement":null},{"id":"W4403714735","doi":"10.1103/physreve.110.044315","title":"Bayan algorithm: Detecting communities in networks through exact and approximate optimization of modularity","year":2024,"lang":"en","type":"article","venue":"Physical review. E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; University of Toronto","funders":"","keywords":"Modularity (biology); Computer science; Algorithm; Theoretical computer science; Biology; Evolutionary biology","score_opus":0.020411925602562615,"score_gpt":0.3266422660660272,"score_spread":0.3062303404634646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403714735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026452245,0.012046022,0.95945233,0.0000556616,0.000023512031,0.00029323547,0.000008096027,0.000076770775,0.0015921204],"genre_scores_gemma":[0.98434955,0.0026512817,0.012710543,0.000026916585,0.00014649965,0.000044508666,0.000049220973,0.000017326107,0.0000041466456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915504,0.00014381601,0.00027675543,0.00016213338,0.00010062073,0.00016161213],"domain_scores_gemma":[0.9994407,0.0001817241,0.00007749055,0.00024022853,0.00003389065,0.000025960024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026802596,0.0001396428,0.00041376037,0.000034370416,0.000050965904,0.000040707677,0.00012152943,0.000016158174,0.00004149938],"category_scores_gemma":[0.0000044705284,0.000124104,0.00012694024,0.00039726283,0.000059462993,0.00017678076,0.00012462593,0.0002609743,8.0525643e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006181332,0.00048611462,0.005760209,0.0018056006,0.00027130972,0.0000026259006,0.0013263848,0.08046183,0.00009744672,0.08140534,0.0003200509,0.82805693],"study_design_scores_gemma":[0.00004633341,0.000017561135,0.00007933579,0.0012853427,0.00007339712,2.9390876e-7,0.0000805554,0.97499096,0.00014412781,0.022867104,0.00029946686,0.000115538875],"about_ca_topic_score_codex":0.0005304439,"about_ca_topic_score_gemma":0.000009266472,"teacher_disagreement_score":0.9578973,"about_ca_system_score_codex":0.000016047576,"about_ca_system_score_gemma":0.000009886834,"threshold_uncertainty_score":0.50608146},"labels":[],"label_agreement":null},{"id":"W4403774224","doi":"10.3389/fphy.2024.1431810","title":"Tensor networks for p-spin models","year":2024,"lang":"en","type":"article","venue":"Frontiers in Physics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; Alliance de recherche numérique du Canada; Ministère de l'Économie, de l’Innovation et des Exportations du Québec","keywords":"Tensor (intrinsic definition); Spin (aerodynamics); Physics; Theoretical physics; Mathematical physics; Mathematics; Computer science; Geometry","score_opus":0.01529042600600233,"score_gpt":0.2681434254868042,"score_spread":0.25285299948080187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403774224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007311004,0.0007902404,0.9930316,0.00006670693,0.00054135715,0.00029486007,0.000027311744,0.00014724977,0.0043695257],"genre_scores_gemma":[0.9260955,0.000018313718,0.07076074,0.00004618066,0.0019495006,0.00021881904,0.00011976722,0.000052433614,0.0007387615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990285,0.000021017679,0.00021986551,0.000322432,0.000093696224,0.00031446962],"domain_scores_gemma":[0.9995805,0.000044231212,0.00003796184,0.0002608525,0.00003495998,0.000041506853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011819768,0.0001700445,0.00027506833,0.0000726984,0.000054975288,0.00009213094,0.00019513637,0.000039494837,0.000016938666],"category_scores_gemma":[9.560787e-7,0.00017082975,0.00023556814,0.00041380548,0.000039900297,0.00019168091,0.000047115052,0.00018941356,0.0000032487253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001657386,0.00008856641,0.0039940476,0.000029261382,0.00021878412,0.0000017942863,0.00016025265,0.10680075,0.000013402714,0.26755607,0.25881815,0.36230233],"study_design_scores_gemma":[0.000079503305,0.000010435362,0.00002011657,0.000034793757,0.00003187647,4.3851532e-8,0.000035045065,0.61383414,0.000058203397,0.3734978,0.012271527,0.00012650738],"about_ca_topic_score_codex":0.00003264325,"about_ca_topic_score_gemma":0.0000013897206,"teacher_disagreement_score":0.9253644,"about_ca_system_score_codex":0.000054100714,"about_ca_system_score_gemma":0.00003107522,"threshold_uncertainty_score":0.6966235},"labels":[],"label_agreement":null},{"id":"W4403978525","doi":"10.1016/j.heliyon.2024.e40031","title":"Budget-aware local influence iterative algorithm for efficient influence maximization in social networks","year":2024,"lang":"en","type":"article","venue":"Heliyon","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Maximization; Computer science; Algorithm; Mathematical optimization; Management science; Mathematics; Economics","score_opus":0.007111849545910799,"score_gpt":0.27400236575463954,"score_spread":0.2668905162087287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403978525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09008927,0.00038369262,0.90876985,0.00006030687,0.00006237378,0.00033876213,0.000030215699,0.000119530734,0.00014600014],"genre_scores_gemma":[0.99629104,0.000010653827,0.0028609228,0.000062274456,0.00041334136,0.00019624666,0.000081325066,0.000023845127,0.00006035461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988922,0.000053434345,0.00029771272,0.0003469584,0.00012128916,0.00028840097],"domain_scores_gemma":[0.9995497,0.00010354263,0.00005756492,0.0001270114,0.00012293857,0.000039278675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016962756,0.00017213523,0.00020418275,0.0001391664,0.00016033478,0.0001454719,0.00011746298,0.00006582741,0.00004445239],"category_scores_gemma":[0.0000028321913,0.00017194696,0.0001153432,0.0005927978,0.000062105806,0.00013931385,0.00006815203,0.0002090712,0.000009810927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001381212,0.00009781518,0.0021172136,0.000089062654,0.00007438598,0.00004258336,0.00090154517,0.56917846,0.00006349112,0.011606565,0.0004394114,0.41537565],"study_design_scores_gemma":[0.00016634299,0.00003130401,0.00089653966,0.00024764033,0.000029334353,0.0000036794231,0.00012825867,0.99502784,0.00028167182,0.0013759016,0.0016071463,0.00020435004],"about_ca_topic_score_codex":0.00006502225,"about_ca_topic_score_gemma":0.000020439935,"teacher_disagreement_score":0.9062018,"about_ca_system_score_codex":0.00009108106,"about_ca_system_score_gemma":0.000042979602,"threshold_uncertainty_score":0.7011793},"labels":[],"label_agreement":null},{"id":"W4404057416","doi":"10.23919/aeit63317.2024.10736765","title":"Node Centrality Evaluation Based on Complex Network Theory: A Real Case Study for an Integrated Power Distribution and ICT System","year":2024,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Centrality; Node (physics); Information and Communications Technology; Computer science; Complex network; Network theory; Power (physics); Computer network; Telecommunications; Engineering; World Wide Web; Mathematics","score_opus":0.04263770326374152,"score_gpt":0.3490131215155224,"score_spread":0.3063754182517809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404057416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45859873,0.000011275398,0.5375227,0.000032475436,0.00007233522,0.0015205764,0.00022289254,0.0003150892,0.0017039608],"genre_scores_gemma":[0.9971511,1.3785942e-7,0.0007867974,0.000013797962,0.00017616242,0.00022395479,0.0016096162,0.00001773131,0.00002070389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983555,0.00055051094,0.00027400415,0.00040104866,0.0001895175,0.00022942544],"domain_scores_gemma":[0.9991692,0.00022126817,0.00005919764,0.0003152435,0.00015780242,0.000077309145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017320841,0.00018329946,0.00023391758,0.000040434472,0.0002071052,0.00020461327,0.00007165538,0.000030349605,0.00019540668],"category_scores_gemma":[0.000004978237,0.0001434327,0.000098302364,0.00028362146,0.000026391059,0.00008952848,0.000023408607,0.00010237054,0.0000021330798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080865604,0.0022786732,0.06299917,0.00014402767,0.0012434993,0.000082873,0.0011201341,0.021420378,0.000089655434,0.7833199,0.02763524,0.09885781],"study_design_scores_gemma":[0.00045088754,0.0003459933,0.0029082617,0.00006086149,0.0003563202,0.00000400008,0.002677116,0.98984206,0.000013797836,0.0025326253,0.0006344959,0.00017356663],"about_ca_topic_score_codex":0.0016749167,"about_ca_topic_score_gemma":0.0002419885,"teacher_disagreement_score":0.9684217,"about_ca_system_score_codex":0.000156275,"about_ca_system_score_gemma":0.000056149962,"threshold_uncertainty_score":0.5849016},"labels":[],"label_agreement":null},{"id":"W4404306862","doi":"10.1371/journal.pone.0308787","title":"Assessing spatial structure in marine populations using network theory: A case study of Atlantic sea scallop (Placopecten magellanicus) connectivity","year":2024,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bedford Institute of Oceanography; Fisheries and Oceans Canada; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Metapopulation; Biology; Population; Ecology; Fishery; Oceanography; Biological dispersal; Geology","score_opus":0.061769656314644594,"score_gpt":0.3113263452478515,"score_spread":0.24955668893320693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404306862","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99190545,0.000025705378,0.007275073,0.000010169513,0.000031827618,0.00043784283,0.000014939637,0.00008012057,0.00021887524],"genre_scores_gemma":[0.9948097,3.8111276e-7,0.0046839262,0.0000029899322,0.000395193,0.0000109786115,0.000055601096,0.00002884484,0.000012369989],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998646,0.00028762623,0.0003304245,0.00030852645,0.00019914586,0.00022825517],"domain_scores_gemma":[0.9993319,0.00017754897,0.000104898696,0.00028418878,0.0000603009,0.000041193955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028812428,0.00017005867,0.00041298365,0.0001410188,0.00011544543,0.00014345735,0.00010372081,0.000036649777,0.00047098155],"category_scores_gemma":[0.000009797533,0.00016227712,0.00006860929,0.00064857217,0.000025137502,0.0001562874,0.00018801939,0.0002758849,0.0000010202581],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016335043,0.0010622856,0.98705244,0.00004895208,0.00052051747,0.00020544128,0.0003427525,0.0043229205,0.0014531601,0.0018843536,0.000011264447,0.0030795478],"study_design_scores_gemma":[0.0010897759,0.00024594227,0.17664815,0.0010037324,0.0026529424,0.000053430296,0.0023981256,0.7590551,0.001146409,0.05490206,0.00000510524,0.00079924177],"about_ca_topic_score_codex":0.019976545,"about_ca_topic_score_gemma":0.010021347,"teacher_disagreement_score":0.8104043,"about_ca_system_score_codex":0.00005740603,"about_ca_system_score_gemma":0.00004474324,"threshold_uncertainty_score":0.9865495},"labels":[],"label_agreement":null},{"id":"W4404313856","doi":"10.48550/arxiv.2410.20240","title":"Centrality and shape-related comparisons in a tree-structured Markov random field","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Université Laval","keywords":"Centrality; Markov chain; Tree (set theory); Field (mathematics); Topology (electrical circuits); Computer science; Mathematics; Statistical physics; Statistics; Physics; Combinatorics; Pure mathematics","score_opus":0.03035323834244005,"score_gpt":0.20229317730383187,"score_spread":0.1719399389613918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404313856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9784235,0.0002287106,0.01000631,0.00015325577,0.00016629985,0.00043897098,0.00006113964,0.00017094829,0.010350894],"genre_scores_gemma":[0.99877083,0.000047431055,0.0002005618,0.00001981614,0.00007343358,0.0000022051631,0.000097438664,0.000021324135,0.00076696824],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983251,0.00016490152,0.00030677035,0.0008283558,0.000056338602,0.0003185367],"domain_scores_gemma":[0.99901366,0.00015196683,0.00016159264,0.00051783555,0.000038020855,0.00011689961],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017596169,0.00033864187,0.0006049662,0.00025089397,0.00006917472,0.00006398078,0.00037838897,0.00021012523,0.00065020117],"category_scores_gemma":[0.0000052462415,0.00037588205,0.00031647342,0.00047984754,0.00008983114,0.00005096206,0.0010970478,0.0010863205,0.000011671367],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061988883,0.0003704062,0.7475966,0.00028110138,0.002095675,0.0003168708,0.0006846654,0.030454004,0.000085014006,0.18898779,0.010329003,0.018178951],"study_design_scores_gemma":[0.0017530576,0.000028389219,0.019670015,0.00034036633,0.00065301405,0.0000010329496,0.00020318676,0.66599786,0.0001296856,0.30991623,0.0005900998,0.0007170721],"about_ca_topic_score_codex":0.001656802,"about_ca_topic_score_gemma":0.00061979395,"teacher_disagreement_score":0.7279266,"about_ca_system_score_codex":0.00008728747,"about_ca_system_score_gemma":0.00006919322,"threshold_uncertainty_score":0.9998693},"labels":[],"label_agreement":null},{"id":"W4404650023","doi":"10.1103/9dxz-k5wb","title":"Real-time scattering in Ising field theory using matrix product states","year":2025,"lang":"en","type":"preprint","venue":"Physical Review Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Thomas Jefferson National Accelerator Facility; Air Force Office of Scientific Research; Fermilab; High Energy Physics; Government of Canada; Institute for Quantum Information and Matter, California Institute of Technology; Office of Science; Natural Sciences and Engineering Research Council of Canada; Institut Périmètre de physique théorique; Simons Foundation; ICTP South American Institute for Fundamental Research; Advanced Scientific Computing Research; U.S. Department of Energy; Abdus Salam International Centre for Theoretical Physics; National Science Foundation; Fundação de Amparo à Pesquisa do Estado de São Paulo; Heising-Simons Foundation","keywords":"Ising model; Field (mathematics); Scattering; Matrix (chemical analysis); Statistical physics; Product (mathematics); Physics; S-matrix; Quantum electrodynamics; Mathematics; Quantum mechanics; Materials science; Pure mathematics; Geometry","score_opus":0.07434941631421256,"score_gpt":0.49076766067836236,"score_spread":0.4164182443641498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404650023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8146052,0.07957139,0.014831074,0.005862244,0.00032618453,0.012301567,0.0002646846,0.0006704522,0.07156724],"genre_scores_gemma":[0.97004634,0.018041497,0.005696477,0.00012091544,0.002417001,0.0007931186,0.00032435553,0.00011331662,0.0024469646],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99567366,0.0013944712,0.0006106744,0.0009455833,0.0006443792,0.0007312519],"domain_scores_gemma":[0.99684894,0.001291291,0.00017666737,0.0012876466,0.00029646125,0.0000990157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030945586,0.00036694785,0.001154059,0.00035743535,0.00014756105,0.00016394381,0.00089748896,0.00004861342,0.00043724285],"category_scores_gemma":[0.00014346493,0.00033891608,0.00044256373,0.0010903054,0.00011790227,0.00008839184,0.0026859248,0.0019292813,0.000056996912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020134386,0.0026762753,0.010759625,0.038855843,0.0015506676,0.000050572784,0.0012544685,0.0061361645,0.035488173,0.08817724,0.03602843,0.7788212],"study_design_scores_gemma":[0.00021966874,0.000072094655,0.0002641436,0.058612548,0.0003843544,6.829272e-7,0.00006154661,0.0956775,0.009146644,0.82881975,0.0055153095,0.0012257441],"about_ca_topic_score_codex":0.002133978,"about_ca_topic_score_gemma":0.000005262512,"teacher_disagreement_score":0.77759546,"about_ca_system_score_codex":0.00020256451,"about_ca_system_score_gemma":0.00032813087,"threshold_uncertainty_score":0.9999063},"labels":[],"label_agreement":null},{"id":"W4404705110","doi":"10.3389/fenvs.2024.1478864","title":"Structural characteristics and mechanism of collaborative environmental governance network of urban agglomerations: perspective of multilevel network","year":2024,"lang":"en","type":"article","venue":"Frontiers in Environmental Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Urban agglomeration; Exponential random graph models; Collaborative governance; Corporate governance; Economic geography; Social network analysis; Urban network; Geography; Business; Regional science; Computer science; Random graph; Political science; Social capital; Graph","score_opus":0.0037510752689347442,"score_gpt":0.2142159074775668,"score_spread":0.21046483220863205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404705110","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9750187,0.0025639038,0.020798378,0.000020998872,0.00031451418,0.00038288548,0.00047985837,0.000010380575,0.00041037574],"genre_scores_gemma":[0.98176736,0.00016765318,0.017886985,0.0000044071758,0.00009444032,0.000012807985,0.000017779004,0.000010141124,0.0000384525],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986472,0.000043492342,0.00038065703,0.0003595326,0.00032401248,0.00024510385],"domain_scores_gemma":[0.99945164,0.000040968345,0.0002577218,0.00018938271,0.000009861738,0.00005044877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024071384,0.00015717202,0.0003328373,0.00005391784,0.00009214401,0.000019092253,0.00023107357,0.000030312303,0.00009612883],"category_scores_gemma":[0.0000047379267,0.00015517918,0.00006129463,0.00043601764,0.0010987583,0.0002571585,0.00018628707,0.00012096719,4.5191473e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006115716,0.00017814555,0.8096366,0.00003018083,0.0001939268,0.0000031730976,0.0042674094,0.0034573507,0.027981078,0.12893352,0.0008822988,0.024375176],"study_design_scores_gemma":[0.0005233812,0.0002940936,0.68495005,0.00034365972,0.00013569267,0.000001806159,0.00552393,0.21992527,0.020297106,0.067071624,0.00035371716,0.0005796637],"about_ca_topic_score_codex":0.00005614317,"about_ca_topic_score_gemma":0.0000023581997,"teacher_disagreement_score":0.21646792,"about_ca_system_score_codex":0.00022712284,"about_ca_system_score_gemma":0.000047185727,"threshold_uncertainty_score":0.6328023},"labels":[],"label_agreement":null},{"id":"W4404905522","doi":"10.1016/j.tcs.2024.115012","title":"Self-similarity of communities of the ABCD model","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Similarity (geometry); Computer science; Mathematics; Natural language processing; Artificial intelligence","score_opus":0.011179257432995353,"score_gpt":0.2644708579249312,"score_spread":0.25329160049193583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404905522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16849422,0.000021411637,0.819473,0.00018886558,0.000066242144,0.00007965637,0.000008113627,0.00006380664,0.011604677],"genre_scores_gemma":[0.96589607,0.0000012700332,0.034026273,0.000023855322,0.00004103729,0.0000021199396,5.519992e-7,0.0000040154596,0.000004791952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920213,0.00006348365,0.00018598109,0.0001233177,0.00027566875,0.00014942094],"domain_scores_gemma":[0.9991849,0.00015235855,0.000038075257,0.0004956459,0.00009611972,0.000032921886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964026,0.000075893186,0.00014691433,0.00005849106,0.00011935016,0.00005160617,0.00097143365,0.000012599437,0.00007102679],"category_scores_gemma":[0.0000017379517,0.000048505022,0.00011514077,0.0005702892,0.0022134567,0.00008574202,0.0006644639,0.000145517,0.0000013049626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.818763e-7,0.000036714966,0.0005058846,0.000013070636,0.000012301548,4.8970936e-8,0.0005763371,0.0010196979,0.00015411955,0.9947271,0.000044585482,0.0029092017],"study_design_scores_gemma":[0.000013758668,0.00001240719,0.00011977135,0.00003282739,0.000014019754,1.985875e-7,0.000013529181,0.6425778,0.004435815,0.35271418,0.00002967943,0.000035989837],"about_ca_topic_score_codex":0.000020582675,"about_ca_topic_score_gemma":9.641361e-7,"teacher_disagreement_score":0.79740185,"about_ca_system_score_codex":0.000011145609,"about_ca_system_score_gemma":0.00008154939,"threshold_uncertainty_score":0.8155573},"labels":[],"label_agreement":null},{"id":"W4404924945","doi":"10.1038/s41598-024-78626-6","title":"Integrating graph and reinforcement learning for vaccination strategies in complex networks","year":2024,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Memorial University of Newfoundland; Queen's University","funders":"","keywords":"Computer science; Reinforcement learning; Scalability; Pandemic; Artificial intelligence; Consistency (knowledge bases); Complex network; Data science; Distributed computing; Machine learning; Coronavirus disease 2019 (COVID-19); Infectious disease (medical specialty); Disease; Medicine","score_opus":0.016517421145796202,"score_gpt":0.29282579836908595,"score_spread":0.27630837722328977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404924945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12060508,0.000326033,0.87167054,0.000055203833,0.00067651266,0.00045735756,3.5699543e-7,0.00014923309,0.0060596876],"genre_scores_gemma":[0.99750245,0.000002093121,0.0015271901,0.0000023424436,0.00009835222,0.0000693803,0.00020235476,0.000009851263,0.0005859871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988707,0.000024561323,0.00037337246,0.00040810314,0.00012768287,0.00019562627],"domain_scores_gemma":[0.99956214,0.00005648858,0.00011162413,0.0001724141,0.00006617333,0.000031160867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009885711,0.00010301731,0.0001383004,0.00022250196,0.00020943003,0.0008764952,0.000049847145,0.000020247788,0.00014104151],"category_scores_gemma":[0.000008445172,0.00009338219,0.00007573124,0.00050120923,0.000035966554,0.00024459424,0.00004876194,0.00013303637,4.95302e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012519015,0.000072894734,0.085447386,0.00017449573,0.00017933546,0.000061932784,0.002391106,0.32953608,0.0043899994,0.2685724,0.026757322,0.28240454],"study_design_scores_gemma":[0.000051235776,0.000021944901,0.0017238177,0.000083385756,0.000021252215,0.0000035697192,0.0007242485,0.80310917,0.00024168413,0.17947337,0.014404519,0.00014181224],"about_ca_topic_score_codex":0.000099914425,"about_ca_topic_score_gemma":0.00006613211,"teacher_disagreement_score":0.8768974,"about_ca_system_score_codex":0.000025259467,"about_ca_system_score_gemma":0.00004121493,"threshold_uncertainty_score":0.8452064},"labels":[],"label_agreement":null},{"id":"W4405115610","doi":"10.1177/00375497241298962","title":"Analyzing the parallelization and structural impact of machine learning algorithms in social networks: a simulation-based approach","year":2024,"lang":"en","type":"article","venue":"SIMULATION","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Machine learning; Cluster analysis; Similarity (geometry); Artificial intelligence; Support vector machine; Artificial neural network; Context (archaeology); Social network (sociolinguistics); Algorithm; Perceptron; Social media; Data mining; World Wide Web","score_opus":0.016640310844806803,"score_gpt":0.32485219732605225,"score_spread":0.3082118864812454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405115610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2424579,0.00019696636,0.7570659,0.00001190386,0.000009999575,0.00013787193,0.0000036385024,0.000038533486,0.00007730691],"genre_scores_gemma":[0.99896306,0.0000010252254,0.0005443903,0.0000016916465,0.0002229975,0.0000062658,0.00023998447,0.000012673119,0.000007918295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992929,0.00011103396,0.00023111522,0.00016067586,0.000090095906,0.000114190196],"domain_scores_gemma":[0.9994343,0.00034540475,0.00009096135,0.00007125486,0.00004381531,0.000014285643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021409028,0.00010485283,0.0001474721,0.00012639232,0.00012856047,0.000082059545,0.000050094237,0.00003164225,0.000047998918],"category_scores_gemma":[0.0000090143085,0.00007705676,0.00010774308,0.00054000836,0.000027701899,0.00012718844,0.00002032224,0.00015430288,1.8987436e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000894324,0.000006309908,0.13553546,0.00000583584,0.000040113166,6.5904125e-8,0.00019432111,0.8373516,0.0000075235016,0.0005591433,0.000001636715,0.026289014],"study_design_scores_gemma":[0.00013816923,0.000015179535,0.032009523,0.000014789714,0.000036202662,2.1727859e-8,0.000021665548,0.9654257,0.0000026375278,0.0022484276,0.000013109799,0.00007452869],"about_ca_topic_score_codex":0.00028332204,"about_ca_topic_score_gemma":0.000006541494,"teacher_disagreement_score":0.75652146,"about_ca_system_score_codex":0.00003875234,"about_ca_system_score_gemma":0.00002058469,"threshold_uncertainty_score":0.31422833},"labels":[],"label_agreement":null},{"id":"W4405248633","doi":"10.1038/s43588-024-00735-z","title":"A simulated annealing algorithm for randomizing weighted networks","year":2024,"lang":"en","type":"article","venue":"Nature Computational Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"Fonds de recherche du Québec – Nature et technologies; Canadian Institutes of Health Research; Canada Research Chairs; Government of Canada; Natural Sciences and Engineering Research Council of Canada; Fondation Brain Canada; Michael J. Fox Foundation for Parkinson's Research","keywords":"Simulated annealing; Algorithm; Computer science","score_opus":0.005995640519837306,"score_gpt":0.3093278762039367,"score_spread":0.3033322356840994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405248633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053922865,0.0007075544,0.99250364,0.00017307219,0.00029879005,0.00026916192,0.000016257993,0.00018761297,0.0004516246],"genre_scores_gemma":[0.8820766,8.105874e-7,0.11711535,0.000079999714,0.00057756423,0.000014499845,0.00009735792,0.000010430245,0.000027388302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879634,0.000020772059,0.00020057055,0.0003948984,0.00031526625,0.0002721623],"domain_scores_gemma":[0.9987599,0.000733921,0.00004942925,0.00009775707,0.00028825185,0.00007070911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006238287,0.00012153801,0.00015750785,0.00018752419,0.00035150305,0.0003021412,0.0002671365,0.000053134045,0.000051552637],"category_scores_gemma":[0.000014344955,0.00010485622,0.0001370302,0.0014232574,0.000115105766,0.00022442156,0.00006287083,0.00030436728,0.000003381839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013829506,0.000020682326,0.00016502799,0.000004714799,0.00006574588,0.0000016676809,0.00005464865,0.5870686,0.00007878616,0.07448095,0.0010742607,0.33697107],"study_design_scores_gemma":[0.00033277992,0.000009897609,0.00010181993,0.000041078554,0.00002317281,8.1599734e-7,0.0000059445942,0.93089086,0.00010955923,0.066297285,0.002066069,0.00012074554],"about_ca_topic_score_codex":0.000012289074,"about_ca_topic_score_gemma":5.037474e-7,"teacher_disagreement_score":0.8766843,"about_ca_system_score_codex":0.00005075916,"about_ca_system_score_gemma":0.00013930126,"threshold_uncertainty_score":0.42759126},"labels":[],"label_agreement":null},{"id":"W4405304259","doi":"10.1109/besc64747.2024.10780611","title":"Line Graph is the Key: An Exploration of Line Graph on Link Prediction with Social Networks","year":2024,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Link (geometry); Line graph; Graph; Key (lock); Theoretical computer science; Computer network; Computer security","score_opus":0.02838902565234371,"score_gpt":0.2805598306204978,"score_spread":0.2521708049681541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405304259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026994782,0.00008178421,0.96681064,0.0021850467,0.00008848973,0.0002788856,0.0000270379,0.00027829406,0.0032550623],"genre_scores_gemma":[0.9967759,0.000024138419,0.000642916,0.00010520614,0.0019295124,0.00005284779,0.0002236552,0.000022831811,0.000222992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991,0.00006112967,0.00025469184,0.00024639262,0.00019206053,0.00014570936],"domain_scores_gemma":[0.99949557,0.00004816566,0.000082237355,0.00024870015,0.00009334135,0.000031976455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020352419,0.00014937898,0.00017143886,0.00011348181,0.00014989836,0.00009084867,0.00013204363,0.000047240992,0.00022401226],"category_scores_gemma":[5.596217e-7,0.00009245291,0.00015648428,0.00068519573,0.00006440904,0.00033462016,0.000026936948,0.00023310004,0.0000032187274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030934004,0.0007229535,0.0059532924,0.000042597752,0.0016045815,0.0000023853472,0.0053250375,0.08561735,0.00035221942,0.4100778,0.04734875,0.4426437],"study_design_scores_gemma":[0.00045270033,0.0014323238,0.0012015413,0.00017113349,0.00054542965,4.6762e-7,0.0008808701,0.8532297,0.003584437,0.12565334,0.012426304,0.0004217521],"about_ca_topic_score_codex":0.00013009744,"about_ca_topic_score_gemma":0.000062406514,"teacher_disagreement_score":0.9697811,"about_ca_system_score_codex":0.000009968963,"about_ca_system_score_gemma":0.000020574666,"threshold_uncertainty_score":0.37701204},"labels":[],"label_agreement":null},{"id":"W4405612461","doi":"10.2139/ssrn.5008213","title":"A Simple Formulation for Causal Clustering","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Simple (philosophy); Cluster analysis; Computer science; Mathematics; Econometrics; Artificial intelligence; Epistemology; Philosophy","score_opus":0.013732941065052082,"score_gpt":0.29941438087139505,"score_spread":0.285681439806343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405612461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02416106,0.0011442039,0.9720929,0.00018789656,0.00032013404,0.00047011452,0.00003830202,0.00012516578,0.0014601714],"genre_scores_gemma":[0.9936561,0.000092609334,0.0019566861,0.000011056666,0.0029676135,0.000106615145,0.00019691953,0.00007471106,0.0009377108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717695,0.000040753224,0.0004741877,0.00036733082,0.00019953256,0.001741243],"domain_scores_gemma":[0.9991743,0.000052223306,0.0002959893,0.0002872653,0.00012547777,0.0000647395],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010528936,0.0003073856,0.00038352824,0.0002140431,0.00019466897,0.0002743554,0.00035260318,0.000113496906,0.000091642636],"category_scores_gemma":[0.0000045185316,0.0002954164,0.0006076718,0.0001246463,0.0000078563,0.00006321218,0.000547146,0.0032862066,0.000011316761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048124082,0.000045944384,0.0013013335,0.00008210264,0.0017894215,9.821289e-7,0.0001290474,0.0051727644,0.00013955988,0.8296447,0.002137389,0.15950865],"study_design_scores_gemma":[0.00018050006,0.0000764018,0.000026688094,0.00007421864,0.00031477367,0.000009859698,0.00014205334,0.059299167,0.00007077931,0.9364009,0.0031277633,0.0002769135],"about_ca_topic_score_codex":0.00023998834,"about_ca_topic_score_gemma":0.00070178264,"teacher_disagreement_score":0.9701363,"about_ca_system_score_codex":0.00084496697,"about_ca_system_score_gemma":0.0015791976,"threshold_uncertainty_score":0.9999498},"labels":[],"label_agreement":null},{"id":"W4405778888","doi":"10.1109/tnse.2024.3520967","title":"Self-Liking Group in Networks With Multi-Class Nodes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Israel Science Foundation; National Natural Science Foundation of China","keywords":"Class (philosophy); Group (periodic table); Computer science; Mathematics; Theoretical computer science; Artificial intelligence; Physics","score_opus":0.0070051974199761375,"score_gpt":0.21998365669412767,"score_spread":0.21297845927415154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405778888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028478751,0.00022176649,0.97032684,0.000025845347,0.000228812,0.000121806785,0.0000011082103,0.00029855059,0.00029653785],"genre_scores_gemma":[0.9851002,0.0000451959,0.014565984,0.000016087999,0.00017982197,0.000049853264,7.834331e-7,0.000021691718,0.000020397873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988304,0.000009977761,0.00016200634,0.00036749925,0.00019449698,0.00043564758],"domain_scores_gemma":[0.9996249,0.00007963223,0.000016526352,0.00016519777,0.000027250353,0.00008649951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038583533,0.00017340487,0.0001600572,0.00025314352,0.00019796926,0.00022451452,0.0001552538,0.000029610683,0.0000148397285],"category_scores_gemma":[3.571234e-7,0.00015248517,0.000045558754,0.001831698,0.000072853305,0.00033256097,0.0000034864777,0.00033908946,0.0000020770647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033002386,0.000033644894,0.0003261647,0.000012188444,0.000030928233,0.0000043543114,0.00010180626,0.9785548,0.00015446692,0.0012442741,0.000019631572,0.019514455],"study_design_scores_gemma":[0.000107910084,0.000028715183,0.0003323389,0.00021190048,0.00002762835,0.0000028079207,0.0000309887,0.9978425,0.00015649835,0.000032861313,0.001034815,0.00019107436],"about_ca_topic_score_codex":0.000050875722,"about_ca_topic_score_gemma":0.000043908207,"teacher_disagreement_score":0.9566214,"about_ca_system_score_codex":0.00007146301,"about_ca_system_score_gemma":0.00004297176,"threshold_uncertainty_score":0.62181646},"labels":[],"label_agreement":null},{"id":"W4405907754","doi":"10.1109/wf-iot62078.2024.10811363","title":"Temporal Dual-Attention Graph Network for Popularity Prediction in MEC Networks","year":2024,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Popularity; Dual (grammatical number); Graph; Dual graph; Theoretical computer science; Line graph; Psychology","score_opus":0.012079896569215364,"score_gpt":0.26921980690301384,"score_spread":0.25713991033379846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405907754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022081953,0.00029963593,0.9725792,0.00018059336,0.00039914774,0.00049767975,0.000021957518,0.00037819936,0.0035616416],"genre_scores_gemma":[0.991029,0.0000051474585,0.0055100983,0.000030722338,0.0014509893,0.00018920808,0.000644661,0.000023802944,0.0011163696],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988358,0.000050306156,0.00035339777,0.0003380439,0.00010778158,0.00031467623],"domain_scores_gemma":[0.9996157,0.00005430632,0.000047142024,0.00019973713,0.000036349236,0.000046740923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044112603,0.00015392785,0.00020806334,0.00012673097,0.00009422969,0.000121282115,0.000081600534,0.000062573476,0.00029630418],"category_scores_gemma":[0.0000013310545,0.00014477008,0.00026030245,0.00062858,0.000018836874,0.00017551339,0.00004547974,0.00019561677,0.00000629942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025819663,0.000118628646,0.5567997,0.00002593027,0.00020986,0.0000026215,0.000024054008,0.025427436,0.000027782204,0.23414089,0.1551779,0.028019378],"study_design_scores_gemma":[0.00022791231,0.000057508598,0.022699798,0.000104316874,0.00010390051,7.0374136e-7,0.00003438314,0.7751918,0.00001597907,0.18145706,0.01987808,0.00022856196],"about_ca_topic_score_codex":0.00073946855,"about_ca_topic_score_gemma":0.0003605524,"teacher_disagreement_score":0.96894705,"about_ca_system_score_codex":0.000035926405,"about_ca_system_score_gemma":0.000018401395,"threshold_uncertainty_score":0.5903552},"labels":[],"label_agreement":null},{"id":"W4406044965","doi":"10.3389/fphy.2024.1509905","title":"A homophilic and dynamic influence maximization strategy based on independent cascade model in social networks","year":2025,"lang":"en","type":"article","venue":"Frontiers in Physics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Cascade; Maximization; Computer science; Mathematical optimization; Chemistry; Mathematics","score_opus":0.005922439999187931,"score_gpt":0.25208908034463046,"score_spread":0.24616664034544253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406044965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18354322,0.000052929456,0.81449735,0.000059413233,0.000043633314,0.00023122868,0.00000864668,0.0000312921,0.0015322677],"genre_scores_gemma":[0.9972574,0.000008475049,0.0024022646,0.000093523915,0.00006290923,0.00005774144,0.00005146849,0.000013980169,0.000052196625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902767,0.0000614747,0.00024056954,0.0003049198,0.00012232034,0.00024306249],"domain_scores_gemma":[0.9996607,0.000021842396,0.00008127627,0.00018293603,0.00002848564,0.000024803827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010879992,0.00017200666,0.00027462657,0.00018652462,0.00008258905,0.000049950657,0.0001574031,0.000071704606,0.0000023271639],"category_scores_gemma":[0.0000017680035,0.00019734533,0.00006139293,0.000666683,0.000056513298,0.00011680597,0.00005673187,0.00032859,2.3952833e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000244832,0.00011274882,0.061788995,0.0000076102733,0.000019796407,8.960181e-7,0.00006593544,0.8853456,0.000011795855,0.0080403285,0.0004647369,0.044117108],"study_design_scores_gemma":[0.00038766037,0.000010817197,0.015256802,0.00004313326,0.000017390712,1.5007712e-8,0.000052640007,0.8524216,0.000023397055,0.13164374,0.000008918074,0.00013392135],"about_ca_topic_score_codex":0.000095005,"about_ca_topic_score_gemma":0.00003498573,"teacher_disagreement_score":0.8137142,"about_ca_system_score_codex":0.00013816149,"about_ca_system_score_gemma":0.00007410535,"threshold_uncertainty_score":0.8047509},"labels":[],"label_agreement":null},{"id":"W4406171816","doi":"10.61091/um121-02","title":"Monophonic Cover Pebbling Number \\((MCPN)\\) of Network Graphs","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cover (algebra); Combinatorics; Discrete mathematics","score_opus":0.01254283087564875,"score_gpt":0.28314370605872896,"score_spread":0.27060087518308024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406171816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45643598,0.0044094673,0.15642722,0.0003668234,0.0005515432,0.001117565,0.00012131324,0.0011363864,0.37943372],"genre_scores_gemma":[0.98789746,0.000009280166,0.010980431,0.000017883503,0.00021719112,0.000034876128,0.000021839409,0.000035435114,0.0007856249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866813,0.000046987516,0.00046979837,0.0002829089,0.0002169379,0.00031523404],"domain_scores_gemma":[0.9989972,0.00030834152,0.00008572852,0.0004928299,0.000052245723,0.00006362477],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037389697,0.00019626538,0.00038596246,0.00005517783,0.0000643672,0.00006654954,0.00023808856,0.000039911767,0.008006276],"category_scores_gemma":[0.000009972771,0.0001716102,0.0003656499,0.0005920202,0.000072942545,0.00010202303,0.00011626311,0.00017241522,0.00046706296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007793728,0.00014975418,0.0094217,0.0002117689,0.0005381409,0.0000025121412,0.00059515226,0.00014289157,0.000097411335,0.90497005,0.07497208,0.008890759],"study_design_scores_gemma":[0.000106504216,0.000022405093,0.00035185757,0.00056017214,0.0002393143,0.0000021431308,0.00014771102,0.04513179,0.0004008111,0.93860525,0.014165926,0.00026610063],"about_ca_topic_score_codex":0.000039244926,"about_ca_topic_score_gemma":0.0000012728287,"teacher_disagreement_score":0.5314615,"about_ca_system_score_codex":0.000018130144,"about_ca_system_score_gemma":0.000042424243,"threshold_uncertainty_score":0.99290055},"labels":[],"label_agreement":null},{"id":"W4406203420","doi":"10.61091/jcmcc123-14","title":"Analyzing Pathway Energy And Time Complexity In Flower Families Through Vertex-Disjoint Paths","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Computer science; Vertex (graph theory); Computational complexity theory; Graph; Theoretical computer science; Graph theory; Strongly connected component; Connected component; Algorithm; Combinatorics; Mathematics; Artificial intelligence","score_opus":0.014991935884693207,"score_gpt":0.25696939469507823,"score_spread":0.24197745881038502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406203420","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94735307,0.0022741233,0.03795326,0.00015346089,0.005935566,0.00026127024,0.000010881138,0.00011941681,0.0059389784],"genre_scores_gemma":[0.99435353,0.00006409357,0.004398513,0.000011046606,0.0011156417,0.0000027262363,0.0000051008287,0.000037406437,0.000011936915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974896,0.00014829404,0.0012321485,0.00032423486,0.00042651335,0.00037920935],"domain_scores_gemma":[0.9982286,0.00071038975,0.00047179725,0.00023212323,0.00021860813,0.00013850126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011612963,0.00036904853,0.0010137291,0.00031527202,0.00019683853,0.0004376528,0.00024550798,0.00010428382,0.000042293796],"category_scores_gemma":[0.00005202199,0.00032808396,0.00026513383,0.0005586142,0.00014361757,0.00033626187,0.0003295456,0.00048262777,0.0000018692075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028259645,0.00030316337,0.000543624,0.00009804817,0.0002178191,0.00004022386,0.0011755603,0.000024148725,0.00044743877,0.9882047,0.00036448974,0.008552492],"study_design_scores_gemma":[0.0012442954,0.00023497718,0.00007483285,0.000809501,0.00012031226,0.000030405005,0.00033724116,0.055480067,0.00052446354,0.93873113,0.002052998,0.00035979538],"about_ca_topic_score_codex":0.000121842844,"about_ca_topic_score_gemma":0.0000030919587,"teacher_disagreement_score":0.05545592,"about_ca_system_score_codex":0.00008315088,"about_ca_system_score_gemma":0.00012202095,"threshold_uncertainty_score":0.99991715},"labels":[],"label_agreement":null},{"id":"W4406308611","doi":"10.1016/j.eswa.2025.126482","title":"Towards a performance characteristic curve for model evaluation: An application in information diffusion prediction","year":2025,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Fundamental Research Funds for the Central Universities; HORIZON EUROPE Framework Programme; National Natural Science Foundation of China; National University's Basic Research Foundation of China; Ministerstwo Edukacji i Nauki; European Research Executive Agency; European Commission","keywords":"Computer science; Diffusion; Data mining; Artificial intelligence; Thermodynamics","score_opus":0.013891746191541973,"score_gpt":0.29638134677665845,"score_spread":0.28248960058511646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406308611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035827927,0.00004879176,0.9572998,0.000092622424,0.000029539473,0.0037632866,0.00006209505,0.000115879244,0.0027600208],"genre_scores_gemma":[0.9561402,0.000006680917,0.0036050824,0.00003517646,0.00016369567,0.038256925,0.0017098322,0.000010705417,0.00007170208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988596,0.000040369494,0.00045938606,0.00026130115,0.00021609497,0.00016329225],"domain_scores_gemma":[0.9988692,0.000025335496,0.0002078576,0.000489668,0.00036454265,0.000043415454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038937715,0.00014971803,0.00019679108,0.00022334633,0.00022020392,0.000085954765,0.00018417028,0.000051059582,0.000007089839],"category_scores_gemma":[0.0000029997395,0.00013742447,0.00003886244,0.0005082878,0.000023605957,0.00055911735,0.000025753412,0.0000808131,0.0000051963602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002155906,0.00094282394,0.07016103,0.00028310248,0.00015840697,2.0574808e-8,0.0027623984,0.11666918,0.0022596333,0.23517247,0.002247564,0.5691278],"study_design_scores_gemma":[0.00046929647,0.00003343076,0.00632398,0.00006423029,0.000034343546,2.4511746e-7,0.00025501716,0.9801772,0.00010693332,0.0015045973,0.010903137,0.00012758629],"about_ca_topic_score_codex":0.00032894535,"about_ca_topic_score_gemma":0.000021230837,"teacher_disagreement_score":0.95369476,"about_ca_system_score_codex":0.0001647731,"about_ca_system_score_gemma":0.00014952601,"threshold_uncertainty_score":0.5604007},"labels":[],"label_agreement":null},{"id":"W4406611240","doi":"10.1109/smc54092.2024.10831695","title":"Adaptive Graph Spatial Temporal Fourier-Enhanced Transformer Networks for Traffic Prediction","year":2024,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Natural Resources","keywords":"Computer science; Graph; Fourier transform; Transformer; Algorithm; Artificial intelligence; Theoretical computer science; Mathematics; Engineering; Electrical engineering; Voltage","score_opus":0.011799214697405296,"score_gpt":0.25118285453057493,"score_spread":0.23938363983316963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406611240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094158985,0.00010694164,0.98241657,0.00008876162,0.00024139995,0.00055151986,0.000055760484,0.00045533624,0.0066678068],"genre_scores_gemma":[0.9918298,0.0000052642113,0.0055453354,0.000017455872,0.0012536262,0.00029296245,0.00024998334,0.00003252314,0.00077302626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989084,0.000023162373,0.00031326263,0.00034153037,0.00012666259,0.00028700338],"domain_scores_gemma":[0.99961203,0.0000715612,0.00003883341,0.0001574063,0.000054235355,0.00006592538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015954422,0.00018892146,0.00021756487,0.00010851847,0.000116998184,0.000090347494,0.000106089035,0.00005542368,0.0006122355],"category_scores_gemma":[6.2659365e-7,0.00016335284,0.00038652588,0.00030740892,0.000039115614,0.00016049661,0.000008674674,0.00016191446,0.000006544086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012835731,0.00013090727,0.0003549048,0.000019739293,0.00069026445,8.332834e-7,0.00029166226,0.025002664,0.00023544327,0.029575275,0.026591528,0.9169784],"study_design_scores_gemma":[0.0002714039,0.0002084337,0.00007950429,0.000044455173,0.00018254972,2.6952864e-7,0.000109327135,0.9766884,0.0012522095,0.010863662,0.010079269,0.00022052726],"about_ca_topic_score_codex":0.0001891384,"about_ca_topic_score_gemma":0.00015319444,"teacher_disagreement_score":0.98241395,"about_ca_system_score_codex":0.000023963066,"about_ca_system_score_gemma":0.00003753899,"threshold_uncertainty_score":0.67035496},"labels":[],"label_agreement":null},{"id":"W4406753029","doi":"10.1007/978-3-031-78548-1_16","title":"MLCDG: Multi-Level Contrastive Graph Clustering in Dynamic Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Cluster analysis; Graph; Theoretical computer science; Artificial intelligence","score_opus":0.016865652234112988,"score_gpt":0.2713157332208774,"score_spread":0.25445008098676436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406753029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023444279,0.00020214211,0.9954313,0.00008622408,0.00034638084,0.00041932552,0.00004122979,0.00007462334,0.003164355],"genre_scores_gemma":[0.8459042,0.00001704967,0.15314493,0.00021080243,0.00012560323,0.00003852602,0.000036944944,0.000031371386,0.00049061736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974201,0.000033487395,0.00053842954,0.0010857178,0.0003620727,0.0005602186],"domain_scores_gemma":[0.9985831,0.0003320041,0.00022929005,0.0006374647,0.0001377567,0.000080424375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000397636,0.0005104859,0.00068492274,0.0013503835,0.000145375,0.00016638204,0.0011017151,0.00015887551,0.0000690753],"category_scores_gemma":[0.0000115756275,0.0005080204,0.00024047888,0.0008192552,0.00047396214,0.00014744686,0.0007063588,0.00088174816,0.000004686489],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012843394,0.000075124655,0.0029435444,0.000029727347,0.00007168984,0.00002417777,0.00029939538,0.02935892,0.00009428464,0.012540327,0.000033039916,0.95451695],"study_design_scores_gemma":[0.00046803086,0.000043483044,0.0023964262,0.00090380124,0.00003205959,0.0000018766335,7.431066e-7,0.7388982,0.0001654604,0.256202,0.00020507176,0.00068283034],"about_ca_topic_score_codex":0.00024293832,"about_ca_topic_score_gemma":0.0016262151,"teacher_disagreement_score":0.9538341,"about_ca_system_score_codex":0.00020224733,"about_ca_system_score_gemma":0.0002212447,"threshold_uncertainty_score":0.99973714},"labels":[],"label_agreement":null},{"id":"W4406766969","doi":"10.1016/j.jde.2025.01.077","title":"Disease threshold of the effective degree SIS model on a random network with large degrees","year":2025,"lang":"en","type":"article","venue":"Journal of Differential Equations","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Mathematics; Degree (music); Disease; Epidemic model; Statistical physics; Medicine; Physics","score_opus":0.013623762771186827,"score_gpt":0.2659599856955962,"score_spread":0.2523362229244094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406766969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21119206,0.00006668802,0.7869092,0.00019747045,0.00006927734,0.00027076862,0.000021929269,0.0000073971714,0.0012651884],"genre_scores_gemma":[0.99898916,0.0000024396654,0.0005536822,0.000028896651,0.0002143374,0.00002614333,0.000005832154,0.000009051812,0.00017045556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989738,0.00010839266,0.00037168208,0.00010463541,0.00028103328,0.00016048955],"domain_scores_gemma":[0.99873924,0.00030911158,0.00041396377,0.00026721085,0.00021089191,0.000059590147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016345465,0.00013573523,0.0003288639,0.00010909413,0.00018955034,0.000035276084,0.00027399286,0.000021241138,0.000071926166],"category_scores_gemma":[0.000024365423,0.000078673824,0.00040871967,0.00036092545,0.00005078878,0.00006889333,0.00007450823,0.00023304118,4.9504195e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016520533,0.0014542558,0.08585047,0.000027527693,0.0026211648,0.000001397683,0.00021473775,0.52079666,0.0003441193,0.37330708,0.004110369,0.009620151],"study_design_scores_gemma":[0.004501171,0.00019771662,0.069864444,0.00081422087,0.002625231,2.3222907e-7,0.0000540753,0.7940697,0.00070592435,0.12686414,0.00007819962,0.00022491471],"about_ca_topic_score_codex":0.000009896866,"about_ca_topic_score_gemma":0.000039610317,"teacher_disagreement_score":0.7877971,"about_ca_system_score_codex":0.000031588846,"about_ca_system_score_gemma":0.00013357673,"threshold_uncertainty_score":0.32082257},"labels":[],"label_agreement":null},{"id":"W4406781026","doi":"10.1007/978-3-031-78538-2_12","title":"Gradient Descent Clustering with Regularization to Recover Communities in Transformed Attributed Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Regularization (linguistics); Cluster analysis; Gradient descent; Stochastic gradient descent; Artificial intelligence; Algorithm; Data mining; Artificial neural network","score_opus":0.013263593558565528,"score_gpt":0.23502388904775284,"score_spread":0.22176029548918733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406781026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003402949,0.000057231908,0.9967966,0.0001915767,0.00016209099,0.0005888666,0.000008907918,0.00005783416,0.0017965611],"genre_scores_gemma":[0.91418636,0.000022258006,0.08452599,0.00047951084,0.00021815533,0.00004533558,0.00017368705,0.000036583453,0.00031209746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982222,0.000045918536,0.0004253529,0.00052423915,0.00031997898,0.00046234042],"domain_scores_gemma":[0.998829,0.0001911998,0.00012658545,0.0006365877,0.00013738175,0.000079240745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044692322,0.0003710326,0.00050605106,0.0007327256,0.00016561917,0.00018740701,0.0007631565,0.00011044025,0.000043705644],"category_scores_gemma":[0.0000032599094,0.00033782786,0.00008918217,0.00082206633,0.00020059751,0.00013420843,0.00034596585,0.00060319644,0.000001043653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026332124,0.00002766051,0.0015680642,0.000015687012,0.000026094833,0.000003366665,0.0005185036,0.61424893,0.000004028526,0.0034484044,0.000027307555,0.3800856],"study_design_scores_gemma":[0.00033565372,0.00013767819,0.00048741547,0.0019056118,0.000034680736,0.0000018718886,0.0000021004953,0.9648615,0.00016250747,0.02957855,0.0019097592,0.00058264204],"about_ca_topic_score_codex":0.00037094223,"about_ca_topic_score_gemma":0.0039983783,"teacher_disagreement_score":0.9138461,"about_ca_system_score_codex":0.00033799896,"about_ca_system_score_gemma":0.00015440192,"threshold_uncertainty_score":0.9999074},"labels":[],"label_agreement":null},{"id":"W4406853484","doi":"10.3758/s13428-024-02553-7","title":"EmoAtlas: An emotional network analyzer of texts that merges psychological lexicons, artificial intelligence, and network science","year":2025,"lang":"en","type":"article","venue":"Behavior Research Methods","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Artificial intelligence; Emotional intelligence; Natural language processing; Psychology; Social psychology","score_opus":0.30727787482703395,"score_gpt":0.593795430617827,"score_spread":0.2865175557907931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406853484","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5332777,0.0005434802,0.4590599,0.00020585669,0.0002268141,0.000691029,0.000012841605,0.00008522792,0.005897184],"genre_scores_gemma":[0.8047016,0.000030096739,0.19457467,0.000014694591,0.00034974088,0.000107131826,0.000015348716,0.000011822993,0.00019489962],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540573,0.0017121731,0.0005391359,0.0007765367,0.0007114172,0.0008549973],"domain_scores_gemma":[0.99774855,0.00071200036,0.00012958137,0.0007146528,0.00047180837,0.00022340755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010225519,0.00021288598,0.00047547434,0.0005177629,0.0007131532,0.00020060349,0.0008123179,0.00009195742,0.0007550593],"category_scores_gemma":[0.0000875853,0.00018634487,0.00015754723,0.0034982704,0.0018205165,0.00022509455,0.0006070788,0.00063934445,0.0000032593962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003973734,0.0004235188,0.1544333,0.000005547128,0.00004147797,0.0000019728334,0.00004212492,0.0004139573,0.002185963,0.18245171,0.0011055745,0.65885514],"study_design_scores_gemma":[0.00012548923,0.00037026135,0.34265417,0.00016562322,0.00015006757,0.0000027242932,0.000575004,0.010520766,0.014165919,0.6281331,0.0026742315,0.000462614],"about_ca_topic_score_codex":0.00014435586,"about_ca_topic_score_gemma":0.00002693825,"teacher_disagreement_score":0.6583925,"about_ca_system_score_codex":0.000046305577,"about_ca_system_score_gemma":0.0001716273,"threshold_uncertainty_score":0.826737},"labels":[],"label_agreement":null},{"id":"W4406986306","doi":"10.1101/2025.01.29.635594","title":"Visual Influence Networks in Walking Crowds","year":2025,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sustainable Development Technology Canada; National Institutes of Health; National Science Foundation","keywords":"Crowds; Computer science; Human–computer interaction; Cognitive psychology; Psychology; Computer security","score_opus":0.007104107178927269,"score_gpt":0.2454091654005216,"score_spread":0.23830505822159434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406986306","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9507798,0.0007459113,0.046282012,0.00007022172,0.00050070544,0.00078669126,0.00007192451,0.00057816546,0.00018458995],"genre_scores_gemma":[0.9953041,0.000048250822,0.0034032816,0.000117280695,0.00071333937,0.00032977405,8.972428e-7,0.000071316725,0.000011750617],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9967492,0.00020524232,0.0008314535,0.0011411976,0.0003084451,0.00076446176],"domain_scores_gemma":[0.9976369,0.00013191282,0.00045534348,0.0012737849,0.00033456399,0.00016750279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000660921,0.00067460374,0.000867469,0.0005405363,0.00015057097,0.00031837297,0.0009124064,0.0003763792,0.00013060073],"category_scores_gemma":[0.000034053573,0.0008023084,0.00029949372,0.0012503791,0.00009929067,0.00017085878,0.0012946171,0.001488809,0.000015270029],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005952794,0.000794097,0.894567,0.0003942925,0.00096092647,0.00006990741,0.000033001437,0.050206225,0.031762768,0.01947741,0.0014465383,0.00022831072],"study_design_scores_gemma":[0.0014424687,0.00008307158,0.7670307,0.0049755513,0.0006735867,4.2465915e-9,0.000012022587,0.14743033,0.062155712,0.00030200748,0.011272709,0.0046217907],"about_ca_topic_score_codex":0.0005406449,"about_ca_topic_score_gemma":0.000011468299,"teacher_disagreement_score":0.12753625,"about_ca_system_score_codex":0.00026862518,"about_ca_system_score_gemma":0.00043985664,"threshold_uncertainty_score":0.99944276},"labels":[],"label_agreement":null},{"id":"W4407598271","doi":"10.1016/j.idm.2025.02.008","title":"A graph-theoretic framework for integrating mobility data into mathematical epidemic models","year":2025,"lang":"en","type":"article","venue":"Infectious Disease Modelling","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; George & Fay Yee Centre for Healthcare Innovation","funders":"Canadian Institutes of Health Research; University of Manitoba; Research Manitoba","keywords":"Graph; Computer science; Mathematics; Theoretical computer science","score_opus":0.0377788169926476,"score_gpt":0.3361837356623825,"score_spread":0.2984049186697349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407598271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03683002,0.00031766543,0.9598386,0.000093716895,0.00006392251,0.000700022,0.000050587245,0.00028938285,0.0018160822],"genre_scores_gemma":[0.9018716,0.000012010456,0.097279966,0.00008559414,0.00016283938,0.0003789234,0.00015939678,0.000030496323,0.000019127467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981015,0.00011122609,0.00057762145,0.00070687284,0.00015024339,0.00035255676],"domain_scores_gemma":[0.99713105,0.0009915455,0.00014854551,0.0014222835,0.00014676951,0.00015981366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059837423,0.00028411814,0.00043773995,0.00017874208,0.00033875866,0.00012561948,0.000569018,0.000069848356,0.00006730477],"category_scores_gemma":[0.000114421426,0.00027250857,0.00031998238,0.00044953538,0.000118941614,0.00025561795,0.00032900157,0.00033653056,0.0000051044835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022344811,0.00021486134,0.0017318801,0.00010702636,0.00013663914,2.5683605e-7,0.00011216789,0.2440494,0.0000037071172,0.7495289,0.0001307841,0.003962018],"study_design_scores_gemma":[0.00007344498,0.000005755317,0.0000018036428,0.00016092646,0.00017653413,4.097574e-8,0.000039618342,0.4984113,0.000011463065,0.50096756,0.000032956425,0.0001185667],"about_ca_topic_score_codex":0.00016714666,"about_ca_topic_score_gemma":0.0000070636193,"teacher_disagreement_score":0.8650416,"about_ca_system_score_codex":0.000069680034,"about_ca_system_score_gemma":0.0001187438,"threshold_uncertainty_score":0.9999727},"labels":[],"label_agreement":null},{"id":"W4407688685","doi":"10.3758/s13428-025-02610-9","title":"Open-access network science: Investigating phonological similarity networks based on the SUBTLEX-US lexicon","year":2025,"lang":"en","type":"article","venue":"Behavior Research Methods","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Lexicon; Python (programming language); Artificial intelligence; Natural language processing; Clustering coefficient; Adjacency list; Similarity (geometry); Cluster analysis","score_opus":0.4133289132249728,"score_gpt":0.6305229576386698,"score_spread":0.21719404441369705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407688685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27749965,0.00017541552,0.5865863,0.0053226743,0.0004227705,0.004461389,0.000016084654,0.0003501598,0.1251656],"genre_scores_gemma":[0.91500115,0.0000029104842,0.08237539,0.0006718652,0.0003241961,0.0012028462,0.000022359336,0.000024692998,0.00037459424],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923108,0.0042208876,0.00048633333,0.00093258254,0.0008075394,0.0012418312],"domain_scores_gemma":[0.99435306,0.0033373816,0.00014794523,0.0014744606,0.00045230144,0.00023484303],"candidate_categories":["sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.024265287,0.00027998627,0.0004565733,0.0003514839,0.0023724623,0.0030752672,0.0057793767,0.00011290318,0.0013691755],"category_scores_gemma":[0.00061036454,0.00019853123,0.00018577592,0.0053979293,0.0018642724,0.00038521388,0.004959181,0.0019127034,0.000006717854],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006814585,0.0006184711,0.384873,0.000008650112,0.00005245132,0.0000071769227,0.000031385665,0.012651436,0.0023254445,0.2524936,0.02801651,0.31885374],"study_design_scores_gemma":[0.00089172256,0.00034033658,0.22174819,0.0004033303,0.00016183981,6.641136e-7,0.00031154352,0.53815335,0.025553726,0.17942081,0.03210142,0.0009130314],"about_ca_topic_score_codex":0.0009779987,"about_ca_topic_score_gemma":0.000021792566,"teacher_disagreement_score":0.63750154,"about_ca_system_score_codex":0.00020422676,"about_ca_system_score_gemma":0.00095777493,"threshold_uncertainty_score":0.9995998},"labels":[],"label_agreement":null},{"id":"W4407794764","doi":"10.1016/j.physa.2025.130461","title":"Beyond traditional metrics: Redefining urban metro network vulnerability with redundancy assessment","year":2025,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Redundancy (engineering); Vulnerability assessment; Computer science; Vulnerability (computing); Artificial intelligence; Computer security; Psychology","score_opus":0.01882233662398418,"score_gpt":0.2986441518194807,"score_spread":0.2798218151954965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407794764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008672916,0.00011148785,0.98330045,0.0004473065,0.000023633733,0.00055117003,0.00039643512,0.00008109376,0.014221161],"genre_scores_gemma":[0.9114576,0.000008980161,0.0867934,0.000093900766,0.0002507459,0.0009679427,0.0003625787,0.000015035882,0.000049785256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984517,0.00007703343,0.0003604776,0.0005444687,0.00024807494,0.00031822245],"domain_scores_gemma":[0.99843377,0.00076320383,0.00013927561,0.00036122315,0.00017217721,0.00013036696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025190928,0.0002243061,0.00037230694,0.0000944988,0.000497435,0.00011268665,0.00018934629,0.000033983673,0.00018742193],"category_scores_gemma":[0.000013665695,0.0002042386,0.000071465016,0.0010822644,0.000043350872,0.00008310223,0.00010047644,0.00030106347,0.0000046928085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007835961,0.00027738014,0.0005444654,0.000015610744,0.00016807167,1.8523387e-7,0.000009963291,0.000077701996,0.00007638004,0.9797624,0.0036304567,0.015429593],"study_design_scores_gemma":[0.00022078569,0.00007994515,0.0012505351,0.000023142858,0.00024367726,1.948105e-7,0.000042484935,0.08927149,0.000081077786,0.9031807,0.0053931056,0.0002128398],"about_ca_topic_score_codex":0.000023735236,"about_ca_topic_score_gemma":0.000006787394,"teacher_disagreement_score":0.91059035,"about_ca_system_score_codex":0.000058777296,"about_ca_system_score_gemma":0.00011144123,"threshold_uncertainty_score":0.8328608},"labels":[],"label_agreement":null},{"id":"W4407806473","doi":"10.1101/2025.02.17.638675","title":"NRGRank: Coarse-grained structurally-informed ultra-massive virtual screening","year":2025,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.0111424122980875,"score_gpt":0.24171118571601943,"score_spread":0.23056877341793194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407806473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68747824,0.000719555,0.2950078,0.0007416726,0.0026672182,0.0043086326,0.0035642255,0.0037610724,0.0017516182],"genre_scores_gemma":[0.97799766,0.000031325813,0.020232495,0.00016533038,0.0010553524,0.00032856996,0.000009726044,0.00011175944,0.00006777532],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958295,0.00018364027,0.0010683073,0.0013435105,0.000605312,0.00096968794],"domain_scores_gemma":[0.995815,0.00026085463,0.00089611183,0.001929904,0.00075102225,0.00034712057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041832172,0.0010794641,0.0012558674,0.0005785308,0.0003992772,0.00048703095,0.0013578796,0.00044811127,0.00045406917],"category_scores_gemma":[0.00009004501,0.0011572947,0.0007066968,0.0010076872,0.00021102827,0.00025671924,0.00082506944,0.0014633926,0.000029255189],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006936908,0.0011797819,0.12748893,0.0017836335,0.016920567,0.00019538139,0.00034290814,0.01697526,0.5304738,0.25714356,0.045025192,0.0017772451],"study_design_scores_gemma":[0.0063614384,0.0004341131,0.07352275,0.006421077,0.00440218,2.812802e-8,0.00018639119,0.05088598,0.76010245,0.0007511625,0.08458203,0.0123504205],"about_ca_topic_score_codex":0.00034724755,"about_ca_topic_score_gemma":0.000009158549,"teacher_disagreement_score":0.29051945,"about_ca_system_score_codex":0.00026546663,"about_ca_system_score_gemma":0.001025449,"threshold_uncertainty_score":0.9990877},"labels":[],"label_agreement":null},{"id":"W4407835280","doi":"10.5206/mase/21259","title":"Divisor equitably strong non-split divisor equitable domination in graphs","year":2025,"lang":"en","type":"article","venue":"Mathematics in Applied Sciences and Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Divisor (algebraic geometry); Graph; Dominating set; Greatest common divisor; Discrete mathematics","score_opus":0.011469882074616845,"score_gpt":0.2619169637142004,"score_spread":0.25044708163958357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407835280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5266541,0.00008881857,0.42981637,0.00004288349,0.000046877638,0.00032904823,0.0000020762116,0.00004916925,0.04297065],"genre_scores_gemma":[0.9735823,0.000005095742,0.026228512,0.000005052882,0.00001542832,0.00009194343,0.00000205671,0.000006674015,0.00006289634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998974,0.000004491574,0.00029833242,0.00023136708,0.000137115,0.0003546853],"domain_scores_gemma":[0.99965227,0.00012413017,0.00005004807,0.00013800614,0.000008912517,0.000026640233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073273235,0.00013598074,0.0002454124,0.0003762268,0.00009127233,0.00012152844,0.00022052285,0.000026771417,0.000020429075],"category_scores_gemma":[0.000006072384,0.00012944727,0.000033511766,0.00092175906,0.00004952339,0.000089070934,0.00019751152,0.00012438625,0.0000012827516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011367176,0.00007496329,0.005022995,0.00009342723,0.000012289145,2.8191886e-7,0.0004580797,0.019042758,0.0026065563,0.96305007,0.00003135438,0.009606097],"study_design_scores_gemma":[0.000334622,0.000014276556,0.0030611018,0.00024538906,0.00001559689,1.2823678e-7,0.0010642088,0.84382856,0.0011917372,0.1499013,0.00009923541,0.00024382684],"about_ca_topic_score_codex":0.000042989377,"about_ca_topic_score_gemma":0.000019163283,"teacher_disagreement_score":0.8247858,"about_ca_system_score_codex":0.000030610234,"about_ca_system_score_gemma":0.00001530868,"threshold_uncertainty_score":0.52787066},"labels":[],"label_agreement":null},{"id":"W4407949850","doi":"10.1109/cdc56724.2024.10886458","title":"Sparse Network Mean Field Games: Ring Structures and Related Topologies","year":2024,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"","keywords":"Network topology; Ring (chemistry); Computer science; Field (mathematics); Topology (electrical circuits); Computer network; Mathematics; Combinatorics","score_opus":0.012589159282801814,"score_gpt":0.2698479568036598,"score_spread":0.257258797520858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407949850","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48745692,0.0045097037,0.065684386,0.0021293163,0.0007024434,0.00037953377,0.0000060552265,0.0020170487,0.4371146],"genre_scores_gemma":[0.9949661,0.000018550498,0.0029221703,0.000048322527,0.00039710125,0.000006663952,0.000006926207,0.000010797731,0.0016233644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935305,0.000023241551,0.00015582523,0.00022048719,0.000059821694,0.00018758894],"domain_scores_gemma":[0.9996171,0.00014079889,0.00002198895,0.00017436693,0.000011376557,0.000034390287],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000880141,0.0001151587,0.0001484018,0.000044086388,0.00007233648,0.00012522635,0.000090646296,0.00003547046,0.0021550355],"category_scores_gemma":[0.0000026106839,0.0000900912,0.00007558108,0.00017764853,0.00003539554,0.00007285877,0.00011367599,0.00016320379,0.000008887959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004273941,0.0000071447294,0.011433603,0.000012761821,0.0002949339,0.000008293465,0.00029591526,0.000586363,0.00007929941,0.8112087,0.051235013,0.12483366],"study_design_scores_gemma":[0.00009455254,0.000055524783,0.0019977603,0.000083536004,0.00012040248,0.000004409249,0.00050116243,0.023978148,0.0018453278,0.93868244,0.032310817,0.00032589957],"about_ca_topic_score_codex":0.00024982466,"about_ca_topic_score_gemma":0.000023950624,"teacher_disagreement_score":0.5075092,"about_ca_system_score_codex":0.000006652558,"about_ca_system_score_gemma":0.000009176239,"threshold_uncertainty_score":0.9987571},"labels":[],"label_agreement":null},{"id":"W4408061184","doi":"10.14778/3705829.3705833","title":"Efficient and Effective Algorithms for A Family of Influence Maximization Problems with A Matroid Constraint","year":2024,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matroid; Constraint (computer-aided design); Matroid partitioning; Weighted matroid; Maximization; Oriented matroid; Combinatorics; Algorithm; Computer science; Mathematics; Mathematical optimization; Graphic matroid; Geometry","score_opus":0.006558692355830441,"score_gpt":0.23206969491545273,"score_spread":0.22551100255962228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408061184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96384704,0.00019633042,0.03318721,0.00010597513,0.000019931967,0.0018152707,0.00003193016,0.000044125398,0.0007522138],"genre_scores_gemma":[0.99125504,0.0000034069458,0.008298427,0.000006466374,0.00002611467,0.0003796588,0.0000016992325,0.000011672824,0.00001752157],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993237,0.000003776216,0.00020005082,0.00019558986,0.00015219579,0.00012463861],"domain_scores_gemma":[0.99953717,0.000050088052,0.00014627527,0.000058697227,0.00018423802,0.000023539327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018511633,0.000114772185,0.00018493755,0.000064510175,0.000044900604,0.000038679605,0.00011289564,0.000014427561,0.0000027870665],"category_scores_gemma":[0.000004766968,0.00007204124,0.00007915947,0.00023816088,0.000117075,0.000037730737,0.00007870703,0.000061056904,1.5433768e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023367583,0.0006383321,0.026382606,0.0027708733,0.0017205338,3.124329e-7,0.0053708362,0.030704018,0.42685464,0.3853796,0.0006286661,0.119315915],"study_design_scores_gemma":[0.0021684633,0.0014596698,0.009696037,0.003809082,0.0010820759,0.000011130617,0.00206705,0.4399158,0.4746652,0.063259065,0.001188681,0.0006777584],"about_ca_topic_score_codex":0.000056470697,"about_ca_topic_score_gemma":3.999747e-7,"teacher_disagreement_score":0.40921178,"about_ca_system_score_codex":0.000027082104,"about_ca_system_score_gemma":0.000020389536,"threshold_uncertainty_score":0.29377568},"labels":[],"label_agreement":null},{"id":"W4408324185","doi":"10.21307/connections-2019.039","title":"Special Theme: Homophily in Social Networks","year":2024,"lang":"en","type":"article","venue":"Connections","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Homophily; Theme (computing); Sociology; Psychology; Data science; Computer science; Social science; World Wide Web","score_opus":0.01563295851350781,"score_gpt":0.28279886966764994,"score_spread":0.2671659111541421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408324185","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08504284,0.00050957594,0.19595192,0.0029072673,0.0031104337,0.00047242123,0.000040997445,0.0009024772,0.7110621],"genre_scores_gemma":[0.97992885,0.0000033888925,0.00008426587,0.00002165422,0.018841939,0.0000458062,0.000024055347,0.000014071202,0.001035972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941283,0.000029399665,0.00014709178,0.00018339168,0.000056608354,0.0001706758],"domain_scores_gemma":[0.99976784,0.0000674544,0.00001707515,0.00010487488,0.000018880599,0.000023873423],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000086777836,0.000087430555,0.0001195591,0.00012916431,0.0001664929,0.000096524964,0.000088258304,0.00003034242,0.0021297315],"category_scores_gemma":[0.0000018017065,0.000089690875,0.00013799725,0.0006283936,0.00003327509,0.00007221214,0.00004080605,0.00021737751,0.000060938957],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003151113,0.00007437365,0.0047630942,0.0000028481506,0.000092894734,0.0000050842555,0.0002736248,0.0006694871,0.000029542343,0.69547063,0.23122385,0.06739143],"study_design_scores_gemma":[0.00020969006,0.000024846675,0.007063095,0.000047237492,0.00008984836,0.0000021036064,0.00035088026,0.054337677,0.00005862343,0.17797717,0.75946784,0.00037098004],"about_ca_topic_score_codex":0.00010092258,"about_ca_topic_score_gemma":0.00011756585,"teacher_disagreement_score":0.894886,"about_ca_system_score_codex":0.000035561854,"about_ca_system_score_gemma":0.000026359126,"threshold_uncertainty_score":0.99878246},"labels":[],"label_agreement":null},{"id":"W4408324191","doi":"10.21307/connections-2016-006","title":"Identifying Fragments in Networks for Structural Balance and Tracking the Levels of Balance Over Time","year":2016,"lang":"en","type":"article","venue":"Connections","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Balance (ability); Tracking (education); Computer science; Psychology","score_opus":0.022769598149591293,"score_gpt":0.2963136653072165,"score_spread":0.2735440671576252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408324191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7743562,0.00012220745,0.22478354,0.00016391503,0.000073764946,0.00021636732,0.000040408664,0.00002217081,0.00022144224],"genre_scores_gemma":[0.9991238,0.000003907024,0.00051476166,0.000013133658,0.00013683847,0.000035473386,0.0000030460699,0.000007253695,0.00016178965],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99950296,0.000025221405,0.00016064475,0.00013379696,0.000044993754,0.00013240747],"domain_scores_gemma":[0.99942243,0.0002525934,0.00008784141,0.00018634548,0.000034772373,0.000015987449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110403205,0.00006949926,0.0001288647,0.000034411954,0.000109604705,0.000023298711,0.00011675501,0.000017668275,0.00019197691],"category_scores_gemma":[0.0000128023585,0.00004554277,0.000056493096,0.00012606622,0.00004416693,0.00010464763,0.00004981175,0.000051432424,7.57494e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020123327,0.000035296598,0.869959,0.000012356286,0.00019563275,2.3307837e-7,0.00028905252,0.0008508935,0.015667448,0.03386437,0.0023327358,0.07677288],"study_design_scores_gemma":[0.0012225336,0.000035958998,0.75531715,0.00027288016,0.00008063135,0.0000013500191,0.00010129071,0.13582717,0.0030406376,0.10243495,0.0013614503,0.00030401585],"about_ca_topic_score_codex":0.00004259984,"about_ca_topic_score_gemma":0.00002361285,"teacher_disagreement_score":0.22476761,"about_ca_system_score_codex":0.000014520093,"about_ca_system_score_gemma":0.000006946216,"threshold_uncertainty_score":0.21020126},"labels":[],"label_agreement":null},{"id":"W4408324216","doi":"10.21307/connections-2019.038","title":"Key Information for the special theme: Homophily in Social Networks","year":2024,"lang":"en","type":"article","venue":"Connections","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Homophily; Theme (computing); Key (lock); Sociology; Computer science; Data science; World Wide Web; Social science; Computer security","score_opus":0.014522376613706596,"score_gpt":0.2762499272325562,"score_spread":0.2617275506188496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408324216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005055107,0.00016929721,0.9522721,0.0034532617,0.00096737733,0.00058290944,0.00004527383,0.00019858255,0.03725606],"genre_scores_gemma":[0.99235183,0.0000047211115,0.00012074829,0.000049828956,0.0069804317,0.00021926271,0.000056833145,0.000007113926,0.00020924181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956506,0.000015374875,0.00015960845,0.00008035584,0.000049272287,0.0001303232],"domain_scores_gemma":[0.99962115,0.00020869468,0.000027572256,0.00009367707,0.00003655679,0.000012331053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013904253,0.000068315276,0.000079946265,0.000083464205,0.00031185578,0.00015784116,0.000095833755,0.00002497639,0.00034218974],"category_scores_gemma":[0.0000050557846,0.00005363762,0.00013369061,0.00039894326,0.000027848091,0.00018567426,0.000027901368,0.00013874097,0.00002029232],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059937665,0.000019922625,0.00048459743,0.000003815626,0.00008397396,1.0488448e-7,0.00069322024,0.0023313975,0.000003640313,0.7411377,0.14353341,0.11170227],"study_design_scores_gemma":[0.00013616095,0.000013563839,0.0015572379,0.000013210238,0.00006397252,3.9573018e-7,0.0005001754,0.19439259,0.000015552241,0.07309328,0.73010004,0.00011382197],"about_ca_topic_score_codex":0.00007471265,"about_ca_topic_score_gemma":0.00009365114,"teacher_disagreement_score":0.9872967,"about_ca_system_score_codex":0.00002906856,"about_ca_system_score_gemma":0.000026406653,"threshold_uncertainty_score":0.37467375},"labels":[],"label_agreement":null},{"id":"W4408324225","doi":"10.21307/connections-2019.030","title":"The Impact of Brokerage in a Communication Network on Productivity: Evidence from Sensor Data","year":2024,"lang":"en","type":"article","venue":"Connections","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Murata Science Foundation","keywords":"Troubleshooting; Productivity; Computer science; Organizational network analysis; Key (lock); Network performance; Position (finance); Business; Knowledge management; Process management; Computer network; Computer security; Economics","score_opus":0.06637722552076017,"score_gpt":0.37040170328464356,"score_spread":0.3040244777638834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408324225","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9711824,0.0036333932,0.019607097,0.002071624,0.00015910628,0.00046630114,0.00016181653,0.00015123766,0.0025670368],"genre_scores_gemma":[0.99902976,0.000073695395,0.00035930754,0.0000026001169,0.00029318765,0.000031032945,0.00008748885,0.000008830819,0.000114123206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992605,0.00016817873,0.0001713457,0.00021926472,0.00006695317,0.00011378622],"domain_scores_gemma":[0.99720424,0.0013735911,0.00005325235,0.0013181778,0.000033774755,0.000016949229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039735358,0.00007614751,0.000117958705,0.000044164408,0.00015606877,0.000083367275,0.0003556955,0.000014569972,0.00009597435],"category_scores_gemma":[0.000053220316,0.00005456216,0.00007809979,0.0005101159,0.000050338313,0.00016435819,0.0001759227,0.00020407261,0.000010315822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014526563,0.00069327117,0.30389264,0.000022254726,0.001975977,0.0000035378641,0.0018821186,0.08249442,0.0041131317,0.079801515,0.21322702,0.31174883],"study_design_scores_gemma":[0.00024909573,0.0002034165,0.18243045,0.001893956,0.00027648557,0.0000018168512,0.000523853,0.6360995,0.001141582,0.14952613,0.027130567,0.0005231308],"about_ca_topic_score_codex":0.005958336,"about_ca_topic_score_gemma":0.0009152188,"teacher_disagreement_score":0.5536051,"about_ca_system_score_codex":0.00003954721,"about_ca_system_score_gemma":0.000055483688,"threshold_uncertainty_score":0.90072614},"labels":[],"label_agreement":null},{"id":"W4408324350","doi":"10.21307/connections-2016-052","title":"Network Influences on Behavior: A Summary of Tom Valente’s Keynote Address at Sunbelt XXXV: The Annual Meeting of the International Network for Social Network Analysis","year":2016,"lang":"en","type":"article","venue":"Connections","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institutes of Health; Tobacco-Related Disease Research Program","keywords":"Social network analysis; Operations research; Psychology; Political science; Law; Engineering; Social media","score_opus":0.022575986045149325,"score_gpt":0.295154715002545,"score_spread":0.27257872895739566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408324350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.956749,0.0004031472,0.027675204,0.0035275784,0.0015979469,0.0014599928,0.001180837,0.00014604388,0.007260257],"genre_scores_gemma":[0.99602073,0.0000095376245,0.00035310286,0.00009638071,0.0025334165,0.0002477201,0.000048927333,0.000019258454,0.0006709278],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99828076,0.00018878636,0.00055648084,0.00030147767,0.00030254552,0.00036994083],"domain_scores_gemma":[0.99746406,0.0010868743,0.0006268493,0.0004350263,0.00034933642,0.000037876365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058676756,0.00019388735,0.00039212644,0.000073623334,0.0008313111,0.000030976895,0.0006632828,0.00006277247,0.00024145684],"category_scores_gemma":[0.0000310419,0.000115732735,0.0007868017,0.0010082654,0.00023169063,0.000085485706,0.0003175832,0.00013785214,0.0000016533052],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012170198,0.00013976521,0.7912441,0.000004508695,0.0022252777,1.5547334e-7,0.00027261875,0.057840027,0.00015463542,0.03902967,0.10297004,0.005997507],"study_design_scores_gemma":[0.0023700085,0.000408981,0.7297894,0.0008844777,0.011596294,0.0000020581715,0.0012779313,0.00930878,0.0018939758,0.06979539,0.17129534,0.0013773887],"about_ca_topic_score_codex":0.00034985488,"about_ca_topic_score_gemma":0.0013135257,"teacher_disagreement_score":0.068325296,"about_ca_system_score_codex":0.00006935716,"about_ca_system_score_gemma":0.00004923969,"threshold_uncertainty_score":0.6393857},"labels":[],"label_agreement":null},{"id":"W4408354484","doi":"10.1109/icassp49660.2025.10889600","title":"Second-Order Wireless Federated Leaning via Nonparametric Hessian Estimation","year":2025,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Hessian matrix; Nonparametric statistics; Wireless; Computer science; Estimation; Order (exchange); Telecommunications; Econometrics; Mathematics; Applied mathematics; Engineering; Economics","score_opus":0.006510157148141769,"score_gpt":0.2672483879166301,"score_spread":0.2607382307684883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408354484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064332865,0.0000140081565,0.7665293,0.00011137185,0.0000382998,0.000115988434,0.0000010697973,0.00016611548,0.16869096],"genre_scores_gemma":[0.9796249,3.4337168e-7,0.013579545,0.0001123748,0.00004751493,0.000026658026,0.00005643899,0.00001047316,0.0065417243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992,0.000035978268,0.0002460403,0.00023300813,0.00009000249,0.00019501004],"domain_scores_gemma":[0.9995261,0.000072087925,0.00007567147,0.00019405725,0.00009721998,0.00003486314],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010873245,0.00013866722,0.00021028037,0.00024318697,0.0001958549,0.00014786428,0.00012474622,0.000034444685,0.0028179875],"category_scores_gemma":[0.0000034030263,0.0001319226,0.000077166995,0.0014301246,0.000020165675,0.00012095045,0.00006228914,0.00013717338,0.000044848646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011647127,0.00021578753,0.036328938,0.000024825742,0.00035723142,0.0000011546689,0.000059823044,0.0019329285,0.0014937074,0.15631719,0.016217064,0.7870397],"study_design_scores_gemma":[0.00028863637,0.000016137708,0.0030478097,0.000039631926,0.00006201896,2.40033e-7,0.000080047634,0.9564051,0.012121543,0.024304276,0.0033699744,0.0002645941],"about_ca_topic_score_codex":0.00025349986,"about_ca_topic_score_gemma":0.000069452304,"teacher_disagreement_score":0.9544722,"about_ca_system_score_codex":0.00003287269,"about_ca_system_score_gemma":0.000044227843,"threshold_uncertainty_score":0.99809355},"labels":[],"label_agreement":null},{"id":"W4408395346","doi":"10.1145/3698364.3709130","title":"Invited: Mapping Two Decades of Innovation: Lessons from 25 Years of ISPD Research","year":2025,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Data science; Regional science; Sociology","score_opus":0.09105046628476504,"score_gpt":0.42920062964514943,"score_spread":0.3381501633603844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408395346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89700913,0.00007209563,0.06742599,0.0017149696,0.000023630037,0.00014497324,0.000024005147,0.000035648573,0.033549536],"genre_scores_gemma":[0.99034417,0.000002851376,0.009012495,0.00006440249,0.00006127489,0.000011600892,0.000043693395,0.0000051053134,0.00045438006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906725,0.00006969773,0.00038249878,0.00016176485,0.00018445705,0.00013433817],"domain_scores_gemma":[0.99893105,0.0002545502,0.000103262624,0.00032000293,0.00037856132,0.000012589986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045168752,0.000060011123,0.00020437993,0.00053272897,0.000040254945,0.00001636893,0.00023661093,0.000024141813,0.000334385],"category_scores_gemma":[0.000020161737,0.00006328268,0.000053352967,0.0028018423,0.000087543995,0.000047487632,0.0001940749,0.00015563333,0.0000026235855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067014557,0.00011546379,0.14972612,0.00001185593,0.00025980035,2.3547948e-7,0.00019797431,0.000030406625,0.026615636,0.68361324,0.03946579,0.099956736],"study_design_scores_gemma":[0.00083223946,0.00003898032,0.13538682,0.00046285358,0.00006939221,4.338895e-8,0.0023042401,0.0035062472,0.16832061,0.6008779,0.08790958,0.0002911247],"about_ca_topic_score_codex":0.0032794122,"about_ca_topic_score_gemma":0.00005343707,"teacher_disagreement_score":0.14170498,"about_ca_system_score_codex":0.00001525602,"about_ca_system_score_gemma":0.000043881046,"threshold_uncertainty_score":0.4957512},"labels":[],"label_agreement":null},{"id":"W4408640756","doi":"10.1007/s42979-025-03801-z","title":"DevDynaP: A Dynamic Local Community Detection Algorithm","year":2025,"lang":"en","type":"article","venue":"SN Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.005072227009594658,"score_gpt":0.2678965391287106,"score_spread":0.26282431211911594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408640756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048523046,0.000011277981,0.9490758,0.000054071526,0.00021763895,0.00008679876,0.0000018113427,0.00012451055,0.0019050102],"genre_scores_gemma":[0.94565684,3.749059e-7,0.054129858,0.000091964466,0.000050796163,0.000010799722,0.0000037670507,0.0000034464852,0.00005212805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907506,0.00008879565,0.00016148202,0.00024612306,0.00017235844,0.00025615835],"domain_scores_gemma":[0.9992155,0.00006473537,0.000051165025,0.0004972059,0.00011911454,0.000052317904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005280187,0.000109225795,0.00013821409,0.0002206474,0.00067874807,0.00014240394,0.0007277185,0.00001819722,0.000021244106],"category_scores_gemma":[0.0000017715508,0.000106808344,0.000072104645,0.00145394,0.00041264785,0.00018113258,0.00054869504,0.00027474252,0.0000125625465],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.5358937e-7,0.000050655402,0.0005278671,0.0000017094268,0.000012695539,2.6559357e-7,0.000055531218,0.0003246068,0.0003613988,0.002110461,0.000085021864,0.99646896],"study_design_scores_gemma":[0.00008861712,0.00003415382,0.0054673115,0.0000202726,0.00001121451,7.551784e-7,0.000036846966,0.9655815,0.0037362466,0.0241788,0.00073191384,0.000112413945],"about_ca_topic_score_codex":0.000589547,"about_ca_topic_score_gemma":0.00008510217,"teacher_disagreement_score":0.99635655,"about_ca_system_score_codex":0.00009902096,"about_ca_system_score_gemma":0.00010205961,"threshold_uncertainty_score":0.52204496},"labels":[],"label_agreement":null},{"id":"W4409291982","doi":"10.1103/physreve.111.044303","title":"Identifying robust features of community structure in complex networks","year":2025,"lang":"en","type":"article","venue":"Physical review. E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Complex network; Computer science; Artificial intelligence; World Wide Web","score_opus":0.03486845050901249,"score_gpt":0.3708248526521801,"score_spread":0.33595640214316763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409291982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81264704,0.021016946,0.109629326,0.001258859,0.00017524631,0.0019401341,0.00008788634,0.00022247751,0.05302209],"genre_scores_gemma":[0.99870896,0.00018981726,0.0005516359,0.0002498511,0.00011288118,0.000019365496,0.00011888731,0.000009780255,0.00003881172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884754,0.00032103588,0.00034984024,0.0001454866,0.00013021576,0.0002058793],"domain_scores_gemma":[0.99900186,0.00019958038,0.00016022116,0.00053500093,0.00006933824,0.00003398587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021044559,0.00017462875,0.000658149,0.00006967596,0.00009293611,0.000022157172,0.0004381817,0.000021374177,0.00013189015],"category_scores_gemma":[0.000016336988,0.00015489532,0.0002566224,0.0008025826,0.000072965115,0.000064897,0.0002535419,0.00062068517,0.0000014813216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031373555,0.0013616268,0.06540234,0.0021821784,0.00056990556,0.0000014329194,0.00044969877,0.0070839743,0.006885616,0.46337056,0.099620916,0.35304037],"study_design_scores_gemma":[0.0007337253,0.00006042267,0.4282827,0.0056532742,0.000643626,5.176657e-7,0.00023973733,0.02223503,0.003033684,0.52808285,0.010271141,0.00076330884],"about_ca_topic_score_codex":0.00063816254,"about_ca_topic_score_gemma":0.00011620631,"teacher_disagreement_score":0.36288038,"about_ca_system_score_codex":0.000025570418,"about_ca_system_score_gemma":0.00001822174,"threshold_uncertainty_score":0.6316447},"labels":[],"label_agreement":null},{"id":"W4409365527","doi":"10.1609/aaai.v39i11.33306","title":"RouterRetriever: Routing over a Mixture of Expert Embedding Models","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Embedding; Computer science; Routing (electronic design automation); Artificial intelligence; Computer network","score_opus":0.04657043587603436,"score_gpt":0.3282586354173401,"score_spread":0.28168819954130575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365527","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61800855,0.000098146316,0.26194674,0.0013221924,0.00035688313,0.0008293411,0.000023946719,0.00013964681,0.11727453],"genre_scores_gemma":[0.9981105,0.000009649403,0.0013492181,0.000074680356,0.00008401588,0.000021243803,0.0000012078385,0.000011480841,0.0003380026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99845296,0.000013688211,0.00061919354,0.00033728676,0.0002900953,0.0002867466],"domain_scores_gemma":[0.99874,0.00008214823,0.0004386715,0.00024108957,0.00046097153,0.000037115788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031711167,0.00021276002,0.0003772901,0.00014281255,0.00014142274,0.00008427284,0.0008441764,0.00006351669,0.00020489958],"category_scores_gemma":[0.000050005598,0.00016760733,0.00024879313,0.00074959465,0.00016527435,0.00020332732,0.0003427855,0.00026552807,0.0000030377334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052267907,0.00011436974,0.0016506842,0.00001816431,0.00007129161,3.862594e-8,0.00084448047,0.00029586072,0.02614961,0.93287003,0.000487976,0.037445202],"study_design_scores_gemma":[0.000019795918,0.000028316226,0.00005683314,0.00044532723,0.00003281289,8.602203e-8,0.00087928126,0.19214784,0.44507718,0.3611172,0.00006205044,0.00013325074],"about_ca_topic_score_codex":0.0002729265,"about_ca_topic_score_gemma":0.0000049180767,"teacher_disagreement_score":0.57175285,"about_ca_system_score_codex":0.00003350934,"about_ca_system_score_gemma":0.00006877513,"threshold_uncertainty_score":0.6834829},"labels":[],"label_agreement":null},{"id":"W4409421084","doi":"10.1002/mma.10963","title":"Disease Transmission on Random Graphs Using Edge‐Based Percolation","year":2025,"lang":"en","type":"article","venue":"Mathematical Methods in the Applied Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Percolation (cognitive psychology); Random graph; Enhanced Data Rates for GSM Evolution; Transmission (telecommunications); Statistical physics; Combinatorics; Graph; Artificial intelligence; Telecommunications; Physics; Computer science","score_opus":0.06333096638941675,"score_gpt":0.42914468047570703,"score_spread":0.36581371408629026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409421084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02146989,0.000020171123,0.9476049,0.0003454807,0.000017152963,0.00040859982,6.589974e-7,0.000029544759,0.030103585],"genre_scores_gemma":[0.5940114,2.256429e-7,0.40574494,0.00014872603,0.000015915733,0.000065005406,7.661057e-7,0.0000028943018,0.000010065123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856573,0.00043957488,0.0002847423,0.0002627014,0.00025585966,0.00019136243],"domain_scores_gemma":[0.99773943,0.0018767625,0.00006262116,0.00026829125,0.000013504342,0.00003940231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034229,0.0001268138,0.00023203863,0.00019161185,0.00030089176,0.000099810495,0.00044013935,0.000021699643,0.00014706104],"category_scores_gemma":[0.000036577643,0.000075244214,0.00012296234,0.0010892411,0.00022572768,0.000038942668,0.000029927738,0.00014115678,0.0000025627776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047494334,0.00021802628,0.00031779174,0.000024635161,0.000009465336,2.2044763e-7,0.0002240314,0.0027591097,0.00290297,0.92937946,0.00004604918,0.064070754],"study_design_scores_gemma":[0.00019333458,0.0000074654163,0.0001414493,0.00006872667,0.000039343486,2.560541e-8,0.00016892103,0.284349,0.0021155195,0.7127522,0.0000960036,0.00006801025],"about_ca_topic_score_codex":0.0000049602963,"about_ca_topic_score_gemma":1.6762277e-7,"teacher_disagreement_score":0.57254153,"about_ca_system_score_codex":0.000015222949,"about_ca_system_score_gemma":0.00005107369,"threshold_uncertainty_score":0.306837},"labels":[],"label_agreement":null},{"id":"W4409723334","doi":"10.1109/tnse.2025.3563901","title":"A Probabilistic Model for Information Diffusion in Social Networks: Insights From Twitter Data","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Probabilistic logic; Social media; Computer science; Diffusion; Microblogging; Data science; World Wide Web; Artificial intelligence","score_opus":0.018758181238722624,"score_gpt":0.2567785706425606,"score_spread":0.23802038940383796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409723334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042232636,0.000018909148,0.9571149,0.000050802515,0.00013682642,0.00023539193,0.00001163778,0.000049603223,0.00014929193],"genre_scores_gemma":[0.99580765,0.000006458181,0.0038566797,0.000072441864,0.00012694004,0.00008377558,0.000024852288,0.0000050612207,0.000016144657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991906,0.000006527896,0.0002123573,0.00023425394,0.00012445728,0.00023176226],"domain_scores_gemma":[0.9995698,0.00007886322,0.000032519365,0.0002334142,0.000051517334,0.00003393947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019522141,0.000113874834,0.00014405308,0.00019521148,0.0002998621,0.0001135836,0.00026893665,0.00003326754,0.0000030657873],"category_scores_gemma":[0.0000024349945,0.000111183836,0.000030653,0.00085778226,0.00005189917,0.00055425277,0.000011756322,0.0001451653,4.1243985e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010119859,0.000021925862,0.00004226156,0.0000056687395,0.000011188726,3.193463e-8,0.00019225372,0.98072743,0.00006929535,0.0016539712,0.00037655115,0.016889293],"study_design_scores_gemma":[0.00018900195,0.0000066340303,0.0003151208,0.000058266804,0.000025917061,2.7153934e-8,0.000030802752,0.99576086,0.000027564663,0.003024795,0.00045407092,0.000106945095],"about_ca_topic_score_codex":0.000054753826,"about_ca_topic_score_gemma":0.000028313812,"teacher_disagreement_score":0.953575,"about_ca_system_score_codex":0.000049747985,"about_ca_system_score_gemma":0.000064328466,"threshold_uncertainty_score":0.45339453},"labels":[],"label_agreement":null},{"id":"W4409787640","doi":"10.61091/jcmcc127a-399","title":"Analysis of multipath effects in global trade networks based on multimodal, high-dimensional, heterogeneous Transformer structures: deconstruction of nonlinear cascades and dynamic chain reactions","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Nonlinear system; Deconstruction (building); Transformer; Computer science; Electronic engineering; Engineering; Physics; Electrical engineering; Quantum mechanics","score_opus":0.004352142653460466,"score_gpt":0.2582691472555364,"score_spread":0.25391700460207595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409787640","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94431496,0.00013359023,0.054000385,0.00003110906,0.0012015146,0.00026102466,0.000013223797,0.000010746713,0.000033438435],"genre_scores_gemma":[0.9923777,0.0000101814985,0.0074571003,0.0000068057966,0.00012395647,0.0000024028109,0.000008927812,0.000012585703,3.2987774e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978001,0.0001584639,0.001270793,0.0002234207,0.0003321961,0.00021502393],"domain_scores_gemma":[0.9976243,0.0008940463,0.0010157347,0.00020189202,0.0001815149,0.000082516075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006219854,0.00026953482,0.0011760714,0.00057868374,0.00011641844,0.000042111507,0.0001733036,0.00013193316,0.000003871668],"category_scores_gemma":[0.000055696637,0.00024688704,0.0003392589,0.0010073818,0.00011578804,0.00007010512,0.00004374982,0.0003410281,1.705147e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081386167,0.0030664783,0.035701517,0.00069674215,0.004495783,0.000016122784,0.00057523046,0.40829474,0.0016980148,0.5131506,0.000015055914,0.031475876],"study_design_scores_gemma":[0.0033086583,0.0003626106,0.0044048713,0.0005269889,0.0010597542,0.0000039613674,0.00008698354,0.8799952,0.0009429707,0.10912489,0.000004578093,0.00017848129],"about_ca_topic_score_codex":0.00014755975,"about_ca_topic_score_gemma":0.0000079892925,"teacher_disagreement_score":0.4717005,"about_ca_system_score_codex":0.00008789752,"about_ca_system_score_gemma":0.00008813606,"threshold_uncertainty_score":0.99999833},"labels":[],"label_agreement":null},{"id":"W4409912700","doi":"10.1098/rsos.250032","title":"Edge-based modelling for disease transmission on random graphs: an application to mitigate a syphilis outbreak","year":2025,"lang":"en","type":"article","venue":"Royal Society Open Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Kingston Health Sciences Centre; Queen's University; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Canada Foundation for Innovation","keywords":"Outbreak; Syphilis; Disease transmission; Transmission (telecommunications); Computer science; Random graph; Disease; Enhanced Data Rates for GSM Evolution; Virology; Biology; Theoretical computer science; Medicine; Artificial intelligence; Graph; Telecommunications; Human immunodeficiency virus (HIV)","score_opus":0.014874567885852346,"score_gpt":0.31171616740507235,"score_spread":0.29684159951922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409912700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024082191,0.0000132132145,0.9720361,0.0008843361,0.00002075554,0.0014901935,0.000029290426,0.00005371659,0.0013901765],"genre_scores_gemma":[0.96872395,6.8607164e-7,0.029608712,0.0006093072,0.000040661143,0.0006670936,0.00004752207,0.000009158696,0.00029290002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858594,0.000028774677,0.0002065541,0.00063601485,0.0002500297,0.0002927116],"domain_scores_gemma":[0.99897534,0.000082544284,0.00006137151,0.00047522952,0.0001528886,0.00025260358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000829692,0.00014480474,0.00020249032,0.000056480498,0.0007491051,0.0003429576,0.0011922129,0.000021401092,0.00002560448],"category_scores_gemma":[0.0000039544852,0.00013004786,0.0002579197,0.00082235655,0.00012807352,0.00018106078,0.00012943709,0.000078107696,0.0000027732008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004020416,0.00053908356,0.0022707817,0.000034583198,0.000046197532,9.0885926e-8,0.00051545445,0.72905344,0.0020554513,0.044536915,0.0050344444,0.21551152],"study_design_scores_gemma":[0.00066329277,0.000036390647,0.00027904406,0.00006748209,0.000044619654,2.5107827e-9,0.000059867256,0.9675458,0.0021344486,0.024143353,0.0048690215,0.00015669617],"about_ca_topic_score_codex":0.00035236668,"about_ca_topic_score_gemma":0.0000037765628,"teacher_disagreement_score":0.94464177,"about_ca_system_score_codex":0.00005979089,"about_ca_system_score_gemma":0.00025307003,"threshold_uncertainty_score":0.5761587},"labels":[],"label_agreement":null},{"id":"W4410118203","doi":"10.1109/tnse.2025.3567348","title":"On the Design of Resilient Distributed Single Time-Scale Estimators: A Graph-Theoretic Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Estimator; Graph; Distributed computing; Mathematics; Theoretical computer science; Statistics","score_opus":0.00786012365765941,"score_gpt":0.20845579276119727,"score_spread":0.20059566910353788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410118203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018648397,0.000020534633,0.9802945,0.000046169676,0.00005939345,0.00018671124,0.0000054117036,0.00005841171,0.00068044703],"genre_scores_gemma":[0.9931431,0.000003455985,0.006734019,0.000016466078,0.000020660902,0.00004575147,0.0000012243091,0.000006641592,0.000028689832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991504,0.000025932031,0.00016569893,0.00022458652,0.00018854748,0.00024481988],"domain_scores_gemma":[0.9993538,0.0002447393,0.000035391393,0.00026773557,0.000053027536,0.00004529109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048258566,0.00012543371,0.00015299872,0.00014458693,0.0002730914,0.00005448625,0.00022329325,0.000020836114,0.000021144448],"category_scores_gemma":[0.000003748009,0.000095208656,0.000062192186,0.001544385,0.00022029075,0.00006332373,0.000003843135,0.00014707941,0.0000012503606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010109013,0.000080100755,0.000014318231,0.000005485398,0.00002487022,6.872184e-8,0.000035826342,0.98518354,0.0019091729,0.010165414,0.00040219037,0.0021689339],"study_design_scores_gemma":[0.00008261497,0.00006187927,0.00005546035,0.00011695799,0.00005012611,3.2990343e-7,0.000031198968,0.98413044,0.011299716,0.0040003425,0.000056362293,0.00011459553],"about_ca_topic_score_codex":0.000008346604,"about_ca_topic_score_gemma":2.3161132e-7,"teacher_disagreement_score":0.9744947,"about_ca_system_score_codex":0.00003185619,"about_ca_system_score_gemma":0.00003958037,"threshold_uncertainty_score":0.38824964},"labels":[],"label_agreement":null},{"id":"W4410252383","doi":"10.1016/j.sigpro.2025.110077","title":"Imputation of time-varying edge flows in graphs by multilinear kernel regression and manifold learning","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Air Force Office of Scientific Research; Japan Science and Technology Agency","keywords":"Multilinear map; Imputation (statistics); Regression; Mathematics; Kernel regression; Kernel (algebra); Artificial intelligence; Enhanced Data Rates for GSM Evolution; Computer science; Pattern recognition (psychology); Statistics; Combinatorics; Missing data; Pure mathematics","score_opus":0.006425661802753713,"score_gpt":0.26826590457837063,"score_spread":0.2618402427756169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410252383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88637745,0.0010776707,0.108870044,0.000034075183,0.000009393232,0.00015681783,0.0000022635395,0.000066745706,0.0034055547],"genre_scores_gemma":[0.99719673,0.0000051018255,0.0025088412,0.00000880436,0.000023816403,0.000008334535,0.000030116234,0.000010167382,0.00020811225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922305,0.000053016498,0.0002704285,0.00021512757,0.00009582856,0.00014256709],"domain_scores_gemma":[0.9996575,0.00005760978,0.00014664516,0.000059225058,0.000056536577,0.000022466427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020467553,0.00011492195,0.0002036143,0.00016435725,0.00011951195,0.00004453531,0.00007356988,0.000034858473,0.000040556668],"category_scores_gemma":[0.0000048108373,0.000108569606,0.000045286786,0.0003875761,0.000024684576,0.00014628534,0.00006290247,0.00018030779,9.006092e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005183614,0.00011939646,0.11388353,0.00017072793,0.000044225624,0.0000012434213,0.0005524689,0.0036270123,0.1479073,0.00039747826,0.0003212049,0.73292357],"study_design_scores_gemma":[0.00044737794,0.000024786596,0.0009699203,0.0008262466,0.000041216583,2.2043965e-7,0.00018732117,0.95594037,0.030731736,0.01050887,0.00015540837,0.0001665431],"about_ca_topic_score_codex":0.000103082704,"about_ca_topic_score_gemma":0.0000020808934,"teacher_disagreement_score":0.95231336,"about_ca_system_score_codex":0.000014015801,"about_ca_system_score_gemma":0.000032182008,"threshold_uncertainty_score":0.442734},"labels":[],"label_agreement":null},{"id":"W4410342136","doi":"10.1109/tsg.2025.3569688","title":"Byzantine-Resilient Distributed P2P Energy Trading via Spatial–Temporal Anomaly Detection","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Smart Grid","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Chengdu Science and Technology Program; National Natural Science Foundation of China","keywords":"Anomaly detection; Byzantine fault tolerance; Computer science; Byzantine architecture; Energy (signal processing); Anomaly (physics); Energy exchange; Distributed computing; Real-time computing; Artificial intelligence; Geology; Fault tolerance; Geography; Physics","score_opus":0.006772960643703891,"score_gpt":0.2317882176671611,"score_spread":0.2250152570234572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410342136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041017726,0.000016711838,0.95589185,0.00013894778,0.0008515297,0.00015809572,0.000104019025,0.00024803716,0.001573067],"genre_scores_gemma":[0.99862814,0.0000038950056,0.0003405892,0.000055490797,0.00027599483,0.0001197578,0.00008530072,0.000023040477,0.00046778872],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985636,0.00009309807,0.00041940948,0.00041892417,0.0001844147,0.0003205779],"domain_scores_gemma":[0.999248,0.00007596109,0.00011008002,0.00040664754,0.00007441307,0.00008488241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011616116,0.00026564734,0.00031406127,0.000301228,0.0003895285,0.000068426525,0.00018694781,0.000068555,0.00039269126],"category_scores_gemma":[6.9416063e-7,0.00027961755,0.00035009813,0.00074345607,0.000052177253,0.00011815745,0.0000030041429,0.00025920733,0.00001414441],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047712898,0.0023150812,0.013488502,0.00004836141,0.0017507762,0.000011943992,0.00014354604,0.023830032,0.048780214,0.00219207,0.009607068,0.89735526],"study_design_scores_gemma":[0.0010716608,0.00020908528,0.0033327034,0.000101996215,0.0004852062,0.0000029517926,0.00007144771,0.22917287,0.7038373,0.0018460067,0.059155088,0.0007136984],"about_ca_topic_score_codex":0.0061793677,"about_ca_topic_score_gemma":0.0017032182,"teacher_disagreement_score":0.9576104,"about_ca_system_score_codex":0.000068019115,"about_ca_system_score_gemma":0.000044502227,"threshold_uncertainty_score":0.9999656},"labels":[],"label_agreement":null},{"id":"W4410407622","doi":"10.1038/s42005-025-02122-0","title":"Symmetry-driven embedding of networks in hyperbolic space","year":2025,"lang":"en","type":"article","venue":"Communications Physics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Embedding; Space (punctuation); Symmetry (geometry); Hyperbolic space; Mathematics; Pure mathematics; Topology (electrical circuits); Computer science; Geometry; Artificial intelligence; Combinatorics","score_opus":0.019006751251730496,"score_gpt":0.3289957161040384,"score_spread":0.30998896485230787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410407622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06553304,0.0011939399,0.78364044,0.00081883784,0.00006717218,0.00047854354,0.000017515347,0.00013894227,0.14811158],"genre_scores_gemma":[0.9873546,0.000069916445,0.0122592915,0.000025300342,0.000047337522,0.00004753769,0.000056186043,0.000010406997,0.0001294287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999273,0.000102432314,0.0002794389,0.00013166995,0.00006171985,0.00015175845],"domain_scores_gemma":[0.99789953,0.00023207949,0.0001275474,0.0016383927,0.00008222931,0.000020224034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011032388,0.00010693803,0.00025603813,0.00011062623,0.00010008676,0.000020077057,0.00085959886,0.000027939825,0.000016390262],"category_scores_gemma":[0.000005448086,0.000121645055,0.00011627749,0.0011917201,0.0001115698,0.000074804404,0.0005443732,0.0002485665,0.00000320963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022506204,0.0002756064,0.077098005,0.000006772287,0.00008853722,4.1144133e-8,0.00013002614,0.014164114,0.00021080936,0.8715148,0.0009038946,0.035605133],"study_design_scores_gemma":[0.00031668768,0.000011212492,0.008048576,0.00022290258,0.000096229254,5.608014e-8,0.00030406783,0.8617802,0.0009621439,0.12100966,0.0070188805,0.00022938322],"about_ca_topic_score_codex":0.00025997715,"about_ca_topic_score_gemma":0.000033248234,"teacher_disagreement_score":0.92182153,"about_ca_system_score_codex":0.00003423344,"about_ca_system_score_gemma":0.00004061518,"threshold_uncertainty_score":0.49605414},"labels":[],"label_agreement":null},{"id":"W4410455240","doi":"10.1038/s41467-025-59777-0","title":"Characteristic scales and adaptation in higher-order contagions","year":2025,"lang":"en","type":"article","venue":"Nature Communications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of General Medical Sciences; Fonds de recherche du Québec – Nature et technologies; Horizon 2020 Framework Programme; Universitat Rovira i Virgili; European Commission; U.S. Department of Health and Human Services; National Institutes of Health; National Science Foundation","keywords":"Adaptation (eye); Order (exchange); Computer science; Biology; Neuroscience; Business","score_opus":0.02432419481676322,"score_gpt":0.3164634228778423,"score_spread":0.29213922806107906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410455240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38616857,0.03054294,0.076597735,0.11707752,0.0007217992,0.0027169192,0.00024864706,0.00087027205,0.3850556],"genre_scores_gemma":[0.9917267,0.000086147644,0.007358342,0.00017849993,0.000024038112,0.00007375381,0.00017097863,0.0000047782464,0.00037675223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99951375,0.000074761156,0.00017666044,0.000113172806,0.000037876744,0.000083754014],"domain_scores_gemma":[0.99899006,0.0002047776,0.000054661716,0.0006527196,0.000079654084,0.00001813545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000091876886,0.00007268973,0.00012015915,0.00012010529,0.00013921956,0.000034000215,0.0003037515,0.000060156155,0.000045841753],"category_scores_gemma":[0.0000126918285,0.00007514284,0.000029200695,0.0004542229,0.00007602406,0.00006149534,0.000178157,0.00042318166,0.0000025364666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030415395,0.000105561594,0.103403136,0.0000027994645,0.000039564195,7.712862e-8,0.000083806364,0.000008269846,0.00015267653,0.87056017,0.0014910231,0.024149897],"study_design_scores_gemma":[0.0004474166,0.000010581258,0.74404955,0.00011231497,0.00008825117,2.1296634e-7,0.00030505197,0.030230872,0.000044954348,0.06857831,0.15588786,0.0002446614],"about_ca_topic_score_codex":0.00011636969,"about_ca_topic_score_gemma":0.00095847814,"teacher_disagreement_score":0.8019818,"about_ca_system_score_codex":0.000020466125,"about_ca_system_score_gemma":0.000024499015,"threshold_uncertainty_score":0.30642357},"labels":[],"label_agreement":null},{"id":"W4410518263","doi":"10.3390/info16050417","title":"A Novel Method for Community Detection in Bipartite Networks","year":2025,"lang":"en","type":"article","venue":"Information","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Islamic Azad University","keywords":"Bipartite graph; Computer science; Computational biology; Artificial intelligence; Theoretical computer science; Biology; Graph","score_opus":0.014898281808755846,"score_gpt":0.31294387044681987,"score_spread":0.298045588638064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410518263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009652777,0.0000031783359,0.9840936,0.00005123505,0.00004531022,0.00023564392,0.000004590463,0.000044875786,0.0058687967],"genre_scores_gemma":[0.9793605,3.9524633e-7,0.020245967,0.00010738551,0.000032646407,0.00014248482,0.00009092042,0.000002032554,0.000017651268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999552,0.00004100593,0.00023954379,0.000033370183,0.00003471869,0.000099358374],"domain_scores_gemma":[0.99958193,0.000119556695,0.00008310018,0.00014465304,0.000060225382,0.00001053915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048238813,0.000057353547,0.00009424304,0.00015226493,0.00011383178,0.000046207115,0.00008380868,0.000027983726,0.000012488526],"category_scores_gemma":[0.000009529621,0.000060117276,0.00005474987,0.00035723628,0.0000067571555,0.00037578627,0.00003549279,0.0001460272,0.0000020306497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003682022,0.00006900835,0.0031277651,0.000021539026,0.00004644561,4.2328634e-9,0.0005483577,0.018007504,0.0009355307,0.0247558,0.0009606934,0.9514905],"study_design_scores_gemma":[0.0003717867,0.000015232216,0.0041873716,0.000026011947,0.000018003533,8.268961e-8,0.00021238552,0.96926033,0.0049205315,0.006057149,0.0148561895,0.000074930926],"about_ca_topic_score_codex":0.0010058852,"about_ca_topic_score_gemma":0.00025082834,"teacher_disagreement_score":0.9697077,"about_ca_system_score_codex":0.000036250465,"about_ca_system_score_gemma":0.000012073644,"threshold_uncertainty_score":0.24515113},"labels":[],"label_agreement":null},{"id":"W4410518649","doi":"10.1002/oik.11163","title":"Quantifying community keystoneness in metacommunities under disturbance","year":2025,"lang":"en","type":"article","venue":"Oikos","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Disturbance (geology); Ecology; Metacommunity; Geography; Community; Biology; Ecosystem; Biological dispersal; Sociology","score_opus":0.05177791338207794,"score_gpt":0.333760311825476,"score_spread":0.28198239844339806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410518649","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8982294,0.00031416529,0.03421118,0.0002439553,0.000069801004,0.00013290581,0.0000068002582,0.00009551633,0.06669625],"genre_scores_gemma":[0.9982074,0.000005077436,0.00054648734,0.00008970667,0.000025900592,0.000050260558,0.000034609493,0.0000086739965,0.0010318782],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99909526,0.00033860136,0.00021247966,0.000099506535,0.00007476846,0.00017939894],"domain_scores_gemma":[0.9990904,0.00023405018,0.000054465356,0.0005676337,0.000035831705,0.000017624416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003395161,0.00012247656,0.00024806947,0.00013324135,0.00025969412,0.000058012723,0.00039164285,0.000024418856,0.0001605891],"category_scores_gemma":[0.000004202754,0.00012261093,0.00009134666,0.00044008452,0.00006899592,0.000091224836,0.00022822215,0.0004239157,0.0000070266187],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014199067,0.0003743341,0.53324896,0.000040796138,0.00019194942,7.4961844e-7,0.0008062247,0.0006792462,0.0005635279,0.44409436,0.0014371743,0.01854845],"study_design_scores_gemma":[0.0013925768,0.000042413554,0.5786649,0.0008031938,0.00024700482,4.8036065e-7,0.0161718,0.008679052,0.01255913,0.3531553,0.027213184,0.0010710055],"about_ca_topic_score_codex":0.0064681415,"about_ca_topic_score_gemma":0.0012965399,"teacher_disagreement_score":0.09997798,"about_ca_system_score_codex":0.00004277679,"about_ca_system_score_gemma":0.000026802614,"threshold_uncertainty_score":0.9777939},"labels":[],"label_agreement":null},{"id":"W4410561843","doi":"10.1007/978-3-031-92898-7_6","title":"Improving Community Detection via Community Association Strength Scores","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Toronto Metropolitan University","funders":"","keywords":"Computer science; Association (psychology); Association rule learning; Artificial intelligence; Data mining; Psychology","score_opus":0.011277994865589069,"score_gpt":0.24798885926603614,"score_spread":0.23671086440044709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410561843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040462576,0.000039384948,0.98940116,0.000042463325,0.00034710582,0.0002564784,0.000015184479,0.00014124138,0.005710729],"genre_scores_gemma":[0.9796023,0.0000026025787,0.01948029,0.00013005563,0.00037252207,0.000010999481,0.000049807983,0.000020105257,0.00033133585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980107,0.00030587602,0.0004357158,0.00039298608,0.00046172243,0.00039300462],"domain_scores_gemma":[0.99678206,0.0012705622,0.00050410314,0.0010983878,0.00028100197,0.00006389348],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0017150588,0.00037906438,0.0004830641,0.0005316821,0.0011243524,0.00028196478,0.001296644,0.00020058407,0.000050354178],"category_scores_gemma":[0.00006882246,0.00039342666,0.00018928069,0.00048476766,0.00023207605,0.00020393265,0.001102953,0.0030101351,0.0000053652393],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040097416,0.000061729035,0.0032766263,0.00002523627,0.000045534838,4.538543e-7,0.00027370805,0.0016619135,0.00034291367,0.00067916926,0.000019180063,0.99360955],"study_design_scores_gemma":[0.0004090475,0.00025148728,0.0030846803,0.0007189153,0.00016808,0.0000016185686,0.0000039868046,0.525546,0.01622084,0.45180658,0.0005841755,0.001204576],"about_ca_topic_score_codex":0.00505879,"about_ca_topic_score_gemma":0.0030434232,"teacher_disagreement_score":0.99240494,"about_ca_system_score_codex":0.00068382657,"about_ca_system_score_gemma":0.0001885191,"threshold_uncertainty_score":0.99985176},"labels":[],"label_agreement":null},{"id":"W4410561914","doi":"10.1007/978-3-031-92898-7_12","title":"The Multilayer Artificial Benchmark for Community Detection (mABCD)","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Benchmark (surveying); Artificial intelligence; Cartography","score_opus":0.019365023228292092,"score_gpt":0.2779493938660811,"score_spread":0.258584370637789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410561914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002101996,0.00007757311,0.99383086,0.0001643383,0.0005666868,0.0005017434,0.000014004127,0.000057185145,0.004577436],"genre_scores_gemma":[0.9696856,0.000004493688,0.028440956,0.00017455171,0.0009929965,0.000061110564,0.000025332349,0.000021646269,0.000593275],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847806,0.00005854425,0.00037399092,0.00044991443,0.00027375176,0.00036572455],"domain_scores_gemma":[0.9972045,0.0014582272,0.00020350791,0.0008727002,0.00021570023,0.0000454015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009692526,0.0002976082,0.00031784418,0.00023892832,0.0012747531,0.00030434845,0.0011412593,0.00011387708,0.000026647154],"category_scores_gemma":[0.00003275351,0.00023238723,0.0002270149,0.00028302483,0.00044570176,0.000080257916,0.0004951927,0.00088927476,0.0000030909018],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010772581,0.000018925732,0.000042009277,0.0000070715055,0.000024893703,2.0856315e-7,0.00009721649,0.003078636,0.00011403293,0.011077989,0.00008144412,0.9854468],"study_design_scores_gemma":[0.0000946644,0.00007355534,0.00005778204,0.0001235896,0.00003925278,4.7275935e-7,9.294412e-7,0.33036458,0.0053564413,0.6502348,0.01332401,0.00032991526],"about_ca_topic_score_codex":0.00019510587,"about_ca_topic_score_gemma":0.00096471095,"teacher_disagreement_score":0.9851169,"about_ca_system_score_codex":0.00012658896,"about_ca_system_score_gemma":0.00016041815,"threshold_uncertainty_score":0.9804499},"labels":[],"label_agreement":null},{"id":"W4410561938","doi":"10.1007/978-3-031-92898-7_9","title":"The Artificial Benchmark for Community Detection with Outliers and Overlapping Communities ($$\\mathbf {ABCD{+}o}^2$$)","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Toronto Metropolitan University","funders":"","keywords":"Benchmark (surveying); Computer science; Outlier; Artificial intelligence; Data mining; Cartography; Geography","score_opus":0.016780749018176867,"score_gpt":0.25093160733773456,"score_spread":0.2341508583195577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410561938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027691016,0.00011467198,0.9927433,0.00011958695,0.00018488608,0.00048427496,0.000014366378,0.000054637043,0.0035151776],"genre_scores_gemma":[0.98184186,0.000012131863,0.01749063,0.00013443432,0.0002802219,0.000041744726,0.000024314355,0.000019634359,0.0001550424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987299,0.00007853871,0.00030710633,0.0002980497,0.00025143576,0.0003349869],"domain_scores_gemma":[0.99713546,0.001666169,0.00021344723,0.00076073216,0.00017826974,0.000045945635],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00088810397,0.00031616067,0.00036514175,0.0002548013,0.0018622967,0.00046925808,0.0008161012,0.000088320674,0.000007376931],"category_scores_gemma":[0.000012349187,0.00023532288,0.000100509904,0.00023963097,0.0010025107,0.000114965485,0.00050988444,0.00092698383,3.8916818e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003360111,0.000020106998,0.0003740839,0.000028882469,0.00007326086,3.74168e-7,0.0010479374,0.0029467312,0.000057232548,0.022880629,0.000027613512,0.97250956],"study_design_scores_gemma":[0.000262114,0.00030838462,0.00031646312,0.000699049,0.00011237327,0.0000034230363,0.00005772564,0.31432545,0.00094364886,0.6769979,0.005273753,0.000699701],"about_ca_topic_score_codex":0.0005637224,"about_ca_topic_score_gemma":0.00324454,"teacher_disagreement_score":0.97907275,"about_ca_system_score_codex":0.000100177844,"about_ca_system_score_gemma":0.00014488155,"threshold_uncertainty_score":0.99943715},"labels":[],"label_agreement":null},{"id":"W4410989701","doi":"10.3390/en18112937","title":"Critical Node Identification for Cyber–Physical Power Distribution Systems Based on Complex Network Theory: A Real Case Study","year":2025,"lang":"en","type":"article","venue":"Energies","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Cyber-physical system; Network theory; Identification (biology); Complex network; Node (physics); Computer science; Electric power system; Power network; Power (physics); Engineering; Mathematics; Physics; Statistics","score_opus":0.015232913415988886,"score_gpt":0.3285202872490714,"score_spread":0.3132873738330825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410989701","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5943162,0.000021117301,0.40101635,0.0001689726,0.0002753528,0.0007367902,0.00017301553,0.00023147084,0.0030607188],"genre_scores_gemma":[0.9981189,2.4448016e-7,0.00026102902,0.000026153433,0.00044549393,0.00052247033,0.00041674622,0.000016784274,0.00019218621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859864,0.00026878886,0.00031590433,0.00037103734,0.00016444807,0.00028120462],"domain_scores_gemma":[0.9983178,0.00088011404,0.00008757951,0.00049440097,0.00017581215,0.000044306056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043839435,0.00019406021,0.00032116284,0.00006151061,0.0003835515,0.00020063278,0.00016543541,0.000032789107,0.00002515393],"category_scores_gemma":[0.000030502162,0.00017994121,0.00018422415,0.00032543138,0.00007915732,0.00007512275,0.000057502097,0.0001073828,0.000003931465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000971709,0.00085121713,0.004683076,0.00001568695,0.00015321125,0.000012612549,0.00012272416,0.06813188,0.00012053344,0.9100898,0.014316944,0.0014051497],"study_design_scores_gemma":[0.0015762658,0.0005007543,0.012846949,0.00017817835,0.0009021709,0.0000041362396,0.0063838665,0.88137776,0.0006125765,0.086983375,0.007828575,0.0008053905],"about_ca_topic_score_codex":0.00052998576,"about_ca_topic_score_gemma":0.00002129886,"teacher_disagreement_score":0.8231064,"about_ca_system_score_codex":0.00006802912,"about_ca_system_score_gemma":0.000037794918,"threshold_uncertainty_score":0.73377895},"labels":[],"label_agreement":null},{"id":"W4410993347","doi":"10.1103/physrevresearch.7.l022050","title":"Random graphs with specific degree distribution and giant component size","year":2025,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; Engineering Research Centers; Université Laval","keywords":"Component (thermodynamics); Degree distribution; Degree (music); Giant component; Random graph; Mathematics; Statistics; Distribution (mathematics); Combinatorics; Physics; Graph; Complex network; Mathematical analysis","score_opus":0.05486707360276535,"score_gpt":0.39048362783302365,"score_spread":0.3356165542302583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410993347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52866983,0.1648589,0.1728153,0.015855407,0.00011951332,0.010464802,0.00028050726,0.000497595,0.10643817],"genre_scores_gemma":[0.99439645,0.004694306,0.00032249806,0.0000356115,0.00010233905,0.00019120972,0.00007177875,0.000009482424,0.00017634974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829996,0.000345008,0.00021357604,0.0003577768,0.0004298583,0.0003538182],"domain_scores_gemma":[0.9984172,0.0007956944,0.000046535064,0.00041664578,0.0002231529,0.00010078739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007285564,0.0001516515,0.00048091923,0.000049009155,0.0002130858,0.00007347983,0.00022624545,0.000011645791,0.00011662818],"category_scores_gemma":[0.000031214942,0.00010610825,0.00014985145,0.001017619,0.0002424857,0.000058561312,0.00019582812,0.00040332423,0.00002245828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018162892,0.0007042607,0.0046661925,0.0006925253,0.00029238232,0.0000055769847,0.000027986594,0.0000032449252,0.0020492033,0.529754,0.051838323,0.40978467],"study_design_scores_gemma":[0.0038039067,0.00042798824,0.057744768,0.010455684,0.00048265187,0.000002335572,0.000092278606,0.006061093,0.00457605,0.40938094,0.5060095,0.0009628089],"about_ca_topic_score_codex":0.000098221644,"about_ca_topic_score_gemma":0.0000041701437,"teacher_disagreement_score":0.4657266,"about_ca_system_score_codex":0.000039414757,"about_ca_system_score_gemma":0.0000432148,"threshold_uncertainty_score":0.4326969},"labels":[],"label_agreement":null},{"id":"W4411112933","doi":"10.18653/v1/2025.clpsych-1.22","title":"Prompt Engineering for Capturing Dynamic Mental Health Self States from Social Media Posts","year":2025,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Social media; Mental health; Computer science; Human–computer interaction; Multimedia; Psychology; World Wide Web; Psychotherapist","score_opus":0.004382292148150491,"score_gpt":0.2592048533349051,"score_spread":0.2548225611867546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411112933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6192306,0.00027213249,0.3729422,0.0033959453,0.00032919334,0.0011070425,0.00048837,0.00086659275,0.0013678977],"genre_scores_gemma":[0.9813093,0.0000028457937,0.017639443,0.000057790898,0.00015297782,0.000061048035,0.00065137877,0.000014402429,0.00011082551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927354,0.000012096387,0.00020547908,0.00019784758,0.00007239902,0.00023863946],"domain_scores_gemma":[0.99969846,0.0000903245,0.0000525768,0.00009719388,0.000024424207,0.00003704414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007960066,0.00012478349,0.00021758124,0.000068821864,0.00013189917,0.00004314227,0.00011764985,0.000018515066,0.00009374153],"category_scores_gemma":[0.0000013468295,0.00012385265,0.0001109335,0.00011114562,0.0000075301787,0.00004895267,0.00006737058,0.000075596494,0.0000019585093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017147524,0.0016398377,0.038470346,0.00042815428,0.0067234817,0.000001803893,0.041934554,0.0025178625,0.00992832,0.2759003,0.16046143,0.46182245],"study_design_scores_gemma":[0.0022238248,0.00007515368,0.019782195,0.00022856992,0.00021502492,1.6516387e-7,0.0030547932,0.8688291,0.0070863683,0.06264913,0.03478121,0.0010744984],"about_ca_topic_score_codex":0.00053630077,"about_ca_topic_score_gemma":0.00017014242,"teacher_disagreement_score":0.8663112,"about_ca_system_score_codex":0.00010267167,"about_ca_system_score_gemma":0.000048567203,"threshold_uncertainty_score":0.50505644},"labels":[],"label_agreement":null},{"id":"W4411134290","doi":"10.28924/2291-8639-23-2025-137","title":"Intuitionistic Fuzzy Quasi-Supergraph Integration for Social Network Decision Making","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Epigraph; Mathematics; Fuzzy logic; Mathematical economics; Artificial intelligence; Management science; Computer science; Mathematical optimization; Economics","score_opus":0.0096500403250308,"score_gpt":0.3392827664152169,"score_spread":0.32963272609018607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411134290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006983965,0.00010292992,0.9904749,0.00060648343,0.000068201116,0.0001260852,0.000027894577,0.000010485953,0.0015991007],"genre_scores_gemma":[0.9774398,0.000025116397,0.021285638,0.000100334626,0.00093937916,0.00007019462,0.00007335356,0.0000052638698,0.000060895494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989635,0.000028361006,0.0005583406,0.00015143026,0.00019678497,0.000101623096],"domain_scores_gemma":[0.99848086,0.00026263428,0.00037954978,0.00010002032,0.0007489885,0.000027947573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000330983,0.000101019905,0.00027459362,0.0005124215,0.000254285,0.00017767903,0.00027870722,0.000032374803,0.000063006606],"category_scores_gemma":[0.000013332547,0.00009187015,0.0004504754,0.0008403163,0.000046600548,0.00010776274,0.000050879684,0.00011063043,7.5373197e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049520542,0.00015180692,0.016743442,0.0000023231394,0.0026764967,2.1432729e-7,0.000046398258,0.0012671569,0.00008728541,0.56562895,0.0037935667,0.40955284],"study_design_scores_gemma":[0.00040982728,0.000036522473,0.014827995,0.00008348155,0.0022973728,0.0000013640215,0.0002402686,0.016437277,0.00008116278,0.9417173,0.023708,0.0001594089],"about_ca_topic_score_codex":0.000018969095,"about_ca_topic_score_gemma":0.000037749567,"teacher_disagreement_score":0.9704559,"about_ca_system_score_codex":0.00004303937,"about_ca_system_score_gemma":0.000039937637,"threshold_uncertainty_score":0.37463558},"labels":[],"label_agreement":null},{"id":"W4411187106","doi":"10.1007/978-3-031-93112-3_4","title":"A Constant-Factor Approximation for Pairwise Fair k-Center Clustering","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Constant (computer programming); Pairwise comparison; Cluster analysis; Center (category theory); Factor (programming language); Algorithm; Artificial intelligence; Programming language","score_opus":0.016899236704937204,"score_gpt":0.26283147579698907,"score_spread":0.24593223909205186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411187106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044535307,0.000048413644,0.98994315,0.0001436723,0.00034003513,0.00066658517,0.000063806656,0.00009903902,0.008650772],"genre_scores_gemma":[0.64424455,0.000005304925,0.35312682,0.00040921045,0.000955973,0.00008029162,0.00011312696,0.000045123354,0.0010195909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814874,0.000014404304,0.00040344434,0.0007686677,0.00028631155,0.0003784055],"domain_scores_gemma":[0.99868774,0.00029309106,0.0002230398,0.00055779034,0.0001758991,0.00006242682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023736412,0.0003608725,0.000454448,0.00043798712,0.00016911332,0.00021140407,0.00068767124,0.00011131991,0.00009458541],"category_scores_gemma":[0.000010946216,0.00034188785,0.00022550487,0.00021514644,0.00024146799,0.00014689736,0.00044600904,0.00032868257,0.000003534309],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012474078,0.00003449293,0.00047211093,0.00006243512,0.000044793986,0.0000014393385,0.00015796977,0.0034956643,0.000061024213,0.017880233,0.00016310763,0.9776143],"study_design_scores_gemma":[0.00038126524,0.000063467836,0.000021950198,0.00065423385,0.000032604104,0.0000013531427,3.7521127e-7,0.7847025,0.00069658156,0.20686904,0.006038036,0.0005386086],"about_ca_topic_score_codex":0.000015191736,"about_ca_topic_score_gemma":0.000037658,"teacher_disagreement_score":0.97707564,"about_ca_system_score_codex":0.00015236127,"about_ca_system_score_gemma":0.00019503298,"threshold_uncertainty_score":0.9999033},"labels":[],"label_agreement":null},{"id":"W4411433746","doi":"10.1214/25-aap2166","title":"Cutoff for random walk on random graphs with a community structure","year":2025,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Random walk; Random graph; Cutoff; Mathematics; Statistical physics; Heterogeneous random walk in one dimension; Community structure; Combinatorics; Statistics; Sociology; Discrete mathematics; Physics; Graph; Quantum mechanics","score_opus":0.03495243514477193,"score_gpt":0.30816699619310056,"score_spread":0.27321456104832864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411433746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9585924,0.000028909733,0.016332027,0.0008050378,0.000018692695,0.0026053458,0.000120822224,0.00008074557,0.021416033],"genre_scores_gemma":[0.9979407,0.00000149284,0.0013477555,0.00026162405,0.000033594013,0.0003050769,0.00006199274,0.000010980647,0.000036762438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881506,0.00021289822,0.0003513695,0.0002270082,0.00015315901,0.00024050596],"domain_scores_gemma":[0.9975593,0.0009145268,0.00020175044,0.0010934271,0.0001969103,0.000034073804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012400161,0.00021287164,0.00053260184,0.00006027543,0.00035507375,0.000030895317,0.0005410098,0.000042394924,0.00005489105],"category_scores_gemma":[0.000012875051,0.00012708137,0.00025744797,0.00038402568,0.00027557265,0.000028876462,0.00010825434,0.000358673,5.699059e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.021170976,0.0010158777,0.0030257648,0.0002749529,0.0014336808,5.3386888e-8,0.0011021127,0.0036244043,0.0014880337,0.8989411,0.006866941,0.061056107],"study_design_scores_gemma":[0.002643581,0.0001106135,0.0011197698,0.000045617617,0.00012271939,3.546465e-8,0.00012089524,0.00034119838,0.026523557,0.96712095,0.0017175167,0.00013354702],"about_ca_topic_score_codex":0.00023971508,"about_ca_topic_score_gemma":0.000074890784,"teacher_disagreement_score":0.06817985,"about_ca_system_score_codex":0.0000090195035,"about_ca_system_score_gemma":0.00005446114,"threshold_uncertainty_score":0.51822275},"labels":[],"label_agreement":null},{"id":"W4411571309","doi":"10.1002/cjs.70012","title":"Restricted Tweedie stochastic block models","year":2025,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Block (permutation group theory); Computer science; Econometrics; Mathematics; Combinatorics","score_opus":0.014839005541346468,"score_gpt":0.24385512853511365,"score_spread":0.2290161229937672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411571309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006149177,0.00013712306,0.9868413,0.00018580543,0.00019288895,0.00006673117,0.00025559543,0.000005765095,0.0061656144],"genre_scores_gemma":[0.982321,0.0000016486281,0.01684519,0.000052596613,0.0001901249,0.0000014170583,0.000016868666,0.000009721141,0.00056143507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902076,0.000038551887,0.0004824031,0.00009138224,0.00012682736,0.0002400662],"domain_scores_gemma":[0.99869174,0.00014195697,0.00024356521,0.00017261917,0.00044846427,0.00030164167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001322102,0.00011095042,0.00026810478,0.000390878,0.00011930121,0.00007520143,0.0002604642,0.000026863461,0.00024736172],"category_scores_gemma":[0.0000415273,0.0001092821,0.00008095276,0.0003742368,0.000062769424,0.000063385974,0.000013393775,0.0002456678,0.0000040070104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010964785,0.00003053913,0.0056200423,0.000009815094,0.00041602415,0.00006384959,0.00017680925,0.03298644,0.000024981837,0.5780244,0.36155456,0.021081561],"study_design_scores_gemma":[0.00062772474,0.00011044881,0.005972266,0.00019085279,0.0004714058,0.000010458807,0.00026684703,0.08136081,0.000046919577,0.894358,0.016249642,0.00033466442],"about_ca_topic_score_codex":0.0044436324,"about_ca_topic_score_gemma":0.003294606,"teacher_disagreement_score":0.9761718,"about_ca_system_score_codex":0.00009682682,"about_ca_system_score_gemma":0.0013087399,"threshold_uncertainty_score":0.67174727},"labels":[],"label_agreement":null},{"id":"W4411720772","doi":"10.1088/2058-9565/ade911","title":"Almost device-independent calibration beyond Born’s rule: Bell tests for cross-talk detection","year":2025,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique","keywords":"Calibration; Mathematics; Statistics","score_opus":0.010892207908498555,"score_gpt":0.3130530613307761,"score_spread":0.30216085342227755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9003966,0.0001382187,0.09641966,0.00091855414,0.00014907548,0.00039584507,0.0000114655195,0.00024209566,0.0013285202],"genre_scores_gemma":[0.9984959,0.000004903982,0.001085351,0.00006337395,0.000047403348,0.00013139604,0.000008359062,0.0000069794064,0.00015636804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876666,0.0000102220165,0.00024038837,0.0004744349,0.00016958469,0.00033870808],"domain_scores_gemma":[0.99918133,0.000056427172,0.00010732857,0.0003239224,0.00028897234,0.00004202667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004188912,0.00013537168,0.00018343999,0.0005553594,0.0006555217,0.0001573816,0.0003556489,0.000094414056,0.000020544705],"category_scores_gemma":[0.000048359092,0.00012932622,0.000041844538,0.0017983943,0.00056531886,0.00029417867,0.00019005078,0.00014954404,0.0000025216134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018328034,0.00012934563,0.09070107,0.000022334334,0.000045149704,0.0000014222542,0.000041284613,0.000019709767,0.112119265,0.49259558,0.00053360796,0.30377287],"study_design_scores_gemma":[0.0005521929,0.00022559975,0.010765883,0.000037977683,0.00007334994,0.000005755144,0.00035308598,0.080396056,0.33456534,0.5564295,0.01622704,0.00036821596],"about_ca_topic_score_codex":0.000128992,"about_ca_topic_score_gemma":0.00010268192,"teacher_disagreement_score":0.30340466,"about_ca_system_score_codex":0.000056832538,"about_ca_system_score_gemma":0.00015778522,"threshold_uncertainty_score":0.527377},"labels":[],"label_agreement":null},{"id":"W4412025916","doi":"10.1016/j.eswa.2025.128887","title":"Multiplex graph prompt collaboration for open-set social event detection","year":2025,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China","keywords":"Computer science; Graph; Event (particle physics); Set (abstract data type); Multiplex; Artificial intelligence; Theoretical computer science; Programming language","score_opus":0.016093999057527907,"score_gpt":0.3363110022090546,"score_spread":0.3202170031515267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412025916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014446256,0.00012462403,0.9911439,0.0003569916,0.000051433737,0.004662368,0.000064032916,0.00011977335,0.0020322504],"genre_scores_gemma":[0.9604516,0.0000011542897,0.0029178108,0.000030332641,0.00037238048,0.03514365,0.00024549503,0.000016651964,0.0008209239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990884,0.00004480088,0.00029140228,0.00031855173,0.00009875269,0.00015809808],"domain_scores_gemma":[0.9991645,0.00004926205,0.00017883074,0.00030358788,0.00027101947,0.000032757067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014282648,0.00013626044,0.00021918306,0.0001029166,0.00060571503,0.0002055356,0.0002685046,0.000040074712,0.000012666857],"category_scores_gemma":[0.0000016244818,0.00012316438,0.000067064204,0.0007301305,0.000030266778,0.00012159274,0.0000529162,0.000056082732,0.0000046750365],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002828061,0.0011895106,0.006086524,0.00016281912,0.0013275639,1.6491816e-7,0.0035945852,0.0017671449,0.025180513,0.72711056,0.13585989,0.09743793],"study_design_scores_gemma":[0.001866209,0.000111478774,0.00092854764,0.000105991276,0.00014663556,6.239552e-7,0.005981923,0.029045919,0.011340076,0.011888681,0.93799603,0.0005878961],"about_ca_topic_score_codex":0.00062373665,"about_ca_topic_score_gemma":0.00021396557,"teacher_disagreement_score":0.9882261,"about_ca_system_score_codex":0.00007490856,"about_ca_system_score_gemma":0.00008561963,"threshold_uncertainty_score":0.5022498},"labels":[],"label_agreement":null},{"id":"W4412265324","doi":"","title":"Social Network Analysis:The Significance of Relations","year":2020,"lang":"en","type":"article","venue":"Research at the University of Copenhagen (University of Copenhagen)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for International Governance Innovation","funders":"","keywords":"Social network analysis; Social network (sociolinguistics); Network analysis; Computer science; Data science; World Wide Web; Engineering; Social media","score_opus":0.047350311945314916,"score_gpt":0.2898764157709083,"score_spread":0.24252610382559336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412265324","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.381077,0.002585185,0.119470835,0.010812031,0.00003378072,0.002399777,0.00033574092,0.00010240551,0.48318323],"genre_scores_gemma":[0.9157915,0.000018587703,0.0005983208,0.000014838801,0.000063206186,2.017128e-7,0.000055305096,0.000010115892,0.083447926],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99739486,0.00092500105,0.00023348142,0.00034957516,0.0007039305,0.00039317124],"domain_scores_gemma":[0.9977622,0.0005744244,0.0004218576,0.0005435629,0.0005590616,0.00013886641],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011505588,0.00015396095,0.0005586673,0.0001266979,0.0015893957,0.000017489538,0.0016752452,0.000068642774,0.2415704],"category_scores_gemma":[0.000018522036,0.00015167317,0.00060001726,0.0034518521,0.0011218454,0.00021125408,0.00096499076,0.0004098658,0.0041968375],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028621074,0.00007412548,0.00028724587,0.000020436404,0.0017883588,0.000006512066,0.0039745797,0.0039562937,0.0009684546,0.004069837,0.9833284,0.0012395476],"study_design_scores_gemma":[0.0009503188,0.00022181064,0.03069578,0.000033183038,0.0023644718,2.5879618e-7,0.017551072,0.011242733,0.0013727875,0.00033211944,0.9348955,0.00033992392],"about_ca_topic_score_codex":0.0018025143,"about_ca_topic_score_gemma":0.00058345473,"teacher_disagreement_score":0.5347145,"about_ca_system_score_codex":0.0000798302,"about_ca_system_score_gemma":0.00023561897,"threshold_uncertainty_score":0.9997104},"labels":[],"label_agreement":null},{"id":"W4412375699","doi":"10.1109/tsmc.2025.3580657","title":"Asynchronous Consensus Evolution Mechanism for Large Group Emergency Decision Making: Risk Mitigation Strategy Selection Under Uncertainty","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Selection (genetic algorithm); Mechanism (biology); Asynchronous communication; Computer science; Risk analysis (engineering); Group decision-making; Consensus conference; Operations research; Business; Artificial intelligence; Engineering; Psychology; Computer network","score_opus":0.01028594744035957,"score_gpt":0.26901094348195015,"score_spread":0.2587249960415906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412375699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0912666,0.00032706436,0.9046611,0.000014544972,0.0013027205,0.0013953833,0.00018262753,0.00017037013,0.0006795401],"genre_scores_gemma":[0.99801767,0.000038718856,0.00041656868,0.00000644528,0.00022518715,0.00052321854,0.00002564594,0.0000381139,0.00070844544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976135,0.00029620607,0.00082792755,0.0005792725,0.00027641738,0.00040668802],"domain_scores_gemma":[0.99863964,0.0001902977,0.00039192755,0.00034220653,0.00034808172,0.00008781792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005257636,0.00034863065,0.00046399745,0.00034223366,0.00067510124,0.00018135647,0.00013761023,0.0001833726,0.000028711234],"category_scores_gemma":[0.0000031729624,0.0003547382,0.0002283134,0.00047584265,0.000032475407,0.00007271345,0.0000036245199,0.00026246955,0.000008345501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015525114,0.00042703215,0.001427129,0.00026859445,0.0007910351,5.700148e-7,0.00012839607,0.291663,0.0010428671,0.69481057,0.0013299221,0.007955647],"study_design_scores_gemma":[0.001274838,0.00034279664,0.0006502723,0.0006820559,0.00060007,0.0000075599523,0.00232883,0.94295835,0.00029577065,0.049760513,0.0005641985,0.0005347614],"about_ca_topic_score_codex":0.0017492337,"about_ca_topic_score_gemma":0.0006224296,"teacher_disagreement_score":0.90675104,"about_ca_system_score_codex":0.0002837555,"about_ca_system_score_gemma":0.00006699212,"threshold_uncertainty_score":0.99989045},"labels":[],"label_agreement":null},{"id":"W4412423181","doi":"10.1007/978-3-031-93598-5_5","title":"Enhancing Structural Minority Visibility in Link Recommendations","year":2025,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Visibility; Link (geometry); Computer science; Information retrieval; World Wide Web; Geography; Computer network","score_opus":0.024182970118411556,"score_gpt":0.3265813826908089,"score_spread":0.3023984125723973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412423181","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009139173,0.00020564678,0.160237,0.001875941,0.00022796592,0.00075011875,0.00007272456,0.0000893273,0.8356274],"genre_scores_gemma":[0.8479773,0.0004930648,0.14720923,0.0004435775,0.00014681232,0.0000683452,0.0007154151,0.000008710486,0.0029375346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986769,0.000035871853,0.00075000565,0.00021038162,0.00016460002,0.00016225828],"domain_scores_gemma":[0.99798524,0.00021724336,0.00025070828,0.0012737591,0.0002297227,0.0000432971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008026962,0.00016350434,0.00025007775,0.0008317317,0.0003204607,0.00022737593,0.0010968244,0.000060563165,0.00008100581],"category_scores_gemma":[0.000014054451,0.00017600859,0.000053990116,0.00046099318,0.00036827163,0.0019562,0.0012600105,0.0004908579,0.000007201696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011699118,0.000008411411,0.0030092176,0.000014445711,0.00000643423,2.279885e-8,0.0004863758,0.00006459428,0.0000013171792,0.52631533,0.00023020405,0.46986246],"study_design_scores_gemma":[0.0005180066,0.00003560123,0.022264719,0.00079468056,0.000033679426,0.0000014203974,0.000108268956,0.56850773,0.000050858514,0.2273034,0.17959128,0.00079033774],"about_ca_topic_score_codex":0.00017618563,"about_ca_topic_score_gemma":0.00019913906,"teacher_disagreement_score":0.84706336,"about_ca_system_score_codex":0.00015179215,"about_ca_system_score_gemma":0.0002109382,"threshold_uncertainty_score":0.7177422},"labels":[],"label_agreement":null},{"id":"W4412467845","doi":"10.1016/j.inffus.2025.103485","title":"Data-driven large-scale group graph model for conflict resolution under the three-dimensional preference","year":2025,"lang":"en","type":"article","venue":"Information Fusion","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Humanities and Social Science Fund of Ministry of Education of China; Graduate Research and Innovation Projects of Jiangsu Province; Ministry of Industry and Information Technology of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Scale (ratio); Preference; Graph; Group (periodic table); Conflict resolution; Resolution (logic); Theoretical computer science; Artificial intelligence; Mathematics; Statistics; Geography; Sociology; Cartography; Physics","score_opus":0.045351965519303775,"score_gpt":0.28965724954137057,"score_spread":0.2443052840220668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412467845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016010318,0.000020220663,0.979859,0.0004270967,0.000060521685,0.00048415802,0.00031552056,0.000079384605,0.002743803],"genre_scores_gemma":[0.9855269,0.0000044032076,0.009706585,0.00049034576,0.000065356275,0.00011355113,0.0039017345,0.0000051641173,0.00018591894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991606,0.000022285816,0.0003304471,0.00013855126,0.0001765779,0.00017154838],"domain_scores_gemma":[0.99905926,0.00007644892,0.00015629893,0.00053624023,0.00014726396,0.000024515644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032743977,0.00010974694,0.00011942617,0.00010302806,0.00039431325,0.000078554265,0.00037064916,0.00004255337,0.000069574635],"category_scores_gemma":[0.000004190708,0.000081133,0.000078043966,0.00023081237,0.000032482734,0.0006758537,0.00034207114,0.00011315758,0.000013050986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014763721,0.00016564713,0.0021476292,0.000037252117,0.00015664563,2.139945e-8,0.000566012,0.27148685,0.0002611002,0.53213876,0.15364513,0.039247327],"study_design_scores_gemma":[0.00030763025,0.000010383666,0.0013342128,0.000028801243,0.0000405804,6.435385e-8,0.00008704301,0.93720514,0.00003034919,0.02673468,0.034137823,0.000083285624],"about_ca_topic_score_codex":0.00008233243,"about_ca_topic_score_gemma":0.00020574698,"teacher_disagreement_score":0.9701524,"about_ca_system_score_codex":0.000023095545,"about_ca_system_score_gemma":0.00004796509,"threshold_uncertainty_score":0.33085078},"labels":[],"label_agreement":null},{"id":"W4412538791","doi":"10.1016/j.inffus.2025.103497","title":"Improved consensus evolution networks for supporting large-scale group decision making","year":2025,"lang":"en","type":"article","venue":"Information Fusion","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Hubei Province; National Natural Science Foundation of China","keywords":"Group decision-making; Computer science; Scale (ratio); Group (periodic table); Artificial intelligence; Psychology; Geography; Social psychology","score_opus":0.005350171010340805,"score_gpt":0.2760827552710973,"score_spread":0.2707325842607565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412538791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043893572,0.000023565499,0.95093036,0.000063609106,0.00021669155,0.0005243387,0.00001809712,0.00013782893,0.004191944],"genre_scores_gemma":[0.97960913,0.0000011354556,0.019732973,0.00013703463,0.00013180006,0.00007903568,0.00025137048,0.000006386498,0.000051126917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988155,0.000022676177,0.0006242633,0.00013431368,0.00011596452,0.00028733324],"domain_scores_gemma":[0.99904656,0.00014338196,0.0003494206,0.00022894857,0.00020080934,0.00003084685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005386893,0.00013330205,0.00017864382,0.00020562678,0.00037338355,0.000109412525,0.00013019309,0.00006882432,0.00010034777],"category_scores_gemma":[0.000029485369,0.0001312276,0.00015472849,0.00036098552,0.000015612077,0.00032760866,0.0001348418,0.0001176713,0.0000069704756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021281316,0.0000841095,0.013860243,0.000046126614,0.000061750085,8.970408e-8,0.0003300919,0.0064529604,0.00047778533,0.05773099,0.01971234,0.9010307],"study_design_scores_gemma":[0.0005911445,0.000027059425,0.0022504523,0.00014562205,0.000039817456,2.48867e-7,0.00044959152,0.9642955,0.00011831201,0.01384516,0.018094119,0.00014298203],"about_ca_topic_score_codex":0.000036614212,"about_ca_topic_score_gemma":0.000024236391,"teacher_disagreement_score":0.9578425,"about_ca_system_score_codex":0.00007979217,"about_ca_system_score_gemma":0.00003383538,"threshold_uncertainty_score":0.5351306},"labels":[],"label_agreement":null},{"id":"W4412825860","doi":"10.1145/3711896.3736940","title":"Error Bounds for the Network Scale-Up Method","year":2025,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scale (ratio)","score_opus":0.01642199952996313,"score_gpt":0.35372174475484847,"score_spread":0.3372997452248853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412825860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019474066,0.00010235059,0.93236434,0.0014771251,0.0001739312,0.00029080533,0.0000042885404,0.000089767804,0.06530266],"genre_scores_gemma":[0.7099984,0.0000035412722,0.22006465,0.0012137167,0.0014095929,0.0005024827,0.000045278983,0.000023735329,0.06673856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992841,0.00004695427,0.00018026397,0.00018607186,0.00006423109,0.00023839854],"domain_scores_gemma":[0.99896103,0.00054349174,0.000046815283,0.00037132445,0.000054484353,0.000022865923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044758787,0.000108296816,0.00017645497,0.000021108674,0.00030308744,0.000083224404,0.00028214118,0.000024763349,0.000629498],"category_scores_gemma":[0.0000028828556,0.00007034591,0.00020740285,0.00033179746,0.000031820662,0.00003352357,0.000099807614,0.0000990911,0.0000068520803],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001040523,0.000018169212,0.005183294,0.0000025889872,0.00020841177,1.5455674e-8,0.000020379854,0.00061227626,0.00001940046,0.5410371,0.3438851,0.10900287],"study_design_scores_gemma":[0.00018894047,0.000012418257,0.0010098163,0.000011573459,0.00020487771,5.6277965e-8,0.00013815112,0.08682702,0.0004624748,0.2805821,0.6304407,0.00012186302],"about_ca_topic_score_codex":0.00020451387,"about_ca_topic_score_gemma":0.00009358931,"teacher_disagreement_score":0.71229964,"about_ca_system_score_codex":0.0000121290295,"about_ca_system_score_gemma":0.000042663007,"threshold_uncertainty_score":0.68925613},"labels":[],"label_agreement":null},{"id":"W4412914661","doi":"10.1007/978-981-96-9884-4_40","title":"Multi-scale Multi-order Attributed Graph Clustering","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Agriculture","funders":"","keywords":"Computer science; Cluster analysis; Graph; Theoretical computer science; Artificial intelligence","score_opus":0.019500437558452387,"score_gpt":0.27446470747772833,"score_spread":0.25496426991927595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412914661","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055641573,0.00018768116,0.99675333,0.00010710134,0.00044880912,0.00038812947,0.000027781742,0.0001614032,0.0018701128],"genre_scores_gemma":[0.08952631,0.000012284931,0.9075317,0.0003634435,0.00042781135,0.000025076608,0.00007785987,0.00004545091,0.0019900957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731886,0.000031145646,0.0005085544,0.0011579231,0.0004040948,0.0005794327],"domain_scores_gemma":[0.998226,0.00020252918,0.00022942299,0.0009459604,0.00028580165,0.000110269255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039407195,0.00053789,0.0006673773,0.00075340155,0.00026627793,0.00023007792,0.0012892325,0.00018289729,0.00015139078],"category_scores_gemma":[0.000011684701,0.0005214163,0.0002635656,0.0008333416,0.00042327933,0.00014505447,0.001140361,0.000791463,0.000015443498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009873115,0.00015782517,0.0050036525,0.00004894733,0.00013636508,0.00001442542,0.0003050484,0.086643174,0.0004516881,0.0011923804,0.00022942056,0.9058072],"study_design_scores_gemma":[0.00043783846,0.000032215958,0.00050329807,0.00045183065,0.000052602598,0.0000017964188,3.4866906e-7,0.9786623,0.00065982866,0.01544027,0.0030402176,0.00071746553],"about_ca_topic_score_codex":0.0001986975,"about_ca_topic_score_gemma":0.000550125,"teacher_disagreement_score":0.90508974,"about_ca_system_score_codex":0.000131666,"about_ca_system_score_gemma":0.00020872621,"threshold_uncertainty_score":0.99972373},"labels":[],"label_agreement":null},{"id":"W4412936426","doi":"10.1093/comnet/cnaf008","title":"Two models of sparse and clustered dynamic networks","year":2025,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Information Technology Research Centre","keywords":"Combinatorics; Adjacency matrix; Markov chain; Prime (order theory); Bipartite graph; Mathematics; Transitive relation; Discrete mathematics; Graph; Statistics","score_opus":0.015479678029741838,"score_gpt":0.2885903414612192,"score_spread":0.2731106634314774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412936426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045513604,0.001822706,0.9459131,0.00015458663,0.00018881245,0.00015848043,0.0000036394244,0.000020660922,0.006224441],"genre_scores_gemma":[0.9912983,0.00014322792,0.007891242,0.00010592538,0.00037156808,0.000003545771,0.000011962146,0.000020412846,0.00015380251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998075,0.00014897909,0.0010402628,0.00019559124,0.00021160128,0.00032856798],"domain_scores_gemma":[0.99813074,0.00023582041,0.00085687125,0.00034817826,0.00031529862,0.0001130843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005288363,0.00024475923,0.00080074894,0.00026825318,0.00010477392,0.00006533245,0.0004104518,0.000066752276,0.000119954304],"category_scores_gemma":[0.000003914048,0.00022246473,0.0003383674,0.00051370135,0.00013773408,0.00019719372,0.00022049331,0.00048136007,2.7173053e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001302204,0.00013415322,0.010543817,0.000012631336,0.0005641347,0.0000040827404,0.000043114134,0.8986695,0.000054890526,0.02780159,0.007439624,0.054602284],"study_design_scores_gemma":[0.0008926616,0.00007238323,0.0036052566,0.00020390618,0.00023816717,0.000007641976,0.00006923526,0.9469403,0.000012736354,0.046817683,0.0009781538,0.00016187545],"about_ca_topic_score_codex":0.000053321364,"about_ca_topic_score_gemma":0.000027893373,"teacher_disagreement_score":0.9457847,"about_ca_system_score_codex":0.000039373415,"about_ca_system_score_gemma":0.00005966272,"threshold_uncertainty_score":0.90718484},"labels":[],"label_agreement":null},{"id":"W4413131112","doi":"10.9734/cjast/2025/v44i84590","title":"An Overview of Methods for Activity Graph Study of Movements","year":2025,"lang":"en","type":"article","venue":"Current Journal of Applied Science and Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Graph; Probabilistic logic; PageRank; Data mining; Theoretical computer science; Artificial intelligence","score_opus":0.06591187238754533,"score_gpt":0.46315858153386064,"score_spread":0.3972467091463153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413131112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8756335,0.00050101615,0.12335484,0.000023949271,0.00006854178,0.000263482,0.0000014988177,0.000007505413,0.00014569657],"genre_scores_gemma":[0.9930903,0.000044894205,0.0068327067,0.0000024391525,0.000011716623,0.000015030023,1.9308989e-7,0.000002119151,6.408533e-7],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920964,0.000019359362,0.00034887588,0.00016088237,0.0001332751,0.00012796331],"domain_scores_gemma":[0.9988225,0.000047649894,0.00048131275,0.00023531995,0.00038496472,0.000028223702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011858208,0.000078905745,0.00035601112,0.0007668751,0.000084447915,0.000011345489,0.00041870496,0.000021803831,0.000004158603],"category_scores_gemma":[0.00001154666,0.000064552936,0.000050942326,0.001541284,0.00032192533,0.000092935734,0.0001256373,0.00013474541,1.4618979e-8],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015960444,0.00082978717,0.010835566,0.00002250897,0.000066337714,3.485592e-8,0.00006286789,0.000008271774,0.09090543,0.05889511,0.000025230402,0.8383329],"study_design_scores_gemma":[0.0012315159,0.0011499783,0.005194671,0.00012421185,0.00025466643,6.616987e-7,0.0020627452,0.0017540586,0.36970904,0.6167296,0.0016190786,0.00016976417],"about_ca_topic_score_codex":0.0000047579183,"about_ca_topic_score_gemma":9.968765e-7,"teacher_disagreement_score":0.83816314,"about_ca_system_score_codex":0.0000128830625,"about_ca_system_score_gemma":0.000104598614,"threshold_uncertainty_score":0.26323923},"labels":[],"label_agreement":null},{"id":"W4413169098","doi":"10.1155/atr/3589423","title":"Identifying Strong Connectivity in Urban Road Networks Considering Traffic Constraints: An Analysis of Road Networks With Different Patterns","year":2025,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Young Scientists Fund; Natural Science Foundation for Young Scientists of Shanxi Province; National Natural Science Foundation of China","keywords":"Transport engineering; Computer science; Road traffic; Traffic analysis; Engineering; Computer network","score_opus":0.010517177088481537,"score_gpt":0.27479415449166017,"score_spread":0.2642769774031786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413169098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5722659,0.00008210737,0.4274603,0.000007658265,0.000045853372,0.000101862104,0.000008938283,0.00001076644,0.000016591131],"genre_scores_gemma":[0.99845296,0.000028914646,0.0013024561,0.0000075754288,0.00006839804,0.0000096360955,0.00011319347,0.000014333386,0.0000025145912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9981557,0.00011181331,0.0010068474,0.00024942483,0.00022698332,0.00024923292],"domain_scores_gemma":[0.99848855,0.00011208304,0.0009015478,0.0002067981,0.00021562554,0.000075426935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028246973,0.00022642649,0.0008349526,0.0006180806,0.0000700008,0.000039157625,0.00016051356,0.00005376481,0.00006317815],"category_scores_gemma":[0.0000031054494,0.00020491052,0.00032350636,0.00092989317,0.0000766271,0.0004384954,0.000004781588,0.00038625338,1.8364295e-8],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097765114,0.000136934,0.37284318,0.000009643394,0.00075633393,0.000006034139,0.00033154985,0.5927325,0.00007565016,0.00041625058,7.1278004e-7,0.032593478],"study_design_scores_gemma":[0.0010017236,0.00010745684,0.8414014,0.00036136288,0.0013861984,4.6710784e-7,0.0019754854,0.15329938,0.00019182902,0.000108080916,0.0000021221538,0.00016448539],"about_ca_topic_score_codex":0.0001391801,"about_ca_topic_score_gemma":0.0036701579,"teacher_disagreement_score":0.46855825,"about_ca_system_score_codex":0.00007488404,"about_ca_system_score_gemma":0.000042184405,"threshold_uncertainty_score":0.83560085},"labels":[],"label_agreement":null},{"id":"W4413195000","doi":"10.1016/j.chaos.2025.116958","title":"Impact of peer pressure on higher-order network dynamics","year":2025,"lang":"en","type":"article","venue":"Chaos Solitons & Fractals","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Dynamics (music); Order (exchange); Peer pressure; Statistical physics; Mathematics; Control theory (sociology); Computer science; Physics; Economics; Psychology; Social psychology; Artificial intelligence; Acoustics","score_opus":0.008825651326384054,"score_gpt":0.3185332333927625,"score_spread":0.30970758206637844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413195000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5687294,0.00080959033,0.039693676,0.0018196375,0.0008089098,0.0011577758,0.0004884608,0.00041527554,0.38607728],"genre_scores_gemma":[0.9892349,0.0000043293326,0.0005894862,0.00006130954,0.00058373384,0.00004495849,0.00017399815,0.000027194723,0.009280092],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99850434,0.0000770547,0.00039839486,0.00033248815,0.0002513672,0.0004363607],"domain_scores_gemma":[0.998472,0.00020065387,0.00022352439,0.00072502164,0.00029972507,0.00007911035],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020833408,0.0002763804,0.00051871635,0.00013137968,0.00012398031,0.000049417416,0.0003511151,0.00009770023,0.0014339916],"category_scores_gemma":[0.000013776079,0.00024273028,0.0004482787,0.00066863536,0.000085548796,0.000086255095,0.00014759388,0.00030251252,0.000019550536],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011643115,0.00097486266,0.3806997,0.000044312306,0.0032301592,0.0000024252458,0.00014488104,0.02439519,0.00033064425,0.3254024,0.23540539,0.029253611],"study_design_scores_gemma":[0.0018476804,0.0006787616,0.45275182,0.0007672092,0.0016659589,9.548664e-7,0.00018572464,0.09172743,0.0020577891,0.22362535,0.2229001,0.0017912486],"about_ca_topic_score_codex":0.0005872522,"about_ca_topic_score_gemma":0.000015619416,"teacher_disagreement_score":0.4205055,"about_ca_system_score_codex":0.00007025977,"about_ca_system_score_gemma":0.000118774355,"threshold_uncertainty_score":0.9994788},"labels":[],"label_agreement":null},{"id":"W4413639158","doi":"10.64628/aam.gpx9g6sfq","title":"Musk apologizes but the bromance is over: What network science tells us about the Trump-Musk breakup","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Breakup; Computer science; Physics; Mechanics","score_opus":0.014262934025097795,"score_gpt":0.2909025225601477,"score_spread":0.2766395885350499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413639158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5665692,0.015718509,0.08822778,0.01725552,0.0070967134,0.006917684,0.00042008172,0.0018191658,0.29597533],"genre_scores_gemma":[0.98276895,0.0013386273,0.0021690282,0.0027587826,0.0021756652,0.00032438745,0.000043772765,0.000035155997,0.008385601],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959843,0.0002353764,0.00072723173,0.0013313632,0.00071485894,0.001006841],"domain_scores_gemma":[0.99534106,0.00064326776,0.0005577348,0.003106005,0.0002418458,0.00011009493],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013572583,0.00068989745,0.00078407576,0.00013782128,0.001280093,0.0019406945,0.0042668083,0.00018126654,0.0017336863],"category_scores_gemma":[0.000014002409,0.00039505915,0.0007567521,0.0012138803,0.001431729,0.0003270446,0.004739342,0.0013339628,0.000047983725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006778051,0.00037112163,0.11557897,0.00010920632,0.0019111808,0.0000036170247,0.0014989363,0.02583886,0.00014717883,0.21674126,0.30101374,0.33671814],"study_design_scores_gemma":[0.0007034188,0.00011865098,0.09829114,0.0022020193,0.0015390955,0.000004995266,0.0016723169,0.12924731,0.005313301,0.4278791,0.3297887,0.0032399627],"about_ca_topic_score_codex":0.0051494963,"about_ca_topic_score_gemma":0.00022265862,"teacher_disagreement_score":0.41619974,"about_ca_system_score_codex":0.00011903385,"about_ca_system_score_gemma":0.0005081601,"threshold_uncertainty_score":0.99985015},"labels":[],"label_agreement":null},{"id":"W4413682904","doi":"10.1016/j.tcs.2025.115529","title":"Hypergraph burning, matchings, and zero forcing","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Forcing (mathematics); Zero (linguistics); Mathematics; Combinatorics; Computer science; Mathematical analysis; Linguistics","score_opus":0.0032420095419759543,"score_gpt":0.24814837774201168,"score_spread":0.24490636820003572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413682904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18312709,0.00002211304,0.79857135,0.00021686224,0.00005725467,0.000056501423,4.518177e-7,0.00006880842,0.01787959],"genre_scores_gemma":[0.96768874,0.0000010217145,0.03203854,0.00017183644,0.000060318118,0.000003945321,7.241583e-7,0.0000035824364,0.00003128135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990828,0.000029526145,0.00014280227,0.00032494048,0.00015682084,0.00026312226],"domain_scores_gemma":[0.99947655,0.00010603669,0.000030706185,0.00025683973,0.000053611093,0.00007628402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004834649,0.0001027579,0.00014902884,0.00014122405,0.00033910127,0.00019607229,0.00040385933,0.0000134567645,0.000070428396],"category_scores_gemma":[0.0000052088562,0.000085697175,0.000049061786,0.000623334,0.0011544252,0.00011549272,0.0004840249,0.00012370574,0.0000037518312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016595804,0.00001250561,0.0050470214,0.0000020423747,0.0000070510273,3.0714108e-7,0.000054256714,0.000030504802,0.0002606678,0.944344,0.00012935982,0.05011064],"study_design_scores_gemma":[0.00007446476,0.000020515134,0.0016309846,0.000038550595,0.000014228352,7.3574535e-7,0.000007895667,0.13368349,0.001644049,0.86242616,0.00035681998,0.0001020762],"about_ca_topic_score_codex":0.00001779434,"about_ca_topic_score_gemma":2.0926751e-7,"teacher_disagreement_score":0.78456163,"about_ca_system_score_codex":0.000010735808,"about_ca_system_score_gemma":0.00002746602,"threshold_uncertainty_score":0.42535278},"labels":[],"label_agreement":null},{"id":"W4413825311","doi":"10.14778/3725688.3725693","title":"Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-Aware Index","year":2025,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bipartite graph; Computer science; Butterfly; Graph; Index (typography); Theoretical computer science; Artificial intelligence; World Wide Web; Biology; Ecology","score_opus":0.0045790634591464825,"score_gpt":0.22311424491938264,"score_spread":0.21853518146023615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413825311","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96469724,0.00025822117,0.03113424,0.00055092265,0.00031944574,0.00071017805,0.000012381647,0.00008450822,0.002232876],"genre_scores_gemma":[0.99931246,0.0000018156352,0.0002522906,0.00007490541,0.00013247026,0.000054905024,0.000005219003,0.00001454564,0.00015138723],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984477,0.000012985643,0.00051543757,0.00032983258,0.00028686307,0.00040714213],"domain_scores_gemma":[0.9992918,0.000029487614,0.00032377875,0.00017352018,0.0001390592,0.000042388918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031941847,0.0002196865,0.00036487042,0.0002183376,0.00014298486,0.000048830945,0.00046912863,0.000055132135,0.000051767318],"category_scores_gemma":[0.000006385256,0.00017014334,0.00021123013,0.0009836142,0.00004332342,0.00004734616,0.00038845337,0.00032625123,5.4831e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028822808,0.00022727063,0.9795265,0.000037433205,0.00010258551,1.9604965e-7,0.00013624514,0.00453859,0.001752032,0.008600784,0.003152302,0.0018972277],"study_design_scores_gemma":[0.003855187,0.00015254063,0.18022403,0.0012608647,0.0005093215,0.000002386636,0.00077308004,0.685754,0.029665692,0.07632391,0.020042874,0.0014361009],"about_ca_topic_score_codex":0.00068866374,"about_ca_topic_score_gemma":0.000042957632,"teacher_disagreement_score":0.79930246,"about_ca_system_score_codex":0.00028678428,"about_ca_system_score_gemma":0.00002574503,"threshold_uncertainty_score":0.6938244},"labels":[],"label_agreement":null},{"id":"W4414111978","doi":"10.1371/journal.pcsy.0000062","title":"Troika algorithm: Approximate optimization for accurate clique partitioning and clustering of weighted networks","year":2025,"lang":"en","type":"article","venue":"PLOS complex systems.","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Partition (number theory); Integer programming; Benchmark (surveying); Cluster analysis; Node (physics); Clique; Graph partition; Clique problem","score_opus":0.022092000194325598,"score_gpt":0.27239105772921884,"score_spread":0.25029905753489323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414111978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027432134,0.00019375993,0.99462134,0.00003362376,0.000094737996,0.0007936274,0.000044218777,0.000109632776,0.0013658528],"genre_scores_gemma":[0.9224912,0.0000108683535,0.07650184,0.000016860617,0.00019689248,0.00036652666,0.00025930017,0.000022660923,0.00013388427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987183,0.00009861938,0.00056117115,0.000283668,0.00009403415,0.00024416088],"domain_scores_gemma":[0.99910873,0.00012152404,0.00029930638,0.00024986605,0.0001764063,0.000044161934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021166919,0.00017988206,0.0004725696,0.00013422886,0.00018049953,0.000105076004,0.00014428237,0.00004754638,0.00004466132],"category_scores_gemma":[0.0000036614824,0.00018246657,0.000098972225,0.00029712063,0.000044181834,0.00011471884,0.00010671524,0.00008531747,2.847449e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111064044,0.00047082052,0.014771056,0.0011221232,0.0017556992,9.734249e-7,0.00024295277,0.79935986,0.00078334915,0.15326494,0.0053023016,0.022814877],"study_design_scores_gemma":[0.0003960964,0.000027897662,0.00016792203,0.00028964295,0.00012100461,3.8537388e-7,0.000113241804,0.9969004,0.00018448477,0.0011613689,0.00048709812,0.00015045596],"about_ca_topic_score_codex":0.0001261408,"about_ca_topic_score_gemma":0.00000642494,"teacher_disagreement_score":0.91974795,"about_ca_system_score_codex":0.000028265766,"about_ca_system_score_gemma":0.000021312078,"threshold_uncertainty_score":0.744077},"labels":[],"label_agreement":null},{"id":"W4414125629","doi":"10.1007/s00332-025-10210-2","title":"Persistence of Steady States for Dynamical Systems on Large Networks","year":2025,"lang":"en","type":"article","venue":"Journal of Nonlinear Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Dynamical systems theory; Linearization; Linear dynamical system; Operator (biology); Random dynamical system; Dynamical system (definition); Contraction (grammar); Adjacency matrix; Limit (mathematics); Stability (learning theory)","score_opus":0.013896580159335679,"score_gpt":0.30524379501582727,"score_spread":0.29134721485649157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414125629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34092477,0.00020369563,0.65678596,0.00024182213,0.00039300305,0.0002060958,0.00003554351,0.000010872837,0.0011982258],"genre_scores_gemma":[0.9912393,0.0000068062213,0.008384799,0.00002732544,0.00019137257,0.0000023589416,0.0000026004107,0.000004020771,0.0001413872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887395,0.000029368712,0.0004399152,0.00013857879,0.00029366853,0.0002245377],"domain_scores_gemma":[0.99863654,0.00019310237,0.00038703313,0.00018561378,0.0005359973,0.00006171694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010935273,0.00008545752,0.00028113337,0.00021710631,0.00012260355,0.00006159491,0.0005199298,0.000019216079,0.0000089704845],"category_scores_gemma":[0.00003110996,0.0000659394,0.00017781378,0.00062156125,0.00015404871,0.00013315257,0.000067352485,0.00015430765,3.9352798e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070350675,0.0035648956,0.1325119,0.00024019378,0.00090757944,0.000011161845,0.000764322,0.40156206,0.012269322,0.37963277,0.010855719,0.05697656],"study_design_scores_gemma":[0.00030425284,0.00023685713,0.0010195856,0.00021786257,0.000053978696,0.0000011774933,0.00044122146,0.99334246,0.0007062741,0.0012778704,0.0023197886,0.000078660254],"about_ca_topic_score_codex":0.000010172295,"about_ca_topic_score_gemma":0.0000020878015,"teacher_disagreement_score":0.65031457,"about_ca_system_score_codex":0.000050056497,"about_ca_system_score_gemma":0.00025190742,"threshold_uncertainty_score":0.26889306},"labels":[],"label_agreement":null},{"id":"W4414137051","doi":"10.1016/j.eswa.2025.129666","title":"Three-way large-scale group decision-making under incomplete multi-scale information systems: A perspective of quantum social networks","year":2025,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Sichuan Province Science and Technology Support Program; Chongqing Municipal Education Commission; Shanxi University; Science and Technology Innovation Group of Shanxi Province; National Natural Science Foundation of China","keywords":"Cluster analysis; Perspective (graphical); Core (optical fiber); Complete information; Quantum; Dual (grammatical number); Bounded rationality; Bounded function","score_opus":0.010364172519812009,"score_gpt":0.2918430355028095,"score_spread":0.28147886298299746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414137051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010452314,0.000679174,0.99308825,0.0000724334,0.00009674056,0.0016326966,0.000071157396,0.00016308235,0.003151212],"genre_scores_gemma":[0.98730123,0.000004149109,0.009442635,0.000036730336,0.00036333394,0.0026924424,0.00010524217,0.000023484587,0.000030730436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819595,0.00007537264,0.0007490112,0.0003549061,0.00029198278,0.00033277684],"domain_scores_gemma":[0.99814343,0.00020804555,0.00051052065,0.000586967,0.0004935173,0.000057509827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000297527,0.0002637185,0.0005357268,0.00025397993,0.00056535524,0.00015087455,0.00037972926,0.0000990028,0.00001855472],"category_scores_gemma":[0.000002833987,0.0002320443,0.00016708982,0.0009879661,0.00009535084,0.0002851802,0.00014031598,0.00020373015,0.000011447884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060391423,0.00040410235,0.008136377,0.00006123123,0.0004536495,1.3844752e-7,0.0024516808,0.016997917,0.00007561123,0.96236193,0.005319319,0.0036776802],"study_design_scores_gemma":[0.0009059514,0.000041224434,0.004338416,0.00057371653,0.000116322975,0.0000017429429,0.029249186,0.93692046,0.000009878081,0.0062848856,0.021110656,0.0004475392],"about_ca_topic_score_codex":0.0020011344,"about_ca_topic_score_gemma":0.00034129474,"teacher_disagreement_score":0.986256,"about_ca_system_score_codex":0.00021213494,"about_ca_system_score_gemma":0.000067336,"threshold_uncertainty_score":0.9462492},"labels":[],"label_agreement":null},{"id":"W4414166319","doi":"10.1016/j.ipm.2025.104371","title":"A cost-effective community-hierarchy-based mutual voting approach for influence maximization in complex networks","year":2025,"lang":"en","type":"article","venue":"Information Processing & Management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Natural Science Foundation of Anhui Province; National University's Basic Research Foundation of China; National Natural Science Foundation of China","keywords":"Voting; Maximization; Mutual information; Construct (python library); Hierarchy; Complex network","score_opus":0.020489989820385204,"score_gpt":0.30316441083989987,"score_spread":0.2826744210195147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414166319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044200406,0.000009216834,0.9800924,0.00005886045,0.000014441785,0.002514128,0.0000055720507,0.00012810042,0.012757236],"genre_scores_gemma":[0.9514252,5.187927e-7,0.04477822,0.00050805864,0.000020290348,0.002236696,0.0009845385,0.000008149842,0.00003830881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988088,0.00014173475,0.00051292946,0.0001321573,0.00014355282,0.0002608433],"domain_scores_gemma":[0.9991721,0.00012308419,0.0002758208,0.00021315865,0.00018937574,0.000026464437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000894222,0.00017220172,0.00021035565,0.0004622331,0.00044588564,0.00029377235,0.00029327522,0.000036804504,0.000007644132],"category_scores_gemma":[0.00001554431,0.00018579751,0.00006708632,0.0009557079,0.000049714854,0.0007951935,0.00014330332,0.00024840448,0.0000015649297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004741975,0.00009279164,0.004885123,0.00027941933,0.000038397775,4.2110862e-8,0.00039547443,0.54575944,0.0000012850231,0.010402222,0.00035829254,0.43774012],"study_design_scores_gemma":[0.00084626424,0.000015979773,0.012803845,0.00016624005,0.00004481275,4.2660076e-8,0.0007595282,0.978473,0.000035777735,0.0018968312,0.0047943275,0.00016331469],"about_ca_topic_score_codex":0.000073775125,"about_ca_topic_score_gemma":0.0000068123586,"teacher_disagreement_score":0.94700515,"about_ca_system_score_codex":0.00013627515,"about_ca_system_score_gemma":0.000032329826,"threshold_uncertainty_score":0.7576603},"labels":[],"label_agreement":null},{"id":"W4414240954","doi":"10.3390/make7030101","title":"CRISP-NET: Integration of the CRISP-DM Model with Network Analysis","year":2025,"lang":"en","type":"article","venue":"Machine Learning and Knowledge Extraction","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Dalhousie University","keywords":"Identification (biology); Process (computing); Field (mathematics); Adaptation (eye); Personalization; Data integration; Software; Software development; Software development process","score_opus":0.007368779355266472,"score_gpt":0.2965423148062663,"score_spread":0.28917353545099983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414240954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09080105,0.00057012576,0.87721664,0.00016099033,0.000058856313,0.0001350387,0.000002597409,0.00007139526,0.030983334],"genre_scores_gemma":[0.9917836,0.000015483522,0.001672631,0.00000922196,0.0001082672,0.000017376233,0.000034647986,0.00000958309,0.0063491473],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915874,0.00016006379,0.00023127563,0.00022346074,0.00008756414,0.00013891823],"domain_scores_gemma":[0.9993851,0.000091852016,0.00018967611,0.00019339893,0.00011593462,0.000024039156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000280732,0.00014319656,0.0002555193,0.0001634883,0.0003044304,0.000045507608,0.00009255335,0.000039328945,0.00006644147],"category_scores_gemma":[0.0000103359625,0.000097341865,0.0001562363,0.0011299577,0.000046898684,0.000080000886,0.000058419264,0.0003990926,0.0000012450901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007358552,0.00017349207,0.5774954,0.000021956028,0.0010070748,1.2368184e-7,0.0004718251,0.2773994,0.0010484714,0.013925363,0.0016106268,0.1267727],"study_design_scores_gemma":[0.00015155193,0.000027152993,0.020342674,0.00005629368,0.0009198374,2.436979e-7,0.00011647436,0.9706109,0.00051031006,0.0029940528,0.004162122,0.00010835285],"about_ca_topic_score_codex":0.0004968927,"about_ca_topic_score_gemma":0.00061337923,"teacher_disagreement_score":0.90098256,"about_ca_system_score_codex":0.000022263997,"about_ca_system_score_gemma":0.000035591453,"threshold_uncertainty_score":0.3969486},"labels":[],"label_agreement":null},{"id":"W4414471520","doi":"10.1063/5.0267781","title":"Evaluation of price fluctuation risks in tradable green certificate market based on complex social network approach","year":2025,"lang":"en","type":"article","venue":"Journal of Renewable and Sustainable Energy","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Petro-Canada","funders":"Beijing Municipal Social Science Foundation","keywords":"Leverage (statistics); Certificate; Social network (sociolinguistics); Renewable energy; Price discovery; Complex network; Market price; Price mechanism; Government (linguistics)","score_opus":0.050681262979842996,"score_gpt":0.3036226190044282,"score_spread":0.25294135602458523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414471520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16219161,0.0014195632,0.58221567,0.001089084,0.000117733296,0.00064875424,0.000007305847,0.000033036435,0.25227723],"genre_scores_gemma":[0.9967747,0.00001820134,0.0013297619,0.00004560852,0.0001970682,0.000019086585,0.00001804471,0.000010121277,0.0015874326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997994,0.0004397233,0.0005864048,0.00017361483,0.00048789842,0.00031836194],"domain_scores_gemma":[0.99844795,0.00012132782,0.0004904349,0.00015460305,0.00074386835,0.000041802123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033765486,0.00014614208,0.00042523924,0.00040854735,0.00016685724,0.000046792753,0.00016876923,0.000060667677,0.00012624776],"category_scores_gemma":[0.00002513666,0.00013399297,0.00013368965,0.0008935488,0.000040777013,0.00014628808,0.000043099262,0.00013083902,3.433705e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000407444,0.00049541617,0.008043208,0.00010010671,0.00028655023,0.0000034104864,0.00012517135,0.8670565,0.000272228,0.024054127,0.021564975,0.077590875],"study_design_scores_gemma":[0.0015926971,0.00012720103,0.011229002,0.00007956447,0.0003565472,6.1552515e-7,0.001249401,0.8506685,0.00068042043,0.12184239,0.011996525,0.0001771206],"about_ca_topic_score_codex":0.0056560957,"about_ca_topic_score_gemma":0.000067389665,"teacher_disagreement_score":0.83458304,"about_ca_system_score_codex":0.00019071458,"about_ca_system_score_gemma":0.00040976546,"threshold_uncertainty_score":0.85503626},"labels":[],"label_agreement":null},{"id":"W4414549751","doi":"10.1007/978-3-031-97461-8_14","title":"Examining Heterogeneity in Information Diffusion and Its Impact on Disease Spread in a Multilayer Network","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Misinformation; Gossip; Information cascade; Disease; Network topology; Information flow; Focus (optics); Homophily; Information transmission","score_opus":0.0184318063261989,"score_gpt":0.28137004490860174,"score_spread":0.26293823858240284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414549751","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4403211,0.00045113463,0.0028067005,0.00005448669,0.0000956252,0.0016154,0.0001368234,0.0001570934,0.55436164],"genre_scores_gemma":[0.9909527,0.0000455849,0.000125336,0.00007790161,0.00012224013,0.000034208522,0.0002756239,0.000016047747,0.008350373],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988529,0.000028904424,0.0004504965,0.00027732583,0.00015015515,0.00024020382],"domain_scores_gemma":[0.99931246,0.00010862793,0.00017294871,0.00027763096,0.000032132528,0.00009622523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015611059,0.0003459643,0.0004349525,0.00035536068,0.00004287769,0.00006195619,0.00011894893,0.000100610116,0.00031211693],"category_scores_gemma":[0.0000042115735,0.00029803682,0.00013435578,0.000087065455,0.0000133856765,0.00018267237,0.0002074183,0.00032736195,0.000012133383],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068943074,0.00024158413,0.48946145,0.00015845147,0.00036290498,0.000018349365,0.00026578034,0.013856287,0.000013724508,0.17541358,0.004974751,0.31454372],"study_design_scores_gemma":[0.0029068475,0.00029941092,0.52884763,0.0057078693,0.0003382388,5.281536e-7,0.000041600873,0.3861806,0.00007855325,0.052026514,0.021060035,0.0025121616],"about_ca_topic_score_codex":0.00024499642,"about_ca_topic_score_gemma":0.00016684328,"teacher_disagreement_score":0.5506316,"about_ca_system_score_codex":0.00009672226,"about_ca_system_score_gemma":0.000046213852,"threshold_uncertainty_score":0.9999472},"labels":[],"label_agreement":null},{"id":"W4414955906","doi":"10.1109/tnnls.2025.3614341","title":"HKANLP: Link Prediction With Hyperspherical Embeddings and Kolmogorov–Arnold Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Adjacency matrix; Eigenvalues and eigenvectors; Adjacency list; Robustness (evolution); Embedding; Adaptability; Graph; Visualization; Feature learning","score_opus":0.005339353157135265,"score_gpt":0.21832775134724228,"score_spread":0.212988398190107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414955906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08010381,0.0006221636,0.91740036,0.00016457344,0.00036429454,0.00034055903,0.000003432617,0.00027678517,0.0007240411],"genre_scores_gemma":[0.99736804,0.000091755355,0.00016763143,0.000057740734,0.00046958055,0.000099325945,0.000010434875,0.00003384653,0.0017016287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983981,0.00022293231,0.00035039772,0.00050452375,0.00015251865,0.00037152274],"domain_scores_gemma":[0.9992068,0.00024841877,0.00013438996,0.00021790175,0.0000690965,0.00012340692],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022983512,0.00030762557,0.000420132,0.00011417552,0.00069564756,0.00028173087,0.00010202071,0.00012741087,0.00002820534],"category_scores_gemma":[0.0000011117686,0.00026128278,0.0001043157,0.0005000234,0.00011330031,0.00016201992,0.000005095265,0.0010831826,7.860436e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074612035,0.000038954764,0.0067806407,0.000016670494,0.00019046002,0.0000019778095,0.00006704266,0.9242753,0.000016387248,0.0002851057,0.00030781512,0.06794503],"study_design_scores_gemma":[0.00044163066,0.00025035258,0.00087251,0.00020657782,0.00020293835,0.000010259139,0.00027054714,0.99362624,0.000009292168,0.000016980568,0.0038612718,0.00023142631],"about_ca_topic_score_codex":0.00037153382,"about_ca_topic_score_gemma":0.000013225931,"teacher_disagreement_score":0.9172642,"about_ca_system_score_codex":0.000030458103,"about_ca_system_score_gemma":0.000013152791,"threshold_uncertainty_score":0.99998397},"labels":[],"label_agreement":null},{"id":"W4415019972","doi":"10.1016/b978-0-443-19099-5.00004-0","title":"Analysis methods for functional connectivity: from seed-regions to data-driven approaches","year":2025,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Functional magnetic resonance imaging; Human Connectome Project; Cognition; Identification (biology); Artificial neural network; Power graph analysis; Component (thermodynamics); Function (biology); Graph","score_opus":0.09167017027519066,"score_gpt":0.33637639977949313,"score_spread":0.24470622950430249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415019972","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000396462,0.00014231817,0.46959102,0.00010835009,0.00008964633,0.00067638664,0.0015551823,0.00009082234,0.5277423],"genre_scores_gemma":[0.002464503,0.0000032567946,0.14842954,0.00019766431,0.0012960456,0.00048618228,0.008938715,0.00008445649,0.83809966],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973233,0.000119885655,0.00060733646,0.0013689542,0.0002358476,0.00034471866],"domain_scores_gemma":[0.9961369,0.0009506048,0.0003639292,0.002207029,0.00017644616,0.00016508598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005161959,0.0005985775,0.0014283536,0.0006291118,0.00025872453,0.00013147405,0.00089024706,0.00020262333,0.0006897215],"category_scores_gemma":[0.000017316443,0.00060817075,0.0011400145,0.00014296055,0.00008716526,0.00006590323,0.00091540546,0.0004228661,0.000021355801],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002105255,0.000025700832,0.00023141607,0.000012279508,0.009891279,3.884157e-7,0.000044864002,0.00011613475,0.000007032292,0.065792024,0.0034842237,0.9203736],"study_design_scores_gemma":[0.00015599914,0.000020843354,0.00010384144,0.00008055366,0.0089454865,1.0648187e-7,0.000016099106,0.01568664,0.000021949785,0.10294879,0.8714604,0.0005593051],"about_ca_topic_score_codex":0.00003131555,"about_ca_topic_score_gemma":0.0002298421,"teacher_disagreement_score":0.9198143,"about_ca_system_score_codex":0.00009078128,"about_ca_system_score_gemma":0.00019019423,"threshold_uncertainty_score":0.99963695},"labels":[],"label_agreement":null},{"id":"W4415120444","doi":"10.1007/s00530-025-01998-w","title":"A new method for attributed graph clustering with dual-manifold orthogonal matrix learning","year":2025,"lang":"en","type":"article","venue":"Multimedia Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cluster analysis; Graph; Non-negative matrix factorization; Matrix decomposition; Discriminative model; Biclustering; Pattern recognition (psychology); Nonlinear dimensionality reduction; Complex network","score_opus":0.012547155179436597,"score_gpt":0.3111669172479421,"score_spread":0.2986197620685055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415120444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012639355,0.00019307765,0.9959079,0.00008336971,0.00021068945,0.00084774866,0.000022319751,0.000253037,0.0012179144],"genre_scores_gemma":[0.6177372,0.0000017201565,0.37494996,0.000013420465,0.0006418192,0.00039071587,0.00023610941,0.000047084854,0.005981996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984258,0.0001490931,0.00042735483,0.00041313213,0.00019266877,0.000391996],"domain_scores_gemma":[0.998809,0.00042905434,0.00021262984,0.0002946358,0.00014370734,0.00011098597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050113513,0.00026076983,0.00053326535,0.00023106969,0.00019613138,0.00013533262,0.00018349555,0.00006453238,0.000068628564],"category_scores_gemma":[0.000013763462,0.00022705014,0.00020925124,0.00055903033,0.000013875395,0.00008336058,0.00009409826,0.00021739159,0.000008934771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008262173,0.00045562725,0.3147855,0.000967278,0.0075234408,0.000034201486,0.0018389056,0.12843369,0.011473022,0.047942407,0.07062857,0.41509113],"study_design_scores_gemma":[0.0013766303,0.00007586978,0.0006621034,0.0002770218,0.00027362505,0.000003732187,0.0003554383,0.9576648,0.00055524876,0.00044431313,0.037968047,0.00034318655],"about_ca_topic_score_codex":0.0017769858,"about_ca_topic_score_gemma":0.00009921807,"teacher_disagreement_score":0.8292311,"about_ca_system_score_codex":0.000044557837,"about_ca_system_score_gemma":0.00009930497,"threshold_uncertainty_score":0.9258836},"labels":[],"label_agreement":null},{"id":"W4415135987","doi":"10.1007/978-3-032-13509-4_21","title":"Detecting Patterns of Interaction in Temporal Hypergraphs via Edge Clustering","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Cluster analysis; Single-linkage clustering; Correlation clustering; Enhanced Data Rates for GSM Evolution; Complete-linkage clustering; Graph; Vertex (graph theory); Similarity (geometry)","score_opus":0.012244921896402921,"score_gpt":0.2679193665036202,"score_spread":0.2556744446072173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415135987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017344963,0.00032786094,0.9607125,0.0000505984,0.00042879838,0.00040848483,0.000015449346,0.00007039508,0.036251407],"genre_scores_gemma":[0.99683195,0.000019388455,0.0005895162,0.000048551414,0.0017288612,0.000025600444,0.00013324454,0.000054828062,0.00056807225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998297,0.000069970214,0.0007149272,0.00042819188,0.00015817024,0.00033177985],"domain_scores_gemma":[0.9988765,0.00030906926,0.00048098588,0.00024329284,0.00006299213,0.000027129454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020384724,0.00040522325,0.0008011387,0.00041526018,0.0000942545,0.000034124037,0.00025280716,0.0004414159,0.00021155951],"category_scores_gemma":[0.000007398425,0.00045922902,0.00040597504,0.00023380545,0.000046040266,0.000057702033,0.00021851703,0.001431814,7.3677126e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008915975,0.00006688769,0.09990774,0.00010419622,0.00033138585,0.000009849442,0.00061297114,0.045600727,0.000034136454,0.003154252,0.0001542429,0.84993446],"study_design_scores_gemma":[0.0025659527,0.00026888633,0.0065075215,0.009062103,0.00088461535,0.000004469026,0.00013968284,0.51097757,0.00074230495,0.4496608,0.014875784,0.004310322],"about_ca_topic_score_codex":0.0011715277,"about_ca_topic_score_gemma":0.0048530684,"teacher_disagreement_score":0.99509746,"about_ca_system_score_codex":0.00015261593,"about_ca_system_score_gemma":0.000034572382,"threshold_uncertainty_score":0.99978596},"labels":[],"label_agreement":null},{"id":"W4415250198","doi":"10.1145/3757421","title":"Robust Markov Stability for Community Detection at the Scale Learned based on the Structure","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Human-Computer Interaction","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Partition (number theory); Cluster analysis; Benchmark (surveying); Graph partition; Stability (learning theory); Robustness (evolution); Markov chain; Scale (ratio)","score_opus":0.05752910514052821,"score_gpt":0.313886935504531,"score_spread":0.2563578303640028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415250198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9878528,0.0000017522892,0.0061034425,0.002870255,0.00025404585,0.00075618946,0.000014064333,0.000059862585,0.0020875975],"genre_scores_gemma":[0.99848753,1.9184466e-7,0.0006613372,0.000346592,0.00022851283,0.00007229453,0.000011187921,0.00001420481,0.00017815811],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99900115,0.00010291816,0.00029526174,0.00024775843,0.00018852174,0.00016437184],"domain_scores_gemma":[0.99782264,0.0007164183,0.00035343942,0.00082458684,0.0002666733,0.000016261303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006485786,0.00019088258,0.0002003863,0.00007955945,0.0011887443,0.00013906049,0.0012617778,0.000047970494,0.00014785868],"category_scores_gemma":[0.00007113011,0.000104722734,0.00029896203,0.0002678946,0.00010506369,0.000113385984,0.0005881138,0.00065212883,0.000001293525],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040354794,0.0027756272,0.07340148,0.0006945862,0.0015594553,5.4717894e-8,0.0046861474,0.017659975,0.33933556,0.02416609,0.15337671,0.37830883],"study_design_scores_gemma":[0.0006252664,0.0003825382,0.01986622,0.00035334786,0.00021435536,5.0025335e-7,0.000910948,0.13908826,0.76594126,0.06860932,0.0037305607,0.00027743858],"about_ca_topic_score_codex":0.00018136189,"about_ca_topic_score_gemma":0.00012754505,"teacher_disagreement_score":0.42660567,"about_ca_system_score_codex":0.00018188491,"about_ca_system_score_gemma":0.000010810652,"threshold_uncertainty_score":0.91429806},"labels":[],"label_agreement":null},{"id":"W4415293251","doi":"10.1109/tcss.2025.3597202","title":"Overlapping Community Detection to Generate a Maximum Proximity-Driven Feedback Method for Group Consensus Under Social Network","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Computational Social Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Social network analysis; Social network (sociolinguistics); Group (periodic table); Order (exchange); Focus (optics); Network analysis; Information exchange; Network topology","score_opus":0.034565609119711425,"score_gpt":0.3227608627265405,"score_spread":0.28819525360682907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415293251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013894892,0.000045860997,0.97802335,0.0013024056,0.0023815872,0.00325129,0.00051783625,0.00024865996,0.00033412725],"genre_scores_gemma":[0.9735123,0.0000018729346,0.021936376,0.00040094779,0.0023553635,0.0012034072,0.0001355917,0.00008374061,0.00037038134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99400246,0.0024619286,0.0013522563,0.0007719575,0.0005624207,0.00084896473],"domain_scores_gemma":[0.9964787,0.0016216317,0.0005981187,0.00030279736,0.0008268711,0.00017189681],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014058789,0.0006787573,0.001174056,0.00040315438,0.007471294,0.0005665932,0.00044199722,0.0003956396,0.000030714964],"category_scores_gemma":[0.0000047067747,0.0008628762,0.0010429377,0.0018364568,0.00016870172,0.0001412201,0.000019005587,0.0011631686,0.00002254627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043109627,0.0007036071,0.00001589813,0.00018326941,0.0021923152,4.4851026e-7,0.0010354647,0.9242387,0.000579655,0.020658664,0.0029073816,0.047053505],"study_design_scores_gemma":[0.0022664852,0.00036002143,0.00081962737,0.00034342814,0.001155338,0.0000030017532,0.0023997985,0.92473125,0.00024122231,0.061827987,0.004787739,0.0010641008],"about_ca_topic_score_codex":0.0024493716,"about_ca_topic_score_gemma":0.0007667902,"teacher_disagreement_score":0.95961744,"about_ca_system_score_codex":0.0010911953,"about_ca_system_score_gemma":0.0003771977,"threshold_uncertainty_score":0.9993822},"labels":[],"label_agreement":null},{"id":"W4415667533","doi":"10.55016/ojs/cdm.v20i2.79191","title":"More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Degenerate energy levels; Time complexity; Set (abstract data type); Polynomial; Incentive; Approximation algorithm","score_opus":0.007930120359548974,"score_gpt":0.29739604898819866,"score_spread":0.28946592862864967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43206558,0.00051861885,0.5597556,0.0005096221,0.000020265172,0.0036896593,0.0030161545,0.000027948667,0.0003965254],"genre_scores_gemma":[0.96311796,0.000053513468,0.03612781,0.000009222478,0.000017053846,0.00039799343,0.00014672388,0.000019306312,0.00011041289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973715,0.000077764365,0.0014338177,0.0004684225,0.00021818448,0.00043033165],"domain_scores_gemma":[0.99686074,0.00043064993,0.00077517814,0.0006798164,0.0011520565,0.00010152908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005751291,0.0003712354,0.0011284478,0.00050488394,0.00014319298,0.000060837043,0.0003568733,0.00010343498,0.0000034221673],"category_scores_gemma":[0.00018566694,0.00032343782,0.00018888188,0.0015802083,0.00049978256,0.00016270363,0.0002490488,0.0001961319,4.5410005e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012673622,0.0027388623,0.070367254,0.004004476,0.0029303946,0.0000011520656,0.0113195665,0.0032513593,0.0077232397,0.8869844,0.00063941145,0.008772506],"study_design_scores_gemma":[0.014319835,0.0017246051,0.026776547,0.029171368,0.0035009342,0.000002492353,0.005043753,0.3186163,0.052324913,0.5449165,0.0018062176,0.0017965334],"about_ca_topic_score_codex":0.0001334965,"about_ca_topic_score_gemma":0.00007997051,"teacher_disagreement_score":0.5310524,"about_ca_system_score_codex":0.000076796765,"about_ca_system_score_gemma":0.0002253358,"threshold_uncertainty_score":0.99992174},"labels":[],"label_agreement":null},{"id":"W4415699634","doi":"10.1257/aer.20180798","title":"Just a Few Seeds More: The Value of Network Data for Diffusion","year":2025,"lang":"en","type":"article","venue":"American Economic Review","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Seeding; Diffusion; Heuristics; Set (abstract data type); Range (aeronautics); Cascade; Value (mathematics); Expected value","score_opus":0.02437106792653829,"score_gpt":0.34267849852728627,"score_spread":0.31830743060074795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415699634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0654531,0.29367137,0.44489598,0.05833814,0.001385171,0.014893688,0.0014606982,0.00046192118,0.119439945],"genre_scores_gemma":[0.93258107,0.04570969,0.011408979,0.0063358108,0.0012111568,0.00058754993,0.0008877049,0.000060810693,0.0012172594],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893516,0.00007605915,0.0004756912,0.0002911531,0.000034566354,0.00018735458],"domain_scores_gemma":[0.99789816,0.00025040828,0.00042755637,0.0013762098,0.00002146244,0.00002622899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000507932,0.00013690814,0.00062548614,0.000024341249,0.00008530515,0.000017705634,0.0008584577,0.000008607153,0.0001227708],"category_scores_gemma":[0.0000085535785,0.000099498495,0.00021528809,0.0002524434,0.00016398479,0.00005333544,0.0003930286,0.000073019524,0.0000081352755],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057545926,0.000033184777,0.008555732,0.00021754716,0.0003121389,3.298313e-8,0.000011993622,0.0001863024,0.000004097798,0.055611525,0.26943067,0.665631],"study_design_scores_gemma":[0.00013258113,0.000029416999,0.0025605927,0.0010807578,0.0006688054,2.2223318e-7,0.000079836565,0.019182108,0.000009871665,0.004565849,0.97151256,0.0001773865],"about_ca_topic_score_codex":0.00068184495,"about_ca_topic_score_gemma":0.000020734555,"teacher_disagreement_score":0.86712795,"about_ca_system_score_codex":0.000028289316,"about_ca_system_score_gemma":0.00008153111,"threshold_uncertainty_score":0.4057431},"labels":[],"label_agreement":null},{"id":"W4415704413","doi":"10.1016/j.neucom.2025.131875","title":"Influence maximization in complex networks using community-structure-based technique with multi-level information fusion","year":2025,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Natural Science Foundation of Anhui Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Maximization; Ranking (information retrieval); Node (physics); Stability (learning theory); Complex network; Scheme (mathematics); Similarity (geometry)","score_opus":0.024543024744213562,"score_gpt":0.2792737723569896,"score_spread":0.25473074761277603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415704413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40898257,0.0000015857644,0.5904069,0.000015518672,0.000009710643,0.00035114374,0.0000033050765,0.000088862405,0.00014039032],"genre_scores_gemma":[0.9093004,1.5346932e-7,0.09019398,0.00029990484,0.000026664648,0.00001810828,0.00014624394,0.000012844727,0.0000017452911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987113,0.00027056158,0.00045094796,0.00016946338,0.0001310132,0.0002667019],"domain_scores_gemma":[0.99906766,0.00013389286,0.0002662068,0.00034484302,0.00015560408,0.00003176418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002602456,0.00021202452,0.0002509721,0.0003735764,0.00041209057,0.000113193884,0.00029751417,0.000058974652,0.000010837014],"category_scores_gemma":[0.000011317457,0.00021085344,0.000048516835,0.0011488559,0.00004940756,0.00027535675,0.00019686826,0.0006176108,4.4811426e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016427377,0.000047521997,0.097916,0.00002151688,0.000009028142,4.409512e-7,0.00006474781,0.883898,0.003152928,0.00038290836,0.000016034566,0.014474414],"study_design_scores_gemma":[0.000503433,0.000020126465,0.09792975,0.00020408479,0.000017591678,8.9101803e-7,0.000037661546,0.89860225,0.0020924397,0.0002935962,0.00012792235,0.00017026957],"about_ca_topic_score_codex":0.0010145567,"about_ca_topic_score_gemma":0.00008455704,"teacher_disagreement_score":0.50031775,"about_ca_system_score_codex":0.000072300725,"about_ca_system_score_gemma":0.00006391412,"threshold_uncertainty_score":0.8598354},"labels":[],"label_agreement":null},{"id":"W4416017426","doi":"10.1145/3746252.3760910","title":"On Influence Tail Bounds in Online Social Networks","year":2025,"lang":"","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Victoria","funders":"","keywords":"Set (abstract data type); Maximization; Upper and lower bounds; Probability distribution; Imprecise probability; Distribution (mathematics)","score_opus":0.007611903619822636,"score_gpt":0.29204395284269724,"score_spread":0.28443204922287463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416017426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78479815,0.00039875053,0.13811508,0.0026935495,0.00029346423,0.0006708285,0.000030729025,0.00018944363,0.07281001],"genre_scores_gemma":[0.9928394,0.000037691818,0.00039126383,0.0011883742,0.0005418596,0.000040012124,0.00009140905,0.000022712153,0.0048473044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974107,0.00017343082,0.00083785807,0.0006566575,0.0002257492,0.00069556234],"domain_scores_gemma":[0.9988693,0.0002367226,0.00019126789,0.00050416455,0.00012697799,0.00007154891],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030011203,0.00042821022,0.0006714055,0.0003748569,0.00032504307,0.0002367012,0.0005548062,0.00019200146,0.0009497803],"category_scores_gemma":[0.000011461046,0.00045671556,0.00036002844,0.0019180463,0.00017678838,0.00014358696,0.00036147132,0.0008862115,0.000029987805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014014609,0.0018722785,0.08774716,0.000022867936,0.00039305098,0.000005781929,0.00017218837,0.07103855,0.000034030687,0.64445305,0.037600115,0.15652075],"study_design_scores_gemma":[0.002047627,0.00024999896,0.15210886,0.0007174684,0.00032776708,1.5829025e-7,0.00057256146,0.6171174,0.00013241576,0.1737662,0.051612027,0.0013475094],"about_ca_topic_score_codex":0.0009449532,"about_ca_topic_score_gemma":0.0008403868,"teacher_disagreement_score":0.54607886,"about_ca_system_score_codex":0.00021668518,"about_ca_system_score_gemma":0.00021726219,"threshold_uncertainty_score":0.99996346},"labels":[],"label_agreement":null},{"id":"W4416603705","doi":"10.5256/f1000research.120409.r150275","title":"Referee report. For: Heatmaps and consensus clustering for ego network exploration [version 1; peer review: 1 approved with reservations]","year":2022,"lang":"en","type":"article","venue":"Faculty of 1000 Research Ltd","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institutes of Health Research; Heart and Stroke Foundation of Canada; AstraZeneca","keywords":"Cluster analysis; Field (mathematics); Id, ego and super-ego; The Internet","score_opus":0.10438987909528086,"score_gpt":0.38853299213002135,"score_spread":0.2841431130347405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416603705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06575258,0.003814749,0.58327395,0.30995908,0.00020982987,0.018547844,0.0048104622,0.00041647517,0.013215004],"genre_scores_gemma":[0.67108613,0.00024664134,0.14400783,0.00023541218,0.0011452213,0.008380003,0.034387928,0.00017224831,0.14033858],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976757,0.00023831717,0.00040138484,0.00037656512,0.0009536531,0.00035436914],"domain_scores_gemma":[0.99624443,0.00044588084,0.0002137985,0.0004608059,0.002563502,0.00007160743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044289576,0.00012619422,0.00031960307,0.00010240735,0.0007448133,0.000044728647,0.00021845807,0.000024411964,0.0001064951],"category_scores_gemma":[0.00022114988,0.00011412919,0.00010443896,0.00048435925,0.00009326103,0.00010107007,0.00033030575,0.00025765772,8.297483e-7],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000296044,0.000067451176,0.0022472243,0.00021274373,0.00010562497,0.0000017726901,0.0001078752,0.0012211592,0.00038781823,0.001822931,0.989627,0.0039023461],"study_design_scores_gemma":[0.0005555922,0.00043722484,0.00019364167,0.00030333668,0.000055262437,0.00000402392,0.00058663095,0.012842389,0.00030457007,0.0054229638,0.9791298,0.0001645939],"about_ca_topic_score_codex":0.00033797172,"about_ca_topic_score_gemma":0.00014252994,"teacher_disagreement_score":0.60533357,"about_ca_system_score_codex":0.00008640445,"about_ca_system_score_gemma":0.000114792,"threshold_uncertainty_score":0.5728577},"labels":[],"label_agreement":null},{"id":"W4416906474","doi":"10.1007/978-3-032-11976-6_31","title":"Enhancing Algorithms with LLMs: A Case Study","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Alberta","funders":"","keywords":"Focus (optics); Domain (mathematical analysis); Range (aeronautics); Domain-specific language; Key (lock); Domain knowledge","score_opus":0.011068887952618607,"score_gpt":0.2676347582028158,"score_spread":0.25656587025019717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416906474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017202877,0.00006954751,0.99228215,0.00003708384,0.00016215802,0.0005591657,0.000005206501,0.00009290987,0.0050714775],"genre_scores_gemma":[0.8532731,0.0000010612642,0.14522864,0.00010309187,0.0005938183,0.000028225657,0.0000061810456,0.00002805133,0.0007378151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976811,0.00002753952,0.0003821555,0.0010402936,0.00046437792,0.0004045449],"domain_scores_gemma":[0.9983985,0.0002571025,0.00019560823,0.00088240916,0.00018468205,0.00008173054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004291095,0.00044158322,0.00055653456,0.00056566694,0.00025862324,0.0002469492,0.000743524,0.00007358124,0.000092903865],"category_scores_gemma":[0.000004284308,0.0003635776,0.0001117247,0.00057632715,0.0002728615,0.00012387693,0.0005798891,0.00064546877,0.0000048349657],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066122775,0.00014057974,0.0015600541,0.000017250297,0.00013433848,0.0017041045,0.0013183503,0.006852945,0.000013863617,0.002054308,0.000029525463,0.9861681],"study_design_scores_gemma":[0.002537928,0.0026472013,0.00015035472,0.0040299348,0.0009297125,0.0012220324,0.00009940284,0.7135988,0.004953207,0.259942,0.0042337417,0.0056556845],"about_ca_topic_score_codex":0.0007268021,"about_ca_topic_score_gemma":0.0011316998,"teacher_disagreement_score":0.9805124,"about_ca_system_score_codex":0.00012552468,"about_ca_system_score_gemma":0.00035332493,"threshold_uncertainty_score":0.9998816},"labels":[],"label_agreement":null},{"id":"W4417128624","doi":"10.1016/j.physleta.2025.131239","title":"Structure and robustness of networks generated by a q-Maxwell-Boltzmann degree distribution","year":2025,"lang":"en","type":"article","venue":"Physics Letters A","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Particle Physics","funders":"National Key Research and Development Program of China; Key Technologies Research and Development Program","keywords":"Degree distribution; Robustness (evolution); Degree (music); Topology (electrical circuits); Scale-free network; Network topology; Function (biology); Distribution (mathematics); Path (computing)","score_opus":0.007090702343557323,"score_gpt":0.2269272757101999,"score_spread":0.21983657336664258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417128624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38840517,0.00010436853,0.61090016,0.00023592195,0.000039314073,0.00010285689,0.00008928661,0.000028853538,0.00009403227],"genre_scores_gemma":[0.99762815,0.0000043740324,0.0005732479,0.00012999841,0.00026326987,0.000014144179,0.0013418865,0.000011735509,0.000033207903],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991894,0.00004791134,0.0002126043,0.00024997324,0.00009483595,0.00020529625],"domain_scores_gemma":[0.99947697,0.000038888156,0.00012818126,0.00025773048,0.00006468575,0.000033520075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050201616,0.00017567103,0.00027689902,0.000025902264,0.000092354385,0.000043454205,0.00014767786,0.000035291545,0.00002007477],"category_scores_gemma":[0.000001194746,0.00017362165,0.00008764005,0.00042432238,0.00008448004,0.00007792681,0.000091538735,0.00016869462,1.6641889e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008155476,0.0003612453,0.0795119,0.000096218486,0.0014168423,0.0000016762676,0.00011360592,0.14607312,0.14120921,0.04814213,0.42287615,0.16011634],"study_design_scores_gemma":[0.0016103702,0.00005454182,0.008596666,0.000222636,0.0007777798,7.3754995e-7,0.000059360875,0.8426936,0.12342291,0.0139963515,0.007436544,0.001128453],"about_ca_topic_score_codex":0.000088406625,"about_ca_topic_score_gemma":0.0000022518402,"teacher_disagreement_score":0.6966205,"about_ca_system_score_codex":0.000022051188,"about_ca_system_score_gemma":0.000012960044,"threshold_uncertainty_score":0.7080085},"labels":[],"label_agreement":null},{"id":"W4417517135","doi":"10.1142/s0129183127500379","title":"Modeling and analysis of interest-tag-driven information cocoons formation mechanisms","year":2025,"lang":"en","type":"article","venue":"International Journal of Modern Physics C","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Perspective (graphical); Mechanism (biology); Phenomenon; Point of interest; Information aggregation; Dynamics (music); Information cascade","score_opus":0.023438415888979262,"score_gpt":0.29416543557828984,"score_spread":0.27072701968931057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417517135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1810653,0.000017292636,0.8179681,0.0001221813,0.00007202456,0.000045671513,0.000028391836,0.0000072862354,0.0006737518],"genre_scores_gemma":[0.99395394,0.000012063997,0.0058213766,0.00004947398,0.000068543064,0.000003012418,0.000077675795,0.0000038718563,0.000010051602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989577,0.000029249295,0.00062753854,0.000067091234,0.00023859495,0.00007983076],"domain_scores_gemma":[0.99847656,0.000047632857,0.0005180396,0.00010978992,0.0008180864,0.000029911924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017049756,0.00009968385,0.00028608867,0.00054598186,0.00003396312,0.00007297343,0.00028759998,0.000024189476,0.000021209067],"category_scores_gemma":[0.000008495426,0.00009522335,0.00025762105,0.00031915447,0.000021000278,0.00083817326,0.00010756532,0.00013426307,6.075884e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008229493,0.00015198554,0.0033839445,0.000013580916,0.00548503,6.375217e-7,0.00094910705,0.38958725,0.0045019565,0.4172446,0.00015321626,0.17844635],"study_design_scores_gemma":[0.00022145444,0.000014903764,0.00019377429,0.000059547376,0.00046827327,5.1847655e-7,0.00009520857,0.76637346,0.0026242458,0.22985944,0.000034118617,0.000055062712],"about_ca_topic_score_codex":0.00003629724,"about_ca_topic_score_gemma":0.000008484568,"teacher_disagreement_score":0.8128886,"about_ca_system_score_codex":0.000047912683,"about_ca_system_score_gemma":0.00004141144,"threshold_uncertainty_score":0.38830954},"labels":[],"label_agreement":null},{"id":"W4503277","doi":"10.1609/icwsm.v3i1.13983","title":"Information Cascades in the Blogosphere: A Look Behind the Curtain","year":2009,"lang":"en","type":"article","venue":"Proceedings of the International AAAI Conference on Web and Social Media","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Blogosphere; Subject (documents); Cascade; Population; Computer science; Information cascade; Event (particle physics); Data science; World Wide Web; Sociology; Engineering; Physics; Mathematics; The Internet; Statistics","score_opus":0.01493910200808891,"score_gpt":0.25401145900321537,"score_spread":0.23907235699512647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4503277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94139534,0.00001087718,0.000015939286,0.018248096,0.00006278457,0.00016997811,0.000012201045,0.000010714994,0.04007407],"genre_scores_gemma":[0.9990992,0.000011410102,0.000031547526,0.0005249952,0.00025858203,0.000019302606,0.0000057904977,0.0000020472585,0.000047116817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993008,0.000011766208,0.0002019449,0.00007051266,0.00031486625,0.0001001442],"domain_scores_gemma":[0.9994997,0.00009959515,0.0001832673,0.000043536445,0.00016250952,0.000011436834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031732608,0.00008765605,0.00010641664,0.000034719324,0.00012200186,0.00013787062,0.0005667429,0.000029285497,0.000070481095],"category_scores_gemma":[0.000039090482,0.00004632396,0.00006777441,0.00009546834,0.00009906264,0.00018580978,0.00005715119,0.0002125993,0.0000021069957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027473872,0.00006807042,0.011733426,0.0000035529529,0.00003820314,5.1256592e-8,0.019097216,0.0000015888866,0.00047062078,0.9084687,0.0042619295,0.055829126],"study_design_scores_gemma":[0.0009710102,0.00010730665,0.117104575,0.000190491,0.0000963774,0.0000026532296,0.04376617,0.0069802827,0.0024888495,0.80996054,0.017960824,0.00037093874],"about_ca_topic_score_codex":0.000046177236,"about_ca_topic_score_gemma":0.000032374803,"teacher_disagreement_score":0.105371155,"about_ca_system_score_codex":0.000016399174,"about_ca_system_score_gemma":0.000033191045,"threshold_uncertainty_score":0.18890361},"labels":[],"label_agreement":null},{"id":"W583049428","doi":"","title":"Visualisierungs- und Interaktionsdesign für multivariante, zeitbezogene Daten in sozialen Netzwerken","year":2009,"lang":"de","type":"article","venue":"Ingénierie des systèmes d information","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Political science","score_opus":0.016037965049955052,"score_gpt":0.2983780950239613,"score_spread":0.28234012997400626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W583049428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19563365,0.003903762,0.7657065,0.0006543661,0.0014436266,0.00363783,0.0004943568,0.00081510557,0.027710814],"genre_scores_gemma":[0.9919436,0.00017996262,0.0045019826,0.00025629773,0.0006244368,0.00007860728,0.0022083411,0.000033069588,0.00017371125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962446,0.00031518214,0.001818334,0.00039086243,0.00041698513,0.00081402616],"domain_scores_gemma":[0.99775714,0.00013627355,0.0008577691,0.00070509507,0.00035429737,0.00018944478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091407495,0.0005863867,0.00076278334,0.000904202,0.00037335863,0.0008207802,0.000630301,0.0002520042,0.00028282977],"category_scores_gemma":[0.000082009006,0.00063309947,0.00030695036,0.0013845309,0.00015832768,0.0035459648,0.00017999257,0.0004932135,0.0007000739],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036127574,0.0006617494,0.0092903115,0.00022341324,0.0009950899,0.000016458043,0.014447756,0.005432437,0.001156482,0.047989585,0.010284982,0.90914047],"study_design_scores_gemma":[0.007821639,0.002031519,0.16643186,0.005569111,0.0020143494,0.000022347778,0.0050480217,0.50567794,0.010509393,0.11056263,0.17855245,0.005758711],"about_ca_topic_score_codex":0.000835617,"about_ca_topic_score_gemma":0.00004642787,"teacher_disagreement_score":0.90338176,"about_ca_system_score_codex":0.00058159005,"about_ca_system_score_gemma":0.00020910957,"threshold_uncertainty_score":0.99961203},"labels":[],"label_agreement":null},{"id":"W64062701","doi":"","title":"Autorennetzwerke: Netzwerkanalyse als Mehrwertdienst für Informationssysteme","year":2004,"lang":"de","type":"article","venue":"Ingénierie des systèmes d information","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Centrality; Computer science; Data science; Social network analysis; Information networks; Knowledge management; World Wide Web; Social media","score_opus":0.012273181296326688,"score_gpt":0.25911610625083814,"score_spread":0.24684292495451146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W64062701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09699872,0.0036102303,0.8244491,0.00056421064,0.0030042664,0.0033995179,0.0007929676,0.0016556747,0.06552531],"genre_scores_gemma":[0.98873186,0.00016669711,0.0056683035,0.00027473576,0.0011278929,0.00023944385,0.0035351345,0.000056643898,0.00019931636],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943152,0.00018505655,0.003060303,0.00039670145,0.0008894415,0.0011532659],"domain_scores_gemma":[0.99522007,0.00011911359,0.0020118419,0.0012062719,0.001040425,0.0004022661],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001120244,0.0008716854,0.0011023879,0.0010635657,0.0011100267,0.0015908732,0.0008544255,0.0003454246,0.0004859232],"category_scores_gemma":[0.00011954792,0.0009019017,0.00072994723,0.0019722532,0.00039151317,0.0071295095,0.00035584875,0.0005906624,0.005135184],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028490013,0.000803869,0.008035324,0.0026740516,0.007311824,0.000019596038,0.061209824,0.17779846,0.00023867503,0.34507447,0.038794667,0.35775432],"study_design_scores_gemma":[0.008744611,0.0012239439,0.011534378,0.0061217025,0.0049333377,0.000076282064,0.014344408,0.10765079,0.0038452267,0.1390092,0.6955397,0.00697642],"about_ca_topic_score_codex":0.0012845945,"about_ca_topic_score_gemma":0.000063387044,"teacher_disagreement_score":0.8917331,"about_ca_system_score_codex":0.0013874286,"about_ca_system_score_gemma":0.0006138857,"threshold_uncertainty_score":0.99944556},"labels":[],"label_agreement":null},{"id":"W67692804","doi":"10.1007/978-3-642-33500-6_7","title":"Scalable Social Graph Analytics Using the Vertica Analytic Platform","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Scalability; Computer science; SQL; Analytics; Social graph; Implementation; Graph; Graph database; Theoretical computer science; Data science; Relational database; Big data; World Wide Web; Database; Data mining; Programming language; Social media","score_opus":0.026763861688593706,"score_gpt":0.26610747232192977,"score_spread":0.23934361063333606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67692804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039688442,0.0005183937,0.9410929,0.00024704018,0.00011894844,0.00039222368,0.000023306264,0.000115365314,0.05709495],"genre_scores_gemma":[0.9953088,0.000020358628,0.0027907228,0.00027988397,0.00089298876,0.00001585585,0.0003739374,0.00005771297,0.00025972014],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797887,0.0000132553105,0.0008684812,0.00020657016,0.00046928786,0.00046356546],"domain_scores_gemma":[0.9982055,0.00009482224,0.00079964695,0.00033393622,0.0005156357,0.000050463404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003204648,0.0004824118,0.0005759221,0.0005798211,0.0006009891,0.0004310642,0.0003920888,0.0002868842,0.00046520407],"category_scores_gemma":[0.000024974888,0.00037712784,0.00021040611,0.0008126475,0.00019203292,0.0013672538,0.00015884794,0.00071171194,0.000018590505],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005204723,0.000051894967,0.002769568,0.00049936754,0.00032287833,0.0000011755901,0.0021169002,0.042526916,0.000016849961,0.0454246,0.00022425514,0.9059935],"study_design_scores_gemma":[0.0011275229,0.000021997113,0.0014042541,0.0019625232,0.0023366413,0.0000129884775,0.0001653338,0.42290008,0.00048068608,0.4849238,0.08174751,0.002916657],"about_ca_topic_score_codex":0.000085247884,"about_ca_topic_score_gemma":0.000025501351,"teacher_disagreement_score":0.9949119,"about_ca_system_score_codex":0.0001957284,"about_ca_system_score_gemma":0.00022861217,"threshold_uncertainty_score":0.9998681},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006170156430280193,"score_gpt":0.22553159397816627,"score_spread":0.2193614375478861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67958692","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9582099,0.000020888536,0.025268588,0.00029632106,0.000013712906,0.00009251354,0.000014976203,0.00013818206,0.015944922],"genre_scores_gemma":[0.9925599,7.096719e-7,0.006573209,0.00016950474,0.00015411811,0.00000599259,0.00010415829,0.000009045748,0.00042333742],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99940825,0.000017904295,0.00008611204,0.0002113816,0.00010904135,0.00016733956],"domain_scores_gemma":[0.999591,0.000035456487,0.000057867055,0.00022982372,0.00003337617,0.000052479594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000022928043,0.00013602687,0.00017428097,0.000047589314,0.000059870046,0.000047312813,0.0001278469,0.000022612754,0.00090877805],"category_scores_gemma":[3.9853634e-7,0.00010048652,0.00008599326,0.00014238415,0.00001245249,0.000062167535,0.0000163146,0.00010020607,0.0000062440527],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020351621,0.00009731644,0.9232121,8.0994516e-7,0.00024157474,0.0000062729696,0.0003118623,0.000036160745,0.000561527,0.015472823,0.022087673,0.037951503],"study_design_scores_gemma":[0.0010326788,0.00047762765,0.8978564,0.00016863612,0.000399259,0.0000012301185,0.0014943251,0.0017412313,0.026552366,0.060209695,0.008868374,0.001198152],"about_ca_topic_score_codex":0.00046729896,"about_ca_topic_score_gemma":0.0000645241,"teacher_disagreement_score":0.04473687,"about_ca_system_score_codex":0.0000081435355,"about_ca_system_score_gemma":0.000009660938,"threshold_uncertainty_score":0.9950483},"labels":[],"label_agreement":null},{"id":"W6901874545","doi":"10.60692/esbfc-hrr92","title":"Peer Review #2 of \"Causal graph extraction from news: a comparative study of time-series causality learning techniques (v0.2)\"","year":2022,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Causality (physics); Causal structure; Graph; Causal inference; Causal analysis; Causal model; Domain (mathematical analysis); Information extraction","score_opus":0.043843231209001333,"score_gpt":0.2894993411761414,"score_spread":0.24565610996714007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901874545","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95345646,0.000040758518,0.03609502,0.0000789127,0.00008598193,0.0016182223,0.00039074422,0.0003273835,0.007906531],"genre_scores_gemma":[0.9985865,6.2037435e-7,0.00054980716,0.000011805057,0.00004425847,0.00028325952,0.00026270255,0.0000075175603,0.00025353403],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9975792,0.0004330502,0.0010249262,0.00014641776,0.00069352955,0.00012286588],"domain_scores_gemma":[0.9978418,0.000020373627,0.0011999622,0.00035103902,0.000555156,0.000031698775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008237297,0.00017074602,0.00058601773,0.00020141786,0.00018126372,0.000035920097,0.00018815782,0.00002204596,0.00041904923],"category_scores_gemma":[0.000007309411,0.00015896671,0.00014376042,0.00044787096,0.000027023494,0.00049401127,0.00015091435,0.00020764064,0.000015235823],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002369576,0.00014554292,0.82769114,0.0013460718,0.0010256864,0.0000012204412,0.16058826,0.0008999566,0.00007501157,0.00083208695,0.005078171,0.0020798878],"study_design_scores_gemma":[0.003222,0.0031548205,0.09065296,0.005418934,0.002120914,0.00001754367,0.8350717,0.005053941,0.022337532,0.0002929172,0.030554226,0.0021025164],"about_ca_topic_score_codex":0.0007735098,"about_ca_topic_score_gemma":0.0000015098105,"teacher_disagreement_score":0.7370382,"about_ca_system_score_codex":0.00006039016,"about_ca_system_score_gemma":0.00002710886,"threshold_uncertainty_score":0.6482474},"labels":[],"label_agreement":null},{"id":"W6920245272","doi":"10.60692/mg1qs-c0d73","title":"Peer Review #1 of \"Causal graph extraction from news: a comparative study of time-series causality learning techniques (v0.1)\"","year":2022,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Causality (physics); Causal structure; Graph; Causal inference; Causal analysis; Causal model; Domain (mathematical analysis); Information extraction","score_opus":0.043775722554702676,"score_gpt":0.28926368619926784,"score_spread":0.24548796364456515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920245272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94979835,0.00004221465,0.038901743,0.000081388156,0.00009056679,0.0016711587,0.0004113812,0.0003392981,0.008663903],"genre_scores_gemma":[0.99859947,6.0934394e-7,0.0005167094,0.0000115059365,0.000044055025,0.00027871318,0.0002586941,0.000007480446,0.00028278172],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99759626,0.00042982906,0.00102416,0.00014517379,0.0006828395,0.0001217251],"domain_scores_gemma":[0.99782336,0.00002029324,0.001192739,0.0003473056,0.0005850597,0.000031260282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008129033,0.0001700446,0.0005855638,0.00020105542,0.00017760444,0.0000353976,0.00018814212,0.000021370493,0.00042376955],"category_scores_gemma":[0.000008022221,0.00015795024,0.00014532321,0.00044004133,0.000027159269,0.0004786891,0.00015079792,0.00020702387,0.000015229808],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002454548,0.00014976964,0.82217896,0.0013898793,0.0010638698,0.0000012623744,0.1656443,0.000794483,0.00007838684,0.0008527561,0.0055775135,0.0020233798],"study_design_scores_gemma":[0.0030128732,0.002925108,0.07704521,0.005594192,0.0019503855,0.000016836862,0.85117537,0.004763863,0.021441571,0.00025936213,0.029871391,0.0019438291],"about_ca_topic_score_codex":0.00079043716,"about_ca_topic_score_gemma":0.0000015896832,"teacher_disagreement_score":0.74513376,"about_ca_system_score_codex":0.000061751896,"about_ca_system_score_gemma":0.00002663767,"threshold_uncertainty_score":0.6441024},"labels":[],"label_agreement":null},{"id":"W6923541702","doi":"10.14288/1.0151388","title":"Douglas Kenny visiting Clinton Elementary School, Burnaby","year":2003,"lang":"en","type":"other","venue":"cIRcle (University of British Columbia)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"George (robot); Government (linguistics); Perspective (graphical)","score_opus":0.005454774632951684,"score_gpt":0.19224368134134112,"score_spread":0.18678890670838943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6923541702","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039348125,0.00083490816,0.0067220265,0.000028118664,0.00029420012,0.000593739,0.0006447796,0.0003669432,0.95116717],"genre_scores_gemma":[0.37254572,0.0003817371,0.009394412,0.00009438723,0.0013513962,0.000002911853,0.00075492146,0.00044964533,0.61502486],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984687,0.00009823413,0.00021992564,0.0005673093,0.00028067085,0.00036517726],"domain_scores_gemma":[0.99871945,0.000023797063,0.0004871644,0.0005135968,0.00009055262,0.00016542118],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017750284,0.00011960697,0.0005972684,0.0001267129,0.00018930725,0.00012804315,0.0005144908,0.00015886877,0.02160644],"category_scores_gemma":[0.0000029945088,0.00046386928,0.00039218593,0.0003317237,0.00015602027,0.00012395874,0.00021837356,0.00035228106,0.00010007218],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001860764,0.00009994747,0.017377576,0.00003896227,0.00035684792,0.00003335454,0.000010550754,0.0000011574031,0.0000098975825,0.000014104023,0.72625333,0.2558024],"study_design_scores_gemma":[0.0012507013,0.000078615936,0.11629323,0.0011530047,0.00054475653,0.0000091752145,0.0009560081,0.00009704008,9.520558e-7,0.0022692443,0.8763477,0.00099957],"about_ca_topic_score_codex":0.3326773,"about_ca_topic_score_gemma":0.14861712,"teacher_disagreement_score":0.3361423,"about_ca_system_score_codex":0.00008651988,"about_ca_system_score_gemma":0.00008801495,"threshold_uncertainty_score":0.9997813},"labels":[],"label_agreement":null},{"id":"W6929368903","doi":"10.48448/1qh6-p337","title":"mAggretriever: A Simple yet Effective Approach to Zero-Shot Multilingual Dense Retrieval | VIDEO","year":2023,"lang":"en","type":"other","venue":"Open MIND","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Inference; Training set; Task (project management); Transformer; Training (meteorology); Language model; Code (set theory); Task analysis; Question answering","score_opus":0.034451532588092644,"score_gpt":0.3355934445270107,"score_spread":0.30114191193891804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929368903","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047164084,0.00008723339,0.0087895645,0.000019661098,0.0002246528,0.0042822645,0.0008716714,0.00012248213,0.98088604],"genre_scores_gemma":[0.12056996,0.0000074743502,0.02850997,0.000061034327,0.0015856562,0.00035288534,0.0011931706,0.0019755666,0.8457443],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974296,0.00015539248,0.00039411214,0.0010965572,0.00039041956,0.00053390826],"domain_scores_gemma":[0.998198,0.00023442705,0.00032205688,0.00094637804,0.00007779547,0.0002213605],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005330972,0.0005440571,0.0009213938,0.0003357371,0.00010609374,0.00034518205,0.0011685139,0.0002203641,0.008440866],"category_scores_gemma":[0.000060081802,0.0005420729,0.00029350788,0.0009735724,0.00006339976,0.00007299646,0.0010594998,0.0004321615,0.0018873323],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020725513,0.00028321578,0.00092665834,0.000015638978,0.00090214954,0.000017798815,0.00043757944,0.000043319647,0.00007951984,0.00011987162,0.7459844,0.2509826],"study_design_scores_gemma":[0.0006510408,0.00013617291,0.00009320651,0.00022206358,0.0003038648,0.0000013671391,0.00013299013,0.00059975026,0.0018973114,0.0005451215,0.99456495,0.00085213914],"about_ca_topic_score_codex":0.002037992,"about_ca_topic_score_gemma":0.00032373404,"teacher_disagreement_score":0.25013047,"about_ca_system_score_codex":0.00009835765,"about_ca_system_score_gemma":0.00012703794,"threshold_uncertainty_score":0.9997031},"labels":[],"label_agreement":null},{"id":"W6929733136","doi":"10.5064/f6buax58/r9tsry","title":"Burke_EDI_NENA.TransitionNarratives.2018.04.19.pdf","year":2018,"lang":"en","type":"dataset","venue":"Syracuse University Qualitative Data Repository","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Transition (genetics); Narrative; Word (group theory); Minor (academic)","score_opus":0.04336733142884118,"score_gpt":0.33231042601757754,"score_spread":0.28894309458873635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929733136","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019203193,0.00006335417,0.0060092728,0.00011903462,0.0006457639,0.00045166732,0.98835,0.0001519452,0.004016962],"genre_scores_gemma":[0.0005527076,0.000037919828,0.0017773118,0.00006697383,0.0021483568,0.000004917,0.99010414,0.000037357953,0.0052703437],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944576,0.0020135934,0.0006418664,0.0016162796,0.0007033771,0.00056725385],"domain_scores_gemma":[0.99429715,0.00068211695,0.00086787465,0.0033558004,0.0004429994,0.00035403992],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009632535,0.00074984593,0.00094641617,0.000520063,0.0010097636,0.00017006964,0.003017931,0.0003071891,0.0029402007],"category_scores_gemma":[0.000047842233,0.00083351793,0.0003637465,0.00066822645,0.00096509967,0.0009897833,0.0014619177,0.0009551535,0.0006777933],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009344718,0.00025065453,0.000028457483,0.000066195105,0.0011680755,0.000094854084,0.0022517717,0.0000016799061,0.000054489825,0.0004718383,0.9954705,0.000048018115],"study_design_scores_gemma":[0.00045689437,0.00011900271,0.00002283929,0.00018385373,0.0008177904,0.0000051151806,0.009790212,0.000056428038,0.0000674024,0.0006594339,0.98692554,0.0008954684],"about_ca_topic_score_codex":0.008207403,"about_ca_topic_score_gemma":0.0004259685,"teacher_disagreement_score":0.008544958,"about_ca_system_score_codex":0.00033540427,"about_ca_system_score_gemma":0.0004891918,"threshold_uncertainty_score":0.9994116},"labels":[],"label_agreement":null},{"id":"W6929811204","doi":"10.5061/dryad.vt4m939","title":"Data from: Maintenance costs of male dominance and sexually antagonistic selection in the wild","year":2018,"lang":"en","type":"dataset","venue":"Data Archiving and Networked Services (DANS)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dominance (genetics); Offspring; Sexual selection; Population; Selection (genetic algorithm); Reproductive success; Dominance hierarchy; Natural selection","score_opus":0.020262185512206144,"score_gpt":0.28517423333801645,"score_spread":0.2649120478258103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929811204","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018567787,0.00049272814,0.0028934067,0.000034034096,0.000072683186,0.00031969356,0.97746843,0.00001938094,0.00013183324],"genre_scores_gemma":[0.081581384,0.00066119595,0.0010814776,0.00008804357,0.0008299974,0.000020306876,0.9156925,0.000022846527,0.000022252323],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973471,0.00036195834,0.0005523633,0.0010758762,0.00025298417,0.00040972256],"domain_scores_gemma":[0.99626565,0.00058768713,0.0005179821,0.0025302737,0.000033936023,0.00006449121],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094018906,0.00040652655,0.0006215253,0.00010227874,0.0002357076,0.00017998408,0.0034627554,0.00008586056,0.000054157317],"category_scores_gemma":[0.000008764785,0.0003164449,0.00003175294,0.0003602869,0.0002384933,0.000311481,0.0024881188,0.0005274717,0.0000038624103],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008936655,0.00011039784,0.012377827,0.00015888723,0.0001809251,0.00000633197,0.00018976418,0.000028610706,0.000026071952,0.000049272563,0.97877944,0.008003093],"study_design_scores_gemma":[0.0005527264,0.00010637409,0.0123119205,0.001999564,0.0006088843,0.000017392475,0.0003388155,0.25621867,0.0000034365466,0.0012238228,0.72593105,0.0006873401],"about_ca_topic_score_codex":0.01822815,"about_ca_topic_score_gemma":0.033031017,"teacher_disagreement_score":0.25619006,"about_ca_system_score_codex":0.00001602795,"about_ca_system_score_gemma":0.000047856614,"threshold_uncertainty_score":0.9999288},"labels":[],"label_agreement":null},{"id":"W6929950667","doi":"10.5040/9798765132517?locatt=label:secondary_bloomsburycollections","title":"Disruptive information in Canada","year":2025,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Disinformation; Conceptualization; Social media; Relation (database); Misinformation; Content analysis; Fake news","score_opus":0.0023121532048905285,"score_gpt":0.2178613029787615,"score_spread":0.21554914977387096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929950667","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22826946,0.0000067700666,0.093324214,0.00037968607,0.00004057311,0.000120018696,0.000005148552,0.000025145602,0.67782897],"genre_scores_gemma":[0.99921167,1.9705942e-7,0.00027288328,0.00012683313,0.0000069393564,0.000010017954,0.0000147517485,5.417387e-7,0.0003561931],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99977237,0.0000059646222,0.000096049305,0.000031166644,0.000033568158,0.000060853603],"domain_scores_gemma":[0.9998806,0.000015636339,0.00001539748,0.00006549324,0.000014824787,0.000008047962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000022210166,0.00003049402,0.00005213134,0.000043454766,0.000012974571,0.000010023646,0.000047405178,0.0000033221002,0.00031489815],"category_scores_gemma":[7.4082465e-7,0.000027675129,0.000013191754,0.00018587774,0.0000027481751,0.00008831761,0.00002390422,0.00003405639,0.000003394669],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025050192,0.000009992469,0.5755555,0.000002146657,0.000025941223,1.4183662e-7,0.000060159786,0.0004641984,0.000004148843,0.26284677,0.02767177,0.13335674],"study_design_scores_gemma":[0.00079992024,0.000012060896,0.51313585,0.00008914069,0.00003903065,6.5500124e-8,0.005346722,0.12215861,0.003837592,0.111236304,0.24284676,0.0004979426],"about_ca_topic_score_codex":0.96951145,"about_ca_topic_score_gemma":0.9163256,"teacher_disagreement_score":0.7709422,"about_ca_system_score_codex":0.000094233066,"about_ca_system_score_gemma":0.00022299551,"threshold_uncertainty_score":0.3447914},"labels":[],"label_agreement":null},{"id":"W6930151384","doi":"10.5281/zenodo.12265138","title":"inferential confusion questionnaire pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Confusion; Cognition; Construct (python library); Inference; Distrust; Scale (ratio)","score_opus":0.016567099302657484,"score_gpt":0.25538100334966146,"score_spread":0.23881390404700398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930151384","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021924174,0.00020401609,0.017548628,0.00013050411,0.00014978024,0.0003167816,0.00020304225,0.0017385429,0.9796868],"genre_scores_gemma":[0.083244346,0.00006559807,0.00028210547,0.000040492236,0.0020560967,1.3630373e-7,0.006894872,0.010882481,0.89653385],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998551,0.00018853051,0.00022649404,0.0004767159,0.00028474684,0.00027252565],"domain_scores_gemma":[0.99907017,0.000004737388,0.00014065903,0.0004934479,0.00017589849,0.00011506843],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00021702569,0.00022957893,0.00023595877,0.00040380275,0.00050723134,0.0007746731,0.00069413474,0.000097209515,0.39389586],"category_scores_gemma":[0.000022715805,0.00024037086,0.00013119722,0.00040390764,0.00010932767,0.000056550627,0.0011355059,0.00039710896,0.098344155],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004375954,0.000054085096,0.0000019430133,0.000052228825,0.00012779143,0.0000031915633,0.000069577065,0.0000018315883,0.00009038504,0.019041665,0.92255837,0.057994578],"study_design_scores_gemma":[0.00012438747,0.00004479493,0.000012719834,0.00028492042,0.000071935305,0.000004513384,0.000030031355,0.00017900448,0.000037121914,0.0023564391,0.99661946,0.0002346655],"about_ca_topic_score_codex":0.0001512709,"about_ca_topic_score_gemma":0.0000013128789,"teacher_disagreement_score":0.29555172,"about_ca_system_score_codex":0.00006286995,"about_ca_system_score_gemma":0.000004075296,"threshold_uncertainty_score":0.9802039},"labels":[],"label_agreement":null},{"id":"W6930255344","doi":"10.5281/zenodo.11866508","title":"Heinrich neuhaus die kunst des klavierspiels pdf","year":2024,"lang":"de","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Subject (documents); TSG101; Ideal (ethics); Theme (computing); Pretext","score_opus":0.026797317662063596,"score_gpt":0.2607025534135085,"score_spread":0.23390523575144492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930255344","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025403214,0.0035816892,0.016116366,0.00037559832,0.00031680966,0.00093062967,0.00061722496,0.0014959666,0.9763117],"genre_scores_gemma":[0.06644766,0.0022358913,0.0014786638,0.000171486,0.005206461,5.645096e-7,0.016669316,0.02313763,0.8846523],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99601364,0.00054585846,0.0006317193,0.001250372,0.00062172004,0.0009366796],"domain_scores_gemma":[0.9973924,0.00003466576,0.0003405835,0.0012403617,0.00059699797,0.00039499527],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00072690507,0.00063874567,0.00064779405,0.00071210414,0.0020571374,0.0027380192,0.0020451823,0.00022528482,0.3326461],"category_scores_gemma":[0.000096645505,0.00068811566,0.00041233,0.0012649783,0.0005412277,0.00018674214,0.0029077549,0.0010671329,0.5022413],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002508038,0.00024354244,0.0000033850313,0.00023008893,0.0008260499,0.000041265506,0.00066918245,0.00002813959,0.00029392468,0.007790923,0.8367626,0.1530858],"study_design_scores_gemma":[0.00027480043,0.00022544956,0.000025550278,0.0004551299,0.00037177527,0.000014679734,0.0002631191,0.00037426018,0.00008005645,0.004963773,0.992308,0.000643371],"about_ca_topic_score_codex":0.00008814099,"about_ca_topic_score_gemma":0.0000021110238,"teacher_disagreement_score":0.1695952,"about_ca_system_score_codex":0.00033708583,"about_ca_system_score_gemma":0.000012390605,"threshold_uncertainty_score":0.999557},"labels":[],"label_agreement":null},{"id":"W6930387550","doi":"10.5281/zenodo.12446012","title":"civil service exam questions and answers pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Test (biology); Government (linguistics); Download; Service (business); Phone; Civil service; Vocabulary; Questions and answers","score_opus":0.018858285140901664,"score_gpt":0.24834472896502438,"score_spread":0.22948644382412273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930387550","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000335441,0.00034414182,0.0042732265,0.00033965948,0.00005938667,0.00029006889,0.0002863507,0.0012999687,0.99307364],"genre_scores_gemma":[0.0291903,0.00018967145,0.000820826,0.00017401317,0.001333848,2.462476e-7,0.004806878,0.012599065,0.9508852],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998722,0.00015903184,0.00017828541,0.0004761889,0.00020704286,0.0002574519],"domain_scores_gemma":[0.9991371,0.000010204039,0.000099709585,0.00046236857,0.00015956901,0.0001310244],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00022682517,0.00021073234,0.00021076869,0.00035003058,0.00048401082,0.0006958076,0.00054454093,0.0000741868,0.1800546],"category_scores_gemma":[0.000016181002,0.00022701069,0.00006473885,0.00058305555,0.00009281012,0.000063614054,0.0009531365,0.0003408485,0.033893578],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002538678,0.00003740216,0.0000021495223,0.000071239265,0.00014450507,0.0000027774481,0.00014713795,0.000002602924,0.000051786734,0.009138748,0.96722555,0.023173574],"study_design_scores_gemma":[0.0000953112,0.00003229056,0.000016481436,0.00016658816,0.00008279946,0.000007053871,0.00009801353,0.00022087544,0.000008767589,0.0016781929,0.99737585,0.00021776865],"about_ca_topic_score_codex":0.00027072287,"about_ca_topic_score_gemma":0.0000077930845,"teacher_disagreement_score":0.14616102,"about_ca_system_score_codex":0.000044415025,"about_ca_system_score_gemma":0.0000032606706,"threshold_uncertainty_score":0.9668586},"labels":[],"label_agreement":null},{"id":"W6930603849","doi":"10.5281/zenodo.11777486","title":"canada labour code part 2 pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Enforcement; Industrial relations; Obligation; Collective bargaining; Labour law; Labor relations; Work (physics); Trade union","score_opus":0.017550738402700754,"score_gpt":0.2354613239752071,"score_spread":0.21791058557250637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930603849","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013057104,0.00019621417,0.0014199634,0.00031862233,0.0001407752,0.0002569343,0.0017625779,0.000869308,0.99502254],"genre_scores_gemma":[0.0074040913,0.00003343856,0.00013546471,0.00010672646,0.0012616939,8.1571265e-8,0.004276046,0.0077737807,0.9790087],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847364,0.0001491662,0.00021913885,0.00047239175,0.00034212277,0.00034352439],"domain_scores_gemma":[0.99900216,0.000008231049,0.00013150764,0.0005617978,0.0001517508,0.00014455614],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020171537,0.00022489826,0.00024482852,0.00020719289,0.0004363095,0.0005448432,0.0008724145,0.000059591228,0.45828864],"category_scores_gemma":[0.0000199068,0.0002396042,0.000084291445,0.00045916348,0.00006592232,0.00003535769,0.0008970452,0.000374591,0.038604278],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024078797,0.000026637552,0.0000013335881,0.000046351084,0.00017217753,0.000008662928,0.000023803057,0.000003452237,0.000013026705,0.01348874,0.9708777,0.01533572],"study_design_scores_gemma":[0.00008310883,0.000020561562,0.000005308781,0.000107052794,0.000046445064,0.00000384789,0.000043283962,0.000062201536,0.000025180292,0.00071580365,0.99865055,0.00023666657],"about_ca_topic_score_codex":0.067233086,"about_ca_topic_score_gemma":0.0027059505,"teacher_disagreement_score":0.41968438,"about_ca_system_score_codex":0.00014024964,"about_ca_system_score_gemma":0.000020764373,"threshold_uncertainty_score":0.9770776},"labels":[],"label_agreement":null},{"id":"W6930863647","doi":"10.5281/zenodo.15557913","title":"Replication package for: What Do Policies Value?","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Codebase; Replicate; Replication (statistics); Monte Carlo method; Confidentiality; Power (physics)","score_opus":0.023333860162575642,"score_gpt":0.2828563216959003,"score_spread":0.25952246153332464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930863647","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015222481,0.0004410887,0.080240205,0.0005107067,0.00007803062,0.0008693212,0.00070573285,0.0013745368,0.91576517],"genre_scores_gemma":[0.027578173,0.0014986107,0.0038623626,0.0003963206,0.0030533762,0.0000019211088,0.035145268,0.017704058,0.9107599],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983698,0.00017922552,0.00026297726,0.00062945456,0.00023182303,0.00032668014],"domain_scores_gemma":[0.99791634,0.00002940992,0.0002465365,0.001404506,0.00031429803,0.00008892291],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039813397,0.00023206293,0.00027848087,0.00042608337,0.0008603464,0.0013295348,0.0011352266,0.00009456525,0.029553521],"category_scores_gemma":[0.00008671893,0.00025285556,0.0001634977,0.00049406086,0.00009769469,0.00014313606,0.0008738369,0.00021880027,0.0015425681],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006432499,0.000048989783,0.0000020867678,0.000036157366,0.00011685084,1.871287e-7,0.00008410005,0.0000028995437,0.00010652232,0.07144388,0.75381845,0.17433342],"study_design_scores_gemma":[0.00018318268,0.000045225348,0.000014622525,0.00019677835,0.00006650694,0.0000010348338,0.00018061932,0.00009900373,0.00024203648,0.004489699,0.99425715,0.00022416817],"about_ca_topic_score_codex":0.000118350275,"about_ca_topic_score_gemma":5.3362896e-7,"teacher_disagreement_score":0.24043866,"about_ca_system_score_codex":0.00008824815,"about_ca_system_score_gemma":0.0000066879475,"threshold_uncertainty_score":0.9999924},"labels":[],"label_agreement":null},{"id":"W6930941814","doi":"10.5281/zenodo.15801417","title":"Parapterogramma , Papp 2008","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Bristle; Dorsum; Genus; Seta; Lobe; Wing","score_opus":0.019639987402536214,"score_gpt":0.26065078402040126,"score_spread":0.24101079661786504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930941814","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015934495,0.00014162554,0.13750228,0.0009905952,0.00008252646,0.0004931077,0.00009043373,0.001594511,0.8431704],"genre_scores_gemma":[0.9953081,0.000010202535,0.00058981986,0.00008881423,0.00013757219,6.987095e-8,0.00090724794,0.00040943484,0.002548733],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989323,0.00014802192,0.0001970648,0.000290453,0.0001568184,0.00027533117],"domain_scores_gemma":[0.9991668,0.00001577315,0.00006227372,0.00042730215,0.0002507371,0.00007715449],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027817348,0.00011308904,0.00013512326,0.00018671135,0.0012603159,0.00050072354,0.00068850775,0.000025716843,0.017232459],"category_scores_gemma":[0.000026123951,0.00012078681,0.00008521747,0.0006667366,0.00009182031,0.000103798644,0.0006832609,0.00017781642,0.0021685502],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014722822,0.00011670216,0.000112237176,0.000009601781,0.00010425153,0.0000015601101,0.00011272247,0.00002880867,0.0005606332,0.06901202,0.49078736,0.4391394],"study_design_scores_gemma":[0.00019180725,0.00003623299,0.00054509647,0.000017705746,0.00002120125,0.0000017235567,0.00010048126,0.00054921827,0.00045070474,0.004583687,0.9933915,0.00011060341],"about_ca_topic_score_codex":0.00004025141,"about_ca_topic_score_gemma":2.20252e-7,"teacher_disagreement_score":0.97937363,"about_ca_system_score_codex":0.000042019794,"about_ca_system_score_gemma":0.000002334169,"threshold_uncertainty_score":0.99860835},"labels":[],"label_agreement":null},{"id":"W6931004961","doi":"10.5281/zenodo.4126238","title":"Falling (2020) Pelicula Completa Latino Mega *HD*720p En Español Gratis hci","year":2020,"lang":"es","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Falling (accident); Volunteer work; Work (physics); Subject (documents)","score_opus":0.03097401379548307,"score_gpt":0.25629677198099315,"score_spread":0.2253227581855101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931004961","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1853223,0.0015569713,0.35529616,0.035035737,0.00045823146,0.0059789657,0.0045085624,0.009478073,0.402365],"genre_scores_gemma":[0.99000406,0.00017398459,0.0017749339,0.0003311939,0.0014160259,1.4263986e-7,0.0039925915,0.0018748301,0.00043224735],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99606097,0.0009266115,0.0006934186,0.0009401457,0.00067273027,0.0007060991],"domain_scores_gemma":[0.9976699,0.00008780829,0.00034952533,0.0007462987,0.0006685838,0.00047793065],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006113528,0.0004363418,0.0005631027,0.00017862706,0.0024080176,0.0023031447,0.0018180409,0.00010850313,0.03099148],"category_scores_gemma":[0.00020551642,0.00048897316,0.0002925104,0.0012667979,0.00020017516,0.0003214513,0.002573217,0.0007687442,0.009791906],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015292567,0.00049447204,0.00041462953,0.0003005979,0.00095515104,0.00006087602,0.005287831,0.0016900148,0.0139176985,0.06639059,0.6213709,0.2889643],"study_design_scores_gemma":[0.0005203068,0.00029336356,0.0010529489,0.00009171659,0.00015027923,0.000012925196,0.00047991145,0.025178717,0.0005052378,0.0005110626,0.9706881,0.0005154129],"about_ca_topic_score_codex":0.00008147284,"about_ca_topic_score_gemma":6.0556386e-7,"teacher_disagreement_score":0.8046818,"about_ca_system_score_codex":0.00014282511,"about_ca_system_score_gemma":0.000011214858,"threshold_uncertainty_score":0.9997562},"labels":[],"label_agreement":null},{"id":"W6931056175","doi":"10.5281/zenodo.16784948","title":"Los nueve libros de la historia","year":2025,"lang":"es","type":"book","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"WSP (Canada)","funders":"","keywords":"Population; Human being; Context (archaeology)","score_opus":0.015091139777984144,"score_gpt":0.25860471173469185,"score_spread":0.2435135719567077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931056175","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019501864,0.0002930985,0.019845033,0.0002158824,0.00015201453,0.000693035,0.0010388017,0.0011486235,0.9764185],"genre_scores_gemma":[0.18211217,0.0010193099,0.0031158584,0.00036992106,0.0061556664,7.6203327e-7,0.03721813,0.011216804,0.7587914],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99625486,0.0011716504,0.0005642443,0.0008523656,0.0004958605,0.0006610422],"domain_scores_gemma":[0.99738175,0.00016091984,0.00038959816,0.0010997007,0.00069659273,0.0002714613],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010206425,0.00047899762,0.000561645,0.00055282924,0.0025609687,0.0019134891,0.0021954614,0.00028273265,0.028301839],"category_scores_gemma":[0.00019067143,0.00057481567,0.00035163495,0.0006739982,0.00042149817,0.00019285017,0.0027270068,0.001169597,0.0051173135],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004708176,0.00019879127,0.000006923288,0.00015708253,0.0003413145,0.000012533198,0.00030585402,0.000035234636,0.00041733487,0.12531221,0.78986955,0.08329609],"study_design_scores_gemma":[0.00037373338,0.00012714404,0.00009531813,0.00036594423,0.0002207912,0.000012760401,0.000053858992,0.0004962978,0.00011569661,0.0073281126,0.99034226,0.00046809315],"about_ca_topic_score_codex":0.00005557411,"about_ca_topic_score_gemma":1.7672593e-7,"teacher_disagreement_score":0.21762711,"about_ca_system_score_codex":0.0010615592,"about_ca_system_score_gemma":0.00006665752,"threshold_uncertainty_score":0.9996703},"labels":[],"label_agreement":null},{"id":"W6931079386","doi":"10.5281/zenodo.3867241","title":"Cylindroiulus cantonii","year":2017,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Research (Canada)","funders":"","keywords":"Distribution (mathematics); Spring (device); Natural (archaeology); Habitat","score_opus":0.03373214404479671,"score_gpt":0.27647337811016565,"score_spread":0.24274123406536893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931079386","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018112505,0.000019707672,0.016211638,0.0006125817,0.00006029352,0.00022903633,0.00009854737,0.0005658441,0.9640899],"genre_scores_gemma":[0.99733096,0.0000059430968,0.00033642547,0.000026461477,0.00030404673,2.7695902e-8,0.00046766287,0.0005893478,0.00093912083],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989564,0.00009789456,0.0001651842,0.00029153502,0.00020375726,0.00028526512],"domain_scores_gemma":[0.9985574,0.000009026882,0.00015290028,0.0008902204,0.00027088026,0.0001196077],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00035083274,0.00011009019,0.00013508328,0.00009159791,0.0044123284,0.0013606207,0.0014072735,0.00002430689,0.021459904],"category_scores_gemma":[0.00006968359,0.000116886295,0.00007632092,0.00011712783,0.00014433032,0.00022363276,0.0012920762,0.00018594824,0.0032832639],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018860317,0.00012414821,0.00022369814,0.000009127725,0.00010589939,0.000006632504,0.0003033838,0.000027241986,0.0009570585,0.03611048,0.11768252,0.844431],"study_design_scores_gemma":[0.00026544125,0.000053974898,0.0050322586,0.000016175461,0.000021969938,0.0000076004344,0.00008340735,0.0011434283,0.0008676202,0.0032341583,0.9890949,0.00017904556],"about_ca_topic_score_codex":0.00017949469,"about_ca_topic_score_gemma":7.898578e-7,"teacher_disagreement_score":0.9792185,"about_ca_system_score_codex":0.000048814814,"about_ca_system_score_gemma":0.0000024856067,"threshold_uncertainty_score":0.99967605},"labels":[],"label_agreement":null},{"id":"W6931080539","doi":"10.5281/zenodo.15092100","title":"Figure 9 in Ageing Effects in Mounting Media of Microscope Slide Samples from Natural History Collections: A Case Study with Canada Balsam and PermountTM","year":2021,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Balsam; Ageing; Microscope; Natural history; Optical microscope; Natural (archaeology); Spectral line","score_opus":0.01472886775815131,"score_gpt":0.224443083785708,"score_spread":0.2097142160275567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931080539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7911531,0.0063471114,0.00085426396,0.00005571698,0.00023539641,0.0027876638,0.000784255,0.00041394494,0.19736858],"genre_scores_gemma":[0.98753065,0.00002019359,0.0005783018,0.000015300633,0.000136806,4.4697876e-7,0.0015374257,0.0015791367,0.008601755],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854124,0.000375122,0.00024890478,0.00040664067,0.00021668928,0.0002113978],"domain_scores_gemma":[0.9992701,0.000086982756,0.00018038596,0.00028244226,0.00012513861,0.000054950044],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019321166,0.00018720148,0.00035975676,0.00039186934,0.00027929826,0.00014285113,0.0002668517,0.000041012812,0.00893011],"category_scores_gemma":[0.00008394718,0.00019671547,0.000026959096,0.0006328197,0.00006921854,0.00004398887,0.00041354052,0.00036327023,0.0000052722958],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088163346,0.0006617145,0.006032074,0.0003825305,0.000691527,0.002332616,0.0059772204,0.000077726785,0.002378009,0.00027303744,0.9580325,0.023072867],"study_design_scores_gemma":[0.0014334588,0.0001361663,0.0055591976,0.0010530938,0.000111286136,0.000062895844,0.0070066787,0.0005069188,0.00009419907,0.000042795116,0.9834635,0.0005297867],"about_ca_topic_score_codex":0.6182381,"about_ca_topic_score_gemma":0.20709112,"teacher_disagreement_score":0.41114694,"about_ca_system_score_codex":0.00041625983,"about_ca_system_score_gemma":0.000040130846,"threshold_uncertainty_score":0.99197584},"labels":[],"label_agreement":null},{"id":"W6931364781","doi":"10.5281/zenodo.6112700","title":"Parapiophila kugluktuk Rochefort & Wheeler, sp. n.","year":2015,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Malaise; Summit; Compendium; Field (mathematics); Obituary; Holotype","score_opus":0.04643885870204331,"score_gpt":0.2647623696245026,"score_spread":0.2183235109224593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931364781","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06631646,0.00016904077,0.056603048,0.0009703779,0.00013603667,0.00065983605,0.0001405299,0.0021618942,0.8728428],"genre_scores_gemma":[0.9954022,0.000008689104,0.00065057736,0.00006446162,0.00044014832,7.1881935e-8,0.0013089702,0.0007934486,0.0013313977],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985015,0.00018168919,0.00024853722,0.00036054713,0.00034811857,0.00035961898],"domain_scores_gemma":[0.9986016,0.000011220214,0.00010828761,0.00052265613,0.000497368,0.000258823],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005681662,0.00015619851,0.0001816035,0.00016253386,0.000895025,0.00050953997,0.00084114773,0.00003586097,0.012347652],"category_scores_gemma":[0.000052926152,0.00016276707,0.00009269553,0.0005548049,0.0000999556,0.00021020406,0.00085794606,0.00024240348,0.005654423],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045845205,0.00025646086,0.00021445313,0.000011801203,0.00014360926,0.000006703932,0.00081955275,0.00018463946,0.0010124337,0.03919547,0.8062891,0.15181996],"study_design_scores_gemma":[0.00033448587,0.00010835231,0.0003374054,0.000012192109,0.000022900542,0.0000099453355,0.00027588347,0.00092010555,0.0005088961,0.005040731,0.9922341,0.00019498858],"about_ca_topic_score_codex":0.00005395457,"about_ca_topic_score_gemma":2.32848e-7,"teacher_disagreement_score":0.9290858,"about_ca_system_score_codex":0.000085558015,"about_ca_system_score_gemma":0.0000054947527,"threshold_uncertainty_score":0.9951198},"labels":[],"label_agreement":null},{"id":"W6931492696","doi":"10.5281/zenodo.5324180","title":"Spirodiscus groenlandicus McIntosh 1877, comb. nov.","year":2015,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cruise; Tube (container); Diffraction; Sample (material)","score_opus":0.04513080021987928,"score_gpt":0.26333585669348175,"score_spread":0.21820505647360247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931492696","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060718324,0.000101381665,0.06379927,0.0012521823,0.00016040305,0.00067171233,0.00021934637,0.0020803297,0.8709971],"genre_scores_gemma":[0.99568886,0.000004580601,0.0005337944,0.00006233265,0.00039448313,6.162473e-8,0.0013321313,0.0007204974,0.0012632495],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984538,0.00022725636,0.00025131612,0.00035949337,0.00034615456,0.0003620071],"domain_scores_gemma":[0.9986442,0.000013707531,0.000112655194,0.00052639627,0.00043953193,0.00026353696],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005432842,0.00015862187,0.00019416807,0.00017467498,0.0009533813,0.0005488546,0.0008406282,0.00003199478,0.0125465775],"category_scores_gemma":[0.000063237,0.00015407197,0.00008777594,0.00053506764,0.000118047574,0.0001828506,0.000970608,0.00024295009,0.0060517257],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004602109,0.00027210766,0.00031098435,0.000012098842,0.000119116914,0.000008629466,0.0008520179,0.000116890995,0.00064747775,0.035588678,0.81041336,0.15161261],"study_design_scores_gemma":[0.00049971975,0.00013920873,0.0004169892,0.00001412068,0.000027922746,0.000012120338,0.00033268068,0.00086579553,0.00037317022,0.0039521256,0.9931651,0.00020105937],"about_ca_topic_score_codex":0.00009167583,"about_ca_topic_score_gemma":4.982849e-7,"teacher_disagreement_score":0.93497056,"about_ca_system_score_codex":0.00009161436,"about_ca_system_score_gemma":0.000004610352,"threshold_uncertainty_score":0.9947222},"labels":[],"label_agreement":null},{"id":"W6931517417","doi":"10.5281/zenodo.7807190","title":"JuliaGPU/GPUCompiler.jl: v0.16.5","year":2022,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Field (mathematics); Callback; Set (abstract data type); Relation (database); Term (time)","score_opus":0.022960922371894725,"score_gpt":0.24942296594546887,"score_spread":0.22646204357357413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931517417","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025885818,0.00014418869,0.0063331686,0.00018376485,0.000098344484,0.00048484185,0.0006919832,0.002130416,0.9899074],"genre_scores_gemma":[0.030781088,0.00009193347,0.0008466366,0.00019424534,0.0021689802,5.4518443e-7,0.028418543,0.02286731,0.9146307],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99772877,0.00039139978,0.00029957856,0.0006438561,0.00048659416,0.00044982333],"domain_scores_gemma":[0.99843645,0.000017824752,0.00028365955,0.00093918724,0.0001589265,0.00016395748],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00038085488,0.00030634983,0.00035579118,0.00047803205,0.0014632915,0.0005414224,0.0016650595,0.00007600383,0.72014046],"category_scores_gemma":[0.000028956203,0.00034876674,0.00019199922,0.0007134795,0.00012654488,0.00007010497,0.0024556299,0.0005987668,0.01164375],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079346955,0.000115145405,0.000009986092,0.000021015832,0.00017278668,0.0000037127206,0.00007197659,0.00000848679,0.00002613389,0.010310421,0.92127675,0.067975655],"study_design_scores_gemma":[0.00023227214,0.000075869655,0.000021363332,0.000031703916,0.000055211247,0.0000065027516,0.00011882237,0.00008644231,0.000018854424,0.0009042281,0.9981045,0.00034422314],"about_ca_topic_score_codex":0.0001796662,"about_ca_topic_score_gemma":0.000001113703,"teacher_disagreement_score":0.70849675,"about_ca_system_score_codex":0.00019715798,"about_ca_system_score_gemma":0.000005151081,"threshold_uncertainty_score":0.9998964},"labels":[],"label_agreement":null},{"id":"W6931637172","doi":"10.5281/zenodo.8265006","title":"Sulphonamides Unveiled: A Comprehensive Review of Mechanisms, Applications, and Therapeutic Insights","year":2023,"lang":"en","type":"peer-review","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kane Biotech (Canada)","funders":"","keywords":"Sulfonamide; Drug; Folic Acid Antagonists; Folic acid; Antimicrobial","score_opus":0.04663514144312723,"score_gpt":0.3015954406442475,"score_spread":0.25496029920112023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931637172","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004734855,0.7401263,0.079084225,0.020888295,0.00042410113,0.012683109,0.0064898995,0.0037359302,0.13652076],"genre_scores_gemma":[0.0068381135,0.803207,0.0032551428,0.0061113643,0.0015415037,0.000014049831,0.12643194,0.009647285,0.04295361],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99762446,0.0004372432,0.00059021177,0.00056617684,0.00051464693,0.00026725838],"domain_scores_gemma":[0.99718016,0.000078036275,0.0004851052,0.00080613187,0.0013331604,0.00011738141],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00051533134,0.0002961938,0.0007091971,0.00026002858,0.00084465486,0.00016993932,0.0010655823,0.000068813904,0.009016634],"category_scores_gemma":[0.00004844164,0.0002916123,0.00018356922,0.0009869111,0.00016509311,0.000057151276,0.001388525,0.00040068722,0.0011386839],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033522224,0.00006114044,1.756083e-7,0.008712297,0.00023329002,9.85432e-7,0.000041364656,0.0000013012224,0.000087663946,0.017067935,0.8255379,0.14825255],"study_design_scores_gemma":[0.000107421554,0.000062136955,0.000011564919,0.0067956666,0.00025209223,0.0000054485513,0.00004087066,0.000049881673,0.00003753545,0.00786525,0.9845261,0.00024603104],"about_ca_topic_score_codex":0.000057200323,"about_ca_topic_score_gemma":3.7973794e-7,"teacher_disagreement_score":0.15898815,"about_ca_system_score_codex":0.000060802693,"about_ca_system_score_gemma":0.000010985447,"threshold_uncertainty_score":0.9999536},"labels":[],"label_agreement":null},{"id":"W6931743836","doi":"10.5683/sp3/2stdfa","title":"Kowkash Ontario. 1:50,000. Map Sheet 042L03, ed. 2, 1981","year":2021,"lang":"en","type":"dataset","venue":"Borealis","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Georeference; General partnership; Raster graphics; Natural (archaeology); Digital mapping; Aerial photography; Geographic information system; Orthophoto","score_opus":0.011387890652500114,"score_gpt":0.25361540528077886,"score_spread":0.24222751462827874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931743836","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012843425,0.00031176876,0.00033203917,0.00012346412,0.00020573576,0.00027226176,0.99142325,0.00010829551,0.007210347],"genre_scores_gemma":[0.000056795747,0.00006441711,0.00085006293,0.00022900815,0.002113299,0.00015151237,0.99465585,0.0000582997,0.0018207699],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99722075,0.0001340325,0.00065605814,0.0008599879,0.0004994906,0.00062967994],"domain_scores_gemma":[0.99701107,0.000089952606,0.00040016434,0.0021149756,0.00016598102,0.000217857],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002288751,0.0006598456,0.00099972,0.00019286701,0.00018575987,0.00028921434,0.0009920405,0.00026463135,0.013429805],"category_scores_gemma":[0.0000065965723,0.000675761,0.0006591403,0.00023547352,0.00008041837,0.00010304518,0.0005816747,0.0008816413,0.00010695463],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072419734,0.00018031755,0.00063808856,0.000030839852,0.00046458052,0.000029210352,0.000023187262,0.000008254801,0.0000011748374,0.00043390246,0.9965051,0.0016781287],"study_design_scores_gemma":[0.00018029018,0.000028488672,0.0004778238,0.00013931181,0.0004926822,0.000001811762,0.000025523028,0.000011094722,0.000019241426,0.0017646018,0.9961618,0.0006973269],"about_ca_topic_score_codex":0.8085233,"about_ca_topic_score_gemma":0.4995812,"teacher_disagreement_score":0.3089421,"about_ca_system_score_codex":0.00022333807,"about_ca_system_score_gemma":0.00040314355,"threshold_uncertainty_score":0.99956936},"labels":[],"label_agreement":null},{"id":"W6931768921","doi":"10.5683/sp3/hkzzv4","title":"Travel Survey of Residents of Canada, 2015: Person File, October","year":2015,"lang":"en","type":"dataset","venue":"Borealis","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"TRIPS architecture; Tourism; Travel survey; Accommodation; Travel behavior; Survey data collection; Domestic tourism; Destinations; Survey methodology","score_opus":0.03009992257830009,"score_gpt":0.28213137112656056,"score_spread":0.2520314485482605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931768921","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033524593,0.00011091913,0.000021769341,0.0000141780665,0.00003939456,0.0001369457,0.9974691,0.0000052788873,0.0021688617],"genre_scores_gemma":[0.0013042549,0.0000081835715,0.000066560686,0.0000111069885,0.00013853401,0.0000172443,0.9979825,0.000020331436,0.0004512917],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9982519,0.00017735736,0.00047775186,0.00027631086,0.0005639859,0.00025265457],"domain_scores_gemma":[0.99770933,0.00015518807,0.0006376525,0.00087595626,0.0005003105,0.00012154806],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041561548,0.00026571003,0.00076640805,0.00012102424,0.00003612871,0.000012243905,0.0005741849,0.00010323052,0.0027086078],"category_scores_gemma":[0.000047304606,0.0002580187,0.00014275115,0.0002341198,0.000068651876,0.000031975334,0.000099851255,0.00020663156,0.0000010408745],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015351483,0.00005482918,0.0014439778,0.000027292279,0.00021715194,0.0000016017437,0.000011333608,0.000003978874,9.533407e-7,0.000014130784,0.9979875,0.00022188443],"study_design_scores_gemma":[0.0002039113,0.000043344087,0.5809425,0.00014033694,0.0002254393,2.9322464e-7,0.000059408754,0.00003208264,0.000101056365,0.00014457697,0.41774815,0.00035888737],"about_ca_topic_score_codex":0.9997464,"about_ca_topic_score_gemma":0.9914075,"teacher_disagreement_score":0.58023936,"about_ca_system_score_codex":0.00007694462,"about_ca_system_score_gemma":0.001033069,"threshold_uncertainty_score":0.9999872},"labels":[],"label_agreement":null},{"id":"W6931769822","doi":"10.5281/zenodo.6835767","title":"Data and Code for: Interlimb coordination in Parkinson's Disease is affected by a visuospatial dual task","year":2022,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Task (project management); Raw data; Code (set theory); Installation; Dual (grammatical number); Data collection; Task analysis; Data modeling; Synthetic data","score_opus":0.022595324776871026,"score_gpt":0.2695100027564201,"score_spread":0.24691467797954908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931769822","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004013268,0.0016981991,0.14404774,0.00457684,0.00033156373,0.008146703,0.2687951,0.0043750633,0.5640155],"genre_scores_gemma":[0.539363,0.00016490048,0.00092099106,0.0003089534,0.0011229735,0.000003618595,0.32787555,0.013230733,0.11700926],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983219,0.00028779285,0.00021817128,0.00065825385,0.0002513012,0.00026261364],"domain_scores_gemma":[0.9988825,0.000025069794,0.00019609446,0.0006842789,0.000087315944,0.0001247509],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036398834,0.00020469037,0.0002408861,0.0003150623,0.0005191061,0.00038686872,0.0009049949,0.000046138357,0.045805924],"category_scores_gemma":[0.0000659546,0.00023920208,0.000049347633,0.00037311984,0.000084240855,0.00010604836,0.0022671823,0.00026042355,0.00014190578],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040052848,0.00015718269,0.00004576036,0.000038443814,0.0000860191,0.0000021139576,0.00011054646,0.0000016458443,0.00007558385,0.00055142527,0.9524553,0.04643595],"study_design_scores_gemma":[0.00048730397,0.00008769319,0.000097517186,0.00004160172,0.000055914006,0.0000010502026,0.00007065947,0.005362093,0.0000065890035,0.0001984527,0.993362,0.00022911256],"about_ca_topic_score_codex":0.00008808632,"about_ca_topic_score_gemma":0.000010297246,"teacher_disagreement_score":0.5353498,"about_ca_system_score_codex":0.00009070862,"about_ca_system_score_gemma":0.00000582813,"threshold_uncertainty_score":0.97543776},"labels":[],"label_agreement":null},{"id":"W6931967088","doi":"10.5683/sp3/wuipaw","title":"General Social Survey - Personal Risk and Victimization - Variable Concordance and Guide","year":2016,"lang":"en","type":"dataset","venue":"Borealis","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Respondent; Concordance; The Internet; Poison control; Injury prevention; Human factors and ergonomics; General Social Survey","score_opus":0.011410899312933803,"score_gpt":0.2679096166309814,"score_spread":0.2564987173180476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931967088","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000081573395,0.00008277115,0.010312279,0.000023153321,0.00002791619,0.00011773289,0.98842514,0.00002529446,0.0009041729],"genre_scores_gemma":[0.0002113729,0.00020911623,0.0009067801,0.00004334949,0.0010953259,0.00002901505,0.9972764,0.000019094468,0.0002095094],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988041,0.00021734445,0.00024941587,0.00037043396,0.00014839997,0.00021030751],"domain_scores_gemma":[0.9992059,0.00012058984,0.0002847732,0.00021619066,0.00010579385,0.00006676278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037707065,0.00023867303,0.00037266032,0.00006410539,0.00024111547,0.000105171304,0.00013804581,0.00010770977,0.0002912747],"category_scores_gemma":[0.000017534292,0.00020955589,0.000055787797,0.00010000586,0.00010258046,0.00007689301,0.00014147788,0.00016538484,9.784699e-7],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010330686,0.000015097585,0.0059747105,0.0000064886426,0.00012204894,4.438697e-7,0.000012440915,6.696415e-7,0.0000014368552,0.00036366662,0.98732466,0.006168034],"study_design_scores_gemma":[0.00021960707,0.000016011105,0.009806987,0.00002173118,0.00016291029,5.68403e-7,0.0000050660606,0.00041173142,0.0000022213271,0.00090616837,0.9881902,0.0002568062],"about_ca_topic_score_codex":0.24638206,"about_ca_topic_score_gemma":0.008457772,"teacher_disagreement_score":0.23792428,"about_ca_system_score_codex":0.000040686497,"about_ca_system_score_gemma":0.00007225152,"threshold_uncertainty_score":0.8545441},"labels":[],"label_agreement":null},{"id":"W6958269875","doi":"10.6084/m9.figshare.26600695","title":"Additional file 2 of Maternal glycemia in pregnancy is longitudinally associated with blood DNAm variation at the FSD1L gene from birth to 5 years of age","year":2024,"lang":"en","type":"article","venue":"Figshare","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre de Santé et de Services Sociaux de Chicoutimi; Centre Hospitalier Universitaire de Sherbrooke; Université de Sherbrooke","funders":"","keywords":"dNaM; Cord blood; Pregnancy; Gene; Birth weight","score_opus":0.012665095211133827,"score_gpt":0.2237251182699919,"score_spread":0.21106002305885807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958269875","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043202437,0.000037961163,0.000011279822,0.000007156728,0.0000045288084,0.00013007378,0.9560302,0.000023611137,0.00055274955],"genre_scores_gemma":[0.4899258,1.825633e-7,0.0002877435,0.0000071006134,0.000052910083,0.00026294676,0.50893605,0.000011527316,0.00051575695],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9993204,0.00002401599,0.00018320439,0.00017722821,0.00018762005,0.000107563144],"domain_scores_gemma":[0.9992127,0.00041632212,0.0001219897,0.00016461308,0.00006200257,0.0000223677],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000013815862,0.0000902298,0.00015349372,0.000060204693,0.000020257745,0.000028674642,0.00015080588,0.000028471717,0.9472388],"category_scores_gemma":[0.00004155311,0.000072551564,0.0000792615,0.0003534009,0.0000058550686,0.000049459028,0.00010214064,0.00008168284,0.00014714798],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000135945975,0.000060726343,0.0011085115,0.000017714605,0.00029470783,0.000014807117,0.00015931515,0.000067237175,0.00010701923,0.000019789506,0.99613464,0.0020019556],"study_design_scores_gemma":[0.00045242865,0.00015144667,0.89952934,0.017816365,0.00012235968,0.0000010006222,0.000014397065,0.001868567,0.0031401392,0.0016155224,0.07495109,0.0003373268],"about_ca_topic_score_codex":0.00010208234,"about_ca_topic_score_gemma":0.00013013295,"teacher_disagreement_score":0.94709164,"about_ca_system_score_codex":0.000031345608,"about_ca_system_score_gemma":0.00005129738,"threshold_uncertainty_score":0.29585668},"labels":[],"label_agreement":null},{"id":"W6980127727","doi":"","title":"Avis en réponse à la saisine HCB - dossier 2017-143. Paris, le 15 mai 2018","year":2018,"lang":"fr","type":"other","venue":"Prodinra (INRA Bordeaux-Aquitaine)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Food Safety Authority; Bayer CropScience; Ministère de l'Agriculture et de l'Alimentation; Ministry of Agriculture - Saskatchewan","keywords":"MEDLINE; Public health; Context (archaeology); Hexachlorobenzene; Perspective (graphical)","score_opus":0.010158397763681487,"score_gpt":0.26538317997104105,"score_spread":0.25522478220735956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6980127727","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034541734,0.014191386,0.06756755,0.013033254,0.002380854,0.005537056,0.0010308726,0.0016692784,0.8911356],"genre_scores_gemma":[0.064788364,0.0017754568,0.02325915,0.0005913217,0.016488135,0.0010116588,0.0019182584,0.0016603041,0.88850737],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98922193,0.001603306,0.002158775,0.003022542,0.0012056638,0.0027877998],"domain_scores_gemma":[0.9921978,0.0006853228,0.0017546063,0.0037659085,0.0007270545,0.0008692793],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0024026833,0.0026097968,0.0029358333,0.0009910349,0.0009627328,0.0009727476,0.0025955087,0.0014350449,0.055479605],"category_scores_gemma":[0.00017925132,0.0026722483,0.0015246714,0.0018019483,0.0015897707,0.000571344,0.0018338824,0.0018637482,0.011663985],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025407673,0.0016655124,0.00641867,0.0003375509,0.0021224944,0.000093568146,0.0007666723,0.00005101751,0.00052529306,0.049115203,0.8911098,0.04754011],"study_design_scores_gemma":[0.0016364895,0.00048087377,0.0019981468,0.0010097077,0.0013132564,0.000035802965,0.00020052807,0.002652924,0.00054815446,0.010220653,0.97716016,0.002743291],"about_ca_topic_score_codex":0.0041846284,"about_ca_topic_score_gemma":0.0006670669,"teacher_disagreement_score":0.08605034,"about_ca_system_score_codex":0.00068156025,"about_ca_system_score_gemma":0.001588352,"threshold_uncertainty_score":0.9998613},"labels":[],"label_agreement":null},{"id":"W6980835850","doi":"","title":"Cuneyt Akcora – Assistant Professor, University of Manitoba","year":2021,"lang":"en","type":"article","venue":"Open PRAIRIE (South Dakota State University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scholarship; State (computer science); Graph; Information science","score_opus":0.02050323759150536,"score_gpt":0.23469556701736344,"score_spread":0.21419232942585809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6980835850","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5016369,0.000049406128,0.081395246,0.0011564438,0.00019626785,0.0010837576,0.0010566327,0.00019932546,0.413226],"genre_scores_gemma":[0.93740565,0.0000110802475,0.0054162247,0.00002243751,0.000034202807,3.1412995e-7,0.00020582219,0.000023554498,0.05688069],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985,0.00025188763,0.00019838593,0.000506579,0.0002130879,0.00033009224],"domain_scores_gemma":[0.9984332,0.00006128143,0.00032624553,0.0006792623,0.0003537537,0.00014629838],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018233381,0.00021348117,0.00043320263,0.0001621752,0.00032619864,0.0000918009,0.0010011698,0.000048582664,0.0014030337],"category_scores_gemma":[0.0000054514835,0.0002657827,0.00019917202,0.0010376758,0.00015565951,0.00048437458,0.0014163315,0.00023618931,0.00006156054],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012807568,0.002143572,0.5805428,0.00015580883,0.0034891244,0.0018883635,0.005770159,0.00046523893,0.002646129,0.26894584,0.08421126,0.04846092],"study_design_scores_gemma":[0.00239212,0.000114144095,0.015636235,0.00016473369,0.0005210804,0.0000019921545,0.035170354,0.0005381479,0.0025437921,0.00447203,0.9376033,0.0008420962],"about_ca_topic_score_codex":0.0018672145,"about_ca_topic_score_gemma":0.0031837085,"teacher_disagreement_score":0.853392,"about_ca_system_score_codex":0.00010346488,"about_ca_system_score_gemma":0.00038752027,"threshold_uncertainty_score":0.99997944},"labels":[],"label_agreement":null},{"id":"W6986327862","doi":"","title":"Perspectives in aquaculture development in Southeast Asia and Japan: Proceedings of the Seminar on Aquaculture Development in Southeast Asia, Iloilo City, Philippines, 8-12 September 1987","year":2013,"lang":"en","type":"book","venue":"SEAFDEC/AQD Repository (Southeast Asian Fisheries Development Center)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"International Development Research Centre","keywords":"Southeast asia; Aquaculture; Human settlement; China; Government (linguistics)","score_opus":0.010922462192945062,"score_gpt":0.2086736425332614,"score_spread":0.19775118034031633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986327862","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3006654,0.00057879963,0.000024760619,0.00061513105,0.00046208475,0.004767435,0.00013681478,0.0002479228,0.69250166],"genre_scores_gemma":[0.8367156,0.000013785701,0.0033030512,0.00002456392,0.00045373847,0.00093786296,0.00050452375,0.00030845465,0.15773845],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99127793,0.00022887012,0.003019563,0.002318327,0.0016093823,0.0015459523],"domain_scores_gemma":[0.99657625,0.000060345483,0.0016207319,0.0008262922,0.000508649,0.000407757],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0007709387,0.0021159053,0.0023036487,0.0010279911,0.000590616,0.00047951998,0.0015560663,0.0008516677,0.0003412386],"category_scores_gemma":[0.000023521545,0.0017379571,0.00047803702,0.0009469913,0.00060630165,0.00047413088,0.0012169488,0.00226086,0.000052901505],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068419625,0.0030007556,0.79571694,0.0012272729,0.001807908,0.000059549177,0.15770437,0.000015559322,0.00046845473,0.0063573346,0.015553042,0.017404586],"study_design_scores_gemma":[0.0044007017,0.00020113982,0.39727515,0.014207276,0.00022413018,0.00010269975,0.23236227,0.00004696109,0.0032642807,0.0008065021,0.34206423,0.0050446675],"about_ca_topic_score_codex":0.00010911309,"about_ca_topic_score_gemma":0.0010428654,"teacher_disagreement_score":0.53605014,"about_ca_system_score_codex":0.0017744201,"about_ca_system_score_gemma":0.0015918083,"threshold_uncertainty_score":0.9991582},"labels":[],"label_agreement":null},{"id":"W6990008826","doi":"","title":"A Community-based location recommendation system for location-based social networks","year":2015,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Popularity; Recommender system; Key (lock); Baseline (sea); Precision and recall; Service (business); Preference; Cover (algebra)","score_opus":0.030988551391196693,"score_gpt":0.292220878754802,"score_spread":0.2612323273636053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6990008826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6970973,0.00049759547,0.056877866,0.0006199585,0.008907678,0.022936715,0.013469409,0.007974734,0.19161873],"genre_scores_gemma":[0.92851615,9.856162e-7,0.0018824466,0.00015723275,0.00038288377,0.0015948013,0.06671711,0.0002473813,0.00050101685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532,0.0013010534,0.0013000433,0.0008161019,0.0005671115,0.00069565367],"domain_scores_gemma":[0.9938652,0.00056566845,0.0015832735,0.00092130364,0.0028188901,0.00024567771],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0025055525,0.00087431254,0.0010348952,0.00052947033,0.0029535824,0.00021643692,0.00086692534,0.0006439762,0.00012154721],"category_scores_gemma":[0.00010756922,0.001045541,0.0005750505,0.0013436673,0.00005685159,0.0003996576,0.00006918743,0.001744085,0.000047165235],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014208133,0.0019730816,0.0003153981,0.0032416505,0.0015263322,0.0000021443316,0.00005352489,0.036809456,0.0011524775,0.18265054,0.0015705669,0.769284],"study_design_scores_gemma":[0.015521246,0.0015803969,0.0016178066,0.006688531,0.007658441,0.0000033485674,0.0077797417,0.45000514,0.043430317,0.12818219,0.32635036,0.011182467],"about_ca_topic_score_codex":0.001431505,"about_ca_topic_score_gemma":0.0012920708,"teacher_disagreement_score":0.7581016,"about_ca_system_score_codex":0.0015666808,"about_ca_system_score_gemma":0.00032311399,"threshold_uncertainty_score":0.9991995},"labels":[],"label_agreement":null},{"id":"W6996526900","doi":"","title":"Simmelian Backbones: Amplifying Hidden Homophily in Facebook Networks","year":2013,"lang":"en","type":"article","venue":"Arrow@dit (Dublin Institute of Technology)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Homophily; Social network analysis; Social network (sociolinguistics); Social media; The Internet; Field (mathematics)","score_opus":0.011450177161506599,"score_gpt":0.24192221314475132,"score_spread":0.23047203598324473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996526900","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9293315,0.0005066245,0.044865612,0.0029901057,0.0005716302,0.0020528217,0.000019347928,0.000927773,0.018734628],"genre_scores_gemma":[0.98685366,0.000034676388,0.011909801,0.00007317749,0.00024066686,0.00050153653,0.000058421487,0.000044013308,0.00028405062],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757063,0.00003310121,0.0008841517,0.0006092173,0.00022580501,0.0006770804],"domain_scores_gemma":[0.99822265,0.00004648007,0.00039596861,0.0010392767,0.00019414132,0.00010151266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002528706,0.00039883624,0.00071911764,0.0011417422,0.00014456005,0.00008054503,0.001060769,0.00031267502,0.00086133415],"category_scores_gemma":[0.000028111848,0.00040560073,0.00023777504,0.001853388,0.0005013977,0.00060735934,0.00042796516,0.0006945086,0.00020970782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030411062,0.0007955351,0.22711986,0.0000734343,0.0005759118,0.000029920277,0.00018208276,0.0056687314,0.008934829,0.3327405,0.028563974,0.3952848],"study_design_scores_gemma":[0.0053042513,0.0005152149,0.016334448,0.0015483744,0.0003740666,0.000023323855,0.0021611466,0.06379481,0.030425077,0.51660675,0.35893232,0.003980214],"about_ca_topic_score_codex":0.0011636735,"about_ca_topic_score_gemma":0.00017563744,"teacher_disagreement_score":0.3913046,"about_ca_system_score_codex":0.00007792976,"about_ca_system_score_gemma":0.000081308164,"threshold_uncertainty_score":0.9998396},"labels":[],"label_agreement":null},{"id":"W7008698780","doi":"","title":"Community detection in social networks with an application to COVID-19 data","year":2021,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph; Partition (number theory); Field (mathematics); Gaussian; Generator (circuit theory); Social network (sociolinguistics); Baseline (sea)","score_opus":0.027811533675477004,"score_gpt":0.276358526767198,"score_spread":0.248546993091721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7008698780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6534581,0.000014794549,0.3438825,0.00019752429,0.000032641678,0.0004452507,0.00006884981,0.000077050754,0.0018232815],"genre_scores_gemma":[0.98894966,0.000004310828,0.0015082629,0.000022405377,0.00014544225,0.0000029034243,0.009185232,0.000021026111,0.00016074425],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988963,0.0002849468,0.00010849604,0.0003593012,0.00018358228,0.0001673482],"domain_scores_gemma":[0.99864686,0.000042644584,0.0002623382,0.00082341797,0.00012295927,0.00010179581],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029707875,0.00017679583,0.00034393155,0.00021113233,0.0005174863,0.00003211725,0.0007964397,0.0001269246,0.0000207447],"category_scores_gemma":[0.0000040315904,0.00024614108,0.000063302905,0.00066006737,0.000036899495,0.00019777459,0.00022601735,0.0005244196,0.0000027465064],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004714531,0.004858343,0.452387,0.0010688344,0.002322184,0.0000641968,0.019346837,0.0410439,0.0025482525,0.008407346,0.033123445,0.43011513],"study_design_scores_gemma":[0.0017791258,0.0005416023,0.52505624,0.00025480712,0.0010412189,0.0000014845057,0.35907543,0.084747575,0.00028948663,0.0020268827,0.023543987,0.0016421829],"about_ca_topic_score_codex":0.058636837,"about_ca_topic_score_gemma":0.93377644,"teacher_disagreement_score":0.8751396,"about_ca_system_score_codex":0.00016932802,"about_ca_system_score_gemma":0.00012603516,"threshold_uncertainty_score":0.9999991},"labels":[],"label_agreement":null},{"id":"W7008764542","doi":"","title":"Cuneyt Gurcan Akcora – Assistant Professor, University of Manitoba","year":2021,"lang":"en","type":"article","venue":"Open PRAIRIE (South Dakota State University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scholarship; State (computer science); Graph; Information science","score_opus":0.019960048598201895,"score_gpt":0.2338821476342302,"score_spread":0.21392209903602832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7008764542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5612994,0.000041223608,0.047979046,0.0011753247,0.00017764677,0.0010047042,0.0010440829,0.00018272187,0.38709584],"genre_scores_gemma":[0.9411876,0.000010156286,0.0040280386,0.000023714063,0.000035773894,3.4109712e-7,0.00022109259,0.000024523006,0.054468762],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983966,0.00026928278,0.00021248353,0.0005378245,0.00022783554,0.0003559712],"domain_scores_gemma":[0.9983326,0.000060853024,0.00035184907,0.00072747737,0.00036435935,0.00016285595],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019414064,0.00022944775,0.0004594721,0.00017641681,0.00035144362,0.00009913148,0.0010837398,0.00005083731,0.001490179],"category_scores_gemma":[0.0000057810716,0.00028603527,0.00020755938,0.0010964543,0.00017101382,0.00047816598,0.0014435807,0.0002496983,0.000054243872],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001214011,0.0019699773,0.5754212,0.0001474994,0.0033912086,0.0017220146,0.0063025123,0.00044774576,0.0026403782,0.28279832,0.0820021,0.041943036],"study_design_scores_gemma":[0.0023012909,0.00011883455,0.01776382,0.00016210125,0.0005120363,0.00000195464,0.03724087,0.00039753426,0.002411257,0.003872523,0.93437666,0.0008410987],"about_ca_topic_score_codex":0.0026140623,"about_ca_topic_score_gemma":0.004604226,"teacher_disagreement_score":0.85237455,"about_ca_system_score_codex":0.00012258328,"about_ca_system_score_gemma":0.00043427004,"threshold_uncertainty_score":0.9999592},"labels":[],"label_agreement":null},{"id":"W7017739455","doi":"","title":"A Bayesian belief network computational model of social capital in virtual communities","year":2007,"lang":"en","type":"article","venue":"University Library - University of Saskatchewan (University of Saskatchewan)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Social network (sociolinguistics); Popularity; Social capital; Social heuristics; Set (abstract data type); Social entropy; Context (archaeology); Virtual community; Social learning","score_opus":0.0073024075612284104,"score_gpt":0.17819930694364766,"score_spread":0.17089689938241925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017739455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80589247,0.000015149796,0.18944685,0.00017178564,0.000028400751,0.00023380648,0.00041752335,0.00010022242,0.0036937983],"genre_scores_gemma":[0.9660522,0.000009167262,0.029916886,0.00001775432,0.00004343951,1.1959927e-8,0.00037767203,0.000025783143,0.0035570872],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.997987,0.00021016365,0.0003716382,0.00040622253,0.00046834975,0.0005566584],"domain_scores_gemma":[0.99819875,0.00026786918,0.0006974382,0.00042498886,0.00020826429,0.00020266944],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034639466,0.00036285506,0.00092071074,0.0007763553,0.0005391004,0.000011975445,0.0013371112,0.00024136997,0.001254271],"category_scores_gemma":[9.882443e-7,0.00058511645,0.00058661593,0.0012195327,0.0012704786,0.0013234493,0.0009420699,0.0005111683,0.000005514576],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002268582,0.0015980661,0.10647673,0.00016302978,0.0011973393,0.00012162788,0.7401229,0.12778804,0.0005065039,0.013125361,0.0017803432,0.0048514544],"study_design_scores_gemma":[0.0022040864,0.00017621269,0.008858706,0.00012302128,0.0002303631,9.5203114e-7,0.9540778,0.027926393,0.0001454322,0.0053673116,0.00036332765,0.0005264081],"about_ca_topic_score_codex":0.0305777,"about_ca_topic_score_gemma":0.01598547,"teacher_disagreement_score":0.21395487,"about_ca_system_score_codex":0.00013847642,"about_ca_system_score_gemma":0.00067985355,"threshold_uncertainty_score":0.99966},"labels":[],"label_agreement":null},{"id":"W7022337170","doi":"","title":"Toledo, Ohio","year":2009,"lang":"en","type":"other","venue":"OhioLink ETD Center (Ohio Library and Information Network)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Road construction; Evergreen; Club; Sound (geography)","score_opus":0.006481315221485324,"score_gpt":0.20811392735942247,"score_spread":0.20163261213793715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022337170","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005183856,0.0005561892,0.005397642,0.00024843347,0.0002836919,0.00044612392,0.0001650833,0.0007128219,0.9921848],"genre_scores_gemma":[0.063177794,0.005609178,0.017563112,0.013331161,0.023568904,0.00026268855,0.030006602,0.0011589701,0.8453216],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980977,0.00008864419,0.0007037376,0.0003179861,0.00022230724,0.0005695979],"domain_scores_gemma":[0.998576,0.000034604753,0.00060668314,0.0005565776,0.00001680999,0.00020935996],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009196543,0.0005518273,0.00062388077,0.00033114097,0.00014940594,0.00037593022,0.00041498424,0.00027339938,0.013014054],"category_scores_gemma":[9.143798e-7,0.0005234812,0.00026175543,0.00041830097,0.00006603808,0.0030894305,0.0002528506,0.00049297407,0.00019439681],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010899192,0.0000266065,0.0003126227,0.000022586612,0.000095894065,5.2423167e-7,0.000020150248,0.000034320496,8.1029455e-8,0.39630508,0.5675025,0.03566874],"study_design_scores_gemma":[0.00042459762,0.00004109141,0.0003510717,0.0003959517,0.00006010963,0.0000021665737,0.0000028695158,0.0013054274,0.0000066294792,0.0039939173,0.9928878,0.0005283732],"about_ca_topic_score_codex":5.51645e-7,"about_ca_topic_score_gemma":0.0000011834306,"teacher_disagreement_score":0.4253853,"about_ca_system_score_codex":0.0000082731385,"about_ca_system_score_gemma":0.0000457615,"threshold_uncertainty_score":0.99972165},"labels":[],"label_agreement":null},{"id":"W7023425530","doi":"","title":"Thelma (Halifax)","year":2023,"lang":"en","type":"article","venue":"WakeSpace Scholarship (Wake Forest University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ephemeral key; Data collection; Doors","score_opus":0.017548776781591464,"score_gpt":0.24014246088743504,"score_spread":0.22259368410584357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023425530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8951614,0.000019732637,0.004426448,0.00083655963,0.00012722226,0.00026729936,0.000054065214,0.0010470639,0.09806024],"genre_scores_gemma":[0.9693271,0.000010266259,0.00037590196,0.000034120876,0.00022553607,0.0000023762902,0.00012761744,0.000036106656,0.029860992],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845016,0.00014415888,0.00014986454,0.00043473946,0.00028426584,0.0005368105],"domain_scores_gemma":[0.99886274,0.00010773863,0.00011444257,0.0006052193,0.00011319491,0.00019667872],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032422185,0.00024512634,0.00026324383,0.00062254124,0.00040877896,0.00011589544,0.00064889976,0.00008096561,0.00060961215],"category_scores_gemma":[0.000015230159,0.0002713477,0.00029065544,0.0023771517,0.000097508986,0.00046144854,0.00027800916,0.00040963676,0.0009560394],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025850404,0.00006206539,0.6659397,0.000006922094,0.00015963751,0.000059854894,0.00014060376,0.00064790394,0.00034050815,0.32188535,0.007992427,0.0027391934],"study_design_scores_gemma":[0.0010648915,0.00009303747,0.18681477,0.00008547715,0.00023847015,0.0000023181208,0.0016631507,0.0017115901,0.0011066997,0.04367826,0.7625789,0.00096244813],"about_ca_topic_score_codex":0.00017731362,"about_ca_topic_score_gemma":0.00027079706,"teacher_disagreement_score":0.75458646,"about_ca_system_score_codex":0.00007217568,"about_ca_system_score_gemma":0.000057738864,"threshold_uncertainty_score":0.9999739},"labels":[],"label_agreement":null},{"id":"W7026706267","doi":"","title":"Art as propaganda in Vichy France, 1940-1944","year":2007,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Public opinion","score_opus":0.008685029549682038,"score_gpt":0.26801075210014946,"score_spread":0.25932572255046743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7026706267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5866382,0.00017109799,0.000003955643,0.0000074708773,0.0004094462,0.0008465758,0.00026897044,0.0002777509,0.41137654],"genre_scores_gemma":[0.94162846,0.000050238283,0.0009868612,0.00018226876,0.00025313123,0.00033774177,0.0032071178,0.00027458105,0.053079624],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947003,0.00025431428,0.0014473683,0.0014733972,0.0009756016,0.0011490021],"domain_scores_gemma":[0.99709356,0.00018996486,0.00082568405,0.001147882,0.0004004047,0.0003424813],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010430657,0.0010940164,0.0013221992,0.0010161347,0.0007331078,0.000144513,0.0009899224,0.00062519405,0.0023365736],"category_scores_gemma":[0.00007136727,0.0012051937,0.00071720977,0.0016877904,0.00007256179,0.00055484293,0.00016693218,0.0025201533,0.0012549082],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044176594,0.0013720952,0.0050516273,0.0003530768,0.001016102,0.00020666857,0.00003166948,0.00011658991,0.013222869,0.29065987,0.00039676655,0.68713087],"study_design_scores_gemma":[0.0015753405,0.00021523387,0.0047254097,0.0011669833,0.00044231917,0.000008224103,0.00025855878,0.00008779034,0.08347375,0.14199457,0.76324457,0.0028072607],"about_ca_topic_score_codex":0.0011219922,"about_ca_topic_score_gemma":0.0022369057,"teacher_disagreement_score":0.7628478,"about_ca_system_score_codex":0.00039168898,"about_ca_system_score_gemma":0.00010099109,"threshold_uncertainty_score":0.9997811},"labels":[],"label_agreement":null},{"id":"W7034671761","doi":"","title":"What are ILRI and BecA and how do they work together?","year":2009,"lang":"en","type":"other","venue":"CGSPace A Repository of Agricultural Research Outputs (Consultative Group for International Agricultural Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Agency (philosophy); Productivity; Developing country; Agriculture; Circumstantial evidence; Commercialization; International development","score_opus":0.039311633725739384,"score_gpt":0.3367381561621304,"score_spread":0.297426522436391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034671761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.581809,0.03976613,0.0003033725,0.05006371,0.0026940256,0.019073114,0.0022929779,0.00096215244,0.30303553],"genre_scores_gemma":[0.52096635,0.0013244956,0.0013212501,0.000014879651,0.00232703,0.0005308703,0.00066382386,0.00015118127,0.47270015],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.993684,0.0010338686,0.0005300565,0.0013583098,0.002298909,0.0010948384],"domain_scores_gemma":[0.9916965,0.001990243,0.0007287856,0.00041363834,0.00469751,0.00047335943],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015746199,0.0007163831,0.0009679767,0.00073191914,0.0007158237,0.0016966957,0.0011292528,0.000363134,0.000094060306],"category_scores_gemma":[0.00062997773,0.00043368796,0.00039774514,0.0009657905,0.0011467999,0.0007780808,0.00083382265,0.0015316838,0.000013696094],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002609226,0.000354903,0.0023452914,0.00017485746,0.0017198443,0.000014597097,0.0024730654,0.0000046598016,0.009087071,0.016580667,0.9516008,0.015383344],"study_design_scores_gemma":[0.0034820884,0.0018591865,0.24640392,0.0094010895,0.00031890627,0.000055633715,0.08068977,0.000026582527,0.006230508,0.011506141,0.6373163,0.0027098972],"about_ca_topic_score_codex":0.00089449686,"about_ca_topic_score_gemma":0.000542648,"teacher_disagreement_score":0.3142845,"about_ca_system_score_codex":0.00032263342,"about_ca_system_score_gemma":0.000072542054,"threshold_uncertainty_score":0.9998115},"labels":[],"label_agreement":null},{"id":"W7039184204","doi":"","title":"[Letter from George Washington Manypenny] to C.W. Dean, Esq. acknowledging receipt of Agent Garret's cash accounts for quarter ending December 31st, 1855","year":2013,"lang":"en","type":"article","venue":"ThinkTech (Texas Tech University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"George (robot); Receipt; Cash; Quarter (Canadian coin); Payment","score_opus":0.01206394173532959,"score_gpt":0.22944121834438613,"score_spread":0.21737727660905654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039184204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8215493,0.000028072747,0.14449044,0.0007461098,0.00027135795,0.0016425501,0.0001489556,0.000460688,0.030662559],"genre_scores_gemma":[0.97505033,0.0000047695135,0.019533334,0.00023696375,0.00040481443,0.000017224367,0.00012399422,0.000060950184,0.004567619],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790347,0.000085978856,0.0004083661,0.000665976,0.0003004561,0.0006357304],"domain_scores_gemma":[0.9981595,0.00021013315,0.00029199172,0.0008076744,0.00032779278,0.00020289536],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027064537,0.0003969837,0.00056816335,0.0006081663,0.00026275555,0.00013348146,0.0009665621,0.00015494233,0.0022721237],"category_scores_gemma":[0.000014906393,0.00042951296,0.00036055088,0.00077070383,0.00007007641,0.0005639449,0.0004950804,0.0003496954,0.00028097394],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002929672,0.0009013801,0.095202215,0.00014633921,0.0022156416,0.000041080682,0.0030585427,0.00026332508,0.04916038,0.048000783,0.72833604,0.072381325],"study_design_scores_gemma":[0.0020212284,0.0002668992,0.005970345,0.00050189754,0.0007979018,0.0000015993628,0.0012810903,0.004164653,0.09133504,0.032402955,0.8593608,0.0018955437],"about_ca_topic_score_codex":0.0015864131,"about_ca_topic_score_gemma":0.00020687611,"teacher_disagreement_score":0.15350106,"about_ca_system_score_codex":0.0002633836,"about_ca_system_score_gemma":0.00005332761,"threshold_uncertainty_score":0.99981564},"labels":[],"label_agreement":null},{"id":"W7046040476","doi":"","title":"Contractile properties of skeletal muscles in hypertrophic cardiomyopathy","year":2020,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Hypertrophic cardiomyopathy; Skeletal muscle; Muscle hypertrophy; Cardiomyopathy; Troponin; Cardiac muscle","score_opus":0.015920777793122984,"score_gpt":0.22866609630239493,"score_spread":0.21274531850927195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7046040476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9417677,0.0005206083,7.9101375e-7,0.000011096087,0.00026060175,0.0006988025,0.00041679945,0.00016015633,0.05616348],"genre_scores_gemma":[0.9975796,0.00006108516,0.000294518,0.00003136724,0.00014235341,0.00026210118,0.00078743935,0.00016894289,0.00067261496],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9962735,0.00034842096,0.0011955104,0.00094955007,0.0006434679,0.00058952055],"domain_scores_gemma":[0.99789864,0.00009553513,0.0007773339,0.0006990573,0.0003350663,0.00019436146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037963793,0.00075080007,0.0015207011,0.00043746099,0.000295516,0.00006119149,0.00070099096,0.00033047915,0.00028013298],"category_scores_gemma":[0.00008867479,0.00076343,0.00083346484,0.00075522927,0.000075353135,0.00042269652,0.00015214177,0.0014455189,0.000059565176],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048400462,0.00087109406,0.0015974004,0.0008337699,0.0015208899,0.00008468129,0.000069029644,0.00017041372,0.4353418,0.10213224,0.000020570702,0.4568741],"study_design_scores_gemma":[0.0031136116,0.0005298852,0.008989115,0.003205218,0.0019198183,0.000010795974,0.0027960297,0.00084193726,0.828744,0.054791152,0.09050746,0.0045509776],"about_ca_topic_score_codex":0.0014884304,"about_ca_topic_score_gemma":0.00052078295,"teacher_disagreement_score":0.45232314,"about_ca_system_score_codex":0.00020249342,"about_ca_system_score_gemma":0.0000826842,"threshold_uncertainty_score":0.9994817},"labels":[],"label_agreement":null},{"id":"W7092195069","doi":"10.1016/j.chaos.2025.117390","title":"Enhancing key node identification in hypernetworks: A novel node–hyperedge interaction model","year":2025,"lang":"en","type":"article","venue":"Chaos Solitons & Fractals","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Jilin Province","keywords":"Node (physics); Key (lock); Monotonic function; Identification (biology); Interaction model; Network structure","score_opus":0.018972766094489377,"score_gpt":0.3060412483319148,"score_spread":0.2870684822374254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092195069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4290653,0.00011873439,0.55970865,0.00031833872,0.0002264255,0.000323182,0.000020928284,0.00013249746,0.0100859385],"genre_scores_gemma":[0.9933367,0.0000124833105,0.0047618505,0.00016467985,0.00034111526,0.00020480363,0.00014073933,0.000030292635,0.0010073327],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981227,0.000056353627,0.0007116842,0.00051875744,0.00016851538,0.00042201395],"domain_scores_gemma":[0.99879026,0.0001525112,0.00025479987,0.0006060727,0.00013029612,0.000066074346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037463685,0.00026401106,0.0004132304,0.0003665407,0.00015686396,0.00014496621,0.00032548196,0.00010295759,0.00012304996],"category_scores_gemma":[0.000025012247,0.00029282254,0.00020710571,0.00064798724,0.000046050955,0.0003809647,0.00015371118,0.00040860698,0.0000458417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019336377,0.0032260367,0.09328374,0.00019477456,0.0009109968,0.0000058902924,0.004865616,0.17214324,0.53087926,0.10655722,0.012420399,0.07531945],"study_design_scores_gemma":[0.0005155461,0.000009425499,0.0040401206,0.00037988627,0.000120944125,0.0000010014116,0.00071623886,0.93909496,0.03744091,0.014828473,0.0023982178,0.0004542561],"about_ca_topic_score_codex":0.00052922126,"about_ca_topic_score_gemma":0.00016577617,"teacher_disagreement_score":0.76695174,"about_ca_system_score_codex":0.00019628668,"about_ca_system_score_gemma":0.000107538915,"threshold_uncertainty_score":0.9999524},"labels":[],"label_agreement":null},{"id":"W7097423595","doi":"","title":"Finding evidence of community from blogging co-citations: a social network analytic approach","year":2006,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Social network (sociolinguistics); Measure (data warehouse); Cluster analysis; Social network analysis; Social media; Big data; Social research","score_opus":0.06117250126311016,"score_gpt":0.3376756016914001,"score_spread":0.27650310042828996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097423595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5919891,0.00010749695,0.3704022,0.00005937027,0.000013178251,0.00014543031,0.000011823596,0.00009834547,0.037173104],"genre_scores_gemma":[0.9828604,7.30775e-7,0.016385326,0.000022958864,0.0004349965,0.000018589784,0.00014785065,0.000010082553,0.000119062],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989381,0.0002365462,0.00035066382,0.00012173575,0.00015145337,0.00020153348],"domain_scores_gemma":[0.9989126,0.0005215455,0.00020959502,0.00027201,0.00006339449,0.00002089301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043881376,0.00011910287,0.00030036553,0.00006825781,0.0003930764,0.000046398523,0.00026622717,0.00002929594,0.000291196],"category_scores_gemma":[0.0000058719884,0.000118978896,0.00017385876,0.00044888162,0.000076644734,0.000118666816,0.00008278829,0.00023174769,0.0000045684437],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027160106,0.00062092574,0.736983,0.000034984485,0.0005510928,3.6978705e-7,0.001401906,0.013358637,0.0012334236,0.17875372,0.05614305,0.010891741],"study_design_scores_gemma":[0.00068385503,0.000074995514,0.28895545,0.00029102646,0.0007570379,3.1958064e-7,0.004192771,0.1274165,0.0018400431,0.5741324,0.0007671184,0.0008885024],"about_ca_topic_score_codex":0.008769471,"about_ca_topic_score_gemma":0.00011755968,"teacher_disagreement_score":0.44802755,"about_ca_system_score_codex":0.000027302138,"about_ca_system_score_gemma":0.000024354258,"threshold_uncertainty_score":0.9978312},"labels":[],"label_agreement":null},{"id":"W7099865944","doi":"","title":"Paper presented to 26th International Sunbelt Social Network Conference, Vancouver. ***DRAFT – PLEASE DO NOT QUOTE WITHOUT PERMISSION OF AUTHORS***","year":2006,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Hyperlink; Theme (computing); Social network (sociolinguistics); The Internet; Key (lock); Permission; Work (physics); Focus (optics)","score_opus":0.011983516324603705,"score_gpt":0.28472904254922915,"score_spread":0.27274552622462545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099865944","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40555447,0.000027088243,0.2710869,0.002840616,0.00090115576,0.001151534,0.00016522594,0.0004906186,0.31778237],"genre_scores_gemma":[0.97846675,7.138684e-7,0.0060256748,0.00010473662,0.0015222824,0.000032043878,0.00011995278,0.000024488552,0.013703382],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832296,0.000081110615,0.00048062255,0.00036458505,0.00041556952,0.00033513937],"domain_scores_gemma":[0.99908537,0.000046131703,0.00020351076,0.00026928243,0.00028451666,0.0001111737],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019319887,0.00022852216,0.00036812213,0.000101753714,0.00015602304,0.00007872088,0.00036591507,0.000064249056,0.004791809],"category_scores_gemma":[0.0000056129543,0.00020286729,0.00022654251,0.00031032716,0.000058511716,0.0001527869,0.00023564695,0.00016986292,0.000017823548],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022249258,0.00042765203,0.16588435,0.000008862732,0.0002564472,0.0000021872677,0.00019911419,0.0024973794,0.003961305,0.14232863,0.6707897,0.013421871],"study_design_scores_gemma":[0.0025711772,0.00019888465,0.091578744,0.00023454582,0.00036262325,0.0000010118673,0.00062641327,0.051788047,0.009060253,0.08048414,0.76142305,0.001671081],"about_ca_topic_score_codex":0.0022661507,"about_ca_topic_score_gemma":0.0009084057,"teacher_disagreement_score":0.5729122,"about_ca_system_score_codex":0.00003737433,"about_ca_system_score_gemma":0.00007098407,"threshold_uncertainty_score":0.99611795},"labels":[],"label_agreement":null},{"id":"W7107970528","doi":"10.1002/spy2.70138","title":"A Survey of <scp>SIR</scp> ‐Based Differential Epidemic Models for Control and Security Against Malware Propagation in Computer Networks","year":2025,"lang":"en","type":"article","venue":"Security and Privacy","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Malware; Cloud computing; Epidemic model; Computer virus; Focus (optics); Network security; Schema (genetic algorithms); Graph","score_opus":0.01593639580267269,"score_gpt":0.2643473892931474,"score_spread":0.24841099349047469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7107970528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4619815,0.00019894207,0.53709006,0.000049273272,0.000023036488,0.00048231208,0.000085565815,0.000019539639,0.000069772505],"genre_scores_gemma":[0.99901086,0.000021826661,0.000456662,0.00008414662,0.000080527825,0.000065639506,0.0002667902,0.000009876485,0.0000036964163],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986481,0.0002838906,0.00040927323,0.00033044996,0.00008152494,0.0002467418],"domain_scores_gemma":[0.9986394,0.00082253275,0.0001738896,0.00019912185,0.000110993795,0.000054065404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056185655,0.0001862834,0.00049114326,0.00012451912,0.000092591275,0.000051768122,0.00014781409,0.000090832444,0.0000034561365],"category_scores_gemma":[0.000030747276,0.00018472546,0.00009200798,0.00023749218,0.00007644643,0.00011784265,0.00011982454,0.00021360606,6.535494e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028310242,0.0008601143,0.8644916,0.0006313453,0.0005199823,0.0000013814694,0.0017980147,0.026182972,0.00011099384,0.06126231,0.003302526,0.04055569],"study_design_scores_gemma":[0.0012978399,0.000038185957,0.03342207,0.00011019187,0.000047071855,4.7489884e-8,0.000015087454,0.8846477,0.000064466,0.080216974,0.000068462745,0.00007188621],"about_ca_topic_score_codex":0.00055144733,"about_ca_topic_score_gemma":0.00025439306,"teacher_disagreement_score":0.8584647,"about_ca_system_score_codex":0.000020480515,"about_ca_system_score_gemma":0.00004703609,"threshold_uncertainty_score":0.75328857},"labels":[],"label_agreement":null},{"id":"W7116117035","doi":"10.1016/j.eswa.2025.130920","title":"Multilayer artificial benchmark for community detection (mABCD)","year":2025,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"HORIZON EUROPE Framework Programme; European Research Executive Agency; Ministerstwo Edukacji i Nauki; Narodowe Centrum Nauki","keywords":"Flexibility (engineering); Graph; Benchmark (surveying); Uniqueness; Network science; Complex network; Community structure; Random graph","score_opus":0.01815432120541413,"score_gpt":0.30615584080439784,"score_spread":0.2880015195989837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116117035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051980154,0.00011112748,0.9858362,0.00009289102,0.00005225359,0.0015364328,0.000023023544,0.00014692648,0.0070031276],"genre_scores_gemma":[0.98573095,7.396613e-7,0.0029184043,0.000032253403,0.00032700028,0.010370847,0.00009683629,0.000013900984,0.0005090744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992329,0.00007505258,0.0002605277,0.00019056385,0.00007769117,0.00016329372],"domain_scores_gemma":[0.9989639,0.0001653108,0.0001069874,0.0005743723,0.00015048795,0.000038944356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018180802,0.00012924468,0.00019338781,0.000093595474,0.0006833398,0.0000724389,0.00020503097,0.000036850863,0.000021274864],"category_scores_gemma":[0.0000024142098,0.000114668575,0.000082287406,0.00036891477,0.00004066434,0.000053551194,0.00003658783,0.000138937,0.000008242593],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001747248,0.0017069814,0.0073452494,0.00015298811,0.0010720161,1.4083237e-7,0.0017742458,0.0020384786,0.04075398,0.5485776,0.033208013,0.36319557],"study_design_scores_gemma":[0.0007463415,0.00011330499,0.0009902655,0.00014466383,0.00016867521,0.0000011037642,0.0046679764,0.05960895,0.038070288,0.018428853,0.87641364,0.000645939],"about_ca_topic_score_codex":0.0017740019,"about_ca_topic_score_gemma":0.00018057397,"teacher_disagreement_score":0.9829178,"about_ca_system_score_codex":0.000049234834,"about_ca_system_score_gemma":0.000033895627,"threshold_uncertainty_score":0.5255766},"labels":[],"label_agreement":null},{"id":"W7117536728","doi":"10.1109/tdsc.2025.3649362","title":"KDCS: Achieving Efficient and Privacy-Preserving ($k,d$k,d)-Truss Community Search for Social Networks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Natural Science Foundation of China","keywords":"Homomorphic encryption; Encryption; Social network (sociolinguistics); Server; Cloud computing; Social network analysis; Tree (set theory); Vertex (graph theory); Information privacy","score_opus":0.0240214184782693,"score_gpt":0.30384515331443596,"score_spread":0.2798237348361667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117536728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36224306,0.00059394236,0.6353607,0.00031409875,0.0002587373,0.0007137457,0.000041326188,0.000098307246,0.00037608758],"genre_scores_gemma":[0.9963961,0.000083556246,0.0027445103,0.00011629736,0.00036598774,0.00004062479,0.000024315099,0.00005877649,0.00016978024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963832,0.00075734005,0.00082934595,0.00078254566,0.00027350214,0.0009741014],"domain_scores_gemma":[0.99703544,0.0016757625,0.00023201428,0.00062995177,0.00024149711,0.00018534414],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015905367,0.00060311076,0.00088855915,0.00040654076,0.006487404,0.0006767137,0.0006515917,0.00028035825,0.00004512233],"category_scores_gemma":[0.0000069356197,0.0006781592,0.00041621603,0.0008379332,0.00023730462,0.00015437801,0.00013312479,0.0021628372,0.0000012705058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032793864,0.001075059,0.0013616466,0.00080709223,0.001471407,0.0000030482527,0.0067088907,0.57813346,0.00040847439,0.004188595,0.0005375282,0.40497687],"study_design_scores_gemma":[0.0012415872,0.00017975004,0.0005185743,0.00077109435,0.00054978655,0.0000031344623,0.0024261062,0.990544,0.0016212082,0.0006789966,0.0008939325,0.0005717997],"about_ca_topic_score_codex":0.00066956313,"about_ca_topic_score_gemma":0.00011483641,"teacher_disagreement_score":0.63415307,"about_ca_system_score_codex":0.00013107463,"about_ca_system_score_gemma":0.00013855494,"threshold_uncertainty_score":0.999567},"labels":[],"label_agreement":null},{"id":"W7123335607","doi":"10.1109/cdc57313.2025.11312285","title":"Transmission Neural Networks: Approximate Receding Horizon Control for Virus Spread on Networks","year":2025,"lang":"","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal","funders":"","keywords":"Artificial neural network; Markov process; Horizon; Dynamic programming; Control theory (sociology); Optimal control; State (computer science); Transmission (telecommunications); Control (management)","score_opus":0.012039508044237441,"score_gpt":0.27431406489841886,"score_spread":0.26227455685418144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7123335607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014931842,0.0016643207,0.98181134,0.0010168719,0.0010084489,0.0029735265,0.00004057506,0.00039085018,0.009600877],"genre_scores_gemma":[0.99049014,0.00036652427,0.0034343672,0.0005849842,0.0024048826,0.0005913101,0.00021434258,0.00011457873,0.0017988429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99486136,0.00032493658,0.0014643952,0.001442063,0.0003204661,0.0015867573],"domain_scores_gemma":[0.9967794,0.0011423099,0.00049116724,0.0010046832,0.00026072265,0.0003217487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091145874,0.0010470882,0.0015094205,0.00036373263,0.00092843326,0.0005212994,0.0008048673,0.00041591813,0.00047217295],"category_scores_gemma":[0.000014226478,0.0009812634,0.0013842909,0.0011608198,0.00013897024,0.0002622757,0.00014574813,0.00097329525,0.0000057167176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012356191,0.00044642767,0.00057766284,0.000056229997,0.00078980566,0.0000014433695,0.00002584016,0.3576203,0.0002663332,0.048454516,0.018457599,0.5720682],"study_design_scores_gemma":[0.0026767887,0.00086540263,0.00006123478,0.00057313923,0.0010334917,3.3274208e-7,0.00006574565,0.9583567,0.0010515786,0.0059887217,0.028511394,0.0008154644],"about_ca_topic_score_codex":0.00016323278,"about_ca_topic_score_gemma":0.000022389533,"teacher_disagreement_score":0.988997,"about_ca_system_score_codex":0.00018086677,"about_ca_system_score_gemma":0.00008055946,"threshold_uncertainty_score":0.99926376},"labels":[],"label_agreement":null},{"id":"W7125935215","doi":"10.1109/smc58881.2025.11343620","title":"Establishing Role Networks by Providing a Crowdsourcing Platform <sup>*</sup>","year":2025,"lang":"","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crowdsourcing; Social network (sociolinguistics); Social network analysis; Work (physics); Social relation; Social relationship","score_opus":0.006724140956262412,"score_gpt":0.2373536521784621,"score_spread":0.23062951122219968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125935215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051628165,0.0032098163,0.8412577,0.0004086391,0.00018820776,0.0011056558,0.000026999976,0.00055143976,0.101623386],"genre_scores_gemma":[0.9810387,0.000067060806,0.004094813,0.0004126765,0.0010949286,0.00013597093,0.00020203165,0.00009429128,0.012859561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99494153,0.00015500534,0.001437948,0.0013465026,0.00045656908,0.0016624442],"domain_scores_gemma":[0.9971101,0.00068450003,0.0004645031,0.0012031769,0.00023074739,0.00030691546],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010545339,0.0009176166,0.0011670284,0.00045760357,0.0012585908,0.00237818,0.0012116596,0.0003370762,0.0013066189],"category_scores_gemma":[0.0000402406,0.00097305654,0.0007687714,0.0022029218,0.00014431063,0.0013080634,0.0012212046,0.0013682597,0.000034741603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010950424,0.0006926915,0.04869135,0.00012417843,0.002015139,0.000005335255,0.0016434042,0.17456722,0.00059628853,0.07259142,0.18889473,0.5100687],"study_design_scores_gemma":[0.00057274714,0.00005672719,0.000050016977,0.00056769553,0.00048809024,6.8035433e-7,0.0034130404,0.8960375,0.0013997119,0.006306264,0.09029087,0.0008166164],"about_ca_topic_score_codex":0.002033012,"about_ca_topic_score_gemma":0.000042051863,"teacher_disagreement_score":0.9294105,"about_ca_system_score_codex":0.0003669223,"about_ca_system_score_gemma":0.00028202983,"threshold_uncertainty_score":0.9996063},"labels":[],"label_agreement":null},{"id":"W7126234853","doi":"10.1016/j.jns.2025.125360","title":"Large-scale network engagement during sensory change detection","year":2025,"lang":"en","type":"article","venue":"Journal of the Neurological Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Change detection; Sensory system; Sensory processing; Perception","score_opus":0.03388512375232588,"score_gpt":0.28724481087866116,"score_spread":0.2533596871263353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126234853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99312365,0.000081684666,0.0030415843,0.0015756901,0.0003798561,0.00008111785,4.7791934e-7,0.00001367814,0.0017022709],"genre_scores_gemma":[0.9985922,0.000009202926,0.00028708746,0.0003709394,0.0006383375,0.0000037806642,3.1003868e-8,0.0000015159397,0.000096884614],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989692,0.00025636246,0.00022933364,0.00012086127,0.00021249827,0.00021176285],"domain_scores_gemma":[0.999501,0.00010036156,0.00022521101,0.00010540476,0.000038131668,0.000029898853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090802996,0.000071678835,0.0001419046,0.000050540883,0.0005434881,0.000053925527,0.00043951446,0.000019871364,0.000089914014],"category_scores_gemma":[0.000016305581,0.000038101454,0.00018865181,0.0005858727,0.0000966778,0.00009108715,0.00022592055,0.0003010552,0.0000012090727],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007342183,0.00024210798,0.9521658,0.0000063084376,0.000081339,0.0000063849566,0.00019514517,0.0072384537,0.0045811897,0.004003366,0.0010505468,0.030355971],"study_design_scores_gemma":[0.00038211295,0.00043372082,0.9032958,0.00005834321,0.00012946765,0.000010887915,0.0001962373,0.011820246,0.0057611996,0.05666399,0.021072367,0.00017559608],"about_ca_topic_score_codex":0.000004680618,"about_ca_topic_score_gemma":0.0000074539716,"teacher_disagreement_score":0.05266062,"about_ca_system_score_codex":0.000009668678,"about_ca_system_score_gemma":0.000011889979,"threshold_uncertainty_score":0.41801256},"labels":[],"label_agreement":null},{"id":"W7127280911","doi":"10.1109/iemecon69302.2025.11365857","title":"Hybrid Centrality and Temporal Dynamics Framework for Identifying Influential Nodes and Predicting Links in Complex Networks","year":2025,"lang":"","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Centrality; Variety (cybernetics); Complex network; Complex system; Dynamics (music); Ensemble learning; Network science; Key (lock); Social network analysis","score_opus":0.022662386948170816,"score_gpt":0.3228001356139024,"score_spread":0.3001377486657316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127280911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28178102,0.00067072886,0.7156653,0.00042265834,0.00016144273,0.0008578544,0.0000687919,0.000079629,0.00029260444],"genre_scores_gemma":[0.9620779,0.00013562289,0.03658349,0.00017587068,0.00042713233,0.000074793534,0.00038699913,0.000036617766,0.000101585654],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965714,0.0001865819,0.0012390028,0.00095357205,0.00018018662,0.00086922373],"domain_scores_gemma":[0.9981476,0.00068980845,0.00038376453,0.0004695984,0.0001388879,0.00017031548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007958082,0.000524151,0.00092213444,0.00027041172,0.00056436413,0.0007795644,0.00030432804,0.00032707717,0.000090628695],"category_scores_gemma":[0.000044512613,0.0005966343,0.00025852572,0.0004967143,0.0002894306,0.00030932264,0.0007358716,0.001203078,3.550242e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008440482,0.00015639183,0.80529326,0.00020602747,0.00036638544,0.0000015849104,0.00012020559,0.0021394764,0.000010282978,0.1419139,0.0004536441,0.049254425],"study_design_scores_gemma":[0.000784091,0.000029957273,0.07441864,0.0005657252,0.00028347017,6.8335385e-7,0.00037453443,0.7932102,0.000044161196,0.12940367,0.0004935056,0.00039134832],"about_ca_topic_score_codex":0.0014383872,"about_ca_topic_score_gemma":0.0007414052,"teacher_disagreement_score":0.79107076,"about_ca_system_score_codex":0.00014992626,"about_ca_system_score_gemma":0.000083654704,"threshold_uncertainty_score":0.9996485},"labels":[],"label_agreement":null},{"id":"W7131134175","doi":"10.1109/snams67467.2025.11391193","title":"From Dense Graphs to Meaningful Communities: Assessing Community Quality Using Geodesic Distance Modularity on Metric Backbone-Sparsified Networks","year":2025,"lang":"","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Metric (unit); Metrics; Modularity (biology); Scalability; Pipeline (software); Key (lock); Quality (philosophy); Enhanced Data Rates for GSM Evolution","score_opus":0.08829965325384215,"score_gpt":0.3753333110325838,"score_spread":0.2870336577787417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131134175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44991213,0.00033360036,0.5432757,0.0001227915,0.00030019757,0.00060384965,0.000096016505,0.0002733803,0.0050823237],"genre_scores_gemma":[0.9769351,0.00004630137,0.020798126,0.001003718,0.00029479477,0.00005974384,0.0004951812,0.00009621423,0.00027085643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98704726,0.0074358364,0.002258234,0.0009946491,0.00081419793,0.0014498272],"domain_scores_gemma":[0.98797727,0.005144356,0.0009731262,0.0047556427,0.0006907608,0.00045887628],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0041073817,0.0012868871,0.0023150733,0.0011362347,0.003932383,0.0018026585,0.0024000697,0.00041080485,0.0006258769],"category_scores_gemma":[0.000114744435,0.0014542225,0.0010869302,0.0061373324,0.00047882594,0.0006328934,0.002036161,0.0038317158,0.000020960495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091124605,0.006460716,0.18598959,0.0002476712,0.0059820367,0.000010053303,0.007260035,0.5327848,0.00047664208,0.18576708,0.0063752327,0.06773487],"study_design_scores_gemma":[0.0011516229,0.00014691679,0.031628385,0.0018612336,0.0012391637,2.9361138e-7,0.018428138,0.8639387,0.0005341963,0.078229554,0.0010052617,0.0018365144],"about_ca_topic_score_codex":0.13158834,"about_ca_topic_score_gemma":0.006724354,"teacher_disagreement_score":0.52702296,"about_ca_system_score_codex":0.00094574346,"about_ca_system_score_gemma":0.0003033555,"threshold_uncertainty_score":0.9999883},"labels":[],"label_agreement":null},{"id":"W7132356201","doi":"","title":"Bursty event detection on social media","year":2019,"lang":"en","type":"article","venue":"NPARC","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Social media; Event (particle physics); Burstiness; Cluster analysis; Wavelet; Microblogging; Media event","score_opus":0.012726039270842161,"score_gpt":0.25814234946584835,"score_spread":0.2454163101950062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132356201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8983815,0.0000017327188,0.008001422,0.00012716462,0.00014730477,0.00011013811,0.0000042829497,0.00008253021,0.09314395],"genre_scores_gemma":[0.9988847,3.026753e-7,0.0001708557,0.000022546847,0.00060856965,0.000013837206,0.000011997982,0.000008921751,0.00027829962],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994946,0.000025974237,0.00009343842,0.00013509665,0.00012740938,0.00012344358],"domain_scores_gemma":[0.9997377,0.00004021768,0.000046760008,0.000130469,0.000021199634,0.00002364871],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007540271,0.00007100475,0.00010785924,0.000037226368,0.00005552012,0.000015296602,0.00007902869,0.000020832891,0.0030166698],"category_scores_gemma":[0.000001475176,0.00006676921,0.0001035493,0.000098367156,0.000010411518,0.00002788771,0.000026239653,0.00010176938,0.0002768193],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026594747,0.0001255253,0.0072630052,0.0000033687556,0.000077297074,3.4146794e-7,0.00029695028,0.000031369626,0.029066382,0.043693062,0.007661072,0.911755],"study_design_scores_gemma":[0.0015700411,0.00026100597,0.09698333,0.000062289204,0.00017774996,6.604086e-7,0.0005548661,0.010666227,0.23250955,0.5490733,0.10701999,0.0011210241],"about_ca_topic_score_codex":0.000011651538,"about_ca_topic_score_gemma":0.0000062884715,"teacher_disagreement_score":0.910634,"about_ca_system_score_codex":0.000025534508,"about_ca_system_score_gemma":0.0000077586155,"threshold_uncertainty_score":0.9978947},"labels":[],"label_agreement":null},{"id":"W7132947029","doi":"","title":"Analyzing the Role of Users&apos; Interactions in Information Spread","year":2015,"lang":"","type":"dissertation","venue":"TSpace","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Identification (biology); Set (abstract data type); Friendship; Social network (sociolinguistics); Social media; Social network analysis; Raw data; User group","score_opus":0.023800226215822694,"score_gpt":0.374476159358957,"score_spread":0.35067593314313433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132947029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91976935,0.0009079369,0.0048908256,0.0002520881,0.00031466482,0.0009906708,0.0000342206,0.00005766057,0.07278256],"genre_scores_gemma":[0.99714696,0.00005392603,0.00035217084,0.0000066261186,0.00016818101,0.000078819314,0.0012994065,0.000023141594,0.00087077945],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99806845,0.00017461773,0.0009109762,0.00023150034,0.00030778802,0.000306695],"domain_scores_gemma":[0.99737114,0.00017086141,0.0012274814,0.00063218677,0.0005236709,0.00007468908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004923253,0.00035666744,0.00057949906,0.00052970427,0.00014185974,0.0001457774,0.00047921547,0.000094203395,0.00047385428],"category_scores_gemma":[0.000033392505,0.00031661996,0.0003340798,0.0010844404,0.00005340272,0.0006357279,0.00010098027,0.0007078425,0.00007110381],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060488924,0.0008590331,0.119920515,0.0002412228,0.0020997291,0.0000010055159,0.235216,0.013789284,0.005609674,0.03236893,0.0074138236,0.58187586],"study_design_scores_gemma":[0.0013755951,0.00024106757,0.020358706,0.0023101375,0.002095545,0.0000019161957,0.52344006,0.1669359,0.020885034,0.04048264,0.21994805,0.0019253669],"about_ca_topic_score_codex":0.010640334,"about_ca_topic_score_gemma":0.0032323117,"teacher_disagreement_score":0.5799505,"about_ca_system_score_codex":0.00016711782,"about_ca_system_score_gemma":0.0002501902,"threshold_uncertainty_score":0.9999286},"labels":[],"label_agreement":null},{"id":"W7132955061","doi":"","title":"Extending link analysis for novel Web mining applications","year":2007,"lang":"","type":"dissertation","venue":"TSpace","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada; Library and Archives Canada","funders":"","keywords":"Web modeling; Web mining; Data Web; Semantic search; Exploit; Web page; Web intelligence; Semantic Web; Web service; Link analysis","score_opus":0.03577860235371418,"score_gpt":0.4069784039330704,"score_spread":0.3711998015793562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132955061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016370958,0.00070676825,0.96889824,0.00014923922,0.00013669759,0.0018151229,0.00013616981,0.00017864918,0.011608142],"genre_scores_gemma":[0.85742474,0.00008213169,0.103529535,0.000039005332,0.0027949577,0.0018925224,0.011868125,0.00016956235,0.022199435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606293,0.000043881533,0.0011693356,0.0013340209,0.00046004195,0.0009297969],"domain_scores_gemma":[0.99574155,0.00067891896,0.0014558332,0.0011958051,0.0006634555,0.0002644703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008012461,0.0008266025,0.0014535489,0.0016267266,0.0008608964,0.00030158742,0.0007330308,0.00040184925,0.0008008471],"category_scores_gemma":[0.000018576284,0.0010001805,0.0021195232,0.004066908,0.00007118486,0.00011662312,0.000099540965,0.00054020283,0.000038550206],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054894487,0.0023924275,0.034454923,0.0009694166,0.05446625,0.0000032463165,0.017491726,0.020542275,0.042476427,0.13812327,0.004589727,0.68394136],"study_design_scores_gemma":[0.0017394299,0.00022135927,0.00575061,0.0005294154,0.04746722,9.727229e-7,0.03031865,0.4631769,0.0066870567,0.002228438,0.43788457,0.0039953673],"about_ca_topic_score_codex":0.00026849125,"about_ca_topic_score_gemma":0.00043760517,"teacher_disagreement_score":0.8653687,"about_ca_system_score_codex":0.00019240718,"about_ca_system_score_gemma":0.00026860792,"threshold_uncertainty_score":0.99924487},"labels":[],"label_agreement":null},{"id":"W7133483445","doi":"10.1109/aisummit66170.2025.11410970","title":"Machine Learning and Graph-Based Models for Citation Network Analysis","year":2025,"lang":"","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Artificial neural network; Deep learning; Feature (linguistics); Network analysis; Computational learning theory","score_opus":0.013229550866543241,"score_gpt":0.2794640918790024,"score_spread":0.26623454101245914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133483445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021546476,0.001959083,0.98756355,0.00045899765,0.000048189468,0.0005908748,0.000026764987,0.00011465422,0.0070832227],"genre_scores_gemma":[0.9544595,0.00009666017,0.041724876,0.00014966878,0.00016074083,0.00014578001,0.0005836646,0.000022484292,0.0026566088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783605,0.00018716585,0.00064292416,0.0006807458,0.00016166795,0.00049143157],"domain_scores_gemma":[0.9984203,0.00061282614,0.0002822845,0.00032948257,0.00025726797,0.00009784787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064245635,0.00036715242,0.0007850298,0.0007974988,0.0006354687,0.00026951183,0.00017480012,0.00009787933,0.00028464952],"category_scores_gemma":[0.000009485762,0.0003809383,0.0008548655,0.003836957,0.00008488303,0.00014829278,0.000105094805,0.00026112283,0.0000010650873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074695636,0.00009209487,0.06925263,0.00003873616,0.003977712,1.1748897e-7,0.000034703353,0.671576,0.0000143186035,0.21570009,0.0009801474,0.03825875],"study_design_scores_gemma":[0.0004916347,0.00006568339,0.000513526,0.000044172997,0.0051005688,1.0129281e-8,0.00005320659,0.81066895,0.000056850986,0.1782878,0.0044509573,0.00026662796],"about_ca_topic_score_codex":0.00042104386,"about_ca_topic_score_gemma":0.0002536054,"teacher_disagreement_score":0.95230484,"about_ca_system_score_codex":0.00003797934,"about_ca_system_score_gemma":0.00007880323,"threshold_uncertainty_score":0.9998643},"labels":[],"label_agreement":null},{"id":"W7139298955","doi":"","title":"Advances in Social Network Analysis and Mining","year":2009,"lang":"en","type":"book","venue":"University of Southern Denmark Research Portal (University of Southern Denmark)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"","score_opus":0.016887923693249318,"score_gpt":0.2585027683832762,"score_spread":0.24161484469002686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7139298955","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10566751,0.0014642981,0.002473331,0.000101296726,0.000023172483,0.00080514915,0.0014758869,0.000070042704,0.8879193],"genre_scores_gemma":[0.5773276,0.00070010114,0.0031846953,0.0000084905805,0.00044686013,3.130823e-7,0.00061289896,0.00009462724,0.4176244],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9961712,0.0004807392,0.00043082808,0.0009292455,0.0011512514,0.0008367825],"domain_scores_gemma":[0.9973906,0.00036879742,0.00089183106,0.0005983888,0.00050254975,0.00024781318],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014594003,0.0004911497,0.0015374848,0.0018501411,0.00074412517,0.000037248108,0.0012683216,0.00044412323,0.00906152],"category_scores_gemma":[0.00001110894,0.0006799518,0.00092743116,0.001957393,0.0014033953,0.00021601931,0.00080558605,0.0010965155,0.00013175434],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002988367,0.0013659516,0.5496997,0.00085163146,0.013957058,0.0014922239,0.067210555,0.0018282244,0.00006631382,0.013823299,0.103315875,0.24340075],"study_design_scores_gemma":[0.0074341875,0.0008810124,0.019108444,0.0028160005,0.0105115585,0.000008599532,0.67877734,0.005240978,0.000010148784,0.0953321,0.17477888,0.0051007243],"about_ca_topic_score_codex":0.0022974473,"about_ca_topic_score_gemma":0.006776952,"teacher_disagreement_score":0.6115668,"about_ca_system_score_codex":0.00013633615,"about_ca_system_score_gemma":0.00042091875,"threshold_uncertainty_score":0.9995652},"labels":[],"label_agreement":null},{"id":"W7139390546","doi":"","title":"Proceedings of International Conference on Advances in Social Network Analysis and Mining:Asonam 2010, Odense Denmark","year":2010,"lang":"en","type":"book","venue":"University of Southern Denmark Research Portal (University of Southern Denmark)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Social network analysis; Network analysis; Social network (sociolinguistics); Danish","score_opus":0.022894852703568225,"score_gpt":0.2653201514559894,"score_spread":0.2424252987524212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7139390546","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44062275,0.0002298741,0.00031493837,0.00013336357,0.00006573649,0.00066281174,0.0023867388,0.00003346406,0.55555034],"genre_scores_gemma":[0.7207367,0.00044245482,0.0021722908,0.0000045981524,0.0002900469,6.111993e-7,0.00030953684,0.00006930612,0.27597445],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9963346,0.00015952955,0.00049973093,0.0009165687,0.0014427952,0.00064676185],"domain_scores_gemma":[0.9964137,0.0003077295,0.0013277085,0.0004072859,0.0013127761,0.00023077564],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013841724,0.0004941387,0.0014032997,0.0018297072,0.0004510629,0.00004625723,0.0016495832,0.00054242334,0.013930543],"category_scores_gemma":[0.00002213284,0.00064692076,0.00075938343,0.0012323984,0.0018901469,0.0002495045,0.0009786256,0.0014305211,0.000112244925],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061752787,0.0018782889,0.75932086,0.0010342902,0.014723686,0.0003880298,0.052278485,0.0002559253,0.0009202196,0.04820368,0.08581525,0.029005993],"study_design_scores_gemma":[0.0106146885,0.0014059112,0.035949502,0.005053701,0.008695987,0.000014962434,0.76557064,0.009731401,0.00012244924,0.075783275,0.081420474,0.0056369896],"about_ca_topic_score_codex":0.00148703,"about_ca_topic_score_gemma":0.003911109,"teacher_disagreement_score":0.7233714,"about_ca_system_score_codex":0.000113266375,"about_ca_system_score_gemma":0.00041150124,"threshold_uncertainty_score":0.9995982},"labels":[],"label_agreement":null},{"id":"W7164309962","doi":"10.5281/zenodo.20636923","title":"Spectral Properties of Large-Scale Random Graphs: Implications for Social Network Connectivity","year":2013,"lang":"en","type":"article","venue":"Open MIND","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Impact","funders":"","keywords":"Spectral clustering; Adjacency list; Adjacency matrix; Complex network; Dynamic network analysis; Cluster analysis; Stability (learning theory); Graph; Spectral properties; Social network analysis","score_opus":0.03505014989376267,"score_gpt":0.3062441766356428,"score_spread":0.27119402674188015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7164309962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.961142,0.000033458702,0.02813952,0.00051133655,0.00002464092,0.0015562777,0.000066010936,0.0000048071624,0.008521945],"genre_scores_gemma":[0.9902127,5.4119715e-7,0.008741469,0.00001072385,0.00024891933,0.00043276302,0.00003911251,0.000010579087,0.00030319393],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992594,0.00004408304,0.00022022634,0.00019627347,0.00004638636,0.0002335904],"domain_scores_gemma":[0.99947447,0.00005000094,0.00013727993,0.000194859,0.000110331755,0.0000330659],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022701404,0.00009904423,0.0002891736,0.000023541545,0.00022509173,0.000095308285,0.00029306265,0.000025307063,0.0011746748],"category_scores_gemma":[0.00000286259,0.00008563435,0.00017683301,0.00016226091,0.000052584055,0.00016207546,0.000117815536,0.000058679543,0.000015867417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006079376,0.0022031409,0.32276347,0.000039447237,0.0016874361,1.09758815e-7,0.004531898,0.0003617936,0.040646784,0.09232907,0.11190256,0.42292634],"study_design_scores_gemma":[0.010394878,0.0004387115,0.13331133,0.00017501567,0.0009316815,0.0000011408256,0.002270367,0.012387804,0.09997346,0.64392674,0.094428614,0.0017602737],"about_ca_topic_score_codex":0.00024087723,"about_ca_topic_score_gemma":0.00013470993,"teacher_disagreement_score":0.55159765,"about_ca_system_score_codex":0.000009338264,"about_ca_system_score_gemma":0.00003344368,"threshold_uncertainty_score":0.9997384},"labels":[],"label_agreement":null},{"id":"W7164387089","doi":"10.5281/zenodo.20636922","title":"Spectral Properties of Large-Scale Random Graphs: Implications for Social Network Connectivity","year":2013,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Impact","funders":"","keywords":"Spectral clustering; Adjacency list; Adjacency matrix; Complex network; Dynamic network analysis; Cluster analysis; Stability (learning theory); Graph; Spectral properties; Social network analysis","score_opus":0.02956108057930263,"score_gpt":0.2568092240462334,"score_spread":0.22724814346693079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7164387089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6098227,0.00013514381,0.32245013,0.002668872,0.000087281755,0.0036015462,0.00066882145,0.0012337589,0.05933178],"genre_scores_gemma":[0.99789,0.0000040811037,0.00073698576,0.000027324493,0.00030181961,0.0000011644763,0.0005281804,0.0003565946,0.00015386182],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885786,0.00017306845,0.00025189255,0.00025786305,0.00011672245,0.00034262447],"domain_scores_gemma":[0.99892914,0.000027663664,0.00014401555,0.0002714667,0.0005593666,0.00006834851],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040822485,0.00011488791,0.00021731864,0.00008567703,0.0016518435,0.0002442809,0.00047259819,0.000030159596,0.0037349653],"category_scores_gemma":[0.000034170625,0.00011229221,0.00015372972,0.00041290317,0.000121444755,0.00017303726,0.00034453024,0.0001231726,0.00019173881],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019449735,0.00079663086,0.0013448282,0.00009251667,0.00046523815,1.2302554e-7,0.0022010892,0.00027478934,0.029961156,0.25258818,0.6216385,0.09044247],"study_design_scores_gemma":[0.0036796245,0.00039100088,0.023433767,0.00007685694,0.00019781665,0.0000057350117,0.0011066184,0.0062139966,0.00755936,0.122823276,0.8337455,0.0007664465],"about_ca_topic_score_codex":0.000044677792,"about_ca_topic_score_gemma":0.0000010750966,"teacher_disagreement_score":0.38806733,"about_ca_system_score_codex":0.000032363198,"about_ca_system_score_gemma":0.0000034833886,"threshold_uncertainty_score":0.99964786},"labels":[],"label_agreement":null},{"id":"W75581828","doi":"10.1090/gsm/089","title":"A Course on the Web Graph","year":2008,"lang":"en","type":"book","venue":"Graduate studies in mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":101,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Course (navigation); Computer science; World Wide Web; Graph; Theoretical computer science; Physics; Astronomy","score_opus":0.13775374854126435,"score_gpt":0.3443535399202355,"score_spread":0.20659979137897114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75581828","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011430534,0.0012567857,0.0002968695,0.00075363886,0.00024087216,0.0009854952,0.00007064605,0.00015809768,0.99509454],"genre_scores_gemma":[0.06543432,0.0063611837,0.0048867594,0.00030398346,0.002046433,0.00078733446,0.00012712379,0.00029867832,0.9197542],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998142,0.000074000636,0.000611886,0.00034204798,0.00047766455,0.00035238508],"domain_scores_gemma":[0.9975781,0.00091092905,0.0004377309,0.0009000501,0.00013971986,0.000033457094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043859798,0.0005067782,0.0009399695,0.00016040109,0.00023123423,0.000026222857,0.0005336706,0.00007252352,0.00007662444],"category_scores_gemma":[0.00002769756,0.00033502863,0.00041267058,0.00024847055,0.0004960764,0.000021826645,0.0002839414,0.000731334,0.00011663308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018135479,0.00016191174,0.00004461633,0.00006789578,0.0008722782,0.000012235519,0.0015945294,0.000016910473,2.5240638e-7,0.341345,0.6552096,0.0006729434],"study_design_scores_gemma":[0.00015186012,0.000043410797,0.000008771398,0.0009632973,0.00028155645,0.0000023685018,0.0010788634,0.00058263005,0.0000067335545,0.95062304,0.045810796,0.00044665235],"about_ca_topic_score_codex":0.0000036942386,"about_ca_topic_score_gemma":0.000013980293,"teacher_disagreement_score":0.6093988,"about_ca_system_score_codex":0.00010335995,"about_ca_system_score_gemma":0.00010922413,"threshold_uncertainty_score":0.9999102},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027410872042148204,"score_gpt":0.27390038399454764,"score_spread":0.24648951195239943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W808055529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96108496,0.000013753962,0.0017617239,0.0016528209,0.000115124276,0.0004903999,0.000057022713,0.000057106743,0.034767076],"genre_scores_gemma":[0.9941154,2.7113654e-7,0.0053474824,0.00011092619,0.0002593559,0.000045955225,0.000014921343,0.0000078183175,0.000097886885],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920255,0.0000057313523,0.0002135987,0.00016735062,0.00026551235,0.00014527682],"domain_scores_gemma":[0.9994872,0.000013350828,0.00013629704,0.00011680075,0.00016044168,0.00008586152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016590809,0.00010218187,0.0001680766,0.000036660902,0.000054943568,0.00003417901,0.00035000127,0.000010028393,0.00024822203],"category_scores_gemma":[0.0000048623638,0.00007728636,0.000094671406,0.000188131,0.000026641672,0.0000660825,0.00032751824,0.000070869304,0.00001701224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082035294,0.0006288564,0.40733987,0.00001583208,0.00039453423,9.8411505e-8,0.0031097503,0.00010189835,0.04268632,0.3564099,0.17943192,0.0097989645],"study_design_scores_gemma":[0.0013772808,0.00020688679,0.018310364,0.00018150418,0.00024369251,4.5410897e-7,0.0041543255,0.000972848,0.39978912,0.4613099,0.11296378,0.0004898339],"about_ca_topic_score_codex":0.002687273,"about_ca_topic_score_gemma":0.000019087553,"teacher_disagreement_score":0.3890295,"about_ca_system_score_codex":0.00006660913,"about_ca_system_score_gemma":0.000013222881,"threshold_uncertainty_score":0.4062371},"labels":[],"label_agreement":null},{"id":"W83901899","doi":"","title":"Reverse centrality queries in complex networks","year":2009,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Centrality; Computer science; Complex network; Information retrieval; Data science; World Wide Web; Mathematics; Combinatorics","score_opus":0.012368550802162856,"score_gpt":0.23757671933650065,"score_spread":0.22520816853433778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83901899","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6634371,0.00033761098,0.005723076,0.00023865735,0.0005467129,0.0015099365,0.00023706861,0.000647754,0.32732204],"genre_scores_gemma":[0.9787401,0.000081520106,0.00036863578,0.000054029955,0.00024783643,0.000001960728,0.0061819158,0.00003699243,0.014287002],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814236,0.00017364744,0.0003529909,0.0005980842,0.00022478249,0.0005081614],"domain_scores_gemma":[0.99884593,0.000048808783,0.00031655215,0.0005317022,0.00012009784,0.00013692075],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012124627,0.00044159815,0.000651514,0.0005055413,0.00017386125,0.000062230254,0.00057853624,0.00024458405,0.0012864462],"category_scores_gemma":[0.0000032878547,0.0005580142,0.00037405183,0.0011442512,0.00005853836,0.00023576127,0.00006385105,0.00066604576,0.00002135368],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027746332,0.0003438362,0.81524396,0.000040149076,0.00025793182,0.000101827885,0.00004661415,0.0013531499,0.0000032574185,0.01776272,0.1431277,0.021441398],"study_design_scores_gemma":[0.0014472296,0.0000910041,0.080982514,0.00035318529,0.0005617683,1.8140458e-9,0.02568561,0.0031425825,0.00027170757,0.005502293,0.88017267,0.0017894104],"about_ca_topic_score_codex":0.0035716214,"about_ca_topic_score_gemma":0.20536393,"teacher_disagreement_score":0.737045,"about_ca_system_score_codex":0.00021464737,"about_ca_system_score_gemma":0.00009805928,"threshold_uncertainty_score":0.99968714},"labels":[],"label_agreement":null},{"id":"W92684717","doi":"10.1007/978-3-642-20862-1_14","title":"Following the Conversation: A More Meaningful Expression of Engagement","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Conversation; Notation; Graph; Computer science; Metric (unit); Clique; World Wide Web; Data science; Theoretical computer science; Psychology; Mathematics; Communication; Engineering; Social psychology","score_opus":0.019112804557913823,"score_gpt":0.2477657747947476,"score_spread":0.22865297023683379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92684717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036234487,0.00031384436,0.88992465,0.0002539225,0.00013779603,0.0004930062,0.000009054205,0.000083530584,0.10842188],"genre_scores_gemma":[0.9952016,0.0000117643085,0.0040080473,0.00013065481,0.00016435486,0.000037015754,0.00024313874,0.000028007005,0.00017543347],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853164,0.000022581402,0.0007319701,0.00016523371,0.00037671294,0.00017188997],"domain_scores_gemma":[0.99821615,0.000099783174,0.00096843985,0.0003339046,0.0003603927,0.000021332911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034756906,0.00031056622,0.00040301468,0.00029013975,0.0001879157,0.000100240286,0.0003187721,0.00014604529,0.0004373548],"category_scores_gemma":[0.000036132933,0.00023180601,0.00015519011,0.0002415141,0.00008054989,0.0007167621,0.0001523378,0.00042753853,0.000006534801],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070203765,0.00004807731,0.002540132,0.0007911476,0.00020879049,0.000002018499,0.02598428,0.011489843,0.00015097127,0.02592177,0.0002618851,0.9325309],"study_design_scores_gemma":[0.003741052,0.000107710155,0.0023470628,0.022170343,0.0018837767,0.0000069256344,0.0015812814,0.038881376,0.046174973,0.66864586,0.20967521,0.004784454],"about_ca_topic_score_codex":0.000044870485,"about_ca_topic_score_gemma":0.000003635104,"teacher_disagreement_score":0.99483925,"about_ca_system_score_codex":0.00005667743,"about_ca_system_score_gemma":0.000117385265,"threshold_uncertainty_score":0.9452775},"labels":[],"label_agreement":null},{"id":"W95807225","doi":"10.1007/978-3-319-10160-6_28","title":"Mining Interesting “Following” Patterns from Social Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Friendship; Interdependence; Social network (sociolinguistics); Social network analysis; World Wide Web; Social group; Space (punctuation); Data science; Data mining; Social media; Sociology","score_opus":0.017154467422948474,"score_gpt":0.2604619033120014,"score_spread":0.24330743588905296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95807225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004792508,0.000059392103,0.991088,0.00007772825,0.0006693327,0.00014060947,0.0000074203995,0.00011275105,0.0030522626],"genre_scores_gemma":[0.9583417,8.5054984e-7,0.036966898,0.00028610427,0.0041913893,0.0000064463975,0.00006166033,0.00004811353,0.00009680344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975122,0.000038206355,0.0004847404,0.0009951591,0.00043653222,0.00053311646],"domain_scores_gemma":[0.99846125,0.0004852141,0.00034668783,0.00054518867,0.000074285526,0.000087379995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042431077,0.00046832315,0.0006490908,0.00028747346,0.0003037577,0.00034192463,0.0011843612,0.00017426365,0.00020464753],"category_scores_gemma":[0.000010004375,0.000465678,0.00034181844,0.00018811025,0.00021263078,0.00009786891,0.00082651747,0.00075814326,0.000009019977],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029875457,0.000011193303,0.009716044,0.0000045585375,0.00007522497,0.000012277514,0.0004306822,0.014717741,0.000016458467,0.0028475309,0.00008871346,0.9720766],"study_design_scores_gemma":[0.000251204,0.000057080284,0.0009650141,0.0009289973,0.00009996674,0.0000011302952,9.958056e-7,0.8504992,0.00013352674,0.14452313,0.0014717585,0.0010679626],"about_ca_topic_score_codex":0.00024920047,"about_ca_topic_score_gemma":0.00012629275,"teacher_disagreement_score":0.9710086,"about_ca_system_score_codex":0.0001099702,"about_ca_system_score_gemma":0.000079503065,"threshold_uncertainty_score":0.9997795},"labels":[],"label_agreement":null},{"id":"W970708678","doi":"10.1007/978-3-319-18356-5_8","title":"Inferring User Profiles in Online Social Networks Using a Partial Social Graph","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Moncton","funders":"","keywords":"Computer science; Social graph; Exploit; Graph; Inference; Constraint (computer-aided design); Social network (sociolinguistics); Theoretical computer science; Artificial intelligence; Machine learning; Data mining; Social media; World Wide Web; Mathematics","score_opus":0.04183036242574024,"score_gpt":0.3078637330164062,"score_spread":0.26603337059066595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W970708678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007931143,0.00009983027,0.99041283,0.00010267132,0.00030425005,0.00031243908,0.000016241267,0.00007488014,0.00074572215],"genre_scores_gemma":[0.96079046,0.000001816072,0.03390384,0.00012091316,0.005016949,0.000010754515,0.00006113966,0.000049955524,0.000044173776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737775,0.00005322003,0.0005526875,0.00082071807,0.0005509911,0.0006446544],"domain_scores_gemma":[0.9990172,0.000092890725,0.00032093804,0.00030740327,0.00017864996,0.000082933526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005570288,0.00045949456,0.00068014924,0.00058178394,0.00028735783,0.00021695577,0.00080248114,0.000241619,0.00006999725],"category_scores_gemma":[0.0000064610213,0.00046322093,0.00022203062,0.0006530082,0.0005139244,0.00020621545,0.00072045723,0.0010158969,0.0000019080437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003760964,0.00020444459,0.016541008,0.000026645097,0.00010573082,0.000035519603,0.0017022734,0.37969747,0.000090039255,0.032066535,0.00024927646,0.56924343],"study_design_scores_gemma":[0.0003938536,0.000044176733,0.00078511104,0.00026066246,0.000051846437,0.000002174892,0.0000019029771,0.8260761,0.00007829236,0.17023647,0.0011828343,0.00088658184],"about_ca_topic_score_codex":0.00027177995,"about_ca_topic_score_gemma":0.0003358178,"teacher_disagreement_score":0.956509,"about_ca_system_score_codex":0.00025620026,"about_ca_system_score_gemma":0.00034958025,"threshold_uncertainty_score":0.99978197},"labels":[],"label_agreement":null},{"id":"W980892519","doi":"10.1007/978-3-319-06483-3_4","title":"Learning to Measure Influence in a Scientific Social Network","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Measure (data warehouse); Psychology; Data science; Computer science; Cognitive science; Data mining","score_opus":0.012707477365928806,"score_gpt":0.25005519385941927,"score_spread":0.23734771649349046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W980892519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006617393,0.000053177082,0.9886576,0.00019965394,0.00033913692,0.00034922172,0.0000018939912,0.00008753693,0.0036943653],"genre_scores_gemma":[0.9709029,4.9994765e-7,0.026916387,0.00025848823,0.0014056584,0.000017716477,0.000010681979,0.000034313543,0.0004533546],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677396,0.00006760803,0.00047431403,0.0012059696,0.0007432566,0.0007348938],"domain_scores_gemma":[0.99862105,0.00021136481,0.00023472642,0.00054930086,0.00026302852,0.00012055733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015858351,0.00041163678,0.0005880886,0.0007103068,0.0005102362,0.0005931422,0.0013024888,0.0001470037,0.000070546914],"category_scores_gemma":[0.00003402503,0.00041893762,0.00015892321,0.0012746496,0.0005300479,0.00013537827,0.0007650592,0.001086463,0.000044926677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060385896,0.000011961592,0.005527275,0.000007854133,0.000011466611,0.0000044469625,0.00081781764,0.43802613,0.00007950419,0.009042094,0.00013544894,0.54633],"study_design_scores_gemma":[0.0005313872,0.000270038,0.005408165,0.0019351116,0.000057711866,0.000004263128,0.0000019767156,0.33572474,0.00037039805,0.6142318,0.038911812,0.0025525764],"about_ca_topic_score_codex":0.00008674279,"about_ca_topic_score_gemma":0.00029618936,"teacher_disagreement_score":0.9642855,"about_ca_system_score_codex":0.00019230806,"about_ca_system_score_gemma":0.00026676978,"threshold_uncertainty_score":0.99982625},"labels":[],"label_agreement":null}]}