{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5541457,0.00030990728,0.44120795,0.0009819567,0.000016853808,0.000058810765,0.00021751218,0.00018476295,0.0028765728],"genre_scores_gemma":[0.98520494,0.00009490149,0.014142101,0.000037045025,0.000010204583,0.000033928678,0.000062256135,0.000009643572,0.0004051173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890685,0.00057228433,0.00004697981,0.00015655936,0.00019617156,0.000121185454],"domain_scores_gemma":[0.9795066,0.016667044,0.0022282857,0.00059522473,0.0006411027,0.00036181652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032554236,0.0004641376,0.00063166505,0.0013483225,0.0004957103,0.0014083526,0.0010662087,0.0011749751,0.0012962506],"category_scores_gemma":[0.022657232,0.0002977299,0.00041425947,0.0014089067,0.0014108233,0.003604317,0.00088728865,0.0008713063,0.00011008065],"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.00016179506,0.00010633927,0.00556208,0.00006063989,0.00004754798,0.000083865925,0.00015571155,0.94287616,0.0020985946,0.039496046,0.00027600414,0.009075211],"study_design_scores_gemma":[0.000004601738,0.000024838597,0.00050418533,0.0000033435508,0.0000055824494,0.000010200906,0.000016625603,0.9870493,0.0003509839,0.011980679,0.000043684606,0.0000059642307],"about_ca_topic_score_codex":0.005197991,"about_ca_topic_score_gemma":0.0027332366,"teacher_disagreement_score":0.005197991,"about_ca_system_score_codex":0.0025239415,"about_ca_system_score_gemma":0.0005655422,"threshold_uncertainty_score":0.018312573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021313934,0.00015829166,0.9958191,0.00015415985,0.00004203634,0.000037459093,0.00003401036,0.00015698854,0.0014665807],"genre_scores_gemma":[0.058031257,0.00030918213,0.93799967,0.00015007985,0.000106573265,0.0002745858,0.00022667453,0.00047827547,0.002423691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835473,0.0008833134,0.00008549744,0.0002677571,0.00029151118,0.00011728161],"domain_scores_gemma":[0.985865,0.011504036,0.00057448336,0.00076744566,0.0010467842,0.00024230643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051597483,0.0023687244,0.0024321864,0.0028409653,0.0014696759,0.002405632,0.0035726523,0.0027476286,0.005637376],"category_scores_gemma":[0.026938803,0.002404351,0.0026491624,0.002617991,0.0023012476,0.0040829186,0.0033182052,0.0050748726,0.0011346055],"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.000035822493,0.00006277116,0.00022539067,0.00013774833,0.000044788027,0.000032110187,0.00012939394,0.9114949,0.0003494573,0.05048957,0.002359978,0.034638178],"study_design_scores_gemma":[0.000008076617,0.0000083994355,0.000017215794,0.000015349606,0.000006167521,0.0000059124577,0.000014472577,0.9670611,0.00011219204,0.03221057,0.0005359884,0.0000046175815],"about_ca_topic_score_codex":0.009589966,"about_ca_topic_score_gemma":0.010996755,"teacher_disagreement_score":0.009589966,"about_ca_system_score_codex":0.0025548465,"about_ca_system_score_gemma":0.0026270784,"threshold_uncertainty_score":0.027287722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7961181,0.0004587822,0.18985647,0.001066312,0.000023359264,0.00015975875,0.0011439192,0.00020200445,0.010971272],"genre_scores_gemma":[0.96965843,0.00039946276,0.025875095,0.00009084553,0.000040670737,0.00010007382,0.0008665979,0.000040467112,0.0029282665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99938774,0.00021919186,0.000022739598,0.00019927578,0.00010429098,0.00006676322],"domain_scores_gemma":[0.9937185,0.0036198038,0.0013331183,0.0005137014,0.00040908385,0.00040573778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068614655,0.00033380758,0.00030697708,0.001860134,0.0009465646,0.0016032243,0.0007493361,0.0012193188,0.001632541],"category_scores_gemma":[0.0068313787,0.0003721219,0.00039297424,0.0017725503,0.001162849,0.0028143574,0.0008893158,0.00054510025,0.00040674873],"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.0002706958,0.0004127116,0.13127293,0.00054787734,0.00023498002,0.0019930478,0.00438941,0.29849723,0.03252648,0.45080814,0.008837415,0.070209116],"study_design_scores_gemma":[0.000024457024,0.00010249326,0.03154472,0.00005806287,0.00006784936,0.0010447764,0.0012128688,0.7795114,0.003092929,0.17345405,0.009836918,0.000049440936],"about_ca_topic_score_codex":0.0034250666,"about_ca_topic_score_gemma":0.0038229453,"teacher_disagreement_score":0.0034250666,"about_ca_system_score_codex":0.001077226,"about_ca_system_score_gemma":0.00044435685,"threshold_uncertainty_score":0.007815838},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061684875,0.0009291882,0.99024147,0.0006897233,0.00005637556,0.000030643558,0.00021694301,0.0003166186,0.0013505216],"genre_scores_gemma":[0.32011795,0.0056209154,0.66565263,0.000525827,0.0004620672,0.00031807576,0.0012518661,0.00045600807,0.0055946084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986916,0.0004938625,0.000051393035,0.00039534702,0.00031255707,0.00005520013],"domain_scores_gemma":[0.99443984,0.0041110893,0.0003382325,0.00067307404,0.00030188294,0.00013590993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018589719,0.001400491,0.00095283554,0.0021644547,0.00059125485,0.0025051818,0.0017431381,0.0012706618,0.0016702326],"category_scores_gemma":[0.009948811,0.0010870182,0.0020147543,0.0031630308,0.0013803291,0.0060795443,0.0026756653,0.0029527042,0.00055064494],"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.00008016471,0.00015785646,0.004209006,0.0005616763,0.0005587576,0.00033246243,0.0005619005,0.535069,0.0044793356,0.2264023,0.010546629,0.21704093],"study_design_scores_gemma":[0.0000027098692,0.000013187687,0.000481076,0.000024310222,0.00003793075,0.000064179076,0.000057993908,0.718623,0.0004857968,0.27762973,0.0025686703,0.000011490806],"about_ca_topic_score_codex":0.0032398708,"about_ca_topic_score_gemma":0.0038739094,"teacher_disagreement_score":0.0032398708,"about_ca_system_score_codex":0.0011487309,"about_ca_system_score_gemma":0.0011362247,"threshold_uncertainty_score":0.00983125},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009189632,0.0006308985,0.69731295,0.00053874985,0.0002649374,0.00085831614,0.04587153,0.21974948,0.025583556],"genre_scores_gemma":[0.042473726,0.0010848006,0.8635438,0.0003072659,0.00010564629,0.0044587688,0.04203724,0.02477787,0.021210905],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946827,0.0001497299,0.000051076273,0.00010443794,0.00018277463,0.000043701686],"domain_scores_gemma":[0.9982002,0.0012974379,0.00011604484,0.00011349739,0.0001941918,0.00007865717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015812056,0.0014320749,0.0009791758,0.002524542,0.0006514883,0.0019268896,0.0019808072,0.0006233111,0.081599124],"category_scores_gemma":[0.0044796877,0.0007921718,0.0010331308,0.0023289642,0.00038775898,0.003421842,0.0023776577,0.0015543825,0.011109716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007366968,0.00021291927,0.0037035109,0.0024864932,0.00035920858,0.0006864913,0.0017386841,0.023188697,0.011001587,0.046425562,0.58363265,0.32582757],"study_design_scores_gemma":[0.00038754765,0.00012600364,0.005721087,0.000612042,0.00015639649,0.0007614436,0.0005271002,0.257709,0.010492741,0.058395084,0.664914,0.00019750299],"about_ca_topic_score_codex":0.003589352,"about_ca_topic_score_gemma":0.00528676,"teacher_disagreement_score":0.081599124,"about_ca_system_score_codex":0.0006678635,"about_ca_system_score_gemma":0.0011871832,"threshold_uncertainty_score":0.27297622},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04836408,0.0022448786,0.92888933,0.0029243447,0.00019837686,0.00031483156,0.00050758256,0.0005207248,0.016035851],"genre_scores_gemma":[0.7642188,0.004185896,0.19846444,0.00045088862,0.00090694416,0.0010154882,0.0007728964,0.0004265981,0.029558158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658066,0.0016516402,0.00017425667,0.0005894144,0.0006629853,0.00034097958],"domain_scores_gemma":[0.9697827,0.026338141,0.0008161821,0.0015859281,0.0009849252,0.0004920797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003988768,0.0014607544,0.003272609,0.001937093,0.0012231884,0.0030845192,0.0041645984,0.004978633,0.0064294636],"category_scores_gemma":[0.03243135,0.0011890914,0.0012315231,0.003690163,0.0020320022,0.007311875,0.0028606348,0.0027153804,0.0009831865],"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.00037879104,0.00015430005,0.0005030975,0.000890638,0.00012375016,0.00016848704,0.00032547966,0.45920816,0.0023809536,0.44108698,0.012337052,0.08244238],"study_design_scores_gemma":[0.00008148992,0.00006535284,0.00019339121,0.0000479587,0.000041028063,0.00009014169,0.00004300401,0.6273886,0.0007169441,0.36897892,0.0023322918,0.000020889835],"about_ca_topic_score_codex":0.0014773789,"about_ca_topic_score_gemma":0.0011619112,"teacher_disagreement_score":0.0064294636,"about_ca_system_score_codex":0.0024912308,"about_ca_system_score_gemma":0.0013827981,"threshold_uncertainty_score":0.021508694},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"incentives","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"incentives","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105451524,0.0158316,0.028934134,0.61133176,0.009194486,0.00018295812,0.00037366443,0.00057775155,0.22812206],"genre_scores_gemma":[0.876436,0.007672679,0.014890707,0.0331641,0.0023482505,0.00026380268,0.00026544378,0.00035911973,0.06459992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909757,0.004483064,0.00024250729,0.0012625193,0.0015094326,0.0015268335],"domain_scores_gemma":[0.9296727,0.015887616,0.0043038116,0.003267101,0.00834432,0.038524497],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.014524034,0.0007058191,0.0007795714,0.0026331889,0.007956987,0.01840775,0.002585858,0.008296563,0.027912222],"category_scores_gemma":[0.05559898,0.0006646373,0.00059133006,0.002243471,0.009345828,0.048673987,0.013032458,0.007153327,0.010393468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003438628,0.0004843895,0.014930694,0.00058240845,0.00014459185,0.00094651914,0.010176292,0.00047005963,0.0017232628,0.5945572,0.16126032,0.21438035],"study_design_scores_gemma":[0.000076893724,0.00014211415,0.0037138406,0.00047212085,0.00009185884,0.00089352083,0.025477849,0.0013184682,0.0009277848,0.56291544,0.4038858,0.000084226835],"about_ca_topic_score_codex":0.0016222347,"about_ca_topic_score_gemma":0.002650933,"teacher_disagreement_score":0.9973668,"about_ca_system_score_codex":0.0026617139,"about_ca_system_score_gemma":0.007135647,"threshold_uncertainty_score":0.09337568},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901722,0.00070355245,0.0006633676,0.0006543473,0.000016261614,0.000008428856,0.0027878683,0.000016109665,0.0049778675],"genre_scores_gemma":[0.9960503,0.00026599612,0.0003024624,0.000024420828,0.000014950879,0.000008962817,0.001441948,0.000005233757,0.0018858515],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9995121,0.00009735614,0.00004374772,0.00013019692,0.00009536081,0.00012134588],"domain_scores_gemma":[0.9942153,0.0017065217,0.002139876,0.00025720507,0.0010814476,0.0005995581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009622854,0.00013445616,0.00017298145,0.0024704786,0.00085400336,0.0018852134,0.00054132025,0.00061746134,0.002622925],"category_scores_gemma":[0.007566778,0.00019485864,0.0002337143,0.0036964335,0.00083847623,0.0018890477,0.001229345,0.0008607391,0.00044622223],"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.00044279933,0.00007793432,0.9373997,0.00012869899,0.00019823486,0.0001727364,0.0046606995,0.008427783,0.0007459377,0.011123315,0.0077846446,0.028837463],"study_design_scores_gemma":[0.0000063335947,0.000026931117,0.9801909,0.00005696035,0.00004908622,0.00009473237,0.0027802319,0.006815692,0.00034557178,0.0031709229,0.0064462903,0.000016305334],"about_ca_topic_score_codex":0.03655269,"about_ca_topic_score_gemma":0.078822546,"teacher_disagreement_score":0.03655269,"about_ca_system_score_codex":0.0017071083,"about_ca_system_score_gemma":0.00070004066,"threshold_uncertainty_score":0.07267988},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001292817,0.00017570842,0.9971366,0.000088720815,0.000041562904,0.0000632659,0.00012400666,0.00076755625,0.00030980608],"genre_scores_gemma":[0.088351026,0.0004837366,0.90546703,0.00011585627,0.00018643579,0.0009927504,0.0011779948,0.0005639912,0.0026611956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626166,0.0020833663,0.00025314142,0.00057555136,0.0005942743,0.00023200382],"domain_scores_gemma":[0.9877061,0.008532156,0.00092486053,0.001242815,0.0011902747,0.00040374545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057228943,0.0017690379,0.0030051,0.0050558206,0.0013175111,0.0023220521,0.00290281,0.0017644948,0.006317453],"category_scores_gemma":[0.021220744,0.0011206116,0.0031245558,0.004407284,0.0012168753,0.002653779,0.0041893497,0.00334555,0.0018802223],"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.000103612394,0.000083118204,0.0013902837,0.00029036292,0.00033510246,0.00014996504,0.00016267237,0.75941867,0.0007227301,0.08950719,0.005056995,0.14277923],"study_design_scores_gemma":[0.000009287259,0.000020915593,0.00010520788,0.00000847507,0.00001232992,0.000011785561,0.000009658244,0.9704378,0.000072857096,0.028067352,0.00123469,0.000009649737],"about_ca_topic_score_codex":0.014774762,"about_ca_topic_score_gemma":0.015976122,"teacher_disagreement_score":0.014774762,"about_ca_system_score_codex":0.0018564669,"about_ca_system_score_gemma":0.0022805964,"threshold_uncertainty_score":0.030265927},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039984025,0.005476678,0.91885906,0.0013703943,0.00015915645,0.00034919134,0.0029779675,0.0015974944,0.029226042],"genre_scores_gemma":[0.21807893,0.006488005,0.7519231,0.0002145558,0.00018664946,0.0003764652,0.0056626396,0.00028288257,0.016786776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993992,0.00018195192,0.000031548294,0.00014901627,0.00020888443,0.000029378325],"domain_scores_gemma":[0.9987155,0.0008745048,0.00011924252,0.00011855831,0.00014418978,0.000027913862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007654881,0.00096478977,0.00051406526,0.004293509,0.0007767329,0.0016015872,0.00075736584,0.0006783126,0.0061885426],"category_scores_gemma":[0.0036648558,0.00035335537,0.0007411202,0.0040983893,0.00037890996,0.0026020005,0.00087504653,0.000716458,0.0033123472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000894993,0.0001929825,0.016470337,0.0013451924,0.0003963605,0.0005003041,0.0021032577,0.03278457,0.01069577,0.079145014,0.04144846,0.8148283],"study_design_scores_gemma":[0.000031339416,0.00010704386,0.016817762,0.00050083996,0.0002992435,0.0014830952,0.0022402655,0.52666867,0.0134822745,0.26101094,0.17726913,0.0000894309],"about_ca_topic_score_codex":0.001647118,"about_ca_topic_score_gemma":0.003415235,"teacher_disagreement_score":0.0061885426,"about_ca_system_score_codex":0.00052441185,"about_ca_system_score_gemma":0.00047856043,"threshold_uncertainty_score":0.02070272},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022035645,0.00021934934,0.97572607,0.00017401992,0.000020203257,0.000056754503,0.00006805262,0.00029013792,0.0014097953],"genre_scores_gemma":[0.46190464,0.00036120875,0.53464645,0.0001418031,0.00007724139,0.00022229775,0.000302169,0.00013507702,0.0022091456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748766,0.001156124,0.00008005472,0.0005196079,0.00058906875,0.00016751929],"domain_scores_gemma":[0.9921658,0.004625758,0.0009841719,0.0010859139,0.00087221904,0.00026623334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030703347,0.0009057606,0.00089490804,0.002745035,0.0011286121,0.0015180035,0.001646603,0.0014790631,0.0014313066],"category_scores_gemma":[0.01944669,0.0007369719,0.00089014444,0.0017388742,0.0018354083,0.0024108798,0.0029162697,0.0014908329,0.0004811631],"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.00024812864,0.00006764279,0.0029737256,0.00032398838,0.0001339726,0.00017899208,0.00047845335,0.68511015,0.015895456,0.11868684,0.0031840194,0.17271861],"study_design_scores_gemma":[0.000012853259,0.000023099004,0.00038399672,0.000014725911,0.000010046663,0.000054349202,0.00003209932,0.9290038,0.0023101068,0.06718355,0.00095939916,0.000012014354],"about_ca_topic_score_codex":0.001698225,"about_ca_topic_score_gemma":0.0015283825,"teacher_disagreement_score":0.0030703347,"about_ca_system_score_codex":0.001196277,"about_ca_system_score_gemma":0.0007248738,"threshold_uncertainty_score":0.016237676},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069753737,0.0010464143,0.9595477,0.003226824,0.0005179207,0.0001714099,0.0021590488,0.021623002,0.004732224],"genre_scores_gemma":[0.1235188,0.0018481634,0.8546527,0.00061341916,0.00036147184,0.0007104372,0.008309197,0.0028807165,0.0071050297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829394,0.0006186414,0.000083439845,0.00023911764,0.00063464243,0.00013020379],"domain_scores_gemma":[0.9933861,0.0023875665,0.0002064168,0.0019671347,0.0015150483,0.0005377717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048255823,0.0012548513,0.0011700357,0.002191593,0.00077711634,0.0044562505,0.0027803434,0.0010735353,0.014438919],"category_scores_gemma":[0.012836026,0.00077040325,0.0013155506,0.002126292,0.00063674356,0.0062642572,0.003506518,0.0021887377,0.0021858728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088440627,0.0002552318,0.004290045,0.0006878993,0.00047614184,0.00049791805,0.0013251426,0.10486259,0.018032487,0.075880155,0.2775334,0.5152745],"study_design_scores_gemma":[0.00012662308,0.00007563188,0.0013285562,0.00011921827,0.000048635626,0.00023021534,0.0002476721,0.783181,0.007514218,0.10304456,0.10402398,0.000059665923],"about_ca_topic_score_codex":0.004753235,"about_ca_topic_score_gemma":0.0075098565,"teacher_disagreement_score":0.014438919,"about_ca_system_score_codex":0.0012291506,"about_ca_system_score_gemma":0.0015810146,"threshold_uncertainty_score":0.048303008},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.411713,0.0012868434,0.5799042,0.0016791006,0.00008876616,0.00027570198,0.0027395994,0.00060556707,0.0017071536],"genre_scores_gemma":[0.9304032,0.00050169724,0.06568989,0.000092067254,0.00012235538,0.00043996808,0.002038748,0.000058022364,0.00065418374],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9803258,0.014172489,0.0007621115,0.0027915947,0.001486146,0.00046184874],"domain_scores_gemma":[0.835388,0.13856904,0.012803766,0.00930826,0.0029807815,0.0009501371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018502137,0.00094283966,0.0012534722,0.004098872,0.0010684177,0.0019440906,0.0014110114,0.0011564024,0.0030272764],"category_scores_gemma":[0.10354374,0.00062517833,0.0010435173,0.008013331,0.0019358774,0.003550862,0.0023693386,0.002211981,0.0006634024],"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.00084351713,0.00058366015,0.60373414,0.0009672027,0.0021493384,0.0009973118,0.0048760655,0.08445497,0.004272493,0.0696857,0.004074731,0.22336082],"study_design_scores_gemma":[0.00006355365,0.0003955029,0.22849971,0.00014548519,0.0004204257,0.00058022066,0.0019890391,0.6263122,0.0016469988,0.1352139,0.0045967125,0.00013626607],"about_ca_topic_score_codex":0.005035605,"about_ca_topic_score_gemma":0.0046834466,"teacher_disagreement_score":0.018502137,"about_ca_system_score_codex":0.0011846207,"about_ca_system_score_gemma":0.00077516865,"threshold_uncertainty_score":0.09784979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5680949,0.0019688217,0.40588644,0.0021999474,0.00005554983,0.00023093837,0.0037755982,0.00051877974,0.017269043],"genre_scores_gemma":[0.9622882,0.00065759633,0.03396107,0.00009667031,0.00006314945,0.00008581226,0.0018869726,0.000038118345,0.0009224205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992218,0.00024600019,0.000044183205,0.0001902061,0.00022164684,0.000076081895],"domain_scores_gemma":[0.99271435,0.0037589276,0.0019205004,0.00064105174,0.0005653125,0.00039974955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008279723,0.000576941,0.00046787917,0.006854056,0.00069670693,0.00201655,0.0007605723,0.00080315204,0.002091802],"category_scores_gemma":[0.007035837,0.00027868967,0.00048039726,0.0034680348,0.0014451185,0.0045409896,0.00088622235,0.00084686786,0.0002471445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012833695,0.00025912246,0.06976051,0.0005912436,0.00026238602,0.0005378397,0.001001142,0.31074968,0.007994126,0.54075056,0.006910476,0.061054535],"study_design_scores_gemma":[0.000016013379,0.00006931764,0.024593372,0.000066501474,0.00006623974,0.00062596606,0.0006978576,0.62978077,0.0016002296,0.33182406,0.010625143,0.00003456087],"about_ca_topic_score_codex":0.0023466563,"about_ca_topic_score_gemma":0.0023408106,"teacher_disagreement_score":0.006854056,"about_ca_system_score_codex":0.001489577,"about_ca_system_score_gemma":0.00061836204,"threshold_uncertainty_score":0.010807693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19432838,0.0002397476,0.7930075,0.0016645306,0.00020669175,0.00041016866,0.00011203873,0.0014419883,0.00858894],"genre_scores_gemma":[0.93820864,0.000079831836,0.055622984,0.00018197292,0.00008125435,0.0003232169,0.00003665803,0.000043890155,0.0054214974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807173,0.00076535094,0.00009361164,0.00034864302,0.00044051095,0.0002802096],"domain_scores_gemma":[0.9881362,0.005877639,0.0011982422,0.0010557052,0.002093112,0.0016392091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00474763,0.00057812786,0.00095590635,0.0009908298,0.001184756,0.001312187,0.0020883568,0.0017578756,0.0050454163],"category_scores_gemma":[0.017273696,0.00026079145,0.00042412948,0.0004850599,0.0011740973,0.0022054804,0.0019931118,0.0013169372,0.0007480447],"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.0013684441,0.0017876026,0.0089201415,0.00041828846,0.00020388619,0.00089289044,0.001577592,0.35076836,0.044852223,0.32165587,0.0128407255,0.254714],"study_design_scores_gemma":[0.00023455753,0.00030136373,0.0013514546,0.00001814349,0.000043681863,0.0001849946,0.000079233825,0.9187081,0.0027031894,0.07318931,0.0031218021,0.0000642502],"about_ca_topic_score_codex":0.0010965707,"about_ca_topic_score_gemma":0.0010846711,"teacher_disagreement_score":0.0050454163,"about_ca_system_score_codex":0.0011498793,"about_ca_system_score_gemma":0.0015950934,"threshold_uncertainty_score":0.025108159},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.477669,0.010302313,0.47227296,0.0029058654,0.00031256236,0.00024830922,0.0022720336,0.00065902,0.03335804],"genre_scores_gemma":[0.8519749,0.004131673,0.121701136,0.00024853737,0.0006172838,0.00014931404,0.0026754837,0.00015030784,0.018351238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919885,0.0002392121,0.00003538069,0.00028003126,0.0001819413,0.000064678025],"domain_scores_gemma":[0.9963883,0.002764214,0.00023495615,0.00027770756,0.0001566089,0.000178316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007280414,0.00076069706,0.00092172204,0.0027992162,0.0017273697,0.00206147,0.0013270943,0.0016287008,0.0041267187],"category_scores_gemma":[0.0064255176,0.0006881485,0.00085210736,0.0031749893,0.0007589336,0.0056516593,0.0019903195,0.0011056303,0.0012292132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007049206,0.00046573443,0.059342135,0.0015751625,0.00096090947,0.0017780531,0.004989844,0.096033335,0.014976798,0.14786287,0.043138605,0.6281716],"study_design_scores_gemma":[0.00008084371,0.00022367161,0.016988944,0.00024098514,0.00041795807,0.0025807929,0.0031835595,0.55820143,0.00633538,0.3800255,0.03162792,0.00009306812],"about_ca_topic_score_codex":0.00074390136,"about_ca_topic_score_gemma":0.0024774086,"teacher_disagreement_score":0.0041267187,"about_ca_system_score_codex":0.00039177426,"about_ca_system_score_gemma":0.00017623373,"threshold_uncertainty_score":0.01380527},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50477266,0.005224,0.46504748,0.0012219482,0.00014446599,0.0004784538,0.0025690303,0.00081947714,0.01972244],"genre_scores_gemma":[0.8903675,0.0014672201,0.1012888,0.00010484349,0.00014394263,0.00024487145,0.0026088827,0.00007576654,0.003698223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954413,0.001197274,0.0004947854,0.0012376349,0.001356618,0.00027231564],"domain_scores_gemma":[0.98673743,0.007905647,0.0018762861,0.0012981653,0.0013928682,0.000789659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023715205,0.00044841046,0.0014828693,0.011722047,0.0018223077,0.005234455,0.0016453407,0.0018166458,0.003279817],"category_scores_gemma":[0.028001051,0.0004561552,0.0010426954,0.012344614,0.0025083858,0.01216461,0.004272413,0.00082464755,0.00076162844],"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.0005024021,0.00019792533,0.036215935,0.0012252197,0.00026044113,0.0009244207,0.004741222,0.087879,0.0034687337,0.6711382,0.007116953,0.18632951],"study_design_scores_gemma":[0.000049323324,0.0001746359,0.011568116,0.00016827276,0.00013623259,0.0011203655,0.0019937218,0.34649578,0.0025281603,0.6206335,0.0150492415,0.000082740655],"about_ca_topic_score_codex":0.003916354,"about_ca_topic_score_gemma":0.0026634298,"teacher_disagreement_score":0.011722047,"about_ca_system_score_codex":0.00239067,"about_ca_system_score_gemma":0.0007473913,"threshold_uncertainty_score":0.017345607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82672375,0.0011977492,0.15130176,0.0012299205,0.0000464443,0.0000512098,0.00017446045,0.00064104353,0.018633734],"genre_scores_gemma":[0.99548495,0.00023768403,0.0035312644,0.000050709186,0.00003075685,0.000025491516,0.00002956577,0.000029391078,0.00058017485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994017,0.00023287271,0.00001953363,0.00009007837,0.00014312215,0.00011272034],"domain_scores_gemma":[0.99694127,0.0016178325,0.0006237904,0.00038187328,0.00018293147,0.00025222238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081801385,0.00025801526,0.000464551,0.0011342105,0.00072871405,0.0014935973,0.0007991353,0.00077169534,0.0011524579],"category_scores_gemma":[0.005203725,0.0003168254,0.00046969074,0.0006308387,0.0028348174,0.0018977517,0.0010800286,0.0008564191,0.00011836194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060933944,0.000046341338,0.003155406,0.00011501531,0.00003290951,0.00032222376,0.00042415847,0.03497572,0.008753039,0.9453932,0.001368977,0.005352133],"study_design_scores_gemma":[0.00002327721,0.000025417112,0.0034102849,0.000022211865,0.000014926127,0.00030034958,0.00013612607,0.29241642,0.0017087033,0.7008541,0.0010584795,0.000029686242],"about_ca_topic_score_codex":0.0013349907,"about_ca_topic_score_gemma":0.0010270806,"teacher_disagreement_score":0.0014935973,"about_ca_system_score_codex":0.00082802074,"about_ca_system_score_gemma":0.00032618878,"threshold_uncertainty_score":0.0060077906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8843655,0.0002015183,0.11116954,0.0005157414,0.000045047647,0.00011744396,0.00057058304,0.00017578767,0.002838842],"genre_scores_gemma":[0.9948695,0.00007232998,0.003928562,0.0000488259,0.0000500687,0.00006599054,0.00052612874,0.000026170886,0.00041244033],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960998,0.0017373487,0.00021469571,0.0008629247,0.0007107892,0.00037441257],"domain_scores_gemma":[0.9090628,0.06963585,0.006590163,0.008067024,0.0053478866,0.0012962688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0089838365,0.00043677763,0.0005860952,0.001666503,0.0005622097,0.0015014047,0.0011248742,0.0010109171,0.001640672],"category_scores_gemma":[0.07355665,0.00033346057,0.00040920413,0.0011465516,0.0011250066,0.0036361231,0.001122938,0.0014095798,0.00037714647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017790264,0.00094428065,0.5749739,0.0003767562,0.00057113485,0.0012268289,0.004292144,0.20211838,0.027119821,0.07655178,0.005288308,0.10475766],"study_design_scores_gemma":[0.000032922144,0.0004379091,0.10540848,0.000042867665,0.000069141475,0.00080109463,0.0014219676,0.8425772,0.005835579,0.041679267,0.0016250705,0.00006844173],"about_ca_topic_score_codex":0.0018910554,"about_ca_topic_score_gemma":0.0012905649,"teacher_disagreement_score":0.0089838365,"about_ca_system_score_codex":0.000958285,"about_ca_system_score_gemma":0.0005277462,"threshold_uncertainty_score":0.047511637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7547627,0.0006748983,0.23791888,0.0010420859,0.000031315605,0.00028098538,0.002983429,0.00028863392,0.002017042],"genre_scores_gemma":[0.91286653,0.00022488646,0.08356064,0.00004924225,0.000032822438,0.00010634754,0.002510816,0.000040904084,0.00060780236],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692255,0.0016789376,0.00011700932,0.00069044356,0.00037647935,0.00021448344],"domain_scores_gemma":[0.9706597,0.021427684,0.003142231,0.0018899733,0.001962175,0.0009182989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058631287,0.0006296413,0.00079970853,0.0062233536,0.001983153,0.0022878991,0.0017288836,0.0016028779,0.0011354495],"category_scores_gemma":[0.04712393,0.0005092206,0.0008420391,0.007129798,0.0014332782,0.003500638,0.0022599667,0.0023113042,0.00029976634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057985296,0.00029826304,0.45023224,0.0003740604,0.0005881988,0.0007589384,0.0051633874,0.38319886,0.0028375213,0.03984214,0.0047512264,0.11137525],"study_design_scores_gemma":[0.000029205576,0.00004008646,0.048302356,0.000053923508,0.000051060615,0.00014432329,0.0012277019,0.9115928,0.0008313394,0.035398208,0.0022836581,0.000045372304],"about_ca_topic_score_codex":0.1335303,"about_ca_topic_score_gemma":0.11127223,"teacher_disagreement_score":0.1335303,"about_ca_system_score_codex":0.0033085144,"about_ca_system_score_gemma":0.001837471,"threshold_uncertainty_score":0.26550615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0143708335,0.2074855,0.3137269,0.19270295,0.006534073,0.0004706394,0.005721299,0.0013714405,0.25761634],"genre_scores_gemma":[0.54572266,0.18515003,0.14810659,0.01783687,0.015830452,0.001543712,0.0066323,0.00039459238,0.07878273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950187,0.002217646,0.0003792981,0.00088668877,0.001269956,0.00022766428],"domain_scores_gemma":[0.98548,0.009167422,0.0014591044,0.0017587062,0.0012558866,0.00087890204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004544703,0.0007897053,0.001382511,0.005541439,0.0030674108,0.012180155,0.001398916,0.0033561622,0.015451986],"category_scores_gemma":[0.017935008,0.0006090332,0.00078636064,0.009420026,0.0060496205,0.015096021,0.0049637402,0.0036236164,0.0031586948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009948603,0.000011037302,0.0005638112,0.00023550904,0.000033195425,0.000088510664,0.00054387224,0.0009352215,0.000087475986,0.9359261,0.02659431,0.03497102],"study_design_scores_gemma":[0.000007651864,0.000009603575,0.0003831451,0.00014256986,0.000010789602,0.00016727981,0.00035252777,0.0018647696,0.000060351584,0.799528,0.19745845,0.000014855341],"about_ca_topic_score_codex":0.0029389118,"about_ca_topic_score_gemma":0.0022216325,"teacher_disagreement_score":0.015451986,"about_ca_system_score_codex":0.0029346086,"about_ca_system_score_gemma":0.0021404843,"threshold_uncertainty_score":0.05169207},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08894153,0.003356367,0.78670263,0.01668157,0.0019397255,0.00023611328,0.0011791757,0.0015694111,0.09939342],"genre_scores_gemma":[0.5852064,0.0040984834,0.36000788,0.003185365,0.000738334,0.00034191585,0.001760706,0.0015857472,0.043075114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896944,0.0003002204,0.000055801273,0.0002924765,0.00027120224,0.0001109106],"domain_scores_gemma":[0.9951201,0.0023795122,0.00029694376,0.0011555825,0.0006661823,0.00038160416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012440473,0.0004556984,0.0005273278,0.0010836043,0.0014561178,0.0029581813,0.0012378402,0.0018931491,0.016189719],"category_scores_gemma":[0.01198209,0.00043078847,0.00070354895,0.0010096484,0.0024802904,0.0076667923,0.001616566,0.0020922548,0.0028267752],"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.000065998385,0.000046435445,0.0010921794,0.00023477005,0.000038717724,0.00014035281,0.0003324482,0.026086882,0.003168959,0.86112463,0.021479161,0.0861895],"study_design_scores_gemma":[0.000014403692,0.000029254405,0.00029754243,0.0000917092,0.000017256792,0.00024748972,0.0002703745,0.05424306,0.0016716976,0.90354496,0.039547388,0.000024802097],"about_ca_topic_score_codex":0.002148984,"about_ca_topic_score_gemma":0.002200538,"teacher_disagreement_score":0.016189719,"about_ca_system_score_codex":0.0008310383,"about_ca_system_score_gemma":0.00083064317,"threshold_uncertainty_score":0.05416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05955545,0.003655235,0.88943017,0.0061387327,0.0004853556,0.00024247664,0.000996398,0.00089149486,0.038604766],"genre_scores_gemma":[0.88012505,0.0049915877,0.051157806,0.0011063116,0.0016605954,0.0009613969,0.0009806324,0.00061882223,0.058397934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962525,0.0017597983,0.00015901524,0.00054412463,0.0006689029,0.00061576633],"domain_scores_gemma":[0.9689435,0.024989711,0.0014694869,0.0014496827,0.0017235673,0.0014239936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060111037,0.0020258056,0.0047780173,0.003503743,0.0020254278,0.0062975213,0.008323451,0.0065037976,0.018303461],"category_scores_gemma":[0.036889408,0.0017862049,0.0024357326,0.003935351,0.005215693,0.012653833,0.0032529025,0.0062669413,0.0026458837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065188346,0.00005932297,0.00044536166,0.00013491722,0.000054831933,0.00007442641,0.00026633355,0.095637105,0.0002720949,0.8913303,0.0061537595,0.005506455],"study_design_scores_gemma":[0.000026619895,0.000012492507,0.00012144078,0.000020680172,0.000021734379,0.000031459127,0.00005133047,0.46898878,0.00004427513,0.52972364,0.000938083,0.000019466674],"about_ca_topic_score_codex":0.010654225,"about_ca_topic_score_gemma":0.008505534,"teacher_disagreement_score":0.018303461,"about_ca_system_score_codex":0.005282579,"about_ca_system_score_gemma":0.0017476287,"threshold_uncertainty_score":0.061231136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1557172,0.0012410533,0.8174628,0.0016172314,0.00012766862,0.00010126801,0.00021986867,0.0002339854,0.023278935],"genre_scores_gemma":[0.93298864,0.0017547345,0.050036598,0.0002890783,0.00010527975,0.00020752383,0.00017841352,0.00013572235,0.014304022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941194,0.00015697004,0.000029301586,0.000121165474,0.00017378679,0.00010682858],"domain_scores_gemma":[0.99671835,0.0019059798,0.0004510004,0.00022601576,0.00045190885,0.0002467513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016880085,0.00065927464,0.00063575816,0.0011654323,0.00071301113,0.0013680441,0.0013808623,0.001520628,0.002543053],"category_scores_gemma":[0.014792954,0.00043975888,0.00096117676,0.00069782423,0.0019773995,0.0038249595,0.0014689331,0.0016321547,0.00040453605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046068766,0.00003101009,0.0014507523,0.00009160715,0.000018684605,0.00035057502,0.00034501613,0.42222926,0.0036465842,0.5624883,0.0016330593,0.007669113],"study_design_scores_gemma":[0.000010014237,0.000014118177,0.00044818848,0.000020914997,0.000008408877,0.00015775919,0.000076097924,0.900802,0.00061537296,0.0966494,0.0011799987,0.000017788898],"about_ca_topic_score_codex":0.0043687825,"about_ca_topic_score_gemma":0.003011351,"teacher_disagreement_score":0.0043687825,"about_ca_system_score_codex":0.0022111265,"about_ca_system_score_gemma":0.0009272961,"threshold_uncertainty_score":0.016042888},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2403028,0.0013948487,0.729624,0.005775511,0.00007222784,0.00009137448,0.00081941276,0.00013877462,0.021781102],"genre_scores_gemma":[0.9585286,0.0014321025,0.03410027,0.000134612,0.00021249987,0.00017969222,0.00037093167,0.000040640523,0.005000748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970222,0.0016129991,0.00010804318,0.00061693887,0.00048131176,0.00015845572],"domain_scores_gemma":[0.9454794,0.04402056,0.004776325,0.0023544976,0.0019887504,0.0013805105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043477784,0.0004449216,0.0007448001,0.0035850757,0.0017438169,0.0057500717,0.0015560996,0.0020846475,0.0039075767],"category_scores_gemma":[0.05348122,0.00089514256,0.0007079887,0.002955169,0.0056359167,0.016099475,0.0030040073,0.002499783,0.0005085849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029070448,0.00002553103,0.0019027548,0.00005820078,0.00001900322,0.00004415323,0.00092714914,0.015229112,0.00047826764,0.97322255,0.0006330409,0.0074312054],"study_design_scores_gemma":[0.000009127181,0.000009603906,0.0009625114,0.000024124216,0.000010582628,0.000041248903,0.00020743477,0.0806359,0.00013199775,0.9165603,0.0013940444,0.00001306506],"about_ca_topic_score_codex":0.0029312451,"about_ca_topic_score_gemma":0.0021805968,"teacher_disagreement_score":0.0057500717,"about_ca_system_score_codex":0.002088005,"about_ca_system_score_gemma":0.001245899,"threshold_uncertainty_score":0.022993505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008145013,0.0002674048,0.9877773,0.00017787857,0.00009961976,0.00010054013,0.00041753516,0.00036152164,0.002653075],"genre_scores_gemma":[0.28465688,0.0011260203,0.6992731,0.00029537882,0.000885782,0.0008010708,0.0012223768,0.00030141426,0.011438007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989913,0.0003281134,0.000047442412,0.00027887468,0.00027177908,0.000082550534],"domain_scores_gemma":[0.9978046,0.0012957926,0.00019569139,0.0003154225,0.00026855426,0.000119978395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010565313,0.0009075458,0.0011526544,0.0040334202,0.0009013299,0.0021724973,0.0013899555,0.0012601201,0.0029011997],"category_scores_gemma":[0.0052061146,0.00041446148,0.0012433685,0.0036629029,0.00090559456,0.0027873802,0.0017706571,0.0013177312,0.001211007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019641528,0.0007072225,0.01206186,0.0005991179,0.00056722213,0.0006162045,0.0018945009,0.09301592,0.029587457,0.43216667,0.013897959,0.4146894],"study_design_scores_gemma":[0.00001735181,0.00006560769,0.0032787696,0.000029862129,0.00006201916,0.00026551483,0.00025752772,0.82865703,0.0015160817,0.15834439,0.0074570407,0.000048725098],"about_ca_topic_score_codex":0.0030794248,"about_ca_topic_score_gemma":0.0037647071,"teacher_disagreement_score":0.0040334202,"about_ca_system_score_codex":0.00063957256,"about_ca_system_score_gemma":0.00079183665,"threshold_uncertainty_score":0.009705484},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037903223,0.0027433564,0.9470789,0.0004269274,0.00009361957,0.0001376276,0.00067355845,0.00094418874,0.009998682],"genre_scores_gemma":[0.30530933,0.0028334237,0.6740571,0.000121958095,0.00022081946,0.00021797957,0.002132887,0.00028158256,0.014824794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999495,0.000104776234,0.000020984624,0.00015398789,0.00019380609,0.00003136268],"domain_scores_gemma":[0.99843055,0.0011045447,0.00012555433,0.00014553728,0.00014252306,0.00005132108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055929547,0.00077667995,0.0005817758,0.0032358172,0.00064372976,0.0013539244,0.0010452489,0.0008272278,0.0026705754],"category_scores_gemma":[0.0034951847,0.00044767864,0.00067639345,0.0023151701,0.0005745236,0.0031168791,0.0011630607,0.0008322202,0.0012216165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012027205,0.00020736227,0.010008296,0.0007800749,0.0002233356,0.00034585816,0.0009178301,0.057492632,0.02593987,0.05370782,0.017187292,0.8330693],"study_design_scores_gemma":[0.000019852323,0.00008461697,0.008796731,0.00015714795,0.00013967673,0.0010153442,0.0006221386,0.771286,0.015910715,0.17408428,0.027820623,0.000062814026],"about_ca_topic_score_codex":0.0012709916,"about_ca_topic_score_gemma":0.003345871,"teacher_disagreement_score":0.0032358172,"about_ca_system_score_codex":0.0004059544,"about_ca_system_score_gemma":0.00025787312,"threshold_uncertainty_score":0.008934021},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31843132,0.013188028,0.5895515,0.03285206,0.0015072183,0.00031783507,0.0066415276,0.0006139447,0.03689658],"genre_scores_gemma":[0.9150881,0.012104277,0.047235936,0.0009427441,0.0010752879,0.00051364815,0.0014549969,0.00008680179,0.021498239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992686,0.00044733347,0.00002669402,0.00011772215,0.000063817184,0.00007585102],"domain_scores_gemma":[0.99467564,0.004391278,0.00041462661,0.00015689325,0.00018737913,0.00017416471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019426644,0.0010106657,0.0010830066,0.0015956501,0.0005689209,0.0022715654,0.0016524777,0.0031536373,0.0039260183],"category_scores_gemma":[0.010281147,0.0007450979,0.0010635256,0.0020644993,0.0009665092,0.0032909345,0.0012377057,0.0021053297,0.0005332314],"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.000064679894,0.00019237943,0.022657054,0.00017413829,0.00032391245,0.00021587164,0.0005510899,0.76390415,0.00022245878,0.16960135,0.008186659,0.033906154],"study_design_scores_gemma":[0.000022185512,0.000040379302,0.0027576317,0.000045183828,0.0000784525,0.00009666447,0.00020201245,0.8657086,0.000059986345,0.12755527,0.0034086825,0.000024911176],"about_ca_topic_score_codex":0.029823031,"about_ca_topic_score_gemma":0.024540026,"teacher_disagreement_score":0.029823031,"about_ca_system_score_codex":0.0014476673,"about_ca_system_score_gemma":0.0013609689,"threshold_uncertainty_score":0.059298873},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29054883,0.0020267,0.6242801,0.0030865544,0.00020954739,0.00015035372,0.0018406875,0.0004941908,0.07736306],"genre_scores_gemma":[0.8793626,0.00083685626,0.10698761,0.0006006137,0.00039741627,0.00023100071,0.0013492547,0.00020026672,0.010034392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992235,0.0002850363,0.00005448809,0.00019521311,0.00016884203,0.0000730207],"domain_scores_gemma":[0.9964393,0.0021862409,0.00043936577,0.00024224822,0.00045184267,0.00024094436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010073435,0.00042629606,0.00041381243,0.0027763322,0.0012998421,0.0027301994,0.00087137276,0.0009498613,0.0058732843],"category_scores_gemma":[0.0058343024,0.0003686719,0.00084779836,0.0017803438,0.0022809706,0.0061655287,0.0010645717,0.0012407835,0.0005859003],"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.000008201471,0.00000966128,0.0003339142,0.00003692139,0.0000069494413,0.000086092725,0.0002876476,0.0014060795,0.00075338845,0.9932167,0.00074989797,0.00310453],"study_design_scores_gemma":[0.0000049966943,0.000010851028,0.00041673228,0.000024206178,0.000010902163,0.00013520604,0.00013112844,0.01573672,0.00028689308,0.9795252,0.0037057977,0.000011348734],"about_ca_topic_score_codex":0.00087111664,"about_ca_topic_score_gemma":0.0008343431,"teacher_disagreement_score":0.0058732843,"about_ca_system_score_codex":0.0012655063,"about_ca_system_score_gemma":0.00043923812,"threshold_uncertainty_score":0.019648135},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005322654,0.006231103,0.6211326,0.004574884,0.0015024269,0.00038006477,0.0043572206,0.0022909844,0.35420796],"genre_scores_gemma":[0.12090572,0.013355561,0.3465655,0.0015001624,0.002103007,0.0008629176,0.010589763,0.0012097607,0.5029077],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992162,0.0002093513,0.000027650649,0.00018347152,0.00032052092,0.000042806685],"domain_scores_gemma":[0.99887925,0.00054941856,0.000054649972,0.00020417786,0.00026342642,0.00004914965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009598329,0.000881216,0.0004894954,0.0039427187,0.000990204,0.0025785964,0.0007676807,0.00070987636,0.032292698],"category_scores_gemma":[0.0035153865,0.0003280828,0.00065218157,0.0034718616,0.0006753075,0.002829353,0.0014602593,0.0010823945,0.015081536],"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.000012653493,0.00004630584,0.0010911641,0.00023780302,0.00005406065,0.00006410832,0.00035536048,0.0054924767,0.00088517444,0.29947045,0.16721705,0.5250734],"study_design_scores_gemma":[0.0000042230195,0.000016124375,0.0023429485,0.00019917927,0.00003392109,0.00025105668,0.0004073583,0.041199982,0.0013875448,0.3701899,0.58393705,0.000030734886],"about_ca_topic_score_codex":0.0025666396,"about_ca_topic_score_gemma":0.0039764205,"teacher_disagreement_score":0.032292698,"about_ca_system_score_codex":0.0011202652,"about_ca_system_score_gemma":0.00089461566,"threshold_uncertainty_score":0.10802984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12199178,0.007812934,0.8530578,0.0036638153,0.00026436083,0.0003915172,0.0018376698,0.000782878,0.010197211],"genre_scores_gemma":[0.72136956,0.0037176006,0.26828748,0.00022836697,0.0005136959,0.0006167238,0.00260336,0.000105187995,0.0025580546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602425,0.0022118601,0.00025076317,0.00063745776,0.0007484171,0.00012725087],"domain_scores_gemma":[0.97266114,0.02409297,0.0014049052,0.0008525278,0.000785321,0.0002032397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004736904,0.0009047471,0.0011497495,0.006529756,0.0011847144,0.0035126216,0.0013421567,0.0010394572,0.002373665],"category_scores_gemma":[0.02485495,0.00034631995,0.0013103492,0.004419385,0.0016046237,0.0055129956,0.0019329232,0.0014060603,0.00059877866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029084744,0.00038369317,0.026266884,0.0028564048,0.0014043937,0.00095951156,0.006645098,0.2545664,0.0053675966,0.28222224,0.011519982,0.40751702],"study_design_scores_gemma":[0.00000955719,0.000024646166,0.0039547,0.00010052428,0.000075290925,0.00010447548,0.000668088,0.8385562,0.00082808814,0.1507269,0.004910765,0.000040755705],"about_ca_topic_score_codex":0.0027953815,"about_ca_topic_score_gemma":0.002469512,"teacher_disagreement_score":0.006529756,"about_ca_system_score_codex":0.0012687178,"about_ca_system_score_gemma":0.0011866303,"threshold_uncertainty_score":0.025051415},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17219968,0.002664414,0.7627835,0.0041693216,0.00013164138,0.000085112646,0.00036166064,0.0003063464,0.057298385],"genre_scores_gemma":[0.94239545,0.0013007479,0.05162038,0.000305586,0.00013940495,0.00007075805,0.00011859217,0.00003217043,0.004016797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994549,0.0001736117,0.00002412854,0.00014143852,0.00016205989,0.000043806005],"domain_scores_gemma":[0.9971578,0.0014915948,0.00045157468,0.00041402006,0.00028337407,0.00020164356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009769055,0.00021763239,0.00031039174,0.001063135,0.00070191245,0.0022146474,0.0005530371,0.0008687315,0.0021529347],"category_scores_gemma":[0.0057008374,0.00035897642,0.00038194092,0.00080188183,0.002285113,0.0032849025,0.0010062505,0.0013671266,0.00019807935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006598728,0.0000039030865,0.00068204704,0.00003923038,0.000011952183,0.00008916281,0.0002486481,0.011696649,0.0012131422,0.9799871,0.0007525646,0.005269104],"study_design_scores_gemma":[0.0000068762765,0.000008411133,0.0011444264,0.000015491376,0.0000113552305,0.00016706946,0.00005106286,0.0788922,0.00032588866,0.9148003,0.0045667244,0.000010226322],"about_ca_topic_score_codex":0.0016054048,"about_ca_topic_score_gemma":0.0012925171,"teacher_disagreement_score":0.0022146474,"about_ca_system_score_codex":0.0009929087,"about_ca_system_score_gemma":0.00035073038,"threshold_uncertainty_score":0.0072041154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4131357,0.003754244,0.5589286,0.0011092625,0.00012341405,0.000036211517,0.0002665122,0.000355833,0.02229024],"genre_scores_gemma":[0.96430826,0.0017967544,0.026023809,0.00008879302,0.00014086641,0.00004152899,0.00011365295,0.00006231862,0.007424063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973184,0.00008524385,0.000010229394,0.00006949841,0.000065521745,0.00003759276],"domain_scores_gemma":[0.9963708,0.0026138492,0.00037823425,0.00022187183,0.00025101218,0.00016438657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078221614,0.0003476647,0.00039937088,0.0009043304,0.00049071986,0.001378178,0.00089762366,0.00063222245,0.0014516127],"category_scores_gemma":[0.0073531177,0.00042251492,0.00026360853,0.0010236977,0.0007989933,0.0023863441,0.0008557629,0.0009692573,0.00020531441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013436982,0.00004325216,0.0038104975,0.00014792554,0.00006912071,0.00033069775,0.00048626465,0.30889797,0.009487128,0.6149636,0.0034962257,0.058132984],"study_design_scores_gemma":[0.000004459269,0.000014732573,0.0013554173,0.000016876036,0.000024107821,0.0001248909,0.00005767705,0.7499364,0.0013999941,0.24544483,0.0016035726,0.00001703804],"about_ca_topic_score_codex":0.00089252414,"about_ca_topic_score_gemma":0.0012649659,"teacher_disagreement_score":0.0014516127,"about_ca_system_score_codex":0.00076670473,"about_ca_system_score_gemma":0.0002121419,"threshold_uncertainty_score":0.0055629015},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068021645,0.007875624,0.10079852,0.09610492,0.010222321,0.00030192366,0.0018867367,0.00380033,0.7722074],"genre_scores_gemma":[0.16759361,0.012841973,0.08290876,0.05036479,0.008208821,0.00055760937,0.0036251063,0.0055561457,0.6683431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939772,0.0014695416,0.00033902176,0.0017228969,0.0019692807,0.0005219832],"domain_scores_gemma":[0.9923179,0.0019660403,0.00047419837,0.003063273,0.0014387721,0.0007397174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004833234,0.0017825874,0.0013726164,0.0027264694,0.0041361437,0.010464513,0.002834327,0.004021485,0.26175097],"category_scores_gemma":[0.019687796,0.0006820217,0.0014706153,0.0027619675,0.0060283225,0.024360886,0.008333485,0.0050358768,0.10230602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012865769,0.00010325088,0.00075756427,0.00045053597,0.000057173726,0.00025812068,0.0013838933,0.0008297442,0.0009832969,0.5948128,0.21066466,0.1895703],"study_design_scores_gemma":[0.000023665858,0.000033367432,0.00028614126,0.00017849718,0.000022005386,0.00021639495,0.00056419434,0.0007085851,0.00032008643,0.15774533,0.83987236,0.000029389761],"about_ca_topic_score_codex":0.004317719,"about_ca_topic_score_gemma":0.004596435,"teacher_disagreement_score":0.26175097,"about_ca_system_score_codex":0.0031222606,"about_ca_system_score_gemma":0.0030796488,"threshold_uncertainty_score":0.8756442},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017756982,0.006058571,0.003336217,0.18428059,0.74664295,0.00052780553,0.0013557139,0.001001928,0.055020608],"genre_scores_gemma":[0.013438141,0.006928707,0.0053408,0.07447852,0.23261417,0.001590835,0.0023680893,0.0018213913,0.6614194],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.990737,0.0018392738,0.00037247836,0.0013165504,0.0041470896,0.0015875171],"domain_scores_gemma":[0.9635168,0.0006284847,0.00092461426,0.0006899586,0.011864851,0.022375347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012886905,0.002545128,0.0016616856,0.0020214578,0.004633275,0.013522687,0.0018606377,0.0059090494,0.1216494],"category_scores_gemma":[0.013403419,0.0007756977,0.001943284,0.0012544325,0.0013230231,0.004635976,0.0074732425,0.010178326,0.10429359],"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.000052214822,0.000047458332,0.00015249857,0.00005476034,0.000004041551,0.00007397883,0.00006872718,0.000041997624,0.000271736,0.0009581829,0.9837949,0.014479421],"study_design_scores_gemma":[0.000017823093,0.000058072943,0.00038048046,0.00008845495,0.000005383779,0.0000575494,0.00026881197,0.000078540914,0.00012002209,0.0007132686,0.9981937,0.000017895394],"about_ca_topic_score_codex":0.0017189942,"about_ca_topic_score_gemma":0.0048641735,"teacher_disagreement_score":0.1216494,"about_ca_system_score_codex":0.0029736494,"about_ca_system_score_gemma":0.01024833,"threshold_uncertainty_score":0.4069578},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86744046,0.0006057931,0.12282444,0.0006699119,0.000045839846,0.000031557614,0.00006080965,0.00016867823,0.008152563],"genre_scores_gemma":[0.99178207,0.00030380464,0.0067401975,0.00007279583,0.000021449054,0.0000189006,0.00001986911,0.000019614905,0.001021393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996146,0.00012353505,0.000016466645,0.000091953465,0.00006752566,0.000085820146],"domain_scores_gemma":[0.99810743,0.0008461408,0.00058416656,0.00025420805,0.000058648846,0.00014927826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004484186,0.0006184955,0.00053924957,0.00064588315,0.0006208988,0.0014508103,0.0010004868,0.001368108,0.0014849938],"category_scores_gemma":[0.003900436,0.0005753236,0.0006696535,0.0005050568,0.002170113,0.0025893755,0.001672462,0.0014563383,0.00021621809],"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.0004110397,0.00035878716,0.0036849142,0.0002773522,0.00029728957,0.0015131203,0.0009356332,0.5250633,0.05953282,0.39107743,0.0013331576,0.015515141],"study_design_scores_gemma":[0.00020449764,0.00027805392,0.0024526836,0.000046891,0.00016381247,0.0005051422,0.00025368662,0.68815047,0.009868718,0.29397905,0.004016285,0.00008070144],"about_ca_topic_score_codex":0.0007284599,"about_ca_topic_score_gemma":0.00075191015,"teacher_disagreement_score":0.0014849938,"about_ca_system_score_codex":0.0004725489,"about_ca_system_score_gemma":0.00021689782,"threshold_uncertainty_score":0.0049678087},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5878258,0.003015495,0.2761312,0.0070054047,0.0004587236,0.0006294834,0.05637723,0.0016084765,0.0669481],"genre_scores_gemma":[0.8778556,0.0011971504,0.09350664,0.000275286,0.00025087388,0.00029723338,0.020624014,0.000093716924,0.005899567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989549,0.00030915008,0.00009053414,0.000257338,0.00031934283,0.00006865289],"domain_scores_gemma":[0.9970343,0.001475145,0.00044561195,0.00022669084,0.00056386204,0.00025439454],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0009221393,0.00030858803,0.00030337257,0.007768045,0.0013835666,0.002239551,0.0007782391,0.0011822849,0.0036492348],"category_scores_gemma":[0.0057145488,0.00027496723,0.0005408342,0.009112233,0.00063114177,0.005829113,0.0013605439,0.00051145727,0.0009785537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010866359,0.00056565105,0.14696404,0.0013003884,0.00043408558,0.0021413236,0.009499291,0.059277132,0.01291947,0.4281731,0.07335241,0.26428643],"study_design_scores_gemma":[0.000085854845,0.00018341192,0.072535515,0.0003006431,0.0003464077,0.0015736198,0.0063160635,0.40434936,0.003373111,0.36875784,0.14203167,0.00014661449],"about_ca_topic_score_codex":0.006885854,"about_ca_topic_score_gemma":0.013694662,"teacher_disagreement_score":0.99223197,"about_ca_system_score_codex":0.00087911607,"about_ca_system_score_gemma":0.00083746103,"threshold_uncertainty_score":0.0136915445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09272704,0.0009488249,0.7885523,0.0057977745,0.00042276704,0.00019367575,0.0027901533,0.002694745,0.10587274],"genre_scores_gemma":[0.7762015,0.0013643684,0.12610205,0.0014881201,0.00050082145,0.00026706935,0.005553404,0.0009809004,0.08754172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936396,0.00023673433,0.000021831971,0.00021250863,0.00010826844,0.00005669656],"domain_scores_gemma":[0.99401206,0.0032053683,0.00046927406,0.0014138588,0.0006417918,0.00025767466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006617744,0.00055894325,0.0004379383,0.0021110354,0.0010493521,0.0019456355,0.0008564705,0.0017611169,0.029611118],"category_scores_gemma":[0.008602639,0.00051799876,0.0008022889,0.0015604782,0.00091662107,0.004537051,0.0014512249,0.0016114655,0.0029872565],"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.00003513315,0.000041280513,0.0012498533,0.000088908964,0.000033599987,0.00014486408,0.0003224476,0.014174935,0.0009406859,0.93854046,0.016969634,0.02745818],"study_design_scores_gemma":[0.000014367996,0.000010523425,0.0005905795,0.00002874571,0.000023460154,0.00014984165,0.00009911506,0.052958142,0.00080553704,0.92298764,0.02231942,0.000012599624],"about_ca_topic_score_codex":0.0012693168,"about_ca_topic_score_gemma":0.0012126178,"teacher_disagreement_score":0.029611118,"about_ca_system_score_codex":0.000646073,"about_ca_system_score_gemma":0.00042511593,"threshold_uncertainty_score":0.099059045},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087064214,0.041101404,0.8874607,0.008057689,0.0022811857,0.00026718777,0.0010917039,0.000714063,0.058155447],"genre_scores_gemma":[0.07952081,0.11123352,0.7267684,0.006184073,0.007591281,0.003628574,0.0031532105,0.0009940244,0.060926117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99395156,0.0029674529,0.00035791955,0.0006812094,0.0018539473,0.00018789602],"domain_scores_gemma":[0.9920968,0.0059793633,0.00032540763,0.0007972556,0.00065761484,0.00014371872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052255443,0.0023365794,0.002049881,0.0043959892,0.0012350702,0.0040344223,0.0024227328,0.003110673,0.011234047],"category_scores_gemma":[0.0133785475,0.00087959785,0.0018586409,0.005473675,0.0034638133,0.005319805,0.0025454115,0.0052762986,0.006941067],"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.0000057609964,0.000029282379,0.00020514155,0.0004159145,0.000073302035,0.000087124645,0.00023949261,0.009720111,0.000118071686,0.89108044,0.04422392,0.053801507],"study_design_scores_gemma":[0.000006026486,0.000007786984,0.00008911451,0.00015334212,0.000012241535,0.00006734753,0.00005049636,0.011455834,0.000054501314,0.89273506,0.09535178,0.000016516204],"about_ca_topic_score_codex":0.0037832016,"about_ca_topic_score_gemma":0.0026577762,"teacher_disagreement_score":0.011234047,"about_ca_system_score_codex":0.0026735275,"about_ca_system_score_gemma":0.0029599792,"threshold_uncertainty_score":0.037581623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9155204,0.00016813913,0.079584524,0.00017308148,0.000033376666,0.000024484696,0.000023104,0.00013515603,0.0043376763],"genre_scores_gemma":[0.9976463,0.00005766503,0.002000595,0.000014770747,0.000005444664,0.000002738671,0.000005373406,0.0000058632563,0.00026126753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997117,0.00010250835,0.000010729282,0.000027338203,0.00007206037,0.00007561577],"domain_scores_gemma":[0.99747604,0.0012032354,0.0006622085,0.00020541769,0.00028888145,0.0001642879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004903329,0.00030480124,0.00028521783,0.0003840696,0.00032071752,0.0005263955,0.0003465482,0.0003741411,0.00046660515],"category_scores_gemma":[0.004618284,0.00012567033,0.00019873485,0.0002408304,0.0007984392,0.00043668415,0.00044569594,0.00032192355,0.00009481674],"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.00032471618,0.000117363285,0.007253037,0.00007152945,0.000044179822,0.0005812841,0.0004050435,0.8238772,0.051021017,0.073579594,0.0009490687,0.04177598],"study_design_scores_gemma":[0.000012475663,0.000119089316,0.0012788178,0.0000072453577,0.000011584455,0.00013886407,0.000059899863,0.9772061,0.00813421,0.012557347,0.0004627381,0.000011609019],"about_ca_topic_score_codex":0.0011817298,"about_ca_topic_score_gemma":0.00058660796,"teacher_disagreement_score":0.0011817298,"about_ca_system_score_codex":0.0006002554,"about_ca_system_score_gemma":0.0003496875,"threshold_uncertainty_score":0.0043551326},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071252906,0.033557158,0.82128036,0.024338923,0.0152544025,0.0010954136,0.0066027674,0.004676904,0.0860687],"genre_scores_gemma":[0.10480976,0.034824178,0.69004524,0.0060457843,0.00748723,0.00286993,0.028335342,0.004003811,0.121578746],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9922774,0.0035601007,0.00075637276,0.0013174617,0.0016888881,0.0003997493],"domain_scores_gemma":[0.98880196,0.0056221182,0.0003338185,0.0025758005,0.0018981147,0.00076821976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011400048,0.0026049602,0.0021962475,0.0028616267,0.0015880171,0.009135473,0.004826102,0.00355675,0.03710483],"category_scores_gemma":[0.021893153,0.0014003163,0.0046217004,0.0026672347,0.0019424481,0.010454302,0.0059627215,0.0050516366,0.011084913],"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.0003487325,0.0004583528,0.0029738133,0.0016208343,0.00061196863,0.00071988185,0.002095424,0.035303224,0.0020376684,0.272923,0.3577511,0.32315615],"study_design_scores_gemma":[0.0000660402,0.00008548013,0.00095985114,0.00084057794,0.0001407756,0.00030270533,0.0004137077,0.05202348,0.0011652786,0.18319692,0.7607128,0.000092378206],"about_ca_topic_score_codex":0.007847818,"about_ca_topic_score_gemma":0.006466522,"teacher_disagreement_score":0.03710483,"about_ca_system_score_codex":0.0027932953,"about_ca_system_score_gemma":0.0032258816,"threshold_uncertainty_score":0.124127984},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36603224,0.0006926083,0.6236262,0.0020602953,0.000050179242,0.00042712557,0.0019222366,0.0002851939,0.0049038967],"genre_scores_gemma":[0.8723036,0.00030690705,0.12473763,0.00007635696,0.000040256757,0.00040069857,0.0013223438,0.000023817447,0.00078838336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621814,0.0022383279,0.00019621475,0.0005571575,0.00060473103,0.00018546772],"domain_scores_gemma":[0.9698693,0.025089957,0.0022906556,0.0014515269,0.0008784415,0.0004201072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048482274,0.00068448373,0.00076451054,0.005231069,0.0011083273,0.002717865,0.0016861943,0.0016728027,0.0012820195],"category_scores_gemma":[0.033502176,0.00049757713,0.0006919968,0.0039077974,0.0014039543,0.005516636,0.0020307822,0.0014938797,0.00032424353],"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.00033133608,0.0006142399,0.0772534,0.000666037,0.0003232492,0.0006569138,0.004087977,0.6466668,0.0016879995,0.10901743,0.0028177227,0.15587693],"study_design_scores_gemma":[0.000016205788,0.000038096267,0.004822249,0.000059372458,0.000029001352,0.00007831613,0.0005804618,0.87460595,0.00078240136,0.11654206,0.0024181213,0.000027776456],"about_ca_topic_score_codex":0.008512196,"about_ca_topic_score_gemma":0.008608395,"teacher_disagreement_score":0.008512196,"about_ca_system_score_codex":0.0021559063,"about_ca_system_score_gemma":0.0011759748,"threshold_uncertainty_score":0.02564019},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30891183,0.0014086,0.66225946,0.0012807996,0.00014474512,0.00013166417,0.00040865317,0.0009986614,0.024455622],"genre_scores_gemma":[0.94138145,0.0005679432,0.055064093,0.000050154642,0.000034978737,0.000082689134,0.00009820308,0.000048050155,0.0026722807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998815,0.000053455416,0.0000043911195,0.000018274743,0.000030116513,0.000012228466],"domain_scores_gemma":[0.9994796,0.00035785633,0.000050426213,0.000032313765,0.000051340863,0.000028501465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028471035,0.0003613938,0.0003543661,0.0007328486,0.0003509523,0.0005208503,0.00057294074,0.0005935401,0.0019888813],"category_scores_gemma":[0.0013026351,0.00014687261,0.00040532352,0.0006223465,0.00025089094,0.0006683128,0.0005504686,0.00041456206,0.00012949012],"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.000041530526,0.00007035984,0.0028844192,0.000095184056,0.000034927976,0.00038387626,0.00025287125,0.90173066,0.0054369094,0.077119656,0.0015757807,0.010373888],"study_design_scores_gemma":[0.0000018840071,0.000008424552,0.00013893216,0.0000032090245,0.0000026821253,0.00002665666,0.000016468755,0.9927407,0.00024767098,0.0063722106,0.0004379182,0.0000032728785],"about_ca_topic_score_codex":0.0036797742,"about_ca_topic_score_gemma":0.0021067064,"teacher_disagreement_score":0.0036797742,"about_ca_system_score_codex":0.0004378913,"about_ca_system_score_gemma":0.0002643883,"threshold_uncertainty_score":0.0073167086},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077968887,0.0002103015,0.98975337,0.00025945422,0.0000335144,0.00007662829,0.0003172146,0.00081632216,0.000736207],"genre_scores_gemma":[0.25455588,0.00046449137,0.739115,0.00014643367,0.00018359892,0.0007006256,0.002145608,0.0003424056,0.0023458463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791986,0.0009841796,0.00013045198,0.0003624287,0.00047621477,0.00012679814],"domain_scores_gemma":[0.9911465,0.006623557,0.00057036424,0.00064578914,0.0008753123,0.00013851104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029195857,0.00086801196,0.00092180376,0.0047229575,0.001189353,0.0025529384,0.0016850934,0.0012088335,0.0024903824],"category_scores_gemma":[0.016132433,0.00052595144,0.0014613763,0.0036636512,0.0013072254,0.0028407031,0.0023471809,0.0019689118,0.0015004328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003227226,0.00022906491,0.005114338,0.00045443783,0.0002785299,0.00034878516,0.0015487385,0.35714954,0.004159722,0.13196927,0.013914298,0.48451054],"study_design_scores_gemma":[0.000009952957,0.00001321477,0.00058556476,0.000019296078,0.000012231633,0.000033387027,0.00016537638,0.8994825,0.0010297756,0.09638742,0.0022440078,0.000017252429],"about_ca_topic_score_codex":0.004308277,"about_ca_topic_score_gemma":0.00451024,"teacher_disagreement_score":0.0047229575,"about_ca_system_score_codex":0.0014010906,"about_ca_system_score_gemma":0.0016167846,"threshold_uncertainty_score":0.015440404},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8863617,0.0005361813,0.108595334,0.000912574,0.000035413184,0.000043226824,0.00034792357,0.00010053221,0.0030670569],"genre_scores_gemma":[0.99378246,0.00013202982,0.005714022,0.000038704027,0.000027705455,0.000018295274,0.00008119744,0.000010035533,0.00019562249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973744,0.0014090249,0.000088840876,0.0005767586,0.00039971477,0.00015119925],"domain_scores_gemma":[0.96206903,0.027462441,0.004599982,0.0033480774,0.0012352667,0.0012851547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004172306,0.0004904587,0.0010088553,0.0019149245,0.00061402464,0.0020767595,0.0018790495,0.0014924833,0.0013260159],"category_scores_gemma":[0.047121234,0.00044177353,0.00042333052,0.0022965556,0.0022925974,0.007504846,0.00201249,0.0012447294,0.00014577595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007862749,0.0005033659,0.12493573,0.0006782973,0.0007252866,0.0007308197,0.0021753951,0.31030616,0.011681842,0.4873459,0.003668376,0.05646263],"study_design_scores_gemma":[0.000040988405,0.00010634239,0.018990045,0.00004070326,0.00007775562,0.00033691345,0.0006160951,0.611776,0.0017394804,0.3655364,0.0006867242,0.00005254379],"about_ca_topic_score_codex":0.0010887297,"about_ca_topic_score_gemma":0.0010757195,"teacher_disagreement_score":0.004172306,"about_ca_system_score_codex":0.0009999074,"about_ca_system_score_gemma":0.0004025938,"threshold_uncertainty_score":0.02206552},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07782709,0.0044155987,0.7231158,0.020394048,0.0005332988,0.00050586334,0.00016081193,0.00060248206,0.17244506],"genre_scores_gemma":[0.9080596,0.0016040176,0.07614503,0.0005068571,0.00037638715,0.0005337053,0.00007215508,0.00007050942,0.012631763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636465,0.0016532021,0.00012682324,0.00060334697,0.00085100083,0.0004008879],"domain_scores_gemma":[0.99182713,0.0043183514,0.0010917892,0.0011652146,0.0006716752,0.0009258599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043131355,0.0006088736,0.000545279,0.0032308458,0.0030651095,0.009481499,0.0014381806,0.003126315,0.0049327305],"category_scores_gemma":[0.008759554,0.00044235468,0.0007725474,0.0029249834,0.01884978,0.01618953,0.007330644,0.002841865,0.0005082486],"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.0000017145026,0.0000067221645,0.00013142439,0.000018972249,0.0000026173477,0.000025113755,0.0003832279,0.0013424414,0.000081539074,0.99605453,0.0002485816,0.0017030091],"study_design_scores_gemma":[0.000007223734,0.000013805072,0.0001643995,0.000034447523,0.000003196126,0.0000507076,0.00051094725,0.009109819,0.00013849426,0.97674197,0.013213905,0.000010994226],"about_ca_topic_score_codex":0.0016268054,"about_ca_topic_score_gemma":0.0010280879,"teacher_disagreement_score":0.009481499,"about_ca_system_score_codex":0.0046839095,"about_ca_system_score_gemma":0.0029217573,"threshold_uncertainty_score":0.033984303},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012204778,0.16332428,0.3318831,0.09478228,0.120201685,0.001086405,0.005122209,0.0055266256,0.26586872],"genre_scores_gemma":[0.06777459,0.0887356,0.20702133,0.011155243,0.028111314,0.0011225416,0.01902037,0.0026899793,0.574369],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971951,0.0009886562,0.0002044457,0.00050451275,0.0008496235,0.00025757207],"domain_scores_gemma":[0.99541277,0.0015054102,0.00016579746,0.0007842896,0.001185651,0.0009461448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004570689,0.0012944865,0.0018064455,0.0015622817,0.0014652454,0.0071200025,0.002865511,0.0023797238,0.07989404],"category_scores_gemma":[0.007581502,0.00063812407,0.0012805376,0.0018261308,0.0013092995,0.008285891,0.0042547225,0.0046710623,0.028279683],"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.0001247031,0.00013816744,0.000493168,0.0005407488,0.00008180242,0.00015821091,0.00044589493,0.0009005912,0.0013451558,0.02264209,0.7344579,0.23867151],"study_design_scores_gemma":[0.000012733403,0.00003928326,0.0004812987,0.00024329769,0.00002608766,0.00016109084,0.00023047005,0.0028783572,0.00033493128,0.012239869,0.9833324,0.000020233461],"about_ca_topic_score_codex":0.0026367002,"about_ca_topic_score_gemma":0.0048498744,"teacher_disagreement_score":0.07989404,"about_ca_system_score_codex":0.0014779345,"about_ca_system_score_gemma":0.0023603444,"threshold_uncertainty_score":0.26727217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014473184,0.00045470695,0.9774265,0.00025053084,0.00005344731,0.00018910084,0.001504942,0.0029968773,0.0026505669],"genre_scores_gemma":[0.2622248,0.00045236672,0.72449404,0.00005220434,0.00013863869,0.00044838004,0.0051516616,0.00034707834,0.0066908887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802965,0.00074488536,0.00010465724,0.00046658787,0.0005235668,0.00013051275],"domain_scores_gemma":[0.9956976,0.0025414315,0.0002582591,0.0009071995,0.0004840495,0.00011141843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00129585,0.00115516,0.0012447111,0.003956369,0.0015802303,0.001910426,0.0019118821,0.001211551,0.006830794],"category_scores_gemma":[0.008265932,0.0005612821,0.0016082298,0.0027383598,0.000723678,0.0032929168,0.0021345853,0.0014006278,0.0032904092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002476956,0.0004780752,0.006606854,0.0004708337,0.00026366074,0.00021361654,0.00051221915,0.1248692,0.008547178,0.06592794,0.024524268,0.76733845],"study_design_scores_gemma":[0.000012112552,0.000020184401,0.00129778,0.000021498317,0.000024234358,0.00006615251,0.00011442311,0.9227537,0.0021725323,0.06938718,0.0041151764,0.000015049895],"about_ca_topic_score_codex":0.006492937,"about_ca_topic_score_gemma":0.008885197,"teacher_disagreement_score":0.006830794,"about_ca_system_score_codex":0.0009703694,"about_ca_system_score_gemma":0.0013846628,"threshold_uncertainty_score":0.022851229},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10711048,0.00045401746,0.8891491,0.0005827254,0.00004542931,0.00007893358,0.000097598044,0.00052667595,0.001954923],"genre_scores_gemma":[0.7620826,0.00043972788,0.23575975,0.00020923387,0.000117718424,0.00023476836,0.00021428807,0.00023723736,0.0007047025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822146,0.001073706,0.00009893447,0.00025254552,0.0002664153,0.00008695106],"domain_scores_gemma":[0.9835925,0.0105067855,0.0009826055,0.0036757842,0.0007528791,0.00048948446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053378073,0.00058893004,0.001348332,0.0019667859,0.0010197714,0.0014244907,0.0020140603,0.0014964083,0.0010008943],"category_scores_gemma":[0.025653165,0.0007920178,0.0009938234,0.0012319913,0.0022888745,0.0044592195,0.00284336,0.0026014464,0.00023451116],"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.000087319706,0.00010368749,0.0069331354,0.00019615819,0.00015968276,0.00019273856,0.00079412025,0.6527819,0.0025568325,0.26004848,0.0010610281,0.07508489],"study_design_scores_gemma":[0.0000108351405,0.000029975985,0.00042910146,0.000025174275,0.000010120865,0.000039583698,0.000072643415,0.77560437,0.0006381048,0.22235374,0.0007676871,0.000018662457],"about_ca_topic_score_codex":0.0018179492,"about_ca_topic_score_gemma":0.00285728,"teacher_disagreement_score":0.0053378073,"about_ca_system_score_codex":0.00064104423,"about_ca_system_score_gemma":0.00064974965,"threshold_uncertainty_score":0.028229356},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024617674,0.00020729369,0.93972117,0.0014521305,0.00010770174,0.00023445964,0.001295522,0.028139668,0.0042243837],"genre_scores_gemma":[0.18184835,0.00029064176,0.81224513,0.00015535866,0.000078761375,0.00043340327,0.0013828352,0.0017258107,0.0018396807],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9939302,0.0035487458,0.00048789044,0.0005454178,0.0013312709,0.0001563886],"domain_scores_gemma":[0.95078856,0.037996817,0.0017092082,0.0054826527,0.0034500984,0.0005726365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010398786,0.0013634274,0.0010033628,0.007836683,0.0013776592,0.006766011,0.0015896012,0.0016063643,0.011884907],"category_scores_gemma":[0.05514476,0.0007790524,0.0010665882,0.0057970937,0.0010177444,0.009642501,0.0050484813,0.0020190466,0.0030688578],"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.0008510393,0.0007380484,0.012375116,0.0013896844,0.00026509727,0.0012075882,0.015877953,0.040881142,0.029309442,0.07812222,0.052030515,0.7669522],"study_design_scores_gemma":[0.00020460137,0.00022543356,0.007757059,0.00055519736,0.00012088393,0.001128288,0.003291833,0.74418145,0.0402429,0.117676094,0.084296405,0.00031999103],"about_ca_topic_score_codex":0.0018594522,"about_ca_topic_score_gemma":0.0022184523,"teacher_disagreement_score":0.011884907,"about_ca_system_score_codex":0.0008240839,"about_ca_system_score_gemma":0.0011311156,"threshold_uncertainty_score":0.054994702},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98176724,0.0008147192,0.0069851805,0.0011505445,0.000020238549,0.00034939597,0.00028369654,0.00016178562,0.008467212],"genre_scores_gemma":[0.9746422,0.00076334114,0.021181842,0.000089079214,0.000023479108,0.00017008615,0.00035793154,0.00007950322,0.002692472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9892852,0.0069850436,0.00049377454,0.0004227163,0.0023232254,0.0004900668],"domain_scores_gemma":[0.9459148,0.045262747,0.0022276852,0.0020124095,0.0037305674,0.00085169874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010022381,0.0007013632,0.00069732,0.0060964786,0.0031120304,0.0031175101,0.0016049325,0.00206571,0.0018133897],"category_scores_gemma":[0.039416596,0.00033380694,0.00076674524,0.0080843605,0.0015223527,0.0045597767,0.0013399681,0.0009646988,0.0005940616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019394906,0.0036291361,0.29962587,0.0034886783,0.00058306113,0.036590282,0.122345075,0.051301174,0.0107935835,0.021657282,0.017034695,0.43101174],"study_design_scores_gemma":[0.00081340247,0.006062903,0.27985325,0.0014913068,0.00093840965,0.029605435,0.2560588,0.24143432,0.025071487,0.024708804,0.13306129,0.00090060604],"about_ca_topic_score_codex":0.023664411,"about_ca_topic_score_gemma":0.04520567,"teacher_disagreement_score":0.023664411,"about_ca_system_score_codex":0.0025038158,"about_ca_system_score_gemma":0.0014033361,"threshold_uncertainty_score":0.053004086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9550591,0.00043482828,0.04271321,0.00021220112,0.000011228403,0.00002947496,0.00036912478,0.00007257672,0.0010982208],"genre_scores_gemma":[0.99497235,0.00017854926,0.0042466475,0.000009926913,0.000016587392,0.000020251326,0.00035298883,0.0000073003703,0.0001953974],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931026,0.00030518026,0.000045323683,0.00016300296,0.00011781265,0.0000585272],"domain_scores_gemma":[0.98065007,0.014095641,0.0030666708,0.00076820434,0.0009617095,0.00045767645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018248995,0.00030017272,0.00035018794,0.0044989055,0.00042251093,0.00075319275,0.00045148988,0.0004694148,0.0011128173],"category_scores_gemma":[0.018020617,0.000216202,0.0004796736,0.0027136572,0.00080714555,0.001581241,0.00046875147,0.00049676275,0.00010686372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034583616,0.00015223649,0.6022297,0.00031423793,0.0009830772,0.0008323432,0.0013752143,0.26216787,0.0073683835,0.053251777,0.001161227,0.0698181],"study_design_scores_gemma":[0.00001404452,0.00010972596,0.33308208,0.000047260244,0.00013459954,0.00034269865,0.00048857287,0.63011533,0.0016564161,0.032796104,0.0011677712,0.000045395194],"about_ca_topic_score_codex":0.0024514638,"about_ca_topic_score_gemma":0.001933258,"teacher_disagreement_score":0.0044989055,"about_ca_system_score_codex":0.00053569116,"about_ca_system_score_gemma":0.000306508,"threshold_uncertainty_score":0.0096511245},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005065175,0.37421778,0.19616833,0.09052256,0.042985756,0.00009441114,0.0008747927,0.0005190954,0.28955206],"genre_scores_gemma":[0.12823936,0.4382373,0.07982011,0.018165441,0.10491044,0.00035613062,0.001339474,0.0007525393,0.22817922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970204,0.000059487604,0.000015355448,0.00007298228,0.00012128309,0.00002879608],"domain_scores_gemma":[0.9991499,0.00052574347,0.000041590025,0.00007673359,0.00014842249,0.000057659272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000556394,0.0007978487,0.00062853534,0.0015731781,0.0007947134,0.0033881841,0.0012031599,0.0023106115,0.014993452],"category_scores_gemma":[0.002427929,0.00054034754,0.00049354264,0.0023648704,0.0018003304,0.006516344,0.0011706348,0.0033857299,0.00624715],"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.000013784275,0.00003384297,0.00012246428,0.0003506889,0.000017675373,0.00005078194,0.00007230479,0.0020913468,0.00026852783,0.70634854,0.20847397,0.0821561],"study_design_scores_gemma":[0.0000044028548,0.00000772283,0.00012431311,0.0002275574,0.000007579729,0.000117364834,0.000034883313,0.0014109587,0.00009516884,0.69578373,0.30217728,0.00000900401],"about_ca_topic_score_codex":0.00081508554,"about_ca_topic_score_gemma":0.00088884734,"teacher_disagreement_score":0.014993452,"about_ca_system_score_codex":0.0013668214,"about_ca_system_score_gemma":0.0008754644,"threshold_uncertainty_score":0.050158143},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07391597,0.0022088478,0.7513816,0.00088650844,0.00049710355,0.0022170437,0.0856987,0.07405681,0.009137455],"genre_scores_gemma":[0.15334466,0.0008437542,0.76307625,0.00029825946,0.00015862081,0.0012604916,0.070296496,0.0012922336,0.009429201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984499,0.00030378843,0.00013355358,0.0004234263,0.00059996464,0.000089276255],"domain_scores_gemma":[0.9986162,0.00058465224,0.00016842286,0.0003543191,0.00017303957,0.000103239676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012710395,0.0016453085,0.0015063221,0.00619397,0.001108961,0.0017308574,0.0020897824,0.0010782029,0.0040280833],"category_scores_gemma":[0.004623227,0.00082757784,0.0016376068,0.004887374,0.00032073553,0.0025168853,0.002702448,0.0011604528,0.0034413897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006795275,0.0009943928,0.024390744,0.0015266176,0.0008900607,0.00048496726,0.00044596518,0.021922559,0.016814534,0.009486884,0.12935771,0.793006],"study_design_scores_gemma":[0.000147418,0.00039870222,0.017328601,0.00016067184,0.00036880223,0.0012811576,0.0003623539,0.83814543,0.022788258,0.025987478,0.09289641,0.00013468725],"about_ca_topic_score_codex":0.0041106613,"about_ca_topic_score_gemma":0.011591356,"teacher_disagreement_score":0.00619397,"about_ca_system_score_codex":0.0005245561,"about_ca_system_score_gemma":0.0012845424,"threshold_uncertainty_score":0.013475299},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73239595,0.0014452682,0.22665344,0.0030273048,0.00010321603,0.00010736526,0.00028727172,0.00055210874,0.03542807],"genre_scores_gemma":[0.9862359,0.00028869364,0.0098227225,0.00015886016,0.000047846588,0.0000967484,0.00009800522,0.000050620336,0.0032006039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995938,0.00017897977,0.000013982287,0.000058509533,0.000085809435,0.000068963964],"domain_scores_gemma":[0.99780494,0.0014765364,0.00027278712,0.00012566344,0.00015370021,0.00016644462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008868635,0.00022944588,0.00038904918,0.0010047661,0.00053281046,0.0013858593,0.00048832915,0.0009561199,0.002669128],"category_scores_gemma":[0.0063456437,0.0002925246,0.0005184379,0.0003230057,0.0015217441,0.0017778627,0.0007960146,0.0007428603,0.00025322588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006315384,0.000039847117,0.0011682593,0.000063040476,0.000033120665,0.000167096,0.00026834683,0.064401895,0.0031888366,0.9237684,0.0017964925,0.00504148],"study_design_scores_gemma":[0.000040424027,0.00002272618,0.0007663853,0.00001988654,0.000008982272,0.00008248318,0.00005866995,0.4271152,0.0006816151,0.5696866,0.0015024563,0.000014597476],"about_ca_topic_score_codex":0.001491241,"about_ca_topic_score_gemma":0.000880639,"teacher_disagreement_score":0.002669128,"about_ca_system_score_codex":0.00090406166,"about_ca_system_score_gemma":0.00043987794,"threshold_uncertainty_score":0.008929133},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1502753,0.004106675,0.700904,0.01361492,0.0005985343,0.00016701716,0.0003896297,0.00027301762,0.12967089],"genre_scores_gemma":[0.93512905,0.0023409142,0.040433858,0.0011130637,0.0009181265,0.00018446233,0.00011546177,0.000080318474,0.019684795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984804,0.00077279843,0.00003739298,0.00023764625,0.00031551276,0.00015621471],"domain_scores_gemma":[0.99452955,0.0035280169,0.0004142746,0.00062064646,0.0005322091,0.00037534934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025903275,0.0007851645,0.0015822938,0.0021318295,0.001479561,0.0034478055,0.0038343992,0.0026070247,0.0073325145],"category_scores_gemma":[0.013318805,0.0005810155,0.0011591343,0.0018959263,0.0034468735,0.008307784,0.002894742,0.0029821626,0.00054987706],"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.000009413689,0.000022888915,0.00012931714,0.00004252604,0.0000144924825,0.000102070626,0.00010139972,0.0042345994,0.00017582787,0.9914533,0.001665389,0.0020486864],"study_design_scores_gemma":[0.0000103267175,0.00000673428,0.000096858705,0.000015998407,0.000012180514,0.00012505552,0.00007996862,0.06654095,0.000054552744,0.9319486,0.0010989596,0.000009791968],"about_ca_topic_score_codex":0.0009961706,"about_ca_topic_score_gemma":0.0009810971,"teacher_disagreement_score":0.0073325145,"about_ca_system_score_codex":0.0015586822,"about_ca_system_score_gemma":0.0010477189,"threshold_uncertainty_score":0.024529696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47699216,0.0007635663,0.51450396,0.0011504398,0.000075467084,0.00018021437,0.0013924253,0.0007931145,0.00414868],"genre_scores_gemma":[0.9328246,0.00021046738,0.06385544,0.000059789014,0.000077495395,0.00014206317,0.0015390437,0.000055867848,0.0012351912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580646,0.002558685,0.0001894248,0.0007192247,0.0004948871,0.00023125736],"domain_scores_gemma":[0.91715825,0.07082011,0.0047276174,0.002905906,0.0033165968,0.0010714981],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0057761045,0.0009466273,0.001106943,0.0073005245,0.0013946634,0.0020743841,0.0014978596,0.0020287489,0.0025421493],"category_scores_gemma":[0.055693988,0.00050983083,0.0006358339,0.005413846,0.0011697938,0.0051199337,0.0013562675,0.0017180747,0.0010088822],"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.0007210085,0.00052161986,0.25723854,0.0005276606,0.00031495784,0.00060853007,0.002086216,0.46085864,0.0014404083,0.031008936,0.011474149,0.23319936],"study_design_scores_gemma":[0.000011582101,0.000019624445,0.004323369,0.000035129386,0.00002463514,0.000046956517,0.00016932719,0.9686521,0.00063571293,0.025290586,0.00077587285,0.000015139322],"about_ca_topic_score_codex":0.0038406532,"about_ca_topic_score_gemma":0.004020471,"teacher_disagreement_score":0.9926995,"about_ca_system_score_codex":0.0009925634,"about_ca_system_score_gemma":0.00075862225,"threshold_uncertainty_score":0.03054732},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054854732,0.00081814785,0.9388723,0.00038426576,0.00015486486,0.00019344008,0.00032675298,0.0015087451,0.0028867973],"genre_scores_gemma":[0.34234282,0.00064893044,0.6507182,0.00032494043,0.00018980741,0.00023885732,0.0015856553,0.0005656147,0.0033851434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951049,0.0015836961,0.00029342296,0.0009950207,0.001693897,0.00032907503],"domain_scores_gemma":[0.9788833,0.011777843,0.0022301192,0.0029677118,0.003356445,0.0007846603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043981373,0.001330567,0.0013808741,0.0071753194,0.0017116129,0.0023467166,0.0021957199,0.002083404,0.0025138096],"category_scores_gemma":[0.039249793,0.0007192608,0.001219988,0.0046248618,0.0012622734,0.005870345,0.004240902,0.002030329,0.001304347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007679498,0.0002943671,0.02659535,0.0007607112,0.00044329153,0.0005345215,0.0018177101,0.21219295,0.034054145,0.07785145,0.012755697,0.63193184],"study_design_scores_gemma":[0.00006888036,0.0001612362,0.003200505,0.00009035643,0.00009554195,0.00044560918,0.00040691602,0.87668055,0.013803028,0.09239074,0.012590887,0.000065742155],"about_ca_topic_score_codex":0.0055022533,"about_ca_topic_score_gemma":0.007913485,"teacher_disagreement_score":0.0071753194,"about_ca_system_score_codex":0.0011333681,"about_ca_system_score_gemma":0.0009208482,"threshold_uncertainty_score":0.023259878},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39106387,0.001507819,0.5979453,0.0008418827,0.000037989077,0.00006331951,0.00066877145,0.00063668203,0.007234433],"genre_scores_gemma":[0.8397241,0.0011014047,0.15547442,0.000106344785,0.000049570655,0.00010735318,0.0007265781,0.00017004386,0.0025402042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965537,0.00013293477,0.000020969524,0.0000852076,0.00006861225,0.000036903984],"domain_scores_gemma":[0.9954684,0.0033799678,0.00028446334,0.00042779226,0.00029309542,0.00014625904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006596074,0.00037224946,0.00044787177,0.0019371667,0.0005306807,0.0016655434,0.00053465646,0.00083778583,0.0020853232],"category_scores_gemma":[0.008383006,0.0006334417,0.0004845735,0.0010706664,0.0010643799,0.0033711288,0.0009138567,0.00084080646,0.00029136587],"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.00021546948,0.00008104884,0.026720567,0.0004523752,0.000112820235,0.0011698495,0.0015973868,0.63066036,0.01562744,0.22326025,0.0073896376,0.09271276],"study_design_scores_gemma":[0.000018639608,0.000026164387,0.005329493,0.00004674646,0.000019133531,0.00041226886,0.0002453267,0.8404685,0.0013002527,0.14708464,0.005025309,0.000023458952],"about_ca_topic_score_codex":0.001600328,"about_ca_topic_score_gemma":0.0017501344,"teacher_disagreement_score":0.0020853232,"about_ca_system_score_codex":0.0004199172,"about_ca_system_score_gemma":0.0002067745,"threshold_uncertainty_score":0.0069761276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8672202,0.0005003528,0.12035211,0.0011449871,0.00002787867,0.00016026308,0.00010725459,0.00015968364,0.010327241],"genre_scores_gemma":[0.9934097,0.000104752784,0.005901548,0.000042588912,0.00001008645,0.000055016473,0.000028900986,0.000013493197,0.00043393488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979797,0.0011660788,0.000066905144,0.00030920634,0.00030398148,0.00017419783],"domain_scores_gemma":[0.9568337,0.03134625,0.0052990243,0.0034819306,0.0017401669,0.0012989371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053793197,0.00034515138,0.00060547586,0.0018110106,0.0012614387,0.00232524,0.0013420013,0.001067036,0.0026230097],"category_scores_gemma":[0.039481174,0.0005438837,0.0008354895,0.0010923033,0.004077532,0.004978829,0.001570422,0.0012316569,0.00030336448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029165164,0.00044233387,0.15045245,0.0003804903,0.0002242229,0.0014256847,0.008820621,0.12507257,0.0063222186,0.62406665,0.0032651806,0.07923596],"study_design_scores_gemma":[0.00010598849,0.00024822642,0.046195876,0.000109069006,0.00005840555,0.00062458054,0.0019322815,0.41862345,0.0018051694,0.52702314,0.003175064,0.000098807395],"about_ca_topic_score_codex":0.0028666842,"about_ca_topic_score_gemma":0.0022908256,"teacher_disagreement_score":0.0053793197,"about_ca_system_score_codex":0.0015900491,"about_ca_system_score_gemma":0.0007359746,"threshold_uncertainty_score":0.02844888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7110977,0.0008448863,0.2785073,0.00049407803,0.000081964,0.00011977483,0.0014702954,0.0007445668,0.006639436],"genre_scores_gemma":[0.96982545,0.0002300877,0.027964504,0.000016402051,0.000023647623,0.00004280463,0.00075678964,0.000021861633,0.0011184055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960643,0.000098728786,0.000022726623,0.0000925199,0.00013389789,0.000045610108],"domain_scores_gemma":[0.9981014,0.0010753254,0.00033403857,0.00007368484,0.00031652022,0.00009916986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005950522,0.00051361026,0.00032068905,0.0041376622,0.00038314218,0.00089005847,0.00029779345,0.00060277793,0.0014723354],"category_scores_gemma":[0.0045608394,0.00019428744,0.00033151335,0.0020712467,0.0002402497,0.0011887068,0.0003770388,0.00040997253,0.00066590443],"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.00042394132,0.00033934813,0.26805797,0.00029726588,0.0002522271,0.00064938806,0.00061387505,0.44750518,0.015138289,0.016211966,0.007908741,0.24260177],"study_design_scores_gemma":[0.000007157907,0.00005295377,0.017565144,0.000022796145,0.000026968562,0.00013440257,0.00016323014,0.97184247,0.0021359487,0.006438545,0.0015922844,0.000018085953],"about_ca_topic_score_codex":0.0056321337,"about_ca_topic_score_gemma":0.0062828483,"teacher_disagreement_score":0.0056321337,"about_ca_system_score_codex":0.0006506872,"about_ca_system_score_gemma":0.00039928523,"threshold_uncertainty_score":0.0111986995},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013175792,0.6487803,0.023555484,0.056497682,0.0032061574,0.00005008945,0.00044667022,0.0005930993,0.26555294],"genre_scores_gemma":[0.078309625,0.49308798,0.03189699,0.014651864,0.003827697,0.000385758,0.00053228054,0.00084424514,0.37646356],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991635,0.0003703219,0.000051594245,0.00013556311,0.00022209389,0.000056911176],"domain_scores_gemma":[0.9983504,0.0012209513,0.000091988644,0.0000821533,0.00011372152,0.00014072201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013231505,0.0014350298,0.00074701174,0.0034364755,0.002361263,0.0072072563,0.0013041823,0.0031589572,0.035412155],"category_scores_gemma":[0.0031225292,0.0008979967,0.00057879824,0.0037102886,0.007966968,0.016937241,0.0027955994,0.0035606713,0.010772289],"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.000024022487,0.000018986682,0.0001748019,0.0005169438,0.000015154432,0.00015011005,0.007322187,0.00034617062,0.00015945033,0.30527204,0.59281623,0.09318381],"study_design_scores_gemma":[0.000003962342,0.0000058286446,0.000295345,0.00048541895,0.0000058023616,0.0003098429,0.0015960933,0.0002342241,0.00008115608,0.1191142,0.8778548,0.00001330688],"about_ca_topic_score_codex":0.0068840287,"about_ca_topic_score_gemma":0.0138902515,"teacher_disagreement_score":0.035412155,"about_ca_system_score_codex":0.0030408346,"about_ca_system_score_gemma":0.0012081739,"threshold_uncertainty_score":0.11846548},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57519966,0.00086451124,0.4168959,0.0015996115,0.00012049027,0.00008765595,0.0005380591,0.0005271363,0.0041670697],"genre_scores_gemma":[0.9873196,0.00034185254,0.0077753654,0.00005935789,0.000104433384,0.000050054427,0.00017073378,0.00007023559,0.004108321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958235,0.00012546683,0.000012001845,0.00014912349,0.00005790624,0.00007316364],"domain_scores_gemma":[0.99419725,0.004506324,0.0005560994,0.00020710572,0.0002781071,0.0002550721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012225499,0.00069784024,0.0009916632,0.0012279651,0.0005331712,0.0016657044,0.0013689375,0.0015872831,0.0025967418],"category_scores_gemma":[0.010271342,0.00073713803,0.0005746446,0.0010832265,0.0010778531,0.0034355235,0.0010289355,0.0011983486,0.0002656005],"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.00008750993,0.000051350908,0.0027278115,0.00004480115,0.00003623284,0.000059301467,0.00008715895,0.97380406,0.0015919366,0.015519253,0.0007169479,0.005273738],"study_design_scores_gemma":[0.0000021104029,0.0000036448566,0.00014434307,0.0000011835206,0.0000035215285,0.000004175988,0.0000059848394,0.99596125,0.00007784772,0.0037404578,0.000054259777,0.0000012977671],"about_ca_topic_score_codex":0.00930781,"about_ca_topic_score_gemma":0.005935777,"teacher_disagreement_score":0.00930781,"about_ca_system_score_codex":0.0017860748,"about_ca_system_score_gemma":0.00049252587,"threshold_uncertainty_score":0.018507242},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71824515,0.00057293393,0.26604125,0.0024354279,0.00006352275,0.000039940074,0.00027315193,0.00016972679,0.012158897],"genre_scores_gemma":[0.9890708,0.00016319992,0.0069445283,0.000058376652,0.000028985234,0.000026956212,0.000033482025,0.000024009216,0.0036495659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970776,0.00013042474,0.000007051468,0.00006143849,0.00003096388,0.00006230128],"domain_scores_gemma":[0.99743855,0.0015607858,0.00037954704,0.00017142754,0.00014991398,0.00029969803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013611284,0.00059083174,0.00075691164,0.0010329422,0.0009584155,0.0025743945,0.0014217306,0.0024911275,0.0032201644],"category_scores_gemma":[0.0077671558,0.0006193105,0.00060060533,0.000692222,0.0021606672,0.0042851614,0.001289808,0.0014818572,0.0002654514],"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.00011508845,0.000069510716,0.0030651484,0.000034355508,0.000052872892,0.00016087668,0.00017951557,0.7016945,0.0014669761,0.2872693,0.00075341936,0.005138398],"study_design_scores_gemma":[0.0000063657967,0.0000059442,0.00019587897,0.0000039364295,0.00000633546,0.000011333615,0.000014991521,0.96651757,0.000059232825,0.033054043,0.000117551754,0.0000067285664],"about_ca_topic_score_codex":0.005369076,"about_ca_topic_score_gemma":0.006279806,"teacher_disagreement_score":0.005369076,"about_ca_system_score_codex":0.0017739462,"about_ca_system_score_gemma":0.0006637198,"threshold_uncertainty_score":0.012870967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20398282,0.0013499814,0.75317186,0.0008488193,0.0004467771,0.00063052255,0.014977945,0.0073891687,0.017202146],"genre_scores_gemma":[0.4851272,0.00075060787,0.47270426,0.00020300875,0.00019687807,0.00043724696,0.02387916,0.0005207641,0.016180916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876773,0.00026224382,0.00009005816,0.00044754395,0.00033195145,0.00010060981],"domain_scores_gemma":[0.9972811,0.0011212116,0.00021537773,0.00045222437,0.00078716193,0.0001428964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007712656,0.000656305,0.0006173207,0.005840332,0.0011177011,0.001483269,0.0011596229,0.0009793973,0.002290052],"category_scores_gemma":[0.003427406,0.0003744394,0.0008044901,0.0052431147,0.00037750672,0.0027558135,0.001424146,0.0007670972,0.0028868825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012991052,0.0009820189,0.027171329,0.0012535563,0.0003419432,0.0011820245,0.0014386505,0.02018388,0.097560816,0.019415548,0.060076453,0.7690947],"study_design_scores_gemma":[0.000036710153,0.00013761064,0.022566346,0.00013680472,0.00027061644,0.00065558293,0.0007128495,0.8797512,0.03945115,0.026035437,0.030104842,0.00014079783],"about_ca_topic_score_codex":0.008174453,"about_ca_topic_score_gemma":0.021718225,"teacher_disagreement_score":0.008174453,"about_ca_system_score_codex":0.00064922875,"about_ca_system_score_gemma":0.00089376327,"threshold_uncertainty_score":0.01625371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96985775,0.00013071611,0.028190356,0.00015614026,0.000010520472,0.000009872048,0.000080347905,0.00008948109,0.001474923],"genre_scores_gemma":[0.99701905,0.000048528018,0.0026978324,0.000022394479,0.000008481306,0.000009441696,0.00005088264,0.000009419939,0.00013403183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999348,0.00023151834,0.000027694834,0.00021273314,0.000104798084,0.000075241245],"domain_scores_gemma":[0.996402,0.0017020468,0.00072931306,0.000575197,0.000302985,0.00028844987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082803774,0.00018816898,0.00047507498,0.0008416385,0.0006023269,0.0011685654,0.0004026844,0.00051688874,0.0010141617],"category_scores_gemma":[0.0069958144,0.00032704038,0.00029906782,0.0005109885,0.0008197325,0.001495785,0.00078195083,0.0005503608,0.00013540401],"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.000742994,0.00027618665,0.15264052,0.0004294718,0.0007637957,0.0008660706,0.0025065148,0.29758793,0.27696693,0.19760126,0.0037105586,0.06590773],"study_design_scores_gemma":[0.000033336397,0.00015649336,0.101105966,0.00003566616,0.00011553004,0.0005576051,0.00057614275,0.69510776,0.023983382,0.17604965,0.0021782669,0.000100149155],"about_ca_topic_score_codex":0.0005904878,"about_ca_topic_score_gemma":0.00093514926,"teacher_disagreement_score":0.0011685654,"about_ca_system_score_codex":0.00060320063,"about_ca_system_score_gemma":0.00026206035,"threshold_uncertainty_score":0.0043791533},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022160381,0.0006576109,0.9703686,0.0010945438,0.00004428166,0.0000837506,0.0004299074,0.00018082025,0.004980143],"genre_scores_gemma":[0.6177015,0.0019873446,0.36530083,0.00070427085,0.0003406841,0.00080502965,0.0019243892,0.00050720316,0.010728763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810106,0.000976243,0.00005294755,0.00041151486,0.00025111283,0.00020721622],"domain_scores_gemma":[0.9919304,0.006617852,0.0005488703,0.0002832586,0.0003185488,0.00030094257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035182908,0.0029002246,0.00282613,0.0017451263,0.0009294314,0.0022562859,0.0027559784,0.003104572,0.004205068],"category_scores_gemma":[0.013316399,0.0018027732,0.001649633,0.0019973228,0.002717375,0.0036682335,0.0022943409,0.0032823137,0.000736138],"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.000065429784,0.00004699208,0.0005063813,0.00013185466,0.00006480759,0.0001120981,0.000092705886,0.95110226,0.00043715202,0.03811685,0.002152696,0.007170773],"study_design_scores_gemma":[0.00001007666,0.0000110425135,0.00008209516,0.000011414705,0.0000075962953,0.00001675242,0.000021419113,0.9672309,0.0001346021,0.032041833,0.00042667938,0.0000055868163],"about_ca_topic_score_codex":0.007527216,"about_ca_topic_score_gemma":0.00597012,"teacher_disagreement_score":0.007527216,"about_ca_system_score_codex":0.0036102005,"about_ca_system_score_gemma":0.0016654925,"threshold_uncertainty_score":0.026193917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19705838,0.0020197465,0.7436,0.0073394245,0.00017407609,0.00022048046,0.0005979331,0.0002890529,0.048700918],"genre_scores_gemma":[0.95726806,0.0011705091,0.027964171,0.00045752787,0.00022442386,0.00017448072,0.00023364605,0.000047410842,0.012459762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984737,0.00061371754,0.000051783623,0.00022699103,0.00035708628,0.00027676928],"domain_scores_gemma":[0.99509615,0.003084906,0.00078797096,0.00030709396,0.00032903012,0.00039474916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020175145,0.0011734259,0.0011842658,0.0017922053,0.0010704527,0.0025624998,0.002879387,0.0032967457,0.0056418846],"category_scores_gemma":[0.007697632,0.00044595177,0.0011626381,0.0014707581,0.003033555,0.004049764,0.001496421,0.0018682611,0.0008650582],"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.000028558698,0.00004478565,0.00058297894,0.00004045325,0.00002642462,0.0001583312,0.0002388674,0.10176462,0.00043540896,0.89188135,0.001383054,0.0034152018],"study_design_scores_gemma":[0.000053720098,0.00003678674,0.00026237796,0.0000124662865,0.000017632266,0.00011753146,0.00008324538,0.31602576,0.000110219116,0.68067497,0.0025843685,0.000020941432],"about_ca_topic_score_codex":0.0042280727,"about_ca_topic_score_gemma":0.0024472566,"teacher_disagreement_score":0.0056418846,"about_ca_system_score_codex":0.0017459374,"about_ca_system_score_gemma":0.0006753828,"threshold_uncertainty_score":0.01887399},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21347606,0.00046291522,0.78195035,0.0004812994,0.00003850316,0.00008793295,0.00024084913,0.00097135914,0.0022906624],"genre_scores_gemma":[0.78183174,0.00016733912,0.21646029,0.00007726345,0.00004334963,0.00006175614,0.00026149108,0.00008176306,0.0010150159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824476,0.00064624124,0.00006734393,0.00052419223,0.00040770715,0.00010975183],"domain_scores_gemma":[0.9776019,0.014817311,0.0025973006,0.0023853134,0.0018217469,0.0007765119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029207794,0.0007477333,0.00070696726,0.0038781017,0.001221186,0.0017117138,0.0013343407,0.001151654,0.001238779],"category_scores_gemma":[0.021087583,0.0004982675,0.00073661667,0.0019169743,0.0016501255,0.0027740085,0.0025326733,0.001645289,0.00036624496],"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.0005244416,0.0003021312,0.062364407,0.00061105326,0.0003997236,0.0009639272,0.0021852108,0.48956,0.036521986,0.08390511,0.0054540136,0.31720802],"study_design_scores_gemma":[0.000011550274,0.00003098268,0.002706129,0.000020570533,0.000021376385,0.00017046716,0.00008305276,0.94937754,0.004327792,0.042301483,0.00093156233,0.000017452456],"about_ca_topic_score_codex":0.0022633376,"about_ca_topic_score_gemma":0.0031753876,"teacher_disagreement_score":0.0038781017,"about_ca_system_score_codex":0.00090928556,"about_ca_system_score_gemma":0.00056336087,"threshold_uncertainty_score":0.0154467225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55105627,0.003735338,0.37589595,0.009783297,0.00034658573,0.00031415682,0.0009797119,0.00081896177,0.05706971],"genre_scores_gemma":[0.9624084,0.0009607187,0.032362487,0.00034116817,0.00017861238,0.00015707595,0.00027853064,0.00011431082,0.003198562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946554,0.0024767925,0.00025612095,0.0010066174,0.0011584096,0.0004466101],"domain_scores_gemma":[0.9694844,0.015850337,0.005606745,0.004871648,0.002355121,0.0018318172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040321928,0.00037752435,0.00056676875,0.0032597696,0.0032394072,0.0057519586,0.0010858383,0.001963821,0.002191809],"category_scores_gemma":[0.033831924,0.0007632283,0.00068107795,0.0026440963,0.007572033,0.015076034,0.005688746,0.0030511415,0.00061478274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102828555,0.00009719554,0.043402757,0.00034146593,0.00010645146,0.0015231048,0.030712819,0.010504023,0.008840944,0.8122968,0.0057410575,0.086330526],"study_design_scores_gemma":[0.0000346125,0.0000785272,0.035451602,0.0002558303,0.000059060003,0.0015020991,0.0106811505,0.049991485,0.0030724257,0.8279167,0.07077878,0.00017773823],"about_ca_topic_score_codex":0.0021874353,"about_ca_topic_score_gemma":0.0022737365,"teacher_disagreement_score":0.0057519586,"about_ca_system_score_codex":0.0015469571,"about_ca_system_score_gemma":0.0009235739,"threshold_uncertainty_score":0.021324515},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35358182,0.0009565972,0.631951,0.00056788966,0.0000576033,0.00006916082,0.00017818034,0.00020086727,0.012436904],"genre_scores_gemma":[0.9380643,0.0007548502,0.05434844,0.000085690415,0.00005009162,0.00009545463,0.000081887396,0.00003881652,0.006480524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960643,0.000112695176,0.000018758059,0.000103230144,0.00008913426,0.000069828624],"domain_scores_gemma":[0.99799263,0.0012182561,0.00032740764,0.00014469969,0.00018496205,0.00013207553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090393587,0.00045639093,0.00040553842,0.00078077544,0.00079771073,0.0015620467,0.0009170757,0.0009997445,0.0014557954],"category_scores_gemma":[0.005182451,0.00045787863,0.0004884902,0.0006645562,0.001086247,0.0032822732,0.0011439158,0.0008023917,0.00020666569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011464299,0.000043175358,0.0020398973,0.00013358258,0.00005147047,0.0005069725,0.00029636704,0.4233797,0.01959744,0.53316295,0.0010558804,0.019617897],"study_design_scores_gemma":[0.000008105149,0.000017791488,0.00042470742,0.000010825696,0.000014301454,0.00014398611,0.00007276556,0.91139835,0.0033559978,0.0832621,0.0012745932,0.000016538319],"about_ca_topic_score_codex":0.001699269,"about_ca_topic_score_gemma":0.0012088657,"teacher_disagreement_score":0.001699269,"about_ca_system_score_codex":0.0010945403,"about_ca_system_score_gemma":0.0003597171,"threshold_uncertainty_score":0.007941425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04170324,0.00023381329,0.95467824,0.0002297232,0.000014377486,0.000039649763,0.000036278816,0.00006359199,0.0030010485],"genre_scores_gemma":[0.97100866,0.00026302275,0.027471052,0.000031152842,0.00001149839,0.00009412512,0.00004303526,0.000015605556,0.0010618748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996394,0.000116274445,0.000017725366,0.000095763855,0.000089426605,0.0000414221],"domain_scores_gemma":[0.9978994,0.0014551972,0.00030099394,0.0000819258,0.00021483698,0.000047613987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009885475,0.0007404608,0.00060107437,0.0007403222,0.00037784624,0.0010763023,0.000670201,0.0008765595,0.0011869611],"category_scores_gemma":[0.0049002995,0.00033751494,0.00039114716,0.0004619184,0.0010382853,0.0012196794,0.00068688067,0.00067803636,0.00010326477],"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.00001671171,0.000012129376,0.0003086304,0.000025767013,0.000010318769,0.000020491887,0.000016716205,0.9835527,0.0006269247,0.010828359,0.00010146886,0.00447972],"study_design_scores_gemma":[0.0000014726638,0.000004991078,0.000060379698,0.000002132276,0.00000151244,0.000002854248,0.0000040590458,0.9965371,0.00013859315,0.0031858098,0.00005898607,0.0000021981036],"about_ca_topic_score_codex":0.004475368,"about_ca_topic_score_gemma":0.0020984865,"teacher_disagreement_score":0.004475368,"about_ca_system_score_codex":0.0012675631,"about_ca_system_score_gemma":0.00071185146,"threshold_uncertainty_score":0.0091968775},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008396327,0.0025565245,0.98437035,0.0006592046,0.00012846629,0.0000686101,0.000310311,0.00023404634,0.003276228],"genre_scores_gemma":[0.33303413,0.005427697,0.6457124,0.0002741771,0.0008735795,0.0005578709,0.0014138707,0.00034547772,0.012360854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829143,0.0008682677,0.000069983274,0.00033579674,0.000354033,0.00008049328],"domain_scores_gemma":[0.9951747,0.0037644666,0.00023371988,0.0003708151,0.00027129543,0.00018496947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025129488,0.0009446416,0.0010188164,0.002578914,0.00067612535,0.0022276402,0.0016195632,0.0010841246,0.0035317424],"category_scores_gemma":[0.010256799,0.00061271543,0.0011191032,0.0037051137,0.0013776079,0.0048957737,0.0018508715,0.0022327325,0.0010250454],"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.00011024214,0.00023255554,0.005907301,0.00073129416,0.00022232515,0.00017293346,0.0012541483,0.08288284,0.0038046634,0.527175,0.01743029,0.3600764],"study_design_scores_gemma":[0.000009090355,0.000030422942,0.0015977366,0.00007518126,0.000040378793,0.00013881887,0.00021273129,0.6246731,0.0008592224,0.35968098,0.012651819,0.000030480851],"about_ca_topic_score_codex":0.0017082837,"about_ca_topic_score_gemma":0.0020213192,"teacher_disagreement_score":0.0035317424,"about_ca_system_score_codex":0.0008314608,"about_ca_system_score_gemma":0.0006554033,"threshold_uncertainty_score":0.013289869},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07762798,0.0002659394,0.9144835,0.00083538855,0.00005743971,0.000070174334,0.00006776202,0.00018548236,0.00640632],"genre_scores_gemma":[0.9032586,0.00023823441,0.093321726,0.00015602978,0.000101386344,0.00012768879,0.000046438592,0.00010294347,0.0026468798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892575,0.0005173718,0.000031585718,0.0002206045,0.0001958941,0.000108814595],"domain_scores_gemma":[0.9947438,0.003327555,0.0005270428,0.00047271955,0.00055359886,0.00037526592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023052106,0.0008090968,0.00094814145,0.001330009,0.000777781,0.0016445466,0.0019592834,0.0015563886,0.0033525897],"category_scores_gemma":[0.013762,0.0005773159,0.0003583309,0.0008348349,0.001357784,0.003870095,0.0017562413,0.0010286969,0.00044085056],"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.00034164943,0.00015758286,0.0008979919,0.00024432855,0.00006661459,0.00008623208,0.00018954938,0.57196486,0.009749261,0.3332987,0.0034836316,0.07951955],"study_design_scores_gemma":[0.000033083375,0.000039596067,0.0001454611,0.00001506252,0.000016096601,0.000036633402,0.000034752647,0.8664148,0.0010594088,0.13167153,0.0005248116,0.000008835591],"about_ca_topic_score_codex":0.0005015664,"about_ca_topic_score_gemma":0.00094419566,"teacher_disagreement_score":0.0033525897,"about_ca_system_score_codex":0.0012903042,"about_ca_system_score_gemma":0.000898848,"threshold_uncertainty_score":0.012191236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047012065,0.15105647,0.13478808,0.013712266,0.0036345958,0.00008669313,0.0006171945,0.00037050128,0.69103307],"genre_scores_gemma":[0.168987,0.17767796,0.072598204,0.0035751734,0.012987816,0.00056110334,0.001208923,0.00048624183,0.56191766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975306,0.00008199692,0.000010392904,0.000048538546,0.00009163091,0.000014372701],"domain_scores_gemma":[0.99933225,0.00047453446,0.00003794013,0.000055969733,0.00007272993,0.00002658315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034517422,0.0010680697,0.0006121805,0.0018938682,0.0006765498,0.0030811306,0.00056281016,0.0011599511,0.017641678],"category_scores_gemma":[0.0018886253,0.00033633466,0.0002621668,0.0032142727,0.0017847863,0.005180482,0.00084421557,0.001574346,0.0035131488],"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.000002263947,0.000009215509,0.00005812234,0.0001540952,0.0000053792814,0.00002434195,0.00019526886,0.0010302388,0.00010267968,0.91227555,0.049828906,0.036313955],"study_design_scores_gemma":[0.0000015728248,0.0000028774045,0.0001414608,0.000059726346,0.0000035028079,0.00005972623,0.00008021713,0.001844754,0.000047787642,0.78277206,0.21498114,0.0000051908496],"about_ca_topic_score_codex":0.0011094396,"about_ca_topic_score_gemma":0.0018709119,"teacher_disagreement_score":0.017641678,"about_ca_system_score_codex":0.0011429018,"about_ca_system_score_gemma":0.00050633756,"threshold_uncertainty_score":0.05901736},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7116525,0.0006207376,0.27971634,0.00030900273,0.000044469765,0.0001774746,0.002902935,0.0010336933,0.003542884],"genre_scores_gemma":[0.912163,0.0002468749,0.0820477,0.000046142566,0.00005176576,0.00008241844,0.0036090591,0.00010630552,0.0016467771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987412,0.00026698448,0.000092166236,0.0004268583,0.00033433875,0.00013854302],"domain_scores_gemma":[0.9806528,0.014529462,0.0015892786,0.0018720796,0.00089044916,0.00046586883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013865628,0.00086538016,0.0009202689,0.0039354726,0.0010188703,0.0018261038,0.0016476812,0.0013973442,0.002736411],"category_scores_gemma":[0.012343161,0.000855407,0.0012641696,0.0024541367,0.0010798059,0.005802777,0.0018865706,0.0014940305,0.0005750999],"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.0021410545,0.00076857203,0.24464951,0.001080972,0.0014968109,0.0015807205,0.0016640767,0.38414428,0.03109001,0.03389886,0.0070585352,0.2904265],"study_design_scores_gemma":[0.00003727335,0.00011894189,0.01232416,0.0000429434,0.00023666516,0.00039711138,0.00035463498,0.93523884,0.007077075,0.0431215,0.0010220887,0.000028743094],"about_ca_topic_score_codex":0.0031336395,"about_ca_topic_score_gemma":0.0058143944,"teacher_disagreement_score":0.0039354726,"about_ca_system_score_codex":0.0005883948,"about_ca_system_score_gemma":0.00054835033,"threshold_uncertainty_score":0.00915426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015668025,0.0026980797,0.92513156,0.003068777,0.00043483498,0.000058884216,0.00068586797,0.00035658726,0.051897414],"genre_scores_gemma":[0.7402032,0.008052468,0.10875445,0.00088043703,0.0012745874,0.0005486647,0.0014379424,0.0005008314,0.13834742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993649,0.00027958784,0.000026475376,0.0001154069,0.0001239215,0.0000897161],"domain_scores_gemma":[0.9981863,0.00096386555,0.00019672094,0.00022079382,0.0002622747,0.00017009993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011088627,0.0013951834,0.001269006,0.0012276588,0.0010452052,0.0031461543,0.0028390435,0.0023092171,0.013782908],"category_scores_gemma":[0.0053129587,0.00091053615,0.0011215071,0.0018695091,0.0018956519,0.005486537,0.0022517648,0.0025986133,0.002028827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008993453,0.000013187172,0.00009770334,0.000027181895,0.000012122402,0.00002615419,0.000050743838,0.10739798,0.000109164794,0.8854198,0.0032610781,0.00357578],"study_design_scores_gemma":[0.0000065678014,0.000005391337,0.000045154196,0.000010374339,0.0000070915107,0.00002047362,0.000029689478,0.4030921,0.00003305102,0.5923895,0.0043533216,0.0000072395687],"about_ca_topic_score_codex":0.00879096,"about_ca_topic_score_gemma":0.007075692,"teacher_disagreement_score":0.013782908,"about_ca_system_score_codex":0.0022485168,"about_ca_system_score_gemma":0.0011044103,"threshold_uncertainty_score":0.046108484},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0130699,0.0009553511,0.889922,0.009292919,0.0003559789,0.00011802981,0.00030226682,0.00019037032,0.0857931],"genre_scores_gemma":[0.7417635,0.0014544359,0.22183317,0.0015030043,0.0007274191,0.0006936185,0.00042765104,0.00011977717,0.031477604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895895,0.0004222013,0.00004740759,0.0001870395,0.0003000581,0.00008431046],"domain_scores_gemma":[0.99871933,0.0007214696,0.00010866374,0.00017130424,0.0001441741,0.00013499659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013380252,0.00059110945,0.00056516175,0.00082691055,0.0017751423,0.0026182053,0.0017153468,0.0018414635,0.0067877905],"category_scores_gemma":[0.003510776,0.00029859744,0.0011656104,0.0008566044,0.0029316815,0.0039634276,0.0026110415,0.0019000038,0.0009487781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003780526,0.00000701339,0.00010291693,0.000024082668,0.0000072484863,0.00003380241,0.0001225633,0.028742598,0.00014581441,0.96737146,0.0013032862,0.0021354118],"study_design_scores_gemma":[0.000009181436,0.000009059181,0.000068391324,0.000017052122,0.0000067570213,0.000035917135,0.000058946884,0.15439571,0.0000871294,0.83235866,0.0129435,0.0000096977055],"about_ca_topic_score_codex":0.0040162113,"about_ca_topic_score_gemma":0.0025284174,"teacher_disagreement_score":0.0067877905,"about_ca_system_score_codex":0.0017259767,"about_ca_system_score_gemma":0.0017840271,"threshold_uncertainty_score":0.022707403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12731108,0.0034804195,0.8336658,0.0016304544,0.00032651937,0.00013996653,0.00009804236,0.00067800813,0.03266963],"genre_scores_gemma":[0.8999934,0.0018984633,0.09067256,0.0003847781,0.0004403911,0.00021051973,0.000086786575,0.00024227714,0.0060707354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997073,0.000110236906,0.000012118388,0.000047583297,0.00007746267,0.00004524148],"domain_scores_gemma":[0.9984939,0.0008142108,0.00023233483,0.00013284375,0.00018375304,0.00014295358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041627,0.0006348178,0.0005047269,0.0018997226,0.00085798197,0.00084811874,0.00087462267,0.0008286001,0.0018470364],"category_scores_gemma":[0.00644619,0.00033779404,0.000836111,0.000776148,0.0017332284,0.0018358723,0.001421688,0.0010103529,0.00018684614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008693035,0.000018771456,0.0004364459,0.000058441827,0.0000138530895,0.00011714283,0.00013193113,0.09423196,0.0016955145,0.8966609,0.0008630807,0.0057632294],"study_design_scores_gemma":[0.000007917824,0.000014734295,0.00020452731,0.000014679567,0.0000063701164,0.000064864296,0.000018902023,0.5534805,0.00047085734,0.4434358,0.0022661327,0.000014673828],"about_ca_topic_score_codex":0.0020131846,"about_ca_topic_score_gemma":0.0013488496,"teacher_disagreement_score":0.0020131846,"about_ca_system_score_codex":0.001301103,"about_ca_system_score_gemma":0.000651769,"threshold_uncertainty_score":0.009440243},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89356065,0.0044181375,0.080367126,0.0019262743,0.00017759492,0.00012337616,0.00034592854,0.0001824263,0.018898461],"genre_scores_gemma":[0.98863924,0.0012197932,0.0055005117,0.00006756376,0.0002600567,0.00004979227,0.00012570579,0.00003826366,0.004099102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954695,0.00022484442,0.000010032994,0.000060758062,0.00008914689,0.00006830385],"domain_scores_gemma":[0.9891839,0.009042281,0.00076233374,0.00032919063,0.00033252066,0.0003496825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089561,0.00064578926,0.000528908,0.0019972315,0.00087928865,0.0014035733,0.0010205942,0.0010806641,0.0031101494],"category_scores_gemma":[0.008838482,0.0004418679,0.00064899895,0.0015506595,0.0012087759,0.0033145566,0.00085544086,0.0014345365,0.00033501492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004691544,0.0013136376,0.05310057,0.0006422605,0.0004773767,0.0016854601,0.0023623083,0.31077752,0.010269376,0.50471914,0.013583886,0.10059935],"study_design_scores_gemma":[0.000023529416,0.0001305699,0.007998206,0.000040360854,0.000053446194,0.00036509708,0.00032233258,0.9299511,0.0008890213,0.05808991,0.0021056554,0.000030858275],"about_ca_topic_score_codex":0.0029896193,"about_ca_topic_score_gemma":0.0021066433,"teacher_disagreement_score":0.0031101494,"about_ca_system_score_codex":0.00072906236,"about_ca_system_score_gemma":0.00036269813,"threshold_uncertainty_score":0.010404468},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053916685,0.00023234665,0.8091292,0.00019098213,0.00011595478,0.00022960494,0.012145846,0.15827431,0.014290104],"genre_scores_gemma":[0.12230504,0.0016378436,0.7371735,0.0005592124,0.0001511056,0.002224581,0.06651,0.036769327,0.032669522],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993649,0.00011922905,0.00006363189,0.00007925055,0.00029135932,0.000081621794],"domain_scores_gemma":[0.99901843,0.00039663442,0.00006754379,0.00020469475,0.00026350637,0.0000491859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009878451,0.001491366,0.0008642397,0.0018242742,0.00074473413,0.0020214028,0.0031746894,0.0011943596,0.025453294],"category_scores_gemma":[0.0035342267,0.001067135,0.0017481628,0.0012764928,0.00032635863,0.0022255236,0.0019843888,0.0015884889,0.012764955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003214144,0.0002557803,0.0056833588,0.0011229428,0.00029293308,0.00073479104,0.00052536535,0.32322076,0.0105011575,0.099206515,0.32427648,0.23385845],"study_design_scores_gemma":[0.00008050062,0.000042164163,0.0008409728,0.00009069505,0.000043085838,0.00042518316,0.00005786057,0.7979591,0.005752586,0.029020136,0.16557933,0.0001083122],"about_ca_topic_score_codex":0.009256872,"about_ca_topic_score_gemma":0.009728839,"teacher_disagreement_score":0.025453294,"about_ca_system_score_codex":0.0007547321,"about_ca_system_score_gemma":0.0014705956,"threshold_uncertainty_score":0.085149765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011235794,0.00009550857,0.9863767,0.00025227814,0.000023572693,0.00010980405,0.000022084518,0.00014231469,0.0017419407],"genre_scores_gemma":[0.31508765,0.00039500184,0.68084145,0.00013822537,0.00006955965,0.00038388377,0.00011001743,0.00010974507,0.0028644446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966581,0.0016215607,0.00014887424,0.0005625962,0.000823976,0.00018498796],"domain_scores_gemma":[0.98576224,0.010853616,0.0010797055,0.0011147124,0.00093249785,0.00025728278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052319625,0.0011254557,0.00082162855,0.0013045488,0.0011040537,0.0013380317,0.0020520624,0.0016192957,0.0037845334],"category_scores_gemma":[0.02330056,0.00088040583,0.001113959,0.0010501532,0.0017877062,0.003699055,0.0019141138,0.0021577268,0.00059667986],"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.00009026975,0.00013569278,0.0011265716,0.0003783318,0.00005695078,0.0001569064,0.00035985626,0.739252,0.0051267487,0.16382176,0.001765463,0.087729394],"study_design_scores_gemma":[0.000021404663,0.000078678764,0.00010276854,0.000022137996,0.000024043129,0.000059133996,0.000047279143,0.94636565,0.0015206815,0.049221467,0.0025268828,0.000009839306],"about_ca_topic_score_codex":0.0018491943,"about_ca_topic_score_gemma":0.0024303636,"teacher_disagreement_score":0.0052319625,"about_ca_system_score_codex":0.0020660295,"about_ca_system_score_gemma":0.0014602189,"threshold_uncertainty_score":0.027669609},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066802497,0.045160167,0.67537117,0.008304501,0.0019974862,0.00017857984,0.004669803,0.0018978452,0.2557402],"genre_scores_gemma":[0.15479062,0.092915334,0.52266425,0.002042855,0.0035446365,0.0009309435,0.013500028,0.0017253595,0.20788588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993788,0.00019097001,0.000031410338,0.00011153,0.00026236972,0.000024904912],"domain_scores_gemma":[0.99855393,0.0010572545,0.000054676795,0.00016451125,0.00012724915,0.00004237039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008199438,0.0007499233,0.0004751409,0.0031911011,0.00065734383,0.0039364505,0.0007079715,0.00080720626,0.016717216],"category_scores_gemma":[0.0039031545,0.0003436702,0.00046726057,0.0057165083,0.0017168148,0.0060148747,0.0014446911,0.0014767642,0.005440098],"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.0000061078404,0.000016755117,0.0002985294,0.0003010977,0.000014633375,0.00002882402,0.00067287474,0.0019555439,0.00027892966,0.75542754,0.06894864,0.17205054],"study_design_scores_gemma":[0.0000014599316,0.000003873383,0.00034406089,0.00019474197,0.0000069212297,0.00010282458,0.00033844548,0.00593603,0.0001790951,0.71028084,0.28260118,0.00001052511],"about_ca_topic_score_codex":0.0022563396,"about_ca_topic_score_gemma":0.0035281614,"teacher_disagreement_score":0.016717216,"about_ca_system_score_codex":0.0012892657,"about_ca_system_score_gemma":0.0010801969,"threshold_uncertainty_score":0.055924714},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005948243,0.020258367,0.03192929,0.89790374,0.004727621,0.00023396278,0.00012906922,0.00008738458,0.038782373],"genre_scores_gemma":[0.6925402,0.04989826,0.07886275,0.13178432,0.029394442,0.0046965773,0.0002781119,0.00038808782,0.012157309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.7966053,0.15697779,0.0054299976,0.009764354,0.023146998,0.00807566],"domain_scores_gemma":[0.3051389,0.5958133,0.017816052,0.02901702,0.028426094,0.023788713],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.36843035,0.0019276271,0.0036290297,0.009601904,0.018348949,0.05555043,0.0071116784,0.03022437,0.010341175],"category_scores_gemma":[0.49623486,0.0017460587,0.0016144088,0.0067896326,0.088454664,0.121493936,0.020977521,0.023587018,0.003916458],"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.00011591872,0.00011841149,0.0030750534,0.0014152093,0.000119169046,0.00029366298,0.01117561,0.0006401464,0.00024949465,0.89166135,0.036257777,0.054878242],"study_design_scores_gemma":[0.000039719092,0.000025143381,0.0005281912,0.0017562654,0.000025776315,0.00014941358,0.010446629,0.0006794319,0.000170467,0.9557366,0.030388374,0.000054089454],"about_ca_topic_score_codex":0.0034691258,"about_ca_topic_score_gemma":0.0044346894,"teacher_disagreement_score":0.36843035,"about_ca_system_score_codex":0.011416967,"about_ca_system_score_gemma":0.021510493,"threshold_uncertainty_score":0.7788378},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060600536,0.00014105944,0.9928731,0.00018452303,0.000029585151,0.000027167951,0.000045312037,0.00011717638,0.00052199594],"genre_scores_gemma":[0.5159281,0.00062318466,0.48051628,0.0003691092,0.00033102013,0.00053831784,0.00042135108,0.00019027313,0.001082322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98233336,0.0140660945,0.00037746568,0.0012297183,0.0017255222,0.00026788795],"domain_scores_gemma":[0.8476214,0.13137661,0.0045820987,0.01163128,0.004218237,0.0005704883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028413765,0.00088528846,0.0016778056,0.0035083129,0.0008605398,0.0017599788,0.0025609585,0.0016997133,0.0024751625],"category_scores_gemma":[0.13996616,0.00071806397,0.0016459149,0.002418752,0.0049193418,0.0039229873,0.002573015,0.003152437,0.00040599564],"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.00012820371,0.00007843696,0.0067244293,0.00020520801,0.0003772577,0.0002894366,0.00033254226,0.31660533,0.0012217003,0.61404866,0.001978378,0.058010362],"study_design_scores_gemma":[0.00001979956,0.000027455248,0.0007359787,0.00004110232,0.000020452802,0.0000464231,0.00003354632,0.7094771,0.00047362494,0.28784835,0.0012590048,0.000017090308],"about_ca_topic_score_codex":0.005286923,"about_ca_topic_score_gemma":0.0029202546,"teacher_disagreement_score":0.028413765,"about_ca_system_score_codex":0.0014174384,"about_ca_system_score_gemma":0.0013582355,"threshold_uncertainty_score":0.15026814},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9758832,0.005105346,0.0019212292,0.0017350246,0.00003082121,0.000026570631,0.008948467,0.00004754287,0.006301787],"genre_scores_gemma":[0.98922205,0.0019566058,0.0014918575,0.000068254,0.00007634279,0.000032775555,0.0063859248,0.000014621166,0.0007515067],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998226,0.00033726092,0.00026866386,0.00033583303,0.00060713215,0.00022509616],"domain_scores_gemma":[0.97956663,0.008020037,0.0072458484,0.00082617707,0.0032653199,0.0010760161],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.001989791,0.0002475501,0.00036935188,0.017694421,0.0007737354,0.0029291736,0.00038022295,0.00057301606,0.0013861029],"category_scores_gemma":[0.016670166,0.00017668295,0.00035446914,0.025956105,0.00054872135,0.0046551144,0.0012158267,0.0006927044,0.00039589286],"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.00009511705,0.00007549889,0.91206646,0.00040376972,0.00020124666,0.00059584354,0.0044542346,0.0040086224,0.0012444309,0.0079128,0.0059176204,0.06302433],"study_design_scores_gemma":[0.0000028294287,0.000035599784,0.9744631,0.00012819094,0.00006100825,0.0003171788,0.002938864,0.005178575,0.00057735486,0.0019417999,0.014332806,0.00002269776],"about_ca_topic_score_codex":0.014570976,"about_ca_topic_score_gemma":0.020706696,"teacher_disagreement_score":0.9980102,"about_ca_system_score_codex":0.0020006627,"about_ca_system_score_gemma":0.0013674287,"threshold_uncertainty_score":0.028972328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5128548,0.024251202,0.39650905,0.0030596429,0.00035562133,0.00012596382,0.0011170865,0.00052342797,0.061203226],"genre_scores_gemma":[0.9665205,0.0040717022,0.026998261,0.000121669036,0.00021354988,0.000097755896,0.00022114081,0.000026754557,0.001728678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999663,0.00007951626,0.000020196834,0.00007332867,0.00012042697,0.000043522854],"domain_scores_gemma":[0.99804115,0.0010819945,0.0003858364,0.00016823714,0.00022524642,0.0000975297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047606844,0.00026474823,0.0003097228,0.002687667,0.00039022497,0.0015247567,0.00029295415,0.00045615347,0.00091947615],"category_scores_gemma":[0.0052368767,0.00019993873,0.00024583077,0.0012232221,0.0012482806,0.0016152974,0.0005474435,0.0005662398,0.00013567737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030714473,0.0000144430405,0.004117967,0.00019699988,0.00005715729,0.00022294652,0.00071983424,0.038252246,0.006744274,0.904569,0.0038072404,0.041267235],"study_design_scores_gemma":[0.000014321742,0.00002233389,0.010008087,0.0000701542,0.00002105718,0.00053493236,0.00018610025,0.120727375,0.0014988504,0.8486281,0.018242136,0.000046533758],"about_ca_topic_score_codex":0.00073488866,"about_ca_topic_score_gemma":0.0003340352,"teacher_disagreement_score":0.002687667,"about_ca_system_score_codex":0.00076503237,"about_ca_system_score_gemma":0.0002700599,"threshold_uncertainty_score":0.0055506825},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8844219,0.0002572652,0.10405782,0.00057614397,0.000021734353,0.000026910644,0.00034173165,0.000101614256,0.0101948455],"genre_scores_gemma":[0.99333644,0.000088313944,0.004138331,0.000040935047,0.00001857582,0.000023896406,0.00013611914,0.00001992946,0.0021974759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998534,0.000043569267,0.000004982459,0.00003669768,0.000025799342,0.000035528334],"domain_scores_gemma":[0.9979686,0.001258609,0.00024152853,0.00014246679,0.00019423156,0.0001945571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007461836,0.00022480484,0.0003216726,0.0015978119,0.0005598483,0.00066963537,0.0006817173,0.0005762118,0.0057653007],"category_scores_gemma":[0.0028560234,0.00017270671,0.00035456612,0.00076406554,0.0008190434,0.001277025,0.0005703736,0.00046586583,0.00020991072],"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.00034891733,0.00011823454,0.009561704,0.00012258704,0.00009684512,0.0004884942,0.00044209915,0.1465352,0.014947198,0.81047505,0.0024809402,0.014382681],"study_design_scores_gemma":[0.0000227555,0.0000318691,0.011612661,0.000015114347,0.00002509609,0.00020147636,0.00016987174,0.7828299,0.0010110335,0.20344599,0.00060629187,0.000028035534],"about_ca_topic_score_codex":0.0012306619,"about_ca_topic_score_gemma":0.0010984166,"teacher_disagreement_score":0.0057653007,"about_ca_system_score_codex":0.00060505327,"about_ca_system_score_gemma":0.00029050463,"threshold_uncertainty_score":0.019286811},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20169215,0.0009182627,0.7741296,0.002140245,0.00027011542,0.00011462701,0.00052372506,0.00026958977,0.019941686],"genre_scores_gemma":[0.9213847,0.0014446029,0.04491001,0.00034274763,0.00025814833,0.00030356884,0.00051144406,0.00016777073,0.030676987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993117,0.00027971028,0.000025104186,0.0001546691,0.00013938425,0.000089434645],"domain_scores_gemma":[0.99744886,0.0011968191,0.0004891103,0.00013741666,0.00035863984,0.00036924772],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0013684527,0.00078432955,0.0013761794,0.0021105413,0.0010150219,0.0018138203,0.0036379374,0.0027379626,0.004960357],"category_scores_gemma":[0.0074863215,0.0007067103,0.0011104821,0.0021973315,0.0016567389,0.004209807,0.0014703547,0.0014243855,0.0006312008],"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.000057468555,0.000057087876,0.0012062987,0.000079461424,0.00008129074,0.0003025019,0.0002211207,0.5833784,0.0018737264,0.40376925,0.0019212132,0.0070522563],"study_design_scores_gemma":[0.000012556081,0.000012203254,0.00016382332,0.000004960571,0.000012577581,0.000040380288,0.000019577647,0.95507306,0.00005880073,0.044081647,0.0005109931,0.00000944628],"about_ca_topic_score_codex":0.0060061575,"about_ca_topic_score_gemma":0.0041649644,"teacher_disagreement_score":0.99788946,"about_ca_system_score_codex":0.0015449624,"about_ca_system_score_gemma":0.0010459198,"threshold_uncertainty_score":0.016594052},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71100956,0.0013195672,0.2762363,0.000527739,0.00004379487,0.00013963023,0.003332674,0.0005680911,0.006822593],"genre_scores_gemma":[0.96798015,0.00030750898,0.027646946,0.000059086953,0.000050413244,0.00010615051,0.0024004686,0.000060997932,0.0013882596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983531,0.00060219323,0.000111608126,0.00048722536,0.00034469494,0.00010120564],"domain_scores_gemma":[0.9930454,0.0038132153,0.0010971455,0.0011124746,0.0005875283,0.0003442406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016908926,0.00042682668,0.0007688034,0.006172273,0.00071395014,0.001910848,0.0007277549,0.0010593412,0.002135009],"category_scores_gemma":[0.01499772,0.00029240304,0.00053122174,0.0049375165,0.0012961198,0.0054028067,0.0018563654,0.000666823,0.0004949701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088624866,0.00036965997,0.19745982,0.0012465017,0.0004895016,0.0011649485,0.003939959,0.16970466,0.009905401,0.34974533,0.01498923,0.25009885],"study_design_scores_gemma":[0.00006573655,0.00014399624,0.042870384,0.00009357316,0.0001221747,0.00092153944,0.0011862149,0.40818313,0.0024182703,0.53297275,0.010963393,0.000058992442],"about_ca_topic_score_codex":0.0012554982,"about_ca_topic_score_gemma":0.0018158902,"teacher_disagreement_score":0.006172273,"about_ca_system_score_codex":0.0006690584,"about_ca_system_score_gemma":0.00022981633,"threshold_uncertainty_score":0.008942425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5069824,0.00023731696,0.4780883,0.0008220605,0.00010319413,0.00024375635,0.00035264212,0.00038975544,0.012780629],"genre_scores_gemma":[0.91838,0.00013898089,0.08010476,0.000028247854,0.000016615624,0.000074051844,0.00017315133,0.000024998351,0.0010591926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908435,0.00042396557,0.00003818005,0.00020906872,0.0001817734,0.00006259626],"domain_scores_gemma":[0.99788386,0.0012130573,0.00027682612,0.00022378162,0.00027330033,0.00012923479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001058273,0.00046160168,0.00023159609,0.0026892985,0.0006665644,0.0023294429,0.0005751945,0.00053653616,0.0012177177],"category_scores_gemma":[0.005978114,0.00025012714,0.0003382523,0.0011843764,0.0009319232,0.0056326655,0.0013022467,0.0005973989,0.0002610698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006346352,0.00069589325,0.16358684,0.00042156407,0.00020819249,0.0014956174,0.023322446,0.13057467,0.034039382,0.24353586,0.004636243,0.39684877],"study_design_scores_gemma":[0.00001463724,0.000083053106,0.028405571,0.000060876057,0.000058822417,0.0003535016,0.011850784,0.83663183,0.008828115,0.098140076,0.01550545,0.000067230496],"about_ca_topic_score_codex":0.0031769488,"about_ca_topic_score_gemma":0.005541552,"teacher_disagreement_score":0.0031769488,"about_ca_system_score_codex":0.00085045386,"about_ca_system_score_gemma":0.00045672563,"threshold_uncertainty_score":0.00631696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04467297,0.00026163962,0.95105094,0.00038066527,0.000033552238,0.00015095017,0.0012420475,0.00070171605,0.0015055533],"genre_scores_gemma":[0.46446684,0.0003810547,0.5261062,0.0001314788,0.00010149668,0.00044021974,0.005582307,0.00028610983,0.0025043085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936633,0.0019425382,0.00032714655,0.0015502751,0.002011249,0.0005054963],"domain_scores_gemma":[0.98409903,0.008251806,0.001208199,0.0033807019,0.0025297601,0.00053050474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051629604,0.0011624935,0.0020375242,0.0065833568,0.0018868624,0.0035180917,0.0032144655,0.0017267262,0.002199593],"category_scores_gemma":[0.022721602,0.0007094794,0.00208849,0.009076138,0.0014486263,0.004764669,0.0031392584,0.0023711787,0.0008813201],"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.0010475245,0.0006635603,0.028849786,0.00059288373,0.0006617541,0.00052886334,0.0010258689,0.5278539,0.006805596,0.13175432,0.012436289,0.28777972],"study_design_scores_gemma":[0.00001945373,0.00004276196,0.0022217855,0.000018219558,0.000054486856,0.00013177203,0.0002464179,0.90747595,0.002907759,0.08348496,0.003364379,0.000032117303],"about_ca_topic_score_codex":0.0051208762,"about_ca_topic_score_gemma":0.0046851523,"teacher_disagreement_score":0.0065833568,"about_ca_system_score_codex":0.002006607,"about_ca_system_score_gemma":0.0020682653,"threshold_uncertainty_score":0.02730465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7540816,0.001429434,0.22999091,0.0014786299,0.00009250925,0.00010449175,0.0007296833,0.0009872256,0.01110549],"genre_scores_gemma":[0.98742604,0.00023731728,0.010960266,0.000067815025,0.000043465905,0.000064163374,0.0002112969,0.000055146058,0.0009344887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980823,0.0007332399,0.000097751246,0.00041078584,0.00048144045,0.00019445052],"domain_scores_gemma":[0.927829,0.052160036,0.009463362,0.0053022113,0.0039685,0.0012769004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037325427,0.0005393043,0.0006635731,0.002553979,0.0006171189,0.0015198122,0.0006113697,0.00092271675,0.0020045273],"category_scores_gemma":[0.06874808,0.0003544485,0.00037143147,0.0017273232,0.0024047557,0.0030879446,0.00079689396,0.0014425094,0.00052925997],"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.0008928669,0.0003242734,0.07264757,0.0005072883,0.00025010988,0.00095983734,0.0013151044,0.42936662,0.026275683,0.3369079,0.008782175,0.12177046],"study_design_scores_gemma":[0.00008371626,0.0003122372,0.028740833,0.000059783964,0.00004191987,0.0007547876,0.00020411155,0.76223373,0.006714344,0.19827269,0.002468496,0.00011331368],"about_ca_topic_score_codex":0.0011810856,"about_ca_topic_score_gemma":0.0009311705,"teacher_disagreement_score":0.0037325427,"about_ca_system_score_codex":0.0007713796,"about_ca_system_score_gemma":0.0005373053,"threshold_uncertainty_score":0.019739807},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41912365,0.0009490135,0.56618685,0.001187982,0.000054611584,0.000054685435,0.00019695234,0.0002286876,0.012017538],"genre_scores_gemma":[0.97436327,0.0007504036,0.02172034,0.00008134077,0.000034923392,0.00006270787,0.00008275189,0.000025483021,0.0028786878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996909,0.00012873404,0.000012721476,0.00005317039,0.00007602693,0.00003847944],"domain_scores_gemma":[0.9985133,0.00092540483,0.0002688042,0.00009844135,0.00012703807,0.00006712374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007267524,0.000367578,0.0003558772,0.0012405667,0.0004488163,0.0012989733,0.00056549744,0.0008641499,0.00090271974],"category_scores_gemma":[0.0036008253,0.0003052878,0.00040909587,0.0007750693,0.0010468973,0.0019196386,0.0007334858,0.00055325305,0.00015263016],"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.000030160794,0.000025331801,0.0022854712,0.000049769154,0.000038017024,0.0003427986,0.00029439133,0.67099726,0.0046623475,0.31364036,0.00062290113,0.0070111877],"study_design_scores_gemma":[0.000005887591,0.000007154781,0.00042991847,0.0000047665217,0.000004472666,0.00007390461,0.000023974146,0.93563116,0.00022886886,0.06313938,0.00044256856,0.000007955191],"about_ca_topic_score_codex":0.002465763,"about_ca_topic_score_gemma":0.0015400486,"teacher_disagreement_score":0.002465763,"about_ca_system_score_codex":0.0007987436,"about_ca_system_score_gemma":0.00030797964,"threshold_uncertainty_score":0.0057953596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29089075,0.0016668667,0.68784076,0.0012194843,0.0000998777,0.00010002316,0.00023255216,0.00037158557,0.01757814],"genre_scores_gemma":[0.952688,0.0015053613,0.040302195,0.00010558676,0.00006169056,0.00012473356,0.0001366247,0.00006822319,0.005007648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996582,0.00015225589,0.000014632024,0.00004679114,0.00008108133,0.000046981757],"domain_scores_gemma":[0.99694794,0.0022221473,0.00041125764,0.00010954948,0.0002024365,0.00010683006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012634359,0.0005626024,0.00046518314,0.0019854023,0.0005394742,0.0011415933,0.00068425713,0.0009438925,0.0024387944],"category_scores_gemma":[0.0090005705,0.00028695367,0.0006008215,0.0009987102,0.0010629816,0.0027552105,0.0007286553,0.00081540557,0.00022707388],"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.000047922065,0.000022312373,0.0018200184,0.000058291433,0.000029677918,0.00025742635,0.00036100156,0.7046152,0.002789754,0.2822256,0.00065144897,0.0071213054],"study_design_scores_gemma":[0.0000065385493,0.000008593868,0.00029156744,0.0000095725345,0.0000066692414,0.000054231223,0.000021525206,0.9629576,0.00018660564,0.035894196,0.0005537507,0.000009106335],"about_ca_topic_score_codex":0.0031752323,"about_ca_topic_score_gemma":0.0013945804,"teacher_disagreement_score":0.0031752323,"about_ca_system_score_codex":0.0012064835,"about_ca_system_score_gemma":0.00037258974,"threshold_uncertainty_score":0.008753717},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3660207,0.00022521635,0.63095856,0.00040186924,0.00006941019,0.00007785808,0.00016295079,0.0005980415,0.0014853949],"genre_scores_gemma":[0.96090704,0.00007125975,0.03838622,0.000025975765,0.000026508713,0.000028671118,0.00009381087,0.000018156503,0.00044241187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943215,0.00015520124,0.000028832183,0.00016678953,0.0001426021,0.00007436283],"domain_scores_gemma":[0.9972656,0.0014529276,0.00029125734,0.00021687862,0.0005743352,0.00019908033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010948782,0.00038512604,0.00074085535,0.0016200166,0.0006667731,0.0009808826,0.0012184881,0.0008032577,0.00076029776],"category_scores_gemma":[0.006626467,0.00023242984,0.00048349358,0.00072386145,0.00079897733,0.0019114654,0.0011414797,0.00078900054,0.000101055906],"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.00095215,0.00042365972,0.06781861,0.00038154362,0.0004123291,0.0016385741,0.0010393938,0.46645218,0.044956807,0.20643182,0.006185238,0.2033077],"study_design_scores_gemma":[0.000004595699,0.000026256535,0.0014561559,0.0000027785889,0.000009119388,0.00007678522,0.000027225722,0.9856129,0.0010133818,0.011650807,0.00011021845,0.000009722844],"about_ca_topic_score_codex":0.0029575063,"about_ca_topic_score_gemma":0.0023176575,"teacher_disagreement_score":0.0029575063,"about_ca_system_score_codex":0.00066407636,"about_ca_system_score_gemma":0.00050597644,"threshold_uncertainty_score":0.0058805346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9805117,0.00027640502,0.005270294,0.0013468523,0.00002717257,0.00009042023,0.0002902612,0.000084041894,0.012102986],"genre_scores_gemma":[0.99630296,0.00018616865,0.0023833576,0.00005268052,0.000023960913,0.000038790316,0.00010352937,0.000020379804,0.000888122],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998971,0.00056567113,0.000044974095,0.00012028429,0.00020933566,0.00008869055],"domain_scores_gemma":[0.9807523,0.014299237,0.0024532299,0.0006028827,0.0012452963,0.00064709364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013436902,0.00027966066,0.00025556283,0.0022475254,0.0016700879,0.004091768,0.00040327813,0.00076611794,0.0026214882],"category_scores_gemma":[0.016581083,0.00020426992,0.00024299088,0.0028932116,0.0011666619,0.0048482455,0.00092061184,0.000630208,0.000381035],"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.0004885741,0.00072068913,0.74675107,0.000478203,0.00014654957,0.0010884997,0.08030538,0.002880176,0.008778451,0.013810135,0.0025576514,0.14199471],"study_design_scores_gemma":[0.00001881355,0.00030651226,0.8501687,0.00025866547,0.0000897255,0.0007905892,0.098786905,0.0198875,0.0029672638,0.014225124,0.012372864,0.00012725449],"about_ca_topic_score_codex":0.0056946375,"about_ca_topic_score_gemma":0.011464591,"teacher_disagreement_score":0.0056946375,"about_ca_system_score_codex":0.00080753665,"about_ca_system_score_gemma":0.0005469895,"threshold_uncertainty_score":0.011322975},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99131083,0.00080911774,0.0023185823,0.00036601155,0.000008645552,0.000015646565,0.0001951259,0.000014144245,0.0049619335],"genre_scores_gemma":[0.9990181,0.00018452966,0.0004929948,0.000008729704,0.0000113740025,0.0000090759495,0.0000873723,0.000002413061,0.00018544261],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99640083,0.0013356853,0.0004023579,0.0006497971,0.00088190165,0.00032944893],"domain_scores_gemma":[0.93194216,0.044881314,0.016130764,0.002380098,0.002833875,0.0018318766],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0030667724,0.0001960325,0.00030125387,0.007502477,0.0010250449,0.002998329,0.0006361678,0.00069575437,0.0015592648],"category_scores_gemma":[0.03688492,0.00018719118,0.0002698504,0.009680797,0.0013389189,0.005216933,0.0025065623,0.00039101054,0.000295842],"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.00009611814,0.00006247599,0.9510005,0.00013109768,0.0001588103,0.00017406738,0.009923577,0.0009806859,0.0011284704,0.0037380336,0.0003083781,0.032297738],"study_design_scores_gemma":[0.000008623006,0.00006726227,0.9714067,0.000090120244,0.00006295614,0.00063344627,0.010396289,0.0060466467,0.0007075586,0.0077612763,0.0027897272,0.000029468874],"about_ca_topic_score_codex":0.0027299568,"about_ca_topic_score_gemma":0.0049099303,"teacher_disagreement_score":0.9969332,"about_ca_system_score_codex":0.001140708,"about_ca_system_score_gemma":0.00084830186,"threshold_uncertainty_score":0.016218841},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9002855,0.0003360859,0.09504449,0.00041178992,0.0000270924,0.00008480626,0.0017384702,0.00047033673,0.001601466],"genre_scores_gemma":[0.9873726,0.00017877095,0.010031389,0.000017230012,0.000025594096,0.000060061895,0.0010936228,0.00006869189,0.0011520567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99904746,0.0003325546,0.000072124116,0.00027344242,0.00016791988,0.00010648371],"domain_scores_gemma":[0.95886517,0.03125646,0.0050391126,0.0017257489,0.0024262976,0.00068720704],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.002227724,0.00067948893,0.00061733153,0.004695579,0.00044072117,0.0019913758,0.00095601054,0.0015824761,0.0013894559],"category_scores_gemma":[0.037233084,0.0005109225,0.0006747555,0.005892172,0.0004688172,0.003897806,0.0005507754,0.0011593534,0.00052298943],"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.00046648365,0.00037648279,0.24265762,0.00032174343,0.00025014867,0.00049301586,0.0007260037,0.6830128,0.0067345295,0.014760737,0.0023090115,0.0478914],"study_design_scores_gemma":[0.000007814005,0.000023495293,0.01599296,0.000008858912,0.000023706323,0.000087730004,0.000051113882,0.9767047,0.0005253697,0.006244977,0.00032018372,0.000009229451],"about_ca_topic_score_codex":0.008898867,"about_ca_topic_score_gemma":0.012005139,"teacher_disagreement_score":0.9953044,"about_ca_system_score_codex":0.001309254,"about_ca_system_score_gemma":0.0007012536,"threshold_uncertainty_score":0.017694116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07297213,0.0018810984,0.89036936,0.001399609,0.0002130654,0.00007626095,0.00016139518,0.00015032571,0.03277665],"genre_scores_gemma":[0.90504855,0.002573206,0.07863602,0.0004504297,0.00033380472,0.00018348223,0.0001520721,0.000085672,0.012536775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995809,0.00017543371,0.000015413018,0.00007084439,0.000113660564,0.000043766213],"domain_scores_gemma":[0.9993747,0.00029062343,0.00010169185,0.00007465357,0.000081552884,0.000076695906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066395896,0.00071208796,0.0006153625,0.0017134602,0.00057017384,0.0012432802,0.0013839391,0.0012963538,0.0023768977],"category_scores_gemma":[0.0023842563,0.00027633016,0.00075150793,0.0009046221,0.0014490403,0.0023358348,0.0011795278,0.0013349087,0.00041219374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010026682,0.000017773047,0.00021056349,0.000033399618,0.00001733713,0.00014052702,0.00008960271,0.09226376,0.0012494258,0.9023818,0.0007527937,0.0028329864],"study_design_scores_gemma":[0.000008289005,0.000012760604,0.00016374809,0.000012931501,0.000011043529,0.00006599819,0.000021723208,0.55156714,0.00023116927,0.44605944,0.0018328637,0.000012999187],"about_ca_topic_score_codex":0.001166323,"about_ca_topic_score_gemma":0.00087605265,"teacher_disagreement_score":0.0023768977,"about_ca_system_score_codex":0.00089885824,"about_ca_system_score_gemma":0.00039753548,"threshold_uncertainty_score":0.007951498},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68056315,0.0037875427,0.24589162,0.0064632893,0.00034994417,0.00007717616,0.001071134,0.000506893,0.06128923],"genre_scores_gemma":[0.9689359,0.0026993915,0.018275483,0.00040574692,0.0007415681,0.00016873432,0.0005645005,0.00016395893,0.008044765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988073,0.00044012777,0.000043995336,0.00027243243,0.00028176422,0.00015441615],"domain_scores_gemma":[0.9800729,0.01378606,0.0020364686,0.0009189418,0.0010695858,0.0021160196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018998085,0.0008000638,0.0014094006,0.0035148289,0.0022450031,0.003756461,0.0020343736,0.0015574263,0.0036082065],"category_scores_gemma":[0.018313728,0.0011135717,0.0005458681,0.0023060762,0.0035483914,0.0074004354,0.0027326907,0.0020919123,0.0005671162],"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.00014749457,0.000036846228,0.0020987664,0.00013609287,0.000034190864,0.00012035769,0.00058135693,0.019072851,0.002289705,0.9597374,0.004954707,0.010790142],"study_design_scores_gemma":[0.000020763086,0.000030202653,0.0014773636,0.000041821404,0.00002687489,0.00029841604,0.00019882641,0.08033013,0.0008318385,0.91149175,0.005228838,0.000023208935],"about_ca_topic_score_codex":0.0011967431,"about_ca_topic_score_gemma":0.00091849366,"teacher_disagreement_score":0.003756461,"about_ca_system_score_codex":0.0017650889,"about_ca_system_score_gemma":0.0006365952,"threshold_uncertainty_score":0.012806654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5916195,0.00069192477,0.3975422,0.0016317938,0.00009534199,0.000075806216,0.00017840177,0.00012360452,0.008041467],"genre_scores_gemma":[0.98742115,0.00042741673,0.00737303,0.00008763278,0.00003880601,0.000043758995,0.000042014923,0.000019926514,0.004546208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967015,0.00013638793,0.000013869482,0.00005173188,0.000059813767,0.00006804737],"domain_scores_gemma":[0.9978131,0.0011557476,0.00048610853,0.0001530322,0.00019339031,0.00019848025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010691839,0.0006889215,0.00068329886,0.00090872817,0.00047216736,0.001232638,0.0010998144,0.0012853588,0.0015507148],"category_scores_gemma":[0.005138797,0.00045030852,0.00069207617,0.0005766362,0.0013286283,0.00216015,0.0011403837,0.001199056,0.00018327568],"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.00015777064,0.00006976735,0.002455694,0.000066627865,0.0000796753,0.00086071243,0.00028302043,0.777935,0.004878738,0.20736922,0.0010090602,0.0048346096],"study_design_scores_gemma":[0.0000193626,0.00002002009,0.00026448997,0.000005791235,0.0000116596875,0.00004823864,0.0000306878,0.97223645,0.00025160718,0.026893536,0.00020663922,0.000011508012],"about_ca_topic_score_codex":0.003035117,"about_ca_topic_score_gemma":0.0019197043,"teacher_disagreement_score":0.003035117,"about_ca_system_score_codex":0.00087594206,"about_ca_system_score_gemma":0.0004433015,"threshold_uncertainty_score":0.006355405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068225175,0.0015029971,0.91919905,0.0026517927,0.00019397296,0.00016163735,0.0010293041,0.002515326,0.0045206835],"genre_scores_gemma":[0.45824978,0.0026027032,0.53194284,0.00072276074,0.0002200489,0.00025146542,0.0024026667,0.0003694038,0.0032383257],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992418,0.00027193307,0.00005103072,0.00013318134,0.00025285815,0.00004918667],"domain_scores_gemma":[0.9961733,0.0015920638,0.0003091661,0.0014732176,0.0003799592,0.00007230407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009587612,0.0005824599,0.00059849303,0.0021665092,0.0004028428,0.0017997298,0.0013591897,0.00077790325,0.0022979423],"category_scores_gemma":[0.007551074,0.00032461065,0.00060062914,0.0038114528,0.00086152274,0.008086173,0.0011240896,0.0010775303,0.0005802748],"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.00049288885,0.00018286594,0.0036162355,0.0004667495,0.00018441817,0.000497704,0.00079017493,0.29019916,0.014998643,0.22963117,0.015982129,0.44295794],"study_design_scores_gemma":[0.00003595175,0.000064352695,0.000649464,0.00006617549,0.000038473503,0.00033531483,0.0003048421,0.7603421,0.009887954,0.21334222,0.014902914,0.00003024893],"about_ca_topic_score_codex":0.0024852396,"about_ca_topic_score_gemma":0.0026155743,"teacher_disagreement_score":0.0024852396,"about_ca_system_score_codex":0.0010397369,"about_ca_system_score_gemma":0.0007410481,"threshold_uncertainty_score":0.00768739},"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":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032683495,0.113010935,0.53292024,0.07331502,0.2013618,0.0004200942,0.0053072604,0.0032399811,0.0671563],"genre_scores_gemma":[0.02830752,0.106329784,0.2557331,0.032468766,0.35478723,0.0007940507,0.0049853637,0.0023613195,0.21423282],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983657,0.00032230647,0.00018881218,0.00038247343,0.00065583305,0.00008486256],"domain_scores_gemma":[0.9937627,0.0029897236,0.0003389056,0.0009462082,0.0013611632,0.00060133386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002183861,0.0012839217,0.001745655,0.0062761945,0.0014934423,0.0055109747,0.0013354644,0.0022219708,0.02372604],"category_scores_gemma":[0.00891638,0.00070491264,0.0016283495,0.0058224574,0.0020475227,0.0070443335,0.0023318257,0.005058515,0.015127935],"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.00005448767,0.00013021345,0.00070629147,0.00081202696,0.000061213075,0.000135461,0.00015158852,0.00070461666,0.0018661113,0.084921055,0.66546506,0.24499194],"study_design_scores_gemma":[0.000009352494,0.00004439957,0.0008979345,0.00017252742,0.000030126745,0.00037314362,0.00005971095,0.00244554,0.000531635,0.055104867,0.9402887,0.000042035703],"about_ca_topic_score_codex":0.0008122455,"about_ca_topic_score_gemma":0.0012402931,"teacher_disagreement_score":0.02372604,"about_ca_system_score_codex":0.0009885055,"about_ca_system_score_gemma":0.0013074204,"threshold_uncertainty_score":0.07937151},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2621924,0.0019626117,0.7120248,0.0013154625,0.00009621077,0.00009766355,0.000101592675,0.00018754986,0.022021692],"genre_scores_gemma":[0.9847686,0.00078348746,0.0127167655,0.00007538264,0.000045037767,0.00007329192,0.000018800747,0.000025826783,0.0014927778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996977,0.00014920699,0.000008029849,0.00003125336,0.000062403466,0.000051428717],"domain_scores_gemma":[0.99855536,0.0010188071,0.00016904355,0.000079089456,0.00007692577,0.00010084159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007656045,0.00065403647,0.00059019803,0.00058563706,0.00058422156,0.00082214625,0.0007609193,0.00085322576,0.0012028201],"category_scores_gemma":[0.0027950862,0.00025112717,0.000525398,0.00047187554,0.0023617058,0.0014708694,0.00092593924,0.0006779259,0.00010054204],"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.000031669733,0.000023523258,0.0003181422,0.00006914008,0.000023096696,0.00017182932,0.00009345629,0.7074057,0.00563976,0.2827742,0.00043300423,0.003016482],"study_design_scores_gemma":[0.000008691357,0.00001904002,0.00011543054,0.0000054353704,0.000006556784,0.000019609564,0.000011845217,0.9490253,0.00046345755,0.04999795,0.00031506302,0.000011594617],"about_ca_topic_score_codex":0.0021507149,"about_ca_topic_score_gemma":0.00107447,"teacher_disagreement_score":0.0021507149,"about_ca_system_score_codex":0.0013573724,"about_ca_system_score_gemma":0.0004524582,"threshold_uncertainty_score":0.009848475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02388113,0.00097491534,0.9649984,0.0011064699,0.000061645835,0.00015355997,0.0016130431,0.0041571995,0.0030535406],"genre_scores_gemma":[0.21210666,0.0014441024,0.78217685,0.00012090502,0.00010580267,0.00026778274,0.0016669352,0.00039284304,0.0017182225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880743,0.0004115817,0.00009464375,0.00025470383,0.00035842913,0.00007318784],"domain_scores_gemma":[0.9968395,0.001876026,0.00045791417,0.00032490212,0.00034828897,0.00015342855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013379807,0.0013104771,0.0007656512,0.008825142,0.0010151326,0.0029955988,0.0014274475,0.0012947761,0.0046455683],"category_scores_gemma":[0.006949107,0.00059094664,0.0011205326,0.005200588,0.00067027286,0.0051323213,0.0020164617,0.0011027377,0.00092248555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048082706,0.000274495,0.017689042,0.0016025435,0.00058018614,0.002129448,0.0064431513,0.083798245,0.028110847,0.14607948,0.034600046,0.6782117],"study_design_scores_gemma":[0.000084262356,0.00012368742,0.005197054,0.00025044614,0.00015043064,0.0025541827,0.0020329957,0.6714875,0.008793029,0.24633947,0.062858105,0.00012885213],"about_ca_topic_score_codex":0.0025559864,"about_ca_topic_score_gemma":0.0028661254,"teacher_disagreement_score":0.008825142,"about_ca_system_score_codex":0.00061319454,"about_ca_system_score_gemma":0.0006974745,"threshold_uncertainty_score":0.015540957},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06978099,0.00058011233,0.924515,0.0003733182,0.00008555193,0.0002985526,0.000394555,0.0014105311,0.0025614034],"genre_scores_gemma":[0.38236913,0.00046413852,0.6111705,0.0003105763,0.00013450615,0.00048138652,0.0014173695,0.0003489769,0.0033034408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836856,0.000517352,0.00006941529,0.0004163206,0.000511595,0.00011677252],"domain_scores_gemma":[0.98884445,0.0078043663,0.0009782662,0.0010481281,0.0009603046,0.00036449797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018869656,0.0015981703,0.0017701649,0.003588905,0.0012478824,0.001308111,0.0021140561,0.0021584735,0.0041772663],"category_scores_gemma":[0.01707276,0.0008754465,0.0015728509,0.0019894028,0.0013086848,0.0036042004,0.0025458834,0.0019771117,0.0006758735],"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.00029569134,0.00028844553,0.005943553,0.00060898234,0.00019019195,0.00066079386,0.0004896233,0.6297741,0.010993466,0.05502411,0.008154308,0.2875768],"study_design_scores_gemma":[0.000036045396,0.00008316633,0.00057621155,0.000035822817,0.00003829811,0.00016869498,0.00007473069,0.95759034,0.0025750513,0.036192596,0.002609476,0.00001958964],"about_ca_topic_score_codex":0.003753771,"about_ca_topic_score_gemma":0.0074543823,"teacher_disagreement_score":0.0041772663,"about_ca_system_score_codex":0.0009465799,"about_ca_system_score_gemma":0.0012165682,"threshold_uncertainty_score":0.013974369},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012309161,0.00126865,0.97233325,0.00069340365,0.000060869104,0.00004802723,0.00013440338,0.000106588435,0.01304556],"genre_scores_gemma":[0.78284204,0.008743816,0.1907276,0.0006369329,0.0005171736,0.0005817984,0.0005614851,0.00023873725,0.015150362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922204,0.0002851599,0.000025058067,0.000107321146,0.00027866976,0.000081861275],"domain_scores_gemma":[0.99719846,0.0018709152,0.0003443047,0.00015254332,0.00032947375,0.000104304956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014095684,0.00073841936,0.0007238287,0.0022406518,0.0006284617,0.0016554451,0.0015097794,0.0011083368,0.0032501903],"category_scores_gemma":[0.00633431,0.00039528756,0.001005379,0.0014557178,0.0014857408,0.002995404,0.0010278295,0.0012333497,0.00059576356],"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.000009700588,0.000012021199,0.00033346334,0.00007804285,0.000020296891,0.00007562031,0.0000712907,0.2888892,0.00061385345,0.702488,0.0018354069,0.005573107],"study_design_scores_gemma":[0.000003199543,0.000012428416,0.0001854576,0.000014157142,0.0000064502865,0.000046746223,0.00002066396,0.81896406,0.000119471675,0.17873348,0.0018842142,0.000009681107],"about_ca_topic_score_codex":0.0034613472,"about_ca_topic_score_gemma":0.0017739708,"teacher_disagreement_score":0.0034613472,"about_ca_system_score_codex":0.0022695928,"about_ca_system_score_gemma":0.0006055552,"threshold_uncertainty_score":0.016467154},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13833134,0.00039891555,0.85801077,0.00027356026,0.000019262801,0.00012407413,0.0007242258,0.00058605534,0.001531802],"genre_scores_gemma":[0.69980586,0.00033751904,0.2963699,0.0000830452,0.000052179268,0.000217418,0.0021477959,0.0001260447,0.0008602833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895287,0.00047238625,0.00003970635,0.00025378217,0.00020103622,0.00008022715],"domain_scores_gemma":[0.9922247,0.005182094,0.0012146669,0.0006136975,0.00052943325,0.00023546965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017121931,0.0008315936,0.0006035132,0.0035630066,0.0006593786,0.001243477,0.0007953444,0.00084233854,0.001076025],"category_scores_gemma":[0.013140588,0.00048894907,0.00087439816,0.0020076002,0.00068653806,0.0016321477,0.0014833319,0.0010121086,0.000479265],"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.00036919964,0.00024968816,0.029134238,0.0005351143,0.00037607862,0.0006085213,0.0005813577,0.6890067,0.020185588,0.053243335,0.0050374893,0.20067282],"study_design_scores_gemma":[0.000011438887,0.00002125178,0.00281859,0.000023068766,0.00001797742,0.00008452774,0.00010200339,0.9560007,0.0012584698,0.038654234,0.0009937045,0.000014018305],"about_ca_topic_score_codex":0.003399272,"about_ca_topic_score_gemma":0.0061065936,"teacher_disagreement_score":0.0035630066,"about_ca_system_score_codex":0.0007795087,"about_ca_system_score_gemma":0.0008939442,"threshold_uncertainty_score":0.009055018},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80759203,0.00040230458,0.18848181,0.0004867003,0.000021628948,0.00011700776,0.0002873688,0.00016991212,0.0024411897],"genre_scores_gemma":[0.9905524,0.0002461013,0.008646493,0.000016278413,0.00001650873,0.000038664013,0.00012096623,0.0000073529322,0.00035522447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941576,0.000265348,0.000024451263,0.00008542489,0.00015045359,0.00005863976],"domain_scores_gemma":[0.99749774,0.0014532533,0.00051604374,0.00018830599,0.0002676337,0.00007695445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001334774,0.00054137164,0.0002833277,0.0011699582,0.0004045968,0.00072680507,0.0006976543,0.000730267,0.00029390334],"category_scores_gemma":[0.0048148567,0.00023178672,0.00030337516,0.0010923991,0.00044631833,0.0016765369,0.0005020373,0.00061914284,0.00011916122],"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.00014521371,0.00041669206,0.12638715,0.00015969426,0.00018146435,0.00036819794,0.001216607,0.7693467,0.00894847,0.02584945,0.0013414674,0.06563892],"study_design_scores_gemma":[0.0000025113193,0.000026131564,0.0065544685,0.0000045399634,0.000011820392,0.000055459295,0.000104003826,0.99021554,0.0006145063,0.0021650176,0.00023636005,0.0000096511485],"about_ca_topic_score_codex":0.011608632,"about_ca_topic_score_gemma":0.006224421,"teacher_disagreement_score":0.011608632,"about_ca_system_score_codex":0.00094311766,"about_ca_system_score_gemma":0.00037685662,"threshold_uncertainty_score":0.023082137},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4218724,0.008618256,0.41699967,0.031565186,0.00077502604,0.000815241,0.0005784473,0.000462911,0.11831285],"genre_scores_gemma":[0.9808224,0.00058942515,0.014007875,0.0012685831,0.0003956636,0.0001826656,0.000081771126,0.00005103548,0.0026006545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9380431,0.032093246,0.0033436841,0.010174439,0.014288083,0.0020573945],"domain_scores_gemma":[0.59306306,0.32610455,0.044340022,0.017555619,0.015553224,0.0033835887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05950791,0.0007934818,0.0018873906,0.0044261757,0.0025905606,0.0072559845,0.0021518387,0.004232689,0.007755713],"category_scores_gemma":[0.2945307,0.0007952493,0.000997619,0.0039505297,0.008774462,0.010810985,0.0043239878,0.0032933126,0.0007528433],"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.0006869948,0.00016175277,0.105503544,0.0010638749,0.0005725647,0.0007174606,0.009180452,0.01634058,0.0026615132,0.69999605,0.0049168575,0.15819833],"study_design_scores_gemma":[0.0001332917,0.00018378631,0.042374507,0.00031128837,0.0002506356,0.0008962571,0.0024043804,0.035256095,0.0018133048,0.89514464,0.021082345,0.00014952697],"about_ca_topic_score_codex":0.0026562763,"about_ca_topic_score_gemma":0.00166615,"teacher_disagreement_score":0.05950791,"about_ca_system_score_codex":0.005088653,"about_ca_system_score_gemma":0.0020398498,"threshold_uncertainty_score":0.31471163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17136864,0.0026390925,0.798181,0.0014410659,0.0001977803,0.0010544878,0.008180706,0.0040690573,0.012868191],"genre_scores_gemma":[0.5566939,0.001085741,0.4230975,0.00020820714,0.0002160365,0.0006426162,0.0109623205,0.00016183472,0.006931848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989767,0.00029224917,0.000061790575,0.00026364217,0.00030716253,0.000098445154],"domain_scores_gemma":[0.99698836,0.0016389618,0.00038739378,0.00046913535,0.00034602528,0.0001702023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014063664,0.0014096233,0.0011843629,0.0071266154,0.0013903057,0.0013104716,0.0015414901,0.0010741671,0.0022050103],"category_scores_gemma":[0.009405909,0.0004924717,0.001022643,0.004414441,0.00047854442,0.0023663647,0.0017533128,0.00076455134,0.0011131035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006159369,0.0008474044,0.12671757,0.0011780877,0.0010075012,0.0020763027,0.0021818667,0.093234316,0.0070245164,0.050620925,0.044061817,0.67043376],"study_design_scores_gemma":[0.00009780632,0.0001467611,0.012893652,0.000094839364,0.00021558521,0.0011741846,0.00073868997,0.91145706,0.0038778852,0.04425302,0.024996197,0.000054232834],"about_ca_topic_score_codex":0.0051607396,"about_ca_topic_score_gemma":0.009748216,"teacher_disagreement_score":0.0071266154,"about_ca_system_score_codex":0.0006195965,"about_ca_system_score_gemma":0.00083545607,"threshold_uncertainty_score":0.010261416},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28410304,0.0025913324,0.6984619,0.00085851166,0.00007889363,0.0003375536,0.002359138,0.0008537895,0.010355889],"genre_scores_gemma":[0.92459357,0.0011393129,0.06869542,0.000078058416,0.00013322692,0.00017166932,0.0020429862,0.00006975657,0.003075998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991509,0.00020170487,0.00004556307,0.00025401748,0.0002343853,0.000113347814],"domain_scores_gemma":[0.99667114,0.0018516787,0.0004526539,0.00026363315,0.00054916297,0.00021177217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081129675,0.0011739453,0.0009716849,0.0052583176,0.000973337,0.0013072909,0.0010759409,0.0011711401,0.0020856368],"category_scores_gemma":[0.008530672,0.0007009843,0.0008343466,0.003126138,0.00060399313,0.0023498745,0.0011474814,0.0009446277,0.0009885173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010664653,0.0004877198,0.09964347,0.0011281028,0.00072413724,0.0030931134,0.0024607533,0.37779495,0.01891551,0.08065636,0.023782719,0.3902468],"study_design_scores_gemma":[0.000026041655,0.000050717586,0.0047127064,0.000054371565,0.00009856993,0.00031393766,0.00021844475,0.9467274,0.0020831577,0.042280875,0.0034089005,0.000024861138],"about_ca_topic_score_codex":0.0070741507,"about_ca_topic_score_gemma":0.008330577,"teacher_disagreement_score":0.0070741507,"about_ca_system_score_codex":0.0009381633,"about_ca_system_score_gemma":0.00066761,"threshold_uncertainty_score":0.014065921},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17171636,0.0009874809,0.8193425,0.00027924415,0.0000880427,0.00020667135,0.00085069315,0.0010411128,0.0054878416],"genre_scores_gemma":[0.91326714,0.00029980246,0.08459768,0.000098428594,0.00011935399,0.00023917796,0.0006997171,0.000110369445,0.0005683329],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997879,0.00049289013,0.00023562498,0.00053655595,0.0007210998,0.00013475507],"domain_scores_gemma":[0.98123884,0.012442495,0.0028791868,0.0011764739,0.0016316668,0.0006313847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024485048,0.0007178837,0.0008300649,0.007367667,0.0007931753,0.0016302142,0.0013323951,0.0010811512,0.0017148488],"category_scores_gemma":[0.020794686,0.0002983294,0.0006796093,0.0035186803,0.0021931317,0.0045240084,0.0013787781,0.00081429293,0.00025368092],"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.0009012043,0.00040015933,0.08911165,0.0010262808,0.0005657792,0.0008733879,0.001423468,0.28270644,0.05134632,0.19121261,0.00612181,0.37431088],"study_design_scores_gemma":[0.00006926155,0.0003849958,0.022606917,0.000109638444,0.00017100517,0.000984093,0.0003943261,0.8040699,0.018506031,0.14764483,0.0048608547,0.00019814825],"about_ca_topic_score_codex":0.0011714217,"about_ca_topic_score_gemma":0.000950288,"teacher_disagreement_score":0.007367667,"about_ca_system_score_codex":0.0009009921,"about_ca_system_score_gemma":0.00055721554,"threshold_uncertainty_score":0.0129490495},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29163405,0.0021536318,0.6849776,0.001604764,0.000099969206,0.00009872182,0.00021277131,0.00042592123,0.01879259],"genre_scores_gemma":[0.9552987,0.0012192212,0.039892044,0.00019133823,0.00012646118,0.00014221654,0.00014392602,0.00007894329,0.0029072454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994394,0.00016452011,0.00003144149,0.00015342669,0.00015043704,0.000060663002],"domain_scores_gemma":[0.9913987,0.005628409,0.0012802193,0.00078254804,0.00045980312,0.0004503019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011433347,0.00038030976,0.0006011792,0.001325141,0.0009887636,0.0019294205,0.0010804794,0.0013327599,0.0022127314],"category_scores_gemma":[0.012425265,0.0005029191,0.0006485287,0.00094314513,0.002704666,0.0036114445,0.0012249529,0.000990205,0.0003343436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010218568,0.000042945754,0.004230392,0.000287419,0.00006688992,0.0007680986,0.0007470508,0.12981927,0.012992789,0.8228497,0.0020189474,0.026074376],"study_design_scores_gemma":[0.000039495124,0.00008423207,0.0024808748,0.00004593879,0.0000438791,0.00071529835,0.00012345836,0.3858054,0.0029238313,0.60235983,0.005343698,0.000034068526],"about_ca_topic_score_codex":0.00093085115,"about_ca_topic_score_gemma":0.0008608741,"teacher_disagreement_score":0.0022127314,"about_ca_system_score_codex":0.0005874618,"about_ca_system_score_gemma":0.0002612319,"threshold_uncertainty_score":0.007402301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9886585,0.0002862442,0.0035315296,0.0004046743,0.0000064302517,0.000026233061,0.000026174062,0.000009823055,0.0070503564],"genre_scores_gemma":[0.9984939,0.00011929772,0.0010959188,0.00001166164,0.000005107465,0.00001597046,0.00001712276,0.0000025816369,0.00023843767],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9963811,0.0024520648,0.0001159609,0.0004361486,0.00039349642,0.00022121957],"domain_scores_gemma":[0.98624194,0.008786166,0.0026725803,0.00076029944,0.0006541593,0.00088485895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038652322,0.00017974927,0.00025480715,0.004737891,0.0029685039,0.0037980026,0.0006873329,0.00070750143,0.0015581145],"category_scores_gemma":[0.020451192,0.00022358386,0.00023024401,0.004018039,0.004388737,0.005269883,0.00405387,0.00050991075,0.00013598368],"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.00023369284,0.00019101141,0.55204016,0.0003107508,0.0001821992,0.0007518667,0.18981706,0.00984791,0.0022064878,0.12723105,0.0011090273,0.11607879],"study_design_scores_gemma":[0.00003934269,0.00024264173,0.5834025,0.00030573143,0.00016109072,0.000975485,0.21656974,0.02833778,0.0014746526,0.15106331,0.017325087,0.00010270668],"about_ca_topic_score_codex":0.0044850153,"about_ca_topic_score_gemma":0.007681826,"teacher_disagreement_score":0.004737891,"about_ca_system_score_codex":0.0018011754,"about_ca_system_score_gemma":0.0012191428,"threshold_uncertainty_score":0.020441532},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07756829,0.0013200857,0.9167365,0.00081417523,0.000088756584,0.00011754345,0.0004673897,0.0005505162,0.002336709],"genre_scores_gemma":[0.7316985,0.001904827,0.25944728,0.00031795714,0.0003029546,0.00032548734,0.0013000449,0.00019203918,0.004510925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990802,0.00028690958,0.00005200989,0.00016168057,0.00033475473,0.000084411455],"domain_scores_gemma":[0.9955851,0.002472533,0.0005212076,0.0009129508,0.0003786691,0.00012945085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013816995,0.0008226293,0.0009810354,0.0024544788,0.00062570884,0.0010615486,0.0013962978,0.0009203697,0.0012350931],"category_scores_gemma":[0.008937853,0.00026847646,0.00057110336,0.0028653666,0.0012723724,0.003106026,0.0014120485,0.0011678081,0.0004998218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046589287,0.0001775604,0.003031468,0.0003819569,0.00011364223,0.00053721736,0.00053244375,0.4227134,0.024120485,0.06915707,0.0071898424,0.47157902],"study_design_scores_gemma":[0.000030340449,0.00011971806,0.0013899391,0.000042295105,0.000030043993,0.00043014225,0.0001611124,0.90012383,0.012594719,0.08120686,0.0038462875,0.000024689014],"about_ca_topic_score_codex":0.0010219164,"about_ca_topic_score_gemma":0.0011206842,"teacher_disagreement_score":0.0024544788,"about_ca_system_score_codex":0.00084831635,"about_ca_system_score_gemma":0.0005894534,"threshold_uncertainty_score":0.007307172},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14741743,0.0019741931,0.8138529,0.0063170595,0.00033351273,0.0002606177,0.00081639126,0.0009582695,0.02806963],"genre_scores_gemma":[0.9279915,0.002881938,0.044972036,0.0008092884,0.0007277555,0.0005255779,0.0005167417,0.0002924724,0.02128262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982375,0.00059643155,0.00006976918,0.00044389293,0.00041816328,0.00023426888],"domain_scores_gemma":[0.9830565,0.011995744,0.0018347143,0.0012837285,0.0012771053,0.0005521311],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.004376538,0.0008767224,0.0013897808,0.004023445,0.0012647616,0.0038230633,0.003447003,0.0030466313,0.0070561706],"category_scores_gemma":[0.041465763,0.0008661622,0.0012382782,0.003100195,0.003050415,0.009304899,0.001431914,0.0025266418,0.0024623675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000465346,0.00014043819,0.005768075,0.0001452764,0.00007049557,0.0006949967,0.00067052944,0.15611283,0.0013513417,0.814279,0.007282323,0.013438153],"study_design_scores_gemma":[0.000021582217,0.000025283953,0.0015877233,0.000033028296,0.000015365005,0.0003253279,0.000069651236,0.6019495,0.00015693274,0.3937548,0.0020235046,0.000037250167],"about_ca_topic_score_codex":0.004834649,"about_ca_topic_score_gemma":0.0028020607,"teacher_disagreement_score":0.99597657,"about_ca_system_score_codex":0.002910022,"about_ca_system_score_gemma":0.0011626534,"threshold_uncertainty_score":0.023605287},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043740634,0.00012686124,0.9526066,0.00014288988,0.000029852565,0.000043612,0.00010395271,0.0001445363,0.0030610785],"genre_scores_gemma":[0.8408248,0.00059631956,0.14372446,0.00008521895,0.00006145787,0.0003296341,0.00032203755,0.00014902999,0.013907036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966025,0.00013020665,0.000010699426,0.000060208527,0.00009560972,0.000043058648],"domain_scores_gemma":[0.99885595,0.0006502403,0.00017480514,0.00008558704,0.0001437454,0.00008966553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008791274,0.00068968383,0.0006654191,0.00093083037,0.00043513236,0.000679105,0.0018204169,0.0009870873,0.0035238117],"category_scores_gemma":[0.0032069585,0.00045764627,0.0008116443,0.0009535899,0.00096495706,0.001736779,0.0010319252,0.0007777539,0.0007347629],"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.00004469719,0.00002297858,0.00077168556,0.000021794558,0.000027107524,0.00007316687,0.00008242031,0.9587367,0.0008841342,0.031795315,0.0004369437,0.007103049],"study_design_scores_gemma":[0.00000243872,0.000010289804,0.000046839414,0.0000012381411,0.00000226876,0.00000945737,0.000009927783,0.9933947,0.0000709769,0.006155827,0.0002942525,0.0000018622131],"about_ca_topic_score_codex":0.008195278,"about_ca_topic_score_gemma":0.00692722,"teacher_disagreement_score":0.008195278,"about_ca_system_score_codex":0.0006951755,"about_ca_system_score_gemma":0.0006391098,"threshold_uncertainty_score":0.016295135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9218667,0.00038849062,0.05739836,0.0022758231,0.0000560102,0.00062594743,0.00072125235,0.00022812975,0.016439212],"genre_scores_gemma":[0.9444169,0.0003487815,0.047697917,0.00015026735,0.00006388342,0.00021327133,0.00047772058,0.00006021207,0.0065711276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980914,0.0010070918,0.00007477525,0.00015688885,0.0005254806,0.0001444774],"domain_scores_gemma":[0.9886374,0.008767478,0.0004953648,0.00042009808,0.001303258,0.00037650383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026230412,0.0003835237,0.0002754096,0.0015105486,0.0013668844,0.0016769944,0.0008661039,0.0012259744,0.0028149665],"category_scores_gemma":[0.008991974,0.00014862065,0.00037803774,0.0017291049,0.00052237243,0.0017395074,0.0007717513,0.00064612756,0.00070855673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018437603,0.008860042,0.11620518,0.0013978041,0.00030852004,0.013904187,0.019071111,0.03438755,0.030013354,0.0322082,0.024547188,0.7172531],"study_design_scores_gemma":[0.00047014988,0.0031524224,0.08069928,0.00035456163,0.00059775106,0.0064567085,0.050282214,0.69018424,0.047564674,0.030197756,0.08983285,0.00020738298],"about_ca_topic_score_codex":0.004562775,"about_ca_topic_score_gemma":0.006821561,"teacher_disagreement_score":0.004562775,"about_ca_system_score_codex":0.0008772723,"about_ca_system_score_gemma":0.00061544456,"threshold_uncertainty_score":0.013872087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27260783,0.00090134767,0.7094614,0.001230634,0.00011007313,0.00012927724,0.00028997698,0.00027951808,0.014989929],"genre_scores_gemma":[0.96211916,0.0008984092,0.031244542,0.00007127245,0.00008769764,0.00016172731,0.00011012375,0.0000449526,0.0052619716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994318,0.00025035677,0.000028546752,0.00009343308,0.00010363059,0.000092192146],"domain_scores_gemma":[0.99820995,0.0012043787,0.00025882182,0.00008978128,0.00012212885,0.00011494913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009439686,0.0006758725,0.0006314288,0.00095502374,0.00069924287,0.0015202087,0.0010397176,0.0016153468,0.0014343214],"category_scores_gemma":[0.0049982113,0.0005190871,0.00061603205,0.00074609043,0.0011965369,0.0024402589,0.0016571828,0.00088757486,0.00021086374],"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.000018445833,0.000025261055,0.001052516,0.000029622726,0.000026857988,0.000189634,0.00014690524,0.9282357,0.00097487814,0.06598674,0.00040978214,0.0029036906],"study_design_scores_gemma":[0.0000047648336,0.0000069175094,0.0001395014,0.0000032565315,0.0000048587744,0.000014617173,0.000022898592,0.9841865,0.000051092426,0.015172245,0.00038878355,0.0000046622],"about_ca_topic_score_codex":0.008559208,"about_ca_topic_score_gemma":0.0046983208,"teacher_disagreement_score":0.008559208,"about_ca_system_score_codex":0.0012224953,"about_ca_system_score_gemma":0.00079067255,"threshold_uncertainty_score":0.017018735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029459266,0.00059356826,0.9670876,0.00020925138,0.000045127465,0.00010491259,0.00015837704,0.00048051888,0.0018613369],"genre_scores_gemma":[0.46175164,0.00058776553,0.5299187,0.00016263814,0.00013248854,0.00031794174,0.0008045035,0.00029894593,0.0060255076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857783,0.0006712165,0.000054999004,0.00035928452,0.00025989217,0.00007681241],"domain_scores_gemma":[0.99544597,0.0029680016,0.0004140435,0.00047084352,0.00053341273,0.00016772414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020307165,0.0008019831,0.0020179872,0.003575257,0.0011373981,0.0014600465,0.0035810817,0.0015411027,0.0026712485],"category_scores_gemma":[0.011188894,0.00076491205,0.0012434757,0.0029574148,0.0011994947,0.0029025134,0.0020406262,0.0011566569,0.0007110301],"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.00035135073,0.00018879083,0.002487007,0.00027372828,0.00027470043,0.00011916817,0.0002442387,0.74074554,0.0032219887,0.08357352,0.0063233147,0.16219664],"study_design_scores_gemma":[0.000010622129,0.00001711746,0.00016210342,0.000005615616,0.000016331163,0.000022712597,0.000012976396,0.9869179,0.00026601634,0.012210772,0.00035190812,0.0000059479657],"about_ca_topic_score_codex":0.0053278953,"about_ca_topic_score_gemma":0.0052785794,"teacher_disagreement_score":0.0053278953,"about_ca_system_score_codex":0.001291767,"about_ca_system_score_gemma":0.00095326424,"threshold_uncertainty_score":0.010739565},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009161659,0.0008671086,0.60974836,0.0010083175,0.00018676188,0.0009581244,0.04397225,0.32500413,0.009093301],"genre_scores_gemma":[0.07043893,0.0015976026,0.8256804,0.0004931297,0.00015479393,0.0021424636,0.08373678,0.009903723,0.0058521866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614465,0.0009396432,0.0005266605,0.0007899707,0.0014467515,0.00015233373],"domain_scores_gemma":[0.99181914,0.0039136494,0.00067339954,0.002373961,0.0006457826,0.0005740668],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.004727559,0.0018860876,0.0017914557,0.006884296,0.0021192802,0.0060797436,0.00317344,0.0022357425,0.011859897],"category_scores_gemma":[0.017230751,0.0018706572,0.0020780812,0.009845133,0.0010642178,0.011321811,0.006904312,0.002136024,0.007305876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016392502,0.00065190194,0.015864622,0.0043059518,0.000940993,0.0018887386,0.0061348137,0.036935642,0.016725836,0.09990122,0.33275756,0.48225346],"study_design_scores_gemma":[0.0005645763,0.00021603744,0.009403523,0.0005149814,0.0002685544,0.0011396235,0.0011696885,0.2568729,0.01011891,0.18156494,0.53771675,0.00044949766],"about_ca_topic_score_codex":0.0055525918,"about_ca_topic_score_gemma":0.0091540655,"teacher_disagreement_score":0.9931157,"about_ca_system_score_codex":0.0010998159,"about_ca_system_score_gemma":0.0019181726,"threshold_uncertainty_score":0.039675295},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029496074,0.00050403795,0.9644519,0.00029654754,0.0001395587,0.00029622842,0.00045223447,0.001233849,0.0031295717],"genre_scores_gemma":[0.3159715,0.000498555,0.6710779,0.00016529944,0.00021879017,0.00046845095,0.0024035806,0.00043300545,0.008762899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977156,0.00056137366,0.00015855955,0.0007680634,0.0006776614,0.00011878733],"domain_scores_gemma":[0.9962835,0.0011901415,0.00029496074,0.001176811,0.00091576844,0.00013880864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013137914,0.0007030067,0.0017337102,0.0075032557,0.0017375131,0.0022231042,0.0021180746,0.0016509373,0.0044840635],"category_scores_gemma":[0.007841931,0.0008008349,0.0018508504,0.006033236,0.0012547409,0.0026814588,0.0018949124,0.0011589653,0.0023968974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004936116,0.00030569264,0.007434618,0.00043462458,0.0007026057,0.00021927521,0.00040868486,0.114697434,0.016489113,0.060873855,0.016588349,0.7813521],"study_design_scores_gemma":[0.00005578199,0.00011184507,0.0032266784,0.000030841547,0.00012686633,0.00042867972,0.00015502109,0.88842183,0.0069753407,0.09215859,0.008257646,0.000050833212],"about_ca_topic_score_codex":0.0034081533,"about_ca_topic_score_gemma":0.0037302899,"teacher_disagreement_score":0.0075032557,"about_ca_system_score_codex":0.0010079526,"about_ca_system_score_gemma":0.00092469336,"threshold_uncertainty_score":0.015000641},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55541426,0.0010406108,0.43642905,0.0008453961,0.00006494651,0.00014059906,0.0025251913,0.0005688146,0.002971134],"genre_scores_gemma":[0.950639,0.000323271,0.046811465,0.00003128128,0.00003498399,0.000058927293,0.001213858,0.000021934511,0.00086525583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908066,0.00035530602,0.00005370302,0.0002583962,0.00019275105,0.000059207276],"domain_scores_gemma":[0.9929872,0.004468022,0.0009480893,0.00060515496,0.0007967686,0.00019477968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017057128,0.0005812631,0.0005846541,0.0023664841,0.00035812156,0.00089771143,0.0008562751,0.0008645839,0.0011081056],"category_scores_gemma":[0.01182486,0.00031907004,0.0004456067,0.0022338724,0.0003993851,0.0025844048,0.00051894115,0.0010103581,0.0006564176],"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.00039967927,0.00032448946,0.16052473,0.00024689743,0.00028599033,0.00043116216,0.00043208504,0.6418772,0.0052873637,0.013882214,0.00470823,0.17160007],"study_design_scores_gemma":[0.0000037463053,0.000028376107,0.008667779,0.000009167152,0.000013116594,0.0000614179,0.00004277548,0.98402345,0.0005800621,0.0060975,0.00046329087,0.000009334985],"about_ca_topic_score_codex":0.007915922,"about_ca_topic_score_gemma":0.009336424,"teacher_disagreement_score":0.007915922,"about_ca_system_score_codex":0.0006767001,"about_ca_system_score_gemma":0.00027325755,"threshold_uncertainty_score":0.01573968},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18504018,0.00097144936,0.8075661,0.00057708,0.00004306172,0.00026043897,0.0003241234,0.002227863,0.002989659],"genre_scores_gemma":[0.7107536,0.00030451038,0.2866108,0.000057468726,0.00010688994,0.00019867055,0.0005156841,0.00014424644,0.0013080334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654216,0.0021177162,0.00014620987,0.00032831283,0.00076413795,0.00010144482],"domain_scores_gemma":[0.9863441,0.010029588,0.0011318086,0.00070276426,0.0016137257,0.00017800712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003934536,0.00085160334,0.0013596333,0.00649031,0.0006061479,0.0018064986,0.001318003,0.0007114618,0.0017821795],"category_scores_gemma":[0.022776159,0.0003472309,0.00075780763,0.0040134923,0.000560175,0.0027432053,0.0013377514,0.0009686752,0.0005909782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011044361,0.00081090914,0.017464764,0.00057976943,0.00041342506,0.00014338973,0.0010622556,0.19865361,0.016551608,0.016605685,0.0043925764,0.74221754],"study_design_scores_gemma":[0.00003841557,0.00007182074,0.0020081296,0.000014291973,0.000041047064,0.000019607414,0.000063806474,0.9904394,0.0022360042,0.0044940202,0.00054760743,0.000025875717],"about_ca_topic_score_codex":0.006229585,"about_ca_topic_score_gemma":0.0065343636,"teacher_disagreement_score":0.00649031,"about_ca_system_score_codex":0.0011060981,"about_ca_system_score_gemma":0.001248167,"threshold_uncertainty_score":0.020808041},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02235778,0.0002922389,0.97169197,0.00032854875,0.00004115018,0.00010242244,0.0005579706,0.0009931768,0.0036347026],"genre_scores_gemma":[0.47304443,0.00078968384,0.51411134,0.00028676545,0.00028685541,0.0004631615,0.0039677517,0.0005875746,0.006462436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988531,0.00033695763,0.00005706771,0.00028656353,0.00035542194,0.00011086512],"domain_scores_gemma":[0.9952808,0.0027095212,0.0003983002,0.0010792542,0.00036962132,0.00016256381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011042457,0.0010731565,0.0012961068,0.0024077145,0.00087979395,0.0018367437,0.0019614794,0.0011921489,0.0047662547],"category_scores_gemma":[0.012043471,0.0007919748,0.0014596678,0.0016401527,0.0012920905,0.003434456,0.002839049,0.002201534,0.0011998581],"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.000284654,0.000097519754,0.0036271259,0.00031449262,0.00015578754,0.0003882227,0.00043607526,0.599966,0.0050864625,0.17038941,0.012419362,0.20683493],"study_design_scores_gemma":[0.000014971405,0.000012713969,0.00023397517,0.000015601476,0.0000122322235,0.00007795882,0.000032515403,0.908868,0.0011332605,0.087197416,0.0023938539,0.0000075285325],"about_ca_topic_score_codex":0.0042178584,"about_ca_topic_score_gemma":0.0064416416,"teacher_disagreement_score":0.0047662547,"about_ca_system_score_codex":0.0010222464,"about_ca_system_score_gemma":0.0010723823,"threshold_uncertainty_score":0.01594472},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39986885,0.002786004,0.5246384,0.0049335766,0.00032483225,0.00019120157,0.0007297757,0.00078021735,0.06574718],"genre_scores_gemma":[0.96588457,0.000875728,0.02123551,0.00025419408,0.00018102389,0.00019548614,0.00026678893,0.00012886547,0.010977896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994752,0.00018314632,0.000016085436,0.00011143028,0.0001261467,0.000087986264],"domain_scores_gemma":[0.99736494,0.0015854805,0.0002738549,0.00023542634,0.00016297198,0.00037729458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010665552,0.0005144184,0.0007198258,0.0008207639,0.0008125067,0.0013796109,0.0014008272,0.0014197343,0.0050033666],"category_scores_gemma":[0.011341897,0.0004217228,0.0006188137,0.00047443056,0.0016252935,0.0047720373,0.0012903196,0.0019401874,0.00068194827],"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.000101400125,0.00002834705,0.0005698524,0.00007411944,0.00003239552,0.000116405805,0.00021762821,0.045080114,0.0026882996,0.9448739,0.002124608,0.0040929057],"study_design_scores_gemma":[0.000025348541,0.000022287833,0.00038917133,0.000016442484,0.000014142603,0.00007781162,0.00003661811,0.3525436,0.00062786636,0.6442229,0.0019956646,0.000028210867],"about_ca_topic_score_codex":0.0020904487,"about_ca_topic_score_gemma":0.0011635321,"teacher_disagreement_score":0.0050033666,"about_ca_system_score_codex":0.0012907105,"about_ca_system_score_gemma":0.00054842513,"threshold_uncertainty_score":0.016737938},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06829691,0.0010910343,0.92591405,0.00077527296,0.00010115434,0.00023239119,0.0012440495,0.000730662,0.0016145676],"genre_scores_gemma":[0.82236654,0.0014987992,0.16750431,0.00016490919,0.0006383634,0.0009790469,0.0029846437,0.00016717978,0.003696171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980167,0.0010160728,0.00010244488,0.0004630531,0.0002622111,0.00013945691],"domain_scores_gemma":[0.99554414,0.0033804362,0.00044241393,0.00030251316,0.00022963059,0.00010089433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030554887,0.0014879304,0.0015781485,0.0040803715,0.0009908967,0.0016423755,0.0018409053,0.0017996416,0.0017335964],"category_scores_gemma":[0.009126526,0.0008105484,0.0022506241,0.0035213197,0.0010837317,0.0038832591,0.001177634,0.0018170564,0.0009689913],"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.00045824182,0.0004652757,0.02393372,0.00039314438,0.00050892646,0.000520168,0.0010992996,0.75379926,0.0029902013,0.0681348,0.005795035,0.14190203],"study_design_scores_gemma":[0.0000083512605,0.000015169962,0.0010841076,0.000009987547,0.000019632307,0.00004527251,0.000033576813,0.9845585,0.00014257093,0.013339024,0.00073190866,0.000011796027],"about_ca_topic_score_codex":0.010129809,"about_ca_topic_score_gemma":0.011082707,"teacher_disagreement_score":0.010129809,"about_ca_system_score_codex":0.0012209429,"about_ca_system_score_gemma":0.0006359054,"threshold_uncertainty_score":0.02014172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29932323,0.0007055139,0.69049215,0.0024776107,0.00018542922,0.00012462208,0.00073983485,0.0005592151,0.0053923707],"genre_scores_gemma":[0.9474861,0.0005842429,0.041012608,0.00017388517,0.00016936734,0.00023245584,0.00037721233,0.00013034059,0.0098338025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986203,0.0007217249,0.000050371087,0.0003119651,0.000135549,0.00016004081],"domain_scores_gemma":[0.97889405,0.01733949,0.001531468,0.000876378,0.00074309594,0.00061545277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004904994,0.0014305476,0.0018846069,0.0022886568,0.0010938268,0.0024654146,0.00303681,0.0034393473,0.0034173878],"category_scores_gemma":[0.026745256,0.0015783348,0.0018620233,0.0020837192,0.001961596,0.0060549015,0.0024054847,0.0025602353,0.00052951707],"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.00005981629,0.000037649967,0.0011134018,0.000022871516,0.000040977426,0.000045329678,0.000068208385,0.95598763,0.00023195927,0.039122324,0.00040908254,0.002860721],"study_design_scores_gemma":[0.0000042558704,0.0000037704528,0.000055499,0.0000013810426,0.0000047965314,0.0000046190385,0.0000044891103,0.9914312,0.00003123388,0.008390167,0.000066026914,0.000002614971],"about_ca_topic_score_codex":0.017981721,"about_ca_topic_score_gemma":0.012446817,"teacher_disagreement_score":0.017981721,"about_ca_system_score_codex":0.0027225567,"about_ca_system_score_gemma":0.0011854781,"threshold_uncertainty_score":0.035754085},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5464826,0.0025936079,0.41307348,0.0013226833,0.00019161738,0.00040014056,0.010055837,0.0040354547,0.02184462],"genre_scores_gemma":[0.90239006,0.00073163986,0.085159235,0.00010511752,0.00015287597,0.000099073266,0.005914455,0.0001304811,0.0053171036],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996032,0.00006873795,0.000020958772,0.00014736997,0.00010896339,0.00005081675],"domain_scores_gemma":[0.99917394,0.00032728046,0.00017037673,0.00014172439,0.00013766432,0.00004900181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002654757,0.0008538394,0.0004062246,0.003852625,0.0005265383,0.0010097111,0.00054390833,0.00072486757,0.0022971479],"category_scores_gemma":[0.0021597997,0.00035966703,0.0005668276,0.0025965665,0.00037828612,0.0021013482,0.0009209908,0.00057995075,0.0013149111],"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.0006865303,0.00040923856,0.060571805,0.0008274403,0.0004406517,0.0019137496,0.002344982,0.07444838,0.055429984,0.035860922,0.037581824,0.7294845],"study_design_scores_gemma":[0.000024022462,0.00013446837,0.051098064,0.00008364003,0.00015740356,0.0010194165,0.0018387265,0.85536915,0.014544449,0.045751564,0.029914636,0.00006446358],"about_ca_topic_score_codex":0.008858385,"about_ca_topic_score_gemma":0.017490495,"teacher_disagreement_score":0.008858385,"about_ca_system_score_codex":0.0007262445,"about_ca_system_score_gemma":0.0003552391,"threshold_uncertainty_score":0.01761365},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024803737,0.00012534183,0.9946308,0.00011876569,0.00007937142,0.000053512904,0.00032691527,0.0004997662,0.001685211],"genre_scores_gemma":[0.078200616,0.0004885006,0.90839714,0.00012749073,0.0002830397,0.00042632042,0.0013130179,0.0004815076,0.010282301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986908,0.0003201795,0.000070843365,0.0003905895,0.00045079016,0.00007683121],"domain_scores_gemma":[0.9949809,0.0024556052,0.00040546863,0.00096728496,0.0009045749,0.0002862776],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.001239303,0.0010109431,0.0010487195,0.007264641,0.0013889254,0.0024010476,0.0019326307,0.0015841578,0.0066654794],"category_scores_gemma":[0.009428079,0.0007189147,0.0015187198,0.0046060793,0.0012121703,0.0037031674,0.0023929041,0.00197319,0.0028595359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016464652,0.00017187759,0.0036014414,0.00044191183,0.0002948766,0.0003061232,0.00062246586,0.082146525,0.012691398,0.48205948,0.017728865,0.39977047],"study_design_scores_gemma":[0.000035779438,0.000037720114,0.00092827727,0.000053709606,0.00007582211,0.00039290122,0.00008733582,0.6589476,0.0039020537,0.3114318,0.024055447,0.00005151315],"about_ca_topic_score_codex":0.0021167225,"about_ca_topic_score_gemma":0.0036865931,"teacher_disagreement_score":0.9927354,"about_ca_system_score_codex":0.00077044143,"about_ca_system_score_gemma":0.0012496279,"threshold_uncertainty_score":0.022298217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012406673,0.00033093125,0.97746915,0.0004935236,0.00035039175,0.00014994068,0.00020968252,0.003601742,0.0049880785],"genre_scores_gemma":[0.121911615,0.00053183036,0.85144585,0.000380086,0.00019304726,0.00027202643,0.0004892657,0.0019479854,0.022828408],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989002,0.00015905876,0.000077832105,0.00034599553,0.00041662986,0.00010027608],"domain_scores_gemma":[0.99447495,0.0021281443,0.00022094003,0.0021487917,0.0007143078,0.00031287628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017183463,0.0011823784,0.0018809115,0.0020706828,0.0021139265,0.0018667653,0.0019408967,0.0017289593,0.023724366],"category_scores_gemma":[0.0124599235,0.0011048622,0.0015587511,0.0015627407,0.0013070905,0.0048822886,0.0041465056,0.0029315352,0.0048141917],"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.0004956472,0.00023334651,0.002051639,0.00083947135,0.00015549344,0.00042701428,0.00078857184,0.062563695,0.0523659,0.08813859,0.026943859,0.7649968],"study_design_scores_gemma":[0.000083911684,0.00024252129,0.0010976979,0.00022738017,0.00011435924,0.0006049023,0.000521308,0.6080877,0.041753072,0.26546782,0.081720315,0.00007887646],"about_ca_topic_score_codex":0.0018179787,"about_ca_topic_score_gemma":0.0034652096,"teacher_disagreement_score":0.023724366,"about_ca_system_score_codex":0.0005983998,"about_ca_system_score_gemma":0.0006959514,"threshold_uncertainty_score":0.07936597},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9681857,0.00047223747,0.027430369,0.0002147739,0.000018666276,0.000016650429,0.000064193024,0.00006240395,0.0035349478],"genre_scores_gemma":[0.9962709,0.00018861881,0.002819236,0.0000119271135,0.000009262696,0.000011878972,0.0000342503,0.000008429294,0.0006454683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999105,0.00003303911,0.0000046553187,0.000015094443,0.000018122955,0.000018618666],"domain_scores_gemma":[0.9992687,0.0004543984,0.00012406259,0.00004633586,0.000054652883,0.000051915875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003075457,0.0002954212,0.00035131097,0.00066702644,0.0003397872,0.0005777348,0.00039213913,0.00049511925,0.00094634015],"category_scores_gemma":[0.001609217,0.00017392915,0.00034077975,0.00033510147,0.0008963059,0.0009957687,0.00029067916,0.00040486763,0.000056228542],"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.00018164968,0.0001339204,0.0050129574,0.0001347733,0.00010197604,0.0004303161,0.00026634015,0.7539493,0.01964403,0.21407494,0.00074416253,0.0053256424],"study_design_scores_gemma":[0.000015829433,0.000032351592,0.0010816774,0.000009677815,0.0000148677655,0.0000502608,0.0000212542,0.96421325,0.0015588123,0.032728124,0.00026141203,0.000012517563],"about_ca_topic_score_codex":0.0023802696,"about_ca_topic_score_gemma":0.0021327212,"teacher_disagreement_score":0.0023802696,"about_ca_system_score_codex":0.00071700686,"about_ca_system_score_gemma":0.00037871697,"threshold_uncertainty_score":0.005202353},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0585007,0.0028371825,0.9183032,0.00063551567,0.00030824562,0.00025592165,0.0014019492,0.0007041132,0.017053055],"genre_scores_gemma":[0.5157059,0.0016637665,0.4676309,0.00021951037,0.00055980217,0.00047313917,0.003052971,0.00032465887,0.010369391],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779224,0.00058771594,0.00015082498,0.0002123556,0.0011016558,0.00015520629],"domain_scores_gemma":[0.9930636,0.0044913744,0.00037818658,0.0003522929,0.0014408004,0.000273615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023003486,0.0010850551,0.0016208412,0.006086463,0.0008533806,0.0022298754,0.0018196668,0.0014039215,0.0034348133],"category_scores_gemma":[0.013752607,0.00030856155,0.0005913123,0.004923674,0.0009884655,0.0030750774,0.00097130775,0.001218841,0.00078346743],"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.00041036308,0.0002169411,0.006353149,0.0007115858,0.00017639964,0.00019675837,0.00023022147,0.27300128,0.005289734,0.18988027,0.03634294,0.4871905],"study_design_scores_gemma":[0.000045039524,0.00021477752,0.0024040502,0.00014819457,0.00008687467,0.0002575733,0.00018249759,0.8151057,0.0025662198,0.17063718,0.008297331,0.000054636817],"about_ca_topic_score_codex":0.002925078,"about_ca_topic_score_gemma":0.0034705622,"teacher_disagreement_score":0.006086463,"about_ca_system_score_codex":0.0014381121,"about_ca_system_score_gemma":0.00078679575,"threshold_uncertainty_score":0.012165546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5633304,0.00069642754,0.4269649,0.0009772371,0.000028845563,0.000049013797,0.00022476433,0.00010963895,0.007618745],"genre_scores_gemma":[0.9854897,0.00019740913,0.013729707,0.00003722163,0.000043857548,0.000040694147,0.00010657908,0.000016972632,0.0003379057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869317,0.00056637364,0.00004600448,0.00026230625,0.00033847493,0.00009370541],"domain_scores_gemma":[0.9744484,0.020083113,0.002272319,0.0015554088,0.0010719134,0.00056883175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029796073,0.000273398,0.00057104323,0.0030603048,0.0005017579,0.0018208545,0.0006976653,0.0007180561,0.0011892839],"category_scores_gemma":[0.025186837,0.00025372664,0.00037346652,0.0010452205,0.0026708178,0.004983185,0.0014044082,0.0009726356,0.0000797675],"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.00008783341,0.00008157592,0.06535422,0.00018534694,0.00022906346,0.00025489522,0.001166952,0.34257144,0.006872553,0.530076,0.0011298342,0.051990345],"study_design_scores_gemma":[0.000008897475,0.000074811476,0.025810547,0.000022649883,0.000021502598,0.00019495623,0.00039031124,0.61780524,0.0011568915,0.3532601,0.0012134298,0.000040781808],"about_ca_topic_score_codex":0.0011390022,"about_ca_topic_score_gemma":0.0011667268,"teacher_disagreement_score":0.0030603048,"about_ca_system_score_codex":0.0010170571,"about_ca_system_score_gemma":0.00042034235,"threshold_uncertainty_score":0.015757859},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1948654,0.0017599231,0.7939093,0.00093046797,0.000079566234,0.00005240003,0.00014127124,0.00012254933,0.008139043],"genre_scores_gemma":[0.9519438,0.0014313916,0.04260696,0.00012977076,0.00009790623,0.00008481567,0.000081770886,0.00002910125,0.003594402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995716,0.00020091399,0.000015955484,0.00010022728,0.00006715664,0.00004406294],"domain_scores_gemma":[0.99822,0.001023654,0.00036772975,0.00016435918,0.000106779036,0.00011744508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009222742,0.00043418785,0.00046305577,0.0009146102,0.00044747218,0.0014071179,0.00080609554,0.00098187,0.0015539918],"category_scores_gemma":[0.0043496327,0.00030430127,0.000559376,0.0007659084,0.0018334736,0.0023114197,0.0010653919,0.0009477549,0.00015467603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039699764,0.000021887943,0.0040180883,0.00009816141,0.00008806258,0.00028047082,0.00037431825,0.25512984,0.0064017153,0.7180561,0.0006797464,0.014811868],"study_design_scores_gemma":[0.0000112051985,0.000039598406,0.0023642695,0.000020636497,0.000028759616,0.0002586896,0.00007041817,0.6849866,0.00084509794,0.30835274,0.0029999192,0.000022179713],"about_ca_topic_score_codex":0.001295267,"about_ca_topic_score_gemma":0.00097122253,"teacher_disagreement_score":0.0015539918,"about_ca_system_score_codex":0.0007470962,"about_ca_system_score_gemma":0.0002858369,"threshold_uncertainty_score":0.005420625},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22578223,0.0028850532,0.7544167,0.0028242855,0.0001274032,0.000100415156,0.0002880348,0.0004340854,0.01314182],"genre_scores_gemma":[0.9564256,0.00244236,0.037136197,0.00022238574,0.00040101574,0.00020130693,0.00024342394,0.00014558731,0.002782189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729615,0.0012224994,0.000115547766,0.00042272633,0.0006196037,0.00032336745],"domain_scores_gemma":[0.92491806,0.06820992,0.0030507683,0.001385936,0.0014818246,0.00095349515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047147563,0.001266351,0.0015703368,0.0028604795,0.00078510796,0.002526935,0.002179292,0.002246964,0.0017460397],"category_scores_gemma":[0.05094859,0.0010302627,0.0008898299,0.0011151764,0.0037876214,0.005288915,0.0029545887,0.0021343587,0.00022244839],"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.00016240061,0.00005915919,0.0045289076,0.0002983514,0.00012236775,0.00026312537,0.0004298444,0.6588316,0.007862319,0.315238,0.0014235667,0.010780441],"study_design_scores_gemma":[0.000010254821,0.000024681533,0.00078099803,0.000033919605,0.000017991868,0.00006860894,0.000040182997,0.84480315,0.00078446395,0.15280968,0.0006078639,0.000018234705],"about_ca_topic_score_codex":0.002125313,"about_ca_topic_score_gemma":0.0010538553,"teacher_disagreement_score":0.0047147563,"about_ca_system_score_codex":0.0022426269,"about_ca_system_score_gemma":0.00066264026,"threshold_uncertainty_score":0.024934292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9594763,0.0019918496,0.027091118,0.0010301674,0.00002909843,0.000071912444,0.0005330621,0.000041168598,0.00973536],"genre_scores_gemma":[0.9962127,0.0006762065,0.0024489795,0.000021770937,0.000026968026,0.00002804485,0.00023170101,0.0000051770407,0.00034843897],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984003,0.0007474666,0.00010173192,0.00035763832,0.0002619217,0.00013094256],"domain_scores_gemma":[0.9201525,0.06288741,0.011465336,0.0017142568,0.002359296,0.0014212108],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0027364397,0.00039757224,0.0002930793,0.0049641808,0.0010381296,0.0019927002,0.00037249635,0.0007253668,0.0032168864],"category_scores_gemma":[0.034558963,0.00023431805,0.0005543269,0.0050620344,0.0015554004,0.004066073,0.0010842723,0.0007089282,0.00032038224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014993644,0.00012675658,0.91122776,0.00028844396,0.00041366264,0.00041016485,0.0025540001,0.009129025,0.0013236218,0.02917422,0.0008608554,0.044341583],"study_design_scores_gemma":[0.000014756627,0.00018858637,0.8830543,0.00016319078,0.00034872384,0.0006125458,0.003210155,0.05813993,0.0009042832,0.04894299,0.004355925,0.00006465172],"about_ca_topic_score_codex":0.0045826654,"about_ca_topic_score_gemma":0.004287284,"teacher_disagreement_score":0.9950358,"about_ca_system_score_codex":0.0012373945,"about_ca_system_score_gemma":0.00080392504,"threshold_uncertainty_score":0.014471829},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012886122,0.00088821823,0.9785299,0.00081653206,0.00010031411,0.000066259265,0.0007885877,0.0004238792,0.0055002472],"genre_scores_gemma":[0.6432362,0.0036155437,0.33100203,0.00062750466,0.00064841675,0.00074438256,0.004423324,0.00054648845,0.015156143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863285,0.00056514755,0.000061452665,0.0003186221,0.0003375046,0.00008447333],"domain_scores_gemma":[0.99573344,0.0022008677,0.00062387,0.00071482925,0.0004925229,0.00023452156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001497548,0.0009869025,0.0006320631,0.0032694268,0.00080119673,0.0018701134,0.0009965166,0.0011821132,0.0049805255],"category_scores_gemma":[0.0099157905,0.0003797075,0.0007508715,0.0023423966,0.0013714326,0.0040425216,0.0022152532,0.0018866288,0.0014331467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058991827,0.00007151742,0.00164707,0.00023984216,0.000082488135,0.00021359262,0.00045171526,0.12529853,0.0021619543,0.76787174,0.011414987,0.09048759],"study_design_scores_gemma":[0.000005792323,0.000016362766,0.00055974856,0.000035558296,0.000009260996,0.00010467093,0.00012403705,0.5106799,0.0003247204,0.47787902,0.010242735,0.000018199578],"about_ca_topic_score_codex":0.0027042222,"about_ca_topic_score_gemma":0.0023154004,"teacher_disagreement_score":0.0049805255,"about_ca_system_score_codex":0.001241105,"about_ca_system_score_gemma":0.00056646793,"threshold_uncertainty_score":0.016661525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18729748,0.0040769875,0.79027545,0.0052104555,0.00033548492,0.00005686909,0.0005007767,0.00017994156,0.012066481],"genre_scores_gemma":[0.9334171,0.003736147,0.05865319,0.00023773,0.0006795679,0.00013119537,0.00022447911,0.00007673093,0.002843943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978523,0.0010756232,0.000093079965,0.00045584879,0.0004151465,0.00010806994],"domain_scores_gemma":[0.9763757,0.01612064,0.003402201,0.0018188297,0.0016103784,0.0006722409],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0032758259,0.00062510895,0.00072675484,0.00407857,0.0009932512,0.00400292,0.0014395585,0.0015906557,0.0020830124],"category_scores_gemma":[0.030650241,0.00066987186,0.0004175639,0.0036383662,0.004278424,0.012327446,0.0019560624,0.0012405508,0.00025609529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046042976,0.000021046024,0.0017601408,0.000118241216,0.00003852902,0.000042704716,0.00021219617,0.02102067,0.001163777,0.95280266,0.0007449007,0.022029119],"study_design_scores_gemma":[0.0000063674865,0.000013694116,0.00093521096,0.000027717906,0.000022844333,0.000056121513,0.000070975104,0.072255805,0.00036923567,0.9242257,0.0019928613,0.000023503208],"about_ca_topic_score_codex":0.0008294371,"about_ca_topic_score_gemma":0.0009063187,"teacher_disagreement_score":0.99592143,"about_ca_system_score_codex":0.0012961433,"about_ca_system_score_gemma":0.0006058967,"threshold_uncertainty_score":0.017324448},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.458812,0.00023612779,0.53590286,0.00054946245,0.000038765338,0.00016270016,0.00023795955,0.00048073966,0.0035793078],"genre_scores_gemma":[0.9604886,0.000099001605,0.037903268,0.00003692518,0.00001674201,0.00007830417,0.00021790419,0.000029523611,0.0011298123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976305,0.00097222964,0.0001985664,0.00044898607,0.00053406204,0.00021559317],"domain_scores_gemma":[0.98283684,0.013410086,0.0017934035,0.00050567713,0.00093134475,0.0005225806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046035573,0.0006950069,0.0009446051,0.003836219,0.0016497156,0.0021233046,0.0011070921,0.0015613545,0.002206597],"category_scores_gemma":[0.024982316,0.00078747084,0.001283275,0.0020347396,0.0012222764,0.003977879,0.0017415499,0.001219731,0.00038123576],"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.00038804003,0.0001893551,0.041250218,0.00014450948,0.0002780188,0.00050136156,0.00078593177,0.8911178,0.0022969407,0.023390234,0.0008064405,0.038851097],"study_design_scores_gemma":[0.0000051661596,0.000017900578,0.0013172823,0.0000057072434,0.000016807651,0.000024528144,0.00005465872,0.99348676,0.00024260157,0.004724541,0.00009330877,0.000010805355],"about_ca_topic_score_codex":0.021214757,"about_ca_topic_score_gemma":0.019867776,"teacher_disagreement_score":0.021214757,"about_ca_system_score_codex":0.002647559,"about_ca_system_score_gemma":0.0013301122,"threshold_uncertainty_score":0.042182565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120435424,0.0021813028,0.8643601,0.0013664194,0.00009537875,0.0000707295,0.00009347385,0.00009626635,0.011300958],"genre_scores_gemma":[0.9068974,0.0028524871,0.08520121,0.00016135615,0.00020982164,0.00011475149,0.000057899393,0.000050158575,0.0044548484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957174,0.0002529062,0.000013489712,0.000050034443,0.00007264891,0.000039186885],"domain_scores_gemma":[0.9981072,0.0013137767,0.00022271255,0.000119524084,0.0001228557,0.00011386483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010658462,0.0004316817,0.0004136409,0.0013961956,0.0006620084,0.001260882,0.000754134,0.0010388428,0.0012062702],"category_scores_gemma":[0.0046978085,0.00032156895,0.0007563388,0.001203404,0.001494091,0.0021105031,0.0011391828,0.0010495286,0.00014947436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014488168,0.000031546686,0.0010702781,0.000050349525,0.000022980314,0.00031331295,0.00016499673,0.20762509,0.0014686587,0.78123283,0.00073776644,0.007267716],"study_design_scores_gemma":[0.0000051717643,0.000010668393,0.000262945,0.000009285227,0.0000060376697,0.00011154676,0.000036057198,0.79672676,0.00021784712,0.20143339,0.0011702705,0.0000099509225],"about_ca_topic_score_codex":0.001992265,"about_ca_topic_score_gemma":0.0015832258,"teacher_disagreement_score":0.001992265,"about_ca_system_score_codex":0.0010390932,"about_ca_system_score_gemma":0.00042133243,"threshold_uncertainty_score":0.007539153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65645415,0.0004443684,0.3402882,0.0004463925,0.000055579116,0.00008534416,0.00031251673,0.00035330746,0.0015601431],"genre_scores_gemma":[0.97991335,0.00020710108,0.018475275,0.000019748037,0.000041354502,0.000056587145,0.00016296888,0.000016267873,0.0011073177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997174,0.00008308737,0.000016324137,0.000091170805,0.00005649679,0.00003548917],"domain_scores_gemma":[0.9958299,0.0031339657,0.0005563241,0.00016085914,0.00022550095,0.00009342017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010347225,0.0008714346,0.00053682365,0.0014277969,0.0005061134,0.00074869127,0.0009499549,0.00088091847,0.0006560839],"category_scores_gemma":[0.0054004523,0.00036161506,0.00068853033,0.00082825794,0.00038359922,0.0015936397,0.0003963016,0.0009569446,0.0001443895],"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.000049582177,0.0001359763,0.016222918,0.00006492262,0.00009405886,0.00015378083,0.00007285461,0.9601781,0.0011202875,0.0035780184,0.000505839,0.01782366],"study_design_scores_gemma":[0.000001311164,0.0000077358945,0.0007807576,0.0000012910579,0.000009149721,0.000009549157,0.00000949479,0.9973205,0.00011659533,0.0016917102,0.000050471455,0.0000014185583],"about_ca_topic_score_codex":0.011067796,"about_ca_topic_score_gemma":0.013250768,"teacher_disagreement_score":0.011067796,"about_ca_system_score_codex":0.00068402174,"about_ca_system_score_gemma":0.0005694518,"threshold_uncertainty_score":0.02200675},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1648256,0.0014900306,0.8074304,0.0016584005,0.00029403158,0.00015140112,0.0006833134,0.00033091978,0.023135923],"genre_scores_gemma":[0.93420357,0.00095350924,0.037608944,0.00033548241,0.00016516307,0.00023116771,0.0003104413,0.000120565135,0.02607121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984944,0.0005490294,0.0000454533,0.00029791737,0.00027818093,0.0003349824],"domain_scores_gemma":[0.9969457,0.0016746212,0.00041228556,0.00022463943,0.00037782395,0.00036498552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019868105,0.0011195121,0.0016894403,0.0005856912,0.001031425,0.0021185027,0.0028956379,0.0023659202,0.0055026864],"category_scores_gemma":[0.006224993,0.0007420906,0.0010427724,0.0010654675,0.0019120151,0.0033769896,0.0016307225,0.002139297,0.0007203398],"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.0001519552,0.00007951438,0.00056721247,0.000090112175,0.000032910917,0.00035590056,0.00020640438,0.581468,0.0015592655,0.4090697,0.0018660399,0.0045530777],"study_design_scores_gemma":[0.000022831264,0.000026355525,0.00008945504,0.000006039457,0.000009033587,0.000037758593,0.000039105926,0.94967675,0.00011926936,0.049155377,0.00080550095,0.000012460967],"about_ca_topic_score_codex":0.008645412,"about_ca_topic_score_gemma":0.0060270685,"teacher_disagreement_score":0.008645412,"about_ca_system_score_codex":0.0024250352,"about_ca_system_score_gemma":0.001222557,"threshold_uncertainty_score":0.018408358},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060472833,0.00014842168,0.98846895,0.00013458284,0.00002300742,0.000121300334,0.00019458582,0.0031375925,0.0017243501],"genre_scores_gemma":[0.12633218,0.00021811726,0.8692215,0.0001441762,0.000063442094,0.0004567286,0.0008475204,0.00054331514,0.002172981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990707,0.0003023317,0.000051929455,0.00021438405,0.0002655244,0.0000951877],"domain_scores_gemma":[0.99773175,0.0014440455,0.0001643106,0.00032889633,0.0002444763,0.00008665913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015131594,0.0013124257,0.0014081527,0.0019646483,0.00075674866,0.0012243091,0.002304578,0.0011506928,0.0043702405],"category_scores_gemma":[0.005907147,0.00064607273,0.0012279126,0.0025504415,0.00092269125,0.002535688,0.0019433625,0.0012359517,0.0019563027],"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.0003166561,0.00018606563,0.0019947675,0.00035372467,0.00016916195,0.00021189694,0.00025963952,0.53118277,0.006539203,0.037317045,0.018287232,0.40318194],"study_design_scores_gemma":[0.000039015926,0.000019245519,0.00007866153,0.0000059689864,0.000009196722,0.000041797302,0.000013458068,0.9811458,0.0012254283,0.015953232,0.0014622645,0.0000060076086],"about_ca_topic_score_codex":0.0039221193,"about_ca_topic_score_gemma":0.0061923917,"teacher_disagreement_score":0.0043702405,"about_ca_system_score_codex":0.001262378,"about_ca_system_score_gemma":0.0025355057,"threshold_uncertainty_score":0.0146199465},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070431614,0.0015780567,0.98552597,0.0006599347,0.00017549621,0.000041444073,0.000097464144,0.00006806061,0.0048104175],"genre_scores_gemma":[0.5575347,0.0065460047,0.41999814,0.0007457521,0.0015725715,0.0007992505,0.0006059974,0.00031089666,0.011886621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988355,0.00061478006,0.00006017475,0.00020143918,0.00023141372,0.000056645942],"domain_scores_gemma":[0.99557567,0.0032062982,0.00037465442,0.00030057324,0.0003497294,0.00019303341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018183136,0.0009784871,0.00080878544,0.003550953,0.0008252611,0.0018799986,0.0010907135,0.0011654111,0.0024337913],"category_scores_gemma":[0.010845993,0.00043353334,0.00079004065,0.0024875742,0.0020845365,0.004915849,0.0015032787,0.0027589616,0.00054867193],"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.000005897345,0.000022462204,0.00039196585,0.000071589195,0.000032211847,0.000040770887,0.00019228164,0.028452137,0.0006756377,0.9577365,0.0016055088,0.010773069],"study_design_scores_gemma":[0.0000069289576,0.00001127473,0.00026728728,0.000032987744,0.000017503993,0.00006546909,0.0000862955,0.22700457,0.00025361552,0.76439446,0.0078477245,0.000011888007],"about_ca_topic_score_codex":0.0020789248,"about_ca_topic_score_gemma":0.0021175717,"teacher_disagreement_score":0.003550953,"about_ca_system_score_codex":0.0014784533,"about_ca_system_score_gemma":0.0006897134,"threshold_uncertainty_score":0.010726929},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048381253,0.00026479195,0.9925609,0.00048304928,0.000028674865,0.00009538738,0.00033931804,0.00020291886,0.0011868044],"genre_scores_gemma":[0.4564472,0.00117393,0.53448725,0.00049637357,0.00054440193,0.0008956415,0.001760273,0.00024898772,0.003946037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965501,0.0012989673,0.0001898503,0.0009792532,0.00079906784,0.00018280443],"domain_scores_gemma":[0.98713976,0.0096063465,0.0008665477,0.00118428,0.00090348924,0.00029952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004309889,0.0019202571,0.0026284894,0.0026807727,0.00096552493,0.002829244,0.004028468,0.0027476521,0.0026755114],"category_scores_gemma":[0.022091039,0.0011041078,0.0018506125,0.0043221614,0.002263358,0.0051015024,0.0029673046,0.0038873984,0.0007443896],"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.00012966551,0.00017342428,0.003062385,0.00033052504,0.00020306313,0.00016083666,0.00025735892,0.77988267,0.0015816392,0.13653482,0.005212234,0.072471425],"study_design_scores_gemma":[0.000011268304,0.000018291606,0.00014747893,0.000014170965,0.000012913803,0.000036753743,0.00001659135,0.93152034,0.0005871168,0.0663912,0.0012348779,0.000008946231],"about_ca_topic_score_codex":0.0038817415,"about_ca_topic_score_gemma":0.0041902927,"teacher_disagreement_score":0.004309889,"about_ca_system_score_codex":0.002906474,"about_ca_system_score_gemma":0.0015999059,"threshold_uncertainty_score":0.022793174},"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":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011035696,0.051637527,0.7513763,0.037571907,0.09813031,0.00018639387,0.0010599422,0.00076906465,0.05816499],"genre_scores_gemma":[0.04921072,0.11553576,0.38511688,0.030373126,0.2944708,0.0012010674,0.0035003189,0.0021610595,0.118430294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984168,0.00069714943,0.00011557935,0.00035625775,0.00034814246,0.000066082495],"domain_scores_gemma":[0.99490935,0.0037527755,0.00015573739,0.00045664542,0.000519988,0.00020560218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025487742,0.0022919541,0.0024634523,0.0018941252,0.0009958341,0.0038439038,0.002858927,0.00459261,0.022112342],"category_scores_gemma":[0.00808194,0.00094362063,0.002869372,0.0031577353,0.0023789576,0.0072518773,0.0019594007,0.008651814,0.009073026],"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.000036657682,0.00011672519,0.00022285945,0.0005660776,0.00012996077,0.0002704955,0.00013346043,0.009475613,0.00050249364,0.48886314,0.42139724,0.078285165],"study_design_scores_gemma":[0.000017635959,0.000035911988,0.00022048756,0.00020504581,0.00005407665,0.00027328986,0.000041291067,0.018709725,0.0001599966,0.58010143,0.40012664,0.000054484975],"about_ca_topic_score_codex":0.0015818162,"about_ca_topic_score_gemma":0.0018973995,"teacher_disagreement_score":0.022112342,"about_ca_system_score_codex":0.0015735691,"about_ca_system_score_gemma":0.0010603176,"threshold_uncertainty_score":0.07397312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921204,0.000086159096,0.0063257464,0.00021828071,0.0000065544095,0.000012500396,0.000052031563,0.000017200015,0.0011611455],"genre_scores_gemma":[0.99934167,0.00005311103,0.00035741442,0.000010556906,0.00000493317,0.0000064937317,0.00003032343,0.0000012910122,0.0001941689],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997273,0.00012206234,0.000013157486,0.00006425825,0.000035012323,0.00003822357],"domain_scores_gemma":[0.9966905,0.002217555,0.000557511,0.0002016004,0.00016332186,0.00016940421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006474405,0.00014695918,0.0002610845,0.0009848197,0.0004930706,0.0007367851,0.00023552467,0.00043353706,0.0012626636],"category_scores_gemma":[0.006107421,0.00012271869,0.00018006697,0.00038528946,0.0005580907,0.0010681017,0.00074297574,0.00026401348,0.000086812004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011725776,0.0003629224,0.41870537,0.0004643491,0.0011847686,0.0042770035,0.0069625936,0.33672214,0.0430309,0.089031324,0.006475141,0.091610886],"study_design_scores_gemma":[0.000033681918,0.00024489808,0.15329657,0.000035195182,0.00018359763,0.0012558677,0.002284892,0.79070175,0.0022641476,0.0472529,0.002380885,0.00006554934],"about_ca_topic_score_codex":0.0021568749,"about_ca_topic_score_gemma":0.0011256787,"teacher_disagreement_score":0.0021568749,"about_ca_system_score_codex":0.00036620078,"about_ca_system_score_gemma":0.0001276782,"threshold_uncertainty_score":0.004288614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00933082,0.0012985738,0.9496362,0.0022741826,0.00036886052,0.0000344521,0.00022866386,0.00011529421,0.036712848],"genre_scores_gemma":[0.6165488,0.008295755,0.3268346,0.0015457643,0.0021545957,0.00037674973,0.0004861714,0.00035866376,0.04339892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991628,0.00025165823,0.000037260856,0.00010364688,0.00036973372,0.00007487094],"domain_scores_gemma":[0.9982151,0.00094558037,0.00014622952,0.00037100562,0.00025916973,0.00006292264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015325426,0.0008726133,0.00081355724,0.0017931218,0.00068063155,0.0023637556,0.002238216,0.0015985218,0.0052691684],"category_scores_gemma":[0.0061150067,0.0004514983,0.0011173487,0.0013753342,0.0019196256,0.005983075,0.0016878769,0.0019784726,0.0008419128],"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.0000028667512,0.000007152222,0.000065992965,0.000026882564,0.000006052209,0.000034637233,0.00003087514,0.03932053,0.000143628,0.95673615,0.00047191215,0.0031532194],"study_design_scores_gemma":[0.0000048357138,0.000004971054,0.00004059197,0.000012035212,0.0000043501445,0.000042607382,0.000012681641,0.24584965,0.00007450877,0.7510434,0.0029044212,0.000005831638],"about_ca_topic_score_codex":0.0031604788,"about_ca_topic_score_gemma":0.002379811,"teacher_disagreement_score":0.0052691684,"about_ca_system_score_codex":0.0015507775,"about_ca_system_score_gemma":0.0009485748,"threshold_uncertainty_score":0.01762712},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019299524,0.0021217358,0.94357675,0.0030833543,0.00018912113,0.0000711534,0.000748461,0.0005183933,0.030391412],"genre_scores_gemma":[0.8288742,0.006674191,0.11202674,0.0015394238,0.0008766464,0.00063293375,0.0016956108,0.00052848505,0.047151778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993844,0.00025600832,0.000021797965,0.0001215764,0.0001472575,0.00006889759],"domain_scores_gemma":[0.99708027,0.001965844,0.00030807918,0.00022364534,0.00021193144,0.00021016669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001342448,0.0009545083,0.0010035076,0.0017555443,0.00089775067,0.0020650986,0.0017502069,0.0019526231,0.010512666],"category_scores_gemma":[0.007410965,0.00056391396,0.00121298,0.0015400243,0.0023992439,0.0026791682,0.0016530008,0.002201534,0.0014329521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006769413,0.000010630726,0.0003131804,0.00003665357,0.000020746134,0.0000749562,0.00013211624,0.137922,0.00028385356,0.8550837,0.002449053,0.0036664535],"study_design_scores_gemma":[0.000008855345,0.0000057192187,0.00014911222,0.000012577152,0.000010069083,0.00006698107,0.000027293141,0.41813463,0.00004118057,0.57713175,0.0044003446,0.00001143878],"about_ca_topic_score_codex":0.00809664,"about_ca_topic_score_gemma":0.007139919,"teacher_disagreement_score":0.010512666,"about_ca_system_score_codex":0.0020857002,"about_ca_system_score_gemma":0.00080795115,"threshold_uncertainty_score":0.03516841},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3159799,0.0032526879,0.647797,0.003874496,0.00039788548,0.00017129039,0.0005475791,0.00055777293,0.027421458],"genre_scores_gemma":[0.9563203,0.0021863275,0.022191793,0.00039675052,0.0005134152,0.000354208,0.0003181738,0.00017936902,0.017539594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985812,0.0006148996,0.000059471306,0.0002624535,0.0003018636,0.00018012484],"domain_scores_gemma":[0.97628057,0.017900033,0.002388902,0.0012207387,0.0008905532,0.0013191832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032613734,0.001002819,0.0018741087,0.0030211315,0.0017234143,0.002565994,0.0034839541,0.0033677006,0.0052688858],"category_scores_gemma":[0.03335791,0.0008505487,0.001160508,0.0019132202,0.004166998,0.006003994,0.001927207,0.0024731313,0.0008680931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011041345,0.00008891486,0.0017396362,0.00023722662,0.00006127755,0.000317706,0.00044518826,0.11765867,0.002565697,0.85678065,0.0044851243,0.015509408],"study_design_scores_gemma":[0.000049359456,0.00004267348,0.00097189995,0.000038458784,0.00003691962,0.0002589017,0.00009082196,0.4691168,0.00045422025,0.5270578,0.0018361531,0.000045890938],"about_ca_topic_score_codex":0.0016387104,"about_ca_topic_score_gemma":0.0013317143,"teacher_disagreement_score":0.0052688858,"about_ca_system_score_codex":0.0015184633,"about_ca_system_score_gemma":0.00087076024,"threshold_uncertainty_score":0.017626107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06981948,0.0005376965,0.92757267,0.00018940297,0.000012582357,0.000112202244,0.00021096588,0.0005250883,0.001019889],"genre_scores_gemma":[0.5128992,0.00030629057,0.48518357,0.00006292627,0.00003544714,0.0001685757,0.00058277237,0.00008505241,0.0006761245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997846,0.00084240915,0.00013846268,0.00048912334,0.00053587137,0.00014817578],"domain_scores_gemma":[0.9933187,0.0038155124,0.0012687077,0.00056027493,0.00080559344,0.00023125892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032669834,0.0007982596,0.0009799994,0.006365437,0.001067593,0.0015069046,0.0014865396,0.0011084297,0.00081134157],"category_scores_gemma":[0.013422331,0.0006313346,0.0010823847,0.002984202,0.0010705589,0.0036304886,0.0016799475,0.00061642815,0.00030713607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007572638,0.00031900776,0.041361652,0.00075687456,0.0008110931,0.0006795498,0.0016112954,0.37920657,0.022336338,0.068387836,0.005470508,0.47830206],"study_design_scores_gemma":[0.000026156176,0.00007608815,0.00457116,0.00004295706,0.00005442029,0.00042242242,0.00015128616,0.92558455,0.0058157714,0.061314367,0.0019006825,0.00004012758],"about_ca_topic_score_codex":0.0021078745,"about_ca_topic_score_gemma":0.0025184148,"teacher_disagreement_score":0.006365437,"about_ca_system_score_codex":0.0011339232,"about_ca_system_score_gemma":0.00079662027,"threshold_uncertainty_score":0.017277718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07375347,0.0007664864,0.8532305,0.002873739,0.00079281995,0.00021572661,0.00068306574,0.0008273006,0.066856876],"genre_scores_gemma":[0.856773,0.0009887287,0.08083495,0.0010550256,0.00048284474,0.00030842394,0.0005424313,0.00023880844,0.058775708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928707,0.00024117046,0.000021447373,0.00019358033,0.00018101686,0.00007573164],"domain_scores_gemma":[0.99705327,0.001219132,0.00024335155,0.0006970839,0.00046645646,0.0003208542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009262378,0.0004273254,0.00060726627,0.0015476297,0.00086993387,0.0011674522,0.0011441724,0.0010949507,0.011029345],"category_scores_gemma":[0.0076240813,0.00037951913,0.0005608832,0.0010644206,0.0010147817,0.002475723,0.0014468603,0.0014936755,0.0011866213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008844505,0.000053166237,0.0009913138,0.00008435213,0.000057957837,0.0001937561,0.000082222585,0.05882893,0.0047629103,0.8931719,0.011771314,0.02991367],"study_design_scores_gemma":[0.000022141583,0.000034486075,0.0009581014,0.000012456887,0.000027734053,0.00033812894,0.0000548761,0.3311991,0.0021501272,0.65430725,0.01087286,0.00002271461],"about_ca_topic_score_codex":0.0015037862,"about_ca_topic_score_gemma":0.001726584,"teacher_disagreement_score":0.011029345,"about_ca_system_score_codex":0.0012337933,"about_ca_system_score_gemma":0.0008358804,"threshold_uncertainty_score":0.036896765},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.695656,0.0006555097,0.27348998,0.0004972387,0.000118756965,0.000089050605,0.0004493081,0.00045212248,0.028592058],"genre_scores_gemma":[0.9321523,0.0010805014,0.055716794,0.00008477909,0.000053444415,0.00009184349,0.00037321838,0.000095305055,0.010351804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997813,0.00003879296,0.000011335158,0.00008852672,0.00004943662,0.000030648713],"domain_scores_gemma":[0.9992908,0.0003086427,0.000087801236,0.00014927176,0.000101317804,0.00006206169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025275964,0.0003564699,0.00047490522,0.00073996384,0.0005024263,0.0018784263,0.0005401838,0.0008188016,0.0025603678],"category_scores_gemma":[0.0022785836,0.00031330326,0.00034708728,0.00085929316,0.0005521902,0.0018816073,0.00077638874,0.0004348292,0.0007325271],"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.00020607671,0.00012225924,0.006603964,0.0004991463,0.00009298403,0.0014937433,0.0006062147,0.55967647,0.19277185,0.16525342,0.00216756,0.07050625],"study_design_scores_gemma":[0.000015167439,0.000103913895,0.002976323,0.000036240555,0.00003988587,0.00048686072,0.00027333605,0.92380655,0.018379822,0.048285928,0.0055645034,0.000031525036],"about_ca_topic_score_codex":0.0012143678,"about_ca_topic_score_gemma":0.0011977998,"teacher_disagreement_score":0.0025603678,"about_ca_system_score_codex":0.00053231046,"about_ca_system_score_gemma":0.00034975054,"threshold_uncertainty_score":0.008565307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05252414,0.00020384278,0.94556445,0.00014434065,0.000047086865,0.00022330858,0.00021696757,0.00039928866,0.0006766165],"genre_scores_gemma":[0.6875934,0.00040002164,0.30837205,0.0001627489,0.00013677802,0.0006753394,0.00089593936,0.00007942291,0.0016842898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719393,0.001715739,0.00010589632,0.00045104203,0.0004149822,0.000118371354],"domain_scores_gemma":[0.98838836,0.008327485,0.00084906735,0.001664611,0.00057585654,0.00019474186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003997716,0.0007535927,0.0010784622,0.002244044,0.0005705329,0.0009992712,0.0015431489,0.00096155866,0.0011901474],"category_scores_gemma":[0.021188183,0.0005543061,0.00093841687,0.0013653316,0.0009948986,0.0026046294,0.0011030608,0.00082541764,0.00041749384],"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.0004232714,0.0002486868,0.022840288,0.00042655374,0.00037636308,0.0004103835,0.00047947932,0.709201,0.006344039,0.14047217,0.0035610632,0.1152167],"study_design_scores_gemma":[0.000025813786,0.00003998262,0.000880078,0.000012866282,0.000016762384,0.000060766542,0.000027641114,0.9678054,0.00075110514,0.029591385,0.0007740525,0.000014290069],"about_ca_topic_score_codex":0.0030351891,"about_ca_topic_score_gemma":0.0033672687,"teacher_disagreement_score":0.003997716,"about_ca_system_score_codex":0.0006811864,"about_ca_system_score_gemma":0.00051868055,"threshold_uncertainty_score":0.021142185},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04449995,0.014979934,0.90776455,0.0063067637,0.00050989806,0.00015987847,0.0003799517,0.00021428143,0.025184778],"genre_scores_gemma":[0.75313956,0.032263555,0.18449943,0.0016101893,0.0026273478,0.00069320056,0.001029044,0.0003380844,0.023799498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837106,0.00097147445,0.000068745205,0.00021106728,0.00026500341,0.000112602924],"domain_scores_gemma":[0.991919,0.0068185222,0.00046156274,0.00019102894,0.00037054712,0.00023936096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026240991,0.0013918212,0.0013924344,0.0020933563,0.0008829037,0.0026081447,0.0012686368,0.0023366984,0.0025909573],"category_scores_gemma":[0.0127803525,0.00064365246,0.0007713303,0.0033580002,0.0018612719,0.0044172104,0.0015405987,0.0019788935,0.0005209394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076762684,0.00007960482,0.0009999303,0.0002825379,0.00008077256,0.00019136175,0.0001442472,0.42277846,0.0005196874,0.54690474,0.0058635147,0.022078402],"study_design_scores_gemma":[0.000023477874,0.000033834232,0.00024560458,0.000048770617,0.000015736345,0.00006887645,0.0000424808,0.5733698,0.00009880351,0.42196852,0.0040681157,0.00001586255],"about_ca_topic_score_codex":0.0024932423,"about_ca_topic_score_gemma":0.00228128,"teacher_disagreement_score":0.0026240991,"about_ca_system_score_codex":0.0014359225,"about_ca_system_score_gemma":0.0008695041,"threshold_uncertainty_score":0.01387769},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011386865,0.00040463908,0.9844977,0.000529624,0.000029022536,0.00006668562,0.0013036847,0.0003645027,0.0014172628],"genre_scores_gemma":[0.34200627,0.0016673217,0.6471071,0.00035069586,0.00022712721,0.0006674876,0.004189722,0.00029414543,0.0034901334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99391174,0.004237459,0.0002180476,0.0005951487,0.00090757734,0.000130085],"domain_scores_gemma":[0.95416874,0.037950467,0.0020050055,0.0031319493,0.002331537,0.00041231915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007942573,0.00055609125,0.0010758169,0.0028855214,0.0007344105,0.001776636,0.0012484768,0.0007934588,0.0041773077],"category_scores_gemma":[0.047360945,0.0005216955,0.0008964869,0.0031840405,0.000904542,0.0023010548,0.001967387,0.0016578716,0.00081191154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021507152,0.00014463186,0.007475208,0.0003763943,0.00033589307,0.00024209269,0.00045466988,0.33685753,0.0023063412,0.3966922,0.011845993,0.243054],"study_design_scores_gemma":[0.000015339396,0.000024345756,0.0018724833,0.000053537402,0.000024345081,0.00008563366,0.00005617605,0.5997965,0.00049177126,0.39084348,0.0067018834,0.000034460754],"about_ca_topic_score_codex":0.0049869097,"about_ca_topic_score_gemma":0.005113705,"teacher_disagreement_score":0.007942573,"about_ca_system_score_codex":0.00096379203,"about_ca_system_score_gemma":0.0012534622,"threshold_uncertainty_score":0.042004824},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.427315,0.0007605742,0.55999655,0.0019552088,0.00005684913,0.000116888266,0.00021758133,0.00035301445,0.009228283],"genre_scores_gemma":[0.98297495,0.0004713116,0.013883494,0.00014234446,0.000057056528,0.00007465152,0.00009553886,0.00005088796,0.002249703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892956,0.0006099751,0.00003635362,0.00017587621,0.0001334439,0.00011482243],"domain_scores_gemma":[0.9918481,0.005684368,0.0011847928,0.00042616762,0.00037804822,0.00047862448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030468584,0.00066729565,0.0010150524,0.0013984032,0.0010829247,0.0018618867,0.0011482539,0.0012034137,0.002586627],"category_scores_gemma":[0.012151015,0.0006128031,0.0010094119,0.00088035123,0.003283949,0.003913485,0.0015782004,0.001124255,0.00017648142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012055479,0.000046285953,0.0039481847,0.000091112066,0.000067627625,0.0004724275,0.00039410125,0.4517782,0.0031495376,0.5326044,0.0010805055,0.006246933],"study_design_scores_gemma":[0.000022886978,0.00001978011,0.0007226995,0.000013554719,0.0000160755,0.00008755612,0.00007656996,0.76868564,0.00036613573,0.22956668,0.00040596156,0.000016499655],"about_ca_topic_score_codex":0.0050238804,"about_ca_topic_score_gemma":0.002969924,"teacher_disagreement_score":0.0050238804,"about_ca_system_score_codex":0.001691523,"about_ca_system_score_gemma":0.00071500376,"threshold_uncertainty_score":0.01611352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17770597,0.00094712875,0.81171304,0.0013202393,0.00006558879,0.000052313248,0.00035569273,0.00014786501,0.007692117],"genre_scores_gemma":[0.9587157,0.0016319043,0.032138456,0.00017825858,0.00011093996,0.00011737972,0.00025247663,0.000033242777,0.0068216072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945194,0.00024063264,0.00002893978,0.00011364633,0.00011494155,0.000049836064],"domain_scores_gemma":[0.99269193,0.0052800816,0.000997322,0.00030799833,0.00043722262,0.00028544312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011699749,0.00052782823,0.00069954415,0.001488987,0.00051954796,0.0016031356,0.0010378832,0.0010067894,0.0018711087],"category_scores_gemma":[0.008425804,0.00041868453,0.00053636555,0.0010743405,0.0015069455,0.0029968738,0.0012096363,0.0009992745,0.00023430532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006122964,0.000040459978,0.0018944358,0.00012652061,0.000067146415,0.00028734357,0.00031315317,0.34555545,0.0024946004,0.6367933,0.001276646,0.011089729],"study_design_scores_gemma":[0.000009864782,0.000009473597,0.0003515472,0.000010493459,0.000009489059,0.00006942844,0.000037141424,0.782302,0.0001774037,0.21633518,0.0006797703,0.000008232861],"about_ca_topic_score_codex":0.0019539646,"about_ca_topic_score_gemma":0.0017608906,"teacher_disagreement_score":0.0019539646,"about_ca_system_score_codex":0.0008441412,"about_ca_system_score_gemma":0.00042984966,"threshold_uncertainty_score":0.006259501},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23100232,0.0014139424,0.7495712,0.0021906053,0.00006659637,0.0001759287,0.00021759792,0.00043119662,0.014930616],"genre_scores_gemma":[0.9195863,0.00037377988,0.07789759,0.000075262295,0.0000363221,0.00005837546,0.00008119453,0.000021330641,0.0018698184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794644,0.0010202765,0.00011189329,0.00034423714,0.00043208356,0.00014504587],"domain_scores_gemma":[0.99196905,0.0059034177,0.0005937555,0.0004643134,0.0008451398,0.00022438432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004424646,0.00047930022,0.0010214745,0.0024817644,0.00095757126,0.0030948352,0.0014382887,0.0020910644,0.0017313475],"category_scores_gemma":[0.017978868,0.00061570155,0.0005787649,0.0018629202,0.0010571157,0.0042880448,0.0013048614,0.00093977374,0.00031516724],"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.00016998166,0.00027566563,0.025664015,0.00019778786,0.0003338183,0.00040661226,0.0009172815,0.6049208,0.0010983181,0.14123994,0.0019531979,0.22282252],"study_design_scores_gemma":[0.000020599122,0.00008034797,0.003925215,0.00003298257,0.00006026675,0.000070498696,0.000273441,0.9263364,0.00050747464,0.0663681,0.002274924,0.000049687726],"about_ca_topic_score_codex":0.010877729,"about_ca_topic_score_gemma":0.022357892,"teacher_disagreement_score":0.010877729,"about_ca_system_score_codex":0.0015750612,"about_ca_system_score_gemma":0.001261518,"threshold_uncertainty_score":0.023400068},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1669149,0.0002256738,0.82875293,0.00017218385,0.000012267852,0.00006944633,0.00020252202,0.00013601418,0.0035140847],"genre_scores_gemma":[0.9584725,0.00016900699,0.040269136,0.000026824333,0.000031343632,0.000091184775,0.00022575466,0.00002745493,0.00068686606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989177,0.00031289092,0.000053775537,0.00027180283,0.00033284773,0.00011094569],"domain_scores_gemma":[0.9847062,0.011607963,0.0015564178,0.00063700025,0.0010109618,0.00048148414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001957478,0.00052566576,0.0004834162,0.0029811433,0.00073838315,0.0013344531,0.0006948456,0.0004998661,0.0017512937],"category_scores_gemma":[0.015672553,0.00019650428,0.0007238842,0.0017530841,0.0015283048,0.002172638,0.0010102661,0.00086637225,0.00011522945],"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.00025116277,0.00014462194,0.023404393,0.00020004122,0.0001435663,0.0004059372,0.00068704004,0.5141482,0.016629588,0.3652905,0.0010425748,0.07765246],"study_design_scores_gemma":[0.000010867572,0.000053147407,0.0041829,0.000014510971,0.000025783631,0.00011761315,0.00009184012,0.8975682,0.0018218723,0.09550361,0.0005827681,0.000026768575],"about_ca_topic_score_codex":0.002208123,"about_ca_topic_score_gemma":0.0019182139,"teacher_disagreement_score":0.0029811433,"about_ca_system_score_codex":0.001235489,"about_ca_system_score_gemma":0.0006648511,"threshold_uncertainty_score":0.010352254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008739302,0.00012583916,0.9895465,0.00010177498,0.000025107776,0.000066832035,0.0001697066,0.000388273,0.0008365592],"genre_scores_gemma":[0.37235564,0.00023995044,0.61782855,0.00017150825,0.0002314762,0.0005547574,0.00090545125,0.00025718927,0.0074554267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777466,0.00077452575,0.00010698924,0.00043301168,0.0007364172,0.00017449689],"domain_scores_gemma":[0.99499524,0.0027177043,0.00037712397,0.0005339655,0.0010367032,0.00033929036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003774793,0.00091272936,0.0016748792,0.003285187,0.0012778182,0.0024829817,0.0027050173,0.0017540284,0.0049590818],"category_scores_gemma":[0.010669263,0.0006961816,0.0010304545,0.0022601923,0.0007386922,0.005231831,0.003827186,0.0017032867,0.0015716044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008132187,0.0005784413,0.008907473,0.00042679787,0.0005249736,0.00031648608,0.00077413087,0.32496583,0.01101179,0.1633677,0.010181456,0.47813168],"study_design_scores_gemma":[0.000009496736,0.000021255753,0.00020837325,0.0000060223592,0.000013185467,0.000016443557,0.000028247629,0.9796951,0.0005035031,0.018782519,0.00070718373,0.000008626352],"about_ca_topic_score_codex":0.0030734758,"about_ca_topic_score_gemma":0.0053651026,"teacher_disagreement_score":0.0049590818,"about_ca_system_score_codex":0.0009575343,"about_ca_system_score_gemma":0.001200767,"threshold_uncertainty_score":0.019963264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7557152,0.0012793231,0.22019076,0.001116826,0.00016012286,0.00034518508,0.000578398,0.00045670298,0.020157486],"genre_scores_gemma":[0.9596667,0.00080816227,0.03774444,0.000088026,0.000024993413,0.0002542879,0.00019738497,0.000031165735,0.0011848152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913186,0.0005885438,0.0000368727,0.000056047276,0.00010975031,0.000076958],"domain_scores_gemma":[0.98990005,0.009096437,0.00040169133,0.00023693213,0.0002616791,0.000103163846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013131778,0.0006637464,0.00054989127,0.0010967054,0.00058812567,0.0009848905,0.0006950387,0.0013757186,0.0010621541],"category_scores_gemma":[0.00736487,0.00031142178,0.0005502436,0.0011038019,0.0007832805,0.0011019743,0.00066536205,0.000738789,0.00009383077],"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.000028426874,0.000059133006,0.0026599427,0.000030817435,0.000036380236,0.000030239768,0.00004829965,0.98812383,0.00046401707,0.0059953225,0.00011586794,0.0024076952],"study_design_scores_gemma":[0.000009600465,0.00003367711,0.00027200335,0.000007621723,0.000007613455,0.00000984346,0.000029104835,0.9962226,0.0003324832,0.0027244482,0.000345496,0.000005562171],"about_ca_topic_score_codex":0.011615567,"about_ca_topic_score_gemma":0.005149119,"teacher_disagreement_score":0.011615567,"about_ca_system_score_codex":0.0010919289,"about_ca_system_score_gemma":0.00081984693,"threshold_uncertainty_score":0.023095906},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19772525,0.0057483134,0.77979743,0.0010514441,0.00014830772,0.00012419376,0.00024220951,0.0003013133,0.014861523],"genre_scores_gemma":[0.982227,0.0017105275,0.014543483,0.000059204256,0.00013726352,0.000056082394,0.0000939689,0.000040221956,0.0011322025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986966,0.0003523816,0.00005595804,0.0003006925,0.00041903142,0.0001752449],"domain_scores_gemma":[0.99399465,0.0035719448,0.00091358094,0.00030521097,0.0008725901,0.00034207312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014798646,0.00048750037,0.0006290172,0.00302532,0.0009892917,0.0019478878,0.0008231457,0.0007163665,0.00095140276],"category_scores_gemma":[0.0101103205,0.00035159008,0.0003813539,0.0015555684,0.0020214259,0.003477621,0.0014165356,0.0008916478,0.00014362753],"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.00013034137,0.000029274372,0.0050193695,0.00027428663,0.00008818321,0.00041903125,0.0006391755,0.4833222,0.007031028,0.44885442,0.0024119138,0.051780812],"study_design_scores_gemma":[0.000012238162,0.000075556025,0.0020567463,0.0000701443,0.000038439754,0.0003624635,0.00031387262,0.5574581,0.0031540939,0.42893776,0.007478635,0.000041894702],"about_ca_topic_score_codex":0.0029865054,"about_ca_topic_score_gemma":0.001610973,"teacher_disagreement_score":0.00302532,"about_ca_system_score_codex":0.0019674308,"about_ca_system_score_gemma":0.00071845413,"threshold_uncertainty_score":0.014274776},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9480139,0.00022937306,0.047534686,0.0002254647,0.000026117335,0.00002462693,0.00007397502,0.00008451976,0.003787416],"genre_scores_gemma":[0.99569845,0.000121140816,0.0032290467,0.0000190761,0.000008925657,0.000018327486,0.000035713118,0.000010236137,0.0008591703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998859,0.00004100436,0.0000052434793,0.000019242161,0.000020958383,0.00002758103],"domain_scores_gemma":[0.9996568,0.00012305206,0.00011158847,0.000025871479,0.000035900943,0.000046819998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024444668,0.00027813515,0.00029155792,0.00061722565,0.00041387812,0.0005571311,0.00046307806,0.0004883245,0.0009893036],"category_scores_gemma":[0.0013037141,0.00020118825,0.00035369038,0.00034171747,0.0006780857,0.0011664334,0.0003704265,0.00032849188,0.000060035276],"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.00021778514,0.000080744125,0.0024506627,0.000075764314,0.00007312503,0.0005757958,0.00019428857,0.8214891,0.0171382,0.15257663,0.0007402354,0.004387766],"study_design_scores_gemma":[0.000019725794,0.000023065155,0.00049318484,0.0000050727763,0.000010103613,0.00002603785,0.00002241204,0.97530794,0.00071743195,0.023211872,0.00015498606,0.000008218144],"about_ca_topic_score_codex":0.003574303,"about_ca_topic_score_gemma":0.0024871281,"teacher_disagreement_score":0.003574303,"about_ca_system_score_codex":0.00056922634,"about_ca_system_score_gemma":0.0003290915,"threshold_uncertainty_score":0.0071070194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015047007,0.00060923316,0.97609794,0.00041045877,0.00007794191,0.000055196404,0.0003166921,0.00018819298,0.0071973177],"genre_scores_gemma":[0.4518549,0.0016552483,0.53699917,0.0003907979,0.00032651814,0.00056197005,0.0009908724,0.00017228897,0.0070481994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883527,0.0004969574,0.000057710586,0.00025484362,0.00028400295,0.00007127278],"domain_scores_gemma":[0.9975279,0.0011329063,0.00041963474,0.00035726588,0.0004564526,0.00010593401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001256773,0.000624248,0.00054393243,0.00282834,0.00052755984,0.0020202855,0.0009510792,0.0010447397,0.004015212],"category_scores_gemma":[0.0051809736,0.00027661116,0.000702707,0.002430086,0.0015818434,0.0042496324,0.0009182037,0.0010855685,0.00068999844],"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.000030452135,0.00001556239,0.00020132345,0.00006567894,0.000014564641,0.00007975314,0.00013326186,0.043698385,0.0013255618,0.9236849,0.0015895754,0.029160969],"study_design_scores_gemma":[0.000009907406,0.000028354501,0.00018212563,0.000025025838,0.000007325048,0.00012393031,0.00006693066,0.22104612,0.00071799586,0.7698856,0.007888045,0.000018703542],"about_ca_topic_score_codex":0.001457442,"about_ca_topic_score_gemma":0.0010966006,"teacher_disagreement_score":0.004015212,"about_ca_system_score_codex":0.00138259,"about_ca_system_score_gemma":0.00052002433,"threshold_uncertainty_score":0.013432205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9430284,0.0005289488,0.049513806,0.0008542102,0.000027951755,0.0001732712,0.0022806663,0.00016900238,0.003423764],"genre_scores_gemma":[0.98847765,0.00014831279,0.009648094,0.00004872921,0.000046323083,0.0000868379,0.0010088717,0.000028195149,0.0005070712],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983229,0.0008381228,0.000062248095,0.00027998223,0.00040886478,0.00008784143],"domain_scores_gemma":[0.98209596,0.012460099,0.0021058805,0.0011486693,0.0015456645,0.00064383924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024463069,0.0003490018,0.00040983324,0.0026915965,0.00084780843,0.0011579903,0.0007863381,0.0008099071,0.0008889968],"category_scores_gemma":[0.025110872,0.00032485803,0.00053820974,0.0022948321,0.0007755192,0.0026294172,0.0007142009,0.00079473003,0.00033079862],"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.00056211645,0.0007186169,0.6266753,0.0007625415,0.000578958,0.0014988529,0.0055784285,0.1781396,0.021062352,0.08135107,0.0076354067,0.07543672],"study_design_scores_gemma":[0.00003445552,0.00018105662,0.1138739,0.000053908374,0.00006765798,0.0006124506,0.0013536707,0.84718525,0.0045052725,0.024907187,0.007166407,0.000058665],"about_ca_topic_score_codex":0.0053651403,"about_ca_topic_score_gemma":0.005694157,"teacher_disagreement_score":0.0053651403,"about_ca_system_score_codex":0.0010849569,"about_ca_system_score_gemma":0.00047205304,"threshold_uncertainty_score":0.012937486},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013405475,0.042022727,0.592636,0.009660764,0.0038884825,0.00008335997,0.00088948815,0.0007695701,0.3366442],"genre_scores_gemma":[0.35961258,0.06427753,0.13163194,0.0016638966,0.012766937,0.00045381158,0.0013476533,0.0006633847,0.4275823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958676,0.00009389664,0.000015409449,0.00008195163,0.00019700294,0.000025113659],"domain_scores_gemma":[0.9981111,0.0014843796,0.00006915717,0.00011652618,0.0001587344,0.000060127437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067990477,0.00096072035,0.0006758683,0.0016942144,0.00061052747,0.0020855782,0.00061636674,0.00089511095,0.009895643],"category_scores_gemma":[0.003912513,0.00045811286,0.0005081468,0.0026127794,0.0014829476,0.0040422603,0.0008152945,0.001665541,0.002079458],"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.000015567935,0.000033107324,0.00035448745,0.00022358457,0.000044176606,0.00007687766,0.00026204318,0.026686395,0.00047169704,0.77346414,0.062202472,0.13616547],"study_design_scores_gemma":[0.0000060566763,0.000008770323,0.00044635413,0.000051516417,0.000017600309,0.00006327636,0.00004452961,0.042442847,0.00022676111,0.8961101,0.060567286,0.0000149279595],"about_ca_topic_score_codex":0.002021702,"about_ca_topic_score_gemma":0.0023777876,"teacher_disagreement_score":0.009895643,"about_ca_system_score_codex":0.0010628242,"about_ca_system_score_gemma":0.0004741148,"threshold_uncertainty_score":0.03310424},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2078019,0.0006005209,0.7628978,0.0011687923,0.00009094875,0.0003448585,0.0004129849,0.0002641322,0.02641812],"genre_scores_gemma":[0.71431875,0.00025715225,0.28252038,0.00013338968,0.00003258459,0.0001237459,0.00017088499,0.000011211353,0.0024318886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812835,0.0006795917,0.00015006616,0.00040874045,0.0005221889,0.00011101408],"domain_scores_gemma":[0.9955636,0.002957736,0.0005152136,0.00027884464,0.00048261476,0.00020190646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027975198,0.00039221282,0.00036537036,0.0039952183,0.0019298731,0.0028571712,0.0007877489,0.0011528861,0.0016850678],"category_scores_gemma":[0.0064838286,0.00025293345,0.0010577469,0.0023636299,0.002284986,0.0029632135,0.0011808077,0.0007095091,0.00028499414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045175254,0.000422581,0.056262612,0.0004868263,0.0002675805,0.0019029742,0.012338691,0.10026482,0.015432362,0.38765737,0.003692597,0.42081982],"study_design_scores_gemma":[0.000031211028,0.00016456524,0.024177847,0.00025085642,0.00011700313,0.00083935756,0.0071518905,0.6438676,0.005076448,0.30721912,0.0108957505,0.00020828226],"about_ca_topic_score_codex":0.013896208,"about_ca_topic_score_gemma":0.01414309,"teacher_disagreement_score":0.013896208,"about_ca_system_score_codex":0.0023713885,"about_ca_system_score_gemma":0.0007679222,"threshold_uncertainty_score":0.027630627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75888944,0.0035767895,0.20221423,0.010709114,0.00014876579,0.00021541568,0.00096903363,0.00025893108,0.02301834],"genre_scores_gemma":[0.9931038,0.00077728194,0.003995067,0.00019932576,0.000059831324,0.000063295316,0.00016152409,0.00002930336,0.0016106556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964521,0.00239787,0.000078337514,0.0005448047,0.00031666362,0.00021022068],"domain_scores_gemma":[0.9764446,0.017084304,0.0037542963,0.0013268257,0.0006714029,0.0007186565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00432736,0.00051079196,0.00092402846,0.0014512656,0.0012416337,0.0036482376,0.0016055057,0.0015407555,0.003852945],"category_scores_gemma":[0.04324103,0.00041833025,0.0006229375,0.0020148964,0.0033891925,0.0071798353,0.0013649566,0.0011258471,0.00058354874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005500289,0.00016618911,0.0863773,0.0004298712,0.00049114844,0.0012158173,0.0045830654,0.20284545,0.0015092829,0.6132782,0.0114187505,0.077134974],"study_design_scores_gemma":[0.00010614183,0.00013712997,0.020099945,0.000104104336,0.00015713066,0.00090053264,0.0026864999,0.27423468,0.00049367175,0.69083625,0.010153394,0.0000905547],"about_ca_topic_score_codex":0.0041208263,"about_ca_topic_score_gemma":0.0042920513,"teacher_disagreement_score":0.00432736,"about_ca_system_score_codex":0.0017267393,"about_ca_system_score_gemma":0.00040959264,"threshold_uncertainty_score":0.022885501},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041874304,0.00020611021,0.95623195,0.0002933988,0.000031465825,0.00003505613,0.00018370079,0.00018062111,0.0009632863],"genre_scores_gemma":[0.8387751,0.0006854149,0.15446527,0.000110161556,0.00012986369,0.00022034421,0.0006591196,0.00012663058,0.0048280777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993912,0.00028416183,0.00002595061,0.00014819282,0.000099853736,0.000050630588],"domain_scores_gemma":[0.99535,0.00354545,0.00043393738,0.0002824902,0.00026282461,0.00012528613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012056556,0.00090821274,0.0007254688,0.0015997833,0.00058114674,0.0012448332,0.0013247177,0.001238546,0.001269948],"category_scores_gemma":[0.0075801457,0.00074129534,0.0009906933,0.0012070743,0.0009083716,0.0035550962,0.0013200275,0.0013918743,0.00035462444],"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.000034463883,0.000076956065,0.0018934081,0.000052412255,0.00006748737,0.000059782396,0.00011262713,0.94007355,0.0006393126,0.039421156,0.00078296167,0.016785868],"study_design_scores_gemma":[0.0000010861621,0.0000021775395,0.000058745736,0.0000018755925,0.0000027506997,0.0000042910756,0.000007721138,0.9894649,0.00004027525,0.010301078,0.00011362599,0.0000014543522],"about_ca_topic_score_codex":0.0066971253,"about_ca_topic_score_gemma":0.009793688,"teacher_disagreement_score":0.0066971253,"about_ca_system_score_codex":0.00084621244,"about_ca_system_score_gemma":0.00066612946,"threshold_uncertainty_score":0.013316274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66227096,0.00095301494,0.32218537,0.0029833368,0.00012833644,0.00008710576,0.00033784105,0.000219733,0.01083428],"genre_scores_gemma":[0.9818871,0.00052322395,0.01142013,0.0001445312,0.00012246706,0.000060587212,0.00009559927,0.000029344928,0.005717124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992107,0.00038846378,0.000024423178,0.00014583573,0.000120016804,0.00011046727],"domain_scores_gemma":[0.9900315,0.006537298,0.0017899731,0.00038344614,0.0004529185,0.00080479804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018590603,0.0005744351,0.0007894829,0.0021281687,0.00087196735,0.0018266732,0.001445437,0.0019389264,0.0029788767],"category_scores_gemma":[0.012784896,0.0005683762,0.00083941076,0.0013200055,0.0019170254,0.0035405818,0.0021630824,0.0012791046,0.00029995045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002955796,0.00020488919,0.011892874,0.0002567385,0.000191182,0.0010933161,0.0006581525,0.44557312,0.007958069,0.5086617,0.0035290658,0.019685416],"study_design_scores_gemma":[0.000032423886,0.00004715039,0.0022491575,0.00001495429,0.000038638213,0.00023959654,0.00011699297,0.86801463,0.00031226475,0.12812231,0.0007905619,0.000021375605],"about_ca_topic_score_codex":0.002627247,"about_ca_topic_score_gemma":0.0026410862,"teacher_disagreement_score":0.0029788767,"about_ca_system_score_codex":0.0009769733,"about_ca_system_score_gemma":0.00046575436,"threshold_uncertainty_score":0.00996536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14273223,0.0017547759,0.82682943,0.002549026,0.00016335584,0.0001270713,0.0008829485,0.00041585005,0.024545383],"genre_scores_gemma":[0.885281,0.0026352576,0.09315458,0.0004130965,0.00019451835,0.00037641465,0.0008673309,0.0000884082,0.016989302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991685,0.0003280655,0.000033468517,0.00022277297,0.0001669871,0.00008026315],"domain_scores_gemma":[0.99734974,0.0016160738,0.00041579801,0.00026288294,0.00019717713,0.00015838006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008792183,0.0005195705,0.00073184195,0.00091863726,0.00082853844,0.0016290932,0.0016172387,0.0016086646,0.0036880001],"category_scores_gemma":[0.0077432096,0.00033281045,0.00067907106,0.0011471262,0.0014889565,0.003045105,0.0010274863,0.0012136127,0.0004568732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023062377,0.000021088541,0.0012091863,0.000043617994,0.000036124737,0.00019939449,0.0001834011,0.35377142,0.0009977922,0.6337781,0.0015220401,0.00821484],"study_design_scores_gemma":[0.000014302782,0.000014124534,0.00035388657,0.000009230344,0.000010797511,0.00010655624,0.000032737895,0.6657877,0.00016307994,0.32703108,0.0064634685,0.000013071683],"about_ca_topic_score_codex":0.0035104759,"about_ca_topic_score_gemma":0.003192319,"teacher_disagreement_score":0.0036880001,"about_ca_system_score_codex":0.0013387053,"about_ca_system_score_gemma":0.00049958884,"threshold_uncertainty_score":0.012337625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88138926,0.0006972145,0.10714975,0.00036104812,0.00008932018,0.00039171244,0.002118295,0.000585506,0.007217826],"genre_scores_gemma":[0.93377036,0.00036827274,0.055343702,0.000065357286,0.000105036874,0.0002786269,0.0027791993,0.000070645714,0.0072188587],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987081,0.0003322046,0.000068984395,0.00042543703,0.00029948825,0.00016572849],"domain_scores_gemma":[0.99339163,0.0035916856,0.001041323,0.0006565021,0.00084070023,0.0004782082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015338418,0.0003832403,0.0007044472,0.0036118394,0.0008045274,0.0016091748,0.0006670795,0.0010998615,0.0031033221],"category_scores_gemma":[0.009559219,0.00040729754,0.00033939432,0.0018076674,0.00039309022,0.0024805428,0.001551895,0.00073205185,0.0032284402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001119492,0.00062271097,0.5421547,0.00044582412,0.00019120304,0.00097154226,0.0044124094,0.0060958355,0.04582956,0.0095408745,0.00940465,0.3792112],"study_design_scores_gemma":[0.00010337343,0.0006828522,0.49583706,0.00021024102,0.00023906135,0.0016844715,0.0067953155,0.41111785,0.030849585,0.032007314,0.020318855,0.00015401612],"about_ca_topic_score_codex":0.0019643977,"about_ca_topic_score_gemma":0.0034781052,"teacher_disagreement_score":0.0036118394,"about_ca_system_score_codex":0.00024358073,"about_ca_system_score_gemma":0.0004210566,"threshold_uncertainty_score":0.010381639},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93673104,0.0006067345,0.058106024,0.0004889721,0.00001832742,0.000028359927,0.00004880866,0.00013631798,0.0038354667],"genre_scores_gemma":[0.9961825,0.00019476197,0.0027739676,0.000054914864,0.000011741574,0.000028711616,0.00002974418,0.000016378057,0.0007072511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997967,0.00008468574,0.0000071922964,0.000027278073,0.00003245647,0.00005177007],"domain_scores_gemma":[0.9983492,0.00093086576,0.00036827606,0.00008211866,0.00012689662,0.00014275998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005037234,0.00033737533,0.00032464348,0.0007534824,0.00032739603,0.0006390562,0.00046768834,0.00069472945,0.0008240066],"category_scores_gemma":[0.0044921725,0.00023345595,0.0002349144,0.0003381857,0.0010227852,0.0014480271,0.0007759598,0.00037411918,0.00017085568],"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.0002818588,0.00015474207,0.00966388,0.0001988941,0.000099085744,0.0014338413,0.0007890506,0.56337214,0.042558093,0.3676504,0.002118185,0.011679729],"study_design_scores_gemma":[0.0000447789,0.000054333563,0.001749512,0.000021948035,0.000014806857,0.00015883177,0.00007733478,0.90761864,0.0021226066,0.08749811,0.00061816716,0.000020923795],"about_ca_topic_score_codex":0.001187177,"about_ca_topic_score_gemma":0.00094331766,"teacher_disagreement_score":0.001187177,"about_ca_system_score_codex":0.00058912096,"about_ca_system_score_gemma":0.00020062372,"threshold_uncertainty_score":0.0042743683},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058528744,0.00085523655,0.9095955,0.0005188556,0.0006042341,0.0007700804,0.009007103,0.014200525,0.005919685],"genre_scores_gemma":[0.16906309,0.00047079273,0.79839504,0.00018740063,0.00022265349,0.00060418714,0.017795898,0.0012538804,0.01200707],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992029,0.00012735782,0.00005302825,0.00019024915,0.00030607346,0.00012032358],"domain_scores_gemma":[0.99753857,0.0011325631,0.00014230737,0.0005230691,0.00041105627,0.0002523956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012364031,0.0015382444,0.0017326114,0.005017271,0.0014213354,0.001967257,0.0020811737,0.0011083431,0.0059574647],"category_scores_gemma":[0.006304768,0.0006803261,0.0011460426,0.0034461776,0.00078485033,0.0023992164,0.002977479,0.0012926372,0.0022149011],"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.00077136315,0.00048238112,0.014589999,0.00060742546,0.00027531682,0.00026933773,0.000538114,0.051121682,0.010257518,0.020316422,0.093348704,0.80742174],"study_design_scores_gemma":[0.00019095319,0.00013535019,0.004490249,0.00007611974,0.00016086036,0.00027969593,0.00040880594,0.8894702,0.009368126,0.06633368,0.029025435,0.000060608014],"about_ca_topic_score_codex":0.0127747115,"about_ca_topic_score_gemma":0.024330972,"teacher_disagreement_score":0.0127747115,"about_ca_system_score_codex":0.00074230373,"about_ca_system_score_gemma":0.0016522533,"threshold_uncertainty_score":0.025400698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98426026,0.000109237815,0.013623758,0.000103074824,0.000002673657,0.000045482022,0.00011283339,0.00004015907,0.0017025004],"genre_scores_gemma":[0.9969235,0.000027111138,0.002692571,0.000007694012,0.000002027563,0.000031016683,0.0000863992,0.000004736695,0.00022479471],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980406,0.0009935234,0.00011190716,0.00042088778,0.00030115168,0.00013194955],"domain_scores_gemma":[0.98326886,0.010236303,0.0033552314,0.0012537608,0.0013833772,0.00050241407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023826123,0.00012926177,0.00028247864,0.0024208804,0.00070023816,0.0010986584,0.00042398638,0.00049381703,0.001186171],"category_scores_gemma":[0.022129288,0.00020847403,0.00026549975,0.0016836806,0.00104548,0.0023451908,0.0010564508,0.00036428,0.00016009515],"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.0005610359,0.00039323926,0.7665378,0.0003698131,0.00034441584,0.00056335254,0.0194848,0.024962101,0.014571846,0.06405736,0.001368043,0.10678616],"study_design_scores_gemma":[0.000066576475,0.00027955955,0.72180206,0.00008950381,0.00011251652,0.0012166871,0.009316857,0.15467602,0.00357742,0.10351164,0.005248883,0.000102357415],"about_ca_topic_score_codex":0.0015676572,"about_ca_topic_score_gemma":0.0021687618,"teacher_disagreement_score":0.0024208804,"about_ca_system_score_codex":0.00067223137,"about_ca_system_score_gemma":0.00032346917,"threshold_uncertainty_score":0.012600601},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42926234,0.0005598047,0.5645714,0.0006200928,0.00005986554,0.00019591005,0.0008530505,0.0009138256,0.002963764],"genre_scores_gemma":[0.9542455,0.00022035338,0.0436396,0.00011663704,0.00003555133,0.00018268252,0.0011577077,0.00015057351,0.00025136748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9853094,0.0098584695,0.000807742,0.0015736542,0.0019029981,0.00054764905],"domain_scores_gemma":[0.76740295,0.19792128,0.010109721,0.015325111,0.0074064108,0.0018345392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.029666968,0.0011627155,0.0014744442,0.0063641914,0.0009033267,0.0022826588,0.0028213072,0.003264013,0.0023368986],"category_scores_gemma":[0.21567148,0.0006278175,0.0015786528,0.003235657,0.0022590926,0.0052317614,0.0027709207,0.0022112087,0.0005591367],"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.0006135058,0.00027731346,0.081641436,0.0002678302,0.00073440117,0.00036805728,0.0007374416,0.8201536,0.001553761,0.05560437,0.0018572406,0.03619106],"study_design_scores_gemma":[0.00004064022,0.00021306385,0.011040413,0.000060700208,0.00006040264,0.00032807994,0.0003315562,0.9308658,0.000710881,0.055469368,0.0008029306,0.0000762652],"about_ca_topic_score_codex":0.0039387117,"about_ca_topic_score_gemma":0.0024334893,"teacher_disagreement_score":0.029666968,"about_ca_system_score_codex":0.001178845,"about_ca_system_score_gemma":0.0012538711,"threshold_uncertainty_score":0.15689582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6780504,0.00060537015,0.31314608,0.0005371941,0.0000715907,0.00007255641,0.00010342858,0.00019912855,0.007214181],"genre_scores_gemma":[0.9915064,0.00016686946,0.006496785,0.000039096216,0.000023471166,0.000033622913,0.000029434805,0.000017298236,0.0016870586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998511,0.000056873916,0.000005719895,0.000022890994,0.00004019407,0.000023196104],"domain_scores_gemma":[0.9996239,0.00018916989,0.000077001474,0.000026835369,0.00003986278,0.000043162538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002938801,0.0003011341,0.00034537155,0.00053965603,0.00035429854,0.0004961308,0.00054893765,0.0005502798,0.0006444351],"category_scores_gemma":[0.0011893298,0.00019393206,0.00043576656,0.0002577335,0.0009768533,0.0011306092,0.0005348572,0.0002629965,0.000064994565],"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.0000749996,0.0000476691,0.0025772783,0.00008701973,0.000056196055,0.0004927815,0.00025687303,0.81563866,0.013267768,0.16249043,0.00064874074,0.004361545],"study_design_scores_gemma":[0.000009197987,0.000012095669,0.00025240704,0.000002056892,0.0000048550064,0.000022589798,0.000009202304,0.980149,0.00041195343,0.018856768,0.0002646513,0.0000051878847],"about_ca_topic_score_codex":0.0028517328,"about_ca_topic_score_gemma":0.0018103706,"teacher_disagreement_score":0.0028517328,"about_ca_system_score_codex":0.000792046,"about_ca_system_score_gemma":0.00028756165,"threshold_uncertainty_score":0.0057466626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11041064,0.0005699793,0.8853024,0.0002961038,0.00002499335,0.00021218228,0.0002827113,0.0005374136,0.0023635803],"genre_scores_gemma":[0.45050195,0.00046130028,0.5461765,0.00012531682,0.000044750253,0.00021617893,0.0006749413,0.00011835566,0.0016807084],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988763,0.00028067522,0.000058801368,0.00038352725,0.00029621727,0.000104370694],"domain_scores_gemma":[0.9953686,0.0023750057,0.0007475216,0.00052280317,0.0007557952,0.00023029005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015311665,0.0007038688,0.0007220807,0.005198181,0.0014662022,0.0020798836,0.0013333827,0.0014906311,0.0012391702],"category_scores_gemma":[0.010095566,0.0004894112,0.0008261821,0.002581447,0.0014467956,0.003211805,0.0024458414,0.0009451408,0.00039900406],"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.00027546796,0.0002309204,0.031483453,0.000785663,0.00025866114,0.00061147276,0.0026227843,0.25055432,0.029850138,0.17622727,0.0052382154,0.5018617],"study_design_scores_gemma":[0.000023698196,0.000047458554,0.005349312,0.000083842824,0.00003604027,0.00039806013,0.0006460636,0.8314667,0.0065744002,0.14961924,0.0057090786,0.000046065008],"about_ca_topic_score_codex":0.0054469183,"about_ca_topic_score_gemma":0.00663893,"teacher_disagreement_score":0.0054469183,"about_ca_system_score_codex":0.0012002233,"about_ca_system_score_gemma":0.0014420664,"threshold_uncertainty_score":0.010830402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3335477,0.0016975394,0.6489337,0.0034545735,0.000111148314,0.00014610116,0.0010735093,0.00029156514,0.01074403],"genre_scores_gemma":[0.94673884,0.002540908,0.03591289,0.0002933661,0.00047682138,0.00034389188,0.0005068796,0.00028801555,0.012898425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675673,0.0015880908,0.0001447724,0.0006321689,0.0004720423,0.0004062022],"domain_scores_gemma":[0.88076997,0.1029702,0.007403222,0.0030395298,0.002879766,0.0029373346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008550073,0.0016756824,0.0030643912,0.004254581,0.0012715366,0.003960496,0.004354515,0.0036459195,0.006788302],"category_scores_gemma":[0.07773208,0.002320271,0.0013733617,0.003858366,0.0035049703,0.009811956,0.003007191,0.003030103,0.0005504836],"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.000368934,0.00009564352,0.0030006152,0.00025429402,0.00017056252,0.00030284826,0.0005027999,0.55736476,0.0016612675,0.41821635,0.0031267712,0.01493518],"study_design_scores_gemma":[0.000041502266,0.00003154773,0.00075208786,0.000031181204,0.000051000337,0.00008494007,0.00008289967,0.7358639,0.0003008307,0.26211885,0.0006157412,0.00002549697],"about_ca_topic_score_codex":0.0066256975,"about_ca_topic_score_gemma":0.0052124476,"teacher_disagreement_score":0.008550073,"about_ca_system_score_codex":0.0030126686,"about_ca_system_score_gemma":0.0012469527,"threshold_uncertainty_score":0.045217693},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15232232,0.0003747856,0.84284765,0.00049442996,0.000018167046,0.00003733136,0.0000555682,0.00016676799,0.0036830462],"genre_scores_gemma":[0.91311556,0.0003281676,0.084772766,0.0000873893,0.0000438029,0.00011555713,0.000076159085,0.00008064942,0.0013800656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981117,0.001184676,0.000040187984,0.00025755816,0.00025948344,0.00014628927],"domain_scores_gemma":[0.9874894,0.009554991,0.0009786512,0.0009727231,0.0006206135,0.00038361133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039993376,0.00061204314,0.000699069,0.0014759796,0.0007821751,0.0011577306,0.0015925582,0.0012571638,0.0013245335],"category_scores_gemma":[0.024548173,0.00060332974,0.00071912684,0.0009052551,0.003303102,0.0042500724,0.0018068573,0.0011711925,0.00026442762],"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.00014311208,0.000066234556,0.0020018115,0.000102933,0.000046138208,0.00013457837,0.00031401805,0.34510654,0.0028183141,0.63394153,0.0008520837,0.014472746],"study_design_scores_gemma":[0.000013386076,0.00002041384,0.00030928434,0.000008119197,0.000007215168,0.00003985109,0.00002600359,0.5916052,0.0005882666,0.4070386,0.00033194112,0.000011797926],"about_ca_topic_score_codex":0.0012242198,"about_ca_topic_score_gemma":0.00092864444,"teacher_disagreement_score":0.0039993376,"about_ca_system_score_codex":0.001235156,"about_ca_system_score_gemma":0.0005765873,"threshold_uncertainty_score":0.021150768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9854117,0.00016706843,0.00338613,0.00036921003,0.000026146141,0.00006657595,0.0016641003,0.0000946875,0.008814238],"genre_scores_gemma":[0.9945543,0.00014938087,0.0022057225,0.00004717102,0.000031117717,0.00009291044,0.0008435355,0.000028380275,0.0020474743],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99891436,0.00048632262,0.000075100514,0.00018950836,0.00023242578,0.00010229051],"domain_scores_gemma":[0.9951532,0.0032005163,0.0008374848,0.00021469223,0.0003568902,0.00023725723],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.00092431775,0.00024283362,0.00028145063,0.0024787346,0.00093493145,0.0015373146,0.00021809958,0.00039638998,0.003695415],"category_scores_gemma":[0.007922587,0.0001608124,0.000226715,0.0024223537,0.00035815843,0.0023979545,0.0015417566,0.0004624865,0.0010302396],"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.0011258945,0.00017194738,0.62006885,0.00085088593,0.00023244332,0.0013858977,0.16424479,0.0023048315,0.0332129,0.007840055,0.0065412885,0.1620202],"study_design_scores_gemma":[0.000024855875,0.00021053596,0.82164824,0.00021555785,0.00011818154,0.0008677486,0.08712682,0.02518292,0.0070813913,0.005802622,0.051569775,0.00015129986],"about_ca_topic_score_codex":0.0024173742,"about_ca_topic_score_gemma":0.0038631565,"teacher_disagreement_score":0.9975213,"about_ca_system_score_codex":0.0004521654,"about_ca_system_score_gemma":0.0002462446,"threshold_uncertainty_score":0.012362421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44609028,0.0023698066,0.37898365,0.012107336,0.0002543228,0.00020301051,0.00050470437,0.00018225203,0.15930472],"genre_scores_gemma":[0.96611995,0.0013142723,0.02666417,0.00027607387,0.00007520662,0.00012463256,0.00017606039,0.00003366686,0.005216007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991085,0.0006242522,0.000018670811,0.00007302846,0.000101409794,0.00007409167],"domain_scores_gemma":[0.99572766,0.0034489483,0.0002855544,0.00021054456,0.00015963448,0.00016762543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013250149,0.00044064512,0.0006271522,0.0016227815,0.0008656089,0.002611368,0.0014930606,0.0013197773,0.004401843],"category_scores_gemma":[0.00592382,0.0001974196,0.00068910664,0.0016047928,0.0024980237,0.0035032074,0.001254803,0.0011094264,0.00027113006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006104047,0.000049695165,0.0013730163,0.000048856826,0.00002659278,0.00007967877,0.000617802,0.1220441,0.00013212068,0.8661217,0.0014873602,0.00795802],"study_design_scores_gemma":[0.000033176293,0.000028618577,0.0008738093,0.000029644207,0.000017875467,0.000047052577,0.00085897057,0.56417567,0.00008855148,0.4291832,0.0046403524,0.00002322227],"about_ca_topic_score_codex":0.0116136065,"about_ca_topic_score_gemma":0.007960526,"teacher_disagreement_score":0.0116136065,"about_ca_system_score_codex":0.0025601548,"about_ca_system_score_gemma":0.0012406382,"threshold_uncertainty_score":0.023092031},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10108067,0.00064731366,0.888921,0.00085152057,0.00004862196,0.00003297616,0.00014118695,0.00011990633,0.008156885],"genre_scores_gemma":[0.9437897,0.0006801256,0.053237326,0.00008366442,0.00004135851,0.000079673875,0.00010820456,0.000070169466,0.0019095899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980706,0.0000840574,0.000008852144,0.000034568617,0.000042497708,0.000023002378],"domain_scores_gemma":[0.9990024,0.0007243563,0.00012904877,0.000037994807,0.00007771776,0.000028361532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006260453,0.000486181,0.0004924665,0.0005497836,0.00033489455,0.00086880475,0.00029614932,0.0005766046,0.0021802546],"category_scores_gemma":[0.0032576742,0.00039835603,0.00022177683,0.00068269775,0.0008568019,0.0011782836,0.00047348544,0.00062809704,0.00012981551],"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.000014012784,0.000007638311,0.00017162068,0.000019387535,0.000009846022,0.00003402125,0.000019531226,0.96266645,0.00035765034,0.032524306,0.0005040923,0.003671332],"study_design_scores_gemma":[0.0000054963452,0.0000057788,0.00009411993,0.000004660463,0.000002226798,0.0000082622355,0.000013624255,0.9576255,0.00010387888,0.041889552,0.00024332109,0.0000035683295],"about_ca_topic_score_codex":0.003290694,"about_ca_topic_score_gemma":0.002225349,"teacher_disagreement_score":0.003290694,"about_ca_system_score_codex":0.00068364927,"about_ca_system_score_gemma":0.0005823805,"threshold_uncertainty_score":0.0072936416},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76964664,0.00063772144,0.2144423,0.0009013706,0.000017012862,0.00006935521,0.00013220102,0.00031489067,0.013838578],"genre_scores_gemma":[0.9954821,0.00015174075,0.003661037,0.000034829718,0.000009407688,0.000024745166,0.000028420218,0.000025953446,0.0005818854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898285,0.00054267276,0.000033054985,0.00016925951,0.00013654865,0.00013548731],"domain_scores_gemma":[0.98366505,0.012317882,0.0017346828,0.0014018713,0.00047218456,0.00040827767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030881192,0.0004062945,0.0008321072,0.001488858,0.00052254024,0.0016571119,0.0007836665,0.0007499126,0.0019056448],"category_scores_gemma":[0.022956608,0.00031279112,0.00043311014,0.0006206388,0.002201356,0.003110225,0.0014625404,0.0006501637,0.00023481567],"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.00015017351,0.00006502466,0.012286396,0.00017286478,0.00014370054,0.00020624825,0.0004379069,0.80878377,0.0062450888,0.15229377,0.0010257873,0.018189296],"study_design_scores_gemma":[0.000018168897,0.00007270326,0.0038925125,0.000026883741,0.00003511524,0.000113047565,0.00012553074,0.90516067,0.002238487,0.08787844,0.0004187492,0.00001978379],"about_ca_topic_score_codex":0.0013939423,"about_ca_topic_score_gemma":0.0010498401,"teacher_disagreement_score":0.0030881192,"about_ca_system_score_codex":0.001358623,"about_ca_system_score_gemma":0.00046468302,"threshold_uncertainty_score":0.016331732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035152536,0.0102464575,0.85826874,0.02046374,0.000683832,0.00004370558,0.00036225235,0.00036077158,0.07441786],"genre_scores_gemma":[0.84848267,0.010624497,0.114719026,0.0013029745,0.0019444328,0.00013089471,0.00025996217,0.00015996999,0.022375546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993648,0.00023921758,0.00002969193,0.0001311507,0.00019575901,0.000039501534],"domain_scores_gemma":[0.9968827,0.0019287879,0.00018944946,0.00039590805,0.00038873285,0.00021452294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081768696,0.00043342425,0.00073118036,0.0018728604,0.0006846237,0.0047588344,0.00090733054,0.0017077884,0.006271225],"category_scores_gemma":[0.004239302,0.0004182208,0.00043174424,0.0015391272,0.00223346,0.008280322,0.0013271448,0.0021644763,0.0007287977],"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.000014108632,0.000024014382,0.0005461019,0.00007818177,0.000031286683,0.00009473095,0.00012108384,0.015308725,0.00069480867,0.9624874,0.002098966,0.018500535],"study_design_scores_gemma":[0.0000046440173,0.000008780424,0.00035854153,0.000026834266,0.000010851086,0.000056550038,0.00008121498,0.070329696,0.00017168699,0.91947937,0.009464084,0.000007759567],"about_ca_topic_score_codex":0.0016310144,"about_ca_topic_score_gemma":0.0013182284,"teacher_disagreement_score":0.006271225,"about_ca_system_score_codex":0.00087032554,"about_ca_system_score_gemma":0.00055692194,"threshold_uncertainty_score":0.020979285},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14933631,0.0011767361,0.8423011,0.00079650956,0.00004967424,0.00045853818,0.0020075664,0.0010867809,0.0027867118],"genre_scores_gemma":[0.56240517,0.0005276232,0.43122312,0.0001550416,0.00006342102,0.0003195014,0.0034788563,0.00008979651,0.0017374303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977458,0.00072348246,0.00014873598,0.0006536923,0.00056238094,0.00016578715],"domain_scores_gemma":[0.99324,0.00379551,0.0012367974,0.000659119,0.0008365222,0.00023198809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026214598,0.0005939244,0.00084220845,0.009857551,0.00147135,0.0013181757,0.0016411289,0.0012682956,0.000707286],"category_scores_gemma":[0.01302944,0.00040662792,0.0010565927,0.006792238,0.0008081691,0.0026589583,0.0014719113,0.0009767509,0.0002927489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042358326,0.0007326426,0.07606861,0.0010347744,0.0006391971,0.0021366153,0.0024724966,0.26403925,0.01368033,0.08056016,0.01440063,0.5438117],"study_design_scores_gemma":[0.000025403451,0.00006204577,0.008133739,0.00007340505,0.00005928964,0.0007052771,0.00045108318,0.90991676,0.0035369783,0.069106914,0.007899365,0.00002974423],"about_ca_topic_score_codex":0.005661548,"about_ca_topic_score_gemma":0.0074657258,"teacher_disagreement_score":0.009857551,"about_ca_system_score_codex":0.0011593744,"about_ca_system_score_gemma":0.0008031486,"threshold_uncertainty_score":0.013863742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9368507,0.0011662669,0.03303785,0.0019649614,0.00005616123,0.00015656679,0.0023758546,0.00017461825,0.024216931],"genre_scores_gemma":[0.9916924,0.00023733373,0.0060910108,0.000034991474,0.000041736494,0.00007275927,0.000707661,0.000017495095,0.0011046522],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99630415,0.0019078624,0.00019403099,0.00043879915,0.00092183,0.0002332548],"domain_scores_gemma":[0.96981245,0.017934263,0.005944555,0.0012449649,0.003850369,0.0012133474],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0042948504,0.00026312366,0.00040886624,0.020454306,0.0013441849,0.0032638826,0.00067851465,0.00075638486,0.0041999756],"category_scores_gemma":[0.03276578,0.00016067615,0.00045266436,0.016101114,0.0012271298,0.00356159,0.0024459672,0.0004342245,0.00043840712],"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.00043555396,0.00019826749,0.61748195,0.0007309267,0.00043927997,0.00067732285,0.015467437,0.042774785,0.0028719874,0.14307466,0.009547943,0.1662999],"study_design_scores_gemma":[0.000053973487,0.00015988149,0.46770123,0.00033964482,0.00022103585,0.00085648854,0.022826953,0.32816324,0.0025409225,0.124546796,0.052470554,0.00011925639],"about_ca_topic_score_codex":0.00943461,"about_ca_topic_score_gemma":0.007131439,"teacher_disagreement_score":0.9795457,"about_ca_system_score_codex":0.0023699326,"about_ca_system_score_gemma":0.0011106574,"threshold_uncertainty_score":0.022713661},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021459894,0.0005654739,0.93173,0.0004949595,0.00015696671,0.0007588268,0.019262139,0.022391701,0.003180048],"genre_scores_gemma":[0.11601961,0.0004412648,0.8574018,0.000132818,0.00007808972,0.0010648979,0.019365275,0.0006887251,0.004807572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991959,0.00022013953,0.00006226576,0.00021509967,0.00024951523,0.00005704615],"domain_scores_gemma":[0.99809235,0.0010492712,0.00016222155,0.00043756256,0.00017009057,0.00008853981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014742343,0.0013634644,0.001038684,0.003881776,0.0009910752,0.0012638158,0.001809515,0.0009639844,0.0065371376],"category_scores_gemma":[0.008181303,0.00071712985,0.0018288872,0.0026754593,0.0003848009,0.0019291901,0.0018346405,0.0015366019,0.0040190164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000470851,0.000778488,0.016876224,0.0019206845,0.00078236306,0.0006060237,0.0012427467,0.063069515,0.012455005,0.06097357,0.109669976,0.73115456],"study_design_scores_gemma":[0.00011172702,0.0001273988,0.0044355686,0.000106042826,0.0001605941,0.000411626,0.00035920605,0.87566525,0.0063437843,0.064143464,0.04809227,0.000043030097],"about_ca_topic_score_codex":0.0034829294,"about_ca_topic_score_gemma":0.009646158,"teacher_disagreement_score":0.0065371376,"about_ca_system_score_codex":0.00047587813,"about_ca_system_score_gemma":0.0011891422,"threshold_uncertainty_score":0.021868885},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3326578,0.0005021987,0.6549179,0.0013608462,0.00007641008,0.00012639014,0.00091949716,0.00046439716,0.008974538],"genre_scores_gemma":[0.9564105,0.00040840456,0.036969222,0.00009615245,0.00006160879,0.00014164663,0.00044057856,0.000079929974,0.0053919354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991811,0.00035978795,0.000030690957,0.0002505557,0.00010498343,0.00007293549],"domain_scores_gemma":[0.99510056,0.0031933577,0.0008608407,0.000354859,0.00030550102,0.00018496768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021996095,0.00060698966,0.00051209435,0.00097586913,0.0003931721,0.0012215473,0.0012165444,0.00093999173,0.0024928392],"category_scores_gemma":[0.011003422,0.00058006385,0.0007948751,0.0010172462,0.0007632763,0.0030717344,0.0008171043,0.0013492235,0.0005918742],"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.00013675891,0.00010199947,0.020432068,0.00009016672,0.00009866555,0.00023359359,0.0007129137,0.8871543,0.003325908,0.05925613,0.0014964126,0.026961157],"study_design_scores_gemma":[0.0000049185073,0.000010416553,0.0011222451,0.0000039677852,0.000009067717,0.000025363948,0.000020536789,0.99134237,0.00010412625,0.0069897263,0.00036203134,0.0000052207756],"about_ca_topic_score_codex":0.014671704,"about_ca_topic_score_gemma":0.019367129,"teacher_disagreement_score":0.014671704,"about_ca_system_score_codex":0.0013200345,"about_ca_system_score_gemma":0.00060704694,"threshold_uncertainty_score":0.0291726},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7723569,0.0011689849,0.2174851,0.0007264029,0.000031454147,0.000077124605,0.00021919375,0.00030781282,0.007626866],"genre_scores_gemma":[0.9912766,0.00036536905,0.007217562,0.00004932087,0.000029820963,0.0000364856,0.00008048866,0.000019941977,0.0009244617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954176,0.0001880681,0.000014873927,0.00008555111,0.00009110456,0.00007863559],"domain_scores_gemma":[0.99440867,0.003076541,0.0012769309,0.0004428134,0.00030322524,0.00049173745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013294435,0.00049924036,0.00070987165,0.0015533054,0.0005982997,0.0013956758,0.0013503246,0.0010046881,0.0011041525],"category_scores_gemma":[0.009812707,0.00050714106,0.00049933465,0.0010102268,0.0025811938,0.002451436,0.0010925506,0.0010770675,0.00015357762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006782472,0.000059001934,0.0031499327,0.00013993226,0.000041985324,0.0003484379,0.00030138443,0.25950545,0.0043646675,0.7268251,0.001018583,0.004177734],"study_design_scores_gemma":[0.000033629833,0.000044548382,0.001395723,0.00002262689,0.000017289542,0.00024828946,0.00009930437,0.69996953,0.00086860906,0.2966575,0.00061893114,0.000023985203],"about_ca_topic_score_codex":0.0020039626,"about_ca_topic_score_gemma":0.0016611606,"teacher_disagreement_score":0.0020039626,"about_ca_system_score_codex":0.0014303924,"about_ca_system_score_gemma":0.00045325744,"threshold_uncertainty_score":0.010378242},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27471855,0.0019130572,0.71515703,0.0015471259,0.000113801674,0.00006555686,0.0004053313,0.0003806931,0.00569895],"genre_scores_gemma":[0.9738962,0.001547305,0.01975496,0.00019384829,0.00020634019,0.000110657544,0.0003154346,0.00007741883,0.0038979964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985586,0.00053775666,0.00005132834,0.00037909913,0.0003262978,0.00014694623],"domain_scores_gemma":[0.97012275,0.023420425,0.0029065872,0.0013816318,0.0012557893,0.00091278146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002684424,0.0006945679,0.0012771228,0.0032577172,0.00087525125,0.0020767564,0.0018686997,0.0014626406,0.0018542381],"category_scores_gemma":[0.02759443,0.00091771607,0.00057164143,0.0027239488,0.0022894016,0.004564991,0.0014671282,0.001318288,0.00029629958],"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.0001517645,0.00010638843,0.007981336,0.00029051007,0.00013386695,0.00036526323,0.00057229516,0.31179014,0.0029388,0.6447465,0.0036998393,0.027223432],"study_design_scores_gemma":[0.000014100429,0.000018677969,0.0022341325,0.000022945367,0.00003218519,0.00008292121,0.000047439782,0.6682087,0.00034817588,0.3280602,0.00091078255,0.000019733303],"about_ca_topic_score_codex":0.0025123693,"about_ca_topic_score_gemma":0.0026917488,"teacher_disagreement_score":0.0032577172,"about_ca_system_score_codex":0.0013388246,"about_ca_system_score_gemma":0.0006534228,"threshold_uncertainty_score":0.014196813},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21831699,0.0018284951,0.73465997,0.0060411165,0.0002286518,0.0001347653,0.00040904255,0.00051465014,0.0378663],"genre_scores_gemma":[0.9560941,0.0011156916,0.028243143,0.00049424684,0.00021320331,0.00018960997,0.00013299251,0.00007515597,0.013441892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937075,0.00024188655,0.000020436319,0.00012654715,0.0001590979,0.00008126893],"domain_scores_gemma":[0.99714667,0.0016559211,0.00039521983,0.0002652811,0.00020855779,0.00032825986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001259828,0.0004810429,0.0009449205,0.0012306724,0.0010991148,0.0020652707,0.0026649488,0.0024852692,0.0031024448],"category_scores_gemma":[0.0052709035,0.00048082217,0.0007837987,0.0009392326,0.0029080897,0.004297139,0.0016066962,0.0016972156,0.00081030733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036780628,0.00006138614,0.00080282934,0.000050472136,0.000026551052,0.00027357542,0.00024950743,0.10310564,0.0005793056,0.8893774,0.0020976537,0.0033388662],"study_design_scores_gemma":[0.000045308676,0.000025222958,0.00021092998,0.000016263515,0.0000150448495,0.0001167886,0.00005349277,0.5813934,0.0000621231,0.41650704,0.0015349706,0.000019442208],"about_ca_topic_score_codex":0.00313966,"about_ca_topic_score_gemma":0.0018910851,"teacher_disagreement_score":0.00313966,"about_ca_system_score_codex":0.0010521335,"about_ca_system_score_gemma":0.00066873035,"threshold_uncertainty_score":0.010378718},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10021014,0.0011798393,0.8686799,0.0016468547,0.00021871013,0.00029307848,0.0042640027,0.008226456,0.015281074],"genre_scores_gemma":[0.39316314,0.0009551734,0.5974733,0.00018361746,0.00009541587,0.00028058502,0.0023541304,0.0008132197,0.0046813297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945146,0.00017471897,0.000025537329,0.00009838783,0.00018777781,0.00006220696],"domain_scores_gemma":[0.996141,0.0020274108,0.00039592638,0.00035114217,0.00087831984,0.00020623772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001110066,0.0008672576,0.00040917232,0.0047295024,0.00078427163,0.0023598694,0.0006771484,0.0008230826,0.008197705],"category_scores_gemma":[0.0066054077,0.0003814946,0.00039122286,0.0032922847,0.00039905388,0.0019903346,0.0015174826,0.0008203721,0.0010601524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008600489,0.00024079012,0.017236102,0.00144323,0.00017815988,0.0011500663,0.008015552,0.24928659,0.057900313,0.21116014,0.04515561,0.40737346],"study_design_scores_gemma":[0.00012307717,0.00012168019,0.005975291,0.0003087952,0.000057249636,0.00080976094,0.0014821731,0.7966023,0.020555208,0.106649846,0.067172386,0.00014217406],"about_ca_topic_score_codex":0.0045639668,"about_ca_topic_score_gemma":0.005234018,"teacher_disagreement_score":0.008197705,"about_ca_system_score_codex":0.00085143215,"about_ca_system_score_gemma":0.00088327477,"threshold_uncertainty_score":0.027424037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9869645,0.00014689298,0.0026546628,0.0006520904,0.000013222612,0.00003037596,0.00012733007,0.000016414522,0.009394528],"genre_scores_gemma":[0.99898154,0.000053748976,0.00034667176,0.00001485431,0.00000738824,0.000011620961,0.000038570728,0.0000045866973,0.0005410633],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980622,0.0010015891,0.000086256776,0.00022180253,0.00035884482,0.0002692897],"domain_scores_gemma":[0.97741884,0.01380681,0.00581277,0.00090008957,0.00083115575,0.0012303633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017729003,0.00019984438,0.00021588046,0.0017778042,0.0013892786,0.0025170243,0.00050436385,0.00078115764,0.0069049043],"category_scores_gemma":[0.02020231,0.00028278635,0.0002484818,0.0018101997,0.0018189871,0.0035353538,0.0022385856,0.0009767007,0.0005363766],"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.000283119,0.0004363449,0.90181863,0.00013194463,0.00012434654,0.00052697223,0.032322902,0.003332391,0.0011446424,0.017828612,0.0020434998,0.040006563],"study_design_scores_gemma":[0.000017827186,0.0000962061,0.9133839,0.00011306892,0.00006598435,0.00038606796,0.04388238,0.018430578,0.00046278746,0.014699622,0.008417334,0.000044193628],"about_ca_topic_score_codex":0.012496246,"about_ca_topic_score_gemma":0.018369302,"teacher_disagreement_score":0.012496246,"about_ca_system_score_codex":0.0012448083,"about_ca_system_score_gemma":0.00064339093,"threshold_uncertainty_score":0.024846971},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79316753,0.0015848331,0.19585212,0.00089357025,0.00007599012,0.00018509882,0.0019578852,0.00065800274,0.005624852],"genre_scores_gemma":[0.94278294,0.0005753849,0.051618524,0.00007721128,0.00012943325,0.00006308993,0.0015022778,0.0000453707,0.003205808],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989641,0.0003954039,0.00007135597,0.0002577582,0.00022893504,0.00008254694],"domain_scores_gemma":[0.9937251,0.0041962834,0.00082193833,0.000483614,0.000484183,0.00028895156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009472625,0.00058384304,0.0005655007,0.0080801705,0.001239146,0.0018111522,0.00084452174,0.0017666615,0.0022136213],"category_scores_gemma":[0.010011907,0.00044942662,0.000672144,0.005633584,0.0005688599,0.0038096576,0.0010973101,0.0007812243,0.000966124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072751584,0.001532921,0.45045736,0.000987789,0.00079033105,0.0020876194,0.0026081011,0.058978964,0.022886168,0.040883087,0.018942706,0.39911753],"study_design_scores_gemma":[0.000054802174,0.0001801527,0.0807827,0.000109381785,0.00045247923,0.0018187155,0.0028774885,0.82202893,0.009819505,0.0705589,0.011262004,0.00005490492],"about_ca_topic_score_codex":0.002355484,"about_ca_topic_score_gemma":0.0051927934,"teacher_disagreement_score":0.0080801705,"about_ca_system_score_codex":0.00047501636,"about_ca_system_score_gemma":0.00037540833,"threshold_uncertainty_score":0.0074053407},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03995046,0.002546735,0.60619485,0.003303587,0.0021625354,0.0011749548,0.029997244,0.031346917,0.2833227],"genre_scores_gemma":[0.43253586,0.0020946746,0.3199082,0.0019517645,0.00083015783,0.0010351082,0.039930727,0.0041847927,0.19752875],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992168,0.0001270895,0.00004094883,0.00023817515,0.0002445555,0.00013245273],"domain_scores_gemma":[0.9988464,0.00024021936,0.00008834378,0.00041460016,0.00030053864,0.00010991102],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058073923,0.00079850917,0.0006651319,0.0015402061,0.0013275987,0.0028660425,0.0011961301,0.0009970355,0.050718393],"category_scores_gemma":[0.0039241803,0.00039901142,0.00078978995,0.0012646803,0.00050296076,0.0031031272,0.0022867324,0.0012352938,0.018478516],"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.000617627,0.00019099539,0.004712054,0.00063796225,0.00009656964,0.00039037334,0.00070619024,0.016115583,0.0076556313,0.28426388,0.19596715,0.48864597],"study_design_scores_gemma":[0.00009317038,0.00013413426,0.0019285156,0.00015954165,0.00007169153,0.00054984714,0.000619113,0.14406428,0.0115503855,0.22838795,0.61236405,0.00007732756],"about_ca_topic_score_codex":0.003636645,"about_ca_topic_score_gemma":0.00682024,"teacher_disagreement_score":0.94928163,"about_ca_system_score_codex":0.0007262235,"about_ca_system_score_gemma":0.0010527737,"threshold_uncertainty_score":0},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016902126,0.0013343657,0.07826432,0.0021927028,0.0011044586,0.0011800333,0.12847456,0.69653064,0.074016765],"genre_scores_gemma":[0.19904463,0.0026383053,0.1624261,0.003371459,0.0015134267,0.0035104882,0.45853856,0.056992684,0.11196436],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986797,0.0002537725,0.0001209599,0.0002903053,0.0005348277,0.00012052189],"domain_scores_gemma":[0.996711,0.0008325504,0.00022959606,0.00095949735,0.00077725365,0.0004901086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001643163,0.0014018974,0.0010388542,0.0022067672,0.00096737983,0.0027794114,0.0020728894,0.00097512227,0.04780181],"category_scores_gemma":[0.007543399,0.0006287004,0.0005801777,0.0018459872,0.00030770962,0.005020502,0.0025704585,0.0012078005,0.036280893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001413176,0.0001613302,0.007237838,0.0006368702,0.00014227649,0.00027388183,0.00044294086,0.0019336338,0.0084423395,0.0054010465,0.85383296,0.12008174],"study_design_scores_gemma":[0.0003421502,0.00020328142,0.006183115,0.00009157422,0.000110329995,0.00023263849,0.0001433281,0.052176338,0.012277943,0.0077428296,0.92035025,0.00014619263],"about_ca_topic_score_codex":0.0032138664,"about_ca_topic_score_gemma":0.0036315224,"teacher_disagreement_score":0.04780181,"about_ca_system_score_codex":0.00051777466,"about_ca_system_score_gemma":0.0007881442,"threshold_uncertainty_score":0.159913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049715195,0.00051670586,0.9356536,0.0019388512,0.0001054576,0.00015200484,0.0006636175,0.00029937938,0.010955127],"genre_scores_gemma":[0.8282266,0.0023154095,0.14218543,0.0008056832,0.00074360217,0.0007605472,0.0014151796,0.00024692365,0.023300659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982957,0.00067627046,0.000056290584,0.00044564903,0.0003720671,0.000154121],"domain_scores_gemma":[0.9959336,0.0017208391,0.0011811897,0.00046390528,0.00038569237,0.0003147182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014147203,0.0012372013,0.00096459495,0.0033180853,0.0013874909,0.0027075936,0.0030938394,0.002873267,0.00646579],"category_scores_gemma":[0.008398852,0.0006075642,0.0011801673,0.0026899432,0.0032160808,0.00785693,0.002099738,0.0020055347,0.0018428741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025227015,0.00004367471,0.0015836002,0.00005190697,0.00003303337,0.00016308496,0.00028054876,0.18725838,0.0008169146,0.7977555,0.002800756,0.009187442],"study_design_scores_gemma":[0.000016491767,0.00003863592,0.0005388778,0.000016957909,0.000011647388,0.0001893135,0.00009349087,0.6368986,0.00014619586,0.35556698,0.0064599235,0.000022909591],"about_ca_topic_score_codex":0.004288137,"about_ca_topic_score_gemma":0.003371012,"teacher_disagreement_score":0.00646579,"about_ca_system_score_codex":0.0021897512,"about_ca_system_score_gemma":0.0006051983,"threshold_uncertainty_score":0.021630228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66114676,0.00040456484,0.33478072,0.0006195546,0.000012070405,0.000029466853,0.0003399955,0.000310801,0.0023561323],"genre_scores_gemma":[0.98517555,0.00023541172,0.013263509,0.000050941995,0.000016847227,0.00005778152,0.0003426705,0.000059093807,0.0007983753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987224,0.00070189615,0.00004095555,0.00022530001,0.00018619267,0.00012325612],"domain_scores_gemma":[0.9845061,0.01257693,0.0013903746,0.00075726514,0.00045735273,0.0003119746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004362933,0.00048529528,0.0007123116,0.0021082086,0.00048089278,0.0012554491,0.0015051005,0.0010442776,0.00095027307],"category_scores_gemma":[0.02448945,0.00049234636,0.00076289964,0.0011383296,0.0031014064,0.0035191067,0.0009554246,0.00085803843,0.00016816235],"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.00006527118,0.00002345587,0.0054250634,0.000051939613,0.00003865088,0.00017251284,0.00015290742,0.8548994,0.0010003223,0.13210568,0.00038723362,0.005677626],"study_design_scores_gemma":[0.0000075024986,0.000013426087,0.0015948984,0.00001138371,0.000006922714,0.000059381557,0.00004172893,0.9014921,0.0003582235,0.09622129,0.00017396576,0.000019087922],"about_ca_topic_score_codex":0.0032640733,"about_ca_topic_score_gemma":0.0027074406,"teacher_disagreement_score":0.004362933,"about_ca_system_score_codex":0.0014393546,"about_ca_system_score_gemma":0.00045793274,"threshold_uncertainty_score":0.023073614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11143995,0.0059476555,0.81512666,0.003967428,0.00070989854,0.00016233901,0.0004775597,0.0009928044,0.061175592],"genre_scores_gemma":[0.92222214,0.005746996,0.055017773,0.000955342,0.0014308514,0.00046166583,0.00040458288,0.00036967694,0.013391022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993204,0.00016229913,0.000030394065,0.00015233221,0.00024588092,0.00008871184],"domain_scores_gemma":[0.9953902,0.0028048751,0.0004594098,0.00039264237,0.0005929532,0.0003599105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010117983,0.00068463414,0.00071573735,0.0021716955,0.000988038,0.0023214577,0.0009565924,0.0015577333,0.005351326],"category_scores_gemma":[0.012609445,0.00046822338,0.0006840504,0.0010279944,0.002698521,0.0042973044,0.0009808855,0.0019482955,0.0009229422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010593935,0.000018600864,0.00048616724,0.00006568668,0.000012390043,0.00016353524,0.00015196974,0.016047668,0.0016586708,0.97180724,0.0026545033,0.0069228373],"study_design_scores_gemma":[0.000011134947,0.000018649182,0.00053879916,0.000046823403,0.000006310047,0.00021484049,0.00004085794,0.1685019,0.0002651396,0.8249393,0.005395226,0.000020970338],"about_ca_topic_score_codex":0.0015811101,"about_ca_topic_score_gemma":0.0008390925,"teacher_disagreement_score":0.005351326,"about_ca_system_score_codex":0.0010520592,"about_ca_system_score_gemma":0.00057197636,"threshold_uncertainty_score":0.017902017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016788966,0.00025400045,0.99670947,0.00006570322,0.00007581378,0.000022005093,0.00002306556,0.00021233948,0.00095868047],"genre_scores_gemma":[0.14175922,0.00077916257,0.84656274,0.00024136156,0.00040647056,0.00016234799,0.0002642035,0.00012966082,0.009694857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781895,0.00046487324,0.00011371358,0.00055990415,0.0009392924,0.00010318018],"domain_scores_gemma":[0.9988943,0.00034481025,0.000066052846,0.00022626952,0.00041789626,0.000050794803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014456951,0.00079748913,0.0015104071,0.0017665008,0.0007908304,0.0010509668,0.0015552872,0.0015200676,0.0030987745],"category_scores_gemma":[0.0025799654,0.00039532734,0.0014124217,0.0020485441,0.0006147508,0.002191447,0.0009341537,0.0010403631,0.0012927657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002863887,0.00019626007,0.0010634488,0.00039003778,0.00031988585,0.00015974513,0.0002083507,0.09194814,0.022729823,0.05188079,0.00646788,0.82434934],"study_design_scores_gemma":[0.000073839234,0.00015257078,0.00059689174,0.000019081617,0.00010377302,0.00034285127,0.00002445877,0.9634357,0.00801726,0.015080961,0.012088454,0.00006415245],"about_ca_topic_score_codex":0.003452019,"about_ca_topic_score_gemma":0.002584303,"teacher_disagreement_score":0.003452019,"about_ca_system_score_codex":0.00066880905,"about_ca_system_score_gemma":0.0008561082,"threshold_uncertainty_score":0.010366499},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9955551,0.0002550101,0.0023423273,0.0004420846,0.000025624353,0.000017756412,0.0008865866,0.00002878947,0.000446683],"genre_scores_gemma":[0.997717,0.00006828845,0.00083661306,0.000034786248,0.00002815768,0.000012563504,0.0011073956,0.000008984264,0.00018612732],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9982602,0.0010213422,0.00008583982,0.00030320775,0.0002114405,0.00011798846],"domain_scores_gemma":[0.92964643,0.05940204,0.0039662276,0.003461963,0.0024316488,0.001091685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065711346,0.00034342488,0.0005222104,0.0019673,0.001007369,0.0009139595,0.00067840057,0.000796432,0.0015866727],"category_scores_gemma":[0.025038589,0.00017450722,0.0007514692,0.0024123176,0.0010559105,0.0013200514,0.00051765423,0.0013873654,0.0003868153],"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.000499285,0.00028472315,0.94716173,0.000107497304,0.00038241298,0.00062085723,0.00059705524,0.021233397,0.0016237206,0.0039711543,0.0041666706,0.019351574],"study_design_scores_gemma":[0.000065714135,0.00022255814,0.56105036,0.000064506006,0.00025341206,0.00056897075,0.0024566143,0.42358318,0.0019305794,0.004866818,0.004857676,0.00007973143],"about_ca_topic_score_codex":0.008968608,"about_ca_topic_score_gemma":0.008428429,"teacher_disagreement_score":0.008968608,"about_ca_system_score_codex":0.000564026,"about_ca_system_score_gemma":0.00042046758,"threshold_uncertainty_score":0.034751892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005488107,0.00013905497,0.9893935,0.00071979203,0.00003132061,0.00004726237,0.0001801782,0.00009507854,0.0039056977],"genre_scores_gemma":[0.40234444,0.00085646607,0.56973976,0.00084799,0.00043797103,0.000691203,0.0008406454,0.0003683455,0.023873258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990213,0.00042504034,0.000033501077,0.0002400862,0.0001769007,0.000103236845],"domain_scores_gemma":[0.9970247,0.0020050597,0.00020153628,0.0002942819,0.00034011732,0.00013420256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002661533,0.00083686743,0.0013900766,0.00085150957,0.00075235957,0.0018650655,0.0034181725,0.0029006714,0.008957093],"category_scores_gemma":[0.010220354,0.000784448,0.0011236956,0.0012887323,0.0016771092,0.0038489336,0.0026822698,0.002824585,0.0011615216],"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.000032400294,0.00006938739,0.00028833613,0.00011531267,0.000034722143,0.00008978744,0.00014400495,0.4892827,0.0008022995,0.48267195,0.006029941,0.020439222],"study_design_scores_gemma":[0.00000946678,0.000010739981,0.00006507431,0.00000946891,0.000006954518,0.000021135947,0.000013083682,0.86818117,0.000108124994,0.13031977,0.0012480733,0.0000069164994],"about_ca_topic_score_codex":0.006643554,"about_ca_topic_score_gemma":0.010480232,"teacher_disagreement_score":0.008957093,"about_ca_system_score_codex":0.0023687447,"about_ca_system_score_gemma":0.0024339803,"threshold_uncertainty_score":0.029964447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6503833,0.0006830907,0.29194558,0.0017477802,0.00022052068,0.00005966442,0.000178006,0.00084067124,0.053941406],"genre_scores_gemma":[0.97833496,0.00025297664,0.016741183,0.00021175566,0.000083412815,0.0000379107,0.000063479514,0.00015800707,0.00411633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994862,0.00013731941,0.000023196795,0.00009476978,0.00015875418,0.00009972809],"domain_scores_gemma":[0.99683183,0.001406682,0.000499186,0.0005945701,0.0003262845,0.0003413743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056800875,0.000355297,0.0003630406,0.0010546905,0.00076189486,0.0018857248,0.0006614506,0.0010987013,0.0036619336],"category_scores_gemma":[0.0073562507,0.0003024248,0.00037222993,0.0005016599,0.0018477988,0.003926548,0.0017661133,0.0014113857,0.0005732706],"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.00006998936,0.000031387473,0.0004982054,0.000045195724,0.00000987257,0.0001323003,0.000232812,0.009892241,0.009469578,0.96724516,0.0012490458,0.0111242505],"study_design_scores_gemma":[0.000026940486,0.000042758056,0.0004992292,0.000019715759,0.0000074121317,0.00023639997,0.0001465772,0.11806451,0.0045832167,0.8726289,0.003719853,0.000024462266],"about_ca_topic_score_codex":0.00067363394,"about_ca_topic_score_gemma":0.00038216182,"teacher_disagreement_score":0.0036619336,"about_ca_system_score_codex":0.00054248556,"about_ca_system_score_gemma":0.00041781832,"threshold_uncertainty_score":0.012250364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45575008,0.0014771689,0.5323741,0.00072995224,0.000041285708,0.00005248,0.00038118148,0.00024128004,0.008952509],"genre_scores_gemma":[0.98586255,0.00063217786,0.011715213,0.00007621104,0.00009370471,0.000073643096,0.00019768241,0.00006225054,0.0012865614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938834,0.00024081727,0.000025883632,0.00013152805,0.0001344498,0.000078896024],"domain_scores_gemma":[0.99400336,0.0043539833,0.0006685477,0.00038708645,0.00034265828,0.0002443801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016935284,0.00033096422,0.0005702143,0.0016436967,0.0004572564,0.0011699437,0.0006367696,0.00062190945,0.0010837545],"category_scores_gemma":[0.0094369585,0.00025465994,0.00038914935,0.0007368357,0.0027874266,0.0030401668,0.0009193982,0.000560613,0.00014589666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013955498,0.000035735495,0.005154551,0.00015167025,0.00004913626,0.0002926315,0.0005183442,0.24193266,0.010714997,0.7294298,0.00093842886,0.010642537],"study_design_scores_gemma":[0.000013941036,0.000039782662,0.0039325724,0.000033110828,0.000011256715,0.00018471912,0.00007790627,0.5524552,0.002643984,0.4396572,0.0009156555,0.000034624543],"about_ca_topic_score_codex":0.0006290828,"about_ca_topic_score_gemma":0.000440491,"teacher_disagreement_score":0.0016935284,"about_ca_system_score_codex":0.0010346974,"about_ca_system_score_gemma":0.0002960711,"threshold_uncertainty_score":0.008956373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2920811,0.0015423315,0.6914321,0.0028279515,0.00007095252,0.00026607487,0.0048204963,0.0016713502,0.005287687],"genre_scores_gemma":[0.8620614,0.0003536784,0.13209747,0.00016364445,0.00009286819,0.00019154212,0.0039139986,0.000099990546,0.0010254002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974644,0.0009522096,0.00016506905,0.00063361187,0.0006127359,0.0001720186],"domain_scores_gemma":[0.9586277,0.03508077,0.002394096,0.001961451,0.0015224478,0.00041350926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034575763,0.0011680267,0.0010958372,0.003997314,0.0008396807,0.0019800372,0.0016587244,0.002189821,0.003253207],"category_scores_gemma":[0.03814208,0.0005526277,0.0011054208,0.0025540483,0.0013208287,0.0038696812,0.001562269,0.0017771833,0.0004627833],"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.0014147572,0.0003856394,0.14979158,0.0013520296,0.00047943235,0.001325477,0.0027244736,0.40175092,0.00742593,0.100780174,0.016912866,0.31565672],"study_design_scores_gemma":[0.00007591666,0.00007078242,0.008165894,0.000095158364,0.000080096004,0.00019975622,0.00032886793,0.9084139,0.0032286032,0.07525318,0.004053353,0.00003460184],"about_ca_topic_score_codex":0.0035850909,"about_ca_topic_score_gemma":0.0044356114,"teacher_disagreement_score":0.003997314,"about_ca_system_score_codex":0.0012901293,"about_ca_system_score_gemma":0.0008250315,"threshold_uncertainty_score":0.018285632},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42195567,0.062421173,0.21724193,0.14350134,0.003061888,0.00037860233,0.0065481747,0.0028266825,0.14206459],"genre_scores_gemma":[0.9387397,0.012582082,0.034975644,0.0061337044,0.0013732105,0.00024959704,0.0012411415,0.00032277347,0.0043822005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975074,0.0010983259,0.000109490815,0.0006394816,0.00047673806,0.00016863858],"domain_scores_gemma":[0.9817578,0.010241419,0.0032040733,0.001803776,0.0019811331,0.001011761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023644327,0.00050512084,0.0007655282,0.0039796857,0.0016344384,0.007060532,0.00095501833,0.0027865493,0.0036715583],"category_scores_gemma":[0.032011587,0.0007057516,0.00047583162,0.0041236025,0.0045266245,0.023162602,0.001237757,0.0013981075,0.0010890783],"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.0002311729,0.000111401474,0.15275764,0.0026266677,0.00055637566,0.0010488225,0.012129314,0.016178196,0.004604554,0.4717738,0.07900967,0.2589724],"study_design_scores_gemma":[0.000023009981,0.000057041998,0.043517865,0.00064034556,0.00010708747,0.001118032,0.008965088,0.012287198,0.00081597356,0.85174763,0.080605604,0.00011508502],"about_ca_topic_score_codex":0.0030245604,"about_ca_topic_score_gemma":0.0027275628,"teacher_disagreement_score":0.007060532,"about_ca_system_score_codex":0.0015517849,"about_ca_system_score_gemma":0.0006809634,"threshold_uncertainty_score":0.012504458},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44638404,0.005420091,0.51315176,0.0017791863,0.00007973106,0.00052454,0.010750947,0.002181737,0.01972803],"genre_scores_gemma":[0.7882112,0.0031739003,0.19069102,0.00007170128,0.00013306132,0.00018196502,0.009971893,0.00016200195,0.0074033085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990669,0.00037155102,0.000063609885,0.00020378742,0.00020947837,0.000084716536],"domain_scores_gemma":[0.9942106,0.0035201714,0.0008635046,0.0005391481,0.0005604925,0.00030608565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001781043,0.0006249743,0.0004513937,0.019210957,0.0012055442,0.002981254,0.00061217934,0.0008002094,0.0042987494],"category_scores_gemma":[0.010110148,0.00030551347,0.00050809013,0.014908485,0.0013515224,0.0050936844,0.0014486202,0.0008986232,0.0014272239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052841107,0.00030917357,0.22503598,0.0017092638,0.00037185507,0.0007098572,0.00475319,0.047378924,0.010699741,0.22531414,0.018586343,0.4646031],"study_design_scores_gemma":[0.00006347148,0.0001565977,0.102366745,0.00042723888,0.0004113091,0.0006602706,0.0076252003,0.42637256,0.012135144,0.4021101,0.04755372,0.00011766045],"about_ca_topic_score_codex":0.006328037,"about_ca_topic_score_gemma":0.017667826,"teacher_disagreement_score":0.019210957,"about_ca_system_score_codex":0.0010834546,"about_ca_system_score_gemma":0.001129111,"threshold_uncertainty_score":0.014380753},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008011559,0.0004776961,0.9844684,0.00041110287,0.00013814602,0.00014414742,0.00054747134,0.0011993683,0.0046021543],"genre_scores_gemma":[0.11496074,0.0008918467,0.8667239,0.00021029705,0.00020637237,0.00027981438,0.004354399,0.0006807059,0.011691858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989503,0.00020231026,0.000058693557,0.00022451163,0.00050882966,0.00005531087],"domain_scores_gemma":[0.99881774,0.0002620067,0.000110004024,0.00032099683,0.00043188376,0.00005734556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008165458,0.00063351233,0.00082745403,0.0017394098,0.0007238925,0.0015413542,0.0018040936,0.00088776986,0.0056307376],"category_scores_gemma":[0.002719168,0.0002586024,0.0004720438,0.0035108945,0.00064375554,0.0018069089,0.00087814324,0.0008039767,0.0043960833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022424028,0.00011463728,0.0025662796,0.00033920133,0.00010151226,0.00020623751,0.00026556203,0.12289989,0.021404939,0.121743,0.043349903,0.68678457],"study_design_scores_gemma":[0.000033260414,0.00011552038,0.0024702786,0.000056973564,0.000034370914,0.0003176323,0.00015788198,0.79831296,0.015975438,0.079990186,0.10244805,0.000087412845],"about_ca_topic_score_codex":0.0038573637,"about_ca_topic_score_gemma":0.0061204513,"teacher_disagreement_score":0.0056307376,"about_ca_system_score_codex":0.0010584545,"about_ca_system_score_gemma":0.0009179285,"threshold_uncertainty_score":0.018836677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58741635,0.001987775,0.37974903,0.0026134118,0.00009441444,0.000051766183,0.00035135602,0.0003437839,0.027392147],"genre_scores_gemma":[0.9811399,0.0008432965,0.013418553,0.00008391091,0.000040493636,0.000047411075,0.00011463358,0.000035048863,0.004276724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962366,0.00015269076,0.000017713563,0.00007017431,0.00008841135,0.000047221434],"domain_scores_gemma":[0.9969445,0.0020738784,0.00046453075,0.00014366284,0.00019990094,0.0001735023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009045325,0.00031355873,0.00040492477,0.0011057361,0.00050626084,0.0015487109,0.00071896135,0.0010116531,0.0017537227],"category_scores_gemma":[0.009183462,0.000315593,0.0003606342,0.00051693164,0.0013633585,0.002971575,0.0008476437,0.00081759074,0.00018549898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058499703,0.000030129757,0.00365919,0.0000618921,0.00003569749,0.00037973336,0.00032873324,0.40938118,0.0033925797,0.57249576,0.001084192,0.009092487],"study_design_scores_gemma":[0.000010363282,0.000015219376,0.0014971424,0.000015042379,0.000010635277,0.00013234663,0.0000620247,0.8258026,0.00035935218,0.17096125,0.0011136958,0.000020345215],"about_ca_topic_score_codex":0.003212965,"about_ca_topic_score_gemma":0.0014899827,"teacher_disagreement_score":0.003212965,"about_ca_system_score_codex":0.0013196159,"about_ca_system_score_gemma":0.00039427218,"threshold_uncertainty_score":0.0095745325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19375078,0.00091828994,0.7885632,0.004681595,0.00018545137,0.00018821846,0.0013491154,0.00033607642,0.01002729],"genre_scores_gemma":[0.9343699,0.0016318504,0.040501915,0.0003733229,0.00020371389,0.00034629743,0.00059592974,0.00008742661,0.021889625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992873,0.00024211976,0.000035392597,0.00018957513,0.00014621261,0.00009948655],"domain_scores_gemma":[0.99543154,0.0030782227,0.0007459842,0.00017036167,0.00023295896,0.0003410188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013950366,0.0008913663,0.0012375572,0.0014972748,0.000933589,0.0018740399,0.0031582082,0.003924145,0.0044351798],"category_scores_gemma":[0.0084690675,0.00072142493,0.0010597121,0.0016455043,0.0017616441,0.003029914,0.0012892417,0.0017266744,0.00067945395],"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.00008948055,0.0000804926,0.001961464,0.00011928992,0.00007815171,0.00062367663,0.00025453552,0.7225055,0.002795602,0.26443228,0.0020934946,0.004966079],"study_design_scores_gemma":[0.000030428335,0.000030688287,0.0004170776,0.0000097799,0.000024025914,0.00014028078,0.000026499423,0.9403218,0.00011789361,0.058242656,0.0006155002,0.000023344035],"about_ca_topic_score_codex":0.008652935,"about_ca_topic_score_gemma":0.00642244,"teacher_disagreement_score":0.008652935,"about_ca_system_score_codex":0.001540545,"about_ca_system_score_gemma":0.001021382,"threshold_uncertainty_score":0.01720512},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4309422,0.0012597329,0.5641324,0.0010055475,0.00011035382,0.00013903278,0.00033591417,0.00037037628,0.0017044867],"genre_scores_gemma":[0.9479912,0.000585867,0.050143607,0.000106683015,0.00014645935,0.00010244461,0.00045027593,0.000066816516,0.00040666552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97936,0.017551212,0.00046031494,0.0012487771,0.001084204,0.00029540787],"domain_scores_gemma":[0.46337405,0.51195616,0.006091038,0.014090291,0.0034304988,0.0010579999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.030552037,0.0008030866,0.0011436968,0.0016785932,0.0012214687,0.0024609729,0.0027686253,0.0020883002,0.00092173915],"category_scores_gemma":[0.31168005,0.0009784157,0.00076508336,0.0020189304,0.0021496816,0.0058767768,0.0020385988,0.0017900364,0.0002776924],"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.00091743236,0.00027854575,0.16412508,0.00045517288,0.0010603034,0.0004783781,0.0011065006,0.66253936,0.002524033,0.047076106,0.0020670537,0.11737204],"study_design_scores_gemma":[0.000034400993,0.00007232559,0.0072210217,0.00003222712,0.00008656966,0.00018157663,0.00008865032,0.9657232,0.0007979716,0.025387824,0.00035027895,0.000023916979],"about_ca_topic_score_codex":0.0053450353,"about_ca_topic_score_gemma":0.00581043,"teacher_disagreement_score":0.030552037,"about_ca_system_score_codex":0.0009265455,"about_ca_system_score_gemma":0.0011240874,"threshold_uncertainty_score":0.16157657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.172701,0.0050339974,0.79616654,0.003765737,0.00028231248,0.00015851033,0.0009885837,0.0003458765,0.020557446],"genre_scores_gemma":[0.9136095,0.006528431,0.04396605,0.0002746557,0.0010771829,0.0004381746,0.0007431308,0.00028394363,0.033078916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837,0.00060585694,0.00007947182,0.0003833078,0.00031896506,0.00024245826],"domain_scores_gemma":[0.97353697,0.021667872,0.0018674018,0.0008899678,0.0010133424,0.0010243725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035648255,0.0011640298,0.002147607,0.0019850591,0.0011832663,0.0030678893,0.003105217,0.0029201144,0.005746466],"category_scores_gemma":[0.028335199,0.0015122866,0.0012936662,0.002797992,0.0019049621,0.0069562388,0.0020260774,0.0027745743,0.0006081327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019172962,0.00007240194,0.0018678779,0.00030900523,0.00012956037,0.00033412402,0.00029873464,0.36622494,0.0016449322,0.60628206,0.0040622912,0.01858233],"study_design_scores_gemma":[0.000019707772,0.000019634872,0.00055166864,0.000023082419,0.000032648273,0.00005841492,0.00003308656,0.8316471,0.00020899707,0.16626905,0.0011174289,0.000019189689],"about_ca_topic_score_codex":0.010139587,"about_ca_topic_score_gemma":0.0068288464,"teacher_disagreement_score":0.010139587,"about_ca_system_score_codex":0.0025887573,"about_ca_system_score_gemma":0.0009951926,"threshold_uncertainty_score":0.020161152},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22689061,0.0004645274,0.7676427,0.0007884771,0.00007784532,0.0003423757,0.00017567155,0.0015991484,0.0020186435],"genre_scores_gemma":[0.70137537,0.00048313316,0.29315394,0.00017190997,0.00013938965,0.00031268923,0.000643546,0.00020664009,0.0035132985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939281,0.0019883183,0.0003775298,0.0015012266,0.0017821803,0.00042271332],"domain_scores_gemma":[0.9750742,0.014082255,0.0042106006,0.0039093224,0.0016155904,0.0011081031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059184963,0.0012589175,0.0014645437,0.002615763,0.00285264,0.0024122372,0.002959754,0.0020820433,0.0012589061],"category_scores_gemma":[0.023996158,0.001000952,0.0012768272,0.0023240834,0.0016860475,0.006928316,0.004081106,0.002387707,0.00036059864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011659176,0.0008040263,0.055538606,0.0013397863,0.00057771406,0.0027800496,0.0094895065,0.2860472,0.035983816,0.03262793,0.00476398,0.56888145],"study_design_scores_gemma":[0.00006207632,0.00028374392,0.008002236,0.00007192317,0.0002031138,0.0010436261,0.0022975665,0.9421461,0.013627713,0.023096288,0.009091078,0.00007455291],"about_ca_topic_score_codex":0.0028853773,"about_ca_topic_score_gemma":0.0029566865,"teacher_disagreement_score":0.0059184963,"about_ca_system_score_codex":0.0011042767,"about_ca_system_score_gemma":0.0010514751,"threshold_uncertainty_score":0.031300426},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008420365,0.00019505902,0.98959875,0.0001640065,0.00002069871,0.00006538053,0.00004222613,0.00037153554,0.0011219622],"genre_scores_gemma":[0.19225173,0.00035151042,0.8020601,0.00012731046,0.000041802592,0.00057094364,0.00032156418,0.00013366244,0.004141444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896324,0.0004331475,0.000042903815,0.00020530002,0.00028845866,0.000067042005],"domain_scores_gemma":[0.9984503,0.00095438963,0.00014924837,0.0001256409,0.00027299114,0.00004740442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016718092,0.0012068293,0.0014197775,0.0019387364,0.0014074296,0.0010237128,0.0019177144,0.0016814852,0.0015997208],"category_scores_gemma":[0.004886099,0.00058837765,0.00086725724,0.002255305,0.0013118746,0.0011716489,0.00095038716,0.0013199439,0.00067515176],"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.000030713523,0.000029184966,0.00050392374,0.00004487886,0.00007253772,0.00005680967,0.00014086755,0.93663514,0.0006092932,0.015037155,0.0010928406,0.045746654],"study_design_scores_gemma":[0.000010117577,0.000008788912,0.000087977045,0.000004940718,0.0000056961544,0.000012100023,0.00001646889,0.98705894,0.00017374761,0.012046101,0.00056982983,0.0000054223706],"about_ca_topic_score_codex":0.01715695,"about_ca_topic_score_gemma":0.013655582,"teacher_disagreement_score":0.01715695,"about_ca_system_score_codex":0.0019798987,"about_ca_system_score_gemma":0.002292652,"threshold_uncertainty_score":0.034114182},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019561281,0.0025166802,0.97216696,0.00041276147,0.00018448377,0.00006645275,0.00018634075,0.00019401741,0.004710963],"genre_scores_gemma":[0.7078426,0.0034465326,0.2826115,0.00026951302,0.00064474286,0.00034753152,0.0005954529,0.00013818101,0.004103924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976859,0.00063503033,0.00012276754,0.00044316854,0.001007999,0.00010518866],"domain_scores_gemma":[0.9974232,0.0011955643,0.00034732433,0.00015896329,0.0007268884,0.00014816118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010718987,0.0008487312,0.00096766563,0.004796059,0.0008031934,0.002150239,0.0013026772,0.0010743606,0.0013997982],"category_scores_gemma":[0.006673643,0.00025505968,0.0005277422,0.005022158,0.0013089634,0.004243394,0.0014109167,0.001041014,0.00030932855],"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.00010821904,0.00008034659,0.0053619924,0.0005740817,0.00021892997,0.00040607562,0.00039833927,0.33748975,0.00975249,0.4099541,0.0075271735,0.2281285],"study_design_scores_gemma":[0.00002716397,0.000106802836,0.0018725033,0.000066166926,0.000080152065,0.00063909224,0.00016357866,0.84010273,0.0029836048,0.13786921,0.01598364,0.000105427556],"about_ca_topic_score_codex":0.002041014,"about_ca_topic_score_gemma":0.0013976822,"teacher_disagreement_score":0.004796059,"about_ca_system_score_codex":0.0015189556,"about_ca_system_score_gemma":0.0009604709,"threshold_uncertainty_score":0.01102078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054802895,0.0006684736,0.9350263,0.0020364947,0.00026991343,0.00012413335,0.0012451023,0.0002916004,0.005535149],"genre_scores_gemma":[0.88762224,0.0013268489,0.083168514,0.00049053493,0.0006926511,0.00064085535,0.0012331189,0.00015379046,0.024671506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990339,0.00029423644,0.000038271006,0.0003257158,0.00018560498,0.00012236543],"domain_scores_gemma":[0.99511623,0.0034593379,0.0005341817,0.00020553984,0.00047008664,0.00021455102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021632018,0.0010677243,0.0010036998,0.0023097543,0.00059674215,0.0020303251,0.0025534397,0.002748933,0.0045912126],"category_scores_gemma":[0.0091345105,0.00060389756,0.000942748,0.0021477698,0.0011351482,0.005331682,0.0012636062,0.0017699029,0.0010971157],"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.0001394244,0.00019604641,0.006601434,0.00015963074,0.00016770787,0.00023404729,0.00029323506,0.8922202,0.0024984074,0.06361211,0.005090771,0.028786993],"study_design_scores_gemma":[0.000007956797,0.00001928878,0.0004887243,0.000007394762,0.000028865456,0.000038326863,0.000020624431,0.98774636,0.00011979241,0.010711429,0.00080215326,0.000009055881],"about_ca_topic_score_codex":0.010340267,"about_ca_topic_score_gemma":0.0109190205,"teacher_disagreement_score":0.010340267,"about_ca_system_score_codex":0.0016150222,"about_ca_system_score_gemma":0.00094213604,"threshold_uncertainty_score":0.020560145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1561238,0.00024749816,0.8365696,0.00041983457,0.00002323712,0.00014896007,0.00008237002,0.00014289001,0.006241849],"genre_scores_gemma":[0.7903339,0.00032686928,0.20544901,0.00017580367,0.000033338692,0.00022864398,0.00021332703,0.000102312195,0.003136771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998882,0.00054263737,0.000052154875,0.00016148023,0.00021966359,0.0001419773],"domain_scores_gemma":[0.9866138,0.01131169,0.0005922053,0.00039809835,0.00052642304,0.00055775285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017278132,0.00088569726,0.0011216224,0.0013659501,0.0010406942,0.0017664488,0.0011911641,0.0014889905,0.0026416958],"category_scores_gemma":[0.015003737,0.0004996746,0.00093634124,0.0008839993,0.0017098514,0.0024543644,0.0017256539,0.0015897637,0.00039561384],"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.00020391078,0.00018568712,0.0023297395,0.00019012285,0.000110662084,0.00025019865,0.0006410457,0.58712035,0.0055322843,0.35906163,0.0022536388,0.042120848],"study_design_scores_gemma":[0.000028247545,0.0000515666,0.00014853044,0.000012075722,0.000012303856,0.00005374109,0.0000795579,0.76132786,0.00080982497,0.23665495,0.00080997136,0.000011339634],"about_ca_topic_score_codex":0.002047243,"about_ca_topic_score_gemma":0.0020621566,"teacher_disagreement_score":0.0026416958,"about_ca_system_score_codex":0.0010712846,"about_ca_system_score_gemma":0.0010609147,"threshold_uncertainty_score":0.00913769},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5221522,0.00022277245,0.47528204,0.00016255661,0.000046838988,0.00007981422,0.00034587586,0.00041333665,0.0012946024],"genre_scores_gemma":[0.9539969,0.000080923506,0.044709697,0.000040105682,0.000030393376,0.000044500568,0.0006003584,0.000028810471,0.0004682946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832934,0.0007626628,0.000082653016,0.0004239968,0.0002729086,0.00012844487],"domain_scores_gemma":[0.986108,0.009336972,0.0013895631,0.001659602,0.0011251153,0.00038064335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003685889,0.0005225963,0.0007671041,0.0016338659,0.00060630706,0.00085834385,0.0010292296,0.00074440235,0.0006501411],"category_scores_gemma":[0.018717961,0.00038791873,0.00046702035,0.0011349224,0.00092134107,0.00155096,0.001181915,0.00061432377,0.0002589831],"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.0011227168,0.0002920228,0.2492443,0.00026551966,0.00029688494,0.0007454368,0.0010264298,0.53224236,0.014145824,0.04490813,0.0038422206,0.15186825],"study_design_scores_gemma":[0.0000152104085,0.000041554973,0.0065782047,0.000006591602,0.000010313867,0.00010530613,0.00007083417,0.981128,0.0017081328,0.009884892,0.00043804388,0.000012950547],"about_ca_topic_score_codex":0.0030713286,"about_ca_topic_score_gemma":0.003920769,"teacher_disagreement_score":0.003685889,"about_ca_system_score_codex":0.0007029347,"about_ca_system_score_gemma":0.0004135538,"threshold_uncertainty_score":0.019493103},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063040857,0.11759619,0.8304817,0.010088783,0.0011153135,0.00014462475,0.0033497452,0.00087187864,0.030047722],"genre_scores_gemma":[0.24940588,0.45156318,0.25104526,0.00427914,0.008891169,0.0011065967,0.008410886,0.0008678879,0.024430066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975938,0.0010438192,0.0001576012,0.0003834652,0.0007010201,0.00012027975],"domain_scores_gemma":[0.99215394,0.005810564,0.0003994753,0.00059911265,0.0008769552,0.00015982715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042187576,0.001590056,0.0020490882,0.0041283574,0.0009082966,0.0031363205,0.0033886961,0.0022602752,0.0071624764],"category_scores_gemma":[0.014096472,0.00084949133,0.0017251947,0.0084555475,0.0015234337,0.0064404267,0.0015350488,0.0028444147,0.0032689434],"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.000042138985,0.00010440017,0.003810985,0.0011349842,0.0001800884,0.00022197227,0.0002056786,0.08963587,0.00036286082,0.68412036,0.040257744,0.17992292],"study_design_scores_gemma":[0.000013762328,0.000047011512,0.0011161444,0.00035952334,0.000056988567,0.0004096467,0.00008522724,0.24214958,0.00016298756,0.6416895,0.113856584,0.000053059794],"about_ca_topic_score_codex":0.0052169524,"about_ca_topic_score_gemma":0.0032714116,"teacher_disagreement_score":0.0071624764,"about_ca_system_score_codex":0.002232046,"about_ca_system_score_gemma":0.0023847623,"threshold_uncertainty_score":0.023960888},"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":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018391235,0.11447862,0.5349081,0.07485843,0.23537672,0.00037029636,0.0021374,0.0017264943,0.034304854],"genre_scores_gemma":[0.021169523,0.11814742,0.21187764,0.03929754,0.48343512,0.0009392467,0.0030797697,0.0025958845,0.11945785],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958111,0.0009394827,0.0004553432,0.0010560602,0.001539379,0.00019853949],"domain_scores_gemma":[0.98602295,0.008143976,0.0005713264,0.0015346856,0.0026909835,0.0010359988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003994357,0.0018900397,0.0025069104,0.007999914,0.0020605968,0.007757111,0.0021338104,0.003542239,0.017220192],"category_scores_gemma":[0.013970981,0.0011422846,0.002825168,0.007998725,0.0038028935,0.009936503,0.0035372728,0.010304175,0.011616678],"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.00005380904,0.00014807051,0.000758284,0.0011954606,0.0001070045,0.00023835494,0.00022236085,0.0012702623,0.0013889781,0.124590464,0.6545486,0.21547846],"study_design_scores_gemma":[0.000012312993,0.00004524501,0.0011203685,0.00031003152,0.000046002286,0.0007311003,0.00009071887,0.0042682732,0.00045088763,0.0849308,0.9079194,0.00007476955],"about_ca_topic_score_codex":0.0012220744,"about_ca_topic_score_gemma":0.0015888156,"teacher_disagreement_score":0.017220192,"about_ca_system_score_codex":0.0017950056,"about_ca_system_score_gemma":0.0024142633,"threshold_uncertainty_score":0.057607293},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8725004,0.00093264383,0.10626635,0.0030844035,0.00003836741,0.00003452331,0.00009257438,0.000112320085,0.016938332],"genre_scores_gemma":[0.99683064,0.00018690323,0.0025041786,0.00004093173,0.000024597326,0.0000090162475,0.000011343883,0.000004815654,0.00038751704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994216,0.00020495025,0.000024415009,0.00013115664,0.00011664557,0.00010120899],"domain_scores_gemma":[0.99293727,0.0043892134,0.001403771,0.00048133195,0.00031745152,0.0004709839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001863699,0.000206967,0.0005539176,0.0019381441,0.0014446244,0.002162959,0.00078643893,0.0014528988,0.0020439685],"category_scores_gemma":[0.012221353,0.00024276068,0.0004735737,0.0011387814,0.0034845995,0.004405083,0.0013466259,0.00089574285,0.00013642135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012852119,0.00010875926,0.03269478,0.00014493638,0.0001273623,0.00058199407,0.0027171685,0.13552412,0.0035733916,0.7982256,0.0013685597,0.024804812],"study_design_scores_gemma":[0.000031310243,0.00006492461,0.015244639,0.000034003577,0.000055549855,0.00024326422,0.0007984097,0.37085867,0.00051443785,0.6107695,0.0013394457,0.000045742945],"about_ca_topic_score_codex":0.005769829,"about_ca_topic_score_gemma":0.003646886,"teacher_disagreement_score":0.005769829,"about_ca_system_score_codex":0.0019031868,"about_ca_system_score_gemma":0.0007130373,"threshold_uncertainty_score":0.013808668},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03149,0.0007357731,0.95865554,0.0006728458,0.000029135434,0.00004717778,0.00033827862,0.00029643104,0.007734725],"genre_scores_gemma":[0.71286786,0.0033405386,0.2738475,0.000252244,0.00016161577,0.0002667879,0.0008440769,0.00023142071,0.008188017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932873,0.0003199654,0.000026056565,0.00016645955,0.00010539875,0.000053400596],"domain_scores_gemma":[0.99707425,0.0020286492,0.00030109202,0.00034443388,0.00016406896,0.00008759946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010631339,0.00065166526,0.000585864,0.0016305496,0.0004926203,0.0014817289,0.0010542801,0.0008940997,0.0026328294],"category_scores_gemma":[0.008038094,0.00040450692,0.0007637532,0.0013783822,0.0013438578,0.0037691453,0.0009881661,0.0011610708,0.0006424558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028992741,0.000024571302,0.0008070789,0.00018505739,0.000029686344,0.00014159617,0.00010842277,0.29103857,0.0017258477,0.6820021,0.002738147,0.021169944],"study_design_scores_gemma":[0.0000062879994,0.000009383149,0.00035595128,0.00002129659,0.000007424572,0.00008765658,0.000024556166,0.6698859,0.0005048851,0.327108,0.0019771801,0.0000115322055],"about_ca_topic_score_codex":0.0022303902,"about_ca_topic_score_gemma":0.0028438643,"teacher_disagreement_score":0.0026328294,"about_ca_system_score_codex":0.0011855955,"about_ca_system_score_gemma":0.0005534273,"threshold_uncertainty_score":0.008807659},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46793538,0.003701698,0.51262933,0.002876381,0.000087759305,0.00020971235,0.0032172487,0.0009032106,0.008439266],"genre_scores_gemma":[0.9445299,0.0016920189,0.046736617,0.00025067737,0.00016828076,0.00022551509,0.0023163103,0.00012926267,0.003951438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988049,0.0004588306,0.000060324764,0.00036184888,0.00019998976,0.00011399834],"domain_scores_gemma":[0.99350524,0.0038556445,0.0011730563,0.00061084004,0.0004310456,0.0004241015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088710984,0.0004216388,0.00073505146,0.0032566725,0.0009848177,0.0017266654,0.0007733842,0.0008740179,0.001925741],"category_scores_gemma":[0.007860856,0.0006170927,0.0006290196,0.0027701592,0.0014142091,0.0036575834,0.0014685071,0.0007645717,0.00030799286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028850115,0.00012403145,0.03631666,0.0006217422,0.00033291223,0.0011458137,0.0027753473,0.19064212,0.005487382,0.6726351,0.012815669,0.07681484],"study_design_scores_gemma":[0.000026343076,0.000028286966,0.009154032,0.000050001006,0.00006353275,0.00042480248,0.00044631126,0.28687805,0.0006484476,0.6934232,0.0088373,0.000019718558],"about_ca_topic_score_codex":0.0057519833,"about_ca_topic_score_gemma":0.006971509,"teacher_disagreement_score":0.0057519833,"about_ca_system_score_codex":0.0012684435,"about_ca_system_score_gemma":0.0004673744,"threshold_uncertainty_score":0.011437058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39065215,0.0012062859,0.5570294,0.0021039497,0.00013446798,0.00015038946,0.00066884747,0.0008478508,0.0472066],"genre_scores_gemma":[0.94356424,0.000699784,0.038138166,0.00034122707,0.00012462768,0.00015388658,0.00050595077,0.000107549466,0.016364591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994522,0.00013963737,0.000015615195,0.00015743497,0.0001602892,0.00007494621],"domain_scores_gemma":[0.9978417,0.0009470946,0.00041012792,0.00026261355,0.00028520028,0.00025319253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050444534,0.0003550292,0.000495288,0.001983287,0.0012420565,0.0013579974,0.0008932116,0.0010681734,0.0032143309],"category_scores_gemma":[0.0049205814,0.00047897614,0.0004891591,0.0010261866,0.0011969877,0.002454904,0.0011801949,0.0008981246,0.0005572261],"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.000038123355,0.000029489041,0.0019801115,0.00007685758,0.000036674937,0.0005475439,0.00043541705,0.047005765,0.0039516096,0.92330587,0.004592456,0.018000022],"study_design_scores_gemma":[0.000014216787,0.00002262237,0.0020457325,0.000021326872,0.000017881726,0.0008546371,0.0001406323,0.28880903,0.0009758103,0.6920618,0.015011196,0.000025146695],"about_ca_topic_score_codex":0.0027838158,"about_ca_topic_score_gemma":0.0035933855,"teacher_disagreement_score":0.0032143309,"about_ca_system_score_codex":0.00093714043,"about_ca_system_score_gemma":0.00041215168,"threshold_uncertainty_score":0.010752976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90002185,0.0011596888,0.07019886,0.0062577734,0.00017034756,0.0004409732,0.0030776777,0.0015531727,0.01711967],"genre_scores_gemma":[0.9214574,0.00065368746,0.0730975,0.00019434275,0.00009195803,0.00009683727,0.0012815887,0.00007112,0.003055556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928397,0.00025633557,0.00005784823,0.00009332194,0.00025695038,0.000051604995],"domain_scores_gemma":[0.9879488,0.007961359,0.0013939977,0.00044953584,0.0017024934,0.0005438067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018398638,0.00043991714,0.0003352683,0.0028267133,0.0007623563,0.0028389627,0.00045499246,0.0005836672,0.0009911989],"category_scores_gemma":[0.012539074,0.000237383,0.00021626941,0.0028417825,0.00032193091,0.0027431129,0.00046510666,0.0011184771,0.00066045753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007590718,0.001876892,0.30210692,0.00069216505,0.00018053451,0.0005049574,0.0041295844,0.008919554,0.013401193,0.009494159,0.021154352,0.63678074],"study_design_scores_gemma":[0.00012243,0.0006835426,0.28973925,0.0007057936,0.00036813077,0.0006895893,0.020625602,0.50773215,0.030972619,0.069964014,0.078104585,0.00029237222],"about_ca_topic_score_codex":0.0051629674,"about_ca_topic_score_gemma":0.015977232,"teacher_disagreement_score":0.0051629674,"about_ca_system_score_codex":0.00048347635,"about_ca_system_score_gemma":0.0014897422,"threshold_uncertainty_score":0.010265827},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4257681,0.0048111305,0.5150467,0.0021600362,0.0003680456,0.0011510759,0.011633493,0.007866588,0.031194793],"genre_scores_gemma":[0.91262716,0.0010574736,0.08111791,0.00007165006,0.00027873303,0.0002293666,0.0020232683,0.000092457965,0.0025019732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997439,0.00093446864,0.00018872727,0.0006146191,0.0007077702,0.00011539549],"domain_scores_gemma":[0.990166,0.0055040806,0.00199829,0.001079717,0.00092882593,0.0003231431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00194559,0.001094729,0.000884901,0.010794007,0.00077312515,0.003232199,0.0010285979,0.0010283446,0.0016329312],"category_scores_gemma":[0.013953768,0.0004609428,0.0005886085,0.0064194044,0.0004876746,0.0047922824,0.0012724373,0.00091817166,0.0008504701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080343866,0.0004597609,0.17910735,0.00075020886,0.00068899064,0.00047701548,0.0009876415,0.12623608,0.011851608,0.014205013,0.008198799,0.656234],"study_design_scores_gemma":[0.000037981925,0.0001566219,0.041520834,0.00007493574,0.00016148608,0.0004389006,0.0004148043,0.9240262,0.008213138,0.015080212,0.00979386,0.00008113009],"about_ca_topic_score_codex":0.0068690586,"about_ca_topic_score_gemma":0.0057878583,"teacher_disagreement_score":0.010794007,"about_ca_system_score_codex":0.0008965787,"about_ca_system_score_gemma":0.00049602863,"threshold_uncertainty_score":0.013658106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06048493,0.00066406175,0.9370236,0.00025241886,0.0000296669,0.000060960483,0.000057915935,0.00014087465,0.0012856376],"genre_scores_gemma":[0.79549956,0.00075090595,0.20174429,0.000116959505,0.000093487055,0.00020596643,0.00020195456,0.00007226332,0.0013145829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872464,0.00047877914,0.00006319815,0.00026527856,0.00037169873,0.000096394906],"domain_scores_gemma":[0.98893833,0.008070785,0.00096270104,0.0005931439,0.0011093721,0.00032575708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045628077,0.000608124,0.0008756145,0.002774445,0.00074644363,0.0011676418,0.0013731375,0.0012172392,0.0012253515],"category_scores_gemma":[0.018336242,0.00035014006,0.0010035426,0.0011196118,0.0014857549,0.0031708404,0.0016153889,0.0012966321,0.000133828],"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.0001664218,0.00011022869,0.008969106,0.00045196433,0.0002532561,0.0002413751,0.00045048058,0.5920579,0.009282244,0.3130172,0.0015337651,0.07346604],"study_design_scores_gemma":[0.000004999519,0.000014042749,0.00048024437,0.000011245829,0.00001119165,0.000031398893,0.000018700208,0.9684132,0.0005915041,0.030217342,0.00019671736,0.000009409406],"about_ca_topic_score_codex":0.002027147,"about_ca_topic_score_gemma":0.0014047856,"teacher_disagreement_score":0.0045628077,"about_ca_system_score_codex":0.0012206162,"about_ca_system_score_gemma":0.00095075124,"threshold_uncertainty_score":0.024130762},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7266136,0.00036514632,0.26729128,0.00035399263,0.000029536413,0.00011295502,0.0012160904,0.00024421798,0.0037731386],"genre_scores_gemma":[0.98045623,0.00010771346,0.018182496,0.000014719335,0.00001970589,0.000058430796,0.00070963404,0.000013051159,0.00043799455],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980122,0.0009975795,0.000110512636,0.00038267634,0.00034730547,0.0001497345],"domain_scores_gemma":[0.9931653,0.0037969716,0.0012944707,0.0005204726,0.001031076,0.00019165898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025600756,0.00044367352,0.00063026,0.004207393,0.0005454297,0.0013555759,0.0005397592,0.00055938534,0.0017976715],"category_scores_gemma":[0.010488557,0.00018264346,0.0007964703,0.004144045,0.0004504298,0.0013699959,0.0008710415,0.0005420106,0.0002895675],"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.00065285066,0.00036031962,0.47089317,0.00034261614,0.001533503,0.0007010638,0.0016953679,0.25589317,0.008456363,0.027816782,0.0034607262,0.22819409],"study_design_scores_gemma":[0.000010580823,0.00016832561,0.16206977,0.000040633226,0.00020556882,0.00017736493,0.0010011161,0.8227465,0.0014798028,0.009936997,0.00210485,0.000058527636],"about_ca_topic_score_codex":0.0051080897,"about_ca_topic_score_gemma":0.004081044,"teacher_disagreement_score":0.0051080897,"about_ca_system_score_codex":0.00087917474,"about_ca_system_score_gemma":0.000602477,"threshold_uncertainty_score":0.013539135},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20278841,0.00090961845,0.77024883,0.0023063363,0.0000865961,0.00011589474,0.0007490156,0.00046109175,0.02233429],"genre_scores_gemma":[0.92740774,0.0010240381,0.06157838,0.0004527807,0.00022713568,0.0001847354,0.00091672176,0.00012165758,0.008086818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893683,0.000408974,0.000029480845,0.00026746085,0.00024855696,0.00010869704],"domain_scores_gemma":[0.99568886,0.0018097017,0.0012235926,0.0005449166,0.00038899895,0.00034389592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092582894,0.0007448789,0.0006998138,0.0035357368,0.0018638099,0.0016902761,0.0014412339,0.0012678952,0.0037646752],"category_scores_gemma":[0.007344592,0.0005397466,0.000788678,0.0025895638,0.0024071443,0.0046165,0.0019853634,0.001359814,0.0006196951],"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.000017484348,0.000025510495,0.002332542,0.00004540734,0.000033542507,0.00016733502,0.00029392028,0.071838364,0.00056505227,0.911481,0.0025736226,0.010626156],"study_design_scores_gemma":[0.000007592218,0.000018801102,0.0010405319,0.000016298985,0.000011245725,0.0002315231,0.00011636817,0.2731341,0.00024428632,0.7170782,0.008084369,0.000016771348],"about_ca_topic_score_codex":0.0037907476,"about_ca_topic_score_gemma":0.0037643318,"teacher_disagreement_score":0.0037907476,"about_ca_system_score_codex":0.0017822694,"about_ca_system_score_gemma":0.00061267137,"threshold_uncertainty_score":0.012931347},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04423322,0.00022732935,0.88722163,0.0005697601,0.00014486635,0.0014721546,0.008921553,0.05116848,0.0060409186],"genre_scores_gemma":[0.15095755,0.00028140412,0.8216098,0.00020981216,0.00013506129,0.0012858824,0.015295229,0.0005768341,0.009648401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992186,0.0001365767,0.00008336959,0.00028898346,0.00022920987,0.000043285654],"domain_scores_gemma":[0.9984731,0.0005976699,0.00019325082,0.00026523627,0.00033119178,0.00013951854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013109453,0.00081440626,0.00075838994,0.0037101635,0.0009131682,0.0011928674,0.0008684046,0.0006295914,0.0034442998],"category_scores_gemma":[0.002957443,0.00033416165,0.00044688323,0.0023796163,0.00021143856,0.002053892,0.0011906803,0.0005451927,0.0031521867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006014738,0.00088556024,0.018764462,0.0007667803,0.0002830326,0.00053356146,0.0011008432,0.008107176,0.057760168,0.007055392,0.058699965,0.84544164],"study_design_scores_gemma":[0.00019246555,0.000486907,0.04933534,0.00014134386,0.00029898962,0.001166088,0.0010130125,0.7156951,0.06666683,0.023738382,0.1410128,0.00025277678],"about_ca_topic_score_codex":0.002807438,"about_ca_topic_score_gemma":0.005338552,"teacher_disagreement_score":0.0037101635,"about_ca_system_score_codex":0.0004310694,"about_ca_system_score_gemma":0.0010790814,"threshold_uncertainty_score":0.011522353},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78077793,0.0009542026,0.20545126,0.0016859953,0.00010934468,0.00010349347,0.00067012146,0.00022626773,0.010021299],"genre_scores_gemma":[0.9888298,0.00031878104,0.0055717495,0.00008986565,0.00006394247,0.000036139558,0.0001635178,0.000019226496,0.004907177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995209,0.00019040644,0.000014708356,0.00008931373,0.000112480455,0.00007222149],"domain_scores_gemma":[0.9958079,0.0025768946,0.00060590997,0.00022573544,0.00048406824,0.00029951928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010133219,0.000364641,0.00059253426,0.0023066434,0.0010839144,0.0017105932,0.0009476683,0.0011333568,0.0020203807],"category_scores_gemma":[0.0069142748,0.00034132873,0.0004913768,0.0013175431,0.0010517912,0.0022866207,0.0009782056,0.00066983514,0.00036005813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035873515,0.0002623742,0.02756064,0.00026027876,0.00015429959,0.001077252,0.0014603831,0.29905847,0.011008696,0.60938597,0.007332316,0.04208061],"study_design_scores_gemma":[0.000014988977,0.000030699706,0.0031093804,0.000018163944,0.000019261284,0.00015570686,0.00013920385,0.9361299,0.000624603,0.058595292,0.0011375534,0.00002516586],"about_ca_topic_score_codex":0.007668421,"about_ca_topic_score_gemma":0.007476554,"teacher_disagreement_score":0.007668421,"about_ca_system_score_codex":0.0013047396,"about_ca_system_score_gemma":0.0005776219,"threshold_uncertainty_score":0.015247583},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04579024,0.0005897534,0.95066357,0.00022626593,0.000054587526,0.00010473975,0.00012424697,0.0003936191,0.0020529884],"genre_scores_gemma":[0.5994329,0.00064151164,0.39634234,0.00012613412,0.000094882445,0.00015020682,0.00056774565,0.00010637828,0.0025379236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979163,0.00063088763,0.00009924361,0.00043127307,0.00075986446,0.00016237308],"domain_scores_gemma":[0.9929219,0.0041802824,0.0007464995,0.00059418526,0.0013100224,0.00024705278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021374759,0.0008335515,0.0009037494,0.00456253,0.0010369039,0.0016154104,0.0018486583,0.0013309232,0.00096090516],"category_scores_gemma":[0.011670906,0.00039702858,0.0008137833,0.0032308702,0.0010150012,0.0021721863,0.001598703,0.0011326807,0.0004278845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005133418,0.00023205085,0.017013134,0.0006156184,0.00038723438,0.000589103,0.0008639358,0.41329956,0.023316981,0.08465044,0.0074847485,0.45103383],"study_design_scores_gemma":[0.000013665317,0.00003389367,0.0010761734,0.00001524968,0.000019438547,0.00017073203,0.00007520414,0.9754608,0.0036629802,0.017566534,0.0018856548,0.000019722884],"about_ca_topic_score_codex":0.0051262574,"about_ca_topic_score_gemma":0.004790013,"teacher_disagreement_score":0.0051262574,"about_ca_system_score_codex":0.0011253715,"about_ca_system_score_gemma":0.0008142596,"threshold_uncertainty_score":0.0113042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99129957,0.000027214366,0.006688923,0.00006362438,0.000014065784,0.00001901232,0.00015065342,0.000089257075,0.0016476804],"genre_scores_gemma":[0.9987393,0.000015948508,0.0008208677,0.000007709598,0.0000025313454,0.000011339512,0.00012692706,0.000009130298,0.0002662672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998147,0.00005841724,0.000009982154,0.000025633808,0.000050278573,0.000040929986],"domain_scores_gemma":[0.99878174,0.00066565844,0.000098881304,0.00010211923,0.0002676,0.00008400082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051205116,0.0002743249,0.00029970636,0.00072826626,0.00026073176,0.00046996304,0.0006008003,0.00068296486,0.00077411265],"category_scores_gemma":[0.0024024907,0.00015338314,0.0003684038,0.0005718662,0.00039515362,0.00046317896,0.0002779639,0.0004963545,0.00009981317],"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.00015902636,0.00014423396,0.010005054,0.000034223107,0.00003571597,0.00024614966,0.00013376478,0.9769696,0.004766932,0.0044367104,0.00045033885,0.0026182286],"study_design_scores_gemma":[0.0000052934183,0.000029845374,0.0014854894,0.0000022188453,0.00000396057,0.000027863633,0.00003190544,0.9970106,0.00080557575,0.0005403802,0.000052493328,0.000004425563],"about_ca_topic_score_codex":0.0048422837,"about_ca_topic_score_gemma":0.0022602559,"teacher_disagreement_score":0.0048422837,"about_ca_system_score_codex":0.0006067465,"about_ca_system_score_gemma":0.00032427383,"threshold_uncertainty_score":0.009628177},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04935015,0.0004507956,0.94622123,0.00034719481,0.00008374241,0.00011568305,0.00030592197,0.0011871423,0.0019381369],"genre_scores_gemma":[0.575406,0.000531021,0.4198693,0.00014679274,0.00017019147,0.0002739182,0.00088837737,0.00019359999,0.0025207424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974897,0.0010029309,0.00013616082,0.00053518114,0.00066807243,0.00016800055],"domain_scores_gemma":[0.9911317,0.0043085217,0.0016667132,0.0011006871,0.0013535043,0.0004386707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020022553,0.00083529716,0.0009226152,0.006872928,0.0015109853,0.0023626,0.001428235,0.0012774288,0.0016252727],"category_scores_gemma":[0.012427928,0.0004893697,0.00092335435,0.00467267,0.0014194964,0.0038086423,0.002673564,0.0013573393,0.001238828],"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.00068203546,0.00035884127,0.05089902,0.0007571681,0.00045121723,0.0006828314,0.0021915422,0.27427298,0.027129631,0.082230136,0.0148246875,0.54551995],"study_design_scores_gemma":[0.000020835814,0.00006819342,0.0030299488,0.000036431335,0.000032125714,0.00029990458,0.0004094966,0.9456188,0.005040306,0.041232705,0.004165026,0.000046246292],"about_ca_topic_score_codex":0.0035698747,"about_ca_topic_score_gemma":0.00459387,"teacher_disagreement_score":0.006872928,"about_ca_system_score_codex":0.0010709215,"about_ca_system_score_gemma":0.0007792098,"threshold_uncertainty_score":0.010589063},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47004429,0.0026563935,0.5084679,0.0013405423,0.00013159943,0.0003728076,0.004346355,0.0012749832,0.011365082],"genre_scores_gemma":[0.89824694,0.0006204651,0.094087645,0.00007445584,0.00016570566,0.00017209936,0.0026021108,0.000083135106,0.0039474024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998432,0.00051470625,0.00007311011,0.00038908888,0.0004849686,0.00010615851],"domain_scores_gemma":[0.991723,0.0062836125,0.0005568478,0.00069110346,0.0004474675,0.00029795172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013533031,0.00068588444,0.00087273004,0.004882386,0.0012524674,0.0018830738,0.0013960015,0.0009827857,0.0026244747],"category_scores_gemma":[0.012048949,0.0005245576,0.0009675038,0.0035435052,0.00051102845,0.0031487679,0.0018780867,0.0009802711,0.00083581073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016473044,0.0013625704,0.19547804,0.0019156213,0.0018826249,0.0028605282,0.0064328318,0.118566886,0.030900268,0.09064061,0.027816867,0.5204958],"study_design_scores_gemma":[0.00006118108,0.00012401753,0.024525428,0.00009109472,0.00034785425,0.00074055075,0.001018758,0.8954417,0.00607538,0.05917952,0.012350432,0.000044153996],"about_ca_topic_score_codex":0.0025485319,"about_ca_topic_score_gemma":0.0074386043,"teacher_disagreement_score":0.004882386,"about_ca_system_score_codex":0.0004795134,"about_ca_system_score_gemma":0.0005112494,"threshold_uncertainty_score":0.008779764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.543076,0.0011873208,0.4462998,0.0012186517,0.000097896955,0.00030111524,0.0008985899,0.00047460728,0.00644605],"genre_scores_gemma":[0.9200015,0.00043958164,0.07317148,0.00013952934,0.00012990652,0.00021583456,0.0011228472,0.000092226954,0.0046870983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714905,0.00093953544,0.0001313365,0.0009064458,0.00063338014,0.00024029832],"domain_scores_gemma":[0.97442245,0.016901098,0.0034890128,0.002352444,0.001582056,0.001252946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036576928,0.00045558857,0.00087892846,0.004025551,0.0030463792,0.0028442414,0.0018993374,0.0016284775,0.0023688222],"category_scores_gemma":[0.029096924,0.0006480227,0.0011309588,0.00339385,0.002497059,0.006278914,0.002717069,0.0017885877,0.00040303255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018423911,0.00092141196,0.15780964,0.0015330025,0.00069855887,0.0021200543,0.010264214,0.14013267,0.011462222,0.39388096,0.012057004,0.26727793],"study_design_scores_gemma":[0.00012651406,0.00022534758,0.029118892,0.00020101001,0.00026489585,0.0015074443,0.004049682,0.6820252,0.004744988,0.26129833,0.016369829,0.000067869005],"about_ca_topic_score_codex":0.0038992334,"about_ca_topic_score_gemma":0.0050106146,"teacher_disagreement_score":0.004025551,"about_ca_system_score_codex":0.0011946207,"about_ca_system_score_gemma":0.0008133829,"threshold_uncertainty_score":0.019343972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12960882,0.00039054154,0.86586094,0.000165886,0.000025732612,0.000054181182,0.00032155725,0.00047523755,0.003097148],"genre_scores_gemma":[0.8374508,0.0007757479,0.1594524,0.00003425804,0.00006474348,0.000103110986,0.0004383728,0.00017200029,0.0015085811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996332,0.00009994328,0.00002141927,0.000106561994,0.00010581211,0.00003299648],"domain_scores_gemma":[0.99840623,0.0006214931,0.0002961705,0.0003096015,0.00025750053,0.000109017405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000664606,0.00059115,0.00043204235,0.0026260528,0.00039464218,0.0013065701,0.0004916021,0.0007241067,0.0009637016],"category_scores_gemma":[0.0053711543,0.00042194137,0.00035137378,0.0011111044,0.0007061027,0.0024160922,0.00084489636,0.00095925183,0.0004196965],"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.00015680933,0.000107294654,0.00808719,0.00029787506,0.00014191563,0.0005351023,0.0008172981,0.4043476,0.088229075,0.24772243,0.0031456056,0.2464118],"study_design_scores_gemma":[0.000005051193,0.000017011414,0.0032439542,0.00001465262,0.000014386696,0.00012439676,0.000096200834,0.8734896,0.0060358895,0.114270285,0.0026431135,0.00004554718],"about_ca_topic_score_codex":0.00086687464,"about_ca_topic_score_gemma":0.00066086807,"teacher_disagreement_score":0.0026260528,"about_ca_system_score_codex":0.0004713563,"about_ca_system_score_gemma":0.00052152097,"threshold_uncertainty_score":0.0035148263},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010196845,0.54578567,0.012981668,0.2401561,0.01985366,0.00008894699,0.00028042687,0.00031836025,0.17951548],"genre_scores_gemma":[0.056784052,0.6456095,0.028182426,0.08091571,0.025934977,0.00040463533,0.00046443415,0.00054120895,0.16116306],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715304,0.0010151722,0.00012344186,0.0004290822,0.0011317508,0.00014755865],"domain_scores_gemma":[0.9971041,0.0017259541,0.00019957496,0.0002494466,0.00040107864,0.00031982025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029551014,0.0009137701,0.00070773775,0.0018800828,0.001485146,0.0057412623,0.0017848194,0.002740491,0.022342658],"category_scores_gemma":[0.0064281053,0.00042337997,0.00045016728,0.0023093831,0.010970354,0.01028302,0.0034588662,0.006475102,0.0037288673],"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.0000146567,0.000025550284,0.00025347713,0.0007428001,0.000017775823,0.000064941065,0.0013400196,0.00043318243,0.0001411129,0.1396619,0.59045,0.2668546],"study_design_scores_gemma":[0.0000035721612,0.000015396095,0.00024538022,0.0010578682,0.0000045836455,0.00007956406,0.000491024,0.00010669483,0.000040115938,0.049796913,0.94814956,0.000009328316],"about_ca_topic_score_codex":0.0054936414,"about_ca_topic_score_gemma":0.00812452,"teacher_disagreement_score":0.022342658,"about_ca_system_score_codex":0.0040492965,"about_ca_system_score_gemma":0.004836694,"threshold_uncertainty_score":0.07474363},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73681086,0.0028385976,0.24519807,0.0012856587,0.000121638135,0.0006421511,0.0023855953,0.00055776874,0.010159589],"genre_scores_gemma":[0.9349209,0.0008103632,0.06080757,0.00009504989,0.000118627024,0.00021952554,0.0014325329,0.000028855084,0.0015667125],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971046,0.0010284386,0.0002056479,0.0007512709,0.00072522723,0.00018487572],"domain_scores_gemma":[0.99137866,0.0050068805,0.0016574528,0.00089576864,0.00069714914,0.00036402527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001718073,0.0007696647,0.0009415775,0.0075060115,0.0018093677,0.0016310542,0.0010000442,0.0013166787,0.0016577739],"category_scores_gemma":[0.012988163,0.000575982,0.0008401169,0.005214288,0.0010401035,0.004297388,0.0018031449,0.000697792,0.00076155365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090381806,0.0008786151,0.4426208,0.0015312823,0.0015894007,0.003464968,0.01177509,0.04789914,0.013039029,0.043397337,0.013762937,0.4191376],"study_design_scores_gemma":[0.00013799725,0.00059331034,0.17741959,0.00041479344,0.0009708704,0.005800587,0.01427192,0.583556,0.013343684,0.1534901,0.04977114,0.00023000671],"about_ca_topic_score_codex":0.0023201783,"about_ca_topic_score_gemma":0.003331754,"teacher_disagreement_score":0.0075060115,"about_ca_system_score_codex":0.0005291374,"about_ca_system_score_gemma":0.00041737367,"threshold_uncertainty_score":0.009086132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5664118,0.00672678,0.3609331,0.006836903,0.00046000333,0.0003268403,0.01585864,0.0019453829,0.04050052],"genre_scores_gemma":[0.92325944,0.0018403267,0.05960416,0.000265343,0.0002130341,0.00020117391,0.007917189,0.00022902175,0.00647014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9974854,0.00058038963,0.000098019606,0.00035307795,0.0012020848,0.00028113302],"domain_scores_gemma":[0.98769635,0.0069992444,0.0013393211,0.001351241,0.002032941,0.0005808551],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0021134666,0.00057164603,0.00064324745,0.009685114,0.0018104177,0.0019532226,0.00097098714,0.00093357445,0.0043147267],"category_scores_gemma":[0.018679617,0.00022434299,0.00064394117,0.011934563,0.001051358,0.003575298,0.0012361882,0.00087683054,0.00082574243],"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.00039332383,0.00039446427,0.05511972,0.0006199637,0.00041991606,0.00095618854,0.001643345,0.11490048,0.0039810413,0.49330622,0.05902479,0.26924056],"study_design_scores_gemma":[0.000052850683,0.000089663146,0.027627481,0.00011611299,0.00013195563,0.0010629212,0.0009004821,0.48179606,0.0049553025,0.42545336,0.057740055,0.00007377459],"about_ca_topic_score_codex":0.004146787,"about_ca_topic_score_gemma":0.0031927924,"teacher_disagreement_score":0.9903149,"about_ca_system_score_codex":0.0018542169,"about_ca_system_score_gemma":0.0010118141,"threshold_uncertainty_score":0.014434159},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07218492,0.0005037914,0.9185221,0.00019557402,0.000048707905,0.00011639122,0.0016486475,0.0016585629,0.0051212846],"genre_scores_gemma":[0.6184285,0.00071420264,0.3736407,0.000120004785,0.000065705295,0.000291745,0.001957308,0.0007233472,0.0040583527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994578,0.00013453662,0.00004571449,0.00014571924,0.00016793277,0.000048291815],"domain_scores_gemma":[0.9972983,0.0012952061,0.00051636144,0.0003750463,0.00037184957,0.00014329983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008142239,0.00061285566,0.00045715424,0.0025094098,0.00038443002,0.001343433,0.00075379194,0.0006261811,0.00513033],"category_scores_gemma":[0.008371878,0.0003784562,0.00057411846,0.002262258,0.0010578991,0.0026317164,0.00068419974,0.00084519706,0.0011268879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033923407,0.00013510544,0.017572012,0.0008477528,0.00013378788,0.00071691273,0.0009079028,0.10324967,0.057680916,0.5376739,0.009342541,0.27140033],"study_design_scores_gemma":[0.000031503205,0.00014511403,0.012166424,0.00014152932,0.00005627022,0.0015388691,0.00031199062,0.5611868,0.028337196,0.3789447,0.01700051,0.00013910473],"about_ca_topic_score_codex":0.0013326196,"about_ca_topic_score_gemma":0.0019847779,"teacher_disagreement_score":0.00513033,"about_ca_system_score_codex":0.0005796178,"about_ca_system_score_gemma":0.0005742235,"threshold_uncertainty_score":0.017162621},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046027295,0.00029655296,0.94838655,0.00009819099,0.000045398916,0.00023089578,0.00019116429,0.0009805235,0.0037433666],"genre_scores_gemma":[0.32833096,0.00015275378,0.6673301,0.000092260925,0.000053957672,0.0003876943,0.00080181035,0.00026573692,0.002584677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624205,0.001029709,0.00025807248,0.00077589764,0.0014491397,0.00024522052],"domain_scores_gemma":[0.9953869,0.0013921842,0.00053192215,0.0006123835,0.0019454752,0.00013114717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003017774,0.0009578345,0.00095655955,0.0054048332,0.0010323175,0.0016504029,0.0015670052,0.0012381745,0.0027739108],"category_scores_gemma":[0.011053933,0.0003337866,0.0009821263,0.004687966,0.0009916107,0.0024347433,0.0023743832,0.00083529,0.00074446836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041577913,0.0003132673,0.010029163,0.00060721854,0.00031486942,0.0002654513,0.0008675553,0.1905469,0.024722088,0.04637501,0.0053752502,0.72016734],"study_design_scores_gemma":[0.00004925201,0.00014199581,0.0040270095,0.00003058914,0.0000666803,0.00019814102,0.00013629504,0.9616096,0.012917626,0.016465066,0.004290406,0.00006741891],"about_ca_topic_score_codex":0.0038339312,"about_ca_topic_score_gemma":0.0031728381,"teacher_disagreement_score":0.0054048332,"about_ca_system_score_codex":0.0013145249,"about_ca_system_score_gemma":0.001267839,"threshold_uncertainty_score":0.01595968},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020042686,0.00018147068,0.97559094,0.0004333365,0.000081263264,0.00018760849,0.0008144609,0.0007314998,0.0019368383],"genre_scores_gemma":[0.38790452,0.00041832004,0.5988063,0.0002988115,0.00019333148,0.0007930039,0.004634547,0.00042726833,0.00652384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978604,0.0008539054,0.000086164764,0.00056428724,0.00051660714,0.00011864334],"domain_scores_gemma":[0.9883696,0.007430363,0.00070209044,0.0019437358,0.0012098252,0.00034434831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033267082,0.0008003459,0.0006133748,0.0026144225,0.0010464056,0.0011165933,0.00221917,0.0012134966,0.003183564],"category_scores_gemma":[0.021129064,0.0005116184,0.001344176,0.0017756739,0.0011001916,0.0028485914,0.0026935032,0.0013530627,0.0007967656],"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.0002584087,0.0001921237,0.0069636297,0.00035383677,0.0001750729,0.0005749574,0.00082165777,0.4743436,0.0036957203,0.3187953,0.016268453,0.17755736],"study_design_scores_gemma":[0.000032689528,0.000024368319,0.00025643467,0.000027542177,0.000016446718,0.00012417033,0.000075105396,0.77728724,0.001380437,0.21429937,0.006461875,0.0000143072375],"about_ca_topic_score_codex":0.002423112,"about_ca_topic_score_gemma":0.0034471538,"teacher_disagreement_score":0.0033267082,"about_ca_system_score_codex":0.0012801053,"about_ca_system_score_gemma":0.0011794408,"threshold_uncertainty_score":0.017593563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8839509,0.0010049512,0.10328919,0.0006443473,0.000012453268,0.00004970971,0.0005449866,0.00015537656,0.010348125],"genre_scores_gemma":[0.9941374,0.00029197172,0.004956781,0.000052631978,0.000026034275,0.000034181325,0.00014264049,0.000011398768,0.00034704557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994306,0.0001431446,0.000031366584,0.00016430086,0.00013561308,0.000095051786],"domain_scores_gemma":[0.99186593,0.005059359,0.0017223555,0.00046929804,0.00040232769,0.00048060127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092683156,0.00039943692,0.00068419776,0.003377423,0.00091638963,0.0018548374,0.00043464458,0.0010161472,0.0012316199],"category_scores_gemma":[0.009126878,0.00041293565,0.0003497909,0.0013863095,0.0019504349,0.0031814566,0.0011333223,0.00059875235,0.000144546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033837178,0.00010499458,0.02350082,0.0003526468,0.00020723505,0.0010002885,0.0012881116,0.13516891,0.02831382,0.76437587,0.0024811127,0.042867824],"study_design_scores_gemma":[0.00003603897,0.00006944309,0.010466223,0.00004965402,0.000046052675,0.0006197877,0.00018519464,0.18373813,0.0034348348,0.79962987,0.0016766922,0.000048062437],"about_ca_topic_score_codex":0.00048394452,"about_ca_topic_score_gemma":0.00058914395,"teacher_disagreement_score":0.003377423,"about_ca_system_score_codex":0.0008676924,"about_ca_system_score_gemma":0.0002840986,"threshold_uncertainty_score":0.0062956214},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027201956,0.00018586317,0.9948494,0.000111930196,0.000049473056,0.000056821842,0.000086012325,0.00085685746,0.0010835148],"genre_scores_gemma":[0.09560104,0.00047300613,0.8984616,0.00019924418,0.00012213028,0.00031643218,0.0007623329,0.00053914037,0.0035249998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990238,0.00023859061,0.000048562015,0.00026087882,0.00035898283,0.00006925487],"domain_scores_gemma":[0.99848795,0.00035673977,0.00017689935,0.0001943686,0.00067358185,0.00011047088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012049174,0.0012402713,0.0011495579,0.003439679,0.0015270486,0.0014188428,0.0022301048,0.0013320284,0.002938353],"category_scores_gemma":[0.0046291314,0.0005150972,0.001165807,0.0030549474,0.0011397847,0.002481828,0.0016621099,0.0014785976,0.001823263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002093662,0.00014018257,0.003535836,0.0005592227,0.00028137778,0.0002344589,0.000807457,0.3522373,0.020589074,0.09373349,0.030538429,0.49713385],"study_design_scores_gemma":[0.000022069671,0.000029182911,0.00043532555,0.000023535762,0.000018676028,0.0001428131,0.00008043748,0.96077,0.0039285896,0.02638794,0.008110865,0.000050606275],"about_ca_topic_score_codex":0.0067322426,"about_ca_topic_score_gemma":0.007600185,"teacher_disagreement_score":0.0067322426,"about_ca_system_score_codex":0.0010941322,"about_ca_system_score_gemma":0.002073655,"threshold_uncertainty_score":0.01338613},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2039991,0.002526805,0.7839142,0.002072474,0.000111738955,0.00040265234,0.0009582167,0.0011932914,0.0048214872],"genre_scores_gemma":[0.698711,0.00086407893,0.29708177,0.00019339772,0.00017578962,0.00024909276,0.0010229461,0.000077483455,0.0016243717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789435,0.0008896322,0.00017623934,0.00049210043,0.0004621006,0.00008547594],"domain_scores_gemma":[0.9893339,0.007813127,0.0008197216,0.0009894578,0.00078810356,0.00025578876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024789376,0.0007837651,0.0011526544,0.004264635,0.00145756,0.0017729796,0.0017898575,0.0013551919,0.0014761483],"category_scores_gemma":[0.017699378,0.0005580495,0.001002821,0.004722155,0.00068281975,0.0032028533,0.0016041916,0.0010881568,0.00050555536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040963196,0.0014231027,0.10886731,0.0006388413,0.0007795516,0.0017112412,0.0022638503,0.26118204,0.00491077,0.053164154,0.010830789,0.5538187],"study_design_scores_gemma":[0.000017386827,0.000045011457,0.006106963,0.000029944345,0.000050283157,0.00028065252,0.00024323082,0.9547038,0.0011196174,0.034001935,0.0033797831,0.000021379004],"about_ca_topic_score_codex":0.0031902986,"about_ca_topic_score_gemma":0.005029569,"teacher_disagreement_score":0.004264635,"about_ca_system_score_codex":0.00060765183,"about_ca_system_score_gemma":0.00058101385,"threshold_uncertainty_score":0.013110042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1347973,0.00013485888,0.8630987,0.00028906277,0.000021666769,0.000030204596,0.00007409176,0.00013088273,0.0014232926],"genre_scores_gemma":[0.95433384,0.00018717226,0.043492842,0.00005902029,0.000020376801,0.000039768358,0.0000805799,0.000025077068,0.0017612705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955434,0.00012944372,0.000013270606,0.00014371058,0.00009975257,0.000059544822],"domain_scores_gemma":[0.9979519,0.001401236,0.00026413662,0.00015520182,0.0001623699,0.00006523229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009894586,0.0004324511,0.0005154384,0.00058100134,0.00032974285,0.0006469955,0.0011476732,0.0008359171,0.00055421307],"category_scores_gemma":[0.006077113,0.0002959904,0.00041169755,0.000530459,0.0009803846,0.0014584534,0.00057715253,0.00075519114,0.0001374499],"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.000058277776,0.00002575141,0.0013239052,0.000034691002,0.000023328581,0.0001274647,0.00007723821,0.9139671,0.0055928403,0.06578118,0.00030092,0.012687402],"study_design_scores_gemma":[0.0000020892892,0.000006758647,0.00012856413,0.0000014717828,0.0000022997617,0.000014787774,0.0000041226617,0.994412,0.00038684564,0.0049418826,0.000095839634,0.0000033297365],"about_ca_topic_score_codex":0.0054247407,"about_ca_topic_score_gemma":0.0036683502,"teacher_disagreement_score":0.0054247407,"about_ca_system_score_codex":0.0013068719,"about_ca_system_score_gemma":0.00067581004,"threshold_uncertainty_score":0.010786355},"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":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3926578,0.002660635,0.0058706207,0.0023220968,0.00042481194,0.0001521249,0.58450496,0.00309315,0.008313813],"genre_scores_gemma":[0.20990048,0.0005067359,0.0073708156,0.00034110853,0.00019233377,0.00019170328,0.77558035,0.00018692632,0.0057295403],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979074,0.0006522848,0.00018161294,0.00046788884,0.0005632686,0.00022752488],"domain_scores_gemma":[0.99531186,0.0021169493,0.00038330894,0.0009857111,0.0007952335,0.0004068952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018798985,0.0009394071,0.0010923856,0.0048004785,0.00096975564,0.0013067318,0.0011966635,0.0028908933,0.006136117],"category_scores_gemma":[0.012028576,0.00031376656,0.00081670226,0.004313543,0.00040666224,0.0018021814,0.0010908673,0.0011657381,0.0053217984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015732368,0.0012675095,0.109197594,0.0017369501,0.00058496307,0.0011055684,0.00068573246,0.017783375,0.0037223797,0.007966685,0.7703747,0.08400128],"study_design_scores_gemma":[0.0008752126,0.0007527386,0.30606169,0.0005734885,0.0005657643,0.0041531743,0.0018141218,0.14909765,0.011486463,0.019986458,0.50436467,0.00026855804],"about_ca_topic_score_codex":0.005530088,"about_ca_topic_score_gemma":0.013980293,"teacher_disagreement_score":0.006136117,"about_ca_system_score_codex":0.00081662834,"about_ca_system_score_gemma":0.000719378,"threshold_uncertainty_score":0.020527363},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9523336,0.0005276071,0.0014654496,0.00068333524,0.000039327984,0.000059099024,0.037598874,0.000096373384,0.007196396],"genre_scores_gemma":[0.9360564,0.00040329693,0.0020828873,0.00006951722,0.000038132675,0.00006895828,0.05964838,0.000014247822,0.0016181153],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996941,0.000092518574,0.000022662753,0.00006217596,0.00007134121,0.000057234738],"domain_scores_gemma":[0.9988257,0.0004891749,0.00028021733,0.000103892526,0.00017286853,0.00012814438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004744326,0.0003250724,0.0002718258,0.0022173063,0.00050633564,0.0007378426,0.00043667786,0.00041647343,0.0020629987],"category_scores_gemma":[0.0024287838,0.00012173989,0.0002636867,0.0025378184,0.00022572475,0.0010837534,0.0008571816,0.00046858372,0.00074222207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037554905,0.00027482962,0.8654434,0.00039648262,0.0002895806,0.0008958294,0.0037403733,0.014193674,0.0018965171,0.0069478373,0.05846391,0.047081884],"study_design_scores_gemma":[0.000038694794,0.00012290533,0.81923306,0.00014480241,0.00013043375,0.00072245253,0.013005393,0.09106544,0.0016278817,0.004700024,0.06916299,0.000045970493],"about_ca_topic_score_codex":0.03628112,"about_ca_topic_score_gemma":0.055420317,"teacher_disagreement_score":0.03628112,"about_ca_system_score_codex":0.0006814818,"about_ca_system_score_gemma":0.00045367866,"threshold_uncertainty_score":0.07213986},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025258081,0.00013268295,0.9728684,0.00034163997,0.000029342807,0.0000734798,0.00019390759,0.0005943242,0.0005081894],"genre_scores_gemma":[0.62905395,0.00033311566,0.36517367,0.00027880294,0.00015714839,0.0005794599,0.0016966331,0.000269131,0.0024581216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998489,0.00097245496,0.000045244346,0.00023744963,0.00016747873,0.000088386994],"domain_scores_gemma":[0.9898233,0.008519899,0.00053770904,0.00043562517,0.00049091823,0.00019262843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040291566,0.0012267078,0.0014189774,0.002764718,0.0008565554,0.0011880214,0.0017490974,0.001572692,0.0018619479],"category_scores_gemma":[0.011366701,0.00088116486,0.0015773681,0.0014009258,0.0009120618,0.0017667548,0.0011615116,0.0020835735,0.00079149194],"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.00007262803,0.00008007816,0.001656658,0.000036359943,0.00007596949,0.000087223554,0.00006649269,0.9554262,0.00043729244,0.010401465,0.0015517474,0.0301078],"study_design_scores_gemma":[0.000004507025,0.0000058416026,0.00004468858,0.0000013833101,0.0000021979693,0.000005215601,0.000002509475,0.9952453,0.00005827406,0.0045493697,0.000079135956,0.0000015801634],"about_ca_topic_score_codex":0.0037621881,"about_ca_topic_score_gemma":0.0044301967,"teacher_disagreement_score":0.0040291566,"about_ca_system_score_codex":0.0011503285,"about_ca_system_score_gemma":0.0008900588,"threshold_uncertainty_score":0.021308482},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85317606,0.00041348056,0.13937126,0.0002963863,0.000022506494,0.0004547354,0.00056049874,0.0003589303,0.005346057],"genre_scores_gemma":[0.9402794,0.00009201951,0.05815815,0.000031060303,0.00001810802,0.00019885428,0.00047266576,0.000026162956,0.0007234403],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972379,0.0010408068,0.00021859357,0.00066123833,0.0006026988,0.00023866523],"domain_scores_gemma":[0.98453623,0.0074397596,0.0031000995,0.0020031747,0.0021678288,0.00075288606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024505204,0.00038243295,0.0006664961,0.0068155252,0.0019124082,0.0025038908,0.0008690076,0.0011515887,0.0011559086],"category_scores_gemma":[0.016003583,0.00032332796,0.0005088887,0.003259985,0.0012578886,0.0040546423,0.002863724,0.0005987721,0.00044958087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012255259,0.0005682087,0.4735283,0.0008165593,0.0002851672,0.00086020044,0.03917715,0.010941881,0.029021973,0.06099982,0.0035989804,0.3789762],"study_design_scores_gemma":[0.00014236874,0.0006993431,0.2715504,0.00042396173,0.00039694327,0.002271289,0.06272103,0.2723437,0.025520233,0.32564208,0.03801942,0.0002692061],"about_ca_topic_score_codex":0.0035649845,"about_ca_topic_score_gemma":0.0034729044,"teacher_disagreement_score":0.0068155252,"about_ca_system_score_codex":0.0007510229,"about_ca_system_score_gemma":0.0007280188,"threshold_uncertainty_score":0.012959778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027138812,0.0006890763,0.9577893,0.0006897696,0.00011075066,0.00068058836,0.0065841693,0.0040125865,0.0023048953],"genre_scores_gemma":[0.18028042,0.0004506339,0.80668646,0.00018377235,0.000079218196,0.0009831843,0.009483827,0.00017365185,0.0016788415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983169,0.00058573385,0.00015091781,0.00045641582,0.00038820773,0.00010193172],"domain_scores_gemma":[0.9971667,0.0013624829,0.00042276096,0.00056023867,0.00034918849,0.00013865095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002356059,0.0013772211,0.0009881251,0.004483985,0.0011086974,0.0012681772,0.0022690315,0.001291492,0.001945092],"category_scores_gemma":[0.010784252,0.00051606883,0.0018090766,0.0034231711,0.0005775509,0.0026260754,0.001848067,0.001480112,0.0015040068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000418084,0.00086544704,0.04188113,0.0018641707,0.0006721352,0.0008937972,0.0021253633,0.12292549,0.0133138355,0.09144165,0.05334449,0.6702544],"study_design_scores_gemma":[0.000044740493,0.00009258085,0.0042939303,0.00008267792,0.00006634216,0.00044361994,0.00045963298,0.9086044,0.0034461676,0.06366224,0.018772166,0.000031564876],"about_ca_topic_score_codex":0.0031324094,"about_ca_topic_score_gemma":0.006800353,"teacher_disagreement_score":0.004483985,"about_ca_system_score_codex":0.00074966147,"about_ca_system_score_gemma":0.0012194837,"threshold_uncertainty_score":0.012460172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03744857,0.0009719841,0.95802766,0.000576935,0.000054075255,0.00014177807,0.0002743825,0.00043664596,0.0020680104],"genre_scores_gemma":[0.80573046,0.002275256,0.1849836,0.0002758504,0.0003524799,0.00039701292,0.0007196046,0.00016464242,0.005101058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797386,0.0008275264,0.00009307435,0.0004918796,0.00046168637,0.00015202862],"domain_scores_gemma":[0.9881914,0.009283764,0.0011049442,0.000491566,0.0007448792,0.00018339689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032085776,0.0010746077,0.0010667971,0.0034446502,0.0011419207,0.0021319664,0.0016003342,0.0017331046,0.001364657],"category_scores_gemma":[0.017231008,0.0010956128,0.0009560985,0.0024345429,0.0013772217,0.004272888,0.0016249035,0.0011847955,0.00043271726],"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.00021501737,0.00009469317,0.008990731,0.0004333697,0.00025001372,0.0004260171,0.0008129492,0.7887661,0.004792464,0.09140483,0.0039083594,0.099905506],"study_design_scores_gemma":[0.000013603026,0.000021291084,0.0010774856,0.000018655903,0.000031910626,0.00006299617,0.00006521244,0.95913804,0.0009072975,0.036971793,0.0016710664,0.000020728296],"about_ca_topic_score_codex":0.008540615,"about_ca_topic_score_gemma":0.007508872,"teacher_disagreement_score":0.008540615,"about_ca_system_score_codex":0.0022940757,"about_ca_system_score_gemma":0.00071113446,"threshold_uncertainty_score":0.01698184},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077269943,0.0003029821,0.9888526,0.00014505403,0.000023509241,0.00007071243,0.000112970556,0.0007072029,0.0020579267],"genre_scores_gemma":[0.15195692,0.00052011706,0.84307855,0.00016610534,0.00009076052,0.0003723847,0.0007143802,0.0004427662,0.0026579895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992176,0.00034301192,0.000034558154,0.00012880753,0.00015798725,0.000118064905],"domain_scores_gemma":[0.99644935,0.0025534667,0.0002464392,0.00034553593,0.0003081207,0.0000970742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012832535,0.0013906903,0.0011593899,0.0014623752,0.00074223086,0.0011324945,0.0014893068,0.0010118362,0.0063006347],"category_scores_gemma":[0.0052999537,0.0007604234,0.00085654476,0.0023820954,0.0009642077,0.0019476291,0.0015337777,0.001496414,0.0017506076],"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.00015726897,0.00013848355,0.0006927705,0.00021716097,0.00005261524,0.00007764364,0.00015406376,0.72545296,0.0029649297,0.048480283,0.009319144,0.21229266],"study_design_scores_gemma":[0.0000307919,0.000021310832,0.00008016558,0.000009046977,0.00000891939,0.0000285777,0.000015536702,0.96460897,0.0009183839,0.03326184,0.0010082608,0.000008160863],"about_ca_topic_score_codex":0.0027006008,"about_ca_topic_score_gemma":0.0042995126,"teacher_disagreement_score":0.0063006347,"about_ca_system_score_codex":0.0010509564,"about_ca_system_score_gemma":0.0011360028,"threshold_uncertainty_score":0.021077693},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5030083,0.00056401954,0.48589987,0.00040106985,0.000024056444,0.000063371765,0.00017756577,0.000126255,0.009735512],"genre_scores_gemma":[0.97965413,0.0003532886,0.017209096,0.000047633686,0.000017331276,0.000058378544,0.00011338723,0.00002471196,0.002522065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999728,0.00009146037,0.0000127897065,0.00007020305,0.000067500485,0.000030095754],"domain_scores_gemma":[0.9984675,0.00067398924,0.00036684354,0.000103784376,0.00024237952,0.00014546356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052818557,0.00022320343,0.00029843292,0.0011098714,0.00049102306,0.0007482108,0.00081512204,0.0005343655,0.0012106143],"category_scores_gemma":[0.003250099,0.00018477981,0.00033041692,0.0007595808,0.00068270747,0.0020271007,0.00047022477,0.0003944906,0.00017968759],"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.00009216223,0.000060444407,0.0076334635,0.00012654711,0.00008927968,0.0008797336,0.0005556509,0.6912831,0.0155430725,0.2579082,0.0014842298,0.024344038],"study_design_scores_gemma":[0.00000666265,0.000021498172,0.001072512,0.000005246328,0.000014244578,0.00018973798,0.000061252926,0.95631456,0.00049859134,0.041045893,0.0007562797,0.0000134696575],"about_ca_topic_score_codex":0.0021797535,"about_ca_topic_score_gemma":0.0012761421,"teacher_disagreement_score":0.0021797535,"about_ca_system_score_codex":0.0006357939,"about_ca_system_score_gemma":0.00023718255,"threshold_uncertainty_score":0.0046129823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10428361,0.00090261124,0.8895975,0.0014556742,0.00006260185,0.00012082242,0.00039394802,0.0004967788,0.0026863897],"genre_scores_gemma":[0.86975086,0.00066228415,0.12646817,0.0004072144,0.00023920187,0.0002511892,0.00077489135,0.00007983869,0.0013663344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994423,0.0027171986,0.00019228584,0.0012990483,0.000934413,0.00043414577],"domain_scores_gemma":[0.92899215,0.057445,0.0060944655,0.003855814,0.0024774666,0.001135033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064840564,0.00078227645,0.0014207879,0.002643181,0.001176706,0.0018113194,0.0026789466,0.0019899749,0.0013510893],"category_scores_gemma":[0.054842833,0.0007659072,0.00079757045,0.0019095306,0.003390352,0.005139097,0.0030462719,0.0018957035,0.0003294789],"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.0005889455,0.0002090058,0.023614889,0.00064101466,0.00030870974,0.0008521611,0.0007685284,0.49268377,0.0075207585,0.38562918,0.006753321,0.08042971],"study_design_scores_gemma":[0.0000392758,0.00004224179,0.0013408057,0.000030003952,0.000019879344,0.00017320209,0.000065334716,0.78259736,0.0010465389,0.213548,0.0010783746,0.000018940858],"about_ca_topic_score_codex":0.0025801507,"about_ca_topic_score_gemma":0.002148663,"teacher_disagreement_score":0.0064840564,"about_ca_system_score_codex":0.0016982445,"about_ca_system_score_gemma":0.00084056094,"threshold_uncertainty_score":0.034291387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75791806,0.00228273,0.22845027,0.0005315865,0.00013111805,0.00016751344,0.0054368023,0.0017533484,0.0033285986],"genre_scores_gemma":[0.93441826,0.00079311617,0.055223797,0.000070791815,0.00008593973,0.00009476353,0.0069328626,0.00019955193,0.0021808543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992742,0.00009931442,0.000046578152,0.00029027928,0.00021637883,0.000073341835],"domain_scores_gemma":[0.9952872,0.0026392634,0.00058913237,0.00046210893,0.0007662587,0.0002561019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005569843,0.00079587096,0.00063673686,0.008740086,0.00073578034,0.0012145079,0.001241555,0.0009539029,0.0014535632],"category_scores_gemma":[0.008579546,0.0003874582,0.0009052818,0.0054603103,0.00033849792,0.0018991459,0.00057101273,0.00082806655,0.0005447262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007214209,0.00063630816,0.276345,0.0010836676,0.00082397193,0.0024153288,0.000950865,0.11350705,0.023529798,0.015545022,0.01871102,0.5457306],"study_design_scores_gemma":[0.00002543684,0.00009787309,0.06675048,0.000079834244,0.00042889765,0.0014410401,0.0004616342,0.8904584,0.0066425833,0.024929099,0.008648448,0.000036314967],"about_ca_topic_score_codex":0.010027279,"about_ca_topic_score_gemma":0.015592119,"teacher_disagreement_score":0.010027279,"about_ca_system_score_codex":0.0005599556,"about_ca_system_score_gemma":0.0005618243,"threshold_uncertainty_score":0.019937873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7546957,0.0008220375,0.22654633,0.004233808,0.00017750211,0.0006108958,0.0012852579,0.00045085198,0.0111776795],"genre_scores_gemma":[0.9456575,0.00016704273,0.053244337,0.000092685375,0.00005953763,0.00020822416,0.00025321948,0.000040855393,0.00027668948],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.97922164,0.017448222,0.0008357206,0.0010251945,0.0011304528,0.00033883052],"domain_scores_gemma":[0.6614121,0.3211401,0.0066580405,0.0064829574,0.003370333,0.00093642995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.029567966,0.0012830715,0.00077435945,0.006312498,0.0017328754,0.0027068704,0.0015304491,0.0017708298,0.002560972],"category_scores_gemma":[0.13760723,0.0005596448,0.0014967389,0.0038646923,0.0021342968,0.006198733,0.002283319,0.0020085406,0.00023216406],"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.0014499616,0.0006785956,0.404145,0.0015214578,0.0015494727,0.0012402451,0.02191018,0.3349886,0.0028674926,0.0662937,0.0034307807,0.1599246],"study_design_scores_gemma":[0.000052188556,0.00025608172,0.03817548,0.00029002727,0.00023289504,0.00030398395,0.006946493,0.90636915,0.0006562504,0.043576647,0.003046525,0.00009431886],"about_ca_topic_score_codex":0.010068411,"about_ca_topic_score_gemma":0.012551531,"teacher_disagreement_score":0.029567966,"about_ca_system_score_codex":0.0013789823,"about_ca_system_score_gemma":0.0021515407,"threshold_uncertainty_score":0.15637225},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15604456,0.00035850453,0.7445896,0.0051036933,0.00029834776,0.0003015245,0.00043736462,0.00043584395,0.092430495],"genre_scores_gemma":[0.88160425,0.00032461007,0.09462499,0.0006767069,0.00014709392,0.00024327503,0.00013982879,0.00020528563,0.02203386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99648273,0.0014668683,0.00019347241,0.0007887405,0.00064507534,0.00042308503],"domain_scores_gemma":[0.98533463,0.009836271,0.0010397915,0.0016977506,0.00080291415,0.0012885687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043129693,0.00073813734,0.0015751392,0.00094616786,0.0020921354,0.0062621706,0.0028225994,0.0031184487,0.010333281],"category_scores_gemma":[0.023726912,0.00080046564,0.0009530934,0.0006719394,0.00432729,0.0070642736,0.0022354692,0.0039672717,0.0011652963],"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.0001305206,0.0000446354,0.0007384974,0.00005721316,0.000040728642,0.00013233625,0.00026741961,0.00821627,0.001519408,0.97420204,0.0031348018,0.011516097],"study_design_scores_gemma":[0.000041341023,0.000026170213,0.00022309883,0.000012871894,0.000021304497,0.0001258751,0.0000837105,0.060198266,0.0004604572,0.9365501,0.002233361,0.000023467353],"about_ca_topic_score_codex":0.002417127,"about_ca_topic_score_gemma":0.0029654938,"teacher_disagreement_score":0.010333281,"about_ca_system_score_codex":0.0011052723,"about_ca_system_score_gemma":0.0019840496,"threshold_uncertainty_score":0.03456825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18880469,0.0002886453,0.8068557,0.0010210202,0.00018220385,0.00010491464,0.00027899994,0.0008699808,0.0015938662],"genre_scores_gemma":[0.83468455,0.00031086642,0.15906022,0.0003892946,0.0002338594,0.00030506295,0.0006090823,0.0005464243,0.0038607304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9863492,0.0105384495,0.00027764888,0.0018764829,0.00054630166,0.0004119924],"domain_scores_gemma":[0.83583426,0.13686384,0.0061438475,0.016627327,0.0031016823,0.0014290316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04141678,0.0013835871,0.0013459123,0.0014029044,0.0015739092,0.0019316202,0.0051486744,0.002123461,0.0047515836],"category_scores_gemma":[0.1728727,0.00088144233,0.0021221582,0.0023306855,0.0018301569,0.0066165025,0.001974694,0.0034953887,0.0006396201],"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.0014614715,0.00082549447,0.10714161,0.00048190542,0.0031305403,0.0008048776,0.0014995434,0.4607938,0.0033643688,0.24614185,0.007173673,0.16718097],"study_design_scores_gemma":[0.0001386636,0.00014283923,0.011567175,0.000043615797,0.0006060356,0.00015029758,0.00019250726,0.8155409,0.0011007743,0.16808116,0.0023782053,0.00005773946],"about_ca_topic_score_codex":0.011707799,"about_ca_topic_score_gemma":0.0152710145,"teacher_disagreement_score":0.04141678,"about_ca_system_score_codex":0.0014042725,"about_ca_system_score_gemma":0.002573256,"threshold_uncertainty_score":0.2190355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006855175,0.00013772747,0.99127454,0.0002276293,0.000028096445,0.000057684585,0.00004426764,0.00016295524,0.0012118869],"genre_scores_gemma":[0.27994052,0.00034283506,0.7134056,0.00026170327,0.00019614058,0.00046629898,0.00056296086,0.00020752168,0.0046163583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989146,0.0005037885,0.000048715712,0.00024732822,0.00019126375,0.000094362156],"domain_scores_gemma":[0.9942432,0.004593893,0.00029472413,0.0002939261,0.00040651573,0.00016766886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019622012,0.0015052954,0.0022185103,0.0017674883,0.00081911293,0.0016513679,0.0020977277,0.001968181,0.0035354812],"category_scores_gemma":[0.009104242,0.00068646384,0.00092403294,0.0021020512,0.001120918,0.0031419487,0.0018916875,0.0023034918,0.0005048234],"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.00009685555,0.00018203454,0.00053525175,0.00013685734,0.00005395308,0.000051431743,0.00008585297,0.8631552,0.0008198224,0.049121633,0.00407958,0.081681564],"study_design_scores_gemma":[0.000024606661,0.000026862888,0.000032988737,0.0000045688225,0.000007010905,0.00000827475,0.00000880437,0.9769843,0.000113463204,0.022550678,0.00023428742,0.000004127225],"about_ca_topic_score_codex":0.0040394855,"about_ca_topic_score_gemma":0.005865119,"teacher_disagreement_score":0.0040394855,"about_ca_system_score_codex":0.0009837174,"about_ca_system_score_gemma":0.0018408587,"threshold_uncertainty_score":0.01182735},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06253617,0.0009297211,0.9164419,0.00214903,0.00018069221,0.00006638742,0.00017542022,0.00040115314,0.017119423],"genre_scores_gemma":[0.8845695,0.0016070032,0.10225409,0.0006235406,0.0002467787,0.00016571619,0.00017061272,0.000060743172,0.010302058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996333,0.00011413,0.0000135922155,0.00006902406,0.00011376639,0.00005618278],"domain_scores_gemma":[0.99873835,0.000524568,0.00020783217,0.0002649227,0.00013268583,0.00013168919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066337327,0.00033496,0.0003224199,0.00068148406,0.0006496889,0.0012782753,0.0014095609,0.0011657058,0.0022254845],"category_scores_gemma":[0.00409793,0.0002677852,0.0003870259,0.00091097865,0.0013356279,0.0027320175,0.0012200257,0.0010226278,0.0005766112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002805567,0.00003397755,0.0016458607,0.00009576979,0.000034719444,0.00037852683,0.0002582221,0.06391582,0.0056977607,0.89609146,0.004373786,0.027446026],"study_design_scores_gemma":[0.000029299585,0.000047350826,0.00084869383,0.000032399286,0.000040911487,0.00050696434,0.000059102633,0.27453268,0.001601028,0.70768726,0.014586949,0.000027317043],"about_ca_topic_score_codex":0.000960464,"about_ca_topic_score_gemma":0.000977458,"teacher_disagreement_score":0.0022254845,"about_ca_system_score_codex":0.00048615158,"about_ca_system_score_gemma":0.00058041885,"threshold_uncertainty_score":0.0074449778},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077927983,0.00020557994,0.9881103,0.00018907836,0.000034403594,0.00005418529,0.00016958268,0.0028036383,0.0006404165],"genre_scores_gemma":[0.102605514,0.000120572724,0.8958035,0.000046454345,0.000029327683,0.00011282577,0.0004108172,0.00026125525,0.0006096667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591774,0.0018127072,0.0002610749,0.00093735475,0.00087636104,0.00019469758],"domain_scores_gemma":[0.99240416,0.0042195814,0.0008929209,0.0011251294,0.0011182809,0.00023978953],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.004122858,0.0012102909,0.001219439,0.007804065,0.0015008522,0.003537301,0.00182411,0.0016663847,0.0033842465],"category_scores_gemma":[0.020220805,0.00061914045,0.0010232393,0.0049395645,0.0012243545,0.0028219607,0.0029395728,0.0013335585,0.001579852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004003811,0.00015821093,0.0070633,0.0004268458,0.00019790932,0.0002694798,0.0011275631,0.16221055,0.013322717,0.085927285,0.014544888,0.7143508],"study_design_scores_gemma":[0.000033561006,0.000022978495,0.0010237716,0.000043089854,0.000023824477,0.00014278377,0.00020140522,0.90848017,0.0090362355,0.0704896,0.010465185,0.000037389626],"about_ca_topic_score_codex":0.0035324388,"about_ca_topic_score_gemma":0.0033637644,"teacher_disagreement_score":0.99219596,"about_ca_system_score_codex":0.0015624819,"about_ca_system_score_gemma":0.002293062,"threshold_uncertainty_score":0.021803975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08760986,0.0008229525,0.906629,0.0010712745,0.00006806363,0.00019515488,0.00011930215,0.00048424813,0.0030000082],"genre_scores_gemma":[0.8981737,0.00046910145,0.10016664,0.00017352717,0.0000459006,0.00013275865,0.0001488045,0.000053782973,0.0006358332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928867,0.004132004,0.0002529252,0.0010261548,0.0013591517,0.00034305718],"domain_scores_gemma":[0.96441877,0.027205978,0.0030296333,0.002774039,0.0019303868,0.0006411299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076190974,0.0010816467,0.0012261232,0.003762528,0.0013543287,0.0031972574,0.0018431514,0.0021112454,0.0009354794],"category_scores_gemma":[0.03878971,0.000646384,0.0010960104,0.0018985766,0.0042621144,0.006177508,0.0030058,0.0022035295,0.00020931133],"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.00014501248,0.00014122893,0.005606767,0.00025794923,0.00020771801,0.000094436145,0.00035339704,0.7853277,0.003362774,0.15682589,0.0014528838,0.046224352],"study_design_scores_gemma":[0.000008897046,0.00003545052,0.00053844234,0.0000128513575,0.000012809229,0.00003162421,0.000044348915,0.93803626,0.0009284681,0.059895705,0.00044090307,0.00001424298],"about_ca_topic_score_codex":0.0038251283,"about_ca_topic_score_gemma":0.0023169806,"teacher_disagreement_score":0.0076190974,"about_ca_system_score_codex":0.0032339166,"about_ca_system_score_gemma":0.0015016763,"threshold_uncertainty_score":0.04029411},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29672796,0.00054537854,0.6932416,0.0013593185,0.0000403019,0.000059148562,0.00015665703,0.00018295582,0.007686664],"genre_scores_gemma":[0.95843124,0.0003669129,0.038930662,0.00008466477,0.000032246102,0.00008615187,0.00014182494,0.00006660248,0.0018598454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995365,0.00019475576,0.000014364257,0.00011379694,0.000071815055,0.00006864055],"domain_scores_gemma":[0.9981146,0.0011030912,0.0002587332,0.00018841831,0.00013239776,0.00020264865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011395959,0.00054440886,0.0006300753,0.0010466998,0.00077065546,0.0017709755,0.0009989048,0.0010543836,0.0020397604],"category_scores_gemma":[0.0071406798,0.0004806648,0.00037053777,0.00051375397,0.0023019526,0.0038670923,0.0015178495,0.00095113495,0.00021262364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006225182,0.00003070453,0.00085821253,0.00005708464,0.000028504468,0.00007020098,0.00019494136,0.4633451,0.0019585101,0.5231303,0.0009886867,0.009275557],"study_design_scores_gemma":[0.000012451001,0.000009069949,0.00022618762,0.000010591403,0.00000498934,0.000016221738,0.000051162224,0.6710849,0.00040365107,0.32763645,0.0005346674,0.000009753703],"about_ca_topic_score_codex":0.0014698755,"about_ca_topic_score_gemma":0.001341268,"teacher_disagreement_score":0.0020397604,"about_ca_system_score_codex":0.0017085366,"about_ca_system_score_gemma":0.0005557966,"threshold_uncertainty_score":0.012396336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64602625,0.00036448875,0.34379122,0.00033635582,0.000026153792,0.0010150538,0.00069066393,0.0004685543,0.00728126],"genre_scores_gemma":[0.88467306,0.0001177712,0.112713076,0.000031398657,0.000029254152,0.00059055723,0.000660021,0.00003665096,0.0011482043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996497,0.0014677206,0.00034714048,0.0008171877,0.0006996246,0.00017135049],"domain_scores_gemma":[0.9818361,0.010890235,0.0029909455,0.002174524,0.0014886236,0.00061971234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026417898,0.00057497167,0.00076698506,0.009137813,0.0023484295,0.0032410105,0.0007812883,0.0008997216,0.002217838],"category_scores_gemma":[0.015723549,0.00037623095,0.00086897856,0.0058327727,0.0018300295,0.0058953427,0.0030109445,0.00070178375,0.0004530542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012029,0.00079413364,0.27608114,0.0014423805,0.0007441872,0.0011759558,0.096501976,0.023796188,0.042925514,0.140613,0.00337195,0.41135064],"study_design_scores_gemma":[0.00013045261,0.000951503,0.1993511,0.00045235263,0.00075632706,0.0015122553,0.07465555,0.32734075,0.021350902,0.33480984,0.03838735,0.00030160078],"about_ca_topic_score_codex":0.0043065897,"about_ca_topic_score_gemma":0.006415765,"teacher_disagreement_score":0.009137813,"about_ca_system_score_codex":0.000914,"about_ca_system_score_gemma":0.00089832785,"threshold_uncertainty_score":0.013971329},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12869626,0.0007554314,0.86518735,0.0012811997,0.00011010216,0.00013374568,0.0002750178,0.0010923226,0.002468615],"genre_scores_gemma":[0.5960913,0.00038994238,0.4005586,0.00024072308,0.00007611612,0.00011350661,0.00058863626,0.00025008738,0.0016910717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869484,0.00055771763,0.00007339002,0.00035377094,0.0002550509,0.000065339584],"domain_scores_gemma":[0.9810414,0.013032648,0.0022099314,0.0020859486,0.0012077462,0.0004223504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031215895,0.0011673849,0.00093822996,0.0033225447,0.0013975918,0.002195041,0.0014089288,0.002194571,0.0026981863],"category_scores_gemma":[0.027542708,0.0006961769,0.0005712354,0.00162277,0.001242512,0.007395666,0.001880789,0.0019192246,0.00046575486],"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.0007369547,0.00024639379,0.021946045,0.00084695785,0.00032843815,0.0008111023,0.0011352841,0.60341865,0.027592806,0.06695105,0.010299977,0.26568636],"study_design_scores_gemma":[0.000051276424,0.00010099705,0.0030587341,0.000065117805,0.00008720176,0.00042760218,0.00029566162,0.9088085,0.009445318,0.070946984,0.0066626538,0.000049986724],"about_ca_topic_score_codex":0.0018012767,"about_ca_topic_score_gemma":0.004300858,"teacher_disagreement_score":0.0033225447,"about_ca_system_score_codex":0.0010164484,"about_ca_system_score_gemma":0.0007644275,"threshold_uncertainty_score":0.016508698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0098621845,0.00035539758,0.9819841,0.00069990836,0.00010226863,0.0001343842,0.00030840337,0.0001957792,0.006357584],"genre_scores_gemma":[0.6980935,0.0033233024,0.26271427,0.00059360743,0.0006660157,0.0011952107,0.0010203319,0.00018479954,0.032209024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991573,0.00027323994,0.000034478842,0.00017579405,0.00028131675,0.00007795035],"domain_scores_gemma":[0.9984693,0.000921792,0.00019154516,0.00007853534,0.00026561017,0.000073143536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014206526,0.0011177746,0.0009074814,0.0022639085,0.000905243,0.0015815776,0.0022141205,0.0022109046,0.004037717],"category_scores_gemma":[0.0052940296,0.00046278746,0.001077346,0.0022616596,0.0010803482,0.0036037369,0.0007801864,0.0014837359,0.0007987801],"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.00005274758,0.0000697934,0.0008626476,0.00013727594,0.000054930562,0.00022136512,0.00020962527,0.6816508,0.0019273582,0.2764295,0.004736962,0.03364691],"study_design_scores_gemma":[0.0000099056415,0.000020229758,0.00013191988,0.000009955541,0.000015703454,0.000043068783,0.000008793923,0.9591201,0.00017361753,0.03793855,0.0025157572,0.000012415645],"about_ca_topic_score_codex":0.009240408,"about_ca_topic_score_gemma":0.0066008097,"teacher_disagreement_score":0.009240408,"about_ca_system_score_codex":0.0016948276,"about_ca_system_score_gemma":0.0011982044,"threshold_uncertainty_score":0.018373251},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6739345,0.0006025301,0.32216093,0.00071681506,0.000031933105,0.00010798504,0.0005713836,0.00046313065,0.0014107907],"genre_scores_gemma":[0.97939897,0.00021707496,0.019533304,0.00003232312,0.000030378082,0.000035183213,0.0003389371,0.00001802231,0.00039579306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991924,0.00033676554,0.000045198816,0.00024247155,0.00011040364,0.0000727536],"domain_scores_gemma":[0.9898947,0.0081731975,0.0009253651,0.00042060224,0.00038895564,0.00019719999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021584434,0.0010608454,0.00086153706,0.002307214,0.00029690584,0.00078107865,0.00077072857,0.0009895482,0.000499731],"category_scores_gemma":[0.011112215,0.00051213097,0.0006240945,0.0014266913,0.0006206086,0.0023496777,0.00060738897,0.0011952856,0.00026993197],"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.00037698424,0.0007048751,0.2755345,0.00020656943,0.000525628,0.00014857383,0.00043711966,0.5190529,0.0034704902,0.0044219424,0.0017965636,0.19332391],"study_design_scores_gemma":[0.00000489824,0.000037177044,0.014809918,0.000009116814,0.00002292627,0.000032371674,0.000031848223,0.981454,0.00047248811,0.0029801158,0.00013500101,0.000010150096],"about_ca_topic_score_codex":0.007336472,"about_ca_topic_score_gemma":0.0148895895,"teacher_disagreement_score":0.007336472,"about_ca_system_score_codex":0.0008532095,"about_ca_system_score_gemma":0.0005068055,"threshold_uncertainty_score":0.014587522},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018725916,0.0058854655,0.004868142,0.19951507,0.7277464,0.00059931644,0.001652757,0.0011322596,0.05672804],"genre_scores_gemma":[0.012326373,0.00573229,0.0058347424,0.055385057,0.2054751,0.0014791287,0.0023599572,0.0015581964,0.7098492],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.991247,0.0017370208,0.0003437881,0.001288259,0.0040693977,0.0013146027],"domain_scores_gemma":[0.96289283,0.00073716906,0.00091599324,0.00081893575,0.0138899665,0.020745061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013207346,0.002313271,0.0016954246,0.002116646,0.004021882,0.011660465,0.0018395353,0.005348527,0.13030234],"category_scores_gemma":[0.015991865,0.0007527357,0.0018325408,0.0012020991,0.0011644302,0.004908889,0.007449892,0.009380889,0.10461361],"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.00004587724,0.000040426257,0.00014330042,0.000044429802,0.0000038400053,0.000052254083,0.000043142503,0.00004941885,0.0001982342,0.001010217,0.9844183,0.013950526],"study_design_scores_gemma":[0.000017727021,0.000053503663,0.00037057354,0.00006680035,0.00000502485,0.000043986198,0.00018692538,0.00010767892,0.00011013169,0.0008456,0.9981761,0.000015995842],"about_ca_topic_score_codex":0.0014279868,"about_ca_topic_score_gemma":0.0037948792,"teacher_disagreement_score":0.13030234,"about_ca_system_score_codex":0.0025708973,"about_ca_system_score_gemma":0.008306365,"threshold_uncertainty_score":0.43590474},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15924007,0.004649055,0.81495637,0.0019626047,0.00075362826,0.0011450817,0.0025925166,0.0018370885,0.0128636155],"genre_scores_gemma":[0.6528706,0.0006826398,0.3406638,0.00033590564,0.0003621288,0.00089694775,0.0019297067,0.0005707385,0.0016876044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9159474,0.044886053,0.004092531,0.0054558623,0.02822842,0.0013897709],"domain_scores_gemma":[0.5914547,0.338458,0.00996489,0.021813156,0.03520401,0.0031052218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07791553,0.0015879468,0.0017606508,0.018271705,0.0036238232,0.005848438,0.0036118047,0.0039031953,0.0029953823],"category_scores_gemma":[0.32129842,0.0006285398,0.0018440869,0.008266523,0.0062035024,0.008576464,0.007387323,0.0024482545,0.0006129766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049407315,0.0016193902,0.16139771,0.0036334142,0.0034153478,0.0003672981,0.003993794,0.11918106,0.0071341563,0.14278696,0.022930915,0.52859926],"study_design_scores_gemma":[0.0004363738,0.0010711969,0.0177086,0.0006704056,0.00053595024,0.0008368127,0.0016397513,0.796177,0.012264859,0.15989761,0.008607267,0.0001540654],"about_ca_topic_score_codex":0.004135739,"about_ca_topic_score_gemma":0.004923735,"teacher_disagreement_score":0.07791553,"about_ca_system_score_codex":0.0034609425,"about_ca_system_score_gemma":0.004246764,"threshold_uncertainty_score":0.41206163},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18259051,0.00037415148,0.81259376,0.000671449,0.000016967324,0.00006105933,0.000831194,0.00016185308,0.0026989847],"genre_scores_gemma":[0.95198476,0.00056158064,0.045203563,0.000037526523,0.000061970684,0.00007621449,0.00057736767,0.00004064695,0.0014563705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9993729,0.00023883974,0.00003010774,0.00017621572,0.0001327481,0.000049163384],"domain_scores_gemma":[0.9922368,0.0045315274,0.0015963234,0.0007884063,0.00065777043,0.00018918728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001285276,0.0006267229,0.0005862332,0.0017966758,0.00062544324,0.0021007084,0.0010578346,0.000986927,0.0012424623],"category_scores_gemma":[0.014986777,0.0005201954,0.00046723848,0.0022887897,0.0011295456,0.004856422,0.0008886441,0.0009265892,0.0001821301],"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.00009104193,0.00007707443,0.027219508,0.0001267146,0.00008518679,0.000079310186,0.00028557863,0.73656696,0.0032412943,0.17414834,0.0015558539,0.0565231],"study_design_scores_gemma":[0.000003820683,0.000013466093,0.0029794173,0.000013571203,0.000013947531,0.000053988006,0.00009505636,0.91968,0.0006735828,0.07572174,0.00074116787,0.000010327716],"about_ca_topic_score_codex":0.0057379236,"about_ca_topic_score_gemma":0.0069764364,"teacher_disagreement_score":0.0057379236,"about_ca_system_score_codex":0.0013551196,"about_ca_system_score_gemma":0.00072124315,"threshold_uncertainty_score":0.011409044},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7958056,0.0020292331,0.07968504,0.0047118245,0.0006660989,0.00016756763,0.004040112,0.0010160967,0.11187846],"genre_scores_gemma":[0.9768546,0.000404143,0.0128398845,0.0005714319,0.00011181196,0.000061650644,0.0013468878,0.0002674054,0.0075421855],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977245,0.0009207917,0.00017856124,0.00045261098,0.000539854,0.00018374583],"domain_scores_gemma":[0.97969544,0.013573421,0.0019191216,0.0026126364,0.001554849,0.0006446022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029190513,0.0005150641,0.0005748807,0.0023479024,0.0012753814,0.005320337,0.00066185417,0.0012830568,0.012498283],"category_scores_gemma":[0.022887249,0.00035243036,0.00047583936,0.0027150307,0.0023171415,0.0076536024,0.0020120917,0.0009610279,0.0040713362],"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.0037704648,0.00040574794,0.28932315,0.0013613082,0.00050879084,0.00065723236,0.010474477,0.013791138,0.012574311,0.2052301,0.022085194,0.43981808],"study_design_scores_gemma":[0.00028596175,0.0010761919,0.26009437,0.0009282779,0.0005976672,0.0024546299,0.02636549,0.08937681,0.02164571,0.34601298,0.2508257,0.00033624037],"about_ca_topic_score_codex":0.0029426618,"about_ca_topic_score_gemma":0.0040923273,"teacher_disagreement_score":0.012498283,"about_ca_system_score_codex":0.00078521494,"about_ca_system_score_gemma":0.0003585549,"threshold_uncertainty_score":0.04181093},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.297843,0.0026721382,0.6418952,0.0042646173,0.00058595475,0.0005260987,0.0017644323,0.0020160743,0.048432536],"genre_scores_gemma":[0.9564294,0.0008677411,0.025115417,0.0004680726,0.00039782375,0.00028401046,0.00051286427,0.00011182111,0.015812932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985858,0.00029844747,0.00004642641,0.00050308695,0.00035274934,0.00021357574],"domain_scores_gemma":[0.9917944,0.0045962706,0.0009814757,0.0010388142,0.00096400833,0.00062497746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020762961,0.00082473195,0.0017701472,0.0025078657,0.0014614438,0.0023551043,0.00167635,0.002130279,0.010218421],"category_scores_gemma":[0.014858832,0.000862335,0.0011548739,0.001268467,0.0016816709,0.005331254,0.0021232541,0.0016849057,0.0017057745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065185106,0.0003068803,0.015710067,0.0007746384,0.00049613393,0.0019567928,0.0014778207,0.23012875,0.018842079,0.62281126,0.028124705,0.07871903],"study_design_scores_gemma":[0.00006997169,0.00011819943,0.0065168785,0.00005070253,0.0001105648,0.00047334406,0.00014521816,0.7509303,0.0018915335,0.23418297,0.0054327524,0.00007748426],"about_ca_topic_score_codex":0.0048093237,"about_ca_topic_score_gemma":0.0028618646,"teacher_disagreement_score":0.010218421,"about_ca_system_score_codex":0.0014874678,"about_ca_system_score_gemma":0.0007000327,"threshold_uncertainty_score":0.03418398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99582845,0.000044860713,0.0032194927,0.00018296216,0.000004045427,0.000011715403,0.000065846725,0.000020335623,0.00062233774],"genre_scores_gemma":[0.9995166,0.000014498888,0.00034723707,0.000012202607,0.0000047063995,0.0000043759746,0.000037529044,0.0000032243158,0.00005970833],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991604,0.00044633824,0.000052971965,0.0001252972,0.00014339347,0.00007152556],"domain_scores_gemma":[0.9429828,0.046406146,0.003944681,0.004238904,0.0017086774,0.0007188184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027996209,0.00015661157,0.00027464077,0.0007086827,0.00046135092,0.00073260325,0.0006921557,0.00062734645,0.0012954411],"category_scores_gemma":[0.052440606,0.00021108282,0.00027469,0.00074694277,0.0008187125,0.0019861327,0.00051732647,0.0007792621,0.00018783574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089988555,0.00075054285,0.8489803,0.00019435889,0.00019254921,0.00042794383,0.0027652897,0.06845976,0.0049820184,0.038828876,0.0022091619,0.031309474],"study_design_scores_gemma":[0.000049917915,0.00045643622,0.28146803,0.000036925117,0.0000654163,0.0006215348,0.00208576,0.68027,0.0020868583,0.031662185,0.0011581286,0.00003887044],"about_ca_topic_score_codex":0.001482558,"about_ca_topic_score_gemma":0.0012420653,"teacher_disagreement_score":0.0027996209,"about_ca_system_score_codex":0.00055240677,"about_ca_system_score_gemma":0.00039678812,"threshold_uncertainty_score":0.014805973},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46286696,0.00032128216,0.514067,0.00085658295,0.00003621793,0.000051567844,0.00038389475,0.00017891436,0.021237653],"genre_scores_gemma":[0.9901316,0.00022858524,0.0051144515,0.00003072642,0.000038826092,0.00004907802,0.00011873285,0.000024790423,0.004263102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974066,0.00008597294,0.000007976963,0.000060233873,0.00005649552,0.000048629037],"domain_scores_gemma":[0.99816483,0.0009194726,0.0004948901,0.00012104095,0.00015053578,0.0001492793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051699765,0.00045601957,0.00025344183,0.0012136966,0.0005022991,0.0012079553,0.00075112813,0.00062995096,0.00653867],"category_scores_gemma":[0.0035547987,0.00019594243,0.0004887534,0.0008689269,0.0010819188,0.0029990086,0.0011086082,0.0006900448,0.000340956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000857593,0.0000710838,0.0041269613,0.00010122681,0.000051113293,0.00042973727,0.00057289586,0.32079387,0.005358267,0.650777,0.0014734217,0.016158743],"study_design_scores_gemma":[0.000012400205,0.000060283273,0.0018219927,0.000017685936,0.000022553126,0.00014106907,0.00038892886,0.70378494,0.0011266411,0.29033577,0.0022675074,0.000020128728],"about_ca_topic_score_codex":0.0018663486,"about_ca_topic_score_gemma":0.0008336,"teacher_disagreement_score":0.00653867,"about_ca_system_score_codex":0.0010599403,"about_ca_system_score_gemma":0.0002571974,"threshold_uncertainty_score":0.02187401},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5574691,0.0027472803,0.42518193,0.0018740434,0.0001617903,0.00046090124,0.0014153916,0.0016323054,0.009057129],"genre_scores_gemma":[0.86880827,0.00085473957,0.12417263,0.00014065398,0.0002033271,0.00013238055,0.0019707486,0.00012190037,0.0035952984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773276,0.0006451556,0.00012702729,0.0005569389,0.0007381096,0.0001999432],"domain_scores_gemma":[0.9917035,0.0045298515,0.0012346098,0.0011743072,0.00090408797,0.0004537522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016472114,0.0010809504,0.0014551821,0.0064262846,0.0020791662,0.0021123237,0.0019280225,0.0018382899,0.0013044507],"category_scores_gemma":[0.014987994,0.00079080433,0.0009456826,0.0031608664,0.00068805343,0.0049634934,0.0028961434,0.0010081768,0.00090756133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015485765,0.0011594553,0.15555446,0.0011613072,0.0012754033,0.0030605635,0.005930153,0.07511032,0.02572244,0.034983784,0.03242839,0.66206515],"study_design_scores_gemma":[0.000079329024,0.00017117284,0.015963526,0.00009105185,0.00029423423,0.0017390134,0.0018741831,0.91890705,0.01041255,0.03956922,0.010819065,0.00007956133],"about_ca_topic_score_codex":0.0024883363,"about_ca_topic_score_gemma":0.005944117,"teacher_disagreement_score":0.0064262846,"about_ca_system_score_codex":0.00052703364,"about_ca_system_score_gemma":0.0005508221,"threshold_uncertainty_score":0.008711338},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55250084,0.0008354921,0.4375623,0.0013526591,0.0002064638,0.0003783214,0.0011011333,0.0016861429,0.0043767095],"genre_scores_gemma":[0.95973635,0.00019815902,0.03785047,0.000062720705,0.00011974915,0.00008694747,0.0007208425,0.00007914332,0.0011455448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974625,0.0005690764,0.0002097066,0.00073155545,0.0008051481,0.00022198047],"domain_scores_gemma":[0.96342623,0.025225194,0.004707562,0.002797808,0.0025093362,0.0013338428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056245816,0.0009172078,0.0014050946,0.0045265085,0.001820256,0.0027273174,0.0026876212,0.0013247662,0.0010705971],"category_scores_gemma":[0.03225016,0.00064297806,0.00070270937,0.0027875009,0.0010356954,0.0069639175,0.0019986131,0.0018329204,0.00028284593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017619154,0.0012911427,0.15687054,0.0007398347,0.0005913548,0.0007773168,0.002303454,0.32791027,0.014292661,0.032314826,0.0074378257,0.45370883],"study_design_scores_gemma":[0.000030418943,0.0001312939,0.010767311,0.000033500786,0.00015882775,0.00017003727,0.0004262434,0.96608645,0.0031149534,0.017300494,0.0017499144,0.00003051503],"about_ca_topic_score_codex":0.0038146246,"about_ca_topic_score_gemma":0.004886639,"teacher_disagreement_score":0.0056245816,"about_ca_system_score_codex":0.0010840301,"about_ca_system_score_gemma":0.0015647344,"threshold_uncertainty_score":0.029745936},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003945486,0.00035367528,0.5874398,0.0003897967,0.00012339577,0.00030962998,0.01309223,0.38735855,0.0069876043],"genre_scores_gemma":[0.052329082,0.0011050346,0.8347969,0.00036129294,0.00012101614,0.0012745546,0.047582448,0.04992778,0.012501852],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988581,0.00024086863,0.00007378024,0.00021158431,0.0005284069,0.000087135726],"domain_scores_gemma":[0.9970367,0.0014380594,0.00013724125,0.0006840716,0.00042624894,0.00027773934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002076559,0.0022091349,0.001093205,0.003634999,0.00086812535,0.0024158543,0.0032356586,0.0009901498,0.037318338],"category_scores_gemma":[0.0071406523,0.0011188313,0.0012969206,0.0029451626,0.00058280805,0.0043053464,0.0041839024,0.0016611898,0.011287084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008682596,0.00020851757,0.0026494795,0.00140832,0.00036499838,0.0009166014,0.0011583035,0.015078797,0.028675495,0.023790926,0.57552284,0.34935746],"study_design_scores_gemma":[0.0007932939,0.0002459226,0.004543453,0.00043853282,0.00016768546,0.00096043,0.0003985974,0.3310481,0.03932222,0.090172306,0.53151697,0.00039248148],"about_ca_topic_score_codex":0.0048685446,"about_ca_topic_score_gemma":0.008448343,"teacher_disagreement_score":0.037318338,"about_ca_system_score_codex":0.00055756484,"about_ca_system_score_gemma":0.0014183802,"threshold_uncertainty_score":0.124842286},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2760784,0.0014906353,0.5532333,0.0024389725,0.0008352381,0.0029500145,0.046616375,0.07330261,0.043054417],"genre_scores_gemma":[0.51327586,0.0006728043,0.4592774,0.00040822927,0.00040550073,0.001092873,0.011319313,0.0009807518,0.012567244],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.998871,0.0003533552,0.00009610647,0.00019175657,0.00041548235,0.00007224615],"domain_scores_gemma":[0.99559313,0.0025168222,0.00045497506,0.0005414927,0.00057122577,0.00032230827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011559443,0.000789158,0.0004168333,0.0056468304,0.000702713,0.001300457,0.00070480217,0.000502585,0.003164992],"category_scores_gemma":[0.0039328677,0.00031313184,0.00033374873,0.0025721267,0.0002969149,0.002187499,0.0010235611,0.000555781,0.0020758752],"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.000564396,0.00071117346,0.06340827,0.0016083322,0.00032734245,0.0014644073,0.007132379,0.004993917,0.057052642,0.013475528,0.075978,0.77328354],"study_design_scores_gemma":[0.00013687644,0.00072811893,0.15172005,0.00053874357,0.0002536329,0.0024973548,0.007990018,0.3389655,0.091008075,0.02674814,0.3789409,0.0004726134],"about_ca_topic_score_codex":0.0028495546,"about_ca_topic_score_gemma":0.006950674,"teacher_disagreement_score":0.0056468304,"about_ca_system_score_codex":0.00031533017,"about_ca_system_score_gemma":0.0004989911,"threshold_uncertainty_score":0.01058799},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5860746,0.003602418,0.39463514,0.0018476384,0.00015145526,0.00012584914,0.00009603406,0.00042615895,0.013040687],"genre_scores_gemma":[0.97389627,0.0010837095,0.023121286,0.00008531607,0.0001739157,0.00007112352,0.000039055183,0.000046642203,0.0014826432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995552,0.00021965822,0.000016027554,0.0000661048,0.00009407383,0.000048904058],"domain_scores_gemma":[0.99722147,0.0016735181,0.0005818843,0.00021339583,0.0001482529,0.00016151063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012990754,0.00067833427,0.00065109663,0.0016608349,0.00067494565,0.00072472944,0.0009291375,0.0011135787,0.0010375581],"category_scores_gemma":[0.00674238,0.00029945842,0.0009151685,0.0009104979,0.0021795896,0.0016759839,0.0013571635,0.0008962111,0.00011662615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005408742,0.00008399222,0.0030185427,0.00013745559,0.00006600854,0.00041195814,0.0005272551,0.3680206,0.0052960985,0.61086255,0.0009143091,0.010607239],"study_design_scores_gemma":[0.000010683827,0.000027013628,0.0006388941,0.000008903512,0.000010984308,0.00006755305,0.00004287406,0.8183725,0.0005325055,0.17956103,0.00070809264,0.000018916155],"about_ca_topic_score_codex":0.002400873,"about_ca_topic_score_gemma":0.001512154,"teacher_disagreement_score":0.002400873,"about_ca_system_score_codex":0.0009239339,"about_ca_system_score_gemma":0.00033390848,"threshold_uncertainty_score":0.00687021},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9245435,0.00244963,0.04193819,0.007628592,0.00021326245,0.00014018314,0.0014535803,0.00019468369,0.02143837],"genre_scores_gemma":[0.991396,0.0005264578,0.0063964813,0.00017978484,0.00015278177,0.000037006736,0.00036484373,0.00002186907,0.0009247494],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998632,0.00037246337,0.000084199,0.0003655734,0.00039494524,0.00015073155],"domain_scores_gemma":[0.9900705,0.006118118,0.0014365893,0.0004882696,0.0010327755,0.00085381273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014682631,0.00028584123,0.00070993387,0.0030032576,0.0011719698,0.0027512293,0.0008994996,0.0013067555,0.0016589818],"category_scores_gemma":[0.018866513,0.0001836376,0.00027593868,0.0019561937,0.0011611196,0.007627993,0.001127994,0.000723456,0.0005674022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064883486,0.00043147424,0.5245116,0.0009541348,0.0005968033,0.0012573806,0.008587329,0.005592626,0.00645833,0.08334793,0.016462123,0.35115144],"study_design_scores_gemma":[0.00014811884,0.0004397196,0.29968184,0.0006721703,0.0012083476,0.003845627,0.0498738,0.12460629,0.009669505,0.45376503,0.055851117,0.00023844386],"about_ca_topic_score_codex":0.0033411568,"about_ca_topic_score_gemma":0.0051292204,"teacher_disagreement_score":0.0033411568,"about_ca_system_score_codex":0.00058565295,"about_ca_system_score_gemma":0.0004591098,"threshold_uncertainty_score":0.007764995},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048258316,0.00040724323,0.9442454,0.0005361774,0.0000847272,0.00007616715,0.00016226679,0.0002038642,0.006025781],"genre_scores_gemma":[0.7893633,0.0017019913,0.19021119,0.00015077757,0.00018817796,0.00058056414,0.00036018924,0.00021885954,0.01722486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990491,0.00038922412,0.00004875964,0.0002141132,0.00020157742,0.00009714192],"domain_scores_gemma":[0.9964696,0.0021572658,0.00053423224,0.00025976033,0.0004068397,0.00017235732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014829033,0.0010771003,0.00078053295,0.0023521897,0.00083629513,0.0023288657,0.002552138,0.002033279,0.0029150655],"category_scores_gemma":[0.0095829265,0.0008258204,0.001069947,0.0022327863,0.0013606437,0.005126576,0.0015953409,0.0013694754,0.0005182677],"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.00002504224,0.000024620069,0.0008732557,0.000056250767,0.000039088558,0.00016726962,0.00011617221,0.795171,0.0008785307,0.19245368,0.00056607125,0.009629032],"study_design_scores_gemma":[0.0000046221,0.000009169116,0.00010253976,0.0000070887577,0.000008310271,0.00003766066,0.000010361176,0.92370373,0.00011319612,0.07519224,0.00080266414,0.000008485208],"about_ca_topic_score_codex":0.0045243194,"about_ca_topic_score_gemma":0.0043164683,"teacher_disagreement_score":0.0045243194,"about_ca_system_score_codex":0.0014343016,"about_ca_system_score_gemma":0.0006914519,"threshold_uncertainty_score":0.010406613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87329745,0.0017557347,0.10347348,0.002252276,0.0001566682,0.000093105475,0.00063909864,0.00024246138,0.018089727],"genre_scores_gemma":[0.99747014,0.00033907394,0.0016610316,0.000035649762,0.000037508857,0.000019768248,0.00006561379,0.000015965148,0.00035527645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911577,0.00040226438,0.0000510586,0.0001595255,0.00014954053,0.00012175126],"domain_scores_gemma":[0.965643,0.025943235,0.004443031,0.0013590079,0.001386075,0.0012256183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001902982,0.00032239346,0.0007419586,0.0015927736,0.0008871222,0.0020881281,0.00073651166,0.0016399365,0.0036465342],"category_scores_gemma":[0.041252162,0.0004688739,0.000321572,0.0007710504,0.0010663982,0.0043676645,0.0007919284,0.0010250503,0.00043339783],"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.0010334876,0.00044260116,0.11410378,0.0011183968,0.00046230477,0.0013130183,0.0010062178,0.48262203,0.038980555,0.235068,0.0063082906,0.117541365],"study_design_scores_gemma":[0.00006193875,0.00040756038,0.03868218,0.00009493277,0.000231413,0.001132358,0.00057875906,0.73446155,0.0046341564,0.21709682,0.0025314405,0.000086945714],"about_ca_topic_score_codex":0.00068255916,"about_ca_topic_score_gemma":0.00081902236,"teacher_disagreement_score":0.0036465342,"about_ca_system_score_codex":0.0007760149,"about_ca_system_score_gemma":0.0006174634,"threshold_uncertainty_score":0.012198806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6540198,0.0036275461,0.31759852,0.0020329205,0.00011621728,0.00008340583,0.0007965049,0.00027590944,0.02144921],"genre_scores_gemma":[0.96146125,0.0011972898,0.03561227,0.00012269826,0.00007627116,0.000060895545,0.00026024022,0.000024038842,0.0011851435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994135,0.00025789038,0.000033777407,0.00012924158,0.00012423306,0.000041335796],"domain_scores_gemma":[0.99259675,0.004779846,0.0012486805,0.00039562988,0.00072293315,0.00025604176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089573127,0.00023684224,0.00024146453,0.002736047,0.0005314383,0.0019509391,0.00039134032,0.00066061306,0.0010217538],"category_scores_gemma":[0.009080419,0.00023771414,0.00018716157,0.0018466595,0.0017245183,0.002705336,0.0007326852,0.00058473623,0.00023759155],"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.00013506056,0.0000541656,0.04880461,0.00022453758,0.00009813344,0.00018482363,0.00069788966,0.07609597,0.008482369,0.7622755,0.0019567313,0.10099021],"study_design_scores_gemma":[0.000026454198,0.000059524325,0.02292122,0.000080957325,0.00005229979,0.0003313115,0.00035999206,0.13569964,0.0031714444,0.8273741,0.009886691,0.000036346988],"about_ca_topic_score_codex":0.0006795524,"about_ca_topic_score_gemma":0.0008499257,"teacher_disagreement_score":0.002736047,"about_ca_system_score_codex":0.00058259506,"about_ca_system_score_gemma":0.0002995315,"threshold_uncertainty_score":0.0047371984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9540086,0.00066388113,0.04099885,0.0011157839,0.00006867115,0.00001689526,0.00021768271,0.00014704392,0.0027626047],"genre_scores_gemma":[0.9969874,0.00019751232,0.0021840895,0.000047458452,0.00007960896,0.000008602746,0.000058477868,0.00003717966,0.00039964198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877745,0.0006159027,0.0000535433,0.00023496586,0.00016154989,0.00015648891],"domain_scores_gemma":[0.92124915,0.06608704,0.0046168286,0.0033499466,0.0024446326,0.0022525112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002797187,0.0004862649,0.0007442853,0.0018520049,0.0008574953,0.0016987005,0.0011585762,0.0018061014,0.0019943442],"category_scores_gemma":[0.06185346,0.0005710291,0.0004530324,0.0013575851,0.0020129115,0.004976378,0.0015527812,0.0011910172,0.00025149112],"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.0022663537,0.0007489485,0.12774822,0.0010934899,0.00097308407,0.0013122774,0.0025590889,0.36655688,0.07470081,0.27304807,0.00751406,0.14147866],"study_design_scores_gemma":[0.00017862371,0.0003714444,0.050537713,0.000069247486,0.00036171323,0.00063630356,0.00040890416,0.6309971,0.006402508,0.30855983,0.0013101985,0.0001663531],"about_ca_topic_score_codex":0.0014757827,"about_ca_topic_score_gemma":0.0020872243,"teacher_disagreement_score":0.002797187,"about_ca_system_score_codex":0.000560908,"about_ca_system_score_gemma":0.00027865937,"threshold_uncertainty_score":0.014793098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9045422,0.00084962475,0.08677738,0.0011351787,0.000044433506,0.00013321596,0.00012571347,0.00012261444,0.0062696054],"genre_scores_gemma":[0.99312043,0.00041108415,0.005358039,0.000042087828,0.00003218653,0.000034468594,0.0000371709,0.000013918631,0.00095053157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903595,0.0005808983,0.000024585886,0.00011039498,0.00014116988,0.00010711968],"domain_scores_gemma":[0.98238486,0.013670601,0.0020136186,0.0006967277,0.0007823896,0.00045181808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015117006,0.0006331623,0.00056424324,0.0018860687,0.0009952784,0.0010381048,0.0008560834,0.0014043361,0.0016232004],"category_scores_gemma":[0.014189211,0.00043104804,0.0006751119,0.0010075954,0.0012400664,0.003236846,0.0006211776,0.0010755868,0.00019599195],"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.00020874228,0.00037733983,0.032105435,0.00031308908,0.0002916408,0.0010384851,0.0016940584,0.7923539,0.013228441,0.12850204,0.0020526736,0.027834175],"study_design_scores_gemma":[0.000010340866,0.00009267959,0.0032757695,0.000016187587,0.000021003785,0.00016343115,0.00012800081,0.98628706,0.0007270374,0.008715207,0.0005429112,0.000020358731],"about_ca_topic_score_codex":0.005205991,"about_ca_topic_score_gemma":0.0027977498,"teacher_disagreement_score":0.005205991,"about_ca_system_score_codex":0.001046005,"about_ca_system_score_gemma":0.00045912008,"threshold_uncertainty_score":0.01035136},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4542876,0.00050349394,0.5382673,0.0005788573,0.00004038885,0.000081702805,0.000058620066,0.00024067542,0.0059413477],"genre_scores_gemma":[0.98229665,0.0003521698,0.016343303,0.000065257445,0.00001760833,0.00004297044,0.000017326067,0.000009958218,0.00085476856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957615,0.00024129845,0.000014763838,0.000063957,0.00004758908,0.00005627899],"domain_scores_gemma":[0.9978174,0.0014290652,0.00042552565,0.00014477727,0.000121373385,0.00006195888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011178539,0.00030430127,0.00042656148,0.00064037496,0.0003951892,0.0007825725,0.00054445973,0.00086426066,0.000721592],"category_scores_gemma":[0.0067354,0.00021086194,0.00046094452,0.00023045707,0.00070220255,0.0014160596,0.0005278187,0.00046514056,0.00013190319],"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.00025331418,0.00015241947,0.007913978,0.00029818586,0.00016083143,0.00047229484,0.0007451622,0.7331533,0.032893732,0.18643044,0.0008822729,0.03664413],"study_design_scores_gemma":[0.000018972272,0.00006385725,0.0010584644,0.000018323697,0.000034632736,0.00006065039,0.00006863242,0.9575969,0.0027847078,0.037784092,0.0004983085,0.000012477694],"about_ca_topic_score_codex":0.0020649484,"about_ca_topic_score_gemma":0.00091118005,"teacher_disagreement_score":0.0020649484,"about_ca_system_score_codex":0.0006431092,"about_ca_system_score_gemma":0.0004705018,"threshold_uncertainty_score":0.005911827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8376968,0.0005125422,0.15256074,0.0012864333,0.00014294997,0.00007429569,0.0006848057,0.00035660842,0.006684836],"genre_scores_gemma":[0.9823254,0.00058595446,0.009386245,0.00008351862,0.00013792445,0.0000633631,0.0004097052,0.00008817808,0.00691964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992021,0.00024587387,0.00004583719,0.00015077587,0.00022445152,0.00013106706],"domain_scores_gemma":[0.98468244,0.009212246,0.0018165134,0.0011867362,0.0017855059,0.0013165853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002525576,0.0004256703,0.00076626573,0.0024635037,0.0007851514,0.0014950837,0.001989224,0.0016507675,0.0044432194],"category_scores_gemma":[0.02061556,0.00034815422,0.0004747735,0.0009814836,0.0011720994,0.003667885,0.0010394878,0.0011686238,0.00070213963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005533581,0.00023529016,0.045411166,0.00059843133,0.00024169564,0.0011197106,0.002074936,0.36403796,0.033787284,0.48240584,0.0070167,0.06251767],"study_design_scores_gemma":[0.000030901287,0.00016617052,0.0069755833,0.0000557795,0.00011044436,0.0012804534,0.00043139147,0.8887855,0.0052924114,0.0944386,0.002359381,0.00007342559],"about_ca_topic_score_codex":0.00087822694,"about_ca_topic_score_gemma":0.00048311628,"teacher_disagreement_score":0.0044432194,"about_ca_system_score_codex":0.0007112727,"about_ca_system_score_gemma":0.00040969008,"threshold_uncertainty_score":0.014864087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057825487,0.9735814,0.021996034,0.0007168325,0.00033466582,0.00001928096,0.000057504705,0.000047667076,0.0026684154],"genre_scores_gemma":[0.005605042,0.9803418,0.012597761,0.00015543116,0.00037372115,0.000043877215,0.00008128689,0.000016006627,0.0007852065],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99954385,0.00012162305,0.00005253088,0.0000916953,0.00016938073,0.000020859206],"domain_scores_gemma":[0.99776924,0.0015212942,0.00013156956,0.0000951889,0.00041218486,0.000070650734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021112142,0.0016748434,0.0020077168,0.0037799843,0.0004898095,0.0015826577,0.0022100138,0.0016965906,0.0019072499],"category_scores_gemma":[0.0035595482,0.0007896315,0.0010951807,0.006008589,0.0019106059,0.004144488,0.00093837566,0.0021075306,0.0011663924],"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.000029364819,0.00011106893,0.0013157255,0.010277926,0.00024436438,0.00023343755,0.00024179422,0.025620697,0.00094639993,0.1116135,0.022277111,0.82708853],"study_design_scores_gemma":[0.0000383946,0.00015517267,0.0034529134,0.009345134,0.00027454813,0.0011419776,0.0003514025,0.030962491,0.00082567066,0.1934556,0.759811,0.00018555963],"about_ca_topic_score_codex":0.0075444304,"about_ca_topic_score_gemma":0.00620178,"teacher_disagreement_score":0.0075444304,"about_ca_system_score_codex":0.0018516768,"about_ca_system_score_gemma":0.0017201835,"threshold_uncertainty_score":0.015001059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2012367,0.0020474463,0.7779199,0.00067396415,0.00019094902,0.0003779183,0.0078675905,0.00353296,0.0061525493],"genre_scores_gemma":[0.7150823,0.0008217028,0.26825175,0.00014466037,0.00014123064,0.00024148206,0.009917192,0.00012302777,0.005276687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930286,0.0001416539,0.000056582907,0.00022571537,0.00020371411,0.0000695],"domain_scores_gemma":[0.99761367,0.0011350948,0.00021311767,0.00030996642,0.000623556,0.000104704646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052660704,0.0006025606,0.0009841893,0.0069969245,0.0009749165,0.0010585019,0.0013134392,0.0011286949,0.0023779494],"category_scores_gemma":[0.0042707096,0.0003267764,0.00089273805,0.005641398,0.00025298216,0.0021955925,0.0006634624,0.00078498304,0.0015122361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011647294,0.001254085,0.04759292,0.0007635782,0.0007605365,0.0005323011,0.00039760166,0.12306673,0.01820828,0.010732804,0.03509461,0.7604318],"study_design_scores_gemma":[0.000017563647,0.0000528814,0.004880422,0.000025381245,0.00010302999,0.0001685614,0.00006824872,0.98502153,0.0021584267,0.0058628963,0.0016123111,0.00002872848],"about_ca_topic_score_codex":0.017426744,"about_ca_topic_score_gemma":0.036753956,"teacher_disagreement_score":0.017426744,"about_ca_system_score_codex":0.00072928786,"about_ca_system_score_gemma":0.0008776225,"threshold_uncertainty_score":0.034650564},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7417568,0.09457979,0.004765723,0.072959505,0.0013088202,0.000034614906,0.005463782,0.00013018258,0.07900067],"genre_scores_gemma":[0.9742166,0.019622501,0.0008524551,0.0009250754,0.00081076106,0.000019179799,0.0005817984,0.000022836322,0.0029488269],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991117,0.0003152053,0.000079803474,0.00023674253,0.00015241053,0.0001040619],"domain_scores_gemma":[0.9949515,0.001701227,0.0018632455,0.00022422578,0.00065290276,0.00060696877],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0012562799,0.00016490498,0.00031832047,0.004236183,0.00082812645,0.002930377,0.00031850743,0.0007753751,0.00646026],"category_scores_gemma":[0.008622988,0.00008408372,0.00020789419,0.012258739,0.0012454344,0.0041424455,0.0015560641,0.00077977095,0.00072590174],"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.00030760875,0.00011284167,0.42168355,0.00090503885,0.00044422824,0.000537751,0.013488912,0.002021271,0.0009119023,0.23867215,0.03698169,0.28393304],"study_design_scores_gemma":[0.000037457794,0.0001614612,0.5783249,0.0008138155,0.00015122035,0.0008845543,0.016192852,0.003800113,0.00039014168,0.16821195,0.23097095,0.000060563834],"about_ca_topic_score_codex":0.0037965218,"about_ca_topic_score_gemma":0.0053705657,"teacher_disagreement_score":0.9987437,"about_ca_system_score_codex":0.000873428,"about_ca_system_score_gemma":0.0009133792,"threshold_uncertainty_score":0.02161169},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053315118,0.00082378834,0.94028246,0.0015081248,0.00009573493,0.00022774035,0.00035936278,0.0005340414,0.0028536217],"genre_scores_gemma":[0.5267239,0.0014486219,0.45588186,0.0004387515,0.00047616241,0.00088894565,0.0008597083,0.0012160428,0.012066123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950375,0.002672481,0.0002305703,0.00068252813,0.0008833842,0.00049350335],"domain_scores_gemma":[0.9382812,0.05317807,0.002480492,0.0029016433,0.0016644836,0.0014940825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00888128,0.0031730086,0.004045143,0.0025152804,0.0016059986,0.0027119648,0.0044841315,0.0032761015,0.0044372603],"category_scores_gemma":[0.05224122,0.0022517068,0.0016131796,0.0038753538,0.0028432845,0.0090741785,0.003754873,0.0027462193,0.00068898185],"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.0005634773,0.00025489365,0.002259524,0.00029165036,0.00017562714,0.000104681596,0.00041197365,0.85870767,0.0016812927,0.05239239,0.0047791693,0.07837772],"study_design_scores_gemma":[0.000041195584,0.000054377862,0.00019146668,0.000019996352,0.000034489665,0.00002574605,0.000038810107,0.96548223,0.00036588663,0.033216592,0.00052137725,0.000007898448],"about_ca_topic_score_codex":0.010663622,"about_ca_topic_score_gemma":0.012431996,"teacher_disagreement_score":0.010663622,"about_ca_system_score_codex":0.0029716569,"about_ca_system_score_gemma":0.003105487,"threshold_uncertainty_score":0.046969295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040086254,0.00046411992,0.9531024,0.0008290182,0.000184549,0.0002782621,0.00015411708,0.0009969265,0.0039043257],"genre_scores_gemma":[0.56278425,0.000215927,0.4306414,0.00055860425,0.00019744807,0.00077243766,0.0003762079,0.00018553388,0.0042681745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735945,0.001386326,0.0001078347,0.00050172827,0.0003041961,0.0003403665],"domain_scores_gemma":[0.9825554,0.014194029,0.00082592136,0.0008561744,0.00083968655,0.0007288668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057174326,0.0010480238,0.0031226773,0.0018913283,0.0012969607,0.0012972505,0.00500264,0.0031211935,0.0053140144],"category_scores_gemma":[0.019375734,0.0010119901,0.001224424,0.0012172955,0.0024163462,0.0032989993,0.0026713554,0.0017891744,0.000723419],"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.0007711222,0.00029819336,0.00056414516,0.0001316894,0.00008042591,0.00004950613,0.00008060536,0.93331397,0.00083559525,0.02023489,0.0037321746,0.03990763],"study_design_scores_gemma":[0.00016379361,0.00009724646,0.00004404999,0.0000071812246,0.00001446387,0.00001314847,0.000009174098,0.99388415,0.0001489338,0.0054056942,0.00020494225,0.00000720962],"about_ca_topic_score_codex":0.0054396414,"about_ca_topic_score_gemma":0.0048103184,"teacher_disagreement_score":0.0057174326,"about_ca_system_score_codex":0.0019126539,"about_ca_system_score_gemma":0.004316153,"threshold_uncertainty_score":0.030237019},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45419854,0.0009858483,0.5401522,0.0003261127,0.000089479894,0.00009907167,0.00059913564,0.00022361772,0.0033259597],"genre_scores_gemma":[0.87599504,0.00019997696,0.12162983,0.000039919825,0.00010681602,0.000067743174,0.0006985066,0.00006326714,0.0011989593],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981883,0.00078402983,0.00009217075,0.00043364547,0.0004171921,0.00008460863],"domain_scores_gemma":[0.990706,0.005563518,0.0010317939,0.0009704511,0.0012034603,0.00052469946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026613316,0.0003260327,0.0007067436,0.0052485117,0.0008681622,0.0013258342,0.0010782789,0.0008495625,0.0015399248],"category_scores_gemma":[0.019379174,0.00023048276,0.0007394123,0.0028855242,0.000988538,0.0025883757,0.001477274,0.00067718193,0.00023832779],"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.0016546285,0.0003861563,0.08060563,0.00081006467,0.0006936655,0.00039577638,0.0015443985,0.0725029,0.07741545,0.14014788,0.0043347343,0.61950874],"study_design_scores_gemma":[0.00007931091,0.00038593286,0.06390159,0.000040197105,0.00017507849,0.00127033,0.0005021932,0.7597318,0.014581151,0.15315448,0.0060662515,0.00011162402],"about_ca_topic_score_codex":0.0010135749,"about_ca_topic_score_gemma":0.0010999595,"teacher_disagreement_score":0.0052485117,"about_ca_system_score_codex":0.00073678896,"about_ca_system_score_gemma":0.00042356926,"threshold_uncertainty_score":0.014074624},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06738399,0.00024224991,0.9253393,0.00049258437,0.0001236789,0.00013122115,0.000032780423,0.0011294282,0.0051247715],"genre_scores_gemma":[0.8506505,0.00014083678,0.14435634,0.00019738753,0.00007387675,0.00019114205,0.00007904908,0.000054123353,0.004256666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994011,0.00021561403,0.000049695995,0.00012532523,0.00012996116,0.00007829283],"domain_scores_gemma":[0.99861515,0.0006183525,0.0001257067,0.00013177218,0.00044458694,0.000064391796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012954978,0.0004267388,0.0006008287,0.00053137116,0.00058214605,0.000665201,0.0011559966,0.0009192518,0.0027818931],"category_scores_gemma":[0.003475313,0.00017000672,0.00033424256,0.0003451459,0.00039417634,0.0015826765,0.00077542977,0.00069884286,0.00061096484],"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.00026565758,0.0006202765,0.003939876,0.0002353424,0.00013393756,0.00036295335,0.0003838781,0.61090183,0.020557368,0.030528808,0.0038537525,0.3282163],"study_design_scores_gemma":[0.000012843498,0.00005417855,0.00021350214,0.000004499416,0.00001549096,0.000027972446,0.000011428005,0.9924286,0.0029558262,0.003388164,0.00088265375,0.000004794685],"about_ca_topic_score_codex":0.0014389409,"about_ca_topic_score_gemma":0.0010069357,"teacher_disagreement_score":0.0027818931,"about_ca_system_score_codex":0.0004976784,"about_ca_system_score_gemma":0.00080722396,"threshold_uncertainty_score":0.009306371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87979496,0.0032907715,0.10741771,0.0009749768,0.00004620404,0.000039800223,0.00011622597,0.00023599762,0.008083416],"genre_scores_gemma":[0.9934942,0.0004899789,0.0053227097,0.000022980237,0.000019738918,0.000017252914,0.000030307023,0.000013593155,0.00058921234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998934,0.000049445083,0.0000040779983,0.000012886103,0.00002236888,0.000017780803],"domain_scores_gemma":[0.9989987,0.00070941757,0.0001456037,0.000039967694,0.00004401636,0.00006219912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034157938,0.00028956172,0.0002465735,0.0012473529,0.00036605803,0.00091544975,0.00045124913,0.00044689392,0.0009823696],"category_scores_gemma":[0.0030194977,0.00025660123,0.00029224975,0.00064137543,0.0015957626,0.0013046433,0.0005601205,0.000485815,0.00006627411],"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.00010087957,0.000094448194,0.007135391,0.00016188559,0.00005205638,0.00034761472,0.00055179134,0.50054884,0.0041677444,0.47071248,0.001994702,0.014132218],"study_design_scores_gemma":[0.000033060896,0.000019645347,0.0029864288,0.000019932007,0.000013211746,0.00009309584,0.000114293274,0.69298065,0.0006539353,0.302192,0.0008741647,0.000019435109],"about_ca_topic_score_codex":0.0026086608,"about_ca_topic_score_gemma":0.0021465896,"teacher_disagreement_score":0.0026086608,"about_ca_system_score_codex":0.0008052567,"about_ca_system_score_gemma":0.00019883568,"threshold_uncertainty_score":0.0058425665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004719161,0.000374419,0.9934818,0.0001947613,0.00007033226,0.00007709982,0.000110303765,0.00024340615,0.0007287557],"genre_scores_gemma":[0.07047768,0.00059421017,0.92592734,0.000100080026,0.00012638627,0.00026664478,0.00042627472,0.00011319516,0.0019682867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822944,0.0005969503,0.00009073565,0.0003855583,0.00062771403,0.000069725655],"domain_scores_gemma":[0.9977386,0.00092526205,0.00026552417,0.0002753691,0.0006665417,0.00012878246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016698287,0.00088129623,0.0009803809,0.0049502095,0.0014587909,0.00119301,0.0015288587,0.001508616,0.0020547202],"category_scores_gemma":[0.0055579017,0.00042987568,0.0013786271,0.004916668,0.00082691456,0.0022738413,0.0014574768,0.0014417534,0.0010794983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001452507,0.0002486434,0.0044307117,0.00052906206,0.00039344458,0.00024224119,0.00083736243,0.18941627,0.010233864,0.06849207,0.013120136,0.7119109],"study_design_scores_gemma":[0.000015714528,0.0000592144,0.0016709652,0.000035082194,0.000041200674,0.00028258984,0.00013294973,0.95453215,0.0021826588,0.033172272,0.0078023034,0.000072847666],"about_ca_topic_score_codex":0.0036863605,"about_ca_topic_score_gemma":0.0046754116,"teacher_disagreement_score":0.0049502095,"about_ca_system_score_codex":0.0010220085,"about_ca_system_score_gemma":0.0011612135,"threshold_uncertainty_score":0.008830965},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010630406,0.00009066577,0.9870122,0.00012580473,0.00006272298,0.00008750481,0.0001234927,0.0011213458,0.0007457452],"genre_scores_gemma":[0.11402821,0.00022050785,0.8817612,0.000088137596,0.0001282595,0.00018366246,0.00078145857,0.00023785535,0.002570742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912614,0.00015816437,0.000059885413,0.00023703194,0.00036241324,0.000056324727],"domain_scores_gemma":[0.9979735,0.00041849984,0.00018313975,0.0009257438,0.00041131495,0.00008785825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008244051,0.0008874011,0.0008489188,0.001977486,0.00056814414,0.0014465661,0.0015884164,0.0009889563,0.0036695928],"category_scores_gemma":[0.00480933,0.00038500712,0.0006891356,0.0021686617,0.00080186536,0.0023321386,0.0017124849,0.0014052532,0.0023115296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040280173,0.00024909337,0.0014686346,0.00027056164,0.00007005908,0.00016832301,0.00021863659,0.07803334,0.062448476,0.048604634,0.0059776083,0.8020879],"study_design_scores_gemma":[0.000039722538,0.00015672632,0.0010984498,0.000025778307,0.000027385495,0.00046338004,0.00008349034,0.91930354,0.038016863,0.030210687,0.01051922,0.000054742606],"about_ca_topic_score_codex":0.0011503071,"about_ca_topic_score_gemma":0.0012951097,"teacher_disagreement_score":0.0036695928,"about_ca_system_score_codex":0.0005611513,"about_ca_system_score_gemma":0.00082893175,"threshold_uncertainty_score":0.012275994},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62525254,0.0021651175,0.351942,0.0034176065,0.0001099422,0.000053461397,0.0006852835,0.00020685591,0.016167186],"genre_scores_gemma":[0.9936668,0.0004740767,0.0043869666,0.00006960004,0.00016677594,0.000027083901,0.00012434523,0.000025203162,0.0010590714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880207,0.00044253375,0.00005216423,0.00025598824,0.00032540364,0.00012179664],"domain_scores_gemma":[0.9755123,0.018098494,0.0035302453,0.0012430166,0.0008318989,0.0007840075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00177785,0.00046615812,0.0009487533,0.0021486222,0.0008167754,0.0028330754,0.0011852059,0.0013470837,0.0017754077],"category_scores_gemma":[0.020274462,0.00067907135,0.0005566632,0.0009846889,0.0026900647,0.0052035986,0.0015054968,0.001156782,0.00018415136],"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.00018179236,0.000045484598,0.0073248353,0.00015732337,0.00014168458,0.00022488064,0.0003191491,0.5209403,0.005057564,0.44816837,0.0014572649,0.015981382],"study_design_scores_gemma":[0.000013003883,0.00002799962,0.0041821874,0.00001927602,0.000020034908,0.00010250405,0.000103078215,0.59496427,0.0005101661,0.39908102,0.00094401767,0.000032432028],"about_ca_topic_score_codex":0.0016065256,"about_ca_topic_score_gemma":0.00092084956,"teacher_disagreement_score":0.0028330754,"about_ca_system_score_codex":0.0012200954,"about_ca_system_score_gemma":0.0004959314,"threshold_uncertainty_score":0.0094022155},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014845723,0.00016885682,0.981492,0.0002232007,0.00004609874,0.00014202093,0.00008629051,0.0005859266,0.0024098756],"genre_scores_gemma":[0.18504009,0.000099361416,0.8093056,0.00031282264,0.00008073967,0.0003965707,0.0002935604,0.0004099587,0.0040612975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918324,0.00030806867,0.000034526365,0.00018515391,0.00018433889,0.00010454883],"domain_scores_gemma":[0.9972874,0.0017180685,0.0001490052,0.00028175247,0.00037505763,0.00018876573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018840663,0.0012028664,0.0017455386,0.0018259273,0.0011403608,0.0011632334,0.0038236808,0.0028242078,0.0063800025],"category_scores_gemma":[0.0067914305,0.0010595431,0.0010814726,0.0015157827,0.0013353201,0.0019307386,0.0025553654,0.0015788977,0.00109941],"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.0002294739,0.00022055538,0.0005663594,0.00018571936,0.00008684491,0.00008629177,0.00017093138,0.8013068,0.004302572,0.024486864,0.005962858,0.16239476],"study_design_scores_gemma":[0.000024110795,0.000016175987,0.000043772787,0.0000073546607,0.000007649337,0.000011622783,0.000012152633,0.9921497,0.00038631304,0.007038165,0.00029742706,0.000005564093],"about_ca_topic_score_codex":0.0076380707,"about_ca_topic_score_gemma":0.015995076,"teacher_disagreement_score":0.0076380707,"about_ca_system_score_codex":0.0017789885,"about_ca_system_score_gemma":0.0024761904,"threshold_uncertainty_score":0.021343172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015700327,0.0005650067,0.969042,0.0016947881,0.00008717721,0.00011903173,0.000883287,0.00040262926,0.011505802],"genre_scores_gemma":[0.73888224,0.003448548,0.20870459,0.0009254043,0.0005195595,0.0015066576,0.0026918787,0.0005044984,0.042816516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982198,0.00084883586,0.00007221227,0.00039399558,0.00029010407,0.00017503768],"domain_scores_gemma":[0.991083,0.006369921,0.0012973252,0.00052109355,0.00049046933,0.00023818323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003491926,0.0011889281,0.0010689384,0.0028652588,0.00096196414,0.0023536258,0.0031473523,0.002442371,0.011558739],"category_scores_gemma":[0.016336665,0.00088614976,0.001990721,0.0030710818,0.001764076,0.0060677314,0.0015024021,0.0028216573,0.0023654904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014575836,0.000025360394,0.00091645034,0.00004405053,0.000035780875,0.0001206931,0.00022557515,0.18676886,0.00019916926,0.8015397,0.0024518387,0.0076579857],"study_design_scores_gemma":[0.000013460264,0.000013310922,0.0003722922,0.000016058335,0.000014302968,0.00006461068,0.00004473373,0.608521,0.00005022325,0.3858099,0.0050636204,0.000016486278],"about_ca_topic_score_codex":0.014197051,"about_ca_topic_score_gemma":0.015747823,"teacher_disagreement_score":0.014197051,"about_ca_system_score_codex":0.003033053,"about_ca_system_score_gemma":0.0010339331,"threshold_uncertainty_score":0.038667858},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36087108,0.002667107,0.6172267,0.0053245267,0.00015202297,0.000054916432,0.00010221779,0.0002454672,0.013355921],"genre_scores_gemma":[0.987135,0.00051936187,0.011469419,0.00016615134,0.00008838827,0.00003304284,0.000023591332,0.00001692923,0.0005480874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905056,0.00043932904,0.000035727026,0.00020659724,0.00018807017,0.00007967585],"domain_scores_gemma":[0.9895326,0.0076591144,0.0014282156,0.00076826115,0.0003525056,0.0002593966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014855299,0.00030976709,0.0003989576,0.0010755556,0.0005988245,0.0014966605,0.0006711582,0.0007805348,0.00082876044],"category_scores_gemma":[0.012430515,0.0003434874,0.00044916043,0.00048094869,0.0040788646,0.0034352834,0.0015806486,0.0012774208,0.00008517511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077035176,0.000024392644,0.0024789209,0.00008586211,0.000038792874,0.00028864745,0.00044283827,0.026934741,0.003531741,0.95530146,0.0005560017,0.010239586],"study_design_scores_gemma":[0.000019135427,0.000024238634,0.0011024498,0.00001912293,0.000010683734,0.00012941648,0.00007236851,0.12916616,0.00093579135,0.8668096,0.0016911324,0.000019933479],"about_ca_topic_score_codex":0.0008156453,"about_ca_topic_score_gemma":0.00038767196,"teacher_disagreement_score":0.0014966605,"about_ca_system_score_codex":0.00083328865,"about_ca_system_score_gemma":0.00028460287,"threshold_uncertainty_score":0.007856309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19622362,0.0006384385,0.7992406,0.00053291995,0.000035159148,0.00023712733,0.000323349,0.00071593287,0.0020528687],"genre_scores_gemma":[0.5998061,0.0003514121,0.39751884,0.00009110214,0.000024681547,0.00016991656,0.0006808067,0.00012829817,0.0012288278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951005,0.00013886749,0.00002662264,0.00013988205,0.00010794619,0.00007670132],"domain_scores_gemma":[0.9953211,0.0034079975,0.000533241,0.00020624905,0.00034725902,0.0001841342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012368438,0.0010884207,0.000881691,0.0019585786,0.0010330982,0.001131134,0.0012448967,0.0010833921,0.0013653979],"category_scores_gemma":[0.0068832072,0.00079112547,0.00056599296,0.0011402017,0.0010206098,0.002070001,0.0015072619,0.00084842223,0.00022523288],"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.00019035414,0.00006949866,0.004823625,0.0002694609,0.0000685352,0.00026862905,0.0002739563,0.9104361,0.0053186784,0.013272176,0.0020244608,0.06298451],"study_design_scores_gemma":[0.000012823483,0.000018610717,0.00037829587,0.000009349831,0.000010018687,0.000042086744,0.000082101804,0.98362213,0.0012841413,0.014001749,0.00053333084,0.000005344502],"about_ca_topic_score_codex":0.008271876,"about_ca_topic_score_gemma":0.009627126,"teacher_disagreement_score":0.008271876,"about_ca_system_score_codex":0.0013525106,"about_ca_system_score_gemma":0.0014504036,"threshold_uncertainty_score":0.016447425},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34069324,0.0005257725,0.65336156,0.0012662698,0.00010042424,0.0003155511,0.0007108975,0.0016158773,0.0014104405],"genre_scores_gemma":[0.87748295,0.00017346247,0.12098844,0.00013013501,0.00006982532,0.0001626047,0.0006857718,0.00008734102,0.00021936158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98364097,0.0091738105,0.0011454769,0.0025806362,0.0029816325,0.00047749217],"domain_scores_gemma":[0.7159052,0.25008973,0.012420502,0.015499149,0.0050829267,0.0010025919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025754044,0.000990683,0.0013234302,0.0058695525,0.0010329925,0.0027710313,0.0015892304,0.0016352229,0.0010806317],"category_scores_gemma":[0.16074575,0.00038035362,0.0012474695,0.0032627503,0.002625722,0.0036776036,0.0014869438,0.0018756784,0.00030553326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002390764,0.0012553382,0.2551666,0.0012917557,0.0023294985,0.0012123234,0.0010508638,0.27505657,0.029929802,0.049447842,0.0041806796,0.3766879],"study_design_scores_gemma":[0.00012156268,0.00060224143,0.021153048,0.000079265395,0.00026691318,0.0005961881,0.00040629265,0.82434857,0.01860836,0.13227539,0.0014637825,0.000078393416],"about_ca_topic_score_codex":0.0005333002,"about_ca_topic_score_gemma":0.00064570276,"teacher_disagreement_score":0.025754044,"about_ca_system_score_codex":0.0009152963,"about_ca_system_score_gemma":0.0012731514,"threshold_uncertainty_score":0.13620204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50757164,0.005733598,0.45304352,0.0061219214,0.00017914052,0.000103737715,0.00035385392,0.0008761218,0.026016379],"genre_scores_gemma":[0.9843352,0.0013369776,0.011001649,0.00019877002,0.00013006982,0.00009615017,0.00012748643,0.000084610125,0.002689069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994862,0.00024222893,0.000013365566,0.00008596885,0.00009657455,0.00007565353],"domain_scores_gemma":[0.98935205,0.008721293,0.00075927057,0.00045469924,0.00032156406,0.00039106383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010978956,0.0007554096,0.00078521686,0.0022872777,0.00081768737,0.0017912289,0.0009874504,0.0010757553,0.0017383852],"category_scores_gemma":[0.013540031,0.0005840236,0.00051051093,0.0010183437,0.0029191137,0.00277272,0.0015191624,0.0015520183,0.00029962574],"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.00019544302,0.000055489178,0.0033264768,0.0002740431,0.000072836825,0.00040889293,0.0004986764,0.15001577,0.0061372733,0.8201678,0.0053481287,0.01349917],"study_design_scores_gemma":[0.000024497476,0.000023483064,0.0012620514,0.00003588808,0.000025819154,0.000106778156,0.00007813152,0.3616885,0.001245923,0.63416743,0.0013147566,0.000026687514],"about_ca_topic_score_codex":0.0023904718,"about_ca_topic_score_gemma":0.0029941895,"teacher_disagreement_score":0.0023904718,"about_ca_system_score_codex":0.0013378443,"about_ca_system_score_gemma":0.00062631356,"threshold_uncertainty_score":0.009706736},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99293184,0.00017407426,0.0039423276,0.0001490796,0.0000070001083,0.000018728439,0.0011545467,0.00003684616,0.0015855423],"genre_scores_gemma":[0.99789786,0.000101388105,0.00057227904,0.0000070516626,0.0000067204255,0.000011712976,0.0010676449,0.0000034496006,0.00033188888],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996418,0.00008756644,0.000019841067,0.00009727169,0.000072576855,0.00008100804],"domain_scores_gemma":[0.9980996,0.0005774631,0.0005209897,0.00014296596,0.00045404036,0.00020493698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074680394,0.00025466067,0.0002766354,0.0031467208,0.0005189904,0.00060244225,0.0004773797,0.0002169063,0.0015818449],"category_scores_gemma":[0.0032405192,0.00013316657,0.00040803416,0.0031588916,0.0004483045,0.00065251265,0.0004986302,0.000214092,0.00010620674],"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.00023636689,0.0000591591,0.68561995,0.00017557775,0.00031493366,0.0010376683,0.00058812666,0.24899013,0.0030167776,0.026690515,0.0048238253,0.028446907],"study_design_scores_gemma":[0.000012616104,0.000057933106,0.51526487,0.000015159046,0.00007391026,0.00024559154,0.00032349504,0.4736112,0.0005702191,0.006834517,0.0029575964,0.00003296078],"about_ca_topic_score_codex":0.050391283,"about_ca_topic_score_gemma":0.028428003,"teacher_disagreement_score":0.050391283,"about_ca_system_score_codex":0.0018571331,"about_ca_system_score_gemma":0.0007304939,"threshold_uncertainty_score":0.100195944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14295807,0.0018092567,0.84994304,0.0012196177,0.000028964025,0.000102025246,0.00031786878,0.0003535058,0.0032676626],"genre_scores_gemma":[0.8370063,0.003247323,0.15539236,0.00019402342,0.00013826785,0.00025700912,0.00055669143,0.00009236221,0.003115666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989724,0.00041837714,0.000040388386,0.00030198673,0.00018334614,0.000083426115],"domain_scores_gemma":[0.9859963,0.010754988,0.0019648501,0.0006619264,0.0003401033,0.00028188183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012952369,0.0005748829,0.0007092468,0.0028862802,0.001046614,0.0016597962,0.0012152687,0.0017146596,0.0021345639],"category_scores_gemma":[0.017174333,0.0006784513,0.0006457,0.0025651897,0.002553221,0.006174429,0.001674468,0.0013167533,0.00032165667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012650408,0.00009719266,0.005901136,0.00058366894,0.00015210545,0.0003976655,0.0010049421,0.39450252,0.002770934,0.5284058,0.003310152,0.06274743],"study_design_scores_gemma":[0.00001892806,0.000027925238,0.0007800635,0.000031665026,0.000018565162,0.00013734776,0.00014114994,0.28294933,0.00044815964,0.7137813,0.001649494,0.000016197764],"about_ca_topic_score_codex":0.0016315364,"about_ca_topic_score_gemma":0.0017069766,"teacher_disagreement_score":0.0028862802,"about_ca_system_score_codex":0.0009548745,"about_ca_system_score_gemma":0.0006098932,"threshold_uncertainty_score":0.0071408153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09371702,0.0005999329,0.89959973,0.0003112818,0.000079244295,0.000047880363,0.000018138931,0.00023266308,0.0053941985],"genre_scores_gemma":[0.9626552,0.00021507214,0.035567053,0.000055544428,0.000021833292,0.000064622574,0.000015176127,0.000017909035,0.001387694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973947,0.00008929953,0.000015117171,0.000050833813,0.00007417318,0.00003117441],"domain_scores_gemma":[0.9990637,0.00059494283,0.00012035799,0.000050460203,0.00013007251,0.00004044434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097134383,0.00044685643,0.00039105729,0.00038203722,0.0003193829,0.0007261411,0.00087516377,0.00075300323,0.0010802827],"category_scores_gemma":[0.0033364997,0.00018576998,0.00030700868,0.00028587368,0.00076975167,0.0006931587,0.00056886266,0.00074528216,0.00010601773],"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.000029040511,0.000024098998,0.00032283887,0.000026285277,0.000028344559,0.00003657098,0.000046247773,0.95505303,0.0018578253,0.019385256,0.00021261604,0.022977943],"study_design_scores_gemma":[0.0000046628734,0.000018342378,0.000060290153,0.0000020070304,0.000003018158,0.000006722316,0.0000048007464,0.99637055,0.00019395087,0.0031571244,0.00017621323,0.0000024046908],"about_ca_topic_score_codex":0.002169601,"about_ca_topic_score_gemma":0.0019316698,"teacher_disagreement_score":0.002169601,"about_ca_system_score_codex":0.0005342965,"about_ca_system_score_gemma":0.00045204168,"threshold_uncertainty_score":0.0051370263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.773357,0.0024462938,0.15986995,0.008723209,0.00045040296,0.0003408311,0.03735165,0.0056894342,0.0117712105],"genre_scores_gemma":[0.78897893,0.00040225888,0.17211144,0.00050408347,0.00014868144,0.00016652945,0.03327774,0.00022317599,0.004187123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806076,0.0009899574,0.00010123073,0.00032941578,0.00035733846,0.00016130347],"domain_scores_gemma":[0.9942502,0.0028426743,0.0004326567,0.0013289165,0.00083176425,0.00031387116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035727895,0.000661746,0.0006000012,0.0028556813,0.00072786066,0.0011755017,0.000972285,0.0020733015,0.0015466125],"category_scores_gemma":[0.011681488,0.00015806411,0.00072841306,0.0026705714,0.00070448144,0.0016773815,0.00096258614,0.0014348631,0.00078661623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026938182,0.0018129076,0.091418356,0.0013463793,0.00057432504,0.0037148392,0.0033969642,0.21978118,0.01176333,0.04681448,0.2321647,0.38451874],"study_design_scores_gemma":[0.00019634291,0.00024580295,0.03261561,0.00013532508,0.000058333007,0.0011586712,0.0016370674,0.8340096,0.0063081533,0.06659203,0.05694987,0.000093225215],"about_ca_topic_score_codex":0.0075277537,"about_ca_topic_score_gemma":0.015186346,"teacher_disagreement_score":0.0075277537,"about_ca_system_score_codex":0.000825004,"about_ca_system_score_gemma":0.00042853065,"threshold_uncertainty_score":0.01889497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44961053,0.0024745697,0.52642244,0.0028450836,0.00011877884,0.00018232054,0.0004073065,0.00029933933,0.017639654],"genre_scores_gemma":[0.9685364,0.00241289,0.01962451,0.00021201976,0.00036357692,0.0002214512,0.00020768726,0.0001125978,0.008308858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979559,0.0009279978,0.00007036611,0.0004614639,0.00034687808,0.00023739984],"domain_scores_gemma":[0.88070196,0.105408825,0.0049371854,0.004141895,0.0026143813,0.0021957553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057675834,0.0012789926,0.0019932825,0.0047505964,0.0020019743,0.0028167616,0.0035792089,0.0027032888,0.006332215],"category_scores_gemma":[0.0694628,0.0012873631,0.0012335406,0.0031161786,0.0073488764,0.011565044,0.0039343606,0.0033230598,0.0005763678],"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.00023234572,0.00013719632,0.0052962825,0.00030522924,0.00015020408,0.0003862966,0.0015325155,0.16798213,0.0021840637,0.7968247,0.0022090059,0.02276004],"study_design_scores_gemma":[0.00004452876,0.00006557581,0.0025853342,0.000060701583,0.00005881088,0.00016366389,0.00022187184,0.44621846,0.00041646545,0.54917145,0.0009480838,0.000045075958],"about_ca_topic_score_codex":0.0057788026,"about_ca_topic_score_gemma":0.0036539864,"teacher_disagreement_score":0.006332215,"about_ca_system_score_codex":0.0019403759,"about_ca_system_score_gemma":0.0008147353,"threshold_uncertainty_score":0.03050226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69774306,0.000270813,0.28262097,0.0012749601,0.00007345202,0.000067450754,0.0003077764,0.00015175017,0.017489832],"genre_scores_gemma":[0.986034,0.00016610204,0.011255691,0.000055716115,0.000030172127,0.000049238606,0.00005969019,0.000013017253,0.0023363046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976856,0.000084641935,0.000008303984,0.000048914353,0.000050506158,0.000039021623],"domain_scores_gemma":[0.99892163,0.00044106986,0.0002078255,0.000106727806,0.00017277156,0.00015002581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043882758,0.000154126,0.00020586878,0.00063856214,0.0006283461,0.0007512834,0.0004344971,0.00054621894,0.0017381931],"category_scores_gemma":[0.0020779634,0.00016446812,0.00025304875,0.00038827906,0.001097285,0.0019650897,0.0005377483,0.00043021474,0.0001279046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011116965,0.000039312326,0.0013057335,0.00005691907,0.000025070929,0.00021207704,0.00020426743,0.10021987,0.016472468,0.8738257,0.0007485811,0.0067789326],"study_design_scores_gemma":[0.00003696619,0.00007776736,0.0015270485,0.000013808752,0.000019851082,0.00017970332,0.000073827854,0.7147533,0.0036733968,0.27745953,0.002146197,0.00003861729],"about_ca_topic_score_codex":0.0010924455,"about_ca_topic_score_gemma":0.00067569694,"teacher_disagreement_score":0.0017381931,"about_ca_system_score_codex":0.0006629902,"about_ca_system_score_gemma":0.00042194076,"threshold_uncertainty_score":0.0058148503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9073128,0.0009480426,0.08655733,0.000768468,0.000027732765,0.000029221408,0.00018024717,0.000077162505,0.0040989947],"genre_scores_gemma":[0.9971752,0.0002510271,0.0016300448,0.00002103438,0.000038805618,0.000024134306,0.000075850294,0.0000058730207,0.00077802734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987864,0.0005678787,0.000046358567,0.00031467775,0.00016715199,0.000117601405],"domain_scores_gemma":[0.9758168,0.018791893,0.0028499109,0.00094601716,0.0005874839,0.0010079582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027412456,0.000319811,0.0009509655,0.0024865153,0.0011292859,0.0029740892,0.0009183406,0.001345016,0.0029391912],"category_scores_gemma":[0.021807881,0.000481219,0.0005885841,0.0024787642,0.0026160744,0.0057075736,0.0020121185,0.001326942,0.0002657725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005385125,0.0004019169,0.19709174,0.0003097668,0.0014744538,0.0009219292,0.0046618376,0.15038049,0.0042430386,0.5640959,0.0026230619,0.07325738],"study_design_scores_gemma":[0.000046801833,0.00014761546,0.11068194,0.00006682995,0.00026851043,0.00038692466,0.001380967,0.3856607,0.0005166875,0.49936464,0.0013974867,0.000080797174],"about_ca_topic_score_codex":0.0018819028,"about_ca_topic_score_gemma":0.00307112,"teacher_disagreement_score":0.0029740892,"about_ca_system_score_codex":0.000952023,"about_ca_system_score_gemma":0.00041815857,"threshold_uncertainty_score":0.01449728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7654962,0.00058471854,0.22769573,0.0011510624,0.000042504445,0.00014594493,0.00078892265,0.0004190408,0.003675934],"genre_scores_gemma":[0.968563,0.00016043347,0.030669805,0.000043888896,0.000027593984,0.00006634583,0.00022194613,0.000025422514,0.00022160857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814534,0.00095308054,0.00009615725,0.0003724887,0.00034101272,0.00009198203],"domain_scores_gemma":[0.96819156,0.023591567,0.0034183182,0.003041884,0.0011166767,0.00064008404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002883464,0.0006456419,0.00060873723,0.0019443933,0.0007140981,0.0020169828,0.000618363,0.0008302634,0.0010240414],"category_scores_gemma":[0.03889708,0.0004171382,0.00068507827,0.0014020309,0.0014507994,0.004565121,0.0012997573,0.001175873,0.00019949579],"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.00081741833,0.00066651707,0.19728109,0.0006769002,0.000578863,0.0003418228,0.0029103688,0.5034704,0.01780199,0.15968946,0.004135329,0.111629836],"study_design_scores_gemma":[0.000024021458,0.00012096403,0.015606634,0.000037687656,0.000034397635,0.00019845809,0.00025622253,0.8820681,0.0021202452,0.09863889,0.00083634816,0.000057991485],"about_ca_topic_score_codex":0.0019446745,"about_ca_topic_score_gemma":0.0018530972,"teacher_disagreement_score":0.002883464,"about_ca_system_score_codex":0.0012111841,"about_ca_system_score_gemma":0.00052783574,"threshold_uncertainty_score":0.0152493715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96692765,0.0006152472,0.025957068,0.0011857803,0.00009795669,0.000019283041,0.00018006687,0.0002973334,0.004719647],"genre_scores_gemma":[0.9989422,0.00010697651,0.00050843623,0.000039940933,0.000026054933,0.0000030748897,0.00003644336,0.000024093979,0.00031269633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794596,0.000738513,0.000060887305,0.0001792406,0.0005038172,0.00057153235],"domain_scores_gemma":[0.9181983,0.072324574,0.0022549878,0.0020203644,0.004101708,0.0011001697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003711974,0.000567861,0.00068785215,0.0008489103,0.0008372236,0.0014859693,0.00089301413,0.0015502697,0.0018670718],"category_scores_gemma":[0.04076438,0.00049407716,0.00030015013,0.0010671954,0.0012265221,0.0027614357,0.00076344504,0.0011354376,0.00033886553],"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.0020366625,0.0006528747,0.027011923,0.00014791451,0.00011730487,0.0006347535,0.0001795539,0.889764,0.026636425,0.016284244,0.0022189645,0.034315314],"study_design_scores_gemma":[0.000027524991,0.0002270435,0.009354459,0.000010090221,0.00006253971,0.0002512112,0.00011101345,0.97797376,0.005656162,0.0060941316,0.00020415559,0.000027960497],"about_ca_topic_score_codex":0.0030191448,"about_ca_topic_score_gemma":0.003596453,"teacher_disagreement_score":0.003711974,"about_ca_system_score_codex":0.0019619453,"about_ca_system_score_gemma":0.0011670347,"threshold_uncertainty_score":0.019631028},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6861919,0.00046398104,0.26847717,0.0009781204,0.00021982378,0.00012876345,0.0005253614,0.00028721397,0.04272763],"genre_scores_gemma":[0.96296203,0.00024151159,0.02102749,0.00009781375,0.000040351635,0.000046578047,0.00021755716,0.000053164997,0.0153133515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995591,0.00013792794,0.000010756482,0.00009386146,0.00005444924,0.00014394677],"domain_scores_gemma":[0.9980276,0.0010753248,0.00018937353,0.00019784873,0.00021610191,0.00029369458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054923334,0.00039985887,0.00060603843,0.00064037094,0.00094498857,0.0014350223,0.0011551523,0.0008704035,0.007821722],"category_scores_gemma":[0.0040828683,0.00028745722,0.00048442336,0.00068681914,0.00095563126,0.0021143497,0.0011139362,0.00077594724,0.0006882305],"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.0008331983,0.00011159483,0.0044066105,0.000098668424,0.00006240757,0.00033136463,0.0002992408,0.81800103,0.0023020643,0.14610374,0.005976971,0.021473074],"study_design_scores_gemma":[0.000034050052,0.00004262516,0.0006391528,0.000009349085,0.000008669585,0.00004164462,0.00020788462,0.93969506,0.00039373417,0.0577499,0.0011668523,0.000011088537],"about_ca_topic_score_codex":0.012078209,"about_ca_topic_score_gemma":0.007817409,"teacher_disagreement_score":0.012078209,"about_ca_system_score_codex":0.0009552035,"about_ca_system_score_gemma":0.0004949947,"threshold_uncertainty_score":0.0261662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32778198,0.0012327231,0.61629117,0.00500333,0.00010365933,0.0003578415,0.00036603486,0.00023922534,0.048624065],"genre_scores_gemma":[0.9131515,0.0006468485,0.08232857,0.00015598604,0.000056500976,0.00027816696,0.00022983523,0.000047216436,0.0031053112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943024,0.0037027462,0.0002620447,0.0007497167,0.0007090567,0.00027400782],"domain_scores_gemma":[0.9636001,0.02790678,0.0032934002,0.0023036906,0.002209473,0.0006864582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005942796,0.00056644634,0.00043215312,0.0026659046,0.0021664824,0.0049513136,0.0010232584,0.0015921057,0.0037477822],"category_scores_gemma":[0.03463476,0.000510755,0.0005620629,0.0022275236,0.004585901,0.014852831,0.002353338,0.0013248357,0.0004995941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013929683,0.00007981921,0.02070694,0.00034188267,0.000048370388,0.0004755698,0.044813912,0.025833111,0.0026679684,0.8229141,0.0011785489,0.080800414],"study_design_scores_gemma":[0.000024071407,0.00008238739,0.011511782,0.00025027667,0.000048515798,0.00038794783,0.016492972,0.09654647,0.0019103859,0.84551525,0.027165983,0.0000640185],"about_ca_topic_score_codex":0.0073814895,"about_ca_topic_score_gemma":0.004521142,"teacher_disagreement_score":0.0073814895,"about_ca_system_score_codex":0.0024651603,"about_ca_system_score_gemma":0.0026155491,"threshold_uncertainty_score":0.031428874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10978285,0.0014353805,0.85947347,0.0021138485,0.00020438875,0.00019133533,0.002166583,0.0011323657,0.023499748],"genre_scores_gemma":[0.8782428,0.001605729,0.08309688,0.00032741236,0.00024689035,0.0003661369,0.0012989101,0.00033216138,0.034483187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992204,0.00030226976,0.00002397767,0.00023200328,0.00012529049,0.00009607382],"domain_scores_gemma":[0.9974529,0.0016104674,0.00024982603,0.00020334804,0.0003051274,0.00017830796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001236561,0.0011259479,0.0019499849,0.0021767467,0.00095782126,0.0021992538,0.0039062407,0.0030626433,0.005845345],"category_scores_gemma":[0.004911664,0.0010675123,0.0013943844,0.0030467194,0.001369641,0.0037911332,0.0013862804,0.0016033936,0.0013951953],"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.0001305284,0.000095181014,0.00088902976,0.00011088358,0.000087003486,0.00028219013,0.000104884406,0.87588763,0.0007889451,0.107140064,0.0034784754,0.011005181],"study_design_scores_gemma":[0.000015401163,0.000010548352,0.000090320704,0.000005116757,0.000024448498,0.00002979532,0.000010787939,0.98184913,0.00006217059,0.017334856,0.0005608419,0.0000065509894],"about_ca_topic_score_codex":0.024579333,"about_ca_topic_score_gemma":0.019746535,"teacher_disagreement_score":0.024579333,"about_ca_system_score_codex":0.0018590541,"about_ca_system_score_gemma":0.0012262523,"threshold_uncertainty_score":0.04887253},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6377337,0.0018824035,0.34688637,0.0016361806,0.00010114694,0.00022351537,0.0031941023,0.0017393581,0.006603291],"genre_scores_gemma":[0.909773,0.0007571971,0.08573013,0.00011601578,0.000055440665,0.0001530795,0.0023811217,0.000059642163,0.0009744817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975048,0.0005302906,0.00015978204,0.0007780555,0.0008404338,0.0001865675],"domain_scores_gemma":[0.9888166,0.005899236,0.0023413007,0.0011718125,0.0014010497,0.00036998876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002329801,0.00054012716,0.00060305087,0.0068758633,0.0010274197,0.0024442738,0.0010744194,0.0011589768,0.00057405664],"category_scores_gemma":[0.021814805,0.00044029072,0.00036399846,0.0057888217,0.00075521454,0.004301744,0.0015724585,0.0011013435,0.00028787766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005041123,0.00036037658,0.20350371,0.0004875328,0.0004140254,0.0008707986,0.002499102,0.34724075,0.021948883,0.041002873,0.00972922,0.3714386],"study_design_scores_gemma":[0.00001710423,0.0000771511,0.045150746,0.000045764646,0.00006516463,0.00047374042,0.000702506,0.8970203,0.0069257733,0.038862318,0.010613358,0.0000461337],"about_ca_topic_score_codex":0.0079164505,"about_ca_topic_score_gemma":0.0061946334,"teacher_disagreement_score":0.0079164505,"about_ca_system_score_codex":0.0015428858,"about_ca_system_score_gemma":0.0006115862,"threshold_uncertainty_score":0.015740752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056266636,0.00075911765,0.93303114,0.00087021186,0.000039820137,0.00020247808,0.0004332759,0.00033072795,0.008066624],"genre_scores_gemma":[0.87259126,0.0013681393,0.119927496,0.00016713206,0.00014056466,0.00039317764,0.0004760534,0.00015949161,0.0047767083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973144,0.0012562928,0.00011125611,0.0006160354,0.0004142391,0.00028774753],"domain_scores_gemma":[0.9936138,0.004898745,0.0005555939,0.00031703798,0.00033003476,0.0002848338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034018718,0.0017585384,0.00189818,0.0015790277,0.0008175818,0.0028658407,0.0019383073,0.0015013496,0.0029199228],"category_scores_gemma":[0.012356299,0.00064993976,0.0009981708,0.0025309066,0.0016766726,0.0050519938,0.0017729165,0.0011222328,0.0005165937],"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.00015495063,0.000080245925,0.0012592635,0.00025725708,0.00012310625,0.00014615661,0.00018466466,0.8185566,0.0018072046,0.13197728,0.0026130844,0.042840216],"study_design_scores_gemma":[0.000019848188,0.000036676178,0.00025006317,0.0000135643895,0.000019523874,0.00005015679,0.00003446384,0.8717761,0.0006695133,0.12612832,0.0009894388,0.0000122730125],"about_ca_topic_score_codex":0.001825665,"about_ca_topic_score_gemma":0.0012217264,"teacher_disagreement_score":0.0034018718,"about_ca_system_score_codex":0.0032159002,"about_ca_system_score_gemma":0.0014064293,"threshold_uncertainty_score":0.023333073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7027079,0.003013697,0.2683566,0.0019549,0.00004013366,0.00018956543,0.0005049703,0.00050722307,0.022725042],"genre_scores_gemma":[0.9855951,0.00031646778,0.012173415,0.00003951061,0.000031296593,0.000075636104,0.00015157234,0.000032991888,0.0015840519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9946241,0.0024382768,0.00040363407,0.000997095,0.0012288861,0.0003081076],"domain_scores_gemma":[0.9767702,0.013940188,0.004365804,0.0025777165,0.0014848297,0.00086120487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005292034,0.0004243582,0.00066132896,0.004067993,0.0020044376,0.004568017,0.0011266286,0.0011473409,0.0016619207],"category_scores_gemma":[0.025031116,0.00056879706,0.00073813234,0.0046724705,0.0030453787,0.0074248225,0.003328995,0.0006471768,0.00048822438],"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.00060465647,0.000416432,0.18546757,0.00067587564,0.000484295,0.0018067501,0.038889907,0.08919064,0.018334858,0.40039998,0.0032000695,0.26052904],"study_design_scores_gemma":[0.000080871396,0.00024937835,0.0918602,0.0001420831,0.0001887402,0.0017882759,0.010365161,0.4625142,0.0050715627,0.3909762,0.03652223,0.00024109939],"about_ca_topic_score_codex":0.010757924,"about_ca_topic_score_gemma":0.005832062,"teacher_disagreement_score":0.010757924,"about_ca_system_score_codex":0.0027167033,"about_ca_system_score_gemma":0.0011571716,"threshold_uncertainty_score":0.027987242},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28146282,0.001730417,0.7058053,0.0005154145,0.00015020402,0.00027305447,0.0012215445,0.00066912005,0.008172127],"genre_scores_gemma":[0.8948238,0.0009289723,0.10153189,0.000104400686,0.00017923192,0.00020525344,0.00067217235,0.00013358553,0.0014207399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992174,0.00020908777,0.000054068787,0.0001873675,0.00024802238,0.00008408909],"domain_scores_gemma":[0.9909247,0.0051626656,0.0014842111,0.0006679609,0.0008925443,0.0008678621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020288725,0.0012619165,0.0012407429,0.009394812,0.0007750047,0.0016308111,0.0015484432,0.0013832459,0.002589289],"category_scores_gemma":[0.01690777,0.000389369,0.00045993202,0.0037267173,0.0021143437,0.0045062746,0.002086134,0.0014661365,0.0004415963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006551793,0.00025351325,0.049876787,0.0011476954,0.00042096392,0.0007740471,0.0014559374,0.14096707,0.03889985,0.5237975,0.012541932,0.22920956],"study_design_scores_gemma":[0.000085468615,0.0003286665,0.018514095,0.00021514735,0.00023239259,0.00080033665,0.0004934153,0.5382436,0.006822294,0.42858356,0.0055400017,0.00014104943],"about_ca_topic_score_codex":0.0009297339,"about_ca_topic_score_gemma":0.0011967483,"teacher_disagreement_score":0.009394812,"about_ca_system_score_codex":0.0008539789,"about_ca_system_score_gemma":0.00078002474,"threshold_uncertainty_score":0.01072979},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013035471,0.001106972,0.98241454,0.0010676681,0.00045880897,0.00015767507,0.0001773003,0.00036871768,0.0012128272],"genre_scores_gemma":[0.55841845,0.0015903148,0.42939377,0.0030858074,0.0012005745,0.0010286741,0.0008122456,0.0003820747,0.0040882025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9725424,0.018254638,0.001158369,0.003457364,0.0040245894,0.00056273356],"domain_scores_gemma":[0.8127549,0.15487109,0.007563912,0.01717614,0.0069139316,0.00071991625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.053362943,0.000985488,0.0017478298,0.0020738225,0.001121138,0.0023063987,0.002341002,0.001940022,0.0017038268],"category_scores_gemma":[0.25691313,0.0008615612,0.0010249272,0.0029247538,0.0028590818,0.0045542284,0.0028942516,0.0029228507,0.00065552664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010836585,0.00026046328,0.06111751,0.0017686132,0.00161141,0.001844329,0.002093448,0.18717782,0.005235617,0.39581662,0.018713892,0.3232767],"study_design_scores_gemma":[0.00019585021,0.00028813415,0.010555222,0.00036411654,0.00027230126,0.000863247,0.00037666893,0.5855778,0.006137665,0.37881863,0.01642889,0.00012155873],"about_ca_topic_score_codex":0.002482749,"about_ca_topic_score_gemma":0.0019733207,"teacher_disagreement_score":0.053362943,"about_ca_system_score_codex":0.001225923,"about_ca_system_score_gemma":0.0014747762,"threshold_uncertainty_score":0.28221363},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07580879,0.0019463033,0.91421115,0.00062024634,0.00015875361,0.00019288802,0.00093335466,0.00032822686,0.005800202],"genre_scores_gemma":[0.7537138,0.0010781299,0.24102254,0.00015270643,0.0002924506,0.00043505253,0.001142388,0.000086450375,0.0020764945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944483,0.0016707315,0.0006045641,0.0011189312,0.0019240403,0.00023338251],"domain_scores_gemma":[0.9771951,0.013817538,0.0036302884,0.0018009543,0.0026421694,0.0009139552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038396304,0.00069150334,0.0013152775,0.011074521,0.0013745113,0.002740178,0.0015529527,0.0017523658,0.0018729441],"category_scores_gemma":[0.032074396,0.00031584947,0.0011381594,0.0090886485,0.0021096708,0.007017801,0.0028017755,0.0017762698,0.00039485935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040597972,0.00026032914,0.046768233,0.0010094143,0.0006062239,0.00062023115,0.0020460722,0.17683032,0.011835598,0.47451854,0.006101401,0.27899754],"study_design_scores_gemma":[0.000061820254,0.00049177324,0.019656422,0.00022749125,0.00021218768,0.0025960244,0.00073473464,0.6337278,0.0077859233,0.30874482,0.025497468,0.0002634822],"about_ca_topic_score_codex":0.0008318916,"about_ca_topic_score_gemma":0.00071753486,"teacher_disagreement_score":0.011074521,"about_ca_system_score_codex":0.0015673834,"about_ca_system_score_gemma":0.000767845,"threshold_uncertainty_score":0.02030611},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7114566,0.006146462,0.112013936,0.016146643,0.000727431,0.00007748238,0.0014550778,0.00044978343,0.15152664],"genre_scores_gemma":[0.9886291,0.00048473832,0.003367412,0.00013573091,0.00007465865,0.000014683744,0.000114286195,0.00007532455,0.0071040634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838173,0.00065619644,0.00005452387,0.0002583354,0.00037114296,0.0002781761],"domain_scores_gemma":[0.98694754,0.007542004,0.0016321768,0.0015393673,0.0012463965,0.0010924912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014864865,0.0005451488,0.00089843996,0.0012805344,0.0014015363,0.0026579583,0.0013126507,0.0023007658,0.03641143],"category_scores_gemma":[0.029762115,0.0005563611,0.00047495752,0.0012192983,0.0022881364,0.0069592404,0.0021003175,0.0019761522,0.0017435382],"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.0020755543,0.00038781005,0.03998356,0.0005948962,0.0003640424,0.0014302004,0.0015659682,0.0774094,0.0022055025,0.63814384,0.042689297,0.19314997],"study_design_scores_gemma":[0.00008128821,0.00021235278,0.023996862,0.0002481742,0.00020541466,0.0015470543,0.0029749807,0.19468813,0.0011449376,0.7547695,0.020019092,0.00011222857],"about_ca_topic_score_codex":0.005212349,"about_ca_topic_score_gemma":0.0057089785,"teacher_disagreement_score":0.03641143,"about_ca_system_score_codex":0.0011589106,"about_ca_system_score_gemma":0.0006876529,"threshold_uncertainty_score":0.12180841},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23215628,0.00044123022,0.75552803,0.0004730338,0.0000452944,0.00006117127,0.000815424,0.00054094277,0.00993858],"genre_scores_gemma":[0.9490055,0.000468105,0.047168825,0.00008415631,0.00006296239,0.00008405412,0.00085748936,0.00011285462,0.0021560672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996184,0.00012237714,0.000016322972,0.00007649691,0.00012177255,0.0000445328],"domain_scores_gemma":[0.99762875,0.0012071715,0.00031307124,0.0002609019,0.0005082934,0.00008190334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044105656,0.0002932291,0.00028135968,0.0026458688,0.00034022494,0.000914625,0.00033023045,0.0002863712,0.0018914156],"category_scores_gemma":[0.0047937087,0.0001539973,0.000287378,0.0014709934,0.0005643113,0.0011461966,0.00042622496,0.00037591418,0.00032259026],"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.00014185104,0.00012851326,0.008730366,0.00022959692,0.00014125112,0.00049102854,0.0005705377,0.4260563,0.029788695,0.3818632,0.006436755,0.14542192],"study_design_scores_gemma":[0.0000049489963,0.00002026093,0.0054653906,0.00001510438,0.000011578466,0.0001681483,0.00018069947,0.84326744,0.0018181835,0.14610898,0.0029197482,0.000019514539],"about_ca_topic_score_codex":0.0012704191,"about_ca_topic_score_gemma":0.0007685837,"teacher_disagreement_score":0.0026458688,"about_ca_system_score_codex":0.0004649384,"about_ca_system_score_gemma":0.00024817992,"threshold_uncertainty_score":0.0063273907},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021538094,0.00031327433,0.97607577,0.00015517494,0.00004609239,0.00019944971,0.00016708154,0.00034901514,0.001155981],"genre_scores_gemma":[0.29571646,0.0003091135,0.69717133,0.00011453779,0.00018300035,0.00051506975,0.001107141,0.00028457947,0.004598755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99459404,0.002736982,0.00035221622,0.0009792399,0.0010418632,0.00029564576],"domain_scores_gemma":[0.9859607,0.008627022,0.00077639753,0.0018620235,0.0021862967,0.0005874778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006877567,0.0016152797,0.004099999,0.0039549526,0.0019502856,0.002094256,0.0040067486,0.0023176859,0.0038196107],"category_scores_gemma":[0.021518907,0.0012152768,0.0020543993,0.0039373515,0.00157425,0.0038456495,0.003182019,0.0015736672,0.0011818655],"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.0013833086,0.00033263426,0.002699058,0.00039473653,0.00036937918,0.0001339673,0.00032866394,0.73707306,0.0046375664,0.06256887,0.0059676273,0.18411109],"study_design_scores_gemma":[0.00003701494,0.000120823504,0.00037603776,0.000011736492,0.000036382393,0.000050231887,0.000032202104,0.97438014,0.00095369254,0.023157015,0.0008284133,0.000016333915],"about_ca_topic_score_codex":0.0052875997,"about_ca_topic_score_gemma":0.0055788276,"teacher_disagreement_score":0.006877567,"about_ca_system_score_codex":0.0018891754,"about_ca_system_score_gemma":0.0027804794,"threshold_uncertainty_score":0.036372483},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06320065,0.0005175738,0.91864383,0.0031018124,0.00014826375,0.000090380985,0.00067220494,0.00022092479,0.013404354],"genre_scores_gemma":[0.82730216,0.002112366,0.11260974,0.0008864991,0.00042062928,0.00051608245,0.0011017446,0.00026407445,0.054786716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910957,0.00039455216,0.000029302944,0.00023621248,0.00013205183,0.00009820927],"domain_scores_gemma":[0.99353784,0.004340008,0.00053659145,0.00066923327,0.00047528124,0.00044098354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024745713,0.0011349645,0.0015564197,0.001111088,0.0011961648,0.0022202968,0.0042809374,0.0029457244,0.008235074],"category_scores_gemma":[0.010086553,0.00070075586,0.0010145709,0.0017746869,0.0020706188,0.005474994,0.0019159293,0.0032174091,0.0013631061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013339432,0.00008478526,0.0007464024,0.00011905412,0.00003909806,0.00024031571,0.00026669184,0.2635894,0.0014830711,0.7178456,0.0050147735,0.010437431],"study_design_scores_gemma":[0.00004005786,0.000027453758,0.00017387584,0.000014915335,0.000028193283,0.00010975022,0.000044504042,0.6575598,0.00020924884,0.33901986,0.002753515,0.000018899686],"about_ca_topic_score_codex":0.002523747,"about_ca_topic_score_gemma":0.0028079026,"teacher_disagreement_score":0.008235074,"about_ca_system_score_codex":0.0014900168,"about_ca_system_score_gemma":0.0009841636,"threshold_uncertainty_score":0.027549028},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05949329,0.00039674804,0.92444634,0.001504421,0.00007704761,0.00036866192,0.0005944698,0.0008292631,0.012289808],"genre_scores_gemma":[0.7296854,0.00058126805,0.25348356,0.00030412385,0.00029204282,0.0015681731,0.00094446715,0.00016117311,0.0129798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997131,0.0011428688,0.0001447925,0.0008006752,0.00062279915,0.00015785139],"domain_scores_gemma":[0.99011505,0.006461047,0.0008336199,0.0011429102,0.0009748946,0.00047238395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034165937,0.0008648047,0.0008305447,0.005903447,0.0021871305,0.004488715,0.0030029751,0.003343147,0.005531024],"category_scores_gemma":[0.0208583,0.0006778267,0.0014226693,0.0051717185,0.0034195308,0.014318687,0.0022562118,0.0018214918,0.0019065185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030918786,0.00050803466,0.011975975,0.0003681476,0.00021476993,0.0009475948,0.004285922,0.27680805,0.0033310994,0.6110614,0.0069503845,0.08323943],"study_design_scores_gemma":[0.000054202286,0.000064891814,0.0012083997,0.000036687416,0.000035518802,0.00023259562,0.00029779406,0.78550124,0.00029535886,0.2074091,0.0048317094,0.000032541957],"about_ca_topic_score_codex":0.004613891,"about_ca_topic_score_gemma":0.004552132,"teacher_disagreement_score":0.005903447,"about_ca_system_score_codex":0.0019981689,"about_ca_system_score_gemma":0.0010894056,"threshold_uncertainty_score":0.01850307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024871435,0.00007332415,0.9970783,0.000040346495,0.000014593982,0.000014504129,0.000016227208,0.00007665517,0.00019885016],"genre_scores_gemma":[0.23390195,0.0008573569,0.76243573,0.00014908244,0.00016958175,0.00023632907,0.00027954494,0.00014634889,0.0018239947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835736,0.00079343334,0.000071215036,0.00029818175,0.00038707297,0.00009283375],"domain_scores_gemma":[0.992448,0.00586912,0.00064897735,0.0005042638,0.0004109586,0.000118683514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027103093,0.0012928224,0.0011974307,0.0019515946,0.00070499897,0.0012350637,0.002074314,0.0015214846,0.0008781073],"category_scores_gemma":[0.015054601,0.00072557945,0.0011300413,0.0016727153,0.0012148845,0.0027216554,0.0014871506,0.0018507676,0.00042346894],"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.00003897292,0.000051352206,0.0014376524,0.00006860422,0.00009117604,0.00008194641,0.00010848508,0.8689044,0.0016874988,0.079216674,0.0007888014,0.047524463],"study_design_scores_gemma":[0.0000023372259,0.000009576369,0.00006542788,0.0000036740705,0.000005165487,0.000021861213,0.000005437552,0.9854897,0.0001991598,0.013828782,0.00036311522,0.000005757919],"about_ca_topic_score_codex":0.0049302806,"about_ca_topic_score_gemma":0.0036655662,"teacher_disagreement_score":0.0049302806,"about_ca_system_score_codex":0.0010704941,"about_ca_system_score_gemma":0.0009823298,"threshold_uncertainty_score":0.014333665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85086644,0.00041050924,0.14289123,0.00059814187,0.00006878294,0.000090833404,0.002363681,0.00047195866,0.0022384163],"genre_scores_gemma":[0.95578504,0.00025573542,0.04074301,0.000029113118,0.000045055174,0.000035722835,0.002054354,0.000023073946,0.0010289506],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996922,0.00006529901,0.000016899978,0.000104824285,0.00008994367,0.000030841362],"domain_scores_gemma":[0.99618345,0.002304941,0.00062304636,0.00027337193,0.00043607372,0.00017910021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058302865,0.00039132297,0.00037026076,0.002291931,0.00038758805,0.0006190921,0.00045485736,0.0008297454,0.0007486188],"category_scores_gemma":[0.0050442675,0.00021997729,0.00035372647,0.0010576894,0.00031385513,0.0012700248,0.00034505775,0.00055382523,0.00043715083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004494563,0.0003032604,0.5245958,0.0002417141,0.00028082757,0.0010901284,0.0005994878,0.2666146,0.019371768,0.0068614413,0.0054066903,0.17418489],"study_design_scores_gemma":[0.000012174691,0.00012428564,0.08463388,0.000032512253,0.000083118175,0.00051510293,0.0002960561,0.89712745,0.0059964913,0.008224495,0.0029287217,0.00002580589],"about_ca_topic_score_codex":0.0042571533,"about_ca_topic_score_gemma":0.009556669,"teacher_disagreement_score":0.0042571533,"about_ca_system_score_codex":0.0005104199,"about_ca_system_score_gemma":0.00030680915,"threshold_uncertainty_score":0.008464754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8490058,0.0026670296,0.13504176,0.00048481848,0.00006556742,0.00012408003,0.0003550824,0.00014030025,0.012115621],"genre_scores_gemma":[0.986381,0.0007662552,0.012295216,0.000016614711,0.000025151425,0.000035666268,0.00017152051,0.000019579096,0.00028908352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992673,0.00029669658,0.00003766987,0.00008226773,0.00025923713,0.00005690623],"domain_scores_gemma":[0.98659617,0.010652742,0.0010247519,0.0005452022,0.0008988689,0.00028220133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015700803,0.0005276408,0.00044710847,0.003929994,0.00043332778,0.00071544515,0.0004728436,0.0003486724,0.00079766737],"category_scores_gemma":[0.015769383,0.000114076036,0.0003037989,0.0021372866,0.00093407574,0.0020949256,0.0005253036,0.00035361268,0.000065024695],"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.0003437484,0.00016683404,0.039394878,0.0005824097,0.00040432523,0.0005006957,0.00062662666,0.70152575,0.027197193,0.14396246,0.0017082064,0.08358677],"study_design_scores_gemma":[0.000048297094,0.00073567446,0.044725575,0.00008704229,0.00018352772,0.0011669281,0.0006547469,0.79743445,0.01731306,0.13246581,0.005086619,0.00009822369],"about_ca_topic_score_codex":0.0010491333,"about_ca_topic_score_gemma":0.0011247097,"teacher_disagreement_score":0.003929994,"about_ca_system_score_codex":0.00059288373,"about_ca_system_score_gemma":0.00021665082,"threshold_uncertainty_score":0.008303463},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08675489,0.004104891,0.8830133,0.0034616445,0.00018515908,0.00021489401,0.00064721855,0.0007154743,0.020902468],"genre_scores_gemma":[0.8361167,0.0031331743,0.14778359,0.0009032289,0.00039231498,0.0005092291,0.0010369688,0.00034948153,0.009775323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762744,0.00093313295,0.00007569214,0.00038441017,0.0005787316,0.00040068914],"domain_scores_gemma":[0.97849715,0.017381962,0.0013385523,0.001088317,0.0010524961,0.0006415766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004579625,0.002031919,0.002354943,0.0021989378,0.0010442308,0.0025410869,0.003310652,0.002292739,0.0050306446],"category_scores_gemma":[0.034459356,0.0009670316,0.0016529615,0.0021996119,0.0021039906,0.004557448,0.0025703532,0.0033757396,0.0008175923],"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.00034650162,0.0001372323,0.0043935347,0.00035171545,0.00015321143,0.0002154393,0.00040326046,0.8242453,0.0014005345,0.13121386,0.007958494,0.029180944],"study_design_scores_gemma":[0.000015809514,0.000026019807,0.00023281992,0.000027830172,0.000018636334,0.00004190149,0.00003495616,0.96026886,0.00020758128,0.038182873,0.0009356101,0.000007125539],"about_ca_topic_score_codex":0.0062768464,"about_ca_topic_score_gemma":0.006231427,"teacher_disagreement_score":0.0062768464,"about_ca_system_score_codex":0.0045089964,"about_ca_system_score_gemma":0.001581585,"threshold_uncertainty_score":0.03271526},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13678324,0.0036252283,0.8050872,0.008508476,0.0011296979,0.00029612076,0.0014629781,0.0012895073,0.041817438],"genre_scores_gemma":[0.8824765,0.0013542484,0.094884194,0.000648242,0.0007573555,0.00023510853,0.00067899784,0.00027519363,0.018690178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985967,0.0006068227,0.00005057206,0.00048749673,0.00014517388,0.000113168324],"domain_scores_gemma":[0.99549234,0.0028132687,0.0004879098,0.0006235845,0.0003459878,0.00023701396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023866564,0.0006595348,0.00079214154,0.0014854423,0.00079969753,0.00211439,0.0012284402,0.0019866119,0.005991091],"category_scores_gemma":[0.010913975,0.0003610756,0.0008744935,0.001002735,0.0013804514,0.006370038,0.0009979954,0.0012975142,0.0026520947],"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.00073784543,0.00024678785,0.08172095,0.00085998623,0.00027108283,0.0015587256,0.006190658,0.022225972,0.00948717,0.5601778,0.03729237,0.27923068],"study_design_scores_gemma":[0.000114752205,0.00015419848,0.011796397,0.00024934585,0.0003147401,0.0019483005,0.004155566,0.48320255,0.0069994396,0.35132518,0.13958803,0.00015151221],"about_ca_topic_score_codex":0.002503742,"about_ca_topic_score_gemma":0.00241138,"teacher_disagreement_score":0.005991091,"about_ca_system_score_codex":0.0005829917,"about_ca_system_score_gemma":0.00068532774,"threshold_uncertainty_score":0.02004224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00575137,0.00022082057,0.98819554,0.00037498528,0.000033427776,0.00028842047,0.00087705906,0.0031645992,0.0010938084],"genre_scores_gemma":[0.050736964,0.00023960278,0.9468702,0.00008832375,0.000040863957,0.00035943676,0.0008580817,0.000165016,0.00064159627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980343,0.0005212481,0.00016348156,0.00046371992,0.00072132575,0.000095919604],"domain_scores_gemma":[0.9940024,0.0030097575,0.00073038414,0.0007751706,0.0012037187,0.00027856484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030240633,0.0017947947,0.0010931148,0.010832694,0.0011667068,0.002937519,0.0027099652,0.0014273319,0.0031399182],"category_scores_gemma":[0.012464893,0.0008375887,0.0014729209,0.0056677423,0.0010777881,0.0032658083,0.0025171966,0.0015500727,0.0011845445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046976036,0.0004667283,0.008195068,0.0015923542,0.00039279286,0.00075520837,0.002747808,0.06872891,0.027323361,0.035181917,0.025130013,0.829016],"study_design_scores_gemma":[0.00011968056,0.0001513099,0.0030324846,0.00022703042,0.000115442956,0.0013352905,0.0009851634,0.8610829,0.020001642,0.0834722,0.029321605,0.00015511274],"about_ca_topic_score_codex":0.0032308365,"about_ca_topic_score_gemma":0.0035422172,"teacher_disagreement_score":0.010832694,"about_ca_system_score_codex":0.0008215878,"about_ca_system_score_gemma":0.0011873263,"threshold_uncertainty_score":0.01599294},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.559788,0.00637731,0.40334043,0.0032494117,0.00025621918,0.00014904902,0.003078832,0.0006850169,0.023075787],"genre_scores_gemma":[0.95194405,0.0021456664,0.039922066,0.0001259539,0.0002910499,0.000103984385,0.0011762233,0.000074638876,0.004216377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980393,0.00076261756,0.00013144937,0.00039189772,0.0005924597,0.00008229219],"domain_scores_gemma":[0.9749126,0.019177185,0.0019652916,0.0009620233,0.002402098,0.00058083],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0018134734,0.00033418968,0.0011316577,0.012091901,0.0012088375,0.002728873,0.0011300435,0.0020098237,0.0035894897],"category_scores_gemma":[0.031974554,0.00039381764,0.00046607215,0.012723211,0.0012209854,0.0061744316,0.0011898063,0.0007189678,0.000551267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044817958,0.00023435421,0.044117335,0.0013250785,0.000524707,0.00057785853,0.0013590722,0.100221954,0.0063162087,0.61744565,0.013509125,0.21392047],"study_design_scores_gemma":[0.000043960637,0.00007224855,0.015727408,0.00013943375,0.00030690889,0.00059657654,0.00028075263,0.30066824,0.0018190411,0.67009735,0.010187512,0.000060590795],"about_ca_topic_score_codex":0.0026335157,"about_ca_topic_score_gemma":0.0029730236,"teacher_disagreement_score":0.9879081,"about_ca_system_score_codex":0.0010972791,"about_ca_system_score_gemma":0.00074185047,"threshold_uncertainty_score":0.012008011},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025236006,0.94681805,0.04154798,0.0028843647,0.00073065783,0.0000315096,0.00017463093,0.00006354828,0.0052256496],"genre_scores_gemma":[0.025508342,0.95471585,0.014884387,0.00062810606,0.0018523362,0.00007281528,0.0003039864,0.0000335871,0.002000613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994672,0.00018474524,0.00006069849,0.00011254319,0.00014411182,0.000030741576],"domain_scores_gemma":[0.9976284,0.001853557,0.00014391831,0.00008923122,0.00022909709,0.00005586876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017918778,0.0014202954,0.0017433463,0.0051529626,0.0005300193,0.0020882604,0.0013996116,0.0014076038,0.0020363126],"category_scores_gemma":[0.0024008353,0.00054444803,0.00067213626,0.0056355563,0.0032061508,0.00565256,0.0009426178,0.0018893111,0.0006906455],"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.00010030424,0.000065074986,0.0016265087,0.009620763,0.00023640286,0.00053218525,0.00080779445,0.014830494,0.0014175706,0.62442875,0.014582987,0.33175126],"study_design_scores_gemma":[0.000018590761,0.00009164387,0.0018341715,0.0027839364,0.00014317552,0.0017353359,0.0004979273,0.01801206,0.0010493068,0.5908505,0.38285154,0.0001319005],"about_ca_topic_score_codex":0.001981518,"about_ca_topic_score_gemma":0.001349183,"teacher_disagreement_score":0.0051529626,"about_ca_system_score_codex":0.0021037292,"about_ca_system_score_gemma":0.0010946513,"threshold_uncertainty_score":0.015263736},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116913565,0.00071354816,0.8673097,0.001159674,0.000082841296,0.00012385353,0.00032795913,0.0006196611,0.01274916],"genre_scores_gemma":[0.9507169,0.0015247312,0.029718896,0.0001081891,0.0001258172,0.00021509119,0.00022472034,0.00021483166,0.017150832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929035,0.0002016532,0.000029942874,0.00014947883,0.000165279,0.00016332958],"domain_scores_gemma":[0.99743074,0.001440008,0.0004170214,0.00020489693,0.00041332806,0.000094063784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001266591,0.00095925404,0.00045565105,0.0012604148,0.0005345986,0.001564018,0.0013540875,0.00095388835,0.0027459606],"category_scores_gemma":[0.0075601386,0.000422689,0.00054238085,0.0013831741,0.0009747326,0.0038544734,0.0011686422,0.0010949726,0.0007559778],"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.00004523243,0.000037880178,0.0025870784,0.000034520668,0.000019514355,0.00014141506,0.00020998584,0.9172616,0.0013001757,0.069691926,0.00064390193,0.008026752],"study_design_scores_gemma":[0.0000039122788,0.000013984179,0.0002593156,0.000005175943,0.000005821534,0.00002775011,0.000042008167,0.9838261,0.00016370778,0.0149335805,0.0007125578,0.00000607993],"about_ca_topic_score_codex":0.01885588,"about_ca_topic_score_gemma":0.0077418135,"teacher_disagreement_score":0.01885588,"about_ca_system_score_codex":0.0025605592,"about_ca_system_score_gemma":0.001080588,"threshold_uncertainty_score":0.037492216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39236745,0.0034284873,0.56999224,0.0019847427,0.000076062715,0.00063552026,0.0003840663,0.00038592966,0.03074543],"genre_scores_gemma":[0.94568604,0.0013671677,0.048530806,0.00010868803,0.000086420674,0.00028726456,0.00013234948,0.0000673671,0.0037339004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967069,0.0017232349,0.00012359014,0.0007015637,0.0004977124,0.00024701355],"domain_scores_gemma":[0.987336,0.009899382,0.0011294999,0.0006136014,0.00067425,0.00034731175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004017757,0.0016354767,0.0019385603,0.002007457,0.00088525936,0.0021913312,0.0016263531,0.0020773336,0.0033211207],"category_scores_gemma":[0.022410268,0.0009124842,0.00077246677,0.0028444352,0.0011786468,0.0061319196,0.0020427697,0.00089443795,0.000776158],"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.0007701921,0.00075888913,0.021432789,0.0018124677,0.0006182394,0.00068982254,0.0014066274,0.56048876,0.011348115,0.17197661,0.0056186332,0.22307892],"study_design_scores_gemma":[0.00008290808,0.00047208127,0.005900411,0.000101782905,0.0002076589,0.00040443282,0.00039341624,0.8162157,0.0025328137,0.16724151,0.0063945274,0.00005273745],"about_ca_topic_score_codex":0.0012468369,"about_ca_topic_score_gemma":0.0014764757,"teacher_disagreement_score":0.004017757,"about_ca_system_score_codex":0.00141092,"about_ca_system_score_gemma":0.0007945221,"threshold_uncertainty_score":0.021248162},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.257773,0.001808733,0.623996,0.008056742,0.00068029796,0.00092525914,0.0038610268,0.0022570493,0.100641906],"genre_scores_gemma":[0.6733555,0.0012011381,0.29004312,0.0012455389,0.00056592195,0.00072183786,0.0043885973,0.00042167955,0.028056704],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555945,0.0016757117,0.000294616,0.0012110572,0.0010323296,0.00022691724],"domain_scores_gemma":[0.98009217,0.01163438,0.0019674227,0.002265567,0.0035992735,0.00044119937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055320137,0.0007821028,0.0007610545,0.0057171015,0.00204007,0.0060750945,0.0013281994,0.0033416108,0.009779917],"category_scores_gemma":[0.040759478,0.00084105006,0.000574695,0.005262118,0.0007814498,0.013529997,0.0046400377,0.0019099569,0.006082813],"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.000738714,0.000557248,0.18303649,0.001076237,0.00028197837,0.001682489,0.016728837,0.01266123,0.015876016,0.14805984,0.045436658,0.5738642],"study_design_scores_gemma":[0.000103890154,0.00017455881,0.043224856,0.00051563996,0.000337231,0.001397885,0.016900377,0.31892696,0.019750994,0.34413972,0.25434938,0.0001785406],"about_ca_topic_score_codex":0.0032911785,"about_ca_topic_score_gemma":0.002955527,"teacher_disagreement_score":0.009779917,"about_ca_system_score_codex":0.00094411295,"about_ca_system_score_gemma":0.0011985353,"threshold_uncertainty_score":0.03271711},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11052533,0.0017667019,0.87216467,0.001158486,0.00009355317,0.00006206593,0.00097310904,0.003528903,0.009727143],"genre_scores_gemma":[0.76470095,0.0019440553,0.22878982,0.00013634554,0.00012058079,0.00009725451,0.00075022166,0.00055172306,0.0029089586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997683,0.00008457228,0.00001014267,0.000048580274,0.00006610497,0.000022303504],"domain_scores_gemma":[0.99916947,0.00041607863,0.0001127463,0.0001000092,0.00010919359,0.00009241686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004067049,0.00053263095,0.0003583999,0.002234137,0.00044847676,0.0017484773,0.00034905487,0.00049928087,0.005340955],"category_scores_gemma":[0.0025287215,0.00027444866,0.0003440221,0.0013863405,0.0004514139,0.0019149364,0.0011846968,0.00063572265,0.00043017822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003831804,0.00007196667,0.009348913,0.0008455235,0.00020291469,0.0014284786,0.004701532,0.19957504,0.13653846,0.3970798,0.025262188,0.22456203],"study_design_scores_gemma":[0.000034843895,0.000044552038,0.0073735556,0.00010690546,0.000055081782,0.00059002027,0.00075298245,0.69337153,0.015822701,0.23846644,0.04332089,0.000060462397],"about_ca_topic_score_codex":0.0014454412,"about_ca_topic_score_gemma":0.0014369197,"teacher_disagreement_score":0.005340955,"about_ca_system_score_codex":0.00045979282,"about_ca_system_score_gemma":0.000248077,"threshold_uncertainty_score":0.017867327},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018528765,0.00031888168,0.9782178,0.00014668675,0.000023842884,0.000093381794,0.000042680625,0.0003824628,0.0022454676],"genre_scores_gemma":[0.2780267,0.00023248974,0.71905994,0.00015438258,0.00006360621,0.0002490911,0.0001843771,0.00024587422,0.0017835079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833363,0.0008061596,0.000060904917,0.00030612288,0.0003388888,0.00015419316],"domain_scores_gemma":[0.9963108,0.0023314715,0.00030401538,0.0004192918,0.00047678186,0.00015767793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002731841,0.00092723826,0.0011536897,0.0023762826,0.0008148987,0.0011226306,0.001980382,0.0013992545,0.0026484278],"category_scores_gemma":[0.010765539,0.0006949738,0.00077132153,0.0015210297,0.0014789433,0.0022410012,0.0016101634,0.0011131798,0.0005517866],"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.00026053228,0.00012543648,0.0012382497,0.00024773093,0.00012200508,0.00010939427,0.00032097468,0.73549277,0.006803791,0.06393239,0.0044484707,0.18689829],"study_design_scores_gemma":[0.000037286332,0.000045496083,0.00020825582,0.000016045953,0.000016270653,0.0000534236,0.00003404592,0.95972306,0.0019863164,0.036887467,0.0009786895,0.00001367659],"about_ca_topic_score_codex":0.0016534124,"about_ca_topic_score_gemma":0.002305837,"teacher_disagreement_score":0.002731841,"about_ca_system_score_codex":0.0017414396,"about_ca_system_score_gemma":0.0012642303,"threshold_uncertainty_score":0.01444757},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010577935,0.0001956128,0.98775136,0.0002553584,0.000024314251,0.00005904581,0.00022930623,0.0003041948,0.00060283614],"genre_scores_gemma":[0.5008949,0.0007313923,0.49167866,0.00031199178,0.00018601965,0.0006058502,0.002849767,0.00026147428,0.0024799723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942199,0.0023457624,0.00029131613,0.001988668,0.00084410363,0.00031023636],"domain_scores_gemma":[0.92480916,0.06317145,0.0039211493,0.0049727866,0.0023731317,0.00075233023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00689585,0.0010730042,0.0019175628,0.004077739,0.0013813212,0.0022332221,0.0041198344,0.0025041623,0.0032393946],"category_scores_gemma":[0.063988365,0.0014957451,0.0019866044,0.0031943938,0.002835048,0.0049722544,0.0036091667,0.004551261,0.0009531016],"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.00027797665,0.00012190523,0.009944507,0.00036020292,0.00025374253,0.00040425075,0.00038287367,0.76148254,0.0015555684,0.15263447,0.0029093027,0.06967268],"study_design_scores_gemma":[0.000013483274,0.000010810583,0.00049226684,0.000025090167,0.000016615026,0.000059439728,0.000029694804,0.8800674,0.00058476813,0.117956705,0.000732495,0.000011201269],"about_ca_topic_score_codex":0.0068115145,"about_ca_topic_score_gemma":0.009067578,"teacher_disagreement_score":0.00689585,"about_ca_system_score_codex":0.0019688134,"about_ca_system_score_gemma":0.002021828,"threshold_uncertainty_score":0.03646922},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023834868,0.00007536271,0.9956527,0.000097608754,0.0000265939,0.000037694062,0.000061355175,0.000990363,0.000674784],"genre_scores_gemma":[0.06259297,0.00010991273,0.93396664,0.000110171626,0.000031402564,0.00016582009,0.0005193019,0.0003279342,0.0021759123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985863,0.00023895374,0.000074512995,0.00033084291,0.0006429694,0.00012652791],"domain_scores_gemma":[0.9983448,0.00043418628,0.00015062783,0.00038200518,0.00059719064,0.00009111164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009271429,0.00091553916,0.0013896902,0.002576457,0.0012658848,0.0013979272,0.0024115797,0.0016101617,0.005334687],"category_scores_gemma":[0.0049644257,0.00056054915,0.0015132878,0.002776674,0.0006819496,0.0022381735,0.0028454885,0.0023630688,0.0028328435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019414103,0.00015945075,0.0010091375,0.0002310919,0.00017916948,0.00010252783,0.00025918978,0.26560944,0.016715158,0.039784994,0.01470776,0.6610479],"study_design_scores_gemma":[0.000019563151,0.000027634758,0.00018782032,0.000008101377,0.000013888912,0.000052022835,0.00003084215,0.9812888,0.0024237623,0.0124281915,0.0035037943,0.000015702726],"about_ca_topic_score_codex":0.007441608,"about_ca_topic_score_gemma":0.012308401,"teacher_disagreement_score":0.007441608,"about_ca_system_score_codex":0.0014896898,"about_ca_system_score_gemma":0.0017337913,"threshold_uncertainty_score":0.017846286},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34495723,0.0034060664,0.5621158,0.0069362796,0.0007348306,0.00042537984,0.017942958,0.028241228,0.03524027],"genre_scores_gemma":[0.7048105,0.0014803852,0.28224167,0.00037659833,0.0002221691,0.000323795,0.005703117,0.0010993843,0.0037424453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942905,0.00021341063,0.000031729553,0.00009886889,0.00016216113,0.00006482292],"domain_scores_gemma":[0.99720204,0.0015698491,0.00027258173,0.00023954731,0.00047730963,0.00023873722],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.00095364265,0.0009425886,0.0005064365,0.0046366295,0.0006821699,0.002648253,0.00064037496,0.00083779375,0.007752536],"category_scores_gemma":[0.0037482097,0.00030520748,0.00071977096,0.0032605086,0.00040776804,0.001748643,0.0025980982,0.0010585125,0.00068868586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001856508,0.000481816,0.03741747,0.0030996662,0.00079055695,0.0028129607,0.015973398,0.1665964,0.09445184,0.10138301,0.11077673,0.46435976],"study_design_scores_gemma":[0.0002122798,0.00019397226,0.034366917,0.0004885651,0.00019745936,0.0010067814,0.004041621,0.7632656,0.020558834,0.059375092,0.116069086,0.00022380451],"about_ca_topic_score_codex":0.004202697,"about_ca_topic_score_gemma":0.0052721286,"teacher_disagreement_score":0.99536335,"about_ca_system_score_codex":0.00066506444,"about_ca_system_score_gemma":0.00093676866,"threshold_uncertainty_score":0.025934815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066626244,0.00006855663,0.992167,0.00007104139,0.000022498014,0.000047434783,0.000029557968,0.00038115375,0.0005501304],"genre_scores_gemma":[0.29335016,0.00015893177,0.7033004,0.00014205511,0.000050228682,0.0003381991,0.00031677607,0.00014125429,0.00220198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990933,0.0001868778,0.000056605633,0.00027639378,0.00027262926,0.00011423044],"domain_scores_gemma":[0.99881786,0.0005767473,0.0001568567,0.00014755107,0.00021512824,0.00008584126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011758411,0.000808416,0.0011351559,0.0009821436,0.0007042717,0.00087843114,0.0022699577,0.0009445677,0.0017972029],"category_scores_gemma":[0.0038059368,0.0004775943,0.0005701116,0.00094810984,0.00081101264,0.0018915883,0.0017096195,0.0013185638,0.00040760168],"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.00013284975,0.00009852454,0.0006958987,0.000087176515,0.0000532165,0.000054994805,0.0001152605,0.79435796,0.0038094227,0.023300152,0.0021372645,0.17515743],"study_design_scores_gemma":[0.000017637323,0.000028167919,0.000051283725,0.0000037484049,0.0000043831446,0.000018520706,0.000009737683,0.9926795,0.0005538233,0.0059217843,0.0007052949,0.00000616018],"about_ca_topic_score_codex":0.004587856,"about_ca_topic_score_gemma":0.003912097,"teacher_disagreement_score":0.004587856,"about_ca_system_score_codex":0.0012913942,"about_ca_system_score_gemma":0.0021095201,"threshold_uncertainty_score":0.009369791},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21560548,0.0020288518,0.76331776,0.001606384,0.00006881245,0.00017979421,0.00008986191,0.00018588205,0.01691714],"genre_scores_gemma":[0.9332159,0.0009812394,0.06270872,0.00015360204,0.0001405246,0.00012499577,0.000058721613,0.000084359606,0.0025318637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981477,0.0011502185,0.000050537557,0.00029979728,0.0002220188,0.00012970896],"domain_scores_gemma":[0.9768811,0.01995841,0.00092222745,0.0008095635,0.000987979,0.00044070376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042555667,0.0009322646,0.0011699069,0.0011450087,0.0009264338,0.0015678536,0.001771458,0.0013581062,0.001639966],"category_scores_gemma":[0.027030274,0.0006152288,0.0007968229,0.0011282112,0.0015908524,0.00397257,0.0012093454,0.0011916431,0.00023421038],"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.00028306682,0.0003355704,0.0063847885,0.00047676594,0.00021343978,0.00042573878,0.0011621432,0.6484701,0.01128858,0.2731701,0.0032044516,0.054585133],"study_design_scores_gemma":[0.00003375594,0.0001050081,0.0005709297,0.000021279377,0.000041261726,0.000107932305,0.0000852848,0.95667076,0.0017243908,0.039233793,0.0013900584,0.00001559275],"about_ca_topic_score_codex":0.0017286136,"about_ca_topic_score_gemma":0.0014036301,"teacher_disagreement_score":0.0042555667,"about_ca_system_score_codex":0.0011895337,"about_ca_system_score_gemma":0.0007131324,"threshold_uncertainty_score":0.02250582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54304075,0.00039908846,0.4455118,0.00051058485,0.00004346078,0.00054586265,0.0026702278,0.00102933,0.0062489947],"genre_scores_gemma":[0.79920304,0.00018410182,0.19613543,0.000043805234,0.00003106804,0.00047292377,0.0029874283,0.00009497723,0.0008471479],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9950966,0.0015934804,0.0005429227,0.0010628375,0.0013811323,0.00032289067],"domain_scores_gemma":[0.9759961,0.012971665,0.004389034,0.002514811,0.0034233928,0.0007050315],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.00264854,0.0005811105,0.00059736724,0.009615027,0.0015402472,0.0018938232,0.0007724303,0.00050942664,0.0015438609],"category_scores_gemma":[0.019493205,0.00041161184,0.0007380997,0.008459015,0.0008179581,0.00240662,0.0020723655,0.0006910665,0.00050878513],"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.0007710848,0.00056002225,0.5760742,0.0010129809,0.00095833506,0.0012815223,0.01210397,0.02914436,0.024264324,0.028783284,0.0061438903,0.31890205],"study_design_scores_gemma":[0.00010410483,0.00025887103,0.47090408,0.00024575842,0.00047690558,0.0018464358,0.008406516,0.3965092,0.018252531,0.08181013,0.020919284,0.0002661167],"about_ca_topic_score_codex":0.0043950686,"about_ca_topic_score_gemma":0.0048693256,"teacher_disagreement_score":0.990385,"about_ca_system_score_codex":0.0009187348,"about_ca_system_score_gemma":0.0013654409,"threshold_uncertainty_score":0.014007032},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4229174,0.0007671742,0.5115381,0.0019713677,0.00046089687,0.00011022687,0.0005081648,0.00064459303,0.061082084],"genre_scores_gemma":[0.942088,0.00070545496,0.027445529,0.00036072457,0.00028988832,0.00011679454,0.00023097635,0.00017940128,0.028583279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964166,0.00012459261,0.000008749459,0.00007329509,0.00009462186,0.000057084064],"domain_scores_gemma":[0.9979545,0.00082600437,0.00027978577,0.00021710813,0.00021694503,0.0005055286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005045949,0.000491548,0.00054235087,0.0013797968,0.00094094296,0.0014343256,0.0012787569,0.001054252,0.0077057146],"category_scores_gemma":[0.004428603,0.00038573195,0.00044889335,0.0008585476,0.0013135693,0.0025300232,0.0015758646,0.0012521817,0.0007038913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002197966,0.00011377197,0.0007439999,0.000092524184,0.00005386352,0.0002839074,0.00017318052,0.14335369,0.010723274,0.82809335,0.0039488776,0.012199649],"study_design_scores_gemma":[0.000029528606,0.000047880272,0.00069033756,0.000012115823,0.000014902234,0.0001356277,0.000086141685,0.42133862,0.0013671572,0.57415366,0.0020984297,0.000025584994],"about_ca_topic_score_codex":0.0014059378,"about_ca_topic_score_gemma":0.001101768,"teacher_disagreement_score":0.0077057146,"about_ca_system_score_codex":0.0007115595,"about_ca_system_score_gemma":0.00055283477,"threshold_uncertainty_score":0.025778174},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093893585,0.00020029074,0.9960395,0.00009547552,0.00003851605,0.000033027758,0.00003382815,0.00006156468,0.0025588055],"genre_scores_gemma":[0.4023293,0.00252734,0.58128583,0.00045994518,0.00034959445,0.0008969719,0.00042909457,0.00024449095,0.011477512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827254,0.0005564678,0.000074462725,0.0004401275,0.00055129494,0.00010506698],"domain_scores_gemma":[0.9980895,0.0009180543,0.00031879364,0.00025594156,0.00036180145,0.00005589928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021832183,0.0014124062,0.0011122169,0.0010159623,0.0005333031,0.0017508701,0.0017346548,0.0015337397,0.004013014],"category_scores_gemma":[0.0054606963,0.0005176535,0.0009769854,0.0006682803,0.0013379323,0.002060539,0.0020073594,0.0013815693,0.00102281],"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.000053085685,0.000021747173,0.00021255082,0.00019463862,0.00006694208,0.000080531296,0.000037766076,0.8228177,0.0041365735,0.12479685,0.0016490426,0.045932584],"study_design_scores_gemma":[0.000013996672,0.0000635543,0.000063252926,0.000029490733,0.000019921687,0.00006035418,0.0000129014,0.9318823,0.0018817618,0.058838762,0.007118185,0.000015549926],"about_ca_topic_score_codex":0.0010411022,"about_ca_topic_score_gemma":0.0007562551,"teacher_disagreement_score":0.004013014,"about_ca_system_score_codex":0.0014768795,"about_ca_system_score_gemma":0.0009828489,"threshold_uncertainty_score":0.013424814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41126764,0.048805345,0.46307248,0.0059309993,0.002247618,0.004285772,0.010687727,0.01480285,0.038899485],"genre_scores_gemma":[0.58668196,0.007871024,0.38717085,0.0010807167,0.0008290012,0.0023691955,0.008627975,0.0012596714,0.004109719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.95969087,0.02668191,0.0019830626,0.0025728312,0.0077398373,0.0013313984],"domain_scores_gemma":[0.8197877,0.15349978,0.0037127973,0.0134131005,0.008281492,0.0013050832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022738889,0.0030859534,0.0029594093,0.006402074,0.002380145,0.0034322536,0.0032386251,0.0036845868,0.0061357506],"category_scores_gemma":[0.10580839,0.00091969385,0.0013352361,0.010848356,0.0021292516,0.00905446,0.0027539178,0.0032303298,0.0022440345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006709796,0.010175475,0.013294635,0.0037734034,0.0016193755,0.00018504425,0.00050749804,0.3445356,0.0042272084,0.020938307,0.066603675,0.52743],"study_design_scores_gemma":[0.0014328165,0.0021589291,0.0049947584,0.00023361995,0.0004275043,0.00032549154,0.00036653192,0.9313905,0.005676478,0.044334386,0.008490214,0.0001686797],"about_ca_topic_score_codex":0.010077359,"about_ca_topic_score_gemma":0.0062227696,"teacher_disagreement_score":0.022738889,"about_ca_system_score_codex":0.0038210934,"about_ca_system_score_gemma":0.002537938,"threshold_uncertainty_score":0.120256186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03918,0.0008309345,0.8806674,0.0015442607,0.0002828671,0.00034565807,0.013021632,0.05027635,0.013850937],"genre_scores_gemma":[0.21290465,0.0017482943,0.7572456,0.00029844628,0.00012953367,0.00093510945,0.012032405,0.006824754,0.007881173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955875,0.00016660604,0.000030069774,0.00006714342,0.00014301803,0.00003450859],"domain_scores_gemma":[0.9986615,0.00072041544,0.00011917354,0.00020839034,0.00017352635,0.00011689505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009718807,0.0009122142,0.00050967536,0.0027920099,0.0007216291,0.00274612,0.0010604822,0.0008145921,0.01407861],"category_scores_gemma":[0.0037880803,0.00049116067,0.0007609711,0.0022325634,0.0004162984,0.0030691759,0.003062182,0.0014171279,0.0017419147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001083461,0.0002989343,0.010743935,0.0022634561,0.00042104255,0.0015192237,0.012002752,0.09853779,0.051177137,0.12145883,0.21342841,0.48706514],"study_design_scores_gemma":[0.00027382618,0.0001877894,0.0056247488,0.00039456808,0.00011063968,0.00096456194,0.0016772336,0.5290034,0.026687304,0.105848,0.32897887,0.00024908772],"about_ca_topic_score_codex":0.0036504136,"about_ca_topic_score_gemma":0.0050237426,"teacher_disagreement_score":0.01407861,"about_ca_system_score_codex":0.00047542292,"about_ca_system_score_gemma":0.0008164941,"threshold_uncertainty_score":0.047097683},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22332606,0.001066076,0.7640265,0.000712264,0.000052294574,0.00027873061,0.0017164507,0.000577154,0.008244458],"genre_scores_gemma":[0.9063839,0.0009951028,0.08758908,0.0003073224,0.00010261431,0.00062563526,0.0022849764,0.0001888601,0.0015225341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961553,0.0018558875,0.00019619545,0.00086010323,0.0007218457,0.00021066493],"domain_scores_gemma":[0.9433057,0.044024277,0.0040608244,0.005169714,0.0027373445,0.0007021737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054599037,0.00053310586,0.0008039905,0.0033802972,0.0010588715,0.0021413022,0.0012997115,0.0012310757,0.0021589026],"category_scores_gemma":[0.057096627,0.0006983205,0.0008783771,0.0018786705,0.0021719744,0.0043386235,0.0012897637,0.001213659,0.0004183512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027485657,0.00012507428,0.051749237,0.0008204469,0.00034930083,0.0007815567,0.0020489416,0.30215868,0.0090408325,0.5605482,0.0049770456,0.06712588],"study_design_scores_gemma":[0.000047884336,0.00009013299,0.0069052153,0.00012166196,0.00006803491,0.0009380946,0.00041062146,0.5920195,0.0034574086,0.3894871,0.006406664,0.00004774835],"about_ca_topic_score_codex":0.0020437613,"about_ca_topic_score_gemma":0.0015528507,"teacher_disagreement_score":0.0054599037,"about_ca_system_score_codex":0.0015214331,"about_ca_system_score_gemma":0.0006100595,"threshold_uncertainty_score":0.028875053},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017630007,0.00025925704,0.9802225,0.00026897682,0.0000439709,0.000021568756,0.00011247664,0.00011068735,0.0013304891],"genre_scores_gemma":[0.753283,0.0018471315,0.23333041,0.00019593885,0.00018737867,0.0003837698,0.0007624412,0.00018800875,0.009821893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938357,0.00029965478,0.00002946659,0.00012182397,0.00011269057,0.00005284104],"domain_scores_gemma":[0.99399334,0.0048005073,0.00045830442,0.00023532315,0.00038422248,0.00012817283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019331779,0.0012011096,0.0011504343,0.0018925735,0.000716683,0.001812997,0.0018852933,0.0020717573,0.0026274982],"category_scores_gemma":[0.014312261,0.0010552855,0.0012657697,0.0021359113,0.0012736382,0.0041746707,0.0013307546,0.0018820507,0.0004855183],"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.000008945929,0.000008555858,0.00021989802,0.000015864262,0.000015603242,0.000016649721,0.000022299917,0.9728611,0.00010030663,0.02426128,0.00015025446,0.00231915],"study_design_scores_gemma":[0.0000016798851,0.0000016968754,0.000019789119,0.0000018046909,0.000002665876,0.0000036393403,0.0000031651603,0.9869315,0.000022443737,0.012897878,0.000111648864,0.0000021294936],"about_ca_topic_score_codex":0.022789525,"about_ca_topic_score_gemma":0.021089384,"teacher_disagreement_score":0.022789525,"about_ca_system_score_codex":0.0020506156,"about_ca_system_score_gemma":0.0011215803,"threshold_uncertainty_score":0.045313776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059287935,0.0034393081,0.6714835,0.0024699878,0.0031958197,0.0010823001,0.0025237172,0.15437374,0.102143705],"genre_scores_gemma":[0.73611605,0.0026176616,0.19821116,0.0023277148,0.0016295678,0.0012947031,0.005631378,0.0016152952,0.0505564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914575,0.0001338778,0.00009367218,0.00019659122,0.0003360559,0.000094114344],"domain_scores_gemma":[0.9988986,0.00019042188,0.00012671314,0.0001836919,0.0004164082,0.00018411984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014664088,0.0005556446,0.00084143196,0.0012111478,0.0008488686,0.0024579593,0.001750876,0.00081591157,0.0058235694],"category_scores_gemma":[0.002266604,0.00023074333,0.00023025674,0.0007955131,0.00045365441,0.0012458789,0.0012850398,0.0010256652,0.0021904474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018752827,0.00050539256,0.010949057,0.0005928529,0.00021493691,0.001016424,0.00047725416,0.04379464,0.039052065,0.0602696,0.20353812,0.63771445],"study_design_scores_gemma":[0.0003837846,0.0006559159,0.005133333,0.00015472101,0.00025218076,0.0011935728,0.00012723169,0.5717979,0.027620515,0.024397923,0.3680978,0.00018508358],"about_ca_topic_score_codex":0.0013510038,"about_ca_topic_score_gemma":0.0009937354,"teacher_disagreement_score":0.0058235694,"about_ca_system_score_codex":0.00081602356,"about_ca_system_score_gemma":0.0011977638,"threshold_uncertainty_score":0.019481838},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037838437,0.0007160653,0.9554579,0.0004765192,0.0001489785,0.0006673997,0.0021094063,0.0010158799,0.0015693643],"genre_scores_gemma":[0.15984592,0.000499286,0.82685983,0.00013864208,0.00017853442,0.00065788976,0.009847344,0.00027951875,0.0016929839],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.987938,0.0041287667,0.0010759485,0.002284331,0.0037796495,0.00079333875],"domain_scores_gemma":[0.97412777,0.0126583595,0.0016692796,0.0058234087,0.0049796626,0.00074151944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0080415895,0.0022823287,0.002735862,0.011375735,0.002632932,0.0068335827,0.003752546,0.001962093,0.0015571082],"category_scores_gemma":[0.0383774,0.0010570921,0.0024195116,0.010564655,0.0011588146,0.0062522884,0.004679221,0.002024939,0.001431141],"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.0012243037,0.000735226,0.01925947,0.0015266449,0.00063390954,0.00082546694,0.0024806615,0.19164406,0.021067789,0.05672936,0.015612173,0.688261],"study_design_scores_gemma":[0.00012655438,0.00038196912,0.005728985,0.0002520471,0.00030703572,0.0007199006,0.0022292368,0.81684583,0.019388784,0.12545653,0.028401813,0.00016131953],"about_ca_topic_score_codex":0.004630052,"about_ca_topic_score_gemma":0.008232278,"teacher_disagreement_score":0.011375735,"about_ca_system_score_codex":0.0021971893,"about_ca_system_score_gemma":0.0030563269,"threshold_uncertainty_score":0.04252851},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10355306,0.000684476,0.8925026,0.00025583562,0.000027768245,0.00016854881,0.00031592356,0.0008259421,0.001665881],"genre_scores_gemma":[0.71076,0.00046163236,0.28557795,0.00009081233,0.00006990842,0.000211892,0.0009666495,0.000092648945,0.0017685482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987282,0.0003776628,0.00005126392,0.00037228223,0.00034940825,0.0001210259],"domain_scores_gemma":[0.9953524,0.0025897664,0.0007315274,0.00045929206,0.0006360056,0.00023100252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016505121,0.00060697435,0.00080859463,0.0046149925,0.0010450016,0.0011653706,0.001934204,0.0009996869,0.0007204943],"category_scores_gemma":[0.00910083,0.0004451418,0.0006544218,0.0028316677,0.00082954566,0.0029718308,0.0017124083,0.0008152634,0.00037560705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004415395,0.00036946335,0.034202818,0.00053537625,0.00031906035,0.0012788901,0.0017564376,0.37148705,0.017189216,0.031172248,0.0064432723,0.5348046],"study_design_scores_gemma":[0.00001224138,0.000035553698,0.002729562,0.000024694757,0.00003158194,0.0002455101,0.00023822267,0.97138333,0.002281215,0.021054564,0.0019439359,0.000019561445],"about_ca_topic_score_codex":0.0050690495,"about_ca_topic_score_gemma":0.0074636596,"teacher_disagreement_score":0.0050690495,"about_ca_system_score_codex":0.0008188347,"about_ca_system_score_gemma":0.00069124997,"threshold_uncertainty_score":0.010079086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33154696,0.00542424,0.53157413,0.016250266,0.00037225988,0.00038003744,0.0022807824,0.00073778414,0.111433595],"genre_scores_gemma":[0.9664196,0.0019795203,0.021034505,0.0002880524,0.00018546538,0.0003012244,0.00044991195,0.00004833966,0.0092933895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989785,0.00041895782,0.00003250701,0.00021118138,0.0002787996,0.00008008146],"domain_scores_gemma":[0.9969013,0.0016430948,0.00063817156,0.00021931689,0.000292922,0.00030522747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087220466,0.00043562768,0.00044169207,0.0020591659,0.0009388788,0.0026929253,0.0006559142,0.0011816066,0.0047704475],"category_scores_gemma":[0.008116436,0.0003504426,0.000427901,0.0012698489,0.0019702814,0.0043980954,0.0014812464,0.00096878875,0.00047566948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014667895,0.000016859281,0.00207529,0.00006632219,0.000040558916,0.00013754364,0.0005055957,0.052694757,0.00079069805,0.92900443,0.0036934072,0.010959951],"study_design_scores_gemma":[0.000018812912,0.000015267131,0.0017804083,0.000036417925,0.000013204186,0.00015543067,0.00019807725,0.20345947,0.0002009825,0.77929795,0.014804879,0.000019117266],"about_ca_topic_score_codex":0.0033037427,"about_ca_topic_score_gemma":0.0018944254,"teacher_disagreement_score":0.0047704475,"about_ca_system_score_codex":0.0017646864,"about_ca_system_score_gemma":0.00062016246,"threshold_uncertainty_score":0.015958786},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02589456,0.0005098325,0.97125727,0.0005593032,0.00009193712,0.000018418172,0.000048670536,0.00015518483,0.0014649637],"genre_scores_gemma":[0.82210475,0.0012349199,0.17154166,0.0003760075,0.00098201,0.00018551908,0.0002185211,0.0004739384,0.002882632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968154,0.0017341878,0.00015587869,0.00055456895,0.00057143444,0.0001685796],"domain_scores_gemma":[0.93042713,0.06029153,0.0020794973,0.0032062435,0.0031803367,0.0008153663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010738592,0.0008928912,0.0012389896,0.0025161123,0.0007889058,0.002056616,0.0020952735,0.0017876764,0.0013754554],"category_scores_gemma":[0.06463463,0.00068429165,0.0012325417,0.0013250049,0.0032784985,0.004265894,0.002630464,0.0026252798,0.000208611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009449567,0.00009124668,0.005908174,0.00014943439,0.00019577304,0.0001975322,0.00038398136,0.36331198,0.0032173735,0.5952719,0.0022144634,0.028963657],"study_design_scores_gemma":[0.000008338742,0.000015580426,0.00067287096,0.000013811604,0.000017720622,0.000058566042,0.000026875314,0.8238503,0.0005109831,0.17434631,0.00045866342,0.000020067786],"about_ca_topic_score_codex":0.0014086538,"about_ca_topic_score_gemma":0.0011904661,"teacher_disagreement_score":0.010738592,"about_ca_system_score_codex":0.0013800294,"about_ca_system_score_gemma":0.0012181278,"threshold_uncertainty_score":0.056791782},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29799816,0.000361928,0.6889916,0.0007025649,0.000115675895,0.00009999864,0.00023110931,0.00024570603,0.011253278],"genre_scores_gemma":[0.9331038,0.00036851963,0.051940393,0.0001907118,0.000087965396,0.00014581218,0.00026799945,0.00013544415,0.013759322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938965,0.00020917568,0.000028004082,0.00016252846,0.00009967519,0.000110923196],"domain_scores_gemma":[0.99059993,0.0070142695,0.00084649026,0.00047727692,0.00028279098,0.00077928667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011138142,0.0008768506,0.0012091629,0.0010479036,0.0011495273,0.0013557258,0.0022390543,0.0019402945,0.006702504],"category_scores_gemma":[0.008142974,0.00079928426,0.0008166638,0.0010160161,0.0017644371,0.0031531353,0.0024280595,0.0020801786,0.00037723692],"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.00023461545,0.000086969885,0.0010381214,0.00015866474,0.00010685468,0.00020623684,0.00021155633,0.77093256,0.002474748,0.20497604,0.0021897312,0.01738395],"study_design_scores_gemma":[0.000022296936,0.000029764125,0.00023680102,0.0000126270315,0.000018659552,0.000042683838,0.0000627832,0.8055038,0.00040777904,0.19313145,0.0005218693,0.000009570076],"about_ca_topic_score_codex":0.002595865,"about_ca_topic_score_gemma":0.0038628313,"teacher_disagreement_score":0.006702504,"about_ca_system_score_codex":0.000740632,"about_ca_system_score_gemma":0.0004992799,"threshold_uncertainty_score":0.022422135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93230945,0.0009004174,0.018351555,0.0013658673,0.00003213971,0.00007921104,0.00006977561,0.000040970022,0.046850562],"genre_scores_gemma":[0.99542266,0.0003606043,0.0021146324,0.000052840074,0.000014558,0.000041834195,0.000022142058,0.0000066814555,0.0019639793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995396,0.00023441724,0.000014930659,0.00006960237,0.00008373779,0.000057764828],"domain_scores_gemma":[0.99762505,0.0013228336,0.0004160961,0.00025732556,0.00015451634,0.00022414344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013967295,0.00021565538,0.0002809825,0.0013325269,0.0016449451,0.0014278017,0.0005412713,0.0005239395,0.0023506964],"category_scores_gemma":[0.004096473,0.00019886621,0.00029450277,0.0027094034,0.0021354894,0.0030264363,0.0013375641,0.00045121732,0.00014254599],"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.00013356874,0.00012671859,0.067110844,0.0003366916,0.00011356468,0.0016302591,0.024910036,0.021199454,0.0029614496,0.83026224,0.0023771669,0.048837986],"study_design_scores_gemma":[0.00013021761,0.0003429619,0.16093495,0.00026719604,0.00022739026,0.0010291806,0.015988456,0.2529161,0.0030573008,0.51838803,0.046607602,0.00011065588],"about_ca_topic_score_codex":0.009122982,"about_ca_topic_score_gemma":0.0077987723,"teacher_disagreement_score":0.009122982,"about_ca_system_score_codex":0.0014462403,"about_ca_system_score_gemma":0.0011480498,"threshold_uncertainty_score":0.01813972},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05113786,0.0010647645,0.88245577,0.0022433524,0.00046705504,0.00044867178,0.006857173,0.0025143342,0.052811004],"genre_scores_gemma":[0.5306507,0.0019084401,0.38290343,0.0007577056,0.0004164264,0.0005775909,0.02380665,0.0010696629,0.05790935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845433,0.00033814105,0.00007592564,0.0005499713,0.00043784105,0.00014366528],"domain_scores_gemma":[0.9965546,0.0010285685,0.0002546085,0.0011034866,0.0007830251,0.00027577512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010260586,0.00042065603,0.00062427425,0.002898241,0.0016451605,0.0018720913,0.0011994222,0.0008404776,0.015763307],"category_scores_gemma":[0.0066563273,0.00044053697,0.0014563708,0.0039087385,0.00089033827,0.0043113725,0.0022228928,0.0013040471,0.0023958236],"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.00022531145,0.0002487014,0.0049050734,0.0004580133,0.0001826017,0.0005210992,0.0007108829,0.027677638,0.007370072,0.68420297,0.056679994,0.2168177],"study_design_scores_gemma":[0.000034882916,0.000048394766,0.0026898484,0.00008397372,0.00013383546,0.0006843589,0.00044783822,0.17842366,0.0049878843,0.7041143,0.10831402,0.000036989175],"about_ca_topic_score_codex":0.0099840695,"about_ca_topic_score_gemma":0.020131797,"teacher_disagreement_score":0.015763307,"about_ca_system_score_codex":0.0014848864,"about_ca_system_score_gemma":0.0020258846,"threshold_uncertainty_score":0.05273354},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6030818,0.002091523,0.38060245,0.0008695552,0.00015194328,0.00010906411,0.001899892,0.0003194834,0.010874205],"genre_scores_gemma":[0.97536147,0.00051513663,0.021828396,0.000039196613,0.00012685853,0.00007104253,0.00062665134,0.000042377036,0.0013889138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994941,0.00013122134,0.000030929645,0.00014244975,0.00014728574,0.000053985023],"domain_scores_gemma":[0.9936579,0.0042432197,0.000978453,0.0003236839,0.000541576,0.00025516623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014431799,0.0003963178,0.00074738025,0.005161317,0.0005113242,0.0017929944,0.00077374384,0.0006673078,0.002189617],"category_scores_gemma":[0.008846962,0.00020044723,0.00033813316,0.0038103198,0.0012631225,0.002908369,0.0007099146,0.0008976224,0.00023277936],"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.00053511094,0.0002678428,0.020822795,0.0003845514,0.00022112663,0.00024306054,0.0005093172,0.14644095,0.008923221,0.6564385,0.0052991146,0.15991445],"study_design_scores_gemma":[0.000040957435,0.00011129777,0.017279413,0.00008431335,0.00008757157,0.00039748056,0.00027409542,0.58566254,0.0017055715,0.3913159,0.0029586076,0.00008222055],"about_ca_topic_score_codex":0.00061365316,"about_ca_topic_score_gemma":0.0006578348,"teacher_disagreement_score":0.005161317,"about_ca_system_score_codex":0.0010078556,"about_ca_system_score_gemma":0.00033376622,"threshold_uncertainty_score":0.007632315},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006897828,0.00016501037,0.9345414,0.00034564262,0.0001630374,0.00020389979,0.004633689,0.044327896,0.008721622],"genre_scores_gemma":[0.1141719,0.0010156869,0.848144,0.00033934007,0.000103347484,0.0019979142,0.01119583,0.010020308,0.013011659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994967,0.00014476996,0.000057272246,0.000060152193,0.00020019014,0.000040938903],"domain_scores_gemma":[0.9989472,0.00055985904,0.00008188076,0.00012629104,0.00020985535,0.00007485914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010589906,0.0010166076,0.00074035145,0.0010715286,0.0006054943,0.0011162072,0.0019107142,0.0010502032,0.01901623],"category_scores_gemma":[0.0033753032,0.00066312926,0.0010439005,0.0010047121,0.00036777655,0.0017538246,0.0012258505,0.0017715388,0.0024862033],"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.00035802662,0.0002247783,0.0033938116,0.0010138628,0.00030188958,0.00036651277,0.0006393623,0.6557297,0.014984548,0.098171115,0.10496772,0.11984865],"study_design_scores_gemma":[0.00007678253,0.00003311869,0.00029074782,0.000052055082,0.000035424084,0.00008900425,0.000025657264,0.9181442,0.006781404,0.01563239,0.058796715,0.000042538584],"about_ca_topic_score_codex":0.0077975844,"about_ca_topic_score_gemma":0.0072346954,"teacher_disagreement_score":0.01901623,"about_ca_system_score_codex":0.00080995884,"about_ca_system_score_gemma":0.0015789955,"threshold_uncertainty_score":0.06361562},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010424175,0.003983792,0.00023533756,0.95268524,0.04235313,0.000008392263,0.00007040608,0.000034284625,0.00052519],"genre_scores_gemma":[0.0027580324,0.0036790196,0.00029499485,0.91906506,0.06962117,0.00005974028,0.00006355524,0.000057831185,0.004400582],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949897,0.0014290177,0.00043039885,0.0010235951,0.0017254243,0.0004017287],"domain_scores_gemma":[0.954262,0.029068844,0.0020485998,0.0015734191,0.009994925,0.0030521413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00878519,0.0020642634,0.0025175477,0.0018894821,0.0050663566,0.0079836575,0.0032884143,0.03983755,0.014886378],"category_scores_gemma":[0.06990071,0.0008905364,0.0015591921,0.0015550687,0.007267039,0.007917255,0.005355673,0.05201626,0.010704973],"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.0000406574,0.000016135285,0.00008946219,0.00010926153,0.000012517157,0.00007038817,0.000120510434,0.00005123071,0.000065414315,0.001933048,0.99295443,0.004536903],"study_design_scores_gemma":[0.000076341596,0.00003634952,0.0006631067,0.0005600074,0.00003045516,0.00036887964,0.00080696726,0.000335515,0.00022081872,0.015823929,0.98100317,0.00007465995],"about_ca_topic_score_codex":0.0031136628,"about_ca_topic_score_gemma":0.0029254353,"teacher_disagreement_score":0.03983755,"about_ca_system_score_codex":0.0055008573,"about_ca_system_score_gemma":0.004124386,"threshold_uncertainty_score":0.04979992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7201282,0.008913056,0.12693802,0.004042042,0.00045667624,0.00017789735,0.050724823,0.014425714,0.0741936],"genre_scores_gemma":[0.90425086,0.0027240475,0.07776562,0.00008424461,0.00021585157,0.00013104263,0.010917144,0.00036444032,0.0035466985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999572,0.00013584274,0.000041034786,0.000075982374,0.00013305887,0.000042056883],"domain_scores_gemma":[0.9958643,0.0021098524,0.00082097034,0.00028659,0.0006919124,0.00022651488],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0011517972,0.0005367466,0.0002599063,0.019594094,0.0004906829,0.0034651093,0.00030991095,0.0003884338,0.0052570608],"category_scores_gemma":[0.005610324,0.00016350024,0.0004100777,0.016755996,0.0002509979,0.0025174601,0.0012589049,0.00033921574,0.0007438577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056273513,0.00016582404,0.19396594,0.0016960596,0.000607051,0.00081652985,0.011985575,0.046422523,0.014542105,0.087437466,0.063952595,0.5778456],"study_design_scores_gemma":[0.000100650366,0.000187464,0.3397283,0.00082578295,0.00044879704,0.0013399703,0.01249853,0.24959233,0.010127821,0.10994305,0.27497628,0.00023105793],"about_ca_topic_score_codex":0.0042309565,"about_ca_topic_score_gemma":0.004783224,"teacher_disagreement_score":0.9804059,"about_ca_system_score_codex":0.00045360063,"about_ca_system_score_gemma":0.0006340351,"threshold_uncertainty_score":0.017586648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04652236,0.00068660907,0.9490341,0.0004285865,0.00005601415,0.00015232776,0.00007755709,0.00046623495,0.0025762161],"genre_scores_gemma":[0.43752342,0.00040678823,0.5585309,0.00023445877,0.00008938288,0.00028469387,0.00030461513,0.00009807149,0.002527549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759287,0.0010563205,0.000111656795,0.00044209135,0.00063268567,0.00016432063],"domain_scores_gemma":[0.99414945,0.0033559022,0.00061039324,0.0006264937,0.0010034204,0.00025443788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003034442,0.0009877885,0.0011317051,0.004257129,0.001648749,0.0018968614,0.0023169178,0.0021710496,0.0014130076],"category_scores_gemma":[0.014740777,0.00047248116,0.0012295166,0.0026824612,0.0018810171,0.0033982832,0.0023891076,0.0012023173,0.00040869034],"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.0002550046,0.00024076269,0.009962309,0.00025581633,0.00029465812,0.00025503745,0.00063747563,0.48115847,0.0068990956,0.061946906,0.0045335814,0.43356088],"study_design_scores_gemma":[0.000020899732,0.000028026927,0.0003869118,0.000015265348,0.000017099397,0.00007693141,0.00007884716,0.9775842,0.0013712374,0.01924592,0.0011616284,0.000013081836],"about_ca_topic_score_codex":0.0042545768,"about_ca_topic_score_gemma":0.0042559467,"teacher_disagreement_score":0.004257129,"about_ca_system_score_codex":0.001210841,"about_ca_system_score_gemma":0.0013185147,"threshold_uncertainty_score":0.016047835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09064748,0.00025658953,0.8989773,0.00059647247,0.000050492818,0.000051949177,0.00046970413,0.00041498212,0.00853508],"genre_scores_gemma":[0.8397617,0.00040034633,0.15309575,0.00012742037,0.000049962247,0.00017243675,0.0009369159,0.00014022003,0.005315348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995664,0.00018600238,0.00001586138,0.000114101575,0.0000647078,0.000052996264],"domain_scores_gemma":[0.99810225,0.0010144055,0.00024156409,0.0003514398,0.00018078258,0.000109616194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009739687,0.00042637854,0.0004349287,0.0014305939,0.0005867069,0.0016190306,0.0010079065,0.0010997348,0.0036878474],"category_scores_gemma":[0.007590125,0.00024197338,0.0005614488,0.0013210488,0.0008600021,0.0027771206,0.0012024461,0.00093074335,0.00049366546],"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.000059921746,0.000027482043,0.004215085,0.00006389255,0.000036169415,0.00011329086,0.0004544421,0.6803741,0.0020364905,0.2740046,0.002171425,0.036443125],"study_design_scores_gemma":[0.000004467281,0.000011045772,0.00055488053,0.000007810471,0.000007483907,0.000031854004,0.000055215798,0.8819289,0.00030833724,0.11451455,0.002568044,0.0000074610243],"about_ca_topic_score_codex":0.0056273798,"about_ca_topic_score_gemma":0.004374928,"teacher_disagreement_score":0.0056273798,"about_ca_system_score_codex":0.001253418,"about_ca_system_score_gemma":0.00055072946,"threshold_uncertainty_score":0.012337089},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030451776,0.00051642413,0.9641668,0.0007627538,0.00006263394,0.000079034595,0.000777513,0.00026155432,0.0029213815],"genre_scores_gemma":[0.7920518,0.0014057732,0.17309248,0.00045458486,0.00026573543,0.0008462864,0.0029700887,0.00027186546,0.028641475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983985,0.00076609704,0.00007077273,0.00034434244,0.0002627626,0.00015746935],"domain_scores_gemma":[0.990995,0.006145943,0.000945976,0.0007276227,0.0007592024,0.00042619655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004237891,0.0008977712,0.0013979471,0.0012550115,0.00081772084,0.0020839733,0.0036722685,0.0018412146,0.008744703],"category_scores_gemma":[0.014555086,0.00079891953,0.0012969206,0.0015803697,0.0016983513,0.004769945,0.0017841342,0.0026805801,0.0017573535],"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.00010779221,0.00006750638,0.0020582601,0.00007784162,0.000082423845,0.00009508693,0.00029120067,0.50418586,0.0005344757,0.47802708,0.003066904,0.011405539],"study_design_scores_gemma":[0.0000074480768,0.0000071384484,0.00012877121,0.0000043663845,0.0000052312985,0.000010891333,0.000013220912,0.9174053,0.000049144746,0.08162124,0.00074099284,0.0000063281814],"about_ca_topic_score_codex":0.007818034,"about_ca_topic_score_gemma":0.008714848,"teacher_disagreement_score":0.008744703,"about_ca_system_score_codex":0.0019200287,"about_ca_system_score_gemma":0.0009540716,"threshold_uncertainty_score":0.02925402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052901324,0.00076977134,0.94307494,0.00018485649,0.000021344804,0.00013613432,0.00016827347,0.0005764996,0.0021668896],"genre_scores_gemma":[0.6561687,0.000585376,0.33966255,0.000090843365,0.00009437074,0.0002403516,0.0006329499,0.00017489254,0.0023499085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976451,0.000899381,0.00008024187,0.000587208,0.00061670406,0.0001712924],"domain_scores_gemma":[0.9933161,0.0034294508,0.0012321158,0.0007439255,0.00092492753,0.00035357583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020757893,0.0007332115,0.00092880515,0.00666571,0.0013449936,0.0014095461,0.001354708,0.0012972456,0.0015485744],"category_scores_gemma":[0.01149153,0.0004879704,0.00064124103,0.0036284144,0.0014991189,0.003469022,0.0021997436,0.000998606,0.0006246128],"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.00031159804,0.00025659212,0.027308816,0.00085693307,0.00035048916,0.0005252131,0.001321571,0.3204353,0.019616507,0.105015665,0.008020256,0.5159811],"study_design_scores_gemma":[0.00002539891,0.00006556768,0.004896926,0.000057033107,0.000046755857,0.00031982592,0.0003556942,0.9000576,0.0052393503,0.08549226,0.0033920323,0.00005158195],"about_ca_topic_score_codex":0.0025349183,"about_ca_topic_score_gemma":0.0032960533,"teacher_disagreement_score":0.00666571,"about_ca_system_score_codex":0.00096082006,"about_ca_system_score_gemma":0.0007115243,"threshold_uncertainty_score":0.0109779835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49741897,0.00027479624,0.49873963,0.00064965105,0.000030189127,0.000060063045,0.00037411458,0.00044318242,0.0020093578],"genre_scores_gemma":[0.9793108,0.0001280445,0.019076796,0.000051426035,0.000030013536,0.000041113955,0.00032778233,0.0000307578,0.001003343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988839,0.00053585717,0.00004070621,0.00025901364,0.0001803584,0.000100115256],"domain_scores_gemma":[0.98757637,0.009117073,0.0013716638,0.0006516555,0.0009480722,0.00033521626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002469735,0.00064754573,0.0008114924,0.0015964996,0.00042848612,0.00096193986,0.0010958127,0.00088790513,0.0010375467],"category_scores_gemma":[0.016439585,0.0006260408,0.0005367576,0.0014210937,0.00074524665,0.0020653238,0.00096300914,0.0013681678,0.00044095522],"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.00019187617,0.00018393043,0.056619924,0.00006835132,0.00012843966,0.00021627663,0.0003082568,0.88770264,0.0012665427,0.007943484,0.0013892686,0.043981086],"study_design_scores_gemma":[0.000002320568,0.00000787713,0.0015164228,0.000002438865,0.0000030917176,0.000008419843,0.0000069782127,0.99601126,0.000091093156,0.002301334,0.000045545643,0.000003087781],"about_ca_topic_score_codex":0.008585871,"about_ca_topic_score_gemma":0.00802894,"teacher_disagreement_score":0.008585871,"about_ca_system_score_codex":0.0008539806,"about_ca_system_score_gemma":0.00054346886,"threshold_uncertainty_score":0.017071784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036474947,0.0002835702,0.9607171,0.00018998372,0.000011625722,0.00016245226,0.000067852765,0.00085321796,0.0012393817],"genre_scores_gemma":[0.33086216,0.00026080752,0.66527593,0.00016733425,0.000053371597,0.00046129027,0.0005244505,0.00018393711,0.002210698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790335,0.0007967367,0.000089506924,0.00048458058,0.00055525656,0.00017056853],"domain_scores_gemma":[0.99186873,0.005405991,0.00087135605,0.0007720361,0.00085599505,0.00022596803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002662052,0.0009277238,0.0014054935,0.0037491962,0.0013793645,0.0012810774,0.0026150034,0.001526923,0.0015050417],"category_scores_gemma":[0.012713703,0.0008333836,0.0010135623,0.0027617456,0.001623617,0.0032189877,0.0028566753,0.0011594025,0.00067528366],"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.0002951285,0.0002785944,0.010364047,0.0003412357,0.00022154268,0.00063295773,0.0012412305,0.55978966,0.017679082,0.022472968,0.0050993683,0.38158423],"study_design_scores_gemma":[0.00002051276,0.00003385571,0.00048738226,0.000011096134,0.000018525958,0.00012706703,0.00009754048,0.98600906,0.0015593979,0.010925454,0.00069834304,0.0000118051175],"about_ca_topic_score_codex":0.0051434548,"about_ca_topic_score_gemma":0.007920949,"teacher_disagreement_score":0.0051434548,"about_ca_system_score_codex":0.0009517704,"about_ca_system_score_gemma":0.0010148614,"threshold_uncertainty_score":0.014078438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83165073,0.00042483382,0.14534698,0.0016359368,0.00003581704,0.00005447953,0.00019375996,0.00033423625,0.02032331],"genre_scores_gemma":[0.98985016,0.0001611817,0.00801018,0.00010523642,0.000014715444,0.0000579685,0.0000834533,0.000037691552,0.001679391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995664,0.00019371755,0.000018277487,0.00006115951,0.00006889909,0.000091624104],"domain_scores_gemma":[0.997837,0.0011187589,0.00046797542,0.00016096923,0.00016778488,0.0002475447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088983204,0.00031052937,0.0005845546,0.0017841647,0.0011009135,0.001576898,0.00076643226,0.0010868101,0.0024247286],"category_scores_gemma":[0.0065931883,0.00048648444,0.00057771994,0.00053061574,0.001994928,0.0017725469,0.0013244944,0.0009040418,0.00020473303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013166074,0.000095432624,0.0077911764,0.000082398015,0.000101489306,0.00052970473,0.00096523174,0.2695251,0.0050288048,0.70342195,0.0022982361,0.010028785],"study_design_scores_gemma":[0.000041237214,0.00004556415,0.0043011596,0.000032874323,0.00002643706,0.00018994244,0.0003481996,0.62460536,0.00042920708,0.36821592,0.0017174197,0.000046623012],"about_ca_topic_score_codex":0.0030826454,"about_ca_topic_score_gemma":0.0025799924,"teacher_disagreement_score":0.0030826454,"about_ca_system_score_codex":0.0012595179,"about_ca_system_score_gemma":0.0004949211,"threshold_uncertainty_score":0.0091385245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018911218,0.0010380076,0.9745695,0.0008238981,0.00010465548,0.00013385844,0.0013499584,0.000432591,0.0026362883],"genre_scores_gemma":[0.70924985,0.0034259388,0.24743217,0.0006657389,0.0004916912,0.0014378204,0.005372566,0.00029164416,0.031632654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996953,0.0014556277,0.00013564364,0.0006863866,0.0005331528,0.00023616546],"domain_scores_gemma":[0.99212897,0.005418557,0.000703887,0.0005658581,0.0009514722,0.00023133314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044371826,0.0013981947,0.0029037623,0.0014099933,0.000782505,0.0017938722,0.004870222,0.0028255214,0.007277686],"category_scores_gemma":[0.013574665,0.0013520902,0.0016048951,0.0026325514,0.001239616,0.004073419,0.0012711957,0.0025163707,0.003838151],"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.0001742781,0.00009929992,0.0026269185,0.00020221205,0.00018748289,0.00014349679,0.0001914275,0.8449817,0.001054063,0.11501884,0.004885644,0.03043463],"study_design_scores_gemma":[0.000013031352,0.00001552524,0.00018208066,0.000006982881,0.000009659258,0.000015194943,0.0000048081465,0.9848631,0.000040311483,0.014235144,0.0006042679,0.000009956812],"about_ca_topic_score_codex":0.037611295,"about_ca_topic_score_gemma":0.038470026,"teacher_disagreement_score":0.037611295,"about_ca_system_score_codex":0.0019480648,"about_ca_system_score_gemma":0.0014425981,"threshold_uncertainty_score":0.074784756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06281279,0.00038246412,0.93493074,0.00017013439,0.000034834466,0.000024481378,0.00005870252,0.00032376667,0.0012620359],"genre_scores_gemma":[0.9224863,0.0005806725,0.07530754,0.000050954335,0.00008458946,0.000060801198,0.00009615052,0.00006457789,0.0012683326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956876,0.00015186524,0.000023284489,0.00007328542,0.000109095636,0.00007364258],"domain_scores_gemma":[0.9991511,0.00033740757,0.0001469796,0.00015174707,0.00016152035,0.000051284846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081538386,0.0006011749,0.00063700875,0.0010860767,0.00041882944,0.00078020204,0.0011193702,0.0009060593,0.00055561843],"category_scores_gemma":[0.0032364724,0.00029482273,0.0008197516,0.00075275,0.00067256304,0.0020510862,0.00068900257,0.0009311115,0.0001960725],"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.000029432136,0.000034541237,0.0013054637,0.000037011916,0.000036673802,0.000107049746,0.00013817009,0.8942841,0.004815541,0.08177837,0.0005620528,0.016871544],"study_design_scores_gemma":[9.841954e-7,0.000003913416,0.00007712069,0.0000013424764,0.0000019105782,0.0000094718,0.0000030403746,0.9930468,0.00015050128,0.006510646,0.0001913005,0.000002969089],"about_ca_topic_score_codex":0.0054363767,"about_ca_topic_score_gemma":0.0022050438,"teacher_disagreement_score":0.0054363767,"about_ca_system_score_codex":0.00090139953,"about_ca_system_score_gemma":0.0005392971,"threshold_uncertainty_score":0.010809481},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1642212,0.0011829498,0.8275903,0.0012940035,0.00008907463,0.00010675223,0.00017166226,0.000189892,0.0051541924],"genre_scores_gemma":[0.95160043,0.0012690666,0.042416595,0.00014331168,0.000118124684,0.00018374789,0.00013842717,0.000044199154,0.0040860735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943,0.00021760339,0.000026173526,0.00012830802,0.00014473245,0.000053140197],"domain_scores_gemma":[0.9966265,0.0020318662,0.00056667096,0.0002338123,0.00034634268,0.00019477594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021551864,0.0005853399,0.0006901517,0.0014518125,0.000844549,0.0013065852,0.0015295299,0.0015811175,0.0020879046],"category_scores_gemma":[0.01061966,0.00039312278,0.0007563932,0.0009861506,0.0023469387,0.0023278864,0.0011526269,0.001351171,0.00032837916],"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.00004372683,0.000035802525,0.0029782706,0.00013860624,0.000045561952,0.0003515591,0.0004362689,0.16908918,0.0065721185,0.8091002,0.0015870293,0.009621611],"study_design_scores_gemma":[0.000013543064,0.000018761324,0.0008988691,0.000017596938,0.000012099033,0.00015183439,0.00003577035,0.83450305,0.0005454892,0.16285743,0.0009233181,0.00002224368],"about_ca_topic_score_codex":0.0018814713,"about_ca_topic_score_gemma":0.001633103,"teacher_disagreement_score":0.0021551864,"about_ca_system_score_codex":0.0013216295,"about_ca_system_score_gemma":0.0005837734,"threshold_uncertainty_score":0.011397839},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30076495,0.00039926104,0.67942554,0.00087219896,0.00009263673,0.0007819736,0.005055937,0.0058991765,0.0067083295],"genre_scores_gemma":[0.6293612,0.00021952178,0.3643605,0.0000552939,0.00006315135,0.0005083874,0.0035472144,0.00013835484,0.0017463964],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9973477,0.0012866228,0.0002473943,0.00036822076,0.00066212553,0.00008784772],"domain_scores_gemma":[0.9850154,0.009319642,0.0022346394,0.0013108735,0.0015681472,0.00055122847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034519306,0.0007747635,0.0005087633,0.00840867,0.0005463275,0.0010975385,0.0008988763,0.0006392974,0.002034631],"category_scores_gemma":[0.015666863,0.00022897602,0.00049338816,0.004083227,0.00029342348,0.0017424213,0.0012985645,0.0005982706,0.00071834016],"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.000511169,0.001127446,0.17254004,0.0006236427,0.00051793834,0.00051927223,0.0028831447,0.054227956,0.020134415,0.012010966,0.012146702,0.72275734],"study_design_scores_gemma":[0.00004461997,0.0002611475,0.06711384,0.00009345093,0.00007684124,0.0004265814,0.0014047851,0.884607,0.011470689,0.019749423,0.014683636,0.00006788074],"about_ca_topic_score_codex":0.0020324334,"about_ca_topic_score_gemma":0.0037365633,"teacher_disagreement_score":0.00840867,"about_ca_system_score_codex":0.0005031094,"about_ca_system_score_gemma":0.0005884621,"threshold_uncertainty_score":0.01825577},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019458059,0.00040909115,0.9682533,0.00071261486,0.00018002903,0.00014859898,0.0029465843,0.021363504,0.004040533],"genre_scores_gemma":[0.03349516,0.0011021352,0.9512039,0.00027657766,0.00012461601,0.0006800238,0.0034421023,0.0060873176,0.0035880804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837273,0.0006527191,0.00013099052,0.00028551483,0.0004647597,0.0000932757],"domain_scores_gemma":[0.9929081,0.004678068,0.00039841564,0.0007138738,0.0010215146,0.00028000688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037201247,0.0020501912,0.0011736517,0.006074855,0.0016086089,0.006148736,0.0035281044,0.0016903413,0.041384954],"category_scores_gemma":[0.015555853,0.0015079244,0.0019025591,0.003578716,0.0012633909,0.0052406657,0.003854025,0.0046326746,0.007883846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044057946,0.00026489695,0.0029813445,0.0023467708,0.0004209607,0.0007593497,0.002844515,0.06948399,0.022270283,0.4139373,0.20543529,0.27881476],"study_design_scores_gemma":[0.00019405433,0.000079876976,0.0011537634,0.00043310795,0.00008213158,0.0006126627,0.00056081754,0.34167284,0.0135103995,0.31415984,0.32731166,0.00022882728],"about_ca_topic_score_codex":0.0027363822,"about_ca_topic_score_gemma":0.0031250862,"teacher_disagreement_score":0.041384954,"about_ca_system_score_codex":0.0009912329,"about_ca_system_score_gemma":0.0014331478,"threshold_uncertainty_score":0.13844651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88251495,0.00052196917,0.11419502,0.0002208313,0.000035056873,0.00008322066,0.0007919621,0.00057725335,0.0010597062],"genre_scores_gemma":[0.99013877,0.00013240296,0.008721408,0.000008355565,0.000023885106,0.000020479172,0.0005817137,0.000026226555,0.0003469522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983798,0.00068444666,0.0001051704,0.00030319695,0.00040232667,0.00012504608],"domain_scores_gemma":[0.97486556,0.02101348,0.001333582,0.0010628517,0.0013239222,0.0004006536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031598136,0.0007474176,0.0007587456,0.002897508,0.00039198535,0.0011002121,0.0010613904,0.0011292584,0.000747899],"category_scores_gemma":[0.023236772,0.00029250007,0.0004747961,0.002269865,0.0004075426,0.0024119983,0.000491277,0.0005846772,0.00027062828],"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.0007297666,0.00044004683,0.063916445,0.00021932181,0.00022284256,0.0001693944,0.00018706011,0.8541774,0.0077796127,0.00215174,0.0010632618,0.068943046],"study_design_scores_gemma":[0.000002287865,0.00004292581,0.0023907018,0.0000017393079,0.000008955739,0.000032481057,0.000012821949,0.99637765,0.0008300862,0.00024600467,0.000050714883,0.0000035616574],"about_ca_topic_score_codex":0.011675301,"about_ca_topic_score_gemma":0.009573685,"teacher_disagreement_score":0.011675301,"about_ca_system_score_codex":0.0010217553,"about_ca_system_score_gemma":0.00047005844,"threshold_uncertainty_score":0.023214698},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54279006,0.0020192661,0.4350738,0.0026665349,0.00015809841,0.000241393,0.0037241657,0.00072540523,0.012601268],"genre_scores_gemma":[0.9662982,0.0007476967,0.025851024,0.00016332185,0.00009084562,0.00017234604,0.0013122134,0.00008628992,0.005277919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992366,0.0002970776,0.000028855284,0.00026858112,0.00008961608,0.000079345045],"domain_scores_gemma":[0.9952983,0.003085299,0.00078187254,0.00027186036,0.00031705137,0.00024563912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019849534,0.0007076673,0.0005392902,0.0012602834,0.00046753834,0.0014704039,0.0013071488,0.0012204959,0.002178475],"category_scores_gemma":[0.011369622,0.00071943423,0.000939468,0.0013146269,0.00079038285,0.0028900949,0.0010284955,0.0016737937,0.0006422642],"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.00019860559,0.00014062173,0.03790823,0.00014138527,0.00014694256,0.00036808674,0.0008550727,0.8860146,0.0027506577,0.038841307,0.0035474005,0.029087182],"study_design_scores_gemma":[0.000008408866,0.0000129859045,0.0020553751,0.000007802306,0.000013877342,0.00003674355,0.00003258547,0.99112856,0.00009273888,0.005883607,0.000720535,0.000006765341],"about_ca_topic_score_codex":0.03284424,"about_ca_topic_score_gemma":0.044057775,"teacher_disagreement_score":0.03284424,"about_ca_system_score_codex":0.0018487745,"about_ca_system_score_gemma":0.00073703093,"threshold_uncertainty_score":0.06530613},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46880355,0.014357983,0.46942937,0.006191192,0.0007705684,0.00013875768,0.00021001275,0.00033986216,0.039758753],"genre_scores_gemma":[0.9883068,0.0028151982,0.006444965,0.00021547398,0.00030013645,0.00003280012,0.00005014239,0.000040499108,0.0017938614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992398,0.000311867,0.000019893556,0.00008162248,0.00021713828,0.00012969457],"domain_scores_gemma":[0.99539006,0.0031768442,0.000558086,0.00015721629,0.0005205472,0.00019729724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012633957,0.0006205773,0.00057303766,0.0011590607,0.0007325051,0.001210954,0.0006601319,0.0007569946,0.002138144],"category_scores_gemma":[0.010473483,0.0002148777,0.00027296695,0.00083532906,0.0014087,0.002922327,0.0011926214,0.00076302246,0.00014247885],"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.0001275642,0.000040747484,0.0034780123,0.000237742,0.00006279921,0.00048666325,0.00035866967,0.7928851,0.0042918646,0.16065553,0.0030926117,0.034282703],"study_design_scores_gemma":[0.000019594703,0.00013176688,0.0028642928,0.000099424076,0.00004571098,0.0002761211,0.00033133852,0.78476214,0.0024942884,0.20228834,0.006635156,0.000051854073],"about_ca_topic_score_codex":0.0033285378,"about_ca_topic_score_gemma":0.0013386371,"teacher_disagreement_score":0.0033285378,"about_ca_system_score_codex":0.001109428,"about_ca_system_score_gemma":0.0004157349,"threshold_uncertainty_score":0.008049428},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0374505,0.0006900739,0.95550483,0.0006662935,0.000069868416,0.00012147444,0.00019324785,0.0018178556,0.003485822],"genre_scores_gemma":[0.35461497,0.00048587497,0.6426929,0.0001450343,0.000118033,0.00015537592,0.00037883542,0.00010348146,0.0013054875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594647,0.0018417902,0.00016058059,0.00044661187,0.0014985304,0.00010588738],"domain_scores_gemma":[0.9835397,0.012298344,0.000983345,0.0013728994,0.0016631486,0.0001425892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036610884,0.0009205723,0.00077971077,0.004388137,0.0010822127,0.001426258,0.0011459329,0.0013380521,0.0016302583],"category_scores_gemma":[0.01751563,0.0002952728,0.0005737082,0.0020716123,0.00085514534,0.0025125507,0.00083941955,0.001141873,0.0010271887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028559208,0.0003611987,0.0073176273,0.00042794648,0.0002049232,0.00021017669,0.00056208455,0.13789386,0.015002496,0.02017365,0.0051568635,0.81240356],"study_design_scores_gemma":[0.00002806148,0.000056942245,0.0025200732,0.000055689103,0.000030118752,0.00020734785,0.00018123255,0.95737034,0.009019282,0.027217848,0.0032756676,0.000037475245],"about_ca_topic_score_codex":0.0026732525,"about_ca_topic_score_gemma":0.0024542755,"teacher_disagreement_score":0.004388137,"about_ca_system_score_codex":0.00069437164,"about_ca_system_score_gemma":0.0009073456,"threshold_uncertainty_score":0.019361854},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9204771,0.0015183721,0.051343765,0.000711265,0.00020718672,0.00026920694,0.0035756282,0.00031419678,0.021583294],"genre_scores_gemma":[0.9663135,0.00050761545,0.025507005,0.000053742926,0.00014526208,0.00014674637,0.0026760285,0.00003824835,0.004611841],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984616,0.0005956257,0.00013247372,0.00018902455,0.00043470776,0.00018661543],"domain_scores_gemma":[0.99367416,0.0040682373,0.00076126726,0.0003607895,0.0006237856,0.00051176344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011666046,0.0005960799,0.00029909378,0.007003494,0.0007625987,0.0017927333,0.00059691904,0.000731003,0.0031956453],"category_scores_gemma":[0.0068367645,0.00016605051,0.0004128286,0.0036306665,0.0003521318,0.0028795637,0.0010034579,0.0005474845,0.0018692333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053393375,0.0007207288,0.49778387,0.00042259519,0.0001365649,0.00026780163,0.002103759,0.004188745,0.008049292,0.012820058,0.011626603,0.46134612],"study_design_scores_gemma":[0.000064103806,0.0005790476,0.49778575,0.00061098405,0.00036323996,0.0014808434,0.021241149,0.35756502,0.014262091,0.056611132,0.04930857,0.0001280575],"about_ca_topic_score_codex":0.0016626567,"about_ca_topic_score_gemma":0.0037993381,"teacher_disagreement_score":0.007003494,"about_ca_system_score_codex":0.0005298402,"about_ca_system_score_gemma":0.00036355475,"threshold_uncertainty_score":0.01069051},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12772629,0.0026950873,0.8613673,0.0007548675,0.000091863425,0.00047267159,0.0005635706,0.0043383283,0.0019900776],"genre_scores_gemma":[0.59890413,0.0012279064,0.39455387,0.00017131492,0.00024156983,0.000306601,0.0016952852,0.0002335071,0.002665766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667466,0.0012087874,0.00027134334,0.00048379911,0.0011495983,0.000211802],"domain_scores_gemma":[0.9885141,0.0083278585,0.00063982955,0.0009195375,0.0013209253,0.0002777201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041755666,0.00092012685,0.0024101245,0.0025251748,0.0007585876,0.0017534338,0.0014812201,0.00091366126,0.0013845171],"category_scores_gemma":[0.018508222,0.0005574795,0.0007211892,0.002747557,0.00060030486,0.0037497268,0.00096254307,0.0010633856,0.0007794567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029676915,0.0008968974,0.014509624,0.00069480785,0.00025339058,0.0005391859,0.00088386686,0.16121876,0.020001946,0.017920027,0.009919091,0.77019465],"study_design_scores_gemma":[0.000039541806,0.00013470248,0.0010773342,0.000013233458,0.000030739793,0.0001364698,0.00007739489,0.98807937,0.003680474,0.0051918398,0.0015215806,0.000017268607],"about_ca_topic_score_codex":0.007253367,"about_ca_topic_score_gemma":0.0049588582,"teacher_disagreement_score":0.007253367,"about_ca_system_score_codex":0.0006592089,"about_ca_system_score_gemma":0.0012229349,"threshold_uncertainty_score":0.022082806},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5810572,0.0005798083,0.34673578,0.00033003525,0.00014939277,0.000071279486,0.0006139773,0.00089958514,0.06956296],"genre_scores_gemma":[0.98006415,0.00012796752,0.01633391,0.000029301986,0.000009079245,0.000020670484,0.00013945522,0.000024553081,0.0032508355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997209,0.000057363373,0.000010140099,0.000083721505,0.00009859557,0.000029366824],"domain_scores_gemma":[0.9997811,0.000076828575,0.00003192701,0.000044041968,0.000051250423,0.000014886288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018558107,0.00016812194,0.0001499353,0.00039901983,0.00026008824,0.00049688725,0.0005254326,0.00041397006,0.003843356],"category_scores_gemma":[0.00090128963,0.00012064021,0.00017777784,0.0002806286,0.0003877427,0.0010475522,0.00020216258,0.00028244333,0.00031631504],"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.00030622107,0.00012157945,0.0021668156,0.00036122528,0.00007237802,0.0008253805,0.00037367514,0.23932295,0.3279277,0.3894435,0.0030048287,0.036073767],"study_design_scores_gemma":[0.000017476577,0.00013914453,0.0022018384,0.000023192526,0.00003145625,0.0003431216,0.000073150666,0.8984431,0.038340494,0.05400186,0.0063404054,0.000044715165],"about_ca_topic_score_codex":0.00063646416,"about_ca_topic_score_gemma":0.0006264855,"teacher_disagreement_score":0.003843356,"about_ca_system_score_codex":0.00052898383,"about_ca_system_score_gemma":0.00017075634,"threshold_uncertainty_score":0.012857318},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022083234,0.0014687243,0.94416726,0.0025100233,0.0001819166,0.00017623338,0.000034822355,0.00029455108,0.029083194],"genre_scores_gemma":[0.5740288,0.0026348382,0.4006327,0.0005367629,0.00024378925,0.0010804221,0.00012917334,0.00027566045,0.020437788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970426,0.0015462323,0.00014449951,0.0004710135,0.0005598838,0.00023563705],"domain_scores_gemma":[0.9948544,0.0029304612,0.00039331152,0.0009386338,0.0005900072,0.00029324167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004474937,0.0008960019,0.00067569956,0.0008553833,0.0020009028,0.0032771886,0.0018195993,0.001926411,0.0051497933],"category_scores_gemma":[0.0110275,0.0007206461,0.00090949563,0.0007630508,0.0037920391,0.004446952,0.0038107212,0.0015151917,0.0009577879],"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.0000511725,0.0000701955,0.0010195398,0.0004057565,0.00006418194,0.0002665804,0.0018378996,0.09757064,0.0031782002,0.8466566,0.0030115773,0.0458677],"study_design_scores_gemma":[0.000058082256,0.00014043826,0.0003764231,0.0001702252,0.00006122009,0.00020458645,0.00066108204,0.2264844,0.0022714112,0.6916331,0.07790333,0.00003563856],"about_ca_topic_score_codex":0.0010191334,"about_ca_topic_score_gemma":0.0009507766,"teacher_disagreement_score":0.0051497933,"about_ca_system_score_codex":0.0012241738,"about_ca_system_score_gemma":0.0010382328,"threshold_uncertainty_score":0.023666024},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075561334,0.0004394635,0.9405308,0.00045692988,0.00011475105,0.0004335215,0.00651695,0.04035549,0.003595933],"genre_scores_gemma":[0.06879348,0.00042561238,0.91128093,0.00016788341,0.000075369215,0.00095446996,0.0111928,0.003061065,0.0040484318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847406,0.0004821011,0.000106601576,0.00028238082,0.0005606636,0.00009416999],"domain_scores_gemma":[0.99624604,0.0020446111,0.00035078524,0.00074157555,0.0004283891,0.00018852312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026041225,0.0018936051,0.0013576639,0.007078368,0.0016297912,0.003302154,0.0029391032,0.0015966494,0.013381815],"category_scores_gemma":[0.015422612,0.0011841903,0.0019286714,0.0054420284,0.0007218908,0.00576667,0.0036247682,0.002086707,0.005405231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007352866,0.00041317433,0.0100893965,0.0019996162,0.0010234158,0.00079474476,0.0021834588,0.11032775,0.011399814,0.09791207,0.17502035,0.5881009],"study_design_scores_gemma":[0.00021170866,0.000077803015,0.0018235727,0.00014231798,0.00009496529,0.0005797778,0.0003021717,0.78952014,0.008007938,0.11837395,0.08075624,0.00010941284],"about_ca_topic_score_codex":0.004121032,"about_ca_topic_score_gemma":0.006521764,"teacher_disagreement_score":0.013381815,"about_ca_system_score_codex":0.00065966864,"about_ca_system_score_gemma":0.0014346822,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67644453,0.0015572025,0.3110334,0.0019593523,0.00008953444,0.00022596646,0.00080525654,0.0005471031,0.0073376847],"genre_scores_gemma":[0.98302263,0.00090623554,0.013317752,0.000113563976,0.00008750757,0.00008035669,0.00033711686,0.00004722327,0.0020875833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989808,0.0003615469,0.00003576407,0.0002480344,0.00020789333,0.00016586072],"domain_scores_gemma":[0.98995835,0.006968893,0.001488775,0.0004660351,0.0006751465,0.0004429168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025677055,0.000696514,0.0007082644,0.0029248665,0.00090381864,0.0020725273,0.0018427812,0.0018758631,0.0019576708],"category_scores_gemma":[0.018623957,0.0006974725,0.00087877526,0.0015326433,0.0014658846,0.0046673953,0.0013766899,0.0014159839,0.0004512203],"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.0002092915,0.0002852277,0.08034604,0.00022465683,0.00015495897,0.000803938,0.0018332223,0.65783376,0.0055254726,0.19447613,0.0037591127,0.054548252],"study_design_scores_gemma":[0.000009244138,0.000021622684,0.004501224,0.000014332205,0.000015261208,0.000075324475,0.00011563998,0.97589684,0.00027180774,0.018241532,0.00081898994,0.000018098848],"about_ca_topic_score_codex":0.024823962,"about_ca_topic_score_gemma":0.009657269,"teacher_disagreement_score":0.024823962,"about_ca_system_score_codex":0.002204904,"about_ca_system_score_gemma":0.0006374606,"threshold_uncertainty_score":0.049358964},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31366384,0.000101609636,0.6733079,0.0007560891,0.000078265526,0.00012074558,0.00014403611,0.00039679324,0.011430632],"genre_scores_gemma":[0.8667068,0.00017654816,0.12746635,0.00008910962,0.00001900455,0.00012236169,0.00012998578,0.000094134855,0.0051957266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995987,0.00016790393,0.000015058815,0.00007110286,0.00009549558,0.000051889554],"domain_scores_gemma":[0.9990332,0.0003475103,0.00012641565,0.0002912868,0.000107363514,0.00009428565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007529889,0.00052500225,0.00037452238,0.0007464098,0.00063157384,0.0015972088,0.0008778923,0.000952645,0.0020479916],"category_scores_gemma":[0.0047309618,0.00034755218,0.0006368801,0.0003886212,0.00071299105,0.0024908301,0.0016706914,0.0010304791,0.0003146086],"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.000081279904,0.00013932705,0.0038768137,0.00006367321,0.000045132558,0.00027710473,0.0006398304,0.8002056,0.011388332,0.14801195,0.0009819391,0.034289084],"study_design_scores_gemma":[0.00000992456,0.000047515332,0.00061657676,0.000010271708,0.000009368905,0.00012154022,0.00013393901,0.954754,0.001314995,0.039963845,0.0030012063,0.000016821159],"about_ca_topic_score_codex":0.0010950618,"about_ca_topic_score_gemma":0.00084120705,"teacher_disagreement_score":0.0020479916,"about_ca_system_score_codex":0.00092864444,"about_ca_system_score_gemma":0.0004549758,"threshold_uncertainty_score":0.0068511963},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4914737,0.00037384237,0.49429417,0.00054646336,0.00009758281,0.0002726871,0.002852478,0.0013540469,0.008735004],"genre_scores_gemma":[0.80509996,0.0003129813,0.18439211,0.000065303204,0.00005206976,0.00017557481,0.006287807,0.000118683,0.0034955018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987883,0.00024925414,0.00008125713,0.00027978385,0.0004462052,0.00015526317],"domain_scores_gemma":[0.9978575,0.00033368345,0.00021876443,0.00050803897,0.0009705942,0.00011148582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008299834,0.0005200982,0.00065344176,0.0046157395,0.0009149789,0.002463,0.00091038045,0.0007894728,0.001537592],"category_scores_gemma":[0.003920793,0.00028610133,0.00049994374,0.0048899585,0.0005396856,0.0018575656,0.0009814177,0.0006859527,0.0009201374],"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.00043882817,0.00035688112,0.08330559,0.00042394348,0.00033695027,0.00045097616,0.0010006694,0.52636117,0.01758812,0.044272687,0.016148414,0.3093158],"study_design_scores_gemma":[0.00002465367,0.00007994038,0.026441397,0.00004032279,0.00008030172,0.00030212142,0.0006686672,0.90589523,0.008582852,0.0468571,0.010979075,0.000048198704],"about_ca_topic_score_codex":0.0060749105,"about_ca_topic_score_gemma":0.005058112,"teacher_disagreement_score":0.0060749105,"about_ca_system_score_codex":0.0012652592,"about_ca_system_score_gemma":0.0009283923,"threshold_uncertainty_score":0.01207912},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6640479,0.0016273363,0.29671395,0.009450316,0.00024868044,0.00021981802,0.0005959316,0.00037454424,0.0267216],"genre_scores_gemma":[0.9704705,0.0007401048,0.018741572,0.0004760759,0.00018985635,0.00013527309,0.00018255241,0.00012363264,0.008940575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979607,0.0010006228,0.00008547722,0.00048365223,0.00015543189,0.00031395978],"domain_scores_gemma":[0.97202414,0.023532452,0.0018030175,0.00080565363,0.0007750386,0.0010596563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059976736,0.0008118276,0.0028380477,0.0013781511,0.0017797321,0.0037294412,0.0022765615,0.004073131,0.006777261],"category_scores_gemma":[0.03234301,0.0011381052,0.001841502,0.0015086692,0.0029904624,0.008498251,0.0023065764,0.0030312685,0.00057957304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009327905,0.000342087,0.009667022,0.0005789077,0.00044389485,0.00055478606,0.0013944401,0.27516752,0.0027607954,0.64529604,0.0121879345,0.05067379],"study_design_scores_gemma":[0.00009802842,0.00012592788,0.0028063015,0.00006298836,0.00009569377,0.00013736774,0.00067110575,0.5610707,0.00039386013,0.4329166,0.0015659452,0.000055529807],"about_ca_topic_score_codex":0.005403691,"about_ca_topic_score_gemma":0.0049900697,"teacher_disagreement_score":0.006777261,"about_ca_system_score_codex":0.0020257044,"about_ca_system_score_gemma":0.0012314005,"threshold_uncertainty_score":0.03171909},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13964109,0.00077482156,0.8479547,0.0016644527,0.00009223615,0.00048040212,0.004135023,0.0016184468,0.0036387665],"genre_scores_gemma":[0.5636659,0.0002976414,0.4308477,0.000101783444,0.0000791305,0.00027230792,0.0037279457,0.000050185474,0.0009574102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99418855,0.002373421,0.000493182,0.0012814244,0.0014471515,0.00021623996],"domain_scores_gemma":[0.9843183,0.008187302,0.0018944561,0.0037215983,0.001416196,0.00046215637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053596143,0.0006076362,0.00090920716,0.0076733218,0.0014710656,0.0021582525,0.0015536486,0.001288839,0.0014389806],"category_scores_gemma":[0.02402076,0.00034170868,0.0013146106,0.006546508,0.00063734734,0.003263698,0.0020827022,0.0012059342,0.00086052465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000789512,0.0015331297,0.103825465,0.0007775474,0.0010794437,0.0018735741,0.00181667,0.17014068,0.010562235,0.058002416,0.01659463,0.6330047],"study_design_scores_gemma":[0.000029807394,0.00009488756,0.00990868,0.00006221289,0.00012401213,0.0003895844,0.0004965285,0.93189234,0.0058838283,0.041438706,0.009630934,0.00004858878],"about_ca_topic_score_codex":0.0057643442,"about_ca_topic_score_gemma":0.009484038,"teacher_disagreement_score":0.0076733218,"about_ca_system_score_codex":0.0013856573,"about_ca_system_score_gemma":0.0014628466,"threshold_uncertainty_score":0.02834469},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017068387,0.00008825695,0.9969894,0.00007215147,0.000017962251,0.000024133398,0.000051673273,0.00019605305,0.0008535358],"genre_scores_gemma":[0.05602477,0.0002482013,0.9400432,0.0001085676,0.000060097034,0.00016865192,0.0003648048,0.00026591876,0.0027158486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979588,0.0005057623,0.00010250969,0.0004936717,0.00078865065,0.00015057117],"domain_scores_gemma":[0.99787307,0.0007660075,0.00021004915,0.00046258263,0.000594443,0.000093833514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013990926,0.0009733629,0.0013667685,0.002620845,0.0008793129,0.0021537594,0.002391144,0.0018666087,0.004093243],"category_scores_gemma":[0.0060440865,0.0009262172,0.001455589,0.0029845708,0.0009259749,0.002433773,0.0023318445,0.002253755,0.001557278],"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.00013395093,0.000096996126,0.0010577263,0.00033178477,0.00020404324,0.00014894476,0.00024576334,0.4057469,0.012281741,0.18058428,0.010175657,0.38899216],"study_design_scores_gemma":[0.000022533617,0.00003825585,0.00034619425,0.000025313417,0.000036278198,0.00009619355,0.000050910774,0.9068319,0.0028273896,0.082596876,0.0071042213,0.000024004416],"about_ca_topic_score_codex":0.0035516417,"about_ca_topic_score_gemma":0.005957366,"teacher_disagreement_score":0.004093243,"about_ca_system_score_codex":0.0010329699,"about_ca_system_score_gemma":0.0012335782,"threshold_uncertainty_score":0.013693213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41164944,0.00019019305,0.5708977,0.0005970754,0.000031159696,0.00007016189,0.00018092962,0.00026681763,0.016116504],"genre_scores_gemma":[0.933895,0.00017326754,0.061672352,0.00009668922,0.000015194843,0.00010435861,0.00016936442,0.000039217946,0.0038345593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954623,0.00021781203,0.00002032243,0.0000803701,0.00008239986,0.000052769865],"domain_scores_gemma":[0.99838877,0.00093208335,0.00021990402,0.00020906905,0.0001350226,0.00011516714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009607437,0.00030493495,0.00043194828,0.0008650252,0.0005517132,0.0013714273,0.0010547739,0.0010671853,0.0026122585],"category_scores_gemma":[0.0059322,0.000250503,0.00048971473,0.00051318377,0.0010863909,0.0019030066,0.0013308333,0.0008637263,0.00023569068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007069994,0.000037445894,0.001506031,0.000039841565,0.000034273595,0.00022795073,0.00038334724,0.4766566,0.0027098865,0.5029372,0.00069431175,0.014702392],"study_design_scores_gemma":[0.000013657146,0.000024305942,0.00028157217,0.000007729072,0.0000087292265,0.00007015352,0.00007493393,0.8354935,0.00048049714,0.16245656,0.0010773247,0.0000111106165],"about_ca_topic_score_codex":0.00082641,"about_ca_topic_score_gemma":0.00073754037,"teacher_disagreement_score":0.0026122585,"about_ca_system_score_codex":0.00077521295,"about_ca_system_score_gemma":0.0002822498,"threshold_uncertainty_score":0.008738875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95511556,0.0002785952,0.041270874,0.00014999244,0.000010562826,0.000013473929,0.00003466996,0.00008687811,0.0030392928],"genre_scores_gemma":[0.9978847,0.0000770618,0.0016884521,0.000007251049,0.000006164811,0.000007009143,0.0000165975,0.0000060553125,0.00030662466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998745,0.000038593094,0.0000068413765,0.000023206316,0.000029433812,0.000027473347],"domain_scores_gemma":[0.9990583,0.00044704406,0.00021250058,0.000086809276,0.00009650208,0.00009894303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032565556,0.00034818045,0.00030850124,0.00087568414,0.00037162594,0.0006598856,0.0006296419,0.0004654974,0.0006991653],"category_scores_gemma":[0.0030056115,0.00017195824,0.0003192949,0.00032579253,0.0012040059,0.0012404639,0.0004433357,0.00041537816,0.000059325026],"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.00019297695,0.00011073337,0.006709369,0.00013003431,0.000088598434,0.0006901004,0.00056845526,0.72676015,0.03379024,0.22386667,0.00073638896,0.0063562626],"study_design_scores_gemma":[0.000011547676,0.000021269792,0.001108014,0.0000072751977,0.000012248297,0.000048398397,0.000035854267,0.96455073,0.0019356766,0.032078512,0.00017954322,0.000010905212],"about_ca_topic_score_codex":0.0036711309,"about_ca_topic_score_gemma":0.002308245,"teacher_disagreement_score":0.0036711309,"about_ca_system_score_codex":0.0008188226,"about_ca_system_score_gemma":0.0002764271,"threshold_uncertainty_score":0.0072995424},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013850803,0.0002391559,0.9821401,0.000396726,0.0000619656,0.00010173542,0.00030765563,0.00036162572,0.0025402028],"genre_scores_gemma":[0.18183462,0.00025668053,0.81073886,0.00033338604,0.00007066764,0.0002774415,0.0010392033,0.00029378317,0.005155387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979976,0.00049006264,0.00010039005,0.000617959,0.0005803333,0.0002135829],"domain_scores_gemma":[0.9966292,0.0009788082,0.00041185174,0.001085164,0.0006605146,0.00023431561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001343749,0.0012298913,0.001701112,0.0015144835,0.0015812078,0.002203437,0.0036314689,0.0024575081,0.0067699016],"category_scores_gemma":[0.0059572584,0.00068295054,0.0011854713,0.0028775039,0.0011849033,0.0033655392,0.0029389889,0.0016065178,0.0019430807],"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.00040789213,0.00023574298,0.002509702,0.0005273545,0.0001888838,0.00027774728,0.0002636735,0.57427883,0.020173818,0.12804833,0.018302226,0.25478575],"study_design_scores_gemma":[0.000016005386,0.000054947028,0.00070422195,0.000018681792,0.00001923506,0.00018486951,0.00006198291,0.9298636,0.0039757476,0.060084723,0.00498074,0.00003516972],"about_ca_topic_score_codex":0.005363828,"about_ca_topic_score_gemma":0.008346163,"teacher_disagreement_score":0.0067699016,"about_ca_system_score_codex":0.0017617112,"about_ca_system_score_gemma":0.0014754708,"threshold_uncertainty_score":0.02264756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41191262,0.00031538145,0.5768102,0.0009087768,0.000037731425,0.00006679096,0.000120507255,0.00024658686,0.009581334],"genre_scores_gemma":[0.99335515,0.00012618239,0.0053700493,0.00002425471,0.00001170826,0.000037704296,0.000017048646,0.000020739013,0.0010370727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997062,0.000117814714,0.0000099001,0.00004895671,0.00005636786,0.000060681337],"domain_scores_gemma":[0.9988555,0.00067521667,0.00024100149,0.0000778898,0.00008559507,0.0000648327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005948855,0.00075414,0.0004395688,0.0007229156,0.0003710266,0.00086983305,0.00086375355,0.00076473603,0.0015018885],"category_scores_gemma":[0.0031370255,0.00028690248,0.00060023053,0.00048084027,0.001036103,0.001639432,0.0008100796,0.00068295444,0.00011474348],"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.000021855783,0.000010024206,0.00061816804,0.000011169008,0.000009570949,0.00004560226,0.000026656371,0.9832418,0.0005871282,0.013623737,0.00011278932,0.0016914211],"study_design_scores_gemma":[0.0000019913912,0.0000065295894,0.00012961606,0.0000012360373,0.0000038160124,0.0000071862614,0.0000074690247,0.9941896,0.00006729242,0.0055258404,0.000057208294,0.0000021450542],"about_ca_topic_score_codex":0.0051379,"about_ca_topic_score_gemma":0.0030236105,"teacher_disagreement_score":0.0051379,"about_ca_system_score_codex":0.0012516725,"about_ca_system_score_gemma":0.00047271064,"threshold_uncertainty_score":0.010215998},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07459673,0.0006839275,0.9194549,0.00040100617,0.00027624116,0.0000911915,0.0008384822,0.0014979469,0.0021595228],"genre_scores_gemma":[0.7983769,0.00051123917,0.18910834,0.00021854973,0.00041020385,0.00021740557,0.003325203,0.00018473227,0.007647387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920374,0.00019551723,0.0000479649,0.0001877309,0.00025329622,0.00011180255],"domain_scores_gemma":[0.99750704,0.0012047701,0.00013535669,0.00035324675,0.0006687745,0.00013093613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019174672,0.0009136961,0.0014915002,0.0025321636,0.0008261045,0.0009262935,0.0013978247,0.0012228313,0.0026487089],"category_scores_gemma":[0.005114797,0.00032930335,0.00093871105,0.0020665948,0.0003537418,0.002120062,0.0012092319,0.0013686625,0.00091771956],"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.00036123008,0.0004277505,0.006170066,0.000095427145,0.00028754422,0.00012374276,0.00008948066,0.49303797,0.0039375625,0.005829894,0.011039118,0.4786002],"study_design_scores_gemma":[0.0000025111171,0.000009703759,0.0002039391,0.0000021644705,0.000009869608,0.000005720737,0.00000605527,0.9977102,0.0002647275,0.0015755084,0.00020704817,0.0000026445293],"about_ca_topic_score_codex":0.011691026,"about_ca_topic_score_gemma":0.016303694,"teacher_disagreement_score":0.011691026,"about_ca_system_score_codex":0.0004961946,"about_ca_system_score_gemma":0.0011022793,"threshold_uncertainty_score":0.02324599},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029662102,0.00029910557,0.9593774,0.00034408493,0.000037939815,0.0003303428,0.0014025021,0.0053099478,0.0032365185],"genre_scores_gemma":[0.11610596,0.0002586811,0.87734354,0.00009922271,0.000020640588,0.00034342386,0.0028676495,0.00037271468,0.0025881964],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99791855,0.0007308105,0.00022367631,0.0005513226,0.00042801417,0.00014765136],"domain_scores_gemma":[0.9935415,0.0035492529,0.00056131365,0.0014380623,0.0006420014,0.0002678073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025688915,0.0007189791,0.0009185904,0.003974408,0.0025075176,0.0032746363,0.0015893875,0.0017001057,0.0043740515],"category_scores_gemma":[0.015585526,0.0009179907,0.0015228485,0.0043469286,0.0015041098,0.007127692,0.00396113,0.0014585492,0.0018230086],"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.00040000046,0.00027723185,0.015126419,0.00084599137,0.00017773967,0.00043419807,0.0043975785,0.17992924,0.00864726,0.28312847,0.02616968,0.4804662],"study_design_scores_gemma":[0.000070566835,0.00008857414,0.0014252248,0.00011402597,0.00006370685,0.00020313742,0.0010091175,0.77351886,0.0068850885,0.1660475,0.05051471,0.000059380294],"about_ca_topic_score_codex":0.009857444,"about_ca_topic_score_gemma":0.016654002,"teacher_disagreement_score":0.009857444,"about_ca_system_score_codex":0.0021249107,"about_ca_system_score_gemma":0.0021967054,"threshold_uncertainty_score":0.019600153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50343454,0.0009745479,0.45375255,0.004590987,0.00017385335,0.00017686703,0.0074841627,0.00076297735,0.028649503],"genre_scores_gemma":[0.9600867,0.0010307964,0.016231116,0.00021612972,0.00013167506,0.00019893018,0.0026547485,0.00023312944,0.01921681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990657,0.00022495551,0.000034471508,0.00029151273,0.00020987426,0.00017360401],"domain_scores_gemma":[0.989176,0.0069584334,0.0008864454,0.0010937187,0.0012107528,0.0006747269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014830868,0.0003034472,0.0005580123,0.002259068,0.00076158525,0.0019683477,0.0013608685,0.0011455406,0.008945079],"category_scores_gemma":[0.018374763,0.00041080525,0.000425103,0.00155581,0.0014388374,0.004230559,0.00076331303,0.0011330389,0.0020794026],"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.00022424638,0.00007609855,0.013890764,0.00023969037,0.000047376914,0.00026136398,0.00081272714,0.06417819,0.004634889,0.86819977,0.01709679,0.030338103],"study_design_scores_gemma":[0.000052077758,0.000063092804,0.012140926,0.00011390504,0.000046691413,0.000770382,0.00037577425,0.40686452,0.0036435798,0.562585,0.013264531,0.000079516176],"about_ca_topic_score_codex":0.0025014945,"about_ca_topic_score_gemma":0.0039008358,"teacher_disagreement_score":0.008945079,"about_ca_system_score_codex":0.0016695068,"about_ca_system_score_gemma":0.00057376234,"threshold_uncertainty_score":0.029924273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96339524,0.00019107558,0.034004573,0.00019475783,0.000016612725,0.000036743866,0.00018378555,0.00013127073,0.0018457881],"genre_scores_gemma":[0.9757776,0.000119669276,0.022962105,0.000022522361,0.000005015268,0.000037070116,0.00047973302,0.000038030797,0.00055818685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992367,0.0003623258,0.000056985515,0.00014282911,0.00014426847,0.00005695585],"domain_scores_gemma":[0.9921015,0.00565375,0.0005806556,0.00060325133,0.0008103073,0.0002505667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030837418,0.00044792666,0.00036820158,0.0028065129,0.00052755105,0.0013890312,0.0006663174,0.00086872774,0.0007968048],"category_scores_gemma":[0.02144507,0.00038443957,0.0005544857,0.0010979421,0.0008384914,0.0020108426,0.0008521245,0.0006950847,0.0001021062],"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.00025274456,0.00006804792,0.016052818,0.000071474904,0.00011912593,0.00011289602,0.0002327899,0.9567977,0.002475937,0.009937153,0.00027760174,0.013601682],"study_design_scores_gemma":[0.000011621919,0.00004432536,0.0024534576,0.0000064877613,0.000011053738,0.000039320683,0.000053617423,0.9927261,0.0010368383,0.0033705765,0.00023735713,0.000009272529],"about_ca_topic_score_codex":0.0025678216,"about_ca_topic_score_gemma":0.0021983406,"teacher_disagreement_score":0.0030837418,"about_ca_system_score_codex":0.0017983434,"about_ca_system_score_gemma":0.00045516467,"threshold_uncertainty_score":0.016308546},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32747418,0.002780998,0.6474901,0.0006891683,0.00040954322,0.00088879,0.0031756586,0.0035188652,0.013572724],"genre_scores_gemma":[0.54874486,0.00062408077,0.44176888,0.00013823915,0.0001439685,0.0005757093,0.006019797,0.00045798146,0.0015264383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98279494,0.0055488204,0.0022597231,0.0017816416,0.007151089,0.0004637661],"domain_scores_gemma":[0.9050149,0.069121875,0.0074011395,0.0047908504,0.012001429,0.001669834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019157017,0.0017849326,0.0020268722,0.020341834,0.0019197854,0.0037222798,0.001991427,0.002832119,0.001743963],"category_scores_gemma":[0.08971703,0.00038761095,0.0012910911,0.009459052,0.0014909095,0.0079166675,0.002977448,0.0016473322,0.0008260077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019906126,0.00088352157,0.092091456,0.0019425042,0.0018034593,0.00031094562,0.001844221,0.12709205,0.02315664,0.01991594,0.017611658,0.71135694],"study_design_scores_gemma":[0.00018050922,0.0018535617,0.034707326,0.0001835903,0.0003831762,0.00056913635,0.001263175,0.88263947,0.03630363,0.032464895,0.009229485,0.00022200789],"about_ca_topic_score_codex":0.00231731,"about_ca_topic_score_gemma":0.0030750379,"teacher_disagreement_score":0.020341834,"about_ca_system_score_codex":0.0017789613,"about_ca_system_score_gemma":0.0011131173,"threshold_uncertainty_score":0.10131323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9817878,0.0022580512,0.0073842895,0.0007338044,0.00012056309,0.000050009032,0.00017246345,0.00018095918,0.007311985],"genre_scores_gemma":[0.99742246,0.00057361735,0.0014930126,0.00009812902,0.00002092452,0.000013495707,0.000057397057,0.000011505682,0.00030946432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983455,0.0009376534,0.00007012905,0.00015961943,0.00022184625,0.00026525604],"domain_scores_gemma":[0.9341127,0.059997194,0.002687503,0.001150822,0.0012053302,0.0008464095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002535695,0.000697929,0.000689171,0.0010133489,0.00056355796,0.00078889827,0.0006433173,0.0011979338,0.0020350146],"category_scores_gemma":[0.026852144,0.00027040413,0.0005043581,0.00041059306,0.0011276996,0.0014643889,0.00065100385,0.00073938235,0.00018807822],"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.0017366004,0.000820409,0.017868007,0.0005524073,0.00035903792,0.00037499875,0.00023888654,0.88250166,0.020225074,0.009733116,0.002062862,0.063526876],"study_design_scores_gemma":[0.0002753333,0.0045186104,0.0142712565,0.0001671609,0.00038256767,0.00046355586,0.000475193,0.9341,0.0311741,0.01208789,0.0019999056,0.00008448552],"about_ca_topic_score_codex":0.0039583915,"about_ca_topic_score_gemma":0.0026335258,"teacher_disagreement_score":0.0039583915,"about_ca_system_score_codex":0.0013263312,"about_ca_system_score_gemma":0.0006236765,"threshold_uncertainty_score":0.013410211},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47845197,0.0005708951,0.5028698,0.0006959926,0.000028615566,0.00010598201,0.00036480045,0.00020589183,0.016706083],"genre_scores_gemma":[0.9715645,0.00019249214,0.02623783,0.000045678094,0.000023014698,0.00006878931,0.00017217553,0.000034020195,0.0016615174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956506,0.00013514132,0.000028586714,0.00009023928,0.00011245572,0.00006845051],"domain_scores_gemma":[0.9968375,0.0016653312,0.00072430674,0.00016465833,0.00036942406,0.00023873919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079570187,0.00035990216,0.00042964632,0.0023519234,0.0006948787,0.0013709521,0.0006198165,0.0008484792,0.002273758],"category_scores_gemma":[0.006298879,0.00032936898,0.00042052753,0.0008011868,0.0012092964,0.0018488201,0.0009594759,0.0008630682,0.00015271983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014946841,0.000063395826,0.007846035,0.00012641345,0.00007282258,0.00063408684,0.00059069577,0.38709632,0.010859499,0.5727304,0.0012673647,0.018563371],"study_design_scores_gemma":[0.00001239052,0.000033180706,0.0024297517,0.000021126814,0.000013185213,0.00036187386,0.00015417437,0.8477017,0.0015476814,0.14603192,0.0016714511,0.0000216124],"about_ca_topic_score_codex":0.0008846894,"about_ca_topic_score_gemma":0.0005822387,"teacher_disagreement_score":0.0023519234,"about_ca_system_score_codex":0.000886929,"about_ca_system_score_gemma":0.00032067014,"threshold_uncertainty_score":0.0076065063},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90945053,0.0012922143,0.0814672,0.0010351643,0.00014855468,0.0001291499,0.00048578385,0.00045689734,0.0055345013],"genre_scores_gemma":[0.9939845,0.00039779852,0.004800053,0.000080130725,0.000035439843,0.00003922354,0.00023172049,0.000054280415,0.00037682496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984744,0.00047369007,0.00006017491,0.00028625174,0.0004773001,0.00022805006],"domain_scores_gemma":[0.9910278,0.005281195,0.0011293776,0.001267039,0.0009040481,0.00039060242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016380629,0.0005845212,0.0004895227,0.0008264333,0.0006191963,0.0013299031,0.0009681447,0.00085002644,0.00083827454],"category_scores_gemma":[0.0144486595,0.00043445674,0.00035931045,0.0007237535,0.0013080736,0.0029618007,0.0011269244,0.0018155938,0.00030693025],"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.00014377004,0.00015295895,0.028221222,0.00019075193,0.000106103245,0.0003882365,0.00023784241,0.9267191,0.0142292995,0.0060285702,0.0013457161,0.022236383],"study_design_scores_gemma":[0.000007082175,0.000149099,0.016747402,0.000021085316,0.000043734435,0.00016427002,0.00043826166,0.9659314,0.0048105866,0.010173275,0.001483911,0.000029971048],"about_ca_topic_score_codex":0.00472561,"about_ca_topic_score_gemma":0.0047580553,"teacher_disagreement_score":0.00472561,"about_ca_system_score_codex":0.0011415884,"about_ca_system_score_gemma":0.0006866699,"threshold_uncertainty_score":0.009396195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9957325,0.0001647708,0.002158885,0.00022345128,0.0000070843894,0.000013352272,0.00043976775,0.00011960393,0.001140512],"genre_scores_gemma":[0.99784565,0.000052432784,0.0010842191,0.000026076641,0.000010756667,0.000009354435,0.00062530726,0.000025409667,0.00032081318],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990644,0.00033647136,0.00006317927,0.00026170653,0.00016109455,0.000113157104],"domain_scores_gemma":[0.9765604,0.014958074,0.0029460995,0.002188618,0.002322848,0.0010239994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019903346,0.00026436886,0.00053933106,0.00325064,0.0007329744,0.0027451133,0.0006543903,0.00096116436,0.0012313788],"category_scores_gemma":[0.026371095,0.00039622243,0.0004087441,0.0020144533,0.0012547146,0.0032270409,0.0009274287,0.0009996578,0.0006096997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040590766,0.0003330357,0.89584947,0.00021198271,0.0002610953,0.00076946616,0.002768748,0.035895016,0.0074455137,0.009993078,0.004754146,0.041312624],"study_design_scores_gemma":[0.00004064989,0.00016994702,0.69259876,0.00005077865,0.00009161764,0.0005741376,0.0013495691,0.2811252,0.0026883397,0.018398222,0.0028323908,0.0000804225],"about_ca_topic_score_codex":0.007348654,"about_ca_topic_score_gemma":0.011139863,"teacher_disagreement_score":0.007348654,"about_ca_system_score_codex":0.00096674135,"about_ca_system_score_gemma":0.00035413628,"threshold_uncertainty_score":0.014611781},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5282884,0.030551346,0.3214353,0.0030532267,0.0010027675,0.0015084083,0.077014476,0.0048478604,0.032298196],"genre_scores_gemma":[0.54999,0.0078087146,0.35471666,0.00031191157,0.0010006527,0.00091810216,0.075032204,0.0005827059,0.009639091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693906,0.00052926294,0.00044444264,0.00079206435,0.0010719075,0.0002233379],"domain_scores_gemma":[0.98880225,0.005722617,0.0017107883,0.0009800518,0.001983151,0.0008011134],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0021114412,0.00091816427,0.0012103366,0.04587173,0.0024910576,0.00375434,0.0017369798,0.0011737702,0.0029747696],"category_scores_gemma":[0.016317649,0.0006158063,0.0018940839,0.037787013,0.00078676647,0.005805058,0.0031227146,0.0010330791,0.0022167028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004969101,0.00052494684,0.14847852,0.004101447,0.0011239116,0.0011274264,0.0035871796,0.006246094,0.013564502,0.01692574,0.043487605,0.76033574],"study_design_scores_gemma":[0.00023553,0.0005047679,0.20992811,0.0037086366,0.0032765374,0.007268791,0.014599648,0.23455824,0.025785036,0.17312877,0.32665431,0.00035163248],"about_ca_topic_score_codex":0.0049081924,"about_ca_topic_score_gemma":0.015372535,"teacher_disagreement_score":0.95412827,"about_ca_system_score_codex":0.00096827204,"about_ca_system_score_gemma":0.0018817979,"threshold_uncertainty_score":0.011166453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.704334,0.0006823068,0.28550273,0.0014996192,0.00009429497,0.00015178758,0.00035552488,0.00019004397,0.007189665],"genre_scores_gemma":[0.9900309,0.00030569808,0.005761648,0.00008405134,0.000026264292,0.000104120685,0.000080649435,0.000025991201,0.0035805998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993068,0.00029951808,0.000016799957,0.00012539755,0.00008289379,0.00016853854],"domain_scores_gemma":[0.9947685,0.0036330505,0.000686669,0.00015356955,0.0004617144,0.00029653835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025749393,0.0011425039,0.0010822419,0.0013331935,0.0006357863,0.0011222322,0.0016762431,0.0019099932,0.0019877627],"category_scores_gemma":[0.006722562,0.00061369233,0.0013596333,0.00060644664,0.0019082804,0.0018187144,0.0008868289,0.0015278246,0.00013484327],"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.00011760535,0.0000720808,0.00160205,0.000053818443,0.00004776251,0.00015476499,0.00007756865,0.9728252,0.002386698,0.021522023,0.0002310694,0.0009093238],"study_design_scores_gemma":[0.000006393976,0.000030202385,0.00019172438,0.00000341467,0.000012075225,0.000008490959,0.000015889364,0.9979207,0.00015774128,0.0016055343,0.00004300418,0.0000048041406],"about_ca_topic_score_codex":0.013674549,"about_ca_topic_score_gemma":0.0050527416,"teacher_disagreement_score":0.013674549,"about_ca_system_score_codex":0.0022448408,"about_ca_system_score_gemma":0.0010563949,"threshold_uncertainty_score":0.02718991},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71355104,0.0012669492,0.24943921,0.0011880244,0.00023508353,0.0012884561,0.0136824045,0.0044555804,0.014893252],"genre_scores_gemma":[0.5158899,0.00049812254,0.44792444,0.0001249271,0.000097826814,0.0012089883,0.02733796,0.00027712603,0.0066406303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984648,0.00068701163,0.000096618845,0.00036886637,0.0003111889,0.000071556446],"domain_scores_gemma":[0.99479985,0.00391234,0.0002941493,0.00035623243,0.0005615231,0.00007591487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022769126,0.0007742071,0.0005505379,0.0064911963,0.00117083,0.0014704543,0.0010960663,0.001348341,0.002033367],"category_scores_gemma":[0.010033609,0.0003390874,0.00077343575,0.0043133176,0.00088064733,0.0012842702,0.001243352,0.0010399573,0.0008646618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079091976,0.00088666036,0.041493353,0.002107561,0.00036328376,0.0035592816,0.0066959313,0.1556595,0.023597304,0.030523377,0.037960175,0.69636273],"study_design_scores_gemma":[0.00011731193,0.00013739977,0.028014975,0.00014093028,0.00012452423,0.0007833714,0.0025474085,0.8977438,0.008954717,0.016408734,0.044944517,0.00008218509],"about_ca_topic_score_codex":0.009648153,"about_ca_topic_score_gemma":0.021796329,"teacher_disagreement_score":0.009648153,"about_ca_system_score_codex":0.0014923186,"about_ca_system_score_gemma":0.0010108949,"threshold_uncertainty_score":0.019183993},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33575577,0.009664889,0.1324501,0.032057438,0.0005056657,0.00016642248,0.00019707617,0.00035939028,0.48884332],"genre_scores_gemma":[0.96687883,0.0014862973,0.015585246,0.000422561,0.000074451134,0.00008619409,0.00006150006,0.000113008085,0.015291861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912847,0.005797473,0.00018511634,0.0011216782,0.0010805812,0.0005303907],"domain_scores_gemma":[0.9926198,0.0038855234,0.0007232603,0.0013547887,0.0009245211,0.0004922127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069434335,0.00066512334,0.0006057119,0.0030136383,0.008655218,0.012214269,0.0014513223,0.0030998709,0.0061051557],"category_scores_gemma":[0.010955996,0.0005606095,0.0007218331,0.0031270105,0.04898955,0.015077414,0.0075680274,0.004008315,0.00081627397],"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.000016284956,0.000007355986,0.0012309891,0.00006031583,0.000008164299,0.0002723421,0.070420995,0.00029699592,0.00036083942,0.9215892,0.0004743696,0.0052620973],"study_design_scores_gemma":[0.000017928805,0.000053363907,0.0030029223,0.0002339758,0.000020337266,0.000735122,0.09342242,0.0021964686,0.00078771316,0.69058764,0.20889643,0.00004567361],"about_ca_topic_score_codex":0.011214466,"about_ca_topic_score_gemma":0.009512919,"teacher_disagreement_score":0.012214269,"about_ca_system_score_codex":0.0069489824,"about_ca_system_score_gemma":0.0045826198,"threshold_uncertainty_score":0.050418615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67919415,0.0015300605,0.27723217,0.0035525288,0.000115785515,0.00015228067,0.00054272515,0.00018482842,0.03749547],"genre_scores_gemma":[0.97774655,0.00060940784,0.014149718,0.0001331189,0.00013146781,0.000110691995,0.00013619504,0.000020801941,0.0069620395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984958,0.00068565155,0.000049261114,0.00041254403,0.00025096507,0.00010576149],"domain_scores_gemma":[0.9689544,0.023660727,0.002964734,0.0014150647,0.0010269535,0.0019780723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002208141,0.00035669,0.00095942145,0.0034872217,0.0022839794,0.003544155,0.0012882052,0.0018899235,0.0087705115],"category_scores_gemma":[0.022931695,0.00066839874,0.0005301233,0.0031019947,0.002766526,0.008003994,0.002555752,0.0017047955,0.00078078255],"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.0002417551,0.00016239169,0.017681288,0.0002955964,0.00030256415,0.0009462915,0.0023987845,0.03909382,0.0019575509,0.8920177,0.004506944,0.040395364],"study_design_scores_gemma":[0.000052141415,0.00007342166,0.00567063,0.000046576362,0.00014557758,0.0004342763,0.0008868108,0.10859433,0.00036250832,0.8788262,0.0048777014,0.000029825902],"about_ca_topic_score_codex":0.0010772418,"about_ca_topic_score_gemma":0.0017524477,"teacher_disagreement_score":0.0087705115,"about_ca_system_score_codex":0.0007546616,"about_ca_system_score_gemma":0.000422184,"threshold_uncertainty_score":0.029340327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043731388,0.02636653,0.02531975,0.34110576,0.0014654659,0.00007016689,0.00023804004,0.00014282585,0.5615601],"genre_scores_gemma":[0.963617,0.009869497,0.0021710873,0.006512787,0.0018912938,0.00008542661,0.00009550844,0.000051721043,0.015705716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953885,0.002316634,0.0001256768,0.0004400567,0.0012521006,0.00047706632],"domain_scores_gemma":[0.98570883,0.010100932,0.0012027163,0.0012302366,0.0009207046,0.0008367045],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.006002961,0.0004170042,0.00060687365,0.002983131,0.0054047797,0.016029388,0.0008529445,0.004299868,0.009889823],"category_scores_gemma":[0.016464407,0.00026363868,0.0003486988,0.0031615968,0.029139444,0.020976527,0.0067228395,0.0041990224,0.00067907],"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.000004479098,0.000004574219,0.0001529077,0.000019231918,0.0000025905388,0.000019674964,0.0010888752,0.00019950626,0.000017623373,0.99342513,0.0020859633,0.0029794422],"study_design_scores_gemma":[0.0000055584865,0.0000074389495,0.00026598538,0.000069028174,0.0000031955979,0.000033657303,0.0019382401,0.00032188467,0.00003698803,0.9338979,0.06341228,0.000007903043],"about_ca_topic_score_codex":0.0026012782,"about_ca_topic_score_gemma":0.0016208058,"teacher_disagreement_score":0.9945952,"about_ca_system_score_codex":0.0073052016,"about_ca_system_score_gemma":0.0049943235,"threshold_uncertainty_score":0.053003192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92592233,0.0010501487,0.055684015,0.0005242567,0.00005071975,0.000053034906,0.00026456223,0.00019240908,0.016258515],"genre_scores_gemma":[0.9957384,0.0002384996,0.0024954604,0.000025459905,0.000015304078,0.000020905352,0.000065416665,0.000014042233,0.0013865274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987245,0.000040836472,0.0000049102073,0.000020136766,0.000031842534,0.000029894129],"domain_scores_gemma":[0.9993974,0.00028271312,0.000102726415,0.00004186615,0.00009554676,0.00007981282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031213515,0.0003018438,0.0003250433,0.0010814916,0.00040366678,0.0007216536,0.0003954334,0.00051175617,0.0013890312],"category_scores_gemma":[0.0018197423,0.00014267013,0.00028906137,0.0004365715,0.00071960053,0.0009927569,0.0002701127,0.00034905787,0.00010567043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018832697,0.0000761073,0.0034636534,0.00014731444,0.00007504436,0.0004696096,0.00024295159,0.48200825,0.014450196,0.49111968,0.0028269489,0.004931857],"study_design_scores_gemma":[0.000020641039,0.0000191893,0.0010058474,0.000013556955,0.000012944282,0.000058652768,0.000028897875,0.9215769,0.0011695947,0.07553512,0.0005453537,0.000013267509],"about_ca_topic_score_codex":0.005112786,"about_ca_topic_score_gemma":0.0030671763,"teacher_disagreement_score":0.005112786,"about_ca_system_score_codex":0.0012571465,"about_ca_system_score_gemma":0.00054353906,"threshold_uncertainty_score":0.010166049},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933211,0.0014752435,0.00028583847,0.0011122541,0.0000405409,0.000017657581,0.0014150287,0.0000120658515,0.0023202684],"genre_scores_gemma":[0.9976205,0.0004769804,0.00016460217,0.00006913016,0.000065697524,0.0000303441,0.0009994373,0.0000093179615,0.0005639697],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9949945,0.0020298918,0.0006831303,0.0008024111,0.0011159099,0.00037414464],"domain_scores_gemma":[0.8519082,0.04832085,0.061443906,0.011990193,0.019610891,0.006725998],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.010821052,0.00021660683,0.00046814146,0.010517185,0.0016636717,0.0031276986,0.0013295905,0.0017226328,0.0039007582],"category_scores_gemma":[0.07490436,0.0003090927,0.00038196042,0.023005065,0.0012027015,0.005197981,0.0030017246,0.001251153,0.0009143528],"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.00005195239,0.00007445315,0.98690677,0.000044832508,0.00009056665,0.00009113477,0.0050174417,0.000065770495,0.00007985189,0.000628108,0.00079674233,0.006152413],"study_design_scores_gemma":[0.0000061581413,0.000067476205,0.99161583,0.00007121927,0.0000375326,0.00015245855,0.0036690568,0.00038284386,0.00009926915,0.0010777203,0.0028039375,0.000016425609],"about_ca_topic_score_codex":0.008093202,"about_ca_topic_score_gemma":0.0069195977,"teacher_disagreement_score":0.9894828,"about_ca_system_score_codex":0.0010095567,"about_ca_system_score_gemma":0.0010014242,"threshold_uncertainty_score":0.05722791},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08171406,0.004779241,0.8196817,0.005502512,0.00053324143,0.0015623479,0.013723,0.0075736977,0.06493019],"genre_scores_gemma":[0.32516903,0.0019443519,0.66154766,0.00023471707,0.00020447432,0.0016805561,0.0031621724,0.0011846514,0.004872397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970023,0.0017642967,0.000214864,0.00033512205,0.0005813754,0.00010199739],"domain_scores_gemma":[0.98932487,0.0077647725,0.00094679673,0.0009505309,0.00078967103,0.00022338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005132258,0.0010621167,0.0007447529,0.017890122,0.0021222562,0.008271559,0.0012495428,0.0011585437,0.012593418],"category_scores_gemma":[0.018917939,0.00055883726,0.00072427094,0.016255517,0.0033253676,0.0097212475,0.004328468,0.0014461186,0.0015229848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005888995,0.00011833224,0.0076302635,0.0033676897,0.0002713778,0.00080542074,0.13555083,0.0035851432,0.017111577,0.33066687,0.03671111,0.4635925],"study_design_scores_gemma":[0.00013592395,0.00020402813,0.024905864,0.0025761793,0.00025231644,0.0013049141,0.065141134,0.034594804,0.013023339,0.56123,0.2961943,0.0004372908],"about_ca_topic_score_codex":0.0033477973,"about_ca_topic_score_gemma":0.0025037574,"teacher_disagreement_score":0.017890122,"about_ca_system_score_codex":0.0016382018,"about_ca_system_score_gemma":0.0022542216,"threshold_uncertainty_score":0.04212916},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019855397,0.0032766797,0.3912733,0.0015142328,0.00091012364,0.0011204431,0.073393285,0.36336654,0.14529012],"genre_scores_gemma":[0.26785564,0.0058568837,0.38940805,0.0021659902,0.000779977,0.0018705019,0.17067884,0.049264506,0.11211963],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984149,0.00016097077,0.0001687606,0.00036255296,0.0006880781,0.0002047942],"domain_scores_gemma":[0.9976622,0.00050327415,0.00018778589,0.0010230897,0.00045351277,0.00017023498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010071929,0.0012274149,0.0010086322,0.002115777,0.00085337856,0.0048838295,0.0033072366,0.0010868836,0.06533748],"category_scores_gemma":[0.008409732,0.0009016774,0.0011028659,0.002881151,0.0007650134,0.008098666,0.0047293566,0.001869309,0.05655227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011951936,0.00028005766,0.0060405754,0.0017896687,0.00018827448,0.0007471239,0.00054608413,0.013302819,0.010921571,0.082424834,0.50275266,0.37981117],"study_design_scores_gemma":[0.00020829223,0.00011974866,0.0032204369,0.00021449623,0.00007179546,0.0014902109,0.00015173493,0.089307286,0.021040907,0.06898605,0.8149875,0.00020158417],"about_ca_topic_score_codex":0.002835432,"about_ca_topic_score_gemma":0.002560609,"teacher_disagreement_score":0.06533748,"about_ca_system_score_codex":0.0011249749,"about_ca_system_score_gemma":0.0018130919,"threshold_uncertainty_score":0.21857566},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031429045,0.00047343067,0.9101511,0.000714418,0.00036450403,0.00056497444,0.0045174616,0.015285387,0.036499724],"genre_scores_gemma":[0.3931838,0.0005092329,0.56555223,0.00058210327,0.00024200996,0.0020693243,0.007098885,0.0054065604,0.025355833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969709,0.0012854481,0.0001423504,0.00060158,0.00078987645,0.00020981663],"domain_scores_gemma":[0.97933906,0.013939145,0.00070378365,0.0045592096,0.0010490807,0.00040973548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003393705,0.001062567,0.0008865003,0.0017645101,0.0012159223,0.0035275093,0.0027797602,0.0018790826,0.051165275],"category_scores_gemma":[0.031601667,0.00082047726,0.0019915474,0.001013753,0.0017113229,0.005566701,0.00352091,0.002316241,0.008266468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014332387,0.00053621514,0.0064218272,0.0013046453,0.00026277613,0.000716134,0.0013319742,0.12805182,0.0057996158,0.4736706,0.06508224,0.3153889],"study_design_scores_gemma":[0.00015687363,0.0002818623,0.0012573412,0.00012823338,0.000053803004,0.0006480316,0.00021915509,0.55852884,0.0059150867,0.37240216,0.060322665,0.00008594531],"about_ca_topic_score_codex":0.0015376316,"about_ca_topic_score_gemma":0.0026619204,"teacher_disagreement_score":0.051165275,"about_ca_system_score_codex":0.0008573773,"about_ca_system_score_gemma":0.0012099907,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34065598,0.0019939328,0.5401872,0.041696798,0.00045728474,0.00041336354,0.000097553275,0.00012274433,0.07437517],"genre_scores_gemma":[0.9551707,0.00043553507,0.0426556,0.0002690286,0.000087449815,0.0001551192,0.000017783781,0.000013035148,0.0011958247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9875871,0.009955989,0.00024362231,0.0004332315,0.0011325252,0.0006476151],"domain_scores_gemma":[0.96832097,0.0258998,0.002658092,0.0009300238,0.0011865862,0.001004587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02410281,0.00085183745,0.0010153798,0.0017563602,0.0031714812,0.008799103,0.0018936772,0.004008905,0.0043379124],"category_scores_gemma":[0.049694642,0.00042924404,0.0006400305,0.0018286173,0.005136235,0.013617171,0.006090102,0.004564213,0.00026603235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032569258,0.0002540869,0.003156349,0.00020627568,0.00014088259,0.00029656218,0.0052364985,0.088701494,0.00051965186,0.8309088,0.0021033369,0.06815042],"study_design_scores_gemma":[0.00007521362,0.0000700373,0.0009559439,0.000104791376,0.000030143732,0.0000463253,0.0036754552,0.18532787,0.00028603093,0.8044434,0.0049478807,0.000036922447],"about_ca_topic_score_codex":0.0030318925,"about_ca_topic_score_gemma":0.0033795119,"teacher_disagreement_score":0.02410281,"about_ca_system_score_codex":0.0041448576,"about_ca_system_score_gemma":0.0060999207,"threshold_uncertainty_score":0.12746936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60339105,0.00036044692,0.38677287,0.0006109505,0.000062733634,0.0003768889,0.0007147996,0.002306252,0.005404023],"genre_scores_gemma":[0.8891203,0.000120549455,0.10814572,0.00012855032,0.00004665661,0.00010459723,0.00058632786,0.00007964596,0.0016677468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822575,0.00050453644,0.00012939083,0.00042750925,0.0005322354,0.00018055165],"domain_scores_gemma":[0.996714,0.0011507471,0.00041285818,0.00078714284,0.0007020101,0.0002332702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013319821,0.0007148226,0.0010001084,0.0036432683,0.0015864937,0.0013248363,0.0010231633,0.001246131,0.0013369616],"category_scores_gemma":[0.006553692,0.00038147334,0.0007758526,0.0035362325,0.00044249065,0.0029787829,0.0020492305,0.00075194315,0.000834256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010172889,0.0010736261,0.2491937,0.00037070704,0.00055073807,0.0017336828,0.005035899,0.023431383,0.042007484,0.011544434,0.0045545525,0.65948653],"study_design_scores_gemma":[0.00007117882,0.0006432762,0.091568135,0.000083373605,0.00056334666,0.0035851328,0.005781999,0.7894303,0.047077134,0.040086854,0.020902723,0.00020653752],"about_ca_topic_score_codex":0.0056854677,"about_ca_topic_score_gemma":0.009438184,"teacher_disagreement_score":0.0056854677,"about_ca_system_score_codex":0.00063187064,"about_ca_system_score_gemma":0.0005156108,"threshold_uncertainty_score":0.011304796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40979943,0.005252871,0.54899156,0.0053764475,0.00021953197,0.0000785645,0.00027627833,0.00040631223,0.02959902],"genre_scores_gemma":[0.9784614,0.0016145896,0.015488292,0.0002295796,0.0002220028,0.00009416142,0.0001031714,0.000050612336,0.0037361165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889404,0.0005869095,0.000029356645,0.0001185128,0.00020788518,0.00016323461],"domain_scores_gemma":[0.99406356,0.0041732066,0.00067350845,0.00027115873,0.00033506312,0.00048354347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023082078,0.00083032553,0.0010692232,0.0027292725,0.0011447787,0.0022966145,0.001934307,0.0016787355,0.001291842],"category_scores_gemma":[0.011567011,0.0005621325,0.00096923474,0.0017880014,0.0044541634,0.0037857022,0.0015533069,0.0021547999,0.00023303607],"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.000014025095,0.00002075271,0.00059278036,0.000032957138,0.000017921306,0.0001354525,0.00012140817,0.083847456,0.0002940277,0.9126711,0.0005509198,0.0017011873],"study_design_scores_gemma":[0.000008604623,0.000010111059,0.0002533975,0.000012859693,0.000005032447,0.000057962763,0.000036555437,0.23163061,0.000096791846,0.76747715,0.00039764482,0.000013189093],"about_ca_topic_score_codex":0.0028969406,"about_ca_topic_score_gemma":0.0015991551,"teacher_disagreement_score":0.0028969406,"about_ca_system_score_codex":0.002591985,"about_ca_system_score_gemma":0.0006952288,"threshold_uncertainty_score":0.01880622},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22811872,0.0070267585,0.73727435,0.004719716,0.00021091908,0.0002112885,0.0014607123,0.0015482372,0.019429356],"genre_scores_gemma":[0.9262377,0.0019482909,0.06770313,0.00019154402,0.0004827633,0.0001734289,0.0006931861,0.00010822392,0.0024617312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966983,0.0012375803,0.00016697412,0.0008043153,0.0008928046,0.00020005407],"domain_scores_gemma":[0.9803407,0.013693577,0.0023040774,0.0016939566,0.0010628751,0.000904694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029143572,0.0010969177,0.0014176584,0.0056937085,0.0019453542,0.0028981722,0.0015647835,0.0019660026,0.0031649605],"category_scores_gemma":[0.02043263,0.0008249156,0.0009959342,0.0071186884,0.0026292196,0.0069244257,0.004913692,0.0017981054,0.0006296301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029457087,0.00030624657,0.053240877,0.0004910328,0.00029287802,0.00055852655,0.0024214399,0.32332602,0.0017946943,0.44310805,0.007666368,0.16649917],"study_design_scores_gemma":[0.000014637139,0.000034471253,0.004947704,0.00005150578,0.000030785908,0.00022632653,0.00049661635,0.67482114,0.00046993548,0.31377038,0.005108087,0.000028336055],"about_ca_topic_score_codex":0.007666716,"about_ca_topic_score_gemma":0.0041902848,"teacher_disagreement_score":0.007666716,"about_ca_system_score_codex":0.002069748,"about_ca_system_score_gemma":0.0007385116,"threshold_uncertainty_score":0.015412748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74214405,0.00065965543,0.22051318,0.0013553846,0.00013325088,0.00064057484,0.0038502105,0.0024212906,0.028282374],"genre_scores_gemma":[0.97359306,0.0001314574,0.02167072,0.000106133375,0.00006299221,0.00016231602,0.0019286481,0.00011035841,0.0022343092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9977028,0.0004671589,0.00020124107,0.00033015353,0.0009283187,0.0003703745],"domain_scores_gemma":[0.99154294,0.0026019183,0.0012421496,0.0015358875,0.0022857054,0.00079142256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016664149,0.00071163144,0.0005912515,0.0022811203,0.001774061,0.002650274,0.0011642983,0.0015330528,0.0020648185],"category_scores_gemma":[0.010303198,0.00033123474,0.00065767934,0.001986748,0.0009436062,0.004664919,0.0011283089,0.0011114955,0.000689082],"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.0022941756,0.0015651023,0.18968967,0.00066111935,0.0004505474,0.003417394,0.006050068,0.11641263,0.08617422,0.38703203,0.038864944,0.16738811],"study_design_scores_gemma":[0.00004385762,0.0003429126,0.03108127,0.00005457575,0.00009153632,0.0034554936,0.0014506249,0.86331356,0.021395478,0.03789347,0.04076711,0.00011009349],"about_ca_topic_score_codex":0.01279424,"about_ca_topic_score_gemma":0.00749758,"teacher_disagreement_score":0.01279424,"about_ca_system_score_codex":0.0016956684,"about_ca_system_score_gemma":0.0012439307,"threshold_uncertainty_score":0.0254395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009795579,0.00013073842,0.98675275,0.00057690527,0.000041276533,0.000021998389,0.00010839041,0.0003825446,0.0021898453],"genre_scores_gemma":[0.53024644,0.000689205,0.4633771,0.0004043147,0.00014900613,0.000113275855,0.0007817115,0.00021284116,0.0040262034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959964,0.00013292988,0.000012880523,0.00009487766,0.00013313934,0.000026658767],"domain_scores_gemma":[0.99855417,0.0008136094,0.00017642115,0.00020362322,0.00020323248,0.000048994913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006259961,0.00044440958,0.00041743217,0.0013141813,0.00036817155,0.00071130454,0.0009548108,0.0008279604,0.001349809],"category_scores_gemma":[0.0051934267,0.00028597208,0.00042280907,0.0012058755,0.0005816416,0.0016095028,0.00079074857,0.0011215498,0.0005956003],"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.0000922042,0.00007776362,0.003566091,0.00022966988,0.000093200906,0.00057935755,0.00023728624,0.52259845,0.028925542,0.17830281,0.017995905,0.24730176],"study_design_scores_gemma":[0.0000021105948,0.0000047523677,0.00027561863,0.0000037989655,0.0000023237321,0.00006804321,0.000008557966,0.9764698,0.0010032005,0.02121622,0.00093694654,0.000008519807],"about_ca_topic_score_codex":0.0025798243,"about_ca_topic_score_gemma":0.0032835463,"teacher_disagreement_score":0.0025798243,"about_ca_system_score_codex":0.0008775561,"about_ca_system_score_gemma":0.0005954039,"threshold_uncertainty_score":0.006367147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32993516,0.0015572166,0.65820736,0.0008310991,0.00009252964,0.00020922151,0.0020713108,0.0035683257,0.003527734],"genre_scores_gemma":[0.86943156,0.0005690699,0.124663115,0.00011338463,0.00015749676,0.00013969177,0.0029326316,0.000082301194,0.0019106833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737346,0.0011204367,0.00015954433,0.0005717563,0.0005851544,0.00018953696],"domain_scores_gemma":[0.9902569,0.0065218536,0.001535072,0.00069230323,0.0007100771,0.00028376674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021942235,0.00079626543,0.0009123538,0.005540887,0.0008470781,0.0015574041,0.0014947491,0.0016782536,0.0009594644],"category_scores_gemma":[0.01410649,0.00037767246,0.0006879826,0.004056464,0.00050064595,0.0027129308,0.0013674723,0.00090862816,0.0006466959],"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.0010604206,0.0005968983,0.09564141,0.0005556922,0.0003900156,0.0011721102,0.0008725148,0.43515348,0.009264465,0.01630972,0.015634516,0.4233487],"study_design_scores_gemma":[0.000016020085,0.00004509398,0.0070791203,0.000013872138,0.000033201133,0.00024182587,0.00013078874,0.9763422,0.0030587341,0.010825121,0.0021932821,0.000020849466],"about_ca_topic_score_codex":0.0038266948,"about_ca_topic_score_gemma":0.0032995937,"teacher_disagreement_score":0.005540887,"about_ca_system_score_codex":0.00089640275,"about_ca_system_score_gemma":0.00038045863,"threshold_uncertainty_score":0.011604309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025364012,0.00014112561,0.9900305,0.0003637248,0.00005916642,0.0001872937,0.00017716925,0.0023367181,0.0041678217],"genre_scores_gemma":[0.059816297,0.00036838415,0.93046683,0.0001543628,0.00010092937,0.0005805279,0.0006048715,0.0006675087,0.007240396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798393,0.0006096065,0.0001916358,0.00037193456,0.0006452442,0.00019759606],"domain_scores_gemma":[0.99832946,0.0005331071,0.000067863824,0.0006757621,0.00023848232,0.00015532302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002917235,0.00097325206,0.0011044834,0.0019765743,0.0025704352,0.0045174714,0.0030874088,0.0017971301,0.008138531],"category_scores_gemma":[0.005343466,0.001005097,0.0023390772,0.0024158543,0.0021200115,0.008193167,0.005933569,0.0028109923,0.0032572683],"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.00003747539,0.00009698857,0.0005533723,0.00014083157,0.000059602447,0.00013246933,0.00052067376,0.017755097,0.0019647125,0.86019284,0.011353819,0.10719214],"study_design_scores_gemma":[0.000020700974,0.000038142956,0.00016114765,0.00005233988,0.000060283128,0.000107772554,0.0001521764,0.24873339,0.0021375325,0.67255896,0.07594911,0.000028462999],"about_ca_topic_score_codex":0.004376087,"about_ca_topic_score_gemma":0.007460788,"teacher_disagreement_score":0.008138531,"about_ca_system_score_codex":0.0011417989,"about_ca_system_score_gemma":0.0018157501,"threshold_uncertainty_score":0.02722609},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006329313,0.68852127,0.05755043,0.010883592,0.013699644,0.0022535783,0.0380477,0.0033008268,0.18511009],"genre_scores_gemma":[0.0031713743,0.6830997,0.11080371,0.013987067,0.00634844,0.004920581,0.04018348,0.0018763269,0.13560933],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981041,0.0003603993,0.0004614851,0.00017509953,0.0008162544,0.00008261901],"domain_scores_gemma":[0.99380714,0.0036078242,0.00053687865,0.00032581633,0.0014611116,0.00026118907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018413714,0.0031801066,0.0030853285,0.021054126,0.0013554165,0.0037210584,0.003173428,0.0025857622,0.09949004],"category_scores_gemma":[0.013007701,0.0010606156,0.0015408142,0.027853163,0.0013317246,0.007781354,0.002713843,0.003494288,0.08990156],"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.0000193009,0.00005181855,0.00009482992,0.005403409,0.000027099048,0.0001834013,0.00021143793,0.00036147487,0.0007037346,0.018599952,0.78224146,0.19210213],"study_design_scores_gemma":[0.000004087799,0.000008009966,0.0001990001,0.0019342665,0.000009155287,0.00030154968,0.000050533574,0.000072228155,0.0000557864,0.007862569,0.98948634,0.00001657957],"about_ca_topic_score_codex":0.004236483,"about_ca_topic_score_gemma":0.0074701933,"teacher_disagreement_score":0.09949004,"about_ca_system_score_codex":0.0015478478,"about_ca_system_score_gemma":0.002755385,"threshold_uncertainty_score":0.3328274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8249688,0.0008848381,0.15193273,0.0022001986,0.00020066489,0.00012237934,0.00032749426,0.00023110112,0.019131858],"genre_scores_gemma":[0.98708177,0.0002613136,0.0073902276,0.00018951866,0.00008548069,0.000075962584,0.00010229665,0.00006542185,0.004748083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857175,0.00063589495,0.000033658638,0.00023401545,0.00014493799,0.00037962548],"domain_scores_gemma":[0.98414683,0.0107534425,0.002024373,0.00059998303,0.00070651807,0.001768838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023548198,0.001721622,0.0021485342,0.0016914392,0.0016757868,0.0027036965,0.0039491206,0.004193796,0.0065020174],"category_scores_gemma":[0.016051145,0.0009184539,0.0014187193,0.0015009042,0.0033729332,0.003973325,0.0021290043,0.0030286126,0.0007774171],"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.00057248835,0.0002062175,0.0025572334,0.00018496909,0.00014462257,0.0010293564,0.00029701352,0.6083554,0.0064353677,0.3737016,0.0028122661,0.0037034946],"study_design_scores_gemma":[0.000119740165,0.000102949656,0.0005588489,0.000013283606,0.000031994183,0.00018454046,0.00009699267,0.9174278,0.00045087657,0.08055085,0.00040832927,0.000053829193],"about_ca_topic_score_codex":0.006177508,"about_ca_topic_score_gemma":0.0039774613,"teacher_disagreement_score":0.0065020174,"about_ca_system_score_codex":0.0024637617,"about_ca_system_score_gemma":0.00090258423,"threshold_uncertainty_score":0.021751344},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100435264,0.0008492598,0.89437026,0.0005231457,0.00013328134,0.00007257827,0.0004375682,0.000955754,0.0022229431],"genre_scores_gemma":[0.5581427,0.0023480053,0.4318526,0.00024872334,0.00021121724,0.00014916885,0.0016410451,0.00038791078,0.0050185933],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993662,0.00012499811,0.00004298281,0.00011004796,0.0002925405,0.00006311355],"domain_scores_gemma":[0.9972439,0.0012367577,0.0003119641,0.000668248,0.0004650287,0.00007409154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006797891,0.0009673624,0.0005700687,0.002049971,0.0004747556,0.0008468154,0.0009795653,0.0007021229,0.0014138792],"category_scores_gemma":[0.0071275136,0.00030004655,0.0004651765,0.0028685343,0.0008638626,0.003302667,0.0011198,0.0010607222,0.00045229087],"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.00048400895,0.00008121599,0.00170403,0.00024501866,0.00007623936,0.0005487978,0.00055161974,0.44223163,0.04576153,0.057032138,0.004882524,0.44640124],"study_design_scores_gemma":[0.000010873491,0.000052656265,0.0005981987,0.000019347342,0.000017817692,0.00024021747,0.00012032272,0.94628036,0.012334796,0.03711966,0.003185969,0.000019693443],"about_ca_topic_score_codex":0.0040377327,"about_ca_topic_score_gemma":0.0029441183,"teacher_disagreement_score":0.0040377327,"about_ca_system_score_codex":0.00072585087,"about_ca_system_score_gemma":0.0004873447,"threshold_uncertainty_score":0.008028448},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026219552,0.000043664906,0.97292966,0.000068257534,0.000069530935,0.00021288665,0.0022710757,0.020182079,0.001600939],"genre_scores_gemma":[0.043844752,0.00012070858,0.9441983,0.00008170652,0.00003508347,0.001028681,0.0035419487,0.0036306288,0.0035182536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999313,0.00016624072,0.000057050114,0.00016974715,0.00024197063,0.000052034266],"domain_scores_gemma":[0.9963019,0.0026317774,0.0001268312,0.0004625077,0.00040951226,0.000067432564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017111828,0.0021932109,0.0008748698,0.0025347027,0.0009101758,0.0012891828,0.002192532,0.001149225,0.017627314],"category_scores_gemma":[0.008601752,0.0012355614,0.002758256,0.0012716105,0.00069257966,0.0015158961,0.0014894571,0.0020527802,0.004251471],"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.0008377104,0.00023772106,0.003651613,0.0014023458,0.000602233,0.00053052505,0.0003636402,0.4060873,0.020166783,0.107412875,0.054308176,0.40439907],"study_design_scores_gemma":[0.00017549454,0.00004973222,0.0003169388,0.000043562068,0.000132411,0.00014770556,0.00004445753,0.84260094,0.030678513,0.10159944,0.024148148,0.00006275864],"about_ca_topic_score_codex":0.0042135725,"about_ca_topic_score_gemma":0.008219273,"teacher_disagreement_score":0.017627314,"about_ca_system_score_codex":0.00096656044,"about_ca_system_score_gemma":0.002148934,"threshold_uncertainty_score":0.05896926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8084697,0.0033910037,0.0014301317,0.0040106396,0.00011525503,0.00007365798,0.0005086103,0.00016689354,0.18183412],"genre_scores_gemma":[0.9758061,0.0010221862,0.0007434579,0.00029546788,0.000022736414,0.000037460064,0.00027441687,0.000025992236,0.021772178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9996482,0.000064892556,0.000020008161,0.00006758566,0.00011956088,0.0000797833],"domain_scores_gemma":[0.9997155,0.00004322029,0.000059817394,0.00004109065,0.00005833702,0.00008199487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004084942,0.00021945461,0.00017729201,0.001138501,0.002201645,0.0017973866,0.00023756143,0.00034154,0.0062784827],"category_scores_gemma":[0.0007335693,0.0001502347,0.00014931896,0.00449623,0.0011451844,0.0013045073,0.0012893411,0.00036291793,0.00047119413],"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.0003128774,0.000093918876,0.24584872,0.0013338645,0.00014861245,0.008424123,0.09712756,0.0025176061,0.013681042,0.33130765,0.048991524,0.25021252],"study_design_scores_gemma":[0.000032111264,0.000060736715,0.48572192,0.00029761676,0.00014229956,0.0013912355,0.031613234,0.005232767,0.0030516116,0.022104183,0.45028904,0.00006327206],"about_ca_topic_score_codex":0.0633751,"about_ca_topic_score_gemma":0.0923906,"teacher_disagreement_score":0.0633751,"about_ca_system_score_codex":0.0026063912,"about_ca_system_score_gemma":0.0022798977,"threshold_uncertainty_score":0.12601244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12900601,0.0015486778,0.8420141,0.00459674,0.0004066009,0.00020136988,0.0008477815,0.00047958046,0.020899156],"genre_scores_gemma":[0.92925274,0.001574315,0.035609636,0.0006755033,0.0005823331,0.000290068,0.00039652022,0.00016181912,0.031457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993678,0.00023506439,0.000025392814,0.00016660217,0.00011954888,0.000085669766],"domain_scores_gemma":[0.99655604,0.002299837,0.00037939538,0.00019133715,0.00033450947,0.00023876467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017496545,0.0009080224,0.0017270278,0.0015261706,0.0011583467,0.0021528979,0.002966069,0.0034230798,0.005733453],"category_scores_gemma":[0.0071711596,0.00081999734,0.0011112939,0.0013292802,0.0017209771,0.0058883857,0.001424728,0.0020393722,0.0008673159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001580033,0.00020777859,0.0016274656,0.00020836099,0.00007935387,0.0005304315,0.0003442297,0.34212455,0.0025514625,0.6312318,0.008724874,0.012211768],"study_design_scores_gemma":[0.000012197305,0.000013885963,0.00013078893,0.000006938266,0.000013799599,0.000045563902,0.0000130386,0.94663596,0.00008611313,0.05258772,0.00044264508,0.000011350949],"about_ca_topic_score_codex":0.0053964583,"about_ca_topic_score_gemma":0.004513311,"teacher_disagreement_score":0.005733453,"about_ca_system_score_codex":0.001415035,"about_ca_system_score_gemma":0.0010680672,"threshold_uncertainty_score":0.019180357},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032633856,0.37744805,0.52191687,0.005479785,0.0010394596,0.00066201563,0.005563734,0.0016896619,0.053566534],"genre_scores_gemma":[0.25846234,0.41101393,0.2902401,0.0021233577,0.0036301815,0.00087382016,0.010038357,0.00048510922,0.023132797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960491,0.0012236356,0.0002957501,0.0007271411,0.0015224004,0.00018201582],"domain_scores_gemma":[0.98728186,0.008636032,0.00047496115,0.0015484756,0.0018613188,0.0001972855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041881283,0.0014549881,0.0020125024,0.0072099417,0.0016066626,0.0028992419,0.002380822,0.0023600648,0.009945791],"category_scores_gemma":[0.021371292,0.000986386,0.0016311349,0.017853152,0.0007134169,0.007529165,0.0011823254,0.0015033811,0.0046773343],"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.00014334037,0.0002750924,0.008344991,0.0042415587,0.00027265894,0.00009124068,0.00022188334,0.028070107,0.00093174813,0.02800425,0.039205734,0.8901974],"study_design_scores_gemma":[0.00009244898,0.0005477121,0.013939638,0.0030950971,0.00063945114,0.001490908,0.00072054943,0.43770754,0.0034674022,0.07767429,0.46033332,0.00029160036],"about_ca_topic_score_codex":0.012500542,"about_ca_topic_score_gemma":0.011928019,"teacher_disagreement_score":0.012500542,"about_ca_system_score_codex":0.0018126777,"about_ca_system_score_gemma":0.0013896835,"threshold_uncertainty_score":0.03327197},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8594207,0.0002864574,0.1367279,0.0002786047,0.000012975236,0.00008890538,0.00010487408,0.00008313489,0.0029963574],"genre_scores_gemma":[0.9959131,0.00006658721,0.0038185327,0.000015293823,0.0000096819585,0.0000224185,0.000045526347,0.0000031445009,0.00010568206],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766266,0.0013629597,0.00012491943,0.0004337996,0.00027096138,0.0001447573],"domain_scores_gemma":[0.97250867,0.021758404,0.0027052192,0.0021001967,0.000492563,0.00043486097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051170513,0.00028446017,0.0005144694,0.002636838,0.0006168443,0.0014479437,0.00061764463,0.0009047286,0.0010543439],"category_scores_gemma":[0.043038823,0.00035322504,0.0006517504,0.0013452204,0.0015872908,0.0031020758,0.0013464802,0.00069310225,0.00011843271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003360019,0.0003395436,0.5747691,0.0003444236,0.000999869,0.0005434105,0.004598268,0.12384322,0.0051868884,0.17053172,0.00075197825,0.117755584],"study_design_scores_gemma":[0.000037096048,0.00017793117,0.19737065,0.00006344597,0.00022045718,0.00044599202,0.0010129567,0.6629631,0.0019211638,0.13404562,0.0016711596,0.00007049764],"about_ca_topic_score_codex":0.0033122685,"about_ca_topic_score_gemma":0.0034789662,"teacher_disagreement_score":0.0051170513,"about_ca_system_score_codex":0.00067785993,"about_ca_system_score_gemma":0.00038217858,"threshold_uncertainty_score":0.02706182},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20528483,0.00029155833,0.7121561,0.00058860186,0.0003451544,0.0014169066,0.027791375,0.042197067,0.009928424],"genre_scores_gemma":[0.6046031,0.00023313424,0.3457045,0.00020006059,0.0000554332,0.0010931947,0.044007838,0.0018613734,0.002241393],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.995297,0.00086453307,0.0006343236,0.00065250474,0.00228714,0.00026448013],"domain_scores_gemma":[0.97651356,0.004544116,0.00226768,0.0076854345,0.008555564,0.00043375354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005655222,0.0008187193,0.0006454481,0.0050682942,0.0008130985,0.002335037,0.0015202514,0.0007900511,0.002322874],"category_scores_gemma":[0.021014418,0.00030694285,0.00063131924,0.0018084095,0.0007905143,0.002444475,0.0020288096,0.001156598,0.0009924496],"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.0019073171,0.0009886234,0.07933271,0.0021483607,0.0005551369,0.0015882904,0.0024916846,0.09656313,0.15603328,0.03683595,0.059564233,0.5619912],"study_design_scores_gemma":[0.0001788011,0.0005261876,0.04378568,0.00035871958,0.000088587185,0.0012548332,0.001204166,0.66428906,0.20338377,0.017621964,0.06706778,0.00024054397],"about_ca_topic_score_codex":0.0037879755,"about_ca_topic_score_gemma":0.0035490086,"teacher_disagreement_score":0.005655222,"about_ca_system_score_codex":0.0009825414,"about_ca_system_score_gemma":0.0017834711,"threshold_uncertainty_score":0.029908061},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9632337,0.00024736172,0.032789752,0.00027069327,0.0000077208115,0.000034165212,0.00006880821,0.000056859997,0.0032909126],"genre_scores_gemma":[0.99679,0.000059269427,0.002872221,0.000008002723,0.0000060296406,0.000021065876,0.000034738252,0.000008085421,0.00020052902],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99807644,0.00086326763,0.000112735455,0.000371245,0.00031337573,0.00026279513],"domain_scores_gemma":[0.96239144,0.02370036,0.008766008,0.0018198848,0.0020872944,0.0012349896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036275818,0.00040406449,0.00039248806,0.0025650884,0.000951207,0.0025712557,0.00065565447,0.001144355,0.0017766791],"category_scores_gemma":[0.03552518,0.0004775654,0.0004370502,0.0011596058,0.0017432567,0.00500864,0.0015005984,0.00055653584,0.0004011872],"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.0006881972,0.0004190013,0.37330583,0.00049387745,0.00065879,0.0004997687,0.00600477,0.31955025,0.030205194,0.17143023,0.0020333654,0.09471072],"study_design_scores_gemma":[0.00012281511,0.0002710784,0.21776894,0.00012410697,0.00017470104,0.0005281626,0.0031792964,0.6025072,0.008878048,0.16389012,0.0024525758,0.00010295385],"about_ca_topic_score_codex":0.0010758163,"about_ca_topic_score_gemma":0.0008640828,"teacher_disagreement_score":0.0036275818,"about_ca_system_score_codex":0.0011249481,"about_ca_system_score_gemma":0.00058225286,"threshold_uncertainty_score":0.019184709},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015116888,0.0003030519,0.97990006,0.00019859642,0.00008834061,0.00015009556,0.00009582856,0.00093375007,0.0032133956],"genre_scores_gemma":[0.17941153,0.00020100709,0.8168587,0.00021353042,0.00010550651,0.00032066114,0.00026541186,0.00033184708,0.002291709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998061,0.00081568223,0.00008491995,0.0004263358,0.000349168,0.00026276798],"domain_scores_gemma":[0.98644835,0.010866019,0.0004711739,0.0010531525,0.00086684467,0.00029439764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034128292,0.0022013087,0.002729849,0.0025762806,0.001298094,0.0018137047,0.0035151162,0.0023480789,0.008078421],"category_scores_gemma":[0.019720359,0.0015043627,0.0015336155,0.0028528436,0.0016940638,0.0037355071,0.0023693363,0.0024556888,0.0014831468],"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.0002524123,0.000255357,0.00066945946,0.000215058,0.00009135032,0.00007177591,0.00012467582,0.82899135,0.0015835583,0.024856672,0.005024024,0.13786438],"study_design_scores_gemma":[0.00005156466,0.00002226247,0.000072387644,0.000008623132,0.000014953486,0.000015278782,0.0000124193475,0.98252124,0.00026247976,0.016727611,0.0002849346,0.000006227343],"about_ca_topic_score_codex":0.0087239025,"about_ca_topic_score_gemma":0.011886768,"teacher_disagreement_score":0.0087239025,"about_ca_system_score_codex":0.0024521449,"about_ca_system_score_gemma":0.0033491692,"threshold_uncertainty_score":0.027025044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3710277,0.0013602279,0.5617026,0.0043485677,0.00021238608,0.00022787438,0.0016227792,0.00043932357,0.059058484],"genre_scores_gemma":[0.9458101,0.0017113066,0.03466329,0.0006065928,0.00031566588,0.00028518226,0.0010991611,0.00020565704,0.015303094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989435,0.00036225957,0.000044144752,0.00024302918,0.0002649319,0.00014204186],"domain_scores_gemma":[0.9926422,0.0034425494,0.0013637724,0.0008382977,0.00097603846,0.0007371594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017771621,0.00084432133,0.0012479031,0.0027722165,0.0016209293,0.002868881,0.0029076347,0.0022040315,0.012004913],"category_scores_gemma":[0.0112599665,0.0007872157,0.0010023668,0.0025117167,0.0022998115,0.0076185595,0.0020655938,0.0023987212,0.0013278193],"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.000031743253,0.000032452048,0.0006425508,0.000054617652,0.000020444113,0.00007603802,0.00015755506,0.022868633,0.0004933633,0.96855664,0.0023370055,0.004728985],"study_design_scores_gemma":[0.000016101774,0.000017739574,0.0004035649,0.000015131397,0.000017489916,0.00011183138,0.00008641683,0.118575364,0.0001507907,0.8788703,0.0017182968,0.00001703623],"about_ca_topic_score_codex":0.0040840628,"about_ca_topic_score_gemma":0.0038263137,"teacher_disagreement_score":0.012004913,"about_ca_system_score_codex":0.0018794655,"about_ca_system_score_gemma":0.0011852566,"threshold_uncertainty_score":0.040160418},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6752241,0.00087810156,0.31429964,0.0016936902,0.000042061292,0.00014061111,0.00042028434,0.00015943951,0.0071419524],"genre_scores_gemma":[0.99018747,0.00062183634,0.0076390663,0.000070431684,0.000046915735,0.00004917683,0.000117941534,0.000017914293,0.0012493867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9994617,0.0002301219,0.000020061188,0.00010944617,0.000083237726,0.00009543771],"domain_scores_gemma":[0.99658406,0.00219479,0.0006166513,0.00019585618,0.000263159,0.00014545694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012638452,0.0005695685,0.00042946957,0.0016450244,0.00078847853,0.001533617,0.0009920766,0.001444641,0.0009492135],"category_scores_gemma":[0.008329242,0.000572724,0.00043846338,0.0009482494,0.0009653911,0.0041206875,0.001008663,0.0009818489,0.0002359101],"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.0001397929,0.0002268085,0.03753147,0.00013202461,0.00010940789,0.0005420437,0.0018410364,0.78466773,0.006615322,0.13317089,0.0023229541,0.032700527],"study_design_scores_gemma":[0.0000048735865,0.000014584448,0.0031932148,0.000009081019,0.00001006839,0.00006508739,0.00022342739,0.96983933,0.00024703814,0.025734179,0.0006466541,0.000012593472],"about_ca_topic_score_codex":0.017973514,"about_ca_topic_score_gemma":0.009055875,"teacher_disagreement_score":0.017973514,"about_ca_system_score_codex":0.0014853581,"about_ca_system_score_gemma":0.00049437676,"threshold_uncertainty_score":0.035737813},"labels":[],"label_agreement":null},{"id":"W2153120494","doi":"10.1093/comnet/cnu010","title":"Network robustness versus multi-strategy sequential attack","year":2014,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); Betweenness centrality; Computer science; Greedy algorithm; Centrality; Pairwise comparison; Artificial intelligence; Mathematics; Algorithm; Statistics","score_opus":0.07814062192789892,"score_gpt":0.32945073441080697,"score_spread":0.251310112482908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153120494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81053144,0.00075003685,0.17848857,0.00066240854,0.000059927945,0.00018264943,0.00026637295,0.0003007157,0.00875793],"genre_scores_gemma":[0.99204355,0.00012197944,0.00721688,0.000032954948,0.000013356119,0.000041591236,0.00007460522,0.000016360014,0.00043872328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837613,0.00061854307,0.000078525314,0.0003088446,0.0003501484,0.00026772713],"domain_scores_gemma":[0.9799643,0.013612873,0.0030479685,0.0019355599,0.0009364184,0.0005028179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002725392,0.00083445356,0.0006347985,0.0017912332,0.0004353686,0.00098721,0.0008684844,0.0007603329,0.0014660507],"category_scores_gemma":[0.019407757,0.0001865558,0.00058609294,0.00076564273,0.0013465098,0.0029955064,0.0010938096,0.0009069212,0.00017664877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040295118,0.00018529363,0.011944725,0.00013307513,0.000268202,0.00021969587,0.00011542068,0.92818713,0.008796253,0.0233805,0.0005603738,0.025806453],"study_design_scores_gemma":[0.000019153988,0.0004930693,0.004297571,0.000020892028,0.000066870176,0.00018693939,0.000103910104,0.97084785,0.004597829,0.018871227,0.00046805438,0.000026630287],"about_ca_topic_score_codex":0.001214291,"about_ca_topic_score_gemma":0.0010704579,"teacher_disagreement_score":0.002725392,"about_ca_system_score_codex":0.0010542023,"about_ca_system_score_gemma":0.0005370851,"threshold_uncertainty_score":0.014413416},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072949946,0.0019476318,0.89209497,0.0027583991,0.00005025557,0.00017607355,0.0016111871,0.0003023613,0.028109225],"genre_scores_gemma":[0.68945754,0.004503356,0.29120114,0.0002610224,0.00023268888,0.00033925555,0.002190832,0.000096066084,0.0117180655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995832,0.00017231003,0.000014635168,0.00008981138,0.00010685075,0.000033118027],"domain_scores_gemma":[0.99818665,0.001088956,0.00022179572,0.0001363987,0.00027555556,0.00009064458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083123863,0.00038219843,0.00031983963,0.0029609012,0.0007345428,0.0019359066,0.00060193805,0.00057261507,0.0038661095],"category_scores_gemma":[0.0044393716,0.00026625211,0.0005089102,0.003003973,0.0010186994,0.0030340971,0.00063514645,0.00071751466,0.0003195967],"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.000021575568,0.0000457242,0.0041971835,0.0001414324,0.00006673045,0.00013288221,0.00037311803,0.21188468,0.0006817556,0.72350866,0.0056326594,0.053313654],"study_design_scores_gemma":[0.00000768368,0.000022705324,0.0038744658,0.00006643596,0.00004486147,0.00014375577,0.00029404293,0.58593374,0.00031155208,0.38772774,0.021557013,0.000016056372],"about_ca_topic_score_codex":0.01640291,"about_ca_topic_score_gemma":0.011933184,"teacher_disagreement_score":0.01640291,"about_ca_system_score_codex":0.0018750482,"about_ca_system_score_gemma":0.0010449651,"threshold_uncertainty_score":0.032614827},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30360788,0.0013623018,0.6828317,0.001540333,0.00007667894,0.00014114784,0.00019081647,0.00028796165,0.009961126],"genre_scores_gemma":[0.93784887,0.0015751956,0.057784628,0.00020279585,0.00008115459,0.0001463626,0.00010360249,0.00003707493,0.0022204062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900997,0.00053248135,0.000032823766,0.00020506952,0.00016182839,0.00005768491],"domain_scores_gemma":[0.99590236,0.0023973263,0.0008335422,0.00042544355,0.00032977844,0.00011153043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014267395,0.00042650374,0.00062467955,0.0017058849,0.0006468367,0.0014333328,0.001071594,0.0010564438,0.0017527022],"category_scores_gemma":[0.011778386,0.0004638826,0.0006985741,0.0009846813,0.0013030197,0.0025199337,0.0011736227,0.00081328134,0.00027249966],"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.00007378438,0.000089457404,0.01567618,0.00024655677,0.00025616036,0.00029987303,0.00060636766,0.638756,0.00365482,0.30297786,0.0014542828,0.03590863],"study_design_scores_gemma":[0.00003490178,0.000063709216,0.005979961,0.00006126341,0.000055195127,0.00018111648,0.00021818107,0.7217625,0.00081582443,0.26882455,0.0019659926,0.00003685691],"about_ca_topic_score_codex":0.0036389057,"about_ca_topic_score_gemma":0.0021334875,"teacher_disagreement_score":0.0036389057,"about_ca_system_score_codex":0.001189195,"about_ca_system_score_gemma":0.0008323673,"threshold_uncertainty_score":0.008628309},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3335258,0.0022499843,0.6131042,0.0017107243,0.00042123746,0.0010809837,0.034462437,0.0048972564,0.00854731],"genre_scores_gemma":[0.7261816,0.001654087,0.23850024,0.00019761226,0.00023034617,0.00066154863,0.031090606,0.000111071386,0.0013729914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984322,0.00023868594,0.00023821271,0.0004146447,0.00058290677,0.00009337009],"domain_scores_gemma":[0.9950447,0.0023149846,0.00064483343,0.0007699051,0.0011007382,0.0001247637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014575301,0.001198238,0.0012302605,0.008402022,0.000683617,0.0018360163,0.0013889108,0.0010135405,0.0008938578],"category_scores_gemma":[0.010511476,0.00031854786,0.0008120265,0.005524125,0.00036577217,0.0022131684,0.00073773746,0.0011030046,0.00075703755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042369287,0.0009978856,0.12889092,0.0012980589,0.0004999857,0.001012631,0.00049859466,0.15985942,0.015922474,0.013900193,0.012167858,0.6645283],"study_design_scores_gemma":[0.000037940514,0.00021508565,0.026338512,0.00023569253,0.00016209864,0.0008442453,0.0006266113,0.897211,0.017018644,0.037526585,0.019690948,0.00009253524],"about_ca_topic_score_codex":0.002944044,"about_ca_topic_score_gemma":0.0029476562,"teacher_disagreement_score":0.008402022,"about_ca_system_score_codex":0.000804335,"about_ca_system_score_gemma":0.000958974,"threshold_uncertainty_score":0.0077082515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54001796,0.0085264165,0.40670246,0.0009915697,0.00057215674,0.00082834205,0.003379887,0.001288304,0.037692845],"genre_scores_gemma":[0.91639346,0.002301218,0.06732877,0.0001834146,0.00044717678,0.00034688768,0.0014949911,0.00008376186,0.011420481],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992835,0.00016346684,0.000043847343,0.0002135255,0.00019728266,0.00009839803],"domain_scores_gemma":[0.99714905,0.0015541665,0.00036145194,0.00027981578,0.0005408368,0.0001146099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080053275,0.0010174584,0.0006978136,0.0043196604,0.000819868,0.0014135197,0.0006289872,0.0011540694,0.0029033248],"category_scores_gemma":[0.0047638617,0.00036600375,0.00052261475,0.0037441184,0.0005608425,0.0027334848,0.0013412904,0.000788533,0.0016536319],"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.0008391678,0.00044249935,0.09437234,0.0016126217,0.00027927256,0.0013465782,0.0037744136,0.005572275,0.07008881,0.015119264,0.011082843,0.79547],"study_design_scores_gemma":[0.000058120404,0.00078398676,0.4727798,0.00047861258,0.0005460873,0.0043553202,0.004350266,0.34001428,0.07248274,0.036495544,0.067415826,0.00023940775],"about_ca_topic_score_codex":0.0024392526,"about_ca_topic_score_gemma":0.0039149,"teacher_disagreement_score":0.0043196604,"about_ca_system_score_codex":0.00055253477,"about_ca_system_score_gemma":0.0002624792,"threshold_uncertainty_score":0.009712577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80362254,0.00038657433,0.19284382,0.00037442532,0.000045773395,0.000117910546,0.00047068822,0.0004578269,0.0016804199],"genre_scores_gemma":[0.9878753,0.00006269575,0.01126561,0.000020816618,0.000040253595,0.00003350278,0.00034436455,0.0000088830275,0.00034863673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903774,0.00040228953,0.000062890664,0.00024572466,0.0001466005,0.00010481852],"domain_scores_gemma":[0.99189293,0.0056606103,0.001140259,0.00049318036,0.00050759676,0.00030543996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013489568,0.0006756622,0.0007768758,0.0021214918,0.00056278287,0.00073224446,0.0008557107,0.00097486965,0.0007488938],"category_scores_gemma":[0.0067946287,0.00029321876,0.00049457164,0.0009032776,0.0004907624,0.001410986,0.0006047163,0.00073807576,0.00041690603],"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.0005318481,0.0008782619,0.15497662,0.00019562576,0.00029075827,0.0004876688,0.00056453404,0.66187084,0.0024020022,0.0029410208,0.003563065,0.17129777],"study_design_scores_gemma":[0.000003670086,0.000020980888,0.0035602767,0.0000038273547,0.000005422784,0.000026214308,0.000040594736,0.9942826,0.00023557803,0.0017204318,0.0000969941,0.000003347284],"about_ca_topic_score_codex":0.0032113835,"about_ca_topic_score_gemma":0.003747702,"teacher_disagreement_score":0.0032113835,"about_ca_system_score_codex":0.0005253432,"about_ca_system_score_gemma":0.0003140401,"threshold_uncertainty_score":0.00713408},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06990179,0.00040396152,0.92352504,0.00043985457,0.000024461897,0.000101261576,0.00010326281,0.00017898115,0.005321383],"genre_scores_gemma":[0.8782809,0.0007789738,0.11681726,0.00011448867,0.00008904219,0.00020638072,0.00014737104,0.000082882856,0.0034827944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988518,0.00039293466,0.00003902646,0.00027900864,0.000254477,0.00018273543],"domain_scores_gemma":[0.99504423,0.0037823517,0.0004976459,0.0001501058,0.0002709297,0.00025480922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002025636,0.0011322787,0.001237921,0.0012556051,0.00087150274,0.0015694847,0.0015873241,0.0012771756,0.001661057],"category_scores_gemma":[0.007894456,0.00073569483,0.00091914105,0.0015917623,0.0015901914,0.0024719974,0.0012893436,0.0011861642,0.00022773173],"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.00009513034,0.000051081315,0.0007943704,0.00010671948,0.000050023136,0.00018572633,0.00015960273,0.9180436,0.0026285194,0.06348558,0.00079389673,0.013605742],"study_design_scores_gemma":[0.000016673002,0.000023336444,0.00016043181,0.0000055079236,0.000014741683,0.000033119388,0.000028350807,0.96633774,0.0009369227,0.031836163,0.00059995113,0.000007104966],"about_ca_topic_score_codex":0.0050337533,"about_ca_topic_score_gemma":0.004327615,"teacher_disagreement_score":0.0050337533,"about_ca_system_score_codex":0.0022455938,"about_ca_system_score_gemma":0.0013606683,"threshold_uncertainty_score":0.01629299},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22193697,0.002966243,0.72265077,0.004810968,0.00024887963,0.000099606776,0.00044625168,0.00024188399,0.046598427],"genre_scores_gemma":[0.96616894,0.0018850672,0.017579988,0.00019529826,0.00020312937,0.00012826013,0.0002307562,0.00007568314,0.013532908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994593,0.00022216451,0.000016592978,0.000093000315,0.00011476506,0.00009425222],"domain_scores_gemma":[0.9976903,0.0014924255,0.0002331787,0.00008902969,0.00024268262,0.00025235678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011457681,0.0006329149,0.0006056628,0.0011704504,0.00064541574,0.0015294425,0.00071840285,0.0010268904,0.004885037],"category_scores_gemma":[0.0060712113,0.00022636722,0.00042349278,0.0008098755,0.0017420897,0.0026436688,0.0010215319,0.00095807586,0.0004139961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006963929,0.000016165073,0.0006892364,0.00012527447,0.00004337693,0.00011381074,0.00015445113,0.18921034,0.0020741497,0.7863311,0.0028383173,0.018334126],"study_design_scores_gemma":[0.0000139599615,0.00004003162,0.00054238585,0.000033557582,0.000015145839,0.000107646134,0.00010290628,0.4468149,0.00071354245,0.5473178,0.0042786305,0.000019480312],"about_ca_topic_score_codex":0.0011734337,"about_ca_topic_score_gemma":0.00042967597,"teacher_disagreement_score":0.004885037,"about_ca_system_score_codex":0.0014926029,"about_ca_system_score_gemma":0.00061577756,"threshold_uncertainty_score":0.016342103},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5732549,0.0061042737,0.4067164,0.0013688457,0.000103108934,0.00011663834,0.0002661061,0.00037980074,0.011690004],"genre_scores_gemma":[0.9909915,0.0012223684,0.0066956505,0.00004471551,0.000037115915,0.000039183004,0.00006565637,0.000023395569,0.00088048517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953854,0.0001716915,0.000017524224,0.00011243375,0.000106372,0.000053454816],"domain_scores_gemma":[0.99772054,0.0012077998,0.00047373414,0.00022450056,0.00021590029,0.0001575916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964445,0.0005489878,0.00044695634,0.0013529507,0.00071079464,0.0011391453,0.0007914071,0.0007142369,0.0011806935],"category_scores_gemma":[0.0039476654,0.0002744026,0.00041884938,0.0013859998,0.0014539515,0.002521604,0.0010102335,0.0007459636,0.00012857716],"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.00013554758,0.00007600645,0.018145418,0.0003293588,0.00013606486,0.0008781217,0.00068183057,0.8350671,0.0072677108,0.108134046,0.0023876566,0.026761064],"study_design_scores_gemma":[0.000012395743,0.00010910247,0.01029319,0.000048080252,0.000076089935,0.00059733324,0.00045362202,0.87886477,0.0018526075,0.10421076,0.003432034,0.000049965423],"about_ca_topic_score_codex":0.0035796273,"about_ca_topic_score_gemma":0.002739166,"teacher_disagreement_score":0.0035796273,"about_ca_system_score_codex":0.001010983,"about_ca_system_score_gemma":0.000446219,"threshold_uncertainty_score":0.0073352456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059949015,0.00043268196,0.99045825,0.00019305905,0.000111871654,0.00010985308,0.00013058432,0.00067942595,0.0018893842],"genre_scores_gemma":[0.09072092,0.0006725778,0.90137327,0.00020211501,0.0001274986,0.00034956695,0.0007835038,0.00024626043,0.0055242977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990682,0.00013658062,0.000050730832,0.00029750413,0.00038505564,0.000061914274],"domain_scores_gemma":[0.99925166,0.00014758066,0.00008725365,0.00007447075,0.00039529492,0.00004376753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008826921,0.0010139381,0.0013063456,0.0024660397,0.0014868489,0.0014121816,0.0019800202,0.001283904,0.0019888964],"category_scores_gemma":[0.0022629662,0.00043652847,0.0009202417,0.0030643125,0.00073698384,0.0022689267,0.0011854565,0.001002586,0.0012712084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022149518,0.00014486954,0.003270516,0.0003048572,0.00029220193,0.00020428476,0.00040572515,0.24553901,0.017884843,0.04474666,0.020320125,0.6666654],"study_design_scores_gemma":[0.000044528115,0.00004800548,0.00085518614,0.00002474709,0.000045708006,0.0002783679,0.00006671458,0.9620938,0.00555315,0.015042773,0.015898272,0.000048895803],"about_ca_topic_score_codex":0.006882751,"about_ca_topic_score_gemma":0.00681287,"teacher_disagreement_score":0.006882751,"about_ca_system_score_codex":0.0012321157,"about_ca_system_score_gemma":0.0018155808,"threshold_uncertainty_score":0.013685405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9931109,0.00010697753,0.0036206655,0.0005012366,0.000003925758,0.000032663473,0.00007009398,0.000015044117,0.0025385874],"genre_scores_gemma":[0.99910957,0.000031964257,0.00064928527,0.000010981491,0.0000025293175,0.000010396839,0.00003624879,0.000002016065,0.00014696717],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9975547,0.0016462947,0.00008259645,0.0003115772,0.00020999178,0.00019474032],"domain_scores_gemma":[0.9601651,0.031253368,0.004889034,0.0011440335,0.0015762735,0.00097220036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003323873,0.00015209203,0.00033372614,0.0016775237,0.0016231778,0.0017982082,0.000657258,0.0008965275,0.0017053856],"category_scores_gemma":[0.028663093,0.0002641764,0.00030135066,0.00093963544,0.0026810674,0.0019342639,0.0017316879,0.00043415927,0.00010396876],"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.0017028677,0.00069254986,0.64384085,0.000517863,0.00046916478,0.0034845907,0.08125438,0.05147734,0.023751952,0.095509194,0.0027791304,0.09452016],"study_design_scores_gemma":[0.00016443821,0.00045042732,0.6050159,0.00016271957,0.00025115523,0.0011672293,0.0517262,0.25601318,0.003810721,0.07099351,0.010092779,0.00015177319],"about_ca_topic_score_codex":0.009389968,"about_ca_topic_score_gemma":0.006706016,"teacher_disagreement_score":0.009389968,"about_ca_system_score_codex":0.0016739347,"about_ca_system_score_gemma":0.0009278817,"threshold_uncertainty_score":0.018670619},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9893912,0.00011043297,0.0043758894,0.0001675866,0.00001086637,0.00004998883,0.002392432,0.00005088734,0.0034507],"genre_scores_gemma":[0.99453545,0.00004893726,0.002120873,0.000009341381,0.000008710737,0.000028027445,0.0022529894,0.0000100602965,0.0009856765],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99912053,0.00037528717,0.000039046492,0.00016838408,0.00020234531,0.00009439872],"domain_scores_gemma":[0.98966473,0.006916372,0.0010008988,0.0008866428,0.0010586097,0.0004727855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011993723,0.00021383942,0.00026272557,0.002078629,0.0007806702,0.0009464343,0.0008495135,0.000528038,0.004828759],"category_scores_gemma":[0.01543652,0.00017809206,0.0002968784,0.0034483825,0.00061334705,0.0021272942,0.00066768535,0.0005549653,0.0012533517],"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.0012354777,0.0006734064,0.75252104,0.00046894123,0.0003107198,0.0016453859,0.0045825364,0.07699247,0.0064129927,0.041506793,0.015139583,0.09851065],"study_design_scores_gemma":[0.00007293123,0.0004492814,0.42041397,0.000097710305,0.00020420409,0.001240773,0.005894161,0.5269523,0.0033876735,0.023927232,0.017274024,0.00008579274],"about_ca_topic_score_codex":0.011949044,"about_ca_topic_score_gemma":0.011844997,"teacher_disagreement_score":0.011949044,"about_ca_system_score_codex":0.00083201367,"about_ca_system_score_gemma":0.00046990928,"threshold_uncertainty_score":0.023758948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017425504,0.00054992916,0.9797385,0.00014587452,0.000033513053,0.000029778943,0.000075668315,0.00024020707,0.00176104],"genre_scores_gemma":[0.5888089,0.0017426613,0.3998492,0.000114538736,0.00019221677,0.00016465508,0.0007993809,0.00025186568,0.008076595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921215,0.00034685052,0.000029500838,0.0001343656,0.00020613977,0.00007084704],"domain_scores_gemma":[0.99808276,0.0010681498,0.00013976745,0.00025446856,0.00035636962,0.00009846546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011671586,0.0006736337,0.0012331124,0.0013847491,0.0008184856,0.0011576522,0.001826927,0.0009964677,0.0012669675],"category_scores_gemma":[0.0042851144,0.000608469,0.0008596306,0.0022206584,0.0009743465,0.002162505,0.0021213081,0.0010234544,0.00050404685],"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.00011462769,0.000056142853,0.0008421309,0.00011073201,0.00007671075,0.000051646595,0.00017555497,0.8403171,0.002421664,0.044205494,0.00364671,0.107981496],"study_design_scores_gemma":[0.0000021134313,0.000007824526,0.00016041778,0.0000035665528,0.000003728498,0.000016360318,0.000018519195,0.98398685,0.00026880507,0.015144775,0.00038078005,0.000006263407],"about_ca_topic_score_codex":0.005528987,"about_ca_topic_score_gemma":0.005213724,"teacher_disagreement_score":0.005528987,"about_ca_system_score_codex":0.0011152363,"about_ca_system_score_gemma":0.00061541,"threshold_uncertainty_score":0.0109936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.998701,0.000048242917,0.0002693657,0.0000337596,0.0000014318298,0.0000035276746,0.000051431267,0.0000036837805,0.0008875114],"genre_scores_gemma":[0.9996093,0.000023751832,0.000081133054,0.0000029384232,0.0000012926307,0.000002759209,0.00003253579,0.0000011025236,0.0002452274],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996749,0.00008991441,0.000013231008,0.00006892157,0.000063786654,0.00008932247],"domain_scores_gemma":[0.99697816,0.0011884391,0.0007421099,0.00021308512,0.00044359345,0.00043472473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063817913,0.00015315748,0.00021291578,0.0017498103,0.001091388,0.0007828425,0.00033921932,0.00029401068,0.0014258125],"category_scores_gemma":[0.0039546126,0.00013270263,0.00020533595,0.0020460375,0.0005616262,0.0009430656,0.0007495168,0.00024913132,0.00012377025],"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.00016446078,0.000081941565,0.93631196,0.00005346097,0.00009651136,0.0006235537,0.0078853145,0.007050297,0.0057885754,0.0054590995,0.0007001802,0.035784625],"study_design_scores_gemma":[0.0000056229305,0.000047870173,0.969564,0.000006931774,0.00004068078,0.00014979196,0.001758844,0.02552644,0.0007785179,0.0011055499,0.000998085,0.000017701512],"about_ca_topic_score_codex":0.025366701,"about_ca_topic_score_gemma":0.028106755,"teacher_disagreement_score":0.025366701,"about_ca_system_score_codex":0.0012938707,"about_ca_system_score_gemma":0.0004695972,"threshold_uncertainty_score":0.050438106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12535368,0.0007182945,0.8638562,0.001033544,0.000068493224,0.000072031406,0.00012524817,0.0002548166,0.008517693],"genre_scores_gemma":[0.96762824,0.000811264,0.028294774,0.00010056761,0.0000531874,0.000101336256,0.000058687594,0.000049680562,0.0029023401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996655,0.00015256688,0.000013594001,0.000055321445,0.00006585052,0.00004719212],"domain_scores_gemma":[0.9988714,0.00074752345,0.00017832925,0.00006219297,0.000076304554,0.00006412437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005445026,0.00062652014,0.00049028103,0.00091039774,0.00057644,0.0009625046,0.0010298318,0.001136333,0.0012823843],"category_scores_gemma":[0.0023917286,0.00038262515,0.0006576242,0.00075441104,0.0012358968,0.0020693177,0.0008989011,0.0009529804,0.00015753867],"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.000011256636,0.000015217728,0.00074448605,0.000018328114,0.000016605163,0.00009499667,0.000051149746,0.96278775,0.0005438051,0.033905845,0.0002692295,0.001541269],"study_design_scores_gemma":[0.0000028773293,0.000005360043,0.0001471467,0.0000024740746,0.0000037309592,0.000013697352,0.0000141968985,0.9814105,0.000054018532,0.01813951,0.00020267762,0.000003811762],"about_ca_topic_score_codex":0.0075103324,"about_ca_topic_score_gemma":0.0049214405,"teacher_disagreement_score":0.0075103324,"about_ca_system_score_codex":0.0011542415,"about_ca_system_score_gemma":0.0006107064,"threshold_uncertainty_score":0.0149332285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74239403,0.00025256045,0.25368777,0.00029330608,0.000020644611,0.00009319026,0.00010896582,0.000100500874,0.003048989],"genre_scores_gemma":[0.98548687,0.00012780026,0.013528351,0.000016752017,0.00002237505,0.000044112792,0.00006037848,0.000012034365,0.00070145476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998102,0.0012079262,0.00005643337,0.00028599164,0.0002392555,0.00010845457],"domain_scores_gemma":[0.9843725,0.0123741785,0.0015878247,0.0007843196,0.00059612485,0.00028503456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003153813,0.0006872257,0.0005778031,0.0012927367,0.00042210086,0.0009258166,0.00091618096,0.0010748493,0.00069873995],"category_scores_gemma":[0.01918746,0.0004379466,0.00067595363,0.00096579414,0.00084136025,0.0022603085,0.0007067793,0.0006014741,0.00021026586],"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.00022197564,0.00018391619,0.04501471,0.00007312081,0.00018899345,0.00024011705,0.0005025964,0.9140496,0.0023951202,0.017176751,0.00032039505,0.019632686],"study_design_scores_gemma":[0.0000046034697,0.000029654555,0.0025405898,0.000002648716,0.000015041488,0.000019384346,0.000023562225,0.9947685,0.00019080262,0.002304328,0.000095594434,0.0000052821742],"about_ca_topic_score_codex":0.009055025,"about_ca_topic_score_gemma":0.00954651,"teacher_disagreement_score":0.009055025,"about_ca_system_score_codex":0.00091307337,"about_ca_system_score_gemma":0.00037489584,"threshold_uncertainty_score":0.018004596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29223,0.004771387,0.6682468,0.006831317,0.00026389043,0.00007713545,0.00033139103,0.00049287075,0.026755117],"genre_scores_gemma":[0.96432453,0.0023898405,0.025321275,0.00040423707,0.0004654271,0.00017180893,0.00018052325,0.00010902972,0.006633209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985555,0.00075211015,0.000040674742,0.0001762986,0.0002710268,0.00020440368],"domain_scores_gemma":[0.9901778,0.0072794,0.00092462223,0.0004097352,0.0004952234,0.00071333494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030645658,0.0011049212,0.0014030066,0.0030554512,0.0013457246,0.0028893847,0.0026065328,0.0024798869,0.0018780885],"category_scores_gemma":[0.016218765,0.00066993124,0.0011306959,0.0020742854,0.005908321,0.0044712997,0.0019642368,0.0033137733,0.00032887512],"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.000016830101,0.00002263127,0.0005496619,0.000044605305,0.000020076064,0.00014017496,0.00012677503,0.075323954,0.000295138,0.920585,0.00075478846,0.0021204266],"study_design_scores_gemma":[0.000008151937,0.000008579015,0.00018592637,0.0000146019165,0.0000050995473,0.000051376494,0.000032197964,0.23568368,0.000094198105,0.76351,0.00039243724,0.000013805304],"about_ca_topic_score_codex":0.0025607613,"about_ca_topic_score_gemma":0.0014426,"teacher_disagreement_score":0.00329809,"about_ca_system_score_codex":0.00329809,"about_ca_system_score_gemma":0.0008311119,"threshold_uncertainty_score":0.023929417},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.948726,0.0041269176,0.028305441,0.0007583667,0.000024130673,0.000065355816,0.006305663,0.00021082214,0.011477373],"genre_scores_gemma":[0.9881392,0.00090661214,0.008229825,0.000015647758,0.00002791446,0.000033628938,0.0020590725,0.000023148921,0.0005649459],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988889,0.00041779355,0.00007643757,0.00024371728,0.00027060063,0.0001026203],"domain_scores_gemma":[0.9900566,0.0057797055,0.0020598988,0.00076085393,0.0009939267,0.00034904064],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0012631032,0.0003348262,0.00029705025,0.010428337,0.00050045794,0.001555921,0.0005168338,0.0004961206,0.001566709],"category_scores_gemma":[0.011670439,0.00018548768,0.0004969654,0.016405886,0.0006070973,0.0024203232,0.0010541606,0.00029443172,0.00040013605],"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.0002583222,0.0001404772,0.6438273,0.00076344784,0.00062225404,0.0010651844,0.0026507345,0.19512531,0.0048814225,0.036674738,0.0046246424,0.109366044],"study_design_scores_gemma":[0.000029032177,0.00016113099,0.59426785,0.00012716206,0.00019928621,0.0012515506,0.0037015215,0.34035227,0.0024346823,0.033126365,0.024280287,0.00006890136],"about_ca_topic_score_codex":0.012326233,"about_ca_topic_score_gemma":0.010374794,"teacher_disagreement_score":0.9987369,"about_ca_system_score_codex":0.0009495355,"about_ca_system_score_gemma":0.00047708195,"threshold_uncertainty_score":0.024509013},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8547373,0.0011058615,0.09918622,0.0019507669,0.000049547707,0.00018843252,0.0012466371,0.00007596674,0.0414594],"genre_scores_gemma":[0.98044556,0.00062149967,0.015152431,0.000050673585,0.000031073752,0.00009658472,0.0005243171,0.00000841898,0.0030694986],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992099,0.00037591433,0.000039532453,0.00015873661,0.00015632571,0.0000595749],"domain_scores_gemma":[0.9973308,0.0015510501,0.0005644817,0.00010801397,0.00032152064,0.00012414998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000787708,0.00021021615,0.00018653482,0.0035544424,0.0010610194,0.0011233118,0.00027373212,0.00040151624,0.002789966],"category_scores_gemma":[0.0037605318,0.00011158721,0.000262999,0.0041905213,0.0005191517,0.0023821113,0.00065674644,0.0002785478,0.00024249581],"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.0002686956,0.0002571326,0.4090658,0.00089597626,0.0003508441,0.0013278179,0.023838378,0.027790418,0.00890526,0.2306865,0.008737532,0.2878757],"study_design_scores_gemma":[0.00003509361,0.00030424198,0.45228878,0.00033601673,0.00039065184,0.0016033414,0.038223445,0.27514982,0.0050415373,0.12530659,0.101183064,0.00013747699],"about_ca_topic_score_codex":0.0051003965,"about_ca_topic_score_gemma":0.006373063,"teacher_disagreement_score":0.0051003965,"about_ca_system_score_codex":0.0011866343,"about_ca_system_score_gemma":0.0005896068,"threshold_uncertainty_score":0.010141432},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05751745,0.016786622,0.288036,0.02585561,0.00069962104,0.00028667873,0.0015874426,0.00058958004,0.608641],"genre_scores_gemma":[0.855358,0.011797275,0.09946409,0.00076689577,0.00084968907,0.00052000914,0.0005854303,0.000117431046,0.03054119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989741,0.0003832231,0.00010508888,0.00015478533,0.00029550615,0.00008749001],"domain_scores_gemma":[0.99316555,0.0045645633,0.0008640937,0.0006517771,0.00043440124,0.00031965433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012078914,0.000495052,0.00030381195,0.0031130586,0.0014425782,0.005787661,0.00058178906,0.001136917,0.021299297],"category_scores_gemma":[0.009392799,0.00028179752,0.00050337036,0.0027529988,0.0024918944,0.010419819,0.0039364244,0.0013181122,0.0020553821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031516302,0.0000054886254,0.0002758389,0.00007640552,0.0000042945394,0.00008386513,0.00041773968,0.00071012526,0.00013920313,0.9839919,0.0014652404,0.012826673],"study_design_scores_gemma":[0.0000049055607,0.00000789041,0.0006629208,0.00013621472,0.000009903591,0.00036389142,0.00053542515,0.004624446,0.00020638839,0.9086267,0.08480382,0.00001738406],"about_ca_topic_score_codex":0.0013923071,"about_ca_topic_score_gemma":0.0013022498,"teacher_disagreement_score":0.021299297,"about_ca_system_score_codex":0.0014220645,"about_ca_system_score_gemma":0.0007983407,"threshold_uncertainty_score":0.07125324},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28099796,0.00016945915,0.71414447,0.0010131078,0.000024710784,0.0001240401,0.0006900005,0.00023632133,0.002599914],"genre_scores_gemma":[0.9404998,0.00021959975,0.051879745,0.000120225326,0.000052822594,0.00025293475,0.00065196725,0.00008443264,0.0062385434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979899,0.0011399003,0.000057368237,0.00040167064,0.0002073673,0.00020381076],"domain_scores_gemma":[0.98353463,0.012261448,0.0019889127,0.00082585565,0.0008248005,0.0005642773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058026835,0.0006981894,0.0014504596,0.0016747916,0.0006000612,0.0020982688,0.0035139818,0.002604711,0.0039222385],"category_scores_gemma":[0.023902154,0.0010825414,0.0012973042,0.0013783231,0.0015435037,0.003016096,0.0018716601,0.0021438224,0.0008774553],"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.00012898496,0.00014868876,0.016436834,0.000055489076,0.00014331109,0.00018288595,0.000491805,0.9092346,0.00079750374,0.059556305,0.0012250622,0.0115986485],"study_design_scores_gemma":[0.0000068918607,0.000015557285,0.0011524867,0.0000059196464,0.00000920926,0.000021181184,0.000035822544,0.98630226,0.000048235263,0.012179134,0.00021267564,0.00001063505],"about_ca_topic_score_codex":0.019885913,"about_ca_topic_score_gemma":0.013567866,"teacher_disagreement_score":0.019885913,"about_ca_system_score_codex":0.0016717663,"about_ca_system_score_gemma":0.0010169584,"threshold_uncertainty_score":0.03954029},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04732773,0.00022772024,0.9387695,0.00046632212,0.000065746746,0.0000830883,0.00016474971,0.0002397453,0.0126553],"genre_scores_gemma":[0.6312734,0.0006328079,0.34613562,0.0003593857,0.00014426622,0.0006248238,0.00040482695,0.0004118916,0.020012949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995357,0.00014395974,0.000019082474,0.00005958194,0.00017271691,0.000069018504],"domain_scores_gemma":[0.9985611,0.00082533323,0.00015047209,0.00015525421,0.00020476326,0.00010309446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010736254,0.00081188645,0.00088282255,0.0010168217,0.0005428223,0.0009642035,0.0016913296,0.0017894189,0.0026912815],"category_scores_gemma":[0.006492196,0.00054650276,0.00071456784,0.0006851971,0.001802709,0.0018454925,0.0014940952,0.0014321874,0.00046155218],"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.000016998321,0.00003551638,0.00045538935,0.00005358943,0.000020746827,0.00010625379,0.00011733506,0.5676736,0.0024842382,0.42069307,0.0010954326,0.007247818],"study_design_scores_gemma":[0.000007636294,0.0000034068992,0.000058718288,0.00000430211,0.000001771489,0.000009915895,0.000009760273,0.93578315,0.00021295872,0.0635404,0.00036244318,0.000005669559],"about_ca_topic_score_codex":0.0057593454,"about_ca_topic_score_gemma":0.0055754874,"teacher_disagreement_score":0.0057593454,"about_ca_system_score_codex":0.0012427168,"about_ca_system_score_gemma":0.0014451294,"threshold_uncertainty_score":0.011451662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7825194,0.0006570023,0.17636444,0.0023418649,0.00042711574,0.0004332644,0.00044085187,0.0009930644,0.03582293],"genre_scores_gemma":[0.9429304,0.0002919645,0.03896825,0.00022870339,0.00009430255,0.00011235526,0.0005505686,0.00011927942,0.016704094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990539,0.00021935093,0.000050854305,0.00022857971,0.00030075447,0.000146571],"domain_scores_gemma":[0.9950872,0.0015198167,0.0006903289,0.0011305407,0.0010739849,0.0004980937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010028745,0.00036333053,0.00048086068,0.0013839073,0.0013063903,0.0014137183,0.0009777406,0.000826603,0.004769017],"category_scores_gemma":[0.008135252,0.00020461321,0.00052568933,0.0010511631,0.0009319165,0.0023435068,0.0014133488,0.00071869383,0.0012292162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011330645,0.0008949308,0.05557839,0.0009540368,0.00035045546,0.01288118,0.014353744,0.061059624,0.15453632,0.19081794,0.01779528,0.489645],"study_design_scores_gemma":[0.0001396218,0.0014873375,0.12908502,0.00035085418,0.000557758,0.00845091,0.023355577,0.29344663,0.07320976,0.22641352,0.24328253,0.0002204759],"about_ca_topic_score_codex":0.0022587166,"about_ca_topic_score_gemma":0.0023204852,"teacher_disagreement_score":0.004769017,"about_ca_system_score_codex":0.0006723839,"about_ca_system_score_gemma":0.00097235956,"threshold_uncertainty_score":0.015953958},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010259858,0.0023153624,0.21659978,0.0019823401,0.0008657693,0.0010999314,0.20397244,0.47844234,0.084462166],"genre_scores_gemma":[0.0578381,0.0025547903,0.26097086,0.0026673332,0.00027838655,0.0015453644,0.5521854,0.061887946,0.0600718],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99739707,0.00024823347,0.0002520909,0.00063667144,0.0012771233,0.00018884391],"domain_scores_gemma":[0.9939501,0.001291994,0.0003853253,0.002631339,0.0011931256,0.00054804434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022861888,0.0018558457,0.0015867831,0.004629975,0.0014272478,0.006496552,0.0061095813,0.0019366192,0.056174017],"category_scores_gemma":[0.01159298,0.0014594558,0.0013724582,0.0059325793,0.0009600889,0.008551795,0.0065953215,0.0025122974,0.04154526],"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.0009150432,0.00021885036,0.0030112984,0.001007651,0.00022250714,0.0003603473,0.000591829,0.0016640987,0.004332219,0.01958458,0.79618585,0.17190565],"study_design_scores_gemma":[0.00015518838,0.00010099446,0.0022844654,0.00010286184,0.000059877253,0.0007440792,0.00024793873,0.015703313,0.008332135,0.019413086,0.95273125,0.00012494615],"about_ca_topic_score_codex":0.00893806,"about_ca_topic_score_gemma":0.009676082,"teacher_disagreement_score":0.056174017,"about_ca_system_score_codex":0.0013151717,"about_ca_system_score_gemma":0.002246808,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77089214,0.00083261897,0.21577385,0.0024358218,0.000040881914,0.00016407769,0.0010524206,0.00021768293,0.008590495],"genre_scores_gemma":[0.9649115,0.0006568189,0.031425286,0.0001520167,0.000079330566,0.00013262052,0.0007404602,0.000050259467,0.001851601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983689,0.0007696494,0.000068220295,0.0004227327,0.00023408687,0.00013647671],"domain_scores_gemma":[0.9454081,0.040699854,0.0073665534,0.0031778594,0.0020776484,0.0012700906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024293559,0.0004683339,0.0005177413,0.0027962178,0.0013879606,0.0022601967,0.001115027,0.001788421,0.002039179],"category_scores_gemma":[0.027704597,0.0006718731,0.00059594784,0.0026598333,0.0022133938,0.0079100225,0.0011967443,0.0012175739,0.0002930276],"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.0005801728,0.0006690708,0.14143582,0.00076067145,0.00049547356,0.001682473,0.004484828,0.28836405,0.020042572,0.4655463,0.0060958066,0.06984278],"study_design_scores_gemma":[0.000037354795,0.00012071382,0.018183516,0.00006525562,0.00007294642,0.0006493873,0.0010690435,0.7982313,0.002643096,0.17486688,0.004018768,0.00004172506],"about_ca_topic_score_codex":0.0037037744,"about_ca_topic_score_gemma":0.0031451585,"teacher_disagreement_score":0.0037037744,"about_ca_system_score_codex":0.0016748363,"about_ca_system_score_gemma":0.0005802485,"threshold_uncertainty_score":0.012847781},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2536055,0.00010352842,0.74389887,0.0002994386,0.000019761439,0.00011796016,0.000089050765,0.0010356526,0.0008302293],"genre_scores_gemma":[0.5180155,0.000036951755,0.48127288,0.00003950991,0.000009988965,0.000093660135,0.00011481062,0.000056202698,0.00036046456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991272,0.0003091881,0.000045719466,0.00021970032,0.00023622837,0.000062000356],"domain_scores_gemma":[0.99411523,0.0040776464,0.00063983,0.00032993846,0.00069720426,0.00014014763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00308851,0.00078444125,0.0006705061,0.0033508358,0.00086737995,0.0013622838,0.0011373711,0.0011835609,0.00054030557],"category_scores_gemma":[0.0126846945,0.0004396254,0.0007509975,0.001994727,0.00085131935,0.001341365,0.00094963226,0.0008266455,0.00010250208],"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.00019180508,0.00017522642,0.009884821,0.00003887073,0.00013701798,0.000098640754,0.0002758771,0.84771645,0.0054766727,0.00505767,0.00045185175,0.13049515],"study_design_scores_gemma":[0.000007843125,0.000014388958,0.00044254801,0.0000025823483,0.000006043243,0.000012715213,0.000017743287,0.9964581,0.0008839548,0.0020763094,0.00007217659,0.0000056612603],"about_ca_topic_score_codex":0.01811842,"about_ca_topic_score_gemma":0.016099958,"teacher_disagreement_score":0.01811842,"about_ca_system_score_codex":0.0018208276,"about_ca_system_score_gemma":0.0012066311,"threshold_uncertainty_score":0.03602588},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007166722,0.0003213685,0.9912476,0.00018773168,0.000041031453,0.000020438738,0.000020698602,0.00006397264,0.00093041715],"genre_scores_gemma":[0.47605738,0.001892344,0.51594305,0.0003841992,0.00036271135,0.00043060657,0.00026680142,0.0002511713,0.0044116974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927543,0.0039692614,0.00024596785,0.0010154223,0.0016173564,0.00039776566],"domain_scores_gemma":[0.9617198,0.030591594,0.0025716624,0.0024819332,0.0018076227,0.0008274219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012465392,0.0011674861,0.0017290728,0.004185828,0.0018473696,0.003910698,0.002908929,0.0023037186,0.0020413324],"category_scores_gemma":[0.05085594,0.0011363406,0.0014660403,0.003533669,0.006811024,0.009802723,0.0042444943,0.0067690136,0.00049024133],"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.000051756873,0.000021044265,0.0018027965,0.00004509564,0.00004041665,0.00008394979,0.00017999986,0.059144244,0.00038193216,0.9249374,0.00043015525,0.012881174],"study_design_scores_gemma":[0.000014984281,0.000049742346,0.0005422726,0.000043496533,0.000017147937,0.00013952421,0.000104399405,0.35295323,0.000856911,0.6424303,0.002798006,0.00004993508],"about_ca_topic_score_codex":0.0010351924,"about_ca_topic_score_gemma":0.00053668447,"teacher_disagreement_score":0.012465392,"about_ca_system_score_codex":0.0023483392,"about_ca_system_score_gemma":0.0014421117,"threshold_uncertainty_score":0.06592405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43999064,0.0006731309,0.53691,0.0016006232,0.000088908964,0.00017188818,0.0004925226,0.00035310423,0.019719224],"genre_scores_gemma":[0.9680873,0.0004951841,0.023532718,0.00019133388,0.00005936757,0.00016503893,0.00015372629,0.00004155321,0.0072738985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955374,0.00020610231,0.000016022426,0.00008901258,0.00007969623,0.000055393175],"domain_scores_gemma":[0.99680847,0.0020765145,0.00046940328,0.00020860438,0.0002006366,0.00023643835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010583295,0.00057425915,0.00073679356,0.0015936958,0.0006793309,0.0014393156,0.0019581888,0.0023131126,0.004435761],"category_scores_gemma":[0.006100308,0.00035926915,0.0007856367,0.0013041197,0.0016036662,0.0026323486,0.00083228725,0.0010769115,0.0005114819],"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.000041664633,0.0000631709,0.0009539263,0.000058812053,0.000047323065,0.0002489587,0.00024726277,0.6081684,0.0019146258,0.38371187,0.00086513726,0.0036787312],"study_design_scores_gemma":[0.000021372507,0.000023965264,0.00027796204,0.0000080953805,0.000010644689,0.00005600369,0.000044996752,0.81946874,0.000134748,0.17936724,0.000570756,0.000015421163],"about_ca_topic_score_codex":0.0041213254,"about_ca_topic_score_gemma":0.0036790872,"teacher_disagreement_score":0.004435761,"about_ca_system_score_codex":0.0014027782,"about_ca_system_score_gemma":0.0005173077,"threshold_uncertainty_score":0.014839053},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23365928,0.003044574,0.74759406,0.00056544563,0.00027877485,0.0004378744,0.0040797316,0.005972919,0.0043673255],"genre_scores_gemma":[0.6455404,0.0017365272,0.33911481,0.000153395,0.0005066471,0.000340188,0.009439115,0.00023167631,0.002937162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999022,0.00018758385,0.00008986271,0.0002918488,0.00029032092,0.00011825745],"domain_scores_gemma":[0.99775404,0.0009897004,0.0003753666,0.00016908614,0.000590741,0.000120977165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001042757,0.0009002523,0.00087575306,0.005200443,0.0007291273,0.0016060317,0.0008406378,0.00088632194,0.0007965481],"category_scores_gemma":[0.0047943317,0.00029555446,0.00071106735,0.0029631795,0.00036970663,0.002224953,0.0010897446,0.0006587756,0.001143441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017426885,0.00044952906,0.040030964,0.00096250593,0.00036459096,0.0018893006,0.0018795413,0.05590039,0.100814745,0.010853067,0.022932291,0.7621805],"study_design_scores_gemma":[0.000029611794,0.00014749495,0.011444592,0.000054008007,0.00008449124,0.000763262,0.0006937588,0.9380324,0.02883019,0.008366979,0.011489455,0.00006378153],"about_ca_topic_score_codex":0.002636058,"about_ca_topic_score_gemma":0.0030861706,"teacher_disagreement_score":0.005200443,"about_ca_system_score_codex":0.0004672581,"about_ca_system_score_gemma":0.00034560476,"threshold_uncertainty_score":0.0055146813},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013952884,0.0014460017,0.97830427,0.0007502198,0.00013431747,0.0004909286,0.0003059115,0.0002459923,0.0043693837],"genre_scores_gemma":[0.28332573,0.00079697726,0.7090644,0.00044747515,0.0005883004,0.0013549607,0.0016779423,0.00031193192,0.0024322073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9406727,0.028963234,0.0046972283,0.004728765,0.019529508,0.0014084987],"domain_scores_gemma":[0.8019376,0.14799476,0.009269083,0.008332344,0.029517153,0.0029490434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.054193392,0.0018073595,0.003318705,0.0139767835,0.003659761,0.0067517753,0.0058267284,0.004825873,0.0045289155],"category_scores_gemma":[0.22973259,0.00094370695,0.0027882247,0.0076210625,0.006136132,0.011503989,0.0057533714,0.004163349,0.0013516492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074435846,0.00037335965,0.012484724,0.0014930016,0.0006126792,0.00043400287,0.0012269301,0.2576179,0.0034169897,0.49167368,0.011135876,0.21878637],"study_design_scores_gemma":[0.000091154434,0.00025531516,0.001340832,0.0002718329,0.00008698532,0.00036529684,0.00028438505,0.7272313,0.002069948,0.2625994,0.0053272136,0.000076282246],"about_ca_topic_score_codex":0.0020372984,"about_ca_topic_score_gemma":0.0016379607,"teacher_disagreement_score":0.054193392,"about_ca_system_score_codex":0.0038254464,"about_ca_system_score_gemma":0.0027783595,"threshold_uncertainty_score":0.28660548},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99876887,0.000043831493,0.0001985764,0.00003598342,0.0000014978071,0.0000034711,0.000051940806,0.0000030086196,0.000892768],"genre_scores_gemma":[0.9996081,0.000022817198,0.000065121945,0.0000032516878,0.0000012670027,0.0000026383193,0.000032618707,9.71767e-7,0.00026322727],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996711,0.000088351575,0.000013602117,0.00006824553,0.00006561994,0.00009301638],"domain_scores_gemma":[0.99713135,0.0010409477,0.0007097516,0.00020560694,0.00044686187,0.0004654434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006417759,0.00015759112,0.00022182187,0.0017280853,0.0011709637,0.0008185624,0.00035283918,0.00031109387,0.0015709962],"category_scores_gemma":[0.0038436775,0.00013486823,0.00021753073,0.0020716616,0.0005581292,0.00094737305,0.0008040192,0.00026754505,0.00013227612],"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.00015078437,0.0000830813,0.94512296,0.000048675345,0.000090362795,0.0006647585,0.008730867,0.0054330155,0.0045122905,0.0049419366,0.0006740826,0.029547274],"study_design_scores_gemma":[0.000005342119,0.000046042747,0.9758152,0.0000070140845,0.00003689836,0.00014338901,0.0021400913,0.019192604,0.0006416448,0.000946664,0.0010081113,0.000017041457],"about_ca_topic_score_codex":0.028860567,"about_ca_topic_score_gemma":0.033911653,"teacher_disagreement_score":0.028860567,"about_ca_system_score_codex":0.0013198911,"about_ca_system_score_gemma":0.00050757703,"threshold_uncertainty_score":0.057385147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9841509,0.0002081183,0.013595029,0.0001882295,0.000015390375,0.00007405091,0.00038590483,0.00008928123,0.0012931514],"genre_scores_gemma":[0.9924958,0.00014437365,0.006669,0.000016160147,0.00001910069,0.00002979978,0.00033102752,0.000017682409,0.00027725808],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99843544,0.00068240624,0.00007894259,0.00024207628,0.00040635644,0.00015486205],"domain_scores_gemma":[0.9788209,0.015494005,0.0022385663,0.0010918383,0.0018224581,0.0005321634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002047549,0.00058267417,0.00044296315,0.003053675,0.0008791211,0.00083290087,0.0007402671,0.0008801763,0.00034691047],"category_scores_gemma":[0.016171813,0.00025700204,0.00038852365,0.0026530898,0.0007857101,0.0022852805,0.00061358855,0.00095098326,0.0001307627],"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.0009899774,0.0012213029,0.5230737,0.0006598572,0.00071203604,0.00307189,0.00636756,0.27078646,0.041790284,0.013979105,0.0040620514,0.13328579],"study_design_scores_gemma":[0.000030491323,0.00041151472,0.2318735,0.000047744896,0.00016755072,0.0009745887,0.0019842712,0.74059916,0.01715036,0.0040321792,0.0026122057,0.00011645592],"about_ca_topic_score_codex":0.025330564,"about_ca_topic_score_gemma":0.01619933,"teacher_disagreement_score":0.025330564,"about_ca_system_score_codex":0.0008662265,"about_ca_system_score_gemma":0.00032499988,"threshold_uncertainty_score":0.050366282},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27971777,0.0018131108,0.7115989,0.00090884545,0.00005252397,0.0002543807,0.0013042594,0.00060546864,0.0037447156],"genre_scores_gemma":[0.7781731,0.00084115245,0.21709664,0.00011743665,0.000080118974,0.00015311645,0.0015371579,0.00010553268,0.0018956187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661416,0.00093367364,0.00014799077,0.0012246228,0.0008924559,0.0001871039],"domain_scores_gemma":[0.96875083,0.01896891,0.0056932727,0.003699181,0.0021801903,0.0007076168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043860185,0.0005880489,0.0008660722,0.0068799807,0.0016858027,0.0026771596,0.001791252,0.0018076152,0.00067315233],"category_scores_gemma":[0.036695987,0.0009902206,0.0008489669,0.0050588986,0.0012587258,0.0075468943,0.0032002921,0.0016595364,0.00046011663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003942586,0.0006230446,0.22806697,0.00088395644,0.00059879455,0.0012864292,0.0053392686,0.17168525,0.016905896,0.098955,0.0057418942,0.4695193],"study_design_scores_gemma":[0.000025257343,0.00009377835,0.023121487,0.000092914845,0.00009531058,0.00069596077,0.0009332824,0.86978316,0.0057186894,0.08882193,0.010554665,0.000063539475],"about_ca_topic_score_codex":0.00776379,"about_ca_topic_score_gemma":0.0089902915,"teacher_disagreement_score":0.00776379,"about_ca_system_score_codex":0.0012809065,"about_ca_system_score_gemma":0.0012466143,"threshold_uncertainty_score":0.023195803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4413294,0.013703962,0.007244616,0.26465598,0.0066521084,0.00023446511,0.005256826,0.00040994646,0.26051268],"genre_scores_gemma":[0.9603426,0.010125585,0.0020052318,0.011679941,0.003849252,0.0001198281,0.0008425061,0.00020078382,0.010834336],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9963588,0.001836348,0.00024247967,0.0003151151,0.00087789213,0.0003693486],"domain_scores_gemma":[0.9765543,0.014985423,0.004491418,0.00066262763,0.002215068,0.0010912471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032442932,0.0005826076,0.00049000495,0.004444787,0.0030365877,0.009378691,0.0007084257,0.0037316352,0.008050788],"category_scores_gemma":[0.026215503,0.00034920566,0.00049056293,0.0040470953,0.0035315242,0.011223713,0.0017191219,0.0018868372,0.0027254568],"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.0007308594,0.00041012905,0.18003,0.0053116847,0.00044129684,0.00451381,0.19212508,0.0012684424,0.005672271,0.029794438,0.16342501,0.41627693],"study_design_scores_gemma":[0.000026407819,0.0002653884,0.13464169,0.0038282005,0.000268942,0.0025618928,0.36072367,0.0016714333,0.0025487652,0.017737295,0.475471,0.00025533044],"about_ca_topic_score_codex":0.004867787,"about_ca_topic_score_gemma":0.0065842834,"teacher_disagreement_score":0.009378691,"about_ca_system_score_codex":0.0014078432,"about_ca_system_score_gemma":0.00094149576,"threshold_uncertainty_score":0.026932597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14429614,0.0023351423,0.8435803,0.0017293836,0.00019061784,0.00010159345,0.00081530283,0.00070957455,0.006241997],"genre_scores_gemma":[0.93434983,0.0024897002,0.045845874,0.00016362667,0.00032263002,0.00019917135,0.0007014683,0.00017409082,0.015753444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885654,0.0005399148,0.0000435387,0.0002244578,0.00021155027,0.00012392404],"domain_scores_gemma":[0.9831904,0.013223687,0.0012781603,0.00096372084,0.0009115307,0.00043252163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002725488,0.0005295971,0.00091178186,0.0027515169,0.0010149572,0.002556203,0.001909276,0.0020492803,0.0035599335],"category_scores_gemma":[0.017219191,0.0010553524,0.000982,0.0023310191,0.0020533577,0.0068040737,0.0020667305,0.0022057458,0.0007551591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026392326,0.00019617591,0.006065544,0.00040292606,0.00012806966,0.00028053936,0.0007994094,0.3535929,0.0027708446,0.5830069,0.0083049275,0.044187743],"study_design_scores_gemma":[0.000013490623,0.000029289136,0.0008932916,0.000033879733,0.000022257913,0.000082499595,0.000053506355,0.8732447,0.00036789378,0.12432597,0.000903862,0.000029414174],"about_ca_topic_score_codex":0.004181906,"about_ca_topic_score_gemma":0.004969962,"teacher_disagreement_score":0.004181906,"about_ca_system_score_codex":0.0018442948,"about_ca_system_score_gemma":0.0006657042,"threshold_uncertainty_score":0.014413893},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040439474,0.0006119665,0.98818934,0.00030264925,0.000047747348,0.000033740867,0.00010521375,0.00011779966,0.006547619],"genre_scores_gemma":[0.33456013,0.00437614,0.6410289,0.000615473,0.0006509233,0.0004387121,0.00037512937,0.00033683272,0.017617812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990408,0.00031104873,0.000044469183,0.00014930575,0.0003593222,0.000095116615],"domain_scores_gemma":[0.99846977,0.00082307466,0.000115377334,0.00028718114,0.00023885706,0.0000656825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015065976,0.001119807,0.0011246594,0.0026324964,0.00054927863,0.0012560962,0.0030909744,0.001342686,0.0028990887],"category_scores_gemma":[0.00491765,0.000566705,0.00172669,0.0017437488,0.0019949945,0.003165362,0.0015091598,0.0020573256,0.00079056853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024659873,0.000015136446,0.00014865305,0.000046437293,0.000015272877,0.000054964246,0.000057453795,0.13132331,0.0003936452,0.86194277,0.0007158384,0.0052841543],"study_design_scores_gemma":[0.0000039173606,0.0000047471904,0.00006640022,0.000009614268,0.0000050388153,0.000047147307,0.000010621389,0.44845465,0.00011339892,0.5486513,0.0026247164,0.000008356757],"about_ca_topic_score_codex":0.0039580176,"about_ca_topic_score_gemma":0.004256747,"teacher_disagreement_score":0.0039580176,"about_ca_system_score_codex":0.0018972225,"about_ca_system_score_gemma":0.001292274,"threshold_uncertainty_score":0.013765335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90145844,0.00074074225,0.08963927,0.0004060121,0.00012336993,0.00023812243,0.0014837079,0.00095801405,0.00495226],"genre_scores_gemma":[0.9608758,0.00021086239,0.036301017,0.00007285604,0.00006874138,0.0000667928,0.0009632368,0.000028524932,0.0014121922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999276,0.00018761704,0.000045275337,0.0001716847,0.00024507125,0.00007439001],"domain_scores_gemma":[0.9960886,0.0019584622,0.0009968234,0.00030328802,0.0005128644,0.00013996524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007279925,0.000561292,0.00040685263,0.0028494678,0.00030519933,0.0006915708,0.0004601903,0.00090614165,0.00064044725],"category_scores_gemma":[0.004173295,0.00021058951,0.00035482767,0.00091879343,0.00027952174,0.0012242963,0.0006902757,0.00044308242,0.00041280655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001332004,0.00063078356,0.3669249,0.0007633628,0.0004321362,0.0047768313,0.0013948596,0.050660484,0.07689519,0.0051912186,0.013011581,0.47798675],"study_design_scores_gemma":[0.00003107239,0.00029364292,0.16509877,0.00007429864,0.00009501019,0.0021056943,0.0008316625,0.7881868,0.032339703,0.004206752,0.006670254,0.00006637919],"about_ca_topic_score_codex":0.001607566,"about_ca_topic_score_gemma":0.0025042242,"teacher_disagreement_score":0.0028494678,"about_ca_system_score_codex":0.0003596115,"about_ca_system_score_gemma":0.00015317589,"threshold_uncertainty_score":0.0038500428},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035054862,0.00028960573,0.9627374,0.0002594806,0.00002198252,0.000054907814,0.000035382483,0.0005127894,0.0010336797],"genre_scores_gemma":[0.43995246,0.00028025097,0.5574518,0.00020484896,0.00006866575,0.00019245228,0.00012497732,0.00024339619,0.0014811209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933964,0.0026482884,0.00027645598,0.0016931364,0.0015911644,0.00039465856],"domain_scores_gemma":[0.92889947,0.051125094,0.004027921,0.010149193,0.004099057,0.0016992929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012236681,0.001079865,0.0016728562,0.003784165,0.0024809854,0.0024098689,0.003051925,0.0021039946,0.0017057963],"category_scores_gemma":[0.06520073,0.0009810976,0.0018547509,0.0024161313,0.004769832,0.0044676824,0.005237977,0.0033260281,0.00063405867],"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.0005193906,0.00022290002,0.028931087,0.0007689805,0.00045248837,0.00203481,0.00451223,0.36999246,0.034228064,0.21085303,0.0052494677,0.34223512],"study_design_scores_gemma":[0.000027466049,0.000059417544,0.0016795009,0.000041309904,0.00004514256,0.00049202016,0.00017604283,0.8847155,0.0053585963,0.10572393,0.001635554,0.000045508248],"about_ca_topic_score_codex":0.0037780202,"about_ca_topic_score_gemma":0.0037456695,"teacher_disagreement_score":0.012236681,"about_ca_system_score_codex":0.0011540371,"about_ca_system_score_gemma":0.0011624326,"threshold_uncertainty_score":0.06471455},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2886783,0.0016252524,0.70271164,0.0008687757,0.00006138073,0.000111304296,0.000942256,0.00031485088,0.0046862694],"genre_scores_gemma":[0.90899324,0.00074788486,0.086778685,0.000121945086,0.00013488992,0.00009504305,0.0012164697,0.00009502564,0.0018167626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984016,0.00051970826,0.00006789611,0.00058392534,0.00029459217,0.00013232826],"domain_scores_gemma":[0.9858958,0.00917882,0.0022489785,0.0013281722,0.0007880511,0.00056015374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024519535,0.0008064132,0.00081200135,0.0053088907,0.0012556962,0.0018233195,0.0013811785,0.0013213998,0.001606258],"category_scores_gemma":[0.0151038,0.00052685203,0.0008355006,0.0030813357,0.0016176838,0.0044146944,0.0023881146,0.0014384695,0.00039910065],"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.00049998815,0.00024348138,0.15707766,0.0006418212,0.0006758404,0.0014491415,0.003172286,0.37035707,0.012167487,0.25022972,0.009105871,0.19437975],"study_design_scores_gemma":[0.000021124797,0.000036562116,0.016102044,0.000057918696,0.00012684094,0.00033609776,0.0005732098,0.6752025,0.0023000345,0.29893762,0.0062766364,0.000029508436],"about_ca_topic_score_codex":0.0032399015,"about_ca_topic_score_gemma":0.0064649195,"teacher_disagreement_score":0.0053088907,"about_ca_system_score_codex":0.0011782174,"about_ca_system_score_gemma":0.0005348644,"threshold_uncertainty_score":0.012967348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12251275,0.0018434706,0.85602653,0.0011695975,0.0001171408,0.000110543326,0.00084170274,0.00033409384,0.017044209],"genre_scores_gemma":[0.8228604,0.002848938,0.14852418,0.0002335827,0.0004766173,0.00043490506,0.0013862825,0.0002411572,0.02299387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987596,0.0004619076,0.00006355056,0.00039265846,0.00023095784,0.000091275026],"domain_scores_gemma":[0.98923534,0.008251948,0.00091195246,0.0007179112,0.00049748155,0.00038529656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014363505,0.0007133965,0.0009302589,0.0024923137,0.0012527282,0.0028782578,0.001286654,0.0014140387,0.0038153313],"category_scores_gemma":[0.010059589,0.00091552956,0.0007128684,0.0029737246,0.002326475,0.007656362,0.0018958342,0.0018787276,0.0006471903],"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.000074925185,0.000053287215,0.002396297,0.0003200375,0.00005446444,0.0002617766,0.0011671911,0.049877428,0.0018914845,0.9008017,0.0039609387,0.039140474],"study_design_scores_gemma":[0.000009928814,0.000022040496,0.00069068134,0.000040383522,0.000028885692,0.000099957324,0.00016964845,0.090208314,0.00038552328,0.90510947,0.0032196366,0.000015602247],"about_ca_topic_score_codex":0.000912936,"about_ca_topic_score_gemma":0.0015877412,"teacher_disagreement_score":0.0038153313,"about_ca_system_score_codex":0.0008925688,"about_ca_system_score_gemma":0.00040725814,"threshold_uncertainty_score":0.0127635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050761864,0.0008583131,0.9420126,0.0004305345,0.000035544243,0.000071954,0.00011832374,0.00036397926,0.005346867],"genre_scores_gemma":[0.5651418,0.00095555803,0.42632785,0.00019091368,0.000083711675,0.0003754317,0.0004748269,0.00030622474,0.006143577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991374,0.00046962767,0.00002019794,0.00017943644,0.000104680024,0.000088563735],"domain_scores_gemma":[0.99787474,0.0015353159,0.00019039692,0.00012341558,0.00016755026,0.0001084908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017416775,0.00096575177,0.0013400231,0.001549014,0.0007641722,0.0009919533,0.0013410214,0.001236945,0.0023147296],"category_scores_gemma":[0.005738691,0.00071135914,0.001034935,0.0014189071,0.001327069,0.0018759167,0.0013623643,0.00081419514,0.0006263711],"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.000124168,0.00004205662,0.00080028106,0.00013220905,0.000072789604,0.00007737993,0.000094540716,0.9107358,0.0016004782,0.05009861,0.0024552287,0.033766482],"study_design_scores_gemma":[0.00001751798,0.000016050399,0.00012478404,0.000009945535,0.000008217954,0.000019963963,0.000010572892,0.96419317,0.00031191952,0.03480622,0.0004757922,0.0000057910474],"about_ca_topic_score_codex":0.0031819344,"about_ca_topic_score_gemma":0.0038782912,"teacher_disagreement_score":0.0031819344,"about_ca_system_score_codex":0.0013959509,"about_ca_system_score_gemma":0.0009906099,"threshold_uncertainty_score":0.0101284385},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092614725,0.0010267022,0.8973579,0.0008217127,0.00010159516,0.00036360428,0.002595984,0.0021105723,0.0030071826],"genre_scores_gemma":[0.58163154,0.00063124625,0.40864223,0.00029460006,0.00020472938,0.0007763678,0.0042110886,0.00030627396,0.0033019127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977685,0.00086675753,0.000070292685,0.0007132844,0.0004080847,0.00017304147],"domain_scores_gemma":[0.9880993,0.0076055257,0.0011178232,0.0015344423,0.0011581904,0.00048475116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051011518,0.001183799,0.0010851063,0.0044333315,0.0015864031,0.0023648005,0.0036287194,0.0026081658,0.0014367206],"category_scores_gemma":[0.025927668,0.0008748323,0.0017356474,0.002579818,0.0014235575,0.0032610002,0.002480203,0.0021908518,0.00064896204],"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.00025315068,0.0001905117,0.030071076,0.00023458741,0.00023384715,0.00025597453,0.00048226194,0.8329909,0.0031989359,0.03757944,0.008800813,0.08570853],"study_design_scores_gemma":[0.000005214934,0.00001232484,0.0005054862,0.0000070668566,0.0000058870314,0.000036587608,0.000016361571,0.9899895,0.00024936057,0.008524733,0.0006420627,0.0000054426414],"about_ca_topic_score_codex":0.017576322,"about_ca_topic_score_gemma":0.014580599,"teacher_disagreement_score":0.017576322,"about_ca_system_score_codex":0.0021781994,"about_ca_system_score_gemma":0.0017268101,"threshold_uncertainty_score":0.03494805},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08762473,0.0007645724,0.9024392,0.00042442192,0.000061646664,0.00007936186,0.00030023666,0.00023056325,0.008075279],"genre_scores_gemma":[0.9574102,0.00082206016,0.039487433,0.00005234355,0.00006369903,0.0001769483,0.00024281579,0.000028361563,0.0017161537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935836,0.00022070298,0.000039863182,0.0001034349,0.00020600464,0.00007168061],"domain_scores_gemma":[0.9986765,0.00061689876,0.000217328,0.00011551651,0.00030263752,0.000071188566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009304335,0.00070940435,0.00047259894,0.0034057074,0.00045536752,0.001304437,0.0008140892,0.0006667754,0.0010229883],"category_scores_gemma":[0.0035323647,0.00017108765,0.00068597327,0.0016878068,0.0008498216,0.0032520941,0.0009534903,0.00057019887,0.00015330665],"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.00006144464,0.000048330345,0.009762547,0.00015444987,0.00010884082,0.0003030226,0.00030494432,0.76387113,0.0050705373,0.16123667,0.002939344,0.05613877],"study_design_scores_gemma":[0.000003198682,0.000019442245,0.0015369767,0.00001620181,0.000021141343,0.000118564756,0.00006616901,0.96864766,0.00053646986,0.028081333,0.0009302364,0.000022621121],"about_ca_topic_score_codex":0.0025684787,"about_ca_topic_score_gemma":0.0016148722,"teacher_disagreement_score":0.0034057074,"about_ca_system_score_codex":0.0012152762,"about_ca_system_score_gemma":0.0006263225,"threshold_uncertainty_score":0.008817494},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119938314,0.011823584,0.8558621,0.0055276044,0.00018554706,0.00009672923,0.00038239462,0.0003338618,0.005849809],"genre_scores_gemma":[0.9021089,0.0074991668,0.08712819,0.0004523187,0.0005617064,0.00008536206,0.00024163701,0.000072632065,0.0018501034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997526,0.0014092493,0.00008483673,0.00042717982,0.00041846797,0.0001343865],"domain_scores_gemma":[0.95602477,0.0358615,0.00411065,0.0019914254,0.0016233929,0.00038823968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005840268,0.0007436572,0.0011639429,0.0031977878,0.0014608852,0.003968868,0.0014734756,0.002252907,0.001560777],"category_scores_gemma":[0.04932977,0.00077092217,0.00064919627,0.0030961905,0.00312274,0.010440208,0.0014385032,0.0017040757,0.0003886355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000481913,0.00013044357,0.050002277,0.0019925365,0.0006577933,0.001392897,0.0042194994,0.13011348,0.006201044,0.5697246,0.007529295,0.22755423],"study_design_scores_gemma":[0.00005102808,0.00016628495,0.0071017263,0.00050341134,0.00025873218,0.0014145697,0.0015710354,0.43510854,0.0035678933,0.5360811,0.014063236,0.000112555994],"about_ca_topic_score_codex":0.0021513475,"about_ca_topic_score_gemma":0.0016836318,"teacher_disagreement_score":0.005840268,"about_ca_system_score_codex":0.0011649727,"about_ca_system_score_gemma":0.0006998102,"threshold_uncertainty_score":0.03088665},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005942417,0.000855174,0.9877844,0.0010803455,0.000069155634,0.00006168923,0.00021320637,0.00019014852,0.0038033274],"genre_scores_gemma":[0.40507886,0.004875175,0.5824259,0.00041813657,0.00041778336,0.00071020465,0.0005825561,0.00019813441,0.0052932804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997352,0.0018426296,0.00009380428,0.00027669867,0.00034661233,0.00008833335],"domain_scores_gemma":[0.9861594,0.011028866,0.0011789094,0.00084491156,0.0004467632,0.00034117137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037725556,0.0017597862,0.0011000868,0.004090468,0.0007392936,0.0032769488,0.0014703261,0.0018715141,0.0037617416],"category_scores_gemma":[0.019551914,0.00075689756,0.0015630495,0.0041021183,0.002973176,0.007098458,0.003071955,0.0030969149,0.0005501363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005440567,0.000089873094,0.003595447,0.0003099095,0.00025094295,0.00014676622,0.00055805553,0.33465472,0.00044933765,0.6039403,0.0025932621,0.05335698],"study_design_scores_gemma":[0.000007136683,0.000020227322,0.00045281093,0.000058717324,0.00002219508,0.00004409054,0.00014468843,0.41240194,0.00020351935,0.58339566,0.0032252131,0.000023765882],"about_ca_topic_score_codex":0.0059209513,"about_ca_topic_score_gemma":0.0056402287,"teacher_disagreement_score":0.0059209513,"about_ca_system_score_codex":0.002027259,"about_ca_system_score_gemma":0.0014446671,"threshold_uncertainty_score":0.019951403},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007634145,0.0015122398,0.933101,0.0012441713,0.00018033324,0.00028231644,0.0042982646,0.032474957,0.019272575],"genre_scores_gemma":[0.10043555,0.0019360343,0.88653135,0.00017786825,0.00020199448,0.0008088236,0.003286063,0.0016878559,0.0049343295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806994,0.0006756908,0.0001317975,0.00020544515,0.0008468339,0.000070398855],"domain_scores_gemma":[0.9954627,0.0029012745,0.00035492127,0.000645284,0.00050296483,0.0001328885],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0022377784,0.0013671605,0.00091044774,0.012126165,0.0011035637,0.00554686,0.0012274933,0.0008722275,0.01729195],"category_scores_gemma":[0.017037122,0.0006623404,0.0014041275,0.011682385,0.0008415563,0.0046131946,0.0030289246,0.0011029069,0.00506387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025931446,0.00016479455,0.003131559,0.0011266877,0.00022929706,0.00045598822,0.0020999955,0.036602706,0.0029131551,0.24801333,0.045573022,0.6594301],"study_design_scores_gemma":[0.00009648458,0.00006945177,0.0036615517,0.0005417446,0.00011221349,0.00042123927,0.00096545566,0.26157835,0.005427095,0.40667447,0.3202828,0.00016915849],"about_ca_topic_score_codex":0.006693032,"about_ca_topic_score_gemma":0.0051587736,"teacher_disagreement_score":0.98787385,"about_ca_system_score_codex":0.0017765167,"about_ca_system_score_gemma":0.0012318686,"threshold_uncertainty_score":0.05784738},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011469642,0.00021056493,0.9836236,0.00013293634,0.000089536705,0.000046788256,0.00003244747,0.00023672849,0.0041577364],"genre_scores_gemma":[0.42149848,0.0008534479,0.56759125,0.00018611093,0.00016466012,0.00037564908,0.00012791425,0.00028953096,0.00891297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997596,0.00007597576,0.000009438089,0.00003843239,0.00008980693,0.000026749578],"domain_scores_gemma":[0.9993623,0.00030874132,0.000050925337,0.00008697982,0.00015428169,0.000036892958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057884905,0.0006202754,0.00042041566,0.0010316427,0.00042083848,0.0006645179,0.0006972396,0.0006292549,0.0030540265],"category_scores_gemma":[0.0019403149,0.00019824109,0.0005373442,0.0006040659,0.0005378218,0.0011935924,0.00092100835,0.00076189375,0.0005569243],"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.00013463886,0.00021651121,0.0009812418,0.00045752316,0.000075700504,0.00030018212,0.00025667046,0.45337328,0.080512404,0.2456145,0.0056831776,0.21239421],"study_design_scores_gemma":[0.0000064100514,0.000021621796,0.00008710062,0.0000064142955,0.000008432341,0.00005032293,0.0000101543155,0.9819051,0.0027035354,0.013020241,0.0021710584,0.0000096119875],"about_ca_topic_score_codex":0.0009364479,"about_ca_topic_score_gemma":0.0007833917,"teacher_disagreement_score":0.0030540265,"about_ca_system_score_codex":0.0005577897,"about_ca_system_score_gemma":0.0005310425,"threshold_uncertainty_score":0.010216713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099932335,0.0005178154,0.8971794,0.00015009027,0.000047482983,0.000080854974,0.00017588011,0.00095372024,0.0009624067],"genre_scores_gemma":[0.805152,0.0004064851,0.19251058,0.00006196724,0.0001336815,0.000113907074,0.000467043,0.00010177277,0.0010525739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991345,0.0002554812,0.000059274367,0.00018927752,0.00029679385,0.00006466158],"domain_scores_gemma":[0.99762744,0.0013230355,0.00039628695,0.000168909,0.00039117175,0.00009322758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014716716,0.0006267354,0.00071503717,0.0027418192,0.000327738,0.00087318127,0.0010790938,0.00074070116,0.00082603795],"category_scores_gemma":[0.00868464,0.000272442,0.00066068355,0.0015268117,0.0004862906,0.0022092506,0.0010792654,0.00073067116,0.0004759897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013521545,0.00034416417,0.037315533,0.00043591735,0.0003538586,0.000850618,0.0008096039,0.26513425,0.06688094,0.022208666,0.0040288805,0.6002855],"study_design_scores_gemma":[0.000009997302,0.00004185477,0.00391751,0.0000061350243,0.000017277382,0.00018942902,0.000055993187,0.98562926,0.005262708,0.0042023296,0.0006421353,0.000025325604],"about_ca_topic_score_codex":0.0015451766,"about_ca_topic_score_gemma":0.0010646371,"teacher_disagreement_score":0.0027418192,"about_ca_system_score_codex":0.00055023754,"about_ca_system_score_gemma":0.0002775439,"threshold_uncertainty_score":0.0077829957},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99583817,0.000017671457,0.0024236972,0.000028331728,0.000031581047,0.00044420932,0.00007131689,0.000027620687,0.0011173962],"genre_scores_gemma":[0.9912669,0.000042310425,0.0054654214,0.000070798465,0.000041280706,0.0013591452,0.00017046077,0.00001141306,0.001572238],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.994787,0.0026596019,0.00040845887,0.0008482316,0.0009736089,0.00032312126],"domain_scores_gemma":[0.97502023,0.016628426,0.0021047492,0.0017101261,0.0027188894,0.0018176528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042582285,0.000702928,0.0007261812,0.00069699244,0.0007223017,0.00080136774,0.0006696382,0.0010304846,0.0048277625],"category_scores_gemma":[0.01495651,0.00031729453,0.00070774683,0.00056308304,0.0007553102,0.00092316436,0.0009785118,0.0012193263,0.00068134157],"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.02582279,0.20382601,0.24124542,0.002611264,0.00065875263,0.001008489,0.041668564,0.005014981,0.19853075,0.0033303965,0.0037823732,0.27250016],"study_design_scores_gemma":[0.003289243,0.35039034,0.48281154,0.00019866679,0.00059263344,0.00079942367,0.020081311,0.023321358,0.10996479,0.001965247,0.006204053,0.0003814102],"about_ca_topic_score_codex":0.00029325538,"about_ca_topic_score_gemma":0.00022831828,"teacher_disagreement_score":0.0048277625,"about_ca_system_score_codex":0.00040993094,"about_ca_system_score_gemma":0.0005283517,"threshold_uncertainty_score":0.022519946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8469883,0.00017312006,0.14160308,0.00073561014,0.0000308731,0.00004080873,0.00009277582,0.0001498781,0.010185434],"genre_scores_gemma":[0.99479693,0.000056819223,0.0042147785,0.000060111754,0.000009932036,0.000018170962,0.000018439061,0.00001036943,0.00081436016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994111,0.00028230879,0.00002125755,0.000109539294,0.000102758684,0.00007297412],"domain_scores_gemma":[0.9968286,0.001688041,0.00060415023,0.00040896237,0.0001742661,0.00029594457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010291998,0.00022224912,0.00032364312,0.000669442,0.0006730802,0.0012487432,0.0005441562,0.0006889353,0.0012623414],"category_scores_gemma":[0.006248488,0.00035129924,0.00040471036,0.00039605855,0.0016453336,0.0015385395,0.00092209276,0.0006237868,0.00018238468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002540061,0.00013134866,0.037873827,0.00014052977,0.0001834536,0.0018447537,0.0032798983,0.266812,0.03311357,0.6224754,0.0031171748,0.030774059],"study_design_scores_gemma":[0.000040207047,0.00007107338,0.013526775,0.000020218682,0.000047457004,0.00052842166,0.00061602105,0.5778204,0.0032783425,0.40135133,0.002649307,0.000050488004],"about_ca_topic_score_codex":0.0015994573,"about_ca_topic_score_gemma":0.0018153059,"teacher_disagreement_score":0.0015994573,"about_ca_system_score_codex":0.00074834167,"about_ca_system_score_gemma":0.00035463038,"threshold_uncertainty_score":0.005442977},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05112304,0.0007514693,0.9400954,0.00042991427,0.00004207904,0.00004096809,0.00012881283,0.00030203897,0.0070863315],"genre_scores_gemma":[0.85109425,0.0015005464,0.14255469,0.00019934397,0.00012042822,0.00018734188,0.0002637956,0.00026403824,0.0038156032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957246,0.00022611888,0.000012677594,0.00006601062,0.00008703255,0.00003575977],"domain_scores_gemma":[0.9970566,0.0017908385,0.00037308745,0.00031481564,0.00028359023,0.00018112097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010817776,0.0007671911,0.00059317163,0.0021152564,0.0004954127,0.0010722541,0.0008333725,0.0009901167,0.002287884],"category_scores_gemma":[0.0070306924,0.0003578001,0.0005982025,0.0011038155,0.0015778051,0.0024995795,0.0010207128,0.0013269964,0.00041078826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026511365,0.000027784517,0.00083866116,0.00007994546,0.000024288136,0.00012031972,0.00023849035,0.28586194,0.0024207504,0.69657373,0.0013226349,0.012464914],"study_design_scores_gemma":[0.000003170293,0.000009595831,0.00022723971,0.00001383853,0.0000034726895,0.000046614932,0.000050684448,0.6837455,0.00024472288,0.31456128,0.0010842505,0.000009658733],"about_ca_topic_score_codex":0.0019351533,"about_ca_topic_score_gemma":0.0010354487,"teacher_disagreement_score":0.002287884,"about_ca_system_score_codex":0.0007184946,"about_ca_system_score_gemma":0.00034680034,"threshold_uncertainty_score":0.007653773},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051203277,0.00045245717,0.9389287,0.00045999672,0.00006989939,0.000053688716,0.00047300803,0.00025490104,0.0081041],"genre_scores_gemma":[0.76825565,0.0012443045,0.21960513,0.0003648726,0.00021248152,0.00026181925,0.0012424334,0.00019068512,0.008622692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999054,0.00044062964,0.000048210703,0.00020654888,0.00018703233,0.000063569896],"domain_scores_gemma":[0.9961777,0.0021241806,0.000476532,0.00047070612,0.0004950088,0.00025589432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095711154,0.0006780877,0.00038071224,0.0019986122,0.0004493675,0.0014548849,0.00074433954,0.0008558187,0.003158932],"category_scores_gemma":[0.006823522,0.0003040191,0.00043859085,0.0012956113,0.0011324929,0.0034421368,0.0014455767,0.0009481117,0.00072020566],"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.0000659616,0.000052372252,0.0011710731,0.00013488349,0.000032634085,0.00013148352,0.00036457292,0.074117824,0.0031176556,0.8609179,0.0034873027,0.05640639],"study_design_scores_gemma":[0.000008084689,0.00002599749,0.00037741338,0.00003165927,0.0000106834195,0.00011093801,0.000102652564,0.41316238,0.0006893365,0.57820386,0.0072601642,0.000016875993],"about_ca_topic_score_codex":0.00080721936,"about_ca_topic_score_gemma":0.00069901935,"teacher_disagreement_score":0.003158932,"about_ca_system_score_codex":0.00077033945,"about_ca_system_score_gemma":0.0003304815,"threshold_uncertainty_score":0.010567665},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02477262,0.001083716,0.9323959,0.0067172837,0.0014529036,0.0056395824,0.0031896294,0.0049073603,0.019841053],"genre_scores_gemma":[0.23530312,0.0002755758,0.73915535,0.0033547329,0.0006691203,0.011256216,0.0035069732,0.0022999104,0.00417911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.6396495,0.28434023,0.013928885,0.018820366,0.039787136,0.003473842],"domain_scores_gemma":[0.61560136,0.2259071,0.010752077,0.10470655,0.036040388,0.0069924807],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.28000173,0.002773419,0.003562856,0.0072037294,0.004519994,0.011612676,0.008015466,0.007052844,0.013178758],"category_scores_gemma":[0.39291683,0.0013325752,0.0048974054,0.006596621,0.008225662,0.024834596,0.021406684,0.009124732,0.003738859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007688927,0.0027513504,0.020704005,0.003095111,0.0023988571,0.00042731987,0.0068580736,0.02561157,0.0066820523,0.31251445,0.054609794,0.55665857],"study_design_scores_gemma":[0.0026268838,0.0052791834,0.0060528363,0.0010057397,0.00062449556,0.0006496458,0.0029427265,0.22691174,0.008739377,0.65042704,0.09431889,0.00042146377],"about_ca_topic_score_codex":0.0034673063,"about_ca_topic_score_gemma":0.003890853,"teacher_disagreement_score":0.28000173,"about_ca_system_score_codex":0.003781396,"about_ca_system_score_gemma":0.007274872,"threshold_uncertainty_score":0.88788605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2789433,0.0034034315,0.67211264,0.0050005596,0.0003957985,0.00015154669,0.0007523467,0.001208975,0.038031477],"genre_scores_gemma":[0.9434923,0.0025560642,0.038209844,0.00082707126,0.00065704656,0.00022570947,0.0005808007,0.00029635892,0.013154901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871707,0.0003428767,0.000045403904,0.00043286363,0.00027354364,0.00018825139],"domain_scores_gemma":[0.97967166,0.014176348,0.0022544223,0.001697835,0.0008438843,0.0013558292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014322316,0.0010470792,0.001564099,0.002387684,0.0015978828,0.0047978666,0.0014693001,0.0018343882,0.008028006],"category_scores_gemma":[0.0158532,0.00072288356,0.00131459,0.0013553915,0.0029880719,0.008960399,0.0024357012,0.0027401978,0.00133788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034638392,0.00013001183,0.004688792,0.00059048715,0.00019247166,0.00092443865,0.00070711656,0.05885067,0.011333975,0.88283575,0.014358111,0.02504187],"study_design_scores_gemma":[0.00005938923,0.00011644403,0.0016333987,0.00006593403,0.00010887314,0.00075868436,0.00022775459,0.33266446,0.003151476,0.6526938,0.008463183,0.000056536104],"about_ca_topic_score_codex":0.0012118033,"about_ca_topic_score_gemma":0.0012446749,"teacher_disagreement_score":0.008028006,"about_ca_system_score_codex":0.0012990774,"about_ca_system_score_gemma":0.0004102755,"threshold_uncertainty_score":0.026856363},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62690556,0.0014611338,0.31913996,0.009487374,0.00012565622,0.00011034993,0.001014971,0.00024077462,0.041514345],"genre_scores_gemma":[0.97796905,0.00054191315,0.012868271,0.00029582248,0.00007143614,0.00008518249,0.0003658083,0.00005325894,0.0077493107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943286,0.00025247995,0.000016865588,0.0001613845,0.000056233854,0.000080038146],"domain_scores_gemma":[0.9971777,0.0017547396,0.00038434923,0.0002036146,0.00013151752,0.00034812416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013309352,0.0006092193,0.0009884947,0.00074490585,0.00093793817,0.0016879138,0.0020288667,0.0020999238,0.0061798966],"category_scores_gemma":[0.008785028,0.0003261042,0.0006589081,0.0006682526,0.0014802811,0.0041645155,0.0014853552,0.0021221885,0.0010688183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053859345,0.00011579551,0.0069969767,0.0001295774,0.00008383061,0.00042824598,0.0009962659,0.34604862,0.0016318057,0.62095135,0.0054339212,0.016645087],"study_design_scores_gemma":[0.00009618179,0.00007408173,0.0012141254,0.000025591586,0.000033097476,0.00025157238,0.00033541303,0.5336249,0.0004596132,0.4606047,0.0032389679,0.000041780964],"about_ca_topic_score_codex":0.004277575,"about_ca_topic_score_gemma":0.0034521273,"teacher_disagreement_score":0.0061798966,"about_ca_system_score_codex":0.0011908681,"about_ca_system_score_gemma":0.00036920843,"threshold_uncertainty_score":0.020673811},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053534288,0.0006703513,0.9375096,0.0017851979,0.000089842935,0.00006459675,0.0003813032,0.00035199258,0.0056128446],"genre_scores_gemma":[0.83726466,0.001469358,0.14784001,0.00040882584,0.0003829113,0.00029816895,0.0005099374,0.00022487964,0.011601352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846774,0.0007237629,0.000056442477,0.00035541801,0.00024686515,0.00014972143],"domain_scores_gemma":[0.9902172,0.007414891,0.00097079546,0.0005234247,0.00059149176,0.0002822615],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0043557677,0.000832058,0.0010844861,0.0032775078,0.0013877552,0.0031535355,0.0027215946,0.0028242427,0.0034933668],"category_scores_gemma":[0.017623655,0.00066365115,0.0009527644,0.0033343118,0.0020615424,0.0054353895,0.0016087895,0.0027573917,0.00075597555],"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.00010542225,0.000113184,0.005262983,0.00011254518,0.00010584102,0.0006391632,0.00055131054,0.62323123,0.0007883577,0.33769906,0.003140382,0.028250603],"study_design_scores_gemma":[0.0000149457,0.000013315768,0.00026998552,0.000008373951,0.000017803724,0.000084108025,0.000038358026,0.922394,0.00007752637,0.07559562,0.0014719801,0.000013908889],"about_ca_topic_score_codex":0.013170327,"about_ca_topic_score_gemma":0.011060288,"teacher_disagreement_score":0.9967225,"about_ca_system_score_codex":0.0018018298,"about_ca_system_score_gemma":0.0013438911,"threshold_uncertainty_score":0.02618736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82171965,0.003016918,0.13099106,0.00858814,0.0000744664,0.000041197105,0.00028182904,0.00006936141,0.03521742],"genre_scores_gemma":[0.99618125,0.00029995522,0.0030713303,0.00006621861,0.0000381291,0.000013118182,0.000015206289,0.0000057848592,0.00030904796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801993,0.0012601212,0.00005903639,0.00026070743,0.0002882654,0.00011199719],"domain_scores_gemma":[0.9876057,0.00914898,0.001503545,0.0008693444,0.00036184292,0.00051061646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002750829,0.00025434233,0.0004643883,0.0020469998,0.0011113124,0.003272354,0.0006644004,0.0007030315,0.0020016334],"category_scores_gemma":[0.01465882,0.0002112316,0.000336552,0.0018870024,0.0046988586,0.007900801,0.0024940656,0.0013122589,0.000080479906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004475449,0.000029768655,0.017334105,0.000087607994,0.00004313189,0.00024305402,0.006430306,0.00815926,0.00060544483,0.95270526,0.0007080632,0.013609219],"study_design_scores_gemma":[0.000013615453,0.000026438356,0.014605725,0.00005588882,0.000024473786,0.00028426189,0.0031372532,0.039393146,0.00018481792,0.937223,0.005027982,0.000023402032],"about_ca_topic_score_codex":0.0020080197,"about_ca_topic_score_gemma":0.0016859142,"teacher_disagreement_score":0.003272354,"about_ca_system_score_codex":0.001331601,"about_ca_system_score_gemma":0.00043218117,"threshold_uncertainty_score":0.014547944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6661022,0.0014080437,0.3201207,0.001558121,0.00008111669,0.00009083642,0.00088191935,0.0002212053,0.009535913],"genre_scores_gemma":[0.9867547,0.0004586389,0.01045425,0.000072453906,0.000032946267,0.000059184014,0.00026937097,0.000018841234,0.0018796484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954635,0.00016987877,0.000019299627,0.00014303562,0.00007679678,0.000044543907],"domain_scores_gemma":[0.9978794,0.0011440485,0.000468501,0.00010126302,0.0002470081,0.00015990106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062324986,0.00029345314,0.00038906903,0.0024654053,0.0006177874,0.0013700735,0.0005976124,0.0006354226,0.0020598988],"category_scores_gemma":[0.0048078746,0.0002620104,0.00049944647,0.001581442,0.0007628295,0.002267884,0.00077098166,0.0004928114,0.00017227793],"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.00021105674,0.000114423914,0.06252372,0.00027743547,0.00035404967,0.001216555,0.001174046,0.5970175,0.0058802506,0.28117308,0.005686996,0.044370905],"study_design_scores_gemma":[0.000014596722,0.000028617695,0.010197909,0.000019832996,0.000043011492,0.00017818777,0.00019502541,0.9284152,0.00035086015,0.05859802,0.0019318556,0.000026988362],"about_ca_topic_score_codex":0.0059035756,"about_ca_topic_score_gemma":0.0047001676,"teacher_disagreement_score":0.0059035756,"about_ca_system_score_codex":0.001021399,"about_ca_system_score_gemma":0.00032540294,"threshold_uncertainty_score":0.0117384195},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85096097,0.0057565193,0.13171957,0.0010338301,0.0005736456,0.00047318698,0.0018940407,0.0028935191,0.004694717],"genre_scores_gemma":[0.84994984,0.0006234269,0.14280106,0.00010411598,0.00019668326,0.00014510745,0.0044404957,0.00020890794,0.0015304179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921674,0.0036567333,0.0005747617,0.0013416003,0.0018245084,0.00043490596],"domain_scores_gemma":[0.91251636,0.07163096,0.0019424923,0.004838934,0.0075592953,0.0015119608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014526265,0.0015564604,0.0019741904,0.0033615225,0.0013493167,0.0019936145,0.003126847,0.0028170873,0.0014011613],"category_scores_gemma":[0.053544376,0.00043805773,0.0010256696,0.0025641334,0.0006818021,0.003950665,0.0018260168,0.0011597201,0.0006040513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008223172,0.0033502034,0.03410708,0.0015515409,0.0013486128,0.00033989348,0.00034579597,0.45371518,0.009603851,0.0046789157,0.012798148,0.4699376],"study_design_scores_gemma":[0.000115051895,0.0003577322,0.0013469184,0.000021498428,0.000072909286,0.000098241624,0.000064687505,0.9936547,0.0022708883,0.0016421803,0.0003428845,0.000012222224],"about_ca_topic_score_codex":0.005225279,"about_ca_topic_score_gemma":0.0045624636,"teacher_disagreement_score":0.014526265,"about_ca_system_score_codex":0.0011430668,"about_ca_system_score_gemma":0.0012018576,"threshold_uncertainty_score":0.076823115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22308873,0.0016460825,0.7535734,0.0027257577,0.00010529192,0.00009923395,0.0005027222,0.00031116858,0.017947577],"genre_scores_gemma":[0.95306873,0.0014214723,0.040800333,0.000181937,0.00011952585,0.000174417,0.00026997182,0.00008450695,0.003879082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994609,0.00019463313,0.000024146339,0.00014294415,0.00012284129,0.000054472508],"domain_scores_gemma":[0.99481493,0.0032972405,0.0007306724,0.0004799399,0.00037820896,0.00029900036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001404255,0.0006142649,0.00052338245,0.0012098467,0.00062890566,0.0018362576,0.0009061599,0.0010495726,0.0017191923],"category_scores_gemma":[0.012759644,0.0005690606,0.00063025544,0.0006426255,0.0019344424,0.0030036173,0.0015135932,0.0014716975,0.00024967015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039429215,0.000022335136,0.0043635177,0.0001599659,0.00006295497,0.00029542993,0.0003892623,0.3644309,0.0037733433,0.61461693,0.002107648,0.009738349],"study_design_scores_gemma":[0.0000049592786,0.0000065281683,0.0009447933,0.000013507691,0.0000056865133,0.0000475658,0.00003523263,0.79318815,0.00028904673,0.20417425,0.0012806571,0.000009656687],"about_ca_topic_score_codex":0.00342479,"about_ca_topic_score_gemma":0.0020406884,"teacher_disagreement_score":0.00342479,"about_ca_system_score_codex":0.0016705905,"about_ca_system_score_gemma":0.0006455314,"threshold_uncertainty_score":0.012121022},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0834155,0.0035714356,0.8978975,0.0010579311,0.00025684776,0.00019116452,0.006401653,0.0033768266,0.0038311523],"genre_scores_gemma":[0.8212407,0.0021010877,0.15241025,0.00021501539,0.00083301537,0.00036899143,0.017308146,0.00027749003,0.005245216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986871,0.0003025836,0.000110715904,0.00052960834,0.000212558,0.00015749909],"domain_scores_gemma":[0.99548113,0.002855933,0.00050404517,0.00048711742,0.00052660634,0.00014518127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00254427,0.001196746,0.0010597126,0.004946317,0.00089831545,0.0013929689,0.0015816718,0.0010698156,0.0031785818],"category_scores_gemma":[0.00897596,0.00060091,0.001819878,0.004069405,0.00045644442,0.0028688046,0.0013186039,0.0020759434,0.0013694455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007046986,0.00050723105,0.0844292,0.00062881317,0.00055142015,0.0005169197,0.00086046825,0.27509767,0.0055380836,0.033605073,0.023718782,0.57384175],"study_design_scores_gemma":[0.000012345566,0.00003194717,0.003426663,0.000031713127,0.00004428299,0.00006579804,0.00007463807,0.9775509,0.00071518385,0.014859323,0.0031718484,0.000015412237],"about_ca_topic_score_codex":0.016572757,"about_ca_topic_score_gemma":0.017338961,"teacher_disagreement_score":0.016572757,"about_ca_system_score_codex":0.0010625478,"about_ca_system_score_gemma":0.0012776959,"threshold_uncertainty_score":0.032952547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049715858,0.000363631,0.9320574,0.00045714644,0.00013386291,0.0002721402,0.00014323082,0.004993889,0.011862821],"genre_scores_gemma":[0.79581296,0.00012985509,0.19349004,0.000094325114,0.000080027115,0.00020791333,0.00024408253,0.00027894246,0.009661729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710447,0.0010889359,0.00018712383,0.00060061127,0.00078353373,0.00023537767],"domain_scores_gemma":[0.9871552,0.0067353384,0.0007182243,0.0028272138,0.0020701734,0.00049389957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032131274,0.0009116681,0.00092809874,0.00092830433,0.00086777465,0.0019299752,0.0017167822,0.0015289488,0.01032861],"category_scores_gemma":[0.01952195,0.00053169054,0.00064793957,0.00053694466,0.00077002705,0.004286714,0.0024669783,0.002013133,0.0026757873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016209718,0.0012545241,0.0038590468,0.0005167461,0.00020176929,0.0003371057,0.0025058202,0.06649316,0.040505227,0.07058069,0.015137445,0.7969875],"study_design_scores_gemma":[0.00007693086,0.00039706103,0.0015029401,0.000054232667,0.00013051432,0.0002267602,0.00041579964,0.89326185,0.020698732,0.07511253,0.008041103,0.000081495295],"about_ca_topic_score_codex":0.0010251142,"about_ca_topic_score_gemma":0.0012797748,"teacher_disagreement_score":0.01032861,"about_ca_system_score_codex":0.00075053104,"about_ca_system_score_gemma":0.00083000155,"threshold_uncertainty_score":0.034552693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075430945,0.00063881086,0.92146516,0.000717089,0.00003140022,0.00004143525,0.00027347368,0.00026934172,0.0011322906],"genre_scores_gemma":[0.82249475,0.001162585,0.17301673,0.00017798663,0.00012326351,0.00014873553,0.00093715696,0.00011190162,0.0018269895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796706,0.0011379409,0.00010378559,0.00041312774,0.0002631229,0.00011497576],"domain_scores_gemma":[0.96733296,0.02849803,0.0019395648,0.00089162943,0.0009846058,0.00035321526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008601671,0.0010431325,0.0016138263,0.002522902,0.00092406065,0.00228781,0.0021975248,0.0023790027,0.0014154413],"category_scores_gemma":[0.04959601,0.0015634439,0.0010603449,0.0018010666,0.0017805734,0.0049291905,0.0016649957,0.0029840984,0.00033073837],"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.00006496397,0.00002808505,0.001955867,0.000045358473,0.000047667967,0.000040716463,0.00006933704,0.96206045,0.00035815677,0.025465794,0.000411239,0.009452369],"study_design_scores_gemma":[0.0000068393447,0.000002770253,0.00018070082,0.000005368018,0.0000041862413,0.000007809867,0.000005556139,0.9841265,0.00011065051,0.015456102,0.00008784771,0.0000055894993],"about_ca_topic_score_codex":0.013573523,"about_ca_topic_score_gemma":0.0115294205,"teacher_disagreement_score":0.013573523,"about_ca_system_score_codex":0.0024381229,"about_ca_system_score_gemma":0.0013475809,"threshold_uncertainty_score":0.045490503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86401033,0.00089481444,0.124619536,0.0008148175,0.00004049117,0.000108188586,0.0007540934,0.00027572332,0.00848201],"genre_scores_gemma":[0.98265576,0.00021419821,0.015437391,0.000025282354,0.000015044813,0.0000400837,0.00029884637,0.000021976648,0.0012914287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910957,0.0002843704,0.000037156922,0.00025801736,0.00021949624,0.00009138697],"domain_scores_gemma":[0.99126107,0.0041140593,0.0018559317,0.0006960202,0.0014863987,0.00058647123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021939352,0.00018322431,0.00026656655,0.002948636,0.0009550269,0.0016094467,0.0007080994,0.00067836954,0.002304928],"category_scores_gemma":[0.019799868,0.00032989692,0.00046975634,0.0017463713,0.0009058547,0.0032358773,0.0013553359,0.0006726146,0.0003325875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005767527,0.0002625241,0.30315694,0.00059678394,0.00031340774,0.0012614502,0.009475474,0.1299289,0.023249801,0.31723085,0.0055334056,0.20841381],"study_design_scores_gemma":[0.000043991542,0.00015507248,0.13857548,0.00014059208,0.00011700887,0.0009340623,0.0032686328,0.6837199,0.004644457,0.15288232,0.015416349,0.000102197984],"about_ca_topic_score_codex":0.007856993,"about_ca_topic_score_gemma":0.006625635,"teacher_disagreement_score":0.007856993,"about_ca_system_score_codex":0.0012095965,"about_ca_system_score_gemma":0.0006421317,"threshold_uncertainty_score":0.015622497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47858855,0.0015852418,0.4836816,0.002645211,0.00011155563,0.00024551968,0.00034025288,0.0007458389,0.032056216],"genre_scores_gemma":[0.9511275,0.00054881314,0.041267302,0.00015961124,0.000059221304,0.000086350745,0.00020952248,0.000069780006,0.0064719636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986089,0.0004416918,0.000057301044,0.00039831974,0.00030679742,0.00018707564],"domain_scores_gemma":[0.9941445,0.0019795634,0.0014520054,0.0009222293,0.0009862597,0.0005154612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013588604,0.0003003717,0.00038307332,0.0029355227,0.0020593882,0.0018757106,0.000950739,0.00086498604,0.0030765557],"category_scores_gemma":[0.009353954,0.00032604265,0.000412768,0.0019175557,0.002618427,0.00348666,0.0026328682,0.0012970497,0.00039502236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036041887,0.00014652655,0.04419011,0.00038780953,0.00015246062,0.0025936884,0.008100977,0.11025423,0.014806827,0.63052166,0.0085768225,0.17990848],"study_design_scores_gemma":[0.00003106814,0.00015328413,0.025270805,0.00013579054,0.00010915594,0.0021427523,0.004498039,0.57373995,0.008984833,0.34050623,0.044351272,0.000076845485],"about_ca_topic_score_codex":0.00479213,"about_ca_topic_score_gemma":0.0037152255,"teacher_disagreement_score":0.00479213,"about_ca_system_score_codex":0.0016391457,"about_ca_system_score_gemma":0.0007256565,"threshold_uncertainty_score":0.011892855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25432315,0.0011328112,0.73970443,0.0003795517,0.000021405513,0.00008309179,0.00028587866,0.0005314427,0.0035382411],"genre_scores_gemma":[0.8461807,0.0004485696,0.15177529,0.00009543542,0.000041089188,0.000077595105,0.00048153647,0.0000590353,0.0008408347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994979,0.00015300271,0.000027914799,0.00015827242,0.00011853436,0.00004438083],"domain_scores_gemma":[0.9958722,0.0022929774,0.00085515936,0.00037289577,0.00035882773,0.0002479145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085417664,0.0006097505,0.00070010737,0.0048023793,0.0009258413,0.0015055148,0.0009748511,0.0009910219,0.0010849868],"category_scores_gemma":[0.005527296,0.00037627813,0.0005439698,0.0022651162,0.0013191283,0.002947603,0.0015577199,0.0008787069,0.00023893527],"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.00037754944,0.000220339,0.035479132,0.0005378319,0.00017550973,0.0006554405,0.0011557122,0.64475983,0.022454374,0.13021663,0.0036039385,0.16036366],"study_design_scores_gemma":[0.000005727366,0.00001994186,0.0020288967,0.000014020456,0.000009156914,0.00013099829,0.00013601143,0.9539915,0.0013282115,0.041498113,0.00082464237,0.000012845529],"about_ca_topic_score_codex":0.0024128214,"about_ca_topic_score_gemma":0.0031762617,"teacher_disagreement_score":0.0048023793,"about_ca_system_score_codex":0.0008789992,"about_ca_system_score_gemma":0.00045623654,"threshold_uncertainty_score":0.0063776374},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97918016,0.00010427711,0.017537558,0.00008690687,0.000004243992,0.000015064161,0.00039726647,0.00010542151,0.0025691497],"genre_scores_gemma":[0.9926502,0.00005053538,0.006378214,0.0000073918504,0.0000018924371,0.000012745482,0.0002613514,0.000013810098,0.0006238275],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994715,0.0001413903,0.000030045308,0.00014275264,0.00013572666,0.00007871184],"domain_scores_gemma":[0.9980981,0.00070982985,0.00061837723,0.00019937384,0.00018883217,0.00018558609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050446886,0.00019197253,0.00025644834,0.001977055,0.00042275203,0.0011101094,0.00034887038,0.00026908607,0.0027926671],"category_scores_gemma":[0.003542913,0.00019817249,0.00018840544,0.0012445474,0.00055473443,0.001080642,0.00082681014,0.00043029265,0.00037296768],"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.00033583192,0.000085539265,0.76777315,0.00022910125,0.00026594743,0.001149642,0.015267068,0.010980554,0.049445044,0.032112375,0.0018215505,0.12053432],"study_design_scores_gemma":[0.000007529007,0.00011007856,0.8990592,0.000050821982,0.000076430035,0.0007015571,0.0074751684,0.05386119,0.0077802776,0.024768133,0.006041266,0.000068231646],"about_ca_topic_score_codex":0.0047338367,"about_ca_topic_score_gemma":0.0092680445,"teacher_disagreement_score":0.0047338367,"about_ca_system_score_codex":0.0005891175,"about_ca_system_score_gemma":0.00025281194,"threshold_uncertainty_score":0.009412527},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07473098,0.00077536947,0.91328245,0.003462852,0.000100813275,0.00023199253,0.00086403,0.00053614215,0.0060153916],"genre_scores_gemma":[0.816846,0.00069922354,0.17373772,0.0011142222,0.0006878857,0.00046428473,0.0018019382,0.00026827725,0.004380527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.985993,0.0052791294,0.00077127357,0.0048398026,0.002219418,0.00089735736],"domain_scores_gemma":[0.8649201,0.113828905,0.005542275,0.009826507,0.0045159557,0.001366297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013806079,0.0015682693,0.0040065427,0.0032171444,0.0022593604,0.003930442,0.0058389837,0.0052847494,0.0054001245],"category_scores_gemma":[0.12580928,0.0022394357,0.0020923335,0.0046980553,0.0033136082,0.015022126,0.0036232464,0.004133552,0.0010672493],"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.0010818148,0.00051318883,0.03461406,0.0007534005,0.00077602867,0.0013470106,0.0014103893,0.41350386,0.0025795354,0.3813016,0.014400303,0.14771886],"study_design_scores_gemma":[0.00006722488,0.0000493522,0.0013547391,0.000031338892,0.0000599818,0.00021604335,0.000077293356,0.80387414,0.0008570425,0.19172134,0.0016644611,0.000027123466],"about_ca_topic_score_codex":0.008031444,"about_ca_topic_score_gemma":0.0063573266,"teacher_disagreement_score":0.013806079,"about_ca_system_score_codex":0.0024766936,"about_ca_system_score_gemma":0.0017617204,"threshold_uncertainty_score":0.07301438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96112204,0.00012375959,0.030784218,0.00028127592,0.00004128895,0.00017088385,0.0013999827,0.00033567153,0.005740862],"genre_scores_gemma":[0.983479,0.00007476969,0.013277377,0.000017219363,0.00001930043,0.00011405551,0.0013293016,0.00003804235,0.0016508708],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99774545,0.0011943058,0.00008399678,0.00030440587,0.00049509946,0.00017663435],"domain_scores_gemma":[0.97471267,0.020576395,0.0014579494,0.0007030081,0.0019879611,0.0005620724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022798132,0.000370563,0.00029132393,0.0047303177,0.0009954964,0.00093007454,0.0004190952,0.0006005862,0.002179511],"category_scores_gemma":[0.01208636,0.000155409,0.00034471563,0.0027796426,0.0004074616,0.0018282727,0.0006017356,0.0004841861,0.00039114195],"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.00339497,0.0012057727,0.28890723,0.0014440228,0.000418131,0.004858286,0.063572,0.059638243,0.07367278,0.022363104,0.013407949,0.46711755],"study_design_scores_gemma":[0.00006728232,0.00090838043,0.37847182,0.00022712878,0.00020863468,0.0010956271,0.027361328,0.52519614,0.019455925,0.014986898,0.031825442,0.00019537867],"about_ca_topic_score_codex":0.0035242576,"about_ca_topic_score_gemma":0.0042385473,"teacher_disagreement_score":0.0047303177,"about_ca_system_score_codex":0.00067756546,"about_ca_system_score_gemma":0.00035539828,"threshold_uncertainty_score":0.012056947},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38446024,0.006786486,0.53963596,0.005782349,0.00017228605,0.00012104301,0.00094684976,0.00031530685,0.061779425],"genre_scores_gemma":[0.9762807,0.004055698,0.014077551,0.00014366853,0.00011342886,0.00009482444,0.00019441596,0.00005345149,0.0049860943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996996,0.00010951179,0.000012304343,0.00006415256,0.00007414017,0.000040315575],"domain_scores_gemma":[0.9972723,0.001679344,0.0005889166,0.00012257068,0.00022845775,0.00010833445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008233383,0.00035047618,0.00025257992,0.0013393282,0.0004750505,0.0015056201,0.00071765285,0.0009466178,0.002156566],"category_scores_gemma":[0.008412361,0.00032298046,0.00044641344,0.0007987688,0.001452609,0.0028007245,0.00072428817,0.0009279339,0.00021263376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027539038,0.00002165191,0.004665934,0.00013913745,0.000032740863,0.00033014212,0.00058311044,0.27743974,0.0042170286,0.7003068,0.00198867,0.01024757],"study_design_scores_gemma":[0.000008531056,0.000020744634,0.003930087,0.000057790745,0.000018284796,0.00036087507,0.0002334493,0.6666116,0.00072963274,0.32209155,0.005914051,0.000023408074],"about_ca_topic_score_codex":0.0036493766,"about_ca_topic_score_gemma":0.0019622683,"teacher_disagreement_score":0.0036493766,"about_ca_system_score_codex":0.0012871835,"about_ca_system_score_gemma":0.00045315243,"threshold_uncertainty_score":0.009339154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98663795,0.00019191444,0.006765843,0.0003681143,0.000018198787,0.00011257832,0.00029909177,0.00003763558,0.0055685793],"genre_scores_gemma":[0.9912612,0.00016742507,0.0069371355,0.000047319627,0.000007102457,0.00012508243,0.00022795165,0.000008985267,0.0012178093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952304,0.00027696928,0.000021408989,0.000055559925,0.000049143815,0.000073917625],"domain_scores_gemma":[0.9922065,0.0066764476,0.00027650985,0.00017260693,0.00040539523,0.0002625676],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013168218,0.0005782179,0.0006716234,0.0010606681,0.0008723713,0.0013171241,0.0010284318,0.0017464479,0.0026617467],"category_scores_gemma":[0.004788238,0.0003463845,0.000749159,0.001043305,0.0006709091,0.0010042359,0.0008455463,0.0010146091,0.0001484698],"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.00011623207,0.00045671058,0.012457615,0.00005296238,0.00007221688,0.00011460797,0.00017145873,0.9798875,0.0003390056,0.0027819132,0.00033520756,0.0032146003],"study_design_scores_gemma":[0.000021488999,0.000083773026,0.00160469,0.000009376208,0.000019286215,0.000008790208,0.0001847768,0.99713767,0.00012756877,0.00049491134,0.00030065837,0.000007007363],"about_ca_topic_score_codex":0.120889254,"about_ca_topic_score_gemma":0.093929455,"teacher_disagreement_score":0.9991276,"about_ca_system_score_codex":0.003115771,"about_ca_system_score_gemma":0.0023373398,"threshold_uncertainty_score":0.24037117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013782094,0.00037849942,0.9829928,0.0004439677,0.000029837309,0.000033076125,0.000028056756,0.00005469383,0.0022570333],"genre_scores_gemma":[0.7917797,0.001989173,0.19977988,0.00026571736,0.00012891562,0.00031395568,0.00015348608,0.00009726524,0.0054919133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996526,0.00012345648,0.000017377666,0.00006304879,0.00011734318,0.000026139838],"domain_scores_gemma":[0.9990596,0.0004810977,0.00016218732,0.00009595078,0.00014664496,0.000054556833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006987319,0.00068105326,0.00059801555,0.00077088067,0.0005428952,0.0010474798,0.0014865092,0.0010260732,0.0008649741],"category_scores_gemma":[0.0023785469,0.0003093775,0.0007885702,0.00075726333,0.0009104164,0.0022277473,0.0010449393,0.0010404771,0.00016265154],"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.0000101444775,0.000019884097,0.0004034473,0.000038295955,0.000022310667,0.000058115307,0.000077885175,0.9152393,0.0012058744,0.07385947,0.00035434272,0.008711084],"study_design_scores_gemma":[0.0000021062672,0.00000811093,0.000052224987,0.0000031578916,0.0000045080274,0.000020012027,0.000013236506,0.9800764,0.00018201733,0.019043967,0.000589946,0.0000043221835],"about_ca_topic_score_codex":0.0018488027,"about_ca_topic_score_gemma":0.001402974,"teacher_disagreement_score":0.0018488027,"about_ca_system_score_codex":0.00122523,"about_ca_system_score_gemma":0.0005526272,"threshold_uncertainty_score":0.008889735},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053266898,0.002297778,0.94032794,0.00044954597,0.000042799333,0.00006613552,0.00010004335,0.00025264558,0.0031962637],"genre_scores_gemma":[0.53028506,0.0018704513,0.4647678,0.0001241383,0.00017548296,0.00015922962,0.0002389369,0.00010716679,0.0022717067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998982,0.00042527134,0.000037972513,0.00019860589,0.00029019965,0.00006590184],"domain_scores_gemma":[0.9963612,0.0025538923,0.00044011095,0.00023603653,0.00029584306,0.00011289582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001854735,0.0006573297,0.0006259946,0.0032139963,0.0006600331,0.0014851813,0.0015805922,0.0011648507,0.00129734],"category_scores_gemma":[0.0109101925,0.00046846067,0.0005482177,0.0023385587,0.0019847758,0.003964759,0.0017719235,0.001097194,0.00036441092],"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.00021543493,0.0000850672,0.0047273147,0.00032541587,0.00015203263,0.0001239327,0.0005161529,0.36895052,0.007927462,0.35157806,0.0024455131,0.26295313],"study_design_scores_gemma":[0.000031474137,0.00006421715,0.0017435245,0.00003927815,0.00003536917,0.00022488541,0.00009078466,0.69625753,0.002666219,0.29430088,0.004510546,0.000035363537],"about_ca_topic_score_codex":0.00085015694,"about_ca_topic_score_gemma":0.0008884689,"teacher_disagreement_score":0.0032139963,"about_ca_system_score_codex":0.00090997276,"about_ca_system_score_gemma":0.00045842188,"threshold_uncertainty_score":0.009808898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930311,0.00012328921,0.0045076385,0.000086087646,0.000004644848,0.000030363006,0.00042866298,0.000066436696,0.0017219868],"genre_scores_gemma":[0.99683905,0.00006788353,0.0024388423,0.00001619515,0.0000051090615,0.000016167944,0.00039604952,0.000007632318,0.00021308141],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99908686,0.00029059764,0.00007326154,0.0001873484,0.0002323531,0.00012958942],"domain_scores_gemma":[0.991738,0.0034830442,0.0026123717,0.0005415425,0.0010627325,0.00056234177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015837098,0.0003347024,0.00028202546,0.0033952568,0.00046967846,0.0014516701,0.00043691337,0.00063009746,0.0008058586],"category_scores_gemma":[0.008308177,0.00019102487,0.00023839188,0.0019070049,0.00045622242,0.003030532,0.0010733948,0.00040229456,0.00029533813],"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.00010877971,0.0001937123,0.93394333,0.000100639525,0.00013274414,0.00011340853,0.001183227,0.019906936,0.005573969,0.00187359,0.0006708601,0.036198735],"study_design_scores_gemma":[0.0000084032245,0.00046922895,0.7397023,0.000056546964,0.00007610692,0.00036270803,0.0030100946,0.24162991,0.0057163322,0.006222698,0.0026900966,0.00005556553],"about_ca_topic_score_codex":0.0027815916,"about_ca_topic_score_gemma":0.0030958066,"teacher_disagreement_score":0.0033952568,"about_ca_system_score_codex":0.0007808272,"about_ca_system_score_gemma":0.0003265765,"threshold_uncertainty_score":0.008375585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012247643,0.001386577,0.9700875,0.0020092425,0.00021551864,0.00022247764,0.0013390966,0.0006047226,0.011887102],"genre_scores_gemma":[0.4020169,0.0031248648,0.57489926,0.0010576933,0.0007414433,0.0010154824,0.0029546095,0.00021871764,0.01397104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923941,0.0029666713,0.00067379436,0.0019267777,0.0017867187,0.0002518588],"domain_scores_gemma":[0.9900047,0.0052044746,0.0014675178,0.001806445,0.0010899001,0.00042685703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004186319,0.0013802022,0.0013449941,0.0045105824,0.0022631513,0.005531559,0.0019365435,0.0022967325,0.0071459073],"category_scores_gemma":[0.018869951,0.0007973231,0.0015837115,0.0059218635,0.0034095724,0.018285263,0.0038308182,0.002226746,0.0018623563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042323805,0.00003091286,0.0005486034,0.0001860735,0.000069798,0.00029990257,0.00041978905,0.008467022,0.0006770934,0.9554589,0.0030275816,0.030772101],"study_design_scores_gemma":[0.000017947788,0.000021544123,0.00020279764,0.000057581106,0.000038325037,0.00031338734,0.000168883,0.044736132,0.00043984354,0.9277337,0.02624436,0.000025435515],"about_ca_topic_score_codex":0.0014484643,"about_ca_topic_score_gemma":0.0016113151,"teacher_disagreement_score":0.0071459073,"about_ca_system_score_codex":0.0014706384,"about_ca_system_score_gemma":0.0014185187,"threshold_uncertainty_score":0.023905456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9098974,0.0003871526,0.08441842,0.00037886976,0.00002544585,0.00002556755,0.00012453484,0.000088190594,0.004654333],"genre_scores_gemma":[0.9976574,0.000061960294,0.0017294467,0.000016919388,0.0000061499495,0.000008384752,0.00001458203,0.0000043858545,0.0005006888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970883,0.00009917302,0.0000106543475,0.00005248822,0.000056949568,0.000071961964],"domain_scores_gemma":[0.99559385,0.0025388643,0.0010138116,0.00024388358,0.00031199525,0.00029755523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010793781,0.00024768375,0.00026210037,0.00053987186,0.00051412504,0.0010661316,0.0005600284,0.0005423137,0.0008099982],"category_scores_gemma":[0.0074195885,0.00022669036,0.00018148315,0.00040317047,0.0009663924,0.0014951192,0.0006339182,0.00046780918,0.00009719184],"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.0003512684,0.0001306213,0.019486861,0.0001765644,0.000085247906,0.0016091244,0.0007550159,0.49091867,0.038960613,0.42529896,0.0026903711,0.0195367],"study_design_scores_gemma":[0.0000096808935,0.000027378406,0.0031497497,0.000009706336,0.000018176726,0.00017911119,0.00012743202,0.9455814,0.003467371,0.046939746,0.00047024427,0.000020102501],"about_ca_topic_score_codex":0.0014417912,"about_ca_topic_score_gemma":0.0018464292,"teacher_disagreement_score":0.0014417912,"about_ca_system_score_codex":0.0008458723,"about_ca_system_score_gemma":0.000302907,"threshold_uncertainty_score":0.0061373115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07695448,0.0018472004,0.9144939,0.000921631,0.000041571682,0.0002336623,0.00042104317,0.0004829121,0.004603607],"genre_scores_gemma":[0.81511813,0.0022317294,0.17771359,0.00023337435,0.0002276493,0.00048572224,0.00092958054,0.00022229546,0.0028379592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997449,0.0011279435,0.00009998182,0.0005675595,0.0005120234,0.0002434623],"domain_scores_gemma":[0.9856332,0.012074484,0.0009498539,0.00052269205,0.00047122026,0.0003485396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030428926,0.0020068495,0.0023297512,0.0022101526,0.0010492677,0.0019211338,0.002964328,0.0023649796,0.0016573092],"category_scores_gemma":[0.014873197,0.0011690173,0.0012466308,0.0026825608,0.0015761025,0.004227543,0.0022097414,0.0014636933,0.00036182764],"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.00022366246,0.0001257052,0.0026997337,0.00045688846,0.00014789222,0.00025778133,0.00029946817,0.9046268,0.0029294493,0.018436145,0.003303505,0.066492945],"study_design_scores_gemma":[0.000017843124,0.000045436223,0.00040469956,0.000017448316,0.000029317567,0.00008286416,0.000043809458,0.9805002,0.0011121604,0.017031591,0.0007049078,0.0000098154915],"about_ca_topic_score_codex":0.0035736167,"about_ca_topic_score_gemma":0.0028378912,"teacher_disagreement_score":0.0035736167,"about_ca_system_score_codex":0.0019787531,"about_ca_system_score_gemma":0.0010018297,"threshold_uncertainty_score":0.016092539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930871,0.00020508553,0.00073733967,0.00036458534,0.00003500812,0.00005965114,0.00034876575,0.00006572234,0.005096679],"genre_scores_gemma":[0.99835205,0.0001067387,0.0005521065,0.000045533066,0.000037378082,0.000023844916,0.00017949968,0.000026448948,0.00067652314],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987733,0.00055004767,0.00006909252,0.00017725478,0.00020452062,0.00022575329],"domain_scores_gemma":[0.9765152,0.017373268,0.0026160113,0.0010683469,0.0013420432,0.001085145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012118055,0.0004465939,0.0002818502,0.0011937511,0.000926042,0.0021815256,0.00035858602,0.00067512866,0.003488211],"category_scores_gemma":[0.01841386,0.0002736087,0.00044347055,0.0009200682,0.00053999876,0.0019912887,0.0013741585,0.0006933566,0.0010728887],"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.003681642,0.0006570379,0.8173621,0.00050121377,0.00023305358,0.0015230634,0.0057720444,0.010240667,0.027538253,0.002798512,0.003895127,0.1257972],"study_design_scores_gemma":[0.000084331885,0.0013352179,0.9212328,0.0001270209,0.00021354624,0.00073919137,0.005754257,0.051637247,0.01091773,0.0023174246,0.005519937,0.00012119241],"about_ca_topic_score_codex":0.0031626099,"about_ca_topic_score_gemma":0.0035478754,"teacher_disagreement_score":0.003488211,"about_ca_system_score_codex":0.00051642855,"about_ca_system_score_gemma":0.0003088912,"threshold_uncertainty_score":0.011669219},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18404059,0.003146794,0.78115404,0.0013588369,0.0005967538,0.00021370137,0.009451782,0.004841408,0.015196095],"genre_scores_gemma":[0.8663896,0.0015536277,0.107758194,0.00019657149,0.0008367604,0.00014021882,0.007597437,0.00021415163,0.015313515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804974,0.000493246,0.00008260922,0.00039174227,0.00076878647,0.00021391982],"domain_scores_gemma":[0.99602014,0.0013949238,0.00037573377,0.0012699212,0.0007365622,0.00020279855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052553,0.0008779073,0.0012125745,0.0022996573,0.0005424426,0.0014987148,0.001251669,0.0011140406,0.0024041245],"category_scores_gemma":[0.008956686,0.0005921504,0.0004396444,0.0023685892,0.00027788334,0.0039825463,0.0018970219,0.0013204626,0.004135647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006048938,0.0006036793,0.061382737,0.00032629922,0.00027795075,0.000287949,0.00030408747,0.09856377,0.019078275,0.018214608,0.046854597,0.7535011],"study_design_scores_gemma":[0.000006424127,0.000052934196,0.010387163,0.000036663263,0.000035528272,0.00034395716,0.00010969475,0.9578083,0.0061625447,0.017597796,0.007431289,0.000027638484],"about_ca_topic_score_codex":0.0022270724,"about_ca_topic_score_gemma":0.0044164867,"teacher_disagreement_score":0.0024041245,"about_ca_system_score_codex":0.0005240541,"about_ca_system_score_gemma":0.00046429114,"threshold_uncertainty_score":0.008042574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04610372,0.0026595227,0.94359034,0.0010694582,0.00010277761,0.0002999367,0.0011046341,0.0013275871,0.0037420643],"genre_scores_gemma":[0.72157186,0.0020119988,0.26597893,0.00031651597,0.00027463664,0.00036979414,0.0023155115,0.00015266033,0.0070079477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763584,0.0009281281,0.0001225728,0.00057177397,0.00059255294,0.00014915907],"domain_scores_gemma":[0.9924035,0.0055311974,0.00054760027,0.00058732857,0.0007308474,0.00019949449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026757773,0.0013460213,0.0019336445,0.0037396352,0.0011458849,0.0016561932,0.0030526114,0.0018760257,0.0027827902],"category_scores_gemma":[0.013359246,0.0007593322,0.0012588468,0.0045844773,0.0008141657,0.004524367,0.0011048976,0.00208023,0.0010735722],"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.00024467066,0.00039489838,0.008733284,0.00031422882,0.00017129416,0.0001925363,0.00021932022,0.6956327,0.0008642501,0.02137513,0.010101044,0.2617567],"study_design_scores_gemma":[0.000008784374,0.00001580848,0.00038192674,0.000011037128,0.000010641638,0.000024500861,0.000017515154,0.99152654,0.00014725172,0.0072027086,0.0006441475,0.000009157225],"about_ca_topic_score_codex":0.03583204,"about_ca_topic_score_gemma":0.0469535,"teacher_disagreement_score":0.03583204,"about_ca_system_score_codex":0.0028966377,"about_ca_system_score_gemma":0.0013277074,"threshold_uncertainty_score":0.07124698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32391077,0.0011337936,0.64456517,0.0014488205,0.00006790618,0.000054820768,0.00054731156,0.00045455797,0.02781689],"genre_scores_gemma":[0.9822349,0.0004625564,0.014498088,0.00006125706,0.000031591127,0.0000584091,0.0001626458,0.000042053005,0.002448513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928004,0.00027766163,0.000019564528,0.00014786959,0.00018584273,0.00008905495],"domain_scores_gemma":[0.994966,0.003263506,0.0007341594,0.00036053354,0.00045365546,0.00022208194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012477605,0.00041401843,0.00049475225,0.0019430445,0.0005853304,0.001672759,0.0017760339,0.0010667036,0.0034607123],"category_scores_gemma":[0.012458925,0.00030970274,0.00032221002,0.0023059477,0.0014311315,0.002704302,0.0009528706,0.00082228216,0.00064522575],"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.00007214312,0.000029123725,0.0033618833,0.00006483701,0.000025212106,0.00021199704,0.00022846977,0.54004276,0.0013344766,0.44350106,0.0016383801,0.009489729],"study_design_scores_gemma":[0.0000073992037,0.000015476737,0.00081727153,0.000015071003,0.0000065852887,0.00015605807,0.00005292127,0.8113858,0.00031980878,0.18621595,0.0009864124,0.000021180354],"about_ca_topic_score_codex":0.001950011,"about_ca_topic_score_gemma":0.0016041923,"teacher_disagreement_score":0.0034607123,"about_ca_system_score_codex":0.0021454145,"about_ca_system_score_gemma":0.00043121076,"threshold_uncertainty_score":0.015566111},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16894598,0.000342469,0.82434,0.00033071756,0.000045171215,0.00008216877,0.00059526745,0.00037981302,0.0049383165],"genre_scores_gemma":[0.885599,0.00065344595,0.10941923,0.00014747099,0.00008660894,0.0001243053,0.0007064904,0.00014756019,0.0031159823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995702,0.00014656773,0.000021446782,0.00009234995,0.000117583295,0.000051773695],"domain_scores_gemma":[0.9959145,0.0025127535,0.0006767839,0.00026649327,0.00046211274,0.0001673162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008719898,0.0003396502,0.000316164,0.0028851111,0.0002854058,0.0011078238,0.00039164038,0.00057045,0.0026280244],"category_scores_gemma":[0.006681297,0.0002695231,0.00032580772,0.001799459,0.0008089095,0.0016939597,0.00049661007,0.0006203218,0.0005095903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040580734,0.000104816696,0.023975298,0.00038525357,0.00015421126,0.0011993131,0.001098895,0.33474976,0.04787553,0.42724863,0.0057939054,0.15700857],"study_design_scores_gemma":[0.000019748377,0.000059204664,0.010196655,0.000021336557,0.000026923237,0.0006500788,0.00015725204,0.7967225,0.0044365404,0.18395917,0.0037159452,0.000034739496],"about_ca_topic_score_codex":0.0009798622,"about_ca_topic_score_gemma":0.00059416954,"teacher_disagreement_score":0.0028851111,"about_ca_system_score_codex":0.00049859716,"about_ca_system_score_gemma":0.00028635567,"threshold_uncertainty_score":0.0087916255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9981102,0.000048574275,0.0011878985,0.00005362277,0.0000025211357,0.0000045852453,0.00003445621,0.000013154355,0.000545047],"genre_scores_gemma":[0.9996419,0.000011339222,0.00021002574,0.0000075995763,0.0000010928137,0.0000026704972,0.000017880164,0.0000033603044,0.000104093306],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997689,0.000074963675,0.000013098537,0.000059511953,0.00002493163,0.000058542893],"domain_scores_gemma":[0.9956191,0.0023056858,0.0010053559,0.00024164384,0.0002875739,0.0005405462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000587077,0.00019640576,0.000211658,0.00046094452,0.00051477086,0.001173394,0.00035922465,0.0004848627,0.0017756984],"category_scores_gemma":[0.006531872,0.00018122204,0.00023394972,0.00027439737,0.0004967613,0.0011733779,0.0007231895,0.00044402407,0.00012726152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013192442,0.0005669784,0.70992494,0.00024323355,0.00095356704,0.00051977386,0.0016520208,0.1362873,0.084594406,0.009827187,0.0013082364,0.05280304],"study_design_scores_gemma":[0.00007909163,0.000541895,0.61335963,0.000040212555,0.00048323892,0.0003122433,0.0009277086,0.35437977,0.0066451128,0.02203809,0.0011169633,0.000076022596],"about_ca_topic_score_codex":0.0033026233,"about_ca_topic_score_gemma":0.0047952854,"teacher_disagreement_score":0.0033026233,"about_ca_system_score_codex":0.0005820578,"about_ca_system_score_gemma":0.00018363813,"threshold_uncertainty_score":0.0065668225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9782551,0.00071781775,0.00025108346,0.001289608,0.00008858757,0.00001408517,0.00033880465,0.00001943292,0.01902544],"genre_scores_gemma":[0.9955497,0.0006214445,0.00014182196,0.00022161163,0.00007860918,0.000014111441,0.00015719833,0.000010704236,0.0032048495],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99960643,0.00017184566,0.000010017386,0.000040444942,0.00008303593,0.000088264926],"domain_scores_gemma":[0.9991204,0.00035449295,0.00025243664,0.000041938172,0.0001105573,0.000120292534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005362319,0.00023809023,0.00013870555,0.0014770953,0.0025176601,0.0017651251,0.0002057583,0.00052332727,0.0032018607],"category_scores_gemma":[0.001757326,0.00014602247,0.00012049741,0.0018111082,0.0011193079,0.0011643243,0.0012400239,0.00053143443,0.000686684],"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.00044241128,0.0004286039,0.43197852,0.0005440686,0.00014425987,0.0045824214,0.35261697,0.0009323845,0.007126449,0.0116514955,0.051372956,0.13817953],"study_design_scores_gemma":[0.000010451843,0.00008474842,0.6756555,0.00019107424,0.000022079232,0.00066208135,0.23563986,0.000902821,0.00080642675,0.0009960245,0.084997185,0.000031767537],"about_ca_topic_score_codex":0.011256576,"about_ca_topic_score_gemma":0.021852175,"teacher_disagreement_score":0.011256576,"about_ca_system_score_codex":0.00076987705,"about_ca_system_score_gemma":0.00038463972,"threshold_uncertainty_score":0.02238208},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9451699,0.00027506126,0.051297355,0.0003979518,0.000011037583,0.000016170165,0.000024772093,0.00005797179,0.00274981],"genre_scores_gemma":[0.9983897,0.000046192872,0.001355031,0.000011834812,0.00000505293,0.000005312973,0.0000074997915,0.0000037282318,0.0001756481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958354,0.00019178067,0.000017097007,0.000069288784,0.00008425495,0.000054054617],"domain_scores_gemma":[0.9924205,0.004619373,0.0014802928,0.00052138936,0.0004256828,0.0005327916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013905016,0.00016903803,0.00045431615,0.00084429194,0.00061979523,0.0012294175,0.00057904184,0.0006315374,0.0009470008],"category_scores_gemma":[0.01389568,0.0002138741,0.00028449652,0.00044544705,0.0018557637,0.0017529282,0.00093072525,0.0005583296,0.000118860604],"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.000516557,0.00032217195,0.06432629,0.0002634099,0.00025045653,0.0006722624,0.0018159534,0.54658383,0.022488752,0.31814682,0.002004171,0.04260935],"study_design_scores_gemma":[0.000034138335,0.00010147657,0.011869296,0.00002202821,0.000031805805,0.00013340879,0.00026465702,0.884649,0.0023553215,0.099762544,0.000753206,0.00002311837],"about_ca_topic_score_codex":0.0016836663,"about_ca_topic_score_gemma":0.0011681236,"teacher_disagreement_score":0.0016836663,"about_ca_system_score_codex":0.00085070916,"about_ca_system_score_gemma":0.00031753967,"threshold_uncertainty_score":0.0073537827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15983626,0.0005902982,0.8331772,0.00041474466,0.00004624221,0.00014001716,0.0002351188,0.0006291991,0.0049308636],"genre_scores_gemma":[0.70216906,0.0001556609,0.2937462,0.00011323557,0.000016171847,0.00015636258,0.0003869402,0.00012813063,0.0031282853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996106,0.00016702115,0.000013327032,0.000072506235,0.00008320622,0.000053415555],"domain_scores_gemma":[0.99925953,0.00046118294,0.000047632162,0.000023835542,0.00017874988,0.000028974744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011328727,0.0007205314,0.00059818965,0.00088764256,0.00069396215,0.0008304473,0.0007135454,0.0006538327,0.001121475],"category_scores_gemma":[0.0028405304,0.0003434671,0.00046710134,0.00087118807,0.00039416752,0.00051425054,0.0004583913,0.0005589065,0.00013596268],"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.00006974883,0.000027253487,0.0013680984,0.00004359604,0.000033781995,0.000029357558,0.00004611449,0.9649375,0.0009415415,0.0019507835,0.0011492387,0.029403027],"study_design_scores_gemma":[0.0000025230895,0.0000060693164,0.00029597856,0.000002241383,0.0000023485932,0.0000037070395,0.000010210613,0.998877,0.00019680901,0.00047999158,0.000120859026,0.0000023380048],"about_ca_topic_score_codex":0.091140874,"about_ca_topic_score_gemma":0.08764417,"teacher_disagreement_score":0.90885913,"about_ca_system_score_codex":0.0019169024,"about_ca_system_score_gemma":0.0023750204,"threshold_uncertainty_score":0.18122071},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.937702,0.0028950702,0.008160838,0.0016136076,0.000100594865,0.00007138375,0.009571881,0.00033752032,0.039547153],"genre_scores_gemma":[0.99194264,0.00069784385,0.0014376773,0.000057522448,0.00007528761,0.000038791455,0.0037441123,0.00006876346,0.0019372427],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990496,0.0003264754,0.000050088493,0.00011231243,0.00032566252,0.00013588755],"domain_scores_gemma":[0.9894671,0.007150572,0.0010121695,0.0004637487,0.0015387279,0.00036775076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012506614,0.00026742416,0.000330267,0.0069281384,0.000987838,0.0011666201,0.00025830916,0.00041663667,0.0037288317],"category_scores_gemma":[0.010396876,0.00014531879,0.00037453024,0.0098144915,0.0005120348,0.0027593644,0.00065292045,0.0003525618,0.00067168486],"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.0009681306,0.00013236082,0.712144,0.0007464909,0.00036864117,0.0019967398,0.0049923426,0.037841424,0.0031390907,0.0711815,0.0358065,0.1306827],"study_design_scores_gemma":[0.000022262528,0.0001461979,0.6568926,0.00024607158,0.00014596246,0.0011950769,0.007046171,0.23660679,0.0024814778,0.015701411,0.0793813,0.0001346607],"about_ca_topic_score_codex":0.01016389,"about_ca_topic_score_gemma":0.010587553,"teacher_disagreement_score":0.01016389,"about_ca_system_score_codex":0.001048284,"about_ca_system_score_gemma":0.00033393266,"threshold_uncertainty_score":0.020209491},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56933784,0.0009742924,0.41655582,0.0006974268,0.000046170393,0.00009678778,0.0020199756,0.0008997302,0.009371993],"genre_scores_gemma":[0.9734884,0.0002591264,0.02367828,0.00003210747,0.000030923657,0.00009700314,0.0012419759,0.00007479627,0.0010974808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989975,0.00039618477,0.00003954826,0.00021464063,0.00028074218,0.00007139437],"domain_scores_gemma":[0.9775924,0.01800128,0.0019616936,0.00096300937,0.0011361609,0.00034545796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016664974,0.0003589535,0.000365746,0.0024859302,0.00033803534,0.0007953562,0.0005916212,0.0003645263,0.0021237643],"category_scores_gemma":[0.021580271,0.00019190591,0.00034187842,0.002789531,0.000653776,0.001466853,0.00058938935,0.00050151476,0.00028411162],"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.0002620565,0.00013081837,0.08214777,0.0004007041,0.0003306662,0.00060731824,0.00093821576,0.5642044,0.0075945053,0.2509125,0.010900635,0.08157044],"study_design_scores_gemma":[0.000008596505,0.00005923302,0.020402173,0.000030385465,0.000034083892,0.00023381044,0.00019408521,0.89984626,0.001965574,0.07439254,0.0027972935,0.000036004225],"about_ca_topic_score_codex":0.0015901944,"about_ca_topic_score_gemma":0.0023129012,"teacher_disagreement_score":0.0024859302,"about_ca_system_score_codex":0.00089819904,"about_ca_system_score_gemma":0.0004046383,"threshold_uncertainty_score":0.008813381},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2915117,0.0008739421,0.6916779,0.0020411066,0.00007499061,0.00008707603,0.00044083124,0.0002972412,0.012995173],"genre_scores_gemma":[0.9565437,0.0006624687,0.0389979,0.00012200902,0.00006832224,0.0001290053,0.00022609202,0.000072053255,0.0031784186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994814,0.000182596,0.00002216472,0.00013637362,0.000120351935,0.000057119458],"domain_scores_gemma":[0.9944825,0.00359143,0.0007264421,0.0005057594,0.00038639153,0.00030745857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012535141,0.00054701976,0.00049400463,0.0010236152,0.00062331493,0.0016957741,0.0008181051,0.0009276046,0.0015640432],"category_scores_gemma":[0.011694189,0.00048038535,0.0005492925,0.0005558107,0.0018703777,0.0025755628,0.0015557412,0.0013614271,0.00022347305],"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.000051859217,0.000030421608,0.0064733834,0.00013213485,0.00006179762,0.0003570681,0.00048566534,0.5383427,0.0052092094,0.43581146,0.0019154985,0.0111288205],"study_design_scores_gemma":[0.0000035659564,0.0000054726643,0.00079892646,0.000007406365,0.0000037392788,0.00003250634,0.000029438703,0.90546256,0.00026236151,0.09270069,0.00068637385,0.000006904985],"about_ca_topic_score_codex":0.004216881,"about_ca_topic_score_gemma":0.0026037337,"teacher_disagreement_score":0.004216881,"about_ca_system_score_codex":0.001516467,"about_ca_system_score_gemma":0.000661281,"threshold_uncertainty_score":0.011002719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101661775,0.0005967205,0.00005426172,0.9904529,0.008334486,0.0000031268612,0.00004384988,0.00001809339,0.0003950087],"genre_scores_gemma":[0.0015771629,0.00035553577,0.000075460324,0.98655,0.00999037,0.000018732631,0.000019639754,0.000016010434,0.0013971817],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99701774,0.00085447455,0.00029548205,0.0005437992,0.00090450706,0.000384106],"domain_scores_gemma":[0.9884405,0.007008166,0.0006989883,0.00046634566,0.00194809,0.0014379288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005471625,0.0008182083,0.0013686944,0.00082704175,0.0043524997,0.0035892122,0.0030333528,0.05112016,0.0061636236],"category_scores_gemma":[0.033504814,0.0008583664,0.0011354781,0.00087853614,0.0061751544,0.005559394,0.002460884,0.046022784,0.006657645],"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.000019193742,0.0000060234615,0.000104342966,0.00001548645,0.000004849708,0.00013186665,0.000055209563,0.000012049376,0.000035342677,0.0013930978,0.99695045,0.0012720192],"study_design_scores_gemma":[0.00015471867,0.000041558927,0.0010989523,0.00024166935,0.000034355522,0.0009757338,0.0006711171,0.0003568206,0.00047281783,0.028377011,0.9674674,0.000107824446],"about_ca_topic_score_codex":0.0038894687,"about_ca_topic_score_gemma":0.005989853,"teacher_disagreement_score":0.05112016,"about_ca_system_score_codex":0.0042279726,"about_ca_system_score_gemma":0.004085015,"threshold_uncertainty_score":0.030676186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9681139,0.0003762131,0.0099382615,0.0017228136,0.000024879344,0.0001318029,0.0001572327,0.000051996463,0.019483022],"genre_scores_gemma":[0.99589336,0.00016385198,0.0031643687,0.000071919654,0.00001907394,0.000058611124,0.000044941105,0.00000719695,0.0005765791],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.98590696,0.009291082,0.00071625726,0.0012810314,0.0020494352,0.000755276],"domain_scores_gemma":[0.87147605,0.08538605,0.027291933,0.0040300116,0.006120353,0.005695631],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.008300413,0.0002974124,0.00043585175,0.0034110148,0.002254466,0.0036035653,0.00074349844,0.0010692811,0.004388866],"category_scores_gemma":[0.077410996,0.00024299226,0.0003127893,0.0032932174,0.0021669473,0.0030903146,0.0020961522,0.0010880475,0.00027608103],"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.00024277621,0.00040111828,0.7874789,0.00045659387,0.00023808255,0.00036202057,0.092922725,0.0015104143,0.0021133062,0.01771232,0.0013154345,0.095246285],"study_design_scores_gemma":[0.000050286817,0.00033228574,0.888045,0.00025806154,0.00021020752,0.00043366756,0.06459026,0.008636374,0.0012334826,0.02350711,0.012592195,0.00011114755],"about_ca_topic_score_codex":0.005596911,"about_ca_topic_score_gemma":0.0087865805,"teacher_disagreement_score":0.9977455,"about_ca_system_score_codex":0.0023620191,"about_ca_system_score_gemma":0.002729889,"threshold_uncertainty_score":0.04389727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8808005,0.0005994825,0.1019615,0.0019835394,0.00011915954,0.00007692418,0.00047513575,0.00022733813,0.013756385],"genre_scores_gemma":[0.991335,0.0001332222,0.004056317,0.00005587112,0.0000212809,0.00004180489,0.00004992713,0.000019599258,0.00428701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996828,0.00011947291,0.000010500504,0.00005874455,0.000048003276,0.000080527476],"domain_scores_gemma":[0.9988091,0.00069955556,0.00021203102,0.0000519642,0.000072965086,0.00015440126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005254328,0.00054022856,0.00071123004,0.0008298612,0.00050333986,0.00086876,0.0015249997,0.0016887126,0.0025602037],"category_scores_gemma":[0.0019034948,0.0003519526,0.00059439155,0.0005662957,0.0010885613,0.0011967905,0.0007410337,0.00097413664,0.0002561688],"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.00019307976,0.00015542933,0.0034730043,0.00007466298,0.00006600393,0.00080614723,0.00014631567,0.818931,0.0072222026,0.16391118,0.0015157246,0.0035052171],"study_design_scores_gemma":[0.000023025183,0.00002433981,0.00028535462,0.0000025660063,0.000008359895,0.000053107244,0.000015287054,0.9868622,0.00016959751,0.012323835,0.00022232512,0.00000999854],"about_ca_topic_score_codex":0.009963908,"about_ca_topic_score_gemma":0.006734781,"teacher_disagreement_score":0.009963908,"about_ca_system_score_codex":0.0011716941,"about_ca_system_score_gemma":0.0005302906,"threshold_uncertainty_score":0.019811809},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81765485,0.0007037981,0.16686203,0.0022422432,0.00006833767,0.00011901434,0.00022727558,0.00020665239,0.011915809],"genre_scores_gemma":[0.98975897,0.00012456303,0.008920879,0.000065228174,0.000048651586,0.000048663376,0.000066238514,0.000033169465,0.0009337167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998429,0.0008059583,0.00007895706,0.0002804813,0.000271587,0.0001339591],"domain_scores_gemma":[0.9635429,0.028167058,0.0046089687,0.0013598364,0.0012652654,0.0010560392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039561098,0.00054600945,0.00057530956,0.0042623393,0.0015786639,0.0025800993,0.0012919405,0.0016013172,0.0036261068],"category_scores_gemma":[0.041439734,0.000458574,0.00071812654,0.0027197758,0.0027001332,0.008636756,0.0026315614,0.0016390629,0.0008687145],"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.000733562,0.00081718905,0.28692678,0.0005971987,0.0003727242,0.001960833,0.028246932,0.12928748,0.0065395706,0.35435945,0.0063253683,0.18383293],"study_design_scores_gemma":[0.000066899454,0.00013715166,0.037121102,0.00007327861,0.00011127118,0.0005051028,0.00330902,0.663462,0.0010407378,0.2886305,0.0054629273,0.000080050755],"about_ca_topic_score_codex":0.004524691,"about_ca_topic_score_gemma":0.0040043495,"teacher_disagreement_score":0.004524691,"about_ca_system_score_codex":0.0011226016,"about_ca_system_score_gemma":0.00062328554,"threshold_uncertainty_score":0.020922184},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014657249,0.010463382,0.90827334,0.0045337086,0.0010170649,0.00038327114,0.009319017,0.0041817934,0.04717122],"genre_scores_gemma":[0.12562254,0.018934114,0.73421216,0.0010051077,0.001956276,0.0007076997,0.031052189,0.0011072984,0.08540261],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991923,0.00014228359,0.000047819933,0.0002050434,0.00038139068,0.000031245185],"domain_scores_gemma":[0.9986625,0.0007897688,0.000075251606,0.00025370502,0.00017807087,0.00004069458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009098033,0.0011108514,0.0006989441,0.004483025,0.00070444256,0.0024116095,0.0010508246,0.0007343367,0.0062362775],"category_scores_gemma":[0.0046800342,0.0005523739,0.00096514705,0.004799169,0.0005091623,0.0041517722,0.0016106295,0.0012556429,0.006295713],"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.00002574629,0.000098126504,0.0027094593,0.0004338989,0.00012078033,0.0001134583,0.00024486106,0.0054322835,0.0026298636,0.0352429,0.08020648,0.87274206],"study_design_scores_gemma":[0.000012778475,0.000052432544,0.0070182974,0.0004942485,0.00012567588,0.0008867873,0.0006146473,0.2034696,0.012694235,0.36530042,0.4092527,0.0000781209],"about_ca_topic_score_codex":0.0011961898,"about_ca_topic_score_gemma":0.003101688,"teacher_disagreement_score":0.0062362775,"about_ca_system_score_codex":0.0005164416,"about_ca_system_score_gemma":0.0005493823,"threshold_uncertainty_score":0.02086246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9742139,0.00040864866,0.016659683,0.00037587108,0.000015146535,0.00004766894,0.0013112986,0.000050799394,0.006917057],"genre_scores_gemma":[0.9962276,0.00014880738,0.001687259,0.000009541012,0.0000042924735,0.000020048938,0.00058941694,0.0000028442926,0.0013102544],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980587,0.000037935784,0.0000108333,0.000053683914,0.000051239425,0.000040401235],"domain_scores_gemma":[0.9995628,0.00009984317,0.00011306994,0.000023905184,0.00015322454,0.00004710643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030959732,0.00019250465,0.00014513794,0.002167301,0.00053639855,0.0005137045,0.00029226733,0.00016549522,0.0011705991],"category_scores_gemma":[0.001027943,0.00010938314,0.00021818007,0.0028829062,0.0002722182,0.0005567839,0.00037743725,0.00012322643,0.0000624269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021750994,0.000053198488,0.52455413,0.00031128677,0.00023709424,0.0011104513,0.0015687922,0.31398425,0.0036703092,0.050590947,0.0074163987,0.096285574],"study_design_scores_gemma":[0.000022171836,0.00004752033,0.54304934,0.000030492061,0.00010784529,0.0001951895,0.0013113936,0.43137476,0.000989853,0.012958027,0.009873363,0.000040049577],"about_ca_topic_score_codex":0.1733541,"about_ca_topic_score_gemma":0.13899048,"teacher_disagreement_score":0.1733541,"about_ca_system_score_codex":0.003071793,"about_ca_system_score_gemma":0.001730232,"threshold_uncertainty_score":0.34469008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09230511,0.0011107444,0.8957752,0.0022855108,0.0000881667,0.00019765577,0.0003977359,0.0010526848,0.006787061],"genre_scores_gemma":[0.85491437,0.0007526126,0.13553654,0.00063554494,0.00011458676,0.00024527864,0.000693289,0.00042159398,0.006686242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537355,0.0018213149,0.00018939699,0.0012108154,0.0008440662,0.0005609908],"domain_scores_gemma":[0.97120404,0.021860885,0.002139087,0.002643683,0.0011948758,0.00095737714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004181106,0.0013960871,0.0021848017,0.0013729425,0.0026124164,0.0040270314,0.003338049,0.0040515913,0.0061689247],"category_scores_gemma":[0.034941938,0.0012501195,0.0011409714,0.0028245097,0.0035730544,0.010472386,0.0044054845,0.00311674,0.0010205305],"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.00035441105,0.00012693225,0.002438787,0.00026404945,0.00011552893,0.00048142724,0.0005246082,0.85631907,0.0024940867,0.09528894,0.006422576,0.035169527],"study_design_scores_gemma":[0.00005134908,0.00004820479,0.0002907971,0.000025516549,0.000027958402,0.00018639512,0.00018626772,0.8373644,0.0018587544,0.15651688,0.0034246892,0.000018761792],"about_ca_topic_score_codex":0.006195356,"about_ca_topic_score_gemma":0.004455193,"teacher_disagreement_score":0.006195356,"about_ca_system_score_codex":0.0027140947,"about_ca_system_score_gemma":0.0017684771,"threshold_uncertainty_score":0.022112072},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87090254,0.00057723233,0.119652145,0.0009807824,0.000025642628,0.00004733267,0.0003583294,0.00017971032,0.0072762733],"genre_scores_gemma":[0.99152815,0.00016891796,0.007853957,0.000019123807,0.0000094073275,0.000018584971,0.000079006204,0.000007608397,0.0003152912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885774,0.0005556962,0.000048261714,0.0001781349,0.00027111397,0.00008910538],"domain_scores_gemma":[0.99441904,0.0035879572,0.00099647,0.00044175595,0.00035060788,0.00020413374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014101223,0.00037008428,0.00034775253,0.0018578474,0.0004165193,0.0012579168,0.0006330883,0.0007672445,0.0007337816],"category_scores_gemma":[0.012495017,0.0002864638,0.00047427075,0.0017878738,0.0007284814,0.0034517648,0.00075632764,0.0005988169,0.000110730536],"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.00008989546,0.00013586684,0.1007957,0.00012753397,0.00020982567,0.00023352179,0.000716974,0.7750406,0.005002332,0.08517998,0.0010123614,0.031455424],"study_design_scores_gemma":[0.000005493771,0.000045693643,0.013276631,0.000010602039,0.000025764248,0.00006204924,0.00014666012,0.9623089,0.0011740549,0.022062387,0.00085957604,0.00002216176],"about_ca_topic_score_codex":0.008792704,"about_ca_topic_score_gemma":0.005365713,"teacher_disagreement_score":0.008792704,"about_ca_system_score_codex":0.0016499825,"about_ca_system_score_gemma":0.0006299792,"threshold_uncertainty_score":0.017483056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.719975,0.00023948497,0.2765986,0.00015708714,0.000009884528,0.00003394786,0.0014080709,0.00045832587,0.0011196141],"genre_scores_gemma":[0.97240543,0.0000786959,0.02621017,0.000015750396,0.0000070357614,0.000026076708,0.0010449227,0.00004730437,0.00016456518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955255,0.00023024139,0.000020173216,0.00009986767,0.00006538553,0.000031812495],"domain_scores_gemma":[0.9949949,0.003524173,0.00058705057,0.00040395174,0.00035303357,0.00013697692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016393055,0.00033582252,0.00040479895,0.0032419593,0.00038826556,0.00092873967,0.0005786088,0.00072185893,0.0009673891],"category_scores_gemma":[0.012135194,0.00032992527,0.0004097235,0.0019245326,0.0005121834,0.0011066899,0.0005980133,0.0008370477,0.00029101246],"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.00023378956,0.00010830095,0.09481254,0.00019425357,0.00016493698,0.0002071227,0.00034805786,0.8255227,0.014746187,0.02090857,0.0017986032,0.040954944],"study_design_scores_gemma":[0.000004212512,0.000005698077,0.0055265306,0.000007026135,0.0000056585077,0.000020995176,0.00003244786,0.98584706,0.0011074538,0.0071177348,0.00031799832,0.0000072504126],"about_ca_topic_score_codex":0.0049304697,"about_ca_topic_score_gemma":0.003640602,"teacher_disagreement_score":0.0049304697,"about_ca_system_score_codex":0.00083726627,"about_ca_system_score_gemma":0.00045528554,"threshold_uncertainty_score":0.009803534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71686226,0.0005300568,0.2771327,0.00028115592,0.000042908545,0.00008422351,0.000621965,0.00065170124,0.0037931101],"genre_scores_gemma":[0.9776038,0.00018858848,0.021381116,0.000011335377,0.000022828188,0.000033893637,0.00027959852,0.000015632842,0.00046320594],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99947256,0.00019347544,0.000020522739,0.00008767846,0.0001838695,0.000041922318],"domain_scores_gemma":[0.9974546,0.001465035,0.00046134228,0.00018712315,0.000339786,0.000092093156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072796096,0.00046396683,0.00030622206,0.002748486,0.00037393105,0.0005407092,0.00036248466,0.00035093154,0.0005431372],"category_scores_gemma":[0.004115304,0.00015369497,0.00025953137,0.0018908008,0.00038802784,0.0014049093,0.00032936333,0.0004422046,0.00016035548],"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.00046959968,0.0006827209,0.2523619,0.0006324997,0.0003530659,0.00076774653,0.0017158807,0.21129283,0.08116533,0.030301772,0.0038000867,0.41645658],"study_design_scores_gemma":[0.0000071945437,0.00013122948,0.08295931,0.00001731305,0.000036752954,0.0003062977,0.00039424695,0.8972156,0.011347027,0.006301151,0.001243017,0.00004088909],"about_ca_topic_score_codex":0.0023391908,"about_ca_topic_score_gemma":0.0014473329,"teacher_disagreement_score":0.002748486,"about_ca_system_score_codex":0.0004682281,"about_ca_system_score_gemma":0.00023598883,"threshold_uncertainty_score":0.0046511292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0959976,0.0004394124,0.8813875,0.00094390166,0.000109366614,0.000095646035,0.00024053648,0.0002993753,0.02048674],"genre_scores_gemma":[0.9563859,0.0005336591,0.031070147,0.000099742916,0.000067117224,0.00016914931,0.0001616226,0.00003769361,0.011474906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996018,0.00010723321,0.000015068945,0.00007984871,0.00014238537,0.000053685446],"domain_scores_gemma":[0.99927074,0.00026998838,0.00011620275,0.000056083834,0.00019952968,0.00008757301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045579055,0.0004663766,0.00058397825,0.0007755314,0.000535242,0.0011088,0.0016597015,0.0010686998,0.0026683193],"category_scores_gemma":[0.0028429313,0.00021758466,0.00057004805,0.0007782206,0.0008348838,0.0023189092,0.00071802735,0.0009108038,0.00041681103],"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.000062805084,0.000036884747,0.0013515209,0.00005786996,0.000049012062,0.00024020356,0.00017311875,0.6888568,0.0035308197,0.29050982,0.0015672729,0.013563778],"study_design_scores_gemma":[0.000009457297,0.000011229981,0.00014680087,0.000001936951,0.0000074804807,0.000029976276,0.000009490762,0.96788067,0.000127877,0.030849162,0.00091954734,0.0000064877413],"about_ca_topic_score_codex":0.0065302844,"about_ca_topic_score_gemma":0.0028758706,"teacher_disagreement_score":0.0065302844,"about_ca_system_score_codex":0.000947931,"about_ca_system_score_gemma":0.0005539221,"threshold_uncertainty_score":0.012984574},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49880907,0.0018415478,0.478761,0.00059646834,0.000072369,0.00041961088,0.004149365,0.0009723748,0.014378171],"genre_scores_gemma":[0.939869,0.00055268663,0.057392027,0.000026592916,0.00004574408,0.00021984753,0.001158203,0.000023189401,0.00071281707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973781,0.0011782121,0.00013604928,0.00033735903,0.00087075395,0.00009952371],"domain_scores_gemma":[0.9951079,0.0024606253,0.0008612954,0.00071509794,0.00066471193,0.00019036653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013760967,0.00046102956,0.00033998437,0.0039954553,0.00044475732,0.0009677284,0.0005700812,0.00045900105,0.00069885614],"category_scores_gemma":[0.011638637,0.00017063587,0.0002560772,0.0035782978,0.0005100364,0.0017137007,0.00085645827,0.00043891688,0.0003249243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020259633,0.00047929748,0.25433114,0.0008209433,0.00034333186,0.00060709706,0.0016695991,0.1291946,0.026297359,0.080967724,0.005349513,0.49973682],"study_design_scores_gemma":[0.00002130459,0.00030209246,0.24294432,0.0001790124,0.00010178158,0.001201748,0.0015297217,0.6537042,0.015799027,0.06434532,0.019763617,0.00010783145],"about_ca_topic_score_codex":0.0021828765,"about_ca_topic_score_gemma":0.0012902219,"teacher_disagreement_score":0.0039954553,"about_ca_system_score_codex":0.0005779135,"about_ca_system_score_gemma":0.0004120317,"threshold_uncertainty_score":0.0072775483},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006084974,0.958149,0.015072625,0.002142298,0.0019630832,0.000029072673,0.00018591869,0.00005221989,0.021797216],"genre_scores_gemma":[0.0072991946,0.97592884,0.007208383,0.0010250777,0.002348084,0.00004656923,0.000349642,0.000028251861,0.005765997],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990564,0.00025926152,0.00009835935,0.00019122144,0.0003413045,0.000053416145],"domain_scores_gemma":[0.99828315,0.00092618295,0.00015230651,0.00009461599,0.00046116707,0.000082593484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011229038,0.001145306,0.0010275743,0.0037453563,0.00072650623,0.0019029449,0.0015889261,0.0013283234,0.007748099],"category_scores_gemma":[0.0032485349,0.00047365492,0.0006406607,0.0055226376,0.00091172464,0.003675721,0.0011252816,0.0016014957,0.003952812],"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.000047542017,0.000067298985,0.0009077789,0.009546333,0.00011670427,0.0006075485,0.0003068765,0.004463347,0.001003258,0.1741851,0.114903525,0.6938446],"study_design_scores_gemma":[0.000003331322,0.000026956175,0.00056561764,0.0017508306,0.000036147903,0.0009254516,0.00007887489,0.0009064096,0.00022525317,0.03950929,0.95594764,0.000024210278],"about_ca_topic_score_codex":0.0020284525,"about_ca_topic_score_gemma":0.0016590806,"teacher_disagreement_score":0.007748099,"about_ca_system_score_codex":0.001165933,"about_ca_system_score_gemma":0.00198315,"threshold_uncertainty_score":0.025919974},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043116104,0.00018252738,0.9542693,0.00009685279,0.000015804872,0.00008612326,0.000020248372,0.00039748836,0.0018156357],"genre_scores_gemma":[0.5268026,0.00020462224,0.4695181,0.00013245405,0.00004636826,0.00019492344,0.000105388084,0.00012428414,0.0028712715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965701,0.0011505228,0.00017594273,0.0007697581,0.001040856,0.00029284615],"domain_scores_gemma":[0.9936494,0.0031634097,0.0005995267,0.00083976955,0.0014013696,0.00034653398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035585049,0.00087726477,0.0010091051,0.0025777917,0.0015820249,0.0015913948,0.001895062,0.0010846282,0.0011998478],"category_scores_gemma":[0.011095147,0.0005711167,0.0009566393,0.0014868722,0.0017444777,0.0035855016,0.00229458,0.0007965898,0.00031718414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039997947,0.0002717953,0.009810308,0.00041494853,0.00030339148,0.0005621743,0.0024150277,0.24126135,0.036726844,0.18064809,0.0034179562,0.5237681],"study_design_scores_gemma":[0.000044144097,0.00015852059,0.0015819499,0.000024212326,0.000109189576,0.00033438913,0.00015441977,0.9183591,0.016046874,0.059930835,0.003199507,0.000056892324],"about_ca_topic_score_codex":0.002455016,"about_ca_topic_score_gemma":0.0020668388,"teacher_disagreement_score":0.0035585049,"about_ca_system_score_codex":0.0012173105,"about_ca_system_score_gemma":0.0010796661,"threshold_uncertainty_score":0.018819392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99310714,0.00009736607,0.00265735,0.00012462138,0.000002206755,0.000008811904,0.0002424425,0.000012139733,0.0037478893],"genre_scores_gemma":[0.9990532,0.000080589656,0.00036028918,0.0000047773597,0.0000019560916,0.000003936425,0.00016121092,0.0000015884921,0.00033246807],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983275,0.000037315145,0.000012789022,0.000041309937,0.000040128107,0.000035681078],"domain_scores_gemma":[0.99924266,0.00027726812,0.0001922981,0.00003983546,0.00018588788,0.00006201379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028335067,0.00010917202,0.00013130395,0.0037385924,0.00028974703,0.00083818426,0.00020796458,0.00016756852,0.0012592935],"category_scores_gemma":[0.0018890799,0.000091937676,0.00027078364,0.0030343393,0.00039595342,0.0009732057,0.00048600562,0.00011780231,0.00007277254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086945816,0.000035620134,0.8507571,0.000074094445,0.00017034014,0.00048226936,0.001543566,0.080078274,0.0019302379,0.037254963,0.0011647681,0.026421824],"study_design_scores_gemma":[0.000005734445,0.000024719955,0.79853183,0.000018389801,0.000055373264,0.00014505906,0.0014677542,0.18944488,0.00031929754,0.008047198,0.0019171688,0.000022565977],"about_ca_topic_score_codex":0.036136173,"about_ca_topic_score_gemma":0.04161248,"teacher_disagreement_score":0.036136173,"about_ca_system_score_codex":0.0012795012,"about_ca_system_score_gemma":0.00052296557,"threshold_uncertainty_score":0.07185167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860815,0.00018692666,0.0066310484,0.00020271663,0.000008953093,0.00003898597,0.0011533793,0.000059298214,0.0056372155],"genre_scores_gemma":[0.99466276,0.00016310652,0.0029691572,0.000007786499,0.0000052105956,0.00003318539,0.0010121461,0.0000050615986,0.0011414819],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997987,0.00003452365,0.0000127401145,0.0000498085,0.000048948823,0.000055233388],"domain_scores_gemma":[0.99963343,0.00009392817,0.00008931229,0.000017441604,0.00013019335,0.00003564404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018764885,0.00015934039,0.00012490919,0.0031546014,0.0006690035,0.00085676764,0.00026915176,0.00018825493,0.0015943182],"category_scores_gemma":[0.001118994,0.00012275192,0.00020588998,0.004146862,0.000375818,0.0007649926,0.00045386833,0.00014711566,0.000090562775],"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.00027204075,0.000068919246,0.7522216,0.00028792096,0.000109496425,0.001108117,0.006700766,0.07616634,0.004502499,0.046160147,0.006239904,0.10616233],"study_design_scores_gemma":[0.000018194196,0.00004528429,0.799816,0.00007292351,0.000070524016,0.00027950387,0.0057084216,0.17310959,0.0008214057,0.0077303406,0.012285605,0.000042069427],"about_ca_topic_score_codex":0.12149943,"about_ca_topic_score_gemma":0.10366253,"teacher_disagreement_score":0.12149943,"about_ca_system_score_codex":0.001758392,"about_ca_system_score_gemma":0.0012294498,"threshold_uncertainty_score":0.24158442},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65378714,0.0011468243,0.32870162,0.0015358225,0.00003110077,0.00009974339,0.0012416841,0.0002703863,0.013185674],"genre_scores_gemma":[0.9534116,0.00037166226,0.04451449,0.00004400991,0.000021646772,0.00011452202,0.0005060573,0.00003289018,0.0009831858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99853003,0.0006597076,0.000079261714,0.00035991118,0.00023943093,0.0001317318],"domain_scores_gemma":[0.98637944,0.009011122,0.0022002633,0.00094528776,0.00090765714,0.0005561874],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0017900987,0.00027020724,0.00043474094,0.0054328195,0.0011619471,0.0031550752,0.00069999666,0.00090018805,0.0031574338],"category_scores_gemma":[0.017526595,0.00037925743,0.0008088362,0.003192785,0.003460211,0.0060445303,0.0018211199,0.0010094575,0.00032199416],"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.00023625923,0.000085269276,0.036629796,0.0004338266,0.00010427294,0.00054269016,0.004830947,0.070604116,0.0070721204,0.82309425,0.0014110988,0.054955345],"study_design_scores_gemma":[0.00002905094,0.00007291213,0.04729226,0.00009133628,0.000053468128,0.00068369013,0.0021447416,0.220268,0.0023579584,0.719951,0.0069760205,0.0000794853],"about_ca_topic_score_codex":0.001555481,"about_ca_topic_score_gemma":0.0012469538,"teacher_disagreement_score":0.99456716,"about_ca_system_score_codex":0.0012843448,"about_ca_system_score_gemma":0.0004925207,"threshold_uncertainty_score":0.010562658},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22829805,0.0009780531,0.75536305,0.0022270174,0.00022998161,0.0007460506,0.0043046055,0.002034014,0.0058192117],"genre_scores_gemma":[0.84968734,0.0005635595,0.14008032,0.00013800389,0.00030921164,0.0012065507,0.0041788043,0.00020267989,0.0036334589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9964014,0.0021630293,0.00018554715,0.00067097374,0.00032391338,0.0002551191],"domain_scores_gemma":[0.97786444,0.01973303,0.0009868745,0.00051949656,0.0005826381,0.0003135271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067900866,0.0010330018,0.0008665122,0.004890961,0.0014611844,0.003283094,0.0016211848,0.0018700609,0.0044995397],"category_scores_gemma":[0.018439233,0.0006837418,0.0026307192,0.0033958734,0.00094970514,0.0033084925,0.0018693871,0.0017990788,0.0013029204],"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.0012811532,0.0010628738,0.067351714,0.00084758556,0.0007414219,0.00090526976,0.010635268,0.5871455,0.00417238,0.11873704,0.011942538,0.19517733],"study_design_scores_gemma":[0.000014305254,0.000019438954,0.002044509,0.000017378963,0.000019572515,0.000029486895,0.00043582506,0.98387396,0.00020508272,0.011787135,0.0015403518,0.000012995948],"about_ca_topic_score_codex":0.02247002,"about_ca_topic_score_gemma":0.021452164,"teacher_disagreement_score":0.02247002,"about_ca_system_score_codex":0.0022764143,"about_ca_system_score_gemma":0.0011179721,"threshold_uncertainty_score":0.04467845},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7291069,0.00027061638,0.2672996,0.00042887838,0.000027055326,0.000068710775,0.00019888511,0.00082483015,0.0017746025],"genre_scores_gemma":[0.9850906,0.000055777222,0.014430361,0.000043176336,0.000012828245,0.000023812921,0.0001351547,0.000025904206,0.00018239944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990758,0.00035362758,0.000049023638,0.0001967804,0.00021915311,0.00010555331],"domain_scores_gemma":[0.98350036,0.010103162,0.002924855,0.0019914815,0.000996802,0.00048331803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015272908,0.000274973,0.00045840137,0.001027501,0.00035504389,0.0005579431,0.00060365873,0.00058114453,0.0005220999],"category_scores_gemma":[0.021701934,0.00019091909,0.00025816634,0.000684595,0.00066997623,0.0015828513,0.0009598292,0.00089844037,0.00010242518],"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.0010911991,0.00052250706,0.26088384,0.0003929838,0.0005961403,0.002194586,0.0025891548,0.3492877,0.085200526,0.037999168,0.005269898,0.25397232],"study_design_scores_gemma":[0.000015116864,0.00009467081,0.03162407,0.000014496947,0.000040185587,0.00039242618,0.00039124963,0.9117264,0.005243346,0.049790695,0.0006491937,0.000018061934],"about_ca_topic_score_codex":0.001717199,"about_ca_topic_score_gemma":0.0020726416,"teacher_disagreement_score":0.001717199,"about_ca_system_score_codex":0.0004883194,"about_ca_system_score_gemma":0.00035197742,"threshold_uncertainty_score":0.008077204},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06901619,0.15298952,0.11292726,0.38658983,0.0033058545,0.00018759025,0.00047767677,0.00058585487,0.27392027],"genre_scores_gemma":[0.8256148,0.1059516,0.039545078,0.00883325,0.004975811,0.00028580613,0.0002932305,0.00018193558,0.014318444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967623,0.0020093818,0.00007693908,0.00031424497,0.0005809559,0.00025610748],"domain_scores_gemma":[0.99221873,0.0058904015,0.00035762216,0.00054922566,0.00035643164,0.00062771654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005170936,0.00077392795,0.00074114697,0.0046509714,0.004469445,0.017295694,0.001110672,0.0035293703,0.0061680707],"category_scores_gemma":[0.007819732,0.0004026205,0.0006237794,0.0056735277,0.013006986,0.03186743,0.0066619003,0.00334642,0.000813253],"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.000032427335,0.00005499246,0.002145042,0.00043234878,0.00003885191,0.0001667629,0.0054806024,0.0007673486,0.00034433365,0.8774541,0.013237855,0.099845275],"study_design_scores_gemma":[0.0000054611824,0.000018026878,0.0009840028,0.00034346202,0.00001430642,0.0001281784,0.0074795694,0.002456998,0.00016029562,0.8605198,0.12786852,0.000021223317],"about_ca_topic_score_codex":0.0017457338,"about_ca_topic_score_gemma":0.0028922476,"teacher_disagreement_score":0.017295694,"about_ca_system_score_codex":0.0028702687,"about_ca_system_score_gemma":0.0037391717,"threshold_uncertainty_score":0.02734685},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067273127,0.0015701402,0.9875322,0.000116820134,0.000053729396,0.00004185116,0.00007141699,0.00023055993,0.0036559792],"genre_scores_gemma":[0.18233532,0.0012675594,0.80889153,0.00014617268,0.00008907909,0.00019109799,0.00043175343,0.00023438124,0.0064131683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947065,0.00019735067,0.000019718163,0.00013202248,0.00015112062,0.00002919761],"domain_scores_gemma":[0.99953353,0.00027893932,0.000031798092,0.000055774188,0.00008077911,0.000019182055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073128316,0.0005901547,0.0009768277,0.0011454817,0.0005228773,0.0007437387,0.0014909606,0.0008902162,0.0025462273],"category_scores_gemma":[0.0027984895,0.00038359483,0.0005334998,0.0017211919,0.0006574102,0.0011009355,0.0010365908,0.0010064183,0.0007328046],"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.000113558744,0.00004836784,0.00058460585,0.00022058743,0.00008175774,0.000056052373,0.00013004981,0.63409764,0.002674871,0.10748486,0.007268581,0.24723901],"study_design_scores_gemma":[0.000010082687,0.000018870382,0.00013302277,0.000013997356,0.00000821479,0.000034617104,0.000016431077,0.9585403,0.0006796876,0.036834795,0.003702015,0.000007979622],"about_ca_topic_score_codex":0.0017211311,"about_ca_topic_score_gemma":0.0020175723,"teacher_disagreement_score":0.0025462273,"about_ca_system_score_codex":0.0007769443,"about_ca_system_score_gemma":0.00046856026,"threshold_uncertainty_score":0.008517981},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50223696,0.0013213616,0.47897133,0.0028344619,0.00009973581,0.00059801264,0.0010497811,0.002452448,0.010435859],"genre_scores_gemma":[0.71342534,0.00028025435,0.2739011,0.00029589116,0.0001397381,0.0002164496,0.001076961,0.00018861504,0.0104756225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854916,0.0004938756,0.00007374348,0.00046394014,0.0002579848,0.00016128777],"domain_scores_gemma":[0.99552464,0.0029234807,0.00041710818,0.0005901649,0.0003462182,0.00019841784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023223946,0.001135357,0.0010828736,0.0021733802,0.0015360928,0.0014266906,0.0016216116,0.0017298969,0.0022465312],"category_scores_gemma":[0.0059803897,0.00047443126,0.0008095449,0.0014568099,0.0008335428,0.003555603,0.0015683807,0.0014799344,0.0009768872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023288426,0.001753016,0.0380951,0.00052822876,0.00032942859,0.0009363445,0.003371337,0.13228936,0.028037444,0.041539833,0.029306421,0.7214846],"study_design_scores_gemma":[0.00008377764,0.00017732666,0.003627413,0.000019180101,0.000070845315,0.0004590588,0.00047469581,0.9599771,0.00701847,0.01944085,0.008624538,0.000026689877],"about_ca_topic_score_codex":0.004969318,"about_ca_topic_score_gemma":0.008277029,"teacher_disagreement_score":0.004969318,"about_ca_system_score_codex":0.0012023299,"about_ca_system_score_gemma":0.00086231314,"threshold_uncertainty_score":0.012282133},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4400734,0.00044823176,0.5525876,0.00043397193,0.000018242346,0.00006337568,0.00040609064,0.00029105198,0.0056779133],"genre_scores_gemma":[0.96675307,0.000215902,0.031174766,0.0000607793,0.000022758637,0.00005553543,0.0001764051,0.000042677653,0.0014981752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994197,0.00018834107,0.000028256347,0.00018668623,0.00008784882,0.00008929345],"domain_scores_gemma":[0.99157953,0.005244994,0.0013280768,0.0010137545,0.00047054468,0.00036308327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010706327,0.00029852544,0.00041535258,0.0012901243,0.0007816513,0.0010231097,0.00055920624,0.0004956635,0.003100064],"category_scores_gemma":[0.007237422,0.00041055903,0.0005087417,0.0009326898,0.0015189664,0.0027486493,0.0009921725,0.0006080049,0.00013997895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003088451,0.00007654855,0.02764366,0.00031310032,0.00018891768,0.0007947158,0.0012640279,0.38916668,0.0133160725,0.49241588,0.0032515582,0.07126001],"study_design_scores_gemma":[0.000021682088,0.00006285645,0.011496116,0.000042902942,0.00007233913,0.00028006855,0.00025804716,0.68735224,0.004695766,0.29124472,0.004445514,0.000027816808],"about_ca_topic_score_codex":0.005806027,"about_ca_topic_score_gemma":0.005586181,"teacher_disagreement_score":0.005806027,"about_ca_system_score_codex":0.0014194868,"about_ca_system_score_gemma":0.00041314398,"threshold_uncertainty_score":0.011544466},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41669106,0.007728258,0.5502455,0.005281777,0.0003295851,0.00052772777,0.002759706,0.0007063193,0.015730053],"genre_scores_gemma":[0.95119524,0.0010006133,0.043925952,0.00023234013,0.00023633816,0.00019939053,0.0010024394,0.00005403211,0.0021537878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922725,0.004106454,0.00033914924,0.001804276,0.0011237363,0.0003538741],"domain_scores_gemma":[0.92310536,0.061313115,0.0054677464,0.0066338344,0.0022911539,0.0011888067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012267138,0.00088277116,0.0014163704,0.003997416,0.0025418026,0.002673409,0.0017210157,0.002108613,0.0038623472],"category_scores_gemma":[0.0614349,0.0008541006,0.0016367058,0.0035681587,0.0020424256,0.0062341355,0.0026245932,0.0027425417,0.0007101741],"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.000609255,0.0006219525,0.21926112,0.00085282343,0.001635513,0.00057550456,0.004586258,0.30179447,0.0032192585,0.23874657,0.010187855,0.21790941],"study_design_scores_gemma":[0.000057881905,0.00030676348,0.038904205,0.00014197448,0.00024150996,0.00047790754,0.0007749245,0.77931803,0.000966436,0.16914843,0.009564443,0.000097564705],"about_ca_topic_score_codex":0.0075723445,"about_ca_topic_score_gemma":0.00926154,"teacher_disagreement_score":0.012267138,"about_ca_system_score_codex":0.0020912068,"about_ca_system_score_gemma":0.0008789892,"threshold_uncertainty_score":0.0648756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7477109,0.0006223443,0.23642433,0.00089106255,0.0001155597,0.0005371468,0.0052237045,0.0012207859,0.007254263],"genre_scores_gemma":[0.90814203,0.00027971406,0.08550491,0.000045684323,0.00005176223,0.00031580406,0.0033988238,0.00007164733,0.0021895613],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985911,0.0006188545,0.00008407984,0.00025070456,0.00038137936,0.00007381005],"domain_scores_gemma":[0.99312806,0.0042619803,0.0012228561,0.00048533082,0.00052623585,0.00037549945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016923154,0.00054100953,0.00026045996,0.0057707755,0.0005090362,0.0006899652,0.0004597345,0.0004913604,0.0012704838],"category_scores_gemma":[0.0074858684,0.00014324539,0.00052198896,0.0031686,0.000299437,0.0012576147,0.000809526,0.00050995866,0.00046088875],"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.00041486084,0.000978674,0.34299472,0.00081203703,0.0006383043,0.00064138643,0.007091888,0.030789096,0.025827393,0.010067078,0.011232444,0.5685121],"study_design_scores_gemma":[0.000040694977,0.0005167183,0.40106124,0.00017691831,0.00021831812,0.00091431197,0.005121052,0.51333207,0.016495602,0.023382317,0.038601257,0.00013954435],"about_ca_topic_score_codex":0.0023969042,"about_ca_topic_score_gemma":0.004047483,"teacher_disagreement_score":0.0057707755,"about_ca_system_score_codex":0.00044476838,"about_ca_system_score_gemma":0.0003176093,"threshold_uncertainty_score":0.008949876},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021097288,0.011925834,0.17248367,0.40624964,0.005903153,0.00015559087,0.002823098,0.0011004169,0.37826133],"genre_scores_gemma":[0.6860968,0.025344165,0.043393504,0.048990164,0.0059505994,0.00042468795,0.0036301643,0.001391226,0.18477878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721587,0.0010850466,0.000102423604,0.000753741,0.0004945856,0.00034826566],"domain_scores_gemma":[0.9937226,0.0024034488,0.00058446656,0.0012617056,0.0011392975,0.0008885111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032535705,0.0007530054,0.00082817354,0.0009245344,0.0018260246,0.009630514,0.0018498764,0.003300955,0.033388246],"category_scores_gemma":[0.015057161,0.00033694686,0.00063510466,0.0012460314,0.0050723017,0.016909989,0.002500977,0.0042861137,0.010277683],"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.000027808466,0.00004200327,0.0025771612,0.00016170285,0.000040994357,0.0001956724,0.0023824722,0.0019110987,0.00024516848,0.8872865,0.067748904,0.03738059],"study_design_scores_gemma":[0.000007966304,0.000011624779,0.0005294109,0.00033856113,0.000025473095,0.0002084377,0.0015047305,0.004591115,0.00015167696,0.62904614,0.36356175,0.000023101555],"about_ca_topic_score_codex":0.0090761,"about_ca_topic_score_gemma":0.0052340976,"teacher_disagreement_score":0.033388246,"about_ca_system_score_codex":0.0024735807,"about_ca_system_score_gemma":0.0034102108,"threshold_uncertainty_score":0.11169487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21529956,0.00028805382,0.7804415,0.0004250219,0.000026552623,0.00006858923,0.00026414281,0.00030111647,0.002885475],"genre_scores_gemma":[0.96665245,0.00017890506,0.032052733,0.000058777216,0.000031166786,0.00012009183,0.00031060158,0.000046989804,0.0005482614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982272,0.0008377691,0.000066504115,0.00037037607,0.0003410524,0.00015715012],"domain_scores_gemma":[0.9698113,0.023912242,0.0026790306,0.0018971717,0.0011631647,0.00053707307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004689635,0.0007940756,0.0009793834,0.0020110933,0.0004158478,0.0015397217,0.0018432918,0.0011788242,0.0015429512],"category_scores_gemma":[0.045850273,0.0004910488,0.0006601146,0.00073052524,0.0019472028,0.004061449,0.001314901,0.001602732,0.00015471216],"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.000107340675,0.00008234263,0.0046002017,0.00011647953,0.00006479489,0.00013497309,0.0001286497,0.7840349,0.0023549527,0.19540213,0.00075926137,0.012214013],"study_design_scores_gemma":[0.0000061009273,0.000020924823,0.000516062,0.000009308981,0.00000534158,0.000016027072,0.000014801515,0.94169766,0.0005592566,0.05700681,0.00013556589,0.000012127291],"about_ca_topic_score_codex":0.0026821308,"about_ca_topic_score_gemma":0.001844769,"teacher_disagreement_score":0.004689635,"about_ca_system_score_codex":0.0013793658,"about_ca_system_score_gemma":0.0007995943,"threshold_uncertainty_score":0.024801433},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46507385,0.000610539,0.49547514,0.0015910572,0.00005842902,0.00017879176,0.0009117654,0.00043396562,0.0356665],"genre_scores_gemma":[0.98754954,0.00028533558,0.010666662,0.00006448268,0.00001863733,0.0001212186,0.0002026853,0.00005172491,0.0010397265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989691,0.00040283834,0.00005881311,0.00019610074,0.0002185664,0.0001546525],"domain_scores_gemma":[0.99137443,0.0051726713,0.0011578745,0.001136872,0.0006969654,0.00046127703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017158565,0.0006385116,0.0005394781,0.0011997381,0.0007896556,0.0021203505,0.0008672035,0.0009655733,0.0029455929],"category_scores_gemma":[0.02240832,0.0004225234,0.0005174611,0.0006853251,0.0014186592,0.0042281453,0.0012306613,0.0007910633,0.0002541174],"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.000070774986,0.000032953874,0.0032838741,0.000082759485,0.000027043907,0.0001491085,0.00019197965,0.69902027,0.0031596825,0.28297868,0.0009311065,0.010071752],"study_design_scores_gemma":[0.00001748017,0.000036437952,0.0016575729,0.000031387226,0.000016663429,0.000071298455,0.00011352039,0.84685904,0.0010741323,0.1486036,0.0014996566,0.000019184265],"about_ca_topic_score_codex":0.0029150266,"about_ca_topic_score_gemma":0.002343605,"teacher_disagreement_score":0.0029455929,"about_ca_system_score_codex":0.0015713187,"about_ca_system_score_gemma":0.0009316346,"threshold_uncertainty_score":0.0114007},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039778545,0.00015332457,0.9557292,0.00016964135,0.000018028897,0.00009553991,0.00019672756,0.0002821356,0.0035767928],"genre_scores_gemma":[0.46443155,0.0005170731,0.5242933,0.00015842674,0.00006338778,0.0003253075,0.0011222482,0.0002767529,0.00881191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993654,0.00013773101,0.000028754554,0.00019538743,0.00017130344,0.00010146276],"domain_scores_gemma":[0.99840206,0.0006845056,0.0002671523,0.00019061222,0.00031050353,0.00014506267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006495645,0.00083668926,0.0008925446,0.0012053158,0.0005378702,0.0008459678,0.0014370456,0.0009258805,0.003498689],"category_scores_gemma":[0.0036679548,0.0007259636,0.0012752753,0.0008146705,0.0011357653,0.0018185057,0.0015337514,0.001489577,0.0006444173],"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.00008601962,0.000050588344,0.0014097346,0.00019211949,0.000047777467,0.00020995036,0.0002583843,0.76577747,0.0059684287,0.17006953,0.0025379432,0.053392038],"study_design_scores_gemma":[0.000007244696,0.000033543893,0.0002555222,0.000014651195,0.000011677832,0.000083363484,0.000050218572,0.8950962,0.0010348542,0.1015032,0.0019009737,0.0000086580085],"about_ca_topic_score_codex":0.004042084,"about_ca_topic_score_gemma":0.0039610695,"teacher_disagreement_score":0.004042084,"about_ca_system_score_codex":0.0011457376,"about_ca_system_score_gemma":0.0008455423,"threshold_uncertainty_score":0.011704326},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05700082,0.0016279537,0.9340796,0.00018295328,0.00008675959,0.00011551713,0.0015274204,0.0005645328,0.0048145633],"genre_scores_gemma":[0.56460494,0.0014015939,0.4271565,0.00011669789,0.00034656614,0.00040472136,0.002829172,0.0002739844,0.0028658388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979615,0.0007120534,0.0001378076,0.0005162145,0.0005453282,0.00012713339],"domain_scores_gemma":[0.98619914,0.00958297,0.0014348158,0.0013795017,0.0010185805,0.00038488736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039038719,0.0015620706,0.002025239,0.0103029655,0.0007366089,0.0024283575,0.0015104911,0.0017773423,0.0023373375],"category_scores_gemma":[0.015506932,0.00058135675,0.0013887263,0.007826009,0.002248642,0.005575471,0.002380351,0.0017341973,0.0006268788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033730382,0.00030719623,0.07743611,0.00075442996,0.00093302905,0.0002868678,0.0009608662,0.32518354,0.010855164,0.11151661,0.0102349855,0.46119386],"study_design_scores_gemma":[0.000026668959,0.000388742,0.034562264,0.00013255008,0.00018717174,0.0005779937,0.00048749172,0.8526925,0.0032857703,0.102613024,0.0049207252,0.00012501248],"about_ca_topic_score_codex":0.0014977953,"about_ca_topic_score_gemma":0.0020803567,"teacher_disagreement_score":0.0103029655,"about_ca_system_score_codex":0.001160718,"about_ca_system_score_gemma":0.0005791429,"threshold_uncertainty_score":0.020645857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063850493,0.00032612478,0.98710746,0.00020841353,0.0000286744,0.000056904704,0.00010250938,0.00011406307,0.005670746],"genre_scores_gemma":[0.57717586,0.00153918,0.40710217,0.00029205345,0.00028961172,0.0005167315,0.00056123105,0.00025188105,0.012271327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985916,0.00066008844,0.000054352982,0.00033568474,0.00025391838,0.00010428465],"domain_scores_gemma":[0.99549544,0.0036503756,0.0001868739,0.00024507463,0.00030401818,0.000118217984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021193821,0.0014092154,0.0014580694,0.0009749547,0.000561131,0.0015342239,0.0015885949,0.0012167663,0.0051059574],"category_scores_gemma":[0.010003044,0.0006564864,0.0012232751,0.0012595328,0.001469599,0.0020298092,0.0012710359,0.0013746787,0.0010058552],"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.000086330874,0.00006444743,0.0012286771,0.00032933595,0.00012020733,0.0001644965,0.00019857568,0.71443707,0.0019096099,0.2051166,0.0043505607,0.07199412],"study_design_scores_gemma":[0.000011556279,0.000021310398,0.00019265445,0.000014041871,0.00001705993,0.000044622462,0.000016192302,0.9418251,0.0006558471,0.05483713,0.0023550126,0.00000958402],"about_ca_topic_score_codex":0.003890862,"about_ca_topic_score_gemma":0.0030320624,"teacher_disagreement_score":0.0051059574,"about_ca_system_score_codex":0.0015967048,"about_ca_system_score_gemma":0.0010451772,"threshold_uncertainty_score":0.017081082},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022702164,0.15691225,0.58255243,0.0066409823,0.0062788012,0.000068656496,0.0007201211,0.0011587364,0.24339779],"genre_scores_gemma":[0.048959527,0.2976721,0.35348308,0.0027161324,0.0151202,0.0003002904,0.0012268246,0.0011252479,0.27939665],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995018,0.00009246507,0.000024210602,0.00009515943,0.00026528307,0.000021184514],"domain_scores_gemma":[0.998606,0.00093779876,0.0000483201,0.00011967794,0.00024295635,0.000045264667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079410884,0.0016372615,0.001124315,0.0031052702,0.00043169307,0.0021996265,0.0008692452,0.0008188366,0.013507785],"category_scores_gemma":[0.0028128857,0.00044173712,0.0006724634,0.00495266,0.0010192188,0.0041862614,0.0010854561,0.0023532663,0.0076479],"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.000014970394,0.000053584714,0.00023022809,0.00085061,0.000053847565,0.000062805346,0.00014004634,0.013414801,0.0010910311,0.32489443,0.16700761,0.49218604],"study_design_scores_gemma":[0.0000040780023,0.0000151773875,0.00040599314,0.00024333152,0.000029508008,0.00019541685,0.000054505028,0.027539654,0.0005093458,0.45921722,0.51176333,0.00002236628],"about_ca_topic_score_codex":0.00093040784,"about_ca_topic_score_gemma":0.0014379922,"teacher_disagreement_score":0.013507785,"about_ca_system_score_codex":0.00093068666,"about_ca_system_score_gemma":0.0006723448,"threshold_uncertainty_score":0.04518801},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004055487,0.00044982065,0.9925442,0.00026650354,0.000050277522,0.000061546576,0.0006192926,0.00085780834,0.001095185],"genre_scores_gemma":[0.22870976,0.0012633796,0.7596772,0.00032081566,0.00035749047,0.00041629645,0.003225905,0.00019681404,0.0058324505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985985,0.00036390548,0.00011175305,0.00036249764,0.0004383269,0.00012502268],"domain_scores_gemma":[0.9961094,0.0027164426,0.0001891275,0.0003939294,0.0004483259,0.00014270646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021257328,0.0009719085,0.0016906528,0.0032452724,0.0011660119,0.0024269568,0.003728926,0.0023256738,0.004176457],"category_scores_gemma":[0.008205602,0.0007102171,0.0015182096,0.0041446434,0.0009485612,0.0049886373,0.0022904777,0.0024256676,0.0015298015],"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.0001746276,0.0004417303,0.0019244894,0.0002239536,0.00021037349,0.0002262698,0.00014958317,0.5919349,0.0013424304,0.08489918,0.011978813,0.30649358],"study_design_scores_gemma":[0.0000050699673,0.0000082220895,0.000100471996,0.000010244155,0.000015480404,0.000013463853,0.0000071445384,0.9600529,0.00017181005,0.038915116,0.0006935325,0.0000065360764],"about_ca_topic_score_codex":0.022587618,"about_ca_topic_score_gemma":0.025171468,"teacher_disagreement_score":0.022587618,"about_ca_system_score_codex":0.0014980492,"about_ca_system_score_gemma":0.0016501484,"threshold_uncertainty_score":0.04491228},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7569955,0.00072174164,0.21735217,0.001114819,0.00014530381,0.000083882165,0.00034751586,0.0003221192,0.02291694],"genre_scores_gemma":[0.99244505,0.00015297187,0.0052325637,0.000046784957,0.000023897583,0.000020964533,0.00006411428,0.000023553732,0.001990069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995542,0.00010772635,0.000018921597,0.00013425134,0.000119167504,0.00006564038],"domain_scores_gemma":[0.99718446,0.0013332225,0.00032209954,0.00043141775,0.00046738266,0.00026128284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008110892,0.00020651756,0.0003086304,0.0011737244,0.00061903073,0.0015405721,0.0009479907,0.000800669,0.0025940447],"category_scores_gemma":[0.0062490483,0.00027051914,0.00040621127,0.000637872,0.00088714913,0.0022925516,0.000720425,0.0007711811,0.00027343215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019353056,0.00012483814,0.013237308,0.0001639765,0.00008484901,0.0005838513,0.00092161214,0.03392387,0.031796012,0.8854226,0.0019365824,0.031610947],"study_design_scores_gemma":[0.00007680872,0.000092135844,0.025267342,0.000057425343,0.00018965252,0.0013764837,0.0011378506,0.39757296,0.023573138,0.5425461,0.008003344,0.000106804255],"about_ca_topic_score_codex":0.0005950587,"about_ca_topic_score_gemma":0.000656758,"teacher_disagreement_score":0.0025940447,"about_ca_system_score_codex":0.0006932747,"about_ca_system_score_gemma":0.00036554228,"threshold_uncertainty_score":0.008677959},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42042172,0.011385098,0.53421277,0.004910128,0.00046346764,0.0015038372,0.0025694175,0.0046059876,0.019927613],"genre_scores_gemma":[0.810485,0.00079716684,0.18500769,0.00031229056,0.00014119504,0.00051460764,0.0012692646,0.00038020185,0.0010926848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.96274644,0.022117037,0.0028381522,0.002486186,0.009058183,0.0007540736],"domain_scores_gemma":[0.8109568,0.15711936,0.008294812,0.007814701,0.0138193555,0.0019950443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.039293632,0.0018784353,0.0014176057,0.0073869973,0.0011265482,0.0043647913,0.001270683,0.0014128461,0.0014727715],"category_scores_gemma":[0.13963443,0.00041012772,0.0008982974,0.0047116023,0.0010617211,0.0066505377,0.0014917303,0.0019453558,0.00048852887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024048777,0.0014209349,0.078008816,0.0026755326,0.0010913461,0.0002683074,0.002738597,0.08358298,0.021135213,0.03213927,0.018863924,0.7556702],"study_design_scores_gemma":[0.0002183805,0.004597187,0.044449773,0.00062156614,0.00047165086,0.00073901634,0.0014766455,0.8565823,0.019457493,0.053475793,0.01765341,0.00025679322],"about_ca_topic_score_codex":0.0041729165,"about_ca_topic_score_gemma":0.004440495,"teacher_disagreement_score":0.039293632,"about_ca_system_score_codex":0.0027920736,"about_ca_system_score_gemma":0.0014700685,"threshold_uncertainty_score":0.20780706},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6533308,0.0012940018,0.33185264,0.00064361066,0.00007744721,0.00018530384,0.0013939468,0.0006051545,0.010617101],"genre_scores_gemma":[0.97368413,0.0002681445,0.024095474,0.000042091673,0.000035510213,0.00009846495,0.000666374,0.000045049896,0.0010648534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808156,0.0006589599,0.00015172434,0.00041169976,0.00054233265,0.00015374152],"domain_scores_gemma":[0.9851835,0.009574595,0.0022639667,0.000823733,0.0017563051,0.00039789482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025575855,0.00064385554,0.00055475085,0.006657138,0.00071988144,0.0016654506,0.00078719435,0.00046365205,0.0024441725],"category_scores_gemma":[0.015055224,0.00017141881,0.0005093888,0.0040513873,0.00085735717,0.0023039433,0.00075652474,0.00039153532,0.0002752941],"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.0005523283,0.0001965682,0.13241124,0.00061458716,0.00069026125,0.001378507,0.0026385766,0.47970122,0.019513132,0.19288214,0.0083139995,0.16110747],"study_design_scores_gemma":[0.000010010341,0.000103217666,0.023590725,0.00007209576,0.00010753984,0.000876498,0.0010048226,0.889289,0.006015758,0.07470048,0.0041611777,0.000068566515],"about_ca_topic_score_codex":0.0020451585,"about_ca_topic_score_gemma":0.0020345517,"teacher_disagreement_score":0.006657138,"about_ca_system_score_codex":0.0013670648,"about_ca_system_score_gemma":0.0004722427,"threshold_uncertainty_score":0.013526022},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09090122,0.000769913,0.89067584,0.0010464437,0.000078939745,0.0001481185,0.0002397931,0.00028468913,0.01585511],"genre_scores_gemma":[0.8213305,0.001022443,0.16534962,0.0002747081,0.00015229968,0.0004887213,0.00026380704,0.000075729615,0.011042162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901104,0.00036233416,0.00003405381,0.00021286412,0.00028472362,0.00009494106],"domain_scores_gemma":[0.9966112,0.001797682,0.0005804669,0.0003830429,0.0003922851,0.00023532224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013826987,0.0005168498,0.0007131318,0.0014942134,0.0009887236,0.00196973,0.001659026,0.0015629311,0.0024449215],"category_scores_gemma":[0.008786755,0.0005033128,0.0007033314,0.0014769167,0.0016759933,0.0038172328,0.0019496295,0.0011793807,0.00046442836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044447006,0.000028465241,0.0015228677,0.00013301594,0.000041231182,0.00065236585,0.0008815354,0.1622327,0.0034323358,0.8121439,0.0020999985,0.0167871],"study_design_scores_gemma":[0.000025549467,0.00003544179,0.0005774882,0.000031840336,0.000026158072,0.00049452874,0.000119372075,0.5598017,0.0005831108,0.42755514,0.010725773,0.000024017598],"about_ca_topic_score_codex":0.0015206315,"about_ca_topic_score_gemma":0.0015686495,"teacher_disagreement_score":0.0024449215,"about_ca_system_score_codex":0.000899165,"about_ca_system_score_gemma":0.0007205437,"threshold_uncertainty_score":0.008179069},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030900145,0.0017246587,0.94858646,0.0009063268,0.00025234988,0.0022408755,0.0010469472,0.0019965174,0.0123457555],"genre_scores_gemma":[0.10129699,0.0011521573,0.8924822,0.00009329693,0.000059618702,0.0030862011,0.000643048,0.00039783842,0.0007887172],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9535438,0.028617715,0.0027274995,0.0031108335,0.011340827,0.000659276],"domain_scores_gemma":[0.89543855,0.07331556,0.0072334055,0.0062201493,0.016439285,0.0013530358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.056733437,0.0017856726,0.0016627302,0.015246387,0.0032727788,0.006600162,0.0028404116,0.001488697,0.004922478],"category_scores_gemma":[0.15413487,0.00095416926,0.002351864,0.020320171,0.0042072074,0.006991122,0.0055594603,0.0020201094,0.0009417112],"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.0009572912,0.00041763342,0.035658963,0.0038261625,0.002225321,0.000298032,0.0207258,0.0345892,0.003644137,0.28108832,0.021154486,0.5954147],"study_design_scores_gemma":[0.00040041655,0.001346848,0.06507696,0.0022913911,0.0008623099,0.00089732674,0.01921304,0.28653896,0.008272173,0.5461049,0.06802459,0.00097104284],"about_ca_topic_score_codex":0.006214106,"about_ca_topic_score_gemma":0.005335717,"teacher_disagreement_score":0.056733437,"about_ca_system_score_codex":0.0043121646,"about_ca_system_score_gemma":0.006331438,"threshold_uncertainty_score":0.3000387},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49964654,0.0029964282,0.48882163,0.0008857699,0.00017479637,0.00013786105,0.0023549185,0.0006548681,0.0043271426],"genre_scores_gemma":[0.8909716,0.0009196497,0.10134389,0.00008887506,0.00020570203,0.00011993963,0.0020271263,0.000091632166,0.004231628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990081,0.00025292853,0.000042781896,0.00040236913,0.00021282189,0.000081094935],"domain_scores_gemma":[0.99062496,0.0067725363,0.0009561456,0.00058187003,0.00065362285,0.00041080074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017046754,0.0006014039,0.0007220928,0.0049293917,0.0010519951,0.0014945889,0.0016275862,0.0013972444,0.0010615531],"category_scores_gemma":[0.013257922,0.00055698876,0.00056453183,0.0047497894,0.00069277035,0.0037701568,0.0017768363,0.0010947724,0.00052702037],"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.00096975616,0.0005732261,0.12181313,0.00072299386,0.0005496304,0.00092803984,0.003035146,0.41381812,0.014080861,0.051019985,0.012468532,0.3800206],"study_design_scores_gemma":[0.000012624664,0.000047994636,0.0066651874,0.00003505079,0.000044251934,0.00022422208,0.00030313875,0.9621883,0.0010773545,0.027225414,0.0021549454,0.000021352726],"about_ca_topic_score_codex":0.0081053795,"about_ca_topic_score_gemma":0.011566384,"teacher_disagreement_score":0.0081053795,"about_ca_system_score_codex":0.00091136934,"about_ca_system_score_gemma":0.0003312799,"threshold_uncertainty_score":0.01611638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043386,0.18954812,0.14993934,0.013841593,0.007394262,0.0002222624,0.0008180547,0.0018507778,0.63204706],"genre_scores_gemma":[0.07083088,0.14103979,0.042821463,0.002452547,0.0060290005,0.00038939962,0.0016812688,0.001050437,0.7337052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994905,0.00008287962,0.000036541343,0.00011352971,0.00023379958,0.000042777134],"domain_scores_gemma":[0.9994873,0.00022386604,0.00003851547,0.00010413578,0.000092451024,0.00005373369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006073994,0.001097275,0.00056748115,0.0012330584,0.00071166496,0.004688155,0.000703904,0.0011531991,0.049554795],"category_scores_gemma":[0.0015347645,0.00062803505,0.00062652637,0.0019721715,0.0019909202,0.0055022873,0.0019144799,0.0027296958,0.01437008],"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.000019220772,0.0000292303,0.00014739278,0.00067895465,0.000018474075,0.00008491868,0.0005972261,0.0028205852,0.001415298,0.6222842,0.15791617,0.21398827],"study_design_scores_gemma":[0.0000034017767,0.000016967524,0.00032536086,0.0004106,0.000006663818,0.00019855471,0.00010342677,0.001535168,0.00054974435,0.16537794,0.8314604,0.0000117450145],"about_ca_topic_score_codex":0.0014291981,"about_ca_topic_score_gemma":0.0014357597,"teacher_disagreement_score":0.049554795,"about_ca_system_score_codex":0.0022715868,"about_ca_system_score_gemma":0.0012167871,"threshold_uncertainty_score":0.16577733},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17110892,0.00092740485,0.822622,0.0003407823,0.00010430876,0.00011393059,0.001052872,0.0018273558,0.0019023928],"genre_scores_gemma":[0.7584985,0.0011911803,0.23232268,0.00009932567,0.0008655234,0.00024584183,0.0037560856,0.00048020476,0.0025407095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900824,0.00023056548,0.00006004733,0.00022627287,0.0003476153,0.00012731916],"domain_scores_gemma":[0.9941666,0.0036342214,0.0008108104,0.0003376261,0.00085219485,0.00019858248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016097741,0.0009828353,0.0010320015,0.006075314,0.00071024144,0.0018820014,0.000855855,0.0011024682,0.0007889276],"category_scores_gemma":[0.011110188,0.00066219113,0.0006552107,0.0029910652,0.000560765,0.0035519116,0.001163172,0.0010113742,0.00064565166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088626484,0.00027823218,0.06410959,0.00043072324,0.00022217577,0.0007483131,0.001564712,0.41150817,0.034364585,0.027512014,0.0083352905,0.45003995],"study_design_scores_gemma":[0.000012065043,0.000038613915,0.0056441766,0.000018987694,0.00002339878,0.00011098341,0.00016054416,0.9692313,0.005539751,0.01618839,0.0030102145,0.000021516491],"about_ca_topic_score_codex":0.004101306,"about_ca_topic_score_gemma":0.004398442,"teacher_disagreement_score":0.006075314,"about_ca_system_score_codex":0.0008766255,"about_ca_system_score_gemma":0.0006167047,"threshold_uncertainty_score":0.008513391},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010354991,0.024675528,0.9263178,0.0016840773,0.0008876428,0.00044824413,0.0014451715,0.0029833426,0.031203238],"genre_scores_gemma":[0.12344894,0.016498607,0.8120088,0.00041999551,0.001523602,0.0006856683,0.0060520465,0.0009849787,0.03837733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986664,0.0004398905,0.000122453,0.0003347693,0.00037550137,0.00006090564],"domain_scores_gemma":[0.998075,0.0010431578,0.00017489583,0.00020814722,0.0004584603,0.000040342482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015713096,0.0012609191,0.0008360935,0.0041968357,0.00085803436,0.003154381,0.001046992,0.00078137795,0.008031895],"category_scores_gemma":[0.0045679887,0.00035113923,0.0008419445,0.0058532506,0.000547461,0.0047391145,0.0013822747,0.000955365,0.0037609087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086304615,0.00006517386,0.0006008843,0.0011757835,0.00010773365,0.00015055554,0.0008440017,0.012101966,0.006782156,0.04753037,0.02418198,0.9063731],"study_design_scores_gemma":[0.00005161973,0.00024328257,0.004053372,0.00066327496,0.0003766879,0.00074341986,0.0014946946,0.25149485,0.021870635,0.19743909,0.5214381,0.00013092632],"about_ca_topic_score_codex":0.0015071176,"about_ca_topic_score_gemma":0.0020961321,"teacher_disagreement_score":0.008031895,"about_ca_system_score_codex":0.0009590334,"about_ca_system_score_gemma":0.00060750474,"threshold_uncertainty_score":0.026869416},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005212055,0.0005538508,0.95997167,0.0004921266,0.00015611146,0.00046931376,0.008206056,0.019992437,0.0049463026],"genre_scores_gemma":[0.067432575,0.00070952316,0.9092232,0.00012091353,0.00009675934,0.0018304358,0.011241329,0.005514533,0.0038307018],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98690444,0.0067633414,0.0008703227,0.002622028,0.0025270195,0.00031278742],"domain_scores_gemma":[0.9705917,0.018169237,0.0021697076,0.005077039,0.0035749613,0.00041734293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011722838,0.0031027545,0.0025361835,0.01055493,0.0018592788,0.0042842743,0.0031710302,0.0009948096,0.0207233],"category_scores_gemma":[0.065884896,0.0011494346,0.0034911812,0.009752534,0.0015903102,0.0031453692,0.0032172303,0.0028000746,0.01475053],"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.00061351014,0.00023577342,0.013772873,0.0041803336,0.0030844565,0.0007720891,0.002834357,0.12304093,0.005874548,0.16687413,0.19301102,0.485706],"study_design_scores_gemma":[0.00017738559,0.00014652738,0.008538627,0.0005603465,0.0005364027,0.0006549372,0.0009521467,0.5285663,0.0085221175,0.2666013,0.18451898,0.00022497089],"about_ca_topic_score_codex":0.0054710954,"about_ca_topic_score_gemma":0.006331369,"teacher_disagreement_score":0.0207233,"about_ca_system_score_codex":0.0015143798,"about_ca_system_score_gemma":0.0035103604,"threshold_uncertainty_score":0.0693264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076585803,0.0056947344,0.9400217,0.0013622637,0.0006659762,0.00004851125,0.0010486188,0.0006476216,0.042851888],"genre_scores_gemma":[0.48599273,0.03330043,0.3150903,0.0006623271,0.0027225786,0.00035444106,0.00620409,0.0011413521,0.15453172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980277,0.000033180826,0.000011592079,0.00006920887,0.000070235095,0.000013074993],"domain_scores_gemma":[0.99959284,0.00012230272,0.000043090247,0.000105927174,0.00010880795,0.00002700289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045672996,0.0007053831,0.000522466,0.0018994305,0.00030173245,0.0013353486,0.0006923833,0.0004545106,0.005623459],"category_scores_gemma":[0.0019895516,0.0003796409,0.0005209064,0.001776105,0.00059576664,0.0021733441,0.0009283274,0.0008970906,0.0015971845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023751489,0.00002519081,0.001186702,0.00016376136,0.00008027082,0.00013500867,0.00013173863,0.10657356,0.0041904743,0.63000196,0.040455353,0.21703215],"study_design_scores_gemma":[0.0000029606438,0.000013121106,0.0014331759,0.000045202956,0.000028786257,0.00020547972,0.00007016745,0.43967018,0.0014696799,0.49830738,0.05873552,0.000018421464],"about_ca_topic_score_codex":0.002783678,"about_ca_topic_score_gemma":0.001854163,"teacher_disagreement_score":0.005623459,"about_ca_system_score_codex":0.0007631599,"about_ca_system_score_gemma":0.00039956946,"threshold_uncertainty_score":0.018812358},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043412153,0.0014871428,0.93962455,0.0008550218,0.000114975424,0.00013164108,0.0012367796,0.0010782401,0.012059586],"genre_scores_gemma":[0.45179287,0.0035957454,0.52004254,0.00043380435,0.0006599836,0.00043430415,0.005895574,0.0011009851,0.016044151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976127,0.00071570114,0.00017457257,0.00069608825,0.000657988,0.00014291488],"domain_scores_gemma":[0.9862298,0.010533034,0.00080507115,0.0013480347,0.0007361627,0.00034789054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018070464,0.0011798262,0.0012779465,0.0044156564,0.0009929693,0.002918159,0.0028252688,0.0013160545,0.00553805],"category_scores_gemma":[0.017764658,0.0011293337,0.0012732295,0.006283637,0.0014612575,0.009619959,0.0022876498,0.0020637685,0.00080671255],"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.0001086609,0.000086561005,0.0036386296,0.000720636,0.00013827028,0.00019162832,0.00048767315,0.06493059,0.002837616,0.748472,0.012423208,0.16596451],"study_design_scores_gemma":[0.000010271054,0.000011335469,0.00064961636,0.00006372077,0.00006284233,0.0001539569,0.00006298471,0.16419855,0.0011947452,0.828056,0.0055212905,0.000014678746],"about_ca_topic_score_codex":0.0024017913,"about_ca_topic_score_gemma":0.003450722,"teacher_disagreement_score":0.00553805,"about_ca_system_score_codex":0.0016445998,"about_ca_system_score_gemma":0.0006760464,"threshold_uncertainty_score":0.018526614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64533633,0.007180623,0.33421114,0.004088669,0.00036553916,0.00030730257,0.00063363847,0.0006531416,0.007223688],"genre_scores_gemma":[0.93729675,0.0023480915,0.05766209,0.00035769868,0.0006111184,0.00010927613,0.0005522047,0.00015405688,0.000908774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925655,0.0043443968,0.00034069378,0.001257561,0.0011395331,0.00035228967],"domain_scores_gemma":[0.74501234,0.23626137,0.0074315025,0.0051487777,0.005343703,0.0008023634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014707129,0.0015523334,0.0012871816,0.0027960194,0.0012741284,0.0028564823,0.00077460555,0.0017245125,0.0013778487],"category_scores_gemma":[0.10402687,0.0007936444,0.0013744215,0.0018719381,0.002213142,0.006139401,0.0011415831,0.0018753723,0.0005966702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024437152,0.00095167116,0.1759291,0.0021985646,0.0014887699,0.00084153377,0.003962261,0.24009098,0.053223845,0.017471483,0.0064807334,0.4949173],"study_design_scores_gemma":[0.000065146094,0.00072748226,0.076054454,0.00017673486,0.00042656943,0.00046433683,0.0007765133,0.8726979,0.016846059,0.02895469,0.0026639928,0.00014618783],"about_ca_topic_score_codex":0.0032022914,"about_ca_topic_score_gemma":0.0026949174,"teacher_disagreement_score":0.014707129,"about_ca_system_score_codex":0.0011769381,"about_ca_system_score_gemma":0.0005251344,"threshold_uncertainty_score":0.07777971},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026436402,0.00042631675,0.97110724,0.0003295414,0.000026752372,0.0000743949,0.00007240728,0.00025452458,0.0012724343],"genre_scores_gemma":[0.83416164,0.00069842214,0.1600938,0.0001838865,0.00013013554,0.00034731775,0.00024060156,0.00012525113,0.0040189796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982153,0.0009218489,0.000061753315,0.00032630606,0.00029352718,0.00018123256],"domain_scores_gemma":[0.99437994,0.004023626,0.0005679587,0.00041754142,0.0003849016,0.00022603494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036011552,0.0011718203,0.0016549858,0.0011651036,0.000784639,0.0014478863,0.002797473,0.0015134901,0.0013230325],"category_scores_gemma":[0.01183756,0.000729036,0.0010738478,0.0011340507,0.0016821304,0.002928014,0.0021830779,0.0015499428,0.00027161156],"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.00014359073,0.000083670944,0.0024601514,0.00014303911,0.0001226359,0.0001390685,0.00023323552,0.8995034,0.0012708937,0.058605865,0.0011994069,0.036095075],"study_design_scores_gemma":[0.000008817539,0.00003331067,0.00014142887,0.0000061133023,0.0000138624155,0.000017947512,0.000012177133,0.9868499,0.00022607965,0.012395707,0.00028733633,0.000007310109],"about_ca_topic_score_codex":0.0051876307,"about_ca_topic_score_gemma":0.0035724503,"teacher_disagreement_score":0.0051876307,"about_ca_system_score_codex":0.0016136051,"about_ca_system_score_gemma":0.0012647875,"threshold_uncertainty_score":0.019044936},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05332986,0.12862049,0.15927184,0.03217682,0.0021298402,0.0003326002,0.0016637737,0.00092745636,0.6215474],"genre_scores_gemma":[0.6988968,0.09648528,0.05098221,0.0026598603,0.0027647293,0.0005218796,0.00109517,0.0003198234,0.14627422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989046,0.00041017658,0.000041638225,0.00017995031,0.00037950833,0.000084087944],"domain_scores_gemma":[0.9972692,0.002069687,0.00015492592,0.00018543904,0.000243702,0.00007703079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013891271,0.0006339399,0.00045969267,0.0037974452,0.0013455893,0.005058381,0.00059010665,0.0020123436,0.0074015707],"category_scores_gemma":[0.005179762,0.0005066673,0.00046426855,0.0049466384,0.0018345567,0.009013139,0.0019973505,0.0016382312,0.0018214482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020992733,0.000032955224,0.0012827034,0.0005261328,0.000059417867,0.00021309793,0.0025677872,0.0037157761,0.0007400927,0.835762,0.023943426,0.13113558],"study_design_scores_gemma":[0.000015525917,0.000028277938,0.0025828958,0.00054365065,0.00003822686,0.00044529402,0.0013654146,0.02097877,0.001019785,0.5725675,0.40036023,0.00005443728],"about_ca_topic_score_codex":0.0022000598,"about_ca_topic_score_gemma":0.002687115,"teacher_disagreement_score":0.0074015707,"about_ca_system_score_codex":0.0019799995,"about_ca_system_score_gemma":0.0007126446,"threshold_uncertainty_score":0.024760664},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16214137,0.00049106736,0.8306228,0.000676812,0.000050680508,0.00004959387,0.00064426864,0.0002463883,0.0050770296],"genre_scores_gemma":[0.9265751,0.0007043167,0.06540343,0.000119771925,0.0001424556,0.0001253712,0.0010439947,0.000086918895,0.005798485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993166,0.0003102478,0.000027456132,0.00016716098,0.00013325064,0.00004534917],"domain_scores_gemma":[0.99457836,0.0034881427,0.00071591703,0.0004570657,0.00050613383,0.00025441224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081104046,0.00047816185,0.00037720057,0.0025633057,0.00045359152,0.0011760236,0.00064872677,0.0007243655,0.0019252598],"category_scores_gemma":[0.008317556,0.0003060869,0.00039065545,0.0013540004,0.0009148342,0.0022659677,0.0010894628,0.00080168125,0.00033204412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018560432,0.00022249165,0.0075572566,0.0002962943,0.00012459506,0.00022764997,0.00091383874,0.206561,0.00771224,0.653532,0.0060603777,0.11660664],"study_design_scores_gemma":[0.000006488522,0.000017262262,0.0013960669,0.000025120036,0.000014783612,0.00006923585,0.000117722506,0.7417957,0.0006957744,0.2531444,0.0027072355,0.000010242623],"about_ca_topic_score_codex":0.0012389123,"about_ca_topic_score_gemma":0.0014825432,"teacher_disagreement_score":0.0025633057,"about_ca_system_score_codex":0.00056016643,"about_ca_system_score_gemma":0.00034025058,"threshold_uncertainty_score":0.0064406395},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034806249,0.0003862823,0.99494886,0.00012552668,0.00006309242,0.000025462341,0.000023045335,0.00026857053,0.00067856465],"genre_scores_gemma":[0.13507596,0.0012846343,0.8587724,0.00022602557,0.00021051914,0.00019630982,0.00027118516,0.00017395156,0.0037890463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946576,0.0001294577,0.000031646283,0.000115154675,0.00021132552,0.000046619032],"domain_scores_gemma":[0.99942976,0.00027725394,0.00006117821,0.00006875093,0.00012372348,0.000039390306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088210776,0.000759549,0.00092560315,0.00073109916,0.00048338345,0.0009894571,0.0014288572,0.0013367083,0.0016006794],"category_scores_gemma":[0.0025963108,0.00037518743,0.00060151506,0.0012336627,0.00084782706,0.0017398454,0.0014001669,0.0015372612,0.00070992444],"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.000119346376,0.000058750815,0.00054007204,0.00015454911,0.00008185645,0.00007511391,0.00010361134,0.5706481,0.007117783,0.034045722,0.0056477888,0.38140732],"study_design_scores_gemma":[0.000016664539,0.00004099138,0.00007489448,0.000007567761,0.000007650259,0.00004238841,0.000008017105,0.98561096,0.0008440605,0.00918368,0.0041540978,0.000008949981],"about_ca_topic_score_codex":0.002973733,"about_ca_topic_score_gemma":0.0021229016,"teacher_disagreement_score":0.002973733,"about_ca_system_score_codex":0.00057439983,"about_ca_system_score_gemma":0.0011087065,"threshold_uncertainty_score":0.0059128404},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003022363,0.00008975228,0.9713973,0.000073176874,0.000036863534,0.000100271056,0.001235106,0.022834303,0.0012108749],"genre_scores_gemma":[0.032408614,0.00017098052,0.95560986,0.00007615937,0.000024610452,0.0004737453,0.0038004841,0.0040306775,0.0034048187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991615,0.00017624769,0.00007552761,0.0002623129,0.00026213465,0.00006226474],"domain_scores_gemma":[0.9975116,0.0015032978,0.00021839244,0.00040322848,0.00025874737,0.00010468276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016962837,0.0016358115,0.0010951213,0.003388846,0.0009755893,0.0020616641,0.002740792,0.0014141344,0.018075129],"category_scores_gemma":[0.00960213,0.0012689402,0.0019377539,0.0024331512,0.0008142161,0.0040092687,0.0023909688,0.0020894294,0.0046318346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048448244,0.00023280062,0.0042035016,0.0013094256,0.00055757095,0.00035824376,0.00078931084,0.1762292,0.016752705,0.08323281,0.0775008,0.6383491],"study_design_scores_gemma":[0.00015071972,0.00008075866,0.0007066365,0.00006452239,0.00005438701,0.0002903412,0.00011945447,0.8972584,0.007355455,0.054218166,0.03964235,0.00005881131],"about_ca_topic_score_codex":0.0052967872,"about_ca_topic_score_gemma":0.008312559,"teacher_disagreement_score":0.018075129,"about_ca_system_score_codex":0.00097292993,"about_ca_system_score_gemma":0.0017203122,"threshold_uncertainty_score":0.060467362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036997594,0.000053505304,0.9619455,0.00011944597,0.00002006816,0.00017964837,0.0001447716,0.00012375014,0.0004158353],"genre_scores_gemma":[0.47593704,0.000157033,0.5214512,0.0001301452,0.00005954045,0.0009864361,0.00044587083,0.00006152064,0.0007712543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.970044,0.024998188,0.00052413426,0.0028801116,0.0011453342,0.00040825806],"domain_scores_gemma":[0.7017271,0.25508645,0.013210096,0.024774862,0.0039928025,0.0012086012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.043688014,0.0014891125,0.0019255365,0.0024497549,0.0009786143,0.0018097794,0.0029382466,0.002622738,0.0037500083],"category_scores_gemma":[0.17307347,0.0011797673,0.0023111568,0.0019438862,0.0040166043,0.0044979956,0.0024211118,0.003268114,0.0005264889],"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.0013980794,0.00060194015,0.042260602,0.000637075,0.0007878719,0.00054890866,0.002194747,0.45913523,0.003713744,0.38061893,0.0018836417,0.10621923],"study_design_scores_gemma":[0.00010715896,0.00019921576,0.0022776905,0.00004106242,0.00005999664,0.00009140102,0.00010087486,0.8186653,0.0010703404,0.17652664,0.00082049024,0.000039860824],"about_ca_topic_score_codex":0.0019740635,"about_ca_topic_score_gemma":0.0021135593,"teacher_disagreement_score":0.043688014,"about_ca_system_score_codex":0.0019615262,"about_ca_system_score_gemma":0.0013077472,"threshold_uncertainty_score":0.23104703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6135176,0.000942113,0.37701643,0.0011169468,0.000045507866,0.000094117226,0.00052086456,0.0005327966,0.0062137544],"genre_scores_gemma":[0.9813192,0.00050497666,0.016177434,0.000084075895,0.000038909886,0.000088898785,0.00018352589,0.00005238095,0.0015506109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992725,0.0002120125,0.000038810213,0.00028037958,0.000120508004,0.00007565452],"domain_scores_gemma":[0.9932535,0.0038019815,0.001568547,0.0007691354,0.0003208301,0.00028598506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001423134,0.00033851262,0.0004792826,0.0017082982,0.00051766116,0.0020172324,0.00087167503,0.0009384767,0.001737318],"category_scores_gemma":[0.011880155,0.000501906,0.00048705447,0.0014777678,0.0016343124,0.005019497,0.0013476541,0.0010145245,0.00031036185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029437718,0.00015926275,0.13375337,0.00044344921,0.00029802992,0.00128193,0.006791136,0.34122065,0.019803926,0.39850533,0.0037353388,0.093713164],"study_design_scores_gemma":[0.000024107689,0.0000983566,0.043623883,0.000084735344,0.00007162792,0.0005721998,0.0011592469,0.65373963,0.0022984587,0.29291868,0.0053408314,0.00006817838],"about_ca_topic_score_codex":0.0023713615,"about_ca_topic_score_gemma":0.0017208306,"teacher_disagreement_score":0.0023713615,"about_ca_system_score_codex":0.0011629493,"about_ca_system_score_gemma":0.0003651938,"threshold_uncertainty_score":0.008437812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050201393,0.010296178,0.25520602,0.006407218,0.0019487556,0.001504553,0.033192717,0.18203875,0.5043856],"genre_scores_gemma":[0.117516294,0.017379085,0.2724288,0.0050679124,0.0033147437,0.0029764902,0.084925964,0.041512586,0.4548781],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981573,0.00042182425,0.00008828924,0.00026081866,0.0008837955,0.00018784504],"domain_scores_gemma":[0.9967013,0.00094016246,0.00018732542,0.0010951251,0.0006042269,0.00047183738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029714294,0.0014202995,0.0012090892,0.0029051392,0.0009491302,0.0073329695,0.0027918268,0.0027244592,0.1270802],"category_scores_gemma":[0.00863741,0.0010080674,0.0013198263,0.0027924269,0.00057424733,0.0058101676,0.0032138037,0.00231105,0.13282011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003164284,0.0001920776,0.001777573,0.00077540305,0.00014565348,0.00020633967,0.0002692359,0.0050494154,0.0025581138,0.14795856,0.4862181,0.35453302],"study_design_scores_gemma":[0.0000813212,0.00007365938,0.0008547822,0.00018746062,0.000031103413,0.0003645575,0.000052357354,0.023491982,0.0014823058,0.079231404,0.894072,0.00007711615],"about_ca_topic_score_codex":0.0024990041,"about_ca_topic_score_gemma":0.0015333528,"teacher_disagreement_score":0.1270802,"about_ca_system_score_codex":0.0010466754,"about_ca_system_score_gemma":0.001535363,"threshold_uncertainty_score":0.4251256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24153283,0.0021824234,0.5814687,0.012213584,0.0006844847,0.00049940904,0.0038756698,0.0011928907,0.15635006],"genre_scores_gemma":[0.84444475,0.00231639,0.02554603,0.0009879381,0.00045393847,0.00055056036,0.0007884293,0.00016137569,0.12475066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904674,0.00039055472,0.000037558475,0.00021888338,0.00013800865,0.00016825573],"domain_scores_gemma":[0.99720865,0.001649423,0.00041210064,0.00013203762,0.0002855047,0.0003121397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016343015,0.0014029224,0.0016161735,0.0016096475,0.0008186622,0.0025453945,0.0025420806,0.0039616134,0.014921502],"category_scores_gemma":[0.004560138,0.00073840603,0.0013284581,0.0016935791,0.0021122522,0.0037692508,0.0014428694,0.0022414129,0.0021943706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001873209,0.00010814237,0.00093915674,0.00017943078,0.000071791656,0.0007923497,0.00028654997,0.43488958,0.001812542,0.5495216,0.005504596,0.005706931],"study_design_scores_gemma":[0.00008969462,0.00007858352,0.00031227138,0.000025290583,0.000030582087,0.0001440263,0.00008176008,0.9190308,0.00017025058,0.07722359,0.0027809192,0.000032177188],"about_ca_topic_score_codex":0.0069651706,"about_ca_topic_score_gemma":0.0037212223,"teacher_disagreement_score":0.014921502,"about_ca_system_score_codex":0.002166872,"about_ca_system_score_gemma":0.00077364215,"threshold_uncertainty_score":0.04991746},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25092417,0.024314828,0.26044154,0.11899422,0.015342284,0.003283489,0.046738777,0.01476356,0.26519713],"genre_scores_gemma":[0.654895,0.0085534835,0.24132542,0.0068258964,0.0050029177,0.004416104,0.022403503,0.0031828484,0.053394824],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9216198,0.041299038,0.00797612,0.0043156487,0.022517338,0.0022721235],"domain_scores_gemma":[0.5410769,0.30151984,0.016458834,0.041462857,0.093737654,0.005743924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05835417,0.0012588587,0.0010758754,0.012185532,0.004664465,0.020130219,0.0026583502,0.0049183057,0.022792146],"category_scores_gemma":[0.314701,0.0011193159,0.0016056402,0.006757732,0.004022264,0.012855502,0.0050640763,0.005636647,0.015059474],"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.0024316073,0.00096165197,0.09139235,0.00523864,0.00038644535,0.001122461,0.02083435,0.0053754416,0.018591626,0.08001597,0.17367412,0.5999754],"study_design_scores_gemma":[0.0003162629,0.00075015356,0.07160783,0.0077136927,0.00046408165,0.0018987557,0.020303192,0.027687289,0.030865813,0.040617704,0.7973108,0.000464477],"about_ca_topic_score_codex":0.01902588,"about_ca_topic_score_gemma":0.018576546,"teacher_disagreement_score":0.05835417,"about_ca_system_score_codex":0.0037608624,"about_ca_system_score_gemma":0.0067758616,"threshold_uncertainty_score":0.30861002},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06706127,0.0003957073,0.9038111,0.00024362901,0.000043180935,0.00018332279,0.00083972444,0.023412235,0.004009857],"genre_scores_gemma":[0.4460721,0.0007640353,0.546693,0.0001454035,0.000046007015,0.00024265079,0.0013623405,0.00097074616,0.0037037372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996979,0.00008985965,0.00001823751,0.000087459026,0.00008113421,0.000025431425],"domain_scores_gemma":[0.9987613,0.0006138158,0.00007017337,0.00027022927,0.00018911627,0.00009545836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005585646,0.0009242641,0.0005863361,0.0012844158,0.000298927,0.0014360859,0.0010205674,0.0006860475,0.0060580643],"category_scores_gemma":[0.0028061583,0.00039613727,0.00055745087,0.00068730296,0.00024067432,0.0014485877,0.0025823172,0.0005736984,0.0007762412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015916768,0.00036028525,0.010222209,0.00091280916,0.00042057733,0.0011701598,0.005081905,0.10386518,0.12121589,0.015325386,0.025489014,0.714345],"study_design_scores_gemma":[0.000143362,0.00040360884,0.006846509,0.0001234762,0.0001517159,0.0007313058,0.00084997964,0.8944311,0.03827802,0.018868826,0.03903543,0.00013664702],"about_ca_topic_score_codex":0.0030314934,"about_ca_topic_score_gemma":0.0039462633,"teacher_disagreement_score":0.0060580643,"about_ca_system_score_codex":0.00033681214,"about_ca_system_score_gemma":0.00029503755,"threshold_uncertainty_score":0.020266235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07693422,0.005149456,0.73162407,0.0057113525,0.0017604658,0.00013120304,0.0011588995,0.0008495209,0.17668074],"genre_scores_gemma":[0.8165289,0.005312869,0.03225165,0.0005055759,0.0012803697,0.0001317178,0.0009660793,0.0001906442,0.14283217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982244,0.00003465586,0.0000047453796,0.000055293942,0.000058035104,0.000024788555],"domain_scores_gemma":[0.99946624,0.00026133162,0.00005262207,0.00005716311,0.000109362045,0.000053237283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026435428,0.00050463673,0.00027062465,0.00097092555,0.00048177416,0.0011255565,0.00055451767,0.0008802187,0.0076679313],"category_scores_gemma":[0.0027724404,0.00025719544,0.00032040733,0.0006510253,0.0007047528,0.0016994827,0.00073920377,0.000784857,0.0013298475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053520198,0.000048813577,0.0011014204,0.000108208566,0.000053924217,0.00023170511,0.00023978586,0.0708946,0.0040533873,0.7831039,0.0335835,0.106527224],"study_design_scores_gemma":[0.000017838249,0.00003509993,0.0012153126,0.000035270994,0.000031856365,0.0002762298,0.00009235825,0.5833524,0.0014816422,0.37626,0.03716826,0.00003370207],"about_ca_topic_score_codex":0.00555649,"about_ca_topic_score_gemma":0.003118524,"teacher_disagreement_score":0.0076679313,"about_ca_system_score_codex":0.0008596998,"about_ca_system_score_gemma":0.00030638094,"threshold_uncertainty_score":0.025651753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13820589,0.0007012839,0.85524535,0.0007021372,0.00009709959,0.00015546657,0.00067209674,0.0004004665,0.0038202873],"genre_scores_gemma":[0.9562206,0.00085520756,0.035931982,0.000087984015,0.000101575984,0.00025763104,0.0005764658,0.00005162812,0.005916866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926776,0.00023322219,0.000039411832,0.00019717668,0.00015756121,0.000104819956],"domain_scores_gemma":[0.9985176,0.00086835923,0.00022481086,0.00008775421,0.00023527959,0.00006617973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013626225,0.0009902923,0.000854583,0.0020128072,0.0004722175,0.0010309024,0.0014715638,0.001368613,0.0016889786],"category_scores_gemma":[0.0038729047,0.00039342852,0.0011405163,0.001613486,0.0005765038,0.0028672896,0.00059343857,0.001133757,0.0005953534],"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.00019243032,0.00018941084,0.017537469,0.00019876113,0.00024712877,0.00061845453,0.0008294298,0.82504314,0.0064592324,0.11640704,0.002490521,0.029786974],"study_design_scores_gemma":[0.000002970984,0.00002056586,0.0007112934,0.000004142408,0.000012156651,0.000038847455,0.000026325064,0.99348164,0.00013271943,0.0051967856,0.0003634231,0.0000092714645],"about_ca_topic_score_codex":0.008058031,"about_ca_topic_score_gemma":0.004535742,"teacher_disagreement_score":0.008058031,"about_ca_system_score_codex":0.001172091,"about_ca_system_score_gemma":0.0006059567,"threshold_uncertainty_score":0.016022265},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4710319,0.007492712,0.36768082,0.007796133,0.0042067794,0.00080965395,0.04387806,0.007319579,0.0897844],"genre_scores_gemma":[0.9198747,0.00084657955,0.026395472,0.00035645,0.0009253071,0.00018720038,0.019262217,0.00017805315,0.031973917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990369,0.00015091652,0.000050601782,0.00033146792,0.0002443329,0.00018570678],"domain_scores_gemma":[0.99652016,0.001768115,0.0003139913,0.0005966241,0.0005241097,0.0002769793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010321116,0.0009208258,0.0011378272,0.0026534998,0.00071663794,0.0011245357,0.0017551073,0.001310252,0.01287987],"category_scores_gemma":[0.007171523,0.00022149472,0.00091204786,0.002582622,0.0003604146,0.001901262,0.001060214,0.0022048445,0.00608298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009255224,0.0013256087,0.11763502,0.0002872109,0.0003548228,0.00086227054,0.00012308829,0.12053158,0.0016597597,0.019697651,0.17839469,0.5582028],"study_design_scores_gemma":[0.00001971587,0.00008402856,0.013459773,0.0000488535,0.000057423124,0.00036660783,0.00008366928,0.9524037,0.0011654891,0.024904588,0.007380617,0.000025649317],"about_ca_topic_score_codex":0.008686877,"about_ca_topic_score_gemma":0.013624348,"teacher_disagreement_score":0.01287987,"about_ca_system_score_codex":0.00063576695,"about_ca_system_score_gemma":0.00077336316,"threshold_uncertainty_score":0.043087482},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112971336,0.00027632178,0.8786529,0.00039454602,0.000053536267,0.00016267203,0.00032195935,0.0044081374,0.0027585574],"genre_scores_gemma":[0.43542123,0.00012822282,0.56156766,0.00007255756,0.00004080242,0.00020728193,0.00067172706,0.00020808389,0.0016824533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992254,0.00015693565,0.00005312192,0.00019948104,0.0002485979,0.00011649828],"domain_scores_gemma":[0.9968309,0.0015210729,0.00030975777,0.00057636533,0.00052547146,0.00023639588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008465355,0.0008393895,0.0010993053,0.0020927687,0.0011610792,0.0014079958,0.0014817718,0.001101075,0.0029620824],"category_scores_gemma":[0.008265854,0.0007186113,0.00078752224,0.0017128893,0.0006436577,0.0031387617,0.0018698322,0.0010146904,0.0011006278],"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.00055498787,0.00025925203,0.007604922,0.00029069177,0.00013510058,0.00038429652,0.00047204748,0.60019124,0.015396307,0.021435378,0.008000676,0.34527504],"study_design_scores_gemma":[0.000019342122,0.000011288973,0.00033641155,0.0000035221904,0.0000049165483,0.000028684579,0.000026872041,0.98485094,0.0010641232,0.0132644195,0.00038485727,0.0000045976412],"about_ca_topic_score_codex":0.004655415,"about_ca_topic_score_gemma":0.0073964465,"teacher_disagreement_score":0.004655415,"about_ca_system_score_codex":0.0012014221,"about_ca_system_score_gemma":0.0012413338,"threshold_uncertainty_score":0.009909153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015276597,0.00041971356,0.9801553,0.00040699184,0.000031680025,0.000061168765,0.00018356976,0.00011033704,0.003354679],"genre_scores_gemma":[0.76696897,0.002579615,0.2247073,0.00042570266,0.00033891684,0.0005679755,0.000361218,0.00010748682,0.0039428496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917394,0.0003769591,0.000042280455,0.00017483711,0.00015844309,0.00007350924],"domain_scores_gemma":[0.99527293,0.0030195022,0.0009006237,0.00040533632,0.00022594404,0.00017568721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019289945,0.0010355632,0.0007516233,0.0033683074,0.00085835,0.0015065832,0.0018833464,0.0018856163,0.0033578645],"category_scores_gemma":[0.0100128,0.0005088851,0.0013216032,0.0019522923,0.0019729056,0.0038953037,0.0014130285,0.0019350639,0.0004554728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009284708,0.000029510482,0.0013334256,0.000056939494,0.0000527338,0.00019462177,0.00012671672,0.34167582,0.0018042899,0.6492868,0.0007245755,0.0047052815],"study_design_scores_gemma":[0.0000048602756,0.00002141701,0.0006058953,0.000017509836,0.000016763033,0.00011590089,0.00003191445,0.59949046,0.00018612063,0.39771676,0.0017743172,0.000017956929],"about_ca_topic_score_codex":0.0031775937,"about_ca_topic_score_gemma":0.001689536,"teacher_disagreement_score":0.0033683074,"about_ca_system_score_codex":0.001276268,"about_ca_system_score_gemma":0.0007914255,"threshold_uncertainty_score":0.011233151},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040204857,0.00029875644,0.9574939,0.00021228426,0.000034206972,0.000058778216,0.00020715836,0.00068395224,0.0008061333],"genre_scores_gemma":[0.5677697,0.00056465255,0.4273596,0.0002079059,0.0001289991,0.00019672688,0.0018372557,0.00027409618,0.0016610502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978383,0.00094147335,0.0000880228,0.00048767964,0.00049651164,0.0001479668],"domain_scores_gemma":[0.9826622,0.012479613,0.0011628657,0.0023388779,0.0010154947,0.00034088417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00209224,0.00079529936,0.0011761065,0.0021048908,0.0007302065,0.0011197366,0.0020949265,0.0013136513,0.0015742404],"category_scores_gemma":[0.025980443,0.0006734167,0.00080847024,0.0019847844,0.0010117186,0.0030307265,0.0016036708,0.0013153232,0.00076550455],"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.00040547788,0.0001185661,0.017896893,0.00032883763,0.00015836874,0.00046297425,0.00051230524,0.72195596,0.010371239,0.052318413,0.0068004895,0.18867047],"study_design_scores_gemma":[0.000010256799,0.000016631211,0.0008337145,0.000008969273,0.000006541167,0.0000738241,0.000046900175,0.9716545,0.0010453119,0.025511801,0.0007830652,0.000008450743],"about_ca_topic_score_codex":0.0046702065,"about_ca_topic_score_gemma":0.0053350744,"teacher_disagreement_score":0.0046702065,"about_ca_system_score_codex":0.00069302105,"about_ca_system_score_gemma":0.00051153183,"threshold_uncertainty_score":0.011064947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55414563,0.00082066364,0.37742078,0.0039443183,0.0010132794,0.0005380042,0.018602131,0.017098373,0.026416833],"genre_scores_gemma":[0.8826257,0.00037651882,0.103215665,0.00043504385,0.00015054914,0.0006279687,0.0051444885,0.0009859672,0.006438174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964774,0.00017307136,0.000015673622,0.000057585872,0.00006373117,0.000042121002],"domain_scores_gemma":[0.99573874,0.003277764,0.00014432335,0.00034453394,0.00019917516,0.00029548485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008978795,0.00083013764,0.00091115496,0.00078215986,0.0010400837,0.0011816786,0.0030346597,0.002333043,0.010861387],"category_scores_gemma":[0.0073478157,0.0007212128,0.00094699446,0.0010975192,0.0007689873,0.0017067988,0.0011925107,0.0021842655,0.0011922965],"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.00016491865,0.00015370437,0.0025328824,0.00012014506,0.00012132677,0.000122754,0.00014696985,0.9679327,0.0005465156,0.0150659615,0.0073043006,0.0057878285],"study_design_scores_gemma":[0.000034962948,0.000009515482,0.00012215739,0.0000032543596,0.000005563485,0.0000070707665,0.000012998012,0.994747,0.00014706425,0.004206455,0.0006984525,0.0000053673953],"about_ca_topic_score_codex":0.01812898,"about_ca_topic_score_gemma":0.022014262,"teacher_disagreement_score":0.01812898,"about_ca_system_score_codex":0.0010077404,"about_ca_system_score_gemma":0.0014510528,"threshold_uncertainty_score":0.03633499},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31269848,0.0005776765,0.65973717,0.0018455316,0.00025021256,0.00037314143,0.00028127324,0.0071184603,0.017118154],"genre_scores_gemma":[0.91991174,0.00012513624,0.07683866,0.000107341155,0.00005330207,0.0001240391,0.00014772662,0.00013723293,0.0025548944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742764,0.000991214,0.000079526246,0.00031781115,0.00079548516,0.00038833622],"domain_scores_gemma":[0.99682474,0.0012687859,0.00018498978,0.00077419734,0.0007171889,0.00023018246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00248076,0.0008621291,0.0009788325,0.0011628838,0.0019580305,0.001434445,0.002395085,0.00070476154,0.0019505937],"category_scores_gemma":[0.00586723,0.0002893001,0.0006741179,0.0015432811,0.0007538146,0.0023248873,0.0019264184,0.00072135316,0.00053104176],"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.0012486078,0.0013252767,0.0076181106,0.0003920779,0.00028794308,0.00035458262,0.0013518023,0.5083068,0.02749545,0.03342276,0.021884613,0.39631206],"study_design_scores_gemma":[0.000053127787,0.000108696804,0.0009071618,0.0000041094413,0.000037906124,0.00006959627,0.00028105002,0.97501945,0.0088520525,0.010994717,0.0036512455,0.000020849793],"about_ca_topic_score_codex":0.007340891,"about_ca_topic_score_gemma":0.008478133,"teacher_disagreement_score":0.007340891,"about_ca_system_score_codex":0.0012557912,"about_ca_system_score_gemma":0.0023080364,"threshold_uncertainty_score":0.014596283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022675786,0.00041375952,0.97468084,0.00039301813,0.000019338075,0.00007766149,0.00008599837,0.00018000237,0.0014736922],"genre_scores_gemma":[0.7317803,0.0010916617,0.26218742,0.00027829836,0.00016221059,0.0004902862,0.00038079798,0.00019485294,0.0034342473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968727,0.0017313947,0.000121041034,0.00066490716,0.000396071,0.00021385387],"domain_scores_gemma":[0.98121476,0.015884487,0.0011955898,0.000877679,0.0004948883,0.00033268298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063352794,0.001711823,0.0024443993,0.0021549556,0.00083884026,0.0023620338,0.003056147,0.0021126322,0.0018285259],"category_scores_gemma":[0.026481505,0.0013698798,0.0014082654,0.0023329717,0.0031906473,0.005333093,0.0024978314,0.0020427743,0.00040356404],"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.00013774808,0.00007660185,0.0015861527,0.00024243002,0.000102693826,0.00010224772,0.00024727377,0.84755605,0.0016561478,0.11634334,0.0013123191,0.030636942],"study_design_scores_gemma":[0.000013057906,0.000016139498,0.00013977001,0.000010936666,0.00000855644,0.00001846903,0.000013931056,0.9514596,0.0003509022,0.047659867,0.0003001423,0.000008548936],"about_ca_topic_score_codex":0.0031637915,"about_ca_topic_score_gemma":0.002950142,"teacher_disagreement_score":0.0063352794,"about_ca_system_score_codex":0.0027500468,"about_ca_system_score_gemma":0.0011260218,"threshold_uncertainty_score":0.033504546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012970204,0.00021135983,0.98607314,0.00014510211,0.000015071368,0.000025232936,0.00007123894,0.00012424492,0.00036445423],"genre_scores_gemma":[0.48602554,0.00069134537,0.50895375,0.00027390674,0.00012820047,0.0003802385,0.00094837963,0.00012718703,0.002471355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989561,0.0005411972,0.00003040919,0.0002060044,0.0001670556,0.000099267854],"domain_scores_gemma":[0.99527895,0.003711947,0.00043901615,0.0001630526,0.00029297342,0.00011416064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021987902,0.0011539937,0.0013991052,0.000999694,0.0006719409,0.0010952047,0.0015061995,0.0013449115,0.0013855894],"category_scores_gemma":[0.0073886197,0.00081696734,0.0011458243,0.0009873164,0.001066796,0.0017799854,0.0010758978,0.0014152654,0.00039150848],"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.00007355477,0.000067947876,0.0017117817,0.00010815822,0.00009786613,0.00009896913,0.00014568068,0.9193551,0.0011908995,0.04664784,0.0015964868,0.028905625],"study_design_scores_gemma":[0.000004096196,0.0000037938576,0.000056893678,0.0000019105225,0.000002409426,0.0000043544396,0.0000043909577,0.9917497,0.00004995464,0.007976421,0.00014321714,0.0000027754654],"about_ca_topic_score_codex":0.015694506,"about_ca_topic_score_gemma":0.01488875,"teacher_disagreement_score":0.015694506,"about_ca_system_score_codex":0.0010668925,"about_ca_system_score_gemma":0.0014891054,"threshold_uncertainty_score":0.03120631},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01886473,0.00010281582,0.9794359,0.00004940629,0.0000081671,0.000053277716,0.00005774875,0.0000764625,0.0013514473],"genre_scores_gemma":[0.47910357,0.00042059022,0.51551044,0.0000669136,0.00003463439,0.00039814605,0.0005378548,0.00010087159,0.003827064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938715,0.00018834625,0.000027718012,0.00018985316,0.00015107758,0.000055810073],"domain_scores_gemma":[0.99870026,0.0007128939,0.00021858345,0.000104589024,0.00021580297,0.00004780459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088662904,0.000950739,0.000590499,0.0020766468,0.0006548186,0.00087898504,0.0007944991,0.0006380234,0.0018472405],"category_scores_gemma":[0.0031927486,0.00043740426,0.0010497331,0.0012604437,0.00079620397,0.0017704893,0.0008931541,0.0006537128,0.00021738104],"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.000038030164,0.00004031507,0.0017147604,0.00012367593,0.000049638064,0.00010148816,0.00013649082,0.9024386,0.004646859,0.041161966,0.0006191515,0.048929047],"study_design_scores_gemma":[0.000003321359,0.00001426641,0.00033800746,0.0000068881477,0.000011143641,0.000026449252,0.000020766967,0.98343384,0.0006634019,0.014745092,0.0007307844,0.000005980989],"about_ca_topic_score_codex":0.0040758164,"about_ca_topic_score_gemma":0.0047180443,"teacher_disagreement_score":0.0040758164,"about_ca_system_score_codex":0.0011943238,"about_ca_system_score_gemma":0.00077828026,"threshold_uncertainty_score":0.008665502},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48554212,0.0064822957,0.0769385,0.028180402,0.003328181,0.0004496615,0.0019791042,0.0011538615,0.3959459],"genre_scores_gemma":[0.9051752,0.001392446,0.0057309815,0.0018563768,0.0012942173,0.00009811751,0.00037237673,0.00015371987,0.08392654],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982279,0.0006700982,0.000042788415,0.00043628537,0.00039714688,0.00022582892],"domain_scores_gemma":[0.9933903,0.002053145,0.0009072777,0.0007449041,0.0010892255,0.0018151327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001230908,0.000489205,0.00060525833,0.0013440901,0.0029458797,0.0025411122,0.0006233827,0.0014028536,0.024463193],"category_scores_gemma":[0.011745221,0.00027995487,0.00042134026,0.0012139665,0.0007290804,0.0032249924,0.0013957303,0.0012191195,0.0062782858],"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.00066824333,0.0012016788,0.17605388,0.0010203029,0.0010123049,0.0035534299,0.018880099,0.003963733,0.011190165,0.15834646,0.17072275,0.45338696],"study_design_scores_gemma":[0.00015464102,0.0006582,0.11335869,0.00042404808,0.0011928314,0.006374276,0.02219347,0.033186607,0.010364429,0.17077316,0.641076,0.00024363997],"about_ca_topic_score_codex":0.0040733516,"about_ca_topic_score_gemma":0.0059962613,"teacher_disagreement_score":0.024463193,"about_ca_system_score_codex":0.00066073926,"about_ca_system_score_gemma":0.00064215163,"threshold_uncertainty_score":0.081837595},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025612451,0.0005176116,0.9706335,0.00072168704,0.00005011582,0.000061774095,0.00028915505,0.0005030614,0.0016105796],"genre_scores_gemma":[0.6778193,0.0012959454,0.31332144,0.00034833542,0.00026255246,0.0003315276,0.0016583197,0.00026418356,0.0046984176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981433,0.000869249,0.000109868444,0.00045299108,0.0002881188,0.0001365177],"domain_scores_gemma":[0.9685015,0.02755608,0.0013516281,0.0009321277,0.0012979177,0.00036076998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006651568,0.0012748799,0.002266634,0.0025250185,0.00098673,0.002409509,0.003081059,0.0025725767,0.0035877696],"category_scores_gemma":[0.048730236,0.0016676156,0.0013377399,0.0019629418,0.0016986204,0.0044750283,0.0018559713,0.004055293,0.0006974177],"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.00008867091,0.000052547148,0.0014669767,0.00008182025,0.00005648088,0.00005817493,0.00008579957,0.93267536,0.00039801217,0.043086518,0.0011711534,0.020778477],"study_design_scores_gemma":[0.0000081398675,0.000002994236,0.000109995904,0.0000071658983,0.000004053133,0.0000059759295,0.0000044254216,0.98165303,0.000083209205,0.017976077,0.00013993717,0.0000049794803],"about_ca_topic_score_codex":0.020941693,"about_ca_topic_score_gemma":0.02025054,"teacher_disagreement_score":0.020941693,"about_ca_system_score_codex":0.0029414461,"about_ca_system_score_gemma":0.0022596172,"threshold_uncertainty_score":0.041639626},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84676576,0.00060854893,0.11391863,0.0021798462,0.00004384976,0.00007265142,0.00022129779,0.0000837108,0.03610566],"genre_scores_gemma":[0.9876628,0.0001953624,0.010974281,0.000047329046,0.000013707637,0.000037072652,0.00012256917,0.000009817252,0.00093707215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989706,0.00059919595,0.000041282623,0.00015518283,0.00014544195,0.0000882756],"domain_scores_gemma":[0.99490803,0.0031676053,0.0010530297,0.0002980106,0.00032917786,0.00024412687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017207527,0.00024201584,0.00026835717,0.002123714,0.0011387792,0.0023801234,0.0006228351,0.0007501953,0.0030548861],"category_scores_gemma":[0.011174095,0.00020078656,0.00029995333,0.001619016,0.0020348954,0.0058898567,0.0028218064,0.0010113656,0.00026826025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001905287,0.0002120634,0.13201767,0.00031994734,0.00013600575,0.00088251533,0.052741077,0.024138378,0.0034535895,0.66135603,0.0035465169,0.121005684],"study_design_scores_gemma":[0.000028984536,0.000086947184,0.07278085,0.00016843551,0.00008433489,0.00053303526,0.05353316,0.16295578,0.0015777581,0.6790163,0.029177023,0.000057482997],"about_ca_topic_score_codex":0.003991141,"about_ca_topic_score_gemma":0.004255882,"teacher_disagreement_score":0.003991141,"about_ca_system_score_codex":0.00072357355,"about_ca_system_score_gemma":0.0003884786,"threshold_uncertainty_score":0.010219634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117150694,0.0020287032,0.87098527,0.00051684224,0.0002913802,0.0001814316,0.003216334,0.0010885305,0.0045408006],"genre_scores_gemma":[0.75493884,0.0011985842,0.23598666,0.00012261463,0.00025251,0.00033317655,0.0052764243,0.00012857467,0.0017626721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982967,0.00039784182,0.00022033339,0.0003464858,0.0006459785,0.00009276775],"domain_scores_gemma":[0.994251,0.002162252,0.0012912091,0.0006430416,0.0013566179,0.0002958303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012548041,0.00092861266,0.00082077243,0.0056129205,0.00064732635,0.0010985369,0.0015413985,0.0011171082,0.0011152544],"category_scores_gemma":[0.0107318,0.00022761863,0.00060679065,0.005147653,0.0006056955,0.0045216745,0.0011952701,0.00080803473,0.0005714121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044572892,0.00035670793,0.07472285,0.0008791252,0.00041001543,0.00054558174,0.0004318892,0.31617385,0.010460625,0.048206974,0.01764773,0.529719],"study_design_scores_gemma":[0.000014706045,0.00019377569,0.0073066507,0.000052221258,0.000084580985,0.00043316733,0.00015198377,0.955619,0.0033660182,0.02633214,0.0063943854,0.000051303254],"about_ca_topic_score_codex":0.0025545063,"about_ca_topic_score_gemma":0.004238219,"teacher_disagreement_score":0.0056129205,"about_ca_system_score_codex":0.0008874565,"about_ca_system_score_gemma":0.0007121049,"threshold_uncertainty_score":0.006636083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8336827,0.0010430891,0.15529136,0.0007356048,0.0003069236,0.00030727257,0.0019462378,0.0011219137,0.0055649537],"genre_scores_gemma":[0.9750201,0.00032442168,0.019961629,0.000053743417,0.00011635766,0.000078209036,0.0011658865,0.00003878709,0.003240891],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987534,0.00023705293,0.00012051067,0.00037950068,0.00037165786,0.00013778602],"domain_scores_gemma":[0.9920298,0.0039702966,0.0012058455,0.0006826763,0.0017860782,0.00032529817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015878432,0.00123356,0.0008684074,0.0036900784,0.00075936585,0.0012872111,0.001077748,0.0010736372,0.0010986201],"category_scores_gemma":[0.008722287,0.00031219228,0.000826045,0.002303104,0.00037304414,0.0035111448,0.00067644694,0.0012408693,0.000979752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095340016,0.00095963327,0.563135,0.0004060608,0.0005360074,0.0014616775,0.0013627424,0.078719914,0.012932438,0.0048999763,0.008043582,0.3265895],"study_design_scores_gemma":[0.000013816532,0.00023361605,0.055322915,0.00003108551,0.00019748781,0.00047896884,0.00036680553,0.9309993,0.0062615415,0.0037998925,0.0022267334,0.00006775366],"about_ca_topic_score_codex":0.008318941,"about_ca_topic_score_gemma":0.011995138,"teacher_disagreement_score":0.008318941,"about_ca_system_score_codex":0.0005115979,"about_ca_system_score_gemma":0.00047249423,"threshold_uncertainty_score":0.016541004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027600199,0.0011982945,0.9885748,0.0006267911,0.00007400086,0.0000602067,0.00012696575,0.00015771635,0.0064212517],"genre_scores_gemma":[0.51695114,0.012190993,0.45265007,0.0009207659,0.0013779334,0.0019663302,0.00058250857,0.0004772119,0.012882991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987061,0.00054584834,0.00006132473,0.00017448282,0.00040777383,0.000104539875],"domain_scores_gemma":[0.9971097,0.0019381001,0.00030107345,0.0003015953,0.00023822594,0.000111380396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001854269,0.0014229456,0.0010934065,0.0023296878,0.0009565445,0.0023947114,0.0023139215,0.001750516,0.0042751306],"category_scores_gemma":[0.0076524364,0.00051537546,0.0013027888,0.0022002407,0.0028369657,0.004535264,0.001263729,0.0024446016,0.0013833079],"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.0000059738563,0.000013228073,0.00010022782,0.0000826128,0.000021686,0.000069413276,0.000059317594,0.10063458,0.0005729958,0.89234823,0.0009542156,0.0051374035],"study_design_scores_gemma":[0.000011582753,0.00002896806,0.000091912225,0.000028519034,0.0000100514935,0.000077127654,0.00003092752,0.28806585,0.0001950603,0.7036324,0.007813005,0.000014663634],"about_ca_topic_score_codex":0.0014134592,"about_ca_topic_score_gemma":0.00054953207,"teacher_disagreement_score":0.0042751306,"about_ca_system_score_codex":0.0017771409,"about_ca_system_score_gemma":0.0009642439,"threshold_uncertainty_score":0.014301777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5491722,0.0009193057,0.43543434,0.0015186719,0.00012947318,0.0001663163,0.00006674382,0.00013875721,0.012454137],"genre_scores_gemma":[0.9697955,0.00040859822,0.0271185,0.000120341734,0.000051081235,0.00010201706,0.000044432316,0.00002761142,0.0023318357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992681,0.00038909417,0.000025535785,0.00014639719,0.000080334794,0.00009060659],"domain_scores_gemma":[0.99492514,0.0035098847,0.00053053076,0.00038447298,0.00041399302,0.00023593247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017624317,0.00052355183,0.00060103537,0.0010883398,0.0010605393,0.0013336012,0.001280862,0.001391521,0.0019966615],"category_scores_gemma":[0.013966122,0.0002539527,0.00073065376,0.00072111597,0.00172063,0.002897996,0.0011387066,0.0008967949,0.00014491972],"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.00007190423,0.00012474977,0.014266355,0.00011169642,0.00016983629,0.0003705026,0.0009938714,0.83209133,0.0028527922,0.11579138,0.0012298994,0.031925682],"study_design_scores_gemma":[0.0000072084094,0.000049204948,0.0011518551,0.000010926515,0.000020614669,0.00007040255,0.00014824058,0.9840846,0.00029039048,0.0135248145,0.0006319068,0.000009793157],"about_ca_topic_score_codex":0.0047435965,"about_ca_topic_score_gemma":0.0023532093,"teacher_disagreement_score":0.0047435965,"about_ca_system_score_codex":0.0011762623,"about_ca_system_score_gemma":0.0006878184,"threshold_uncertainty_score":0.009432018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058790605,0.991231,0.0057982863,0.0010153292,0.00020385963,0.00000872648,0.000090097026,0.000025603144,0.0010392062],"genre_scores_gemma":[0.005101356,0.98819375,0.005343029,0.00031214434,0.00037347848,0.0000147836345,0.000109247005,0.0000062382946,0.0005459202],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995995,0.00009752543,0.00003165704,0.00011378545,0.00013235469,0.000025102556],"domain_scores_gemma":[0.99809176,0.0012949683,0.00022944101,0.00006993445,0.00021425448,0.00009969594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014645925,0.0013634333,0.0017909475,0.0041834656,0.00027796047,0.0023030676,0.0011869645,0.001275229,0.0016948608],"category_scores_gemma":[0.003107107,0.00037686538,0.0008392712,0.0040409267,0.0011836952,0.003493858,0.0012894106,0.0020716714,0.00066282565],"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.000047252604,0.000055591387,0.001984118,0.012242231,0.00045677842,0.00018404888,0.00016890194,0.0025473034,0.00395846,0.031874016,0.008194329,0.93828696],"study_design_scores_gemma":[0.000022233928,0.00016423826,0.009103488,0.01269469,0.0009553825,0.0021043518,0.00061425834,0.0063759987,0.0036821915,0.1535429,0.81058115,0.00015907227],"about_ca_topic_score_codex":0.0019495117,"about_ca_topic_score_gemma":0.0034660085,"teacher_disagreement_score":0.0041834656,"about_ca_system_score_codex":0.0007797445,"about_ca_system_score_gemma":0.0016847333,"threshold_uncertainty_score":0.007745564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27403173,0.00059837516,0.72152406,0.000714721,0.000029049017,0.00017478647,0.0008210905,0.00034305183,0.0017631375],"genre_scores_gemma":[0.941363,0.00016898636,0.056845598,0.00008646129,0.00004879182,0.00009200754,0.0004976189,0.000023083634,0.0008744084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592376,0.002166991,0.00020613217,0.0007774115,0.00059267547,0.00033303775],"domain_scores_gemma":[0.98448306,0.010044402,0.0022911676,0.0016496768,0.0010813253,0.00045024598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059433756,0.00075602316,0.0013271715,0.0022934875,0.0005734428,0.0017928572,0.0017256284,0.0014199412,0.00081859244],"category_scores_gemma":[0.022189634,0.00043501038,0.000876628,0.002714509,0.0010942568,0.0033045323,0.00136996,0.0016989883,0.00024788006],"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.0014379552,0.0010793316,0.0776319,0.0003748546,0.0005337426,0.0011126008,0.00071763695,0.577844,0.008254045,0.085722215,0.0038688236,0.24142286],"study_design_scores_gemma":[0.000008714293,0.00007436402,0.003709982,0.0000073065576,0.0000134544225,0.00006961897,0.000059941398,0.9809512,0.0007529099,0.014066048,0.00026743885,0.000018957826],"about_ca_topic_score_codex":0.0050908313,"about_ca_topic_score_gemma":0.0054551284,"teacher_disagreement_score":0.0059433756,"about_ca_system_score_codex":0.0014278236,"about_ca_system_score_gemma":0.0007214958,"threshold_uncertainty_score":0.031431913},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022874307,0.012871585,0.72530735,0.07015174,0.001396922,0.00032819813,0.00031531038,0.00050686375,0.16624767],"genre_scores_gemma":[0.5805901,0.0181659,0.3748914,0.005192858,0.0022658869,0.0009685437,0.0004424318,0.00020449674,0.0172783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99203014,0.0051760133,0.00023623224,0.0009224289,0.0014389605,0.00019610618],"domain_scores_gemma":[0.96272707,0.028693091,0.0011963159,0.0049868464,0.0018483863,0.0005482257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012122521,0.00096035196,0.0009934325,0.002055519,0.0019822612,0.0041335695,0.002187807,0.0021075746,0.013489651],"category_scores_gemma":[0.04559327,0.00044286222,0.0006632999,0.0013174477,0.011272247,0.009409069,0.00495608,0.0051793666,0.0015700302],"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.0000105074205,0.000043731216,0.0003441479,0.00029110405,0.000021044854,0.000065396576,0.00047189064,0.0039662365,0.0003386034,0.97316563,0.0039069974,0.01737466],"study_design_scores_gemma":[0.000008133331,0.00002192053,0.00015927956,0.00010641162,0.000003956572,0.00005564816,0.00033229415,0.0065866006,0.00023408985,0.9702354,0.022249052,0.0000071498266],"about_ca_topic_score_codex":0.00076715206,"about_ca_topic_score_gemma":0.0007959699,"teacher_disagreement_score":0.013489651,"about_ca_system_score_codex":0.0024385892,"about_ca_system_score_gemma":0.002454815,"threshold_uncertainty_score":0.064110816},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25661755,0.0011776922,0.73623043,0.00054694276,0.000034908076,0.00013297607,0.002084667,0.00083628186,0.0023385705],"genre_scores_gemma":[0.85836256,0.0006797582,0.13751613,0.000045219967,0.0000516814,0.00016217059,0.0014344894,0.00015413186,0.0015938733],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993268,0.00017708563,0.000041237086,0.00024709073,0.00015032402,0.00005746065],"domain_scores_gemma":[0.9916979,0.0046470477,0.0017139749,0.00089632114,0.00069687836,0.0003479165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015333644,0.0008016847,0.00065892184,0.0071328036,0.0008701258,0.0020100225,0.0012312281,0.0010233124,0.003034873],"category_scores_gemma":[0.01571527,0.00046921687,0.00054651266,0.004812321,0.0010830443,0.0048611457,0.0013846918,0.0013178794,0.0005217487],"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.00084934407,0.00027118955,0.12348479,0.00084019057,0.00064296834,0.0004909784,0.0033115186,0.2767715,0.04400111,0.095907606,0.0060646795,0.4473641],"study_design_scores_gemma":[0.000015943393,0.00006324314,0.028672047,0.00007793489,0.0001453155,0.00024434767,0.00071100274,0.82066095,0.00452824,0.14147462,0.0033657455,0.000040651736],"about_ca_topic_score_codex":0.0049704406,"about_ca_topic_score_gemma":0.008414771,"teacher_disagreement_score":0.0071328036,"about_ca_system_score_codex":0.0011295355,"about_ca_system_score_gemma":0.000621516,"threshold_uncertainty_score":0.010152638},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2206852,0.0009256181,0.76464736,0.0025798208,0.00008662803,0.0001520765,0.0006206867,0.0004986242,0.009804034],"genre_scores_gemma":[0.9629627,0.00054460356,0.032730453,0.00036478668,0.0001764254,0.00028880322,0.00035062377,0.00017258653,0.0024091152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654156,0.0013168687,0.00011183705,0.0009178153,0.00076230284,0.00034964262],"domain_scores_gemma":[0.89781195,0.08523419,0.006959454,0.0054070647,0.0027549427,0.0018323773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008872047,0.0008232908,0.0018407702,0.0018525135,0.0010460324,0.002561654,0.004081329,0.001804365,0.0042852527],"category_scores_gemma":[0.062289886,0.0009423619,0.001365197,0.0008856269,0.006200161,0.007304427,0.0027582925,0.0042151758,0.00030274643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020380056,0.00011251533,0.003777772,0.00028178774,0.00013989332,0.0002943097,0.0004986823,0.18193482,0.005381964,0.79624647,0.002319139,0.008808808],"study_design_scores_gemma":[0.000028751292,0.00004802787,0.0009354118,0.000030396419,0.00003301181,0.00010534452,0.000050657876,0.6535617,0.0012947716,0.3432848,0.0005920866,0.00003501307],"about_ca_topic_score_codex":0.0026772807,"about_ca_topic_score_gemma":0.001702635,"teacher_disagreement_score":0.008872047,"about_ca_system_score_codex":0.0031701878,"about_ca_system_score_gemma":0.0013186659,"threshold_uncertainty_score":0.04692042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1510611,0.00021074124,0.8457775,0.00030482546,0.000057534988,0.00014766649,0.000596061,0.00042487902,0.001419732],"genre_scores_gemma":[0.9212251,0.0002599295,0.07516432,0.00007262111,0.00010257129,0.00025625943,0.0012402165,0.000049974286,0.0016290977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933213,0.0003329817,0.000038745293,0.00013616808,0.00010616489,0.00005388832],"domain_scores_gemma":[0.9958311,0.0030063344,0.00037642705,0.00037173086,0.00029011123,0.00012434373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021981085,0.0006722817,0.0005821835,0.00081511546,0.00043351867,0.00064179185,0.0012074496,0.0006724204,0.0014256611],"category_scores_gemma":[0.011518922,0.00035553012,0.00064068264,0.0008052978,0.0004391686,0.0014248067,0.0005737238,0.00088568206,0.00035388465],"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.0003226179,0.00017202646,0.020302145,0.00009157016,0.00009953801,0.00015053632,0.00024578423,0.9102774,0.0029362778,0.015269404,0.0014800552,0.048652567],"study_design_scores_gemma":[0.0000024108483,0.000007773896,0.0004284476,0.000002992337,0.0000039024976,0.0000075326266,0.000011479116,0.9975539,0.00023874859,0.0015888901,0.00015106905,0.0000028046004],"about_ca_topic_score_codex":0.010315361,"about_ca_topic_score_gemma":0.011493497,"teacher_disagreement_score":0.010315361,"about_ca_system_score_codex":0.0007024977,"about_ca_system_score_gemma":0.00054755574,"threshold_uncertainty_score":0.020510614},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2238443,0.0007043446,0.75426596,0.0009689788,0.000091754184,0.00017295952,0.001965379,0.012511613,0.0054747276],"genre_scores_gemma":[0.6131679,0.00019651555,0.38151065,0.00014162573,0.000034509936,0.0001680683,0.0024304497,0.00059763115,0.0017527171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892837,0.0002609457,0.00005632443,0.0003025433,0.000317134,0.00013468918],"domain_scores_gemma":[0.994042,0.0037142416,0.00044702305,0.001001681,0.0005153734,0.00027973563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014578251,0.0009134967,0.0012757775,0.0021046544,0.0009634785,0.0016856727,0.002350344,0.0015396425,0.0036262032],"category_scores_gemma":[0.013041795,0.0006042317,0.0008515591,0.0021218462,0.0009102586,0.0039256606,0.0017544784,0.0014674048,0.0009263195],"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.00031990136,0.00016464661,0.003260303,0.0002661229,0.000069906244,0.00013136465,0.00017378609,0.87313676,0.0045811716,0.014962002,0.0075183813,0.09541567],"study_design_scores_gemma":[0.000016222932,0.000011545074,0.00024646183,0.000006514351,0.0000061921746,0.000027483284,0.000039974555,0.9814943,0.0011437584,0.016529413,0.00047332182,0.000004873401],"about_ca_topic_score_codex":0.0056691314,"about_ca_topic_score_gemma":0.010569925,"teacher_disagreement_score":0.0056691314,"about_ca_system_score_codex":0.0018792982,"about_ca_system_score_gemma":0.00167581,"threshold_uncertainty_score":0.013635397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78882813,0.0009462474,0.08794614,0.0014839488,0.0005063178,0.00057347177,0.09008231,0.0052133077,0.024420189],"genre_scores_gemma":[0.89622194,0.00069876044,0.06079324,0.00017920684,0.00015636066,0.0004570319,0.0365995,0.0003495367,0.0045443224],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99976104,0.00007567917,0.000028529124,0.000046177513,0.000054838354,0.00003384688],"domain_scores_gemma":[0.9992467,0.00040275953,0.00012744263,0.00006914195,0.00009634252,0.00005756178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045256774,0.000566228,0.00022302412,0.0022125156,0.00041866695,0.0013021259,0.00027109878,0.00031503296,0.00349894],"category_scores_gemma":[0.0028912344,0.00016781267,0.00043460832,0.0021079138,0.00021776275,0.002297457,0.0006749851,0.00050457445,0.0010252988],"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.0018206183,0.000627309,0.30534092,0.002673943,0.001230777,0.001954774,0.01512267,0.04446471,0.0593518,0.04500566,0.16339286,0.35901394],"study_design_scores_gemma":[0.000102813814,0.0004655766,0.28581783,0.0003267809,0.00055043685,0.0010984072,0.016436208,0.39943096,0.02371003,0.048537172,0.22324242,0.00028138107],"about_ca_topic_score_codex":0.002954448,"about_ca_topic_score_gemma":0.0039594616,"teacher_disagreement_score":0.00349894,"about_ca_system_score_codex":0.00029470387,"about_ca_system_score_gemma":0.00022272981,"threshold_uncertainty_score":0.011705101},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98717207,0.0001227732,0.0101419,0.00018679533,0.000009972164,0.000027902011,0.00081252353,0.00011100796,0.0014151114],"genre_scores_gemma":[0.99602926,0.00007204433,0.0029158343,0.000015858492,0.000009164572,0.000011439393,0.0004312695,0.000009275263,0.00050590874],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999491,0.00017767827,0.000025073035,0.00015700207,0.00009855146,0.00005072133],"domain_scores_gemma":[0.9948548,0.0028509572,0.0011258047,0.00048212698,0.00044142746,0.0002448728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011835898,0.0003379825,0.0004028478,0.0015973556,0.00030459618,0.0010373816,0.00053255964,0.00059384026,0.0011317789],"category_scores_gemma":[0.006785968,0.00035357915,0.00033464943,0.0014624337,0.00033605695,0.001780671,0.00043524455,0.0007225954,0.00059613615],"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.0005745272,0.00048729463,0.85566896,0.0001359461,0.00026364924,0.00033982814,0.001453111,0.058395453,0.011084377,0.0054970165,0.0020107615,0.064088956],"study_design_scores_gemma":[0.000016801876,0.00012210336,0.32833606,0.000016028072,0.00005172574,0.00023429407,0.00046556137,0.6632312,0.0020523656,0.0040836055,0.0013578743,0.00003235297],"about_ca_topic_score_codex":0.011142631,"about_ca_topic_score_gemma":0.016594656,"teacher_disagreement_score":0.011142631,"about_ca_system_score_codex":0.0006434173,"about_ca_system_score_gemma":0.00026486767,"threshold_uncertainty_score":0.022155583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5006086,0.0022440695,0.48395145,0.0013566492,0.00013428855,0.00047960118,0.0054848096,0.0006998379,0.0050406693],"genre_scores_gemma":[0.788405,0.0014572247,0.2023482,0.00009781035,0.00018813385,0.00028061634,0.0057815835,0.000042082156,0.0013992807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906415,0.00028412763,0.00009436494,0.00026499448,0.00023258214,0.00005978013],"domain_scores_gemma":[0.9971711,0.0018526013,0.00040235496,0.00024070617,0.00023637737,0.0000968377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010844986,0.0012671038,0.0005684415,0.007498037,0.00032869392,0.0015080882,0.00056603644,0.000782382,0.00081875],"category_scores_gemma":[0.0053251158,0.00025793657,0.00082420406,0.0040337974,0.0004732745,0.002335227,0.00091380137,0.0007535575,0.0004910689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040681983,0.0008269135,0.13590209,0.00107689,0.0006144311,0.00075296644,0.0017669915,0.039119177,0.016884163,0.012634938,0.005702406,0.7843121],"study_design_scores_gemma":[0.00005641027,0.00034569984,0.1147144,0.00018695192,0.00034604946,0.00075018057,0.0024502536,0.8026216,0.007871597,0.055178232,0.0153711885,0.00010736105],"about_ca_topic_score_codex":0.0014693198,"about_ca_topic_score_gemma":0.00261267,"teacher_disagreement_score":0.007498037,"about_ca_system_score_codex":0.0004377724,"about_ca_system_score_gemma":0.0004919945,"threshold_uncertainty_score":0.0057353973},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42006862,0.0007701459,0.5706222,0.00045900716,0.00010310877,0.00022804028,0.0006681477,0.0021704752,0.00491024],"genre_scores_gemma":[0.95389813,0.00010767637,0.044616833,0.000046327772,0.000058917045,0.00008439992,0.0005528364,0.000059340924,0.0005755943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989962,0.00026310602,0.000085264684,0.00019844343,0.00030719666,0.0001497377],"domain_scores_gemma":[0.9933963,0.004918486,0.0003743882,0.00044431383,0.0006115856,0.00025507473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002534101,0.0006227407,0.0009860407,0.0036750084,0.0007139008,0.0013571577,0.0009966082,0.0011604843,0.0014077004],"category_scores_gemma":[0.016189598,0.00029821822,0.0005961964,0.0013480546,0.0005821227,0.002265628,0.0011994347,0.0010331589,0.00045926255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013687925,0.0011564987,0.06441098,0.0003597038,0.000308431,0.00041690213,0.00040572073,0.38253978,0.020957612,0.017165313,0.008411577,0.5024987],"study_design_scores_gemma":[0.000016244896,0.000051007875,0.0044250824,0.000018737996,0.000022580598,0.000035040488,0.000046629684,0.98348594,0.004253588,0.0073457924,0.00028950698,0.000009740149],"about_ca_topic_score_codex":0.00283769,"about_ca_topic_score_gemma":0.0031099985,"teacher_disagreement_score":0.0036750084,"about_ca_system_score_codex":0.00086795294,"about_ca_system_score_gemma":0.0009464253,"threshold_uncertainty_score":0.013401806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15757181,0.00028024917,0.8203105,0.0017196484,0.000113597336,0.00021333655,0.00049975346,0.00032328174,0.018967781],"genre_scores_gemma":[0.9429091,0.00036099475,0.04209064,0.00024567795,0.000120479635,0.00031659714,0.00028558777,0.00007724283,0.013593612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988129,0.00044810385,0.00003678522,0.0003004145,0.00025828657,0.0001435184],"domain_scores_gemma":[0.997658,0.00096370274,0.0006132729,0.00026368842,0.00027100174,0.00023024243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089383946,0.0006439148,0.0007019533,0.0012919172,0.00091645605,0.0018371694,0.0024106025,0.002192126,0.0052644815],"category_scores_gemma":[0.004203407,0.00045386248,0.0007794626,0.00089226605,0.0028301065,0.0035960143,0.0013845243,0.0014541689,0.00078289025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049806855,0.00006581751,0.0009462784,0.000057475645,0.00002961579,0.00036920243,0.00027575128,0.34644404,0.0017515195,0.64446336,0.0015797296,0.0039673815],"study_design_scores_gemma":[0.000021889735,0.000040348525,0.00018929873,0.000008529681,0.00000793996,0.00013141334,0.00005270782,0.87800616,0.00020856073,0.119164616,0.002154488,0.000014049742],"about_ca_topic_score_codex":0.003595172,"about_ca_topic_score_gemma":0.0026817163,"teacher_disagreement_score":0.0052644815,"about_ca_system_score_codex":0.002155935,"about_ca_system_score_gemma":0.0005715022,"threshold_uncertainty_score":0.017611504},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89183253,0.00023132017,0.09760341,0.0004097936,0.000021598526,0.00013265952,0.0029845962,0.0002854947,0.006498595],"genre_scores_gemma":[0.97884387,0.00013764734,0.018871738,0.000028676557,0.000021554737,0.000055109078,0.0011902511,0.000015490083,0.0008356464],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908316,0.00042746591,0.000049097085,0.00020306015,0.00018372443,0.000053451768],"domain_scores_gemma":[0.9965758,0.0018286381,0.0006649758,0.00040976546,0.00036724712,0.00015364695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009417286,0.00036787265,0.00028439646,0.0022948333,0.0003860982,0.0008562984,0.0003876313,0.0004737028,0.0011655526],"category_scores_gemma":[0.0064811762,0.00015856014,0.00027050983,0.0022302237,0.00022696977,0.0021847736,0.0005518918,0.0005054129,0.00064092386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026786866,0.00044138584,0.8041605,0.00018599117,0.0001952084,0.00019727096,0.0017271199,0.025384134,0.006904795,0.008159505,0.0034730185,0.14890325],"study_design_scores_gemma":[0.0000135340515,0.0001510813,0.40176722,0.000050861065,0.00012713247,0.00046227608,0.002430989,0.56303126,0.0065880213,0.017230693,0.008082011,0.000064994994],"about_ca_topic_score_codex":0.0027233025,"about_ca_topic_score_gemma":0.006580595,"teacher_disagreement_score":0.0027233025,"about_ca_system_score_codex":0.000364694,"about_ca_system_score_gemma":0.00022168444,"threshold_uncertainty_score":0.0054148436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9677046,0.00030253557,0.016679423,0.0043703965,0.000032681255,0.000029346376,0.0004962149,0.00006089189,0.010323943],"genre_scores_gemma":[0.9980411,0.00011494262,0.0011313411,0.00006352379,0.00001527352,0.000010719098,0.0000838842,0.0000055538717,0.00053370616],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99905616,0.00039102015,0.00004705634,0.00015102826,0.00020070336,0.0001541143],"domain_scores_gemma":[0.9720088,0.021182729,0.0037920868,0.0009129961,0.0014693846,0.00063406926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020481162,0.00017394406,0.00025581612,0.0016000423,0.0011583759,0.0016187562,0.0005474143,0.0009490566,0.0050536236],"category_scores_gemma":[0.01750238,0.00015541493,0.00021024924,0.0019695829,0.0005740572,0.0040287473,0.0011550797,0.00077850017,0.0004329948],"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.0007547882,0.0007632213,0.5819976,0.00047807538,0.00020100332,0.0007109559,0.010133299,0.034900017,0.0047147735,0.121702194,0.011329488,0.2323146],"study_design_scores_gemma":[0.000039384937,0.00031738981,0.45310488,0.00031494958,0.00018084291,0.00047036516,0.03156658,0.26683545,0.0033827866,0.22529909,0.018397138,0.00009126096],"about_ca_topic_score_codex":0.007063144,"about_ca_topic_score_gemma":0.0093797585,"teacher_disagreement_score":0.007063144,"about_ca_system_score_codex":0.0009475351,"about_ca_system_score_gemma":0.0013677438,"threshold_uncertainty_score":0.016906023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51556253,0.0011568201,0.4759292,0.0019259833,0.00006620022,0.00012644821,0.00072686886,0.0005364277,0.003969554],"genre_scores_gemma":[0.9737881,0.00037941046,0.02434983,0.000108455846,0.00007822994,0.00008852161,0.00060508633,0.000078985286,0.00052334694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968725,0.0017524451,0.00012988961,0.000675173,0.0004037629,0.00016618382],"domain_scores_gemma":[0.88545775,0.09076546,0.008874088,0.010708726,0.0026981775,0.0014957475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0101618795,0.0007248489,0.0008774942,0.0040126443,0.00095354306,0.0021603527,0.0020921025,0.001282513,0.0019212316],"category_scores_gemma":[0.12210057,0.0005725583,0.0008153116,0.002326063,0.005553342,0.0058712526,0.003038189,0.0024160603,0.0003591517],"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.00024652202,0.00013817189,0.15926845,0.00042255648,0.00048625702,0.0005690839,0.0019465144,0.41239524,0.0045419787,0.367818,0.003942574,0.04822469],"study_design_scores_gemma":[0.000019138386,0.0000750657,0.018755272,0.000064845044,0.00003348136,0.00023887045,0.00025832214,0.7723201,0.0011146874,0.20587969,0.0011873326,0.00005321473],"about_ca_topic_score_codex":0.0027376318,"about_ca_topic_score_gemma":0.0017741886,"teacher_disagreement_score":0.0101618795,"about_ca_system_score_codex":0.0015997004,"about_ca_system_score_gemma":0.0005969008,"threshold_uncertainty_score":0.053741753},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38428864,0.0010447103,0.5861309,0.0017449697,0.000050200204,0.000121821366,0.0031552105,0.0005531028,0.02291035],"genre_scores_gemma":[0.9371801,0.00055295805,0.057394125,0.000117470256,0.000023699868,0.00010163372,0.0011783569,0.000040043276,0.0034116341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962723,0.00017030552,0.000012526198,0.000082885264,0.000067803485,0.000039281556],"domain_scores_gemma":[0.9987153,0.000636337,0.0002917542,0.00010235462,0.000208218,0.000045978562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046467478,0.00038801783,0.00028206632,0.0018540315,0.0005443129,0.0009469629,0.0004970213,0.00034972472,0.0022411465],"category_scores_gemma":[0.0030094031,0.00013848828,0.0003811496,0.002561447,0.00044328457,0.0010645879,0.0005888978,0.00038770062,0.00016867495],"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.00003604374,0.000030407502,0.011715962,0.000060326573,0.00007588515,0.00030899874,0.00032465832,0.81897265,0.0013098794,0.14378235,0.0033921453,0.019990668],"study_design_scores_gemma":[0.0000029813743,0.000007503485,0.003509574,0.000009610998,0.000014806601,0.000059719798,0.00013100638,0.95213896,0.00016759503,0.040639207,0.003312103,0.000006972905],"about_ca_topic_score_codex":0.036969822,"about_ca_topic_score_gemma":0.028030245,"teacher_disagreement_score":0.036969822,"about_ca_system_score_codex":0.0014672672,"about_ca_system_score_gemma":0.000663871,"threshold_uncertainty_score":0.07350922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8999168,0.00063724583,0.091242574,0.0019664771,0.000039290007,0.000045037195,0.00040074735,0.00010393976,0.00564792],"genre_scores_gemma":[0.9955669,0.00028920677,0.0035351051,0.000028454859,0.000013871164,0.00001213722,0.00005379727,0.000014047957,0.00048641567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909246,0.000457555,0.00003323887,0.0001728743,0.00015279866,0.000091051705],"domain_scores_gemma":[0.9769817,0.017120302,0.002941092,0.0012278479,0.000946001,0.00078304304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003700684,0.0002281094,0.00036074425,0.0009983763,0.0005590413,0.0020877458,0.00064979884,0.0009868479,0.0012929499],"category_scores_gemma":[0.03684552,0.00048551618,0.00046097263,0.0010122649,0.0016982759,0.0044280356,0.00078150013,0.0011752851,0.00015226951],"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.00018516711,0.00007716308,0.08296482,0.00010811275,0.00010724298,0.0003878566,0.0012825461,0.69181615,0.0047172764,0.19758748,0.0011866709,0.019579493],"study_design_scores_gemma":[0.000020660742,0.000038355545,0.023013055,0.000028047283,0.000042714993,0.00012930649,0.00020635153,0.9073536,0.0008962459,0.06725476,0.0009793896,0.00003758349],"about_ca_topic_score_codex":0.0071539055,"about_ca_topic_score_gemma":0.0060000597,"teacher_disagreement_score":0.0071539055,"about_ca_system_score_codex":0.0018968179,"about_ca_system_score_gemma":0.0006567323,"threshold_uncertainty_score":0.019571364},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15395072,0.0003331887,0.84169436,0.00047771295,0.000016012104,0.00003683098,0.000052091007,0.00016846032,0.0032706303],"genre_scores_gemma":[0.9127799,0.00028808918,0.08519045,0.000081365375,0.00004215584,0.00011763434,0.00007718019,0.000078777535,0.0013444282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978775,0.0013422695,0.000044928805,0.00028464015,0.00029159116,0.00015910927],"domain_scores_gemma":[0.9850188,0.011567548,0.0011392244,0.0011036268,0.0007227546,0.00044810947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041985163,0.00062427536,0.000734441,0.001535725,0.00082549895,0.0011436358,0.0016236115,0.0012594423,0.0012883241],"category_scores_gemma":[0.027448127,0.000605543,0.00069540006,0.0009294501,0.0034147596,0.00438661,0.0019059179,0.0011973936,0.00027039638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016316817,0.000079693615,0.0024846373,0.00010290033,0.000049448503,0.00014417084,0.0003584129,0.38780648,0.0028701539,0.58909184,0.0008815413,0.015967544],"study_design_scores_gemma":[0.000013488054,0.00002080954,0.00030234997,0.000007616413,0.0000067936,0.00003798667,0.000026107035,0.6227008,0.0006047772,0.3759738,0.0002939984,0.0000114890945],"about_ca_topic_score_codex":0.0013101397,"about_ca_topic_score_gemma":0.0010151602,"teacher_disagreement_score":0.0041985163,"about_ca_system_score_codex":0.0012493167,"about_ca_system_score_gemma":0.0005808798,"threshold_uncertainty_score":0.02220416},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4886765,0.03227726,0.32655662,0.005392582,0.0014803744,0.0041001057,0.070225656,0.0028262036,0.06846474],"genre_scores_gemma":[0.8884085,0.0037994613,0.06830451,0.00061570626,0.000559545,0.004984256,0.02909649,0.00074703153,0.003484559],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.8626375,0.06537619,0.022695327,0.011582444,0.03627884,0.0014296906],"domain_scores_gemma":[0.41060475,0.44329932,0.066838264,0.04066205,0.0373465,0.0012491602],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.08785867,0.0014966575,0.0017897357,0.03827364,0.0013586915,0.0075690127,0.0030067847,0.0023613349,0.008408209],"category_scores_gemma":[0.41135147,0.0008869316,0.0037612696,0.06389994,0.002308524,0.012453318,0.005247611,0.0017205226,0.0037233834],"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.00055746065,0.00026679182,0.7345227,0.0046572806,0.004882781,0.00015678587,0.004282718,0.006125962,0.0011352821,0.014518025,0.014809716,0.21408449],"study_design_scores_gemma":[0.00024560504,0.000905972,0.7757934,0.0031510792,0.0035027438,0.0011534943,0.005730983,0.027880583,0.009941869,0.036452767,0.1347705,0.0004709583],"about_ca_topic_score_codex":0.0028789227,"about_ca_topic_score_gemma":0.001995586,"teacher_disagreement_score":0.96172637,"about_ca_system_score_codex":0.0023972474,"about_ca_system_score_gemma":0.0018819127,"threshold_uncertainty_score":0.46464664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994713,0.00030462866,0.00045202125,0.00046705114,0.000012059573,0.000026007227,0.00016075965,0.000008183302,0.0038561372],"genre_scores_gemma":[0.9975938,0.00042153787,0.00067124155,0.00008510992,0.000017267039,0.000054189622,0.00012556976,0.000014540886,0.0010167509],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9991756,0.00034230785,0.00003891812,0.00011091223,0.0001720823,0.00016009714],"domain_scores_gemma":[0.9960033,0.0025236951,0.00087116443,0.0001356304,0.00025504464,0.0002111998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014249004,0.00032879986,0.00026626152,0.0031821674,0.0034814004,0.0022713665,0.0005513019,0.0009565563,0.0028572704],"category_scores_gemma":[0.0063010375,0.00036727465,0.00021890414,0.0020571013,0.0023513788,0.0028686258,0.0026964636,0.00084376236,0.0002552572],"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.0001888507,0.00011752158,0.17600192,0.000337101,0.000050368995,0.0013941003,0.7806425,0.0001337869,0.0026364918,0.0022604184,0.0016375111,0.034599412],"study_design_scores_gemma":[0.0000045754414,0.00007491526,0.43455347,0.00020016945,0.00001998084,0.0003095226,0.5485782,0.00029377037,0.00038908806,0.0006950591,0.014848569,0.00003269642],"about_ca_topic_score_codex":0.037919145,"about_ca_topic_score_gemma":0.096203454,"teacher_disagreement_score":0.037919145,"about_ca_system_score_codex":0.0016149054,"about_ca_system_score_gemma":0.00084068184,"threshold_uncertainty_score":0.075396836},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3603055,0.0016480174,0.6293435,0.0011294573,0.000045753142,0.0003898159,0.0023057854,0.0017698773,0.0030622676],"genre_scores_gemma":[0.79718816,0.00081936433,0.19692603,0.00024588863,0.00006030532,0.00017131107,0.0031792133,0.00012968892,0.001280007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741554,0.00082403736,0.00019190586,0.0008557196,0.000538694,0.00017405105],"domain_scores_gemma":[0.9935834,0.0040327273,0.00093340327,0.00089643727,0.00036945852,0.00018456453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019317846,0.0011974719,0.001503507,0.0037614664,0.00094326684,0.0019266146,0.0022146916,0.0021154569,0.001143278],"category_scores_gemma":[0.01360394,0.0005391655,0.0011311156,0.0052913665,0.0009319267,0.008089692,0.0022136685,0.00094406976,0.00031283108],"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.00082056434,0.0006134166,0.016611695,0.001311118,0.00036259228,0.0009416622,0.0016726202,0.63186014,0.018431824,0.06535804,0.011261749,0.25075457],"study_design_scores_gemma":[0.00004541103,0.000059818696,0.0012334295,0.000023723404,0.00006540972,0.000248428,0.00036067053,0.90583897,0.0032571424,0.08670152,0.0021447933,0.000020673282],"about_ca_topic_score_codex":0.0067514395,"about_ca_topic_score_gemma":0.009435269,"teacher_disagreement_score":0.0067514395,"about_ca_system_score_codex":0.0014696703,"about_ca_system_score_gemma":0.0007806992,"threshold_uncertainty_score":0.013424277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030987263,0.00026472844,0.9663757,0.0002558962,0.000025351319,0.000036890942,0.00004372473,0.00010996914,0.0019004461],"genre_scores_gemma":[0.73757243,0.0007390182,0.25587368,0.0002136747,0.00016356938,0.00019969622,0.0002887981,0.00015587936,0.0047933087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799585,0.0007012605,0.00008674441,0.00036045304,0.0006994558,0.00015628566],"domain_scores_gemma":[0.98752105,0.008481035,0.0012800273,0.0011283809,0.0011135173,0.00047608334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00443378,0.00080626376,0.0013522415,0.0026668517,0.00092319696,0.0022977807,0.0019256676,0.0018336375,0.0018064548],"category_scores_gemma":[0.020245608,0.0004742549,0.0010437449,0.0016652975,0.0020408574,0.0049757445,0.002183431,0.002481434,0.0003623038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010489432,0.00007029376,0.0019908142,0.000084176674,0.000058793714,0.00015828891,0.0001988446,0.4313798,0.0031584157,0.52459955,0.001180512,0.03701562],"study_design_scores_gemma":[0.0000039201577,0.000016112088,0.0001594852,0.0000056437243,0.000005526954,0.000037620255,0.0000126186205,0.9322193,0.00045890512,0.06667622,0.00039452864,0.000010156709],"about_ca_topic_score_codex":0.0023217285,"about_ca_topic_score_gemma":0.001783056,"teacher_disagreement_score":0.00443378,"about_ca_system_score_codex":0.0016952867,"about_ca_system_score_gemma":0.0013160538,"threshold_uncertainty_score":0.023448348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62106836,0.0027509818,0.2834262,0.037689853,0.00018934964,0.00020960125,0.0002409473,0.00021111022,0.054213718],"genre_scores_gemma":[0.985712,0.00038883436,0.0128186075,0.00026372427,0.000023834305,0.0001053263,0.000035521512,0.000021553846,0.0006306612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99345016,0.0043978635,0.00015681266,0.0008139746,0.0004889661,0.0006922068],"domain_scores_gemma":[0.9619426,0.026331551,0.0052700015,0.0026702294,0.0015633311,0.0022223324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014512436,0.00043658883,0.00084513956,0.002557307,0.004450006,0.0077013182,0.0020365636,0.0023053521,0.004330544],"category_scores_gemma":[0.044496838,0.00057510426,0.00081775745,0.0024876061,0.015946554,0.025028164,0.008825909,0.0034978199,0.00025395196],"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.00012229141,0.00011065928,0.025850452,0.00024655295,0.00007063685,0.00069873757,0.03302947,0.011434804,0.00046418776,0.9003422,0.0017428728,0.025887193],"study_design_scores_gemma":[0.00003803143,0.00006413084,0.00534065,0.00020600832,0.00004021811,0.00027190844,0.03234391,0.037735507,0.0003120227,0.9128995,0.010704944,0.000043163538],"about_ca_topic_score_codex":0.0046210177,"about_ca_topic_score_gemma":0.0054767784,"teacher_disagreement_score":0.014512436,"about_ca_system_score_codex":0.004488525,"about_ca_system_score_gemma":0.005447688,"threshold_uncertainty_score":0.07674998},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047322027,0.0036462913,0.939988,0.0007261221,0.00023214277,0.00046850054,0.0011601695,0.0012953628,0.005161327],"genre_scores_gemma":[0.5609481,0.0024048246,0.42703062,0.0003348505,0.00041939184,0.0007177573,0.0028155467,0.0002093128,0.0051195957],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99503726,0.0018090185,0.00025936862,0.0012869408,0.0012807448,0.0003266368],"domain_scores_gemma":[0.9925073,0.0044940948,0.0009775751,0.0006538707,0.0010213681,0.00034582568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032420703,0.0009997817,0.001257155,0.008950153,0.0019374635,0.0025951504,0.0016488339,0.002250407,0.0013180852],"category_scores_gemma":[0.018159878,0.00057826145,0.0012401692,0.0046340222,0.0013764481,0.0037181636,0.002830584,0.0014719449,0.00081032823],"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.00055005884,0.00040524462,0.033392914,0.0022730993,0.0007888834,0.0013334121,0.0018708938,0.12528123,0.015388027,0.16176769,0.030764135,0.62618446],"study_design_scores_gemma":[0.00004797353,0.000105848754,0.006224908,0.0002167617,0.000102430626,0.0011596793,0.0007844418,0.7909568,0.006857809,0.16806516,0.025408091,0.00007003966],"about_ca_topic_score_codex":0.0035809728,"about_ca_topic_score_gemma":0.0023995452,"teacher_disagreement_score":0.008950153,"about_ca_system_score_codex":0.0012793385,"about_ca_system_score_gemma":0.0011018289,"threshold_uncertainty_score":0.017145932},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10568642,0.006147339,0.8562381,0.004786178,0.0001452134,0.0002899335,0.0005553538,0.00029185828,0.025859581],"genre_scores_gemma":[0.84643054,0.004104339,0.14115563,0.0004897212,0.00045360991,0.00048475698,0.00040725328,0.00009308248,0.006381063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727434,0.0012348756,0.00010526154,0.0004827576,0.00071176095,0.00019105956],"domain_scores_gemma":[0.99002516,0.006113023,0.0015615145,0.0006373671,0.0010254319,0.00063742243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019888575,0.00045970056,0.0007681165,0.0031687734,0.0023681193,0.0033634878,0.0011854199,0.0023295726,0.0019294306],"category_scores_gemma":[0.016994325,0.0007044909,0.00061312964,0.002462448,0.0043701287,0.008108397,0.0025100613,0.0018224785,0.00042331213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026450401,0.00002212228,0.000977853,0.00018563254,0.000031357653,0.00015423066,0.00079135114,0.023692416,0.0012296457,0.9565594,0.001713071,0.0146164065],"study_design_scores_gemma":[0.000012655155,0.000016879969,0.000577548,0.000056080833,0.000014283009,0.00015457813,0.00020588738,0.0711663,0.00025591545,0.9193097,0.00821313,0.000016975215],"about_ca_topic_score_codex":0.002268728,"about_ca_topic_score_gemma":0.0017174484,"teacher_disagreement_score":0.0033634878,"about_ca_system_score_codex":0.0017093022,"about_ca_system_score_gemma":0.0010541214,"threshold_uncertainty_score":0.012401879},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045921416,0.011569934,0.9700354,0.0041800505,0.00062164094,0.00012374537,0.0009968833,0.0017704614,0.0061097606],"genre_scores_gemma":[0.1166724,0.016290488,0.84398055,0.0011213465,0.0025942076,0.00043466955,0.0036662968,0.000612733,0.01462723],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983442,0.00043349876,0.00010049619,0.00033074283,0.0007291774,0.000061939594],"domain_scores_gemma":[0.9922315,0.005644621,0.00021792302,0.0009782377,0.00074662385,0.00018111704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021439693,0.0015149754,0.0014922504,0.0039071403,0.0007047081,0.0025679828,0.002124853,0.0014214247,0.0032607429],"category_scores_gemma":[0.010138209,0.0008037194,0.0012951393,0.0046147825,0.0012564319,0.004605168,0.0028713867,0.003225549,0.0026778039],"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.000065567314,0.0002075326,0.0017054162,0.000639701,0.00017274209,0.00011051824,0.00017226055,0.030024387,0.0019157786,0.03866106,0.05419223,0.87213296],"study_design_scores_gemma":[0.000015525844,0.000054315526,0.0012399226,0.00017346459,0.000055754015,0.0002659335,0.0001444714,0.38701126,0.004849521,0.5566737,0.04947061,0.000045526107],"about_ca_topic_score_codex":0.0015695182,"about_ca_topic_score_gemma":0.0020901721,"teacher_disagreement_score":0.0039071403,"about_ca_system_score_codex":0.00081889436,"about_ca_system_score_gemma":0.0008904358,"threshold_uncertainty_score":0.011338472},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1309798,0.0043658228,0.50798815,0.008539591,0.0015390663,0.0027543183,0.001964003,0.0005185032,0.34135064],"genre_scores_gemma":[0.8267124,0.0019668993,0.15662879,0.00068595604,0.00038935378,0.0036623962,0.0010820888,0.000115972645,0.00875613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97771555,0.012541897,0.0018876148,0.002958588,0.004127155,0.0007692087],"domain_scores_gemma":[0.9631199,0.020070584,0.0042562564,0.0068413476,0.004294361,0.0014175146],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.010217552,0.00082337676,0.0006941017,0.009587939,0.004440472,0.009444356,0.0018142099,0.0021257428,0.005369524],"category_scores_gemma":[0.028197953,0.00036164914,0.001037264,0.010359867,0.010222964,0.011731292,0.004412195,0.0016684652,0.00075887726],"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.00003567818,0.000030559946,0.009928496,0.00037749403,0.00005211815,0.00038231444,0.022343462,0.0023728337,0.00042937856,0.922411,0.004280757,0.037355825],"study_design_scores_gemma":[0.000032903074,0.0000573255,0.0044872663,0.0007586042,0.000037776983,0.0021050498,0.03785218,0.013099377,0.0004922476,0.7595252,0.18149014,0.00006206095],"about_ca_topic_score_codex":0.0018329683,"about_ca_topic_score_gemma":0.0010240595,"teacher_disagreement_score":0.98978245,"about_ca_system_score_codex":0.0041881544,"about_ca_system_score_gemma":0.003254104,"threshold_uncertainty_score":0.0540362},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92434424,0.00022524402,0.07148947,0.00022160204,0.000012299331,0.00002842165,0.00004749941,0.000091514565,0.0035396833],"genre_scores_gemma":[0.9976344,0.00007207646,0.001809214,0.000015537713,0.0000054766056,0.000012714402,0.00000874404,0.0000042173074,0.00043761692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997956,0.00007295167,0.000007910176,0.000035565707,0.000047708098,0.000040332296],"domain_scores_gemma":[0.99849975,0.0006677761,0.0004699841,0.00012835731,0.000114419156,0.000119848744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043168067,0.0002745392,0.00023287282,0.00066616945,0.0004617185,0.000703904,0.00037718026,0.0004885957,0.0011686294],"category_scores_gemma":[0.002932879,0.00023477044,0.0002769093,0.00030942739,0.0010117433,0.0012497212,0.0007274904,0.0003771711,0.00008186076],"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.00022946845,0.00011752089,0.014176128,0.00012749524,0.00014782966,0.0011791061,0.0006426224,0.7179047,0.05879286,0.18874022,0.0011667742,0.01677526],"study_design_scores_gemma":[0.000014170947,0.00005326747,0.0035063385,0.000009931058,0.000021357166,0.00018490359,0.00014018726,0.9550302,0.004523972,0.03601558,0.0004796913,0.000020383231],"about_ca_topic_score_codex":0.0018131704,"about_ca_topic_score_gemma":0.0011900647,"teacher_disagreement_score":0.0018131704,"about_ca_system_score_codex":0.00074259803,"about_ca_system_score_gemma":0.00020447787,"threshold_uncertainty_score":0.005387962},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046711612,0.0037705572,0.91501343,0.00052928255,0.00048728555,0.0007179683,0.007264068,0.0032557237,0.022250038],"genre_scores_gemma":[0.42719218,0.0015103037,0.5529222,0.00042402174,0.00053963996,0.0012624048,0.011198176,0.0013593627,0.003591784],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9799573,0.003837558,0.0026661544,0.004045968,0.0086602485,0.00083274354],"domain_scores_gemma":[0.9540628,0.018898774,0.008454692,0.0067757587,0.010679739,0.0011281649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013368167,0.00216254,0.0021236138,0.017111747,0.0024984456,0.00594401,0.00274935,0.002965271,0.004528735],"category_scores_gemma":[0.0715095,0.0005638639,0.0017359961,0.015283825,0.0028157695,0.010749812,0.005573795,0.0024104007,0.0028410044],"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.0012515414,0.00040681832,0.0710468,0.003339604,0.0022917022,0.0005262206,0.0026274698,0.11362461,0.02391853,0.15244564,0.052966543,0.5755546],"study_design_scores_gemma":[0.00019390964,0.0010896787,0.06085596,0.0011031923,0.0009636154,0.003398331,0.0035749078,0.45027578,0.044669785,0.31726626,0.115675315,0.0009332835],"about_ca_topic_score_codex":0.002003975,"about_ca_topic_score_gemma":0.002078631,"teacher_disagreement_score":0.017111747,"about_ca_system_score_codex":0.0022893504,"about_ca_system_score_gemma":0.002455421,"threshold_uncertainty_score":0.0706985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096285544,0.00065416767,0.8941427,0.0019457781,0.00011225054,0.00004547311,0.0008060978,0.00050589757,0.0055020633],"genre_scores_gemma":[0.88815784,0.0015173865,0.09566273,0.0005300956,0.00054791826,0.00010661145,0.0014119446,0.00025707073,0.011808451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916863,0.00037119363,0.000022221164,0.00021854586,0.0001410995,0.00007825334],"domain_scores_gemma":[0.9927885,0.0047549135,0.0007979763,0.00094188005,0.00042310052,0.00029362316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014912497,0.0010040858,0.00089955097,0.0020765874,0.0005870431,0.001786364,0.0015796262,0.0014768189,0.0032399953],"category_scores_gemma":[0.015128199,0.00089605263,0.00060634786,0.0014830853,0.0019935928,0.004444555,0.0015079,0.0023923544,0.0009121026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019626586,0.00016760074,0.0031739734,0.00029969282,0.00013029278,0.00021613356,0.00026040594,0.3710516,0.007565067,0.540607,0.010892048,0.065439925],"study_design_scores_gemma":[0.000010076021,0.000011523256,0.00051850226,0.000012223361,0.00000872715,0.000035309447,0.00003495187,0.6734594,0.0007409048,0.32411724,0.001034612,0.00001646189],"about_ca_topic_score_codex":0.002268579,"about_ca_topic_score_gemma":0.0021606754,"teacher_disagreement_score":0.0032399953,"about_ca_system_score_codex":0.00083075993,"about_ca_system_score_gemma":0.00075752824,"threshold_uncertainty_score":0.010838866},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5171467,0.001238547,0.47585762,0.00049981585,0.000051387822,0.00020179813,0.0008164395,0.00037168813,0.0038159138],"genre_scores_gemma":[0.93208736,0.00038373377,0.06506326,0.00006399296,0.00006314208,0.00007965815,0.00066207524,0.00003115468,0.0015656694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998909,0.00030462482,0.00005525112,0.00043224343,0.00017894364,0.00011994361],"domain_scores_gemma":[0.9957045,0.0021048037,0.0009377065,0.00046297043,0.00050998555,0.00027995586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012597302,0.00059456466,0.00076205854,0.0043948144,0.0011163482,0.0013264278,0.0010031187,0.0012222385,0.0010981681],"category_scores_gemma":[0.0074989884,0.00046795566,0.0007657128,0.0027559432,0.0007496707,0.0033547191,0.0014828001,0.0007251084,0.00046311232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012523665,0.00086904527,0.31986684,0.0009532488,0.0006432898,0.0017908358,0.007864791,0.07243776,0.043392282,0.07890186,0.008849476,0.46317825],"study_design_scores_gemma":[0.00003801196,0.00017737735,0.04889298,0.00008700991,0.00014344606,0.0014114048,0.0029404913,0.86949044,0.008205867,0.060408402,0.008094731,0.00010987457],"about_ca_topic_score_codex":0.0045716637,"about_ca_topic_score_gemma":0.0070526074,"teacher_disagreement_score":0.0045716637,"about_ca_system_score_codex":0.0006244637,"about_ca_system_score_gemma":0.000490371,"threshold_uncertainty_score":0.009090126},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027225187,0.00033750854,0.96736574,0.00026941855,0.0000635676,0.0002436623,0.0003307893,0.0018494568,0.002314678],"genre_scores_gemma":[0.1358608,0.0001381568,0.8603209,0.0001440997,0.000036486996,0.00073036517,0.0008239714,0.0002590801,0.0016861067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977316,0.0008978316,0.00021016326,0.00048134956,0.000508909,0.00017007743],"domain_scores_gemma":[0.99014306,0.00708843,0.00074577745,0.00045229573,0.0013615523,0.0002088735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041785953,0.0009387751,0.0014869728,0.004562017,0.00094566774,0.0016899558,0.0018711025,0.0016469191,0.004502488],"category_scores_gemma":[0.022425452,0.00065104174,0.00080225785,0.0041428073,0.00086399465,0.001742661,0.0014000869,0.0012832133,0.0013864705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008589268,0.0005195457,0.012366831,0.00059043255,0.00027238685,0.00022609463,0.0006146692,0.32605016,0.010905871,0.056735177,0.016187312,0.5746725],"study_design_scores_gemma":[0.00012053126,0.0001233951,0.00088025647,0.000038564136,0.000025742447,0.0001246115,0.00006779477,0.98241454,0.0022231943,0.011866323,0.0020938127,0.0000212447],"about_ca_topic_score_codex":0.004952171,"about_ca_topic_score_gemma":0.0049863467,"teacher_disagreement_score":0.004952171,"about_ca_system_score_codex":0.0014461584,"about_ca_system_score_gemma":0.0027911616,"threshold_uncertainty_score":0.02209878},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026196107,0.00020222472,0.961933,0.00018314838,0.00008614146,0.00019588949,0.0003299555,0.0073018954,0.0035716512],"genre_scores_gemma":[0.17725654,0.000106821426,0.81721675,0.00014778193,0.000027365964,0.0003163685,0.001691589,0.00049549324,0.0027412684],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987054,0.00027353867,0.000096435346,0.0003101367,0.00039699484,0.00021743028],"domain_scores_gemma":[0.99856144,0.00039436918,0.0000777977,0.00039211323,0.0004943451,0.00007989351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008973624,0.0009088525,0.001001448,0.0011681452,0.00077924645,0.0013149494,0.0021362586,0.0011551732,0.0075092944],"category_scores_gemma":[0.0047752834,0.0005087606,0.0008864808,0.0013461405,0.00051861134,0.0018446451,0.0020321975,0.0011151651,0.0040155174],"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.00079529814,0.00051561673,0.003634126,0.00042343393,0.00013137829,0.00035276994,0.00042750043,0.2333628,0.020787466,0.027138852,0.025287144,0.6871436],"study_design_scores_gemma":[0.00007942847,0.00008504868,0.00045310814,0.00001640447,0.000017036444,0.0001181345,0.000106514235,0.9755068,0.004938856,0.013442516,0.0052181506,0.000018047278],"about_ca_topic_score_codex":0.005071286,"about_ca_topic_score_gemma":0.0062906174,"teacher_disagreement_score":0.0075092944,"about_ca_system_score_codex":0.00068898516,"about_ca_system_score_gemma":0.0021752156,"threshold_uncertainty_score":0.025121093},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035958425,0.008795171,0.7260305,0.0053345407,0.0018282341,0.00029121645,0.002804109,0.002052442,0.24926797],"genre_scores_gemma":[0.11983303,0.02158372,0.42184737,0.002004645,0.0037617797,0.0008732835,0.009534533,0.0017559087,0.4188058],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911517,0.00022677564,0.000033316268,0.00022627617,0.00035139275,0.000047027715],"domain_scores_gemma":[0.99876523,0.0006021569,0.0000584549,0.00024464156,0.0002744961,0.000055097105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010073608,0.0010699593,0.00059238495,0.0037659754,0.000999347,0.0029432338,0.00092677725,0.00086118944,0.024943268],"category_scores_gemma":[0.0039302534,0.0003927572,0.00080976327,0.0032996552,0.00090189045,0.0036988512,0.001768435,0.0015626351,0.013440554],"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.000011644112,0.00004443593,0.0006983124,0.00025441294,0.0000581623,0.000061243794,0.00031695372,0.0061885905,0.0008675708,0.37985906,0.14634919,0.46529046],"study_design_scores_gemma":[0.0000034678008,0.000009486387,0.0012552233,0.00017540088,0.000026754993,0.00017855069,0.00024802078,0.030534757,0.0012244482,0.5081101,0.45820925,0.000024427023],"about_ca_topic_score_codex":0.0019289071,"about_ca_topic_score_gemma":0.0027533888,"teacher_disagreement_score":0.024943268,"about_ca_system_score_codex":0.0012295077,"about_ca_system_score_gemma":0.0009357642,"threshold_uncertainty_score":0.08344352},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15117574,0.00038074,0.8429943,0.0009025138,0.00004294643,0.0002319772,0.0012994128,0.00035375942,0.0026187226],"genre_scores_gemma":[0.8651924,0.0006227819,0.12590925,0.00012068338,0.00009153664,0.0007315654,0.0026204498,0.000103840095,0.004607382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971449,0.0018998878,0.000097472235,0.00046360327,0.00017313745,0.00022091546],"domain_scores_gemma":[0.9805504,0.015476256,0.0022408871,0.0007930661,0.0006294609,0.0003098937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065379143,0.00089964096,0.0012271953,0.0017340884,0.0005173097,0.0019262936,0.0020581384,0.0020289817,0.003925793],"category_scores_gemma":[0.027926277,0.0012332546,0.0012752947,0.0016579705,0.0010473222,0.0022629309,0.0019310721,0.0020772952,0.00070340943],"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.00005936795,0.00010547087,0.01487851,0.000057618534,0.0000950968,0.00009770148,0.00012963715,0.9151069,0.00017810852,0.05462581,0.0013985365,0.013267237],"study_design_scores_gemma":[0.00001185919,0.000011052368,0.0011066132,0.000010754885,0.000010191624,0.000012782478,0.000027892298,0.9849978,0.00005668548,0.01328893,0.0004591642,0.0000063097555],"about_ca_topic_score_codex":0.018585885,"about_ca_topic_score_gemma":0.013666974,"teacher_disagreement_score":0.018585885,"about_ca_system_score_codex":0.001810722,"about_ca_system_score_gemma":0.0016449319,"threshold_uncertainty_score":0.036955416},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45661062,0.003194134,0.49336645,0.002752216,0.00014876678,0.0003839627,0.02677071,0.0022135696,0.014559626],"genre_scores_gemma":[0.83887714,0.0005324947,0.14171585,0.00028382483,0.00009154597,0.0002240915,0.016469749,0.00012985137,0.0016755483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894494,0.0002679052,0.00007902152,0.00033872368,0.00027708165,0.00009231841],"domain_scores_gemma":[0.9937503,0.0038135846,0.0010730658,0.00052788516,0.0005626065,0.00027262568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000855209,0.00065536366,0.00060284603,0.0060567837,0.00087160146,0.0011293284,0.00096367265,0.0007867732,0.0018805338],"category_scores_gemma":[0.007061264,0.0002219465,0.0007764869,0.006179871,0.00049890333,0.0014696612,0.0008125625,0.0008408,0.00051901763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005874083,0.0010946898,0.27510557,0.0013674843,0.0010018966,0.0010394971,0.0015670632,0.17419164,0.015885692,0.094702505,0.0497909,0.38366577],"study_design_scores_gemma":[0.000058900365,0.00015647274,0.063284226,0.000112165035,0.00013199494,0.0007559272,0.0014276855,0.7195157,0.0047084717,0.17394839,0.035837043,0.00006305307],"about_ca_topic_score_codex":0.007562332,"about_ca_topic_score_gemma":0.01467844,"teacher_disagreement_score":0.007562332,"about_ca_system_score_codex":0.00083767524,"about_ca_system_score_gemma":0.0007761924,"threshold_uncertainty_score":0.015036643},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011282896,0.0008377076,0.9790261,0.0012129591,0.0001472214,0.00012277556,0.00021698092,0.0010570077,0.006096295],"genre_scores_gemma":[0.3302193,0.0011873444,0.65914196,0.0011110975,0.00062952674,0.0003410921,0.00080543273,0.00083130103,0.0057329233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953805,0.0021163665,0.00023489565,0.00086892216,0.0010441842,0.00035512183],"domain_scores_gemma":[0.9713637,0.020779418,0.00087850133,0.004399718,0.0019245219,0.0006540426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069355466,0.0018514653,0.0024056002,0.0020994483,0.0015076358,0.003103946,0.0027378742,0.0022089446,0.005249097],"category_scores_gemma":[0.038718354,0.0008947405,0.0022179952,0.002561452,0.0024861665,0.0064101378,0.0035354546,0.004086678,0.0022209636],"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.00048009277,0.0003362755,0.004663488,0.00051031634,0.00024415477,0.00017091204,0.0006191935,0.49530643,0.0040630265,0.17140748,0.01998568,0.30221283],"study_design_scores_gemma":[0.000035173493,0.00007071879,0.00022266316,0.000032818458,0.000023971257,0.0000773233,0.000046565012,0.9153221,0.0011105064,0.078592464,0.0044520446,0.000013635103],"about_ca_topic_score_codex":0.004252749,"about_ca_topic_score_gemma":0.00765274,"teacher_disagreement_score":0.0069355466,"about_ca_system_score_codex":0.001942327,"about_ca_system_score_gemma":0.0030999002,"threshold_uncertainty_score":0.03667915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98763436,0.0007090123,0.0027824643,0.0020698204,0.00013954492,0.00005976814,0.0031973007,0.00009531268,0.0033124157],"genre_scores_gemma":[0.99224174,0.00022612828,0.0010265636,0.00027068733,0.00016425879,0.00007260294,0.003785302,0.000054738597,0.0021579503],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99830484,0.0007294237,0.00009760479,0.0003806542,0.000280286,0.00020722215],"domain_scores_gemma":[0.9832308,0.0075190244,0.0029095833,0.0019266469,0.003116943,0.0012969186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004226204,0.00029024552,0.00046518003,0.0014795569,0.0012481166,0.0019013102,0.0005300531,0.00089097564,0.003130202],"category_scores_gemma":[0.025172979,0.00028578565,0.0004005517,0.0015965285,0.00056995405,0.0035306416,0.0012605397,0.0016194746,0.0017907755],"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.00028484635,0.0004261297,0.9436722,0.00006920162,0.00011118389,0.00024159037,0.0063850526,0.0009445653,0.001317003,0.0017907672,0.011748109,0.033009212],"study_design_scores_gemma":[0.000024184752,0.00040321093,0.93173754,0.00010425632,0.00008268657,0.0004109491,0.008865203,0.028690659,0.0013321744,0.0025853026,0.025678517,0.00008528872],"about_ca_topic_score_codex":0.008646393,"about_ca_topic_score_gemma":0.01014198,"teacher_disagreement_score":0.008646393,"about_ca_system_score_codex":0.0006848221,"about_ca_system_score_gemma":0.00044032934,"threshold_uncertainty_score":0.02235061},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02493704,0.0018112767,0.96791357,0.00074258546,0.00009328967,0.0003125884,0.00062445196,0.0006334327,0.002931734],"genre_scores_gemma":[0.41214323,0.0014873943,0.57607687,0.0007970922,0.00032598255,0.000573586,0.0029553215,0.00021621653,0.005424307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996046,0.0014339989,0.00019043426,0.0010072389,0.0010888501,0.00023345047],"domain_scores_gemma":[0.9917973,0.0049389456,0.0006822974,0.0009126957,0.0012803628,0.000388345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003737529,0.0011843978,0.002556851,0.0049547777,0.0018290282,0.002030328,0.003495515,0.0025098906,0.0029397812],"category_scores_gemma":[0.014038618,0.0007495718,0.0016110406,0.007300162,0.0014044109,0.0048324633,0.0035250813,0.0015920254,0.0009970963],"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.00042356257,0.00041963317,0.0050922018,0.0008740696,0.0005221784,0.00027148335,0.00076364743,0.50844556,0.003964516,0.119416185,0.01959518,0.34021175],"study_design_scores_gemma":[0.00007111157,0.000048698963,0.00024600583,0.000024059891,0.000039352788,0.00011486687,0.00007082218,0.9058746,0.00075515674,0.08918751,0.0035496382,0.000018164337],"about_ca_topic_score_codex":0.0048122113,"about_ca_topic_score_gemma":0.0056085386,"teacher_disagreement_score":0.0049547777,"about_ca_system_score_codex":0.0017597283,"about_ca_system_score_gemma":0.0017065883,"threshold_uncertainty_score":0.019766152},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05305292,0.000086449436,0.9444476,0.00022010594,0.000033313845,0.00010154216,0.00026626114,0.00028825577,0.0015035374],"genre_scores_gemma":[0.48812133,0.00042935635,0.5064474,0.00017087013,0.00006328653,0.0005712859,0.0015835672,0.00017869071,0.0024341866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995161,0.00017918581,0.000016330225,0.00012809399,0.00012524931,0.000034990277],"domain_scores_gemma":[0.99747247,0.0015537059,0.0002897672,0.00030975827,0.00026128153,0.00011300664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013813358,0.00061275606,0.00056239974,0.0025703742,0.0007008751,0.00096014293,0.0010675113,0.00085677416,0.0020581384],"category_scores_gemma":[0.008399082,0.0004660648,0.00082869164,0.0013603067,0.000926474,0.0021281992,0.0011111562,0.0011259693,0.00057729497],"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.00014783494,0.00011110531,0.009437528,0.0003430313,0.00014876114,0.0005136459,0.0005489807,0.6951581,0.017687779,0.19786042,0.0034393508,0.074603505],"study_design_scores_gemma":[0.000015374017,0.000022658505,0.0010502822,0.000017041797,0.0000127253215,0.00009038156,0.000050455244,0.9279682,0.0014811539,0.06773869,0.0015344928,0.000018606856],"about_ca_topic_score_codex":0.0020473795,"about_ca_topic_score_gemma":0.0030695028,"teacher_disagreement_score":0.0025703742,"about_ca_system_score_codex":0.00067935814,"about_ca_system_score_gemma":0.0008057891,"threshold_uncertainty_score":0.007305324},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019351976,0.00057845336,0.9414067,0.002536276,0.00035269096,0.00024043235,0.001055822,0.0003134358,0.03416416],"genre_scores_gemma":[0.7865548,0.0019269581,0.101326264,0.0012402663,0.00060260354,0.0013801114,0.0009900747,0.0002428512,0.10573602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985941,0.0004896943,0.00006772927,0.0002850049,0.00034976655,0.00021364943],"domain_scores_gemma":[0.9980848,0.001007443,0.0002738203,0.000121210855,0.00029967807,0.00021310976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015977062,0.0019136,0.0016279162,0.0009976636,0.00088711915,0.002510884,0.003806226,0.0040909946,0.013889142],"category_scores_gemma":[0.005463851,0.00061454246,0.0016010877,0.0008921522,0.0022985023,0.0028005408,0.0017750367,0.004322574,0.002531847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060873583,0.00008804991,0.00060593575,0.00010863187,0.000048877395,0.00026379817,0.00018981325,0.36448514,0.0018611061,0.62373185,0.0043741274,0.00418188],"study_design_scores_gemma":[0.00002951706,0.00004057791,0.00014690339,0.000013241293,0.000014390802,0.00005626227,0.00002348778,0.94287115,0.000109400185,0.053775173,0.002899635,0.000020105957],"about_ca_topic_score_codex":0.012745805,"about_ca_topic_score_gemma":0.0070961365,"teacher_disagreement_score":0.013889142,"about_ca_system_score_codex":0.0021306055,"about_ca_system_score_gemma":0.0015616586,"threshold_uncertainty_score":0.046463788},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017493278,0.000092452145,0.9801506,0.00008802676,0.000032195458,0.00009626841,0.00017196647,0.0008677844,0.0010075066],"genre_scores_gemma":[0.27008924,0.00017259276,0.7238813,0.00009016668,0.00007315582,0.0003008154,0.00093217375,0.00020710063,0.0042534857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916387,0.0001363961,0.000059871803,0.0002001958,0.00035202203,0.00008773517],"domain_scores_gemma":[0.9979588,0.0008613005,0.00026400498,0.00027173338,0.0005346417,0.00010960922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013172462,0.0011140571,0.0007658478,0.0027612715,0.00092426885,0.0014284492,0.0016932752,0.0012205214,0.005307005],"category_scores_gemma":[0.0071686436,0.00043439897,0.0008056474,0.0020464787,0.0006175684,0.0026392068,0.0014760857,0.0012140267,0.0012201982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025212928,0.0001788868,0.0045604673,0.00013790054,0.00009233445,0.0002363986,0.00016995186,0.45021248,0.007853621,0.02778594,0.0046195327,0.5039003],"study_design_scores_gemma":[0.0000053489857,0.00001278973,0.00019486496,0.0000060392,0.0000073548135,0.000027001028,0.00001314114,0.99163204,0.001103139,0.0063671465,0.00062623527,0.0000048005877],"about_ca_topic_score_codex":0.00551292,"about_ca_topic_score_gemma":0.005567828,"teacher_disagreement_score":0.00551292,"about_ca_system_score_codex":0.0013260867,"about_ca_system_score_gemma":0.0012797334,"threshold_uncertainty_score":0.01775372},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5578516,0.00017688949,0.43847582,0.00019782288,0.000013764327,0.000247475,0.0013889995,0.00016013783,0.0014875288],"genre_scores_gemma":[0.9094672,0.00022162533,0.08817281,0.000041972533,0.000016130653,0.00020626,0.0014576209,0.000017328539,0.00039900304],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946144,0.0038196992,0.0002189501,0.00079091074,0.00039056982,0.00016540465],"domain_scores_gemma":[0.90730095,0.071203925,0.010687323,0.0081985975,0.0019421714,0.0006670251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009421908,0.00056701264,0.0006322267,0.0027091354,0.00046382425,0.00106301,0.0014421262,0.0011735734,0.0011726505],"category_scores_gemma":[0.08162868,0.00075955,0.00090253743,0.002328581,0.0012865253,0.0030498975,0.0010951854,0.0013682799,0.00028512158],"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.0005249019,0.00039503654,0.5503148,0.0004885061,0.0007208074,0.0003544264,0.0024602115,0.29071328,0.003708492,0.0646169,0.0015850634,0.08411751],"study_design_scores_gemma":[0.0000620902,0.00023236453,0.14630559,0.00013028816,0.00013157677,0.00042130615,0.000928068,0.7900554,0.0025870213,0.056495063,0.0025558504,0.0000954027],"about_ca_topic_score_codex":0.005063764,"about_ca_topic_score_gemma":0.0075205043,"teacher_disagreement_score":0.009421908,"about_ca_system_score_codex":0.0010843513,"about_ca_system_score_gemma":0.0004905337,"threshold_uncertainty_score":0.04982847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848454,0.0007702018,0.006621776,0.00043137767,0.000016940909,0.000017114435,0.0002255133,0.000059120503,0.007012573],"genre_scores_gemma":[0.99923146,0.00011159164,0.0003985413,0.000008052824,0.000017860657,0.00000465577,0.000070729984,0.000006124414,0.0001509665],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99767655,0.00087163603,0.00018614675,0.00032997865,0.00073781604,0.00019789573],"domain_scores_gemma":[0.90544444,0.07642015,0.008783705,0.0031227076,0.004934616,0.0012944207],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0044199857,0.00029261276,0.00035058163,0.0060604913,0.00046534344,0.0017865442,0.00040283453,0.0004540633,0.0018313401],"category_scores_gemma":[0.07735772,0.00016963236,0.00036088907,0.0064941826,0.0012532467,0.0028041867,0.0010274359,0.00051559584,0.00032879767],"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.00014144463,0.00013691698,0.8549779,0.00020128964,0.0004651502,0.0003506318,0.0019565402,0.058496036,0.003317938,0.027230332,0.0013096825,0.051415995],"study_design_scores_gemma":[0.000017276561,0.00015418329,0.8296177,0.00007240829,0.00012930106,0.0005370912,0.0011901455,0.13158564,0.0019564175,0.0323317,0.0023325197,0.00007569835],"about_ca_topic_score_codex":0.0028086584,"about_ca_topic_score_gemma":0.0018866423,"teacher_disagreement_score":0.9939395,"about_ca_system_score_codex":0.0010694942,"about_ca_system_score_gemma":0.00051242835,"threshold_uncertainty_score":0.023375392},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06779605,0.0014112645,0.9278592,0.000583895,0.000039294282,0.00014145758,0.0005157563,0.00026699627,0.0013860762],"genre_scores_gemma":[0.5175289,0.0011303708,0.47838667,0.00017375968,0.00014769917,0.00030620763,0.0012444227,0.000065020206,0.0010170513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969614,0.0011529543,0.0001613263,0.0008433151,0.0006877701,0.0001932527],"domain_scores_gemma":[0.9880393,0.0074688485,0.0022243361,0.00093639025,0.0009880707,0.00034302942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024748563,0.0009803575,0.0010790372,0.0073756427,0.0016633953,0.0019370458,0.0018078131,0.0020060493,0.0007324074],"category_scores_gemma":[0.015047089,0.0006916371,0.0011063109,0.0054631075,0.0014361133,0.0038423177,0.0027403033,0.0015226136,0.00034285535],"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.0002030073,0.00037526563,0.049677305,0.0012890898,0.0005847695,0.0011486635,0.0018947544,0.54746133,0.01442554,0.10869073,0.00666435,0.26758513],"study_design_scores_gemma":[0.0000156501,0.000041513173,0.0039365045,0.00007491137,0.00004964223,0.00027512803,0.00034330806,0.8966676,0.0025343457,0.09237883,0.0036470604,0.000035523302],"about_ca_topic_score_codex":0.0021716447,"about_ca_topic_score_gemma":0.0025158094,"teacher_disagreement_score":0.0073756427,"about_ca_system_score_codex":0.0010060014,"about_ca_system_score_gemma":0.0006864919,"threshold_uncertainty_score":0.013088465},"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":"commentary","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001187456,0.0024448854,0.0017369386,0.60394126,0.36424923,0.00027055628,0.0019939602,0.0010230908,0.023152592],"genre_scores_gemma":[0.01825235,0.003036308,0.003052608,0.39145416,0.1292358,0.0010364,0.00326378,0.0013012592,0.44936728],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955651,0.00068919646,0.00025484202,0.00085403357,0.0019218634,0.0007149621],"domain_scores_gemma":[0.9782071,0.0014108282,0.0006291879,0.0007127287,0.012061666,0.0069784205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065057115,0.0017700867,0.0013681366,0.0015291687,0.0046209237,0.0066814837,0.0018726626,0.010483387,0.06481894],"category_scores_gemma":[0.015583223,0.0006501095,0.0017256899,0.0011663968,0.001169185,0.0032550846,0.0037332734,0.012798409,0.06373601],"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.000024216535,0.000010835935,0.000100873476,0.000015076005,0.0000019359827,0.000030759948,0.000013440486,0.000012967024,0.00007371951,0.00020955139,0.9972101,0.0022964762],"study_design_scores_gemma":[0.000014002858,0.000019886742,0.00058912474,0.000034682398,0.00000443104,0.00004656935,0.00008858007,0.00008737501,0.00014232115,0.0003184022,0.9986405,0.0000141300025],"about_ca_topic_score_codex":0.009570557,"about_ca_topic_score_gemma":0.013552069,"teacher_disagreement_score":0.06481894,"about_ca_system_score_codex":0.003816941,"about_ca_system_score_gemma":0.008473878,"threshold_uncertainty_score":0.21684098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1392303,0.0009903628,0.84967005,0.000775717,0.00008679564,0.0004143842,0.0004236869,0.0004254508,0.007983185],"genre_scores_gemma":[0.76208043,0.0012783254,0.2324778,0.0000689619,0.00005769015,0.0003627245,0.0005113472,0.00006299277,0.003099776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976101,0.0007070218,0.0001620288,0.00046491472,0.0008476911,0.00020834789],"domain_scores_gemma":[0.9971545,0.0014224327,0.00042505522,0.0001242255,0.0007535214,0.00012021256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025070058,0.0013577025,0.0010907629,0.0065389676,0.0014625771,0.003244199,0.001302537,0.0011543246,0.002226818],"category_scores_gemma":[0.008274638,0.00047830772,0.001500832,0.0047100442,0.000855579,0.0038027053,0.0010962861,0.001026368,0.0006312437],"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.00045668916,0.0005032003,0.03777315,0.0018539398,0.0007291368,0.0011742129,0.0034829685,0.47035915,0.01504019,0.08311206,0.0065825237,0.3789327],"study_design_scores_gemma":[0.000026094274,0.00013286996,0.006499701,0.00012591662,0.00016687797,0.00035968827,0.0012287069,0.9438423,0.003550094,0.039680414,0.00428376,0.000103613726],"about_ca_topic_score_codex":0.0073565366,"about_ca_topic_score_gemma":0.008290128,"teacher_disagreement_score":0.0073565366,"about_ca_system_score_codex":0.0015816762,"about_ca_system_score_gemma":0.0019877127,"threshold_uncertainty_score":0.014627397},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057397187,0.0035332916,0.5635985,0.039620604,0.0004914403,0.0005680981,0.00015514078,0.0001156345,0.33452013],"genre_scores_gemma":[0.9142628,0.001327995,0.07539504,0.0007956705,0.00017963085,0.00085890095,0.00008329736,0.000032792857,0.007063924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942622,0.0036855366,0.00024566293,0.0006879329,0.0005880912,0.0005305333],"domain_scores_gemma":[0.99017054,0.0056962795,0.0010439703,0.0006909732,0.00077220553,0.0016261264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011737203,0.0006125058,0.00069635874,0.003852442,0.0062009306,0.0094772,0.0027635666,0.0038522205,0.00897681],"category_scores_gemma":[0.014136748,0.00043215416,0.0010137671,0.0033938694,0.033328004,0.013373841,0.008255935,0.0034383899,0.0009941482],"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":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001124004,0.0000046545238,0.000086525935,0.000012801046,9.354256e-7,0.000011165484,0.0012068754,0.00018691721,0.000009874218,0.99738365,0.00011105118,0.000984353],"study_design_scores_gemma":[0.000008138472,0.0000069510147,0.000114839895,0.000050200706,0.0000018953391,0.00004333994,0.0019583947,0.0016353413,0.000021889315,0.9902936,0.005859455,0.000005865512],"about_ca_topic_score_codex":0.0028556583,"about_ca_topic_score_gemma":0.002541146,"teacher_disagreement_score":0.9944392,"about_ca_system_score_codex":0.0055608074,"about_ca_system_score_gemma":0.007919185,"threshold_uncertainty_score":0.062072992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92593694,0.000596126,0.004978803,0.0025095833,0.00007154948,0.00009409864,0.00034696213,0.00034217982,0.06512381],"genre_scores_gemma":[0.9967554,0.00008189855,0.0006976464,0.000067917914,0.000035576788,0.000010811088,0.000051073348,0.000014179419,0.0022856027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994355,0.00017943434,0.000029579956,0.0000869706,0.00015573477,0.000112774476],"domain_scores_gemma":[0.99790716,0.000817534,0.00046341773,0.00026734322,0.00029626334,0.00024830073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081722427,0.00033225946,0.00023882501,0.001322986,0.001325266,0.0023644813,0.0003099464,0.000951077,0.002914472],"category_scores_gemma":[0.004366139,0.00020138783,0.0002451983,0.0009856762,0.0006917669,0.0023379836,0.0007094385,0.00043829766,0.0009850134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012158664,0.000817221,0.33991885,0.0006157287,0.00041111972,0.008599561,0.011355366,0.014443282,0.054331023,0.12666878,0.04100718,0.40061602],"study_design_scores_gemma":[0.00027825116,0.001117754,0.40744048,0.00022581266,0.0007310238,0.0064306636,0.01796143,0.30062512,0.04932554,0.06511472,0.15038082,0.00036836264],"about_ca_topic_score_codex":0.0034387002,"about_ca_topic_score_gemma":0.0037386036,"teacher_disagreement_score":0.0034387002,"about_ca_system_score_codex":0.0007091228,"about_ca_system_score_gemma":0.00041613533,"threshold_uncertainty_score":0.00974983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054932225,0.0007549476,0.9321009,0.00082246773,0.0002123027,0.00010584228,0.0002501158,0.00015331,0.010667883],"genre_scores_gemma":[0.90154505,0.0016632384,0.0707522,0.0002683665,0.00017691062,0.00041553428,0.00028570977,0.0000720648,0.024820935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990729,0.0004571561,0.000041951218,0.00016223203,0.00015035507,0.00011540906],"domain_scores_gemma":[0.99855345,0.0007604975,0.00024187597,0.00010130398,0.0002100427,0.000132779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014520253,0.00078759197,0.0015995571,0.0009317869,0.0010023304,0.0021248115,0.002348567,0.0024894646,0.0032284278],"category_scores_gemma":[0.0037134788,0.0005518918,0.0010819343,0.0011046923,0.0021185766,0.002490001,0.0013903222,0.0018095855,0.00058836146],"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.00003904386,0.000044977623,0.00046266863,0.00005401883,0.000027507307,0.00021609716,0.000110852234,0.7747559,0.0011566732,0.21900465,0.0007408365,0.003386895],"study_design_scores_gemma":[0.000004504802,0.000009500536,0.000035375877,0.0000028450443,0.000003159667,0.000015596182,0.0000073599945,0.9896107,0.000035346846,0.009973835,0.0002963532,0.0000054211264],"about_ca_topic_score_codex":0.008036521,"about_ca_topic_score_gemma":0.0039689317,"teacher_disagreement_score":0.008036521,"about_ca_system_score_codex":0.0014495413,"about_ca_system_score_gemma":0.0010602913,"threshold_uncertainty_score":0.015979469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25483912,0.00035446868,0.7402753,0.00046536518,0.000029169463,0.00011217108,0.0007162253,0.0005594366,0.0026487452],"genre_scores_gemma":[0.70540154,0.00017300996,0.29173264,0.000060314662,0.000028371272,0.00016343771,0.0011307144,0.000072128154,0.0012379313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883324,0.0002604803,0.00008489866,0.0003604456,0.00035061818,0.00011031344],"domain_scores_gemma":[0.9907673,0.006077821,0.0013576442,0.00052554073,0.00086853513,0.00040312787],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0016267728,0.000490758,0.00055789895,0.0051767677,0.00083816267,0.0016000477,0.0010159251,0.00086727046,0.0023476197],"category_scores_gemma":[0.013362326,0.00027449365,0.00074885215,0.003037643,0.0008955742,0.0023163732,0.0012505816,0.0008330743,0.00030971217],"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.00041394657,0.00021595143,0.057950966,0.00051500124,0.00026416514,0.0008584582,0.0018034945,0.5515605,0.016322492,0.09204149,0.0036605198,0.27439308],"study_design_scores_gemma":[0.000010285759,0.000056639055,0.007095848,0.000030865092,0.000028580875,0.0002541504,0.00022672999,0.9507764,0.0025442294,0.037389077,0.001565737,0.000021531758],"about_ca_topic_score_codex":0.004165224,"about_ca_topic_score_gemma":0.003849429,"teacher_disagreement_score":0.9948232,"about_ca_system_score_codex":0.0015081363,"about_ca_system_score_gemma":0.0008126795,"threshold_uncertainty_score":0.01094234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9967997,0.00006311973,0.0027137778,0.000050171104,0.0000055294236,0.000008996555,0.00003684527,0.000027873206,0.00029385905],"genre_scores_gemma":[0.99896026,0.000028645916,0.0009113031,0.000012765864,0.000002221523,0.000010738737,0.00002688362,0.0000048077463,0.00004236423],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919814,0.00040137817,0.000051941923,0.00015430652,0.00011129502,0.00008306005],"domain_scores_gemma":[0.9900649,0.0062019895,0.0018172414,0.0010216672,0.00038294145,0.00051124324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015963052,0.0004334445,0.00035568135,0.0006333098,0.00029972492,0.0005527228,0.0005097183,0.00050210144,0.0006820169],"category_scores_gemma":[0.010836384,0.00019898135,0.0003764645,0.00030972692,0.0010268223,0.0007614343,0.0007685459,0.0007894675,0.00006228936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002048948,0.0016943065,0.09887525,0.0004995155,0.0009180029,0.0005892327,0.00076462945,0.31309715,0.54108363,0.009214302,0.00063903385,0.030575983],"study_design_scores_gemma":[0.00018860865,0.00334343,0.11842414,0.000073340736,0.00032340275,0.0003535406,0.00032361178,0.7557602,0.109514445,0.011119134,0.0004530108,0.00012314081],"about_ca_topic_score_codex":0.0008869848,"about_ca_topic_score_gemma":0.000807267,"teacher_disagreement_score":0.0015963052,"about_ca_system_score_codex":0.0007045053,"about_ca_system_score_gemma":0.00023476417,"threshold_uncertainty_score":0.0084421635},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.153173,0.00064884825,0.8123486,0.00043598164,0.0003199215,0.00049763324,0.004919764,0.021431377,0.0062248935],"genre_scores_gemma":[0.6535907,0.0005441207,0.32555377,0.00021108384,0.00060274807,0.000566213,0.009372361,0.00080029044,0.0087588085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989968,0.00013909061,0.0000584945,0.00028531428,0.00038625026,0.00013412195],"domain_scores_gemma":[0.9971992,0.0011945214,0.00035596004,0.00036521757,0.00071811886,0.00016702409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007691441,0.0011227224,0.0010339346,0.003300006,0.0007202365,0.0011987215,0.0011735098,0.0010292256,0.0026998061],"category_scores_gemma":[0.005496373,0.0003623542,0.00048123093,0.002089469,0.00031766322,0.0020219272,0.0011684018,0.0010193916,0.0019354195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002349303,0.0006927127,0.02849645,0.0008072338,0.00025503073,0.0022303155,0.0014920672,0.029814327,0.20057534,0.007242034,0.02263737,0.7034078],"study_design_scores_gemma":[0.00007691639,0.0001931024,0.015951531,0.000045353587,0.000076085125,0.00056054245,0.0003424497,0.8648554,0.08364252,0.00928376,0.024900848,0.000071480674],"about_ca_topic_score_codex":0.0031892888,"about_ca_topic_score_gemma":0.004679315,"teacher_disagreement_score":0.003300006,"about_ca_system_score_codex":0.0004828707,"about_ca_system_score_gemma":0.00057705544,"threshold_uncertainty_score":0.009031713},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.735403,0.0011560511,0.24050413,0.0008312201,0.0002500774,0.00056735874,0.01179122,0.0034379594,0.006059051],"genre_scores_gemma":[0.9112414,0.00042368387,0.07832801,0.00007066283,0.00017196179,0.00018531086,0.007812601,0.000095602234,0.0016707062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923146,0.000120654964,0.000072967276,0.00025357254,0.00023059499,0.000090667665],"domain_scores_gemma":[0.9971263,0.0010189408,0.0007279781,0.00035569855,0.00059225876,0.00017877767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008094643,0.00083031633,0.00051624177,0.0052699433,0.00061682577,0.0012353661,0.0007266364,0.00068002334,0.000817856],"category_scores_gemma":[0.0048737964,0.00025928282,0.00053149444,0.0034661253,0.0003064969,0.0021052875,0.0009421616,0.0007262826,0.0007911862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013367723,0.0005760333,0.36148673,0.00070528704,0.00050277746,0.0006237268,0.0020865737,0.050607044,0.06087909,0.0048284293,0.013391088,0.50297636],"study_design_scores_gemma":[0.00005123681,0.00023984695,0.23506515,0.00006940483,0.0001794441,0.00054339936,0.0022176465,0.7092008,0.028765557,0.009694132,0.013859658,0.000113719696],"about_ca_topic_score_codex":0.0076761716,"about_ca_topic_score_gemma":0.012626649,"teacher_disagreement_score":0.0076761716,"about_ca_system_score_codex":0.0006912622,"about_ca_system_score_gemma":0.00044293527,"threshold_uncertainty_score":0.015263021},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3843581,0.010646204,0.51126146,0.0071383053,0.0005189937,0.0001449879,0.0013757062,0.0005595556,0.083996706],"genre_scores_gemma":[0.89641523,0.0054314844,0.07975349,0.0007656648,0.0007296263,0.00027303846,0.00083110225,0.0004239731,0.0153763695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807054,0.0005853674,0.000084061416,0.00042616954,0.0004663105,0.00036751849],"domain_scores_gemma":[0.9497706,0.041714724,0.0021634875,0.0020783637,0.0013073208,0.002965427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046091476,0.001604749,0.0019037043,0.0039217523,0.0023531534,0.0046425005,0.003936239,0.0026406706,0.012501226],"category_scores_gemma":[0.040107004,0.0012799504,0.0014675179,0.0031143245,0.0043141185,0.013455877,0.004271547,0.006146324,0.0009628939],"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.00032354944,0.00009135863,0.0035679874,0.00042699673,0.00008676495,0.00014402588,0.00050397456,0.0367055,0.0033776658,0.92337227,0.004634579,0.026765324],"study_design_scores_gemma":[0.000019545885,0.00002767506,0.00090370077,0.00007857297,0.000040916064,0.00019221954,0.000082828534,0.0900368,0.0007608117,0.90541977,0.0024159723,0.000021172147],"about_ca_topic_score_codex":0.0007530532,"about_ca_topic_score_gemma":0.0014695926,"teacher_disagreement_score":0.012501226,"about_ca_system_score_codex":0.0019474067,"about_ca_system_score_gemma":0.00081227336,"threshold_uncertainty_score":0.041820824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45178154,0.0006738296,0.5416897,0.00031169705,0.00005219522,0.000040575473,0.00008232209,0.00033606042,0.005032059],"genre_scores_gemma":[0.9941552,0.0002220229,0.005157203,0.00002036677,0.0000104681085,0.000024420318,0.000022552667,0.000012298317,0.00037555763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957865,0.00015192496,0.000023607166,0.0000949153,0.00009649519,0.00005441584],"domain_scores_gemma":[0.9982284,0.00084574067,0.00045480882,0.00023536313,0.00015818616,0.00007752487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009218986,0.0005162979,0.00033296054,0.00074099266,0.0003829242,0.00076802575,0.0004984114,0.0005236389,0.00060085097],"category_scores_gemma":[0.0044336687,0.00020492991,0.00047870135,0.0003301074,0.0008580789,0.00095656683,0.00084246846,0.00045702723,0.00010843962],"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.00009456919,0.000023003162,0.0022754224,0.0000788045,0.00009256599,0.00019507167,0.000105453284,0.94217235,0.017386666,0.022386061,0.00026857498,0.01492156],"study_design_scores_gemma":[0.000008909749,0.00005658061,0.0011056621,0.000009228324,0.00003205796,0.00006352829,0.000045596844,0.9796078,0.0028803872,0.015731798,0.00044129434,0.000017030106],"about_ca_topic_score_codex":0.0013552416,"about_ca_topic_score_gemma":0.0005487033,"teacher_disagreement_score":0.0013552416,"about_ca_system_score_codex":0.0004171181,"about_ca_system_score_gemma":0.00032881115,"threshold_uncertainty_score":0.0048755407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046076477,0.0006882363,0.9862402,0.00075353624,0.00011813635,0.000092986986,0.00021790148,0.00065276725,0.006628711],"genre_scores_gemma":[0.19977547,0.0017831688,0.77361876,0.00062097923,0.0007136012,0.0011205387,0.0013181746,0.0009727562,0.02007666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983631,0.0007022997,0.00005519091,0.0004697016,0.00027489054,0.00013482868],"domain_scores_gemma":[0.9898755,0.0074706064,0.0005331192,0.0010812216,0.0006967326,0.00034285765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033187177,0.0021519216,0.0022620147,0.0027054378,0.001462807,0.0025211736,0.0037948303,0.003072659,0.012363436],"category_scores_gemma":[0.020943465,0.0011094608,0.0015482818,0.003899826,0.0023346795,0.0052990485,0.0037690322,0.0044055786,0.00363702],"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.00019436177,0.00015597105,0.0007636499,0.00052355655,0.00013754897,0.000060824656,0.00021192104,0.4779153,0.0011839615,0.266938,0.029566262,0.22234875],"study_design_scores_gemma":[0.000040702333,0.000019563306,0.00014506839,0.000034001267,0.00001810066,0.000030345846,0.000018898962,0.66020197,0.0003064731,0.33598283,0.0031914806,0.000010546972],"about_ca_topic_score_codex":0.0026476297,"about_ca_topic_score_gemma":0.0032313862,"teacher_disagreement_score":0.012363436,"about_ca_system_score_codex":0.0027172512,"about_ca_system_score_gemma":0.0015831838,"threshold_uncertainty_score":0.041359782},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17481823,0.0005209092,0.8064132,0.002306148,0.00016910196,0.00020394169,0.0010859108,0.0022870975,0.012195521],"genre_scores_gemma":[0.8598166,0.0002627811,0.13574304,0.00016085866,0.00010981562,0.00031330733,0.0007586587,0.00026024002,0.002574744],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99410135,0.0036862446,0.00019293457,0.0010694625,0.0006913245,0.0002586968],"domain_scores_gemma":[0.9163223,0.0645122,0.0056805303,0.009146694,0.0023717037,0.001966598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008592075,0.00074928504,0.00067129644,0.0045214663,0.0018553046,0.0047910092,0.0016900435,0.001353615,0.004298914],"category_scores_gemma":[0.068644546,0.00081569044,0.0006580072,0.004202505,0.0027186715,0.01463773,0.0065195337,0.002007989,0.00074108277],"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.0012148048,0.00041800915,0.036867112,0.00071499264,0.0002050726,0.00023717893,0.019109504,0.07049025,0.008156487,0.3796299,0.01194044,0.47101623],"study_design_scores_gemma":[0.0000561915,0.00007360567,0.0058557945,0.00010839401,0.000078701065,0.00009385122,0.003227205,0.4584053,0.0031135087,0.5119312,0.0170073,0.000049004557],"about_ca_topic_score_codex":0.0027095529,"about_ca_topic_score_gemma":0.0027656686,"teacher_disagreement_score":0.008592075,"about_ca_system_score_codex":0.001261619,"about_ca_system_score_gemma":0.0014843754,"threshold_uncertainty_score":0.04543972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9963767,0.0003353832,0.0003464542,0.00021884053,0.000012818855,0.0000062311487,0.00066314935,0.000005614994,0.0020347286],"genre_scores_gemma":[0.9983871,0.0001787816,0.00015721038,0.000025985555,0.00001691059,0.0000063510342,0.00062334625,0.0000037230059,0.0006007344],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989517,0.00060255465,0.00005138671,0.0001338255,0.0001524008,0.00010803868],"domain_scores_gemma":[0.972022,0.020346217,0.0031228568,0.0012518384,0.0013875108,0.001869654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024601594,0.00029794566,0.00032345374,0.0017335147,0.0007294021,0.0013119928,0.00092436,0.00082608365,0.004095485],"category_scores_gemma":[0.01930544,0.00024280768,0.0004130026,0.0022737926,0.0003886307,0.0014610452,0.0009300285,0.0008350242,0.0010246363],"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.00031034835,0.000228756,0.9854799,0.000038756065,0.00026208477,0.00009114284,0.00038266665,0.0011662546,0.000116382624,0.0006092596,0.00071212417,0.010602329],"study_design_scores_gemma":[0.00002196278,0.00014039666,0.9732593,0.00006887678,0.00017393874,0.00018617547,0.0018345962,0.01993701,0.00017111457,0.0024111585,0.0017771793,0.00001813346],"about_ca_topic_score_codex":0.018445555,"about_ca_topic_score_gemma":0.03522999,"teacher_disagreement_score":0.018445555,"about_ca_system_score_codex":0.00032414927,"about_ca_system_score_gemma":0.0003117509,"threshold_uncertainty_score":0.036676347},"labels":[],"label_agreement":null},{"id":"W2752670111","doi":"10.1093/comnet/cnx039","title":"Two-mode networks exhibiting data loss","year":2017,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalization; Connection (principal bundle); Construct (python library); Matrix (chemical analysis); Computer science; Combinatorics; Matrix analysis; Mode (computer interface); Tournament; Mathematics; Discrete mathematics; Eigenvalues and eigenvectors; Physics","score_opus":0.0569844298999803,"score_gpt":0.3639085522797237,"score_spread":0.30692412237974337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752670111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63117737,0.00056894595,0.34976214,0.004192197,0.000085512285,0.00014481311,0.00075532956,0.0003896992,0.01292397],"genre_scores_gemma":[0.97856015,0.00020922982,0.015548242,0.00026277834,0.00007149575,0.00011871738,0.00029064616,0.00005221012,0.0048865024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998678,0.0006065701,0.000032677424,0.00028532825,0.00021291882,0.00018459848],"domain_scores_gemma":[0.9862152,0.009463678,0.001752264,0.00090617756,0.00076773803,0.00089494494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002652329,0.0005968004,0.00080899044,0.001253953,0.0011486553,0.0019633893,0.0017490967,0.0021781994,0.0033445468],"category_scores_gemma":[0.019064203,0.00059765653,0.0005870814,0.00091251946,0.0018854756,0.0036940253,0.001885192,0.002074391,0.00040993874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058964937,0.00025099644,0.008413123,0.00024004497,0.0001773859,0.0015989887,0.0009109712,0.32389057,0.007897164,0.62748975,0.01035202,0.018189415],"study_design_scores_gemma":[0.000043085187,0.000055515382,0.001311305,0.000018942312,0.000016241715,0.00027778005,0.00018985092,0.7854809,0.0008987431,0.21053319,0.00114624,0.000028185468],"about_ca_topic_score_codex":0.0016077344,"about_ca_topic_score_gemma":0.0014476349,"teacher_disagreement_score":0.0033445468,"about_ca_system_score_codex":0.001445819,"about_ca_system_score_gemma":0.00044342005,"threshold_uncertainty_score":0.014027059},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5345283,0.0009652789,0.43146515,0.0015826337,0.000073356874,0.0004354406,0.0044713416,0.000517394,0.025961125],"genre_scores_gemma":[0.9335246,0.00047461726,0.060271636,0.00006811727,0.000041279454,0.00019674141,0.0019085668,0.000038247443,0.0034762146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991666,0.00034612246,0.000038715167,0.0001479002,0.00022500913,0.0000756403],"domain_scores_gemma":[0.9963438,0.0021203558,0.00056862686,0.00023985938,0.0005827108,0.00014477123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092318235,0.00027872447,0.00025765342,0.0049715117,0.0008309081,0.0010144013,0.00042020233,0.00045691093,0.0030463096],"category_scores_gemma":[0.005883523,0.00015250128,0.0004590083,0.0032603974,0.00046740798,0.0014783766,0.00059629726,0.0004732849,0.0004583131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000351695,0.00029598788,0.111728184,0.0006437085,0.00048421105,0.0014122045,0.004353129,0.23675597,0.016544709,0.37989587,0.014524774,0.23300968],"study_design_scores_gemma":[0.000014436591,0.000080852034,0.04748092,0.000063437285,0.00005873439,0.00053142896,0.0018377391,0.83840954,0.0023875383,0.09001246,0.01908173,0.000041202064],"about_ca_topic_score_codex":0.008251048,"about_ca_topic_score_gemma":0.006700486,"teacher_disagreement_score":0.008251048,"about_ca_system_score_codex":0.0008912333,"about_ca_system_score_gemma":0.000605821,"threshold_uncertainty_score":0.01640606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7468853,0.003280616,0.23418495,0.0036691243,0.00013250773,0.00008720995,0.0005814271,0.00024306028,0.010935783],"genre_scores_gemma":[0.9876996,0.0014117148,0.0057456777,0.00010274877,0.00013221342,0.00005911585,0.00015963077,0.000041942487,0.0046473015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984326,0.00079352636,0.000057328747,0.00029936995,0.00021196525,0.000205217],"domain_scores_gemma":[0.96420383,0.028936934,0.0036897413,0.00097265793,0.0008570036,0.0013398527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025477854,0.0007329702,0.0011150701,0.0025417625,0.0015127128,0.0039945105,0.0020319412,0.0035027827,0.004205937],"category_scores_gemma":[0.033766676,0.0012884487,0.0009945926,0.001962752,0.0035046309,0.0053886166,0.0024494857,0.0025371572,0.00055351015],"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.00037400043,0.00015342903,0.020229267,0.00032659652,0.00021515066,0.000634802,0.0019913325,0.50074226,0.0025419672,0.4476851,0.0042410004,0.020865085],"study_design_scores_gemma":[0.000056529374,0.00006321548,0.0048282486,0.00007969099,0.00007216328,0.00037078967,0.00044527088,0.5611301,0.0004162675,0.431064,0.0014166767,0.00005703928],"about_ca_topic_score_codex":0.0047691213,"about_ca_topic_score_gemma":0.0038757718,"teacher_disagreement_score":0.0047691213,"about_ca_system_score_codex":0.0016665887,"about_ca_system_score_gemma":0.00046689593,"threshold_uncertainty_score":0.014070272},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18355899,0.0023877057,0.727136,0.00883487,0.00050677836,0.00022850896,0.003049001,0.0023678527,0.07193028],"genre_scores_gemma":[0.8448857,0.0018227117,0.13143773,0.003250863,0.00042635412,0.00046838788,0.002210164,0.0009456866,0.014552422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929194,0.0020543656,0.0003693747,0.0017325497,0.002104427,0.0008198806],"domain_scores_gemma":[0.94812876,0.035625845,0.0026667796,0.0089009125,0.0025603953,0.0021174017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004305506,0.0010661138,0.0022550195,0.0018291449,0.0037162562,0.005577108,0.0029478793,0.002889603,0.013891316],"category_scores_gemma":[0.051946867,0.0013050082,0.0015491872,0.0030287954,0.0031212869,0.010965751,0.0050134133,0.005155904,0.0024649044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095520855,0.00015520935,0.001363213,0.0005298428,0.000100764206,0.00028764573,0.000800607,0.03216858,0.0080063185,0.8989188,0.014316491,0.042397313],"study_design_scores_gemma":[0.00008164382,0.0001063674,0.00041768377,0.00006084155,0.000047100646,0.00026172007,0.00014542777,0.085787825,0.0026368548,0.90263903,0.00776508,0.000050472278],"about_ca_topic_score_codex":0.0036513812,"about_ca_topic_score_gemma":0.0020256995,"teacher_disagreement_score":0.013891316,"about_ca_system_score_codex":0.0023553718,"about_ca_system_score_gemma":0.0018524879,"threshold_uncertainty_score":0.04647106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043316044,0.00033104507,0.95445883,0.000066452296,0.000026985232,0.0001386375,0.00011697441,0.0005983394,0.0009466694],"genre_scores_gemma":[0.35771823,0.00026387622,0.6394143,0.0000729954,0.000039119124,0.00019024209,0.00048228638,0.00009671186,0.0017222161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983157,0.00046100837,0.00008303032,0.00037589183,0.00062775274,0.0001366197],"domain_scores_gemma":[0.995477,0.0019555283,0.00055454497,0.00054543023,0.0012441437,0.00022330107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018547623,0.00074523425,0.000962849,0.004043896,0.0008852615,0.0011257854,0.0013484071,0.00091083377,0.0009490539],"category_scores_gemma":[0.006942931,0.00030758147,0.00068353914,0.0022972177,0.0007423367,0.0020794293,0.0013162625,0.0007240902,0.0004088183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054584816,0.0003771731,0.02026245,0.0006242902,0.0003375153,0.0006318046,0.00085416087,0.16632053,0.06548416,0.03994743,0.004918006,0.6996966],"study_design_scores_gemma":[0.000018860897,0.000098078286,0.0022574877,0.00002767314,0.000030466217,0.00058595807,0.00011548833,0.96604806,0.013713049,0.014177334,0.0028940656,0.00003337006],"about_ca_topic_score_codex":0.0022278714,"about_ca_topic_score_gemma":0.0025795014,"teacher_disagreement_score":0.004043896,"about_ca_system_score_codex":0.00066454324,"about_ca_system_score_gemma":0.00079676864,"threshold_uncertainty_score":0.009809017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5118505,0.0027139252,0.059297565,0.004917477,0.0016015229,0.0032617424,0.27811825,0.014758167,0.12348092],"genre_scores_gemma":[0.6947264,0.00269712,0.070749484,0.00096531643,0.0010803373,0.0031993133,0.19132835,0.00095195527,0.034301702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789786,0.00044371124,0.00037384903,0.0003817126,0.00072556967,0.00017723339],"domain_scores_gemma":[0.99603015,0.0014389983,0.0009694803,0.00041680096,0.0009498199,0.00019482675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009782582,0.00080484827,0.0005048162,0.007439142,0.0009482815,0.0021302924,0.0006566087,0.00073743245,0.007909678],"category_scores_gemma":[0.008535715,0.00031318172,0.00047201387,0.0055760187,0.0002107502,0.0028353299,0.002170807,0.0006619794,0.0076275207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085712376,0.0002006569,0.1943615,0.0032102773,0.00021576938,0.0016799915,0.0089039095,0.0031362376,0.020801209,0.0061043305,0.16123493,0.59929407],"study_design_scores_gemma":[0.00006722166,0.00026191748,0.3101858,0.0007555056,0.00023154246,0.0011919183,0.01358194,0.06650728,0.022715587,0.008760713,0.57550794,0.00023279789],"about_ca_topic_score_codex":0.0033630994,"about_ca_topic_score_gemma":0.0042637335,"teacher_disagreement_score":0.007909678,"about_ca_system_score_codex":0.0005992054,"about_ca_system_score_gemma":0.0006399192,"threshold_uncertainty_score":0.026460528},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9317383,0.0037093065,0.049584176,0.0005707803,0.00008470993,0.000044292963,0.000619015,0.0001458114,0.013503536],"genre_scores_gemma":[0.9911239,0.0005066891,0.0068240627,0.000013249698,0.00007211259,0.000019070814,0.0004347832,0.000032836128,0.00097334554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985935,0.0007686425,0.00004157646,0.0002127153,0.00027668453,0.00010694498],"domain_scores_gemma":[0.95154494,0.042412605,0.0016309158,0.0014096986,0.00227379,0.00072801055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028014986,0.000423495,0.00047010285,0.0056016,0.0007687876,0.001785399,0.0008821431,0.00050270074,0.003264396],"category_scores_gemma":[0.027198045,0.00020668932,0.00032689734,0.004436833,0.000994694,0.003510424,0.0007317976,0.00066083466,0.00027773425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012916111,0.000542121,0.09218708,0.0010271121,0.0007454907,0.00059954036,0.0038890163,0.119497865,0.013932792,0.47881845,0.011378792,0.27609006],"study_design_scores_gemma":[0.000088653156,0.00063830026,0.11351506,0.00022665088,0.000497847,0.0012480458,0.0038919754,0.6351486,0.0062688133,0.22752078,0.010828573,0.00012675724],"about_ca_topic_score_codex":0.0016074805,"about_ca_topic_score_gemma":0.0021656961,"teacher_disagreement_score":0.0056016,"about_ca_system_score_codex":0.0011955508,"about_ca_system_score_gemma":0.0003673874,"threshold_uncertainty_score":0.014815867},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68328685,0.00080331654,0.2956204,0.0013879377,0.00007241683,0.00007391445,0.0002315421,0.0002471367,0.018276524],"genre_scores_gemma":[0.99062514,0.00022829472,0.005814849,0.00007322069,0.000025158457,0.000046153782,0.000054271466,0.000027014905,0.0031057661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999816,0.00006207542,0.0000057853727,0.000036099213,0.000035264387,0.000044725442],"domain_scores_gemma":[0.99916875,0.00038810493,0.00017545138,0.000054998392,0.00007999014,0.00013271366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004889174,0.0003588611,0.0004412635,0.00095091294,0.0003877775,0.00080298254,0.00094582816,0.000765235,0.0021930137],"category_scores_gemma":[0.0024367096,0.00021527,0.00050911936,0.00039918377,0.001135065,0.0013613241,0.0007953224,0.0008200618,0.00018243965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009139909,0.00006222281,0.0019583711,0.00007206019,0.00006197692,0.0004981237,0.00033594278,0.4487051,0.010829187,0.531733,0.001477188,0.0041754483],"study_design_scores_gemma":[0.000017676753,0.000034070326,0.0008222998,0.000011898413,0.000012729769,0.0000872316,0.000051136354,0.91019094,0.0006329205,0.08748361,0.0006388824,0.000016665776],"about_ca_topic_score_codex":0.0022256942,"about_ca_topic_score_gemma":0.0012208406,"teacher_disagreement_score":0.0022256942,"about_ca_system_score_codex":0.0008774921,"about_ca_system_score_gemma":0.0004256938,"threshold_uncertainty_score":0.0073363185},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27110028,0.0034196214,0.57080704,0.0037610545,0.0008385131,0.00013521961,0.0014692425,0.00065729115,0.14781173],"genre_scores_gemma":[0.9429547,0.0017649764,0.0329817,0.0005728053,0.0012229959,0.00014758162,0.0008340171,0.00023701125,0.019284232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999172,0.00021656601,0.000047972066,0.00025009675,0.00020646692,0.0001069603],"domain_scores_gemma":[0.99413955,0.002603297,0.0012192369,0.0007037665,0.0005730534,0.0007611472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009542597,0.0006236765,0.0007390917,0.0040057246,0.0009117824,0.002963574,0.00099106,0.00092969264,0.008513718],"category_scores_gemma":[0.008937798,0.00035345764,0.000552663,0.0017865085,0.003254972,0.0067349086,0.0017609583,0.0018114848,0.0014552244],"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.000023320603,0.000016687985,0.00070220674,0.00006682979,0.000009811484,0.0000783744,0.00013424817,0.001436599,0.0013562568,0.9843038,0.0030990615,0.008772823],"study_design_scores_gemma":[0.000008462437,0.00001722893,0.0011741488,0.000033436914,0.000016412921,0.00026393644,0.00008457972,0.023190081,0.00054802035,0.9673081,0.0073337043,0.000021860458],"about_ca_topic_score_codex":0.0007285581,"about_ca_topic_score_gemma":0.00071038055,"teacher_disagreement_score":0.008513718,"about_ca_system_score_codex":0.00089590455,"about_ca_system_score_gemma":0.00040850978,"threshold_uncertainty_score":0.028481245},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8403683,0.00070915296,0.1381297,0.0015747446,0.00006755562,0.00004059385,0.00023674086,0.00034149922,0.0185318],"genre_scores_gemma":[0.9893085,0.0002784633,0.0079092,0.000098347686,0.000034688,0.00003320341,0.00010052931,0.00004299423,0.0021940412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997452,0.000079924015,0.000009807919,0.00005644763,0.00005797055,0.000050797466],"domain_scores_gemma":[0.9984011,0.00052746595,0.0005107653,0.00016155772,0.00017105248,0.00022813534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040117075,0.00039520787,0.00029509157,0.0015458158,0.0006709411,0.0015872575,0.00072908145,0.00075197575,0.00217112],"category_scores_gemma":[0.004093208,0.00039347296,0.00041835755,0.00070410594,0.0016131626,0.0019252993,0.0010676597,0.0006008942,0.00023879681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051766034,0.000035844154,0.0039249207,0.000048836315,0.000040403298,0.00045089243,0.00026987604,0.2595286,0.0055262777,0.72192556,0.0015843828,0.0066126385],"study_design_scores_gemma":[0.000020432637,0.000030001938,0.0032733416,0.000014410746,0.0000129754435,0.00022969166,0.00010958305,0.70248497,0.0010994828,0.29039004,0.0023005886,0.0000345174],"about_ca_topic_score_codex":0.00264853,"about_ca_topic_score_gemma":0.0022401346,"teacher_disagreement_score":0.00264853,"about_ca_system_score_codex":0.0015417733,"about_ca_system_score_gemma":0.0004384675,"threshold_uncertainty_score":0.011186421},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040021695,0.00069730164,0.94140005,0.001397405,0.0001087244,0.0001197836,0.00024135968,0.000106229716,0.015907492],"genre_scores_gemma":[0.8843458,0.001324918,0.09018444,0.00026785806,0.00019109245,0.0003181955,0.00016073408,0.0000738964,0.023133047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991204,0.00039072175,0.000032150914,0.00018265806,0.00014330323,0.00013072869],"domain_scores_gemma":[0.99848515,0.0009727657,0.0001775108,0.00006354812,0.00020183921,0.00009926705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015798949,0.0011583406,0.0013521834,0.0009976993,0.00073784933,0.0020613442,0.0021530197,0.0027794484,0.0044269506],"category_scores_gemma":[0.003724116,0.000705221,0.0013538483,0.0012180837,0.0014708325,0.0028013294,0.0010990645,0.00178364,0.00057761645],"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.00008172319,0.00010610297,0.00066627347,0.00016987171,0.00006830925,0.00059218437,0.000199593,0.7024452,0.003878937,0.27997577,0.002555436,0.009260527],"study_design_scores_gemma":[0.0000103814955,0.000023376571,0.000087912595,0.0000057454663,0.000012950511,0.00006655968,0.000013129924,0.9818179,0.00014542283,0.017169604,0.0006366406,0.000010231351],"about_ca_topic_score_codex":0.0041800085,"about_ca_topic_score_gemma":0.003084494,"teacher_disagreement_score":0.0044269506,"about_ca_system_score_codex":0.002050527,"about_ca_system_score_gemma":0.0008869633,"threshold_uncertainty_score":0.014877737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00533435,0.000057111636,0.9927286,0.00018089284,0.000018017117,0.00005140079,0.00035461137,0.00035671602,0.0009183343],"genre_scores_gemma":[0.30897188,0.00044714304,0.6805068,0.00023285813,0.00016335736,0.0006102504,0.002681637,0.00034438336,0.0060415547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916995,0.00023738349,0.000058028374,0.00025762033,0.00020268772,0.00007429102],"domain_scores_gemma":[0.9958538,0.0026829736,0.00034165202,0.000471657,0.0004816499,0.00016831052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014069249,0.0007822869,0.00083902763,0.00220936,0.0007989884,0.0016460841,0.0019125539,0.0011786243,0.0044851815],"category_scores_gemma":[0.009720164,0.0005023604,0.0012720205,0.0019233935,0.0007464432,0.0031457532,0.0019005627,0.0023246263,0.0012117397],"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.00020085319,0.00023077131,0.0030140984,0.00024883225,0.000098493416,0.00022405574,0.00029339409,0.5054583,0.0056381132,0.2831562,0.0071803215,0.1942566],"study_design_scores_gemma":[0.0000064449705,0.000007781847,0.00011473629,0.000010299368,0.000008900024,0.000023117931,0.000010366949,0.93973476,0.00041630832,0.058949176,0.00071271905,0.0000053585713],"about_ca_topic_score_codex":0.0032318104,"about_ca_topic_score_gemma":0.0044023194,"teacher_disagreement_score":0.0044851815,"about_ca_system_score_codex":0.0013251266,"about_ca_system_score_gemma":0.0014129397,"threshold_uncertainty_score":0.015004456},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2914507,0.00053887174,0.70554525,0.00028038028,0.000029483106,0.00011800995,0.0002638818,0.0003764549,0.0013969513],"genre_scores_gemma":[0.893691,0.00028974368,0.10513851,0.000034128312,0.000037103742,0.00006287612,0.0002834007,0.000019026742,0.0004442041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820185,0.00063105195,0.00007548357,0.00042669478,0.0005571272,0.00010782763],"domain_scores_gemma":[0.99428517,0.0037406248,0.00078344595,0.00043395048,0.00055382214,0.0002030563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017695802,0.00054272526,0.00080495485,0.0042726486,0.0007802388,0.0015902324,0.0010434341,0.0010596602,0.00037727],"category_scores_gemma":[0.010272271,0.00033941877,0.00068010826,0.0028488124,0.0007450894,0.003701695,0.0012061783,0.00076435175,0.00018966767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064258446,0.0007312107,0.075003244,0.00036039794,0.0003713304,0.0005213253,0.001088265,0.39599645,0.017882293,0.043700244,0.002240558,0.4614621],"study_design_scores_gemma":[0.000007115272,0.00004256812,0.0039044048,0.000011143619,0.000027584143,0.00013455836,0.00012106516,0.9783199,0.0019915625,0.014969019,0.0004558284,0.000015208415],"about_ca_topic_score_codex":0.0021497398,"about_ca_topic_score_gemma":0.0018934392,"teacher_disagreement_score":0.0042726486,"about_ca_system_score_codex":0.00071280665,"about_ca_system_score_gemma":0.000486763,"threshold_uncertainty_score":0.009358585},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06023709,0.0012685847,0.91933507,0.0009980613,0.00011099569,0.000061021063,0.00014066795,0.00028478648,0.017563669],"genre_scores_gemma":[0.8086919,0.0016428428,0.17175207,0.00028528538,0.00013414919,0.0003580728,0.00023296775,0.00021836677,0.016684273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997402,0.00008569467,0.000008976901,0.000031794872,0.00008699852,0.00004634512],"domain_scores_gemma":[0.99895346,0.0007053537,0.00009504039,0.00007077414,0.00012638603,0.000049059257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008949917,0.00063145615,0.0007033552,0.00085923215,0.0004791499,0.00084020937,0.0011594965,0.0013979179,0.0028547756],"category_scores_gemma":[0.005391718,0.00058620836,0.00048508254,0.00068106566,0.0014463698,0.0020202363,0.0010758948,0.0010270601,0.00035800072],"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.000016954884,0.000018184073,0.0002877852,0.0000871331,0.000015048381,0.000062610525,0.00008503263,0.6750833,0.0011389302,0.31436965,0.0009786773,0.0078567],"study_design_scores_gemma":[0.0000034542581,0.0000018499962,0.000039182563,0.000005387415,0.0000011342457,0.0000054059383,0.0000060339585,0.9479014,0.00008338119,0.051637333,0.00031282962,0.000002607162],"about_ca_topic_score_codex":0.0045190994,"about_ca_topic_score_gemma":0.004533441,"teacher_disagreement_score":0.0045190994,"about_ca_system_score_codex":0.0014519666,"about_ca_system_score_gemma":0.0010292178,"threshold_uncertainty_score":0.010534823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14686526,0.0007208068,0.8362372,0.001030121,0.00010701654,0.0001006348,0.00011432524,0.00021625317,0.014608365],"genre_scores_gemma":[0.96343255,0.0007048524,0.02674993,0.00015557649,0.00007762555,0.00014895032,0.000059838276,0.00006612032,0.008604621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928635,0.00034464803,0.000028218326,0.00009836755,0.00013250807,0.00010997286],"domain_scores_gemma":[0.99756575,0.0016487137,0.0003592478,0.000109346634,0.00014186569,0.00017511427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015613047,0.0009875214,0.0011730442,0.00095003226,0.0007872817,0.0016395827,0.0014810538,0.001960869,0.0023729887],"category_scores_gemma":[0.004523493,0.00056984054,0.0010127737,0.0005848988,0.002300376,0.0018469907,0.0017058298,0.0017350602,0.0002669338],"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.000032161293,0.00003439469,0.000259143,0.000028931072,0.000018243833,0.00011029165,0.000068775116,0.9458827,0.001297789,0.049959656,0.0003129608,0.0019950108],"study_design_scores_gemma":[0.000005310614,0.000011830528,0.00003843252,0.0000024638236,0.0000041800045,0.00000839539,0.000009141557,0.9916357,0.000093625786,0.008026873,0.0001596812,0.0000044264025],"about_ca_topic_score_codex":0.004920194,"about_ca_topic_score_gemma":0.0028202771,"teacher_disagreement_score":0.004920194,"about_ca_system_score_codex":0.0013100448,"about_ca_system_score_gemma":0.00068603805,"threshold_uncertainty_score":0.009783089},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005090794,0.19872092,0.74077696,0.004227176,0.0016447278,0.00018931161,0.0017705278,0.0007173993,0.046862226],"genre_scores_gemma":[0.1258876,0.5101051,0.3300274,0.0014343619,0.0047199004,0.00071818463,0.0049249213,0.00061497756,0.02156761],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99826163,0.00064748724,0.00013318425,0.00035261366,0.0005369388,0.000068214],"domain_scores_gemma":[0.99730265,0.0017624912,0.00013762654,0.0003218991,0.00041445196,0.00006085026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018934635,0.0015768606,0.0013639935,0.004916444,0.00082578225,0.0030596736,0.0012733204,0.0013114406,0.008031228],"category_scores_gemma":[0.0069463374,0.0005875074,0.0010501181,0.0076931827,0.0011835418,0.0068968222,0.001935377,0.0018554563,0.0027377296],"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.000035577334,0.000061129416,0.0013419607,0.0031609838,0.00013329578,0.00015968896,0.00026089285,0.02498117,0.0010815297,0.36391014,0.035489954,0.56938374],"study_design_scores_gemma":[0.000011183818,0.000066873625,0.0014002442,0.0012642158,0.000069083,0.0007413183,0.0002492017,0.10190894,0.0013609609,0.46625435,0.42660576,0.00006786315],"about_ca_topic_score_codex":0.0018005823,"about_ca_topic_score_gemma":0.0015050196,"teacher_disagreement_score":0.008031228,"about_ca_system_score_codex":0.0012642576,"about_ca_system_score_gemma":0.0010441517,"threshold_uncertainty_score":0.026867092},"labels":[],"label_agreement":null},{"id":"W2769227974","doi":"10.1093/comnet/cnz019","title":"Local clustering coefficient of spatial preferential attachment model","year":2019,"lang":"en","type":"preprint","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research","keywords":"Cluster analysis; Clustering coefficient; Preferential attachment; Vertex (graph theory); Computer science; Complex network; Mathematics; Statistical physics; Combinatorics; Physics; Graph; Artificial intelligence","score_opus":0.031472128706824594,"score_gpt":0.29944240186409743,"score_spread":0.26797027315727284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769227974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36181176,0.0028206524,0.60974526,0.0019121509,0.00016957843,0.0001487946,0.0006561445,0.0004662907,0.02226935],"genre_scores_gemma":[0.9848509,0.00087631994,0.009513624,0.00013336114,0.00007548693,0.00008982103,0.00016673212,0.000057892077,0.0042358795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989278,0.00033258583,0.000031672113,0.000246274,0.0002563745,0.0002052481],"domain_scores_gemma":[0.9959423,0.0018051311,0.0007858549,0.00029803917,0.00081044965,0.00035820986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014834476,0.0006406594,0.0008985662,0.001920321,0.0007630704,0.0011049985,0.002046174,0.0012769464,0.0030287101],"category_scores_gemma":[0.008664638,0.00036949472,0.00070124754,0.0014405971,0.0014439767,0.0027314706,0.0010553921,0.0009973262,0.000571676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014621396,0.000057736353,0.00721699,0.00030200914,0.00014903564,0.0005120085,0.00047221946,0.6110238,0.005366151,0.35237846,0.0078053474,0.014570044],"study_design_scores_gemma":[0.000015945727,0.000030639792,0.001763946,0.000022138198,0.000033886547,0.00019297286,0.00007572978,0.9244824,0.0006313362,0.07147614,0.0012346117,0.000040381474],"about_ca_topic_score_codex":0.0078119226,"about_ca_topic_score_gemma":0.004681187,"teacher_disagreement_score":0.0078119226,"about_ca_system_score_codex":0.0017738484,"about_ca_system_score_gemma":0.0007898159,"threshold_uncertainty_score":0.015532911},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027338339,0.00074548554,0.9932261,0.00024096257,0.00013704569,0.000041111627,0.00009549274,0.00044627505,0.0023335805],"genre_scores_gemma":[0.09690721,0.0019029058,0.8853374,0.00024101885,0.0007326657,0.00027875183,0.0008753219,0.0005237589,0.0132008875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991399,0.00020012497,0.00003771834,0.00023212224,0.00032971,0.000060372797],"domain_scores_gemma":[0.9965888,0.0018906601,0.00018707897,0.00053357315,0.00065120985,0.00014868399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014975765,0.0013888784,0.0014826335,0.0020235654,0.000793266,0.0014378047,0.0024552657,0.0014329473,0.005806087],"category_scores_gemma":[0.009281723,0.0008325037,0.0011689896,0.0024892632,0.0010243806,0.0030984003,0.002606033,0.0027097939,0.002332803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015697752,0.00013846983,0.00090308575,0.0004295218,0.00020134306,0.00008921292,0.00020174198,0.2827344,0.0071040783,0.12167676,0.03018964,0.5561748],"study_design_scores_gemma":[0.000013639278,0.000012587773,0.000169501,0.000013843962,0.00001193752,0.0000597727,0.000013307287,0.91840005,0.0008568077,0.07652796,0.0039109103,0.000009742953],"about_ca_topic_score_codex":0.002763866,"about_ca_topic_score_gemma":0.004214181,"teacher_disagreement_score":0.005806087,"about_ca_system_score_codex":0.00091571326,"about_ca_system_score_gemma":0.00085139484,"threshold_uncertainty_score":0.019423306},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7678875,0.0012128255,0.1938455,0.0020964623,0.000059053433,0.0006158009,0.0026547248,0.0007127876,0.030915346],"genre_scores_gemma":[0.97225463,0.0002596613,0.021315038,0.00012977536,0.000035181038,0.00040221977,0.001176139,0.0000749947,0.0043523978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99748564,0.00076425285,0.000098106706,0.0006640273,0.000686097,0.00030183131],"domain_scores_gemma":[0.9842515,0.007902948,0.0026553418,0.0012967503,0.002745236,0.0011482361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002164879,0.0003873511,0.00068973145,0.0060612983,0.0030746125,0.0026184318,0.0017805785,0.0015549355,0.0045172274],"category_scores_gemma":[0.02347716,0.0007119638,0.00068561645,0.0033317108,0.0026226244,0.003126664,0.0025175402,0.00085755857,0.0008735145],"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.000695462,0.0002788758,0.100276925,0.0007782493,0.00033602386,0.0017427088,0.009358892,0.35308152,0.015197459,0.41000423,0.018190363,0.09005931],"study_design_scores_gemma":[0.00014380881,0.00012794012,0.030617395,0.00015481199,0.00007599512,0.00087943574,0.0031807297,0.60358846,0.0030481643,0.33625028,0.021811357,0.00012163924],"about_ca_topic_score_codex":0.008622548,"about_ca_topic_score_gemma":0.00688848,"teacher_disagreement_score":0.008622548,"about_ca_system_score_codex":0.0026192477,"about_ca_system_score_gemma":0.0015743895,"threshold_uncertainty_score":0.019004107},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002611272,0.00078417314,0.96211463,0.00096949434,0.00038618216,0.000260916,0.0017755945,0.0020816107,0.029016223],"genre_scores_gemma":[0.08073687,0.0008237299,0.89292604,0.00082929403,0.00023031287,0.00055871264,0.0045691435,0.0007908301,0.018535033],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959651,0.0012752668,0.00028962636,0.0009289941,0.0012557721,0.00028526373],"domain_scores_gemma":[0.99422425,0.0021595056,0.00027529112,0.0012734589,0.0018446927,0.00022280938],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003002717,0.0012189286,0.0013319707,0.0031657775,0.0018130954,0.0037526512,0.0037670347,0.0021123025,0.039678335],"category_scores_gemma":[0.0146592315,0.0006218922,0.001658005,0.002983206,0.0008835643,0.0030482046,0.0041494323,0.0019154515,0.011201863],"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.00023243403,0.0001742372,0.0027425217,0.00080154574,0.0002310481,0.00021979545,0.00026047943,0.13111311,0.0023091089,0.2893549,0.08397532,0.4885856],"study_design_scores_gemma":[0.00006476002,0.000058687754,0.00048430148,0.00017714479,0.00006466153,0.00032450617,0.0002143588,0.5416655,0.0023347028,0.26421407,0.19034648,0.000050805327],"about_ca_topic_score_codex":0.0046334243,"about_ca_topic_score_gemma":0.0069162203,"teacher_disagreement_score":0.96032166,"about_ca_system_score_codex":0.0016750004,"about_ca_system_score_gemma":0.0028199314,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033295285,0.00096389925,0.96248704,0.00036444017,0.000072940704,0.00009111478,0.00015704414,0.00045227006,0.002115941],"genre_scores_gemma":[0.5283065,0.0011074401,0.46548265,0.00035313034,0.00019423076,0.00026227618,0.00071153865,0.00019209839,0.0033901755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551505,0.0014395331,0.00018678814,0.0013125797,0.0012688747,0.00027718698],"domain_scores_gemma":[0.9852424,0.009006458,0.0020005286,0.0012830639,0.001968077,0.0004994353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003887171,0.0007086563,0.0012172115,0.0053937333,0.0014061581,0.002099595,0.0023234454,0.0023231967,0.0011364964],"category_scores_gemma":[0.031696483,0.0006142881,0.00089491747,0.0035645966,0.0017912323,0.0042981305,0.0025847098,0.0016922938,0.00045035654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003662388,0.00016703465,0.020721383,0.0005365438,0.00036965127,0.0009214937,0.001407547,0.34192324,0.01723216,0.19437185,0.0089741815,0.41300872],"study_design_scores_gemma":[0.00001689893,0.000035848192,0.0016088224,0.000034016794,0.000025088775,0.00030719,0.000119956174,0.90611523,0.0031243698,0.083790794,0.0047967825,0.000024907591],"about_ca_topic_score_codex":0.0032798562,"about_ca_topic_score_gemma":0.0016059743,"teacher_disagreement_score":0.0053937333,"about_ca_system_score_codex":0.0014230527,"about_ca_system_score_gemma":0.0006400418,"threshold_uncertainty_score":0.020557582},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1564098,0.0002638162,0.8387338,0.00033056815,0.000029791876,0.000065016604,0.00003913895,0.0003076269,0.003820391],"genre_scores_gemma":[0.97791195,0.00007364691,0.021498153,0.00002512321,0.000007311997,0.000022832857,0.000015779158,0.000014078121,0.00043110162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996216,0.00016900389,0.000012654771,0.000062037725,0.00006523309,0.00006954458],"domain_scores_gemma":[0.99897695,0.000538409,0.00020188604,0.00009743532,0.000114072354,0.00007130485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089536904,0.00061002024,0.00044204423,0.0005149446,0.0003855169,0.0005885353,0.0008722819,0.0006418463,0.00068207434],"category_scores_gemma":[0.002903927,0.00023679843,0.0002571974,0.0002533184,0.0005620358,0.001099633,0.0010341362,0.00056044204,0.00011135686],"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.00005356895,0.000032502925,0.0010901844,0.000025650992,0.000022780614,0.00009262162,0.000089286055,0.96753436,0.004452432,0.007751819,0.00032009927,0.018534768],"study_design_scores_gemma":[0.0000046932573,0.00003760233,0.00042003338,0.000004428878,0.000008371831,0.00005018526,0.0000565889,0.99080503,0.00085746933,0.007423971,0.00032437893,0.0000072588273],"about_ca_topic_score_codex":0.0018411111,"about_ca_topic_score_gemma":0.0019437188,"teacher_disagreement_score":0.0018411111,"about_ca_system_score_codex":0.00065258855,"about_ca_system_score_gemma":0.0005674455,"threshold_uncertainty_score":0.0047352314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02802566,0.0002261403,0.9676889,0.0005012137,0.000108969434,0.00008979529,0.00016862649,0.001183884,0.002006804],"genre_scores_gemma":[0.12533377,0.00021075153,0.8656423,0.00020053785,0.000077774646,0.00030163728,0.0005987862,0.0006575063,0.0069769328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864787,0.00043946155,0.00007729679,0.00037082544,0.00030683048,0.00015778502],"domain_scores_gemma":[0.9939539,0.0039028907,0.0002584811,0.00071869703,0.0008467085,0.000319441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024995191,0.0014785166,0.0018267019,0.002362635,0.0021932204,0.0032899538,0.0027406644,0.0021304982,0.0080151325],"category_scores_gemma":[0.013766383,0.001348341,0.0016890744,0.0022468346,0.0017292252,0.0041176574,0.0028103283,0.0032968961,0.001374165],"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.0007553251,0.00026594417,0.0019601686,0.00029715628,0.00020711691,0.000110557834,0.0005468234,0.6306941,0.007726466,0.091271356,0.007430041,0.25873494],"study_design_scores_gemma":[0.000046467812,0.000046705463,0.00020591386,0.000024596375,0.00002250088,0.000018675835,0.00006404033,0.9768777,0.0013813708,0.019325832,0.0019752155,0.000011015925],"about_ca_topic_score_codex":0.020870214,"about_ca_topic_score_gemma":0.0251349,"teacher_disagreement_score":0.020870214,"about_ca_system_score_codex":0.00255046,"about_ca_system_score_gemma":0.002079008,"threshold_uncertainty_score":0.04149747},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008823313,0.000092037684,0.99038273,0.00006319472,0.000024021512,0.000041410287,0.000055616758,0.00019423137,0.00032340374],"genre_scores_gemma":[0.44567987,0.00025918146,0.5493999,0.00014403758,0.0001431835,0.00032735497,0.00053723244,0.0001647529,0.0033444816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979888,0.00068003417,0.00011119191,0.0005257486,0.000540302,0.00015377137],"domain_scores_gemma":[0.9909339,0.005174812,0.00075787626,0.00076044287,0.001939884,0.000433007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032807821,0.0007983236,0.0016987119,0.002932932,0.0012068264,0.0011494746,0.0029361271,0.001981189,0.001793809],"category_scores_gemma":[0.01319463,0.0005901156,0.0012245587,0.0018978853,0.0010884223,0.0022410739,0.002209796,0.0017508983,0.0005762928],"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.0004340068,0.00036294386,0.005293158,0.00058263424,0.0005412569,0.00033214994,0.0004704468,0.6054497,0.022213496,0.08702139,0.00516487,0.27213392],"study_design_scores_gemma":[0.000009547566,0.00002698523,0.00020049102,0.000005877728,0.000016145395,0.000032402197,0.000016901426,0.9852938,0.0012061166,0.01288876,0.00029236331,0.000010731198],"about_ca_topic_score_codex":0.0031066153,"about_ca_topic_score_gemma":0.003343091,"teacher_disagreement_score":0.0032807821,"about_ca_system_score_codex":0.00091589865,"about_ca_system_score_gemma":0.0014636354,"threshold_uncertainty_score":0.017350674},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0676708,0.0008027799,0.91647273,0.002919744,0.0002134043,0.0006348096,0.0030526733,0.0015560581,0.006676929],"genre_scores_gemma":[0.66290885,0.0011687361,0.2872432,0.0016845553,0.0005206926,0.0030330208,0.00693033,0.0005920156,0.0359186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962649,0.0014207775,0.00016961424,0.0012120008,0.0005018817,0.00043091757],"domain_scores_gemma":[0.9850825,0.010296369,0.0013479479,0.0015027833,0.0011565809,0.0006137565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008882183,0.0011288669,0.0017927522,0.0037319632,0.001724941,0.0031228303,0.0058177006,0.0037139126,0.015584518],"category_scores_gemma":[0.027951263,0.00080322206,0.0028089348,0.0031955421,0.0027202724,0.008103402,0.0022104501,0.0041409824,0.0041498505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005547659,0.00037633025,0.013883613,0.0004127007,0.00020192812,0.00049199385,0.0020055878,0.23339903,0.0028731471,0.62514293,0.020070592,0.100587316],"study_design_scores_gemma":[0.00006409499,0.00005504963,0.0013453536,0.00005611189,0.000028727394,0.00016200307,0.00011825018,0.7807443,0.00018798205,0.2134332,0.0037681283,0.000036789603],"about_ca_topic_score_codex":0.011242785,"about_ca_topic_score_gemma":0.01028682,"teacher_disagreement_score":0.015584518,"about_ca_system_score_codex":0.0040532234,"about_ca_system_score_gemma":0.0016056326,"threshold_uncertainty_score":0.052135468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898872,0.000312187,0.00075021014,0.00043316407,0.000011470745,0.000032088752,0.0004455985,0.0000031258978,0.008124856],"genre_scores_gemma":[0.99720603,0.00053273444,0.00068060786,0.0000467102,0.000020425334,0.0000428715,0.0005786411,0.0000049638484,0.0008869193],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908125,0.00044259432,0.000053961645,0.000116536256,0.00019318567,0.00011243152],"domain_scores_gemma":[0.99743646,0.0012888454,0.000623858,0.000093200586,0.00030766532,0.00024995132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013978946,0.00022010945,0.00020087886,0.0032765886,0.001094119,0.0016741435,0.00021475603,0.0004196671,0.0021171637],"category_scores_gemma":[0.0035449653,0.00012322995,0.0003564206,0.0046582506,0.0006054955,0.0021590486,0.0009813145,0.00041402632,0.00033316948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013215159,0.00029471528,0.86609805,0.00027483614,0.00013637176,0.0012569872,0.056626063,0.0011269463,0.0007561718,0.013800269,0.0038664062,0.05563098],"study_design_scores_gemma":[0.000008791564,0.00022178944,0.7972331,0.00027370953,0.00007947574,0.0011889702,0.15469445,0.006860143,0.000387528,0.003498721,0.035513338,0.000039922536],"about_ca_topic_score_codex":0.004924263,"about_ca_topic_score_gemma":0.0058925794,"teacher_disagreement_score":0.004924263,"about_ca_system_score_codex":0.00089721626,"about_ca_system_score_gemma":0.00052417075,"threshold_uncertainty_score":0.009791195},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19235972,0.00097426254,0.19565514,0.037614234,0.001167431,0.00030173475,0.0010778818,0.0011006086,0.56974894],"genre_scores_gemma":[0.81595594,0.000416115,0.037012246,0.0015678218,0.000147352,0.00015507557,0.00044062093,0.00033054213,0.14397421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912876,0.00037886118,0.000025226198,0.0001662489,0.0001710427,0.00012982654],"domain_scores_gemma":[0.9972289,0.0013568448,0.00012722301,0.00047929375,0.0003162767,0.00049147656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010209486,0.0003030904,0.00042302578,0.00033232756,0.0016108818,0.002519814,0.0009620865,0.001639297,0.044486023],"category_scores_gemma":[0.00796444,0.0002771803,0.00039313312,0.00051278376,0.00087229774,0.0054792175,0.0015439645,0.0021897606,0.011726677],"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.00045374528,0.00037886086,0.006230225,0.0002109325,0.00010322478,0.0004041425,0.0031310664,0.0071688457,0.005269796,0.6326208,0.10526694,0.23876132],"study_design_scores_gemma":[0.00009720285,0.00011464692,0.0018535185,0.00010774232,0.000088524546,0.0003870971,0.006975034,0.043784317,0.0047238492,0.8029794,0.13881113,0.00007743946],"about_ca_topic_score_codex":0.0017637938,"about_ca_topic_score_gemma":0.0044558276,"teacher_disagreement_score":0.044486023,"about_ca_system_score_codex":0.0005426955,"about_ca_system_score_gemma":0.0008727534,"threshold_uncertainty_score":0.14882058},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21993652,0.012224218,0.7021108,0.006839221,0.00041997316,0.00060874474,0.0025111896,0.004906218,0.050443184],"genre_scores_gemma":[0.9053796,0.0054524667,0.072854504,0.0014844185,0.0007653362,0.0008832145,0.0018666445,0.0016162014,0.009697679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99370426,0.0013348187,0.0002484001,0.0013061109,0.001659106,0.0017472721],"domain_scores_gemma":[0.9296857,0.05288406,0.00440999,0.006922357,0.0024085583,0.0036892677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043019503,0.0038238263,0.00415549,0.003846362,0.0032058824,0.006136149,0.005625758,0.0035679722,0.0108047305],"category_scores_gemma":[0.05141935,0.0022050512,0.0027329,0.0038651514,0.0045010475,0.013606622,0.0057559307,0.0074259154,0.0028183279],"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.0024224867,0.0006583498,0.0058083707,0.001396902,0.0004536833,0.0013443077,0.002042573,0.4572831,0.026002571,0.4238672,0.022838127,0.055882346],"study_design_scores_gemma":[0.00013979702,0.00022073342,0.001052776,0.00018823303,0.00019590318,0.00052038074,0.0002132872,0.651269,0.0038304732,0.3360265,0.006248787,0.000094163246],"about_ca_topic_score_codex":0.003935637,"about_ca_topic_score_gemma":0.0043844385,"teacher_disagreement_score":0.0108047305,"about_ca_system_score_codex":0.0052128113,"about_ca_system_score_gemma":0.0020932786,"threshold_uncertainty_score":0.03782177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069184765,0.00031785094,0.9264559,0.000397344,0.000044534827,0.00015689766,0.00047870094,0.00039353006,0.0025704454],"genre_scores_gemma":[0.60626024,0.00048156542,0.38683924,0.00022463812,0.000110415494,0.00034986617,0.002319227,0.00018368715,0.003231117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872655,0.0006375368,0.00004833552,0.00029051196,0.00018635672,0.000110772875],"domain_scores_gemma":[0.9948544,0.0030661572,0.00061336707,0.0005881303,0.00067024503,0.00020771929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013724968,0.0009888535,0.000788178,0.003950567,0.001432748,0.0018533213,0.0012087661,0.0009155667,0.001522265],"category_scores_gemma":[0.00953674,0.00066182076,0.0012100327,0.0028375483,0.001100958,0.0017586933,0.0014590194,0.0010099222,0.0004277476],"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.00008497885,0.000060894443,0.0073922467,0.00013256639,0.00018034015,0.00017856885,0.00047409584,0.908699,0.001671773,0.040298067,0.0030336722,0.037793856],"study_design_scores_gemma":[0.0000071618047,0.0000123464815,0.00095535745,0.000010881837,0.000015632619,0.000038524864,0.00010111662,0.9650402,0.00027430675,0.032275144,0.0012575455,0.000011802821],"about_ca_topic_score_codex":0.011330087,"about_ca_topic_score_gemma":0.016007118,"teacher_disagreement_score":0.011330087,"about_ca_system_score_codex":0.0014800867,"about_ca_system_score_gemma":0.00086561055,"threshold_uncertainty_score":0.02252829},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2261983,0.000904119,0.7708575,0.0004485867,0.000043417043,0.00005190941,0.00021083324,0.00044736566,0.00083797274],"genre_scores_gemma":[0.84727466,0.0005440227,0.151172,0.00006747624,0.000051541698,0.000052024134,0.00034093327,0.000042487998,0.000454878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997546,0.0008086743,0.00017909463,0.00063951215,0.0006707257,0.00015602063],"domain_scores_gemma":[0.98766685,0.0072060493,0.0026882777,0.0010829235,0.0010528793,0.00030299363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023654094,0.00074053416,0.0010098264,0.0053458544,0.0009832034,0.001711248,0.0011066461,0.0014443162,0.00044166786],"category_scores_gemma":[0.016119557,0.0004831347,0.00067154464,0.002934278,0.0013298374,0.0036059425,0.001889802,0.001047959,0.0001993452],"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.00043874703,0.00015977847,0.15077049,0.00048581592,0.0004638801,0.0013991678,0.0017268274,0.5571637,0.022993365,0.061081324,0.0023034522,0.20101349],"study_design_scores_gemma":[0.0000062583968,0.00003353032,0.007353804,0.000026254322,0.000041098036,0.0004122172,0.00021066918,0.9410289,0.0035629293,0.045966424,0.0013306985,0.000027245529],"about_ca_topic_score_codex":0.0015910737,"about_ca_topic_score_gemma":0.0016006656,"teacher_disagreement_score":0.0053458544,"about_ca_system_score_codex":0.0008866789,"about_ca_system_score_gemma":0.0003761114,"threshold_uncertainty_score":0.012509644},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012882666,0.0019068511,0.9811334,0.0005325182,0.0004392046,0.00013906362,0.0003778,0.0010534493,0.0015351472],"genre_scores_gemma":[0.4403882,0.0019339737,0.548446,0.0011630852,0.0006817813,0.0006843776,0.0018195806,0.0010560467,0.003826979],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9809092,0.010253604,0.0010414751,0.0033824132,0.0036561622,0.0007571168],"domain_scores_gemma":[0.9049909,0.06555077,0.004729296,0.01325351,0.010866001,0.00060948177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023784734,0.0013417043,0.0018565977,0.003754522,0.0015835282,0.0023125273,0.0029333518,0.0024521672,0.0023446733],"category_scores_gemma":[0.17725158,0.00077457377,0.0013474592,0.0049891225,0.0018669553,0.003159067,0.0023627214,0.0029226842,0.0018706581],"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.0005325557,0.00016710657,0.04660177,0.0014312642,0.0012559644,0.00064804754,0.0012431524,0.28285578,0.009702965,0.13528284,0.029177671,0.49110088],"study_design_scores_gemma":[0.000077593424,0.00010769657,0.008765177,0.00032054956,0.00017174087,0.0006854083,0.00024875734,0.8285071,0.010199507,0.13011754,0.020642277,0.00015667368],"about_ca_topic_score_codex":0.0073474543,"about_ca_topic_score_gemma":0.005977777,"teacher_disagreement_score":0.023784734,"about_ca_system_score_codex":0.002030045,"about_ca_system_score_gemma":0.002407465,"threshold_uncertainty_score":0.12578726},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010896718,0.00021418699,0.9789742,0.0005406349,0.00008233527,0.00017308691,0.00016566833,0.00036134906,0.008591756],"genre_scores_gemma":[0.21299429,0.00018879345,0.77844054,0.00034978826,0.00020052407,0.0006587758,0.00043256526,0.00051493075,0.006219884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984572,0.0006940004,0.000055821616,0.00029815582,0.0002481092,0.00024671078],"domain_scores_gemma":[0.9936094,0.0049337423,0.0002478144,0.0004274155,0.0005429557,0.000238695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031410616,0.0016054331,0.0022883757,0.0015444035,0.0010451175,0.002486817,0.0034165191,0.0037909243,0.0147172],"category_scores_gemma":[0.013399524,0.0009722039,0.0012918328,0.0018527014,0.0020163956,0.0025432042,0.0026503017,0.0026974075,0.0019016212],"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.00016209939,0.00017433218,0.00031893564,0.0002830365,0.000048184284,0.00012567529,0.00013888875,0.86046433,0.0013859693,0.07436352,0.007418419,0.055116583],"study_design_scores_gemma":[0.000040404197,0.00003244965,0.000048663052,0.00002048405,0.0000103211605,0.000020531716,0.000024072437,0.97040445,0.00024397334,0.02848116,0.000666266,0.000007122099],"about_ca_topic_score_codex":0.0057440423,"about_ca_topic_score_gemma":0.008146522,"teacher_disagreement_score":0.0147172,"about_ca_system_score_codex":0.002514448,"about_ca_system_score_gemma":0.0032145798,"threshold_uncertainty_score":0.049233913},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026376778,0.000084650215,0.9963198,0.00004774434,0.000042469273,0.0000362397,0.00008897057,0.00038192066,0.00036063508],"genre_scores_gemma":[0.042529278,0.00017710496,0.9554043,0.000056460576,0.00009138935,0.00013583733,0.00045689233,0.00016713534,0.0009816282],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976515,0.00045846534,0.0002025415,0.0006553986,0.00087911705,0.00015293097],"domain_scores_gemma":[0.99450135,0.0020538531,0.0005726898,0.00092995167,0.001708199,0.00023382896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022404694,0.0014268353,0.0013600528,0.0041446392,0.0012437648,0.0017957089,0.0014627352,0.0011127122,0.0026554817],"category_scores_gemma":[0.011654466,0.00064519374,0.0018263836,0.0030698238,0.0013509948,0.002893425,0.0019328383,0.0024273482,0.0015124421],"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.0002531202,0.00019195753,0.0059834584,0.00034574774,0.0003460387,0.0002291868,0.00042096843,0.056509495,0.029915338,0.051783282,0.010195022,0.84382635],"study_design_scores_gemma":[0.00004239634,0.000092502734,0.0015284227,0.000048356353,0.00007419072,0.00047821028,0.00014260417,0.9225696,0.014235222,0.05060923,0.0100920545,0.00008708295],"about_ca_topic_score_codex":0.0032193307,"about_ca_topic_score_gemma":0.0032006633,"teacher_disagreement_score":0.0041446392,"about_ca_system_score_codex":0.00064245093,"about_ca_system_score_gemma":0.0019737694,"threshold_uncertainty_score":0.011848867},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031623032,0.00010505125,0.9670497,0.000052479183,0.000013823832,0.00007684746,0.0000432679,0.00047798952,0.0005579089],"genre_scores_gemma":[0.5060196,0.00012923645,0.4918686,0.00006901766,0.000028826456,0.00021395984,0.00029401487,0.00009002648,0.0012867271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837863,0.0004920086,0.000080500155,0.00037817654,0.0005370819,0.0001336387],"domain_scores_gemma":[0.99526924,0.0023151615,0.0005442072,0.00047305474,0.0011671868,0.00023112644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001827897,0.0007029819,0.00095730036,0.0035512098,0.0008366641,0.00096908095,0.0013970588,0.00080016017,0.00084512786],"category_scores_gemma":[0.008462743,0.00034803344,0.0009044592,0.0017626717,0.00085179484,0.0018173817,0.0016654601,0.0008287976,0.00030519877],"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.00030704273,0.0001871157,0.011419107,0.00027482086,0.00025178064,0.0004246858,0.000621854,0.608454,0.024221601,0.040594146,0.0027292958,0.31051463],"study_design_scores_gemma":[0.00000501248,0.000013714817,0.00032826405,0.000003268016,0.000006208848,0.000034265748,0.000013584839,0.99445856,0.0013169592,0.003597217,0.00021490299,0.000007954577],"about_ca_topic_score_codex":0.0050969976,"about_ca_topic_score_gemma":0.0045533744,"teacher_disagreement_score":0.0050969976,"about_ca_system_score_codex":0.0006627897,"about_ca_system_score_gemma":0.0009670311,"threshold_uncertainty_score":0.010134697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5693297,0.0037120932,0.4066103,0.0004937568,0.00073598075,0.00033212279,0.004802253,0.0034065188,0.010577271],"genre_scores_gemma":[0.9372474,0.00077787007,0.04891411,0.00008689954,0.00036818345,0.00014747723,0.0034352888,0.00012588486,0.008896858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960715,0.000059859416,0.000026445805,0.00013386761,0.0000998756,0.00007279074],"domain_scores_gemma":[0.9987778,0.00050493947,0.00014958807,0.00014182637,0.00034900548,0.000076876895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053584564,0.0008639194,0.00057632936,0.0023363272,0.00037412878,0.00077006384,0.0005100279,0.0007045238,0.0027359868],"category_scores_gemma":[0.0022560016,0.0001613386,0.00048829516,0.0014321731,0.00014765392,0.0011592131,0.0005069775,0.0008505775,0.0021022223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011921483,0.00070575083,0.05711965,0.00041356176,0.00037075256,0.00053994573,0.00044857856,0.019884527,0.153256,0.0027153348,0.01813444,0.74521935],"study_design_scores_gemma":[0.000027086055,0.00037427284,0.07292537,0.000048622936,0.00026051968,0.0005641347,0.00027121895,0.8809954,0.032032155,0.0051163766,0.0073245764,0.00006029896],"about_ca_topic_score_codex":0.0014984524,"about_ca_topic_score_gemma":0.0029599357,"teacher_disagreement_score":0.0027359868,"about_ca_system_score_codex":0.00022237438,"about_ca_system_score_gemma":0.00018923341,"threshold_uncertainty_score":0.00915271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8895551,0.00018187113,0.10492511,0.00041271248,0.000022332983,0.000022439322,0.00018508613,0.00009852299,0.0045968024],"genre_scores_gemma":[0.9945779,0.00008546765,0.0042852284,0.000015916869,0.000006206449,0.0000118944745,0.000046726454,0.000011760408,0.0009589155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978405,0.00006152116,0.000008969088,0.00005691639,0.00005191858,0.000036652957],"domain_scores_gemma":[0.99609804,0.0024323899,0.0006461532,0.00024155171,0.0003901908,0.00019161946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008046466,0.0001377711,0.00020647088,0.000961386,0.00045484977,0.0007500476,0.0006027047,0.0004624376,0.0017680186],"category_scores_gemma":[0.008373704,0.0001788125,0.00024995883,0.0005606849,0.00091069576,0.0012447455,0.00056477106,0.00049500837,0.00015109553],"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.000142663,0.00007045782,0.031603713,0.00013113974,0.00005775502,0.0008569117,0.0010343334,0.5922946,0.025097625,0.32371464,0.001572488,0.023423746],"study_design_scores_gemma":[0.0000061217097,0.00002366378,0.00737639,0.000012410485,0.000013471365,0.00023022207,0.00024123707,0.94478285,0.0031105278,0.043291923,0.00088972726,0.000021370046],"about_ca_topic_score_codex":0.002872106,"about_ca_topic_score_gemma":0.0024881149,"teacher_disagreement_score":0.002872106,"about_ca_system_score_codex":0.0007857049,"about_ca_system_score_gemma":0.00031915278,"threshold_uncertainty_score":0.0059146285},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10009845,0.0007507785,0.870923,0.0004652385,0.00008822215,0.00004108694,0.00018523424,0.00019155013,0.027256552],"genre_scores_gemma":[0.98136985,0.00071231,0.013297262,0.0000667224,0.00011950325,0.00008119996,0.00011586033,0.000031391533,0.004206067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994562,0.00015169932,0.000019964848,0.0001350944,0.00017433632,0.000062673455],"domain_scores_gemma":[0.99866784,0.00073333783,0.00027169185,0.00008717581,0.00015837718,0.00008164938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052259554,0.00044827993,0.00027212917,0.00091033184,0.00032834723,0.001232206,0.00031299394,0.00028263408,0.0026385214],"category_scores_gemma":[0.0030245334,0.00012519883,0.0003121459,0.00049388665,0.0010970028,0.0012882174,0.000605019,0.00075360376,0.00015709586],"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.000048509384,0.00002495654,0.0009754118,0.00007436278,0.000041460986,0.00018197934,0.0002012922,0.17689832,0.0069491253,0.7865146,0.0009864776,0.027103577],"study_design_scores_gemma":[0.000012909268,0.000035930796,0.0007934163,0.000012747462,0.000009346891,0.00008604689,0.0000580103,0.54970694,0.0010804299,0.44494084,0.003247616,0.000015794609],"about_ca_topic_score_codex":0.0019330885,"about_ca_topic_score_gemma":0.00078785967,"teacher_disagreement_score":0.0026385214,"about_ca_system_score_codex":0.0005508079,"about_ca_system_score_gemma":0.00036570558,"threshold_uncertainty_score":0.008826733},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98157847,0.00016185404,0.015118905,0.00012804258,0.0000060417506,0.000034817378,0.00024474706,0.00006856678,0.0026585823],"genre_scores_gemma":[0.99807125,0.00007510027,0.0013185223,0.000005167503,0.0000017744499,0.000011076138,0.00016145367,0.0000038942426,0.00035176557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997416,0.00009321139,0.000010347925,0.000043607295,0.00005778901,0.000053339274],"domain_scores_gemma":[0.99926823,0.00033290422,0.00014466002,0.0000710582,0.00012164912,0.00006158544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039647843,0.00037638127,0.00019948056,0.001762223,0.0005305674,0.00044016403,0.0003513455,0.0003652721,0.0007128012],"category_scores_gemma":[0.0015802146,0.00012980239,0.000332072,0.0010854836,0.0004699328,0.00071253086,0.0004932193,0.00022748648,0.000055437944],"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.0001612734,0.000045838293,0.032830298,0.000056730434,0.00011672968,0.000949782,0.00031555482,0.9339579,0.0052149463,0.014377495,0.000959061,0.011014466],"study_design_scores_gemma":[0.0000046287846,0.00004747385,0.013487039,0.0000057316324,0.000024835135,0.00025182718,0.0003169628,0.9795146,0.0013438398,0.004145044,0.0008463561,0.000011680127],"about_ca_topic_score_codex":0.0067388304,"about_ca_topic_score_gemma":0.0038250666,"teacher_disagreement_score":0.0067388304,"about_ca_system_score_codex":0.0008574512,"about_ca_system_score_gemma":0.00021386227,"threshold_uncertainty_score":0.013399243},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63498336,0.007928087,0.3236807,0.0014733484,0.00062726834,0.0003591673,0.001900901,0.0006934172,0.028353902],"genre_scores_gemma":[0.9668555,0.0020327556,0.026876185,0.000068119734,0.00028194432,0.000081377715,0.00080353394,0.000063791915,0.002936829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975655,0.0006106048,0.00022419977,0.00034249245,0.0010837773,0.00017343841],"domain_scores_gemma":[0.981724,0.010588062,0.003047103,0.0011989902,0.0029661981,0.00047568505],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.003618665,0.0006540103,0.00089340605,0.0147277685,0.00083181186,0.0027933193,0.00078456796,0.0009749319,0.0037405111],"category_scores_gemma":[0.02788396,0.00019152442,0.0006291476,0.0129202595,0.0008792338,0.0048838435,0.0012263645,0.00075697585,0.00080040004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004149318,0.0005255233,0.15359545,0.0019952115,0.001172728,0.00083483785,0.0012179334,0.15328747,0.030799331,0.16283765,0.007207866,0.48611107],"study_design_scores_gemma":[0.000059906055,0.00045632294,0.14339541,0.0002505683,0.00057293166,0.00082807534,0.000747196,0.5498957,0.018218307,0.26929682,0.016020473,0.00025840855],"about_ca_topic_score_codex":0.0015671052,"about_ca_topic_score_gemma":0.0025020312,"teacher_disagreement_score":0.99638134,"about_ca_system_score_codex":0.0010168261,"about_ca_system_score_gemma":0.001072293,"threshold_uncertainty_score":0.01913762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40030682,0.0019853539,0.5698633,0.003528939,0.00043683598,0.00019124003,0.0016572778,0.00056481163,0.021465402],"genre_scores_gemma":[0.9620834,0.0011359837,0.010223441,0.00020244738,0.00018905062,0.00013902332,0.00035127363,0.0000520692,0.025623387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990264,0.0002792214,0.00003985237,0.0003172217,0.000114263545,0.00022301292],"domain_scores_gemma":[0.99587077,0.002223051,0.00089316355,0.00023782511,0.0004152291,0.00036001767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018333086,0.0011467055,0.0022098066,0.0015414695,0.0007687811,0.0019684078,0.003862549,0.0030306748,0.0058207763],"category_scores_gemma":[0.0055064796,0.0010560724,0.0012352072,0.0012889568,0.0019989964,0.003330193,0.0011714139,0.0020069918,0.00082164933],"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.0003687342,0.00015060589,0.0024256774,0.00022007084,0.00015865141,0.0009216176,0.00020705647,0.84711397,0.00274197,0.13657029,0.0021293766,0.0069919964],"study_design_scores_gemma":[0.000048054106,0.000081798,0.0006806029,0.000014638591,0.000073174044,0.00015146362,0.00004807895,0.9770885,0.00017042672,0.021033954,0.00057789654,0.000031347987],"about_ca_topic_score_codex":0.007811242,"about_ca_topic_score_gemma":0.0058613643,"teacher_disagreement_score":0.007811242,"about_ca_system_score_codex":0.0013957508,"about_ca_system_score_gemma":0.0011318054,"threshold_uncertainty_score":0.01947248},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99491537,0.0000772599,0.0022402601,0.00046578402,0.000007622414,0.00007718722,0.0002654909,0.000024791674,0.0019263396],"genre_scores_gemma":[0.99030906,0.0001856615,0.0072455276,0.00009755554,0.00002524966,0.00012915225,0.00040708468,0.000036543963,0.0015640991],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9970682,0.0014800363,0.0002018005,0.0004018073,0.00054295483,0.0003051607],"domain_scores_gemma":[0.96605366,0.025547387,0.0035917468,0.0016058567,0.0020494687,0.0011520078],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004231453,0.00038424705,0.00045126225,0.003794928,0.002615267,0.0021988216,0.0009094948,0.0017134113,0.0015625487],"category_scores_gemma":[0.01971113,0.00033158576,0.0004886667,0.004522181,0.001045995,0.003731254,0.0019330345,0.0010229674,0.0005525774],"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.0008167667,0.0018617547,0.61788327,0.0007391648,0.00025352588,0.013043894,0.22274835,0.0032520527,0.02422444,0.008782652,0.0039191456,0.1024749],"study_design_scores_gemma":[0.00014442478,0.00092075975,0.53968847,0.00033461393,0.00029439287,0.007772573,0.31734806,0.063271314,0.017774958,0.011104495,0.04103617,0.00030968903],"about_ca_topic_score_codex":0.00703724,"about_ca_topic_score_gemma":0.012797692,"teacher_disagreement_score":0.9978012,"about_ca_system_score_codex":0.0010949492,"about_ca_system_score_gemma":0.00069878256,"threshold_uncertainty_score":0.022378325},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023018045,0.0021489596,0.9369002,0.0058311922,0.0015688335,0.0004994299,0.0013450526,0.0014904627,0.027197804],"genre_scores_gemma":[0.668853,0.002059203,0.30031073,0.0055220244,0.001605625,0.0010147247,0.0025234132,0.00077127526,0.017339973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98083055,0.010244888,0.0008439339,0.0038399724,0.0034995207,0.0007411329],"domain_scores_gemma":[0.9323361,0.034566008,0.0027329018,0.022961244,0.0063901963,0.0010135821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014468862,0.0007495718,0.001543289,0.0010458889,0.001180332,0.0026143629,0.002246294,0.0021753812,0.01603454],"category_scores_gemma":[0.13576657,0.0007968632,0.00075250224,0.0020520566,0.002247153,0.0055917436,0.0018356293,0.002828998,0.0052362005],"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.000963344,0.00016984122,0.0112852035,0.0005543839,0.00025474373,0.000302289,0.00043394865,0.058974255,0.0021104228,0.48087806,0.07616964,0.36790386],"study_design_scores_gemma":[0.00035444667,0.00034049744,0.0035612148,0.0003468448,0.00012336776,0.0010294751,0.00019040541,0.37417078,0.0037863844,0.5400504,0.07592774,0.00011841091],"about_ca_topic_score_codex":0.0034545576,"about_ca_topic_score_gemma":0.004120748,"teacher_disagreement_score":0.01603454,"about_ca_system_score_codex":0.0015624401,"about_ca_system_score_gemma":0.001933717,"threshold_uncertainty_score":0.07651961},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19598553,0.00079991564,0.79827005,0.0014160458,0.00007917254,0.00021582186,0.0006726509,0.00028476943,0.002275975],"genre_scores_gemma":[0.9483206,0.001101765,0.046144668,0.00012344366,0.00014347397,0.00042781874,0.00055402395,0.0000497529,0.003134465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975177,0.0016058917,0.00008710233,0.0003902535,0.00024009023,0.00015907465],"domain_scores_gemma":[0.9747482,0.020167805,0.0026605062,0.0011921372,0.0007183767,0.0005129822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00889286,0.0007939273,0.0007786649,0.0033708694,0.00063100137,0.0011365279,0.0012153416,0.0012458664,0.0025825053],"category_scores_gemma":[0.030723037,0.0003531072,0.0014136342,0.001437524,0.002092927,0.0028157278,0.0015654095,0.0015893369,0.00029634053],"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.00017945761,0.00013005087,0.041026745,0.00021239334,0.0003419444,0.0003769975,0.0011866448,0.43404755,0.0015696355,0.47411373,0.0016868759,0.04512797],"study_design_scores_gemma":[0.000018572231,0.00006884403,0.006276779,0.00003129762,0.000051749634,0.00012529641,0.00013757392,0.850018,0.00025075645,0.14168267,0.0013035988,0.000034783076],"about_ca_topic_score_codex":0.005515624,"about_ca_topic_score_gemma":0.0018409324,"teacher_disagreement_score":0.00889286,"about_ca_system_score_codex":0.00143585,"about_ca_system_score_gemma":0.00068528,"threshold_uncertainty_score":0.04703051},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96141607,0.0002997003,0.02229044,0.00061768584,0.000085219865,0.00017052745,0.0013390095,0.0003639449,0.013417367],"genre_scores_gemma":[0.9831163,0.00022656622,0.009583954,0.000054555872,0.000030088184,0.00012022185,0.00057969074,0.000076306234,0.0062121875],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988642,0.00043111786,0.00007542568,0.00018764958,0.00035541403,0.00008629752],"domain_scores_gemma":[0.9883283,0.007609098,0.0013959643,0.0009216427,0.0014110294,0.00033407073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016464932,0.0003196921,0.0003182734,0.0015848072,0.0009814738,0.0018073622,0.00047019136,0.0005823078,0.004320721],"category_scores_gemma":[0.0134705575,0.00024901613,0.00029519794,0.0019714583,0.000746008,0.0027182344,0.0011233835,0.00061464706,0.0010348073],"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.0013587599,0.00044516323,0.5437529,0.001584022,0.00027824574,0.0011993861,0.05941403,0.00993337,0.046231,0.02646933,0.010133473,0.2992003],"study_design_scores_gemma":[0.00008337671,0.0008396988,0.5939291,0.00051206397,0.00033341363,0.0011711787,0.08028741,0.13545467,0.048622634,0.01788874,0.120556146,0.00032149753],"about_ca_topic_score_codex":0.0059624785,"about_ca_topic_score_gemma":0.006279643,"teacher_disagreement_score":0.0059624785,"about_ca_system_score_codex":0.0006747835,"about_ca_system_score_gemma":0.00064960786,"threshold_uncertainty_score":0.014454246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15615581,0.012586312,0.79664445,0.0034472717,0.00023718081,0.000094650684,0.0007393401,0.00056126,0.029533762],"genre_scores_gemma":[0.96291184,0.0066089476,0.02588331,0.00024479823,0.0003441259,0.0001274318,0.0003130835,0.0000773722,0.00348911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989079,0.00042280988,0.000052642754,0.0003083356,0.00021087528,0.00009740499],"domain_scores_gemma":[0.9929899,0.004486773,0.0012198249,0.0006655374,0.0003901257,0.00024772345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014231008,0.00072697713,0.0005783359,0.0024148033,0.0006951231,0.0022733686,0.0009549209,0.0011982472,0.0028599915],"category_scores_gemma":[0.008944922,0.00047896837,0.0007100983,0.0014145392,0.0031550769,0.0038489888,0.0015169609,0.0011297502,0.0002997092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004668759,0.000012909022,0.0021033545,0.00025360132,0.00012733837,0.00020043357,0.0002453548,0.2783953,0.0022425458,0.69825536,0.0012165175,0.016900662],"study_design_scores_gemma":[0.00001095485,0.000025113355,0.0018101871,0.00006276367,0.00003171206,0.00018296868,0.00010482706,0.18435389,0.00075752754,0.80582935,0.0068070386,0.000023628514],"about_ca_topic_score_codex":0.0021590106,"about_ca_topic_score_gemma":0.00081248616,"teacher_disagreement_score":0.0028599915,"about_ca_system_score_codex":0.0015222316,"about_ca_system_score_gemma":0.00037584486,"threshold_uncertainty_score":0.011044562},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98169243,0.000367145,0.0055598887,0.00057491066,0.00003671613,0.00018298565,0.00019460358,0.00002810193,0.011363171],"genre_scores_gemma":[0.99828416,0.0001319216,0.000693597,0.000024195178,0.000016818609,0.000052542193,0.00008446058,0.0000030577098,0.0007093037],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9960393,0.0013944717,0.0003559922,0.0003652528,0.0014076434,0.00043738997],"domain_scores_gemma":[0.9788492,0.0111086285,0.0029251794,0.0004010864,0.006168424,0.00054751633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005409111,0.00022086332,0.00029796443,0.0022408713,0.00088334543,0.0017283693,0.0003328663,0.0003616947,0.003123212],"category_scores_gemma":[0.027349066,0.00012581721,0.00045855716,0.0020196452,0.0005027053,0.0021758822,0.000766605,0.0004195907,0.00026478915],"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.00037966762,0.00021924234,0.7913935,0.00078698935,0.00018811345,0.0004668983,0.020224642,0.0024915803,0.0030799701,0.0046002236,0.0028070405,0.17336217],"study_design_scores_gemma":[0.000013743817,0.0002615512,0.93343246,0.00016183915,0.0002807949,0.0002538852,0.039406642,0.014517134,0.0030726749,0.0022140671,0.006325428,0.000059787428],"about_ca_topic_score_codex":0.006580261,"about_ca_topic_score_gemma":0.008117138,"teacher_disagreement_score":0.006580261,"about_ca_system_score_codex":0.0020444589,"about_ca_system_score_gemma":0.0015544536,"threshold_uncertainty_score":0.028606415},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9877815,0.00020031235,0.0038312406,0.00068324036,0.0000070473843,0.000015275768,0.0000707375,0.000022491318,0.0073881885],"genre_scores_gemma":[0.9994172,0.000060354778,0.00021478528,0.00001686021,0.000008026678,0.0000041125327,0.00001442756,0.0000022184645,0.00026211297],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987098,0.000490877,0.00006646777,0.00020833443,0.00016256404,0.00036206807],"domain_scores_gemma":[0.9726616,0.019411555,0.0047570528,0.0011821315,0.00072911876,0.001258511],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0030943851,0.00022710442,0.0006002935,0.0022185831,0.0013936795,0.004427621,0.00066606945,0.0012445018,0.0064419894],"category_scores_gemma":[0.03614406,0.00033766334,0.0005332804,0.0017063235,0.0026793987,0.003911404,0.002629612,0.0009930033,0.00038554042],"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.00083354005,0.0005527612,0.6442666,0.00038646735,0.00035510908,0.0014869927,0.01290465,0.05447637,0.008293945,0.20830391,0.0021257368,0.06601392],"study_design_scores_gemma":[0.00025123978,0.00029711562,0.5109641,0.0001496417,0.00033203163,0.00064729044,0.010341536,0.17428684,0.0023596257,0.29496515,0.005251009,0.00015445029],"about_ca_topic_score_codex":0.011462166,"about_ca_topic_score_gemma":0.00847157,"teacher_disagreement_score":0.9977814,"about_ca_system_score_codex":0.0017108319,"about_ca_system_score_gemma":0.0009311607,"threshold_uncertainty_score":0.02279085},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012429807,0.002438402,0.42225254,0.0022755752,0.0015356018,0.0007352217,0.049368765,0.23889418,0.27006996],"genre_scores_gemma":[0.16512634,0.0033650326,0.4214543,0.0024343145,0.0006352179,0.0028393331,0.13661136,0.041226197,0.2263079],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988902,0.00024712135,0.000059433514,0.0002633588,0.00040783305,0.000132027],"domain_scores_gemma":[0.9984291,0.0003625381,0.00008300048,0.000507032,0.00047687965,0.00014138878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009702025,0.0011682676,0.0007020831,0.0023970706,0.00076285744,0.003418275,0.0019125921,0.0011390825,0.12124322],"category_scores_gemma":[0.004777956,0.00065479614,0.0009539138,0.0020242368,0.0004241938,0.0021149777,0.0028254583,0.0012036299,0.06621577],"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.000436116,0.00009655612,0.002297689,0.0005730609,0.00009119355,0.00023201553,0.00062130386,0.0052442243,0.010147978,0.046274055,0.63849545,0.2954904],"study_design_scores_gemma":[0.00007092298,0.000050908293,0.0013944159,0.00013525301,0.000027764518,0.00025325958,0.00016006261,0.015923338,0.0038512219,0.022726651,0.9553567,0.000049520342],"about_ca_topic_score_codex":0.0033910337,"about_ca_topic_score_gemma":0.003349594,"teacher_disagreement_score":0.87875676,"about_ca_system_score_codex":0.00076936226,"about_ca_system_score_gemma":0.00095467764,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5981825,0.0006731677,0.3967004,0.0007188365,0.000040686424,0.00006535154,0.00018295251,0.00018056396,0.003255515],"genre_scores_gemma":[0.98853755,0.0003360253,0.009345588,0.00006225756,0.000023339886,0.00002647496,0.00008732901,0.0000190548,0.0015623245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945086,0.00023202514,0.000027757713,0.00012334732,0.00009573119,0.00007035851],"domain_scores_gemma":[0.9896403,0.007659002,0.0011396995,0.0005302636,0.0007006161,0.0003299886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001778704,0.00044030082,0.00087211485,0.0020307251,0.0006731261,0.0015987518,0.0014275931,0.0014789694,0.0013525106],"category_scores_gemma":[0.0144841885,0.00063565635,0.00070791016,0.001194139,0.0015634537,0.0029802236,0.0013584994,0.0011258336,0.00018981351],"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.00020490035,0.000114024,0.00920871,0.0001534447,0.00012918419,0.00038019853,0.00045491985,0.8072708,0.006139661,0.16095428,0.0011719397,0.013817788],"study_design_scores_gemma":[0.000008144469,0.000012642668,0.0009796006,0.000008192799,0.000014380895,0.000060451384,0.000029263421,0.97456896,0.0002752755,0.023928724,0.0001040575,0.000010324087],"about_ca_topic_score_codex":0.0026809934,"about_ca_topic_score_gemma":0.0026237099,"teacher_disagreement_score":0.0026809934,"about_ca_system_score_codex":0.0007989237,"about_ca_system_score_gemma":0.00045439217,"threshold_uncertainty_score":0.009406805},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07672999,0.0065651042,0.90156984,0.0017184808,0.0005115788,0.00024876618,0.0011559604,0.00300854,0.008491673],"genre_scores_gemma":[0.6107304,0.0036261575,0.3696372,0.0005475828,0.0015537594,0.0005062362,0.004336093,0.0015168702,0.007545714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9874507,0.006390112,0.00045373043,0.0015047012,0.0035174235,0.0006833216],"domain_scores_gemma":[0.9204952,0.059756402,0.0023693917,0.009201992,0.0072616255,0.0009153896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013028723,0.0019460011,0.0021305305,0.005077136,0.0014527286,0.0028677299,0.0038831665,0.0026084238,0.005065871],"category_scores_gemma":[0.062636256,0.0007837838,0.0019118012,0.008017199,0.0018131369,0.0046924334,0.0023041964,0.0026219497,0.0014921089],"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.0008153956,0.00042464168,0.005267759,0.00040637547,0.00044691542,0.00010606742,0.00018421607,0.69227517,0.003998107,0.0755547,0.017543806,0.20297681],"study_design_scores_gemma":[0.000014477242,0.00014419819,0.0012717384,0.000019074347,0.000041881463,0.000064945205,0.000026745252,0.98042107,0.00082593184,0.016117815,0.0010331398,0.000018855395],"about_ca_topic_score_codex":0.0049126544,"about_ca_topic_score_gemma":0.0033565084,"teacher_disagreement_score":0.013028723,"about_ca_system_score_codex":0.0036873205,"about_ca_system_score_gemma":0.0024915033,"threshold_uncertainty_score":0.06890333},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016226275,0.00046069841,0.9766376,0.0005698969,0.00013201093,0.00031882472,0.0011008395,0.001855535,0.0026984194],"genre_scores_gemma":[0.15876007,0.0004718818,0.8289019,0.00024762392,0.00012327112,0.00094976474,0.004224056,0.00041588515,0.0059056347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891496,0.00031955427,0.00005982059,0.00024895763,0.0003264563,0.00013032492],"domain_scores_gemma":[0.99801743,0.00090259657,0.00014535904,0.00023087383,0.0005385155,0.00016518417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016862176,0.0014813436,0.0016417268,0.0034543197,0.0021545547,0.0013544544,0.0042807767,0.002626159,0.005325924],"category_scores_gemma":[0.006911283,0.000665787,0.001369008,0.0044154553,0.0008639292,0.003229255,0.0022962955,0.0018654686,0.001689865],"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.0004458196,0.00040299573,0.0036582435,0.00047887058,0.00029192734,0.0001555745,0.00030536167,0.48973215,0.0029382536,0.023348894,0.0441625,0.43407944],"study_design_scores_gemma":[0.000035670815,0.000043801854,0.00028052027,0.000015201169,0.000021214062,0.000049100305,0.000101729376,0.9818364,0.0011245541,0.013986615,0.0024932602,0.000011998401],"about_ca_topic_score_codex":0.021615816,"about_ca_topic_score_gemma":0.028731054,"teacher_disagreement_score":0.021615816,"about_ca_system_score_codex":0.0015699489,"about_ca_system_score_gemma":0.0046409075,"threshold_uncertainty_score":0.042979956},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019269412,0.00043819076,0.9761437,0.00032569567,0.00007516877,0.00004477182,0.00007528262,0.00074728444,0.0028805465],"genre_scores_gemma":[0.6854164,0.00047028094,0.30457297,0.00035447854,0.00017781941,0.00028387114,0.000393715,0.00080981234,0.0075206715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991736,0.00032301884,0.000028128363,0.00019215318,0.00018270139,0.00010035089],"domain_scores_gemma":[0.9947068,0.003891085,0.00030479528,0.00051460066,0.00039892102,0.00018393072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023563325,0.0020089967,0.001874107,0.0014541044,0.00077948975,0.0013020793,0.002447373,0.0020861756,0.003298915],"category_scores_gemma":[0.011452202,0.0009057192,0.00095911894,0.00088059367,0.0019132192,0.0026526912,0.002828496,0.0020589707,0.0009546984],"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.000074471296,0.000027047678,0.00019665965,0.00004975413,0.000042373224,0.000027517826,0.000028261426,0.966558,0.0010338237,0.010468414,0.0019393062,0.019554494],"study_design_scores_gemma":[0.0000055784,0.000012781634,0.000023287044,0.0000036160307,0.000004040997,0.000007374697,0.0000037365448,0.9930147,0.00017082729,0.006597118,0.00015348753,0.0000035353626],"about_ca_topic_score_codex":0.0044035255,"about_ca_topic_score_gemma":0.004111913,"teacher_disagreement_score":0.0044035255,"about_ca_system_score_codex":0.0016374876,"about_ca_system_score_gemma":0.0009828967,"threshold_uncertainty_score":0.012461662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1499027,0.0011552157,0.84676623,0.00022032754,0.00005041393,0.00014950479,0.00027591997,0.00027903324,0.0012007956],"genre_scores_gemma":[0.7552974,0.000439858,0.2426068,0.000050662435,0.00010584687,0.00016288878,0.0004683658,0.000041838644,0.0008262375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658763,0.0011269196,0.00024149696,0.00059483794,0.0011807604,0.00026833138],"domain_scores_gemma":[0.9897585,0.0074810376,0.001051136,0.00064455834,0.00073095236,0.00033386188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027280373,0.0006883223,0.0019396915,0.004847838,0.0010922133,0.0023811685,0.0023122071,0.0014474791,0.00061268656],"category_scores_gemma":[0.016503066,0.0007702278,0.0018228317,0.0031457653,0.0015407923,0.003303025,0.0030301246,0.0010338401,0.00016931031],"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.0010034363,0.0004104647,0.028758062,0.0007327269,0.0007209818,0.00067184796,0.0012788846,0.6369489,0.0062958994,0.08122863,0.0034098777,0.2385403],"study_design_scores_gemma":[0.000016848742,0.00005230422,0.0016409263,0.000027901253,0.000045657114,0.00013356224,0.00023239705,0.95609987,0.0008567076,0.04021629,0.0006535295,0.000023981835],"about_ca_topic_score_codex":0.0039011752,"about_ca_topic_score_gemma":0.0037519168,"teacher_disagreement_score":0.004847838,"about_ca_system_score_codex":0.0009934916,"about_ca_system_score_gemma":0.00071881234,"threshold_uncertainty_score":0.014427364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05554685,0.0005663431,0.94049627,0.00038959825,0.000043904623,0.00006522888,0.00032364737,0.0009367655,0.0016312907],"genre_scores_gemma":[0.8355641,0.00053827727,0.15957902,0.00018539633,0.000073023126,0.00012930919,0.0012339962,0.00009282861,0.002604163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921095,0.00022534448,0.00002979241,0.00021393661,0.00019393588,0.00012601537],"domain_scores_gemma":[0.9988324,0.00049641886,0.00022875382,0.00015397576,0.00018417717,0.00010430741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001629685,0.0011470628,0.0008318523,0.0029317203,0.0006734164,0.0009382282,0.0012728209,0.0012433312,0.0015005884],"category_scores_gemma":[0.0042735897,0.0005260246,0.001287742,0.001753308,0.00084739213,0.003672207,0.0021946076,0.0018802215,0.00044789253],"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.0003478854,0.0002501674,0.0073852753,0.00019586862,0.00029431307,0.00024816522,0.00043487776,0.681802,0.0071226005,0.033175625,0.00446112,0.26428214],"study_design_scores_gemma":[0.000002881684,0.000011442567,0.0003000235,0.0000069141192,0.000008041274,0.00001595562,0.000021398966,0.98676157,0.00057962176,0.011945406,0.0003420933,0.0000045668735],"about_ca_topic_score_codex":0.008025805,"about_ca_topic_score_gemma":0.009850284,"teacher_disagreement_score":0.008025805,"about_ca_system_score_codex":0.0016225846,"about_ca_system_score_gemma":0.0007722132,"threshold_uncertainty_score":0.01595813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0342171,0.00052276946,0.9617612,0.00041645244,0.00014939779,0.000053354226,0.00032691887,0.0008131875,0.0017396908],"genre_scores_gemma":[0.7580107,0.00090914476,0.22563933,0.00022728577,0.0003835292,0.00020520383,0.0022227883,0.00032435075,0.012077644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901354,0.00036477766,0.00006500598,0.00022558612,0.0002509848,0.00008016572],"domain_scores_gemma":[0.99355716,0.004242331,0.00048647958,0.0006703227,0.0008093245,0.00023440186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017599755,0.00092063326,0.0014525536,0.001647664,0.00048443835,0.0013300995,0.0016102324,0.0015435632,0.003064349],"category_scores_gemma":[0.012150877,0.00048481996,0.0007205163,0.0014886502,0.0008778446,0.0034854342,0.0017795017,0.0017937442,0.0013613156],"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.00033256187,0.00020089556,0.006452487,0.00030645187,0.0000912705,0.00020105609,0.00014259657,0.5651744,0.005210773,0.05437188,0.013176065,0.35433954],"study_design_scores_gemma":[0.0000034103916,0.000013781574,0.00016050633,0.0000067807764,0.0000032600242,0.000013994184,0.0000067755664,0.9882665,0.0003463553,0.010942733,0.00023086541,0.00000505625],"about_ca_topic_score_codex":0.0028624376,"about_ca_topic_score_gemma":0.003566909,"teacher_disagreement_score":0.003064349,"about_ca_system_score_codex":0.0006801731,"about_ca_system_score_gemma":0.00076280296,"threshold_uncertainty_score":0.010251224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010805207,0.00040578016,0.98697644,0.00011755895,0.000093903676,0.00006818431,0.00028520293,0.0003719057,0.0008759127],"genre_scores_gemma":[0.3499971,0.0013887838,0.6370568,0.00019473904,0.00065019086,0.00033896387,0.0019640673,0.00026964647,0.0081397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987104,0.00040717327,0.00008933804,0.00030044527,0.00042724653,0.0000654382],"domain_scores_gemma":[0.992615,0.0047355387,0.00042907038,0.0009002089,0.0011685431,0.00015170018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031763902,0.0008191015,0.0012168613,0.0028691848,0.0007130964,0.0010380509,0.0029919527,0.0012132949,0.0032258925],"category_scores_gemma":[0.013765276,0.0004801121,0.0010955199,0.0030175592,0.00044242427,0.0032594614,0.0012311426,0.0014054244,0.0014739002],"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.00018941877,0.00052212237,0.007202449,0.00031230977,0.0003951497,0.0001217949,0.0002472134,0.5020243,0.001998433,0.035422426,0.0059287837,0.44563562],"study_design_scores_gemma":[0.0000047939434,0.00001390563,0.0002570765,0.000008109543,0.00001910781,0.000020459027,0.000008612384,0.99043906,0.00019941315,0.008395884,0.0006278704,0.000005713617],"about_ca_topic_score_codex":0.0071396995,"about_ca_topic_score_gemma":0.009185132,"teacher_disagreement_score":0.0071396995,"about_ca_system_score_codex":0.0005290514,"about_ca_system_score_gemma":0.0010049868,"threshold_uncertainty_score":0.016798556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01129661,0.000019910778,0.9880019,0.000051444415,0.000008504182,0.00003620146,0.0000080895725,0.00018692952,0.0003904564],"genre_scores_gemma":[0.27209926,0.00009201689,0.72526807,0.00008110324,0.000053312106,0.00024417546,0.00011720002,0.0001407949,0.0019039433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846256,0.0006930243,0.00007279301,0.00020670654,0.00045322024,0.000111604495],"domain_scores_gemma":[0.99242014,0.005107191,0.0004697363,0.000991397,0.0007357283,0.00027577844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034718486,0.00068396534,0.001081332,0.0009669496,0.000782426,0.001155417,0.001817688,0.0013238203,0.001845446],"category_scores_gemma":[0.013746496,0.0005608564,0.00069748255,0.0007602698,0.0012612729,0.0018241162,0.0017363871,0.0016273306,0.0006576822],"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.00044376528,0.000187588,0.0024991836,0.000107517146,0.00007644471,0.0001432005,0.00028433415,0.7861587,0.016486773,0.07105461,0.0010381044,0.121519804],"study_design_scores_gemma":[0.000013620101,0.000014932329,0.00004674974,0.0000017605904,0.0000026609916,0.000016497903,0.0000043509294,0.9941658,0.0010288495,0.0045143277,0.00018682037,0.0000037043383],"about_ca_topic_score_codex":0.0027196389,"about_ca_topic_score_gemma":0.0024854916,"teacher_disagreement_score":0.0034718486,"about_ca_system_score_codex":0.00071558624,"about_ca_system_score_gemma":0.0011678765,"threshold_uncertainty_score":0.018361151},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045038043,0.00052137405,0.9935306,0.000171443,0.00009405193,0.00004602964,0.000051310715,0.0004491736,0.00063224765],"genre_scores_gemma":[0.12827149,0.0013887438,0.8631757,0.0001770314,0.0003916775,0.00027356812,0.00030162124,0.00070257,0.0053176726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982968,0.0006080781,0.0000931909,0.0003426305,0.0005561062,0.00010325607],"domain_scores_gemma":[0.9906357,0.0065407357,0.00059331715,0.0007267956,0.0011739011,0.0003296596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029704606,0.0012882598,0.0021690766,0.0032801942,0.0014829229,0.0019883579,0.0032839163,0.002604504,0.002753047],"category_scores_gemma":[0.016971096,0.000917853,0.0015184358,0.0050502038,0.0016262664,0.0025230679,0.003001625,0.0032383727,0.0011675463],"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.00022487754,0.00026601745,0.0025228108,0.0006584265,0.0002490915,0.00018665721,0.00064707,0.4566622,0.0068023447,0.07551851,0.013133408,0.4431287],"study_design_scores_gemma":[0.000013314749,0.000026353904,0.00039718288,0.00002204426,0.000024348981,0.00006496586,0.000054939508,0.9502516,0.001325409,0.04566348,0.0021346326,0.000021772712],"about_ca_topic_score_codex":0.004482391,"about_ca_topic_score_gemma":0.0040354817,"teacher_disagreement_score":0.004482391,"about_ca_system_score_codex":0.00105456,"about_ca_system_score_gemma":0.0009886172,"threshold_uncertainty_score":0.01570946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10740707,0.00051022146,0.87136084,0.0014481132,0.00012907815,0.00011076571,0.00014725015,0.00015524146,0.01873138],"genre_scores_gemma":[0.94632256,0.00055959175,0.040134095,0.00020458682,0.000077933124,0.00020419208,0.00006264444,0.000050880728,0.012383577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991856,0.00038113885,0.000027107664,0.00011896258,0.00016811713,0.000119036464],"domain_scores_gemma":[0.9976291,0.0014095689,0.0004185755,0.00020011795,0.00016376123,0.00017888112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017663386,0.00088635704,0.0010796527,0.00073860236,0.00087072037,0.0015272611,0.0017011103,0.0021604656,0.003276039],"category_scores_gemma":[0.005134177,0.00045874715,0.00094295415,0.0005304506,0.0022633667,0.0024957268,0.0019193334,0.0019962054,0.00036783877],"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.00003967566,0.00003999729,0.00034627036,0.000035888814,0.000018848248,0.00013077489,0.000093767885,0.851467,0.0012100347,0.14327858,0.0005275777,0.0028115644],"study_design_scores_gemma":[0.0000070593705,0.000012309095,0.000043897955,0.0000031523293,0.0000045076767,0.000013939989,0.00001214918,0.98308164,0.00012060012,0.016348474,0.0003454696,0.000006837976],"about_ca_topic_score_codex":0.0048195883,"about_ca_topic_score_gemma":0.0025501507,"teacher_disagreement_score":0.0048195883,"about_ca_system_score_codex":0.001337885,"about_ca_system_score_gemma":0.0008919983,"threshold_uncertainty_score":0.010959506},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04937978,0.01169471,0.88782966,0.029028542,0.0005424329,0.00014406745,0.0002860351,0.00018639535,0.02090828],"genre_scores_gemma":[0.72350866,0.019998284,0.24412641,0.001509969,0.0017538586,0.00032743762,0.00035631497,0.0001800166,0.00823903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998454,0.00072716025,0.00006599339,0.00031078924,0.0003312868,0.000110915455],"domain_scores_gemma":[0.9917087,0.005294855,0.0007144088,0.0011549382,0.000737365,0.0003897634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002414949,0.0009200554,0.0010334286,0.0023323426,0.0019008341,0.00636935,0.0019489236,0.002660614,0.0032787637],"category_scores_gemma":[0.016336204,0.00071837025,0.0011660374,0.002579779,0.004997808,0.014454616,0.0037064217,0.0038677906,0.00042629318],"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.00002908053,0.00003504859,0.0033694557,0.0002844417,0.00008839544,0.0005130767,0.0018520212,0.060987845,0.0008983806,0.89227015,0.005099307,0.034572713],"study_design_scores_gemma":[0.000007231368,0.000024611365,0.0010692234,0.00013043782,0.000031333573,0.00026082504,0.0013070094,0.11748508,0.00039072652,0.86108977,0.018172985,0.000030790536],"about_ca_topic_score_codex":0.0063953795,"about_ca_topic_score_gemma":0.0047711064,"teacher_disagreement_score":0.0063953795,"about_ca_system_score_codex":0.0025469565,"about_ca_system_score_gemma":0.001292047,"threshold_uncertainty_score":0.018479526},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6975468,0.011134901,0.27200922,0.00095619913,0.0009177122,0.0006437857,0.0012395596,0.008137872,0.0074140527],"genre_scores_gemma":[0.8402759,0.0008683378,0.15478154,0.00015403579,0.00016809192,0.00020684299,0.0021438813,0.00021609175,0.0011851528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9897904,0.0037875636,0.000876004,0.0015711087,0.0032495828,0.00072531507],"domain_scores_gemma":[0.96196806,0.026249459,0.0018826057,0.002703268,0.0061515826,0.0010450305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0093227625,0.0022806418,0.0027505269,0.0050247815,0.0013722648,0.0020701282,0.0032822653,0.0030570435,0.0012811256],"category_scores_gemma":[0.035164125,0.0004133177,0.00080615625,0.0031768796,0.000931347,0.003422151,0.0018708692,0.0012282683,0.00072841306],"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.0048989225,0.0015128785,0.019562384,0.0006241422,0.000832063,0.00014035347,0.00018000022,0.4784687,0.011158637,0.0035664833,0.0075372527,0.47151813],"study_design_scores_gemma":[0.00007473554,0.00035763407,0.0013572946,0.000009220227,0.00003995303,0.0000843806,0.000026961043,0.9933216,0.0037637637,0.00067541504,0.00026759537,0.000021435095],"about_ca_topic_score_codex":0.0052591506,"about_ca_topic_score_gemma":0.002384541,"teacher_disagreement_score":0.0093227625,"about_ca_system_score_codex":0.0021649327,"about_ca_system_score_gemma":0.0017790613,"threshold_uncertainty_score":0.049304068},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45495328,0.0047242334,0.46676904,0.009077633,0.00010435151,0.00013742175,0.0009829336,0.00013486946,0.06311625],"genre_scores_gemma":[0.9779514,0.0014549234,0.018739477,0.000120763274,0.000084523796,0.00007625958,0.0001971428,0.000012049092,0.0013635732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877733,0.0006289538,0.000048915983,0.0002681557,0.00017469007,0.000101971826],"domain_scores_gemma":[0.99165136,0.006158821,0.0012775984,0.00028373874,0.0002771575,0.0003512771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012783799,0.00038128174,0.0004962142,0.004739245,0.0011584361,0.0031675084,0.0007283453,0.0010508122,0.0039371816],"category_scores_gemma":[0.00920967,0.00029693727,0.0004217956,0.0045655197,0.0035456407,0.007660066,0.0020370095,0.00094872806,0.00019571313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004105644,0.00003389242,0.020964254,0.00018338815,0.00011637334,0.00022054378,0.0022860395,0.032382324,0.0006604326,0.9158307,0.0012970325,0.025984071],"study_design_scores_gemma":[0.000019578585,0.00006245187,0.023327198,0.00014061939,0.00007367398,0.0004441568,0.002367534,0.048832554,0.00036161556,0.91042167,0.013904736,0.000044248824],"about_ca_topic_score_codex":0.002073359,"about_ca_topic_score_gemma":0.0018680193,"teacher_disagreement_score":0.004739245,"about_ca_system_score_codex":0.0013799242,"about_ca_system_score_gemma":0.00045293194,"threshold_uncertainty_score":0.013171196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39060986,0.00038211493,0.57750356,0.0018455231,0.000584814,0.00045880346,0.0051772925,0.01784765,0.00559041],"genre_scores_gemma":[0.67076004,0.00022851325,0.31291184,0.00021416775,0.00026738644,0.0002932266,0.011219577,0.0007019117,0.0034032615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887353,0.0003092461,0.000055022112,0.0002556026,0.00034378658,0.00016280901],"domain_scores_gemma":[0.9975821,0.00073621183,0.00025484158,0.000431157,0.00082176283,0.0001739354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015915622,0.0012911685,0.0008339428,0.002851753,0.0013082804,0.0013481947,0.0011925561,0.0006455462,0.0016375531],"category_scores_gemma":[0.0044354326,0.00044972255,0.0009835337,0.0027009747,0.000519644,0.0033872437,0.001060459,0.0013382579,0.0013694565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002210634,0.0013299511,0.048798673,0.00040736166,0.0005843869,0.0013913969,0.00087513315,0.21299973,0.07413639,0.008382187,0.055849552,0.5930346],"study_design_scores_gemma":[0.000022711327,0.00002947988,0.0030451692,0.0000038895982,0.000017046714,0.000036762376,0.00015420227,0.9852105,0.0054608984,0.004392163,0.0016111786,0.000016063772],"about_ca_topic_score_codex":0.013515259,"about_ca_topic_score_gemma":0.019589681,"teacher_disagreement_score":0.013515259,"about_ca_system_score_codex":0.0010001936,"about_ca_system_score_gemma":0.0010291542,"threshold_uncertainty_score":0.026873171},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065715775,0.0004497604,0.9276616,0.00026233264,0.00007979899,0.00020491467,0.00020995321,0.0020463835,0.003369467],"genre_scores_gemma":[0.4735867,0.00026758626,0.5212078,0.00009889058,0.00014257255,0.00021697342,0.00068641704,0.00018877494,0.003604201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974764,0.0008291824,0.00016250162,0.0005656865,0.00074126845,0.00022490094],"domain_scores_gemma":[0.99465215,0.0022965986,0.0007412447,0.00088921195,0.000982385,0.00043842598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026305465,0.0011560831,0.0015316367,0.0035858455,0.0015867838,0.0018076254,0.0018959345,0.0014372837,0.0023259835],"category_scores_gemma":[0.008362925,0.0005181304,0.0009838518,0.0029378512,0.0011920001,0.004628044,0.0018592621,0.001290643,0.000889523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060080073,0.00065214245,0.015135506,0.00044793237,0.00016412858,0.00036609272,0.001174638,0.16235402,0.014157664,0.04699806,0.010758843,0.7471901],"study_design_scores_gemma":[0.000066013505,0.00030856943,0.0019364331,0.000034896886,0.00006124092,0.0002832327,0.0002551973,0.95973194,0.00701632,0.025355622,0.004893878,0.0000567293],"about_ca_topic_score_codex":0.0031854394,"about_ca_topic_score_gemma":0.0051565133,"teacher_disagreement_score":0.0035858455,"about_ca_system_score_codex":0.0009015928,"about_ca_system_score_gemma":0.0014768786,"threshold_uncertainty_score":0.013911843},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04728206,0.00054408086,0.94433635,0.0008345624,0.000041308456,0.00005310235,0.00038976592,0.00031850624,0.0062002796],"genre_scores_gemma":[0.9105007,0.0012954521,0.07819805,0.00048140035,0.00021384044,0.00028651196,0.0007230708,0.00021336153,0.0080875205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851245,0.00055930193,0.00005518059,0.0004014487,0.00027343573,0.000198108],"domain_scores_gemma":[0.99453944,0.003227077,0.000669242,0.00078167056,0.00047604178,0.00030653895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00269062,0.0005208858,0.001605757,0.0012327642,0.0007985492,0.0014802219,0.0018930781,0.0013221098,0.0043301345],"category_scores_gemma":[0.011827262,0.00069323735,0.0010083085,0.0007807509,0.0025552097,0.003975586,0.002034972,0.0018963334,0.0006736908],"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.00004134822,0.00002415531,0.0013447795,0.000076535376,0.00005724488,0.00008425132,0.00013850481,0.15041102,0.0014060312,0.8372749,0.0015587364,0.007582398],"study_design_scores_gemma":[0.0000101700225,0.000011633421,0.00036996388,0.000011813782,0.000009922128,0.00004292943,0.000014366756,0.6019169,0.00019037533,0.39621463,0.0011944561,0.000012772014],"about_ca_topic_score_codex":0.0056199348,"about_ca_topic_score_gemma":0.004207581,"teacher_disagreement_score":0.0056199348,"about_ca_system_score_codex":0.0012185078,"about_ca_system_score_gemma":0.0012792265,"threshold_uncertainty_score":0.014485717},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013245579,0.007188398,0.7692829,0.0029316118,0.0016139989,0.000089182795,0.0010651205,0.0011118636,0.21539243],"genre_scores_gemma":[0.077706255,0.029336417,0.38417497,0.001940731,0.0035814438,0.000528061,0.0045359028,0.0016302881,0.4965659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996038,0.00008090738,0.000015160421,0.00012010227,0.00015983373,0.000020299272],"domain_scores_gemma":[0.9992112,0.00039419567,0.000033543027,0.00013790795,0.00018933395,0.000033690212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061090314,0.0012176856,0.0006047296,0.0019271574,0.0005774499,0.0022669025,0.0007550195,0.00072402385,0.030847004],"category_scores_gemma":[0.0028467204,0.00035811524,0.00057945127,0.0018838779,0.0008301333,0.0028947322,0.0013004161,0.0018297763,0.013411367],"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.000008273705,0.00002358137,0.00020792108,0.0002495874,0.00003853158,0.0000547369,0.00013077127,0.012758274,0.00079669,0.51918155,0.15549925,0.31105092],"study_design_scores_gemma":[0.0000024171363,0.000006695405,0.00033103186,0.00013995719,0.000016146125,0.00011480352,0.000059817376,0.026210813,0.0007319043,0.62493134,0.34743693,0.000018099865],"about_ca_topic_score_codex":0.0012819738,"about_ca_topic_score_gemma":0.0019049032,"teacher_disagreement_score":0.030847004,"about_ca_system_score_codex":0.0009820992,"about_ca_system_score_gemma":0.00073521823,"threshold_uncertainty_score":0.10319352},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041113058,0.00092661235,0.0007647582,0.9494744,0.043272737,0.000041043146,0.0003576283,0.000197339,0.0045544365],"genre_scores_gemma":[0.0049379105,0.0011800167,0.0006488214,0.9389352,0.03760015,0.00014093713,0.00021499222,0.0001757306,0.016166175],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99438936,0.0018655193,0.00046551734,0.00079242425,0.0018058004,0.0006813898],"domain_scores_gemma":[0.9677729,0.018399697,0.0018113641,0.0010025019,0.0088777,0.0021358477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056481287,0.0016376068,0.0013635183,0.0007628237,0.0050601303,0.004678666,0.00148815,0.024048593,0.024985215],"category_scores_gemma":[0.045266423,0.000863935,0.0011885739,0.0009506811,0.0033254167,0.005325823,0.0029505629,0.02625148,0.015517672],"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.000027547329,0.000010805708,0.00007972004,0.000022914399,0.0000031048107,0.000032740794,0.00005177869,0.00003073549,0.00004957886,0.0008805219,0.9972518,0.0015586041],"study_design_scores_gemma":[0.000099007295,0.00006020171,0.00086647115,0.00028417932,0.000020245167,0.00013352309,0.0010536794,0.000603253,0.00042099753,0.0045711123,0.9918092,0.000078153935],"about_ca_topic_score_codex":0.005198509,"about_ca_topic_score_gemma":0.008178099,"teacher_disagreement_score":0.024985215,"about_ca_system_score_codex":0.0038496724,"about_ca_system_score_gemma":0.0040040324,"threshold_uncertainty_score":0.08358389},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052913353,0.005622333,0.94419926,0.013749675,0.0006240192,0.00044844448,0.00034657467,0.00040836594,0.029310059],"genre_scores_gemma":[0.13305388,0.0047427514,0.85349345,0.0028706386,0.0004736951,0.0014578521,0.00026365393,0.00054729206,0.003096856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.89731044,0.08201764,0.0035321512,0.004552958,0.011803147,0.00078364986],"domain_scores_gemma":[0.7994167,0.16975251,0.0043629687,0.015093409,0.009853183,0.0015212122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.10257311,0.0017594101,0.0022099665,0.01741291,0.00423252,0.016467905,0.003030888,0.0036718743,0.0058245664],"category_scores_gemma":[0.10268705,0.0011748244,0.0018381744,0.013883382,0.020334845,0.018812697,0.013252315,0.0062211445,0.0010857919],"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.00006964209,0.000080467515,0.0014845364,0.0013071155,0.00017872619,0.000324187,0.022048363,0.0016338563,0.0010648991,0.895604,0.0048677605,0.07133643],"study_design_scores_gemma":[0.000023674189,0.000060929866,0.00092649704,0.0014662774,0.00005453703,0.0002892174,0.0057791513,0.007706964,0.0009356677,0.8961291,0.08652844,0.000099675184],"about_ca_topic_score_codex":0.0018584613,"about_ca_topic_score_gemma":0.0021352984,"teacher_disagreement_score":0.10257311,"about_ca_system_score_codex":0.00521665,"about_ca_system_score_gemma":0.005969945,"threshold_uncertainty_score":0.542465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65033823,0.0011468197,0.33777377,0.0005483684,0.000051538787,0.000140004,0.0017914864,0.0006994251,0.0075102514],"genre_scores_gemma":[0.95481193,0.0001909546,0.04231488,0.00001786386,0.000043985197,0.000058810445,0.0010568203,0.000068783265,0.0014359924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992944,0.00026307013,0.00002740106,0.0002052694,0.00014245402,0.00006731625],"domain_scores_gemma":[0.9939989,0.0037489461,0.0006389953,0.00053303386,0.00084306934,0.00023701049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008131399,0.00035756224,0.00039427442,0.00518797,0.0011655809,0.0016896084,0.0007277989,0.0005862994,0.0017812415],"category_scores_gemma":[0.009762611,0.00018310973,0.00043696354,0.0034591453,0.0008009956,0.0016795675,0.00090807816,0.000684623,0.00042919026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001064503,0.00051612017,0.11974588,0.0010375822,0.00069105887,0.000520485,0.007518992,0.16684914,0.041411866,0.12067921,0.013369628,0.52659553],"study_design_scores_gemma":[0.000023010174,0.000060778933,0.0598869,0.000078260666,0.00014657162,0.00038771686,0.0022311478,0.8309739,0.009004824,0.08975682,0.0073820995,0.0000678538],"about_ca_topic_score_codex":0.005084642,"about_ca_topic_score_gemma":0.0065088496,"teacher_disagreement_score":0.00518797,"about_ca_system_score_codex":0.0009311044,"about_ca_system_score_gemma":0.0007064568,"threshold_uncertainty_score":0.01011008},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18841635,0.00049912394,0.0065480405,0.0007715595,0.0001039797,0.00012754872,0.7912767,0.0014143457,0.010842479],"genre_scores_gemma":[0.22581115,0.0004378069,0.005743782,0.000090331094,0.000058319467,0.00030991953,0.764112,0.00016146562,0.003275189],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99962497,0.00006405321,0.000037814574,0.00009570395,0.00012339505,0.0000539888],"domain_scores_gemma":[0.9979225,0.0003977424,0.00036217674,0.000518429,0.00064893975,0.00015029426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041177685,0.00045554727,0.00039161387,0.0024547544,0.00033202293,0.00065282336,0.0008984593,0.0005102837,0.0040088366],"category_scores_gemma":[0.0028820292,0.00020426196,0.00036786965,0.005149092,0.00031002826,0.00086754275,0.0008822633,0.00075184356,0.0017247013],"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.00042274862,0.0005115532,0.2754676,0.0021831887,0.00034439928,0.0011839307,0.0017072421,0.07991765,0.0057750028,0.0135271875,0.5071603,0.11179921],"study_design_scores_gemma":[0.000113277216,0.000076212855,0.52246433,0.0003305034,0.00008805824,0.00040245877,0.0018958817,0.055781215,0.0042230384,0.0055700107,0.40890706,0.00014800492],"about_ca_topic_score_codex":0.039899457,"about_ca_topic_score_gemma":0.054017268,"teacher_disagreement_score":0.039899457,"about_ca_system_score_codex":0.0010044029,"about_ca_system_score_gemma":0.0011966781,"threshold_uncertainty_score":0.07933444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06286686,0.00045264827,0.93346846,0.0009722307,0.000024928202,0.000085556334,0.00030530547,0.00061080634,0.0012130495],"genre_scores_gemma":[0.87771875,0.00055382756,0.11824041,0.00023024064,0.00018017723,0.00017437748,0.0008427605,0.00013131808,0.0019282134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973519,0.0010784267,0.00013812131,0.00074855896,0.00046974927,0.00021326993],"domain_scores_gemma":[0.9635007,0.032051474,0.0017024758,0.0016108191,0.00068075623,0.00045385998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044934414,0.0018822002,0.0018931439,0.0022929474,0.0013016497,0.003225112,0.004295919,0.0034403035,0.0020148542],"category_scores_gemma":[0.031223886,0.0016094062,0.0015169322,0.002160992,0.0022911145,0.008756788,0.0030525925,0.0040679774,0.00037148938],"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.00021956011,0.00010173645,0.0033047441,0.00008457494,0.00008376653,0.00024039681,0.00033281976,0.9360005,0.0012358446,0.03827988,0.0010225719,0.01909357],"study_design_scores_gemma":[0.0000055199444,0.0000055663368,0.00008011937,0.0000025010609,0.000005396159,0.000014943557,0.000012442351,0.9773817,0.00018213593,0.022217529,0.00008849464,0.0000036908016],"about_ca_topic_score_codex":0.009778352,"about_ca_topic_score_gemma":0.009486345,"teacher_disagreement_score":0.009778352,"about_ca_system_score_codex":0.002432148,"about_ca_system_score_gemma":0.0010894254,"threshold_uncertainty_score":0.023763895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9168116,0.0005025224,0.07091652,0.0013430796,0.00005691167,0.00003201871,0.00087074406,0.00016800588,0.009298549],"genre_scores_gemma":[0.9931694,0.00016344138,0.0041088397,0.000040665,0.000025796313,0.000025520612,0.00023110339,0.000015260257,0.0022200157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970645,0.00011966845,0.000013933463,0.000082254766,0.000041962772,0.00003574274],"domain_scores_gemma":[0.99535096,0.0029731304,0.00076412613,0.00026507524,0.00034194766,0.00030477403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005609056,0.00015063288,0.00032495282,0.0015452522,0.0005534941,0.0010686152,0.0005844547,0.0006601822,0.0053669373],"category_scores_gemma":[0.008714498,0.00022366403,0.00020599444,0.0011721998,0.00078796403,0.0017285609,0.00066696637,0.0005840289,0.00029828332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047572172,0.00012140209,0.045056883,0.00020426408,0.00013150251,0.00068685034,0.00108685,0.26198256,0.004577079,0.6175944,0.007008192,0.061074387],"study_design_scores_gemma":[0.000021111617,0.000045674817,0.012789744,0.000041561623,0.00003675788,0.00022878328,0.00033205855,0.68032974,0.0006738296,0.30133745,0.004134686,0.000028552113],"about_ca_topic_score_codex":0.0035620912,"about_ca_topic_score_gemma":0.004707599,"teacher_disagreement_score":0.0053669373,"about_ca_system_score_codex":0.0006959053,"about_ca_system_score_gemma":0.0003858767,"threshold_uncertainty_score":0.01795423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.735143,0.00139674,0.24336302,0.0014660342,0.000072037,0.000096381074,0.000127672,0.00014860196,0.01818648],"genre_scores_gemma":[0.9929356,0.00031301257,0.0054046493,0.000059670256,0.000046101555,0.000050259852,0.000027838705,0.000010557567,0.0011524642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838614,0.00082402513,0.00005009095,0.00026460586,0.00031603253,0.00015915942],"domain_scores_gemma":[0.9881423,0.008949441,0.0013725648,0.00054770464,0.0005048843,0.00048304538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021386417,0.00032818574,0.0006496004,0.0011258327,0.00081268715,0.0015815956,0.0013225393,0.0014546611,0.0022311118],"category_scores_gemma":[0.015489237,0.00036600587,0.00059705786,0.00092187535,0.0025140126,0.0051095774,0.001115831,0.0009949029,0.00021794387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013149364,0.00008374202,0.010534215,0.0001900769,0.000102142054,0.00060629984,0.0011507459,0.16292559,0.0064951708,0.7935436,0.0018381381,0.022398883],"study_design_scores_gemma":[0.00005318709,0.000091000584,0.0051086224,0.000021261621,0.00004503971,0.00041315667,0.0002809516,0.75421435,0.0008404693,0.23691446,0.001965429,0.000052114505],"about_ca_topic_score_codex":0.001992411,"about_ca_topic_score_gemma":0.0017728801,"teacher_disagreement_score":0.0022311118,"about_ca_system_score_codex":0.0012004909,"about_ca_system_score_gemma":0.0005735874,"threshold_uncertainty_score":0.011310339},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035693853,0.0002156351,0.992029,0.00015034345,0.00005949525,0.00009344639,0.00007336922,0.0011863427,0.0026230377],"genre_scores_gemma":[0.0483061,0.0002153057,0.94713616,0.00014989877,0.000043892524,0.00018189997,0.00034811517,0.00030223862,0.003316403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994672,0.000106579464,0.000024387266,0.00013841676,0.00022789877,0.000035463436],"domain_scores_gemma":[0.9994079,0.00016601011,0.000057939495,0.00011627635,0.00021402325,0.000037925063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005906375,0.0010238835,0.0007927242,0.0017719268,0.00097941,0.0009285083,0.0022765303,0.0013206814,0.0032023357],"category_scores_gemma":[0.0022323541,0.0004186999,0.0007852707,0.0017809186,0.0005931151,0.0012389937,0.0011398954,0.0011240124,0.0017225835],"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.000086998494,0.00007793358,0.0007485841,0.00018412068,0.00010325929,0.00007767218,0.00014419458,0.5295945,0.005772808,0.041296594,0.016628766,0.40528455],"study_design_scores_gemma":[0.000019446756,0.00002089941,0.00009990758,0.000010672806,0.000010449101,0.000059111426,0.000016234062,0.9765385,0.0012636796,0.014260697,0.007689603,0.000010911263],"about_ca_topic_score_codex":0.004674083,"about_ca_topic_score_gemma":0.006048846,"teacher_disagreement_score":0.004674083,"about_ca_system_score_codex":0.0011115972,"about_ca_system_score_gemma":0.0012554259,"threshold_uncertainty_score":0.010712922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058677144,0.00042175944,0.9393861,0.00017864024,0.000018315362,0.00005316381,0.00012134654,0.0003610897,0.0007824235],"genre_scores_gemma":[0.7273049,0.00034605007,0.27043927,0.00012223466,0.00008630634,0.000114268856,0.0005339016,0.00011296452,0.00094012084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723744,0.00085741695,0.00011566345,0.00085536414,0.000730752,0.00020334987],"domain_scores_gemma":[0.98831767,0.007934768,0.0015866207,0.0008547895,0.0009879494,0.00031823418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031243437,0.0007999867,0.0009782107,0.0035522492,0.0012615632,0.0015972826,0.0017525336,0.002171303,0.00077953545],"category_scores_gemma":[0.020707235,0.0005139249,0.0007376517,0.0021994787,0.0012901617,0.003666486,0.0026103463,0.0011771953,0.000279622],"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.00047530085,0.00013164003,0.023805156,0.00040261165,0.00026183802,0.0010484778,0.00092772866,0.6922457,0.014475188,0.039702814,0.0033605057,0.22316302],"study_design_scores_gemma":[0.000009827599,0.000032690095,0.0018801943,0.000029578534,0.000024062203,0.00026434887,0.00016674548,0.95601696,0.004211594,0.03599717,0.0013439731,0.0000228363],"about_ca_topic_score_codex":0.0025413346,"about_ca_topic_score_gemma":0.00305317,"teacher_disagreement_score":0.0035522492,"about_ca_system_score_codex":0.00087138027,"about_ca_system_score_gemma":0.00044959952,"threshold_uncertainty_score":0.016523302},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079758285,0.00007165175,0.99857306,0.00008001903,0.000014699032,0.000010657702,0.000051268376,0.00019407173,0.00020690852],"genre_scores_gemma":[0.2002048,0.0008869761,0.7945168,0.00025931624,0.00063631294,0.00035986822,0.00081464945,0.00034494707,0.0019762951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731773,0.00081121136,0.00017900617,0.0006854081,0.0008692808,0.00013728334],"domain_scores_gemma":[0.99188495,0.004825772,0.0009982747,0.00094810047,0.001121212,0.00022173591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036730517,0.0013192872,0.0013294333,0.006339531,0.0009895891,0.0021004714,0.0026540288,0.0015464305,0.0015191914],"category_scores_gemma":[0.014876592,0.00078872946,0.0016303391,0.0037727065,0.0020928811,0.0037275795,0.0019727477,0.0023632634,0.0006878279],"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.0000421132,0.000072348594,0.004218318,0.00014590863,0.00020214218,0.00040390305,0.00026499043,0.47618362,0.005356812,0.40849614,0.0034817907,0.101131916],"study_design_scores_gemma":[0.000005186438,0.000018931947,0.00049401214,0.000013724508,0.000019554047,0.00011584269,0.000025845335,0.85801107,0.00061293173,0.13699606,0.0036609843,0.000025801031],"about_ca_topic_score_codex":0.005382727,"about_ca_topic_score_gemma":0.0038503197,"teacher_disagreement_score":0.006339531,"about_ca_system_score_codex":0.0015382151,"about_ca_system_score_gemma":0.0016839443,"threshold_uncertainty_score":0.019425154},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24140061,0.0011019582,0.7259015,0.004388137,0.00026390422,0.00039524672,0.0011654609,0.00046859914,0.024914613],"genre_scores_gemma":[0.91801006,0.0011815083,0.04732555,0.00027801108,0.00017217742,0.00039463255,0.0005270714,0.000107935215,0.032003004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989895,0.000296641,0.000051022358,0.0003238059,0.00017524284,0.00016379899],"domain_scores_gemma":[0.99519366,0.0028850907,0.0006961455,0.00022236211,0.0007420373,0.00026063016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035442777,0.0012242147,0.0013817147,0.0020401885,0.001291847,0.0028121676,0.0029694047,0.0030812188,0.008454081],"category_scores_gemma":[0.009979999,0.00064335845,0.0014887488,0.0017528223,0.001611754,0.0066204867,0.0015045832,0.0022178297,0.0016721236],"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.00022072214,0.0002069281,0.0098460475,0.0002069577,0.0001223936,0.0008356677,0.0016081303,0.56176555,0.0030315612,0.38590592,0.0042187553,0.03203132],"study_design_scores_gemma":[0.000017085013,0.000028632783,0.00069969095,0.000011216407,0.000025537396,0.000056247813,0.0000815103,0.9703231,0.00011256221,0.027509708,0.0011148826,0.000019739568],"about_ca_topic_score_codex":0.028636979,"about_ca_topic_score_gemma":0.016179265,"teacher_disagreement_score":0.028636979,"about_ca_system_score_codex":0.0034100085,"about_ca_system_score_gemma":0.0017152025,"threshold_uncertainty_score":0.056940615},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005337678,0.0005046152,0.98700887,0.0002753973,0.00013147527,0.00004920313,0.00022231301,0.0032242548,0.0032461917],"genre_scores_gemma":[0.1571731,0.0011558685,0.8195691,0.00044701414,0.00020851147,0.00034569963,0.0024920087,0.0020414814,0.016567124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961287,0.00009861152,0.00001760092,0.00011575865,0.00012792386,0.00002714702],"domain_scores_gemma":[0.9990901,0.00051320344,0.000051827155,0.00016743131,0.00013299866,0.000044502263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008363661,0.0008302294,0.0010108987,0.00090950774,0.0003886848,0.0012113404,0.0023693172,0.0012206883,0.005409285],"category_scores_gemma":[0.0039925096,0.0005253672,0.0008647429,0.0010288296,0.00063450995,0.00241357,0.001679594,0.002285533,0.001992578],"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.000057880286,0.000079006284,0.0005680944,0.0001456743,0.000083271814,0.00008588246,0.00009490976,0.519094,0.0023957503,0.050992057,0.018983217,0.40742022],"study_design_scores_gemma":[0.000005672311,0.000008763674,0.000040984694,0.000008746724,0.0000050671806,0.000016500135,0.0000039622155,0.9789915,0.0004271033,0.017989667,0.002497579,0.000004399421],"about_ca_topic_score_codex":0.0039395494,"about_ca_topic_score_gemma":0.004997447,"teacher_disagreement_score":0.005409285,"about_ca_system_score_codex":0.0006752988,"about_ca_system_score_gemma":0.0005445191,"threshold_uncertainty_score":0.018095791},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022965401,0.042829975,0.81702083,0.024650712,0.0016119021,0.00017581225,0.002848922,0.0007512394,0.08714512],"genre_scores_gemma":[0.69618034,0.06566516,0.13199194,0.0032514145,0.0038761643,0.0009509101,0.002825596,0.00050103996,0.09475731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908304,0.00039633317,0.000036020014,0.0001934967,0.00021774182,0.00007342408],"domain_scores_gemma":[0.9976483,0.001205262,0.0002952443,0.00029069855,0.00040273872,0.00015769055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014597692,0.0012015348,0.0013979565,0.0016317485,0.0008840477,0.0039405753,0.0016659573,0.0031088192,0.007217526],"category_scores_gemma":[0.0070001516,0.0006045705,0.0007598614,0.0027794614,0.0025085374,0.0058165835,0.0015163255,0.0029141672,0.00212495],"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.000010522395,0.000018346009,0.00034533784,0.0001338662,0.00002808727,0.00007513268,0.00010365314,0.03861848,0.00031181567,0.9387513,0.0106671285,0.010936403],"study_design_scores_gemma":[0.0000061886444,0.000011497958,0.0002367589,0.000044779885,0.000012412343,0.0001061799,0.00004314904,0.08428145,0.000056635323,0.8917129,0.023473503,0.000014612821],"about_ca_topic_score_codex":0.004245359,"about_ca_topic_score_gemma":0.003275368,"teacher_disagreement_score":0.007217526,"about_ca_system_score_codex":0.002408638,"about_ca_system_score_gemma":0.001101313,"threshold_uncertainty_score":0.024145007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99761426,0.00019898496,0.00041513576,0.00014894987,0.0000028654513,0.0000062467534,0.00009853034,0.0000047869858,0.0015102886],"genre_scores_gemma":[0.99963534,0.000067081295,0.00010645527,0.0000039004794,0.0000020186135,0.000003684914,0.00005844036,5.3016095e-7,0.00012250776],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993975,0.00020468359,0.000034408942,0.00012044081,0.00011635235,0.00012656224],"domain_scores_gemma":[0.9977704,0.0007654056,0.0005906017,0.00013173834,0.0004196225,0.00032227038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010075815,0.0001286451,0.0002584454,0.002136283,0.0007076602,0.0009267914,0.00033518168,0.00015732927,0.0008511778],"category_scores_gemma":[0.0032174091,0.00010364685,0.00031403953,0.004786473,0.00081151124,0.0007846244,0.00077610626,0.00020807981,0.00004838789],"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.000020364218,0.000016323283,0.98421,0.000023708013,0.00006262225,0.00026708777,0.0011881384,0.003309612,0.00010912687,0.003994944,0.000336736,0.006461291],"study_design_scores_gemma":[0.0000042232755,0.000016755743,0.98577744,0.0000204585,0.000046265104,0.00006510403,0.0028011955,0.0087306835,0.00010452584,0.0013479093,0.0010779151,0.0000075251273],"about_ca_topic_score_codex":0.110574655,"about_ca_topic_score_gemma":0.12717344,"teacher_disagreement_score":0.110574655,"about_ca_system_score_codex":0.0022569248,"about_ca_system_score_gemma":0.0022923432,"threshold_uncertainty_score":0.2198621},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7491404,0.0008464736,0.23652929,0.0023832957,0.00008163707,0.00012079556,0.0007167518,0.00017406674,0.010007248],"genre_scores_gemma":[0.9921949,0.00027694996,0.005677111,0.000054221968,0.00003468949,0.000068570786,0.00022553137,0.000016958267,0.0014511846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885035,0.0006892053,0.000028007713,0.00020677321,0.00012159396,0.00010416762],"domain_scores_gemma":[0.9833788,0.013066515,0.0013153835,0.00086048275,0.00096244784,0.0004162843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035116987,0.00047235304,0.00054966594,0.001955252,0.0005414999,0.0013702648,0.0013542352,0.0013058834,0.002627958],"category_scores_gemma":[0.020001357,0.00021422347,0.0007358989,0.001875897,0.0013470806,0.0036323469,0.0010507801,0.0009713443,0.0002559003],"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.00017151024,0.00012556146,0.025810549,0.00008498304,0.00011842556,0.00020171436,0.00021636394,0.82219756,0.00089005457,0.1293611,0.0019446487,0.01887755],"study_design_scores_gemma":[0.000010387182,0.000036629404,0.0034167343,0.0000076512015,0.000020750771,0.000038082413,0.000049637252,0.9749546,0.00009067732,0.02095656,0.00040688898,0.000011451799],"about_ca_topic_score_codex":0.009459553,"about_ca_topic_score_gemma":0.0056230323,"teacher_disagreement_score":0.009459553,"about_ca_system_score_codex":0.0022988738,"about_ca_system_score_gemma":0.00072682067,"threshold_uncertainty_score":0.01880896},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09629438,0.0010189203,0.89942616,0.00058104494,0.00010416424,0.000056348115,0.0003868396,0.0009090718,0.0012230828],"genre_scores_gemma":[0.87848854,0.00086699054,0.117052145,0.00013559777,0.00017717981,0.00010786852,0.0009900773,0.00010187524,0.0020798203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987897,0.000295685,0.000103893544,0.00047597897,0.00022898239,0.00010571627],"domain_scores_gemma":[0.9903094,0.006758567,0.0011500762,0.00075130607,0.0006796187,0.00035099397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030013265,0.000895587,0.0011522691,0.0019081024,0.0006320206,0.0014325168,0.001824685,0.0014840603,0.0014890225],"category_scores_gemma":[0.024915446,0.00091098563,0.0009871672,0.0013160119,0.00094139896,0.0054839593,0.0014707401,0.002283547,0.0004343739],"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.00021989689,0.000086092165,0.010984171,0.00015448412,0.00010748495,0.00017745355,0.0002256016,0.8717017,0.0022595658,0.03966793,0.001663624,0.072751895],"study_design_scores_gemma":[0.000009083417,0.000012007986,0.00024099989,0.000006379315,0.000008673609,0.000025625635,0.000012219181,0.98550373,0.0003836111,0.013466718,0.00032546237,0.000005444998],"about_ca_topic_score_codex":0.006833437,"about_ca_topic_score_gemma":0.0072164983,"teacher_disagreement_score":0.006833437,"about_ca_system_score_codex":0.0012325188,"about_ca_system_score_gemma":0.001048236,"threshold_uncertainty_score":0.015872777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78956425,0.00059717055,0.2002264,0.0013073062,0.000020006742,0.000058629103,0.00022912865,0.00004808237,0.007948899],"genre_scores_gemma":[0.9895483,0.0002486476,0.009412948,0.000031993477,0.0000140545735,0.00002556465,0.00006482069,0.000004670388,0.000649012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995229,0.00022187248,0.000015383474,0.00010122263,0.00009491265,0.000043686072],"domain_scores_gemma":[0.99692446,0.0023031572,0.00034795297,0.000111977904,0.00021613082,0.000096300835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007600877,0.00020475918,0.00024605636,0.0011790472,0.00046679622,0.00090106076,0.00043032772,0.0004049296,0.0015417667],"category_scores_gemma":[0.004856834,0.00016334472,0.00022694274,0.001311453,0.00057934993,0.003746636,0.0005137349,0.00058561447,0.00009579517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023979934,0.00041004803,0.24930073,0.00062590337,0.00039746895,0.0017454001,0.014066849,0.15669669,0.010093575,0.35756403,0.0052980524,0.20356135],"study_design_scores_gemma":[0.000012609791,0.000101416736,0.055462696,0.000052370713,0.00007598479,0.00039566978,0.003652291,0.832942,0.0012221101,0.10231871,0.0037172434,0.000046972076],"about_ca_topic_score_codex":0.0033220837,"about_ca_topic_score_gemma":0.0025580444,"teacher_disagreement_score":0.0033220837,"about_ca_system_score_codex":0.0006194908,"about_ca_system_score_gemma":0.00035938818,"threshold_uncertainty_score":0.006605506},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036755467,0.00023075168,0.9942356,0.00006060449,0.000057963596,0.000041444397,0.00006404474,0.0001334088,0.0015006043],"genre_scores_gemma":[0.24709632,0.0007811865,0.7476319,0.00010710596,0.00033720376,0.00023219435,0.00041088156,0.00022369345,0.00317949],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908495,0.00026266932,0.00004384762,0.00019703084,0.00035530553,0.00005625659],"domain_scores_gemma":[0.9988084,0.00061366096,0.0001229854,0.00010449356,0.0002835528,0.00006698088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067865406,0.00088129536,0.0006012233,0.0040296656,0.000573287,0.0010791087,0.00093821256,0.0005918713,0.0023331926],"category_scores_gemma":[0.0033838348,0.0002968303,0.0008915319,0.0020345042,0.0006432508,0.0016134153,0.0009436556,0.0011990115,0.00053403585],"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.00014227298,0.00016961996,0.0051339213,0.0003270137,0.0003244899,0.0005596101,0.0004732112,0.33474502,0.024250401,0.24005412,0.0065771337,0.3872432],"study_design_scores_gemma":[0.000015340254,0.000067782166,0.0012594167,0.000023497361,0.00004207302,0.00030382554,0.00006469633,0.9324113,0.0020455886,0.056266125,0.007460324,0.000039931303],"about_ca_topic_score_codex":0.00317936,"about_ca_topic_score_gemma":0.0035526305,"teacher_disagreement_score":0.0040296656,"about_ca_system_score_codex":0.0007345302,"about_ca_system_score_gemma":0.0006448157,"threshold_uncertainty_score":0.007805288},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09117636,0.00014491277,0.9074693,0.000079342666,0.000020100419,0.000041758685,0.000056501867,0.00010354247,0.0009082978],"genre_scores_gemma":[0.7960496,0.00021462406,0.20238519,0.000022425507,0.000019237812,0.00009085874,0.00016982258,0.000041049552,0.001007234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995223,0.0001751087,0.000020083518,0.00011609906,0.00011167257,0.000054686672],"domain_scores_gemma":[0.9978142,0.0013866037,0.00027142413,0.00011620568,0.0003469423,0.00006451883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010870338,0.0005507494,0.0004715392,0.0017894102,0.0004962582,0.00087071414,0.0007377853,0.0004938843,0.00085677946],"category_scores_gemma":[0.0063194344,0.00023146826,0.00044047966,0.0015937611,0.00046337594,0.0015947388,0.000639235,0.0005045124,0.0001803364],"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.00008608758,0.000031955613,0.00487711,0.00005485294,0.000042358373,0.00009499519,0.00011816435,0.9332884,0.0032884032,0.016736154,0.00061081484,0.040770754],"study_design_scores_gemma":[0.0000024317735,0.000008566114,0.0002986771,0.0000024695903,0.0000045569363,0.000018007864,0.000016207332,0.9964831,0.00028188227,0.0027187902,0.0001613095,0.000004109263],"about_ca_topic_score_codex":0.009880634,"about_ca_topic_score_gemma":0.009362346,"teacher_disagreement_score":0.009880634,"about_ca_system_score_codex":0.0010117925,"about_ca_system_score_gemma":0.0008107202,"threshold_uncertainty_score":0.019646227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6757719,0.00085139956,0.3165288,0.000716923,0.00005133837,0.000080672835,0.0010089603,0.00027598397,0.004714119],"genre_scores_gemma":[0.9775484,0.00010998975,0.021290105,0.000052606432,0.00004245456,0.00003257054,0.00043245457,0.000032062824,0.00045940257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989021,0.00046730984,0.00006435289,0.00026852547,0.00020884426,0.00008894887],"domain_scores_gemma":[0.9927873,0.0038546242,0.001406321,0.00082439865,0.00061246933,0.0005148301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001407823,0.000661834,0.0005075688,0.0031195118,0.0005994756,0.0014701644,0.00058116583,0.0010804547,0.0010451553],"category_scores_gemma":[0.013053105,0.00023641584,0.00038552465,0.0024344525,0.0012593234,0.004464021,0.001894613,0.0009696157,0.00025765144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001035285,0.0005407943,0.2884225,0.0005969868,0.0006958656,0.00040869424,0.0046094535,0.24544932,0.013833809,0.105968684,0.007930754,0.33050784],"study_design_scores_gemma":[0.00003492417,0.00022049487,0.056998722,0.00008186455,0.00008096205,0.00043781486,0.0013215494,0.78684396,0.002750942,0.14721248,0.0039272634,0.000088955545],"about_ca_topic_score_codex":0.0015373644,"about_ca_topic_score_gemma":0.0024404528,"teacher_disagreement_score":0.0031195118,"about_ca_system_score_codex":0.00056726515,"about_ca_system_score_gemma":0.00024313688,"threshold_uncertainty_score":0.0074453354},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013506622,0.09130835,0.08456781,0.02576574,0.15904102,0.00047728475,0.0024448643,0.0031919826,0.61969626],"genre_scores_gemma":[0.057079386,0.057711296,0.030382253,0.003977909,0.027673664,0.0003379204,0.005139952,0.00070872816,0.8169889],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922395,0.00016835044,0.000056994246,0.000114321025,0.0003445187,0.00009190009],"domain_scores_gemma":[0.99818677,0.00030982195,0.00006751743,0.00023656261,0.00083547016,0.00036392992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013992811,0.0008842945,0.00076539366,0.0010621692,0.001026416,0.0035657417,0.00094337383,0.0013381928,0.0721026],"category_scores_gemma":[0.0020132535,0.00022006372,0.000481406,0.00089834246,0.0005039491,0.0019154743,0.0009934524,0.0019349921,0.03431817],"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.0001467464,0.00013321322,0.0010260214,0.0002949335,0.000045828085,0.00017841953,0.00009687689,0.00087647984,0.002771122,0.0119689815,0.7139237,0.26853764],"study_design_scores_gemma":[0.000007896056,0.000053171938,0.0005354614,0.0001424606,0.000023388482,0.00015962348,0.00007739571,0.0026341432,0.0007095185,0.0033973926,0.9922466,0.000012901585],"about_ca_topic_score_codex":0.0019674234,"about_ca_topic_score_gemma":0.0051080557,"teacher_disagreement_score":0.0721026,"about_ca_system_score_codex":0.0007336026,"about_ca_system_score_gemma":0.0013705296,"threshold_uncertainty_score":0.24120724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21248734,0.002580953,0.64151925,0.012286765,0.00023096286,0.0002597756,0.0027234652,0.0009192852,0.12699233],"genre_scores_gemma":[0.9379916,0.001555955,0.03559771,0.000397206,0.0003059877,0.00023989004,0.00078265194,0.00013452569,0.022994544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978739,0.0009848332,0.00007678916,0.00050319015,0.00039248785,0.00016883992],"domain_scores_gemma":[0.9895744,0.0070171054,0.0012837143,0.001069054,0.0006297709,0.0004259941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030886712,0.00053842604,0.0011134588,0.0025164448,0.0013609702,0.004289898,0.00206624,0.0025092915,0.012632345],"category_scores_gemma":[0.019605024,0.00054601225,0.0009848455,0.0048405444,0.0021563638,0.009986116,0.0020125704,0.0015854344,0.0024186184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049324768,0.00005408062,0.0033944852,0.000108990906,0.000054257296,0.000099831756,0.00045211203,0.019956062,0.00038983676,0.9396519,0.005275248,0.030513892],"study_design_scores_gemma":[0.000016019909,0.000020796015,0.0011006964,0.000021916007,0.00002255245,0.00014465116,0.00016640691,0.11437175,0.00009059302,0.87997335,0.004057868,0.000013477025],"about_ca_topic_score_codex":0.0027561462,"about_ca_topic_score_gemma":0.0027490493,"teacher_disagreement_score":0.012632345,"about_ca_system_score_codex":0.0015688011,"about_ca_system_score_gemma":0.00075027643,"threshold_uncertainty_score":0.042259395},"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":"commentary","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84589225,0.006101777,0.030523725,0.052797895,0.008623443,0.013591488,0.002328867,0.0016321208,0.038508393],"genre_scores_gemma":[0.91239095,0.002262691,0.044524502,0.0131848315,0.0049919714,0.012135072,0.00081911613,0.00016752844,0.009523361],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9403896,0.039617576,0.006072876,0.0024196175,0.009393175,0.0021072826],"domain_scores_gemma":[0.7399302,0.13599353,0.035039846,0.011289335,0.06757439,0.010172623],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.08431782,0.00058365864,0.0011676202,0.002807362,0.0016983318,0.0024341075,0.0012795359,0.0016309657,0.0065284907],"category_scores_gemma":[0.2015053,0.0003328352,0.00044558334,0.0026366287,0.00083221425,0.0028771537,0.001645079,0.0011986169,0.004101267],"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.002814178,0.0014546277,0.4564466,0.004324237,0.0001832335,0.00083960284,0.016300919,0.00044099492,0.0125460215,0.0018385623,0.10077656,0.40203458],"study_design_scores_gemma":[0.0011862589,0.0032915408,0.8115722,0.0009677855,0.00031200124,0.0011379942,0.016527455,0.004392188,0.014154055,0.0028118608,0.14327301,0.00037368448],"about_ca_topic_score_codex":0.0012485231,"about_ca_topic_score_gemma":0.0016231362,"teacher_disagreement_score":0.9156822,"about_ca_system_score_codex":0.0013093881,"about_ca_system_score_gemma":0.005201351,"threshold_uncertainty_score":0.4459206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96477604,0.0034594925,0.017111756,0.0011421951,0.00008864077,0.00017241393,0.00085330004,0.00006115592,0.012334965],"genre_scores_gemma":[0.9939143,0.0010830386,0.0031548382,0.00004990408,0.000066605266,0.00009613907,0.00032569055,0.000009863746,0.0012995211],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9927704,0.0029144112,0.000721551,0.0012240256,0.0019524873,0.00041705905],"domain_scores_gemma":[0.92371655,0.045337223,0.019641645,0.0035254485,0.0061401585,0.0016390191],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.011089393,0.00043259375,0.00057996984,0.017646406,0.0018912687,0.0038492063,0.00078075315,0.00062563847,0.002506544],"category_scores_gemma":[0.04690162,0.00027624614,0.00052773487,0.019740464,0.0011485683,0.0050024623,0.0018404489,0.00043712853,0.0003169659],"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.0002187377,0.0001645102,0.8041481,0.0012983019,0.000998987,0.0009025956,0.017859332,0.0072005377,0.0031535197,0.033823315,0.0033519745,0.12688014],"study_design_scores_gemma":[0.00006134122,0.00024231953,0.8521181,0.00040362077,0.0011501322,0.00088707835,0.01634855,0.066260725,0.0044178893,0.03446227,0.023503993,0.0001439934],"about_ca_topic_score_codex":0.0032985886,"about_ca_topic_score_gemma":0.0043487386,"teacher_disagreement_score":0.98235357,"about_ca_system_score_codex":0.0019903025,"about_ca_system_score_gemma":0.0015664301,"threshold_uncertainty_score":0.058647037},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28754744,0.031149626,0.33998796,0.01557433,0.00043907145,0.00033185992,0.00025251653,0.00018454499,0.32453266],"genre_scores_gemma":[0.9641271,0.008076626,0.02435298,0.0003936041,0.0001376555,0.0001408507,0.000062723535,0.00002285525,0.0026854835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782145,0.0014882153,0.00007874754,0.00023543912,0.00026678492,0.0001093025],"domain_scores_gemma":[0.9873132,0.010232269,0.0009472001,0.00072821736,0.00052167726,0.00025741712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002029136,0.0006275307,0.00047677604,0.0039275964,0.0014897259,0.0054941447,0.0006012947,0.0011787383,0.003643876],"category_scores_gemma":[0.0069560115,0.00035527162,0.00054746465,0.0049484624,0.0057555763,0.012703902,0.0024219516,0.0013647199,0.00036165142],"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.00004662845,0.00012971694,0.00782613,0.000723276,0.0000528554,0.0003281865,0.014957136,0.002510975,0.000720472,0.8856615,0.00085703575,0.08618619],"study_design_scores_gemma":[0.000049767776,0.00015875087,0.021825068,0.0017552985,0.00012531859,0.000977199,0.043124862,0.019192487,0.0033750487,0.8247568,0.08458177,0.00007764611],"about_ca_topic_score_codex":0.0015691633,"about_ca_topic_score_gemma":0.0013815706,"teacher_disagreement_score":0.0054941447,"about_ca_system_score_codex":0.002859661,"about_ca_system_score_gemma":0.0016350953,"threshold_uncertainty_score":0.020748436},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45242238,0.004794797,0.5015545,0.0027687124,0.0002993669,0.00024571177,0.00017236437,0.00429195,0.033450183],"genre_scores_gemma":[0.72696525,0.0008620477,0.26510817,0.00018796683,0.000025585838,0.00013336053,0.0002463016,0.00024963607,0.0062217787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999469,0.00014766444,0.000027383276,0.00007835156,0.00019245817,0.00008513786],"domain_scores_gemma":[0.99926084,0.00019017763,0.00006023259,0.00017278144,0.0002437799,0.00007214516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091684336,0.00046993393,0.00059917365,0.00047032,0.0005766997,0.0010672387,0.0011005664,0.00046936178,0.0020912904],"category_scores_gemma":[0.0015006149,0.00029560123,0.00024244635,0.0007157674,0.00038761727,0.0012945826,0.00050430035,0.00057210965,0.00062151125],"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.0007278764,0.0003113678,0.004506693,0.00035282358,0.00010908388,0.00025770938,0.00032877552,0.5474845,0.029882863,0.030840388,0.01609022,0.36910763],"study_design_scores_gemma":[0.000036456022,0.00015327451,0.0010732167,0.000015665639,0.000014747259,0.00007076957,0.00009332537,0.97339463,0.009278385,0.0074600545,0.00839393,0.000015511252],"about_ca_topic_score_codex":0.0034048106,"about_ca_topic_score_gemma":0.0051644742,"teacher_disagreement_score":0.0034048106,"about_ca_system_score_codex":0.0007353279,"about_ca_system_score_gemma":0.0010051788,"threshold_uncertainty_score":0.0069960356},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071250334,0.00042782855,0.9259231,0.00025940328,0.00003771782,0.000115320356,0.00032259102,0.0005732239,0.0010904738],"genre_scores_gemma":[0.7174347,0.00036664572,0.27794707,0.00010188461,0.00012893333,0.00022069771,0.0010967907,0.00015301781,0.0025502823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885976,0.0003570622,0.000049064016,0.0003624664,0.00026499713,0.00010675398],"domain_scores_gemma":[0.9953434,0.0027874932,0.0005610471,0.00039573407,0.00066880195,0.00024347394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001838038,0.0010510109,0.0010876101,0.0053326883,0.000863521,0.0011689038,0.001687663,0.00157028,0.0013647804],"category_scores_gemma":[0.01100788,0.0005992948,0.0011376337,0.0023642113,0.0007940377,0.0023167073,0.0019107196,0.0012095666,0.00047800032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010259184,0.0004582779,0.022340722,0.00068144186,0.00073789695,0.000602226,0.0006229525,0.40724912,0.034242302,0.04757666,0.008934106,0.4755284],"study_design_scores_gemma":[0.000016673304,0.000032302567,0.0014633228,0.000016776023,0.000031586977,0.0000825277,0.000034227454,0.9753882,0.001311439,0.021067804,0.00054336974,0.000011798576],"about_ca_topic_score_codex":0.004162665,"about_ca_topic_score_gemma":0.0061194855,"teacher_disagreement_score":0.0053326883,"about_ca_system_score_codex":0.00079345645,"about_ca_system_score_gemma":0.000669584,"threshold_uncertainty_score":0.0097206235},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027796822,0.0009883898,0.9671117,0.000260669,0.000086620654,0.00009967229,0.000448894,0.0004981372,0.0027090136],"genre_scores_gemma":[0.3976178,0.0006871534,0.59509796,0.00021550045,0.00044049593,0.00032431274,0.0016029938,0.00051700533,0.003496819],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966323,0.0011051724,0.0002018439,0.0005873967,0.0012983931,0.00017490254],"domain_scores_gemma":[0.988607,0.006559873,0.0009784753,0.0011283295,0.002298335,0.00042792186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004066413,0.00084021495,0.0014013569,0.006849977,0.0013540785,0.002232695,0.0025497053,0.0014992608,0.0022586745],"category_scores_gemma":[0.022619369,0.00052156596,0.0010446461,0.0055778907,0.0015833752,0.003758562,0.002342789,0.0015803598,0.0006247287],"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.00047566873,0.00023353504,0.012158308,0.00075828505,0.0006439055,0.00025976353,0.00087379717,0.13986187,0.02284934,0.20554966,0.02101992,0.595316],"study_design_scores_gemma":[0.000045230085,0.00020149832,0.009277222,0.00012528269,0.00017143019,0.0005496202,0.00015046372,0.7980134,0.0052497345,0.17983821,0.006269224,0.0001087764],"about_ca_topic_score_codex":0.0018538437,"about_ca_topic_score_gemma":0.002659549,"teacher_disagreement_score":0.006849977,"about_ca_system_score_codex":0.0018176707,"about_ca_system_score_gemma":0.0008351034,"threshold_uncertainty_score":0.021505475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8428959,0.00043888096,0.15137948,0.0004343196,0.000014084025,0.00007363936,0.0007691212,0.000083926694,0.0039107352],"genre_scores_gemma":[0.9901072,0.00019504201,0.00863599,0.000015857355,0.0000100105735,0.00002996005,0.0002885711,0.000008355449,0.0007089701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962604,0.00010054925,0.000021868458,0.00012448615,0.00007190812,0.000055165845],"domain_scores_gemma":[0.998681,0.00045526464,0.00040396614,0.00007750101,0.00029691786,0.00008533653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008062691,0.00037818952,0.00029855588,0.0033320312,0.0005331473,0.0009119426,0.0007631708,0.00041622244,0.0009909497],"category_scores_gemma":[0.0026367214,0.00024956162,0.00042571776,0.0028451276,0.00060574885,0.0019017932,0.00067665137,0.00024466586,0.00007255669],"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.00006127072,0.00003878503,0.10193076,0.00015196398,0.00012191264,0.00042305677,0.000559447,0.8164412,0.003122774,0.03684636,0.0011534067,0.039149087],"study_design_scores_gemma":[0.000003738534,0.000016633156,0.028984511,0.000010793621,0.000033123935,0.000053735723,0.0001756107,0.9594305,0.0002976833,0.010178089,0.0007992154,0.000016355072],"about_ca_topic_score_codex":0.040056203,"about_ca_topic_score_gemma":0.033496365,"teacher_disagreement_score":0.040056203,"about_ca_system_score_codex":0.0025061297,"about_ca_system_score_gemma":0.0010716782,"threshold_uncertainty_score":0.07964611},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080303065,0.00032686384,0.9165337,0.00070189475,0.00006805736,0.00006957315,0.00012733281,0.00051944406,0.0013500614],"genre_scores_gemma":[0.7598342,0.00034756714,0.23829874,0.0001737172,0.0001221243,0.00025868363,0.00034359537,0.00025016972,0.00037117093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9879084,0.0100157205,0.00029546727,0.00083803636,0.0007855583,0.00015678986],"domain_scores_gemma":[0.80442053,0.17125855,0.007049584,0.012628056,0.003409863,0.0012334328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026970327,0.0007696625,0.0010136657,0.0033790944,0.00097382953,0.00195314,0.0016701443,0.0012291359,0.0012189716],"category_scores_gemma":[0.17634179,0.00047959178,0.0008946344,0.0022725954,0.0032692805,0.003661297,0.0020298797,0.0023221902,0.00021561653],"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.0002453971,0.00018559591,0.05294205,0.00028451363,0.0006548726,0.00048285027,0.0012384241,0.5900542,0.0033434834,0.25335643,0.003049473,0.094162665],"study_design_scores_gemma":[0.000008159509,0.000028321605,0.0023031947,0.00003692418,0.000022774202,0.00005220694,0.00008876203,0.8693838,0.0006573573,0.12636152,0.0010348135,0.00002213872],"about_ca_topic_score_codex":0.0045505157,"about_ca_topic_score_gemma":0.0031406973,"teacher_disagreement_score":0.026970327,"about_ca_system_score_codex":0.0012606676,"about_ca_system_score_gemma":0.0013672203,"threshold_uncertainty_score":0.14263445},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69963324,0.00038275486,0.2857959,0.0016553991,0.00008147363,0.000039429535,0.0002903269,0.00013405562,0.011987418],"genre_scores_gemma":[0.9889177,0.00013873834,0.009610656,0.0000691734,0.00005205914,0.000021694275,0.00005308561,0.000017389535,0.0011194448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945337,0.00023259576,0.000018114395,0.00008822381,0.000117581665,0.00009009025],"domain_scores_gemma":[0.9971306,0.0014156317,0.0005009721,0.00031407012,0.0003557462,0.00028291944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012147941,0.0002206072,0.00045712065,0.0011315595,0.00064619863,0.0014086089,0.0006290232,0.0006716285,0.0017447694],"category_scores_gemma":[0.004671896,0.00019258085,0.00044730137,0.00052107795,0.0023176377,0.0026888342,0.0007916254,0.0005685564,0.000094834104],"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.000016161153,0.000010040201,0.0007877091,0.0000133074245,0.0000065007043,0.0000652592,0.00007637633,0.023520665,0.0011797143,0.97248656,0.00028883672,0.0015487653],"study_design_scores_gemma":[0.000006510165,0.000012711543,0.0010259579,0.0000058404403,0.000002796062,0.00005902902,0.000052124033,0.25767565,0.0003502911,0.7402882,0.000504449,0.000016499906],"about_ca_topic_score_codex":0.0022611076,"about_ca_topic_score_gemma":0.0014464498,"teacher_disagreement_score":0.0022611076,"about_ca_system_score_codex":0.0011369995,"about_ca_system_score_gemma":0.0004693202,"threshold_uncertainty_score":0.008249581},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37684166,0.0017239223,0.5941872,0.0021497211,0.00014143733,0.000215888,0.007998716,0.0019162814,0.014825227],"genre_scores_gemma":[0.89468485,0.0014197711,0.08986482,0.00030606255,0.000110756686,0.00043519968,0.0092965085,0.0004894066,0.0033926386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990792,0.00033196344,0.000041655476,0.0003059518,0.0001661893,0.0000749574],"domain_scores_gemma":[0.9919058,0.006010087,0.0007223304,0.0007405831,0.00042917577,0.00019192098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002129369,0.00072354736,0.0007221221,0.00524605,0.0008380588,0.002403052,0.0013808386,0.0016937217,0.0068131275],"category_scores_gemma":[0.01985588,0.0007998267,0.0014800408,0.0032106708,0.0013967535,0.0036771933,0.0019619958,0.002643108,0.00096847076],"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.0000978664,0.000032223186,0.005479961,0.00016679929,0.000088936285,0.00018465535,0.0003422388,0.8999067,0.001236856,0.0713368,0.0020821092,0.019044787],"study_design_scores_gemma":[0.000023062734,0.000018781278,0.0023833876,0.000043457527,0.000021400572,0.00010543338,0.00010725868,0.7896763,0.0003877326,0.2040022,0.0032082389,0.00002271679],"about_ca_topic_score_codex":0.0035803057,"about_ca_topic_score_gemma":0.0028604253,"teacher_disagreement_score":0.0068131275,"about_ca_system_score_codex":0.002041754,"about_ca_system_score_gemma":0.00065173296,"threshold_uncertainty_score":0.02279222},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51162964,0.0036985332,0.47609103,0.0007863682,0.00015570648,0.00046950503,0.0018293464,0.0008932615,0.0044466094],"genre_scores_gemma":[0.8884948,0.0003948095,0.10843409,0.00005749993,0.00009978835,0.0001612338,0.001233398,0.000045738227,0.0010786848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981887,0.00063843525,0.00010012985,0.00045359696,0.00047534925,0.00014385187],"domain_scores_gemma":[0.98875207,0.0073809545,0.0013910392,0.00076245127,0.0010696511,0.0006437678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002700692,0.0005192994,0.0006986783,0.0074582463,0.0010266462,0.0016716071,0.0010768304,0.0010371493,0.0012606262],"category_scores_gemma":[0.016873445,0.00036544455,0.0008008555,0.003531833,0.00080000126,0.0031117836,0.001662295,0.0010065194,0.00035468867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019907143,0.0013111973,0.16989857,0.0013457554,0.0014206413,0.0017028117,0.0030268654,0.06761482,0.04795552,0.06238614,0.0158055,0.6255415],"study_design_scores_gemma":[0.000100799916,0.00037982382,0.038038258,0.00016461955,0.00032082084,0.001793304,0.0016273977,0.83049035,0.01298548,0.10485777,0.009170172,0.00007114691],"about_ca_topic_score_codex":0.0018372114,"about_ca_topic_score_gemma":0.0028448785,"teacher_disagreement_score":0.0074582463,"about_ca_system_score_codex":0.00056605635,"about_ca_system_score_gemma":0.00053476804,"threshold_uncertainty_score":0.014282763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10580294,0.0015916822,0.86306345,0.0042215497,0.0001783846,0.00009734008,0.0006084252,0.00042030588,0.02401599],"genre_scores_gemma":[0.9127923,0.0022721281,0.039205566,0.0005133117,0.0005455864,0.0004186686,0.00048132724,0.00025279695,0.043518256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986645,0.00063442497,0.00004229893,0.00024886223,0.00025133035,0.00015864347],"domain_scores_gemma":[0.9926883,0.004481774,0.0010366761,0.0005956225,0.00055960525,0.0006380384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023384744,0.0011395394,0.0021693304,0.0020386183,0.0012164066,0.0035805968,0.0037733964,0.0029979197,0.007100475],"category_scores_gemma":[0.012185956,0.0008246027,0.0014571921,0.0016193197,0.003524577,0.007188565,0.0024190592,0.0027127347,0.0010617063],"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.000025754445,0.000031865824,0.0004200362,0.00006864748,0.000043213167,0.00012981067,0.00021038907,0.06734701,0.00042259225,0.9265764,0.0020006148,0.0027237472],"study_design_scores_gemma":[0.000017457187,0.000013816556,0.00015120456,0.000015860078,0.000016894239,0.00005631075,0.00004728898,0.4544323,0.000070613605,0.5440687,0.0010912949,0.000018203345],"about_ca_topic_score_codex":0.0061218906,"about_ca_topic_score_gemma":0.0044803913,"teacher_disagreement_score":0.007100475,"about_ca_system_score_codex":0.0026647623,"about_ca_system_score_gemma":0.001347336,"threshold_uncertainty_score":0.023753405},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08783554,0.0005407109,0.9044749,0.0005689575,0.000068328176,0.000065223954,0.0002812854,0.000811894,0.0053529977],"genre_scores_gemma":[0.93369883,0.0007405674,0.060635626,0.00012876934,0.000094115814,0.00021436467,0.00032045014,0.0002138597,0.003953374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985024,0.0004820511,0.000066183464,0.00039060388,0.00040642553,0.00015238268],"domain_scores_gemma":[0.98327947,0.012763538,0.0018776472,0.0009977807,0.00066821615,0.00041326758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019188474,0.00063189864,0.0006722884,0.0016959267,0.0008617464,0.001804742,0.0017565364,0.0015541511,0.0026621951],"category_scores_gemma":[0.023265556,0.00080686284,0.0005656551,0.0011135187,0.002044345,0.0038242494,0.0014024716,0.001275172,0.0004508729],"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.00012869756,0.000042465785,0.0031186542,0.00012292054,0.000053717784,0.00021722779,0.0002904435,0.7963612,0.004794871,0.17898268,0.0012099718,0.014677184],"study_design_scores_gemma":[0.000011655896,0.000022912336,0.0006961216,0.000010377989,0.000010935238,0.000058697155,0.000024833398,0.93192744,0.00085403497,0.0654131,0.0009504787,0.000019444817],"about_ca_topic_score_codex":0.0056337076,"about_ca_topic_score_gemma":0.0028819644,"teacher_disagreement_score":0.0056337076,"about_ca_system_score_codex":0.001990955,"about_ca_system_score_gemma":0.00081591855,"threshold_uncertainty_score":0.014445484},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009820102,0.00019495956,0.9825105,0.00046269878,0.000045693196,0.000294152,0.00013150663,0.00008297951,0.006457316],"genre_scores_gemma":[0.45741814,0.00063178135,0.53333926,0.00015397544,0.000054578337,0.0010225668,0.00029308404,0.000044022203,0.0070425584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965035,0.0021303163,0.00014231772,0.00047610863,0.00041264403,0.00033516463],"domain_scores_gemma":[0.9978624,0.0013331915,0.00021694819,0.00006366019,0.00029140775,0.00023239011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004803781,0.0014466412,0.0012700515,0.0018487769,0.0018251141,0.0030894438,0.0033689125,0.0025146035,0.008597394],"category_scores_gemma":[0.0043908833,0.0007945593,0.0014836575,0.00201308,0.0018415002,0.003130382,0.0021927988,0.0018947283,0.00054861436],"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.00006550208,0.00006439665,0.0004935415,0.000114170994,0.00003868867,0.00020547173,0.000235986,0.78533274,0.00045474083,0.20071813,0.0008554548,0.011421184],"study_design_scores_gemma":[0.000026198846,0.000049029,0.00008347259,0.0000152213615,0.00001465179,0.000031031035,0.00011941422,0.93518955,0.0001330246,0.0628988,0.0014150657,0.000024464882],"about_ca_topic_score_codex":0.014705589,"about_ca_topic_score_gemma":0.01682389,"teacher_disagreement_score":0.014705589,"about_ca_system_score_codex":0.0038691831,"about_ca_system_score_gemma":0.0049804947,"threshold_uncertainty_score":0.029240012},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05047738,0.0010429891,0.9430548,0.0003226605,0.00018810695,0.00008210217,0.0007389555,0.0012316565,0.0028613682],"genre_scores_gemma":[0.7742331,0.0006866684,0.21584512,0.00017982615,0.00033668565,0.0001415212,0.0019596333,0.00017493944,0.006442479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993124,0.00015401276,0.00004080356,0.00021668861,0.00019993458,0.00007618755],"domain_scores_gemma":[0.99544936,0.0033807494,0.00017798306,0.00043569793,0.00046350047,0.00009266403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015098822,0.00081893726,0.0018039485,0.0016656717,0.0006787168,0.0009693358,0.00272388,0.0013498545,0.002704046],"category_scores_gemma":[0.006364044,0.0007230658,0.00058032345,0.0025268688,0.0005458286,0.0025752247,0.0012512835,0.0013098508,0.00078520563],"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.00025882205,0.00013242883,0.0016732807,0.00008186013,0.000060317638,0.00006788119,0.000039245282,0.83340585,0.0008284625,0.00544698,0.0035850024,0.15441987],"study_design_scores_gemma":[0.0000022937666,0.0000049343776,0.000056572135,0.0000018891922,0.000004193607,0.000004639788,0.0000018801047,0.997969,0.0001333297,0.0017614155,0.000058209003,0.0000016894136],"about_ca_topic_score_codex":0.009437047,"about_ca_topic_score_gemma":0.010066643,"teacher_disagreement_score":0.009437047,"about_ca_system_score_codex":0.0007013388,"about_ca_system_score_gemma":0.0005895408,"threshold_uncertainty_score":0.018764257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8268062,0.0005212783,0.1602407,0.00032212766,0.00013700736,0.0003419409,0.0045503224,0.0007310437,0.006349434],"genre_scores_gemma":[0.9727404,0.000092146736,0.022883162,0.000021511065,0.000058458638,0.00013120058,0.0027668132,0.00004734202,0.0012590018],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99433523,0.0020019999,0.00050744636,0.0012647761,0.0013565304,0.00053403946],"domain_scores_gemma":[0.9866895,0.007978024,0.0014985539,0.0010426621,0.0024184315,0.00037285272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031169443,0.00056879816,0.00086234976,0.009450742,0.000964057,0.0019050954,0.0008383939,0.00054470706,0.0037071966],"category_scores_gemma":[0.016740669,0.00019832238,0.0014740328,0.0076976717,0.0004389639,0.0010829747,0.0012134562,0.00061702187,0.00089218444],"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.0017729984,0.00076154806,0.5851178,0.00065922615,0.0011711464,0.0019265623,0.0027285963,0.046742126,0.012028419,0.012074049,0.0073758224,0.32764173],"study_design_scores_gemma":[0.00003481274,0.00056926906,0.50632787,0.00006787554,0.0002822948,0.000954782,0.00456271,0.45733857,0.0082107475,0.010374237,0.01114914,0.00012761715],"about_ca_topic_score_codex":0.0102318125,"about_ca_topic_score_gemma":0.0073664114,"teacher_disagreement_score":0.0102318125,"about_ca_system_score_codex":0.00092165224,"about_ca_system_score_gemma":0.0010711246,"threshold_uncertainty_score":0.020344555},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01015124,0.0020063468,0.0037874829,0.12873499,0.061321195,0.0024421795,0.0145601835,0.006450291,0.7705461],"genre_scores_gemma":[0.047767848,0.00214715,0.003800258,0.06457841,0.015637236,0.0015850303,0.0067509357,0.0009900541,0.856743],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997769,0.0005085596,0.00017521711,0.00049609825,0.0006968203,0.0003543671],"domain_scores_gemma":[0.99004644,0.002297552,0.0009154938,0.0008788141,0.0035833837,0.0022782567],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019663442,0.000746131,0.00066406303,0.0020515497,0.0028018488,0.003908386,0.0017758115,0.0065853656,0.6321853],"category_scores_gemma":[0.017830692,0.00035713674,0.0005440398,0.0008162172,0.000875391,0.0024582562,0.003213208,0.0028395418,0.28648737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009924689,0.00007483807,0.0028205318,0.00030410438,0.000006564265,0.0003410566,0.00020879912,0.000029950177,0.00021435815,0.001691339,0.9103353,0.083873905],"study_design_scores_gemma":[0.00005899476,0.00008386949,0.0024719015,0.0004305725,0.000011434082,0.00038154158,0.0006496059,0.00024236477,0.00026506244,0.0018674867,0.99352276,0.000014324629],"about_ca_topic_score_codex":0.0023573574,"about_ca_topic_score_gemma":0.0021590423,"teacher_disagreement_score":0.6321853,"about_ca_system_score_codex":0.001410427,"about_ca_system_score_gemma":0.0048184153,"threshold_uncertainty_score":0.52464306},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014696445,0.00023103858,0.9829691,0.00023372854,0.00004801558,0.00007178364,0.00027134636,0.00053542183,0.0009431144],"genre_scores_gemma":[0.4555224,0.0004959872,0.5350424,0.00040444947,0.0001448253,0.0005619521,0.0017442357,0.00045489008,0.0056288033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988066,0.0005406164,0.000041827872,0.00023493283,0.00023937965,0.00013678937],"domain_scores_gemma":[0.99376136,0.0044964333,0.000359679,0.00055673276,0.0005877055,0.00023813687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022160395,0.00081123254,0.0016607937,0.00090629543,0.0009589813,0.00096035557,0.0029645208,0.0017324167,0.0033115568],"category_scores_gemma":[0.010423206,0.00081215805,0.0009940236,0.001394215,0.0012480845,0.0018585596,0.0015348113,0.0024582178,0.00081044564],"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.00010839562,0.000033768196,0.0010113291,0.000071586604,0.000053875086,0.00011751263,0.00007563728,0.9297949,0.0013135142,0.04346488,0.0020932248,0.021861367],"study_design_scores_gemma":[0.000008192794,0.0000028229201,0.0000500565,0.0000020049292,0.000002767924,0.000006414495,0.0000021812941,0.9920249,0.00011826095,0.0075913705,0.0001874819,0.0000035401072],"about_ca_topic_score_codex":0.028440109,"about_ca_topic_score_gemma":0.032929655,"teacher_disagreement_score":0.028440109,"about_ca_system_score_codex":0.0015877101,"about_ca_system_score_gemma":0.0024564199,"threshold_uncertainty_score":0.056549132},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03215958,0.0019098906,0.95634437,0.0010115858,0.00025741901,0.0002502268,0.0009795299,0.000792109,0.00629528],"genre_scores_gemma":[0.29588914,0.0018934695,0.68301725,0.0008253312,0.0009406728,0.00070352363,0.004098343,0.00027011867,0.01236217],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682415,0.00091222074,0.00016480459,0.0009076034,0.0009300548,0.00026116997],"domain_scores_gemma":[0.9849439,0.010673258,0.00063613825,0.0020600937,0.001258031,0.00042856325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023610247,0.0014708408,0.0023607868,0.005793236,0.0024038397,0.0024879447,0.0031985298,0.0026465268,0.004482223],"category_scores_gemma":[0.020436786,0.00086437963,0.0017749318,0.0060533835,0.002099812,0.005524044,0.0061962246,0.0018535516,0.0015433605],"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.00072576676,0.00044994097,0.011466717,0.0007730729,0.0004622033,0.0004259801,0.0008634423,0.10022305,0.014501188,0.1039297,0.030489823,0.73568916],"study_design_scores_gemma":[0.000058866364,0.00011395371,0.0027953153,0.00009090166,0.00008090206,0.0004254306,0.00030279337,0.7360965,0.0028196329,0.24962173,0.0075512207,0.000042774234],"about_ca_topic_score_codex":0.0035675806,"about_ca_topic_score_gemma":0.0042353887,"teacher_disagreement_score":0.005793236,"about_ca_system_score_codex":0.0007518962,"about_ca_system_score_gemma":0.00063145015,"threshold_uncertainty_score":0.014994502},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058678087,0.00452521,0.6599658,0.00932507,0.0011007603,0.0026953162,0.041369785,0.002445747,0.2198942],"genre_scores_gemma":[0.5738505,0.005365555,0.3276953,0.0009018335,0.0005805337,0.0024319985,0.032579962,0.00043852377,0.05615582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940645,0.0028576707,0.00032574788,0.0009071777,0.001638788,0.00020620368],"domain_scores_gemma":[0.9883267,0.0069399364,0.0011393413,0.0013098712,0.001917643,0.00036650078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038417424,0.00067974534,0.0006039292,0.011852321,0.0016827375,0.004057323,0.000947899,0.0008145886,0.01953469],"category_scores_gemma":[0.019545209,0.00023605724,0.00082072744,0.010856199,0.0010131462,0.0032949692,0.0020821225,0.0010062754,0.0038093368],"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.000087334185,0.00012551057,0.021480486,0.0009921741,0.0003016487,0.00037279897,0.0031666234,0.02130647,0.0010203583,0.51881963,0.08155991,0.3507671],"study_design_scores_gemma":[0.000023255403,0.00006233941,0.013488569,0.00070912734,0.00012122116,0.00055370445,0.0051483777,0.096816465,0.0015723272,0.3558557,0.5255777,0.000071156835],"about_ca_topic_score_codex":0.0051977593,"about_ca_topic_score_gemma":0.005158152,"teacher_disagreement_score":0.01953469,"about_ca_system_score_codex":0.0020675873,"about_ca_system_score_gemma":0.002297939,"threshold_uncertainty_score":0.065349996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30012348,0.00024611992,0.6857715,0.0006684219,0.0000723966,0.00017107184,0.00007613926,0.00090920203,0.011961736],"genre_scores_gemma":[0.91661143,0.00008374311,0.08022692,0.00011873691,0.000021740885,0.00012023639,0.00007566346,0.00007263678,0.0026688727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997496,0.00007434468,0.000011357728,0.000043466676,0.000053210242,0.00006815209],"domain_scores_gemma":[0.9984137,0.0008500746,0.00018984269,0.0002014859,0.00017371555,0.00017110603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007465243,0.0007014237,0.00096093223,0.0011116713,0.00065453595,0.00086733536,0.0010158835,0.0011309551,0.0027482635],"category_scores_gemma":[0.0035869975,0.0003309718,0.00046223906,0.00028415307,0.0008237612,0.0010706175,0.0013759158,0.0005676556,0.0004649918],"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.00030280932,0.00013940546,0.0014690774,0.00012781282,0.0000486201,0.0002261186,0.00022348166,0.86641496,0.017015727,0.026436107,0.0022841776,0.08531164],"study_design_scores_gemma":[0.00002157545,0.00006394418,0.00018277182,0.000008257148,0.000013621721,0.000048050584,0.000036127047,0.98663306,0.0016646795,0.010890738,0.00043124243,0.000005991663],"about_ca_topic_score_codex":0.001068575,"about_ca_topic_score_gemma":0.0010736637,"teacher_disagreement_score":0.0027482635,"about_ca_system_score_codex":0.00076891,"about_ca_system_score_gemma":0.001187333,"threshold_uncertainty_score":0.009193838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036195097,0.0005838048,0.9924077,0.00062346965,0.00008486787,0.000053430787,0.00049112394,0.00018366701,0.0019524031],"genre_scores_gemma":[0.47267255,0.0037559492,0.51150817,0.0003771712,0.00061141816,0.0010004895,0.002133837,0.00014520071,0.007795228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916506,0.00040752726,0.00003523,0.00018711666,0.00013522993,0.00006990132],"domain_scores_gemma":[0.99891925,0.0006446628,0.00015473361,0.00006502297,0.00013915505,0.00007721455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016651041,0.0012109563,0.0008923515,0.0019036996,0.0007332496,0.0013250698,0.0019244216,0.0010953784,0.002098137],"category_scores_gemma":[0.0035229113,0.00044463313,0.0014555778,0.0016052551,0.00088294025,0.0013811482,0.00165885,0.0014516218,0.0004254719],"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.000019775713,0.000035843284,0.0014681466,0.00007407442,0.00011670393,0.000113299335,0.00008427677,0.832557,0.00033122968,0.14651,0.0024218576,0.016267812],"study_design_scores_gemma":[0.0000038823473,0.000013277099,0.00021530205,0.0000108224685,0.000012829933,0.000016622305,0.000013294495,0.9496743,0.000032886248,0.047776602,0.0022219855,0.000008202015],"about_ca_topic_score_codex":0.022023821,"about_ca_topic_score_gemma":0.016262166,"teacher_disagreement_score":0.022023821,"about_ca_system_score_codex":0.0013789481,"about_ca_system_score_gemma":0.0015792835,"threshold_uncertainty_score":0.043791294},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06875162,0.0019064511,0.81350845,0.008866549,0.0007664468,0.004483242,0.031819005,0.0018328987,0.068065375],"genre_scores_gemma":[0.33191878,0.0013041855,0.63698775,0.0018856156,0.00022287718,0.008395865,0.008104903,0.00050913007,0.010670944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9836512,0.009765432,0.001044885,0.0014462939,0.003686228,0.00040597265],"domain_scores_gemma":[0.9236742,0.055088338,0.0049123093,0.006076543,0.008920102,0.0013284914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020493897,0.0012416762,0.0008679322,0.011422927,0.0021194536,0.006851009,0.0020683657,0.0013891773,0.0115373805],"category_scores_gemma":[0.06761994,0.00056545757,0.0007794248,0.011682043,0.003723792,0.010347095,0.0058771083,0.0018772333,0.0020573754],"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.0007507312,0.00045475995,0.04192083,0.003948757,0.0002720929,0.00071990094,0.101954035,0.004399334,0.006112147,0.27135047,0.052374296,0.51574254],"study_design_scores_gemma":[0.00015484706,0.000475562,0.022929642,0.003288599,0.00014970865,0.0007372454,0.15590364,0.058537833,0.0055010025,0.47383228,0.2781592,0.00033043773],"about_ca_topic_score_codex":0.00429729,"about_ca_topic_score_gemma":0.006738163,"teacher_disagreement_score":0.020493897,"about_ca_system_score_codex":0.002612639,"about_ca_system_score_gemma":0.003936196,"threshold_uncertainty_score":0.10838336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10899137,0.0017519249,0.8718001,0.0016212176,0.00022189002,0.00010086241,0.0007560318,0.0010342031,0.013722379],"genre_scores_gemma":[0.71512055,0.0021739681,0.24796915,0.0006199346,0.001042751,0.00028292974,0.0022280395,0.000941049,0.02962166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991937,0.00029449628,0.000022786804,0.0002705712,0.0001562752,0.00006223666],"domain_scores_gemma":[0.99236965,0.0046674362,0.0007306357,0.0008308366,0.00083993626,0.00056154386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010794979,0.00069189485,0.0016188241,0.0035335266,0.001364495,0.0016768393,0.0014018901,0.0014026193,0.00736895],"category_scores_gemma":[0.0105108395,0.00071131677,0.0008805987,0.0033229126,0.0016190367,0.0023997289,0.0017924912,0.0014380622,0.0016937082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022557461,0.00008093386,0.0028102426,0.0007008214,0.00019480864,0.00024342258,0.00068378757,0.26237094,0.009454844,0.54372096,0.032602385,0.1469112],"study_design_scores_gemma":[0.000029375158,0.000039245304,0.0025127237,0.000053190728,0.000029290844,0.00013657782,0.00006277886,0.4548541,0.0010007943,0.5337744,0.007483897,0.000023680848],"about_ca_topic_score_codex":0.0026458246,"about_ca_topic_score_gemma":0.002906539,"teacher_disagreement_score":0.00736895,"about_ca_system_score_codex":0.0016654213,"about_ca_system_score_gemma":0.0005032806,"threshold_uncertainty_score":0.024651587},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41326,0.0035279372,0.56945413,0.0014750905,0.00032060684,0.000116065516,0.0036474578,0.002684992,0.005513675],"genre_scores_gemma":[0.96151644,0.00077014335,0.02984489,0.000101367485,0.00017866275,0.00004284546,0.0030272915,0.000049160055,0.0044691577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997861,0.00003933984,0.000012998054,0.00007963381,0.000031182168,0.0000506965],"domain_scores_gemma":[0.99902964,0.00066530606,0.000095553776,0.00006699016,0.0000937706,0.000048858674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005835813,0.00082072784,0.0006498809,0.0014810129,0.00033351334,0.0006733176,0.0008631176,0.0008195255,0.0013870919],"category_scores_gemma":[0.0021102661,0.0003719802,0.0007015494,0.001168527,0.00026595782,0.0012826163,0.0006020198,0.0010690392,0.0005923711],"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.00061056344,0.00054201495,0.024549637,0.00020705278,0.00029883606,0.0003230624,0.000116958494,0.62518066,0.003909106,0.00948446,0.013053522,0.32172412],"study_design_scores_gemma":[0.000001832721,0.0000065093627,0.00068108295,0.0000033035885,0.0000071037102,0.000006680806,0.0000038292637,0.99705696,0.00018165902,0.0019208292,0.00012816755,0.0000020439923],"about_ca_topic_score_codex":0.018185942,"about_ca_topic_score_gemma":0.024475092,"teacher_disagreement_score":0.018185942,"about_ca_system_score_codex":0.0008925412,"about_ca_system_score_gemma":0.00039089983,"threshold_uncertainty_score":0.03616017},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06286875,0.0011419555,0.9267762,0.0014939094,0.0000547055,0.0001658582,0.0005604991,0.00040034662,0.0065379073],"genre_scores_gemma":[0.82378304,0.0019174205,0.16278598,0.00046200407,0.00024269795,0.00049858267,0.0008709893,0.00023920478,0.009200104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985757,0.0007235257,0.000036807356,0.00028460825,0.0002062176,0.00017316545],"domain_scores_gemma":[0.995943,0.0031475162,0.00030532051,0.00019323378,0.00023642239,0.00017445367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026317553,0.0017016983,0.0018264089,0.0015818177,0.0009222205,0.0022521548,0.0022229322,0.0020570506,0.002640776],"category_scores_gemma":[0.00830167,0.00077869126,0.0011879202,0.0022544994,0.0016492491,0.0033152057,0.0018387694,0.0018096287,0.0005918062],"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.00007562964,0.00008380921,0.0011884951,0.00012069251,0.00006828387,0.0001322646,0.00013139448,0.91354156,0.00060889375,0.060945254,0.0034247076,0.019678993],"study_design_scores_gemma":[0.00000777445,0.00000857019,0.00009775372,0.00000624364,0.000007948659,0.000019015215,0.000014614287,0.97082686,0.00010096742,0.028373975,0.00053240836,0.00000387216],"about_ca_topic_score_codex":0.008517945,"about_ca_topic_score_gemma":0.009302214,"teacher_disagreement_score":0.008517945,"about_ca_system_score_codex":0.003530905,"about_ca_system_score_gemma":0.0013915416,"threshold_uncertainty_score":0.025618613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10563257,0.001507891,0.8719543,0.0035139788,0.00034477972,0.000118642194,0.0011620979,0.00052569644,0.015239984],"genre_scores_gemma":[0.9359522,0.0017869278,0.02837948,0.00036692017,0.00039164675,0.000328243,0.0007936745,0.00015930072,0.03184157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870026,0.00051949103,0.000054523687,0.00033214496,0.00022828665,0.00016533678],"domain_scores_gemma":[0.9946173,0.0036871606,0.0005819809,0.00026974425,0.0004311274,0.00041280614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023288415,0.001330837,0.002534529,0.0013217742,0.0008051555,0.0027341803,0.003608217,0.003610041,0.004983854],"category_scores_gemma":[0.008634972,0.0012597247,0.001449865,0.0014360427,0.0023409585,0.0029033124,0.0015671902,0.0023783206,0.00078094105],"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.000068944195,0.00005092875,0.00038562392,0.000054785032,0.000048428567,0.000118921474,0.000051082752,0.7913581,0.0009888867,0.20353325,0.0010975115,0.002243538],"study_design_scores_gemma":[0.000015433827,0.000008651914,0.00005146582,0.0000028818583,0.000008473162,0.000011957177,0.0000035967826,0.974998,0.00005433723,0.024572788,0.00026380355,0.000008481051],"about_ca_topic_score_codex":0.012706343,"about_ca_topic_score_gemma":0.00664211,"teacher_disagreement_score":0.012706343,"about_ca_system_score_codex":0.0024441052,"about_ca_system_score_gemma":0.0019419842,"threshold_uncertainty_score":0.02526474},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064055226,0.00021922267,0.9546346,0.00094963715,0.00014429844,0.00026513476,0.0022500118,0.010109992,0.025021587],"genre_scores_gemma":[0.27206543,0.00097945,0.6765638,0.0006120468,0.00011505093,0.0012015181,0.0036629543,0.0029485708,0.041851267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999816,0.000060407026,0.000013032317,0.000021816866,0.0000735367,0.000015315398],"domain_scores_gemma":[0.9995389,0.00024019889,0.000015537118,0.000042480027,0.000108185006,0.000054716063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051971216,0.000548712,0.00036058316,0.00047731123,0.00039804645,0.0014771452,0.0015437418,0.0008876315,0.021020547],"category_scores_gemma":[0.0018642553,0.00029532317,0.0005592174,0.0002962541,0.00037450757,0.00081088365,0.001367947,0.0009023938,0.0026947972],"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.0002797826,0.00016199434,0.0022786506,0.0003364597,0.00007822216,0.0006199818,0.0006042097,0.62478817,0.004743677,0.13403055,0.07455315,0.15752512],"study_design_scores_gemma":[0.00005417861,0.000034411198,0.00021893509,0.000052854615,0.00001639863,0.00020784815,0.000069857975,0.8967651,0.0020514443,0.041874167,0.058627877,0.000026872971],"about_ca_topic_score_codex":0.005744448,"about_ca_topic_score_gemma":0.005219123,"teacher_disagreement_score":0.021020547,"about_ca_system_score_codex":0.0005907667,"about_ca_system_score_gemma":0.0012283594,"threshold_uncertainty_score":0.070320785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054851132,0.00019534827,0.9919721,0.00023000162,0.00003399805,0.000052427717,0.00036461747,0.0009292365,0.0007372542],"genre_scores_gemma":[0.3636267,0.00071191456,0.62009764,0.0008405327,0.00019543905,0.0005601989,0.0047597606,0.0011299861,0.008077814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868125,0.0005027957,0.000033639415,0.00045868364,0.00021887403,0.00010478552],"domain_scores_gemma":[0.9974746,0.0014808062,0.00021683307,0.0004462439,0.00023022774,0.00015124211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022155081,0.0012535875,0.0013949621,0.0029306614,0.0009189209,0.0016222122,0.004820158,0.00246613,0.003258069],"category_scores_gemma":[0.0075144353,0.0011952815,0.0019755175,0.0026542787,0.001833222,0.0031430735,0.002480032,0.0026802414,0.0014925594],"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.00015257543,0.00014024897,0.0046585435,0.00019136991,0.0002627599,0.00037632568,0.00044668265,0.67444474,0.0035904916,0.15284109,0.02008907,0.14280614],"study_design_scores_gemma":[0.000011599185,0.0000087200515,0.00016584061,0.000013519384,0.000011166716,0.00006690057,0.000016423748,0.9386812,0.00041353834,0.0585634,0.0020387494,0.000008992481],"about_ca_topic_score_codex":0.009003672,"about_ca_topic_score_gemma":0.017289868,"teacher_disagreement_score":0.009003672,"about_ca_system_score_codex":0.0017918403,"about_ca_system_score_gemma":0.0014153456,"threshold_uncertainty_score":0.017902553},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027082382,0.0004767422,0.9679356,0.0007544952,0.000056540426,0.00007681632,0.00079399504,0.00025218807,0.0025712796],"genre_scores_gemma":[0.7756584,0.0014740585,0.19031568,0.00047591308,0.00029104418,0.0009354579,0.00334063,0.00029667967,0.027212119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828786,0.0008348132,0.00007332269,0.00037578435,0.00027225702,0.00015596104],"domain_scores_gemma":[0.9901523,0.006832278,0.0010104185,0.0007817166,0.0007841994,0.00043912014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004302792,0.0009528288,0.0013846193,0.0013504145,0.0008409622,0.0021072428,0.0037304389,0.0019042098,0.008438195],"category_scores_gemma":[0.01558394,0.0008612465,0.0013292669,0.0017028344,0.0017033077,0.004986446,0.001848594,0.002843253,0.0017193675],"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.000103989616,0.00007185093,0.0021892646,0.00008014785,0.00008514934,0.000095419586,0.0003018904,0.51340246,0.00054857315,0.46812853,0.003244982,0.011747775],"study_design_scores_gemma":[0.00000680332,0.000006460159,0.00012402228,0.0000044785315,0.0000050818635,0.000010204542,0.000012896675,0.91745925,0.000049644146,0.08159712,0.0007180868,0.000005902907],"about_ca_topic_score_codex":0.008016839,"about_ca_topic_score_gemma":0.0093178,"teacher_disagreement_score":0.008438195,"about_ca_system_score_codex":0.0020466782,"about_ca_system_score_gemma":0.0009733596,"threshold_uncertainty_score":0.028228581},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4249308,0.0016179129,0.5252142,0.0094275735,0.0007865048,0.0010430677,0.0011850136,0.002862817,0.032932017],"genre_scores_gemma":[0.9001733,0.00022189441,0.095907256,0.0005241545,0.00015504974,0.00076652964,0.00049711333,0.000783471,0.00097117736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.5714684,0.31863633,0.022600694,0.018853461,0.06363764,0.004803447],"domain_scores_gemma":[0.13663797,0.6290284,0.040010028,0.10534944,0.085416645,0.0035575535],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.33000195,0.0008582531,0.0015343196,0.007741693,0.003111723,0.011143546,0.005561809,0.0015977062,0.002724546],"category_scores_gemma":[0.7541872,0.0011077784,0.0011363232,0.010185688,0.010057993,0.013100343,0.010448157,0.003602497,0.0013079005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001548966,0.0004238636,0.28042036,0.0021656412,0.0015456275,0.00042342074,0.09373281,0.016824251,0.003454334,0.17831104,0.015842544,0.40530723],"study_design_scores_gemma":[0.0002906978,0.0015057139,0.18585296,0.0044366554,0.0007715168,0.0013165937,0.058289856,0.19944356,0.019971795,0.42878997,0.09878104,0.00054962677],"about_ca_topic_score_codex":0.0038452859,"about_ca_topic_score_gemma":0.0032612155,"teacher_disagreement_score":0.66999805,"about_ca_system_score_codex":0.003821066,"about_ca_system_score_gemma":0.005055281,"threshold_uncertainty_score":0.8262269},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8174227,0.0016235387,0.17219786,0.0022394527,0.00006738853,0.00004594162,0.00025641365,0.0001109115,0.0060357],"genre_scores_gemma":[0.995385,0.00048645653,0.002740311,0.000049867085,0.00008486043,0.000031209478,0.00008864296,0.000009231436,0.0011243575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881303,0.0005032463,0.000052191077,0.00034130857,0.00016830752,0.00012194302],"domain_scores_gemma":[0.97255105,0.02143488,0.0030705838,0.0010872133,0.00067954004,0.0011767311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033463307,0.00040111915,0.0013812502,0.002391656,0.00129586,0.003500713,0.0012080267,0.0020178622,0.003468163],"category_scores_gemma":[0.024425419,0.0006898482,0.00072217983,0.0024289628,0.0032036952,0.0080015715,0.0021974444,0.0017878124,0.00026857373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002961488,0.00025165605,0.04949002,0.00023701691,0.0007290681,0.0005584543,0.0020348006,0.118344694,0.0019232408,0.7867749,0.0025883391,0.03677175],"study_design_scores_gemma":[0.000039310587,0.000060457893,0.021836063,0.00004451632,0.00014125943,0.00020050339,0.00054345623,0.25617266,0.00024295933,0.7197145,0.0009532035,0.000051070685],"about_ca_topic_score_codex":0.001786737,"about_ca_topic_score_gemma":0.0026116413,"teacher_disagreement_score":0.003500713,"about_ca_system_score_codex":0.0010660549,"about_ca_system_score_gemma":0.00047449276,"threshold_uncertainty_score":0.017697275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030282203,0.0017085117,0.9541805,0.0012718715,0.00018774193,0.00020120612,0.00059918803,0.0010238817,0.010544931],"genre_scores_gemma":[0.38356063,0.0012584783,0.61209023,0.0001289579,0.00043121132,0.00043293127,0.00038207378,0.00014793333,0.0015675044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99257517,0.004269633,0.00048554892,0.000837048,0.0016530616,0.0001794418],"domain_scores_gemma":[0.9216283,0.06269559,0.0036314307,0.0043493174,0.00646814,0.0012271974],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.006861552,0.0008119081,0.0010236752,0.01238067,0.0015865036,0.0040750946,0.0010918742,0.00086539,0.0044032037],"category_scores_gemma":[0.057865787,0.00039945464,0.0011268944,0.016528936,0.002376406,0.00525459,0.0028105567,0.0016624588,0.0008884104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013492616,0.00019034171,0.010740932,0.0005016152,0.00016495088,0.0005905643,0.0018067999,0.03627495,0.0016807301,0.5947681,0.006923055,0.34622306],"study_design_scores_gemma":[0.000023439956,0.00004805642,0.003500498,0.00012955906,0.000046096953,0.0005052872,0.00048948947,0.422854,0.0010611465,0.554985,0.016285606,0.000071920724],"about_ca_topic_score_codex":0.0047003413,"about_ca_topic_score_gemma":0.003965267,"teacher_disagreement_score":0.98761934,"about_ca_system_score_codex":0.0012842817,"about_ca_system_score_gemma":0.0016164922,"threshold_uncertainty_score":0.036287785},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38498902,0.0007941636,0.60879993,0.0003597059,0.00008396911,0.00013219749,0.0013539282,0.0007664664,0.0027205006],"genre_scores_gemma":[0.92426866,0.00026530543,0.07185719,0.000031094874,0.000077791876,0.0000684158,0.0012079246,0.00004782615,0.002175761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994382,0.00015664367,0.000029745128,0.00016036909,0.00013981265,0.000075170785],"domain_scores_gemma":[0.9979273,0.0008772706,0.0003818764,0.0002382901,0.00041115432,0.0001641237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005902464,0.00048216077,0.000550935,0.0034101673,0.0004185275,0.00080564787,0.0005594496,0.0006758129,0.0007380898],"category_scores_gemma":[0.0036022796,0.00024419694,0.00050692,0.0023323095,0.0003663263,0.0016822497,0.0010987818,0.0005687334,0.00039197897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016003398,0.001160529,0.09175133,0.00056599564,0.00053151994,0.00075983047,0.0011358128,0.123675905,0.081492536,0.030144371,0.0096467845,0.657535],"study_design_scores_gemma":[0.000009525007,0.000076894685,0.008535162,0.00001690332,0.000035245608,0.00017172741,0.00012956263,0.9797126,0.0033874023,0.0064652087,0.0014443946,0.000015294865],"about_ca_topic_score_codex":0.0029620205,"about_ca_topic_score_gemma":0.0059525305,"teacher_disagreement_score":0.0034101673,"about_ca_system_score_codex":0.00036007958,"about_ca_system_score_gemma":0.00045134095,"threshold_uncertainty_score":0.005889535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021576412,0.0004912241,0.96994007,0.0009031841,0.000048935497,0.00006773396,0.00049413653,0.0029347248,0.0035435306],"genre_scores_gemma":[0.7298564,0.0009105541,0.25802267,0.0008749522,0.00044170942,0.0004970606,0.002374311,0.0013528971,0.0056694653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929463,0.002320331,0.00025038767,0.0017539718,0.0021382272,0.0005908761],"domain_scores_gemma":[0.943094,0.03330391,0.004735878,0.012493761,0.004877054,0.0014953522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057116533,0.001690186,0.0022759172,0.0023371074,0.0013007363,0.0025823442,0.0043925177,0.0025784222,0.0052499287],"category_scores_gemma":[0.05561022,0.0010812161,0.0011757341,0.0031155623,0.0027530456,0.0059633916,0.003997232,0.0034595975,0.0028240962],"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.00047030157,0.0001261815,0.0022532966,0.00039410577,0.00011110423,0.00021551082,0.0002498368,0.78001076,0.0043674856,0.13556764,0.010935086,0.06529866],"study_design_scores_gemma":[0.00003277632,0.000068392685,0.0003210048,0.000016730659,0.000009598919,0.00006197731,0.000029229977,0.9230369,0.0010678818,0.07426909,0.0010711696,0.00001531713],"about_ca_topic_score_codex":0.002202871,"about_ca_topic_score_gemma":0.0029231107,"teacher_disagreement_score":0.0057116533,"about_ca_system_score_codex":0.0022948594,"about_ca_system_score_gemma":0.0027037004,"threshold_uncertainty_score":0.030206501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99638003,0.00012390975,0.0020767092,0.0001245912,0.000011421737,0.000009173747,0.00024757674,0.000021001519,0.0010056465],"genre_scores_gemma":[0.99911946,0.00006934895,0.00026309583,0.0000065832346,0.000007742144,0.0000049555147,0.00014918583,0.0000025704262,0.0003769745],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9998721,0.000025703235,0.000007610531,0.000033067186,0.000030998286,0.000030519594],"domain_scores_gemma":[0.9980921,0.0009660867,0.00040044362,0.00010140919,0.00031939487,0.00012053428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083765324,0.00021812723,0.00019950434,0.0016213746,0.00065197586,0.0007129843,0.00031672002,0.00032876915,0.0013424775],"category_scores_gemma":[0.003092262,0.000159804,0.00024262833,0.0013760247,0.00037107946,0.0012163208,0.00035035808,0.00033237287,0.00013628094],"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.00033303333,0.0001957226,0.8289442,0.00022241312,0.00019974798,0.001414694,0.005633493,0.07368381,0.0066801454,0.01945902,0.0046065296,0.058627214],"study_design_scores_gemma":[0.000011103301,0.00008505881,0.54969144,0.000027620295,0.00010444847,0.00023944282,0.0018025868,0.43740553,0.002082041,0.0056567653,0.0028268471,0.000067119145],"about_ca_topic_score_codex":0.04530113,"about_ca_topic_score_gemma":0.047187403,"teacher_disagreement_score":0.04530113,"about_ca_system_score_codex":0.0014024709,"about_ca_system_score_gemma":0.0005094048,"threshold_uncertainty_score":0.0900749},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36110723,0.0053829546,0.5560135,0.007185145,0.00056844944,0.00019831254,0.00094442355,0.00096754445,0.06763236],"genre_scores_gemma":[0.9503611,0.0018162569,0.034981884,0.0004733561,0.00039355786,0.000328226,0.00045301107,0.00023775897,0.010954852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991381,0.00026964044,0.000026945136,0.00026125278,0.00018979952,0.00011420758],"domain_scores_gemma":[0.99495465,0.0033159347,0.0004749198,0.00045424988,0.00028749165,0.000512763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011869837,0.00064323697,0.00069622,0.0012932491,0.001049419,0.0019278986,0.001314369,0.0016734542,0.004906025],"category_scores_gemma":[0.016063794,0.00059677596,0.000719269,0.0006597052,0.0024818103,0.0058665564,0.001647798,0.0025328563,0.0006323939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013114892,0.000026161306,0.0007621314,0.0001264718,0.00005056096,0.00012289343,0.0002689472,0.024176907,0.004357034,0.9593945,0.0028137793,0.0077693383],"study_design_scores_gemma":[0.00003054753,0.000035499546,0.0006568275,0.000036033216,0.000020478992,0.00013596407,0.000043904707,0.1757061,0.0015292948,0.8176364,0.004130021,0.000039021583],"about_ca_topic_score_codex":0.0013733441,"about_ca_topic_score_gemma":0.00070806494,"teacher_disagreement_score":0.004906025,"about_ca_system_score_codex":0.0014989004,"about_ca_system_score_gemma":0.00055196416,"threshold_uncertainty_score":0.016412318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01665817,0.0010410453,0.9784759,0.0006638787,0.000048849448,0.00011838608,0.00046753488,0.0005737553,0.0019525593],"genre_scores_gemma":[0.6443818,0.00229992,0.34307107,0.00031895906,0.0003110114,0.00040755005,0.0018331736,0.00018869426,0.007187723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981614,0.0007712048,0.00007643743,0.0004279842,0.00045576607,0.00010732047],"domain_scores_gemma":[0.9912765,0.0067147193,0.00063170696,0.00059066655,0.0006200501,0.00016633271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025972677,0.0011674055,0.0015025,0.003774874,0.0010681134,0.0015821182,0.002668261,0.0015943175,0.0031550752],"category_scores_gemma":[0.015201629,0.0007609345,0.00113905,0.004309932,0.0009350325,0.0043649487,0.0011048686,0.0021936106,0.0010364194],"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.000113231225,0.00023619163,0.0055142124,0.00025414093,0.00012780818,0.000112764086,0.00017077249,0.75664663,0.00068103574,0.043830074,0.009149305,0.1831639],"study_design_scores_gemma":[0.0000047863123,0.000008284498,0.00027059097,0.000008345662,0.000006590022,0.000013417452,0.0000120796285,0.9829558,0.00009821357,0.016047942,0.00056827,0.00000574713],"about_ca_topic_score_codex":0.025940528,"about_ca_topic_score_gemma":0.028299639,"teacher_disagreement_score":0.025940528,"about_ca_system_score_codex":0.0031293554,"about_ca_system_score_gemma":0.0013378226,"threshold_uncertainty_score":0.051579118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078253314,0.0017828934,0.87352395,0.0035173227,0.00023047825,0.00009343698,0.0002680204,0.00019658146,0.042133912],"genre_scores_gemma":[0.85591054,0.0030228072,0.11786387,0.0010683133,0.0005316395,0.00033390237,0.0002115326,0.00017105599,0.020886473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997341,0.00008709196,0.000011040329,0.00004208112,0.00008276601,0.000042905565],"domain_scores_gemma":[0.998481,0.0007126085,0.0003003293,0.00016195107,0.00016528455,0.00017888368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010613261,0.0007613654,0.0006547484,0.00092462345,0.00077891385,0.0010654199,0.0011238063,0.0014584457,0.0034483662],"category_scores_gemma":[0.0032509365,0.00035239093,0.0011787029,0.00042006274,0.0017516228,0.0019998623,0.002331778,0.0021010193,0.00033779212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017128874,0.00004009579,0.0006053259,0.00011508212,0.000025509973,0.00018888997,0.00021956781,0.119930916,0.0029898125,0.8683477,0.0023876461,0.0051323953],"study_design_scores_gemma":[0.000012955406,0.000023020306,0.0002861469,0.000022822913,0.000011242003,0.00009167317,0.000037393875,0.8072828,0.00029702246,0.18827811,0.0036421937,0.000014661917],"about_ca_topic_score_codex":0.0047453954,"about_ca_topic_score_gemma":0.0023575635,"teacher_disagreement_score":0.0047453954,"about_ca_system_score_codex":0.00082550885,"about_ca_system_score_gemma":0.0008207463,"threshold_uncertainty_score":0.011535943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26534188,0.0025545605,0.6901098,0.0047858697,0.00033555998,0.00016090182,0.00076410355,0.0010157077,0.034931544],"genre_scores_gemma":[0.942712,0.0022154513,0.041442115,0.0008260823,0.000578434,0.00023056552,0.0005138571,0.00024256475,0.011238882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868745,0.00035444475,0.00004627937,0.00046340429,0.00026311402,0.00018526883],"domain_scores_gemma":[0.9779292,0.015376725,0.0025352405,0.0019160574,0.0008701863,0.0013727049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015924611,0.0010591117,0.0015843373,0.0022228516,0.0017040694,0.0047495277,0.0015869093,0.0018031106,0.0066947755],"category_scores_gemma":[0.017016387,0.00078328757,0.0012610933,0.0013720577,0.0028299114,0.009617883,0.0024886157,0.002860889,0.001095125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033241155,0.00013089266,0.0049466183,0.0005476648,0.00017909938,0.0007664425,0.0007515637,0.06520119,0.010913793,0.87823737,0.013387445,0.024605552],"study_design_scores_gemma":[0.000051131257,0.00011077558,0.0014383651,0.000057796646,0.00009621641,0.00070755434,0.00023573385,0.36293542,0.0028748855,0.6232834,0.008157194,0.000051449344],"about_ca_topic_score_codex":0.0012020356,"about_ca_topic_score_gemma":0.001305897,"teacher_disagreement_score":0.0066947755,"about_ca_system_score_codex":0.0013773666,"about_ca_system_score_gemma":0.00043136414,"threshold_uncertainty_score":0.022396207},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22578223,0.0028850532,0.7544167,0.0028242855,0.0001274032,0.000100415156,0.0002880348,0.0004340854,0.01314182],"genre_scores_gemma":[0.9564256,0.00244236,0.037136197,0.00022238574,0.00040101574,0.00020130693,0.00024342394,0.00014558731,0.002782189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729615,0.0012224994,0.000115547766,0.00042272633,0.0006196037,0.00032336745],"domain_scores_gemma":[0.92491806,0.06820992,0.0030507683,0.001385936,0.0014818246,0.00095349515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047147563,0.001266351,0.0015703368,0.0028604795,0.00078510796,0.002526935,0.002179292,0.002246964,0.0017460397],"category_scores_gemma":[0.05094859,0.0010302627,0.0008898299,0.0011151764,0.0037876214,0.005288915,0.0029545887,0.0021343587,0.00022244839],"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.00016240061,0.00005915919,0.0045289076,0.0002983514,0.00012236775,0.00026312537,0.0004298444,0.6588316,0.007862319,0.315238,0.0014235667,0.010780441],"study_design_scores_gemma":[0.000010254821,0.000024681533,0.00078099803,0.000033919605,0.000017991868,0.00006860894,0.000040182997,0.84480315,0.00078446395,0.15280968,0.0006078639,0.000018234705],"about_ca_topic_score_codex":0.002125313,"about_ca_topic_score_gemma":0.0010538553,"teacher_disagreement_score":0.0047147563,"about_ca_system_score_codex":0.0022426269,"about_ca_system_score_gemma":0.00066264026,"threshold_uncertainty_score":0.024934292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8559349,0.00041747064,0.13972166,0.00016638284,0.000010566799,0.000040070092,0.0021271224,0.00043575783,0.0011460654],"genre_scores_gemma":[0.97278816,0.0001532974,0.024425702,0.000023687175,0.000009360846,0.000035293182,0.002332708,0.000053222044,0.00017862028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993325,0.00030374975,0.00004124684,0.00017625281,0.00008368372,0.00006257575],"domain_scores_gemma":[0.99507797,0.0032949024,0.0006398288,0.00047721525,0.0003496786,0.00016030842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017980498,0.00048827886,0.00050823647,0.0038048956,0.00049079605,0.0011221274,0.00072681304,0.001026745,0.00090393936],"category_scores_gemma":[0.014737112,0.00049172115,0.0006509636,0.0027686793,0.00055574684,0.0015635861,0.00078806165,0.0011413824,0.00035114406],"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.00035727397,0.0001356861,0.19250204,0.00025279657,0.00021749907,0.00040849776,0.00070012716,0.71782786,0.0157534,0.015350941,0.0022870516,0.05420685],"study_design_scores_gemma":[0.00000996783,0.000014012149,0.012556829,0.000016404625,0.000015190865,0.00006240401,0.00008317151,0.9760621,0.0013718648,0.009082605,0.00070985744,0.000015528387],"about_ca_topic_score_codex":0.004803277,"about_ca_topic_score_gemma":0.004643862,"teacher_disagreement_score":0.004803277,"about_ca_system_score_codex":0.00080428977,"about_ca_system_score_gemma":0.0005128733,"threshold_uncertainty_score":0.009550631},"labels":[],"label_agreement":null},{"id":"W2951770249","doi":"10.1093/comnet/cnz043","title":"An unsupervised framework for comparing graph embeddings","year":2019,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Theoretical computer science; Artificial intelligence","score_opus":0.023040137691375067,"score_gpt":0.31281722665471623,"score_spread":0.28977708896334115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951770249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03342333,0.00021389502,0.96439946,0.00012237731,0.000037141283,0.00007912003,0.00022175736,0.0005468401,0.000955994],"genre_scores_gemma":[0.5855653,0.00018917568,0.41072157,0.00011850772,0.000093139024,0.0002630558,0.0015911175,0.00032624562,0.0011318891],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938146,0.0026457158,0.00042912233,0.0014063544,0.0014413289,0.0002628565],"domain_scores_gemma":[0.9877637,0.0053130323,0.0019454884,0.0021167141,0.002420553,0.00044049832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005576085,0.001122083,0.0012212611,0.009439433,0.0009030496,0.0025436347,0.0024235523,0.0020949356,0.0010918052],"category_scores_gemma":[0.020427642,0.0004657029,0.0010308832,0.004469103,0.0022935104,0.004994712,0.0029834388,0.002052868,0.00044103802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000466376,0.0004505883,0.018913269,0.00041070022,0.0006308794,0.00024269357,0.0005370764,0.41092548,0.016959624,0.110482834,0.006035901,0.43394464],"study_design_scores_gemma":[0.000011944449,0.00009363819,0.002293434,0.000027840968,0.0000207025,0.00013895112,0.000097153774,0.93561,0.00298236,0.05715363,0.0015344204,0.000036000314],"about_ca_topic_score_codex":0.0015953691,"about_ca_topic_score_gemma":0.0023521618,"teacher_disagreement_score":0.009439433,"about_ca_system_score_codex":0.0016849121,"about_ca_system_score_gemma":0.000991949,"threshold_uncertainty_score":0.029489517},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009725179,0.00013890797,0.987783,0.00018859493,0.000021935984,0.00012073241,0.00036091506,0.0004102485,0.0012504703],"genre_scores_gemma":[0.35098884,0.0003643671,0.6408564,0.00052706775,0.0001846843,0.0007616938,0.003517948,0.00050754077,0.0022915532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98045415,0.008473146,0.0014985517,0.00516341,0.0038374998,0.0005733214],"domain_scores_gemma":[0.93138546,0.03945621,0.0059898137,0.016408367,0.0057410216,0.0010191432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013470563,0.0010478247,0.001918032,0.005282639,0.001607397,0.004468325,0.002600887,0.0019512837,0.0031990665],"category_scores_gemma":[0.07902311,0.0007897456,0.0019216742,0.004765594,0.004584965,0.00787319,0.0050700954,0.0045426753,0.001424631],"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.0005012888,0.0005128047,0.013480675,0.0006513071,0.000389335,0.00043620917,0.0017644223,0.126989,0.0077701616,0.50989765,0.0069748587,0.33063233],"study_design_scores_gemma":[0.000029111674,0.000100494246,0.0019970837,0.00007164808,0.000030837946,0.0002851961,0.00028211484,0.43521553,0.002935002,0.5536314,0.005372969,0.00004868904],"about_ca_topic_score_codex":0.0022446208,"about_ca_topic_score_gemma":0.0022118895,"teacher_disagreement_score":0.013470563,"about_ca_system_score_codex":0.0020715806,"about_ca_system_score_gemma":0.0018730751,"threshold_uncertainty_score":0.07124001},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114611536,0.0008423616,0.8800267,0.0010385973,0.00006648188,0.00014505726,0.0010183423,0.0005618133,0.001689054],"genre_scores_gemma":[0.7697393,0.0010713045,0.22051026,0.0002172581,0.00023581459,0.00021255629,0.0028276965,0.00016760906,0.005018157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964426,0.001249207,0.00021955722,0.00092812016,0.00092895655,0.00023159718],"domain_scores_gemma":[0.9529882,0.034386862,0.004661991,0.0044551212,0.0022392871,0.0012685404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042484463,0.0007367985,0.0014971957,0.006312498,0.0017981405,0.0040857736,0.0025689332,0.0016382072,0.0018578026],"category_scores_gemma":[0.033319067,0.00089623756,0.0012421884,0.0062215338,0.0021346593,0.00878345,0.0030757396,0.0018384921,0.00041993303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053123967,0.00061037124,0.03033303,0.00076848466,0.00049282133,0.00078740757,0.0028330297,0.3151717,0.0038587097,0.47700408,0.008317781,0.15929142],"study_design_scores_gemma":[0.000021841845,0.00002483645,0.001592541,0.000039991617,0.000051803905,0.00011139082,0.0003404691,0.6557516,0.0009357915,0.33863983,0.0024751483,0.000014764577],"about_ca_topic_score_codex":0.0045299474,"about_ca_topic_score_gemma":0.005271798,"teacher_disagreement_score":0.006312498,"about_ca_system_score_codex":0.001807105,"about_ca_system_score_gemma":0.0012717249,"threshold_uncertainty_score":0.02246815},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022722628,0.0004017075,0.9738203,0.00019287948,0.000028335242,0.00014062261,0.00030020412,0.0014296486,0.0009637428],"genre_scores_gemma":[0.25614935,0.00040547468,0.739485,0.00016616259,0.00011041665,0.00024150657,0.0016574642,0.00024341441,0.001541235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977914,0.0005629631,0.00009207771,0.00057373923,0.00083048345,0.00014933974],"domain_scores_gemma":[0.99334574,0.003826983,0.00081250945,0.0010212342,0.0007502754,0.00024337281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018985124,0.0012160306,0.0013486351,0.005673498,0.0013236287,0.0018412742,0.0024110281,0.0018807952,0.0010872631],"category_scores_gemma":[0.012442076,0.0007693875,0.0009545098,0.0037620256,0.00092999387,0.004643155,0.002388802,0.0012740253,0.0012295763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047711455,0.00039307203,0.01665944,0.0008296066,0.00044043397,0.0008248393,0.0009031113,0.29741824,0.052823745,0.042911462,0.00946611,0.5768528],"study_design_scores_gemma":[0.00002512619,0.00005608157,0.0015019346,0.00003261238,0.00003701177,0.0003036796,0.0001598871,0.9392865,0.009582483,0.04530013,0.0036876532,0.000026856906],"about_ca_topic_score_codex":0.0030800896,"about_ca_topic_score_gemma":0.005153271,"teacher_disagreement_score":0.005673498,"about_ca_system_score_codex":0.0010299658,"about_ca_system_score_gemma":0.0009608334,"threshold_uncertainty_score":0.010040402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.503351,0.0060279593,0.43640545,0.015827315,0.0004267724,0.00032086213,0.0031966048,0.0007823452,0.033661805],"genre_scores_gemma":[0.8945171,0.0019409151,0.077982426,0.0009602405,0.0004477527,0.00021799217,0.0033455603,0.00018512334,0.02040287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987405,0.00047067163,0.00005369298,0.0003204786,0.00023396818,0.00018072402],"domain_scores_gemma":[0.9909587,0.0068703485,0.0010164646,0.00032542823,0.000317081,0.0005119559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002907542,0.00097515393,0.0012746237,0.0011824499,0.0019062725,0.0019248181,0.0022553094,0.0034486973,0.008868106],"category_scores_gemma":[0.011870877,0.00061913574,0.0008879314,0.0012059548,0.0016920231,0.004744191,0.0021406617,0.0018237386,0.0007444481],"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.0005746896,0.00034104168,0.027360871,0.0005613306,0.0004280465,0.0013430839,0.00041786575,0.6671592,0.0010389253,0.16766441,0.02596455,0.107146],"study_design_scores_gemma":[0.00010119383,0.00007057141,0.005708078,0.00008577551,0.000051879913,0.00062663,0.00025544933,0.7984719,0.00049006456,0.18421602,0.009885222,0.00003715024],"about_ca_topic_score_codex":0.012633333,"about_ca_topic_score_gemma":0.009784939,"teacher_disagreement_score":0.012633333,"about_ca_system_score_codex":0.0021197705,"about_ca_system_score_gemma":0.0008803865,"threshold_uncertainty_score":0.029666722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10852441,0.0028601394,0.79665625,0.011655494,0.001304377,0.00026984618,0.0008804445,0.0012863633,0.07656261],"genre_scores_gemma":[0.6565384,0.003000939,0.30314454,0.002548137,0.0005658999,0.0003389212,0.0012450499,0.0015175986,0.031100398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986823,0.00037569148,0.00007378484,0.00040521065,0.000321069,0.00014186963],"domain_scores_gemma":[0.99233866,0.0039718985,0.00046642826,0.0017960448,0.0008317318,0.0005952012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015001934,0.00050768425,0.0006719403,0.0012426043,0.0016300885,0.0033248416,0.0012191945,0.0023065787,0.013388484],"category_scores_gemma":[0.018551426,0.0005579391,0.0006946248,0.0009783775,0.0028305184,0.009548064,0.0017347339,0.0025607345,0.0027300178],"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.00009049979,0.00005808708,0.0014606162,0.0002916867,0.000049329185,0.00021279979,0.00059052685,0.029533917,0.004521806,0.8632118,0.017749975,0.082228884],"study_design_scores_gemma":[0.00001618562,0.000031647865,0.00033038715,0.00009677969,0.000019273231,0.00029979792,0.0003179862,0.055751417,0.0017427431,0.9122853,0.029084593,0.000023821221],"about_ca_topic_score_codex":0.001768318,"about_ca_topic_score_gemma":0.0017413947,"teacher_disagreement_score":0.013388484,"about_ca_system_score_codex":0.00093407754,"about_ca_system_score_gemma":0.0007631625,"threshold_uncertainty_score":0.044788957},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98197913,0.00010655622,0.0049732463,0.00083638204,0.000018453828,0.000026556716,0.00023680084,0.00004311851,0.01177968],"genre_scores_gemma":[0.99907124,0.00003240197,0.00044614627,0.000026789705,0.000007856309,0.000008874441,0.0000501183,0.0000072386124,0.00034928333],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983925,0.0009379954,0.000042019117,0.0002678814,0.00021286221,0.00014678286],"domain_scores_gemma":[0.97880596,0.014037362,0.0037485391,0.0012826992,0.00090905256,0.0012163273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017203367,0.00017514786,0.0002591296,0.001308751,0.0010178399,0.0023283637,0.00047241198,0.00056680385,0.002831812],"category_scores_gemma":[0.022135407,0.00022589139,0.00020016856,0.0007284113,0.0019760863,0.001733367,0.00092788826,0.0009455515,0.00032511767],"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.0018918992,0.0011043499,0.54176414,0.00039545554,0.0005522832,0.0011858232,0.013802591,0.06354299,0.051000766,0.1921305,0.009117912,0.12351116],"study_design_scores_gemma":[0.0001120366,0.00048125748,0.7100743,0.00008999106,0.00016999048,0.0003045607,0.006621135,0.21817693,0.005750106,0.047097478,0.011002077,0.00012011144],"about_ca_topic_score_codex":0.0128012765,"about_ca_topic_score_gemma":0.012421123,"teacher_disagreement_score":0.0128012765,"about_ca_system_score_codex":0.0014946721,"about_ca_system_score_gemma":0.00067239994,"threshold_uncertainty_score":0.025453568},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029463412,0.0021080563,0.9639451,0.0012924195,0.00007109894,0.000052602056,0.0001351709,0.00008005809,0.0028520613],"genre_scores_gemma":[0.7582559,0.004642871,0.23418753,0.00032685953,0.0005725686,0.00034144247,0.00024618287,0.0000723719,0.0013543197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954139,0.0030047386,0.00016873462,0.00041522947,0.0008744858,0.00012284477],"domain_scores_gemma":[0.9421373,0.051728867,0.003103815,0.0015320883,0.0010715047,0.0004264261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006354056,0.0006110458,0.00087132753,0.0031242557,0.001053499,0.002108314,0.0011740039,0.0012043134,0.0008098384],"category_scores_gemma":[0.053267784,0.0006080365,0.00072999776,0.002157579,0.0025068985,0.004361086,0.0026122327,0.0021036542,0.00014320892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046061825,0.000040742678,0.008795317,0.00026032067,0.00019563742,0.00028787224,0.00093162106,0.38837567,0.00090232375,0.5431853,0.0009224805,0.056056757],"study_design_scores_gemma":[0.000005504415,0.000017554798,0.0011937912,0.00003841186,0.000016716021,0.000055672954,0.00009638689,0.39999965,0.00015951549,0.5958239,0.0025702904,0.000022640232],"about_ca_topic_score_codex":0.0041990746,"about_ca_topic_score_gemma":0.0025832583,"teacher_disagreement_score":0.006354056,"about_ca_system_score_codex":0.0013836438,"about_ca_system_score_gemma":0.000972581,"threshold_uncertainty_score":0.033603847},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61643726,0.0010517046,0.37042508,0.0020840042,0.00007975219,0.00012156027,0.00039952045,0.0006488556,0.0087523945],"genre_scores_gemma":[0.980314,0.00061407493,0.016086832,0.00014235446,0.0000637163,0.000078836565,0.00013123655,0.000047670997,0.0025213643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991091,0.00045594567,0.000029514342,0.00015281577,0.00014914942,0.000103526225],"domain_scores_gemma":[0.98825586,0.008279931,0.0014648554,0.0009911836,0.0005945967,0.00041357471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012964291,0.0006097933,0.0007418657,0.001491111,0.0011408237,0.001482887,0.0010976519,0.001389458,0.0012982665],"category_scores_gemma":[0.014791507,0.0006360848,0.00053163327,0.00086777296,0.0018626456,0.003662386,0.0014765834,0.0012823036,0.00038246124],"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.0006997714,0.0001295333,0.008062831,0.00034653072,0.00020985366,0.0014759015,0.0013186062,0.5799744,0.0219809,0.36125448,0.0062306006,0.018316595],"study_design_scores_gemma":[0.00004463924,0.00006946542,0.0012077246,0.000019029714,0.000034354147,0.0002695595,0.00017884138,0.89319587,0.0015724075,0.10170554,0.0016725179,0.00003003658],"about_ca_topic_score_codex":0.0031493276,"about_ca_topic_score_gemma":0.0020455907,"teacher_disagreement_score":0.0031493276,"about_ca_system_score_codex":0.0012130487,"about_ca_system_score_gemma":0.0003843223,"threshold_uncertainty_score":0.008801281},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013945674,0.00056947145,0.9836776,0.00033324506,0.00006922645,0.000032847474,0.000112178255,0.00016711037,0.0010926337],"genre_scores_gemma":[0.7871742,0.0014723573,0.20779704,0.00020959122,0.00028466887,0.00014083211,0.0007070581,0.000062901054,0.002151372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768126,0.0008752061,0.00015283434,0.0005062455,0.000651892,0.00013256689],"domain_scores_gemma":[0.9955591,0.0027025745,0.00037281244,0.00068392284,0.000584393,0.000097221484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037587797,0.000874224,0.0012336681,0.0020598343,0.0007163894,0.002539027,0.0011162561,0.0012254675,0.0010871263],"category_scores_gemma":[0.011991996,0.0005274103,0.0008765336,0.0026293832,0.00091746426,0.003980948,0.0021139877,0.0012931863,0.00037839814],"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.0003204922,0.00009608422,0.002298026,0.00018328983,0.00025135864,0.00019964708,0.00017809299,0.71681577,0.0063478644,0.054404646,0.0023781746,0.21652652],"study_design_scores_gemma":[0.000005359466,0.00001399336,0.00029270205,0.000008906104,0.000018287406,0.000019997478,0.000022590677,0.96931005,0.0014337033,0.028178487,0.0006891391,0.0000067144274],"about_ca_topic_score_codex":0.0031732665,"about_ca_topic_score_gemma":0.0020035403,"teacher_disagreement_score":0.0037587797,"about_ca_system_score_codex":0.0010350376,"about_ca_system_score_gemma":0.00070206466,"threshold_uncertainty_score":0.019878507},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006249862,0.03360806,0.0044193356,0.69624054,0.11562343,0.000049692568,0.0007252515,0.00039813906,0.1483106],"genre_scores_gemma":[0.0107358415,0.033099633,0.0027640967,0.11541785,0.025078379,0.00008489453,0.0006495698,0.00074097014,0.8114287],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99772495,0.00038634465,0.00010655502,0.0005040172,0.0011242596,0.00015386198],"domain_scores_gemma":[0.99160296,0.0020416987,0.00031949522,0.0006331954,0.0037951728,0.0016074278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026316827,0.0010770905,0.0009844936,0.001850507,0.0041723875,0.0072163916,0.0011877483,0.0026055179,0.051827867],"category_scores_gemma":[0.018006608,0.0004889936,0.0005600255,0.0021607885,0.0031720418,0.0054395488,0.0023597719,0.007793106,0.041011725],"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.0000032106939,0.0000040008445,0.000047574387,0.000012145678,0.000002518447,0.000008655937,0.00006020887,0.000021969001,0.0000151619715,0.008417283,0.9815037,0.009903457],"study_design_scores_gemma":[0.0000021242888,0.0000038576295,0.00014178928,0.0000921847,0.0000019358847,0.000039542338,0.00014139416,0.000037720125,0.00003566967,0.0073718303,0.9921246,0.0000072134576],"about_ca_topic_score_codex":0.009811475,"about_ca_topic_score_gemma":0.016616754,"teacher_disagreement_score":0.051827867,"about_ca_system_score_codex":0.0024959086,"about_ca_system_score_gemma":0.0041059186,"threshold_uncertainty_score":0.17338145},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006365756,0.0006235104,0.98132676,0.0022369528,0.0001993394,0.00018844067,0.0007102658,0.0020770058,0.0062719337],"genre_scores_gemma":[0.17400803,0.001201487,0.8069043,0.001668355,0.0006106929,0.0011741339,0.003386409,0.0013553965,0.009691202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953245,0.0017354569,0.00026490772,0.0011611296,0.0012122398,0.0003017184],"domain_scores_gemma":[0.9879127,0.0070730094,0.00084046833,0.0022190744,0.0015589779,0.0003956428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061318646,0.0018019351,0.0014552895,0.0051279305,0.0018041297,0.0044390117,0.0027298217,0.001778726,0.019513942],"category_scores_gemma":[0.031625133,0.00079565484,0.0019591397,0.003633521,0.0024884369,0.005651081,0.00614053,0.0061771036,0.0061115995],"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.0004598577,0.00022479713,0.004403697,0.0007861958,0.00036892982,0.00033255006,0.0013264063,0.05672423,0.0063093463,0.4614877,0.062035635,0.4055407],"study_design_scores_gemma":[0.00008257687,0.00006994514,0.0012024498,0.00027771157,0.00008312403,0.00022401512,0.00045354606,0.2711324,0.0030594356,0.6837076,0.039665196,0.00004199036],"about_ca_topic_score_codex":0.002223133,"about_ca_topic_score_gemma":0.002364922,"teacher_disagreement_score":0.019513942,"about_ca_system_score_codex":0.0019273886,"about_ca_system_score_gemma":0.001784348,"threshold_uncertainty_score":0.06528062},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5122069,0.00089891534,0.47871765,0.0017099438,0.00014510623,0.00016108889,0.00096494326,0.0014473769,0.0037481107],"genre_scores_gemma":[0.9704514,0.00017823627,0.027311023,0.000085279826,0.000068219895,0.00009878774,0.00041217223,0.00003568324,0.0013591602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996345,0.00013073372,0.000014788882,0.00010998369,0.000058173402,0.000051785122],"domain_scores_gemma":[0.99819213,0.0012894,0.00018198712,0.00007387702,0.00017240697,0.000090196496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012730876,0.0009403591,0.00061228784,0.0010754649,0.0003878246,0.00070700026,0.00087616744,0.00088241964,0.0016616058],"category_scores_gemma":[0.004340861,0.00033955046,0.0007982437,0.0006879167,0.00034884247,0.0010803713,0.00042691824,0.0009826162,0.00051343965],"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.0006335809,0.00036280788,0.020382082,0.00012492592,0.00018017077,0.0002884798,0.00057686545,0.852859,0.0042584585,0.0043432256,0.0038330532,0.11215736],"study_design_scores_gemma":[0.0000038848634,0.000016834249,0.0012212283,0.000003225152,0.000010772573,0.000011849209,0.000010613472,0.9967789,0.000104108454,0.0017570523,0.000076976175,0.00000463149],"about_ca_topic_score_codex":0.012031676,"about_ca_topic_score_gemma":0.009553356,"teacher_disagreement_score":0.012031676,"about_ca_system_score_codex":0.00064662716,"about_ca_system_score_gemma":0.00045834304,"threshold_uncertainty_score":0.023923278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004588605,0.00011941893,0.9942227,0.00011236017,0.00003811024,0.000025947324,0.00005398292,0.00024685252,0.00059208716],"genre_scores_gemma":[0.25084236,0.0006298978,0.7439171,0.0002129894,0.00015341635,0.00020347461,0.00063454005,0.00011306465,0.0032931468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994301,0.00013825517,0.000027992184,0.00012683208,0.00022210804,0.00005473563],"domain_scores_gemma":[0.99899846,0.00047151843,0.00010924489,0.00012944578,0.00024450928,0.000046911853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066289573,0.000921586,0.0006850407,0.0008127212,0.0005289677,0.0006591637,0.0014696389,0.0008867495,0.0015084436],"category_scores_gemma":[0.0031549702,0.00036848037,0.0004782756,0.0011880033,0.00066218164,0.0019092254,0.001183623,0.0014904084,0.0006355146],"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.00025585864,0.00012850543,0.0016874194,0.0001478279,0.00007486468,0.00012422219,0.00019351645,0.49057075,0.019452846,0.028602518,0.0064524156,0.45230922],"study_design_scores_gemma":[0.000004993279,0.000022895907,0.00010344692,0.0000044233316,0.0000040631708,0.000031417865,0.000011566181,0.9938002,0.0016574507,0.0034265672,0.000926032,0.0000069413068],"about_ca_topic_score_codex":0.0056468435,"about_ca_topic_score_gemma":0.006158138,"teacher_disagreement_score":0.0056468435,"about_ca_system_score_codex":0.00043830124,"about_ca_system_score_gemma":0.0013381726,"threshold_uncertainty_score":0.011227965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67686725,0.0013698249,0.30523264,0.0011733562,0.00011759142,0.00009524769,0.00011891186,0.00013986851,0.014885291],"genre_scores_gemma":[0.98862946,0.0003664596,0.008204822,0.00005459,0.00003081016,0.000059471,0.000025996198,0.000009271908,0.002619222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976,0.0000920819,0.000017122968,0.000049611728,0.00004389742,0.00003727882],"domain_scores_gemma":[0.99967694,0.00013620363,0.00007354891,0.000023393855,0.000044125874,0.00004580285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006333777,0.0005781477,0.0008983633,0.0009507078,0.0007352273,0.0011545203,0.0007268016,0.0014135339,0.0008901351],"category_scores_gemma":[0.0013809457,0.00036790437,0.0010086918,0.00049211364,0.0010765238,0.0011291729,0.0014866379,0.0006958453,0.00007971541],"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.00016536101,0.00010522399,0.0040479894,0.00013357632,0.0002359095,0.001653678,0.00053977023,0.693842,0.01375465,0.27599302,0.0010743451,0.008454422],"study_design_scores_gemma":[0.000016219836,0.000020554402,0.00024060218,0.0000063355174,0.000016863276,0.00006258987,0.000024188053,0.97789794,0.00026617962,0.021121088,0.00031831503,0.000009113049],"about_ca_topic_score_codex":0.003218168,"about_ca_topic_score_gemma":0.0016202596,"teacher_disagreement_score":0.003218168,"about_ca_system_score_codex":0.000664911,"about_ca_system_score_gemma":0.00041641036,"threshold_uncertainty_score":0.0063988566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053183297,0.28194448,0.42714489,0.049905628,0.11705079,0.00219306,0.006723601,0.0027229846,0.106996305],"genre_scores_gemma":[0.032190673,0.42894492,0.22965021,0.008359181,0.14858255,0.0029088454,0.017738732,0.0019804316,0.12964459],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99460477,0.001731688,0.00041381395,0.0009894507,0.0020356576,0.00022460878],"domain_scores_gemma":[0.985104,0.007925095,0.0006304181,0.0018522921,0.0033782339,0.0011100295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067293476,0.0021742212,0.002263216,0.007844294,0.0014520814,0.0049968027,0.0031654462,0.0025730846,0.03312742],"category_scores_gemma":[0.015109425,0.0006244182,0.0025494944,0.012036211,0.0019950096,0.0061459714,0.0037255632,0.004314065,0.014316688],"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.00006626775,0.00019402296,0.0012355386,0.0028098829,0.00021605268,0.00015550417,0.00039920228,0.004029169,0.001226637,0.0555618,0.38730636,0.54679954],"study_design_scores_gemma":[0.000015696192,0.00009097746,0.0021471053,0.0015989252,0.000048063663,0.0005690681,0.0003182374,0.007866179,0.0006434939,0.07915426,0.9074984,0.000049451937],"about_ca_topic_score_codex":0.0014775413,"about_ca_topic_score_gemma":0.0014975066,"teacher_disagreement_score":0.03312742,"about_ca_system_score_codex":0.002158193,"about_ca_system_score_gemma":0.004014358,"threshold_uncertainty_score":0.11082226},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17254838,0.00010353607,0.8253995,0.0003315841,0.000020555397,0.000046948993,0.00027397007,0.00019640088,0.0010792117],"genre_scores_gemma":[0.96158856,0.00014361237,0.03631116,0.000037243055,0.000020185766,0.00007933312,0.0002501665,0.00003786777,0.00153195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999099,0.00044757462,0.00003062607,0.00019772179,0.00013811818,0.00008693194],"domain_scores_gemma":[0.9930951,0.0045036855,0.0012619562,0.00044384247,0.0005083819,0.00018703144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002732844,0.00043011838,0.00056124036,0.0012150621,0.00035665394,0.00087707746,0.0014169336,0.0007877706,0.0014423185],"category_scores_gemma":[0.011400327,0.000423887,0.000621668,0.00083428493,0.000935082,0.00197099,0.00074749783,0.00104027,0.00021756702],"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.0000512509,0.000022772703,0.006645057,0.00001923992,0.00004231009,0.000047175563,0.00008299864,0.9512766,0.0012094423,0.0339462,0.00026663995,0.0063903728],"study_design_scores_gemma":[0.0000014374256,0.0000049809714,0.00035688787,0.000001123313,0.0000026387875,0.0000042054294,0.0000034326167,0.99499536,0.00008331131,0.0044706305,0.00007387438,0.0000022055635],"about_ca_topic_score_codex":0.017354103,"about_ca_topic_score_gemma":0.012264462,"teacher_disagreement_score":0.017354103,"about_ca_system_score_codex":0.0011839354,"about_ca_system_score_gemma":0.0007080508,"threshold_uncertainty_score":0.0345062},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25020584,0.0030782765,0.7237844,0.0034900527,0.00014183663,0.00005361321,0.00015270244,0.00022277505,0.01887052],"genre_scores_gemma":[0.9875814,0.0008060045,0.009942985,0.00012803818,0.00011966292,0.00004228013,0.000043958265,0.000025584739,0.0013102398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992506,0.00026188514,0.000030887975,0.00017803052,0.00018998062,0.00008856144],"domain_scores_gemma":[0.9934417,0.004327978,0.0012119169,0.0005136166,0.00028918032,0.00021557549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012855693,0.0006679339,0.00046275306,0.0011327395,0.0005953486,0.0014456861,0.00070039666,0.0012683221,0.001316302],"category_scores_gemma":[0.010018554,0.0002528891,0.0007616095,0.00065476465,0.002445369,0.0029677716,0.0013573788,0.0012332634,0.00015129159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006344912,0.000031867334,0.002147483,0.00015337237,0.0001100818,0.000506951,0.00036266557,0.26049978,0.00967396,0.7144283,0.00083256233,0.011189619],"study_design_scores_gemma":[0.000012093779,0.000054911103,0.001168979,0.00002416251,0.000028750665,0.00020386332,0.000106521584,0.40686205,0.001809943,0.5880606,0.0016401544,0.000027993154],"about_ca_topic_score_codex":0.001024753,"about_ca_topic_score_gemma":0.00042700084,"teacher_disagreement_score":0.0014456861,"about_ca_system_score_codex":0.00070045376,"about_ca_system_score_gemma":0.00029644507,"threshold_uncertainty_score":0.006798804},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61224437,0.0005435335,0.38229296,0.0005878691,0.0000634602,0.000059305552,0.0009607936,0.00040098597,0.002846752],"genre_scores_gemma":[0.9763446,0.00016415343,0.020883478,0.000072033836,0.000098085206,0.000044836757,0.00081709184,0.000029533996,0.0015462803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989641,0.00041216044,0.00004021567,0.0002750497,0.00018971218,0.000118790085],"domain_scores_gemma":[0.98986965,0.007864159,0.0007202371,0.0004887799,0.00074600003,0.00031111273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013936509,0.0005291765,0.0010460877,0.0015031176,0.00045554992,0.00091781357,0.0010811909,0.0008476707,0.0014032178],"category_scores_gemma":[0.009205638,0.0004468096,0.00071115745,0.0018887267,0.0005453398,0.0021406014,0.0011140242,0.0014275971,0.0007612348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011457301,0.0013038821,0.30547738,0.000314291,0.0007056714,0.00041094417,0.00084163685,0.3235327,0.007821502,0.023985231,0.0075829355,0.32687804],"study_design_scores_gemma":[0.0000064813466,0.00004562148,0.009939231,0.000007790963,0.00001843487,0.000032883523,0.000047887974,0.9830625,0.00030491964,0.006373629,0.00015109479,0.000009531089],"about_ca_topic_score_codex":0.0073976372,"about_ca_topic_score_gemma":0.011128187,"teacher_disagreement_score":0.0073976372,"about_ca_system_score_codex":0.0006302708,"about_ca_system_score_gemma":0.0004223148,"threshold_uncertainty_score":0.014709175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07207241,0.0067307674,0.9033697,0.0015151154,0.0003161888,0.00044617735,0.0033832064,0.0011307686,0.011035715],"genre_scores_gemma":[0.77034694,0.0063430546,0.20949592,0.00032703803,0.00061849214,0.0004534264,0.0053222254,0.00010993649,0.0069830315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768925,0.00076695665,0.00016006324,0.0006750944,0.0005487018,0.00015992792],"domain_scores_gemma":[0.99685055,0.001857964,0.00057603576,0.00027498207,0.00031663527,0.00012387642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013056594,0.00088040787,0.0007263214,0.0051310603,0.0011271535,0.002363558,0.00093041133,0.0014729194,0.0017820285],"category_scores_gemma":[0.008416893,0.0004274444,0.00076867855,0.003996015,0.0007626332,0.0042308504,0.0020379324,0.0010206943,0.0010268708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055311795,0.00031215747,0.042901907,0.0017292679,0.00050247734,0.0022628913,0.0025008768,0.13149725,0.012739339,0.18912931,0.024005635,0.59186584],"study_design_scores_gemma":[0.000026998057,0.00007948698,0.0127787255,0.00020459424,0.00012181466,0.0014172513,0.00136143,0.69065094,0.0049689407,0.2459486,0.04236142,0.000079764526],"about_ca_topic_score_codex":0.0034472437,"about_ca_topic_score_gemma":0.0021671474,"teacher_disagreement_score":0.0051310603,"about_ca_system_score_codex":0.0009723545,"about_ca_system_score_gemma":0.00053040235,"threshold_uncertainty_score":0.0070549846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011996964,0.00026264822,0.9808508,0.00026701167,0.000046957182,0.00016017392,0.00017276187,0.0027775015,0.0034651505],"genre_scores_gemma":[0.22044033,0.000422494,0.7698196,0.00022051732,0.00010753923,0.00048943155,0.0012472414,0.0006039243,0.0066489284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806505,0.0004711358,0.000099130135,0.00063616474,0.0005086727,0.00021994743],"domain_scores_gemma":[0.9973207,0.0006927142,0.0003510277,0.0010541849,0.00043597203,0.00014533004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001276995,0.0018475984,0.0017363812,0.0034511432,0.0014326744,0.0021424692,0.004154087,0.0017343921,0.004520848],"category_scores_gemma":[0.0052384865,0.00088392553,0.0015927774,0.0026808635,0.0014139593,0.0042992122,0.0025298079,0.0013775286,0.0038172293],"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.00041988425,0.00023307376,0.001468546,0.0005642158,0.00022385432,0.00015697995,0.00041321415,0.46926457,0.032714315,0.12623563,0.012768586,0.35553715],"study_design_scores_gemma":[0.00005165851,0.00010345362,0.0002441983,0.000023586503,0.000032880267,0.00010447324,0.000051294643,0.91526014,0.008320973,0.06956577,0.0062069097,0.000034707326],"about_ca_topic_score_codex":0.0028795965,"about_ca_topic_score_gemma":0.0028864022,"teacher_disagreement_score":0.004520848,"about_ca_system_score_codex":0.0022941215,"about_ca_system_score_gemma":0.0016771938,"threshold_uncertainty_score":0.016645133},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4315379,0.0029344528,0.34573707,0.033329427,0.0023862575,0.00031953357,0.002604126,0.0010230312,0.18012825],"genre_scores_gemma":[0.86316985,0.001733282,0.049755927,0.0040764855,0.001303716,0.0004054082,0.0017802826,0.0008096979,0.076965444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980375,0.00044073872,0.00010970331,0.00074878574,0.00038607867,0.00027725718],"domain_scores_gemma":[0.9852813,0.009843955,0.0011313219,0.0017230401,0.0007885068,0.001231972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013516672,0.0013129152,0.0023479604,0.0017491857,0.0031597516,0.006046903,0.0026606205,0.0048865112,0.018234424],"category_scores_gemma":[0.014985722,0.0014622436,0.0019836691,0.0022002638,0.0058629643,0.014020729,0.004483238,0.008857207,0.0019122335],"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.0002000255,0.00012136811,0.00069503393,0.0003734802,0.00009470818,0.0002686385,0.00037695045,0.013659183,0.001302227,0.95190114,0.016459895,0.0145472875],"study_design_scores_gemma":[0.000015083714,0.000009601315,0.00011364885,0.000017500548,0.000009340589,0.000081541155,0.00009928324,0.010569775,0.0001731121,0.98730904,0.0015934994,0.000008476153],"about_ca_topic_score_codex":0.0010690205,"about_ca_topic_score_gemma":0.001134612,"teacher_disagreement_score":0.018234424,"about_ca_system_score_codex":0.0012056936,"about_ca_system_score_gemma":0.0008439927,"threshold_uncertainty_score":0.061000228},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019699592,0.0005140183,0.9728793,0.0011591344,0.00010118658,0.00011937027,0.00041760667,0.0024392095,0.0026704916],"genre_scores_gemma":[0.41033655,0.0008234958,0.578653,0.0013003764,0.0002620011,0.0005850064,0.0022468253,0.0012449989,0.004547759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960998,0.0012477285,0.00018485067,0.0010212227,0.0011226616,0.00032369615],"domain_scores_gemma":[0.9529214,0.035658292,0.0022325818,0.006372347,0.0018987852,0.000916588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006055823,0.002240818,0.0018542478,0.0018639322,0.0012756694,0.0034889323,0.0034903234,0.002370512,0.004633578],"category_scores_gemma":[0.05923035,0.0013000347,0.0018507007,0.001849342,0.0028630705,0.0075932145,0.004189089,0.005986382,0.0023742917],"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.0008233566,0.00032509695,0.011126436,0.00058915274,0.00017699739,0.00032427284,0.00064689264,0.7101276,0.009037626,0.13420042,0.0150359515,0.11758622],"study_design_scores_gemma":[0.0000395189,0.000037654685,0.00039911858,0.000035561978,0.00001301764,0.000094973846,0.000055896817,0.9181432,0.0018647892,0.0778216,0.0014810555,0.000013605744],"about_ca_topic_score_codex":0.003129699,"about_ca_topic_score_gemma":0.007391198,"teacher_disagreement_score":0.006055823,"about_ca_system_score_codex":0.003498872,"about_ca_system_score_gemma":0.0032905077,"threshold_uncertainty_score":0.03202659},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22137794,0.0017473035,0.7703917,0.0011356721,0.00016609397,0.00007345878,0.00049890054,0.0014361459,0.003172834],"genre_scores_gemma":[0.96389514,0.00037802814,0.03305154,0.000111610076,0.00006388942,0.000052648917,0.0004188646,0.000043621058,0.0019846985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996623,0.0000771669,0.000021181371,0.00012872838,0.00006836211,0.00004224689],"domain_scores_gemma":[0.9986242,0.00081229146,0.00021894963,0.00009058889,0.00019573525,0.00005823739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009195712,0.0008313646,0.0008978443,0.0008204604,0.00031800894,0.0007461637,0.0011655843,0.00090018637,0.000790526],"category_scores_gemma":[0.0038595172,0.00042527748,0.0006900145,0.0006976281,0.00043852563,0.0015359846,0.00064679445,0.0012241709,0.00024874634],"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.000089913905,0.00007029245,0.0032843002,0.000052014457,0.00007694317,0.0001277297,0.00006578386,0.9446625,0.0016023454,0.004456113,0.0014590063,0.044053007],"study_design_scores_gemma":[0.0000011029401,0.000002614904,0.00008035179,9.95165e-7,0.000002455887,0.0000029408316,0.0000011753978,0.9990965,0.00008605539,0.00068656576,0.00003804425,0.0000013007478],"about_ca_topic_score_codex":0.011569912,"about_ca_topic_score_gemma":0.013604426,"teacher_disagreement_score":0.011569912,"about_ca_system_score_codex":0.0009725356,"about_ca_system_score_gemma":0.00053586863,"threshold_uncertainty_score":0.023005128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5323767,0.0028341773,0.24392845,0.016959518,0.0002793053,0.00023490128,0.0012262466,0.00040209776,0.20175862],"genre_scores_gemma":[0.9814741,0.00088560523,0.010919852,0.00021426813,0.00008054927,0.0001239999,0.00018162344,0.000049815768,0.00607023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982211,0.00083435787,0.00005731447,0.00038307818,0.00031209656,0.00019196948],"domain_scores_gemma":[0.9905178,0.0052326545,0.0018018051,0.0008833229,0.00081849244,0.00074593164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021035923,0.00029181235,0.0004864536,0.0021498685,0.0016355359,0.004964609,0.0010345052,0.0016880496,0.007586541],"category_scores_gemma":[0.020673731,0.00040297798,0.00052785635,0.0015750688,0.004020765,0.008601541,0.0024050965,0.0013363021,0.0006848361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004612307,0.000028470715,0.0062943427,0.000097693955,0.00003839215,0.00017725333,0.0024297815,0.0345093,0.0011385588,0.9362294,0.0033249664,0.015685814],"study_design_scores_gemma":[0.000032244614,0.00003852012,0.0072105387,0.000076994445,0.000024991432,0.00022545594,0.0016734478,0.107805826,0.00034351475,0.8579775,0.02453412,0.000056868223],"about_ca_topic_score_codex":0.0053098546,"about_ca_topic_score_gemma":0.003650828,"teacher_disagreement_score":0.007586541,"about_ca_system_score_codex":0.0028580667,"about_ca_system_score_gemma":0.0011106387,"threshold_uncertainty_score":0.025379479},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024274537,0.020510541,0.7794326,0.010736644,0.0026417824,0.00020507109,0.0040006894,0.0035311058,0.15466711],"genre_scores_gemma":[0.3022747,0.015585934,0.38187075,0.0023056858,0.0056250216,0.00042469223,0.010747294,0.00238056,0.27878538],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994456,0.00010214541,0.000019792236,0.00016096355,0.00022457926,0.000046901892],"domain_scores_gemma":[0.9978078,0.0013235132,0.00009671941,0.00036520883,0.00024783766,0.00015893513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008177236,0.00080514397,0.0009880193,0.0021777228,0.0008811346,0.002023683,0.0011099159,0.000955021,0.01540293],"category_scores_gemma":[0.0050553214,0.0004588733,0.0006723044,0.00421582,0.0008560103,0.0053112474,0.0019156985,0.0019906445,0.004302898],"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.00012512121,0.0000881092,0.00047791412,0.00060483295,0.00010960975,0.00008433473,0.00020622413,0.035499368,0.002115466,0.2905491,0.28082085,0.3893191],"study_design_scores_gemma":[0.000036610705,0.00003122369,0.00056261744,0.00008516751,0.000030639283,0.00012839751,0.00009240649,0.15330967,0.0010586777,0.75879997,0.08583966,0.000025098276],"about_ca_topic_score_codex":0.0020324287,"about_ca_topic_score_gemma":0.0034453785,"teacher_disagreement_score":0.01540293,"about_ca_system_score_codex":0.00095373153,"about_ca_system_score_gemma":0.00062875974,"threshold_uncertainty_score":0.051527977},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64887613,0.0008199734,0.33922693,0.0012764935,0.00008483139,0.00010660626,0.002786664,0.0018863697,0.004935962],"genre_scores_gemma":[0.96652013,0.0002572963,0.029151632,0.000065093926,0.000029329667,0.000030358133,0.0022159156,0.000027528376,0.0017027332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998348,0.000037251153,0.000008265227,0.00006133072,0.000025129784,0.00003319429],"domain_scores_gemma":[0.9993906,0.00031127784,0.000118033895,0.000063647974,0.00007535008,0.000041107076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000491381,0.00070740056,0.0003430818,0.0013382834,0.0002694049,0.0006291667,0.000704505,0.00057209295,0.0011145248],"category_scores_gemma":[0.0018009981,0.0002664446,0.000510016,0.00088296004,0.00036165005,0.0014374508,0.0006199766,0.00080050225,0.00032201104],"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.00026692796,0.00021346765,0.0218218,0.00008565584,0.00013053458,0.00019086836,0.0001297669,0.8508237,0.0021140988,0.005820038,0.0045590843,0.113844],"study_design_scores_gemma":[0.0000015949822,0.0000056006743,0.0009226377,0.0000025702082,0.0000029637301,0.000004441015,0.000009058564,0.9969199,0.00017562602,0.0018265153,0.00012776942,0.0000013821086],"about_ca_topic_score_codex":0.025524104,"about_ca_topic_score_gemma":0.03709625,"teacher_disagreement_score":0.025524104,"about_ca_system_score_codex":0.0013022288,"about_ca_system_score_gemma":0.0004077577,"threshold_uncertainty_score":0.05075109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27365512,0.0012423263,0.6994998,0.0016975113,0.00030889784,0.0001512081,0.0016547574,0.0005286224,0.021261767],"genre_scores_gemma":[0.9423928,0.00064688985,0.04785424,0.0001450083,0.00009090688,0.00015460346,0.000537793,0.000040015417,0.008137867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976474,0.00006700807,0.000013064874,0.000069803595,0.000054293723,0.0000309712],"domain_scores_gemma":[0.9996581,0.00013403539,0.00007362121,0.000041121926,0.00005424834,0.00003888025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033365138,0.00040406352,0.0006245941,0.0008132934,0.00046298452,0.00091612607,0.0015045954,0.0012495291,0.0025356468],"category_scores_gemma":[0.0013126839,0.00025679995,0.0006526455,0.00096085266,0.0008107461,0.0013114118,0.00039012847,0.00070825766,0.00030418148],"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.00007618535,0.000044044362,0.0016011115,0.00007918827,0.000038513535,0.00036945057,0.00008774501,0.8072327,0.0054675513,0.17652233,0.001413718,0.007067502],"study_design_scores_gemma":[0.0000122268975,0.000010938474,0.000251387,0.0000044198423,0.000010032024,0.000045445988,0.000009859703,0.97206706,0.00029351274,0.026457958,0.0008264428,0.00001078408],"about_ca_topic_score_codex":0.009229449,"about_ca_topic_score_gemma":0.005775727,"teacher_disagreement_score":0.009229449,"about_ca_system_score_codex":0.000890597,"about_ca_system_score_gemma":0.00085353595,"threshold_uncertainty_score":0.018351436},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072577946,0.01086645,0.28673106,0.25153527,0.0057450305,0.00035906202,0.0025995413,0.0015135525,0.36807212],"genre_scores_gemma":[0.77367324,0.011654097,0.13132411,0.017982753,0.0028261002,0.00056389207,0.001486394,0.0008146231,0.059674814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913824,0.00042004572,0.00003054146,0.00015167218,0.00016701421,0.00009249968],"domain_scores_gemma":[0.99611354,0.0029003941,0.000116291194,0.00029868,0.00031614237,0.00025495997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001997569,0.00055935356,0.00042863132,0.0013167446,0.00223764,0.003420584,0.0011914547,0.002931425,0.009141259],"category_scores_gemma":[0.010191603,0.00043699186,0.00084117544,0.00077822356,0.0037879199,0.008395811,0.0020444794,0.0044524316,0.0009886614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033385728,0.000027350225,0.0005411372,0.00008743879,0.000022435717,0.00030652527,0.0007500021,0.0105762165,0.0003540282,0.9498728,0.022380823,0.0150477765],"study_design_scores_gemma":[0.000036507416,0.000042078573,0.00051757944,0.00010158702,0.000017909317,0.00051780854,0.00068812876,0.038434286,0.00040097447,0.82609296,0.13311157,0.00003866782],"about_ca_topic_score_codex":0.004803715,"about_ca_topic_score_gemma":0.0032374875,"teacher_disagreement_score":0.009141259,"about_ca_system_score_codex":0.0021518816,"about_ca_system_score_gemma":0.0009779801,"threshold_uncertainty_score":0.03058058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892238,0.00029212644,0.0052660266,0.00013773964,0.00000712298,0.00007124736,0.0010826723,0.00003983179,0.0038794358],"genre_scores_gemma":[0.9950342,0.00009842381,0.0037657002,0.000011344496,0.0000135828805,0.00007000978,0.00071044295,0.000009387479,0.00028679793],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99734795,0.0014558024,0.00015742236,0.00027984142,0.00063037925,0.00012860121],"domain_scores_gemma":[0.9688135,0.024961898,0.0032536152,0.000864819,0.0014578708,0.000648387],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0027444346,0.00025178358,0.00036691298,0.013710786,0.0007863576,0.0021903317,0.0004229931,0.00046155305,0.002199364],"category_scores_gemma":[0.019862961,0.00015915757,0.00042984128,0.011159978,0.0012375277,0.0023410623,0.0015253694,0.00032726963,0.0002697169],"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.00064921094,0.0003293422,0.8186414,0.0015406127,0.0008193392,0.00081245386,0.06595371,0.0038645694,0.012322855,0.021225164,0.0015775774,0.0722638],"study_design_scores_gemma":[0.00002521295,0.00037117145,0.92612433,0.000121147794,0.00014772093,0.0011150099,0.04018613,0.012023088,0.0020451776,0.011504091,0.0062709358,0.00006600902],"about_ca_topic_score_codex":0.0015063658,"about_ca_topic_score_gemma":0.0019360615,"teacher_disagreement_score":0.9862892,"about_ca_system_score_codex":0.0006486399,"about_ca_system_score_gemma":0.00054149574,"threshold_uncertainty_score":0.014514148},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018865492,0.0002477244,0.97867715,0.0001640619,0.000054791,0.000070422924,0.00003992423,0.00037915428,0.001501247],"genre_scores_gemma":[0.48704317,0.0005343704,0.5060127,0.00022317849,0.00008428305,0.0003455285,0.00045914864,0.00021293719,0.0050846105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992048,0.00016574624,0.00005383251,0.0002678428,0.0002377477,0.000070005495],"domain_scores_gemma":[0.999154,0.00023994158,0.00011091829,0.000095415955,0.00033538006,0.000064352054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011687669,0.00072888035,0.0010505039,0.0013496894,0.00091823906,0.0009036474,0.0018112229,0.00092684396,0.0013044322],"category_scores_gemma":[0.0028645124,0.00035040034,0.0008526109,0.001252959,0.00072706037,0.0013698284,0.0011924703,0.0008292138,0.0003977155],"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.00011163883,0.00004921592,0.0021169372,0.00013086801,0.000114687304,0.000085430744,0.00025512817,0.7626174,0.010714977,0.024176057,0.0035361452,0.19609144],"study_design_scores_gemma":[0.000008189685,0.000019710005,0.00019742976,0.0000047414173,0.00000906915,0.000022957523,0.000020844815,0.9945958,0.0010946434,0.0030424048,0.00097310584,0.000011151478],"about_ca_topic_score_codex":0.011754124,"about_ca_topic_score_gemma":0.008009122,"teacher_disagreement_score":0.011754124,"about_ca_system_score_codex":0.0013692023,"about_ca_system_score_gemma":0.0017138126,"threshold_uncertainty_score":0.023371398},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048626396,0.00021966884,0.99243283,0.00024253683,0.000034735214,0.000047335274,0.00038301133,0.0009777175,0.00079961895],"genre_scores_gemma":[0.33901805,0.0007810329,0.64372027,0.0008182766,0.00021553382,0.00048267847,0.0051575163,0.0010779528,0.0087286625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989028,0.00040694073,0.00002786183,0.00038509746,0.00018921,0.00008808007],"domain_scores_gemma":[0.9979907,0.0011806262,0.00017394908,0.00035499086,0.00016964415,0.00013013494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001916057,0.0012499278,0.0012484739,0.0025986356,0.0009043399,0.0015747261,0.004385463,0.0023283018,0.0031498545],"category_scores_gemma":[0.006432047,0.0011176809,0.0018854135,0.0023611865,0.0017265191,0.002818883,0.0024585966,0.0026832153,0.0013394743],"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.00013547558,0.00013373581,0.0040998333,0.00018460154,0.00025306502,0.00031929245,0.0003651174,0.6619186,0.0031547663,0.15438716,0.02159581,0.15345253],"study_design_scores_gemma":[0.0000098151295,0.000008175103,0.00015222216,0.000012492475,0.000009737624,0.00005327193,0.000013877649,0.94476086,0.0003649926,0.05241569,0.0021909666,0.000007880739],"about_ca_topic_score_codex":0.011257419,"about_ca_topic_score_gemma":0.021808691,"teacher_disagreement_score":0.011257419,"about_ca_system_score_codex":0.0018326149,"about_ca_system_score_gemma":0.0014658364,"threshold_uncertainty_score":0.02238375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85912764,0.0009008324,0.12949848,0.0009326857,0.00019023403,0.0000611127,0.0001833403,0.00021952359,0.0088862395],"genre_scores_gemma":[0.99672914,0.0002511494,0.0015813404,0.00003231227,0.000015472533,0.000015971726,0.000021807911,0.0000073068327,0.0013455321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998273,0.00005517501,0.000011210113,0.000038139962,0.000027726359,0.000040436444],"domain_scores_gemma":[0.9992041,0.00034363838,0.00022690724,0.000044789987,0.000086699656,0.00009380772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046620079,0.00061324594,0.0005216246,0.0005798725,0.0003741384,0.00079336803,0.0007868449,0.00087852863,0.0014692317],"category_scores_gemma":[0.0020799243,0.00026343163,0.00056478963,0.0002857829,0.000742186,0.0012665023,0.0006219272,0.00058348477,0.00009072363],"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.00016992415,0.00006545446,0.003350584,0.00010016112,0.00008482149,0.00057203125,0.00010978109,0.95303106,0.009094569,0.029328592,0.0005764342,0.0035166384],"study_design_scores_gemma":[0.000021948572,0.000062357554,0.00043049327,0.00000655693,0.000030632298,0.000049918544,0.000033790788,0.9939626,0.00049001,0.004683293,0.000216742,0.00001164199],"about_ca_topic_score_codex":0.0048908563,"about_ca_topic_score_gemma":0.0021459698,"teacher_disagreement_score":0.0048908563,"about_ca_system_score_codex":0.0005434971,"about_ca_system_score_gemma":0.00038309707,"threshold_uncertainty_score":0.009724796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9820306,0.00035636162,0.011249788,0.00055940927,0.00004446344,0.000102271224,0.00030710126,0.000107108106,0.0052429703],"genre_scores_gemma":[0.99598545,0.00009710241,0.0029836134,0.000067125795,0.000039041748,0.00005414143,0.00012649575,0.000049111266,0.00059783115],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9899574,0.0059311534,0.0005903071,0.0014662355,0.0015426605,0.0005122803],"domain_scores_gemma":[0.6666719,0.25224337,0.04580337,0.019942101,0.007862081,0.0074772574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015615192,0.000657632,0.0006708685,0.0019565793,0.0010926432,0.0030766476,0.0005523339,0.0010705016,0.006340967],"category_scores_gemma":[0.15469,0.00060120417,0.0006863745,0.0015456798,0.0028125742,0.0032021105,0.0020572266,0.002211902,0.00095007074],"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.0011172227,0.00082003337,0.92154455,0.0003507194,0.0005622438,0.0002553114,0.0065588783,0.004252298,0.008472558,0.0059571858,0.0007771847,0.049331754],"study_design_scores_gemma":[0.000036205896,0.0006630516,0.977207,0.000063620384,0.00021603193,0.00015470514,0.0016533765,0.006913487,0.0020535132,0.009975026,0.0009864635,0.000077579636],"about_ca_topic_score_codex":0.0013571235,"about_ca_topic_score_gemma":0.0017886917,"teacher_disagreement_score":0.015615192,"about_ca_system_score_codex":0.00062682235,"about_ca_system_score_gemma":0.00046900535,"threshold_uncertainty_score":0.08258206},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012096221,0.00041699872,0.98220026,0.00046655387,0.000055350378,0.000044787612,0.000035155208,0.00006173568,0.0046229954],"genre_scores_gemma":[0.7495899,0.0011461157,0.23317683,0.00043126923,0.00020608048,0.0006068827,0.00013296424,0.00014662293,0.014563409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991578,0.00038598164,0.000029030094,0.00017687965,0.00014662188,0.00010367464],"domain_scores_gemma":[0.99848855,0.0010400207,0.0001706399,0.000049360784,0.00014304758,0.000108314314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001649399,0.0014495013,0.0016389545,0.0009760923,0.0005978454,0.0011471933,0.0016639131,0.0021419474,0.002870697],"category_scores_gemma":[0.0032003012,0.0006691336,0.0010189619,0.00067930046,0.0014736876,0.0016667378,0.0013806531,0.0013219866,0.00030870546],"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.000033971723,0.000045232886,0.0002559928,0.000106872045,0.000078819256,0.00007258263,0.00007533944,0.90887743,0.00096040656,0.081590705,0.0009392698,0.006963442],"study_design_scores_gemma":[0.0000136878725,0.000056535406,0.000047974572,0.000013009097,0.000016265698,0.000017041397,0.000016371992,0.9695301,0.0001589399,0.029568303,0.0005534944,0.000008244572],"about_ca_topic_score_codex":0.0033953036,"about_ca_topic_score_gemma":0.0020835716,"teacher_disagreement_score":0.0033953036,"about_ca_system_score_codex":0.0018894422,"about_ca_system_score_gemma":0.001663065,"threshold_uncertainty_score":0.0137088895},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16944438,0.0028592471,0.653606,0.009720893,0.0011141291,0.0023907851,0.07972846,0.025503471,0.05563262],"genre_scores_gemma":[0.5718902,0.001238266,0.38107178,0.0014271056,0.0007207305,0.0023257977,0.034939334,0.00079425966,0.0055926014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960368,0.0015181265,0.00038010027,0.00074453565,0.0011496145,0.0001708148],"domain_scores_gemma":[0.98720294,0.0070511103,0.0017355426,0.0017335394,0.0016551174,0.0006216992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004064187,0.00084970985,0.00077904196,0.010483515,0.0014020517,0.006211939,0.0011490433,0.0013317982,0.003974325],"category_scores_gemma":[0.023794966,0.00038248402,0.0009940151,0.009570571,0.00074499636,0.008144203,0.0037806428,0.001804846,0.0020251714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009873024,0.00085443456,0.07842104,0.0019953188,0.0007110292,0.0014732046,0.01119982,0.041260332,0.010560325,0.11673023,0.081854895,0.65395206],"study_design_scores_gemma":[0.00009363547,0.00017674836,0.034832478,0.000491386,0.00016830243,0.00043976202,0.0083930455,0.6076776,0.007416008,0.1864309,0.1536847,0.00019550759],"about_ca_topic_score_codex":0.005601122,"about_ca_topic_score_gemma":0.006311023,"teacher_disagreement_score":0.010483515,"about_ca_system_score_codex":0.0011943557,"about_ca_system_score_gemma":0.0011231246,"threshold_uncertainty_score":0.021493733},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01406799,0.01123309,0.029932676,0.9168086,0.0038695363,0.000068377725,0.00006602031,0.00014610233,0.02380763],"genre_scores_gemma":[0.48848316,0.015914502,0.044839304,0.40524888,0.0078454325,0.00044835132,0.00016894714,0.0011192674,0.0359322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.983913,0.010151486,0.0005704068,0.0016388447,0.0029954535,0.00073075807],"domain_scores_gemma":[0.9352863,0.05323283,0.00092193513,0.0025207743,0.005853161,0.0021849691],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.026885208,0.0006577559,0.0010083767,0.0016564731,0.0075945402,0.011121797,0.002271947,0.0069349133,0.0035400467],"category_scores_gemma":[0.07967359,0.0007904902,0.0006148589,0.0020739222,0.019700408,0.021722693,0.0063652922,0.014478221,0.00094084657],"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.00019199474,0.000119579585,0.0025551834,0.00024325457,0.00007749466,0.001592195,0.24064149,0.0012732501,0.0019253704,0.40249515,0.25294766,0.095937386],"study_design_scores_gemma":[0.000056997047,0.000066276756,0.00079254777,0.00046915538,0.000026837082,0.001085968,0.071590304,0.004697934,0.0013307474,0.12051864,0.7991761,0.00018844174],"about_ca_topic_score_codex":0.0101063885,"about_ca_topic_score_gemma":0.008292414,"teacher_disagreement_score":0.9924055,"about_ca_system_score_codex":0.00804997,"about_ca_system_score_gemma":0.0052818377,"threshold_uncertainty_score":0.14218432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004219331,0.0052605206,0.03612208,0.021042002,0.020211194,0.0007366097,0.043235976,0.03248404,0.8366883],"genre_scores_gemma":[0.016055819,0.0026651088,0.027305383,0.0037002903,0.002099965,0.00048587177,0.0558966,0.007897097,0.8838938],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971311,0.00047356804,0.00011524045,0.00047993418,0.001434614,0.00036552],"domain_scores_gemma":[0.9953577,0.00079300115,0.00017153255,0.00083330966,0.00156263,0.0012818106],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0035543412,0.001299974,0.0008203365,0.003305423,0.0022033239,0.0073618833,0.0023828626,0.0025308211,0.34881252],"category_scores_gemma":[0.009972001,0.000615427,0.0010432558,0.0024920544,0.00078201824,0.0042953296,0.0045825476,0.0026011036,0.24400926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033995442,0.00006877856,0.0005596675,0.00025793276,0.000019438181,0.00022368784,0.00012310324,0.00038289194,0.0017766209,0.02129569,0.86823124,0.10672105],"study_design_scores_gemma":[0.000016543238,0.00002123485,0.00027240344,0.000064160275,0.0000030753963,0.00007340258,0.00003828431,0.00043765194,0.00044648006,0.0032397753,0.99537486,0.000012112876],"about_ca_topic_score_codex":0.007973676,"about_ca_topic_score_gemma":0.020237604,"teacher_disagreement_score":0.34881252,"about_ca_system_score_codex":0.0027174035,"about_ca_system_score_gemma":0.003240342,"threshold_uncertainty_score":0.9288399},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3914443,0.00036283562,0.6036818,0.0006698692,0.00006710495,0.000041679603,0.0007303668,0.00088466256,0.0021174373],"genre_scores_gemma":[0.9712747,0.00012206385,0.027006537,0.000036055215,0.000032731736,0.00002420794,0.0004452469,0.000021042055,0.0010374063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974865,0.000061373474,0.000014636306,0.00009306548,0.000040845047,0.00004132679],"domain_scores_gemma":[0.9990281,0.00051291665,0.0001927503,0.000081775484,0.00012218478,0.00006237714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067299005,0.00058414944,0.0005171445,0.0010392893,0.0002824708,0.0006856981,0.00096815167,0.00051761646,0.0010238902],"category_scores_gemma":[0.0026159834,0.00028442545,0.0005608027,0.00097381,0.00036121332,0.0013819891,0.00083650067,0.0009968156,0.0002119878],"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.00018691643,0.00013947101,0.02228117,0.00005419265,0.00011029636,0.00014580421,0.00013602467,0.87470907,0.002312235,0.0075466386,0.0015775504,0.09080062],"study_design_scores_gemma":[9.88612e-7,0.000003218855,0.0005738829,0.0000013084896,0.0000023428233,0.0000025659128,0.000005956541,0.997957,0.00015326796,0.0012457098,0.000052441384,0.0000012554768],"about_ca_topic_score_codex":0.012830862,"about_ca_topic_score_gemma":0.013509005,"teacher_disagreement_score":0.012830862,"about_ca_system_score_codex":0.00088584627,"about_ca_system_score_gemma":0.0005037246,"threshold_uncertainty_score":0.025512338},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083112925,0.00035620885,0.91321105,0.00026199195,0.00005586116,0.0002006503,0.00008961595,0.00021536346,0.0024963403],"genre_scores_gemma":[0.61186695,0.00030664384,0.38438827,0.00011261565,0.000046544465,0.00045738358,0.00028185386,0.00006443684,0.0024753234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999446,0.00015357614,0.000033696007,0.00014405366,0.00014607498,0.0000766073],"domain_scores_gemma":[0.99857354,0.00080261735,0.00016897474,0.000107360385,0.00022851622,0.00011898839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010929764,0.0008010768,0.0010666847,0.0018250411,0.000908124,0.0008719014,0.0015543366,0.0010518407,0.0013835627],"category_scores_gemma":[0.0042938087,0.00038298315,0.0009892394,0.0011784581,0.0007524542,0.0012591016,0.0014172271,0.0007647663,0.00012003113],"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.00011587252,0.00013317387,0.0042532063,0.00015157775,0.00008996475,0.00017320813,0.00022844708,0.85798,0.004971046,0.018321786,0.0013985675,0.112183034],"study_design_scores_gemma":[0.0000214753,0.000043094056,0.00026188232,0.000006789103,0.000013844671,0.000040278366,0.00002656199,0.9943404,0.00056148996,0.0043518976,0.00032445465,0.000007656071],"about_ca_topic_score_codex":0.0053174864,"about_ca_topic_score_gemma":0.0037443354,"teacher_disagreement_score":0.0053174864,"about_ca_system_score_codex":0.0011178517,"about_ca_system_score_gemma":0.0011938558,"threshold_uncertainty_score":0.0105730295},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010391946,0.0007333663,0.8888374,0.00089605746,0.00043251616,0.00014919986,0.021918962,0.05605014,0.020590533],"genre_scores_gemma":[0.21573262,0.002173444,0.71834534,0.00092435704,0.0003326264,0.0007029341,0.02725593,0.005689671,0.028843073],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971694,0.00008124485,0.00002709452,0.00006033006,0.00008677087,0.000027655167],"domain_scores_gemma":[0.9990879,0.00041474035,0.00009257286,0.000146392,0.0001957537,0.00006254612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043906353,0.0013761845,0.00047803496,0.0025184974,0.0003490662,0.0021912844,0.0010345579,0.0008826871,0.037321784],"category_scores_gemma":[0.0022049702,0.00034307933,0.0007324224,0.0014179791,0.00034755396,0.001998171,0.00095585943,0.0010873274,0.0068232343],"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.0014277437,0.00037831947,0.002571194,0.0021807188,0.00020368244,0.0017219536,0.0011788056,0.08619292,0.10674697,0.2476607,0.20448992,0.3452471],"study_design_scores_gemma":[0.00018674873,0.00019476001,0.0023352245,0.00038443113,0.00017283799,0.0010713226,0.0001707138,0.31473973,0.037538752,0.14188187,0.5011337,0.000189929],"about_ca_topic_score_codex":0.001411752,"about_ca_topic_score_gemma":0.001980069,"teacher_disagreement_score":0.037321784,"about_ca_system_score_codex":0.00033389352,"about_ca_system_score_gemma":0.00046429603,"threshold_uncertainty_score":0.12485379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010351597,0.00013422804,0.98776025,0.00007649899,0.000049337417,0.000052643267,0.00013878783,0.00081746996,0.0006191451],"genre_scores_gemma":[0.2827477,0.0002868348,0.71224743,0.00016499711,0.00013964955,0.00019540483,0.0012359209,0.00036249997,0.0026196816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995951,0.00009110968,0.000028754253,0.00010234733,0.00013728385,0.000045504883],"domain_scores_gemma":[0.99862015,0.00066197116,0.0000975861,0.00024276222,0.00029306964,0.000084385465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083153177,0.0006060625,0.00070631533,0.0008714329,0.00037998884,0.00079935044,0.0016888871,0.00081750815,0.0031289493],"category_scores_gemma":[0.0063292338,0.0003641038,0.00047953855,0.0011133421,0.00045447252,0.001637394,0.0013162518,0.0008847597,0.00089975796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000662074,0.00014170243,0.00668468,0.00021200141,0.000106089035,0.00022359611,0.00023734858,0.35897887,0.0150519665,0.0344077,0.009995475,0.5732985],"study_design_scores_gemma":[0.000014225058,0.00002089031,0.00019719343,0.0000054556936,0.000004960086,0.00004357503,0.000018306231,0.9905567,0.00227617,0.0057595344,0.0010967782,0.000006169718],"about_ca_topic_score_codex":0.003997435,"about_ca_topic_score_gemma":0.005393278,"teacher_disagreement_score":0.003997435,"about_ca_system_score_codex":0.00042205944,"about_ca_system_score_gemma":0.0008241027,"threshold_uncertainty_score":0.0104673505},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069426573,0.0025722887,0.095322266,0.010765937,0.0048912535,0.0006232626,0.013306106,0.0068075815,0.8587686],"genre_scores_gemma":[0.112021185,0.003871215,0.06995794,0.011510713,0.0016660006,0.0012090622,0.026576504,0.0031284005,0.77005905],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757177,0.0004209816,0.00015203636,0.0007644745,0.0008119173,0.00027889514],"domain_scores_gemma":[0.9966307,0.0006343748,0.00020908458,0.00093547,0.0012466302,0.00034364464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001560063,0.0009991009,0.0006394644,0.0014948971,0.002609862,0.0048620133,0.0021663257,0.002341452,0.29665402],"category_scores_gemma":[0.0077209077,0.00038749218,0.0007710654,0.0019860761,0.0012995148,0.00343682,0.0037207345,0.0018665104,0.1744835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015735404,0.00010238794,0.002388041,0.00046675449,0.000032062297,0.0005254432,0.0005291301,0.0012240023,0.0026293215,0.150989,0.48915994,0.3517966],"study_design_scores_gemma":[0.000015750322,0.000027720764,0.0007773402,0.00010016446,0.0000115968805,0.00035905285,0.0001943132,0.0010433879,0.00089664693,0.026886493,0.96966994,0.00001762017],"about_ca_topic_score_codex":0.0040584104,"about_ca_topic_score_gemma":0.0064152814,"teacher_disagreement_score":0.29665402,"about_ca_system_score_codex":0.0014553498,"about_ca_system_score_gemma":0.0025649923,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025531895,0.00039930013,0.9700275,0.00031494806,0.000024220843,0.00004944559,0.000079468,0.00022844228,0.0033448043],"genre_scores_gemma":[0.6079014,0.0010128905,0.3837351,0.00028060976,0.0001222661,0.00027978662,0.00033480837,0.0002489663,0.0060842386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988607,0.0004844736,0.000038846905,0.0002628123,0.00024599736,0.000107185806],"domain_scores_gemma":[0.99725014,0.0013316405,0.00042157233,0.00037763704,0.00044076497,0.0001781932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016188549,0.00068097474,0.0007090414,0.0035780696,0.00088726415,0.0018793099,0.0012676802,0.0014504816,0.002339004],"category_scores_gemma":[0.0061371466,0.0005169748,0.00087274966,0.0021874292,0.0018242872,0.0039326176,0.0021327862,0.0011363556,0.00049992756],"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.000063593616,0.00004411189,0.0025352936,0.00018708823,0.00013031227,0.00016585503,0.00035001704,0.26206058,0.006515319,0.6547067,0.0033789328,0.06986223],"study_design_scores_gemma":[0.0000099047975,0.00003055895,0.0008550036,0.00003080394,0.000031079933,0.00017255906,0.00008227485,0.6310026,0.0015959073,0.36305457,0.0031080688,0.000026717767],"about_ca_topic_score_codex":0.0016660874,"about_ca_topic_score_gemma":0.0019600405,"teacher_disagreement_score":0.0035780696,"about_ca_system_score_codex":0.0019303518,"about_ca_system_score_gemma":0.00084502914,"threshold_uncertainty_score":0.01400578},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02970845,0.00027130154,0.9689344,0.000094220464,0.000030356885,0.000054757573,0.00006406507,0.00016136072,0.0006809744],"genre_scores_gemma":[0.7098714,0.0002862121,0.28800282,0.0000642881,0.00006517544,0.0001403117,0.00020439994,0.000059682025,0.0013057285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878055,0.00038429847,0.0000693874,0.00022702182,0.00040557102,0.00013322705],"domain_scores_gemma":[0.9961945,0.002392755,0.00037606162,0.00031793263,0.00050861796,0.00021009677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016618202,0.00042708227,0.0013560937,0.0031408423,0.000968439,0.0017450799,0.001907407,0.0010601297,0.0010681724],"category_scores_gemma":[0.008033837,0.00041984097,0.0008976198,0.0027072923,0.0010163264,0.0018640602,0.0020015656,0.00073439506,0.00020714707],"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.0005456081,0.00018664681,0.009553037,0.00030702946,0.00020861533,0.0002771889,0.0004833454,0.69658357,0.005431665,0.08730224,0.0025158855,0.19660525],"study_design_scores_gemma":[0.0000062077515,0.000009505721,0.00030773977,0.0000066616863,0.0000078239445,0.000024274357,0.00002827152,0.99221426,0.00033431558,0.0068020904,0.00025276447,0.0000061137243],"about_ca_topic_score_codex":0.00785535,"about_ca_topic_score_gemma":0.005485954,"teacher_disagreement_score":0.00785535,"about_ca_system_score_codex":0.00086072425,"about_ca_system_score_gemma":0.00088888366,"threshold_uncertainty_score":0.015619278},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004440346,0.00032176002,0.962966,0.00029807218,0.000051627674,0.0006920505,0.0027725587,0.025631215,0.0028264085],"genre_scores_gemma":[0.03257632,0.00031774395,0.95356756,0.00011418433,0.000040959887,0.00049482525,0.008753411,0.0005903528,0.0035447476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853563,0.00021851198,0.00015141701,0.00041438045,0.0005679993,0.00011202782],"domain_scores_gemma":[0.99850214,0.00042987836,0.00015501631,0.00028920095,0.00053295074,0.00009098194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017136297,0.0011280398,0.0008401886,0.0104680685,0.0013659162,0.0023701773,0.0014468404,0.0011009544,0.0044674636],"category_scores_gemma":[0.0037672708,0.00060935924,0.0016510889,0.004168791,0.0005539984,0.0029803496,0.002274721,0.0011416097,0.0031013475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025163585,0.00052537373,0.00919902,0.0010711672,0.00036952394,0.001248494,0.0012341216,0.02903368,0.027357237,0.044960782,0.052617524,0.83213145],"study_design_scores_gemma":[0.00005010949,0.00010926439,0.008666145,0.00027919473,0.00021212525,0.0015577719,0.00063151645,0.7067597,0.03042439,0.060177803,0.19095531,0.00017672214],"about_ca_topic_score_codex":0.012271831,"about_ca_topic_score_gemma":0.019684248,"teacher_disagreement_score":0.012271831,"about_ca_system_score_codex":0.0012264409,"about_ca_system_score_gemma":0.002418163,"threshold_uncertainty_score":0.02440077},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021951199,0.00032034176,0.97571826,0.00012401392,0.00007924199,0.000041872445,0.00007609604,0.0006145964,0.0010744047],"genre_scores_gemma":[0.6740848,0.00043319789,0.3220614,0.00010042893,0.00022376233,0.00015474425,0.00049162545,0.00016840492,0.002281688],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989247,0.0002164637,0.00005807314,0.00026542155,0.00043284794,0.00010250289],"domain_scores_gemma":[0.9984524,0.00043738805,0.00016024559,0.00014882172,0.0006989204,0.00010220343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019268566,0.0011151572,0.0012897673,0.0034703806,0.0009860384,0.0013958194,0.001350677,0.0011136067,0.001918938],"category_scores_gemma":[0.0044571687,0.0003219914,0.0011427723,0.0020069296,0.00046695463,0.0019458967,0.0013444825,0.00092083775,0.0005904889],"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.00026812847,0.00013302962,0.0043006935,0.000114520015,0.0002667873,0.00014279892,0.00020854878,0.3781649,0.0137654,0.0116076665,0.004659899,0.5863677],"study_design_scores_gemma":[0.0000048234883,0.000020995061,0.0005210689,0.000005429,0.000024462895,0.000025207728,0.000016162867,0.994555,0.0012589177,0.0029022857,0.000654471,0.000011197323],"about_ca_topic_score_codex":0.006478014,"about_ca_topic_score_gemma":0.0052547147,"teacher_disagreement_score":0.006478014,"about_ca_system_score_codex":0.0009969581,"about_ca_system_score_gemma":0.00090895855,"threshold_uncertainty_score":0.012880623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89061457,0.0013148696,0.082357295,0.0032806552,0.0001299425,0.000028267048,0.00018243208,0.00021237115,0.02187959],"genre_scores_gemma":[0.9980702,0.00031240698,0.00080785784,0.00004720352,0.00007787156,0.0000055183746,0.000014866086,0.000017351696,0.0006467855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918383,0.00044197982,0.000022361428,0.00011857658,0.000108911234,0.00012428898],"domain_scores_gemma":[0.94738275,0.045949988,0.00275488,0.0014915675,0.00120643,0.001214403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022021858,0.0004243303,0.00085764326,0.0015748349,0.00067015406,0.0022898582,0.00073705864,0.0011976087,0.0025057362],"category_scores_gemma":[0.03904817,0.00049683044,0.00048800945,0.0007140525,0.0019465894,0.0036798706,0.0013367662,0.0014540934,0.0002304329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000791453,0.00035916237,0.020804316,0.00044820565,0.00027614963,0.0011665206,0.0014289381,0.28190202,0.018439159,0.62625813,0.0043440606,0.043782018],"study_design_scores_gemma":[0.00007352214,0.00015246656,0.009813228,0.00005038854,0.00017394435,0.000364989,0.0002793439,0.71911955,0.0019265154,0.26674217,0.001235319,0.000068479996],"about_ca_topic_score_codex":0.0016714511,"about_ca_topic_score_gemma":0.001271815,"teacher_disagreement_score":0.0025057362,"about_ca_system_score_codex":0.00063100405,"about_ca_system_score_gemma":0.00039435094,"threshold_uncertainty_score":0.01164639},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94184107,0.00009860736,0.05370244,0.0005133506,0.000023646746,0.00020431449,0.0006882016,0.00029301053,0.0026353803],"genre_scores_gemma":[0.955706,0.00004509396,0.042810716,0.000047357542,0.000009322319,0.00004608358,0.0005324882,0.000024201896,0.0007787879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979949,0.0010192485,0.000113069065,0.0003420167,0.00040631738,0.0001245678],"domain_scores_gemma":[0.9866275,0.010907849,0.0003578719,0.00082041736,0.00086481456,0.0004214657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033347812,0.00043511947,0.00045657327,0.0014100885,0.0011357081,0.0014493115,0.0010495086,0.0019144709,0.0016723679],"category_scores_gemma":[0.011108176,0.00018041412,0.00049143465,0.0017725932,0.0005294305,0.0027533795,0.0008480832,0.000781493,0.0004839106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00397215,0.008010118,0.34423852,0.0008542486,0.0006402079,0.0065966505,0.009282992,0.21938583,0.022594148,0.018700048,0.010202645,0.35552242],"study_design_scores_gemma":[0.0000755308,0.0006332665,0.027301632,0.000035774134,0.00015544154,0.0006945557,0.003179806,0.9468628,0.006549116,0.009688257,0.004768934,0.000054891632],"about_ca_topic_score_codex":0.010167124,"about_ca_topic_score_gemma":0.01595633,"teacher_disagreement_score":0.010167124,"about_ca_system_score_codex":0.0008819149,"about_ca_system_score_gemma":0.0008641136,"threshold_uncertainty_score":0.020215869},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20417443,0.0014861353,0.74641156,0.0013009561,0.00007269233,0.000072692055,0.00017832457,0.00020438872,0.046098914],"genre_scores_gemma":[0.9580886,0.0018084198,0.03158492,0.00022465737,0.00020550568,0.00012998165,0.00013725867,0.00008945965,0.0077311606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906343,0.0002982069,0.000043957545,0.00018368085,0.00025311697,0.00015761136],"domain_scores_gemma":[0.993743,0.0045101815,0.0006031526,0.00036537068,0.00040231543,0.00037607359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014912098,0.0008006213,0.00080635067,0.0026853315,0.0011052185,0.0019094815,0.0018060369,0.0013626446,0.0042870496],"category_scores_gemma":[0.008987692,0.0004295369,0.0009436601,0.001633295,0.0035428384,0.0050250604,0.0016932293,0.0021708782,0.00036465176],"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.000027292925,0.000019087614,0.00029797605,0.00006700508,0.00002270583,0.00012650415,0.0001435707,0.052738246,0.0012649847,0.93972087,0.0004841301,0.0050877086],"study_design_scores_gemma":[0.000011281946,0.000020002792,0.00034710433,0.00001980723,0.000015374131,0.00008645258,0.000049507475,0.22180206,0.0005284745,0.7759929,0.0011103421,0.000016723097],"about_ca_topic_score_codex":0.0013754383,"about_ca_topic_score_gemma":0.0011059858,"teacher_disagreement_score":0.0042870496,"about_ca_system_score_codex":0.0016278636,"about_ca_system_score_gemma":0.00043046637,"threshold_uncertainty_score":0.014341652},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15906563,0.00017268943,0.8389591,0.0003149377,0.00003303444,0.000032642543,0.0002450419,0.00056239025,0.0006145484],"genre_scores_gemma":[0.939887,0.00013005726,0.05850369,0.000047259124,0.00006639489,0.000053885826,0.0005060179,0.000063383515,0.0007423412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984145,0.0007346931,0.00006438948,0.0003742385,0.000309514,0.00010254408],"domain_scores_gemma":[0.9836215,0.011494693,0.001901439,0.0013045332,0.0012575089,0.0004203892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002768504,0.000519368,0.000816225,0.0034014855,0.00038235588,0.0010553845,0.0015187915,0.0009361878,0.0009147967],"category_scores_gemma":[0.023432178,0.00030798023,0.0005168193,0.0019894578,0.0015419899,0.0019165175,0.001048757,0.0012835364,0.00016811136],"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.00027806955,0.00010577667,0.020576049,0.00013574417,0.0001877947,0.0003164085,0.00021514452,0.8024658,0.0055808313,0.074039385,0.0019883038,0.09411073],"study_design_scores_gemma":[0.0000028079824,0.000009555369,0.0012717566,0.0000028260838,0.0000028620786,0.000022302982,0.000011488991,0.9773676,0.0003483442,0.020787679,0.00016849942,0.0000042875167],"about_ca_topic_score_codex":0.0027697787,"about_ca_topic_score_gemma":0.0019403563,"teacher_disagreement_score":0.0034014855,"about_ca_system_score_codex":0.000916704,"about_ca_system_score_gemma":0.00046322047,"threshold_uncertainty_score":0.014641404},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012668965,0.00040405671,0.98421764,0.00030286267,0.0000514452,0.00010541062,0.00065746694,0.0009818573,0.0006102337],"genre_scores_gemma":[0.29687878,0.0006385552,0.6951627,0.00031717826,0.00023166451,0.0004205878,0.003198109,0.00022510318,0.0029272044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812335,0.00051872764,0.00013531305,0.00058968394,0.00050542085,0.00012752318],"domain_scores_gemma":[0.99417406,0.0042847875,0.0003598464,0.00056180713,0.00048150102,0.00013798749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018841065,0.0015996402,0.0019789238,0.003848396,0.0010647643,0.002208871,0.0035143844,0.0023842573,0.0013645588],"category_scores_gemma":[0.008960309,0.0010323653,0.0026432627,0.0033168036,0.00091393903,0.003203669,0.0021247074,0.002247983,0.0007069377],"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.00031545621,0.0005137803,0.009471064,0.00031789293,0.00064284337,0.00048531327,0.00028801998,0.73016196,0.005146346,0.025762489,0.008606453,0.21828839],"study_design_scores_gemma":[0.000005890042,0.000020296833,0.00017931778,0.0000064178203,0.000024746196,0.00005777769,0.000015517602,0.9866455,0.00032146092,0.012374207,0.00034210508,0.000006781453],"about_ca_topic_score_codex":0.007364619,"about_ca_topic_score_gemma":0.012150587,"teacher_disagreement_score":0.007364619,"about_ca_system_score_codex":0.0011629115,"about_ca_system_score_gemma":0.0013818634,"threshold_uncertainty_score":0.01464355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99856997,0.00011038959,0.00082672667,0.000049046834,0.0000026091898,0.000010718807,0.00014572065,0.000008385165,0.00027646017],"genre_scores_gemma":[0.9987124,0.00004843848,0.00073784566,0.0000074253135,0.0000065366444,0.000009488674,0.0003665154,0.0000033566355,0.00010797171],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988832,0.0005757123,0.00004970445,0.00022664515,0.00016811753,0.000096715754],"domain_scores_gemma":[0.98131573,0.010694419,0.004278467,0.00095245935,0.001870644,0.00088815385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002605939,0.0002905725,0.0002864409,0.001965043,0.0006590217,0.00069249416,0.00049013476,0.0005573109,0.0010858006],"category_scores_gemma":[0.017854305,0.00012742824,0.00028436093,0.0021569703,0.0005011599,0.001431203,0.00049346715,0.0006401681,0.00020366217],"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.0002540954,0.00024841315,0.9730858,0.000046396784,0.0001254358,0.00020648549,0.0010437644,0.007825875,0.0006976274,0.00073647744,0.0012302591,0.01449928],"study_design_scores_gemma":[0.000026436885,0.0002316699,0.8876138,0.000030748997,0.00008319549,0.0006153086,0.0027158812,0.1057087,0.0006081876,0.00081809016,0.0015222079,0.000025793266],"about_ca_topic_score_codex":0.017431332,"about_ca_topic_score_gemma":0.020547869,"teacher_disagreement_score":0.017431332,"about_ca_system_score_codex":0.00063317455,"about_ca_system_score_gemma":0.0002532493,"threshold_uncertainty_score":0.034659743},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10357605,0.001430662,0.8484275,0.0013054569,0.00023998033,0.00054804975,0.0065305037,0.033051904,0.004889853],"genre_scores_gemma":[0.48208222,0.00041569516,0.48934063,0.0005733306,0.00016558202,0.0004711526,0.019616771,0.0016736499,0.0056610205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974184,0.0006660841,0.00014294226,0.0006401924,0.0009301585,0.00020224173],"domain_scores_gemma":[0.99293363,0.0033542248,0.00063034415,0.0016888926,0.0010354758,0.00035751006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022267776,0.0015224607,0.0016075524,0.0035815309,0.0012614208,0.0018426032,0.0034143915,0.0022244663,0.0034927342],"category_scores_gemma":[0.019714722,0.0007994438,0.0011966992,0.0031781418,0.0009724772,0.004135633,0.0032344118,0.0016795228,0.002615027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011019274,0.0005818642,0.0393235,0.00080955913,0.0005321003,0.0008431074,0.0007877466,0.12947157,0.025211114,0.030875903,0.1594916,0.61096996],"study_design_scores_gemma":[0.00010408615,0.000078083416,0.0023051773,0.000020233883,0.00003112942,0.00034336624,0.00013039476,0.943972,0.006168036,0.039601225,0.0072154743,0.000030779196],"about_ca_topic_score_codex":0.0074709496,"about_ca_topic_score_gemma":0.013847693,"teacher_disagreement_score":0.0074709496,"about_ca_system_score_codex":0.00097094366,"about_ca_system_score_gemma":0.0011887737,"threshold_uncertainty_score":0.014854908},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013503844,0.00009943256,0.994304,0.0002640354,0.00017017307,0.000087137254,0.000100723584,0.0010574971,0.0025665634],"genre_scores_gemma":[0.0590126,0.00033331072,0.9290497,0.0003625075,0.00025284235,0.00043612806,0.0007908968,0.00038335868,0.00937868],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991596,0.00019422612,0.00006439637,0.00018922705,0.00031705623,0.000075469216],"domain_scores_gemma":[0.9982986,0.0006844327,0.000115337316,0.00029084756,0.00051672134,0.00009413648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011898379,0.0009591586,0.0008267392,0.001945441,0.00091801165,0.0019588713,0.001734786,0.002215834,0.018844271],"category_scores_gemma":[0.008378718,0.00045146857,0.0010715792,0.001967297,0.001000726,0.0021247691,0.002213378,0.0023085491,0.010576305],"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.0003352802,0.00025319407,0.0013142184,0.00031149818,0.00006948403,0.00042133284,0.00018995233,0.12555756,0.009971597,0.1689185,0.0344411,0.65821624],"study_design_scores_gemma":[0.000066078755,0.00012702757,0.00020547393,0.000048062633,0.000017075725,0.00034945892,0.00004903237,0.8761381,0.0030440262,0.10006972,0.019860102,0.000025914153],"about_ca_topic_score_codex":0.001495703,"about_ca_topic_score_gemma":0.0014598338,"teacher_disagreement_score":0.018844271,"about_ca_system_score_codex":0.00066238863,"about_ca_system_score_gemma":0.0015690476,"threshold_uncertainty_score":0.063040376},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004088557,0.0038629211,0.0054747527,0.0151802385,0.021111617,0.001301974,0.083280936,0.0037905693,0.8619085],"genre_scores_gemma":[0.020174276,0.0026274782,0.0010577831,0.0011998422,0.0035618888,0.0005491476,0.016124016,0.0006246994,0.95408094],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995171,0.000105083054,0.000020865233,0.00013434688,0.00013219897,0.000090371446],"domain_scores_gemma":[0.99751425,0.00067582744,0.000082696184,0.00037722642,0.00036040795,0.0009896371],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010158389,0.0011856067,0.0016728585,0.00093226903,0.0022495396,0.0040112627,0.0010584763,0.002246171,0.862387],"category_scores_gemma":[0.0037074923,0.000232534,0.00086466386,0.0018013451,0.00024164829,0.002181429,0.0020774445,0.0015533632,0.63703346],"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.0001801401,0.00007154395,0.000197637,0.00014786227,0.000009906713,0.00002631935,0.000027675982,0.00007684174,0.00032166194,0.0013644361,0.9653698,0.032206226],"study_design_scores_gemma":[0.000077635304,0.0000881059,0.001342215,0.00009003731,0.000016440465,0.00004688677,0.00007532792,0.00034846494,0.000315591,0.0018269483,0.9957598,0.000012550439],"about_ca_topic_score_codex":0.0016778304,"about_ca_topic_score_gemma":0.004427928,"teacher_disagreement_score":0.862387,"about_ca_system_score_codex":0.00082056684,"about_ca_system_score_gemma":0.000980536,"threshold_uncertainty_score":0.19628823},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024576378,0.00006845218,0.99639064,0.0000720849,0.000016047927,0.000044296223,0.000092612965,0.00065884116,0.00019932644],"genre_scores_gemma":[0.07048367,0.00016245613,0.9264068,0.00011606541,0.000057342626,0.00035694026,0.00065056054,0.0003208029,0.0014453435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99538714,0.0018513004,0.0002040688,0.0013011973,0.0010859367,0.00017027641],"domain_scores_gemma":[0.9903285,0.0049136584,0.0010950144,0.0017189889,0.0017313578,0.00021246457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076569533,0.0012540036,0.0012856771,0.0037163254,0.0011155434,0.0015431084,0.0031679166,0.0017878993,0.002964204],"category_scores_gemma":[0.025044749,0.0006835017,0.001516449,0.0029622572,0.0011666178,0.0026756627,0.0020037347,0.0026829191,0.0021649727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038816937,0.00030259276,0.009003283,0.0006399544,0.0005275291,0.00022740626,0.00066744495,0.31746712,0.017706754,0.060440242,0.012939776,0.57968974],"study_design_scores_gemma":[0.000027188793,0.000041611966,0.0010957716,0.000029270082,0.00002585989,0.00008526577,0.00004632898,0.9699186,0.004513799,0.020571439,0.0036017394,0.000043073167],"about_ca_topic_score_codex":0.0030882969,"about_ca_topic_score_gemma":0.003561451,"teacher_disagreement_score":0.0076569533,"about_ca_system_score_codex":0.0011550951,"about_ca_system_score_gemma":0.0021066112,"threshold_uncertainty_score":0.040494263},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88014674,0.00064683007,0.111928664,0.00024675095,0.000022974977,0.00013268401,0.002029208,0.00024057175,0.004605628],"genre_scores_gemma":[0.99193454,0.00016713794,0.006569235,0.000013544868,0.000016972132,0.000036215086,0.0010582843,0.000016071235,0.00018789743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865615,0.00040681157,0.00013715996,0.00028556513,0.00038805828,0.00012622665],"domain_scores_gemma":[0.99025214,0.004913666,0.0025348864,0.0010140537,0.0010281099,0.0002572558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025569166,0.0006793147,0.00051056175,0.0065927194,0.00045417587,0.0018151583,0.000637221,0.00055935525,0.000912033],"category_scores_gemma":[0.01673479,0.00022776148,0.0006077211,0.0030528712,0.00082436117,0.0024227109,0.001106106,0.0004507214,0.0001564844],"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.00029904072,0.00007514094,0.18978904,0.00032503865,0.00044634103,0.0003293607,0.00045319225,0.7124795,0.010432402,0.020264812,0.0010861506,0.06401997],"study_design_scores_gemma":[0.000012919209,0.00021491911,0.15473908,0.00008735187,0.00015816794,0.0003567942,0.0007331366,0.802015,0.0068205437,0.030284269,0.0044992175,0.00007850232],"about_ca_topic_score_codex":0.003793845,"about_ca_topic_score_gemma":0.0027129077,"teacher_disagreement_score":0.0065927194,"about_ca_system_score_codex":0.0012664407,"about_ca_system_score_gemma":0.0004750922,"threshold_uncertainty_score":0.013522446},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49262208,0.0024795914,0.4795149,0.0040907934,0.00046994304,0.00042017814,0.0061561014,0.0024184554,0.011827873],"genre_scores_gemma":[0.8600265,0.00033557156,0.13254595,0.00039646038,0.00007858099,0.00024144613,0.0043394514,0.00015660368,0.0018794611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981364,0.0010179183,0.000049505517,0.00037493827,0.00029379188,0.00012749323],"domain_scores_gemma":[0.9885925,0.0074896934,0.0007906193,0.0013267495,0.0013752228,0.00042520245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027894366,0.00071182474,0.0008327164,0.0018732803,0.00083848706,0.0010014123,0.0019305199,0.001968822,0.0017516252],"category_scores_gemma":[0.01468115,0.00027208275,0.00087707205,0.0014948295,0.0010050117,0.001614365,0.00092063204,0.0013883528,0.00033250407],"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.0002663773,0.00024380063,0.005664933,0.0003320264,0.00010486595,0.0002582817,0.000105457955,0.8955695,0.0023486821,0.04972765,0.015328568,0.030049898],"study_design_scores_gemma":[0.000026589283,0.000034535824,0.0004215723,0.0000097183665,0.0000058482924,0.00006739505,0.000016674652,0.9827718,0.0006941153,0.014838094,0.0011051059,0.0000085638585],"about_ca_topic_score_codex":0.006416522,"about_ca_topic_score_gemma":0.005001914,"teacher_disagreement_score":0.006416522,"about_ca_system_score_codex":0.0015222933,"about_ca_system_score_gemma":0.0007623462,"threshold_uncertainty_score":0.01475215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040153984,0.9856661,0.007907377,0.0007667316,0.0005524544,0.000015530342,0.000075972515,0.000047117417,0.004567182],"genre_scores_gemma":[0.003278753,0.99198854,0.0031816228,0.00016954653,0.00044487522,0.00002073475,0.000095554475,0.000014487106,0.0008059784],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968433,0.0000818317,0.00004343318,0.00006979992,0.00009701679,0.000023681168],"domain_scores_gemma":[0.9985897,0.001006793,0.0000888874,0.000050870396,0.00021413824,0.000049574453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085924275,0.0011254278,0.0011530366,0.0025586358,0.00043379582,0.0017862695,0.0012701518,0.0012847388,0.004665838],"category_scores_gemma":[0.0024635848,0.00054465205,0.00091836374,0.0045427876,0.0005908323,0.0027594485,0.0009075679,0.0014158504,0.001619221],"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.00004205135,0.00008737981,0.000686495,0.018978879,0.00015446234,0.00022163911,0.00018697948,0.012357075,0.00095968373,0.08519095,0.031720556,0.8494138],"study_design_scores_gemma":[0.000008770775,0.000082049926,0.00061938487,0.0071794945,0.00018493991,0.0006027347,0.00016664059,0.006864681,0.00055308087,0.039628398,0.94404507,0.000064660075],"about_ca_topic_score_codex":0.0029581336,"about_ca_topic_score_gemma":0.0028564513,"teacher_disagreement_score":0.004665838,"about_ca_system_score_codex":0.00083900255,"about_ca_system_score_gemma":0.0017023213,"threshold_uncertainty_score":0.015608847},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48586506,0.0017365022,0.47491774,0.004036253,0.0002830132,0.0004082647,0.002166321,0.00075566943,0.029831281],"genre_scores_gemma":[0.955759,0.0009247313,0.032782048,0.00017463397,0.000097455,0.00031023633,0.00050940516,0.00009268763,0.009349873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987942,0.0006136177,0.000047081387,0.0002144842,0.00015576404,0.00017496395],"domain_scores_gemma":[0.9908428,0.007077773,0.0010118249,0.00029831874,0.00044700256,0.00032239524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017161776,0.0009805093,0.00085800124,0.0016631522,0.0008367,0.001791442,0.0013485419,0.0023282187,0.0039044358],"category_scores_gemma":[0.01229024,0.0005787547,0.0010178094,0.0011555337,0.0012587953,0.0027644602,0.0016113888,0.0013522446,0.00060291984],"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.000043765347,0.000043820724,0.0036151896,0.00005562269,0.00004531785,0.0001967692,0.00026691283,0.9475964,0.00039849544,0.04220509,0.0011539736,0.0043787034],"study_design_scores_gemma":[0.0000073143874,0.000013399656,0.00033041998,0.000010705443,0.0000067149535,0.000025868796,0.00004772037,0.98713756,0.000052672887,0.01160327,0.00075830874,0.0000061345295],"about_ca_topic_score_codex":0.017233366,"about_ca_topic_score_gemma":0.011221528,"teacher_disagreement_score":0.017233366,"about_ca_system_score_codex":0.0018590312,"about_ca_system_score_gemma":0.0010720382,"threshold_uncertainty_score":0.034266114},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04128179,0.13225637,0.12518573,0.24616101,0.013595155,0.00030798095,0.0023458675,0.0012968974,0.43756923],"genre_scores_gemma":[0.3754882,0.16134204,0.10745509,0.016392773,0.008620371,0.0008379347,0.001980084,0.0019588417,0.32592475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970427,0.0016954234,0.000078537945,0.0004028147,0.00056495087,0.0002154941],"domain_scores_gemma":[0.99632806,0.0019513805,0.00022532305,0.00060351583,0.00036967164,0.00052208075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033782416,0.0007665064,0.0003552711,0.0019135408,0.0060567204,0.014889799,0.0010779912,0.0028237794,0.023762025],"category_scores_gemma":[0.008757773,0.00057234085,0.0004841565,0.0032566153,0.006338768,0.022438569,0.0091331,0.004509345,0.0076711723],"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.00006568525,0.000033076907,0.0006432267,0.00039621984,0.00001882377,0.0005880115,0.03394717,0.00084311486,0.0007344399,0.661839,0.15934259,0.14154871],"study_design_scores_gemma":[0.0000019253132,0.000013110883,0.00027643694,0.00035782385,0.0000022475986,0.00036024308,0.008312544,0.00031152216,0.0001102217,0.09991746,0.8903192,0.000017227982],"about_ca_topic_score_codex":0.0021178953,"about_ca_topic_score_gemma":0.0037116162,"teacher_disagreement_score":0.023762025,"about_ca_system_score_codex":0.003039725,"about_ca_system_score_gemma":0.0019970671,"threshold_uncertainty_score":0.07949185},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06691644,0.0012047937,0.77421474,0.002271742,0.0004828999,0.0006982746,0.044122107,0.014483221,0.09560576],"genre_scores_gemma":[0.46290532,0.0010738616,0.42134652,0.00079381804,0.00026380652,0.0006103826,0.05708098,0.0028556567,0.053069606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924374,0.000113932,0.000033251257,0.00023000439,0.00026026674,0.00011889317],"domain_scores_gemma":[0.9984156,0.000550939,0.00007820698,0.00041949318,0.00040796556,0.00012771341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000800331,0.00063699204,0.0007909566,0.002730864,0.0017362721,0.0024614152,0.0014010993,0.00086666737,0.030264871],"category_scores_gemma":[0.0059441617,0.0005068837,0.0010465797,0.0029497591,0.0004890849,0.0032308702,0.0019466201,0.0012204295,0.0072771246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000413883,0.00034211244,0.014295249,0.0012112606,0.0002464825,0.0006931838,0.0011352336,0.050132573,0.017229503,0.22284225,0.24450205,0.44695625],"study_design_scores_gemma":[0.00005147166,0.00007297084,0.007261742,0.00024503472,0.00009957452,0.0007852673,0.00070699636,0.45767936,0.015351708,0.35888445,0.15877691,0.000084503125],"about_ca_topic_score_codex":0.0054395124,"about_ca_topic_score_gemma":0.016193844,"teacher_disagreement_score":0.030264871,"about_ca_system_score_codex":0.0010800877,"about_ca_system_score_gemma":0.0011551605,"threshold_uncertainty_score":0.10124612},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88900006,0.0013696734,0.100821376,0.0012011152,0.000106337066,0.00005036736,0.0002570577,0.00007489472,0.0071192733],"genre_scores_gemma":[0.9962954,0.00018916407,0.0015466701,0.000059548493,0.00005011087,0.0000101854275,0.000056234072,0.0000070329907,0.0017857096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985442,0.0007277748,0.00005189328,0.00027897808,0.00021206477,0.00018508281],"domain_scores_gemma":[0.98351073,0.012231259,0.0017262482,0.0010322954,0.0011347948,0.00036466582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029602705,0.00036374037,0.000566191,0.0012298211,0.0005055339,0.0013924749,0.0010209812,0.0012626811,0.00250627],"category_scores_gemma":[0.030531634,0.0002632328,0.00030059688,0.00064553693,0.001965824,0.0021423164,0.00089831586,0.0009095017,0.0003934184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020493015,0.0003403316,0.16896634,0.0008729772,0.000728421,0.0018700574,0.0046331314,0.21810035,0.056258105,0.36923546,0.009324891,0.16762066],"study_design_scores_gemma":[0.00007378859,0.00022537552,0.046402343,0.00010436848,0.00014234142,0.002325011,0.0011711774,0.7009924,0.019473946,0.22255294,0.006328914,0.000207334],"about_ca_topic_score_codex":0.003425664,"about_ca_topic_score_gemma":0.0009575078,"teacher_disagreement_score":0.003425664,"about_ca_system_score_codex":0.0008437391,"about_ca_system_score_gemma":0.0002450403,"threshold_uncertainty_score":0.015655577},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28848687,0.0012607628,0.70004463,0.0008717767,0.00010237278,0.00013706872,0.0009409045,0.002232358,0.005923224],"genre_scores_gemma":[0.9571493,0.00035430363,0.03976817,0.00009984129,0.00006175012,0.000054946107,0.0008218303,0.000059964874,0.0016298821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995727,0.00009305541,0.000019274623,0.000121499725,0.00012098923,0.00007255523],"domain_scores_gemma":[0.99802893,0.0012444239,0.00022812492,0.00012573792,0.00029159346,0.00008119009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079571095,0.0010000884,0.0005670589,0.0022128557,0.00046492732,0.00077337417,0.0008426989,0.00084907084,0.00094491924],"category_scores_gemma":[0.0055574146,0.00046869027,0.0006915607,0.0012267949,0.0005870966,0.0013794407,0.0006328042,0.0009951228,0.0003274294],"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.00017447787,0.00012084345,0.018025627,0.00008602852,0.00012931443,0.00022877014,0.00010659192,0.87751913,0.0038203555,0.0073480485,0.0035942337,0.08884658],"study_design_scores_gemma":[0.0000019283827,0.0000039641277,0.00060149754,0.0000025073214,0.0000062533195,0.00001016816,0.000002497146,0.9969073,0.0006130201,0.0016965055,0.00015195235,0.000002485874],"about_ca_topic_score_codex":0.022965133,"about_ca_topic_score_gemma":0.031492725,"teacher_disagreement_score":0.022965133,"about_ca_system_score_codex":0.0014411131,"about_ca_system_score_gemma":0.00089373044,"threshold_uncertainty_score":0.04566294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008411598,0.0006047436,0.98464924,0.0014957767,0.00004993091,0.000102689075,0.00038338106,0.00014538813,0.0041572303],"genre_scores_gemma":[0.50723237,0.004183956,0.4764367,0.0014119775,0.0011239169,0.0011613121,0.0021251885,0.00011321439,0.0062113623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763477,0.0010134325,0.00009558449,0.0005187146,0.00062941184,0.000108073895],"domain_scores_gemma":[0.98830044,0.008956116,0.0009052333,0.0009430405,0.0006352215,0.0002599346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026609492,0.00097385177,0.0009602513,0.0061414354,0.0014335548,0.0024762282,0.0024262664,0.0014125798,0.0034126088],"category_scores_gemma":[0.016749438,0.00061850494,0.0016820537,0.005600532,0.0032536571,0.0068649324,0.0024811965,0.002225135,0.0011538842],"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.00003165014,0.00017465348,0.003949302,0.00040779295,0.0001764285,0.00026931576,0.0006502451,0.0492297,0.0011356386,0.88721704,0.0057696556,0.05098861],"study_design_scores_gemma":[0.000010923408,0.000042635456,0.00065479,0.000047413927,0.000043495194,0.00023118139,0.00022020536,0.2825067,0.0004042606,0.709462,0.0063518533,0.000024648722],"about_ca_topic_score_codex":0.0018423129,"about_ca_topic_score_gemma":0.0015560478,"teacher_disagreement_score":0.0061414354,"about_ca_system_score_codex":0.0013617658,"about_ca_system_score_gemma":0.0011395937,"threshold_uncertainty_score":0.014072597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111016,0.0013862198,0.86342096,0.0027207322,0.00015702864,0.00005713239,0.00044237715,0.00033046876,0.020469053],"genre_scores_gemma":[0.9149677,0.0020271654,0.039926816,0.00042809075,0.0005152495,0.00030988365,0.00049912836,0.00026526288,0.0410607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925786,0.00033618722,0.000023444203,0.00017659515,0.00012411957,0.00008172201],"domain_scores_gemma":[0.99388146,0.0039053017,0.0008207008,0.0005260435,0.0003744689,0.0004919863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018140242,0.0012753529,0.0015478154,0.001445289,0.0006947013,0.0026820377,0.0020159972,0.002022138,0.007661719],"category_scores_gemma":[0.008989064,0.0007218345,0.0013572334,0.0010022045,0.0022396808,0.004697853,0.002164767,0.002650454,0.0006285237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024097535,0.00002291817,0.00042430352,0.00005098588,0.000051390132,0.00009648937,0.00014341122,0.10173671,0.00053994864,0.8917345,0.0017636078,0.0034115603],"study_design_scores_gemma":[0.00001043147,0.000013113039,0.00015723579,0.000010429541,0.000014735865,0.000036872054,0.000026409083,0.39122167,0.00006799242,0.60746086,0.00096874457,0.0000115990315],"about_ca_topic_score_codex":0.002929146,"about_ca_topic_score_gemma":0.0032563861,"teacher_disagreement_score":0.007661719,"about_ca_system_score_codex":0.0016750739,"about_ca_system_score_gemma":0.00064857194,"threshold_uncertainty_score":0.02563107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010087696,0.0001942259,0.9861589,0.00027523993,0.000027136777,0.000120624056,0.00039106671,0.00043279896,0.0023122157],"genre_scores_gemma":[0.47351253,0.0004946836,0.5191462,0.00010036019,0.00013265396,0.0005472725,0.0010435097,0.00013347947,0.004889307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777067,0.0009894579,0.00010870349,0.00038963946,0.00060649164,0.00013505861],"domain_scores_gemma":[0.9939547,0.0037689293,0.00062855636,0.00047610412,0.0009398693,0.00023177608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035029557,0.0010452205,0.0009952494,0.0064697666,0.0010808567,0.002767522,0.00195257,0.0017510094,0.0035285435],"category_scores_gemma":[0.01252792,0.00045394927,0.0012689559,0.00366371,0.001294209,0.004992307,0.0017779904,0.0012933649,0.0007891535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014025676,0.00033522042,0.007078665,0.00026841983,0.0002463867,0.00022864879,0.0004315154,0.37640318,0.0032216294,0.47773978,0.0046536205,0.12925266],"study_design_scores_gemma":[0.000005620591,0.000019220668,0.00041533876,0.000014491486,0.000024776471,0.000024903942,0.000039785267,0.93250036,0.00033465226,0.06557012,0.0010407137,0.000010025769],"about_ca_topic_score_codex":0.008720848,"about_ca_topic_score_gemma":0.01061406,"teacher_disagreement_score":0.008720848,"about_ca_system_score_codex":0.0021754743,"about_ca_system_score_gemma":0.001987253,"threshold_uncertainty_score":0.0185256},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02561099,0.0024339042,0.94971687,0.0053978087,0.0004447191,0.000060692655,0.0009096596,0.0002234766,0.015201837],"genre_scores_gemma":[0.71030056,0.0059705437,0.2656882,0.0015992622,0.0015923545,0.0005208992,0.0012386725,0.00030119557,0.01278825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974281,0.00094567914,0.00015790823,0.00083262,0.00047168141,0.00016395352],"domain_scores_gemma":[0.98702824,0.008433128,0.0014782234,0.0017332475,0.00079400674,0.000533197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003927572,0.00063420465,0.0006962672,0.0024014749,0.0013191911,0.004127567,0.0015801964,0.0014756185,0.0055146245],"category_scores_gemma":[0.025326002,0.00063928403,0.001220733,0.0024276876,0.0043365867,0.012790109,0.0025347245,0.0032214767,0.00058737915],"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.000020012565,0.0000084511685,0.0011039664,0.000060513456,0.000025453694,0.000062226245,0.00020800976,0.013889593,0.00038685682,0.9744771,0.00086492836,0.008892765],"study_design_scores_gemma":[0.0000054002076,0.000011541347,0.0005115438,0.000028699727,0.00001597656,0.00008125043,0.00006964885,0.07935338,0.00021568978,0.911933,0.0077594644,0.000014443025],"about_ca_topic_score_codex":0.004984847,"about_ca_topic_score_gemma":0.002756744,"teacher_disagreement_score":0.0055146245,"about_ca_system_score_codex":0.0023011116,"about_ca_system_score_gemma":0.00092428876,"threshold_uncertainty_score":0.020771265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077217226,0.0004294049,0.98496765,0.00029185376,0.000039409013,0.00007586874,0.00014784504,0.00016531842,0.0061608898],"genre_scores_gemma":[0.6202383,0.0015794293,0.36470354,0.0003776563,0.0003317239,0.0005556305,0.00068852096,0.00027865358,0.011246514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807537,0.000865783,0.00007791579,0.00048369856,0.000347292,0.00014988442],"domain_scores_gemma":[0.99437225,0.004555423,0.00024744077,0.0003298759,0.00034331216,0.0001517984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025860586,0.0014630452,0.0016513782,0.0009892838,0.0006375557,0.0018562133,0.0018492249,0.0013911327,0.0051892865],"category_scores_gemma":[0.011717546,0.0006758786,0.0012648887,0.0014119591,0.001684666,0.0022749763,0.0014410409,0.001601709,0.0010673855],"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.00011005736,0.00007610811,0.0015317011,0.00036858852,0.00012832366,0.00019686794,0.00021626148,0.68780327,0.0019814454,0.22267818,0.0052661393,0.07964313],"study_design_scores_gemma":[0.000015481497,0.000027309365,0.00021934789,0.000017219725,0.000020334252,0.000053923817,0.000018386574,0.9270104,0.0007059812,0.06926904,0.0026314869,0.000011165206],"about_ca_topic_score_codex":0.0037503361,"about_ca_topic_score_gemma":0.0032995169,"teacher_disagreement_score":0.0051892865,"about_ca_system_score_codex":0.0016614738,"about_ca_system_score_gemma":0.001273557,"threshold_uncertainty_score":0.017359912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022269882,0.000079704325,0.9755499,0.00009178059,0.000020714195,0.000032957363,0.00006066356,0.00023102417,0.0016632836],"genre_scores_gemma":[0.59284294,0.00028898322,0.40400332,0.000056221106,0.000037267026,0.00024700796,0.00035506173,0.00015154284,0.0020176012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957865,0.0001482291,0.000023702343,0.000054885848,0.00015058146,0.000043953798],"domain_scores_gemma":[0.9993387,0.00033441084,0.00006811427,0.0001488364,0.00008944686,0.000020406957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061195734,0.00046461166,0.0005771426,0.0007747071,0.00045341172,0.0009392621,0.00042271861,0.0003940766,0.0014048899],"category_scores_gemma":[0.001839763,0.00023765047,0.001088302,0.0005849766,0.000512676,0.0010624405,0.0011970127,0.0010936143,0.00023583903],"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.000041896983,0.00004782035,0.0010934579,0.000085806816,0.000045472283,0.00011805383,0.00023841228,0.7972177,0.009103031,0.12592988,0.0010578942,0.0650205],"study_design_scores_gemma":[0.0000030561353,0.000011359491,0.00010670445,0.000003983413,0.0000050041494,0.0000130225535,0.000014786464,0.9710051,0.0010802018,0.026883768,0.00086969044,0.0000032781543],"about_ca_topic_score_codex":0.0024585158,"about_ca_topic_score_gemma":0.0023663805,"teacher_disagreement_score":0.0024585158,"about_ca_system_score_codex":0.0006574697,"about_ca_system_score_gemma":0.0007263439,"threshold_uncertainty_score":0.0048884153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06089442,0.00037912728,0.9328582,0.00064067333,0.00008752682,0.000062245774,0.000044519173,0.00038869493,0.0046446486],"genre_scores_gemma":[0.944303,0.00023418505,0.053367183,0.00014036805,0.000054221782,0.00013158898,0.000034212873,0.00004159295,0.0016936295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992711,0.0003308053,0.000033173397,0.00013182982,0.00015312489,0.0000800681],"domain_scores_gemma":[0.99711907,0.0016553038,0.0004714588,0.0003220443,0.00021435371,0.00021791481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014820364,0.0007804106,0.00073961494,0.00045769557,0.0007199744,0.0011216657,0.0013898199,0.001052751,0.0020837768],"category_scores_gemma":[0.0077978424,0.0005876802,0.00030711057,0.00040810576,0.0016570607,0.0025205994,0.0020681305,0.0017325,0.00039769922],"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.000086441156,0.00006192984,0.0007436186,0.000047277794,0.000023208391,0.00010218356,0.00010507921,0.9438061,0.0020044104,0.029945537,0.0006115332,0.022462703],"study_design_scores_gemma":[0.000017839095,0.00005135947,0.00009162558,0.000006623904,0.0000056083013,0.000021123524,0.000018314566,0.97373235,0.00046613012,0.025108485,0.00047433766,0.000006163662],"about_ca_topic_score_codex":0.0012676802,"about_ca_topic_score_gemma":0.0017799006,"teacher_disagreement_score":0.0020837768,"about_ca_system_score_codex":0.00077640323,"about_ca_system_score_gemma":0.00078446744,"threshold_uncertainty_score":0.007837892},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16651233,0.00059879845,0.8271355,0.00031104888,0.000076391225,0.00048076824,0.00049198867,0.001159312,0.0032337997],"genre_scores_gemma":[0.68825155,0.000313093,0.30720955,0.0001025382,0.00006693333,0.00037014237,0.0014486341,0.0001825746,0.0020549067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989624,0.00023158001,0.00004608965,0.00028187034,0.00033867403,0.00013939258],"domain_scores_gemma":[0.99758387,0.00067662075,0.00027003535,0.00021206457,0.0010681276,0.00018915851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011626995,0.00087612745,0.0009852604,0.004516153,0.0013488195,0.0011122031,0.0011301253,0.00075673097,0.0013022771],"category_scores_gemma":[0.0063016852,0.00028736322,0.0007123744,0.0025197542,0.0006408707,0.0012876672,0.001286167,0.00048406704,0.00048448643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087786024,0.0004604895,0.035094965,0.0006288157,0.00051144394,0.00046254403,0.0012614541,0.26187855,0.04611829,0.019208571,0.020005463,0.6134915],"study_design_scores_gemma":[0.00006670796,0.0000897837,0.0067460774,0.000032991393,0.00011657332,0.00022046878,0.00027936738,0.97350436,0.008785572,0.007895181,0.0022120494,0.000050815044],"about_ca_topic_score_codex":0.006342181,"about_ca_topic_score_gemma":0.008248782,"teacher_disagreement_score":0.006342181,"about_ca_system_score_codex":0.0008966424,"about_ca_system_score_gemma":0.0014800675,"threshold_uncertainty_score":0.012610495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43218204,0.0018438244,0.5357274,0.00094448734,0.00012698096,0.00066769053,0.005137264,0.0040305946,0.019339742],"genre_scores_gemma":[0.9129339,0.00073630153,0.080597095,0.00006213252,0.00012240496,0.00019411536,0.0031818193,0.00013701466,0.0020352402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848324,0.00045750587,0.00006845968,0.00029411714,0.0005909228,0.0001057047],"domain_scores_gemma":[0.994599,0.0033988801,0.00074400817,0.0003761446,0.0006691117,0.00021294306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010258778,0.0010648506,0.0006693361,0.008966401,0.0007490523,0.0021256993,0.0007823373,0.0006626959,0.001617975],"category_scores_gemma":[0.00755412,0.00032090928,0.00076896284,0.004786328,0.0006109364,0.0022405407,0.0009864391,0.0006585967,0.00074374647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007022814,0.00090510776,0.17164409,0.0012977372,0.00097485195,0.0016784465,0.0025879743,0.18916164,0.0329024,0.08379351,0.0222359,0.49211603],"study_design_scores_gemma":[0.000028276138,0.00011160885,0.030924547,0.00006130083,0.00012761455,0.0003767113,0.0011362307,0.9020984,0.008648831,0.04404786,0.012383699,0.000054805474],"about_ca_topic_score_codex":0.005006896,"about_ca_topic_score_gemma":0.0062563485,"teacher_disagreement_score":0.008966401,"about_ca_system_score_codex":0.0006366886,"about_ca_system_score_gemma":0.0005082791,"threshold_uncertainty_score":0.009955525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017247714,0.00010345745,0.97855777,0.00038009236,0.000062450425,0.00015841138,0.000037324866,0.00013111992,0.0033217156],"genre_scores_gemma":[0.8263378,0.00025041157,0.16814953,0.00019197284,0.00008514601,0.00046335332,0.00006263238,0.000041960706,0.0044171885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790466,0.00082292035,0.00010978855,0.00042534602,0.0005203599,0.00021693214],"domain_scores_gemma":[0.99763083,0.0012303015,0.0002639215,0.00023426385,0.00045826499,0.00018242921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002472636,0.0007990215,0.0009415173,0.00087913324,0.0010354231,0.0015438359,0.002098737,0.0012152165,0.0020695028],"category_scores_gemma":[0.0066449395,0.00032120466,0.0008076005,0.00094961014,0.0011839573,0.0034533348,0.0016040548,0.001440571,0.0001878327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001772661,0.0002216878,0.0014038647,0.0001853103,0.00011790385,0.00033863483,0.00038681075,0.35774454,0.0067701037,0.55037385,0.0040248544,0.07825522],"study_design_scores_gemma":[0.000044861692,0.000069089125,0.00020290435,0.000008675206,0.000018619381,0.00007923714,0.00003246448,0.8972113,0.000716531,0.099454254,0.002139197,0.000022852768],"about_ca_topic_score_codex":0.0024612315,"about_ca_topic_score_gemma":0.0013410348,"teacher_disagreement_score":0.002472636,"about_ca_system_score_codex":0.0015093395,"about_ca_system_score_gemma":0.0014020189,"threshold_uncertainty_score":0.013076723},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030043332,0.018071355,0.9209466,0.004422126,0.00057774957,0.00021739892,0.0014214772,0.0005913117,0.023708625],"genre_scores_gemma":[0.4879729,0.011991249,0.4864027,0.0010808179,0.0013668195,0.0005676171,0.0022834365,0.0003682483,0.007966241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947642,0.0018773105,0.00031931538,0.0013252774,0.001530782,0.00018305934],"domain_scores_gemma":[0.9859659,0.008805145,0.0014798295,0.0017127161,0.0016835246,0.00035289602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040112054,0.0013022195,0.0015576147,0.008575734,0.0017458235,0.0049198396,0.0019853918,0.0027889472,0.003180534],"category_scores_gemma":[0.030035894,0.0005839029,0.0010419764,0.010595399,0.005028161,0.0077288905,0.0038149618,0.0025767377,0.0011839726],"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.000056771285,0.000046043417,0.0040832493,0.0006236385,0.0002012404,0.00010205188,0.00097629795,0.08129251,0.0008993391,0.7949675,0.007239423,0.10951198],"study_design_scores_gemma":[0.000014078655,0.00004458857,0.0021218203,0.00014449262,0.000031491698,0.00027494848,0.000367697,0.07196199,0.00073144014,0.89785135,0.026400886,0.000055128465],"about_ca_topic_score_codex":0.0024937345,"about_ca_topic_score_gemma":0.0016744495,"teacher_disagreement_score":0.008575734,"about_ca_system_score_codex":0.003146914,"about_ca_system_score_gemma":0.0013002737,"threshold_uncertainty_score":0.022832572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72202766,0.0012370519,0.21445093,0.0041717826,0.00012640005,0.00030137922,0.00550835,0.000891974,0.051284548],"genre_scores_gemma":[0.9065827,0.00047589722,0.08945798,0.000066301254,0.00003628137,0.00015268679,0.0010724657,0.000065062224,0.0020905267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99867755,0.00064031663,0.00008087921,0.0001802486,0.00029768035,0.0001233823],"domain_scores_gemma":[0.9962619,0.0022831892,0.0005175426,0.0003387622,0.00038311543,0.00021538696],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.001913467,0.0003145609,0.00023016498,0.0073930556,0.0012064655,0.003048087,0.0004121615,0.0006989281,0.0025873173],"category_scores_gemma":[0.005829077,0.00017306196,0.00047313984,0.009258311,0.00093304884,0.003490126,0.0020682693,0.00062040193,0.00027264183],"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.0003125771,0.00020948482,0.2188083,0.0012226835,0.00029581125,0.0052868254,0.0567506,0.043312315,0.010895056,0.44101426,0.02240384,0.19948824],"study_design_scores_gemma":[0.000048223927,0.00015296342,0.17878033,0.0006733806,0.00021914154,0.0027072746,0.055633616,0.34538814,0.0068811653,0.25013334,0.15921825,0.00016411784],"about_ca_topic_score_codex":0.0068682684,"about_ca_topic_score_gemma":0.0084755,"teacher_disagreement_score":0.99260694,"about_ca_system_score_codex":0.0010917947,"about_ca_system_score_gemma":0.00091480673,"threshold_uncertainty_score":0.013656616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00809868,0.00095106335,0.98818874,0.00036990567,0.00010359495,0.000038091013,0.00072620367,0.0006668772,0.0008567692],"genre_scores_gemma":[0.5007126,0.0028329715,0.46114022,0.0005024865,0.0008222051,0.00070816354,0.007864756,0.0007048189,0.024711821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888116,0.00046668635,0.000053749165,0.0003102605,0.00015987453,0.00012826546],"domain_scores_gemma":[0.99556005,0.0031869994,0.00025799128,0.00046692268,0.00035575218,0.00017216831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027182966,0.0010931804,0.0017154824,0.0016259684,0.00085048104,0.0012981365,0.003358514,0.0018772305,0.005953396],"category_scores_gemma":[0.008075204,0.0008227117,0.0017292645,0.0032634623,0.00091853796,0.003642012,0.002049092,0.0031963352,0.0021304616],"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.00025691855,0.0002773945,0.0023186763,0.0002431729,0.00027561747,0.0000990675,0.00016425476,0.6765038,0.0017117976,0.082726695,0.015746472,0.2196762],"study_design_scores_gemma":[0.0000034200204,0.0000067792075,0.00007757363,0.0000060460834,0.0000072493385,0.0000074952013,0.0000055864843,0.97901845,0.00007884267,0.020358164,0.00042655534,0.0000038206613],"about_ca_topic_score_codex":0.015839383,"about_ca_topic_score_gemma":0.021728758,"teacher_disagreement_score":0.015839383,"about_ca_system_score_codex":0.0013945691,"about_ca_system_score_gemma":0.0012070017,"threshold_uncertainty_score":0.03149438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05219256,0.0010443699,0.9230124,0.0014490634,0.00007193275,0.00016780526,0.00073806086,0.00013584568,0.021187874],"genre_scores_gemma":[0.7801379,0.002272516,0.20392312,0.00013509298,0.000078252284,0.0003197064,0.0006773079,0.00008106782,0.012375096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958867,0.00021751178,0.0000111828385,0.00006060394,0.00006478798,0.000057204692],"domain_scores_gemma":[0.9990237,0.0005313602,0.00010498051,0.000027379692,0.00024990775,0.00006269473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011020676,0.0007641915,0.00039502257,0.0015028284,0.0009782047,0.0016149891,0.0011214158,0.0007981745,0.0034569025],"category_scores_gemma":[0.0029040084,0.00026529023,0.00076874957,0.0014885,0.000758666,0.0012903307,0.0013070268,0.0010932044,0.00022521161],"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.000014184227,0.00001949946,0.0016156014,0.00003737709,0.000022406744,0.00013808852,0.000121526245,0.8982218,0.000174034,0.08955236,0.0009895503,0.00909358],"study_design_scores_gemma":[0.0000024019569,0.0000074697427,0.00045046408,0.0000123717,0.000009789359,0.000017194465,0.00014902078,0.9719282,0.00004249231,0.025086412,0.0022872442,0.000006937016],"about_ca_topic_score_codex":0.21388291,"about_ca_topic_score_gemma":0.2503747,"teacher_disagreement_score":0.7861171,"about_ca_system_score_codex":0.0053316164,"about_ca_system_score_gemma":0.003145885,"threshold_uncertainty_score":0.42527598},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02386944,0.0002535863,0.9721139,0.00072530087,0.000028126131,0.00012423543,0.00031045874,0.000920679,0.001654245],"genre_scores_gemma":[0.3850158,0.00039265247,0.6088128,0.00047987953,0.0001722573,0.00034147,0.0019420197,0.00045412054,0.0023889996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99428815,0.0021269785,0.00026081305,0.0014990203,0.0014650567,0.00036008132],"domain_scores_gemma":[0.97054344,0.021586813,0.0021939436,0.0027928439,0.0021250888,0.00075780216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005057013,0.0017036581,0.0016653492,0.0026785897,0.0019387288,0.0025916412,0.0042939084,0.0024890844,0.0023162663],"category_scores_gemma":[0.03988657,0.0011835216,0.0016075921,0.002829633,0.0028998526,0.0068926597,0.0050690738,0.0036050417,0.00078348804],"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.0005511169,0.00042257673,0.006658605,0.0009412458,0.00027619264,0.0008154723,0.0010188457,0.5816375,0.010502539,0.12895173,0.01987825,0.24834594],"study_design_scores_gemma":[0.000038705628,0.000024527686,0.0003351548,0.00002699111,0.000019494326,0.000171309,0.00009741253,0.85859925,0.0021891864,0.13695928,0.0015250494,0.000013789286],"about_ca_topic_score_codex":0.0027082942,"about_ca_topic_score_gemma":0.004217348,"teacher_disagreement_score":0.005057013,"about_ca_system_score_codex":0.001603919,"about_ca_system_score_gemma":0.0019696625,"threshold_uncertainty_score":0.026744306},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029506355,0.0019532691,0.9527268,0.0070924945,0.00030855657,0.00009880427,0.00007866283,0.0001392597,0.034651477],"genre_scores_gemma":[0.33782685,0.004479053,0.63880557,0.0014009208,0.0008727539,0.0009747799,0.00022879241,0.0001564273,0.0152549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959521,0.0025595583,0.00025381616,0.00048082956,0.0006559947,0.00009768906],"domain_scores_gemma":[0.9940964,0.0039311233,0.00030278158,0.0008552031,0.00063858955,0.00017584676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006398138,0.0011186134,0.0008539931,0.002627872,0.0013887978,0.005652788,0.001348596,0.0015053994,0.011662939],"category_scores_gemma":[0.009333285,0.0004161782,0.00084786984,0.001387119,0.009521973,0.0068618017,0.003958119,0.0026411517,0.0011598002],"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.0000019816157,0.0000036185415,0.00002491803,0.000052465097,0.000003394472,0.000016964172,0.00011895383,0.002103457,0.00007379196,0.9933925,0.00041611426,0.0037917746],"study_design_scores_gemma":[0.0000047824774,0.000009326579,0.00002481887,0.000046953486,0.0000031506233,0.0000295765,0.00011822333,0.009491616,0.000117200325,0.9679672,0.022181896,0.000005271322],"about_ca_topic_score_codex":0.0008642199,"about_ca_topic_score_gemma":0.00079688977,"teacher_disagreement_score":0.011662939,"about_ca_system_score_codex":0.0032334833,"about_ca_system_score_gemma":0.0021568288,"threshold_uncertainty_score":0.039016366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011150618,0.00032761207,0.9846884,0.00025846102,0.00009033585,0.00017752926,0.0006722914,0.0010898513,0.0015448425],"genre_scores_gemma":[0.14329344,0.0003603465,0.8482532,0.00016165225,0.00028150098,0.00038082324,0.0013111384,0.00017561683,0.0057823304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967242,0.0007104042,0.00021137987,0.00084362633,0.0013473552,0.00016296329],"domain_scores_gemma":[0.9943218,0.0030414972,0.0003831794,0.0009600277,0.0010026379,0.0002907351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002078638,0.0008239147,0.0013391242,0.008168779,0.0018960139,0.002841407,0.0021458473,0.001718325,0.0035534864],"category_scores_gemma":[0.01003793,0.00058299943,0.0016125183,0.006842417,0.0008948995,0.0050408873,0.003045849,0.001899079,0.0019368986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003342373,0.0010333286,0.013921795,0.0005584345,0.00049714133,0.00043341264,0.00134331,0.02698059,0.020080592,0.11731476,0.015481183,0.80202127],"study_design_scores_gemma":[0.000043028198,0.00009371453,0.0032159442,0.000045065735,0.00011394451,0.0005599994,0.00029398658,0.8795753,0.0040372037,0.09637728,0.015587459,0.000057029905],"about_ca_topic_score_codex":0.003561301,"about_ca_topic_score_gemma":0.006768783,"teacher_disagreement_score":0.008168779,"about_ca_system_score_codex":0.0007670373,"about_ca_system_score_gemma":0.0013444748,"threshold_uncertainty_score":0.01188755},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8388956,0.0011288212,0.120973356,0.004897784,0.00017305289,0.00023627013,0.015823333,0.00042352037,0.017448287],"genre_scores_gemma":[0.9774376,0.0004618565,0.008217041,0.000096266915,0.000038093676,0.0001776177,0.0039995424,0.000033650016,0.009538313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997118,0.00010700513,0.000009158453,0.00007705137,0.000027564134,0.00006738356],"domain_scores_gemma":[0.99897265,0.0005616046,0.00015068319,0.00003686127,0.00018720591,0.00009106623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088233734,0.0007030751,0.0006158151,0.0009578965,0.00076845003,0.001103106,0.001625805,0.0012694504,0.0034835667],"category_scores_gemma":[0.0029240656,0.00044312153,0.0006953269,0.0011370936,0.00096406846,0.0007509939,0.00072546426,0.001034341,0.00031603774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.000037503287,0.000013289711,0.003232295,0.000021279551,0.000015922014,0.00007892648,0.0000710174,0.9864118,0.00014098224,0.0076543633,0.0012046074,0.0011180814],"study_design_scores_gemma":[0.000010238304,0.0000064356323,0.0015663701,0.0000066446532,0.000008130779,0.0000089063715,0.000034375735,0.99663216,0.000021262444,0.0011953255,0.00050311553,0.0000070591122],"about_ca_topic_score_codex":0.521584,"about_ca_topic_score_gemma":0.4271815,"teacher_disagreement_score":0.47841603,"about_ca_system_score_codex":0.0082493005,"about_ca_system_score_gemma":0.0026981323,"threshold_uncertainty_score":0.962467},"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":"incentives","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"incentives","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73924977,0.00049658545,0.21483618,0.0015126647,0.000065654734,0.000121343975,0.00034101136,0.00018213352,0.043194577],"genre_scores_gemma":[0.9881224,0.00009053996,0.0075351815,0.000028156914,0.000016952921,0.000049160084,0.00006235623,0.000018481469,0.004076768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9967865,0.0015555223,0.00015084087,0.00063644437,0.00043796696,0.00043272704],"domain_scores_gemma":[0.9547792,0.030677333,0.0042482177,0.004551941,0.0030246794,0.0027185755],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.007915727,0.00029972778,0.00077592244,0.0015278014,0.0015963811,0.0031286043,0.0013592344,0.0018436786,0.009469598],"category_scores_gemma":[0.04693188,0.00064549234,0.0005860207,0.0011964092,0.0021519463,0.008579529,0.0041639498,0.0018296839,0.0013889062],"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.0004917713,0.00028922292,0.047879446,0.00028505086,0.00012813105,0.0005868064,0.0049952753,0.024909208,0.0034292578,0.8629923,0.0025263259,0.051487256],"study_design_scores_gemma":[0.000044752276,0.00022128024,0.019291133,0.00009746145,0.000075434,0.00043591595,0.0035645722,0.08804244,0.0014746186,0.8800126,0.006664644,0.00007529845],"about_ca_topic_score_codex":0.0013540204,"about_ca_topic_score_gemma":0.0019933148,"teacher_disagreement_score":0.9984722,"about_ca_system_score_codex":0.0010768125,"about_ca_system_score_gemma":0.0016592289,"threshold_uncertainty_score":0.041862845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030329505,0.00061511894,0.96511024,0.00055302447,0.00004701113,0.00005553589,0.00029471115,0.00036784026,0.0026269348],"genre_scores_gemma":[0.7944748,0.0018143741,0.19454838,0.00035281858,0.00019884921,0.0002729016,0.0010836375,0.00017171177,0.0070825103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993926,0.0001965202,0.000023803777,0.00010798179,0.00020840988,0.000070667695],"domain_scores_gemma":[0.997766,0.0012747898,0.0002630057,0.00040863865,0.00020756945,0.00008001225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010053215,0.0005422059,0.00065414276,0.0007542015,0.0003264252,0.00068378286,0.0011609072,0.00069724093,0.001789091],"category_scores_gemma":[0.0053795595,0.0002530941,0.00043200384,0.0011963996,0.0009159921,0.0020909172,0.00094000384,0.001132932,0.00041340492],"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.00017236244,0.00007324907,0.0007402524,0.00011713175,0.000035675264,0.00014293983,0.00011559844,0.6883071,0.00657085,0.23062189,0.0037531792,0.06934974],"study_design_scores_gemma":[0.0000053556287,0.000016622966,0.0000814997,0.000005055272,0.000003817037,0.00002355789,0.000006914431,0.9747785,0.0011185709,0.023316871,0.00063867465,0.0000045916936],"about_ca_topic_score_codex":0.0034124546,"about_ca_topic_score_gemma":0.0031222666,"teacher_disagreement_score":0.0034124546,"about_ca_system_score_codex":0.0010203088,"about_ca_system_score_gemma":0.0008081556,"threshold_uncertainty_score":0.007402897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064000096,0.0002931927,0.9835264,0.00008567006,0.000076993165,0.000112083384,0.0010339287,0.007575838,0.0008959093],"genre_scores_gemma":[0.0767623,0.00027205775,0.90823764,0.00015197645,0.00013555496,0.00033285722,0.0082094995,0.0011874055,0.0047106696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972018,0.000534133,0.0001602986,0.0010957727,0.0008132347,0.00019482836],"domain_scores_gemma":[0.9963044,0.0011652504,0.00027598394,0.0012700141,0.00077192765,0.00021247518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001721518,0.0023713016,0.0025536788,0.0050750603,0.001317003,0.0025329262,0.0052479724,0.002726004,0.006568772],"category_scores_gemma":[0.0068141925,0.001091398,0.0021703772,0.005756747,0.0010687124,0.006360812,0.0045897686,0.003033458,0.0043612514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036854082,0.00046290972,0.0019211372,0.0002930559,0.00032044278,0.00016025033,0.00010383667,0.07613652,0.020773847,0.01899148,0.02948689,0.85098106],"study_design_scores_gemma":[0.000037669695,0.00009382574,0.00074214453,0.000024077654,0.0000521746,0.0002094625,0.00006272379,0.9486786,0.0061499905,0.039024297,0.0048885574,0.000036422596],"about_ca_topic_score_codex":0.0077136597,"about_ca_topic_score_gemma":0.018516388,"teacher_disagreement_score":0.0077136597,"about_ca_system_score_codex":0.0011548899,"about_ca_system_score_gemma":0.0017516162,"threshold_uncertainty_score":0.021974683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14625102,0.0002987844,0.8489968,0.00077776355,0.000073885305,0.000063040585,0.00052367727,0.00035493946,0.0026600868],"genre_scores_gemma":[0.83667815,0.00058489386,0.16005139,0.00031507373,0.00011831727,0.00011729603,0.0007468161,0.00015084438,0.0012372193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979121,0.00071069016,0.000110986635,0.00062069844,0.0005310867,0.00011451246],"domain_scores_gemma":[0.98489296,0.009824659,0.0016100949,0.002616981,0.00083901634,0.0002163249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031423727,0.00045784112,0.0008281115,0.0014074723,0.0004635438,0.0018980533,0.00095764827,0.0011732331,0.0014720766],"category_scores_gemma":[0.021962984,0.0005591825,0.00052866153,0.0016235489,0.0021938372,0.0030678776,0.0011116486,0.0019200048,0.00036092725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002392976,0.0001593932,0.026200686,0.000532839,0.00033979633,0.0011181164,0.0017386293,0.38351235,0.047280792,0.39651373,0.0048333937,0.13753106],"study_design_scores_gemma":[0.000013367025,0.000059418773,0.008031061,0.00005093668,0.00003517603,0.00041395373,0.00026273032,0.66942245,0.0076876935,0.30966368,0.004310222,0.000049180144],"about_ca_topic_score_codex":0.00088016375,"about_ca_topic_score_gemma":0.0009999146,"teacher_disagreement_score":0.0031423727,"about_ca_system_score_codex":0.00081899384,"about_ca_system_score_gemma":0.00042334912,"threshold_uncertainty_score":0.016618669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8693141,0.00050217815,0.1241475,0.00093798194,0.000047424604,0.00015728846,0.0006378973,0.00011695801,0.004138728],"genre_scores_gemma":[0.99543226,0.00015474073,0.0031951761,0.000034260494,0.000012187515,0.000044906807,0.00020366782,0.0000053992308,0.0009173556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99966466,0.000067641704,0.000017269283,0.000092440445,0.00006637428,0.00009161179],"domain_scores_gemma":[0.99775416,0.0011676472,0.00048549473,0.00010592682,0.00035895666,0.00012778297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00148763,0.0007459675,0.00035040168,0.0010235172,0.00047499483,0.0008732108,0.0010926708,0.0008790361,0.0010127067],"category_scores_gemma":[0.0047822795,0.0002466673,0.0006022109,0.00057987473,0.0007687858,0.0021121264,0.00089851103,0.0006317388,0.000107320295],"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.000094462994,0.00009464414,0.06789662,0.00020404765,0.0000872952,0.0004976946,0.0007090889,0.878733,0.00550961,0.03141484,0.0016126873,0.013146044],"study_design_scores_gemma":[0.0000036057627,0.000032938555,0.0043418086,0.0000072628104,0.000021982902,0.000038908907,0.000101659345,0.99195015,0.00047651413,0.0027758905,0.00023700793,0.00001241803],"about_ca_topic_score_codex":0.041189488,"about_ca_topic_score_gemma":0.015426842,"teacher_disagreement_score":0.041189488,"about_ca_system_score_codex":0.0021596958,"about_ca_system_score_gemma":0.0015524419,"threshold_uncertainty_score":0.081899464},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013873009,0.003020484,0.9649635,0.004266487,0.00015645761,0.000106861015,0.0004098971,0.00037267723,0.0128306],"genre_scores_gemma":[0.48927477,0.0047148047,0.47498706,0.0019555092,0.0011141885,0.0010489855,0.0017221508,0.00060062524,0.024582013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995852,0.0021582288,0.00011239885,0.0009144461,0.0006092378,0.00035371562],"domain_scores_gemma":[0.976867,0.019769456,0.0013466993,0.0005826008,0.0009990208,0.0004352527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004200407,0.0016530905,0.001676268,0.0016356036,0.0010661692,0.0031142668,0.0019731582,0.0022955767,0.0060959207],"category_scores_gemma":[0.02044019,0.00094226317,0.0013283854,0.002754477,0.002859721,0.003991649,0.002670781,0.005301724,0.0010260161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015258121,0.00020823312,0.0010399659,0.000558112,0.00019208826,0.00013903093,0.00025366247,0.42650843,0.0007845838,0.49496305,0.012595559,0.06260471],"study_design_scores_gemma":[0.000023115737,0.000029102805,0.00014418377,0.000034691468,0.000011577278,0.00003419071,0.000037971226,0.5784579,0.00023045004,0.41852805,0.0024550834,0.000013820119],"about_ca_topic_score_codex":0.0038997778,"about_ca_topic_score_gemma":0.0027828151,"teacher_disagreement_score":0.0060959207,"about_ca_system_score_codex":0.0033854367,"about_ca_system_score_gemma":0.0020989298,"threshold_uncertainty_score":0.024563193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15515973,0.00052728417,0.83616793,0.00042846773,0.00006860964,0.0001471837,0.0003048243,0.001479047,0.0057169497],"genre_scores_gemma":[0.8731025,0.00024910376,0.12375941,0.00009378569,0.000047106536,0.00014447671,0.00048677492,0.0001236251,0.0019932843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957615,0.00013333216,0.00001333064,0.00011501044,0.00009379952,0.00006839293],"domain_scores_gemma":[0.99736834,0.0014355589,0.00049927155,0.00017705592,0.00036272133,0.0001570838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012983531,0.00086665584,0.00073844753,0.001874743,0.00055235147,0.0010899995,0.0011486186,0.0007816245,0.0018981628],"category_scores_gemma":[0.006393002,0.0004589989,0.00045334708,0.0005868168,0.0005038485,0.0018193205,0.0013821068,0.0008326303,0.00046648105],"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.00037899186,0.0002408835,0.018610863,0.00032515134,0.00013735316,0.0002815765,0.0004184864,0.7634044,0.015761338,0.030611165,0.00700051,0.16282924],"study_design_scores_gemma":[0.000010147581,0.000029692976,0.0010771534,0.000011926901,0.000016221682,0.000037282145,0.00006240732,0.9886567,0.001914815,0.007337248,0.00083788886,0.000008449023],"about_ca_topic_score_codex":0.0045368294,"about_ca_topic_score_gemma":0.00445403,"teacher_disagreement_score":0.0045368294,"about_ca_system_score_codex":0.00080099975,"about_ca_system_score_gemma":0.0011384918,"threshold_uncertainty_score":0.009020865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26751095,0.00078944664,0.7259292,0.0016455646,0.000055902125,0.000025921196,0.00020588643,0.000260585,0.0035765606],"genre_scores_gemma":[0.9792102,0.00036937417,0.018613309,0.00007169084,0.0000322742,0.000024606901,0.000106122985,0.00002695875,0.0015455566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997718,0.00010620907,0.000009208215,0.000048000682,0.000036978396,0.000027859302],"domain_scores_gemma":[0.9979607,0.0014806611,0.00022651901,0.00009888486,0.00013841363,0.000094916606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011091887,0.00047404427,0.00053133693,0.0006285599,0.00028548855,0.00097144843,0.0008484247,0.0007984993,0.0014194997],"category_scores_gemma":[0.005999514,0.0004086609,0.00037085067,0.00044508153,0.0013127151,0.001930698,0.00096214423,0.0015918381,0.0001240452],"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.00001953356,0.000013476287,0.0012598485,0.00003033252,0.00002609187,0.00003686368,0.000051110546,0.94087964,0.0006843259,0.05137039,0.000380718,0.0052476944],"study_design_scores_gemma":[7.3617474e-7,0.0000014624048,0.00006367946,0.0000019079157,8.3595614e-7,0.0000013771327,0.0000019058626,0.9877215,0.000046806843,0.012114968,0.000043910237,9.523994e-7],"about_ca_topic_score_codex":0.0067198565,"about_ca_topic_score_gemma":0.005718091,"teacher_disagreement_score":0.0067198565,"about_ca_system_score_codex":0.0012474712,"about_ca_system_score_gemma":0.0005194155,"threshold_uncertainty_score":0.013361514},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066824374,0.79648775,0.009725374,0.107388034,0.056054935,0.00003553576,0.0002371353,0.00015618998,0.029246856],"genre_scores_gemma":[0.0214683,0.71763647,0.0051514264,0.030542893,0.17671376,0.00022414685,0.00055280625,0.00026393656,0.04744619],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991592,0.0002292662,0.000045505778,0.00022242997,0.00026987898,0.000073639436],"domain_scores_gemma":[0.99627626,0.0024410011,0.000121654666,0.00018303274,0.00060316623,0.00037492826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002526232,0.001192826,0.0014464023,0.002210771,0.0010103784,0.0046096705,0.0012592768,0.003870985,0.023111815],"category_scores_gemma":[0.006046484,0.00045340002,0.0006657467,0.0019778889,0.002265252,0.005841348,0.0028605722,0.007520572,0.010577229],"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.00007520111,0.000060419454,0.00030654337,0.0019286252,0.00009234012,0.00015783774,0.0003089715,0.0016496822,0.00041524472,0.1464272,0.6363493,0.2122286],"study_design_scores_gemma":[0.000013841078,0.00002423659,0.00033968795,0.001125854,0.000017465287,0.00020882359,0.000120543235,0.00045336233,0.00012496939,0.09807431,0.8994739,0.000023100705],"about_ca_topic_score_codex":0.0006545625,"about_ca_topic_score_gemma":0.00052682473,"teacher_disagreement_score":0.023111815,"about_ca_system_score_codex":0.0020630762,"about_ca_system_score_gemma":0.0009233271,"threshold_uncertainty_score":0.07731676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03498616,0.0002744349,0.96198386,0.0004888971,0.000033653643,0.00009023109,0.000052203774,0.00046210413,0.0016284032],"genre_scores_gemma":[0.8330413,0.00026795335,0.16394691,0.00037504715,0.00007673515,0.00031185063,0.00017707172,0.00015474664,0.0016483476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989741,0.0005384372,0.0000368087,0.00021840415,0.00013857413,0.00009371291],"domain_scores_gemma":[0.9919275,0.006571965,0.00047794505,0.00041431474,0.00034663128,0.0002616423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027915437,0.0009793339,0.0012657257,0.0008391968,0.00051028054,0.00085402414,0.0017325677,0.0013289833,0.001350659],"category_scores_gemma":[0.016597442,0.00057119865,0.000564752,0.0005563479,0.0017521007,0.0018392745,0.0011884935,0.0017829619,0.00040171613],"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.00009867747,0.00007955634,0.0019606296,0.00007848976,0.000042200267,0.000063999185,0.00015076436,0.9451282,0.0011770157,0.015064091,0.0012759679,0.034880493],"study_design_scores_gemma":[0.00001056266,0.0000124587505,0.000061300736,0.0000055468945,0.0000031490474,0.0000066517996,0.000007724786,0.9931692,0.00024641605,0.00630823,0.00016630642,0.000002347713],"about_ca_topic_score_codex":0.0042806063,"about_ca_topic_score_gemma":0.0051882435,"teacher_disagreement_score":0.0042806063,"about_ca_system_score_codex":0.0014545656,"about_ca_system_score_gemma":0.0013809996,"threshold_uncertainty_score":0.014763236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21190785,0.005989849,0.65760106,0.032307085,0.0013532896,0.00052061584,0.0066982955,0.0028030428,0.08081897],"genre_scores_gemma":[0.7572981,0.003961702,0.17946742,0.0037337774,0.0019192684,0.0010629109,0.005753895,0.0014940879,0.045308735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566454,0.0012715125,0.00021527607,0.0011244544,0.00096511794,0.0007591049],"domain_scores_gemma":[0.96940595,0.023436768,0.0013703099,0.003591587,0.00092626875,0.0012691504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004168465,0.002362,0.0040005744,0.0017657786,0.003100789,0.0068959147,0.008051115,0.0048940065,0.022939805],"category_scores_gemma":[0.030182399,0.0014943598,0.0032774033,0.004019602,0.0047356924,0.021407329,0.007158541,0.012092596,0.0028876157],"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.0023904585,0.00074408005,0.0040648216,0.0018204147,0.00035896344,0.00044383766,0.0010096334,0.19208391,0.0032237002,0.65008914,0.062264666,0.081506394],"study_design_scores_gemma":[0.00013975265,0.00005570317,0.00050648017,0.00007777724,0.00005989743,0.00021099365,0.00016291905,0.16750443,0.00073498784,0.82647043,0.004047222,0.00002941213],"about_ca_topic_score_codex":0.0031708782,"about_ca_topic_score_gemma":0.0027116886,"teacher_disagreement_score":0.022939805,"about_ca_system_score_codex":0.004027318,"about_ca_system_score_gemma":0.0030976112,"threshold_uncertainty_score":0.07674128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020473955,0.00027738628,0.9732404,0.00026651463,0.00008643737,0.00012754068,0.000121704354,0.002379389,0.0030267101],"genre_scores_gemma":[0.22390836,0.00017149432,0.7715995,0.00023513191,0.000081213155,0.00036091142,0.0005288521,0.00065253844,0.0024619028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999041,0.00026735003,0.000042968375,0.00022841136,0.0002789503,0.00014131889],"domain_scores_gemma":[0.99689037,0.0019344775,0.0001933947,0.00046872476,0.0003535614,0.00015959394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012076838,0.0012301151,0.0013371641,0.0011016106,0.0007953471,0.0013746165,0.0020614336,0.001473228,0.0032305385],"category_scores_gemma":[0.007056221,0.0005859154,0.0012209202,0.0012488401,0.0010971355,0.0015633553,0.0016225182,0.0013091206,0.000951931],"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.00023808294,0.00019564884,0.0018242733,0.00021835888,0.00010456661,0.00017175854,0.00019001604,0.72780997,0.007788258,0.03758642,0.01335468,0.21051799],"study_design_scores_gemma":[0.00004162744,0.000020675407,0.00007586566,0.0000068854124,0.0000075743587,0.000028389317,0.000010139421,0.98916733,0.0011216368,0.008303878,0.0012100888,0.000005822013],"about_ca_topic_score_codex":0.0063637816,"about_ca_topic_score_gemma":0.008314831,"teacher_disagreement_score":0.0063637816,"about_ca_system_score_codex":0.0016674822,"about_ca_system_score_gemma":0.0028809125,"threshold_uncertainty_score":0.01265347},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3292141,0.00089921517,0.66640186,0.00017923827,0.00006655862,0.00015938636,0.00033037955,0.0006066138,0.0021425914],"genre_scores_gemma":[0.86332583,0.0002354977,0.13439396,0.00003318148,0.00007229002,0.00008291032,0.00046367012,0.000044982913,0.0013478303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985232,0.00032076385,0.00009246566,0.00044088927,0.00047720803,0.00014547251],"domain_scores_gemma":[0.9956463,0.0028173071,0.0004526713,0.00034334708,0.00049415673,0.00024626925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013843859,0.0005645189,0.0011631958,0.0038406407,0.0010194179,0.0014662797,0.0016559378,0.0014631114,0.0006577461],"category_scores_gemma":[0.007125695,0.00045650493,0.00070901704,0.0026437202,0.00084070023,0.0024823474,0.0019625542,0.0006547363,0.0002840133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016582238,0.0008094596,0.0635801,0.0006783636,0.0005080907,0.0011228079,0.0012531311,0.3551742,0.0463447,0.026597643,0.004717542,0.4975557],"study_design_scores_gemma":[0.000018464818,0.000063967265,0.0035684349,0.000015522062,0.000035191137,0.00021652416,0.00018569053,0.9792804,0.0030699451,0.0130119715,0.0005186861,0.0000152002785],"about_ca_topic_score_codex":0.003239247,"about_ca_topic_score_gemma":0.0041827187,"teacher_disagreement_score":0.0038406407,"about_ca_system_score_codex":0.00074069545,"about_ca_system_score_gemma":0.000477263,"threshold_uncertainty_score":0.007321477},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69081265,0.0026205936,0.2817156,0.0029652822,0.0001389293,0.0000592496,0.00023036244,0.00038074038,0.021076545],"genre_scores_gemma":[0.9916614,0.00055608724,0.0047106626,0.00014525907,0.00005940807,0.000035566012,0.000058223748,0.00003224793,0.0027410612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966216,0.00012029739,0.000014717408,0.00006654454,0.000044759014,0.000091439695],"domain_scores_gemma":[0.9938269,0.0037615632,0.001148961,0.00033124903,0.00034148543,0.000589821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009372101,0.00043647853,0.00076420605,0.0012144927,0.00083784206,0.0014695527,0.00089539547,0.0015500394,0.0031746693],"category_scores_gemma":[0.008943853,0.0004413383,0.00064803194,0.0004945829,0.0027601712,0.0025269133,0.0013000334,0.0010166643,0.00030480474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020666551,0.00009634419,0.004284276,0.00019320757,0.000076759636,0.00041502813,0.00034643698,0.4102315,0.010590421,0.5597495,0.002881766,0.010928183],"study_design_scores_gemma":[0.00004637413,0.000044322853,0.0020000553,0.000024670371,0.000023119665,0.00011686094,0.00007135927,0.6273733,0.0010125217,0.36869764,0.0005620008,0.000027813216],"about_ca_topic_score_codex":0.004090711,"about_ca_topic_score_gemma":0.003387012,"teacher_disagreement_score":0.004090711,"about_ca_system_score_codex":0.0013425914,"about_ca_system_score_gemma":0.00060672505,"threshold_uncertainty_score":0.010620296},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06803502,0.0018734331,0.9231253,0.0008518716,0.00006954399,0.00016029712,0.0021298132,0.0020337729,0.0017209684],"genre_scores_gemma":[0.73592126,0.0018392361,0.24795502,0.00029801336,0.00028653053,0.00017761368,0.005533916,0.00045973624,0.0075287344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972365,0.0008453807,0.00022656973,0.0006501672,0.0007953383,0.00024607283],"domain_scores_gemma":[0.9788225,0.01590914,0.001738935,0.0020507334,0.0011082307,0.00037038256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027634508,0.0010738841,0.0025225384,0.006952778,0.0011129391,0.0027996474,0.0027502691,0.0016379171,0.0024889174],"category_scores_gemma":[0.02370071,0.0010587359,0.001241565,0.00818918,0.001159131,0.0065806694,0.0022413458,0.0014551877,0.0010745595],"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.0007120758,0.00046025307,0.0049116304,0.0010836448,0.000355848,0.0004036022,0.00031761444,0.66459906,0.009484603,0.046196323,0.012949669,0.2585257],"study_design_scores_gemma":[0.00001898809,0.000023320183,0.00035831556,0.000013472022,0.000038509617,0.000050024475,0.00005216168,0.9507022,0.0014920513,0.046422567,0.00081772014,0.000010701162],"about_ca_topic_score_codex":0.012695221,"about_ca_topic_score_gemma":0.014777907,"teacher_disagreement_score":0.012695221,"about_ca_system_score_codex":0.0019812824,"about_ca_system_score_gemma":0.0019665156,"threshold_uncertainty_score":0.025242686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.337841,0.00065336813,0.6466832,0.0016825377,0.000121587495,0.0004288313,0.0014238871,0.00194238,0.009223226],"genre_scores_gemma":[0.911855,0.00013936771,0.085381135,0.00015486016,0.000043267377,0.00015815171,0.00072099577,0.00010114617,0.0014461187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951857,0.0020198396,0.00027096664,0.0010824741,0.0010002432,0.00044086878],"domain_scores_gemma":[0.9155934,0.06608624,0.0072717443,0.0057647196,0.0031972446,0.0020866457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067430898,0.00088123325,0.0010468588,0.004072214,0.0014168951,0.0018778758,0.0025105688,0.0017241949,0.0039575943],"category_scores_gemma":[0.08741515,0.0004072123,0.0009258528,0.0019231444,0.003295378,0.0039222348,0.0036624903,0.0022146115,0.0005568285],"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.0019135675,0.0004900127,0.14033581,0.0006833766,0.00037987554,0.0014065137,0.001712493,0.41013753,0.018023478,0.24998215,0.0073311394,0.16760404],"study_design_scores_gemma":[0.000063566935,0.00022591908,0.0067827785,0.00005724722,0.000043092175,0.0005020099,0.00033077673,0.8400958,0.006437451,0.14348535,0.0019120425,0.000063949825],"about_ca_topic_score_codex":0.004117081,"about_ca_topic_score_gemma":0.004004669,"teacher_disagreement_score":0.0067430898,"about_ca_system_score_codex":0.0020350795,"about_ca_system_score_gemma":0.002224173,"threshold_uncertainty_score":0.03566128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84926,0.0004728599,0.11784862,0.00092589547,0.000058425132,0.00009514306,0.0029573762,0.00059501635,0.027786762],"genre_scores_gemma":[0.97462666,0.00015113229,0.022034144,0.00004221761,0.000010614381,0.00008267509,0.0008070669,0.00009145715,0.0021541158],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9996394,0.00016739176,0.000012306065,0.00011250721,0.000031035554,0.000037458525],"domain_scores_gemma":[0.9977442,0.0015753186,0.00019226554,0.00013314367,0.00024150392,0.00011375094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081453397,0.00033526478,0.00021053871,0.001986129,0.0009848971,0.0016928916,0.00030357973,0.00037440084,0.0056424276],"category_scores_gemma":[0.005888193,0.0001799427,0.00021718506,0.0019135444,0.0005760023,0.0023082758,0.001141644,0.00046893736,0.00047101],"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.0019245102,0.00025799178,0.31964773,0.0007734193,0.00063165836,0.001080246,0.062222343,0.029868063,0.049738217,0.114901565,0.01044647,0.40850785],"study_design_scores_gemma":[0.0001294869,0.00022269574,0.40483734,0.00031220034,0.0004715589,0.0006811959,0.043706607,0.24978156,0.015339902,0.23819527,0.046107035,0.00021514455],"about_ca_topic_score_codex":0.07650922,"about_ca_topic_score_gemma":0.09393473,"teacher_disagreement_score":0.92349076,"about_ca_system_score_codex":0.0014113971,"about_ca_system_score_gemma":0.0012551114,"threshold_uncertainty_score":0.1521278},"labels":[],"label_agreement":null},{"id":"W3047166675","doi":"10.1093/comnet/cnaa012","title":"A density-based statistical analysis of graph clustering algorithm performance","year":2020,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Null model; Clustering coefficient; Computer science; Graph; Axiom; Theoretical computer science; Data mining; Cluster (spacecraft); Algorithm; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.021786691844942908,"score_gpt":0.2666106937272401,"score_spread":0.2448240018822972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047166675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39685485,0.0011272823,0.5931227,0.00081590656,0.0000973605,0.00025029306,0.0012797143,0.001963597,0.004488359],"genre_scores_gemma":[0.9309255,0.00015970369,0.067073405,0.00006661169,0.000054619697,0.00011371765,0.0009964372,0.00019959839,0.00041041733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99239117,0.0035122887,0.00044368548,0.0012173543,0.0021330644,0.00030251453],"domain_scores_gemma":[0.8796593,0.09371635,0.006902164,0.010207535,0.0085002985,0.0010143056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013435237,0.00060601154,0.0007177277,0.006305814,0.00068430183,0.002137486,0.0013593588,0.0014047661,0.0021300793],"category_scores_gemma":[0.1015755,0.00036573224,0.00068515725,0.0038024525,0.0021023464,0.0032880781,0.0016389092,0.0014315936,0.00047805157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008244075,0.00030817976,0.113808505,0.0005541129,0.0008291984,0.00030633577,0.0010533307,0.61973554,0.012153494,0.07784665,0.005625843,0.16695441],"study_design_scores_gemma":[0.00001797931,0.0002771701,0.029553292,0.000045600475,0.00005283476,0.00034675517,0.0001929492,0.9396584,0.0043326113,0.024332823,0.0011039742,0.00008556306],"about_ca_topic_score_codex":0.002537803,"about_ca_topic_score_gemma":0.0014724201,"teacher_disagreement_score":0.013435237,"about_ca_system_score_codex":0.001324319,"about_ca_system_score_gemma":0.00078214606,"threshold_uncertainty_score":0.07105315},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16366641,0.0016214435,0.8225295,0.0007672211,0.00017527238,0.000055255718,0.0006369391,0.0005172947,0.0100307325],"genre_scores_gemma":[0.86921644,0.00062099384,0.12696245,0.00015476123,0.00011514849,0.000103320075,0.0008443752,0.00021644069,0.0017660758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729437,0.0010380717,0.000088465735,0.0006957002,0.0007448955,0.00013848078],"domain_scores_gemma":[0.9886574,0.0070038205,0.0010712575,0.0018929575,0.00097275653,0.00040176697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034289798,0.00051166426,0.00080465426,0.0038770335,0.0009498676,0.0015832727,0.001598598,0.0015453678,0.0020007296],"category_scores_gemma":[0.027687076,0.0002496849,0.0006243426,0.0028150093,0.0015702441,0.005372943,0.0020175357,0.0013978533,0.00042172807],"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.00012866121,0.00007906655,0.015328112,0.00022491984,0.0003329017,0.00018690173,0.00037766583,0.4445006,0.0031673878,0.4417775,0.004478518,0.08941773],"study_design_scores_gemma":[0.00000861857,0.00006962987,0.0047405553,0.000038744027,0.00003924764,0.00025599118,0.00015239441,0.6159706,0.0021328968,0.37172836,0.00482363,0.000039371538],"about_ca_topic_score_codex":0.0015798114,"about_ca_topic_score_gemma":0.0017142702,"teacher_disagreement_score":0.0038770335,"about_ca_system_score_codex":0.0012332916,"about_ca_system_score_gemma":0.000604582,"threshold_uncertainty_score":0.018134415},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70152134,0.00087974494,0.28456917,0.00050200406,0.000052712756,0.000083508705,0.00015422233,0.00023966009,0.011997637],"genre_scores_gemma":[0.99331117,0.0002682259,0.0053463113,0.00004575472,0.000009409623,0.00003093399,0.00003649033,0.000017094846,0.000934774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995053,0.00019245985,0.000014875995,0.000088152614,0.00009454897,0.00010455571],"domain_scores_gemma":[0.9977992,0.0012770122,0.00044494995,0.00018556925,0.00014492423,0.00014831814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045242172,0.00048286354,0.00046214386,0.0007072948,0.0005279253,0.0007467691,0.0007050541,0.00078694196,0.0014165693],"category_scores_gemma":[0.0031973245,0.00029936022,0.0006553993,0.00032733206,0.001195163,0.0013492807,0.0009651916,0.0008612982,0.00012380992],"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.00007732034,0.0000686245,0.0034059894,0.00009683957,0.00007797658,0.00048081804,0.00015797105,0.8865584,0.010720902,0.09090734,0.000869681,0.006578086],"study_design_scores_gemma":[0.000008408762,0.000042870764,0.001345716,0.0000119169235,0.000019497595,0.000114264265,0.00004034551,0.96640176,0.001450056,0.029904634,0.0006467631,0.00001361337],"about_ca_topic_score_codex":0.0023714292,"about_ca_topic_score_gemma":0.0020057457,"teacher_disagreement_score":0.0023714292,"about_ca_system_score_codex":0.0009030716,"about_ca_system_score_gemma":0.0004744349,"threshold_uncertainty_score":0.006552279},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024382103,0.002651622,0.38737607,0.0055543636,0.002137236,0.0024118118,0.3367532,0.22119667,0.017536933],"genre_scores_gemma":[0.15995456,0.0017567992,0.39303324,0.0017498384,0.0007462289,0.0031171343,0.42616907,0.0059741596,0.0074990434],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762183,0.000325946,0.00033554944,0.00064121274,0.0009252411,0.00015018038],"domain_scores_gemma":[0.99397707,0.001271597,0.0005601236,0.0024037638,0.000894203,0.00089314533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002559719,0.0021335962,0.0013301045,0.0047490927,0.001819393,0.0037620473,0.0039512687,0.0016342058,0.00799515],"category_scores_gemma":[0.009890421,0.0011484491,0.0014920663,0.0064211227,0.0008379279,0.007260963,0.006138662,0.0032048526,0.0065564835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003374961,0.0009524536,0.033768337,0.0025798646,0.0012589148,0.0024661075,0.0021872926,0.02676617,0.031117376,0.055931646,0.5787244,0.26087245],"study_design_scores_gemma":[0.00041659432,0.0003045915,0.02517269,0.0003278753,0.00024442576,0.0008592935,0.0013301739,0.41061854,0.021166755,0.09726227,0.44188207,0.00041474588],"about_ca_topic_score_codex":0.0072632967,"about_ca_topic_score_gemma":0.011599204,"teacher_disagreement_score":0.00799515,"about_ca_system_score_codex":0.0011142264,"about_ca_system_score_gemma":0.001977297,"threshold_uncertainty_score":0.026746452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046300188,0.014230115,0.026058408,0.07043944,0.017428381,0.0002081253,0.00006122158,0.00038455552,0.82488954],"genre_scores_gemma":[0.6384799,0.011130269,0.011549561,0.032760672,0.011554932,0.0005653837,0.00009267421,0.0007835717,0.2930831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99439776,0.0034902678,0.00013073203,0.00054829865,0.0009286797,0.0005042551],"domain_scores_gemma":[0.9948895,0.0033113123,0.0003371818,0.00042543502,0.0004633023,0.00057324534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037189939,0.0008626575,0.00044422218,0.0015999433,0.008037677,0.011079498,0.0015810935,0.0045971377,0.012725728],"category_scores_gemma":[0.009189759,0.0003433761,0.0005645405,0.0007927642,0.014827844,0.014950849,0.010922414,0.0065340814,0.0029139207],"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.00002517408,0.00005790748,0.0008686744,0.00020149785,0.0000074153672,0.0006440157,0.17934251,0.00009106383,0.001265784,0.7286476,0.053382818,0.035465483],"study_design_scores_gemma":[0.0000057540606,0.00005787315,0.00025936597,0.00043530323,0.0000066522102,0.0004522194,0.029576294,0.00012221439,0.00033149807,0.060729127,0.9080074,0.000016313832],"about_ca_topic_score_codex":0.0008013998,"about_ca_topic_score_gemma":0.0012935479,"teacher_disagreement_score":0.012725728,"about_ca_system_score_codex":0.0025580782,"about_ca_system_score_gemma":0.0013265711,"threshold_uncertainty_score":0.042571843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03932227,0.0011693765,0.94720376,0.001694646,0.00009724617,0.00017133477,0.0015417997,0.0003528325,0.008446864],"genre_scores_gemma":[0.541426,0.0025588055,0.44204125,0.00046048727,0.0003551027,0.00090705033,0.0043133725,0.00024064646,0.0076972875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99533904,0.0025267857,0.00021183229,0.0011079675,0.0005819694,0.00023240564],"domain_scores_gemma":[0.96720237,0.024989188,0.0031690376,0.0028684284,0.0012678719,0.0005031335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038401405,0.0010058715,0.00074058713,0.0059909094,0.001562574,0.0039311275,0.0017029463,0.0017252752,0.005874226],"category_scores_gemma":[0.03396073,0.0006799301,0.0014683638,0.0064872457,0.0021973231,0.008079704,0.003240288,0.0017614831,0.0007455713],"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.00007065414,0.00007364314,0.014474474,0.00045115294,0.0002857968,0.0005936099,0.0021268663,0.16700204,0.001575126,0.74056077,0.00449802,0.068287894],"study_design_scores_gemma":[0.000011485155,0.00002714731,0.0027981736,0.000104622246,0.000053573334,0.00020644424,0.0008034115,0.25890422,0.0004602005,0.71403164,0.022568101,0.000030981686],"about_ca_topic_score_codex":0.006490329,"about_ca_topic_score_gemma":0.0046660085,"teacher_disagreement_score":0.006490329,"about_ca_system_score_codex":0.0020235567,"about_ca_system_score_gemma":0.00096347893,"threshold_uncertainty_score":0.020308793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00870553,0.008441697,0.96909237,0.0016290003,0.00023497602,0.00019559293,0.0004307567,0.00025369413,0.0110162515],"genre_scores_gemma":[0.60903203,0.023992404,0.3518813,0.0015913408,0.002644118,0.0017339374,0.0012994998,0.00023094659,0.0075944187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99325234,0.0037325686,0.00023625567,0.0010344073,0.001563035,0.00018139833],"domain_scores_gemma":[0.9881263,0.009459167,0.0007363136,0.0008872355,0.00054729584,0.0002437802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006259937,0.0011448544,0.0018081582,0.0051635164,0.0013709846,0.0028557559,0.0016386478,0.0020796866,0.003644636],"category_scores_gemma":[0.021777922,0.00071329385,0.0015392187,0.0047879633,0.00447727,0.0058117597,0.0027083082,0.0033886463,0.0012891864],"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.000035757465,0.000058433812,0.0041328454,0.0006872587,0.00044152577,0.00031084867,0.00074459746,0.052272886,0.0009787629,0.8511831,0.008188093,0.080965824],"study_design_scores_gemma":[0.000015569776,0.0000357453,0.0022877797,0.00016391123,0.000061040395,0.00028124623,0.00016982431,0.13237531,0.00030551897,0.84743464,0.016831754,0.000037613714],"about_ca_topic_score_codex":0.0018928528,"about_ca_topic_score_gemma":0.0012381697,"teacher_disagreement_score":0.006259937,"about_ca_system_score_codex":0.0012440812,"about_ca_system_score_gemma":0.0011492322,"threshold_uncertainty_score":0.03310609},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8242471,0.0005773958,0.1676341,0.00036742416,0.00005655493,0.00005966741,0.00029748754,0.00037984195,0.0063802786],"genre_scores_gemma":[0.98576385,0.00026260823,0.011994288,0.000081992155,0.000053030937,0.00006215687,0.00032301425,0.00010255082,0.0013565094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986979,0.00041564435,0.000043471337,0.0003453216,0.00033108756,0.00016659341],"domain_scores_gemma":[0.98432827,0.009968232,0.0023502032,0.0016667647,0.0010468464,0.0006396645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014157075,0.0004233509,0.00067600707,0.002369662,0.0006166109,0.0012608058,0.002091396,0.0010918191,0.0027123722],"category_scores_gemma":[0.019566452,0.00045070358,0.0004308451,0.001615955,0.0018628121,0.0037513697,0.0011408738,0.00091072405,0.00036626068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007032851,0.00015871681,0.034606643,0.000352108,0.00014209506,0.0014776041,0.0008670418,0.39808455,0.030736292,0.4955273,0.004232394,0.033111945],"study_design_scores_gemma":[0.000034152217,0.00007370185,0.0040556397,0.000029727957,0.000023295208,0.00061566784,0.0001361813,0.8499706,0.005814543,0.13801378,0.0011882551,0.000044405384],"about_ca_topic_score_codex":0.0012455893,"about_ca_topic_score_gemma":0.0012813343,"teacher_disagreement_score":0.0027123722,"about_ca_system_score_codex":0.0008195993,"about_ca_system_score_gemma":0.00015878255,"threshold_uncertainty_score":0.009073794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28525844,0.0007968977,0.6959319,0.00095695193,0.000102914746,0.00019693945,0.00030148475,0.00035017033,0.016104316],"genre_scores_gemma":[0.9315316,0.00052056415,0.060817447,0.000092594964,0.000027000793,0.0002739417,0.00013279222,0.000059291753,0.006544839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974185,0.000104967745,0.00001547855,0.000043767457,0.000046270434,0.000047708087],"domain_scores_gemma":[0.99895144,0.00075802,0.000118120726,0.000037154266,0.000082218205,0.00005309105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007376781,0.00063279667,0.0007783808,0.0010280219,0.0005924256,0.0011727783,0.0010686707,0.0016187539,0.0027170042],"category_scores_gemma":[0.0038085496,0.0005306997,0.00080741395,0.0006048203,0.00092315685,0.0011549372,0.0007356387,0.0008135728,0.00026349092],"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.0000071335658,0.000008701928,0.00035706782,0.000010255312,0.000007948276,0.000027938442,0.00002190842,0.99386406,0.00019816775,0.0040015588,0.000064541084,0.0014307334],"study_design_scores_gemma":[0.00000296079,0.0000049763917,0.00008698898,0.0000026969408,0.000002621789,0.000006559985,0.0000058548603,0.9975145,0.000049562037,0.0021785547,0.00014211812,0.0000025233296],"about_ca_topic_score_codex":0.010641832,"about_ca_topic_score_gemma":0.006323107,"teacher_disagreement_score":0.010641832,"about_ca_system_score_codex":0.0012163636,"about_ca_system_score_gemma":0.0009472187,"threshold_uncertainty_score":0.021159828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6584562,0.0005965434,0.33259776,0.0015833955,0.000048019006,0.00008267321,0.00087090075,0.00021156532,0.0055528893],"genre_scores_gemma":[0.9691786,0.00057095184,0.02474032,0.0001654391,0.000069545094,0.00018163917,0.0005118883,0.000045842873,0.0045357384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994979,0.0002274383,0.000015223312,0.00009254171,0.00010049131,0.00006641684],"domain_scores_gemma":[0.9961487,0.0024377648,0.0006005969,0.00022302807,0.00033485398,0.00025496268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018662197,0.0003823329,0.0005887067,0.0017577307,0.0005178946,0.0010158268,0.0010399385,0.0010015363,0.0018509526],"category_scores_gemma":[0.009543287,0.0004800837,0.00030279552,0.0008220694,0.0012043902,0.0028618034,0.000919827,0.0006137602,0.0002278123],"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.00016454734,0.000038711212,0.0026388534,0.00007082576,0.00003492147,0.00014624988,0.0001543162,0.5531942,0.0014092816,0.42883855,0.0020127136,0.01129687],"study_design_scores_gemma":[0.000024856605,0.000013132907,0.0009165034,0.000012322948,0.00000893216,0.00004793141,0.000025451081,0.80107903,0.00031768426,0.1966881,0.00084989064,0.000016155862],"about_ca_topic_score_codex":0.0021748347,"about_ca_topic_score_gemma":0.0019613628,"teacher_disagreement_score":0.0021748347,"about_ca_system_score_codex":0.001272701,"about_ca_system_score_gemma":0.00047994373,"threshold_uncertainty_score":0.009869635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99199706,0.00016241394,0.0054424116,0.00026566663,0.000015723926,0.000022246837,0.00044702782,0.000068073234,0.0015792906],"genre_scores_gemma":[0.9980914,0.000060599385,0.00086185994,0.00001499275,0.000007531771,0.000013146268,0.0002798893,0.0000062520066,0.00066445273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.999835,0.000040731564,0.000008419882,0.000046524758,0.000035745874,0.00003351791],"domain_scores_gemma":[0.9985209,0.000793957,0.00023603236,0.00008094769,0.00026961527,0.00009850907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074052927,0.00032134217,0.00026808408,0.0010134431,0.0005665152,0.00047239877,0.000528725,0.00050282874,0.0014211384],"category_scores_gemma":[0.0026358601,0.00017946532,0.0003414889,0.00068541913,0.0004929937,0.0016005863,0.00040309862,0.00048901385,0.00017716561],"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.00046996752,0.00021618411,0.29346204,0.00031784235,0.00015326138,0.0024039124,0.0031458475,0.6091239,0.013688687,0.028935125,0.008448229,0.03963495],"study_design_scores_gemma":[0.000011005668,0.000040505838,0.050595418,0.000010916534,0.000023464232,0.0001268531,0.0005007982,0.9432112,0.001084036,0.0035337273,0.00083400053,0.000028141185],"about_ca_topic_score_codex":0.02993987,"about_ca_topic_score_gemma":0.022933338,"teacher_disagreement_score":0.02993987,"about_ca_system_score_codex":0.0011328727,"about_ca_system_score_gemma":0.00039189437,"threshold_uncertainty_score":0.059531152},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83001494,0.0012400104,0.15204704,0.0015649875,0.00004044687,0.00009091099,0.000499712,0.00016636374,0.014335646],"genre_scores_gemma":[0.99012506,0.0005877605,0.0072876452,0.000049763537,0.000013175075,0.00004292193,0.00031520013,0.000032345913,0.0015461565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955755,0.00020551369,0.00001537383,0.000100853125,0.000048929924,0.000071726834],"domain_scores_gemma":[0.99859387,0.00066208845,0.00031368984,0.00009984718,0.00022764839,0.00010290581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00125006,0.00062066776,0.00063068845,0.00079232315,0.00061786926,0.0012267961,0.0010185407,0.00060146523,0.0026862796],"category_scores_gemma":[0.0037556812,0.00028608527,0.00094293937,0.0008622138,0.0008308625,0.0021983595,0.0009486308,0.0008427492,0.00020404784],"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.00007573989,0.00005778705,0.013661548,0.00010959009,0.00012334829,0.0002654779,0.00017806778,0.9021104,0.00033087094,0.06944352,0.0022137228,0.011430014],"study_design_scores_gemma":[0.000013451261,0.000019997051,0.002494978,0.000012166291,0.000037244332,0.000023748062,0.00015816564,0.9665322,0.00011555248,0.029514924,0.0010645966,0.000013101525],"about_ca_topic_score_codex":0.042123914,"about_ca_topic_score_gemma":0.021263467,"teacher_disagreement_score":0.042123914,"about_ca_system_score_codex":0.002022112,"about_ca_system_score_gemma":0.001435453,"threshold_uncertainty_score":0.08375746},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018251004,0.00018992207,0.9801829,0.0001136065,0.00002216281,0.00014968224,0.000080821315,0.0003848446,0.00062509655],"genre_scores_gemma":[0.24681346,0.00020347926,0.75022656,0.00012651955,0.000059594506,0.00030207826,0.00038520026,0.00008597681,0.0017971125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982356,0.00045703395,0.00010116179,0.00052734785,0.0005080764,0.00017073308],"domain_scores_gemma":[0.9962496,0.0017669456,0.0005894187,0.00027091146,0.0009142517,0.00020886955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029775894,0.0010405093,0.0012669711,0.0057128994,0.0012283213,0.0010050333,0.0018233313,0.0015531724,0.0010766684],"category_scores_gemma":[0.008648208,0.00044770062,0.0011872952,0.0025142902,0.0010501181,0.0031869856,0.0018953923,0.0011576451,0.00029719385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032840398,0.00033094024,0.009989308,0.00035426978,0.00031147362,0.0004757397,0.0005782333,0.29762965,0.014585561,0.042629644,0.0059365504,0.6268502],"study_design_scores_gemma":[0.00002352279,0.00006222552,0.0009455826,0.000025310335,0.00003106824,0.00019392482,0.000054356682,0.9767452,0.0033535515,0.016848007,0.0016911151,0.00002616772],"about_ca_topic_score_codex":0.005032483,"about_ca_topic_score_gemma":0.0054191123,"teacher_disagreement_score":0.0057128994,"about_ca_system_score_codex":0.0013404851,"about_ca_system_score_gemma":0.0015015597,"threshold_uncertainty_score":0.01574719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98321897,0.00031803318,0.00023388989,0.0012432778,0.000017966126,0.00004075404,0.001210166,0.000020753443,0.013696255],"genre_scores_gemma":[0.9938583,0.00029800745,0.00014582404,0.00008214039,0.0000041237545,0.000018513667,0.00035127794,0.000010085616,0.005231671],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994336,0.00009445243,0.000024517336,0.00008674487,0.00016830323,0.00019233779],"domain_scores_gemma":[0.9959884,0.0010541742,0.00031148936,0.000118447766,0.0017457214,0.00078183506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005942262,0.0002469292,0.00032320747,0.001823749,0.0036580942,0.002717981,0.00093863456,0.0003790505,0.0050993976],"category_scores_gemma":[0.007217188,0.00019360043,0.00014982697,0.0041872594,0.0011463976,0.00069465954,0.0015318977,0.0008322337,0.00047663378],"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.00028558535,0.00015339073,0.8917729,0.00013810651,0.000084397536,0.000793481,0.02379778,0.002504785,0.00081159093,0.002530643,0.01336894,0.063758396],"study_design_scores_gemma":[0.000014069024,0.000035740606,0.92807776,0.00012723116,0.00005401691,0.00007641602,0.05241179,0.004772446,0.00033153934,0.0006710929,0.013368295,0.00005964456],"about_ca_topic_score_codex":0.99383825,"about_ca_topic_score_gemma":0.9957885,"teacher_disagreement_score":0.027282204,"about_ca_system_score_codex":0.027282204,"about_ca_system_score_gemma":0.020621942,"threshold_uncertainty_score":0.1979472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74892616,0.0055465237,0.1633256,0.008724558,0.00036128145,0.0003572783,0.01711941,0.007816953,0.047822267],"genre_scores_gemma":[0.90297955,0.0024088996,0.08347722,0.00016027267,0.000086851425,0.00019962506,0.0041188993,0.00028080458,0.006287823],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99951494,0.0001805834,0.00003050378,0.00008086324,0.00013365537,0.00005947795],"domain_scores_gemma":[0.9981931,0.0008946144,0.00033272177,0.000121365134,0.00027279306,0.00018551915],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0009412989,0.0004354998,0.00026417815,0.008887117,0.0007815429,0.0018520323,0.00039730038,0.00061804446,0.0040311874],"category_scores_gemma":[0.0033903185,0.00021119959,0.00044914804,0.007959476,0.0003255159,0.0018246311,0.001518931,0.00043582745,0.00043624247],"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.0005428567,0.00030186644,0.159919,0.002509909,0.0003649903,0.0032308544,0.022279963,0.053515747,0.02218706,0.08874496,0.106248684,0.5401541],"study_design_scores_gemma":[0.00009861937,0.00017129611,0.20015076,0.00089690706,0.00029908578,0.0018659396,0.024712108,0.3486131,0.0142934825,0.0925151,0.31610072,0.0002829587],"about_ca_topic_score_codex":0.008706988,"about_ca_topic_score_gemma":0.0126688555,"teacher_disagreement_score":0.9911129,"about_ca_system_score_codex":0.0007083596,"about_ca_system_score_gemma":0.00096750155,"threshold_uncertainty_score":0.017312586},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22080708,0.0028989296,0.7463185,0.0027876368,0.00028806963,0.00014397975,0.00027063186,0.0004889822,0.025996193],"genre_scores_gemma":[0.984385,0.00123376,0.011971374,0.00010267581,0.000052655563,0.000057626847,0.00007531176,0.000023332628,0.002098138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995179,0.00012205027,0.000022748807,0.00010856513,0.0001536562,0.00007497137],"domain_scores_gemma":[0.99914074,0.00041632782,0.00016119138,0.000075671385,0.0001434912,0.000062562554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005589222,0.00041093337,0.0004646803,0.00067798886,0.0009980805,0.0013308486,0.000762643,0.0010031115,0.0011808886],"category_scores_gemma":[0.0026061584,0.00027024536,0.000760117,0.00076797017,0.0012085859,0.002588505,0.0011700044,0.00094351184,0.00016535341],"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.00012384981,0.00012653992,0.0068918997,0.00029819933,0.00008802818,0.0007812025,0.00053916965,0.56919193,0.011939125,0.3733441,0.0027009381,0.033975054],"study_design_scores_gemma":[0.0000074223262,0.000023335715,0.0006318219,0.000011976943,0.000014914815,0.00008734106,0.0000556103,0.9511177,0.00065365486,0.046069942,0.0013085345,0.000017723916],"about_ca_topic_score_codex":0.008485395,"about_ca_topic_score_gemma":0.004247988,"teacher_disagreement_score":0.008485395,"about_ca_system_score_codex":0.0012838513,"about_ca_system_score_gemma":0.0008494035,"threshold_uncertainty_score":0.016872048},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46803525,0.0028417078,0.50700206,0.0008254961,0.00014748106,0.00020326268,0.0038257672,0.00805973,0.009059266],"genre_scores_gemma":[0.91289127,0.0005577364,0.07688529,0.000163537,0.000054656084,0.000067405956,0.005457252,0.00014003116,0.003782883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973947,0.000034902834,0.000014659166,0.0000925926,0.00007343156,0.00004498209],"domain_scores_gemma":[0.99928313,0.00026422826,0.00014046155,0.00009804186,0.00017047564,0.000043666012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036788228,0.0010047767,0.00055694685,0.0027928848,0.0004725737,0.00056036003,0.0010707903,0.0007056843,0.0012242041],"category_scores_gemma":[0.0017673908,0.00037354432,0.0006601391,0.0016705953,0.0004122733,0.001601751,0.0006255565,0.00089420355,0.00048818163],"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.00029551343,0.00024714792,0.027805151,0.00021627708,0.00025880992,0.00036580773,0.00015070917,0.6227198,0.009362861,0.006371561,0.011451542,0.32075486],"study_design_scores_gemma":[0.000004410256,0.000016038228,0.001638842,0.000010359593,0.00002499076,0.000038466078,0.000018650788,0.9921968,0.0018819823,0.0033653418,0.00079821475,0.0000059776708],"about_ca_topic_score_codex":0.030424803,"about_ca_topic_score_gemma":0.053977333,"teacher_disagreement_score":0.030424803,"about_ca_system_score_codex":0.0011371424,"about_ca_system_score_gemma":0.0007284398,"threshold_uncertainty_score":0.060495436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26028967,0.0014734288,0.7227622,0.0007350669,0.00019138443,0.00013051846,0.0017625252,0.005627653,0.0070275026],"genre_scores_gemma":[0.91481423,0.00044177333,0.07830288,0.00015956664,0.000056228044,0.00007818792,0.0023072201,0.00012721105,0.0037124974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984646,0.000015293592,0.0000074811323,0.000064945125,0.000032445987,0.00003333967],"domain_scores_gemma":[0.9996815,0.000101458856,0.00006037926,0.000045817,0.00008189462,0.000029033401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024519104,0.0010485996,0.00055242993,0.0011710592,0.00032568196,0.00049948005,0.0011578475,0.00064087834,0.0016624603],"category_scores_gemma":[0.0013428131,0.00041600008,0.0004988698,0.0010396225,0.00033185584,0.002016984,0.0006092533,0.0009566848,0.00049203134],"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.00014256008,0.00014574328,0.0065434417,0.00010771358,0.00008980147,0.00020838848,0.00007433056,0.7087034,0.0065220417,0.0050949636,0.006888225,0.26547942],"study_design_scores_gemma":[0.0000019487675,0.000007758439,0.00026756333,0.0000038475173,0.0000059085273,0.000011964329,0.000007430713,0.9965918,0.00073469937,0.0021381327,0.0002266246,0.0000023082848],"about_ca_topic_score_codex":0.01807867,"about_ca_topic_score_gemma":0.033444162,"teacher_disagreement_score":0.01807867,"about_ca_system_score_codex":0.0010558974,"about_ca_system_score_gemma":0.00067185226,"threshold_uncertainty_score":0.035946906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25568908,0.0026572084,0.6609946,0.0067025907,0.0010505494,0.00022900691,0.0032678316,0.00056215347,0.06884693],"genre_scores_gemma":[0.9128884,0.0012422184,0.02393239,0.00045609518,0.00023147262,0.0004341308,0.00074284663,0.00007919074,0.059993297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997211,0.00008732462,0.000013082531,0.00008104538,0.000045024524,0.00005238775],"domain_scores_gemma":[0.9995105,0.00025681118,0.00006936312,0.000018767727,0.00007846414,0.00006603179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039169085,0.0006633078,0.00076389627,0.0008881434,0.0008980408,0.0012720398,0.0018475763,0.002049563,0.008685201],"category_scores_gemma":[0.0013955907,0.00035451917,0.0011361792,0.00075357326,0.000878303,0.0015311547,0.001158398,0.0011692317,0.00068817707],"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.00007664495,0.00008405832,0.0023797168,0.000081390426,0.000081871214,0.00061685353,0.00026945185,0.91095614,0.001246161,0.07490648,0.0024831628,0.0068180296],"study_design_scores_gemma":[0.00001881252,0.00002626219,0.00029587146,0.000008141756,0.000023257628,0.00006007882,0.00004313693,0.98788536,0.000045265013,0.0104495175,0.0011317213,0.000012585041],"about_ca_topic_score_codex":0.02010436,"about_ca_topic_score_gemma":0.011166395,"teacher_disagreement_score":0.02010436,"about_ca_system_score_codex":0.000984338,"about_ca_system_score_gemma":0.0011123901,"threshold_uncertainty_score":0.03997463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1662335,0.00061686884,0.8268765,0.0010022953,0.00013105432,0.0001494904,0.00015630793,0.0012321849,0.0036017569],"genre_scores_gemma":[0.92865956,0.00018036712,0.06938391,0.00024970665,0.000043297892,0.000070234455,0.0001489246,0.00006095026,0.0012029895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805415,0.00075683626,0.0000762052,0.00038009274,0.00053362886,0.00019902638],"domain_scores_gemma":[0.9877649,0.00853826,0.0012189981,0.001625488,0.0005938557,0.0002586395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032207158,0.0009800167,0.0008772467,0.0009428122,0.0008926504,0.000827335,0.0017219023,0.0012886267,0.0009980034],"category_scores_gemma":[0.013930575,0.00037503976,0.00061437325,0.0006906899,0.001909964,0.002914008,0.0021779547,0.0025094538,0.00022830394],"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.00020729633,0.000070892085,0.0014203781,0.000033469107,0.000042731364,0.000048568145,0.00004380132,0.9500318,0.0019827352,0.013821232,0.0012187931,0.031078262],"study_design_scores_gemma":[0.000004244304,0.000024714,0.00008867803,0.0000029672742,0.0000026147995,0.000012185319,0.0000048781335,0.9946845,0.0007384116,0.0043251584,0.00010858379,0.0000030883768],"about_ca_topic_score_codex":0.0026783606,"about_ca_topic_score_gemma":0.003108738,"teacher_disagreement_score":0.0032207158,"about_ca_system_score_codex":0.0016296238,"about_ca_system_score_gemma":0.0009569388,"threshold_uncertainty_score":0.01703298},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41508818,0.004305724,0.0012603689,0.030877419,0.0010585577,0.000153297,0.08991273,0.00020960132,0.45713413],"genre_scores_gemma":[0.9279767,0.0011098776,0.00032257548,0.0008868433,0.00010678806,0.000025848774,0.012194404,0.00005830408,0.05731879],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9975352,0.00016151817,0.00006158566,0.00021716495,0.0008745161,0.0011499798],"domain_scores_gemma":[0.9906178,0.0021057753,0.001402629,0.0004818754,0.0036173016,0.0017744661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012534885,0.0002766077,0.00047898348,0.0026053998,0.0056376406,0.0037285287,0.00095697615,0.0010426377,0.03339207],"category_scores_gemma":[0.01710207,0.0002495064,0.00038500712,0.009982849,0.0012532776,0.0016459933,0.0011084382,0.001885769,0.0022556118],"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.00127296,0.00011646703,0.31751102,0.00021403655,0.00013180313,0.00028321779,0.0023026688,0.0019038976,0.00024131851,0.11389971,0.5101849,0.051938027],"study_design_scores_gemma":[0.00010613004,0.00004986336,0.6328353,0.00017530423,0.0001459639,0.00029551785,0.01039371,0.0044181147,0.0006823243,0.013814353,0.33692375,0.0001597299],"about_ca_topic_score_codex":0.9873718,"about_ca_topic_score_gemma":0.9944938,"teacher_disagreement_score":0.03339207,"about_ca_system_score_codex":0.029984718,"about_ca_system_score_gemma":0.03792274,"threshold_uncertainty_score":0.2175554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07219854,0.00027054982,0.92190176,0.0010383556,0.00003784032,0.000049145252,0.00086062594,0.00034491534,0.0032982135],"genre_scores_gemma":[0.9166484,0.0005732894,0.07438078,0.0003862495,0.00015661174,0.00026899067,0.0010462883,0.00023541374,0.006303992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978859,0.0010310295,0.00006123898,0.0005517456,0.000282487,0.00018752748],"domain_scores_gemma":[0.98236483,0.011098122,0.0024968763,0.002382236,0.0010689222,0.00058902934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046640644,0.00065726764,0.0011560858,0.0018319426,0.00055834634,0.0016265475,0.0022087924,0.0018295123,0.004441271],"category_scores_gemma":[0.018854834,0.00070327474,0.0013497197,0.0016831765,0.0019708562,0.0049121976,0.0016267132,0.0028986216,0.0006015469],"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.00003278969,0.000043889002,0.0029378687,0.00004908009,0.00004717466,0.00012263407,0.00022075672,0.24162632,0.0006789521,0.74605197,0.0017912025,0.0063974643],"study_design_scores_gemma":[0.000010322524,0.000016704438,0.0009075742,0.00001613836,0.000015987043,0.00005600467,0.00003309211,0.5791133,0.00014185371,0.4182962,0.0013743264,0.00001853529],"about_ca_topic_score_codex":0.008648681,"about_ca_topic_score_gemma":0.010073454,"teacher_disagreement_score":0.008648681,"about_ca_system_score_codex":0.0022754332,"about_ca_system_score_gemma":0.0010028965,"threshold_uncertainty_score":0.02466619},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6259544,0.0013250902,0.36246285,0.0013910228,0.00009275935,0.00017250908,0.0023458113,0.0013042107,0.004951409],"genre_scores_gemma":[0.97364444,0.00035708223,0.022797652,0.00007148649,0.000061097024,0.000040430143,0.0013832443,0.00004597626,0.0015986429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993718,0.00018681886,0.000040235576,0.00020315562,0.00011054179,0.00008737432],"domain_scores_gemma":[0.99338347,0.0037828225,0.0013270702,0.0006753766,0.00055463036,0.0002765679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011249043,0.00049723434,0.0003881766,0.00428988,0.00045509092,0.00120872,0.0006947708,0.0011423038,0.0011290751],"category_scores_gemma":[0.007812961,0.00020857302,0.00063862605,0.0022323064,0.00069740874,0.003008774,0.0006415093,0.00089449034,0.00034989414],"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.00062064757,0.0004630366,0.12482976,0.00048065174,0.00035175163,0.0008597499,0.00095011666,0.5238586,0.008909285,0.09569233,0.012108552,0.23087545],"study_design_scores_gemma":[0.000009072757,0.000027096248,0.010703712,0.00002541331,0.000025906711,0.00012811726,0.00016531389,0.9436116,0.0009890279,0.042437732,0.0018653063,0.000011751651],"about_ca_topic_score_codex":0.005279854,"about_ca_topic_score_gemma":0.005447399,"teacher_disagreement_score":0.005279854,"about_ca_system_score_codex":0.0011340842,"about_ca_system_score_gemma":0.00040390043,"threshold_uncertainty_score":0.010498226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95279,0.00029276067,0.043530878,0.0007003226,0.00003370389,0.0000384588,0.00031291138,0.00012633446,0.0021745786],"genre_scores_gemma":[0.99773186,0.000047048445,0.001934931,0.000025424268,0.000016025146,0.0000109443445,0.00004776115,0.000005613833,0.00018027483],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992199,0.00044973227,0.000028397482,0.00014863447,0.00009027654,0.00006305685],"domain_scores_gemma":[0.9601633,0.02811898,0.008718564,0.0009999549,0.0010659235,0.0009332443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026124949,0.00031093584,0.00043117255,0.0013595757,0.00039532807,0.001605265,0.00046974648,0.00090578216,0.0025374566],"category_scores_gemma":[0.026115209,0.00029341452,0.00032778736,0.00064549415,0.0011526318,0.0021976524,0.0009062829,0.0008925573,0.0001703556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013781143,0.00044006872,0.4803931,0.0006870254,0.00065415894,0.001363231,0.0038478307,0.27160296,0.028905256,0.12647992,0.0056673973,0.07858094],"study_design_scores_gemma":[0.000062328196,0.0003940725,0.13955124,0.000116981784,0.00013764526,0.00040250397,0.001278927,0.7777196,0.004649519,0.07390816,0.0016762565,0.000102882914],"about_ca_topic_score_codex":0.001134432,"about_ca_topic_score_gemma":0.0009203601,"teacher_disagreement_score":0.0026124949,"about_ca_system_score_codex":0.0004997958,"about_ca_system_score_gemma":0.0002080106,"threshold_uncertainty_score":0.013816416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17049852,0.00034428487,0.8223179,0.00038958044,0.00013643944,0.00022622247,0.0011953926,0.0021582379,0.002733425],"genre_scores_gemma":[0.8397006,0.00019681286,0.15575767,0.00006798661,0.00011583479,0.00014721889,0.0016039831,0.00004423307,0.002365688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995906,0.000058807735,0.00003119415,0.00011638437,0.00015120608,0.000051797466],"domain_scores_gemma":[0.99887735,0.00041822763,0.0001310656,0.000048453316,0.00046363872,0.00006119194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051370694,0.00070366793,0.0005102227,0.0018694841,0.0004076761,0.0007161682,0.0007775249,0.00053292554,0.0015997454],"category_scores_gemma":[0.0022107668,0.00018307762,0.0005536188,0.0010478307,0.00014299511,0.0007692142,0.00036271766,0.000546157,0.0007568752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069059443,0.00047117047,0.042361137,0.00026254813,0.0002630978,0.00071406114,0.00051712577,0.12166031,0.028874373,0.0023912385,0.010374355,0.7914199],"study_design_scores_gemma":[0.000006711465,0.000042011194,0.0022407747,0.0000045816605,0.000017588476,0.000052659987,0.000068372654,0.99403495,0.002537033,0.00054721546,0.00044033237,0.000007764956],"about_ca_topic_score_codex":0.0066744583,"about_ca_topic_score_gemma":0.0075674728,"teacher_disagreement_score":0.0066744583,"about_ca_system_score_codex":0.0004338151,"about_ca_system_score_gemma":0.00031925747,"threshold_uncertainty_score":0.013271213},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7322557,0.0061296592,0.20903802,0.0029955253,0.0002975377,0.0011478117,0.020194437,0.0017773255,0.026163878],"genre_scores_gemma":[0.88202816,0.003221256,0.093891084,0.0002894034,0.00028842746,0.0005002572,0.01481032,0.000059041973,0.004912077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986241,0.0005324087,0.0001266753,0.0002125533,0.00037507244,0.0001291475],"domain_scores_gemma":[0.9947339,0.0036726717,0.00047089276,0.00039605168,0.0005782028,0.00014833099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016190028,0.0009755833,0.00062959205,0.006056365,0.00060970144,0.0015923126,0.0006664723,0.0008010242,0.0010712888],"category_scores_gemma":[0.0072184727,0.00028805528,0.00069291244,0.004103819,0.00029550234,0.0029615306,0.0009934518,0.0008025305,0.0013053338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068183837,0.0010465938,0.1715707,0.0010442927,0.0003930225,0.0005883431,0.0020863048,0.022199478,0.014437462,0.008979682,0.020789051,0.75618315],"study_design_scores_gemma":[0.000050948227,0.00083342986,0.18087545,0.00040586418,0.0003331328,0.0011722032,0.005041247,0.70645094,0.028189747,0.02290887,0.053546723,0.00019146963],"about_ca_topic_score_codex":0.004033384,"about_ca_topic_score_gemma":0.008629945,"teacher_disagreement_score":0.006056365,"about_ca_system_score_codex":0.00058448996,"about_ca_system_score_gemma":0.0003881107,"threshold_uncertainty_score":0.008562148},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05543013,0.0023712814,0.88812596,0.004314777,0.00035528894,0.0001325381,0.0004031468,0.00065538735,0.048211515],"genre_scores_gemma":[0.86318254,0.0031387536,0.11110119,0.00084436726,0.0009065362,0.00081152964,0.00044174478,0.00034775503,0.01922562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897975,0.0005363288,0.000041631436,0.00014810484,0.00020988342,0.00008427966],"domain_scores_gemma":[0.99710125,0.0017957159,0.00031041555,0.00035528347,0.0002099794,0.00022719587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018494477,0.0011016142,0.00085984106,0.0023502323,0.0009791818,0.0026577157,0.0015969587,0.0016706333,0.005463489],"category_scores_gemma":[0.0067363502,0.00055891235,0.0013334202,0.0009039363,0.0035210084,0.006024107,0.0019485126,0.0023527404,0.0006496908],"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.0000055246323,0.0000103766615,0.000111306275,0.00003083768,0.000013025122,0.000031570387,0.00010548573,0.030966725,0.00021038989,0.96650654,0.00060451776,0.0014037086],"study_design_scores_gemma":[0.0000059830218,0.000005038412,0.00005223048,0.00000769481,0.000003094788,0.000011657341,0.00001867589,0.111942194,0.000029458368,0.886414,0.001505172,0.000004807324],"about_ca_topic_score_codex":0.0020448228,"about_ca_topic_score_gemma":0.0016354036,"teacher_disagreement_score":0.005463489,"about_ca_system_score_codex":0.002174604,"about_ca_system_score_gemma":0.0006192101,"threshold_uncertainty_score":0.018277168},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20258945,0.00029680124,0.7927978,0.0008708043,0.00012799614,0.00019738577,0.0002991247,0.00058637717,0.0022342317],"genre_scores_gemma":[0.8689654,0.0003397377,0.12625954,0.00025252433,0.00013272978,0.00041633786,0.00054085796,0.0001604267,0.0029325006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961217,0.0027424477,0.00009653939,0.00061327405,0.00023670714,0.00018933213],"domain_scores_gemma":[0.968543,0.022611951,0.003048074,0.004565519,0.00069573236,0.0005356277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012509876,0.00091674546,0.00082830363,0.00097640103,0.0011430003,0.0010677396,0.0032296726,0.0022087912,0.0022737721],"category_scores_gemma":[0.077528104,0.00074426475,0.0013991111,0.0010730758,0.0017792815,0.0050429516,0.0019435431,0.0027945573,0.00042202222],"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.00028380073,0.00020080505,0.028979113,0.00016367504,0.00034223075,0.00033579103,0.0006271724,0.7208021,0.0023840654,0.19695239,0.0023410658,0.046587747],"study_design_scores_gemma":[0.000047033685,0.00006892011,0.0032214976,0.000018375864,0.00006724465,0.000101966754,0.00008074577,0.8977759,0.000620851,0.096551225,0.0014179512,0.000028264318],"about_ca_topic_score_codex":0.0071994094,"about_ca_topic_score_gemma":0.0096494425,"teacher_disagreement_score":0.012509876,"about_ca_system_score_codex":0.0014418818,"about_ca_system_score_gemma":0.0011236656,"threshold_uncertainty_score":0.06615937},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89258564,0.000916205,0.10014671,0.00032201223,0.00019777451,0.00025457577,0.0003972392,0.0008269462,0.0043529035],"genre_scores_gemma":[0.9190787,0.00016505404,0.07866473,0.00005729985,0.000019668369,0.000105446255,0.00044718428,0.00008716419,0.0013747179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999064,0.00040296,0.00006064901,0.0001783235,0.00021192743,0.000082150655],"domain_scores_gemma":[0.9860341,0.011244893,0.0005649643,0.0007579716,0.001142413,0.00025570553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030581073,0.0012561567,0.0008473965,0.0014921401,0.0004842639,0.00072642486,0.0015856049,0.001455589,0.0017507117],"category_scores_gemma":[0.011762435,0.0003376981,0.00046307742,0.00093389413,0.00063919934,0.0011330718,0.0006825849,0.0008319942,0.00022457346],"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.0019820316,0.0016189347,0.004440311,0.00055605714,0.0002497508,0.00012317087,0.00012793449,0.8758388,0.010970213,0.0031979533,0.0015207041,0.09937412],"study_design_scores_gemma":[0.00007148862,0.0003918047,0.0009099825,0.00001288053,0.000027396483,0.000029440165,0.00003673264,0.99417925,0.0034391677,0.0007764247,0.00011761677,0.000007699902],"about_ca_topic_score_codex":0.0042539043,"about_ca_topic_score_gemma":0.0038487036,"teacher_disagreement_score":0.0042539043,"about_ca_system_score_codex":0.000866712,"about_ca_system_score_gemma":0.00063410366,"threshold_uncertainty_score":0.016173005},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076360546,0.00023341835,0.9211592,0.000093128525,0.000011670517,0.00004997253,0.00012317163,0.00012761369,0.0018412581],"genre_scores_gemma":[0.8821823,0.00029946273,0.11632556,0.000021914375,0.00004712187,0.00012759882,0.00014751962,0.000034687055,0.0008138448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976427,0.0009113431,0.0001245274,0.0005464425,0.0006574815,0.00011755595],"domain_scores_gemma":[0.99193233,0.004667685,0.0011959384,0.0011930865,0.00079170737,0.00021930838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025442785,0.0005264485,0.0012246054,0.0043475307,0.00067375856,0.0024313084,0.0019041472,0.0011282332,0.0011977758],"category_scores_gemma":[0.017275874,0.0004043645,0.00070595636,0.004184264,0.0015806601,0.0066595087,0.002438153,0.0007436908,0.00021982339],"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.00023208864,0.00034238742,0.021575635,0.00031559748,0.00035489196,0.00025680388,0.00090764184,0.500663,0.01110138,0.2360223,0.0011746536,0.22705366],"study_design_scores_gemma":[0.000004660313,0.00007278647,0.0042271926,0.00001747335,0.000056221055,0.00013765538,0.0001874911,0.92623496,0.0011649912,0.06727456,0.0005983727,0.000023546621],"about_ca_topic_score_codex":0.001721305,"about_ca_topic_score_gemma":0.001441065,"teacher_disagreement_score":0.0043475307,"about_ca_system_score_codex":0.0007934871,"about_ca_system_score_gemma":0.0006539311,"threshold_uncertainty_score":0.013455629},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006348067,0.001226165,0.005920122,0.1560051,0.791346,0.00019701621,0.013393672,0.005252681,0.026024396],"genre_scores_gemma":[0.027129147,0.005166065,0.022490894,0.15426359,0.1282616,0.0012562689,0.021512251,0.012007267,0.62791294],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9941695,0.0013533517,0.00074739894,0.00076618657,0.0024848438,0.00047882413],"domain_scores_gemma":[0.9371693,0.013806956,0.0024498876,0.0035695713,0.041053362,0.0019509507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00414814,0.0018199153,0.0015344963,0.0055657797,0.005400022,0.0043750545,0.0046838894,0.0063529178,0.15274604],"category_scores_gemma":[0.07146659,0.0012623636,0.0026161429,0.005497757,0.0022787286,0.004004888,0.0035960604,0.010193724,0.079870105],"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.000008043941,0.0000035609464,0.000029074037,0.000022134756,0.0000021556316,0.000029385124,0.000043617256,0.000024802759,0.000020616362,0.00048706264,0.99826247,0.0010670266],"study_design_scores_gemma":[0.000032205993,0.000009707257,0.00096427806,0.00016205818,0.000012757734,0.000079512974,0.00023058121,0.00023406786,0.0001307576,0.0016696526,0.9964322,0.000042315372],"about_ca_topic_score_codex":0.14327982,"about_ca_topic_score_gemma":0.16235387,"teacher_disagreement_score":0.15274604,"about_ca_system_score_codex":0.0060351864,"about_ca_system_score_gemma":0.007572642,"threshold_uncertainty_score":0.5109864},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086155796,0.000024634017,0.9983966,0.000082464336,0.000017553386,0.000091449,0.000011224837,0.0001804906,0.00033404143],"genre_scores_gemma":[0.03276476,0.000057292356,0.9657034,0.00009979498,0.00003474523,0.0003292919,0.00007149514,0.00005820901,0.0008809636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99508977,0.0019406035,0.0004067823,0.0012515016,0.0010604201,0.0002509751],"domain_scores_gemma":[0.99130684,0.0034292606,0.0007463789,0.00216348,0.0019735424,0.0003805242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006535323,0.0011708824,0.0008855577,0.0021553186,0.0019245857,0.0018192589,0.0032926584,0.0029679055,0.002597825],"category_scores_gemma":[0.02040763,0.0008916435,0.0013375494,0.0020465574,0.002007154,0.004387633,0.0037987265,0.002242372,0.0015535783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002027688,0.00029268963,0.0016970314,0.00035006314,0.0001275082,0.00023866726,0.000671805,0.16457762,0.026126971,0.44601977,0.011489736,0.3482054],"study_design_scores_gemma":[0.00007662295,0.00017162145,0.00018075052,0.000035169884,0.000038708793,0.0002849387,0.00005594725,0.87682605,0.008825782,0.09731196,0.016138818,0.000053585994],"about_ca_topic_score_codex":0.0011368229,"about_ca_topic_score_gemma":0.0014010719,"teacher_disagreement_score":0.006535323,"about_ca_system_score_codex":0.001795832,"about_ca_system_score_gemma":0.0019339031,"threshold_uncertainty_score":0.03456247},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025286473,0.00026198817,0.97060996,0.00073313527,0.00002908668,0.0001295593,0.0003101239,0.00095762225,0.0016821001],"genre_scores_gemma":[0.39651808,0.00039280546,0.5973668,0.00049218454,0.00017209617,0.00033855197,0.001945272,0.00044610153,0.002328036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99429566,0.0021134107,0.00026150266,0.0014798854,0.0014764782,0.00037301535],"domain_scores_gemma":[0.97002137,0.022079518,0.0021837167,0.002783092,0.0021654507,0.00076686527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005106653,0.0017012026,0.0016771012,0.0026228474,0.0019554826,0.0025182085,0.004325534,0.0024563905,0.0022862735],"category_scores_gemma":[0.040026173,0.0011796857,0.0016125293,0.0027648741,0.0029211293,0.0069600805,0.005017409,0.0035896196,0.00077513204],"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.00057028333,0.00044114527,0.0066300468,0.0009334553,0.00026791423,0.0008222452,0.0010114888,0.5899249,0.010461146,0.12200085,0.01972857,0.247208],"study_design_scores_gemma":[0.00003972219,0.000026142632,0.00033438051,0.000026795224,0.000019693674,0.00017430657,0.00009771327,0.8674256,0.0021860306,0.12821142,0.0014443296,0.000013871832],"about_ca_topic_score_codex":0.002777444,"about_ca_topic_score_gemma":0.004439365,"teacher_disagreement_score":0.005106653,"about_ca_system_score_codex":0.0016045184,"about_ca_system_score_gemma":0.0020142377,"threshold_uncertainty_score":0.027006924},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93783516,0.0005802785,0.032843333,0.004761947,0.00017747252,0.000060195467,0.00049119594,0.00021179068,0.02303866],"genre_scores_gemma":[0.9916413,0.0002007473,0.0015107583,0.00013464085,0.000051548846,0.000026024045,0.00020325412,0.000028688215,0.0062030884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974316,0.000054837063,0.0000080111995,0.00006599389,0.000046956182,0.00008106928],"domain_scores_gemma":[0.9961356,0.0018344682,0.00066472293,0.00020382104,0.00022909006,0.00093234994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074067287,0.00021977392,0.00059490756,0.0007448178,0.0012459157,0.0019735743,0.0012175089,0.0018999061,0.010796956],"category_scores_gemma":[0.0122975195,0.00038904342,0.00045002848,0.0006829632,0.001397078,0.004738827,0.001968243,0.0017436285,0.0009154249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014170677,0.00046859888,0.031017568,0.00022255062,0.00023410202,0.0031993496,0.0025336214,0.32566246,0.013411939,0.56151897,0.025448494,0.034865327],"study_design_scores_gemma":[0.00012175689,0.0002655459,0.02613448,0.00005817414,0.00007654267,0.00063380535,0.0022073982,0.71671057,0.0015184551,0.24597378,0.0061962944,0.000103193495],"about_ca_topic_score_codex":0.005360781,"about_ca_topic_score_gemma":0.0045832484,"teacher_disagreement_score":0.010796956,"about_ca_system_score_codex":0.0011989407,"about_ca_system_score_gemma":0.00050969527,"threshold_uncertainty_score":0.03611946},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9053975,0.0071210167,0.07877535,0.00038380048,0.00011689545,0.00015665645,0.0046023717,0.0009019376,0.0025445234],"genre_scores_gemma":[0.9801491,0.0004980399,0.016561821,0.000033947552,0.000108351654,0.000040338055,0.0015079874,0.00002255738,0.0010779772],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973673,0.0010165642,0.00031023438,0.0005958946,0.00059348275,0.000116496216],"domain_scores_gemma":[0.97375655,0.018083286,0.0024581917,0.0016218829,0.0036214597,0.00045856135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003967848,0.00058558094,0.00096695236,0.005401979,0.0002259599,0.0011140625,0.0006382427,0.0010645519,0.0010627137],"category_scores_gemma":[0.02099176,0.00027600155,0.00067754445,0.0029484075,0.0001615415,0.0017791324,0.0004734656,0.0003874717,0.0006102046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022201098,0.00075834605,0.6825487,0.00094115775,0.002032926,0.00040664416,0.0003489681,0.031023035,0.0183885,0.0006840333,0.004475919,0.25617167],"study_design_scores_gemma":[0.000039875158,0.0007213765,0.38303956,0.000060096907,0.000803419,0.0009719011,0.00016163169,0.6045314,0.007119507,0.0009679278,0.001488888,0.00009451785],"about_ca_topic_score_codex":0.0022618738,"about_ca_topic_score_gemma":0.005895161,"teacher_disagreement_score":0.005401979,"about_ca_system_score_codex":0.0002966266,"about_ca_system_score_gemma":0.0005054522,"threshold_uncertainty_score":0.020984232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9210181,0.00094775856,0.059850283,0.001189225,0.00015098737,0.00011680883,0.00077698333,0.0002280748,0.015721781],"genre_scores_gemma":[0.99573755,0.00023519534,0.0020874937,0.00003281721,0.00001170416,0.000057786365,0.00017301712,0.000010806044,0.0016535465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999551,0.00017311946,0.000020255464,0.000061121595,0.000058890822,0.00013560832],"domain_scores_gemma":[0.99849844,0.00082868186,0.00019059624,0.000058304795,0.00027683264,0.00014717692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009447658,0.0010482939,0.0008499552,0.0012237744,0.0011048333,0.0007851083,0.0011715887,0.0012482313,0.0031970325],"category_scores_gemma":[0.0021739306,0.00033262078,0.0012920813,0.0009469755,0.0006755779,0.0011464003,0.0011215076,0.0011915535,0.00014306711],"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.000028997914,0.000025353553,0.002687749,0.00003188283,0.000022128594,0.00018222067,0.000044530367,0.9932816,0.00021325893,0.002176484,0.00039942563,0.00090639753],"study_design_scores_gemma":[0.0000068383456,0.000017075441,0.00047132233,0.0000048559064,0.000010847662,0.000012616782,0.000054552525,0.9986607,0.00007372058,0.00056156924,0.00012030325,0.0000054811153],"about_ca_topic_score_codex":0.05459347,"about_ca_topic_score_gemma":0.020340301,"teacher_disagreement_score":0.05459347,"about_ca_system_score_codex":0.0015808163,"about_ca_system_score_gemma":0.0010309662,"threshold_uncertainty_score":0.10855138},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014986953,0.002068875,0.8393237,0.0027794498,0.0012548631,0.0009985123,0.028183738,0.08282634,0.02757758],"genre_scores_gemma":[0.088015035,0.0013276483,0.81873584,0.0013566574,0.000373258,0.0015453912,0.05855758,0.011809413,0.018279094],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970433,0.0007004041,0.00013668794,0.0008896317,0.0009230639,0.0003068913],"domain_scores_gemma":[0.9960716,0.0017293714,0.00020730452,0.0010666782,0.00059864164,0.00032632807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022093463,0.00244526,0.0024241772,0.0040883357,0.0031836892,0.005678051,0.008093423,0.0034782705,0.033488575],"category_scores_gemma":[0.011025528,0.0013049907,0.002497596,0.0073986286,0.0013237831,0.005243369,0.005780071,0.0032061338,0.016977485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001063149,0.0005226085,0.0048866994,0.0023601393,0.00075009034,0.0006354806,0.0006228896,0.099800944,0.0058391946,0.13840291,0.44501296,0.30010298],"study_design_scores_gemma":[0.00021296539,0.00011181945,0.0008386107,0.00012890472,0.000066166285,0.00068032497,0.00023899217,0.6501946,0.0065771104,0.15725328,0.18361424,0.00008303623],"about_ca_topic_score_codex":0.0053893477,"about_ca_topic_score_gemma":0.010676166,"teacher_disagreement_score":0.033488575,"about_ca_system_score_codex":0.0016752493,"about_ca_system_score_gemma":0.0030849883,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8647568,0.00016055514,0.12267839,0.0009348595,0.00005336184,0.000026760366,0.000054737266,0.00013492495,0.011199489],"genre_scores_gemma":[0.99610424,0.000043622353,0.0026903378,0.000023631852,0.000022461501,0.000016333875,0.000012375517,0.00001521698,0.0010717658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933845,0.00022082259,0.000020514623,0.00022593426,0.00008584449,0.000108385415],"domain_scores_gemma":[0.9908948,0.0044885585,0.0023214275,0.0009744875,0.00054977636,0.00077106466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017833649,0.00020153516,0.0004977396,0.0009171409,0.0008758866,0.0021331678,0.0008374231,0.00085702684,0.0033502216],"category_scores_gemma":[0.014165886,0.00026787227,0.0003471657,0.00086129573,0.0021551535,0.004296376,0.0019582447,0.0009403743,0.00027002336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065381464,0.0002452054,0.06475476,0.00018216662,0.00027122925,0.0009009916,0.0054187397,0.33593303,0.022351991,0.49280828,0.0033651756,0.07311467],"study_design_scores_gemma":[0.000054425345,0.0001781374,0.040252127,0.00003018312,0.00008279672,0.00040408492,0.0035651936,0.5497052,0.0020408495,0.40057927,0.003047835,0.00005993135],"about_ca_topic_score_codex":0.0011012454,"about_ca_topic_score_gemma":0.0012579359,"teacher_disagreement_score":0.0033502216,"about_ca_system_score_codex":0.0008938969,"about_ca_system_score_gemma":0.0006104719,"threshold_uncertainty_score":0.01120764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046330616,0.00053962093,0.94954467,0.00030987736,0.000046982466,0.00010302392,0.00049864413,0.0008440592,0.0017825435],"genre_scores_gemma":[0.45542845,0.0005475796,0.5369059,0.00012485361,0.0001608908,0.00014254788,0.0021208208,0.00022626846,0.004342725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907076,0.00031163797,0.000039006438,0.00024249844,0.00023568129,0.00010031185],"domain_scores_gemma":[0.9945728,0.003559805,0.00039547993,0.00075280864,0.0005255988,0.00019340975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010933044,0.000900472,0.0012604845,0.0029326712,0.0008933167,0.0015259766,0.0021075578,0.0012823866,0.0017092663],"category_scores_gemma":[0.008333851,0.000730761,0.0010453052,0.0034534512,0.00070343824,0.0036231175,0.0018260918,0.0013106131,0.00080454466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005212209,0.0005817917,0.010708693,0.00068723905,0.00043294215,0.00033323665,0.00043797118,0.3474257,0.027800726,0.065183304,0.019148782,0.5267384],"study_design_scores_gemma":[0.000008372027,0.000015491323,0.0004822474,0.0000074106715,0.000012349995,0.000074899755,0.000025724778,0.97436595,0.001078175,0.023368873,0.0005531564,0.000007337296],"about_ca_topic_score_codex":0.003947161,"about_ca_topic_score_gemma":0.008278148,"teacher_disagreement_score":0.003947161,"about_ca_system_score_codex":0.0006888171,"about_ca_system_score_gemma":0.0008472637,"threshold_uncertainty_score":0.007848382},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008627901,0.00036339246,0.98749393,0.0005224648,0.00005380484,0.000068547706,0.0005800182,0.00023005198,0.0020598604],"genre_scores_gemma":[0.56091654,0.0032419206,0.40761444,0.00084394583,0.0005541006,0.0017725623,0.0035867458,0.00048998126,0.020979762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758923,0.0014508157,0.00009029293,0.00037770314,0.00030939977,0.00018261325],"domain_scores_gemma":[0.9895152,0.007477134,0.0011534126,0.00088431255,0.0006811294,0.0002889194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051065823,0.0011947891,0.0019456928,0.0022131556,0.00092435605,0.0017535549,0.0033311506,0.0019479295,0.00716937],"category_scores_gemma":[0.019424878,0.0009387629,0.0018273104,0.0024771765,0.0017091745,0.0037592868,0.0020576995,0.0031941996,0.0016241557],"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.000037507194,0.000030163843,0.0013660407,0.00007951807,0.00007330523,0.000095038056,0.00018209853,0.43391454,0.0003753566,0.5513428,0.0033783175,0.00912533],"study_design_scores_gemma":[0.000010551907,0.00000999756,0.0001559409,0.000011597472,0.000009899656,0.000019352903,0.000015285685,0.805674,0.00005120281,0.19237961,0.0016525483,0.000010034459],"about_ca_topic_score_codex":0.010670265,"about_ca_topic_score_gemma":0.011468554,"teacher_disagreement_score":0.010670265,"about_ca_system_score_codex":0.0015805614,"about_ca_system_score_gemma":0.0012548496,"threshold_uncertainty_score":0.027006507},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9413392,0.00040487375,0.05207559,0.00095738884,0.00009169198,0.000038986786,0.0003616038,0.000098874516,0.0046318844],"genre_scores_gemma":[0.99648917,0.00013147334,0.0016255822,0.000023835175,0.000022456277,0.000019335439,0.00009524646,0.000010326002,0.0015826101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989915,0.00002699422,0.0000035561268,0.000029519997,0.0000117120135,0.00002903042],"domain_scores_gemma":[0.99927384,0.0005016679,0.000076501165,0.000014191012,0.0000884315,0.000045466575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006001539,0.0004750481,0.00034751225,0.0005124821,0.00044418938,0.0009213788,0.0005714042,0.00062747503,0.0016702261],"category_scores_gemma":[0.0024825009,0.0002951909,0.00037081607,0.00048943964,0.00042992076,0.0012247039,0.00041312582,0.0005948957,0.00015550209],"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.000155552,0.000110000976,0.026276266,0.00010704073,0.00007063857,0.00033339992,0.00046113573,0.93344086,0.00241094,0.020799404,0.0022199193,0.013614836],"study_design_scores_gemma":[0.0000015109796,0.0000038173307,0.0012021575,0.0000014005818,0.0000055088058,0.00000349953,0.00001947467,0.9978981,0.00004248802,0.00076584454,0.000053766264,0.0000023605749],"about_ca_topic_score_codex":0.052533295,"about_ca_topic_score_gemma":0.03431272,"teacher_disagreement_score":0.052533295,"about_ca_system_score_codex":0.00096105726,"about_ca_system_score_gemma":0.0009302207,"threshold_uncertainty_score":0.104455054},"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":"incentives","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"incentives","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99638945,0.000090387795,0.00088494906,0.00028003118,0.0000033593647,0.000047872287,0.000166267,0.000013428145,0.0021242737],"genre_scores_gemma":[0.9967631,0.00019057393,0.0018995128,0.00005567166,0.000012361531,0.00006571709,0.00024414956,0.000016269005,0.0007526477],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9953524,0.0029449027,0.00022275247,0.00037794208,0.0005642002,0.00053787703],"domain_scores_gemma":[0.9766183,0.015085575,0.00304847,0.0009838677,0.0013899439,0.002873801],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0036623478,0.00040607844,0.0004909334,0.0043994756,0.0046805292,0.0030354315,0.001834878,0.0016476021,0.0026450646],"category_scores_gemma":[0.011154991,0.000384463,0.0005477324,0.0092462385,0.002580353,0.0023099806,0.0033767521,0.0012065943,0.00052771653],"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.00058745756,0.0028546706,0.5810653,0.00069808203,0.0002604336,0.048647005,0.30104616,0.009913612,0.0024544674,0.0053527635,0.0033507918,0.043769218],"study_design_scores_gemma":[0.00011412539,0.0010468457,0.36045018,0.00027036274,0.0001893362,0.008044698,0.5837089,0.024580663,0.0021675387,0.0032473884,0.015964484,0.00021545333],"about_ca_topic_score_codex":0.031555507,"about_ca_topic_score_gemma":0.044222757,"teacher_disagreement_score":0.99633765,"about_ca_system_score_codex":0.003249463,"about_ca_system_score_gemma":0.002347898,"threshold_uncertainty_score":0.062743664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017984461,0.00029666748,0.97836256,0.00015130891,0.000036801284,0.00006617078,0.0013236984,0.0009383357,0.000839853],"genre_scores_gemma":[0.5312562,0.00068399863,0.45708948,0.00016630458,0.00012401046,0.00030275097,0.0073266234,0.00021561638,0.002835055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993082,0.0001575057,0.00004837437,0.00021698154,0.00020585643,0.00006311742],"domain_scores_gemma":[0.99824905,0.0007725049,0.00025537823,0.00032134197,0.0003054685,0.00009630527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078603806,0.000750457,0.0009819391,0.0033894547,0.0005411996,0.001568887,0.0016829192,0.0013653805,0.0021265452],"category_scores_gemma":[0.0049039815,0.0003903489,0.0010197418,0.0033343087,0.00039464748,0.0023402527,0.0014541543,0.0013768787,0.0009996516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004285331,0.00034940313,0.007981676,0.00046664433,0.00025555177,0.00040748785,0.0004187886,0.36980695,0.014569409,0.04197842,0.015460327,0.5478768],"study_design_scores_gemma":[0.0000064175497,0.000021117963,0.0005417633,0.000020242158,0.000022577648,0.00006625026,0.000048591584,0.9838471,0.0012206654,0.012793293,0.0014035283,0.000008372417],"about_ca_topic_score_codex":0.004859921,"about_ca_topic_score_gemma":0.009106074,"teacher_disagreement_score":0.004859921,"about_ca_system_score_codex":0.00069165253,"about_ca_system_score_gemma":0.00092999043,"threshold_uncertainty_score":0.009663284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012913671,0.001336795,0.95978945,0.0023774572,0.00045637228,0.00025994756,0.0010506401,0.0027866128,0.019028978],"genre_scores_gemma":[0.29089049,0.0023547346,0.65919393,0.0022430872,0.0006432748,0.0008963347,0.003667896,0.0019932,0.038117018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969013,0.0008944754,0.00014432908,0.0009753392,0.00072060694,0.00036401994],"domain_scores_gemma":[0.99254066,0.0041401098,0.00039467902,0.0017767521,0.00085364445,0.00029411982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030010755,0.0018007477,0.0021903035,0.0019852368,0.0025307778,0.003292535,0.0033558512,0.00231976,0.026340595],"category_scores_gemma":[0.013689703,0.001029906,0.0023452968,0.0037313658,0.0023162013,0.0062477924,0.0039963834,0.00426015,0.006297814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050129945,0.00027942072,0.0018553417,0.0006564722,0.00020992047,0.00017805512,0.00042189538,0.2847852,0.0020186962,0.29020858,0.061219797,0.3576654],"study_design_scores_gemma":[0.00011727943,0.00010784727,0.00034562213,0.000076781296,0.0000524254,0.00022487852,0.0001336993,0.6539941,0.001937175,0.30142322,0.041542538,0.000044413457],"about_ca_topic_score_codex":0.004624373,"about_ca_topic_score_gemma":0.0063180365,"teacher_disagreement_score":0.026340595,"about_ca_system_score_codex":0.0027657198,"about_ca_system_score_gemma":0.0037777617,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18278404,0.0031350811,0.73588157,0.007288962,0.000509814,0.00010591702,0.00058373646,0.00047060515,0.06924038],"genre_scores_gemma":[0.9018812,0.0047677737,0.056987092,0.0016036324,0.000933009,0.00029754228,0.000662938,0.00036170424,0.032505155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990771,0.00034767605,0.000029856907,0.000225063,0.00018418576,0.00013610348],"domain_scores_gemma":[0.9961128,0.0023841017,0.00045998459,0.00032270723,0.0003405024,0.00037990315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012822186,0.00083663745,0.0010011317,0.0017350602,0.001243708,0.0024988675,0.0012462877,0.003020319,0.006346242],"category_scores_gemma":[0.008948018,0.00050588406,0.0009123086,0.0013038452,0.0032897524,0.0064098733,0.0018209725,0.0020509874,0.001617058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002893942,0.000022514927,0.00066771166,0.00007459521,0.00001806472,0.00019282581,0.00019621462,0.04638493,0.0010301844,0.9455593,0.0021511326,0.0036735283],"study_design_scores_gemma":[0.000020707022,0.00004876457,0.0005234644,0.000069330374,0.000015094059,0.00024835576,0.00010011347,0.31383407,0.00024083267,0.67968935,0.005168959,0.00004103147],"about_ca_topic_score_codex":0.0027195713,"about_ca_topic_score_gemma":0.0017609776,"teacher_disagreement_score":0.006346242,"about_ca_system_score_codex":0.00096580276,"about_ca_system_score_gemma":0.00058576907,"threshold_uncertainty_score":0.02123034},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04019569,0.0014222165,0.95258236,0.00023446942,0.00021798043,0.00025498838,0.0010510957,0.0008372749,0.0032038728],"genre_scores_gemma":[0.3416583,0.0008990392,0.6499571,0.00014918753,0.0002987167,0.0005597107,0.0026379717,0.00035622893,0.003483717],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948061,0.0014914513,0.00039958916,0.0007280936,0.002389746,0.00018513424],"domain_scores_gemma":[0.9922984,0.0030337726,0.0008391898,0.0009852049,0.0022746664,0.0005687846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026359342,0.0015595321,0.0015439661,0.010316398,0.0013264151,0.002505592,0.0019211584,0.0019545755,0.0017127262],"category_scores_gemma":[0.014937344,0.00044884562,0.0011093889,0.0081545245,0.0015548998,0.0062681376,0.0034749515,0.0013165101,0.00076642464],"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.0007908022,0.00049305346,0.031334504,0.0010525994,0.0010552594,0.000479083,0.0011699733,0.13768235,0.026242584,0.13014868,0.021706795,0.6478443],"study_design_scores_gemma":[0.00007008974,0.00048801932,0.008127312,0.000127156,0.00022572574,0.0009447527,0.0005568911,0.8574761,0.007381416,0.10956609,0.014875391,0.0001611304],"about_ca_topic_score_codex":0.0039642956,"about_ca_topic_score_gemma":0.004220982,"teacher_disagreement_score":0.010316398,"about_ca_system_score_codex":0.0015344546,"about_ca_system_score_gemma":0.0009946773,"threshold_uncertainty_score":0.013940334},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29922214,0.007826901,0.6649502,0.0019289721,0.00031413074,0.00007380042,0.0002552596,0.00020954126,0.02521904],"genre_scores_gemma":[0.976217,0.004294967,0.01566407,0.00015426097,0.0004493836,0.00009694293,0.00012325247,0.00006948275,0.0029306563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992544,0.00035670356,0.000032632608,0.00011983996,0.00015444122,0.00008193376],"domain_scores_gemma":[0.98910564,0.009050602,0.0007305148,0.00027352094,0.0005342909,0.0003054998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028757064,0.00076563255,0.000759007,0.001858402,0.0004912019,0.0012318551,0.0011261662,0.0010677476,0.0018026043],"category_scores_gemma":[0.013289835,0.00036911498,0.00056306855,0.0012741509,0.0031497634,0.0026065377,0.0009927172,0.0014860563,0.00027068658],"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.000082994746,0.00005033415,0.0015888845,0.00016341629,0.000041647534,0.00023943382,0.00026573671,0.28767553,0.004119842,0.69156104,0.0010640534,0.013147017],"study_design_scores_gemma":[0.000010928298,0.000034353903,0.0006527113,0.000045457782,0.00001260985,0.000067694375,0.000022968045,0.65758425,0.00034881674,0.34051037,0.00068541616,0.00002435255],"about_ca_topic_score_codex":0.0015016069,"about_ca_topic_score_gemma":0.0006444477,"teacher_disagreement_score":0.0028757064,"about_ca_system_score_codex":0.0012826059,"about_ca_system_score_gemma":0.0006036711,"threshold_uncertainty_score":0.0152083635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018034749,0.000592581,0.9750743,0.00060613255,0.000049176797,0.00007327496,0.0002477324,0.00013622444,0.0051859063],"genre_scores_gemma":[0.8031409,0.0029366252,0.1868877,0.00047692892,0.00038584537,0.00054511987,0.00037927157,0.00011348079,0.005134133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991596,0.00039024695,0.00004304517,0.00016009244,0.00016607433,0.00008110274],"domain_scores_gemma":[0.99555886,0.002858017,0.00084143505,0.00033205203,0.00022241846,0.00018724886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018234547,0.0010685099,0.0007431949,0.0031769082,0.0008145913,0.0014942104,0.001884954,0.002084583,0.003940109],"category_scores_gemma":[0.008993164,0.00049449765,0.0013328106,0.0019172801,0.0019621714,0.003610302,0.0013984285,0.0019010394,0.0005093271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009694007,0.000032028,0.0012179308,0.000055057477,0.000047064244,0.0002052187,0.00011034944,0.35371885,0.0016103133,0.63811064,0.0008687465,0.0040141726],"study_design_scores_gemma":[0.0000055826063,0.000025551539,0.00058088684,0.000019879963,0.000018605402,0.00011825519,0.000034677258,0.5986194,0.00017887089,0.39832917,0.0020491239,0.000020111866],"about_ca_topic_score_codex":0.003367712,"about_ca_topic_score_gemma":0.0017687483,"teacher_disagreement_score":0.003940109,"about_ca_system_score_codex":0.0012590633,"about_ca_system_score_gemma":0.0007684013,"threshold_uncertainty_score":0.013180971},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73702866,0.0005274071,0.25577736,0.00046615873,0.000031763808,0.00009455712,0.00008483486,0.00025797653,0.005731243],"genre_scores_gemma":[0.989121,0.000096724594,0.010171314,0.000046411846,0.000011316034,0.000025054438,0.00004035451,0.000010485622,0.0004773149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950564,0.00021452302,0.000016776145,0.000101835416,0.00009499857,0.00006618397],"domain_scores_gemma":[0.9951244,0.0032603578,0.00062625355,0.00032960507,0.00030113032,0.00035833134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015005628,0.00045973607,0.0008273697,0.0016896672,0.00093405263,0.001051084,0.0011016342,0.0007720068,0.0013626167],"category_scores_gemma":[0.0064704902,0.00038145733,0.0005619702,0.00064776116,0.0013315076,0.0015350085,0.0014004457,0.00060447113,0.0001835058],"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.00016744452,0.00012228932,0.0155464085,0.00015328982,0.00015839335,0.00041408368,0.00037751594,0.935824,0.0074052457,0.017177874,0.0013434697,0.021310039],"study_design_scores_gemma":[0.000020653704,0.00007733614,0.0024069743,0.000014102573,0.000033637225,0.00008404011,0.00010124149,0.9878351,0.0010797661,0.007898125,0.00043456678,0.000014413934],"about_ca_topic_score_codex":0.0027972881,"about_ca_topic_score_gemma":0.0030413277,"teacher_disagreement_score":0.0027972881,"about_ca_system_score_codex":0.00079052337,"about_ca_system_score_gemma":0.0004078654,"threshold_uncertainty_score":0.007935822},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0286599,0.0006556029,0.9631884,0.002308321,0.00007955983,0.00006549189,0.0002723865,0.00019715636,0.0045732204],"genre_scores_gemma":[0.76201576,0.002477248,0.2167477,0.0011108911,0.000662188,0.0005169477,0.0007362856,0.0003233599,0.015409576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979075,0.0014492517,0.000044303073,0.00027610763,0.00020855435,0.0001143502],"domain_scores_gemma":[0.97965896,0.016765855,0.0013151991,0.0009894458,0.0007171525,0.00055333355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006843914,0.0006804505,0.0011294666,0.0026180174,0.0008031716,0.0018323384,0.0026632966,0.0019344552,0.006221301],"category_scores_gemma":[0.029765353,0.00058503397,0.0011997735,0.0020382302,0.0019684806,0.004501118,0.0020663843,0.0026965316,0.00091823784],"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.000038414604,0.00007879196,0.0020077403,0.000053103282,0.000055693545,0.00021793076,0.0002864497,0.18053532,0.00027279055,0.79873866,0.0034423186,0.014272881],"study_design_scores_gemma":[0.000017542001,0.000017463033,0.00031847678,0.000021470043,0.000013254322,0.000072153234,0.00005163114,0.6615499,0.00005618957,0.33608213,0.0017797699,0.000019895897],"about_ca_topic_score_codex":0.005065429,"about_ca_topic_score_gemma":0.004582772,"teacher_disagreement_score":0.006843914,"about_ca_system_score_codex":0.0014120599,"about_ca_system_score_gemma":0.0007788994,"threshold_uncertainty_score":0.036194503},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041979775,0.0016369655,0.93193656,0.0030351118,0.00022981441,0.00006595926,0.0034532133,0.0041844295,0.013478243],"genre_scores_gemma":[0.51872367,0.0015032886,0.46932366,0.00030652405,0.00019530194,0.00023322456,0.0028116282,0.0012485207,0.005654231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996251,0.00016272902,0.00001649967,0.00007023447,0.00009334417,0.000032219068],"domain_scores_gemma":[0.99766797,0.0013248494,0.00023302498,0.00028781194,0.00029277842,0.00019350165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093274127,0.00065475056,0.0003828218,0.003548093,0.0006792539,0.0028282339,0.0006111929,0.0007243618,0.015221872],"category_scores_gemma":[0.0053378353,0.0003351331,0.0006218022,0.0022909609,0.0006673272,0.0032929122,0.0024127834,0.0015645644,0.0013703862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026911867,0.00006267406,0.009331304,0.0007432284,0.00025055688,0.0005217693,0.006124289,0.116803624,0.023400083,0.60657394,0.047410455,0.18850899],"study_design_scores_gemma":[0.000028236671,0.000036398753,0.007286204,0.0002567324,0.000062900705,0.00031581605,0.0014404054,0.33851326,0.0038200556,0.56903774,0.07913332,0.00006892885],"about_ca_topic_score_codex":0.0030825182,"about_ca_topic_score_gemma":0.004972613,"teacher_disagreement_score":0.015221872,"about_ca_system_score_codex":0.00069419894,"about_ca_system_score_gemma":0.00055635,"threshold_uncertainty_score":0.050922215},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009237361,0.00017613274,0.9832441,0.00044789698,0.0000410953,0.0002454672,0.00012290152,0.000072617215,0.006412308],"genre_scores_gemma":[0.45820388,0.0006290121,0.53198475,0.0001568469,0.000061229366,0.00093211635,0.00028450455,0.000047255264,0.00770041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625814,0.002281955,0.00014804247,0.0005509848,0.00041973556,0.00034108674],"domain_scores_gemma":[0.9975418,0.0015523083,0.0002664633,0.00008581404,0.0002987667,0.00025494018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050343815,0.0014632584,0.0012897208,0.0018540121,0.0017506084,0.0032580392,0.003449669,0.0026577092,0.009371083],"category_scores_gemma":[0.005049001,0.0008117537,0.0015278639,0.0020562853,0.002033577,0.0035484605,0.0022709526,0.0020698397,0.00063520245],"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.00007600164,0.0000654422,0.0004839307,0.00012167042,0.000044176813,0.00022428719,0.00027192588,0.68257904,0.0005613518,0.30227593,0.0009510871,0.012345113],"study_design_scores_gemma":[0.000029380344,0.000052695126,0.00009389434,0.00001639921,0.000017063705,0.000037395996,0.00012418936,0.89737177,0.0001749793,0.10032768,0.0017258824,0.000028681527],"about_ca_topic_score_codex":0.011625107,"about_ca_topic_score_gemma":0.012797318,"teacher_disagreement_score":0.011625107,"about_ca_system_score_codex":0.0038801464,"about_ca_system_score_gemma":0.0045764376,"threshold_uncertainty_score":0.03134936},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5859593,0.0012519485,0.40440533,0.000423347,0.00015371769,0.0004573587,0.0019856791,0.0012430995,0.0041202167],"genre_scores_gemma":[0.9110161,0.00028149475,0.08350852,0.000043114924,0.000058998547,0.00028284348,0.004076342,0.00009776711,0.00063477154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99326515,0.0024974595,0.0008556031,0.0011356014,0.0019536028,0.00029262863],"domain_scores_gemma":[0.9817934,0.008323837,0.0022152395,0.001959613,0.005279096,0.00042893065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0109468745,0.0011815571,0.0011772823,0.0058679585,0.0011502798,0.0026897064,0.0012324032,0.0010244738,0.0006259686],"category_scores_gemma":[0.040076938,0.00025878393,0.0010120383,0.004013759,0.0008863376,0.0032161495,0.0019833662,0.0008757218,0.0003949623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025018712,0.0008929756,0.21996321,0.0012446495,0.0008193234,0.00040023885,0.0021629757,0.35090932,0.017854279,0.018936725,0.0078990925,0.37641537],"study_design_scores_gemma":[0.000034872955,0.00022553724,0.018395388,0.000050971583,0.00006488705,0.0001397496,0.0004997691,0.96890134,0.0071644937,0.0032825489,0.001190927,0.000049642993],"about_ca_topic_score_codex":0.0045544878,"about_ca_topic_score_gemma":0.0029273622,"teacher_disagreement_score":0.0109468745,"about_ca_system_score_codex":0.0012720841,"about_ca_system_score_gemma":0.0013975105,"threshold_uncertainty_score":0.057893276},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20622036,0.0035381708,0.75931364,0.0024083378,0.0001756668,0.00013392081,0.0022411363,0.0001758542,0.02579293],"genre_scores_gemma":[0.79425657,0.0049552224,0.18902789,0.00025389483,0.00027029542,0.00039529,0.0015503756,0.00008797572,0.00920237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999311,0.00027553225,0.000034102715,0.00017336072,0.00014255858,0.00006352484],"domain_scores_gemma":[0.9978667,0.0011997012,0.00033558055,0.00018522766,0.0002567644,0.00015600112],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0009826008,0.0004860559,0.00038396762,0.004540201,0.000801004,0.001768654,0.000772221,0.00089096325,0.0028397066],"category_scores_gemma":[0.005276784,0.00023977898,0.00055405276,0.006638418,0.0010032391,0.005352224,0.0011753443,0.00078848004,0.00037098842],"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.00008600347,0.000045287463,0.007598935,0.00026289115,0.00010551363,0.0002609528,0.0008256652,0.054697566,0.0036513114,0.89011276,0.0023009228,0.040052224],"study_design_scores_gemma":[0.00002026951,0.00007952001,0.0067759166,0.00012406778,0.00010775619,0.0005612554,0.00065729796,0.25323978,0.0015733262,0.7006276,0.036180533,0.000052751744],"about_ca_topic_score_codex":0.0018426523,"about_ca_topic_score_gemma":0.0013594973,"teacher_disagreement_score":0.9954598,"about_ca_system_score_codex":0.0011368413,"about_ca_system_score_gemma":0.0004351066,"threshold_uncertainty_score":0.009499788},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036653543,0.00041218766,0.9937239,0.0006487919,0.000035291414,0.000017914368,0.00013662125,0.00015216555,0.0012078334],"genre_scores_gemma":[0.27657506,0.0029404326,0.71398336,0.00063623337,0.0004260964,0.00034344613,0.0011382505,0.00042961852,0.0035275614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592847,0.0022261203,0.00022126295,0.00083941745,0.0006230491,0.00016164801],"domain_scores_gemma":[0.95197994,0.04168531,0.001812289,0.0030155585,0.0010524234,0.00045458227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009824265,0.0014169384,0.0017773786,0.0033038666,0.0014699355,0.0033956505,0.0037194726,0.0021946703,0.0038456717],"category_scores_gemma":[0.06775109,0.0014784533,0.0018551268,0.002989888,0.0042886683,0.007648722,0.003008595,0.005029786,0.0007647568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004238645,0.000024380173,0.0019293258,0.00017802713,0.00009409794,0.00020035,0.00016860127,0.32652,0.00045773658,0.6353799,0.0018533127,0.03315183],"study_design_scores_gemma":[0.000007599736,0.000005635399,0.00017649932,0.00003140018,0.000010287631,0.00004135715,0.000015999667,0.47414657,0.00018056242,0.5243044,0.0010683307,0.000011308141],"about_ca_topic_score_codex":0.006984964,"about_ca_topic_score_gemma":0.011112781,"teacher_disagreement_score":0.009824265,"about_ca_system_score_codex":0.0029558376,"about_ca_system_score_gemma":0.0021364703,"threshold_uncertainty_score":0.051956296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7938669,0.00077667914,0.19525439,0.0013800665,0.000024729721,0.00006835588,0.0001661112,0.00012881968,0.008334045],"genre_scores_gemma":[0.9945199,0.0002111507,0.0038096707,0.00003671524,0.000025175006,0.00003942819,0.00003761367,0.000010019733,0.0013104345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991435,0.00042412573,0.00003069539,0.00017481645,0.00011789132,0.000108938104],"domain_scores_gemma":[0.9920997,0.0051206267,0.0017974139,0.00039383344,0.00023566597,0.0003526585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019431323,0.00041854766,0.0005539781,0.001721773,0.000841329,0.0019195399,0.0011145077,0.0016294841,0.001988978],"category_scores_gemma":[0.015213733,0.0004278908,0.00054887484,0.0014517047,0.0022327907,0.003949241,0.0016050785,0.0010919195,0.00029696076],"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.00013538473,0.0001418506,0.04483965,0.00008574415,0.0002100757,0.00055954856,0.0018542554,0.5264741,0.0020787225,0.40167233,0.0012716418,0.02067675],"study_design_scores_gemma":[0.000018907192,0.000047757818,0.010016241,0.000021982187,0.00003704352,0.00018243391,0.00020858228,0.80001664,0.00024133743,0.18839665,0.0007810762,0.000031466836],"about_ca_topic_score_codex":0.003670468,"about_ca_topic_score_gemma":0.0038511266,"teacher_disagreement_score":0.003670468,"about_ca_system_score_codex":0.0013447624,"about_ca_system_score_gemma":0.0003863668,"threshold_uncertainty_score":0.010276377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22978936,0.0033911155,0.7505786,0.003763679,0.00017822692,0.000064433145,0.00018284816,0.000325552,0.011726145],"genre_scores_gemma":[0.9666562,0.0017413994,0.02893125,0.00016029623,0.00022918254,0.00006393265,0.000053210086,0.000051135732,0.0021133826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998985,0.00042040844,0.000072733645,0.00024419164,0.000183855,0.00009371589],"domain_scores_gemma":[0.98477477,0.011072257,0.0018877708,0.0010984865,0.0006673643,0.000499313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031385184,0.00039480967,0.0006497521,0.0017144163,0.00064142706,0.0024228122,0.0006787915,0.0010488578,0.0014181458],"category_scores_gemma":[0.02475768,0.0004420012,0.0005463512,0.0010999324,0.0028548639,0.0056280685,0.0014432576,0.0014824296,0.00018453297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069602094,0.000023180608,0.0061349,0.00014149016,0.00007256002,0.00019785574,0.0008296736,0.070235655,0.0038392849,0.89550644,0.0011225536,0.021826888],"study_design_scores_gemma":[0.000018218787,0.000027889886,0.002494119,0.000032544136,0.000023357696,0.00018990079,0.0000880806,0.2697473,0.00053973973,0.7246793,0.0021360419,0.000023478362],"about_ca_topic_score_codex":0.0012990031,"about_ca_topic_score_gemma":0.0007189791,"teacher_disagreement_score":0.0031385184,"about_ca_system_score_codex":0.0011536666,"about_ca_system_score_gemma":0.00041222732,"threshold_uncertainty_score":0.016598225},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34987077,0.0015302893,0.6361642,0.00095576304,0.00015020676,0.00007082264,0.00015351459,0.00041513343,0.010689317],"genre_scores_gemma":[0.9776718,0.0007741594,0.019610802,0.00004350639,0.000049258168,0.000049950628,0.00008179587,0.000046652665,0.0016720337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983191,0.0004273786,0.00010368181,0.0003453989,0.0006460373,0.0001584551],"domain_scores_gemma":[0.9871159,0.007199585,0.0022064866,0.0017057888,0.0014419853,0.00033021774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021526385,0.0005506171,0.000609641,0.0012164215,0.00041744232,0.0013718957,0.0007591492,0.00074954826,0.0011096696],"category_scores_gemma":[0.021138733,0.00029473982,0.00048783736,0.0009296679,0.001295807,0.0025042004,0.0010009187,0.00090479845,0.0002005325],"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.00016156143,0.00005768501,0.0042957524,0.000107254054,0.00007256217,0.000188428,0.00030304544,0.85940266,0.0052484344,0.09170052,0.00071867526,0.037743412],"study_design_scores_gemma":[0.0000119005135,0.00009611672,0.001847215,0.000024130359,0.000021724169,0.00014893862,0.00008591788,0.91123945,0.0034044713,0.081460826,0.0016381008,0.000021182612],"about_ca_topic_score_codex":0.00088399585,"about_ca_topic_score_gemma":0.00028406692,"teacher_disagreement_score":0.0021526385,"about_ca_system_score_codex":0.00095133664,"about_ca_system_score_gemma":0.0004625443,"threshold_uncertainty_score":0.011384368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93724585,0.0007086093,0.05604973,0.0006218335,0.000078873134,0.00010842564,0.00031565476,0.00012011287,0.004750944],"genre_scores_gemma":[0.9959461,0.00021058293,0.0026631148,0.000027311593,0.00001935063,0.000030324793,0.00008866933,0.000008694514,0.0010058159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993394,0.0002021329,0.000027962697,0.00015397946,0.000093888004,0.00018261881],"domain_scores_gemma":[0.9940639,0.004293784,0.0008623625,0.00017575333,0.0004179987,0.000186321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001498553,0.0009978204,0.00058686495,0.0012098685,0.0005328831,0.0011765996,0.0010403998,0.0016136495,0.0012248241],"category_scores_gemma":[0.0075469664,0.00039869625,0.0010996007,0.00064872496,0.0005982285,0.0018563273,0.0007505339,0.0010118696,0.00016862155],"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.00012238769,0.00020831042,0.025390236,0.00011408201,0.00009267746,0.00048664844,0.00026124343,0.9534856,0.0034671784,0.007944481,0.0008516212,0.00757557],"study_design_scores_gemma":[0.0000062011823,0.000044257686,0.0016065603,0.0000050061194,0.000022381228,0.000038512702,0.000049025202,0.9970573,0.00032127806,0.00067460304,0.00016483042,0.000010114578],"about_ca_topic_score_codex":0.024020296,"about_ca_topic_score_gemma":0.008113366,"teacher_disagreement_score":0.024020296,"about_ca_system_score_codex":0.0016889058,"about_ca_system_score_gemma":0.0009827178,"threshold_uncertainty_score":0.047760963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04140112,0.00014647393,0.95678806,0.00025305458,0.000033318178,0.000039587827,0.00020870523,0.00020555442,0.00092410884],"genre_scores_gemma":[0.8431378,0.00045535274,0.149387,0.00011170258,0.00012074463,0.00021915279,0.0008283639,0.0001355845,0.0056043062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999316,0.00031804136,0.000032522337,0.00015504859,0.00012726782,0.0000512047],"domain_scores_gemma":[0.99405694,0.0043805875,0.0006310669,0.00037491845,0.0003935772,0.00016293397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013201004,0.0008469122,0.00064683944,0.0014194362,0.0005251314,0.0013937086,0.0013243145,0.0012170068,0.0015520708],"category_scores_gemma":[0.009539298,0.000609752,0.0008639655,0.0010652503,0.00082665577,0.0034647963,0.0013182277,0.0014162577,0.00041194702],"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.000052742384,0.00010230708,0.0025818583,0.00007477413,0.0000686985,0.00009576177,0.00013259283,0.9132601,0.000996627,0.05515009,0.0012590487,0.026225356],"study_design_scores_gemma":[0.0000013981993,0.0000030215483,0.000060132938,0.000002175746,0.0000026150442,0.0000048758175,0.00000759662,0.98723096,0.00006697237,0.012493436,0.00012525791,0.0000015830233],"about_ca_topic_score_codex":0.0045668767,"about_ca_topic_score_gemma":0.007952475,"teacher_disagreement_score":0.0045668767,"about_ca_system_score_codex":0.0007887058,"about_ca_system_score_gemma":0.0007183624,"threshold_uncertainty_score":0.009080589},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9661573,0.0005133094,0.006924435,0.0008382427,0.000052528147,0.00007261511,0.0064655575,0.0001495563,0.018826332],"genre_scores_gemma":[0.99187285,0.000106808715,0.00077469146,0.000020445312,0.000022224987,0.000027690956,0.0020006632,0.0000088263205,0.0051658484],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956614,0.00008021182,0.000027762026,0.0001026421,0.00011705059,0.000106233616],"domain_scores_gemma":[0.9981686,0.00064749166,0.00032342414,0.00013346998,0.0005020099,0.00022503619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069217884,0.00024497957,0.00030973196,0.0035319787,0.0011391438,0.0010745268,0.00054913363,0.00044046013,0.0074938796],"category_scores_gemma":[0.0027575097,0.00013639171,0.00030790918,0.004188665,0.0003514051,0.0016042573,0.0008064224,0.0003708247,0.0011085559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026699193,0.00020132323,0.8497892,0.00021947667,0.00008583781,0.0009790069,0.0026607763,0.009579772,0.0014221519,0.027694596,0.015092968,0.09200779],"study_design_scores_gemma":[0.000015040257,0.00010732198,0.6673022,0.0000740972,0.00012860046,0.0003490641,0.0034434684,0.2881472,0.0018766789,0.010926723,0.027570264,0.00005926352],"about_ca_topic_score_codex":0.06766411,"about_ca_topic_score_gemma":0.07782034,"teacher_disagreement_score":0.06766411,"about_ca_system_score_codex":0.0017146326,"about_ca_system_score_gemma":0.0014509002,"threshold_uncertainty_score":0.13454056},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954691,0.00015930927,0.0019967866,0.00021720864,0.000008026522,0.000042449403,0.00022764051,0.000016524762,0.00186285],"genre_scores_gemma":[0.9952508,0.00009286289,0.0032816895,0.000035886507,0.000012197467,0.00011111784,0.00046675585,0.000013785471,0.00073491596],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9959311,0.0021374736,0.0001668494,0.0005433407,0.00068007456,0.00054129004],"domain_scores_gemma":[0.98320836,0.0071874214,0.0030839143,0.0010038503,0.001902845,0.0036135453],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0074431603,0.00022014599,0.00048133053,0.0043731756,0.0025390114,0.0025352102,0.000789624,0.00056389376,0.0026782535],"category_scores_gemma":[0.023819644,0.0002666662,0.00030889417,0.004923966,0.0011886419,0.0024336884,0.0045293,0.00087242,0.00043256552],"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.0002497711,0.00031079593,0.86359936,0.00020234894,0.00011632585,0.00033743677,0.05942284,0.001109143,0.002037145,0.005188664,0.002771373,0.06465477],"study_design_scores_gemma":[0.00001744693,0.00017607468,0.9334196,0.0001051381,0.00003373912,0.00018227808,0.047063,0.0043349373,0.00042105562,0.0055126264,0.0087103965,0.000023751185],"about_ca_topic_score_codex":0.005103577,"about_ca_topic_score_gemma":0.011449875,"teacher_disagreement_score":0.9956268,"about_ca_system_score_codex":0.0012287104,"about_ca_system_score_gemma":0.0018292441,"threshold_uncertainty_score":0.039363682},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7345021,0.00056537066,0.25561765,0.0020309852,0.000046954803,0.000046445664,0.00023349792,0.00027389446,0.0066831578],"genre_scores_gemma":[0.99086237,0.0001967198,0.00720958,0.00007524062,0.000018487723,0.00003744512,0.000058032925,0.000021492793,0.0015207144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996741,0.00013747968,0.000011680947,0.00007308443,0.000040559582,0.00006322941],"domain_scores_gemma":[0.9968995,0.0019021857,0.0006247584,0.00018008286,0.00012909154,0.00026442533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079798634,0.00041274147,0.00043104024,0.0010942192,0.00058739574,0.0012734728,0.0007387822,0.0012432579,0.001194936],"category_scores_gemma":[0.0059324135,0.00039829127,0.00071629003,0.00042162254,0.0017813153,0.001996861,0.0012918438,0.0012386439,0.00013250664],"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.00014556786,0.000071711824,0.010333084,0.00006632354,0.00007240292,0.0006517348,0.0004769504,0.7665266,0.0045236815,0.21042076,0.00094930554,0.005761916],"study_design_scores_gemma":[0.000016263735,0.000018301826,0.0018391951,0.000010235793,0.000012018104,0.000068175046,0.00006479668,0.9367511,0.00022350452,0.06064671,0.00033488421,0.000014738643],"about_ca_topic_score_codex":0.0054390044,"about_ca_topic_score_gemma":0.003780266,"teacher_disagreement_score":0.0054390044,"about_ca_system_score_codex":0.0011502168,"about_ca_system_score_gemma":0.00045123103,"threshold_uncertainty_score":0.010814726},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05623022,0.00045070917,0.9337314,0.0004895447,0.00010997699,0.00013620568,0.0006732126,0.0056507173,0.0025280335],"genre_scores_gemma":[0.31537354,0.00034283602,0.67812407,0.00023690441,0.00011091484,0.00022229654,0.0018311547,0.0006656868,0.0030925649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999355,0.000094477255,0.000036272257,0.0002131475,0.00020397591,0.000097165175],"domain_scores_gemma":[0.9975171,0.0012301343,0.00023477702,0.0005976326,0.0002705021,0.00014985802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009964345,0.0009801801,0.0010172601,0.0015645586,0.00072402286,0.0014350599,0.0025826625,0.0010877339,0.0037994264],"category_scores_gemma":[0.00791061,0.00046812097,0.000668776,0.0020074092,0.00069768727,0.003192964,0.0016592132,0.0014902225,0.0011519772],"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.0006098608,0.00022189459,0.0059989155,0.0003821561,0.000145976,0.00022431536,0.00036877426,0.51991606,0.012530573,0.05279836,0.023620378,0.38318273],"study_design_scores_gemma":[0.00002043516,0.000026344074,0.0002610258,0.000007407395,0.0000073888395,0.000045700206,0.000032929907,0.9808889,0.0015791724,0.015649509,0.0014759012,0.00000534111],"about_ca_topic_score_codex":0.009614363,"about_ca_topic_score_gemma":0.012144235,"teacher_disagreement_score":0.009614363,"about_ca_system_score_codex":0.0012070639,"about_ca_system_score_gemma":0.0018752705,"threshold_uncertainty_score":0.01911676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19907239,0.0006228331,0.7690703,0.0016373895,0.00006908274,0.00007199874,0.00043342315,0.0003245951,0.02869786],"genre_scores_gemma":[0.9504739,0.0008134816,0.022665035,0.00023395044,0.00020217436,0.00014556518,0.00027581115,0.00015719247,0.025032956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993094,0.00025933955,0.000024071916,0.00018133709,0.00012198735,0.00010385386],"domain_scores_gemma":[0.992489,0.0048120623,0.0009654667,0.0006468042,0.00050887367,0.00057783443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017054653,0.0006487024,0.0012154406,0.00163424,0.0009589791,0.0029073323,0.0021395548,0.0015350678,0.0077882004],"category_scores_gemma":[0.0071189236,0.0006433388,0.0012670375,0.0012233253,0.0032337692,0.0062811603,0.0016554593,0.0025932896,0.0007199692],"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.00002461625,0.00001880383,0.00023725098,0.000042246975,0.00002217789,0.00010694565,0.00017961068,0.022893822,0.0006560137,0.97338754,0.00069081946,0.0017400655],"study_design_scores_gemma":[0.000012921538,0.00001567171,0.00015481134,0.000013195733,0.000015037642,0.00006003354,0.000046705638,0.17393978,0.00019590209,0.8247611,0.0007722013,0.000012649096],"about_ca_topic_score_codex":0.0031829404,"about_ca_topic_score_gemma":0.0027166295,"teacher_disagreement_score":0.0077882004,"about_ca_system_score_codex":0.0021959518,"about_ca_system_score_gemma":0.0008895218,"threshold_uncertainty_score":0.026054144},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077655823,0.00041669418,0.98638016,0.00028797385,0.00016690727,0.00008676461,0.00039755096,0.0016900628,0.002808313],"genre_scores_gemma":[0.20661877,0.0008073253,0.7793346,0.00026975942,0.00070366054,0.00030833358,0.0017038374,0.0009102637,0.009343446],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762684,0.00048040043,0.00012047879,0.00055324443,0.0009394103,0.00027971072],"domain_scores_gemma":[0.9912771,0.0045417454,0.00038204648,0.0020439962,0.0012641589,0.0004909051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020073864,0.0016775946,0.002836665,0.002775118,0.0010343874,0.003798389,0.005688442,0.0017272226,0.007972936],"category_scores_gemma":[0.011349755,0.0008984588,0.001456457,0.0053517246,0.0011306282,0.008353641,0.0041931327,0.0029497072,0.0029525456],"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.00067008106,0.00033560258,0.0018675016,0.00054563675,0.00017794997,0.00016475194,0.0002691604,0.30109292,0.0073251748,0.12394305,0.030167868,0.53344035],"study_design_scores_gemma":[0.000016229842,0.000022330853,0.00008444245,0.000007455677,0.000011349008,0.000039901297,0.000028841248,0.94989306,0.0007385729,0.047663234,0.0014864316,0.000008165813],"about_ca_topic_score_codex":0.0046456894,"about_ca_topic_score_gemma":0.0066116275,"teacher_disagreement_score":0.007972936,"about_ca_system_score_codex":0.0013111121,"about_ca_system_score_gemma":0.0017288406,"threshold_uncertainty_score":0.026672065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009202677,0.000107855805,0.98817134,0.00013777087,0.000020269275,0.00008976865,0.00013760292,0.0010205697,0.0011121522],"genre_scores_gemma":[0.34101653,0.00024713858,0.6529094,0.0004229531,0.000140522,0.00078190234,0.0010372679,0.000567568,0.0028767227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793905,0.0009663799,0.000076813725,0.0003808978,0.00048219424,0.00015464812],"domain_scores_gemma":[0.98757845,0.00968572,0.0007958727,0.0008834971,0.000791973,0.00026446715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036280937,0.0013802233,0.0015720647,0.0026854135,0.000985028,0.001325249,0.003907404,0.001599928,0.0028356237],"category_scores_gemma":[0.020844935,0.0010438791,0.0012755643,0.0015434898,0.0019480851,0.0024763355,0.002528071,0.0018995147,0.0009836142],"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.00010720765,0.000092689836,0.0039410936,0.00020078597,0.00012439757,0.00014135022,0.0003011017,0.8644112,0.0028613843,0.03162497,0.0029251059,0.09326876],"study_design_scores_gemma":[0.0000058112437,0.000010316273,0.000075004136,0.000008214055,0.0000044390263,0.000019318604,0.000008920134,0.9915063,0.0006144442,0.007293637,0.00044875973,0.000004859719],"about_ca_topic_score_codex":0.004768313,"about_ca_topic_score_gemma":0.009050952,"teacher_disagreement_score":0.004768313,"about_ca_system_score_codex":0.0018581677,"about_ca_system_score_gemma":0.0019633248,"threshold_uncertainty_score":0.01918739},"labels":[],"label_agreement":null},{"id":"W3131107340","doi":"10.1093/comnet/cnac030","title":"Evaluating node embeddings of complex networks","year":2022,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Embedding; Graph; Theoretical computer science; Node (physics); Set (abstract data type); Graph embedding; Topological graph theory; Machine learning; Artificial intelligence; Data mining","score_opus":0.05553973968489292,"score_gpt":0.3535089458173422,"score_spread":0.2979692061324493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131107340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6060473,0.0019399363,0.38348126,0.000738112,0.0002194608,0.00014579247,0.0022305385,0.0012824105,0.003915193],"genre_scores_gemma":[0.9178995,0.00037351775,0.07744141,0.00005746834,0.00005820396,0.000064785854,0.0031599407,0.00014746281,0.00079779775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796677,0.00086797535,0.00013470408,0.00041742699,0.00050165,0.00011150196],"domain_scores_gemma":[0.98141056,0.013351013,0.0018163082,0.001198999,0.00168015,0.0005429747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037767156,0.0012297321,0.00082282297,0.004703999,0.0003358912,0.0019823886,0.0009286631,0.0016959372,0.001948686],"category_scores_gemma":[0.030505491,0.00035158973,0.00054395915,0.002656338,0.0009887641,0.0038795958,0.0016997333,0.0012524406,0.00059435447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006359837,0.00022660397,0.04177592,0.0007709242,0.00039841278,0.00029838542,0.00055330066,0.7527266,0.0047750412,0.01821564,0.0054720044,0.17415123],"study_design_scores_gemma":[0.000010363717,0.0001049571,0.0028310302,0.00003974251,0.000017299344,0.00008954379,0.00012625422,0.98035526,0.0013512982,0.014174725,0.0008832797,0.000016179369],"about_ca_topic_score_codex":0.001603515,"about_ca_topic_score_gemma":0.0016892023,"teacher_disagreement_score":0.004703999,"about_ca_system_score_codex":0.0010838768,"about_ca_system_score_gemma":0.00036856625,"threshold_uncertainty_score":0.019973397},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2749391,0.009252454,0.65014654,0.013808946,0.00047778932,0.00010855462,0.0006162567,0.00095598376,0.04969448],"genre_scores_gemma":[0.95841897,0.0056003886,0.020251686,0.00095467916,0.0011575377,0.0002796526,0.00028521425,0.00027808882,0.012773916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973997,0.0013999806,0.00007394872,0.00043364184,0.00044114646,0.00025157712],"domain_scores_gemma":[0.9157287,0.069599666,0.004990003,0.003199758,0.0033518854,0.0031300266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074565415,0.0010791585,0.0025722391,0.0034904862,0.0021085588,0.004775012,0.0029703125,0.003329253,0.004925889],"category_scores_gemma":[0.05972504,0.0015191726,0.0010787711,0.00304636,0.0059957555,0.01005721,0.003151141,0.0041977027,0.0004373209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046039113,0.000041358115,0.0007674063,0.0001470461,0.000047162503,0.00011027022,0.0001723222,0.062557004,0.0005261288,0.9296815,0.0025159442,0.0033878598],"study_design_scores_gemma":[0.000019859595,0.000012983686,0.00056753133,0.000035142886,0.000023043598,0.00007186481,0.00003371967,0.24285157,0.00017081805,0.7552767,0.00090908026,0.000027752576],"about_ca_topic_score_codex":0.0042542135,"about_ca_topic_score_gemma":0.0029818136,"teacher_disagreement_score":0.0074565415,"about_ca_system_score_codex":0.0031548026,"about_ca_system_score_gemma":0.0014144004,"threshold_uncertainty_score":0.039434433},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13087381,0.008258182,0.65648246,0.02903606,0.0020824352,0.0006225253,0.007616018,0.0033978617,0.16163066],"genre_scores_gemma":[0.5732127,0.006856293,0.29758504,0.004726211,0.0032845382,0.0016871346,0.008419402,0.0022966221,0.10193212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996421,0.00088505633,0.00018745981,0.0009976217,0.0009028293,0.00060611474],"domain_scores_gemma":[0.984486,0.011209922,0.00068859797,0.0023733915,0.00056856754,0.0006735854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030063547,0.0025379802,0.0037735323,0.0015177542,0.0032116733,0.007237812,0.00783291,0.0044468385,0.02749172],"category_scores_gemma":[0.018472737,0.0015933234,0.0036797132,0.004565056,0.004354796,0.02068919,0.006747539,0.01466996,0.0044793515],"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.0017644105,0.0005870998,0.0018427621,0.0018541474,0.0002598809,0.00030761934,0.0006679375,0.114035524,0.0031867903,0.66401225,0.09149383,0.1199878],"study_design_scores_gemma":[0.00012673304,0.000056926732,0.0004074898,0.00008591296,0.00005852802,0.00021050715,0.00012623679,0.09250974,0.00082645327,0.897949,0.0076125627,0.000029812616],"about_ca_topic_score_codex":0.0030364029,"about_ca_topic_score_gemma":0.0025705684,"teacher_disagreement_score":0.02749172,"about_ca_system_score_codex":0.0043528406,"about_ca_system_score_gemma":0.003143066,"threshold_uncertainty_score":0.09196895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98913187,0.0002519444,0.008547745,0.00012290798,0.000005942668,0.000025065827,0.00027311008,0.000065346074,0.0015760288],"genre_scores_gemma":[0.9991653,0.00007467931,0.0005015484,0.0000044205676,0.000003841212,0.000007623952,0.00011619015,0.0000066846364,0.00011983717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909186,0.00036478852,0.00004610288,0.00013433918,0.0002026564,0.00016018329],"domain_scores_gemma":[0.9915509,0.0053169155,0.0018369512,0.00053936034,0.0005077125,0.000248117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012270637,0.00043323133,0.0004960173,0.003422026,0.00044619947,0.0010799397,0.00049527787,0.00083073747,0.0012245687],"category_scores_gemma":[0.010911706,0.00024446554,0.00067680934,0.0016578007,0.0011060575,0.0017019908,0.0011925276,0.00040356445,0.000107688924],"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.00042827596,0.000059628004,0.1786437,0.0002696336,0.000575355,0.0010707527,0.0011941238,0.7770702,0.0092715,0.011207196,0.00063388294,0.019575825],"study_design_scores_gemma":[0.000016897504,0.00030684494,0.13094407,0.00009068892,0.00020869504,0.0009823936,0.0019441769,0.83519316,0.006142098,0.02146053,0.0026377977,0.000072630326],"about_ca_topic_score_codex":0.0046785483,"about_ca_topic_score_gemma":0.0016171571,"teacher_disagreement_score":0.0046785483,"about_ca_system_score_codex":0.0010747168,"about_ca_system_score_gemma":0.00030388348,"threshold_uncertainty_score":0.009302616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031862058,0.001772135,0.8756186,0.00040060488,0.00069127517,0.00021800179,0.0072765015,0.078710645,0.0034502745],"genre_scores_gemma":[0.18636553,0.0009430153,0.77046466,0.0003030803,0.0005646087,0.00029841665,0.017628612,0.0022812886,0.021150835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993692,0.00009111611,0.000044710236,0.00019770229,0.00023529641,0.0000620804],"domain_scores_gemma":[0.9982665,0.0009062499,0.00010346625,0.0004343808,0.00021556116,0.00007395373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011390011,0.0017748541,0.0014388437,0.0018220622,0.0005947287,0.0018910095,0.002082085,0.0012127605,0.006306895],"category_scores_gemma":[0.0039663184,0.00087974075,0.00062641565,0.00205183,0.00038198588,0.0026829268,0.0019505612,0.0011462255,0.0056615216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014949212,0.00022788209,0.0023265528,0.00030685333,0.0001901705,0.0002815756,0.000088439774,0.039194867,0.028359843,0.0043126117,0.092657916,0.8305583],"study_design_scores_gemma":[0.0001217143,0.00015610266,0.0016083795,0.000022968537,0.000054961583,0.00032562774,0.00006219422,0.94109166,0.030226164,0.009252625,0.017025508,0.000052134834],"about_ca_topic_score_codex":0.0048649535,"about_ca_topic_score_gemma":0.008571182,"teacher_disagreement_score":0.006306895,"about_ca_system_score_codex":0.0005120719,"about_ca_system_score_gemma":0.0007184189,"threshold_uncertainty_score":0.021098614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97973365,0.00036951294,0.009878216,0.00047964932,0.00001968746,0.0000880134,0.0027503797,0.0003387123,0.0063421526],"genre_scores_gemma":[0.9865415,0.00022148651,0.0104332175,0.000018687131,0.000012283906,0.00009302782,0.0016161656,0.00002003164,0.0010436312],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994499,0.00021580601,0.00006893194,0.000088753295,0.00013044197,0.000046090732],"domain_scores_gemma":[0.9970022,0.0013849688,0.00067469245,0.000173767,0.00060434244,0.00016001391],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.00092926715,0.00026426202,0.00016807675,0.008989454,0.0004534996,0.0013715266,0.00022645769,0.00031625477,0.0017730092],"category_scores_gemma":[0.0040540528,0.000099839825,0.00034233963,0.0063509108,0.00017614182,0.0009632234,0.0009307581,0.00020068417,0.0002503087],"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.00045800817,0.000224263,0.6194621,0.0009008706,0.00026298413,0.002008718,0.01677394,0.029323442,0.010397882,0.008017626,0.010255864,0.3019144],"study_design_scores_gemma":[0.000045971432,0.00033461323,0.5623988,0.00046480336,0.00023449474,0.0010904426,0.03842634,0.32927603,0.013182776,0.006838425,0.047579966,0.00012728854],"about_ca_topic_score_codex":0.010613048,"about_ca_topic_score_gemma":0.009299529,"teacher_disagreement_score":0.99101055,"about_ca_system_score_codex":0.0007173547,"about_ca_system_score_gemma":0.00067381596,"threshold_uncertainty_score":0.021102548},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040987294,0.00028087836,0.9439057,0.0007703451,0.00009008115,0.0000786147,0.000109926856,0.00035036413,0.013426802],"genre_scores_gemma":[0.7883627,0.00030791375,0.20572826,0.00021110434,0.00011528776,0.00018648451,0.00017420205,0.00016569582,0.0047483696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912983,0.0003153229,0.000023999883,0.00016311658,0.00020127828,0.0001664569],"domain_scores_gemma":[0.9975158,0.0018025694,0.00011518622,0.00019987038,0.00023977263,0.00012681728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013072224,0.000981278,0.0019642427,0.0006782567,0.00082123873,0.0017058329,0.0018757418,0.0010716175,0.003989098],"category_scores_gemma":[0.0057958076,0.0005154968,0.00084192125,0.0011901571,0.0011470437,0.0018089243,0.0017968802,0.0014936499,0.00049996807],"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.000086326596,0.00006221264,0.00021451605,0.00005107755,0.000027385091,0.000042233383,0.0000366618,0.93638134,0.0005313416,0.040818438,0.001412871,0.020335615],"study_design_scores_gemma":[0.00000754177,0.0000046896466,0.000020537404,0.000001265224,0.0000025394809,0.0000030097954,0.00000452185,0.9842992,0.00007938385,0.015461639,0.00011453764,0.0000011693154],"about_ca_topic_score_codex":0.010252385,"about_ca_topic_score_gemma":0.01172092,"teacher_disagreement_score":0.010252385,"about_ca_system_score_codex":0.0016184926,"about_ca_system_score_gemma":0.002335788,"threshold_uncertainty_score":0.020385444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011076699,0.0027087817,0.98858213,0.0031190705,0.0005752273,0.0002918501,0.00115663,0.0011518713,0.0013067028],"genre_scores_gemma":[0.03577333,0.004095534,0.95236295,0.00089501025,0.0015027081,0.0014980084,0.0019814551,0.00026063935,0.0016303777],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9856286,0.007345257,0.0017978649,0.00154945,0.0034425228,0.00023638697],"domain_scores_gemma":[0.9372598,0.046984885,0.0025848832,0.0057713385,0.0065669133,0.00083225325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016234279,0.0017449652,0.0020750249,0.010230648,0.0013689068,0.006052092,0.0024727574,0.0016653523,0.0045046536],"category_scores_gemma":[0.069545485,0.0009385036,0.0028135346,0.00895738,0.001801822,0.0052186158,0.004002325,0.0055380054,0.0028522033],"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.00015756642,0.00024917902,0.0055212313,0.0023203148,0.0011170694,0.00051376806,0.00083912455,0.030455876,0.001978221,0.33950123,0.06329744,0.55404896],"study_design_scores_gemma":[0.00005201151,0.000049909486,0.001209135,0.00051832857,0.00011008811,0.00033657416,0.00022083528,0.27625307,0.0012098975,0.6435147,0.07645718,0.000068324436],"about_ca_topic_score_codex":0.0015178684,"about_ca_topic_score_gemma":0.0015073179,"teacher_disagreement_score":0.016234279,"about_ca_system_score_codex":0.0013680076,"about_ca_system_score_gemma":0.002712932,"threshold_uncertainty_score":0.08585608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039305086,0.00015630652,0.9945905,0.00012706357,0.000019984367,0.000060705966,0.000018227724,0.00012220457,0.0009744545],"genre_scores_gemma":[0.29010543,0.0005091888,0.70437247,0.0002270723,0.000066521134,0.00082600734,0.00023277974,0.000111477806,0.003548995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783665,0.0010059738,0.0000979147,0.00046801922,0.00042304944,0.00016845374],"domain_scores_gemma":[0.9965115,0.0024365464,0.0002941321,0.00011409335,0.0005454355,0.0000983685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035160247,0.0013412634,0.0015431431,0.0025769842,0.0018215835,0.0020054614,0.0022377698,0.0019111935,0.003236217],"category_scores_gemma":[0.009038536,0.0005969597,0.0011838941,0.0024318323,0.0013085965,0.0034921584,0.0021415816,0.0021134133,0.00040997312],"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.00008386193,0.00006972358,0.0013559099,0.0001391117,0.00008119809,0.00011762235,0.00033697538,0.8443413,0.0009827956,0.043941453,0.0015312798,0.10701881],"study_design_scores_gemma":[0.0000072047874,0.000018467752,0.00007074654,0.000008271973,0.000006803852,0.000013687965,0.000028457656,0.98759985,0.0002091989,0.011368819,0.00066194654,0.00000654292],"about_ca_topic_score_codex":0.014010554,"about_ca_topic_score_gemma":0.008693297,"teacher_disagreement_score":0.014010554,"about_ca_system_score_codex":0.0022741205,"about_ca_system_score_gemma":0.002799356,"threshold_uncertainty_score":0.027858019},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028740421,0.0007153882,0.93799347,0.0003088391,0.00017484941,0.00022841555,0.008595702,0.015213211,0.008029726],"genre_scores_gemma":[0.21957955,0.00080302317,0.7662147,0.00017397724,0.0001632432,0.0006181711,0.0055768876,0.0032739965,0.003596471],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991591,0.00028543686,0.00008979734,0.00011870399,0.00029529238,0.000051718504],"domain_scores_gemma":[0.9942867,0.0035274343,0.00074620935,0.0005258701,0.000741037,0.000172726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002490194,0.0012830548,0.0007549904,0.009570707,0.00057254604,0.0025425826,0.0006954465,0.00062509347,0.018438574],"category_scores_gemma":[0.0105145695,0.00053986383,0.0006902875,0.0059381835,0.00055748323,0.003297681,0.0014855058,0.0014106709,0.0026174022],"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.00077694946,0.00045778093,0.027952816,0.0026389402,0.0006235185,0.0012439326,0.006845079,0.047321536,0.074052535,0.16805923,0.096456215,0.57357144],"study_design_scores_gemma":[0.00015122515,0.00033018613,0.053617824,0.00087477546,0.00017708934,0.0022336002,0.0029376033,0.42961168,0.030662335,0.31119132,0.16773729,0.00047498895],"about_ca_topic_score_codex":0.0013540051,"about_ca_topic_score_gemma":0.0018586736,"teacher_disagreement_score":0.018438574,"about_ca_system_score_codex":0.00036127184,"about_ca_system_score_gemma":0.000486159,"threshold_uncertainty_score":0.061683178},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004022243,0.0007035887,0.98602283,0.0016952712,0.00007160037,0.00009974943,0.00035674815,0.00013547795,0.006892458],"genre_scores_gemma":[0.3489866,0.006507767,0.62266207,0.0022133654,0.0018662978,0.0014205378,0.0023303165,0.00020675684,0.013806299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964324,0.0013820846,0.00014996612,0.0008954046,0.0009613786,0.00017862889],"domain_scores_gemma":[0.98348236,0.012857835,0.0010759733,0.001176666,0.0009985855,0.0004085354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004003437,0.0014568294,0.0012967872,0.0080373725,0.0020120945,0.0036883978,0.0038710819,0.0021031178,0.005815597],"category_scores_gemma":[0.020346202,0.0010250376,0.0027604839,0.007382897,0.0047820825,0.009567562,0.003339401,0.0032842315,0.002006417],"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.000011728816,0.00004895142,0.0007857413,0.00018826874,0.000060604452,0.000112571994,0.00035693005,0.014656122,0.0003031278,0.96353996,0.003764084,0.01617195],"study_design_scores_gemma":[0.000010470948,0.000017724635,0.00022758917,0.00004074709,0.000027597403,0.00015994308,0.00012066254,0.13420376,0.00019143044,0.8574784,0.00750138,0.000020316744],"about_ca_topic_score_codex":0.0031877037,"about_ca_topic_score_gemma":0.002265558,"teacher_disagreement_score":0.0080373725,"about_ca_system_score_codex":0.002617054,"about_ca_system_score_gemma":0.0015933674,"threshold_uncertainty_score":0.021172464},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02597542,0.0004308776,0.96975785,0.00022881306,0.00011204107,0.0000963786,0.0006489176,0.0014503341,0.0012993646],"genre_scores_gemma":[0.46282372,0.00036840892,0.52304333,0.00029892693,0.00025766372,0.00036777862,0.0057897735,0.00079894875,0.0062514613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909356,0.0033017814,0.0005063299,0.002864419,0.0020190836,0.00037287592],"domain_scores_gemma":[0.9772676,0.011775388,0.0015509417,0.005734828,0.0033328903,0.00033835616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054399227,0.0019516876,0.002765374,0.0037043619,0.002229169,0.002587994,0.004858904,0.0027315395,0.0015867007],"category_scores_gemma":[0.024338992,0.0012835469,0.0015098288,0.004384424,0.0011239942,0.0035025247,0.0027250345,0.0022861506,0.0021122482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010146456,0.0004284694,0.010620045,0.0010811728,0.0010075467,0.0007776323,0.0010463235,0.4387459,0.02353351,0.020981928,0.02915513,0.47160777],"study_design_scores_gemma":[0.000016637961,0.00002748507,0.0012912343,0.000035937825,0.00006468026,0.00016022766,0.00009981388,0.9639262,0.004560468,0.027063454,0.002731909,0.000021984952],"about_ca_topic_score_codex":0.008434593,"about_ca_topic_score_gemma":0.020073988,"teacher_disagreement_score":0.008434593,"about_ca_system_score_codex":0.0013611523,"about_ca_system_score_gemma":0.0019542146,"threshold_uncertainty_score":0.028769374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92317206,0.0015928323,0.019612933,0.016216101,0.0001931479,0.000023329401,0.0001449149,0.00008785644,0.03895688],"genre_scores_gemma":[0.9973851,0.00017258018,0.00035592628,0.00023869521,0.00006296154,0.00000501239,0.0000110133915,0.000010580936,0.0017581778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99937516,0.000304516,0.000015455456,0.00013243154,0.00006675868,0.00010576795],"domain_scores_gemma":[0.9842613,0.011397497,0.002341315,0.00059172924,0.0005462986,0.000861969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021292556,0.00013392349,0.0005350531,0.000491559,0.0009942022,0.0028401196,0.00085118506,0.0023389317,0.009711127],"category_scores_gemma":[0.018635321,0.000310353,0.00025942177,0.00085314654,0.003013227,0.0054687196,0.0011760069,0.0017331386,0.0007608682],"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.0007011645,0.00039714464,0.08571317,0.00041132863,0.0002875195,0.0009349791,0.008506213,0.031205425,0.0035717264,0.77848953,0.025793288,0.0639885],"study_design_scores_gemma":[0.00019656598,0.00023848035,0.14180401,0.00015279489,0.00028409754,0.0005061054,0.01114918,0.15514755,0.0015295461,0.6693226,0.019498302,0.00017072217],"about_ca_topic_score_codex":0.004750571,"about_ca_topic_score_gemma":0.0066336147,"teacher_disagreement_score":0.009711127,"about_ca_system_score_codex":0.0013033504,"about_ca_system_score_gemma":0.000566839,"threshold_uncertainty_score":0.032486916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07114458,0.0004828727,0.91567725,0.0004251195,0.000051237035,0.00015060451,0.000065981294,0.00039796712,0.011604467],"genre_scores_gemma":[0.87196124,0.0007297945,0.118719436,0.00022526496,0.00006531241,0.00029844252,0.000114429364,0.00010730952,0.0077788346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920446,0.00023674553,0.000026180998,0.00021808897,0.00012539524,0.00018904345],"domain_scores_gemma":[0.9975375,0.001302279,0.0005343857,0.00026317072,0.0001566589,0.00020607041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094165455,0.0011348153,0.001071024,0.00048780226,0.0006656014,0.0008590271,0.0017115893,0.0010271843,0.0046268227],"category_scores_gemma":[0.004358153,0.0003174183,0.0007078646,0.0004712968,0.0011862416,0.0018146002,0.001905311,0.0011244939,0.0005584115],"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.00024596753,0.00021515547,0.001276697,0.0003855697,0.00009019115,0.00020886702,0.00021385624,0.887178,0.00822053,0.052958485,0.0023098248,0.046696853],"study_design_scores_gemma":[0.000048579528,0.00041077894,0.00044170851,0.00002850888,0.000052179,0.00016757323,0.00016107864,0.94569266,0.004499246,0.045370873,0.0031098372,0.000016875767],"about_ca_topic_score_codex":0.001359942,"about_ca_topic_score_gemma":0.0012498004,"teacher_disagreement_score":0.0046268227,"about_ca_system_score_codex":0.00095669396,"about_ca_system_score_gemma":0.00069497246,"threshold_uncertainty_score":0.015478194},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015064697,0.011413171,0.001333693,0.9073811,0.015687007,0.00022036124,0.0010096149,0.0002457801,0.047644604],"genre_scores_gemma":[0.19801874,0.015602288,0.0023845544,0.30152354,0.004886898,0.0014414334,0.00088473456,0.0008090052,0.4744488],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983936,0.00074291334,0.000038096205,0.00017493464,0.00040442916,0.00024603057],"domain_scores_gemma":[0.9895523,0.0029912523,0.0003673716,0.00017548805,0.0034297379,0.003483903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032337632,0.0004139912,0.00047172062,0.00092972897,0.0072932574,0.0028758284,0.0005693804,0.0025409842,0.020444648],"category_scores_gemma":[0.024422385,0.00049906055,0.00016328556,0.0009184452,0.0024313477,0.0022965437,0.0023104774,0.00891344,0.009033336],"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.000012706429,0.000008406258,0.00030055328,0.000019744752,7.922093e-7,0.00016550867,0.008370407,0.000018280583,0.00012084912,0.0008331574,0.9870411,0.0031084106],"study_design_scores_gemma":[0.0000042282345,0.000013305562,0.0015382395,0.00020330444,0.0000010063168,0.00021195126,0.031559225,0.00004785991,0.00010681908,0.00057067943,0.96572345,0.000019923391],"about_ca_topic_score_codex":0.03440886,"about_ca_topic_score_gemma":0.088565916,"teacher_disagreement_score":0.03440886,"about_ca_system_score_codex":0.005821806,"about_ca_system_score_gemma":0.0074532283,"threshold_uncertainty_score":0.06841719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72935176,0.000548137,0.25136414,0.003944748,0.00010238003,0.000262088,0.00031053866,0.0002489787,0.013867241],"genre_scores_gemma":[0.98236173,0.0002237567,0.013851736,0.00021056393,0.000046581496,0.00008484435,0.00010567925,0.000039991995,0.0030749813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817204,0.00079214224,0.00007088582,0.00045822115,0.0001655994,0.00034108106],"domain_scores_gemma":[0.98723143,0.00900853,0.0016771691,0.0005545716,0.0006874442,0.00084097154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004989956,0.0006158879,0.0013510804,0.000954508,0.0014714566,0.0022865313,0.00096454757,0.0020107515,0.0031758514],"category_scores_gemma":[0.018257238,0.0005822637,0.00095702533,0.0006296065,0.0017706427,0.004530898,0.0011054293,0.0015045338,0.00039063775],"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.0012991189,0.00056436664,0.03903379,0.00052578177,0.0005113514,0.0011529825,0.002473832,0.5438755,0.009556073,0.33178934,0.007925614,0.061292194],"study_design_scores_gemma":[0.00011752452,0.00023601411,0.006904619,0.000048990107,0.00009118683,0.00021989788,0.0012003642,0.8018835,0.0012241373,0.18532096,0.0026874898,0.00006527515],"about_ca_topic_score_codex":0.0064435764,"about_ca_topic_score_gemma":0.0053287516,"teacher_disagreement_score":0.0064435764,"about_ca_system_score_codex":0.0016595925,"about_ca_system_score_gemma":0.0011573154,"threshold_uncertainty_score":0.026389718},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04975669,0.02470652,0.66946703,0.010551517,0.0010212782,0.0003023782,0.0047700447,0.0009055685,0.23851901],"genre_scores_gemma":[0.73169136,0.024304546,0.20122436,0.001960756,0.0019963789,0.0008244961,0.0047940635,0.00073893747,0.032465067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699247,0.00077060953,0.00020565635,0.00082344405,0.001015894,0.00019189618],"domain_scores_gemma":[0.99213034,0.004359794,0.0011141497,0.0010691325,0.0010661065,0.00026050356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002506852,0.00089940784,0.0007703049,0.00569545,0.0014473958,0.0061255703,0.00089177274,0.0017922967,0.012037323],"category_scores_gemma":[0.0145324515,0.00054011145,0.00077005394,0.004703303,0.0046965173,0.012129742,0.001900296,0.002266384,0.0023509234],"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.000010943256,0.0000096134745,0.0012981999,0.00024510725,0.000034236262,0.000050260736,0.00041040068,0.0042084847,0.0008803348,0.9595556,0.0049455827,0.028351275],"study_design_scores_gemma":[0.000003289775,0.000017398446,0.0016647762,0.00014646328,0.000021485052,0.00032418716,0.00028730978,0.0064861304,0.0006565648,0.9371203,0.0532491,0.000022980365],"about_ca_topic_score_codex":0.0010522397,"about_ca_topic_score_gemma":0.0009022987,"teacher_disagreement_score":0.012037323,"about_ca_system_score_codex":0.0025016398,"about_ca_system_score_gemma":0.00096920837,"threshold_uncertainty_score":0.040268898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8169017,0.00022708162,0.17844366,0.00026760862,0.0000278121,0.00009334772,0.0009087957,0.0006680111,0.0024620227],"genre_scores_gemma":[0.98350126,0.00006318789,0.015220929,0.000014420762,0.000008512705,0.000021896227,0.00039227237,0.000011503212,0.0007658951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996099,0.00010964461,0.00002749784,0.00007782771,0.00010348412,0.00007175098],"domain_scores_gemma":[0.99916196,0.00031079585,0.00015947688,0.00009138985,0.00019956144,0.00007688307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005968832,0.0004969588,0.00034653614,0.0021113448,0.00031045213,0.00054666813,0.00034441293,0.0003712286,0.00060756353],"category_scores_gemma":[0.00197169,0.00017459443,0.0003922184,0.0010484692,0.0002241807,0.0011334285,0.0005299233,0.00050248374,0.00032917058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008784789,0.0009096624,0.33615518,0.00024616506,0.0003019629,0.00090523966,0.0016682505,0.1258284,0.050714243,0.0072736912,0.004561798,0.4705569],"study_design_scores_gemma":[0.000002383588,0.00006685311,0.030222528,0.000008869364,0.00001439592,0.00012606781,0.00017538405,0.9633939,0.0039623664,0.001374872,0.0006375455,0.000014880088],"about_ca_topic_score_codex":0.0044360263,"about_ca_topic_score_gemma":0.005075819,"teacher_disagreement_score":0.0044360263,"about_ca_system_score_codex":0.0004928295,"about_ca_system_score_gemma":0.00027672536,"threshold_uncertainty_score":0.008820415},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045611776,0.0011015015,0.9439906,0.00075791415,0.00010510325,0.00018015385,0.0031369224,0.002532119,0.0025838849],"genre_scores_gemma":[0.676852,0.00093897845,0.30361402,0.00036774378,0.00025770554,0.00045186846,0.0075875157,0.00028107126,0.00964903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989188,0.0002706165,0.00005543417,0.00042713722,0.00022957003,0.00009837075],"domain_scores_gemma":[0.9972402,0.0015150105,0.00022623742,0.00053118536,0.00034345587,0.00014394725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011170125,0.001099365,0.0014972634,0.0048849536,0.0012728852,0.0014105217,0.0023015682,0.0016538131,0.0035741378],"category_scores_gemma":[0.005437885,0.0007022798,0.0018207618,0.0047078226,0.00046270675,0.003442284,0.0011813467,0.001398045,0.0011572576],"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.0009643569,0.0007906236,0.02212188,0.000539799,0.0009447985,0.00041055286,0.00047620668,0.47296056,0.007897721,0.061755486,0.02772772,0.40341038],"study_design_scores_gemma":[0.000014899313,0.00003403274,0.0009324411,0.000012006224,0.000063627565,0.000051856925,0.000027314953,0.98577183,0.00037028216,0.011448562,0.0012617329,0.000011406336],"about_ca_topic_score_codex":0.024353398,"about_ca_topic_score_gemma":0.040087864,"teacher_disagreement_score":0.024353398,"about_ca_system_score_codex":0.0014545073,"about_ca_system_score_gemma":0.0011357388,"threshold_uncertainty_score":0.04842329},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033869503,0.0015461205,0.000114874136,0.017984837,0.97913593,0.000020956635,0.000096747746,0.00006340602,0.0010033596],"genre_scores_gemma":[0.00041298618,0.0019639004,0.00012145325,0.0074918084,0.981662,0.00002615737,0.000063189764,0.000043502438,0.008215071],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9941355,0.00082422805,0.00070104696,0.00078580464,0.0031467155,0.00040674757],"domain_scores_gemma":[0.9699379,0.010279189,0.0019106941,0.00082962896,0.012752778,0.004289726],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.009249581,0.0049487464,0.004922062,0.0065485523,0.0037396902,0.009870927,0.003789621,0.012704494,0.03199615],"category_scores_gemma":[0.03671634,0.001231034,0.0030179305,0.0025242309,0.0022736997,0.005057205,0.0019117839,0.0122218365,0.021923682],"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.000037313283,0.000009657063,0.00002663615,0.00013309556,0.000012923403,0.000059268375,0.000007130382,0.000025957708,0.000035252953,0.00016911562,0.99598557,0.0034981486],"study_design_scores_gemma":[0.00009983877,0.00004140636,0.00044305323,0.00062790833,0.00006715476,0.00030719122,0.00006503812,0.0003450798,0.00016129605,0.0017269079,0.9960836,0.000031452088],"about_ca_topic_score_codex":0.0012404692,"about_ca_topic_score_gemma":0.0040181973,"teacher_disagreement_score":0.9934515,"about_ca_system_score_codex":0.0029078352,"about_ca_system_score_gemma":0.003211947,"threshold_uncertainty_score":0.10703784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.988982,0.000026977092,0.00073647173,0.00080875575,0.0000050447134,0.000031589745,0.000025979169,0.000009715543,0.009373419],"genre_scores_gemma":[0.9990952,0.000014632989,0.00020310946,0.000021306556,0.0000016317238,0.000014374946,0.000010863504,0.00000150051,0.00063734595],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99850225,0.00079168146,0.000041247014,0.00015552544,0.00016004358,0.00034919582],"domain_scores_gemma":[0.9977525,0.0011199528,0.00036996262,0.0001881966,0.00022200457,0.00034741234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002119729,0.00020395835,0.0001710446,0.0013207173,0.0043914756,0.002403251,0.0008441524,0.0013302123,0.0028980896],"category_scores_gemma":[0.0026769724,0.00017859797,0.000274613,0.0012001203,0.0028008642,0.0030161908,0.002624933,0.00076228555,0.00015525348],"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.0005156775,0.00093979586,0.4524103,0.00024745995,0.000107980406,0.016063323,0.268676,0.009834293,0.011637481,0.1738027,0.005196673,0.060568396],"study_design_scores_gemma":[0.00012897019,0.0003492995,0.33714542,0.0001821591,0.00012571448,0.0008148128,0.48987812,0.094091475,0.0049454346,0.033020705,0.03917893,0.00013906806],"about_ca_topic_score_codex":0.04862017,"about_ca_topic_score_gemma":0.058859784,"teacher_disagreement_score":0.04862017,"about_ca_system_score_codex":0.0044279154,"about_ca_system_score_gemma":0.0033537834,"threshold_uncertainty_score":0.09667432},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795411,0.00011783358,0.013872357,0.00070397055,0.000016644755,0.00004482352,0.0011019096,0.00010294195,0.004498383],"genre_scores_gemma":[0.99569726,0.000050427094,0.002056068,0.000018858887,0.0000073845913,0.000021285876,0.00059752597,0.000011836769,0.0015393292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99939334,0.00024148934,0.000017557895,0.0001269523,0.00009958833,0.000121139536],"domain_scores_gemma":[0.99631655,0.0019222081,0.00071724656,0.00027102476,0.0004465257,0.00032637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010513995,0.00019388419,0.0003112226,0.0016975139,0.0008253779,0.00093431293,0.0007812075,0.00074964965,0.0054399096],"category_scores_gemma":[0.0101660825,0.00017531426,0.0003503997,0.0017590374,0.0005349592,0.0010626935,0.00066528213,0.0005736218,0.000419317],"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.00038018206,0.00027477383,0.18326057,0.0001045706,0.0001000088,0.00042707572,0.0009701897,0.6974161,0.0038242405,0.06834234,0.008291595,0.036608268],"study_design_scores_gemma":[0.000011338631,0.000038383856,0.032645337,0.0000109666,0.000011104772,0.00006042402,0.0003215515,0.95567375,0.0006167254,0.008362665,0.0022334834,0.000014293964],"about_ca_topic_score_codex":0.03928526,"about_ca_topic_score_gemma":0.029685881,"teacher_disagreement_score":0.03928526,"about_ca_system_score_codex":0.0024729595,"about_ca_system_score_gemma":0.0006754426,"threshold_uncertainty_score":0.0781132},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5205496,0.0008526458,0.4718983,0.00052989135,0.00004080863,0.00015532825,0.000064818654,0.0005124002,0.005396272],"genre_scores_gemma":[0.9600683,0.0002703121,0.038103458,0.00015277063,0.00002208403,0.00006592891,0.00008158474,0.000025678584,0.0012099025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962914,0.0001266679,0.000013503809,0.00009917476,0.00008175121,0.00004981506],"domain_scores_gemma":[0.9973793,0.0016472874,0.0003962182,0.00021621089,0.00013733636,0.00022373162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013036428,0.00052557857,0.0008008383,0.0012538902,0.00087713473,0.0008936444,0.0011577923,0.0008950824,0.00086567947],"category_scores_gemma":[0.0040222835,0.0004058563,0.00053944957,0.00056498154,0.0015834227,0.0018171221,0.0016066954,0.00058339135,0.00022369197],"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.00024255281,0.0002419514,0.025629029,0.00034358658,0.0002060652,0.0007605799,0.0009824568,0.81473136,0.024310738,0.023075605,0.0027896177,0.1066865],"study_design_scores_gemma":[0.00002812596,0.00022547801,0.004207401,0.000028405493,0.000061836385,0.00027790794,0.00025849603,0.97829264,0.002919209,0.012544812,0.0011263847,0.000029273273],"about_ca_topic_score_codex":0.0021358724,"about_ca_topic_score_gemma":0.003691469,"teacher_disagreement_score":0.0021358724,"about_ca_system_score_codex":0.0007273933,"about_ca_system_score_gemma":0.0005003557,"threshold_uncertainty_score":0.0068944097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67968076,0.0371918,0.02680341,0.009338589,0.00086721365,0.00076558493,0.027154317,0.0008118332,0.2173865],"genre_scores_gemma":[0.9636168,0.009005816,0.013070455,0.0003254958,0.00018724355,0.00038902843,0.006915095,0.00013262687,0.006357511],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9895894,0.0040256684,0.0010245051,0.0016345149,0.0030137594,0.0007121137],"domain_scores_gemma":[0.96275955,0.018373871,0.008469964,0.0031229155,0.0054820734,0.0017915607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008708342,0.000420076,0.00085798645,0.018099992,0.0017361656,0.0056741145,0.000520246,0.00090063934,0.012847784],"category_scores_gemma":[0.033816885,0.00018345403,0.0008683751,0.046059243,0.00091319607,0.003278564,0.0046249893,0.0005759471,0.0018524517],"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.0005969789,0.000082975595,0.49430758,0.0051213815,0.0010810042,0.0010936398,0.018087951,0.003743222,0.0037864647,0.05946099,0.023828972,0.38880882],"study_design_scores_gemma":[0.000075169184,0.00025266322,0.63685733,0.0026234635,0.0011592756,0.0019116761,0.019530473,0.0059005646,0.0045416965,0.034191698,0.29280868,0.00014732509],"about_ca_topic_score_codex":0.004011225,"about_ca_topic_score_gemma":0.0042293277,"teacher_disagreement_score":0.018099992,"about_ca_system_score_codex":0.0023142397,"about_ca_system_score_gemma":0.0062331487,"threshold_uncertainty_score":0.04605466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85485774,0.0003080785,0.14247897,0.00027322955,0.000031678668,0.000036858382,0.00044392952,0.00022069692,0.001348699],"genre_scores_gemma":[0.9945675,0.0001308328,0.0041679083,0.000011549881,0.000019141182,0.000017233711,0.00037983182,0.000010831323,0.0006951183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978083,0.000051322942,0.000012688125,0.00007529616,0.000041495103,0.00003850177],"domain_scores_gemma":[0.9984707,0.0009260946,0.00028092056,0.00008175106,0.00016792797,0.0000725936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008818536,0.00042047643,0.0003823404,0.0012130812,0.0002673189,0.00047974428,0.0005925589,0.0005426469,0.00062927173],"category_scores_gemma":[0.0038415312,0.00020835796,0.0005556081,0.00079187297,0.00022202502,0.0008720937,0.00035016928,0.00047856153,0.00019514182],"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.00020894775,0.00012500565,0.1680197,0.00008534715,0.00013310919,0.00038276194,0.00020762839,0.7564398,0.0038260063,0.008838128,0.0016595664,0.060073998],"study_design_scores_gemma":[7.856794e-7,0.0000049202326,0.003957655,0.000001364371,0.0000037246418,0.000009077414,0.0000062010886,0.99548787,0.00010015374,0.00036671065,0.000059065405,0.0000024152118],"about_ca_topic_score_codex":0.01202716,"about_ca_topic_score_gemma":0.009014511,"teacher_disagreement_score":0.01202716,"about_ca_system_score_codex":0.0005759065,"about_ca_system_score_gemma":0.00026784927,"threshold_uncertainty_score":0.023914337},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08941654,0.00041702215,0.89275897,0.00030501513,0.0000873743,0.00014857668,0.00050097646,0.0004269146,0.015938653],"genre_scores_gemma":[0.69986415,0.00088441616,0.28164238,0.00040628336,0.00031465167,0.00049757195,0.0019219941,0.00045280895,0.014015819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967264,0.00085178885,0.00027163682,0.0012078303,0.00064348633,0.00029881133],"domain_scores_gemma":[0.9912999,0.0036678775,0.0015410703,0.0014400119,0.0014013959,0.00064968603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014306967,0.0012769743,0.0006920258,0.002263805,0.000961049,0.0025425474,0.0013118427,0.0014672315,0.008891569],"category_scores_gemma":[0.018014506,0.0007177038,0.0010027016,0.0015630911,0.002342185,0.0074945744,0.0029942165,0.001964151,0.0024882308],"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.00013076601,0.00006890517,0.0010024491,0.00017347917,0.000032126372,0.00028856023,0.0005576431,0.018081559,0.0075154146,0.9296129,0.002743417,0.039792802],"study_design_scores_gemma":[0.00002785439,0.00012985946,0.0006232547,0.00005037765,0.000019723262,0.00051254354,0.00028535657,0.09631297,0.004390978,0.88846374,0.009134251,0.000049200895],"about_ca_topic_score_codex":0.00059485005,"about_ca_topic_score_gemma":0.00057093543,"teacher_disagreement_score":0.008891569,"about_ca_system_score_codex":0.0007780348,"about_ca_system_score_gemma":0.00044672826,"threshold_uncertainty_score":0.02974528},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1749367,0.00090772397,0.81952924,0.00027810043,0.000081477694,0.0001065271,0.00012403431,0.00034652813,0.003689652],"genre_scores_gemma":[0.92916024,0.00029916805,0.069229506,0.000040780105,0.000052671207,0.000044969485,0.00011837806,0.000025212943,0.0010289721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992461,0.00017099445,0.000041920495,0.0001768383,0.00028469285,0.00007944051],"domain_scores_gemma":[0.9974957,0.0012312711,0.0004964228,0.00021460676,0.00043511053,0.00012687594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012046512,0.00061699864,0.00058703497,0.0031154496,0.0006384,0.0009565363,0.0008678342,0.000810558,0.0007463354],"category_scores_gemma":[0.0049871746,0.00031183148,0.00062233105,0.0019604743,0.00063500664,0.0017429555,0.0009923966,0.0005179953,0.0001695166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055875187,0.00023989005,0.0642824,0.00083468517,0.0004988317,0.0017389964,0.0012263929,0.38808835,0.06164964,0.06336346,0.0059556817,0.41156295],"study_design_scores_gemma":[0.000011637146,0.000051944593,0.0066043604,0.000018919076,0.000058491612,0.00031522324,0.00010559229,0.9745634,0.0066077188,0.0102927955,0.0013426654,0.000027278176],"about_ca_topic_score_codex":0.001963582,"about_ca_topic_score_gemma":0.0024503923,"teacher_disagreement_score":0.0031154496,"about_ca_system_score_codex":0.00065404736,"about_ca_system_score_gemma":0.00041548366,"threshold_uncertainty_score":0.006370902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064800456,0.00041710853,0.99221945,0.0001332371,0.000026507938,0.000029626191,0.000037572718,0.00019523306,0.00046120927],"genre_scores_gemma":[0.37028363,0.0010425749,0.6258231,0.00013210707,0.00013769676,0.00019328891,0.00046483692,0.00019681439,0.001725964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974957,0.00094919675,0.00009443485,0.00066153577,0.00068140187,0.000117719464],"domain_scores_gemma":[0.9940189,0.0039080647,0.000624458,0.00041248344,0.00088515016,0.00015089737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028299787,0.00091589557,0.0012432028,0.0026581807,0.00120705,0.0013605619,0.0019421302,0.0014136188,0.0007659584],"category_scores_gemma":[0.015387584,0.00049400225,0.0007336728,0.0028397513,0.0013894975,0.0024799707,0.0013478018,0.0015178308,0.00040897346],"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.00014629732,0.00004660486,0.0033056699,0.000194734,0.0001152738,0.00012105686,0.00025174895,0.835363,0.0039990065,0.05815505,0.0029880095,0.095313594],"study_design_scores_gemma":[0.0000052816154,0.000012135482,0.0003000954,0.000009408138,0.000009313882,0.000053509037,0.00002237248,0.9792163,0.0012240149,0.018273583,0.00085754675,0.000016391394],"about_ca_topic_score_codex":0.0065576574,"about_ca_topic_score_gemma":0.0052646543,"teacher_disagreement_score":0.0065576574,"about_ca_system_score_codex":0.0020450943,"about_ca_system_score_gemma":0.0017024914,"threshold_uncertainty_score":0.0149665475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29080024,0.0001089179,0.6411827,0.0011333682,0.00020475093,0.0033168418,0.0131807355,0.0130050285,0.037067458],"genre_scores_gemma":[0.61441225,0.00008154572,0.36320603,0.00023491627,0.00002458034,0.005280898,0.0046427515,0.0008269755,0.011289975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989403,0.0006301189,0.00004421345,0.0001666105,0.00013843102,0.000080416496],"domain_scores_gemma":[0.9922008,0.006441087,0.00030030293,0.00040111897,0.00021645236,0.00044021872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023422474,0.00093717215,0.000496442,0.0008717913,0.00043981613,0.0014261235,0.0015209138,0.0006783327,0.018191127],"category_scores_gemma":[0.009355629,0.0003653181,0.0006053529,0.0007118237,0.00063013384,0.0013983846,0.0015507657,0.0010676008,0.0017309742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040292265,0.003978485,0.048649468,0.0017612738,0.00042925533,0.0013745914,0.008911597,0.19130047,0.020388879,0.23815174,0.17687204,0.30415305],"study_design_scores_gemma":[0.00064397557,0.00093384425,0.014469755,0.0001611054,0.00007144558,0.0003073084,0.0012705273,0.7738605,0.013074552,0.11590944,0.07917273,0.00012481668],"about_ca_topic_score_codex":0.0020634641,"about_ca_topic_score_gemma":0.0036829875,"teacher_disagreement_score":0.018191127,"about_ca_system_score_codex":0.00078682206,"about_ca_system_score_gemma":0.00068469055,"threshold_uncertainty_score":0.06085539},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5835491,0.0018379862,0.39328384,0.0014122102,0.00011248522,0.00028853022,0.0030156698,0.0011944742,0.015305739],"genre_scores_gemma":[0.87220347,0.0006586245,0.122855194,0.00006166336,0.000054909953,0.00011241312,0.001619775,0.000059707676,0.0023742465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918264,0.0002986042,0.00003171042,0.00013167139,0.00028437198,0.00007109021],"domain_scores_gemma":[0.9974711,0.0014834108,0.00033726342,0.00014106197,0.0004903675,0.00007688153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011581612,0.00043440578,0.00028659494,0.0045144428,0.0007894164,0.0009244103,0.0004358233,0.0004713518,0.00091236294],"category_scores_gemma":[0.00574854,0.00013877725,0.00046329334,0.0026586512,0.00041171815,0.0013210896,0.00069193833,0.00052126154,0.00022995748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033496207,0.00030894132,0.13885973,0.0005358731,0.00026261428,0.0010086292,0.0020692549,0.3156264,0.013615424,0.06678629,0.012089938,0.44850186],"study_design_scores_gemma":[0.0000085842585,0.000058907306,0.03306764,0.000059764076,0.000028895605,0.0003254154,0.0005641494,0.9429832,0.0039351317,0.012285419,0.0066440795,0.000038785216],"about_ca_topic_score_codex":0.02620752,"about_ca_topic_score_gemma":0.02445322,"teacher_disagreement_score":0.02620752,"about_ca_system_score_codex":0.0011458903,"about_ca_system_score_gemma":0.0007157513,"threshold_uncertainty_score":0.052109897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91303694,0.0015413867,0.0053543677,0.0018407344,0.00051771814,0.000049904243,0.004263933,0.00021774713,0.07317721],"genre_scores_gemma":[0.98805094,0.00033757434,0.00068319374,0.00027777112,0.00005701594,0.000025012492,0.0011373907,0.000033038286,0.009398045],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99977285,0.000038082606,0.000012823477,0.00006701346,0.00004987837,0.000059215137],"domain_scores_gemma":[0.99938214,0.00011992011,0.00019255179,0.00008238649,0.00012054847,0.00010243419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026051683,0.00010781562,0.00016506844,0.0006902217,0.0012418991,0.0015081879,0.0002342555,0.00041962272,0.0063163843],"category_scores_gemma":[0.0018698607,0.000108056156,0.00009766808,0.0014485002,0.0004443725,0.0009957317,0.0006791231,0.0004244059,0.001553423],"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.0008167881,0.00011186732,0.58385247,0.00047723748,0.00020815247,0.001235388,0.027036862,0.0012818662,0.012170365,0.037357707,0.06367318,0.2717781],"study_design_scores_gemma":[0.0000136071085,0.00011654933,0.6430932,0.00013797113,0.000047258804,0.0006368808,0.019185917,0.0010931859,0.0028757558,0.0037099791,0.3290348,0.00005483602],"about_ca_topic_score_codex":0.00852951,"about_ca_topic_score_gemma":0.025576873,"teacher_disagreement_score":0.00852951,"about_ca_system_score_codex":0.00045027887,"about_ca_system_score_gemma":0.00030752426,"threshold_uncertainty_score":0.021130443},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010639185,0.00012030433,0.987987,0.00020838788,0.000016276717,0.000031834334,0.00005079913,0.00014431041,0.00080197497],"genre_scores_gemma":[0.4963893,0.000437476,0.49609405,0.00028678915,0.00010096735,0.00036400298,0.0005102932,0.00033527607,0.0054819584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988858,0.00057392556,0.00003150023,0.0001938833,0.0001927109,0.00012221247],"domain_scores_gemma":[0.993985,0.0047938633,0.0003251529,0.0003692339,0.00031116031,0.0002155842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025449465,0.0014286069,0.0018893381,0.0007095987,0.00060153543,0.0009977729,0.0020131576,0.0017757575,0.0029593038],"category_scores_gemma":[0.00952846,0.0008191282,0.0009165988,0.0008427708,0.0018831993,0.003146525,0.0023259646,0.0021013862,0.0006782089],"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.00012645019,0.000038133465,0.00035589785,0.0000928698,0.000031257452,0.00008574844,0.000066455475,0.942476,0.0010263841,0.035826944,0.001304723,0.018569201],"study_design_scores_gemma":[0.000005386028,0.0000060486495,0.000013245351,0.0000019060984,0.0000010433507,0.000005450546,0.0000034575933,0.9929091,0.00009956625,0.0068913093,0.000061424755,0.0000021403675],"about_ca_topic_score_codex":0.004933306,"about_ca_topic_score_gemma":0.0036236977,"teacher_disagreement_score":0.004933306,"about_ca_system_score_codex":0.0010765038,"about_ca_system_score_gemma":0.0016466578,"threshold_uncertainty_score":0.013459086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5297477,0.0004981414,0.45980167,0.0015255465,0.0000546524,0.00010600637,0.000306269,0.00035252693,0.007607454],"genre_scores_gemma":[0.9885875,0.0003539133,0.0072096237,0.00013358223,0.000050501007,0.000055462282,0.00008978864,0.000038858,0.0034806887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993801,0.00021799734,0.00002262521,0.00013947,0.000111295965,0.00012844033],"domain_scores_gemma":[0.9940546,0.0032165605,0.001235228,0.000589371,0.00039932117,0.0005049173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015733128,0.0004852194,0.0008151174,0.0013340813,0.00053846015,0.0013622345,0.0012589553,0.0011679322,0.0025141109],"category_scores_gemma":[0.009055953,0.000508622,0.0008700764,0.00045997364,0.0024188522,0.0037567,0.0014434871,0.0017908972,0.00028616982],"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.00011792042,0.0001536934,0.0072269575,0.00016903198,0.000084012325,0.00077399146,0.0007144031,0.2713444,0.009030897,0.6991141,0.002263583,0.009007051],"study_design_scores_gemma":[0.000014640804,0.000025941832,0.002929341,0.000014899784,0.00001561341,0.00017027279,0.000070516006,0.8257266,0.00050034793,0.17001246,0.0004909985,0.00002842292],"about_ca_topic_score_codex":0.0044588493,"about_ca_topic_score_gemma":0.0026276258,"teacher_disagreement_score":0.0044588493,"about_ca_system_score_codex":0.00165578,"about_ca_system_score_gemma":0.0007146049,"threshold_uncertainty_score":0.012013614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19639467,0.00028753912,0.7940555,0.0009818099,0.00007568306,0.00020243334,0.0006840816,0.00027740246,0.007040874],"genre_scores_gemma":[0.700036,0.0002727504,0.2940591,0.0001650812,0.00007445017,0.0002123446,0.00086206576,0.00004733193,0.004270931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689937,0.0008411044,0.00020259504,0.0010891496,0.000612505,0.0003552349],"domain_scores_gemma":[0.9946343,0.002574076,0.001076466,0.0006522774,0.00073889905,0.00032402668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015671902,0.00056937203,0.000800841,0.0036454275,0.0018037347,0.0021095644,0.0008635605,0.0015168382,0.0024296863],"category_scores_gemma":[0.009725099,0.00031987013,0.0006498481,0.0028463723,0.001998381,0.0036537484,0.0029359413,0.0011027151,0.0008779053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012698878,0.00034784875,0.11396326,0.0007116293,0.00024107478,0.0018552429,0.010345466,0.054096963,0.017215692,0.3780071,0.009216991,0.41272885],"study_design_scores_gemma":[0.000035400975,0.0001191972,0.01664118,0.00018194773,0.00008077162,0.0012075976,0.007602986,0.5336338,0.0077324254,0.41981414,0.012833999,0.000116505755],"about_ca_topic_score_codex":0.0072285603,"about_ca_topic_score_gemma":0.009175334,"teacher_disagreement_score":0.0072285603,"about_ca_system_score_codex":0.0011699949,"about_ca_system_score_gemma":0.001123231,"threshold_uncertainty_score":0.014372945},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05223154,0.00024717202,0.9458213,0.00010178455,0.000017513225,0.00011999364,0.00008642949,0.00051843154,0.00085584866],"genre_scores_gemma":[0.41211626,0.00016977888,0.5856591,0.00006749153,0.000050049748,0.0001757638,0.00049898244,0.000110511166,0.001152062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829096,0.0004809628,0.00008936561,0.00043676564,0.00052418804,0.00017768203],"domain_scores_gemma":[0.997323,0.0012806569,0.0003666834,0.00033589802,0.0005267713,0.00016705184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015170838,0.00089983986,0.0011129805,0.0048182644,0.0012165867,0.0012214064,0.0012948638,0.0012241296,0.0007648672],"category_scores_gemma":[0.004504923,0.00053754094,0.0010842873,0.0031866522,0.0008164148,0.002095411,0.0015781763,0.00071019004,0.00032295703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041318414,0.000351522,0.011355843,0.00031251062,0.00038795779,0.0005337191,0.0014415878,0.3667443,0.047888365,0.02419148,0.004855995,0.5415236],"study_design_scores_gemma":[0.000010437247,0.000036415087,0.0014843447,0.000010778978,0.00003249753,0.0000899038,0.00010252639,0.9836521,0.0035370225,0.0101924855,0.00083351025,0.000017934179],"about_ca_topic_score_codex":0.0064371843,"about_ca_topic_score_gemma":0.007825805,"teacher_disagreement_score":0.0064371843,"about_ca_system_score_codex":0.00080837583,"about_ca_system_score_gemma":0.00091279816,"threshold_uncertainty_score":0.012799442},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96706665,0.00018463627,0.03028382,0.000120905555,0.0000108229015,0.00008625862,0.0002450792,0.000036647325,0.0019651786],"genre_scores_gemma":[0.9836285,0.00009560739,0.015672078,0.000009581044,0.0000069749854,0.00003324563,0.00021685263,0.000009824297,0.00032748264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808025,0.0010554355,0.00009095773,0.00025158917,0.0003778238,0.00014396277],"domain_scores_gemma":[0.98680276,0.009358826,0.0015475559,0.00059511693,0.0013817447,0.00031404066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038051393,0.0005788068,0.0003659556,0.0048158094,0.00060171203,0.0011182437,0.00085574493,0.0006920017,0.00076809083],"category_scores_gemma":[0.013397785,0.00019447054,0.0007073396,0.003109987,0.0010614081,0.002348786,0.00093774474,0.00058988505,0.000061705],"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.00046732542,0.0004200952,0.14014372,0.00049352297,0.0007035096,0.0034738698,0.0036413465,0.744188,0.0076060095,0.026861137,0.0010356104,0.07096579],"study_design_scores_gemma":[0.000018752384,0.0002356844,0.054961,0.0000542671,0.00015332022,0.00044253876,0.0038921228,0.92711306,0.0022944328,0.009448776,0.0013332809,0.00005271197],"about_ca_topic_score_codex":0.011815787,"about_ca_topic_score_gemma":0.012330761,"teacher_disagreement_score":0.011815787,"about_ca_system_score_codex":0.0019193325,"about_ca_system_score_gemma":0.00054756197,"threshold_uncertainty_score":0.023494005},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44276348,0.003421272,0.5379854,0.0012953123,0.00031364802,0.00057391636,0.0069948104,0.0028251295,0.0038269612],"genre_scores_gemma":[0.861945,0.0009943016,0.1267141,0.000088020344,0.0002598322,0.0003186624,0.007622467,0.00017357914,0.001884023],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.992415,0.0021913606,0.0007399168,0.0011107796,0.0032416582,0.00030125733],"domain_scores_gemma":[0.9603992,0.02725909,0.0037389188,0.0024872103,0.0048168814,0.0012985817],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0076225153,0.0015818585,0.0015781756,0.012048761,0.0008045542,0.0037871175,0.0013488734,0.0016382806,0.0011295559],"category_scores_gemma":[0.05275583,0.00041530628,0.00079676526,0.008461666,0.0007620709,0.007231127,0.0017726844,0.0011336888,0.00044691778],"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.0010319793,0.00082861003,0.122540124,0.0007297268,0.00060326606,0.00036222773,0.00049782335,0.31832838,0.0057019675,0.02794267,0.0110622775,0.51037097],"study_design_scores_gemma":[0.000016158778,0.00019377418,0.005787479,0.000044326578,0.0000630307,0.0000890399,0.00013495816,0.9626703,0.0019881288,0.027377903,0.0016187576,0.000016005102],"about_ca_topic_score_codex":0.0036418063,"about_ca_topic_score_gemma":0.005556798,"teacher_disagreement_score":0.9879512,"about_ca_system_score_codex":0.001763463,"about_ca_system_score_gemma":0.001351375,"threshold_uncertainty_score":0.04031217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023629325,0.00023992745,0.99525696,0.00015284585,0.00004985687,0.00002052767,0.000047349436,0.00010360171,0.0017660167],"genre_scores_gemma":[0.42731798,0.0012133756,0.55737466,0.00049960037,0.0005183368,0.00046450936,0.00041305905,0.00043537124,0.011763138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923503,0.00024600368,0.000034000106,0.00015654373,0.00021128035,0.00011716503],"domain_scores_gemma":[0.9945557,0.0045923074,0.00017920687,0.00022570672,0.0002985057,0.00014850126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016765705,0.0017178769,0.002095831,0.0013514278,0.00080028793,0.0018798377,0.0025953527,0.0022098066,0.005645781],"category_scores_gemma":[0.010074662,0.00085678394,0.0013026189,0.0017504309,0.0017599771,0.0024899251,0.0023885928,0.0024411215,0.0007506197],"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.00010283352,0.00009366921,0.00027136283,0.00019774307,0.000071462724,0.00011384923,0.00010033811,0.8486264,0.0021483577,0.091424294,0.0032235926,0.05362611],"study_design_scores_gemma":[0.0000031516613,0.000004667423,0.000013253232,0.0000036255274,0.000004163746,0.0000062128556,0.0000029423231,0.9888181,0.00012960374,0.0108001055,0.00021142997,0.0000026381051],"about_ca_topic_score_codex":0.0062469663,"about_ca_topic_score_gemma":0.008151116,"teacher_disagreement_score":0.0062469663,"about_ca_system_score_codex":0.0016352176,"about_ca_system_score_gemma":0.0018524721,"threshold_uncertainty_score":0.018887043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9708628,0.0004978461,0.020346,0.001093905,0.000044708577,0.000027726028,0.00013122197,0.00009696625,0.0068987682],"genre_scores_gemma":[0.99813473,0.00012628437,0.0013195274,0.000050698225,0.000008049841,0.000008441618,0.00002617997,0.000010227448,0.00031584778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994981,0.000275561,0.000012071105,0.00006758556,0.000053619504,0.0000930214],"domain_scores_gemma":[0.9904336,0.0075104428,0.0008531082,0.00031011392,0.00031324173,0.00057946803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014469058,0.0004483767,0.00035806198,0.00081165164,0.0007327446,0.0010959259,0.0007360507,0.0011296193,0.0018483081],"category_scores_gemma":[0.0176056,0.00028346793,0.0003930827,0.00047038455,0.0011579258,0.0019427948,0.0010185078,0.0007089907,0.00010081509],"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.00017597919,0.00008600597,0.005263151,0.00007609148,0.000064308326,0.000375738,0.00012247215,0.9543666,0.0051228353,0.0288517,0.000609283,0.0048857154],"study_design_scores_gemma":[0.000035231555,0.00014300506,0.0026562882,0.000014650926,0.000036119643,0.000107394284,0.0001403654,0.97990406,0.0007826091,0.015747176,0.00041222398,0.000020851901],"about_ca_topic_score_codex":0.0058139483,"about_ca_topic_score_gemma":0.0054227524,"teacher_disagreement_score":0.0058139483,"about_ca_system_score_codex":0.0012494113,"about_ca_system_score_gemma":0.0005028838,"threshold_uncertainty_score":0.011560202},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6969525,0.0005873516,0.29778686,0.0011528435,0.000030959094,0.000036022702,0.00029954687,0.00018644192,0.002967377],"genre_scores_gemma":[0.9892804,0.00035111315,0.009721088,0.000043164862,0.000021600974,0.000019203877,0.00013920348,0.000014419709,0.00040994355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996092,0.00018988502,0.00001470431,0.00008993603,0.00005225555,0.0000440336],"domain_scores_gemma":[0.9936073,0.004874018,0.0008328404,0.00028828235,0.0002277076,0.00016995153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001856489,0.00039829395,0.0004139904,0.0014483767,0.00042565344,0.0009910685,0.0006393654,0.0010431121,0.000762872],"category_scores_gemma":[0.012054927,0.00034409572,0.0005582596,0.00064468046,0.000891131,0.0023864862,0.0006903358,0.001017802,0.0001412592],"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.00003367362,0.000017898086,0.011282645,0.000022796903,0.000034511868,0.000046302466,0.000086231106,0.9641268,0.0008604697,0.016552702,0.0002774751,0.006658526],"study_design_scores_gemma":[0.0000025446489,0.000007690047,0.0017694514,0.0000072398484,0.0000050301423,0.000014281943,0.000020393965,0.976045,0.00024025164,0.021693587,0.0001885827,0.000005945548],"about_ca_topic_score_codex":0.004718387,"about_ca_topic_score_gemma":0.0033754238,"teacher_disagreement_score":0.004718387,"about_ca_system_score_codex":0.0010666868,"about_ca_system_score_gemma":0.0003348023,"threshold_uncertainty_score":0.009818196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40016395,0.0036302707,0.5799785,0.0010838674,0.00032880096,0.002925069,0.0012988088,0.00080041867,0.009790213],"genre_scores_gemma":[0.76821744,0.0005638934,0.22805567,0.000119893695,0.0000704812,0.001671706,0.00062234775,0.0000801229,0.000598341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9729086,0.022692323,0.0010580514,0.00085017225,0.0021518879,0.00033891387],"domain_scores_gemma":[0.8200123,0.15857072,0.005014661,0.006801511,0.008949222,0.000651676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.039566822,0.0011609818,0.0015595759,0.0073527563,0.0006728698,0.0017856428,0.0018634046,0.0018178506,0.0019635996],"category_scores_gemma":[0.09359042,0.00038157296,0.0015077069,0.0037023001,0.0010588014,0.0027926313,0.0017502843,0.0012480709,0.00016889462],"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.004494968,0.0024154123,0.033582367,0.0018089042,0.0035343154,0.00016294287,0.0007923379,0.7389179,0.0055817203,0.042303957,0.0039176373,0.16248752],"study_design_scores_gemma":[0.00019883033,0.0020525001,0.005327244,0.00019416238,0.0003455794,0.00007012434,0.00038154222,0.9799891,0.0027338415,0.007301123,0.0013290552,0.000076813325],"about_ca_topic_score_codex":0.0049792356,"about_ca_topic_score_gemma":0.0035286138,"teacher_disagreement_score":0.039566822,"about_ca_system_score_codex":0.002322431,"about_ca_system_score_gemma":0.001216994,"threshold_uncertainty_score":0.20925188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3465516,0.0023914964,0.63537407,0.0017522629,0.00022220361,0.0003227409,0.0019436129,0.0034071384,0.008034814],"genre_scores_gemma":[0.84000015,0.00068920373,0.1498781,0.00021678032,0.000253329,0.00021070403,0.0034853942,0.00040761658,0.0048587224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976428,0.00087897904,0.0000970309,0.00041003717,0.0006908591,0.00028030027],"domain_scores_gemma":[0.95609945,0.038396373,0.00087269413,0.0023761706,0.0018602005,0.00039511546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039455323,0.001000059,0.0010811578,0.002238952,0.0008391012,0.0020540738,0.0025659183,0.0014012235,0.0050552017],"category_scores_gemma":[0.027064549,0.0005247346,0.000922879,0.002741539,0.00074558123,0.0048451107,0.0011939672,0.0014666414,0.00082450494],"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.00061809644,0.0005833653,0.011579621,0.0002944739,0.00018159529,0.000088166176,0.00016679987,0.7175856,0.0028543524,0.036209233,0.011746929,0.21809174],"study_design_scores_gemma":[0.000007226254,0.000025144267,0.00046829323,0.000005314284,0.000012647999,0.000012932882,0.000015459884,0.98901993,0.0004273635,0.009824076,0.0001784102,0.0000031812428],"about_ca_topic_score_codex":0.004886662,"about_ca_topic_score_gemma":0.0053752544,"teacher_disagreement_score":0.0050552017,"about_ca_system_score_codex":0.0021275776,"about_ca_system_score_gemma":0.0016412203,"threshold_uncertainty_score":0.020866215},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59359634,0.0013180672,0.3952442,0.00061969465,0.000055277986,0.00019902381,0.0017220471,0.00049793004,0.0067474353],"genre_scores_gemma":[0.9629236,0.00031410952,0.035915244,0.000016135215,0.000030827814,0.00006913554,0.00047831514,0.000014857965,0.00023767848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993556,0.00028606696,0.000055382832,0.00009094689,0.00016012845,0.00005181918],"domain_scores_gemma":[0.9858395,0.0090966355,0.0028853286,0.0008720972,0.0009623382,0.00034400937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016126819,0.00064953783,0.00035325653,0.009460049,0.0005130556,0.0013101464,0.0006182963,0.0008144838,0.0014286063],"category_scores_gemma":[0.019110369,0.0002078601,0.00046804533,0.0049344134,0.0008605853,0.0027761473,0.00083502225,0.0007867185,0.0002646314],"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.00017167836,0.0002111074,0.35854086,0.0004153268,0.00044842163,0.00034913752,0.0007604604,0.41665766,0.004702828,0.07285968,0.0030297225,0.14185312],"study_design_scores_gemma":[0.000015845404,0.00011355133,0.08346318,0.00007770575,0.0000992947,0.00034543528,0.00071013026,0.8557765,0.0015485338,0.056000162,0.0017836402,0.000065896464],"about_ca_topic_score_codex":0.002682511,"about_ca_topic_score_gemma":0.0030933188,"teacher_disagreement_score":0.009460049,"about_ca_system_score_codex":0.00087232725,"about_ca_system_score_gemma":0.00044825082,"threshold_uncertainty_score":0.008528769},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021159367,0.000470305,0.9877385,0.00060896913,0.000082324405,0.000101916245,0.0003460253,0.0004216925,0.008114352],"genre_scores_gemma":[0.11958037,0.0022172907,0.8608135,0.0004931776,0.00023205882,0.0010890582,0.0010735004,0.0005243079,0.013976739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986933,0.0005515483,0.00008041701,0.00024762482,0.00032283494,0.00010435874],"domain_scores_gemma":[0.9981394,0.0008230264,0.00022182394,0.00033084812,0.00026507914,0.00021988117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024449355,0.0011808256,0.00087615283,0.0027526126,0.0019823187,0.0039300276,0.003783541,0.00207598,0.007189614],"category_scores_gemma":[0.005471929,0.0008507148,0.0018984835,0.0018486785,0.0039266637,0.00530512,0.0036550106,0.0031766498,0.0014518388],"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.000016244385,0.000011732974,0.00025484318,0.00007969464,0.000016442264,0.00010093263,0.00018145813,0.076598845,0.00053562527,0.91113245,0.0024316343,0.008640127],"study_design_scores_gemma":[0.00002372051,0.00003215478,0.00016221871,0.00006746037,0.000016154905,0.00018013449,0.00012305914,0.31787324,0.0004123693,0.61463225,0.06644512,0.000032132615],"about_ca_topic_score_codex":0.009558568,"about_ca_topic_score_gemma":0.011852238,"teacher_disagreement_score":0.009558568,"about_ca_system_score_codex":0.002466624,"about_ca_system_score_gemma":0.002665898,"threshold_uncertainty_score":0.024051607},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10102152,0.0008298252,0.8937985,0.00052467355,0.00013135918,0.00007229962,0.0004368058,0.00096395443,0.002220988],"genre_scores_gemma":[0.5602852,0.0023147496,0.4296038,0.00025627014,0.00021592678,0.00014971088,0.0016699178,0.00038878663,0.005115639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993793,0.000121008394,0.00004194328,0.000107063235,0.000288758,0.000061906736],"domain_scores_gemma":[0.9972365,0.0012474867,0.00030913466,0.00067477184,0.00045915868,0.000073018535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067234645,0.0009761071,0.0005688491,0.0020301957,0.00046504257,0.00084220606,0.0009838954,0.0006991339,0.0014153827],"category_scores_gemma":[0.0071143657,0.00029917705,0.00045879986,0.0028478184,0.000864364,0.0032978675,0.0011235457,0.0010594305,0.00045311768],"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.0004860202,0.00008131311,0.0016566461,0.00024056993,0.00007551561,0.000546132,0.0005427001,0.44730136,0.04529683,0.05597941,0.0048692888,0.44292423],"study_design_scores_gemma":[0.000010956361,0.000054290264,0.0005802759,0.000018990004,0.000017714376,0.00023478402,0.000119928976,0.94723845,0.012236473,0.036388956,0.0030800137,0.000019287801],"about_ca_topic_score_codex":0.003971232,"about_ca_topic_score_gemma":0.0028722466,"teacher_disagreement_score":0.003971232,"about_ca_system_score_codex":0.0007116473,"about_ca_system_score_gemma":0.00048482043,"threshold_uncertainty_score":0.007896185},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016407363,0.00034018946,0.9813861,0.00021345151,0.00005780483,0.00006776502,0.00010595739,0.0008647104,0.0005565909],"genre_scores_gemma":[0.36594054,0.00045388046,0.6284214,0.00016105773,0.00017158494,0.00024833693,0.0008174057,0.00024391928,0.0035418484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999305,0.00019306132,0.0000327578,0.00017617537,0.00021113521,0.00008188213],"domain_scores_gemma":[0.9981798,0.0008564889,0.00015573356,0.00022748476,0.00043574086,0.00014475775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013491529,0.0009131786,0.0014893451,0.0035034602,0.0013336843,0.0010142061,0.0024064323,0.0014657087,0.0020689366],"category_scores_gemma":[0.005229005,0.00039580092,0.0011995804,0.0029190998,0.0010008719,0.0017864378,0.001937232,0.0014196221,0.000742029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033482313,0.00025384504,0.0047682845,0.00025423823,0.00033446285,0.00017444219,0.00027840582,0.42434335,0.009232451,0.049545716,0.015676113,0.49480382],"study_design_scores_gemma":[0.000012855253,0.00001599746,0.0003731881,0.000004702164,0.000009827237,0.000025165717,0.000019432839,0.9882299,0.00041459172,0.010217906,0.0006689414,0.0000075539715],"about_ca_topic_score_codex":0.01575364,"about_ca_topic_score_gemma":0.012443077,"teacher_disagreement_score":0.01575364,"about_ca_system_score_codex":0.0010046499,"about_ca_system_score_gemma":0.0019337538,"threshold_uncertainty_score":0.03132385},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022285426,0.00028773537,0.9325931,0.00059478375,0.000144931,0.00011840119,0.00092580897,0.038359083,0.004690707],"genre_scores_gemma":[0.14809364,0.00050844025,0.8383727,0.00020107522,0.00006802374,0.00027732085,0.0023829557,0.0068252063,0.0032706296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971634,0.000059341077,0.000013453979,0.000060167476,0.00012232354,0.000028400458],"domain_scores_gemma":[0.9990746,0.00034624213,0.00006579465,0.00016529216,0.00023158127,0.000116588606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005611738,0.001280451,0.00050011487,0.0018717812,0.0008830324,0.002025284,0.0017193976,0.0008124243,0.0072892467],"category_scores_gemma":[0.0028222022,0.00065244833,0.00096574664,0.0014386579,0.00053004705,0.0028919699,0.0016240908,0.0016121177,0.0014209084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072713644,0.00033497193,0.006272542,0.0009123488,0.0004260846,0.0008723399,0.0017145321,0.16495912,0.11418037,0.064892925,0.11094132,0.53376645],"study_design_scores_gemma":[0.00010738611,0.00006450333,0.0009260004,0.00004966149,0.000030113546,0.00024547754,0.00018728166,0.8965776,0.025454925,0.04271915,0.033562005,0.00007584962],"about_ca_topic_score_codex":0.007082764,"about_ca_topic_score_gemma":0.010781511,"teacher_disagreement_score":0.0072892467,"about_ca_system_score_codex":0.0007399166,"about_ca_system_score_gemma":0.0010869685,"threshold_uncertainty_score":0.024385035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038226996,0.00021168275,0.9598588,0.00022487527,0.00003725286,0.00005728353,0.00016220438,0.0007967064,0.00042409103],"genre_scores_gemma":[0.731607,0.00029130172,0.2617954,0.00021204542,0.00019774381,0.00018991901,0.001322061,0.00028329223,0.004101337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748623,0.0008536471,0.00013672559,0.00078366447,0.0004721342,0.00026748187],"domain_scores_gemma":[0.9877786,0.0077690873,0.0010104005,0.0013518459,0.0014220055,0.0006680212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037894137,0.0010397809,0.0024128568,0.002579493,0.0014183755,0.001785818,0.003885639,0.002278217,0.0017923343],"category_scores_gemma":[0.01744238,0.0007545124,0.0016589715,0.0021636991,0.0017729771,0.0040320237,0.0033161652,0.0029103097,0.00072498294],"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.0006967163,0.00063412724,0.008458776,0.0003245072,0.00033283152,0.00024284008,0.00034409334,0.64792734,0.007379104,0.03431992,0.0049812873,0.29435837],"study_design_scores_gemma":[0.0000039478573,0.000010120471,0.0001465355,0.0000033110168,0.000006053176,0.000011089624,0.0000076163446,0.9907141,0.0003357862,0.008658393,0.00009953315,0.0000035483326],"about_ca_topic_score_codex":0.008100015,"about_ca_topic_score_gemma":0.010079133,"teacher_disagreement_score":0.008100015,"about_ca_system_score_codex":0.001716918,"about_ca_system_score_gemma":0.0022260034,"threshold_uncertainty_score":0.020040572},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77356386,0.001218024,0.21581665,0.00046573,0.00018015232,0.00022016444,0.0023804216,0.0023983219,0.003756631],"genre_scores_gemma":[0.96844316,0.00035248647,0.025450492,0.00003995479,0.000069967195,0.000059840462,0.0019297535,0.00005697343,0.0035974148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993032,0.00011991464,0.000056726323,0.0002277912,0.00019153043,0.000100850346],"domain_scores_gemma":[0.99608624,0.00184311,0.0006320043,0.00039244565,0.00087316585,0.00017308645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091031496,0.0013351993,0.00079136743,0.0022944477,0.0004106291,0.0007088411,0.0006787676,0.0008911064,0.0010278382],"category_scores_gemma":[0.005449784,0.0003070479,0.0008542593,0.0012979252,0.00024874846,0.0018913085,0.00038785752,0.0011508721,0.00134759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012826195,0.001114465,0.29207477,0.00038611857,0.00044658146,0.0011466673,0.00067992357,0.21533132,0.040596638,0.002841327,0.008787092,0.43531242],"study_design_scores_gemma":[0.000004635555,0.00009900417,0.022347962,0.000011910807,0.00004647039,0.00013826355,0.00004199852,0.9712142,0.0045311856,0.00085120235,0.0006894289,0.000023759732],"about_ca_topic_score_codex":0.010852425,"about_ca_topic_score_gemma":0.01443778,"teacher_disagreement_score":0.010852425,"about_ca_system_score_codex":0.00046687588,"about_ca_system_score_gemma":0.0003395634,"threshold_uncertainty_score":0.02157849},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08208166,0.0013361381,0.9110938,0.0003982312,0.00023253945,0.0003651722,0.00065054547,0.0009789327,0.0028630362],"genre_scores_gemma":[0.49540234,0.00069225713,0.4989322,0.0001757532,0.00017898467,0.00053650665,0.0020647715,0.0004242031,0.0015930139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99031925,0.0041830917,0.0006612748,0.0013022012,0.003159815,0.0003743414],"domain_scores_gemma":[0.96874183,0.019125024,0.0022757042,0.003665494,0.0049484316,0.0012434744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00909245,0.0019148681,0.002432559,0.010155047,0.0019173,0.0036133085,0.0034984115,0.0029538572,0.0019964695],"category_scores_gemma":[0.05317372,0.00052213774,0.0013808847,0.0066821417,0.0020907123,0.0077127,0.00458148,0.002088666,0.0006163703],"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.0013367267,0.0007576977,0.02228611,0.0010527925,0.0014264428,0.00020872157,0.000726484,0.5028898,0.0090190815,0.08640941,0.010535796,0.3633509],"study_design_scores_gemma":[0.000083698214,0.0005415899,0.0024813677,0.000055834367,0.00012295839,0.00020306834,0.00023264387,0.9505768,0.003603809,0.03916024,0.0028730726,0.00006498364],"about_ca_topic_score_codex":0.0039704004,"about_ca_topic_score_gemma":0.0037481866,"teacher_disagreement_score":0.010155047,"about_ca_system_score_codex":0.0022230654,"about_ca_system_score_gemma":0.0018383703,"threshold_uncertainty_score":0.048086047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04010537,0.00033124088,0.94973785,0.00031695171,0.000083222665,0.00020855875,0.0004147069,0.007093859,0.0017082819],"genre_scores_gemma":[0.38926092,0.00021179601,0.60618204,0.00017668049,0.00008656845,0.00040300554,0.0014906174,0.0004031072,0.0017852794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848783,0.00031510615,0.00006402569,0.00041950773,0.0005415636,0.00017195189],"domain_scores_gemma":[0.99761045,0.00069888576,0.00017551972,0.0007518255,0.0005480197,0.00021524432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015722818,0.0009779619,0.0010761316,0.0016401269,0.0015828363,0.0012517495,0.0027126728,0.000700384,0.001296142],"category_scores_gemma":[0.0049792137,0.0005459707,0.0012684967,0.001713793,0.0007076959,0.0026996764,0.0024202436,0.0012143124,0.00060447253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062758743,0.0006647461,0.007467042,0.000507539,0.00048198848,0.0005694351,0.00065498624,0.41160938,0.039390355,0.024392456,0.028034896,0.48559955],"study_design_scores_gemma":[0.000043505603,0.000043373122,0.00073873485,0.0000058393393,0.000024763889,0.00012505028,0.00013394971,0.9658901,0.0068685603,0.022763941,0.0033415267,0.000020670217],"about_ca_topic_score_codex":0.009425278,"about_ca_topic_score_gemma":0.011564204,"teacher_disagreement_score":0.009425278,"about_ca_system_score_codex":0.0010063881,"about_ca_system_score_gemma":0.0019453068,"threshold_uncertainty_score":0.018740833},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08288246,0.0011629805,0.6732771,0.0024861125,0.0004164112,0.00070976,0.03727412,0.18674894,0.0150422165],"genre_scores_gemma":[0.55380195,0.0014389906,0.39647242,0.00049986446,0.000108373104,0.0007768634,0.035750538,0.0034810458,0.007669945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939287,0.00014547569,0.000064583575,0.00014413518,0.00020701658,0.000045917175],"domain_scores_gemma":[0.99788624,0.0007511399,0.0001681743,0.00041156306,0.00061839906,0.00016454948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010114218,0.0011500322,0.0006120058,0.0034639272,0.00051339564,0.0023923113,0.0010857116,0.0007573471,0.009283894],"category_scores_gemma":[0.004583107,0.00035691244,0.0007389572,0.0015939584,0.00022871244,0.0017930006,0.001529053,0.0010284646,0.0018470971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002193498,0.0006609592,0.028760377,0.0020607726,0.0004618069,0.0017305121,0.0031416947,0.1581984,0.04285106,0.030105747,0.18963425,0.5402009],"study_design_scores_gemma":[0.00010042184,0.00016591854,0.0070966366,0.000179058,0.00009358087,0.00041006645,0.000434334,0.88329196,0.024329549,0.022721652,0.061052162,0.0001247629],"about_ca_topic_score_codex":0.005611574,"about_ca_topic_score_gemma":0.0039508506,"teacher_disagreement_score":0.009283894,"about_ca_system_score_codex":0.00062752736,"about_ca_system_score_gemma":0.00081879017,"threshold_uncertainty_score":0.031057715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19460064,0.0019913653,0.7965379,0.0011866923,0.00018132546,0.000073103125,0.0005552937,0.0014735956,0.0034000895],"genre_scores_gemma":[0.9643899,0.0004502985,0.03196605,0.00015832734,0.000069340866,0.000058587993,0.0005340124,0.000053509393,0.002319932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996099,0.0000886922,0.000024947689,0.00014462353,0.00007987312,0.000052074058],"domain_scores_gemma":[0.9984718,0.0008963208,0.00022675954,0.00011454042,0.00022516274,0.00006533758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010233383,0.0009625848,0.0010368075,0.0006716762,0.00033561463,0.00076739764,0.0013361285,0.0009496852,0.0008795652],"category_scores_gemma":[0.004424734,0.00045291148,0.00071063417,0.0006354313,0.0005239297,0.0017691692,0.00074431655,0.00143097,0.00030343852],"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.000091131995,0.00006380746,0.0025180918,0.000053540844,0.000061539795,0.00011604307,0.00006091653,0.95078677,0.0014424341,0.0049701678,0.0015566689,0.0382788],"study_design_scores_gemma":[0.0000014133508,0.0000031378993,0.000063907406,0.0000011105659,0.0000024998842,0.000003070579,0.0000012037019,0.99888784,0.00008578286,0.0009077818,0.000040685605,0.0000014922394],"about_ca_topic_score_codex":0.012307351,"about_ca_topic_score_gemma":0.013620958,"teacher_disagreement_score":0.012307351,"about_ca_system_score_codex":0.0010379213,"about_ca_system_score_gemma":0.0006660904,"threshold_uncertainty_score":0.024471402},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014093819,0.0007196781,0.9827276,0.00031488118,0.000045942812,0.00015304693,0.0006012677,0.0006904898,0.00065326586],"genre_scores_gemma":[0.2853953,0.0009261393,0.7045083,0.00018132139,0.00027199805,0.0006818706,0.003199871,0.0005105585,0.00432458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953178,0.002284156,0.00025205023,0.0010370532,0.0008507409,0.00025824283],"domain_scores_gemma":[0.9743283,0.018184645,0.00185364,0.0028224986,0.0019794337,0.000831486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048361085,0.0012404243,0.0024325403,0.007957988,0.0023729582,0.0022175247,0.0037312983,0.0026061595,0.0028323357],"category_scores_gemma":[0.033833016,0.0012651923,0.002801943,0.005500302,0.0021286884,0.0032506431,0.0031374448,0.0030114814,0.0015899864],"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.0005098062,0.00032079386,0.006313596,0.000991999,0.0007270221,0.00031561175,0.0012316664,0.6008382,0.0065838224,0.13163532,0.014874296,0.23565781],"study_design_scores_gemma":[0.000022267659,0.000026157815,0.0007524163,0.000032323667,0.000028733453,0.000054435845,0.00006533199,0.89731926,0.00045311477,0.09999051,0.0012326695,0.00002276928],"about_ca_topic_score_codex":0.011621821,"about_ca_topic_score_gemma":0.0110012265,"teacher_disagreement_score":0.011621821,"about_ca_system_score_codex":0.0022989374,"about_ca_system_score_gemma":0.0019645942,"threshold_uncertainty_score":0.025576115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.964373,0.0007129186,0.0238347,0.00208166,0.000079452824,0.00009737363,0.0005297535,0.00011574879,0.00817548],"genre_scores_gemma":[0.9959709,0.0003123835,0.0012407509,0.00006612178,0.000032286673,0.0000463358,0.000112637084,0.0000105431345,0.0022079735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971575,0.00009347282,0.000010049984,0.000065634515,0.000033147764,0.00008196971],"domain_scores_gemma":[0.99799323,0.0011645864,0.00036493613,0.00006968808,0.00024260172,0.00016506239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012321896,0.000724341,0.0004893995,0.0013181336,0.0008539024,0.0011052496,0.0013439269,0.0012264474,0.0023405855],"category_scores_gemma":[0.003182237,0.000328207,0.00072289736,0.0008286226,0.00088787306,0.002104993,0.0009536894,0.00096747937,0.00021767472],"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.00012020601,0.00026865967,0.06082085,0.00015694919,0.00011179776,0.00092371623,0.0010803355,0.87047696,0.0022734406,0.050500605,0.0041217133,0.009144699],"study_design_scores_gemma":[0.0000075729677,0.000019464509,0.0028544017,0.0000060812736,0.00001770963,0.000026161682,0.00012435677,0.9945821,0.00008408545,0.0019664976,0.00030079318,0.000010712747],"about_ca_topic_score_codex":0.07312193,"about_ca_topic_score_gemma":0.043439418,"teacher_disagreement_score":0.07312193,"about_ca_system_score_codex":0.0022454988,"about_ca_system_score_gemma":0.001351541,"threshold_uncertainty_score":0.14539266},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11991069,0.00083162304,0.8736886,0.00055655686,0.00005485761,0.000259342,0.0012505589,0.001035098,0.0024127155],"genre_scores_gemma":[0.5459295,0.00045808207,0.45021972,0.0001316731,0.000051684496,0.00034138196,0.0020012516,0.00006765557,0.0007990785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737823,0.00093079713,0.00016635138,0.00061533,0.00077429484,0.0001350986],"domain_scores_gemma":[0.98360956,0.012022334,0.0017305021,0.00095901283,0.0013380008,0.0003406495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00538107,0.0008510866,0.00073218095,0.0073971855,0.0010027512,0.00254844,0.0012716468,0.00088969886,0.0016202836],"category_scores_gemma":[0.024080565,0.00036261583,0.0010706292,0.0037629446,0.0012131013,0.0052805347,0.0017869984,0.001264157,0.00043967797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052382157,0.00038956528,0.0695387,0.0010782926,0.00038072286,0.00083472795,0.0038194354,0.24406303,0.012147407,0.21167512,0.0063221715,0.44922695],"study_design_scores_gemma":[0.000018732411,0.000049728318,0.004424534,0.00007718235,0.00003481928,0.00023866816,0.00058932067,0.8856262,0.0024175236,0.102445416,0.0040410124,0.000036889596],"about_ca_topic_score_codex":0.0055762776,"about_ca_topic_score_gemma":0.005863929,"teacher_disagreement_score":0.0073971855,"about_ca_system_score_codex":0.00182485,"about_ca_system_score_gemma":0.0014566518,"threshold_uncertainty_score":0.028458118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008612737,0.00039495836,0.9865725,0.0018040492,0.00011572078,0.00011443576,0.00016228238,0.00042419063,0.0017991662],"genre_scores_gemma":[0.2134824,0.0007214215,0.77890503,0.0009911333,0.00037020177,0.00033575427,0.00068206084,0.0004918391,0.004020072],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552023,0.0024214243,0.0001695725,0.0008368059,0.0007806184,0.0002713161],"domain_scores_gemma":[0.9795385,0.014048618,0.00088790676,0.002770889,0.0018950285,0.00085906027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006413729,0.0012429684,0.0017496072,0.0009430503,0.001060112,0.002398039,0.0024036178,0.0028950723,0.006643844],"category_scores_gemma":[0.04498078,0.00078802224,0.0008837996,0.0013090875,0.0026617178,0.008906891,0.0031589905,0.0045437906,0.0028528585],"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.0007894094,0.00045036533,0.0029890323,0.0010494392,0.00020818973,0.00047512478,0.0009791135,0.29101622,0.010450011,0.25781882,0.03712472,0.3966496],"study_design_scores_gemma":[0.000079357116,0.00014084796,0.0004300738,0.000086430664,0.00001911294,0.000207318,0.00016487631,0.7391849,0.0041655526,0.24954462,0.005921463,0.000055522534],"about_ca_topic_score_codex":0.003429873,"about_ca_topic_score_gemma":0.0045036594,"teacher_disagreement_score":0.006643844,"about_ca_system_score_codex":0.0008114939,"about_ca_system_score_gemma":0.0018645489,"threshold_uncertainty_score":0.033919454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5531218,0.00043536938,0.43650785,0.0014862585,0.00005496527,0.00010534855,0.00030033942,0.00035731995,0.007630645],"genre_scores_gemma":[0.9889341,0.00030424554,0.0070520965,0.000119090415,0.000047640002,0.00005154965,0.00008948821,0.00004050634,0.0033612417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931216,0.0002478083,0.000024947014,0.00015158406,0.0001243742,0.00013922862],"domain_scores_gemma":[0.9933502,0.0035609484,0.0014193336,0.00064793025,0.00042457125,0.00059711206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016540099,0.00048418497,0.00086707546,0.001380053,0.0005546258,0.0014620821,0.0012917423,0.0011710871,0.002632614],"category_scores_gemma":[0.009756049,0.0005280796,0.0009113868,0.0004781997,0.0027102525,0.0038008238,0.0015864099,0.0019074025,0.00030571682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011932993,0.00016563339,0.008558933,0.00016256412,0.000084075196,0.00080138363,0.00075994054,0.2760158,0.008789788,0.69370025,0.0022675379,0.008574697],"study_design_scores_gemma":[0.000015031892,0.000028318758,0.0033594852,0.000015257925,0.000016414542,0.00018740588,0.00008040534,0.8146557,0.00050831627,0.18059339,0.00050978456,0.00003049524],"about_ca_topic_score_codex":0.0045552533,"about_ca_topic_score_gemma":0.0027035638,"teacher_disagreement_score":0.0045552533,"about_ca_system_score_codex":0.0017189933,"about_ca_system_score_gemma":0.00076204626,"threshold_uncertainty_score":0.012472272},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05510027,0.00023973212,0.9413383,0.00021799358,0.00004533432,0.000109867746,0.00024459616,0.0017169686,0.0009869076],"genre_scores_gemma":[0.49198273,0.00017444749,0.5043853,0.00011495448,0.000058060526,0.00015958403,0.0010212685,0.00020885222,0.0018947556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986847,0.00022174857,0.000049069364,0.00043857508,0.0004816929,0.00012427075],"domain_scores_gemma":[0.9955449,0.0017217521,0.0004926346,0.00069541996,0.0012632681,0.00028203992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012749041,0.0007384148,0.0008486656,0.0028568737,0.0011057378,0.0010609208,0.002207122,0.00081182335,0.00070659106],"category_scores_gemma":[0.007955237,0.00044148517,0.0005654721,0.0024424747,0.00075180875,0.002212661,0.0017344333,0.000916109,0.0003320628],"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.00041032323,0.00025386497,0.009637645,0.00024757424,0.00018144037,0.0005250612,0.0005542769,0.56711,0.025785677,0.02390026,0.008638574,0.36275536],"study_design_scores_gemma":[0.000012993602,0.000019641508,0.0006030821,0.000004092585,0.000009373008,0.0000737581,0.00005226493,0.9851702,0.002657705,0.010344216,0.0010442275,0.000008505871],"about_ca_topic_score_codex":0.010358776,"about_ca_topic_score_gemma":0.013621687,"teacher_disagreement_score":0.010358776,"about_ca_system_score_codex":0.0012009077,"about_ca_system_score_gemma":0.0011827563,"threshold_uncertainty_score":0.020596981},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024854861,0.050617926,0.23729718,0.59942454,0.005518951,0.0005243128,0.000326492,0.00043957707,0.08099618],"genre_scores_gemma":[0.62076485,0.055473495,0.1857622,0.10906454,0.0140129635,0.0016475002,0.00031107132,0.00056628615,0.0123969745],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.87016857,0.07804688,0.005815985,0.008020405,0.035204705,0.002743436],"domain_scores_gemma":[0.6902232,0.23993571,0.010709947,0.014242183,0.038584188,0.006304693],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.21771908,0.0012415698,0.0014069512,0.003809051,0.00397542,0.014772813,0.0036675138,0.0059992345,0.003979196],"category_scores_gemma":[0.13783345,0.0010118599,0.0017974783,0.005757448,0.008469007,0.024414195,0.014773555,0.010457963,0.000988417],"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.0003421298,0.00009928299,0.023923105,0.002848857,0.00031881063,0.00023239822,0.0054508275,0.0029931744,0.0017416059,0.43933225,0.044935744,0.47778186],"study_design_scores_gemma":[0.00018705698,0.0004900814,0.027166054,0.0073870094,0.00038478116,0.0017727503,0.012954502,0.015638713,0.002893026,0.47989962,0.45088404,0.00034225872],"about_ca_topic_score_codex":0.0026633623,"about_ca_topic_score_gemma":0.0051606833,"teacher_disagreement_score":0.21771908,"about_ca_system_score_codex":0.0056958767,"about_ca_system_score_gemma":0.0083521325,"threshold_uncertainty_score":0.96469164},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11938258,0.0005980679,0.86666524,0.00040875396,0.000067111214,0.00013013236,0.00006161679,0.00024570184,0.012440822],"genre_scores_gemma":[0.97149557,0.00014205257,0.026393486,0.00007341187,0.000010261491,0.00007112046,0.000021989354,0.000017492996,0.0017745119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995364,0.00017822618,0.000020425852,0.000089755464,0.000102428225,0.00007282017],"domain_scores_gemma":[0.9992218,0.00038148943,0.00014362633,0.000052078365,0.00011654876,0.000084493084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080989714,0.00093993405,0.0005374595,0.00081697473,0.00042097253,0.0012585692,0.00085692195,0.0006935704,0.0023147166],"category_scores_gemma":[0.0020692192,0.00021751913,0.0004744249,0.00039923115,0.0006495292,0.0013315977,0.0011223102,0.00049464026,0.00021570742],"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.00028213774,0.000115999326,0.0018274464,0.00017040635,0.00018087924,0.00036282057,0.00018287617,0.8425935,0.015776647,0.062748805,0.0010128767,0.07474572],"study_design_scores_gemma":[0.000009030678,0.00013133878,0.00022150457,0.000013282911,0.000031018913,0.000046936024,0.00004083177,0.98843014,0.0010107313,0.009518529,0.00053778355,0.000008900316],"about_ca_topic_score_codex":0.0019335699,"about_ca_topic_score_gemma":0.002077573,"teacher_disagreement_score":0.0023147166,"about_ca_system_score_codex":0.00082387193,"about_ca_system_score_gemma":0.00060485635,"threshold_uncertainty_score":0.007743478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00501665,0.035485405,0.8529949,0.038579073,0.0009971117,0.00021633343,0.00031964097,0.00022131077,0.06616963],"genre_scores_gemma":[0.46317184,0.072235055,0.4409283,0.0073695574,0.006771592,0.0013852628,0.0005448061,0.0002499674,0.007343659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98363,0.008752996,0.001200806,0.002473061,0.003413304,0.0005298495],"domain_scores_gemma":[0.9581434,0.031356487,0.0028188196,0.0030738798,0.00376747,0.00083991926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022554427,0.0014455203,0.0013143872,0.0068788016,0.003308857,0.011339774,0.0035437308,0.005294921,0.0029090273],"category_scores_gemma":[0.031013379,0.0010941311,0.0012348343,0.008566014,0.021558419,0.018532451,0.0066236737,0.009613201,0.000577704],"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.0000059391873,0.000010856621,0.00028851916,0.000099489574,0.0000069012244,0.00002667207,0.00027112322,0.0017455011,0.000058455844,0.98544264,0.0013279635,0.010716063],"study_design_scores_gemma":[0.000005411456,0.000012843025,0.0003481642,0.00047371042,0.000007847102,0.00008334897,0.0002350864,0.0095327655,0.0001434922,0.94954705,0.039586745,0.00002357135],"about_ca_topic_score_codex":0.004266283,"about_ca_topic_score_gemma":0.0017278345,"teacher_disagreement_score":0.022554427,"about_ca_system_score_codex":0.0071249763,"about_ca_system_score_gemma":0.0048032748,"threshold_uncertainty_score":0.11928064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1645709,0.0013411149,0.81194085,0.0012428297,0.0002726973,0.0002055473,0.001008868,0.0023542899,0.017062923],"genre_scores_gemma":[0.66967124,0.0016918055,0.32066798,0.00028945232,0.0001100107,0.00037319458,0.0022412569,0.0004223718,0.0045326306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923885,0.00027278057,0.00006993795,0.00011176436,0.0002501927,0.000056594283],"domain_scores_gemma":[0.9959765,0.0024105192,0.0002942269,0.0007139054,0.00048017685,0.00012471451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014922894,0.0006476383,0.0005588833,0.0010759921,0.00031801895,0.0016814356,0.0013333065,0.0011219339,0.003640467],"category_scores_gemma":[0.011509614,0.00020568476,0.00069265685,0.0012793568,0.0005114429,0.0031741594,0.0010398672,0.0012025818,0.00054900727],"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.0003434094,0.0003041255,0.0023008664,0.00027497782,0.00009682151,0.00011657082,0.00033173375,0.66432863,0.003735982,0.116244085,0.003754874,0.20816791],"study_design_scores_gemma":[0.00004035018,0.00011503633,0.0002906632,0.000032799613,0.00001785985,0.00007163289,0.000074833515,0.96798575,0.0011569741,0.027177146,0.0030178726,0.000019144565],"about_ca_topic_score_codex":0.0020372393,"about_ca_topic_score_gemma":0.0020867635,"teacher_disagreement_score":0.003640467,"about_ca_system_score_codex":0.00092924596,"about_ca_system_score_gemma":0.00069679256,"threshold_uncertainty_score":0.0121786},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005177078,0.05065794,0.010087878,0.88749003,0.008449626,0.00010403978,0.00009055301,0.000065617,0.037877288],"genre_scores_gemma":[0.33326125,0.19614962,0.023120334,0.39837098,0.025785599,0.00042448464,0.00015627955,0.00031459547,0.022416787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.94074595,0.035260983,0.0023584971,0.0044651637,0.013763002,0.0034064213],"domain_scores_gemma":[0.846684,0.113897376,0.0041685593,0.0056170914,0.022485783,0.0071472824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.10817224,0.0012148463,0.0015295147,0.0024408058,0.0070154457,0.029306628,0.0024982782,0.013677412,0.00659231],"category_scores_gemma":[0.059935506,0.0007714409,0.0013719113,0.0028558674,0.021196472,0.029993482,0.014505352,0.024074916,0.0007215841],"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.00013955291,0.00013532524,0.0054816245,0.0015782344,0.000111562826,0.00049618573,0.009853031,0.0028730906,0.0027130407,0.5676616,0.12785086,0.2811059],"study_design_scores_gemma":[0.00001662464,0.0002084886,0.0059841205,0.0048534563,0.00006221676,0.0003087265,0.0101184,0.001119031,0.0008118934,0.14529246,0.8310333,0.00019129836],"about_ca_topic_score_codex":0.0075811287,"about_ca_topic_score_gemma":0.011697733,"teacher_disagreement_score":0.10817224,"about_ca_system_score_codex":0.010552301,"about_ca_system_score_gemma":0.019493913,"threshold_uncertainty_score":0.5720763},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010351905,0.029077329,0.0013452569,0.95648587,0.004752698,0.000016110784,0.00012973972,0.000014270165,0.007143601],"genre_scores_gemma":[0.16868289,0.18843642,0.006944815,0.56437916,0.05470739,0.00027802424,0.0004696147,0.00012362986,0.015978027],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9886135,0.005258696,0.00045091167,0.0022279986,0.0025539626,0.0008949175],"domain_scores_gemma":[0.9554307,0.031577915,0.0018639498,0.001107924,0.0070063365,0.0030132097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05306117,0.0007940733,0.00093546964,0.0018852988,0.005035177,0.017271478,0.0030055458,0.02310656,0.007388627],"category_scores_gemma":[0.036756705,0.00053717423,0.0011089816,0.0035131406,0.005840861,0.031241195,0.0051266225,0.022534268,0.0012933938],"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.00012943783,0.000078756064,0.003600237,0.0008424238,0.00009295516,0.00022660462,0.002593214,0.0020698826,0.0005234588,0.3602808,0.5109131,0.11864909],"study_design_scores_gemma":[0.00003983503,0.00006183896,0.0043847,0.0031694612,0.000095066425,0.00012533076,0.004011426,0.0018974367,0.00037425422,0.12232732,0.86339843,0.00011494079],"about_ca_topic_score_codex":0.008185858,"about_ca_topic_score_gemma":0.011414992,"teacher_disagreement_score":0.05306117,"about_ca_system_score_codex":0.006772878,"about_ca_system_score_gemma":0.009247841,"threshold_uncertainty_score":0.28061765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01051883,0.00006965473,0.9881241,0.00015398616,0.0000146739885,0.000026463229,0.00007520563,0.00029947117,0.00071762264],"genre_scores_gemma":[0.5112619,0.00022641811,0.48332933,0.0003261668,0.00008722754,0.00020994862,0.0010306515,0.0003260402,0.0032023527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977691,0.0008475861,0.000083101426,0.00067939964,0.0004770824,0.00014368365],"domain_scores_gemma":[0.99425757,0.002930504,0.00072774343,0.0012082733,0.0006939344,0.00018190619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028580274,0.001264914,0.0014121581,0.0013196284,0.00097379234,0.0014651757,0.00249322,0.0018555649,0.0012003261],"category_scores_gemma":[0.011598275,0.00071859895,0.0012067271,0.0016869692,0.0017600325,0.0020385184,0.002275851,0.0022564512,0.0007026932],"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.00014372144,0.00005072519,0.0011110525,0.00008064334,0.00008455477,0.00010425528,0.000107319094,0.8908954,0.0033479396,0.053604085,0.0027747243,0.04769555],"study_design_scores_gemma":[0.000005473753,0.000010038702,0.000105164625,0.00000423281,0.000004071524,0.000020410653,0.000009798043,0.98142093,0.00086400117,0.017205691,0.00034406292,0.000006229987],"about_ca_topic_score_codex":0.0039245887,"about_ca_topic_score_gemma":0.0043634097,"teacher_disagreement_score":0.0039245887,"about_ca_system_score_codex":0.0019392468,"about_ca_system_score_gemma":0.0016392026,"threshold_uncertainty_score":0.015114903},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029603078,0.18949936,0.07287043,0.70408636,0.005646361,0.00006150462,0.00014624122,0.00016956725,0.024559913],"genre_scores_gemma":[0.19012019,0.51257867,0.13140947,0.088131405,0.064909905,0.0005429187,0.00029265415,0.0004750719,0.0115397405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96353036,0.024496088,0.0013143014,0.0038675766,0.005867029,0.00092475826],"domain_scores_gemma":[0.74545616,0.21576127,0.005472692,0.014740583,0.014613472,0.0039557638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07750593,0.0014383037,0.0027546973,0.005871826,0.0028707245,0.015825683,0.0037807045,0.011305249,0.008847506],"category_scores_gemma":[0.08453677,0.0010333719,0.0013910892,0.011485428,0.032652132,0.060874745,0.008582795,0.018431691,0.0014714306],"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.00006788255,0.000087465945,0.00202187,0.0010496009,0.00004577788,0.000072211136,0.0012838339,0.0014616776,0.00020734791,0.8296707,0.029197453,0.13483429],"study_design_scores_gemma":[0.000021349668,0.00008356851,0.00085828913,0.001855606,0.000017055969,0.0001458455,0.0014923515,0.0045035365,0.00021875094,0.8431438,0.14760092,0.00005896069],"about_ca_topic_score_codex":0.002757667,"about_ca_topic_score_gemma":0.0027098248,"teacher_disagreement_score":0.07750593,"about_ca_system_score_codex":0.006321103,"about_ca_system_score_gemma":0.007451038,"threshold_uncertainty_score":0.40989542},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025150362,0.003170015,0.79990876,0.003825586,0.00074167823,0.0027589493,0.06459668,0.006304246,0.09354368],"genre_scores_gemma":[0.36691234,0.0037426727,0.5165505,0.00075580314,0.00053503516,0.003945431,0.059525024,0.0009071143,0.047126085],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945452,0.0023652837,0.00035250114,0.0011280365,0.0013876905,0.00022121011],"domain_scores_gemma":[0.98983264,0.005460122,0.0009658906,0.0017704946,0.0016292606,0.0003415425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041591856,0.0010513173,0.0010357907,0.010728349,0.0016855892,0.0040888153,0.0012294035,0.0008958226,0.031224215],"category_scores_gemma":[0.0267802,0.00041120866,0.0015327258,0.008822973,0.0008137771,0.0030936806,0.0020790405,0.0014103203,0.010139979],"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.00013410569,0.00019951035,0.026715862,0.0014461065,0.00087776897,0.00037455885,0.0021777917,0.026072482,0.0014164865,0.27793455,0.16772945,0.49492136],"study_design_scores_gemma":[0.000044820565,0.00010899123,0.020004805,0.0008272384,0.00024422322,0.0007540734,0.0028410514,0.17819993,0.0015011256,0.32993224,0.46543708,0.00010438899],"about_ca_topic_score_codex":0.006137691,"about_ca_topic_score_gemma":0.0064371354,"teacher_disagreement_score":0.031224215,"about_ca_system_score_codex":0.0018472985,"about_ca_system_score_gemma":0.0026207964,"threshold_uncertainty_score":0.10445541},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9442742,0.00030722277,0.04988815,0.00045118594,0.000022391157,0.000017382015,0.0000619722,0.000049820428,0.004927737],"genre_scores_gemma":[0.9981073,0.00013963818,0.0013075485,0.000016236476,0.00000914604,0.000007144073,0.000017306136,0.0000077378345,0.0003879153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998173,0.00006836991,0.000006417043,0.000042281095,0.000031231444,0.000034363602],"domain_scores_gemma":[0.99453664,0.004078316,0.00076919317,0.000193418,0.00017479512,0.0002477301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058228726,0.00023364965,0.00025188443,0.0006796207,0.00038574648,0.00074130594,0.00038390505,0.0005705707,0.00153201],"category_scores_gemma":[0.007403596,0.00015087581,0.0002642638,0.00029681472,0.0008771941,0.0015227,0.00041585695,0.00042672356,0.00009431968],"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.00026930042,0.000209826,0.05412464,0.0002800236,0.00021642054,0.0014474777,0.0009910165,0.55551887,0.06952071,0.2877629,0.0015991145,0.02805964],"study_design_scores_gemma":[0.000025110547,0.00009357519,0.021628518,0.000023744165,0.000084592815,0.0004031893,0.00021583412,0.87294585,0.0049245907,0.098857194,0.0007474028,0.00005038874],"about_ca_topic_score_codex":0.0018202029,"about_ca_topic_score_gemma":0.0014363546,"teacher_disagreement_score":0.0018202029,"about_ca_system_score_codex":0.00063147297,"about_ca_system_score_gemma":0.0002822159,"threshold_uncertainty_score":0.0051251054},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99770206,0.000108306536,0.00018046227,0.00011975528,0.0000031484435,0.0000072267626,0.000053067095,0.0000024375452,0.001823631],"genre_scores_gemma":[0.9995372,0.000081530445,0.00005491101,0.000010225882,0.0000051441525,0.0000045165007,0.000057934893,8.393594e-7,0.00024770648],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99890864,0.00025542005,0.000092805756,0.00017558763,0.0003499061,0.00021773185],"domain_scores_gemma":[0.9943439,0.0016520377,0.0016885047,0.00025518247,0.00086515106,0.0011951559],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0017587,0.00021059412,0.0003989352,0.0035826133,0.001675562,0.0014882053,0.0004980922,0.0004301778,0.0016189512],"category_scores_gemma":[0.006587965,0.00014928648,0.00037249367,0.0057476843,0.00068899465,0.0014106823,0.0012505364,0.00036372946,0.00015128091],"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.000025085492,0.00005323676,0.98793113,0.000024326704,0.00005155752,0.00019462466,0.003784184,0.00034407547,0.00012721882,0.001309347,0.00021105203,0.005944135],"study_design_scores_gemma":[0.000003857597,0.00003828273,0.9901777,0.000013537678,0.000045262135,0.00008860011,0.005173897,0.0028094787,0.000095376214,0.00053579564,0.0010103928,0.000007914234],"about_ca_topic_score_codex":0.024963124,"about_ca_topic_score_gemma":0.030947037,"teacher_disagreement_score":0.9982413,"about_ca_system_score_codex":0.0018373206,"about_ca_system_score_gemma":0.0023460109,"threshold_uncertainty_score":0.04963559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011605418,0.00022539588,0.9863803,0.0001435477,0.000049916995,0.000051383395,0.000030965362,0.00029404202,0.0012191668],"genre_scores_gemma":[0.5246339,0.0004683358,0.4696216,0.00023452817,0.00012059186,0.00034167152,0.00030347132,0.00013416822,0.004141716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953437,0.000093722905,0.000031903248,0.0001390377,0.00014436581,0.000056508754],"domain_scores_gemma":[0.9988397,0.0005135496,0.00018133987,0.0000861552,0.00029396077,0.00008532485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000781005,0.0009099325,0.00093041133,0.0012285355,0.0010523158,0.00095006987,0.0011941822,0.0008210983,0.0018902078],"category_scores_gemma":[0.0034776393,0.00032165725,0.0005506717,0.0008458078,0.0006817683,0.0020038616,0.0011888128,0.001189238,0.00032571238],"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.00012423935,0.00008253101,0.0018958227,0.00013887155,0.00007635973,0.000102007296,0.00015903005,0.755381,0.0059638238,0.019366536,0.0040939054,0.21261583],"study_design_scores_gemma":[0.000014602851,0.000032112137,0.00017853173,0.0000060934203,0.000012821753,0.00004313967,0.000020051308,0.9931143,0.00086770183,0.0049054786,0.0007965184,0.000008728155],"about_ca_topic_score_codex":0.0041115163,"about_ca_topic_score_gemma":0.003912755,"teacher_disagreement_score":0.0041115163,"about_ca_system_score_codex":0.0008376968,"about_ca_system_score_gemma":0.001521184,"threshold_uncertainty_score":0.008175194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3010226,0.0013864647,0.5789446,0.005656803,0.00028467205,0.00051272544,0.00019508117,0.000118429954,0.11187856],"genre_scores_gemma":[0.9609281,0.0005077891,0.031405803,0.00019245087,0.000044739405,0.00027489843,0.00005469138,0.000028449922,0.00656306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9902683,0.0069352477,0.00026446817,0.0012071243,0.0006389376,0.0006860142],"domain_scores_gemma":[0.97164774,0.022288347,0.002191431,0.0015034195,0.00095785834,0.0014112663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0082100425,0.0009208956,0.0008671266,0.0009213182,0.0016041603,0.0035779593,0.002082487,0.0020194943,0.008126853],"category_scores_gemma":[0.03508421,0.0004740104,0.0011437187,0.0012375896,0.004716558,0.009406349,0.0023978038,0.002456496,0.0006740935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014697082,0.0001757986,0.004084198,0.00018709952,0.000070174035,0.00018460874,0.0028678305,0.030238263,0.0004944154,0.9424632,0.0011621811,0.017925138],"study_design_scores_gemma":[0.0000624997,0.00033958515,0.0037537783,0.00010773345,0.00005922411,0.00029709586,0.002786172,0.2597531,0.000457369,0.72222686,0.01008442,0.00007210375],"about_ca_topic_score_codex":0.0062752375,"about_ca_topic_score_gemma":0.004013824,"teacher_disagreement_score":0.0082100425,"about_ca_system_score_codex":0.0035741364,"about_ca_system_score_gemma":0.002641663,"threshold_uncertainty_score":0.04341942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012658536,0.00033354678,0.98333055,0.00034831313,0.000044097786,0.000047125573,0.000088796856,0.00030464405,0.002844323],"genre_scores_gemma":[0.51802874,0.0010270368,0.45768547,0.0006392207,0.0002805617,0.00040305982,0.0007302209,0.00055851723,0.020647123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991462,0.00026530022,0.000035153662,0.0002625284,0.00021062465,0.00008018248],"domain_scores_gemma":[0.9960537,0.0023716965,0.00042348524,0.0004026829,0.00052812725,0.00022025383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024911915,0.0010123531,0.0012666174,0.0013796883,0.0007959677,0.0015869152,0.001928876,0.002264084,0.0047670915],"category_scores_gemma":[0.009439294,0.0006053016,0.0010190173,0.0011330259,0.0017782808,0.003887873,0.0021673867,0.0024073182,0.0007609585],"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.00013274046,0.00007315721,0.0012039933,0.00022781023,0.00008524776,0.00016211686,0.0002145292,0.7062263,0.0065725334,0.20786773,0.0066887364,0.07054509],"study_design_scores_gemma":[0.000007196012,0.000012042631,0.00009429955,0.000008086143,0.0000047970075,0.000024756082,0.000009207192,0.96692914,0.00061284367,0.03138438,0.00090651755,0.0000068388385],"about_ca_topic_score_codex":0.0027349659,"about_ca_topic_score_gemma":0.00328616,"teacher_disagreement_score":0.0047670915,"about_ca_system_score_codex":0.0019022053,"about_ca_system_score_gemma":0.0011352056,"threshold_uncertainty_score":0.01594752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068569995,0.0026114653,0.8869178,0.0035047696,0.0002918735,0.0005779487,0.013300822,0.0099306675,0.014294715],"genre_scores_gemma":[0.27800757,0.002220587,0.7020168,0.0005947926,0.00019747854,0.00034081406,0.011517834,0.0010197031,0.004084517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981828,0.00042295488,0.00013412866,0.0004406793,0.0007204482,0.00009902145],"domain_scores_gemma":[0.9935941,0.0033064822,0.0006677933,0.001050394,0.0011740084,0.00020715702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014458245,0.0010108236,0.00086559285,0.0066788765,0.0010393952,0.0048316494,0.0014951633,0.0010950565,0.0062114857],"category_scores_gemma":[0.014054447,0.00059709884,0.0011551984,0.004724686,0.00076818786,0.0052953428,0.0034636408,0.0014477314,0.0029855245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005603169,0.00026148028,0.021185748,0.0029326538,0.0003207455,0.0021127958,0.0064554233,0.02486158,0.033736352,0.07304506,0.07455707,0.7599707],"study_design_scores_gemma":[0.00007086292,0.00030183175,0.013712599,0.0007642832,0.00026344846,0.0027902618,0.011285735,0.35478112,0.041013654,0.3352258,0.23961721,0.00017314251],"about_ca_topic_score_codex":0.0022578924,"about_ca_topic_score_gemma":0.0038797173,"teacher_disagreement_score":0.0066788765,"about_ca_system_score_codex":0.00082448643,"about_ca_system_score_gemma":0.00075558526,"threshold_uncertainty_score":0.02077949},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97560424,0.00035683694,0.021212528,0.0003604613,0.000015497393,0.00005166108,0.0011559748,0.00008073985,0.0011621118],"genre_scores_gemma":[0.9961642,0.00009324269,0.0027803434,0.000020280746,0.000008648935,0.00002253383,0.000731286,0.0000068516065,0.0001726407],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989318,0.0005596254,0.000052498715,0.00025695172,0.00010962719,0.00008937737],"domain_scores_gemma":[0.9838986,0.011026756,0.0025660652,0.0013761299,0.0007366198,0.00039592214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031602702,0.00041844972,0.0005470223,0.002739218,0.0004727393,0.0013063331,0.00081101235,0.0012559198,0.0012625481],"category_scores_gemma":[0.019665333,0.00024362069,0.000750092,0.0025821,0.0009945371,0.0018754766,0.0012373951,0.00088074844,0.00021507569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035379,0.00016023687,0.59397906,0.00023193576,0.000409163,0.00031843453,0.0008502252,0.357763,0.0018231524,0.016347894,0.0017399348,0.026023107],"study_design_scores_gemma":[0.000015670577,0.000084190826,0.10363655,0.00006145256,0.00008626663,0.0001616682,0.00058953214,0.8802483,0.0009903142,0.012445577,0.001643301,0.00003719482],"about_ca_topic_score_codex":0.012084982,"about_ca_topic_score_gemma":0.008374468,"teacher_disagreement_score":0.012084982,"about_ca_system_score_codex":0.001084808,"about_ca_system_score_gemma":0.00035160364,"threshold_uncertainty_score":0.024029315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93802005,0.0008351276,0.05559958,0.0019026505,0.00008381392,0.0002009863,0.0013850157,0.00019742714,0.0017752522],"genre_scores_gemma":[0.9813736,0.00039593616,0.015411808,0.00015814647,0.00008288934,0.00015316773,0.0010287791,0.000037475453,0.0013581166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783844,0.0014702304,0.0000579694,0.00035997469,0.00008921613,0.00018427662],"domain_scores_gemma":[0.9742664,0.022327553,0.0015545088,0.0006137835,0.0007808745,0.00045688573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008390881,0.0011755286,0.0010159502,0.0025193912,0.0008761533,0.0017094543,0.0018477109,0.0016959145,0.0024922902],"category_scores_gemma":[0.021938901,0.00058070105,0.002142938,0.0015315681,0.00082084397,0.0016768841,0.0013434278,0.0020462284,0.00039469262],"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.00040949153,0.00062101707,0.3007718,0.00013980528,0.0008875555,0.0005632429,0.0005497,0.66094613,0.00037669914,0.0121599445,0.0031121057,0.019462617],"study_design_scores_gemma":[0.000017805984,0.000050157047,0.004654793,0.00001905934,0.00005696328,0.00004367734,0.000110500885,0.9927632,0.000041947165,0.0018783709,0.00035248807,0.00001096131],"about_ca_topic_score_codex":0.051983707,"about_ca_topic_score_gemma":0.032701906,"teacher_disagreement_score":0.051983707,"about_ca_system_score_codex":0.0017166596,"about_ca_system_score_gemma":0.001468396,"threshold_uncertainty_score":0.10336226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107593305,0.0006521994,0.87868434,0.0011957395,0.00015398682,0.000059110444,0.0001430891,0.00015135967,0.011366893],"genre_scores_gemma":[0.9695061,0.00044585066,0.020343259,0.00012581155,0.00005174101,0.000068075875,0.00006970899,0.000048853744,0.009340623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974257,0.0000874606,0.000009099446,0.0000569409,0.00006095482,0.00004302082],"domain_scores_gemma":[0.9983145,0.0011550906,0.00014686337,0.00006951182,0.00022955613,0.000084531246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008557306,0.0006058147,0.00087815203,0.00074520474,0.00071865274,0.0011598769,0.00094284455,0.0014049688,0.0038777734],"category_scores_gemma":[0.0053375773,0.00034436386,0.0006761279,0.00047032136,0.0012564115,0.0017494463,0.0011825749,0.0012218853,0.00025892857],"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.000050394334,0.000053129246,0.00056642503,0.00007217416,0.00003377693,0.00008686981,0.00012227905,0.8383313,0.0016980693,0.14944851,0.0013113705,0.00822572],"study_design_scores_gemma":[0.0000017344347,0.000005327248,0.00006141688,0.000002567595,0.0000020290536,0.0000063630214,0.000008198036,0.98861235,0.00006334621,0.011109437,0.00012397538,0.000003368763],"about_ca_topic_score_codex":0.007012377,"about_ca_topic_score_gemma":0.0052968254,"teacher_disagreement_score":0.007012377,"about_ca_system_score_codex":0.0009665162,"about_ca_system_score_gemma":0.0006826343,"threshold_uncertainty_score":0.013943076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81288666,0.0007611369,0.17313541,0.00093556725,0.00010470339,0.00014646896,0.0030575742,0.0028318693,0.0061407224],"genre_scores_gemma":[0.9216495,0.00020027823,0.07512569,0.00004694771,0.000035481986,0.00008703412,0.0012974341,0.00008663578,0.0014709365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991872,0.00032800157,0.000048209728,0.00018701269,0.00017536177,0.00007424463],"domain_scores_gemma":[0.9930878,0.00422299,0.0009298307,0.0004977276,0.0006565201,0.0006050962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010992142,0.00039327983,0.0003562876,0.003761831,0.00063602265,0.0012511796,0.00059717795,0.0005995696,0.0038959307],"category_scores_gemma":[0.0066165584,0.00019799663,0.0003362986,0.0032122615,0.00039434416,0.0026311572,0.0014987435,0.0005355809,0.00046375243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032472417,0.0009397312,0.14830291,0.0017837659,0.0007773865,0.0027823595,0.011238379,0.11471822,0.10128345,0.07082092,0.018818626,0.525287],"study_design_scores_gemma":[0.00013570071,0.00033323895,0.06829847,0.00013090421,0.00018496615,0.0012608177,0.0036777998,0.8189482,0.010715014,0.07993785,0.016261969,0.00011508559],"about_ca_topic_score_codex":0.0038728279,"about_ca_topic_score_gemma":0.0053885453,"teacher_disagreement_score":0.0038959307,"about_ca_system_score_codex":0.000528692,"about_ca_system_score_gemma":0.00048602695,"threshold_uncertainty_score":0.013033211},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14676942,0.024363974,0.22899464,0.0035080384,0.0022395526,0.00035686532,0.00185002,0.0012640652,0.5906533],"genre_scores_gemma":[0.74325186,0.01684903,0.12257312,0.00030480075,0.00041117507,0.00041963597,0.0006506714,0.00055040774,0.11498929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992617,0.00009762133,0.00003996609,0.00012252411,0.00039076005,0.00008737143],"domain_scores_gemma":[0.9994356,0.00010313546,0.00007948059,0.00011296222,0.00021154174,0.000057235433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006093546,0.00037693494,0.00037889677,0.0015944883,0.0012063214,0.002548098,0.00041014433,0.00078778865,0.024006113],"category_scores_gemma":[0.0014496924,0.00047126823,0.0004088347,0.0015343466,0.0012081336,0.0010481178,0.0011810091,0.0013019639,0.008098953],"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.00014944731,0.000068212044,0.002075969,0.00043048683,0.00004347825,0.0013473533,0.0013503506,0.0033214535,0.041511662,0.5679981,0.011023695,0.37067977],"study_design_scores_gemma":[0.0000373334,0.000108334505,0.0056884256,0.00021982919,0.00006627245,0.0017453998,0.0007195505,0.003399467,0.027180923,0.103207804,0.8575149,0.00011167037],"about_ca_topic_score_codex":0.0048626824,"about_ca_topic_score_gemma":0.0056114253,"teacher_disagreement_score":0.024006113,"about_ca_system_score_codex":0.0012567454,"about_ca_system_score_gemma":0.0020607715,"threshold_uncertainty_score":0.08030838},"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":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64740205,0.0021311846,0.3026416,0.00092601584,0.0009436974,0.024026928,0.0038059957,0.0005251262,0.01759746],"genre_scores_gemma":[0.8460212,0.0005452574,0.11216999,0.00033768173,0.0002444485,0.0359286,0.0015749652,0.00011396862,0.0030638864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.7865732,0.19505803,0.0045250272,0.004579258,0.008003321,0.0012612527],"domain_scores_gemma":[0.47124654,0.48307705,0.012737668,0.018030407,0.013451972,0.0014562745],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.10260947,0.00076551945,0.0010625897,0.0034702043,0.0013214212,0.0021002996,0.0018803136,0.0013864705,0.010445816],"category_scores_gemma":[0.38630953,0.0004789038,0.001500167,0.0027724681,0.0013471268,0.0038689794,0.0025417118,0.0011083616,0.0012618371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.020191936,0.0046989396,0.23874462,0.004291285,0.005367819,0.00044148957,0.025614062,0.014643426,0.0022795505,0.06973954,0.010336716,0.60365057],"study_design_scores_gemma":[0.006329471,0.050712645,0.31243086,0.0032467148,0.004414298,0.0020405222,0.04267238,0.42322704,0.008948972,0.097347766,0.048022125,0.00060722395],"about_ca_topic_score_codex":0.0034856,"about_ca_topic_score_gemma":0.0025935476,"teacher_disagreement_score":0.89739054,"about_ca_system_score_codex":0.0026701856,"about_ca_system_score_gemma":0.0016801896,"threshold_uncertainty_score":0.54265726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08097231,0.0028209088,0.8942216,0.0032564516,0.00033999715,0.00006581826,0.00041174726,0.00026762852,0.017643519],"genre_scores_gemma":[0.9354372,0.005605609,0.03401011,0.0008474459,0.0008196281,0.00014144708,0.00034072495,0.000291503,0.0225063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998938,0.00047279478,0.000039714654,0.00021624788,0.00022008104,0.00011311172],"domain_scores_gemma":[0.99171937,0.0061502126,0.00088695966,0.00044463488,0.00055826514,0.00024059886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032494226,0.0013452632,0.0019447607,0.0014610856,0.0007337959,0.0028330227,0.004021775,0.0028096188,0.0029333043],"category_scores_gemma":[0.013914328,0.0012221186,0.001289146,0.0018817649,0.002450601,0.0064781336,0.0020105124,0.0029616542,0.00072441215],"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.000027942157,0.000041321437,0.0008940689,0.000118858916,0.00004901467,0.00016385083,0.0001723399,0.6943256,0.0010628914,0.29712862,0.0017886657,0.0042268084],"study_design_scores_gemma":[0.0000041379326,0.000010944189,0.00017594315,0.000012464363,0.0000135206255,0.00003588112,0.000020853464,0.9466744,0.00008148057,0.05243046,0.00052739,0.0000124603575],"about_ca_topic_score_codex":0.004044989,"about_ca_topic_score_gemma":0.00454598,"teacher_disagreement_score":0.004044989,"about_ca_system_score_codex":0.0014619039,"about_ca_system_score_gemma":0.0010163515,"threshold_uncertainty_score":0.017184794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82153666,0.00094425486,0.1603473,0.00053197145,0.00004871325,0.00005652975,0.00033286604,0.0003020074,0.015899742],"genre_scores_gemma":[0.9765786,0.0003787028,0.019260928,0.000091899725,0.000037636375,0.000067609624,0.00023332138,0.00006232899,0.003288853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999481,0.00014319658,0.000021268368,0.00016465143,0.00010675661,0.0000830659],"domain_scores_gemma":[0.9946374,0.0030507531,0.0008850908,0.00046306103,0.0004610345,0.0005025797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000946681,0.00030580835,0.00042900376,0.002360432,0.0017082326,0.001306478,0.0007487797,0.0008929099,0.0029528614],"category_scores_gemma":[0.007213561,0.00047783382,0.0006123226,0.0008941666,0.0014700819,0.0022701384,0.00081520947,0.0007457354,0.0002533341],"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.00016690411,0.000058709888,0.00778631,0.0001136468,0.000062105464,0.001307819,0.001351148,0.030356549,0.0065357974,0.934581,0.00302841,0.014651637],"study_design_scores_gemma":[0.00003192777,0.00007136095,0.007047276,0.00007268172,0.000046254154,0.0025401325,0.00068134087,0.17283158,0.0018775841,0.8082132,0.0065309084,0.000055697095],"about_ca_topic_score_codex":0.0010644287,"about_ca_topic_score_gemma":0.0010755453,"teacher_disagreement_score":0.0029528614,"about_ca_system_score_codex":0.0006393023,"about_ca_system_score_gemma":0.00028969426,"threshold_uncertainty_score":0.009878337},"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":"incentives","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"incentives","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97440547,0.0007632314,0.0015891468,0.007214878,0.00008254132,0.000028168406,0.0000489043,0.000028656095,0.01583893],"genre_scores_gemma":[0.9985753,0.00013845714,0.0003731134,0.00026155295,0.00004520124,0.00000906826,0.0000122567935,0.000007054626,0.0005779133],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9905902,0.0060424423,0.00025182086,0.0010136147,0.0010514224,0.0010504773],"domain_scores_gemma":[0.87562495,0.07810485,0.022182643,0.005923099,0.005260354,0.012904059],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.011299165,0.00027601628,0.0003515095,0.0016504312,0.004822677,0.00889083,0.0012199921,0.0014440013,0.0040109735],"category_scores_gemma":[0.07901285,0.00024051694,0.00039154448,0.002036335,0.0038089007,0.0072436393,0.005265663,0.0010415005,0.00067841413],"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.0011507453,0.0009418732,0.7021474,0.0005156653,0.00052928855,0.0021933347,0.09663517,0.0049062166,0.0042615924,0.028977338,0.0074042142,0.15033709],"study_design_scores_gemma":[0.0003644038,0.0017715726,0.7110435,0.00082643767,0.00074371335,0.0015213799,0.14263652,0.010904443,0.0047044004,0.08549634,0.039756544,0.0002307043],"about_ca_topic_score_codex":0.0041337106,"about_ca_topic_score_gemma":0.0041655498,"teacher_disagreement_score":0.9887008,"about_ca_system_score_codex":0.0024343114,"about_ca_system_score_gemma":0.003281799,"threshold_uncertainty_score":0.0597564},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035467523,0.00013889169,0.99522674,0.00020471947,0.000030120624,0.000013618573,0.0000510839,0.00012087737,0.000667091],"genre_scores_gemma":[0.25733456,0.00060313905,0.7330409,0.00044763563,0.00020858781,0.00023596952,0.0008008145,0.0003647831,0.006963631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869895,0.0005959137,0.00004289831,0.00026260616,0.00031144414,0.000088226516],"domain_scores_gemma":[0.9969375,0.001937151,0.00033186146,0.00033455392,0.00032863984,0.00013036559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003186522,0.0012572567,0.0017040133,0.001387018,0.00055612804,0.0013186259,0.0024436542,0.0025728582,0.0020221428],"category_scores_gemma":[0.010644685,0.00073880545,0.0010292595,0.0012519063,0.0018030481,0.0022250863,0.0020546713,0.0026897832,0.0006841247],"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.00007019115,0.000058613627,0.0007114215,0.0001167832,0.00007601895,0.00008278516,0.000115689545,0.8268103,0.0022633953,0.11253076,0.003648964,0.05351514],"study_design_scores_gemma":[0.0000035715611,0.0000071178224,0.000058877085,0.000004872977,0.0000026581079,0.000010652669,0.0000047173926,0.981016,0.00022664065,0.018180707,0.0004779065,0.0000062309095],"about_ca_topic_score_codex":0.004682398,"about_ca_topic_score_gemma":0.005495927,"teacher_disagreement_score":0.004682398,"about_ca_system_score_codex":0.00095767895,"about_ca_system_score_gemma":0.0011660474,"threshold_uncertainty_score":0.01685214},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8970524,0.0008685479,0.054125443,0.0007773323,0.0007266605,0.0008887189,0.02544189,0.0004854902,0.019633532],"genre_scores_gemma":[0.9640394,0.00021652006,0.018309003,0.000095037925,0.000159219,0.0019309362,0.010205154,0.00013213043,0.004912618],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9872361,0.005463298,0.0010148135,0.0022326517,0.0031650867,0.00088810734],"domain_scores_gemma":[0.965533,0.018776152,0.005270977,0.0036857582,0.005902297,0.00083166885],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.008699472,0.00060910784,0.0010003505,0.009084908,0.0017699172,0.0019321598,0.0010898063,0.00083800417,0.009072138],"category_scores_gemma":[0.039640237,0.0002715911,0.0013083246,0.013321243,0.00071904936,0.001387711,0.0026296733,0.0015602673,0.001915611],"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.001121617,0.0004913974,0.8069762,0.00059754425,0.0014540135,0.0010142836,0.010068945,0.0071711103,0.00136352,0.017058136,0.026079727,0.12660347],"study_design_scores_gemma":[0.00005494909,0.00066790247,0.88411146,0.00021543373,0.00035006384,0.00056649075,0.016299875,0.02533078,0.0023633062,0.010787668,0.059052493,0.00019951763],"about_ca_topic_score_codex":0.008641228,"about_ca_topic_score_gemma":0.008377767,"teacher_disagreement_score":0.9909151,"about_ca_system_score_codex":0.0013101352,"about_ca_system_score_gemma":0.0019730963,"threshold_uncertainty_score":0.046007752},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7755418,0.0009791837,0.19715549,0.0047530006,0.000032383603,0.00009726793,0.00050424034,0.0001499007,0.020786814],"genre_scores_gemma":[0.9879969,0.00015028114,0.011365593,0.000050584462,0.000011275343,0.000031236756,0.000039285627,0.0000072694397,0.00034773088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991942,0.00047673812,0.000019320703,0.00017408331,0.000067618,0.000068014204],"domain_scores_gemma":[0.99846506,0.0007850943,0.00028468284,0.00014988762,0.00014792678,0.0001672645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014076594,0.0004176903,0.0003801347,0.0013120038,0.0009692596,0.00280414,0.0004609782,0.0003649173,0.0015428874],"category_scores_gemma":[0.0029824276,0.00025036692,0.0004978084,0.0006355131,0.0036840371,0.0022431656,0.0024471544,0.0006382871,0.000086081876],"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.00013865063,0.0001794413,0.23921686,0.00029648843,0.00063974474,0.0006524776,0.028492138,0.076610915,0.011623682,0.60094255,0.0014047934,0.039802242],"study_design_scores_gemma":[0.00002766917,0.00013995462,0.17382105,0.00008150396,0.00015378575,0.00022854493,0.009004612,0.25246495,0.0009955642,0.55426216,0.008731895,0.00008830077],"about_ca_topic_score_codex":0.045546327,"about_ca_topic_score_gemma":0.041405175,"teacher_disagreement_score":0.045546327,"about_ca_system_score_codex":0.003569269,"about_ca_system_score_gemma":0.0028834422,"threshold_uncertainty_score":0.0905624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99729556,0.0000514673,0.0006771665,0.0001641182,0.0000030257174,0.00021866625,0.00007989121,0.0000055189475,0.0015046559],"genre_scores_gemma":[0.99703157,0.00016641873,0.0013161624,0.0000850094,0.0000030352269,0.0002444921,0.00013084825,0.000004962753,0.0010174118],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99793196,0.0008802758,0.00011319593,0.00022131176,0.00040903574,0.00044422556],"domain_scores_gemma":[0.9967512,0.0019237291,0.00031811398,0.00025830735,0.00042779613,0.00032100055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025573228,0.0006015793,0.00050632504,0.002915944,0.005978275,0.0014741078,0.0015855295,0.0013750336,0.0024504403],"category_scores_gemma":[0.0042785173,0.00041408336,0.00073332194,0.003766247,0.002481187,0.0018465566,0.0017552461,0.001241969,0.00021452621],"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.00027959398,0.0021521437,0.23552258,0.0004985857,0.00008028773,0.014870427,0.6881786,0.0011743641,0.0038416418,0.007624953,0.0017100215,0.044066813],"study_design_scores_gemma":[0.00011010543,0.0010451216,0.23754697,0.00031985095,0.00019748244,0.002561033,0.7274834,0.012011255,0.0032485086,0.002241227,0.013050485,0.00018462699],"about_ca_topic_score_codex":0.090958126,"about_ca_topic_score_gemma":0.09031531,"teacher_disagreement_score":0.090958126,"about_ca_system_score_codex":0.008076418,"about_ca_system_score_gemma":0.0044981726,"threshold_uncertainty_score":0.18085736},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06973651,0.0015003916,0.89297736,0.003399777,0.0002574293,0.0022890985,0.0026720592,0.0005907318,0.026576638],"genre_scores_gemma":[0.28844357,0.0012460188,0.70373327,0.00024579596,0.00008911577,0.0027851998,0.0007553531,0.00008710263,0.0026145298],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9873799,0.009302305,0.00047936363,0.0009849847,0.0016491646,0.00020420426],"domain_scores_gemma":[0.957956,0.033012316,0.0027293696,0.0026003942,0.0032031583,0.00049884635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014795184,0.00089068746,0.000597525,0.014410299,0.0023420982,0.0038219374,0.0009542888,0.00086353254,0.0034330152],"category_scores_gemma":[0.035038043,0.00036063886,0.00082039286,0.01203196,0.0031739392,0.0037187783,0.002494908,0.0011594716,0.00055022154],"study_design_candidate":"observational","study_design_consensus":null,"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.0001377458,0.00026635145,0.062170934,0.0028334525,0.0006483302,0.0005282975,0.061822865,0.008273356,0.0045166896,0.3349231,0.010819233,0.5130596],"study_design_scores_gemma":[0.000110131696,0.00045012837,0.06467768,0.0023904329,0.0004501992,0.0011865401,0.12781295,0.14329213,0.005180751,0.41365498,0.24051684,0.00027723645],"about_ca_topic_score_codex":0.015659766,"about_ca_topic_score_gemma":0.023498967,"teacher_disagreement_score":0.9966577,"about_ca_system_score_codex":0.003342297,"about_ca_system_score_gemma":0.005445211,"threshold_uncertainty_score":0.07824534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015536997,0.000352675,0.97717893,0.00033486172,0.000089597364,0.0000572272,0.0006940087,0.0018992497,0.003856437],"genre_scores_gemma":[0.3623739,0.00072081666,0.6258054,0.00022532976,0.00018529393,0.0003730438,0.0052878517,0.0006235287,0.0044049546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980653,0.00048169817,0.0001269973,0.00031749735,0.0008388124,0.00016977367],"domain_scores_gemma":[0.9962398,0.0013888021,0.00043436012,0.00090099534,0.00085126713,0.0001848361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096892304,0.0007896034,0.0011182283,0.0030643751,0.00091720297,0.0033817755,0.002297763,0.00088625494,0.0053659603],"category_scores_gemma":[0.011972362,0.00046063116,0.00074737385,0.0055736657,0.0009927767,0.0056545488,0.0027512554,0.0019590063,0.001755596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038747358,0.00010517141,0.0033725325,0.0002854129,0.00007176001,0.00023909307,0.00055293815,0.3169352,0.0046871277,0.35143256,0.018993959,0.30293682],"study_design_scores_gemma":[0.000012066205,0.000028241819,0.0002165139,0.000020456753,0.000007660485,0.00009183649,0.00010415681,0.8949028,0.0026359817,0.09430679,0.0076604784,0.000013003166],"about_ca_topic_score_codex":0.0037645623,"about_ca_topic_score_gemma":0.0034893868,"teacher_disagreement_score":0.0053659603,"about_ca_system_score_codex":0.0012742693,"about_ca_system_score_gemma":0.0011287326,"threshold_uncertainty_score":0.017950952},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93682677,0.0008248404,0.050826028,0.0012072562,0.00018298617,0.00013126373,0.0011451085,0.00022617097,0.0086294515],"genre_scores_gemma":[0.99287766,0.00026045923,0.0041101426,0.000056504945,0.00003888542,0.000049264378,0.00027324332,0.000023088383,0.002310757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995858,0.00014426754,0.000017881583,0.00008941559,0.00005156832,0.00011105526],"domain_scores_gemma":[0.9945338,0.0042391163,0.00059487124,0.00013357232,0.00035446935,0.00014407614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010260576,0.00068729254,0.00047760224,0.00077924016,0.00042051412,0.0011037551,0.00082380755,0.0014884108,0.0025372223],"category_scores_gemma":[0.0054842397,0.00027862855,0.0009913817,0.0005109619,0.00043571612,0.001181794,0.00058979064,0.0008737906,0.00031653923],"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.00012559358,0.00022025486,0.019674877,0.00015338276,0.00007029577,0.00031899344,0.00019452797,0.9587481,0.0028303019,0.008098715,0.0024351804,0.007129687],"study_design_scores_gemma":[0.000005798864,0.000038170045,0.0017255642,0.0000063961606,0.000015636388,0.000026734013,0.0000508643,0.99693537,0.00040889622,0.00055821147,0.00021905868,0.00000923871],"about_ca_topic_score_codex":0.027824093,"about_ca_topic_score_gemma":0.009532169,"teacher_disagreement_score":0.027824093,"about_ca_system_score_codex":0.0013004763,"about_ca_system_score_gemma":0.00082128606,"threshold_uncertainty_score":0.055324316},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21623734,0.0051505156,0.71472895,0.0021369313,0.0006471083,0.00089208497,0.024213243,0.006561286,0.029432524],"genre_scores_gemma":[0.77071744,0.0014688595,0.1964347,0.0001340698,0.00048194212,0.00040197378,0.02081451,0.00023506928,0.009311462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973786,0.0005413202,0.00019949954,0.00069591653,0.00093180913,0.0002528866],"domain_scores_gemma":[0.9948206,0.0016383408,0.0006392925,0.000886853,0.0017018365,0.00031304502],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0024523234,0.00078242226,0.0012670375,0.016443163,0.001168473,0.003032051,0.0011483966,0.0015747208,0.0061000995],"category_scores_gemma":[0.012671427,0.0003271667,0.0020965151,0.012674606,0.0004654089,0.004000943,0.0022207936,0.0008672254,0.0031192165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011012884,0.0006654635,0.035037234,0.0007671284,0.0007617413,0.000330008,0.00048474278,0.07400252,0.01138419,0.038830362,0.030080078,0.8065552],"study_design_scores_gemma":[0.00004878756,0.00024285333,0.028276986,0.00011831901,0.00033764887,0.0002686504,0.0003597784,0.8721653,0.005710079,0.073790036,0.018603252,0.00007833793],"about_ca_topic_score_codex":0.008476365,"about_ca_topic_score_gemma":0.009039399,"teacher_disagreement_score":0.98355687,"about_ca_system_score_codex":0.0017438834,"about_ca_system_score_gemma":0.0019168969,"threshold_uncertainty_score":0.020406842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053211987,0.0005491522,0.93649936,0.0005823655,0.00012928963,0.000156027,0.0007024371,0.0057037296,0.0024655438],"genre_scores_gemma":[0.30436617,0.00040629157,0.6886351,0.00030299925,0.00013008523,0.00025687294,0.002013742,0.0006824942,0.0032063082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992397,0.000110899884,0.000044790686,0.00025103753,0.00023184363,0.00012175696],"domain_scores_gemma":[0.9970964,0.0014700047,0.0002607719,0.00067775196,0.0003178523,0.00017716455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011501384,0.0010966663,0.0011821318,0.0016488928,0.0008120152,0.0015596672,0.0028932241,0.0012214478,0.003907339],"category_scores_gemma":[0.00900408,0.0005149547,0.0007662442,0.0021970293,0.0007535898,0.0035189297,0.0018277246,0.0016921503,0.0012364438],"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.000641951,0.00024356278,0.005858849,0.00039974568,0.00015372495,0.00024972827,0.0003869247,0.5152089,0.01097521,0.050785374,0.025842885,0.38925314],"study_design_scores_gemma":[0.000023534103,0.00003133776,0.00024493554,0.000008209091,0.000008652174,0.00005206506,0.000037414786,0.98014563,0.0013308568,0.016592273,0.0015191173,0.0000059337776],"about_ca_topic_score_codex":0.010488982,"about_ca_topic_score_gemma":0.01342499,"teacher_disagreement_score":0.010488982,"about_ca_system_score_codex":0.0013312459,"about_ca_system_score_gemma":0.0022498544,"threshold_uncertainty_score":0.020855844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014371222,0.0010091644,0.9626449,0.003488349,0.00013034772,0.00012523014,0.000958968,0.00023241159,0.017039413],"genre_scores_gemma":[0.6856377,0.0060087442,0.24287161,0.002106147,0.0013403127,0.0016656846,0.0027827746,0.00025444952,0.057332575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786407,0.00074509066,0.00009747521,0.0004934419,0.00058743154,0.00021264874],"domain_scores_gemma":[0.9914826,0.005848511,0.0011852393,0.00041584886,0.0007206783,0.00034714112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033812115,0.0010918675,0.001284343,0.0032542278,0.0015628791,0.003450138,0.0040421723,0.0027810852,0.0076418705],"category_scores_gemma":[0.015131084,0.0007530567,0.001772762,0.0037073884,0.0024248403,0.008468242,0.0020500997,0.0028441846,0.0027347603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013328601,0.000035534904,0.0003996198,0.00009788381,0.00002965354,0.00014415746,0.0002232801,0.035968125,0.00029823038,0.9494004,0.0053057075,0.008083987],"study_design_scores_gemma":[0.000013729046,0.000018413963,0.00014644455,0.000026257017,0.00001958622,0.0001760307,0.00007181628,0.3794164,0.00009442124,0.61384743,0.006146877,0.000022555363],"about_ca_topic_score_codex":0.004559783,"about_ca_topic_score_gemma":0.0033251827,"teacher_disagreement_score":0.0076418705,"about_ca_system_score_codex":0.0029990803,"about_ca_system_score_gemma":0.0013290999,"threshold_uncertainty_score":0.02556467},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5628956,0.0008402894,0.17011419,0.03277254,0.00069530593,0.00038591967,0.000930553,0.0007325145,0.23063311],"genre_scores_gemma":[0.9560008,0.00015899412,0.015504847,0.0006408385,0.00006945918,0.000079092446,0.00017341404,0.00008663292,0.027285932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874866,0.00059793156,0.000038655704,0.0002410196,0.00019507085,0.00017861811],"domain_scores_gemma":[0.99415636,0.003208975,0.00029107233,0.00085882196,0.0005879461,0.0008967797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013622222,0.00031003833,0.0005502263,0.000482087,0.0015883431,0.0023473161,0.0010939268,0.0020916446,0.025893413],"category_scores_gemma":[0.0123645775,0.00029365014,0.00042097393,0.0005989082,0.0007996545,0.005182856,0.0013923773,0.0019807364,0.0049363803],"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.0016421484,0.0009619496,0.026048528,0.0004348912,0.00029577367,0.0008023287,0.003869113,0.023032714,0.010890319,0.58866495,0.071539536,0.2718177],"study_design_scores_gemma":[0.00024769004,0.00030022077,0.005931412,0.00010561982,0.00021938412,0.00058859773,0.0096039,0.17264952,0.008594557,0.7368856,0.06475527,0.00011808402],"about_ca_topic_score_codex":0.0017210576,"about_ca_topic_score_gemma":0.0042583803,"teacher_disagreement_score":0.025893413,"about_ca_system_score_codex":0.00056241604,"about_ca_system_score_gemma":0.0009694282,"threshold_uncertainty_score":0.08662212},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018856617,0.35148233,0.59570396,0.0052528814,0.0005358827,0.000258626,0.00068670354,0.00034901942,0.026873976],"genre_scores_gemma":[0.28335834,0.4821285,0.22026198,0.0017273118,0.0056016617,0.0005500749,0.0012347461,0.00023499987,0.004902456],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99576783,0.00135545,0.00026099823,0.0010083349,0.0014841516,0.00012314078],"domain_scores_gemma":[0.97599834,0.020780854,0.000662282,0.0012260716,0.0009944078,0.00033803564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006514504,0.0015089234,0.003158579,0.006960723,0.0011749482,0.005011585,0.0023081747,0.002733979,0.0029388433],"category_scores_gemma":[0.015461266,0.0010800518,0.0015715588,0.010924717,0.0040221172,0.009468475,0.0022035094,0.002938831,0.0010788837],"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.000082676845,0.00034316152,0.009422384,0.0050596474,0.00043690216,0.00025412353,0.00083089137,0.022258647,0.0011063617,0.37332407,0.010221976,0.57665926],"study_design_scores_gemma":[0.000031057647,0.00016405463,0.006414043,0.001211323,0.00016630963,0.00092728395,0.0007075783,0.11062979,0.0013200735,0.79727256,0.08103385,0.00012207443],"about_ca_topic_score_codex":0.0019014593,"about_ca_topic_score_gemma":0.0014590069,"teacher_disagreement_score":0.006960723,"about_ca_system_score_codex":0.0015541398,"about_ca_system_score_gemma":0.0016669275,"threshold_uncertainty_score":0.03445238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20539181,0.001218914,0.78449976,0.0014717191,0.00010899771,0.00030598525,0.0011115933,0.0017027705,0.0041885152],"genre_scores_gemma":[0.85608715,0.0002219824,0.13877872,0.00029944186,0.00010252295,0.00019282964,0.0015568179,0.00006507836,0.0026953404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921644,0.00027834653,0.000046042715,0.00021069794,0.00011947903,0.00012893188],"domain_scores_gemma":[0.9958717,0.0027807094,0.0005105127,0.00023344503,0.00038390077,0.00021974808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022872875,0.00094242423,0.0007851068,0.003061987,0.0006488301,0.0012195627,0.0020000983,0.0017588321,0.00231469],"category_scores_gemma":[0.0067232884,0.0005384935,0.00057422277,0.0014958619,0.0009177348,0.0016458014,0.0012917073,0.0017234776,0.00046435956],"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.00019634987,0.00031931928,0.017182162,0.00014568318,0.00015035397,0.00019267447,0.00015046643,0.76940435,0.0009709128,0.0113723595,0.0053018993,0.19461338],"study_design_scores_gemma":[0.0000037285047,0.000013205429,0.00026491834,0.000008484091,0.0000046144273,0.000007134598,0.000011814184,0.9954261,0.000115630326,0.003973474,0.00016880604,0.0000021923138],"about_ca_topic_score_codex":0.007087604,"about_ca_topic_score_gemma":0.011972459,"teacher_disagreement_score":0.007087604,"about_ca_system_score_codex":0.0015198925,"about_ca_system_score_gemma":0.0012059474,"threshold_uncertainty_score":0.014092743},"labels":[],"label_agreement":null},{"id":"W4206988418","doi":"10.1093/comnet/cnac003","title":"An empirical comparison of connectivity-based distances on a graph and their computational scalability","year":2021,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Jaccard index; Pairwise comparison; Vertex (graph theory); Computer science; Distance matrix; Scalability; Geodesic; Computation; Neighbourhood (mathematics); Cluster analysis; Inverse; Cluster (spacecraft); Distance; Mathematics; Shortest path problem; Theoretical computer science; Algorithm; Graph; Artificial intelligence","score_opus":0.031846712804735285,"score_gpt":0.34889928119773794,"score_spread":0.31705256839300267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206988418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9445552,0.0012929186,0.048757702,0.00053848105,0.000060187416,0.00007530865,0.0013123493,0.0004170952,0.002990596],"genre_scores_gemma":[0.9785513,0.00017094953,0.020264894,0.00001682744,0.000026764705,0.000037391957,0.0007189358,0.000030976767,0.00018201387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650204,0.0014904732,0.00025605527,0.0005813677,0.0010324992,0.00013761749],"domain_scores_gemma":[0.9244793,0.061544474,0.003889811,0.006335313,0.0028762924,0.00087472564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051914193,0.00053154945,0.00067213277,0.005702759,0.00056532095,0.0014799732,0.0011228925,0.0009161064,0.0011505246],"category_scores_gemma":[0.06716391,0.00021693546,0.00040930885,0.005474584,0.0012467721,0.003458539,0.0014171826,0.00072322704,0.00020922374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010524425,0.00039742634,0.23683286,0.0009485709,0.001131651,0.0003702907,0.0013987885,0.52688015,0.005111009,0.04216639,0.0064930646,0.17721735],"study_design_scores_gemma":[0.00006060527,0.0002793663,0.055127162,0.000068612775,0.0000805179,0.0005837044,0.00058720174,0.9079209,0.002604897,0.030904917,0.0017052804,0.00007689978],"about_ca_topic_score_codex":0.0036308256,"about_ca_topic_score_gemma":0.003303859,"teacher_disagreement_score":0.005702759,"about_ca_system_score_codex":0.001066067,"about_ca_system_score_gemma":0.00046172383,"threshold_uncertainty_score":0.027455151},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28396133,0.0015967846,0.6552032,0.0035832732,0.00014033323,0.00023068537,0.00032466764,0.0001785886,0.05478109],"genre_scores_gemma":[0.9617097,0.00044281562,0.036357675,0.00007210032,0.00004741921,0.00014600281,0.00009289385,0.000022164906,0.0011092214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737453,0.001956611,0.000055858276,0.00015908218,0.00030804434,0.00014578333],"domain_scores_gemma":[0.9798799,0.016359778,0.0015475815,0.0007989925,0.00092407013,0.0004896063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052718134,0.00077470153,0.0005529723,0.004546949,0.00086165813,0.0021455523,0.001005551,0.0010441575,0.0034644736],"category_scores_gemma":[0.022323225,0.00028659494,0.0006411074,0.0023423778,0.0023415056,0.0043704854,0.001985221,0.0010880588,0.0001575157],"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.000051260435,0.000079908496,0.0070619523,0.00011947724,0.000113264614,0.0001164565,0.0004675729,0.4086977,0.00069962116,0.5634032,0.00085506606,0.018334558],"study_design_scores_gemma":[0.000010721888,0.0000766097,0.0021534094,0.000047625876,0.000024119925,0.000046427947,0.00062579906,0.7096534,0.00023443908,0.28536338,0.0017489565,0.0000151073145],"about_ca_topic_score_codex":0.0030679666,"about_ca_topic_score_gemma":0.0019486888,"teacher_disagreement_score":0.0052718134,"about_ca_system_score_codex":0.002985563,"about_ca_system_score_gemma":0.0013077329,"threshold_uncertainty_score":0.027880311},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054153535,0.00041778322,0.9789317,0.0006370424,0.00007552976,0.00003943802,0.0001163182,0.00035677818,0.014010009],"genre_scores_gemma":[0.1663736,0.00227914,0.8144941,0.000504597,0.00027525373,0.0002388535,0.0006040349,0.00044203858,0.014788397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996989,0.000104078,0.000014985208,0.00005808828,0.00009699063,0.000026968384],"domain_scores_gemma":[0.99959713,0.0002890789,0.00002161947,0.000038614635,0.00004000579,0.0000135302025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040164948,0.0007566279,0.00048513894,0.0011863088,0.00055456714,0.0010277046,0.00076138094,0.00081958954,0.008611305],"category_scores_gemma":[0.0018831214,0.00038067467,0.0012775827,0.0007361879,0.001057642,0.0017009662,0.0013056651,0.0015345226,0.0015558219],"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.000011464763,0.000029177936,0.00035198982,0.00025245606,0.000037629958,0.00010265902,0.00017777126,0.14204028,0.0020562552,0.78004503,0.0067196246,0.0681756],"study_design_scores_gemma":[0.000011222577,0.000009323544,0.00007067108,0.00002812056,0.000007707363,0.000055219603,0.000032643446,0.14801031,0.00060621055,0.8382066,0.012952944,0.000008976041],"about_ca_topic_score_codex":0.0018763677,"about_ca_topic_score_gemma":0.0027713608,"teacher_disagreement_score":0.008611305,"about_ca_system_score_codex":0.0006746298,"about_ca_system_score_gemma":0.0007819709,"threshold_uncertainty_score":0.02880764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944992,0.00015038026,0.003968334,0.00030867418,0.00001602732,0.0000064994233,0.000076935896,0.000026086207,0.0009478555],"genre_scores_gemma":[0.9995035,0.00003618622,0.00019022472,0.000013506929,0.000004047695,0.000001858325,0.000020159496,0.0000018901492,0.00022847069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995308,0.0001829261,0.000023136587,0.00008600811,0.00004507816,0.00013213285],"domain_scores_gemma":[0.9838838,0.012692889,0.0017137966,0.0004562871,0.000615433,0.0006378221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018251305,0.0003235796,0.00046957683,0.00067065435,0.00041163617,0.0011695197,0.0004691612,0.0008438625,0.0019402122],"category_scores_gemma":[0.021433637,0.0002877805,0.00036649554,0.00033749032,0.0006372823,0.0022728126,0.0007429049,0.0007182755,0.00014564715],"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.0010840569,0.00045471906,0.15211928,0.00018661447,0.0004426714,0.0005847705,0.00025397653,0.79456973,0.013520331,0.017646484,0.0010765521,0.0180608],"study_design_scores_gemma":[0.000022405518,0.00019819463,0.030393528,0.000017796736,0.00015810362,0.00016334215,0.00018122727,0.96004695,0.0015908179,0.0070331497,0.00016673385,0.00002771619],"about_ca_topic_score_codex":0.0054273037,"about_ca_topic_score_gemma":0.004495786,"teacher_disagreement_score":0.0054273037,"about_ca_system_score_codex":0.0010257683,"about_ca_system_score_gemma":0.00058558653,"threshold_uncertainty_score":0.010791421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03512694,0.0017447858,0.9125284,0.0037797983,0.00017932155,0.00014187503,0.0005920239,0.00040087273,0.045506008],"genre_scores_gemma":[0.8513352,0.0028348137,0.10974563,0.0009989184,0.00070803665,0.0009087825,0.0008390332,0.00026749168,0.032361977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981401,0.0007894024,0.000075773445,0.00038863288,0.00042774293,0.00017827262],"domain_scores_gemma":[0.99370617,0.0038712854,0.0008396393,0.000662756,0.00048366358,0.0004364853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00201544,0.0012382475,0.0009768636,0.0022889192,0.0013389316,0.003146875,0.0021065732,0.002083152,0.009388641],"category_scores_gemma":[0.008994877,0.00055991317,0.0018156214,0.0015530798,0.0033229664,0.0070447805,0.002713616,0.0032249144,0.0011147844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003664768,0.0000069203556,0.00011763791,0.000019338004,0.000009269577,0.000039776525,0.000114969065,0.009575877,0.00012988053,0.9882112,0.00063331996,0.0011380316],"study_design_scores_gemma":[0.000006177562,0.0000072389753,0.00007185502,0.000012296475,0.0000058745463,0.00003095753,0.00003248002,0.10953387,0.000057489007,0.887392,0.0028421436,0.0000075799167],"about_ca_topic_score_codex":0.003941406,"about_ca_topic_score_gemma":0.003216666,"teacher_disagreement_score":0.009388641,"about_ca_system_score_codex":0.0036160063,"about_ca_system_score_gemma":0.0010386597,"threshold_uncertainty_score":0.03140819},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028383594,0.00058358605,0.95796335,0.0012639496,0.000053677144,0.00019380364,0.00048988365,0.00021831176,0.0108498875],"genre_scores_gemma":[0.5804807,0.0007561752,0.41390052,0.00017019542,0.000099777724,0.00043770217,0.0007766477,0.00009548599,0.0032827694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954358,0.0020582331,0.00023827347,0.001043617,0.00088072324,0.00034340384],"domain_scores_gemma":[0.98249143,0.011525782,0.0018170535,0.0017151195,0.0015426597,0.0009080573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005059756,0.0008126527,0.0010011385,0.007914653,0.003036146,0.0060129194,0.0025431195,0.0017121995,0.0046077855],"category_scores_gemma":[0.032323528,0.00063441956,0.0012763311,0.008983259,0.0029999116,0.01022378,0.004385627,0.0018589125,0.00059408066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063152715,0.000081683465,0.0034736549,0.00017138619,0.00010371314,0.00019064962,0.0008043729,0.27723363,0.00041020784,0.6440261,0.0025701479,0.070871346],"study_design_scores_gemma":[0.0000119562765,0.000018518933,0.00081657915,0.00007509372,0.000032339074,0.00006202329,0.0005547984,0.40054232,0.00047926675,0.5898595,0.0075172256,0.000030362517],"about_ca_topic_score_codex":0.013157504,"about_ca_topic_score_gemma":0.013576045,"teacher_disagreement_score":0.013157504,"about_ca_system_score_codex":0.0052270386,"about_ca_system_score_gemma":0.0043857144,"threshold_uncertainty_score":0.037925065},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12768194,0.0011785993,0.8574016,0.0006756106,0.00011098732,0.000065487206,0.000108834814,0.00015184496,0.012625168],"genre_scores_gemma":[0.97712916,0.00057933654,0.01756483,0.00006422276,0.00004446842,0.00008827691,0.000024376885,0.000015857167,0.0044893096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995666,0.000112798305,0.000017813343,0.00012964879,0.00009413316,0.00007903225],"domain_scores_gemma":[0.9991449,0.00039930947,0.00021046394,0.000055282617,0.00010699322,0.00008308652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073486875,0.00059965585,0.0006125847,0.00058655295,0.0005878519,0.0011314647,0.00089260575,0.0008398884,0.0014516445],"category_scores_gemma":[0.0023335721,0.00027332947,0.00058578636,0.000583801,0.001169836,0.0015088724,0.0010941259,0.0007451082,0.00011162201],"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.00010372611,0.00004856999,0.0011875739,0.00015159613,0.00007252225,0.00030344957,0.00019126666,0.56422037,0.014226981,0.39627162,0.0013122769,0.021910127],"study_design_scores_gemma":[0.0000058545234,0.000015852835,0.00018693668,0.000004471472,0.000009733138,0.000029831526,0.000014067314,0.9794414,0.000443629,0.019386854,0.00045256046,0.000008732253],"about_ca_topic_score_codex":0.0043073115,"about_ca_topic_score_gemma":0.0020217607,"teacher_disagreement_score":0.0043073115,"about_ca_system_score_codex":0.0014104028,"about_ca_system_score_gemma":0.00061449327,"threshold_uncertainty_score":0.010233283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6869648,0.00030893635,0.3100137,0.00057900907,0.00008193485,0.00013171916,0.0002347121,0.0007168747,0.0009682476],"genre_scores_gemma":[0.95244384,0.000070508766,0.04660599,0.00005835573,0.000027681921,0.000054848115,0.0003442012,0.000040689207,0.00035394897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774593,0.0012324257,0.00006861076,0.0004324188,0.00033950977,0.00018106928],"domain_scores_gemma":[0.9576246,0.036797784,0.0010362248,0.0018891698,0.0019191543,0.0007331243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073058098,0.0007767862,0.0009406786,0.0015794564,0.00071706594,0.0010222971,0.0016794236,0.0018764694,0.0008484009],"category_scores_gemma":[0.037735503,0.00042154736,0.0007774704,0.00083792914,0.0009902333,0.0025370002,0.0014442696,0.0010821327,0.00020867905],"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.001766481,0.0005662602,0.035271145,0.0002241921,0.0003133751,0.00023381604,0.0002506708,0.85768175,0.0089882035,0.010650583,0.0018837476,0.0821698],"study_design_scores_gemma":[0.000019741616,0.00006816689,0.0010929041,0.000004478181,0.000015187187,0.00003291118,0.000016690494,0.9959552,0.0009637187,0.0017746693,0.000048454745,0.000007877823],"about_ca_topic_score_codex":0.006339129,"about_ca_topic_score_gemma":0.0056503117,"teacher_disagreement_score":0.0073058098,"about_ca_system_score_codex":0.000939144,"about_ca_system_score_gemma":0.0010911978,"threshold_uncertainty_score":0.03863728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032338444,0.00081491814,0.9500644,0.0010477877,0.00011828183,0.00004124599,0.00010830514,0.00020380941,0.015262735],"genre_scores_gemma":[0.859784,0.0020219428,0.1169379,0.00061884394,0.0004917113,0.00023170812,0.00025713042,0.00016538601,0.01949139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967027,0.00016468149,0.00000847422,0.000047252877,0.00007101674,0.000038302762],"domain_scores_gemma":[0.9989104,0.00062278647,0.00014999224,0.000119883625,0.00011114472,0.00008580027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085213943,0.00066776585,0.00064905925,0.00092790165,0.00044581003,0.0009283756,0.0013838026,0.0015187646,0.0025744434],"category_scores_gemma":[0.0024629333,0.00029426054,0.00081363827,0.0006429894,0.0015651956,0.0024010306,0.0011272298,0.0014002129,0.00041755135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017687353,0.00002623129,0.00038465887,0.000050631184,0.000021726,0.00012944177,0.00008604141,0.31485733,0.0011920119,0.6775629,0.0013482135,0.004323093],"study_design_scores_gemma":[0.0000031403329,0.000012550184,0.000099732264,0.0000050273106,0.0000027283008,0.000031864616,0.000015508143,0.8213963,0.000074806725,0.17742166,0.0009298185,0.0000067738174],"about_ca_topic_score_codex":0.002171624,"about_ca_topic_score_gemma":0.0017152131,"teacher_disagreement_score":0.0025744434,"about_ca_system_score_codex":0.0008832318,"about_ca_system_score_gemma":0.00037131144,"threshold_uncertainty_score":0.008612394},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03512694,0.0017447858,0.9125284,0.0037797983,0.00017932155,0.00014187503,0.0005920239,0.00040087273,0.045506008],"genre_scores_gemma":[0.8513352,0.0028348137,0.10974563,0.0009989184,0.00070803665,0.0009087825,0.0008390332,0.00026749168,0.032361977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981401,0.0007894024,0.000075773445,0.00038863288,0.00042774293,0.00017827262],"domain_scores_gemma":[0.99370617,0.0038712854,0.0008396393,0.000662756,0.00048366358,0.0004364853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00201544,0.0012382475,0.0009768636,0.0022889192,0.0013389316,0.003146875,0.0021065732,0.002083152,0.009388641],"category_scores_gemma":[0.008994877,0.00055991317,0.0018156214,0.0015530798,0.0033229664,0.0070447805,0.002713616,0.0032249144,0.0011147844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003664768,0.0000069203556,0.00011763791,0.000019338004,0.000009269577,0.000039776525,0.000114969065,0.009575877,0.00012988053,0.9882112,0.00063331996,0.0011380316],"study_design_scores_gemma":[0.000006177562,0.0000072389753,0.00007185502,0.000012296475,0.0000058745463,0.00003095753,0.00003248002,0.10953387,0.000057489007,0.887392,0.0028421436,0.0000075799167],"about_ca_topic_score_codex":0.003941406,"about_ca_topic_score_gemma":0.003216666,"teacher_disagreement_score":0.009388641,"about_ca_system_score_codex":0.0036160063,"about_ca_system_score_gemma":0.0010386597,"threshold_uncertainty_score":0.03140819},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068036737,0.00009259024,0.9914301,0.00012890692,0.00006966366,0.000026949021,0.00010353647,0.0002964999,0.0010481313],"genre_scores_gemma":[0.5473378,0.00033091675,0.44028682,0.00019797667,0.0002366643,0.00026441397,0.0010974999,0.00034610953,0.009901893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914217,0.00025428578,0.000049717626,0.00019315213,0.0003071478,0.000053568216],"domain_scores_gemma":[0.99800247,0.0007870946,0.00018435983,0.0003377894,0.000581474,0.000106683714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014670038,0.000780185,0.00093322404,0.0012603194,0.00045775383,0.0016907976,0.0017133362,0.0014821888,0.0047602328],"category_scores_gemma":[0.007279795,0.0003416276,0.0005518584,0.0012716334,0.0006112882,0.0028169253,0.0020075545,0.0017598213,0.0011505493],"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.0003034178,0.00013692347,0.00094880845,0.00016025004,0.00007145199,0.000101563724,0.0000772248,0.50223213,0.007507264,0.09963793,0.007941363,0.38088167],"study_design_scores_gemma":[0.000003978081,0.000016924758,0.000056079796,0.0000049714963,0.0000052396813,0.000012341085,0.0000043416367,0.9876039,0.0007052252,0.011131335,0.00045110247,0.000004525675],"about_ca_topic_score_codex":0.002450601,"about_ca_topic_score_gemma":0.00350961,"teacher_disagreement_score":0.0047602328,"about_ca_system_score_codex":0.00091188925,"about_ca_system_score_gemma":0.0010002733,"threshold_uncertainty_score":0.015924573},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015352652,0.010593061,0.6271453,0.006435813,0.0013048148,0.00017911731,0.001984886,0.00051207363,0.33649224],"genre_scores_gemma":[0.38586187,0.02809722,0.27877787,0.0013560145,0.0026509184,0.0009027368,0.0035993692,0.00036239618,0.2983915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994795,0.00017015146,0.000024641435,0.00012327335,0.00017662894,0.000025911506],"domain_scores_gemma":[0.9992053,0.00042291277,0.000065654574,0.00013790306,0.00012416727,0.000044131393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047676553,0.0006920268,0.00037557122,0.0020463783,0.0007920593,0.0029286735,0.00046791643,0.0006558635,0.012656974],"category_scores_gemma":[0.0026672715,0.00030891126,0.0003593072,0.0025393288,0.0008344392,0.0040335446,0.0019567367,0.0010565107,0.002282989],"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.00000667277,0.000012519226,0.00037245188,0.00014238697,0.000022298,0.000048629467,0.0003242971,0.0051539256,0.0005612684,0.8633384,0.026956297,0.103060804],"study_design_scores_gemma":[0.0000024953622,0.000007863146,0.0007005779,0.00009264639,0.000012398125,0.00021602298,0.00030371716,0.02423897,0.00035911635,0.77999806,0.1940519,0.000016131757],"about_ca_topic_score_codex":0.0006267026,"about_ca_topic_score_gemma":0.0009398508,"teacher_disagreement_score":0.012656974,"about_ca_system_score_codex":0.00075974077,"about_ca_system_score_gemma":0.0003262933,"threshold_uncertainty_score":0.04234183},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6000082,0.0072240597,0.33744824,0.0019682036,0.0014833662,0.00072868104,0.012791905,0.016383676,0.021963645],"genre_scores_gemma":[0.8207686,0.0010417772,0.15081266,0.00013415932,0.00045908196,0.00013684778,0.01282669,0.00086731603,0.012952819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745756,0.00044306563,0.00019136566,0.0003646935,0.0012736905,0.00026968255],"domain_scores_gemma":[0.99583685,0.0011879568,0.00031795615,0.000612592,0.0018503641,0.00019430951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013888691,0.0020525292,0.0015836684,0.012335292,0.0009546298,0.002490694,0.00107956,0.0009599027,0.0041823275],"category_scores_gemma":[0.008102589,0.0003383268,0.0009600747,0.0048539727,0.00028294008,0.0024573035,0.0007894566,0.0006551928,0.005868565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020390186,0.00065968063,0.053050674,0.0012597817,0.0009869462,0.0009287665,0.0005734917,0.044845983,0.07786214,0.0036555026,0.067039475,0.74709857],"study_design_scores_gemma":[0.000072365285,0.00055149326,0.031847913,0.00007336243,0.00036432085,0.0010589407,0.00084530044,0.8810969,0.056717224,0.0065088687,0.020734956,0.00012838012],"about_ca_topic_score_codex":0.009356271,"about_ca_topic_score_gemma":0.023761421,"teacher_disagreement_score":0.012335292,"about_ca_system_score_codex":0.00072223286,"about_ca_system_score_gemma":0.00087014685,"threshold_uncertainty_score":0.018603623},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6000082,0.0072240597,0.33744824,0.0019682036,0.0014833662,0.00072868104,0.012791905,0.016383676,0.021963645],"genre_scores_gemma":[0.8207686,0.0010417772,0.15081266,0.00013415932,0.00045908196,0.00013684778,0.01282669,0.00086731603,0.012952819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745756,0.00044306563,0.00019136566,0.0003646935,0.0012736905,0.00026968255],"domain_scores_gemma":[0.99583685,0.0011879568,0.00031795615,0.000612592,0.0018503641,0.00019430951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013888691,0.0020525292,0.0015836684,0.012335292,0.0009546298,0.002490694,0.00107956,0.0009599027,0.0041823275],"category_scores_gemma":[0.008102589,0.0003383268,0.0009600747,0.0048539727,0.00028294008,0.0024573035,0.0007894566,0.0006551928,0.005868565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020390186,0.00065968063,0.053050674,0.0012597817,0.0009869462,0.0009287665,0.0005734917,0.044845983,0.07786214,0.0036555026,0.067039475,0.74709857],"study_design_scores_gemma":[0.000072365285,0.00055149326,0.031847913,0.00007336243,0.00036432085,0.0010589407,0.00084530044,0.8810969,0.056717224,0.0065088687,0.020734956,0.00012838012],"about_ca_topic_score_codex":0.009356271,"about_ca_topic_score_gemma":0.023761421,"teacher_disagreement_score":0.012335292,"about_ca_system_score_codex":0.00072223286,"about_ca_system_score_gemma":0.00087014685,"threshold_uncertainty_score":0.018603623},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06535112,0.00645669,0.8911329,0.008644567,0.00094830187,0.00021659161,0.00277734,0.0020552247,0.022417372],"genre_scores_gemma":[0.60408604,0.005189649,0.33581582,0.0018548849,0.0031756377,0.0004391272,0.0069317212,0.0012128114,0.04129436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983215,0.0005389431,0.00006337298,0.0005030247,0.0004345228,0.00013864205],"domain_scores_gemma":[0.9880262,0.0082703605,0.000550386,0.001604025,0.0008435425,0.0007054639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023564524,0.00090718357,0.0016971938,0.0034450348,0.0013747888,0.0029298225,0.0017398786,0.0018069372,0.008038589],"category_scores_gemma":[0.019730661,0.0007849588,0.0012188798,0.0050774757,0.001421359,0.008668558,0.0031490957,0.0031769623,0.0014186112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004920357,0.00022246396,0.002484794,0.0009638497,0.00029324903,0.00020135507,0.0004885645,0.15594298,0.004145476,0.48891512,0.10746172,0.23838834],"study_design_scores_gemma":[0.000046135567,0.00003072943,0.0004915157,0.000040160685,0.0000307967,0.000064170046,0.00008787089,0.4466218,0.0008106881,0.54290384,0.008854225,0.000017963266],"about_ca_topic_score_codex":0.003662,"about_ca_topic_score_gemma":0.005049164,"teacher_disagreement_score":0.008038589,"about_ca_system_score_codex":0.0015512331,"about_ca_system_score_gemma":0.00087599515,"threshold_uncertainty_score":0.026891708},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004245755,0.0019920282,0.98098963,0.0041948115,0.0002667023,0.000016288255,0.00009025102,0.00008891606,0.00811565],"genre_scores_gemma":[0.4302989,0.016533127,0.5418598,0.0014059604,0.0023484142,0.0002485649,0.0003162639,0.00025965992,0.0067293807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978022,0.0013696508,0.00007220602,0.00034684417,0.0003409862,0.00006812775],"domain_scores_gemma":[0.98910135,0.008199624,0.00052409945,0.0015418478,0.00040010185,0.00023299929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038250543,0.0011796711,0.0010871461,0.0012370929,0.0013169603,0.004867297,0.0014637295,0.001994669,0.00338902],"category_scores_gemma":[0.015581518,0.00061042357,0.0012005898,0.0020381962,0.008217862,0.012537829,0.0031671547,0.0050426023,0.0008067695],"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.000008550687,0.000009315799,0.00024188925,0.000095501084,0.000020059604,0.000026472595,0.00023407264,0.015906295,0.00025129027,0.9707435,0.00063664815,0.011826329],"study_design_scores_gemma":[0.0000024861072,0.0000145158965,0.00013125126,0.00004354481,0.000011581176,0.000040637027,0.00006919747,0.04591747,0.00016195857,0.94391984,0.009672417,0.000015203132],"about_ca_topic_score_codex":0.0027520969,"about_ca_topic_score_gemma":0.0018253236,"teacher_disagreement_score":0.004867297,"about_ca_system_score_codex":0.0014504029,"about_ca_system_score_gemma":0.0012413557,"threshold_uncertainty_score":0.020229042},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035060234,0.0002333045,0.96230423,0.00022474836,0.000096612195,0.00013261319,0.00006723002,0.0005915946,0.0012894785],"genre_scores_gemma":[0.48874164,0.00019729105,0.50044864,0.00021838026,0.00013053106,0.00028124268,0.00065101736,0.0003364311,0.008994884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962309,0.001280745,0.00020355343,0.00067812717,0.0012498697,0.00035683537],"domain_scores_gemma":[0.9864824,0.0062824492,0.00079507544,0.0027343926,0.0030714707,0.0006343527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00399426,0.0011254948,0.0026025625,0.002213895,0.002244971,0.0015249976,0.004175204,0.0023492677,0.002351061],"category_scores_gemma":[0.01706511,0.0010970535,0.001209304,0.002248596,0.0013421413,0.0022963514,0.0040340964,0.0018681233,0.0012020017],"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.0009862732,0.00046785685,0.0026855473,0.00040036716,0.00030856946,0.00031018484,0.00065010303,0.5197669,0.017456416,0.024351964,0.008130913,0.42448494],"study_design_scores_gemma":[0.000034777193,0.00006874645,0.00031120027,0.0000098167875,0.00003153294,0.000065351735,0.00007985793,0.98370945,0.0035148906,0.011139521,0.0010220152,0.000012867133],"about_ca_topic_score_codex":0.0040324144,"about_ca_topic_score_gemma":0.0073707676,"teacher_disagreement_score":0.004175204,"about_ca_system_score_codex":0.0009721057,"about_ca_system_score_gemma":0.0023327498,"threshold_uncertainty_score":0.021123886},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084511936,0.0010492784,0.89764833,0.0009130205,0.0001137452,0.00006091495,0.00037319932,0.00026954818,0.015060026],"genre_scores_gemma":[0.93956286,0.0014396306,0.051456362,0.00024385744,0.00046529094,0.0003212956,0.0004471769,0.00013960725,0.0059239194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981566,0.0005121267,0.000120380435,0.0004989628,0.0004106249,0.00030119217],"domain_scores_gemma":[0.9825435,0.011907839,0.0020148796,0.001394546,0.00131512,0.0008241061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036246236,0.0008130005,0.0007027039,0.0026726488,0.0013360674,0.0019813813,0.0014264584,0.0012929258,0.0044565215],"category_scores_gemma":[0.020051084,0.00043157517,0.0016454746,0.001428026,0.003958232,0.0054413313,0.0023697533,0.002660195,0.00047057137],"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.000026809177,0.000022796092,0.00097116927,0.00006713819,0.000032359883,0.00012353751,0.0003175259,0.03389094,0.0009517972,0.9565096,0.00077712844,0.006309204],"study_design_scores_gemma":[0.000012416498,0.000029933595,0.0004271362,0.00003518929,0.000023165901,0.00010170246,0.000095328374,0.23298806,0.0011637843,0.76305133,0.0020436323,0.000028242213],"about_ca_topic_score_codex":0.002048582,"about_ca_topic_score_gemma":0.001625179,"teacher_disagreement_score":0.0044565215,"about_ca_system_score_codex":0.0019826933,"about_ca_system_score_gemma":0.001147078,"threshold_uncertainty_score":0.019169033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95283526,0.00073337543,0.041901063,0.0009645097,0.000030778476,0.000021077274,0.00013111782,0.00010621071,0.0032764908],"genre_scores_gemma":[0.99754035,0.00020309065,0.0013544536,0.000035442565,0.000035119658,0.000016708529,0.00004488708,0.000012735482,0.00075742876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991385,0.000336752,0.00003627173,0.00027136816,0.00012410605,0.000092938375],"domain_scores_gemma":[0.95887667,0.03084467,0.004685691,0.0021940144,0.0012636456,0.0021352416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032740873,0.00021901626,0.0011064084,0.0019664632,0.0013809036,0.003518744,0.0009751804,0.0011809523,0.0033255273],"category_scores_gemma":[0.044515688,0.00042494695,0.00039243366,0.0012779027,0.003961574,0.0044172606,0.0015993378,0.0013410049,0.0003049434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009388562,0.0003671066,0.09791771,0.00063748955,0.00050344854,0.00058632204,0.007997572,0.12451679,0.0108071435,0.65510184,0.007195955,0.093429774],"study_design_scores_gemma":[0.000064359345,0.00018453854,0.05008369,0.00006388816,0.00010526006,0.00033267977,0.0014783505,0.3884281,0.0011812962,0.55585355,0.0021399222,0.000084384104],"about_ca_topic_score_codex":0.0020741778,"about_ca_topic_score_gemma":0.0021344451,"teacher_disagreement_score":0.003518744,"about_ca_system_score_codex":0.0014289892,"about_ca_system_score_gemma":0.00047893755,"threshold_uncertainty_score":0.017315209},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001950303,0.0025857852,0.0030110693,0.982852,0.0028367313,0.000007519185,0.00003613427,0.000029522695,0.006691003],"genre_scores_gemma":[0.3030468,0.013029071,0.006342881,0.6165281,0.04953565,0.00019518506,0.00009884162,0.00015706685,0.011066401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928693,0.003305591,0.00031033333,0.001170816,0.001718982,0.0006250253],"domain_scores_gemma":[0.9061301,0.07826057,0.0034198926,0.004689294,0.0042558047,0.0032442643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015508831,0.0004826728,0.0007153841,0.0017850694,0.0048118164,0.0064755017,0.0018146624,0.015955761,0.0065765437],"category_scores_gemma":[0.07959045,0.0004230036,0.0005148869,0.0014145129,0.022376467,0.021361616,0.004712497,0.022702064,0.003098583],"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.00013450977,0.00003541031,0.0022948727,0.00021688154,0.000046893994,0.0010466708,0.0026905239,0.00060117,0.00024203469,0.47063762,0.43947116,0.08258222],"study_design_scores_gemma":[0.000034677352,0.00002253855,0.0010862893,0.00026124553,0.00001092079,0.00068045186,0.0017526002,0.0013665955,0.00020064668,0.8002165,0.19432847,0.000039101695],"about_ca_topic_score_codex":0.0023076225,"about_ca_topic_score_gemma":0.0029098974,"teacher_disagreement_score":0.015955761,"about_ca_system_score_codex":0.0050216666,"about_ca_system_score_gemma":0.0024327948,"threshold_uncertainty_score":0.08201951},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8292614,0.0010978967,0.1415928,0.0027072816,0.00007913575,0.00009546632,0.00057035097,0.00022200204,0.0243736],"genre_scores_gemma":[0.9844281,0.00062127394,0.0035959424,0.00010125406,0.00007313429,0.000035943394,0.00010549974,0.00003631482,0.011002567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920017,0.0003423719,0.000022163687,0.0002263537,0.000086853404,0.00012207676],"domain_scores_gemma":[0.9889346,0.007970759,0.0017434285,0.00047334906,0.000536421,0.0003414608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015230182,0.00066933135,0.0013615187,0.0019526911,0.0006631132,0.0028075606,0.0010423096,0.0013369235,0.008700545],"category_scores_gemma":[0.012524606,0.0007795952,0.00085731235,0.0014851798,0.0017210101,0.005462667,0.0011869435,0.0011642771,0.00075231044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061858044,0.00033086076,0.012198954,0.00026961818,0.00027280257,0.0005142282,0.00063791324,0.29216594,0.004250819,0.65553916,0.0042440156,0.028957162],"study_design_scores_gemma":[0.000047927708,0.000115622206,0.008914047,0.000047196358,0.00011156935,0.00014007457,0.00029526447,0.8039482,0.00046863183,0.18425469,0.0015933852,0.00006336106],"about_ca_topic_score_codex":0.005706389,"about_ca_topic_score_gemma":0.0059417146,"teacher_disagreement_score":0.008700545,"about_ca_system_score_codex":0.0020608609,"about_ca_system_score_gemma":0.00038101975,"threshold_uncertainty_score":0.02910626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17602408,0.0008973568,0.8084026,0.00045068236,0.00009476996,0.0002185751,0.0018906267,0.008452968,0.0035682763],"genre_scores_gemma":[0.6672998,0.0005107745,0.32095784,0.00017799922,0.00010830268,0.00015917838,0.0062195943,0.0002388398,0.0043276935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935895,0.00016266025,0.00004348228,0.00015859111,0.00021068075,0.00006571629],"domain_scores_gemma":[0.9965875,0.001084485,0.00044365376,0.0005478291,0.0012501205,0.00008639513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057305733,0.00091339403,0.00093964924,0.0035674481,0.00057296804,0.00091401866,0.00076427124,0.00078406354,0.001699934],"category_scores_gemma":[0.00608343,0.00029278352,0.00050461554,0.0021054589,0.00033929016,0.001684277,0.00047764665,0.00038568582,0.0012068937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009554898,0.00024073561,0.014616234,0.00060597743,0.00023187423,0.0006294976,0.00051493495,0.26128685,0.04217499,0.007943905,0.01891455,0.651885],"study_design_scores_gemma":[0.000011207826,0.0000729853,0.002202468,0.000014260305,0.0000350712,0.00014842062,0.00008037454,0.9822578,0.0074361456,0.005123161,0.0026085346,0.000009681894],"about_ca_topic_score_codex":0.0056849876,"about_ca_topic_score_gemma":0.0063713053,"teacher_disagreement_score":0.0056849876,"about_ca_system_score_codex":0.0006547203,"about_ca_system_score_gemma":0.0005187515,"threshold_uncertainty_score":0.011303842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010341039,0.0004638669,0.9814601,0.000563461,0.000113609036,0.00015671678,0.00036364407,0.0008948775,0.005642641],"genre_scores_gemma":[0.15771808,0.00058591506,0.83022815,0.0005734931,0.00018885947,0.0006904682,0.002672472,0.00047044433,0.0068720784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984542,0.0004041861,0.00007072338,0.00036163212,0.00042632344,0.00028287678],"domain_scores_gemma":[0.9968641,0.0015639438,0.00026551748,0.0005242004,0.00057840184,0.00020400512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019727375,0.002141874,0.0019579048,0.0016929375,0.0013175388,0.0018793261,0.0031854028,0.0028198562,0.010255947],"category_scores_gemma":[0.009922018,0.0007399716,0.0014651784,0.003421499,0.000896791,0.0035045259,0.0032982768,0.002895806,0.003537286],"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.000480925,0.000330917,0.0017617955,0.00048429077,0.00012243539,0.00022662833,0.00028229016,0.62992865,0.0025605643,0.09317156,0.038473286,0.2321767],"study_design_scores_gemma":[0.00007433261,0.00004497121,0.00016366289,0.000022515187,0.000017256687,0.00009778649,0.000052206888,0.94767183,0.0003967012,0.048478063,0.0029688121,0.000011973656],"about_ca_topic_score_codex":0.0066035553,"about_ca_topic_score_gemma":0.008369571,"teacher_disagreement_score":0.010255947,"about_ca_system_score_codex":0.0021673383,"about_ca_system_score_gemma":0.0034366387,"threshold_uncertainty_score":0.034309506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7980082,0.0007928009,0.10942175,0.0011487788,0.0003175842,0.00070123357,0.057795253,0.00085406844,0.030960314],"genre_scores_gemma":[0.92320216,0.00024908487,0.047882475,0.00009605368,0.00011900612,0.0023464174,0.021458713,0.00016966005,0.0044764443],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9870863,0.0069316127,0.000870571,0.0017913675,0.0026497848,0.0006704028],"domain_scores_gemma":[0.93520737,0.043120638,0.010410588,0.005052075,0.0050968872,0.0011124081],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.008775425,0.0005330162,0.0007346124,0.011834537,0.0017791222,0.0015621538,0.0009967316,0.00067365577,0.010611116],"category_scores_gemma":[0.056140807,0.00028914513,0.0006276294,0.019503709,0.0007951319,0.0016386844,0.0031102502,0.0014166354,0.0014770235],"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.0011147509,0.00041303295,0.7423206,0.00086774793,0.0010646263,0.0011504749,0.011926911,0.012137313,0.0023785753,0.04819162,0.035791937,0.14264254],"study_design_scores_gemma":[0.00007296272,0.0005901659,0.7924382,0.00029621995,0.00028419573,0.0010023261,0.01225822,0.036434602,0.003807094,0.0337817,0.11883543,0.00019894057],"about_ca_topic_score_codex":0.008044713,"about_ca_topic_score_gemma":0.008975502,"teacher_disagreement_score":0.98816544,"about_ca_system_score_codex":0.0012476161,"about_ca_system_score_gemma":0.0017664075,"threshold_uncertainty_score":0.046409428},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003876877,0.63121384,0.27603215,0.058953878,0.0047754347,0.00025198093,0.0009601189,0.000373735,0.023561938],"genre_scores_gemma":[0.05908488,0.71372926,0.19353843,0.011860545,0.015411274,0.0007202461,0.0009806708,0.00021794732,0.004456753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936325,0.0029347928,0.00032684545,0.0009865286,0.0019611309,0.0001582752],"domain_scores_gemma":[0.9426558,0.048658457,0.0013539385,0.002702525,0.0036264835,0.0010027327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01487057,0.0011877284,0.0017323467,0.00723036,0.0012796487,0.0047298707,0.0022569527,0.0021084163,0.0033602894],"category_scores_gemma":[0.031030064,0.00060801307,0.0011183082,0.013485222,0.007332789,0.012379294,0.0034671335,0.0061506103,0.0008223605],"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.000038156064,0.00006945519,0.0017882239,0.0054008695,0.00019307264,0.00012995579,0.00095593795,0.0029418003,0.0006143787,0.65925646,0.024571203,0.30404046],"study_design_scores_gemma":[0.0000132613,0.000041509145,0.0017585672,0.0017040942,0.00006080532,0.0003208527,0.0007116368,0.0060935672,0.00044438802,0.57986337,0.40890777,0.00008017543],"about_ca_topic_score_codex":0.0037482632,"about_ca_topic_score_gemma":0.0039703157,"teacher_disagreement_score":0.01487057,"about_ca_system_score_codex":0.0033978103,"about_ca_system_score_gemma":0.004556903,"threshold_uncertainty_score":0.07864404},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74369043,0.0002965329,0.23651274,0.0004208297,0.0001721906,0.000070589354,0.00006738561,0.0003943546,0.01837493],"genre_scores_gemma":[0.99606425,0.000032961492,0.002821475,0.000019111445,0.000010568333,0.0000112727,0.000011958623,0.000013441953,0.001014998],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971277,0.000056332974,0.000013442003,0.00007826602,0.000053448945,0.000085768435],"domain_scores_gemma":[0.99763215,0.0012692626,0.00027436018,0.00027357167,0.00024937527,0.0003012274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054800394,0.00038533373,0.00038711188,0.00064534723,0.0006426349,0.0010867008,0.0009778608,0.0003719933,0.0026438148],"category_scores_gemma":[0.0050374446,0.00024819674,0.00016895069,0.00032506403,0.0006657978,0.001135788,0.0014975651,0.0006838497,0.00040462957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016143617,0.00088472327,0.009121679,0.00026871226,0.00014999471,0.0008804151,0.001301194,0.33115134,0.34221962,0.17602752,0.0040352284,0.13234515],"study_design_scores_gemma":[0.00006645391,0.00024568647,0.0016555514,0.000015692392,0.000055903056,0.00011610655,0.00024195292,0.9477075,0.027656864,0.020344224,0.0018705386,0.000023506018],"about_ca_topic_score_codex":0.00058561086,"about_ca_topic_score_gemma":0.0011256653,"teacher_disagreement_score":0.0026438148,"about_ca_system_score_codex":0.0006026481,"about_ca_system_score_gemma":0.00051677617,"threshold_uncertainty_score":0.008844495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6128201,0.0005537006,0.37830925,0.0004755185,0.000029214834,0.000078633784,0.00022341218,0.00017972436,0.007330491],"genre_scores_gemma":[0.996367,0.0001860514,0.0025634184,0.000009355015,0.000006400517,0.000023664521,0.00005353065,0.000008375887,0.0007820986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996351,0.0001089197,0.000015400028,0.00007063706,0.00008026043,0.000089593275],"domain_scores_gemma":[0.99924123,0.00030561906,0.0001884499,0.000037498496,0.00016731568,0.000059808466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062040216,0.0007569011,0.00038591583,0.0012741212,0.0005130989,0.00074897346,0.00052422896,0.000551936,0.0009391525],"category_scores_gemma":[0.002022291,0.00024711786,0.0007313856,0.0007270115,0.00060495466,0.0013373889,0.00089376833,0.0004976139,0.000060798662],"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.000021333683,0.000008884894,0.0060869195,0.000029074992,0.000037521346,0.00025723138,0.00010175954,0.98121107,0.0011517893,0.0071063703,0.00023843981,0.003749672],"study_design_scores_gemma":[0.00000102213,0.000010288728,0.0011841797,0.000003859745,0.000011498438,0.000042460455,0.000046830948,0.995924,0.00014122986,0.0025253503,0.00010408664,0.0000052588384],"about_ca_topic_score_codex":0.013343153,"about_ca_topic_score_gemma":0.005328939,"teacher_disagreement_score":0.013343153,"about_ca_system_score_codex":0.0011949155,"about_ca_system_score_gemma":0.0007733156,"threshold_uncertainty_score":0.026530981},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10511754,0.00043009227,0.8853233,0.00034452823,0.00004045909,0.00011321598,0.0009729795,0.0007139628,0.0069440454],"genre_scores_gemma":[0.60824084,0.000615135,0.37734643,0.0002854147,0.00005709965,0.00022525468,0.003187674,0.00024900984,0.009793034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945945,0.0001106196,0.000028660557,0.0001477918,0.00014518434,0.00010818166],"domain_scores_gemma":[0.9985043,0.0004951342,0.000197534,0.00032592303,0.00032574,0.00015134687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006459373,0.0007299919,0.0006308023,0.001573411,0.0006111597,0.0012623215,0.0009238085,0.0006860018,0.004121077],"category_scores_gemma":[0.003967839,0.00050992076,0.0008167739,0.0012838012,0.0006411707,0.002558009,0.0017308729,0.001024564,0.0006440418],"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.00027993164,0.00012942278,0.0073004235,0.00040965882,0.00012663478,0.00043153952,0.00046531254,0.4976753,0.013637026,0.23776168,0.013262463,0.22852063],"study_design_scores_gemma":[0.000011815137,0.00003148913,0.0010707136,0.00003029525,0.00002184492,0.00013210696,0.00011110675,0.8667143,0.0021649294,0.12375056,0.0059509794,0.000009830692],"about_ca_topic_score_codex":0.004895235,"about_ca_topic_score_gemma":0.008977712,"teacher_disagreement_score":0.004895235,"about_ca_system_score_codex":0.0013102506,"about_ca_system_score_gemma":0.0008482189,"threshold_uncertainty_score":0.013786316},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02217865,0.0010008591,0.9719325,0.00026082687,0.00018678894,0.00027570417,0.0002806217,0.0019432094,0.0019408128],"genre_scores_gemma":[0.1555179,0.0005381242,0.83526266,0.00023012201,0.00015428576,0.0003791499,0.001318119,0.00025157808,0.006348052],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979961,0.00026217644,0.000104114275,0.00059192436,0.0008601011,0.00018563634],"domain_scores_gemma":[0.9975236,0.00068842573,0.00026323734,0.00025276496,0.0010812371,0.00019063421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015109025,0.0012283564,0.0019435087,0.00590296,0.001972088,0.0017945947,0.003132189,0.0017476862,0.0021704126],"category_scores_gemma":[0.00502625,0.0005766931,0.0012183011,0.0038937184,0.00078472914,0.003422216,0.0019886938,0.0011556278,0.0015464467],"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.00039306798,0.00030262707,0.0054787793,0.00030026055,0.00025016465,0.00031653192,0.00031209952,0.051310953,0.025797816,0.009599056,0.0153667005,0.89057195],"study_design_scores_gemma":[0.00010912444,0.0001622944,0.0017351635,0.000042659234,0.000087585424,0.0008562618,0.00017020055,0.9597817,0.0145522375,0.009434738,0.012984117,0.000083952764],"about_ca_topic_score_codex":0.00806494,"about_ca_topic_score_gemma":0.009094989,"teacher_disagreement_score":0.00806494,"about_ca_system_score_codex":0.0009772526,"about_ca_system_score_gemma":0.0022378103,"threshold_uncertainty_score":0.016035974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013043385,0.00030676858,0.98370206,0.00025783572,0.000059014204,0.0000454061,0.0003497943,0.001201316,0.0010343762],"genre_scores_gemma":[0.5554815,0.00096308894,0.42616516,0.0004278877,0.00010148675,0.0002702058,0.0016377368,0.0005898293,0.014363065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978846,0.0000443058,0.0000091027705,0.000059232556,0.0000639132,0.000035112538],"domain_scores_gemma":[0.99950206,0.0002557878,0.000042518102,0.000064100874,0.00009692208,0.000038691247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063295587,0.0009075963,0.00088392093,0.00076074054,0.00042332464,0.00074423564,0.0022951257,0.0016688156,0.0020720116],"category_scores_gemma":[0.0024065215,0.00057279656,0.0006916569,0.0008110397,0.00061002607,0.0016466303,0.0011559058,0.0019019463,0.0005957099],"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.000081293736,0.000036922018,0.00043061475,0.000038778802,0.000037869115,0.000049292667,0.000025018191,0.9273367,0.002664194,0.017341653,0.0025190471,0.049438562],"study_design_scores_gemma":[0.0000013074714,0.0000024545127,0.000016114529,9.834529e-7,0.0000014444632,0.0000034785794,4.6176186e-7,0.99789774,0.00017582344,0.001755223,0.00014368819,0.0000012266964],"about_ca_topic_score_codex":0.03839077,"about_ca_topic_score_gemma":0.038868558,"teacher_disagreement_score":0.03839077,"about_ca_system_score_codex":0.001802672,"about_ca_system_score_gemma":0.0015738335,"threshold_uncertainty_score":0.076334596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.521606,0.0010285135,0.4569948,0.0030876982,0.00017680612,0.00023610058,0.0023934613,0.00044563547,0.014031047],"genre_scores_gemma":[0.98210484,0.00053078454,0.009081568,0.000083633284,0.00006760092,0.00016604808,0.00057185034,0.000023829733,0.0073699276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930704,0.00016873011,0.00003612153,0.00021800406,0.0001248532,0.00014528172],"domain_scores_gemma":[0.9974366,0.0016262511,0.00038229153,0.00011833435,0.00031204405,0.00012460692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010745724,0.0005836575,0.000743834,0.0010921556,0.0006468694,0.0014491162,0.0011775463,0.0010510605,0.0038929805],"category_scores_gemma":[0.004375539,0.00033751316,0.00072103896,0.0009655323,0.0007569805,0.0019283263,0.0007209133,0.0010328213,0.0005595634],"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.0004333486,0.00018701762,0.029113822,0.00019098284,0.000133765,0.0014352772,0.0010137951,0.74455357,0.003597652,0.19576994,0.0043060924,0.019264665],"study_design_scores_gemma":[0.000011506247,0.00001840702,0.0010885121,0.000008245917,0.000015916827,0.000046562007,0.00004954775,0.9900885,0.00019028696,0.007971958,0.00049941865,0.000011148228],"about_ca_topic_score_codex":0.024000376,"about_ca_topic_score_gemma":0.0117474785,"teacher_disagreement_score":0.024000376,"about_ca_system_score_codex":0.0014495999,"about_ca_system_score_gemma":0.00094272825,"threshold_uncertainty_score":0.047721386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062084603,0.0004247994,0.99030286,0.0003823563,0.00010236742,0.000040071034,0.00008387934,0.0004615131,0.0019936159],"genre_scores_gemma":[0.47817025,0.0010630487,0.50206876,0.0005305449,0.00044494757,0.000479926,0.00066781737,0.00066890894,0.015905846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982212,0.0009103666,0.000072910734,0.00038576694,0.00030833937,0.00010138962],"domain_scores_gemma":[0.9946398,0.0035541388,0.000308787,0.00086118095,0.00045381996,0.00018230618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002060544,0.0008596166,0.0021656519,0.0016096199,0.00094371,0.0021494166,0.0030780435,0.0023307265,0.0046344516],"category_scores_gemma":[0.012334427,0.001185557,0.0016476882,0.0019091326,0.001978631,0.004390633,0.0033032654,0.0031454724,0.0015179941],"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.00010255447,0.00004937215,0.0004906272,0.0001221729,0.000105851475,0.0000337581,0.00008871973,0.70216507,0.0007160218,0.24139145,0.0030536614,0.051680733],"study_design_scores_gemma":[0.0000066320827,0.000005155322,0.00005711793,0.000006703755,0.000005986458,0.000011627841,0.0000064932897,0.8397595,0.00017962733,0.1594174,0.00053581037,0.000007939168],"about_ca_topic_score_codex":0.0042985696,"about_ca_topic_score_gemma":0.00414572,"teacher_disagreement_score":0.0046344516,"about_ca_system_score_codex":0.0016964888,"about_ca_system_score_gemma":0.0010497496,"threshold_uncertainty_score":0.015503764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024721868,0.005267285,0.77684504,0.0070727747,0.0017149184,0.002332469,0.007563181,0.08990695,0.08457545],"genre_scores_gemma":[0.1275511,0.0026070322,0.80922276,0.002985661,0.00044867425,0.000533207,0.013509192,0.0012811432,0.041861232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981178,0.00029803006,0.00014052913,0.0003831876,0.0009263731,0.00013406275],"domain_scores_gemma":[0.99729186,0.0005275169,0.00016331166,0.0007512487,0.0010012194,0.00026476616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014893621,0.0011310165,0.0009362686,0.0025805924,0.0012931136,0.0031526154,0.0023714462,0.0030538435,0.0098484745],"category_scores_gemma":[0.006304953,0.00073969277,0.0011195606,0.0032303848,0.00033827132,0.004996421,0.0019436097,0.0027509246,0.0123038795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043618787,0.00081470725,0.0032571515,0.0008482153,0.00032176037,0.0009402108,0.00037976526,0.009404014,0.008178858,0.017157651,0.186869,0.7713925],"study_design_scores_gemma":[0.00034361955,0.00029280284,0.0021891058,0.0002866707,0.00029765035,0.0012082548,0.00059030164,0.4301099,0.016247002,0.059441175,0.48882395,0.0001695393],"about_ca_topic_score_codex":0.007344057,"about_ca_topic_score_gemma":0.010101304,"teacher_disagreement_score":0.0098484745,"about_ca_system_score_codex":0.0004987766,"about_ca_system_score_gemma":0.0013708436,"threshold_uncertainty_score":0.032946408},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074624135,0.00036714054,0.93228114,0.00070021837,0.0010168499,0.0023042632,0.0086405575,0.011156107,0.036071304],"genre_scores_gemma":[0.112749405,0.0003466094,0.7636703,0.00088892505,0.0004847926,0.0075009745,0.015861267,0.0054018474,0.093095824],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937078,0.0028515307,0.00024783093,0.0015347078,0.0011500577,0.00050815486],"domain_scores_gemma":[0.9864834,0.003982578,0.0003659043,0.006590028,0.0021778247,0.0004003782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005989362,0.0013505773,0.0020402865,0.0027572317,0.002601121,0.0028523686,0.0030444956,0.0014317988,0.10684694],"category_scores_gemma":[0.03401332,0.00073008094,0.0018226693,0.0036608377,0.0013572134,0.0019240049,0.0031841935,0.00239048,0.03297182],"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.0014444808,0.00031705247,0.0014725536,0.0003464206,0.00022549006,0.000088222114,0.00016723074,0.033749674,0.0014870802,0.27515024,0.29077834,0.39477322],"study_design_scores_gemma":[0.001123632,0.00034929684,0.0015662501,0.00016690177,0.00022275491,0.00030774996,0.00014271725,0.39190862,0.0089879325,0.39828905,0.19677514,0.00015991717],"about_ca_topic_score_codex":0.0034804628,"about_ca_topic_score_gemma":0.007099006,"teacher_disagreement_score":0.10684694,"about_ca_system_score_codex":0.0017658586,"about_ca_system_score_gemma":0.005296453,"threshold_uncertainty_score":0.35743862},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010621312,0.0079178065,0.051915128,0.018126938,0.0027199285,0.00032611995,0.003758685,0.0010776944,0.9035365],"genre_scores_gemma":[0.61557746,0.024102828,0.040973496,0.009064786,0.0057895686,0.0007038631,0.01123431,0.0019020186,0.29065168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9816901,0.0045675314,0.0014190439,0.0026435815,0.008459751,0.0012199858],"domain_scores_gemma":[0.94690824,0.019793758,0.005257847,0.010377504,0.014589539,0.003073073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006539039,0.0007122488,0.0008418626,0.0064060395,0.003363117,0.020361885,0.0020373622,0.0027345782,0.073222235],"category_scores_gemma":[0.06736869,0.00044519635,0.0007286505,0.008797572,0.004636828,0.019749522,0.008702466,0.0028009482,0.023049783],"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.00007472373,0.000037210295,0.0025831936,0.00082798407,0.00003443701,0.00021447771,0.0028360172,0.0006159108,0.00053540047,0.74526185,0.10110314,0.14587562],"study_design_scores_gemma":[0.000007581673,0.000024615108,0.0010293862,0.00072222954,0.000026277597,0.00033535488,0.0010745268,0.0005504886,0.0006461515,0.14731196,0.8482433,0.000028126062],"about_ca_topic_score_codex":0.0034807504,"about_ca_topic_score_gemma":0.0017205349,"teacher_disagreement_score":0.073222235,"about_ca_system_score_codex":0.0038764032,"about_ca_system_score_gemma":0.005867062,"threshold_uncertainty_score":0.2449528},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070261066,0.0012770407,0.9827266,0.0007097378,0.0000881897,0.00010458494,0.00093592383,0.0016197097,0.005512196],"genre_scores_gemma":[0.17332849,0.0038655137,0.79594886,0.00043017953,0.00040266168,0.0004492222,0.007074708,0.00082706666,0.017673256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699956,0.00094264775,0.00016636548,0.00077236537,0.0010193288,0.000099774596],"domain_scores_gemma":[0.9942782,0.0037200185,0.00016794202,0.0013623941,0.000351482,0.00011998888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002339477,0.0011404842,0.0013495306,0.0025927052,0.00088673126,0.0040095714,0.0022312647,0.0012237559,0.0059428946],"category_scores_gemma":[0.017429104,0.00085426134,0.001183091,0.0035021403,0.0011317106,0.007935933,0.003071586,0.0018601932,0.0029826376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013422285,0.00015593469,0.0041848314,0.00067878887,0.00018397512,0.00019389144,0.0010650746,0.07741304,0.0075236107,0.26867574,0.035764858,0.604026],"study_design_scores_gemma":[0.000013835869,0.00001973624,0.00079743034,0.000071935276,0.000028473603,0.000277348,0.00027879543,0.49670035,0.0036220746,0.4690629,0.029100988,0.000026207135],"about_ca_topic_score_codex":0.002109703,"about_ca_topic_score_gemma":0.003247581,"teacher_disagreement_score":0.0059428946,"about_ca_system_score_codex":0.0011845174,"about_ca_system_score_gemma":0.00083341135,"threshold_uncertainty_score":0.01988089},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014940579,0.0023176498,0.67674166,0.0033888023,0.00063152955,0.00014846848,0.0010354689,0.0010019807,0.2997939],"genre_scores_gemma":[0.35902733,0.007218922,0.20850877,0.00083775073,0.0008749177,0.00060099823,0.0021691194,0.00053674413,0.4202254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955744,0.00012361933,0.00002068526,0.00009673397,0.00015700441,0.000044431923],"domain_scores_gemma":[0.99914825,0.0003515646,0.000063010426,0.00019889088,0.00016419822,0.0000740528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005163284,0.0006687253,0.00031594344,0.0014369744,0.0008934312,0.00282299,0.0007196156,0.0007248344,0.017239595],"category_scores_gemma":[0.0034530773,0.00044285803,0.0004274401,0.0013087958,0.0008432066,0.00429586,0.0020314956,0.0013311438,0.0044625145],"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.000010744556,0.000015697446,0.0003603121,0.00009147657,0.000020545976,0.000060345377,0.00026476642,0.0077817356,0.00074051484,0.8810164,0.019194534,0.09044297],"study_design_scores_gemma":[0.0000032689447,0.000010729656,0.00055994064,0.00008484786,0.000021591113,0.00018163871,0.0001862802,0.03569217,0.0008860942,0.82307523,0.13927837,0.000019916346],"about_ca_topic_score_codex":0.0015260675,"about_ca_topic_score_gemma":0.0022348154,"teacher_disagreement_score":0.017239595,"about_ca_system_score_codex":0.0009879783,"about_ca_system_score_gemma":0.0006246355,"threshold_uncertainty_score":0.057672203},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010948642,0.0019903737,0.58065355,0.0029912635,0.0008761587,0.00031579743,0.0059926594,0.0012749644,0.3949566],"genre_scores_gemma":[0.3820433,0.014686712,0.23089743,0.0015274371,0.0023439985,0.0015104577,0.0155713465,0.001626854,0.34979248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993606,0.000093690716,0.000036630867,0.0002420828,0.00022337004,0.000043641423],"domain_scores_gemma":[0.9986791,0.0005404989,0.00010646324,0.0003207638,0.00029359775,0.0000596244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006929259,0.0008869742,0.0004379466,0.002365629,0.0007278957,0.0023385722,0.0007969866,0.00071080454,0.035963114],"category_scores_gemma":[0.004787393,0.00033258175,0.0005673498,0.0018767045,0.0007595732,0.006342241,0.0011285524,0.0013463738,0.0103789605],"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.000030039873,0.000036998124,0.000759335,0.00029479997,0.00003156714,0.00009978981,0.00013969258,0.011247794,0.0022976887,0.80576324,0.04321292,0.13608609],"study_design_scores_gemma":[0.0000066725747,0.000023831662,0.00087338535,0.00011387072,0.000040407864,0.00035815727,0.00011967957,0.02995853,0.0022417826,0.7434414,0.22279976,0.00002247051],"about_ca_topic_score_codex":0.0009033874,"about_ca_topic_score_gemma":0.0009924008,"teacher_disagreement_score":0.035963114,"about_ca_system_score_codex":0.00094127737,"about_ca_system_score_gemma":0.0005207118,"threshold_uncertainty_score":0.12030864},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004170342,0.03601533,0.8276657,0.0062147863,0.0021650537,0.00014042832,0.0014567025,0.0015859732,0.120585606],"genre_scores_gemma":[0.13002497,0.07191658,0.46817517,0.0015786013,0.0068204487,0.00053633505,0.0050738933,0.0011760327,0.31469804],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927324,0.00017439385,0.000026668698,0.0001801694,0.00031069235,0.00003488017],"domain_scores_gemma":[0.9986683,0.00083019334,0.000052521926,0.00022837362,0.00018216894,0.000038459366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085955515,0.0012841717,0.0009940668,0.002472075,0.00062093546,0.002562669,0.0009688215,0.0012525999,0.013198741],"category_scores_gemma":[0.004202665,0.0005491122,0.0007674632,0.004726985,0.000875776,0.004634797,0.0011253936,0.0020264816,0.008154308],"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.00001945502,0.000080684345,0.0006305621,0.00036608937,0.00009407317,0.000045450568,0.00015328306,0.015227473,0.00076292234,0.23087122,0.122256726,0.6294921],"study_design_scores_gemma":[0.0000062708677,0.000017098739,0.0011617965,0.00018614792,0.0000420727,0.00017377325,0.00012377347,0.09716169,0.0010367626,0.6549069,0.24514769,0.00003595959],"about_ca_topic_score_codex":0.0025922155,"about_ca_topic_score_gemma":0.003263661,"teacher_disagreement_score":0.013198741,"about_ca_system_score_codex":0.0010664653,"about_ca_system_score_gemma":0.0006539567,"threshold_uncertainty_score":0.044154167},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071807164,0.000366827,0.9323003,0.0007201757,0.001428141,0.0062699746,0.013621667,0.013217767,0.02489456],"genre_scores_gemma":[0.10069188,0.00026742712,0.76380426,0.0012857881,0.00052921596,0.022874322,0.020949746,0.00761906,0.081978306],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9863815,0.006856903,0.00057017157,0.003796751,0.0015452174,0.0008495649],"domain_scores_gemma":[0.9737671,0.008657646,0.00059517944,0.0131347515,0.0032090363,0.0006363058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012941525,0.0015795926,0.0029171603,0.0031920993,0.0032408426,0.0036889901,0.0038869958,0.002041451,0.16246352],"category_scores_gemma":[0.07087245,0.001114563,0.0029312074,0.0037374897,0.0021835235,0.0020610334,0.003859675,0.0035178026,0.052668076],"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.0029676773,0.0004617513,0.0020722796,0.000633953,0.00046637253,0.00011490566,0.0003097572,0.027935311,0.0011164108,0.25908154,0.3351977,0.36964232],"study_design_scores_gemma":[0.0025843466,0.00059669535,0.0020732137,0.00036917548,0.00041221167,0.00035286113,0.00028112374,0.29408368,0.006338388,0.4780538,0.2146374,0.00021716682],"about_ca_topic_score_codex":0.004342667,"about_ca_topic_score_gemma":0.008031493,"teacher_disagreement_score":0.16246352,"about_ca_system_score_codex":0.0018943208,"about_ca_system_score_gemma":0.0069529423,"threshold_uncertainty_score":0.5434946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008558101,0.0017061612,0.14099331,0.004489447,0.00093171286,0.00030132214,0.0038072928,0.0010315364,0.83818114],"genre_scores_gemma":[0.15854426,0.0056118583,0.051202957,0.0010846239,0.0010817171,0.0005954723,0.006369912,0.00040207646,0.7751071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995741,0.00010878755,0.000015073703,0.000106979176,0.00016367821,0.00003124181],"domain_scores_gemma":[0.99953234,0.00016817098,0.00003732728,0.000094291834,0.00012077281,0.00004710841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037236337,0.00051681756,0.0002536502,0.0019664555,0.0010564447,0.002192566,0.00060858007,0.00073261297,0.06163559],"category_scores_gemma":[0.0021132103,0.00018855657,0.00028414413,0.0020205278,0.00053433294,0.0039278707,0.0015642853,0.00059682457,0.017728193],"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.000020714917,0.000034915094,0.0006640789,0.00020506265,0.000022073975,0.00013525483,0.000458332,0.0027312639,0.0013602885,0.5842035,0.15046616,0.2596984],"study_design_scores_gemma":[0.0000043908985,0.000015228708,0.00074694946,0.00008347363,0.00001383916,0.00027324466,0.00036895572,0.007945176,0.0007059742,0.17012174,0.81970596,0.000015060307],"about_ca_topic_score_codex":0.0015684263,"about_ca_topic_score_gemma":0.002261185,"teacher_disagreement_score":0.06163559,"about_ca_system_score_codex":0.0008333129,"about_ca_system_score_gemma":0.00054422236,"threshold_uncertainty_score":0.20619154},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004552205,0.0017108645,0.8888369,0.0008302108,0.00077230146,0.00030552817,0.003751905,0.011331437,0.087908626],"genre_scores_gemma":[0.05876407,0.0038499304,0.6462645,0.0006403676,0.0007191646,0.00038150712,0.012865124,0.002533377,0.27398202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994468,0.000047570353,0.000025711324,0.00021503595,0.00022485106,0.000040019],"domain_scores_gemma":[0.9991604,0.00019826871,0.00006413864,0.00017570828,0.0003567479,0.000044765566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008325581,0.0012817523,0.00072568347,0.0037076403,0.0006566572,0.0021641117,0.0013282204,0.0009907538,0.04118678],"category_scores_gemma":[0.0027077857,0.00052394497,0.00086864375,0.0030104178,0.00030320053,0.002406817,0.0012325558,0.0010051649,0.03736455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056811354,0.000046038924,0.0011069139,0.00022380958,0.000040478913,0.00009358135,0.00008672228,0.0040509235,0.00839342,0.020466663,0.09162739,0.87380713],"study_design_scores_gemma":[0.000027103526,0.00012279575,0.0057312595,0.00029434395,0.00014305436,0.0013106737,0.0002894839,0.20757377,0.03670385,0.094545685,0.65314627,0.000111798916],"about_ca_topic_score_codex":0.0020032895,"about_ca_topic_score_gemma":0.0028982328,"teacher_disagreement_score":0.04118678,"about_ca_system_score_codex":0.0005936182,"about_ca_system_score_gemma":0.00071307673,"threshold_uncertainty_score":0.13778353},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011354755,0.0010055809,0.71981007,0.001703041,0.0007441547,0.00046197357,0.048001382,0.07551991,0.1516184],"genre_scores_gemma":[0.021072129,0.0035762778,0.54536724,0.0013078761,0.0009850839,0.002730578,0.10146348,0.034455005,0.28904238],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871004,0.00030065325,0.0000817217,0.00026681327,0.0005539118,0.000086810796],"domain_scores_gemma":[0.9964206,0.0015827895,0.00015993795,0.000889188,0.0007922711,0.00015519926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017496928,0.0022326845,0.0011641285,0.005863637,0.001017201,0.003318628,0.0018499539,0.0009161858,0.22311592],"category_scores_gemma":[0.009344923,0.0011543812,0.0018134096,0.004278164,0.00045218263,0.0047407676,0.0026565883,0.0020743,0.17879349],"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.000027815617,0.00005575113,0.00050624274,0.0004095009,0.000067350295,0.00005179364,0.00022819126,0.0037447088,0.0008131892,0.078834966,0.6522645,0.26299602],"study_design_scores_gemma":[0.000018702915,0.000010755833,0.0006901626,0.00015408907,0.00003741288,0.00013177624,0.00008548643,0.024499478,0.0014448732,0.15359053,0.8192966,0.000040244715],"about_ca_topic_score_codex":0.0025150985,"about_ca_topic_score_gemma":0.0044695446,"teacher_disagreement_score":0.22311592,"about_ca_system_score_codex":0.00094177126,"about_ca_system_score_gemma":0.0014529922,"threshold_uncertainty_score":0.74639714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09203027,0.0030286023,0.8686726,0.003538719,0.00023718092,0.00013773164,0.0035165923,0.00491748,0.023920804],"genre_scores_gemma":[0.56557506,0.0029210767,0.42143625,0.00025684817,0.00015456585,0.00018941725,0.0030938978,0.0009118807,0.0054610306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991947,0.00036415688,0.000041589192,0.00016380375,0.00018951905,0.000046328005],"domain_scores_gemma":[0.9966665,0.002157083,0.0003264336,0.00032874043,0.00038904647,0.00013232348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012574566,0.00081000704,0.0003498556,0.0038061317,0.00086637517,0.0037751351,0.00074505777,0.0010116753,0.0075747315],"category_scores_gemma":[0.0075148507,0.00034948392,0.0005262556,0.0028685152,0.00073699234,0.004508303,0.0017287345,0.00091884384,0.00094084215],"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.00029493467,0.00012419824,0.013358168,0.0013835251,0.00029973596,0.0010876402,0.011433623,0.20763168,0.03349402,0.4081089,0.04718749,0.2755961],"study_design_scores_gemma":[0.000043273696,0.00004410309,0.006666577,0.0003077317,0.00007624641,0.0007891835,0.003743267,0.42879376,0.009808116,0.41764545,0.13199624,0.0000860469],"about_ca_topic_score_codex":0.0024640241,"about_ca_topic_score_gemma":0.0029786911,"teacher_disagreement_score":0.0075747315,"about_ca_system_score_codex":0.00072987395,"about_ca_system_score_gemma":0.0005614341,"threshold_uncertainty_score":0.02534002},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00549431,0.015841603,0.9447617,0.0012792025,0.0012260561,0.0001292891,0.00059877214,0.0014720506,0.029197024],"genre_scores_gemma":[0.16523881,0.019706346,0.73565227,0.0011788491,0.004667976,0.00048851175,0.0030176914,0.0011054911,0.06894405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913126,0.00015667264,0.000033916134,0.00035492488,0.00028241854,0.000040869876],"domain_scores_gemma":[0.9984102,0.00077896006,0.00011999753,0.00033737742,0.00026699324,0.00008644936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001019564,0.001218159,0.001011088,0.003223287,0.0008430876,0.0022305588,0.0016142565,0.0012902392,0.0056024394],"category_scores_gemma":[0.006051206,0.0006581239,0.00067971135,0.0039978204,0.001423475,0.0046532853,0.0018445291,0.0020485607,0.0043908563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064641965,0.00010500835,0.0010277269,0.00070723216,0.00009894206,0.000109413435,0.00037043946,0.014238843,0.0052311732,0.242554,0.09353408,0.6419584],"study_design_scores_gemma":[0.000013905476,0.000048143498,0.0013408134,0.00014187807,0.000059612223,0.0004601736,0.00017088906,0.11111903,0.0024783947,0.7707587,0.113368616,0.000039870247],"about_ca_topic_score_codex":0.0012221042,"about_ca_topic_score_gemma":0.0015707988,"teacher_disagreement_score":0.0056024394,"about_ca_system_score_codex":0.0006591229,"about_ca_system_score_gemma":0.0005382164,"threshold_uncertainty_score":0.018742085},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005651588,0.0028746538,0.9738166,0.0006423812,0.00021545103,0.000060390197,0.0006191984,0.0008809565,0.01523884],"genre_scores_gemma":[0.38750052,0.01304689,0.52185786,0.00045639143,0.0021715155,0.00050146866,0.004702836,0.0010681532,0.068694375],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992125,0.0002504212,0.000048760874,0.00018951738,0.0002526054,0.000046230896],"domain_scores_gemma":[0.99800974,0.0014208994,0.00010425808,0.00023092976,0.00018574548,0.00004855169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009115478,0.0012054478,0.00080629066,0.0025507328,0.00053391827,0.002280195,0.0009776531,0.0006040855,0.0063852216],"category_scores_gemma":[0.0041517722,0.00048622873,0.0010499131,0.0026508335,0.00079486106,0.00326475,0.0012576758,0.0014568695,0.0021209174],"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.0000702002,0.00010583479,0.0022464867,0.00044852073,0.00021667844,0.00024428687,0.0005200868,0.066254295,0.0035052667,0.39492688,0.03498923,0.49647227],"study_design_scores_gemma":[0.0000060048937,0.000016255233,0.0019038598,0.00006838685,0.000042311218,0.00016611151,0.00016274716,0.4812507,0.0017374113,0.48114607,0.03347134,0.000028881906],"about_ca_topic_score_codex":0.0016882216,"about_ca_topic_score_gemma":0.0015949772,"teacher_disagreement_score":0.0063852216,"about_ca_system_score_codex":0.00073150755,"about_ca_system_score_gemma":0.0003629198,"threshold_uncertainty_score":0.021360636},"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":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013373826,0.0030868545,0.3105406,0.0069984584,0.0023251988,0.001216366,0.46839672,0.011979006,0.18208303],"genre_scores_gemma":[0.119392864,0.0058353986,0.20116742,0.0016637533,0.0015598305,0.0018459106,0.5432788,0.0015947182,0.12366129],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984321,0.00032000558,0.00010216353,0.0003578558,0.000709821,0.000078006626],"domain_scores_gemma":[0.9969162,0.0009620471,0.00018125752,0.0012354851,0.0005364162,0.00016865376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013242491,0.0007807729,0.0005371768,0.0042756842,0.0008675006,0.0025421542,0.0010447387,0.0007188517,0.033195987],"category_scores_gemma":[0.008697092,0.00031416348,0.00065532775,0.0047277836,0.00036677098,0.003881883,0.0019945323,0.0011360548,0.024574133],"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.000071752234,0.00012193483,0.0043878164,0.00051642046,0.00008151493,0.00010544552,0.0002679327,0.0047111716,0.00202001,0.0905607,0.4856982,0.41145712],"study_design_scores_gemma":[0.000011452076,0.000025436875,0.004253968,0.00016624459,0.000027936678,0.00023972483,0.00030830342,0.024491724,0.0023327558,0.09280319,0.87530434,0.000034823435],"about_ca_topic_score_codex":0.0040290453,"about_ca_topic_score_gemma":0.0070674815,"teacher_disagreement_score":0.033195987,"about_ca_system_score_codex":0.0008848099,"about_ca_system_score_gemma":0.0011575895,"threshold_uncertainty_score":0.11105168},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39986885,0.002786004,0.5246384,0.0049335766,0.00032483225,0.00019120157,0.0007297757,0.00078021735,0.06574718],"genre_scores_gemma":[0.96588457,0.000875728,0.02123551,0.00025419408,0.00018102389,0.00019548614,0.00026678893,0.00012886547,0.010977896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994752,0.00018314632,0.000016085436,0.00011143028,0.0001261467,0.000087986264],"domain_scores_gemma":[0.99736494,0.0015854805,0.0002738549,0.00023542634,0.00016297198,0.00037729458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010665552,0.0005144184,0.0007198258,0.0008207639,0.0008125067,0.0013796109,0.0014008272,0.0014197343,0.0050033666],"category_scores_gemma":[0.011341897,0.0004217228,0.0006188137,0.00047443056,0.0016252935,0.0047720373,0.0012903196,0.0019401874,0.00068194827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101400125,0.00002834705,0.0005698524,0.00007411944,0.00003239552,0.000116405805,0.00021762821,0.045080114,0.0026882996,0.9448739,0.002124608,0.0040929057],"study_design_scores_gemma":[0.000025348541,0.000022287833,0.00038917133,0.000016442484,0.000014142603,0.00007781162,0.00003661811,0.3525436,0.00062786636,0.6442229,0.0019956646,0.000028210867],"about_ca_topic_score_codex":0.0020904487,"about_ca_topic_score_gemma":0.0011635321,"teacher_disagreement_score":0.0050033666,"about_ca_system_score_codex":0.0012907105,"about_ca_system_score_gemma":0.00054842513,"threshold_uncertainty_score":0.016737938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16300017,0.002494818,0.8057613,0.002938944,0.0002653582,0.00085721264,0.009356928,0.00448178,0.01084356],"genre_scores_gemma":[0.6792642,0.0010196168,0.30747342,0.0002531959,0.00017311885,0.00043888405,0.0083888,0.0001237927,0.0028650018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987031,0.0003278552,0.000088691886,0.00036118264,0.00041100846,0.00010811464],"domain_scores_gemma":[0.9969292,0.0013114293,0.00037538697,0.00057469186,0.00061907555,0.00019014943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011334178,0.001242354,0.0009717946,0.005281021,0.0015130076,0.0014856282,0.0018677172,0.0010919439,0.0018661087],"category_scores_gemma":[0.009236263,0.0004727082,0.0013666059,0.004473177,0.0004986454,0.0027156104,0.0011090877,0.0010363676,0.0012587508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006895246,0.001349243,0.092479065,0.0011844464,0.0011596655,0.0014133829,0.001976434,0.21299164,0.008968212,0.04059479,0.046506163,0.5906874],"study_design_scores_gemma":[0.000026804748,0.00007781075,0.0071596885,0.000065986824,0.00010451346,0.0003393436,0.0008186791,0.92385125,0.0039075813,0.05279533,0.01082283,0.000030145784],"about_ca_topic_score_codex":0.010223071,"about_ca_topic_score_gemma":0.01963707,"teacher_disagreement_score":0.010223071,"about_ca_system_score_codex":0.001053784,"about_ca_system_score_gemma":0.001065963,"threshold_uncertainty_score":0.020327091},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005117119,0.006168522,0.24133213,0.0036941397,0.0016102444,0.00010592031,0.0012190656,0.001084839,0.7396681],"genre_scores_gemma":[0.09775852,0.011550722,0.06028317,0.0016313946,0.0017930408,0.000308758,0.0027219942,0.0008830597,0.8230694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973863,0.000048974598,0.000007836944,0.00007862731,0.00010684016,0.000019098547],"domain_scores_gemma":[0.9996074,0.00015490592,0.000026206546,0.0001011099,0.000079113444,0.000031239986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002489886,0.000813869,0.00053667935,0.0012226508,0.0005617619,0.001598687,0.00068436406,0.00070759817,0.049995814],"category_scores_gemma":[0.0014849317,0.0003847076,0.0004075092,0.0014665938,0.0007381869,0.0022946126,0.0007947191,0.0016376217,0.017839437],"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.000007888746,0.000027998429,0.00009727335,0.00013146819,0.000015977766,0.000041893476,0.00007094477,0.003893042,0.0006858432,0.7533934,0.12219968,0.1194346],"study_design_scores_gemma":[0.000005740025,0.000011535203,0.0002512323,0.00006228365,0.000013322268,0.00016411277,0.000034678837,0.008867856,0.0005991706,0.6959751,0.29400256,0.0000123813215],"about_ca_topic_score_codex":0.0006389542,"about_ca_topic_score_gemma":0.0010265211,"teacher_disagreement_score":0.049995814,"about_ca_system_score_codex":0.00079028495,"about_ca_system_score_gemma":0.00044598852,"threshold_uncertainty_score":0.16725266},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022446157,0.0015098776,0.9255242,0.0012607146,0.00042782738,0.00012846883,0.0020237078,0.0014303572,0.06545022],"genre_scores_gemma":[0.1186979,0.009934717,0.62169105,0.0011170099,0.0013724507,0.0007954282,0.012385214,0.0019523747,0.23205388],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937856,0.00012519912,0.00002398947,0.00022367846,0.00021024754,0.00003831529],"domain_scores_gemma":[0.99876827,0.0005622935,0.0000656782,0.00025326962,0.0003049624,0.000045516485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008720625,0.0011727192,0.0006551713,0.003163052,0.00072813785,0.002092886,0.0010842383,0.00073438004,0.026849577],"category_scores_gemma":[0.0043688696,0.00048927637,0.0009694983,0.0026737598,0.0006236504,0.002977911,0.0013341391,0.0015985279,0.0117727155],"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.000023645369,0.000051081595,0.0009902554,0.0002923596,0.00008857316,0.00008949108,0.00020851748,0.044648007,0.0021622453,0.37768877,0.10821841,0.46553865],"study_design_scores_gemma":[0.0000067531237,0.000018521576,0.0014132846,0.000161493,0.000059865808,0.00021763476,0.00014422357,0.1698966,0.0027943405,0.6015437,0.22370769,0.00003588694],"about_ca_topic_score_codex":0.0024205453,"about_ca_topic_score_gemma":0.0032059513,"teacher_disagreement_score":0.026849577,"about_ca_system_score_codex":0.0012292519,"about_ca_system_score_gemma":0.0008810973,"threshold_uncertainty_score":0.08982074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5910898,0.00012059539,0.40641946,0.0002888977,0.0000142453955,0.00007483569,0.00014584226,0.0007090503,0.0011372931],"genre_scores_gemma":[0.9498892,0.00007337737,0.049578067,0.00003084735,0.000010194335,0.00005989424,0.00012183819,0.000051353865,0.00018527076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963356,0.0020463322,0.0002322061,0.00054466823,0.000697138,0.00014395583],"domain_scores_gemma":[0.86262524,0.1214092,0.0076641776,0.0050479504,0.0023941672,0.0008593123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061393604,0.00041410883,0.0005596368,0.0018841979,0.00045513388,0.0014202576,0.000564788,0.0008054015,0.0015192435],"category_scores_gemma":[0.07990589,0.00050589954,0.00042373934,0.0010190299,0.0019708101,0.0027853465,0.0018098776,0.0009255374,0.0001726723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037788467,0.00035059362,0.21033981,0.0010413361,0.00049602723,0.0013598315,0.0072790673,0.26086283,0.16850184,0.054824498,0.0024744978,0.28869087],"study_design_scores_gemma":[0.00006787963,0.00048750112,0.10823465,0.00008170919,0.00008146969,0.0011009811,0.0010036452,0.77039576,0.03550379,0.08129096,0.0015732505,0.00017846281],"about_ca_topic_score_codex":0.0010415919,"about_ca_topic_score_gemma":0.00091154093,"teacher_disagreement_score":0.0061393604,"about_ca_system_score_codex":0.0005790852,"about_ca_system_score_gemma":0.00046172028,"threshold_uncertainty_score":0.03246838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8451159,0.0012250285,0.14235651,0.000778324,0.00035073014,0.0003335637,0.002243331,0.0012121061,0.0063844966],"genre_scores_gemma":[0.9754877,0.00037130367,0.01875486,0.00006333433,0.00013198282,0.000086395055,0.0013376619,0.0000450026,0.0037216248],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871874,0.00022722351,0.00012482231,0.00039150126,0.0003952277,0.0001424688],"domain_scores_gemma":[0.9916773,0.0040598065,0.0012195981,0.00071257964,0.001989866,0.00034085472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015951252,0.0013045477,0.0008704856,0.0037143396,0.0008007972,0.0013741571,0.0010781401,0.0011118954,0.0012043151],"category_scores_gemma":[0.009118953,0.0003293762,0.0008123542,0.0023337866,0.0003720912,0.003641126,0.0007332325,0.0013554759,0.0011306524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010579315,0.0010050554,0.57147324,0.00044498246,0.0005267291,0.001587156,0.0016065856,0.06890523,0.013109741,0.004827163,0.0094697345,0.32598644],"study_design_scores_gemma":[0.000016329119,0.00028812274,0.06461132,0.000038326343,0.00023570431,0.0006003631,0.0004795474,0.9194163,0.007119151,0.0042097312,0.0029055304,0.000079648475],"about_ca_topic_score_codex":0.00825264,"about_ca_topic_score_gemma":0.012449641,"teacher_disagreement_score":0.00825264,"about_ca_system_score_codex":0.0005203171,"about_ca_system_score_gemma":0.00047621617,"threshold_uncertainty_score":0.016409218},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7959024,0.00065825577,0.15569581,0.0025487153,0.000056654488,0.00008427739,0.00021618717,0.00009932652,0.044738356],"genre_scores_gemma":[0.9859272,0.00019303604,0.012525682,0.000055223165,0.0000150631895,0.00004271196,0.00010957393,0.00001210463,0.0011194269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988624,0.0006601771,0.000041783725,0.0001783802,0.00016314354,0.0000941697],"domain_scores_gemma":[0.9947937,0.0032099069,0.0010699752,0.00032965868,0.00033779247,0.0002589456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018786964,0.0002707511,0.00028454425,0.0020281582,0.0012117928,0.0026461163,0.0007019132,0.0008622881,0.0035777143],"category_scores_gemma":[0.012354397,0.00022932516,0.00033056436,0.0015549843,0.0023457399,0.006541704,0.0031923223,0.0011695548,0.00030639523],"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.00015846142,0.00017093991,0.08119117,0.0002758124,0.000110487264,0.0007669168,0.051675387,0.02230778,0.0030822046,0.74035245,0.003089836,0.096818425],"study_design_scores_gemma":[0.000026149743,0.0000750179,0.041567713,0.00014527449,0.00006749187,0.00046815106,0.04485562,0.14638393,0.0012170146,0.741416,0.023728611,0.000049038725],"about_ca_topic_score_codex":0.0034439496,"about_ca_topic_score_gemma":0.0035800578,"teacher_disagreement_score":0.0035777143,"about_ca_system_score_codex":0.0007876892,"about_ca_system_score_gemma":0.00040652117,"threshold_uncertainty_score":0.011968613},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01777263,0.004958639,0.35630247,0.0035571726,0.0018637095,0.0002912124,0.0032411988,0.006169366,0.6058436],"genre_scores_gemma":[0.3120295,0.0041360958,0.079875484,0.0010204244,0.0011147057,0.0006355985,0.0052121338,0.003167277,0.5928087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994148,0.000059041482,0.000017868995,0.0002052532,0.00022918952,0.00007379805],"domain_scores_gemma":[0.99902725,0.00014892046,0.0000575459,0.0002875474,0.00037518828,0.00010358855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050156086,0.0005614651,0.0007058679,0.0015932438,0.0016469832,0.0026090466,0.0013672861,0.0007241481,0.074106224],"category_scores_gemma":[0.0028865465,0.00039501427,0.00043074324,0.0014766691,0.0008982218,0.002434837,0.0019105977,0.0012309203,0.026010023],"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.00010225581,0.00003325223,0.0005639695,0.0002199175,0.000039261533,0.000074365744,0.00024472555,0.0093501,0.006612085,0.621754,0.19471432,0.16629177],"study_design_scores_gemma":[0.00002904819,0.00004429641,0.0014464566,0.000082254584,0.000025932166,0.0003758341,0.00021953598,0.05545843,0.0102204485,0.49476394,0.43728456,0.00004921675],"about_ca_topic_score_codex":0.002374286,"about_ca_topic_score_gemma":0.0026431922,"teacher_disagreement_score":0.074106224,"about_ca_system_score_codex":0.0018620269,"about_ca_system_score_gemma":0.0011612826,"threshold_uncertainty_score":0.24790996},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053067505,0.0027438598,0.9645952,0.00085466896,0.00061844365,0.00010969265,0.00049380877,0.0020193092,0.023258228],"genre_scores_gemma":[0.12976561,0.0036194262,0.7724389,0.000626476,0.0010400225,0.00024427177,0.0035645033,0.00147978,0.08722109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990349,0.00014581825,0.000029205512,0.00040333232,0.00032787872,0.00005891287],"domain_scores_gemma":[0.99838734,0.00059874647,0.00009425013,0.00034797285,0.0004619803,0.000109651584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011231904,0.0012111893,0.0009928657,0.002736678,0.0007761701,0.0019261397,0.0020130475,0.0014202143,0.0083270995],"category_scores_gemma":[0.005639239,0.00061651773,0.0007618422,0.0022412958,0.0008073147,0.0032565456,0.0021940533,0.0020574038,0.0060233446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000497826,0.00008134459,0.0008936538,0.00017420102,0.00006353977,0.000070772614,0.000121002595,0.03026072,0.0049007055,0.058965374,0.057348385,0.84707063],"study_design_scores_gemma":[0.000012480476,0.000046584322,0.0013903346,0.00009422442,0.000041308675,0.00048369475,0.00007830551,0.69440776,0.008461283,0.20510583,0.08982954,0.000048701975],"about_ca_topic_score_codex":0.0021019082,"about_ca_topic_score_gemma":0.0027302178,"teacher_disagreement_score":0.0083270995,"about_ca_system_score_codex":0.0009263553,"about_ca_system_score_gemma":0.00056708266,"threshold_uncertainty_score":0.027856886},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50629956,0.044943195,0.18084808,0.006455595,0.0006121464,0.00011571308,0.0018490739,0.0004969589,0.2583797],"genre_scores_gemma":[0.91380656,0.017405204,0.023488099,0.0002444148,0.00038829586,0.00008711107,0.00056443503,0.00010497624,0.043911006],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9996768,0.00013225894,0.00000915388,0.000052401065,0.00010656736,0.000022865144],"domain_scores_gemma":[0.9986051,0.0011349547,0.0000738284,0.00005334351,0.000086479595,0.0000464231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051314564,0.0002778799,0.00018424673,0.00081749103,0.0004136348,0.0015134232,0.00028958824,0.00043950535,0.0032877298],"category_scores_gemma":[0.00286494,0.00018750703,0.00018997102,0.0016347403,0.00038737513,0.0017861284,0.00037106464,0.0005071636,0.000669838],"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.00008218282,0.0002249561,0.07472801,0.00056728645,0.000128455,0.00021982736,0.0042490107,0.01695362,0.003866719,0.25968233,0.033102114,0.60619557],"study_design_scores_gemma":[0.000013038863,0.00016247574,0.19857371,0.00062507443,0.00020343509,0.001371307,0.006144116,0.18831442,0.003314309,0.43211642,0.16903698,0.00012468883],"about_ca_topic_score_codex":0.0030583546,"about_ca_topic_score_gemma":0.007242525,"teacher_disagreement_score":0.0032877298,"about_ca_system_score_codex":0.0004839199,"about_ca_system_score_gemma":0.00026380614,"threshold_uncertainty_score":0.010998547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021937154,0.009763515,0.3108533,0.004460986,0.0021565347,0.00008833468,0.0010351607,0.0008165358,0.6686319],"genre_scores_gemma":[0.077792674,0.028705075,0.108236484,0.0017974101,0.0030897262,0.00037479933,0.0028010083,0.00069452636,0.77650833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977833,0.000036991056,0.000008789304,0.000069287424,0.00009420941,0.000012477023],"domain_scores_gemma":[0.9996252,0.00016438773,0.000021160193,0.00007362033,0.00009048722,0.000025056417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028240323,0.0008554033,0.000368197,0.0012476132,0.00051900523,0.0021933457,0.00052186183,0.00062756863,0.045321375],"category_scores_gemma":[0.0017922156,0.00026518657,0.00027287795,0.0012072962,0.0007322368,0.0031106537,0.0011358827,0.0012442939,0.014959215],"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.0000062161375,0.000013036475,0.00009252964,0.000202573,0.000013097001,0.000038645845,0.00010565141,0.004555349,0.0006888746,0.6933814,0.11712288,0.18377969],"study_design_scores_gemma":[0.0000017489007,0.000005308465,0.00015194814,0.000102054415,0.000006356934,0.000096851145,0.000044097767,0.00522461,0.00040188883,0.49113008,0.50282633,0.000008710936],"about_ca_topic_score_codex":0.0006417897,"about_ca_topic_score_gemma":0.0009984043,"teacher_disagreement_score":0.045321375,"about_ca_system_score_codex":0.0007904024,"about_ca_system_score_gemma":0.0004892164,"threshold_uncertainty_score":0.15161508},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019039053,0.0026640636,0.9613157,0.0007073335,0.0004752913,0.00010148616,0.0015869203,0.0017562576,0.012353888],"genre_scores_gemma":[0.4884513,0.0058367816,0.46650103,0.00037244646,0.0010622669,0.0002819103,0.0051378426,0.0005858372,0.031770483],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999405,0.00012179127,0.000024615292,0.00017291155,0.00022858329,0.000046954585],"domain_scores_gemma":[0.9987606,0.000659296,0.000115663264,0.00022325912,0.0001787697,0.0000625946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005473979,0.0009306113,0.0008949097,0.0016903139,0.00049995066,0.0014706195,0.0010286538,0.00061114336,0.0027496298],"category_scores_gemma":[0.003393576,0.0003992394,0.0005964834,0.0023853057,0.0002990014,0.0025857806,0.0013105271,0.0010737993,0.0019370948],"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.00016921856,0.00025530462,0.00531839,0.0004482982,0.00017697984,0.00015774107,0.00042753303,0.0877803,0.021960137,0.06836778,0.034590337,0.78034806],"study_design_scores_gemma":[0.000006923509,0.00004423338,0.0038864976,0.000064820066,0.00005588068,0.00028980494,0.00016822877,0.8824437,0.006567596,0.079305485,0.02712232,0.000044429635],"about_ca_topic_score_codex":0.0014102658,"about_ca_topic_score_gemma":0.0025717667,"teacher_disagreement_score":0.0027496298,"about_ca_system_score_codex":0.000522806,"about_ca_system_score_gemma":0.0003439257,"threshold_uncertainty_score":0.009198427},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82486296,0.0062688584,0.089600034,0.0014463097,0.00019534325,0.00045670063,0.0036333425,0.002571948,0.070964515],"genre_scores_gemma":[0.86769885,0.0067347432,0.115340516,0.00011265194,0.000053146978,0.00042565638,0.0031028015,0.00028528477,0.0062464],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9991437,0.00044027768,0.000060851766,0.00009015205,0.00022635386,0.000038699363],"domain_scores_gemma":[0.9949986,0.0038577002,0.00021293234,0.0001786054,0.0006803945,0.00007186223],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0019370376,0.0003531725,0.00027306794,0.005738827,0.0005201217,0.0013641021,0.0002834912,0.00033788953,0.0022551173],"category_scores_gemma":[0.008895747,0.00016693572,0.00031452702,0.0045185266,0.00027305388,0.0014540338,0.00070257403,0.00024813757,0.0003906318],"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.00054269825,0.00028922298,0.12045088,0.0024911822,0.0001720559,0.00067119824,0.009569972,0.03461043,0.0062779337,0.04132494,0.012523722,0.7710758],"study_design_scores_gemma":[0.00009022264,0.00070497335,0.23238273,0.0029587606,0.0004176267,0.0013753552,0.022294197,0.48986357,0.015765922,0.026436685,0.20752619,0.00018369085],"about_ca_topic_score_codex":0.0076681017,"about_ca_topic_score_gemma":0.010554129,"teacher_disagreement_score":0.99806297,"about_ca_system_score_codex":0.0010442875,"about_ca_system_score_gemma":0.00084280176,"threshold_uncertainty_score":0.015246928},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004725673,0.015384284,0.8587992,0.0045898897,0.0017536794,0.00033789338,0.0041958313,0.0044389395,0.105774574],"genre_scores_gemma":[0.08204578,0.034331284,0.6473678,0.0012649865,0.0046002623,0.0008330169,0.013281428,0.0024697133,0.21380578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898404,0.00018368465,0.000056418852,0.00022662763,0.0005069041,0.000042212432],"domain_scores_gemma":[0.99815863,0.001109395,0.00007647557,0.00032379033,0.00027958985,0.000052084062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011108028,0.0013747881,0.00074941537,0.0055344165,0.0008754297,0.0036382831,0.0011632828,0.0008972723,0.013683441],"category_scores_gemma":[0.004404211,0.00054555706,0.0010516308,0.0055626878,0.0008642104,0.005009609,0.001924384,0.001443145,0.012698754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018708912,0.000059961993,0.000781596,0.00046760906,0.0000769145,0.0000659426,0.00031747104,0.0029879215,0.0019291461,0.08148956,0.09539353,0.8164116],"study_design_scores_gemma":[0.0000069579637,0.000021976763,0.0023190335,0.00037271503,0.00006195216,0.00037775896,0.00046542886,0.051642243,0.0059366496,0.36835855,0.57038414,0.000052540927],"about_ca_topic_score_codex":0.0011942885,"about_ca_topic_score_gemma":0.0022257925,"teacher_disagreement_score":0.013683441,"about_ca_system_score_codex":0.00064013485,"about_ca_system_score_gemma":0.0008063614,"threshold_uncertainty_score":0.045775652},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015596693,0.011669329,0.6390575,0.0076258066,0.0017716028,0.00018991502,0.0024039824,0.0006039327,0.3210812],"genre_scores_gemma":[0.39657423,0.030574452,0.27610174,0.0016047575,0.0035838787,0.0009831821,0.004506308,0.00043805444,0.28563336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943227,0.00018072575,0.000026661573,0.00014444099,0.0001875689,0.000028342743],"domain_scores_gemma":[0.99902,0.0005287103,0.00007764822,0.00017150622,0.00014652505,0.00005571593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005262039,0.00074913836,0.00039576585,0.0021014342,0.0008181951,0.00316359,0.0004896186,0.00071480824,0.013546568],"category_scores_gemma":[0.0031955692,0.00032361137,0.000397105,0.0025736303,0.00083493476,0.0042785495,0.002115342,0.001182446,0.0026482278],"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.000008010291,0.000014168572,0.00038572634,0.0001646794,0.00002592346,0.00004731098,0.00030555954,0.0054005645,0.00059635274,0.85919994,0.030582134,0.10326957],"study_design_scores_gemma":[0.0000027372403,0.000008296495,0.0006840886,0.00009723216,0.000013427581,0.00018997252,0.00026454715,0.024359485,0.00034980202,0.77745104,0.19656281,0.000016471158],"about_ca_topic_score_codex":0.00057076,"about_ca_topic_score_gemma":0.0008204636,"teacher_disagreement_score":0.013546568,"about_ca_system_score_codex":0.00077145017,"about_ca_system_score_gemma":0.0003406282,"threshold_uncertainty_score":0.04531777},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9509188,0.00017591608,0.039128087,0.00020708461,0.000012201509,0.00011413004,0.0008167883,0.000239803,0.008387168],"genre_scores_gemma":[0.9944634,0.0000849004,0.0045524547,0.000011933961,0.000006620684,0.000051566985,0.00027075477,0.000014529524,0.00054388953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993774,0.00024942233,0.00003326294,0.00010705149,0.0001741501,0.000058671296],"domain_scores_gemma":[0.9960084,0.0024029233,0.00051679055,0.00037529352,0.00052217074,0.00017427323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059789297,0.000215432,0.0002257564,0.0019639267,0.00053252233,0.00090709585,0.00030980902,0.00035486402,0.0012205649],"category_scores_gemma":[0.0058166934,0.00017982196,0.00019833619,0.0014278317,0.00044630663,0.0014103021,0.00040367045,0.00031193168,0.00014697881],"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.00034347313,0.00029551363,0.35586882,0.00030493698,0.00013335966,0.0012273045,0.0053182263,0.39679304,0.022812495,0.119634554,0.0047591324,0.092509165],"study_design_scores_gemma":[0.0000060693346,0.00006188998,0.09659259,0.000038165035,0.000021062688,0.0007439292,0.0013378183,0.87111485,0.005536157,0.01900511,0.0055090575,0.000033308806],"about_ca_topic_score_codex":0.0047462084,"about_ca_topic_score_gemma":0.0041247187,"teacher_disagreement_score":0.0047462084,"about_ca_system_score_codex":0.000833347,"about_ca_system_score_gemma":0.00029407378,"threshold_uncertainty_score":0.009437144},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005059286,0.0025866148,0.6383832,0.0026640028,0.00083013444,0.00013142351,0.0020793776,0.0008112443,0.3474548],"genre_scores_gemma":[0.16729227,0.014003403,0.23168051,0.00150969,0.0010487728,0.0006291827,0.0060301707,0.0006823968,0.5771237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975294,0.000050500796,0.00000953752,0.00009869262,0.00007088092,0.000017424967],"domain_scores_gemma":[0.99960417,0.00018645199,0.000022815084,0.000071164446,0.00008682275,0.000028612514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027137238,0.0006380484,0.00033538995,0.00126527,0.00061198155,0.001681847,0.00064026786,0.00066745916,0.029825576],"category_scores_gemma":[0.001788352,0.00025201464,0.00032648933,0.0013774309,0.00059473806,0.0026547457,0.0010322757,0.0010425856,0.0078099715],"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.000011387646,0.000016298756,0.00017032403,0.00014881136,0.000015234273,0.0000626703,0.00008812915,0.01184951,0.0009637483,0.7801336,0.054530177,0.15201022],"study_design_scores_gemma":[0.000004394242,0.000009877356,0.00020102502,0.00007766149,0.00001733467,0.00017743932,0.000063745974,0.029948343,0.0009950221,0.6330018,0.33548856,0.0000148534255],"about_ca_topic_score_codex":0.0014547186,"about_ca_topic_score_gemma":0.001834313,"teacher_disagreement_score":0.029825576,"about_ca_system_score_codex":0.0008725276,"about_ca_system_score_gemma":0.0005382787,"threshold_uncertainty_score":0.09977645},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020906671,0.0014876957,0.92549103,0.0011187003,0.00035710825,0.00011341102,0.0016438287,0.0012523856,0.0664451],"genre_scores_gemma":[0.107725985,0.009449666,0.6283503,0.0009961904,0.0011072281,0.000698336,0.010165635,0.0017238483,0.2397829],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944,0.00011460568,0.000021876132,0.00019393576,0.00019489265,0.000034583718],"domain_scores_gemma":[0.9989594,0.0004781084,0.000054510485,0.00021097566,0.00025966935,0.00003720491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007909615,0.0011226449,0.0006347247,0.0030898857,0.00070618687,0.0019454844,0.001028692,0.0006847709,0.024994923],"category_scores_gemma":[0.0037395235,0.00048554904,0.00090550433,0.0026227215,0.0006287927,0.0028071643,0.0012554216,0.0015095464,0.010507484],"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.000019811534,0.000043923978,0.00090787077,0.0002576619,0.00007871595,0.00008501286,0.00021378275,0.043149322,0.0019679663,0.3720091,0.10306029,0.47820657],"study_design_scores_gemma":[0.0000061303804,0.000016449723,0.0013334791,0.00015565874,0.000054736593,0.00022286265,0.00015265968,0.16202515,0.0027259155,0.6059888,0.22728279,0.000035318903],"about_ca_topic_score_codex":0.0026080257,"about_ca_topic_score_gemma":0.0036374382,"teacher_disagreement_score":0.024994923,"about_ca_system_score_codex":0.0011996141,"about_ca_system_score_gemma":0.00084911054,"threshold_uncertainty_score":0.08361632},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52895117,0.004291278,0.42486572,0.004244012,0.00011120419,0.00020225355,0.0013209207,0.0002892811,0.035724223],"genre_scores_gemma":[0.9328882,0.0029987968,0.055835173,0.0003016743,0.00019505215,0.00019221834,0.00093168905,0.00010110694,0.006556061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99918765,0.00038130308,0.000023326365,0.0002244744,0.00012958642,0.00005365205],"domain_scores_gemma":[0.98248243,0.01342953,0.0021368517,0.0009116903,0.0006316754,0.0004078395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012038328,0.00042650374,0.00044388862,0.0019389625,0.00095395115,0.0023933481,0.0009049398,0.0015342296,0.0029947204],"category_scores_gemma":[0.012145929,0.0005191596,0.00043740842,0.002586269,0.0017549887,0.0066900114,0.0010211505,0.0012860739,0.0004968887],"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.00019431143,0.00029608447,0.046995386,0.00077843666,0.00022471878,0.0012358757,0.0031084686,0.13352768,0.0116104325,0.70128,0.009317569,0.09143105],"study_design_scores_gemma":[0.000021801232,0.000072142044,0.0149436435,0.00012924794,0.00006685858,0.0007417093,0.0010646896,0.5585211,0.0017947621,0.4107005,0.011901754,0.00004185611],"about_ca_topic_score_codex":0.0022179794,"about_ca_topic_score_gemma":0.0020494275,"teacher_disagreement_score":0.0029947204,"about_ca_system_score_codex":0.0015331564,"about_ca_system_score_gemma":0.00046046893,"threshold_uncertainty_score":0.011123836},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006928885,0.00034251908,0.9900525,0.0007700934,0.000042182288,0.000075998534,0.00046581723,0.00013503134,0.0011869445],"genre_scores_gemma":[0.53855014,0.0032323634,0.4414366,0.0011143878,0.00071764266,0.0017497204,0.0029127863,0.00034327508,0.00994312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951088,0.0027733704,0.0002230844,0.0009870337,0.0006570254,0.00025054417],"domain_scores_gemma":[0.93065184,0.058056794,0.0046915687,0.0036945024,0.002122663,0.00078264944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016742278,0.0015770715,0.0022745933,0.0035619705,0.0010938873,0.0030465848,0.005856584,0.0028494773,0.0052442043],"category_scores_gemma":[0.08660554,0.0017424271,0.0021759237,0.0035611806,0.0046727317,0.0069770473,0.0032142103,0.0045258035,0.0008595958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003925929,0.000038730403,0.0027211434,0.00014081606,0.00008747839,0.00013475865,0.0002703332,0.3483984,0.00026779852,0.6365859,0.0024774554,0.008837933],"study_design_scores_gemma":[0.000009751971,0.000008326449,0.00022769107,0.000024671936,0.000010469194,0.00003151135,0.000024148587,0.80978227,0.000083323706,0.1889749,0.000810871,0.000012150282],"about_ca_topic_score_codex":0.008167033,"about_ca_topic_score_gemma":0.0072364113,"teacher_disagreement_score":0.016742278,"about_ca_system_score_codex":0.0039336877,"about_ca_system_score_gemma":0.0017758462,"threshold_uncertainty_score":0.08854264},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1648256,0.0014900306,0.8074304,0.0016584005,0.00029403158,0.00015140112,0.0006833134,0.00033091978,0.023135923],"genre_scores_gemma":[0.93420357,0.00095350924,0.037608944,0.00033548241,0.00016516307,0.00023116771,0.0003104413,0.000120565135,0.02607121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984944,0.0005490294,0.0000454533,0.00029791737,0.00027818093,0.0003349824],"domain_scores_gemma":[0.9969457,0.0016746212,0.00041228556,0.00022463943,0.00037782395,0.00036498552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019868105,0.0011195121,0.0016894403,0.0005856912,0.001031425,0.0021185027,0.0028956379,0.0023659202,0.0055026864],"category_scores_gemma":[0.006224993,0.0007420906,0.0010427724,0.0010654675,0.0019120151,0.0033769896,0.0016307225,0.002139297,0.0007203398],"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.0001519552,0.00007951438,0.00056721247,0.000090112175,0.000032910917,0.00035590056,0.00020640438,0.581468,0.0015592655,0.4090697,0.0018660399,0.0045530777],"study_design_scores_gemma":[0.000022831264,0.000026355525,0.00008945504,0.000006039457,0.000009033587,0.000037758593,0.000039105926,0.94967675,0.00011926936,0.049155377,0.00080550095,0.000012460967],"about_ca_topic_score_codex":0.008645412,"about_ca_topic_score_gemma":0.0060270685,"teacher_disagreement_score":0.008645412,"about_ca_system_score_codex":0.0024250352,"about_ca_system_score_gemma":0.001222557,"threshold_uncertainty_score":0.018408358},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013154226,0.0007852934,0.9834179,0.00021695574,0.000063320615,0.000069900016,0.00031399966,0.0012934674,0.0006849193],"genre_scores_gemma":[0.20113419,0.0017233051,0.7890225,0.00011725126,0.0003457471,0.00044026432,0.00268393,0.00020545724,0.0043273014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987872,0.00028064888,0.00012280932,0.00031193334,0.0004136132,0.000083809246],"domain_scores_gemma":[0.9964503,0.0014596961,0.00045542023,0.000844248,0.0006793071,0.00011096313],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.001117271,0.0009344064,0.0012090661,0.0050232564,0.0007067608,0.0018606216,0.0012931493,0.0008522625,0.0027064288],"category_scores_gemma":[0.0058737965,0.00031293012,0.0012671731,0.0078042313,0.000513659,0.0030075468,0.0018422033,0.0013294454,0.0018305713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019562483,0.00024603162,0.0017854949,0.00024476083,0.00014644749,0.00011897585,0.0003331026,0.0563229,0.013468417,0.011713677,0.0054033124,0.9100213],"study_design_scores_gemma":[0.000046520847,0.00014701369,0.0018137752,0.000031279207,0.00006625169,0.00026208424,0.00026446674,0.94584763,0.0072593023,0.03665989,0.007567206,0.000034674078],"about_ca_topic_score_codex":0.0021531333,"about_ca_topic_score_gemma":0.0033571431,"teacher_disagreement_score":0.99497676,"about_ca_system_score_codex":0.0005399542,"about_ca_system_score_gemma":0.0010262257,"threshold_uncertainty_score":0.009053946},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055388254,0.0017739324,0.85781413,0.0025854157,0.0006479305,0.00030459723,0.0034932047,0.0019103105,0.1259317],"genre_scores_gemma":[0.20206831,0.007320419,0.54751307,0.00086796633,0.00094620883,0.0008707363,0.015194553,0.0007909193,0.22442783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995167,0.000121970064,0.000024828782,0.00013519215,0.00016838049,0.000032948174],"domain_scores_gemma":[0.99951017,0.00015900115,0.00003070616,0.00015794339,0.00011695958,0.000025119423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061772356,0.00065655494,0.00042577944,0.0022309495,0.0007468239,0.0022440848,0.00088781764,0.00063897274,0.01704773],"category_scores_gemma":[0.0027462977,0.00027969718,0.0006671841,0.0024414107,0.0004793676,0.0036199687,0.001446768,0.00105319,0.005769963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020415962,0.00005041543,0.0004981156,0.00017921973,0.000035725425,0.00006154137,0.0002461399,0.015964936,0.0015782546,0.45105508,0.0723641,0.457946],"study_design_scores_gemma":[0.0000068288055,0.000015282509,0.00089895056,0.00014559056,0.00003932848,0.00021176251,0.00027033963,0.15195124,0.002250964,0.52723986,0.31694022,0.000029667815],"about_ca_topic_score_codex":0.0030428579,"about_ca_topic_score_gemma":0.0035179448,"teacher_disagreement_score":0.01704773,"about_ca_system_score_codex":0.0010183238,"about_ca_system_score_gemma":0.0007804199,"threshold_uncertainty_score":0.05703032},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036822066,0.0005257943,0.95326954,0.0004149872,0.00038486795,0.0006363987,0.002409137,0.0018345691,0.0037025718],"genre_scores_gemma":[0.29264626,0.0009158418,0.6858983,0.00018330046,0.00069822365,0.00091355026,0.00871862,0.0005152369,0.009510623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998727,0.0002308957,0.0001023854,0.00039005792,0.00040840078,0.00014125157],"domain_scores_gemma":[0.99729794,0.0007874283,0.0003027148,0.00035108396,0.0011436796,0.00011718138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011725549,0.0013065776,0.0010657203,0.0054969564,0.0014148443,0.0021835172,0.00149688,0.0009257871,0.0025088906],"category_scores_gemma":[0.005557275,0.0004816715,0.0013299893,0.0044108965,0.0005032111,0.001837696,0.0010721387,0.0009867332,0.002082191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014355312,0.00052248995,0.022237279,0.0009424325,0.0004963522,0.00063885684,0.0018320312,0.1916198,0.034229565,0.040191196,0.033314127,0.67254037],"study_design_scores_gemma":[0.000056404264,0.0001404926,0.00574959,0.00007333345,0.00010684934,0.0002546716,0.0007835704,0.905982,0.017359065,0.036047734,0.033380657,0.00006559171],"about_ca_topic_score_codex":0.0054614786,"about_ca_topic_score_gemma":0.0063810246,"teacher_disagreement_score":0.0054969564,"about_ca_system_score_codex":0.0012989461,"about_ca_system_score_gemma":0.0011784335,"threshold_uncertainty_score":0.01085937},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21831699,0.0018284951,0.73465997,0.0060411165,0.0002286518,0.0001347653,0.00040904255,0.00051465014,0.0378663],"genre_scores_gemma":[0.9560941,0.0011156916,0.028243143,0.00049424684,0.00021320331,0.00018960997,0.00013299251,0.00007515597,0.013441892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937075,0.00024188655,0.000020436319,0.00012654715,0.0001590979,0.00008126893],"domain_scores_gemma":[0.99714667,0.0016559211,0.00039521983,0.0002652811,0.00020855779,0.00032825986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001259828,0.0004810429,0.0009449205,0.0012306724,0.0010991148,0.0020652707,0.0026649488,0.0024852692,0.0031024448],"category_scores_gemma":[0.0052709035,0.00048082217,0.0007837987,0.0009392326,0.0029080897,0.004297139,0.0016066962,0.0016972156,0.00081030733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036780628,0.00006138614,0.00080282934,0.000050472136,0.000026551052,0.00027357542,0.00024950743,0.10310564,0.0005793056,0.8893774,0.0020976537,0.0033388662],"study_design_scores_gemma":[0.000045308676,0.000025222958,0.00021092998,0.000016263515,0.0000150448495,0.0001167886,0.00005349277,0.5813934,0.0000621231,0.41650704,0.0015349706,0.000019442208],"about_ca_topic_score_codex":0.00313966,"about_ca_topic_score_gemma":0.0018910851,"teacher_disagreement_score":0.00313966,"about_ca_system_score_codex":0.0010521335,"about_ca_system_score_gemma":0.00066873035,"threshold_uncertainty_score":0.010378718},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78883874,0.0010250537,0.1990257,0.0007292146,0.000038445472,0.00008988866,0.0005603846,0.00028523165,0.0094073415],"genre_scores_gemma":[0.98882675,0.0002927478,0.00915988,0.000068675974,0.000031878262,0.00005134448,0.00019774918,0.00003580234,0.0013353667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792236,0.00079940853,0.00006219529,0.00053632836,0.0003795968,0.00030012746],"domain_scores_gemma":[0.97462565,0.018651595,0.0031813956,0.0018406003,0.00087117054,0.00082958746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019549867,0.00077569846,0.0007539849,0.0019632566,0.0011458271,0.002112413,0.0018715648,0.001144136,0.0026989537],"category_scores_gemma":[0.020464433,0.0005490488,0.00069446664,0.001275744,0.0023256582,0.0036509582,0.0018526528,0.0011794526,0.00019755217],"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.00032445096,0.00014570651,0.022124315,0.00022799474,0.00016117908,0.00029265502,0.00068212085,0.80526906,0.008071634,0.13658838,0.0022276742,0.023884863],"study_design_scores_gemma":[0.000013581593,0.000046526297,0.002324184,0.000023000666,0.000013986898,0.00011373539,0.000092877366,0.9196558,0.0017782389,0.07477502,0.0011437509,0.000019315932],"about_ca_topic_score_codex":0.0042503225,"about_ca_topic_score_gemma":0.004520996,"teacher_disagreement_score":0.0042503225,"about_ca_system_score_codex":0.0029264605,"about_ca_system_score_gemma":0.0005998983,"threshold_uncertainty_score":0.021233022},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050837765,0.00042206224,0.6241202,0.0019303947,0.0006155842,0.0003974391,0.012782235,0.0026597537,0.35198864],"genre_scores_gemma":[0.16951865,0.0034977654,0.34814355,0.0010556108,0.00036489562,0.001448206,0.026429009,0.0011743761,0.44836798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960274,0.00007692762,0.000019200386,0.00015146351,0.00011709496,0.00003257296],"domain_scores_gemma":[0.99937636,0.0002250598,0.00004011633,0.000086947206,0.00022108194,0.00005038976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032955117,0.00055888516,0.00030126274,0.0016232058,0.00068817375,0.001879258,0.0007184809,0.00077120797,0.10188507],"category_scores_gemma":[0.0021348505,0.00025823456,0.00040845253,0.0013391962,0.00038739876,0.002999719,0.0009375259,0.00081172405,0.020126404],"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.00005229319,0.000030466357,0.0005185901,0.00026532635,0.000016182828,0.00023548944,0.00019885857,0.014583557,0.0025099737,0.78787297,0.08461857,0.1090978],"study_design_scores_gemma":[0.000017882794,0.00001793309,0.00039266542,0.00010194406,0.000019898014,0.0002824611,0.00012826282,0.03210734,0.001481124,0.29638222,0.66905105,0.000017290151],"about_ca_topic_score_codex":0.0036931266,"about_ca_topic_score_gemma":0.0039288634,"teacher_disagreement_score":0.10188507,"about_ca_system_score_codex":0.00085424184,"about_ca_system_score_gemma":0.0008644925,"threshold_uncertainty_score":0.34083956},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021714889,0.0029821857,0.84030235,0.00393565,0.0007176578,0.00011368105,0.0013967276,0.0006942113,0.12814263],"genre_scores_gemma":[0.49655545,0.009074733,0.26355758,0.00096292497,0.0015513701,0.00041398796,0.0027890794,0.0003893347,0.22470546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963653,0.00009870287,0.000017241055,0.00010446408,0.000113495844,0.000029566048],"domain_scores_gemma":[0.9991548,0.0004199451,0.00006665218,0.00014266631,0.00015538164,0.000060439488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005260497,0.0005248939,0.00033496894,0.0012568681,0.0005849286,0.0016448011,0.00045022162,0.00057028496,0.008968002],"category_scores_gemma":[0.0032490473,0.00030030755,0.00038103445,0.0010784315,0.0005874918,0.0031145953,0.0011863456,0.0009845814,0.0019812228],"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.000024890458,0.000029933908,0.0007758304,0.00019244397,0.000056426416,0.00007881226,0.0002541802,0.024832075,0.0014855702,0.7677207,0.028777184,0.17577201],"study_design_scores_gemma":[0.000004002382,0.000014497057,0.0011605788,0.00006904797,0.000033998193,0.00014324725,0.00009376786,0.10934384,0.00086467405,0.79130393,0.096946284,0.00002202503],"about_ca_topic_score_codex":0.0012861773,"about_ca_topic_score_gemma":0.0019581898,"teacher_disagreement_score":0.008968002,"about_ca_system_score_codex":0.00081479,"about_ca_system_score_gemma":0.00038475214,"threshold_uncertainty_score":0.030000925},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9509188,0.00017591608,0.039128087,0.00020708461,0.000012201509,0.00011413004,0.0008167883,0.000239803,0.008387168],"genre_scores_gemma":[0.9944634,0.0000849004,0.0045524547,0.000011933961,0.000006620684,0.000051566985,0.00027075477,0.000014529524,0.00054388953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993774,0.00024942233,0.00003326294,0.00010705149,0.0001741501,0.000058671296],"domain_scores_gemma":[0.9960084,0.0024029233,0.00051679055,0.00037529352,0.00052217074,0.00017427323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059789297,0.000215432,0.0002257564,0.0019639267,0.00053252233,0.00090709585,0.00030980902,0.00035486402,0.0012205649],"category_scores_gemma":[0.0058166934,0.00017982196,0.00019833619,0.0014278317,0.00044630663,0.0014103021,0.00040367045,0.00031193168,0.00014697881],"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.00034347313,0.00029551363,0.35586882,0.00030493698,0.00013335966,0.0012273045,0.0053182263,0.39679304,0.022812495,0.119634554,0.0047591324,0.092509165],"study_design_scores_gemma":[0.0000060693346,0.00006188998,0.09659259,0.000038165035,0.000021062688,0.0007439292,0.0013378183,0.87111485,0.005536157,0.01900511,0.0055090575,0.000033308806],"about_ca_topic_score_codex":0.0047462084,"about_ca_topic_score_gemma":0.0041247187,"teacher_disagreement_score":0.0047462084,"about_ca_system_score_codex":0.000833347,"about_ca_system_score_gemma":0.00029407378,"threshold_uncertainty_score":0.009437144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023917012,0.0007328879,0.9623517,0.00071669684,0.0001164412,0.000665494,0.0055693714,0.0036209587,0.0023093903],"genre_scores_gemma":[0.18031031,0.00048013622,0.8072244,0.00021530723,0.00008964313,0.0010059078,0.008670269,0.00018184973,0.0018221629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799997,0.0007238579,0.00017016358,0.00053172035,0.00046114463,0.00011322394],"domain_scores_gemma":[0.99674124,0.0015736435,0.00047621652,0.00063805666,0.00040978365,0.00016097963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025853799,0.001461712,0.0010195689,0.0045709712,0.0011437633,0.0013287214,0.0024917,0.0013583059,0.0020647754],"category_scores_gemma":[0.011973282,0.0005424331,0.0018074283,0.0035646916,0.00060224417,0.0029316943,0.0020784491,0.0016218795,0.0016128761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041704654,0.0009061078,0.03911533,0.0017855137,0.00065927376,0.00086147274,0.0022786227,0.11249273,0.012589001,0.09047933,0.05404034,0.6843752],"study_design_scores_gemma":[0.00004454434,0.00010111031,0.004092276,0.00008668571,0.00006709818,0.00043986127,0.0005178294,0.9034165,0.0031508475,0.06897037,0.019080313,0.000032663702],"about_ca_topic_score_codex":0.0031440507,"about_ca_topic_score_gemma":0.007151454,"teacher_disagreement_score":0.0045709712,"about_ca_system_score_codex":0.000804578,"about_ca_system_score_gemma":0.0012067012,"threshold_uncertainty_score":0.013672948},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005198296,0.0024535784,0.96572846,0.0007232043,0.00049365306,0.00010048384,0.0004234237,0.0018003652,0.023078501],"genre_scores_gemma":[0.12251002,0.0031989783,0.78167176,0.0005384068,0.0007749819,0.00021703266,0.0030659726,0.001281682,0.0867412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912566,0.00013411869,0.000026978742,0.00034804046,0.00031085216,0.00005433472],"domain_scores_gemma":[0.99862695,0.0005074626,0.00007990164,0.00029464968,0.00040192765,0.00008918068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010296263,0.0011395845,0.00094634417,0.002657459,0.0007531321,0.0017528957,0.0019403165,0.001302155,0.0079932865],"category_scores_gemma":[0.004811928,0.000597357,0.0007135464,0.0021759528,0.0007762297,0.0029989546,0.002030904,0.0018431715,0.005406113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041751457,0.0000713306,0.00084805925,0.00014785894,0.00005545932,0.00006618819,0.0001166598,0.02966284,0.004692282,0.05282882,0.05124514,0.8602236],"study_design_scores_gemma":[0.000011759444,0.000043848966,0.0014272972,0.00008923496,0.00003953472,0.0005038192,0.00008443981,0.710473,0.009069096,0.19131473,0.08689454,0.000048608],"about_ca_topic_score_codex":0.0022669241,"about_ca_topic_score_gemma":0.0031169916,"teacher_disagreement_score":0.0079932865,"about_ca_system_score_codex":0.0008789343,"about_ca_system_score_gemma":0.00054490543,"threshold_uncertainty_score":0.026740193},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081623215,0.0019336895,0.13950776,0.0051060915,0.001183428,0.00030142826,0.004244806,0.0011509334,0.83840954],"genre_scores_gemma":[0.16153057,0.0065334938,0.051439986,0.0012356776,0.0014163278,0.00063447026,0.0074794167,0.000472959,0.769257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995726,0.00010735706,0.000015060878,0.000111827074,0.00016149237,0.000031719803],"domain_scores_gemma":[0.99949396,0.00018238284,0.000038870527,0.0001052443,0.00012776774,0.000051828923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038899615,0.0005466929,0.00025309098,0.0019333776,0.0010444407,0.0022746832,0.0006244795,0.00076435826,0.06618334],"category_scores_gemma":[0.0022771854,0.00018847497,0.00029824322,0.0019841243,0.00052524154,0.004078733,0.0016228333,0.0006399579,0.020112975],"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.000022453227,0.00003722753,0.0006309495,0.00023038306,0.000022375565,0.00013022342,0.00042819398,0.002778493,0.0014322248,0.5670408,0.16320574,0.26404086],"study_design_scores_gemma":[0.000004379499,0.000014886468,0.00067827513,0.00008464911,0.000013113167,0.00024143994,0.00031364485,0.007464746,0.00067603943,0.16347967,0.8270148,0.000014305859],"about_ca_topic_score_codex":0.0013939622,"about_ca_topic_score_gemma":0.0020081983,"teacher_disagreement_score":0.06618334,"about_ca_system_score_codex":0.0008150847,"about_ca_system_score_gemma":0.00053487456,"threshold_uncertainty_score":0.22140533},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39601868,0.0040663737,0.5814797,0.001987915,0.00015230545,0.0002908072,0.002319625,0.0006368202,0.013047759],"genre_scores_gemma":[0.93092966,0.0017581289,0.06381506,0.00012331683,0.00045270365,0.00026448083,0.0012565283,0.000094875184,0.0013052756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99218583,0.0043726545,0.00042267755,0.0013919532,0.0012561046,0.0003706486],"domain_scores_gemma":[0.8566967,0.1279502,0.006586222,0.005182182,0.0022169075,0.0013676753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006841117,0.0011385595,0.0015387762,0.0068110595,0.0012294005,0.0028608197,0.0013069354,0.0015496691,0.0019406418],"category_scores_gemma":[0.068067,0.00047964507,0.0011713571,0.007308664,0.002687864,0.0072846627,0.0022391875,0.0013960885,0.00061828806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074945576,0.00079921255,0.22561625,0.0009678143,0.0011380829,0.0004383025,0.0027690819,0.2014754,0.008272702,0.18122044,0.0048123905,0.37174088],"study_design_scores_gemma":[0.000032098407,0.0003919026,0.053305164,0.00019852078,0.00020559785,0.0006354628,0.00067799084,0.77764857,0.0030588177,0.15999411,0.0037555627,0.00009614598],"about_ca_topic_score_codex":0.0038511555,"about_ca_topic_score_gemma":0.0027769133,"teacher_disagreement_score":0.006841117,"about_ca_system_score_codex":0.0011977159,"about_ca_system_score_gemma":0.00068812683,"threshold_uncertainty_score":0.03617972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024619072,0.0004106884,0.9856204,0.0013429929,0.00013342207,0.00023358336,0.0016938805,0.0005501502,0.0075529413],"genre_scores_gemma":[0.11390438,0.0013529633,0.8691716,0.00083018944,0.00030111716,0.0012224765,0.0064925267,0.00026370873,0.006461087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960303,0.0014314718,0.00051326636,0.000682333,0.0011459399,0.00019667397],"domain_scores_gemma":[0.99738115,0.0010166035,0.00029466263,0.0005267321,0.0005905582,0.00019032817],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0037958152,0.0009848953,0.0008764597,0.005471661,0.0020954262,0.0044909464,0.0022295627,0.0019563343,0.004347892],"category_scores_gemma":[0.008821961,0.0004912658,0.0026640072,0.0072729476,0.0020985624,0.012586015,0.0031764053,0.0024779425,0.0018159291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022666154,0.000049256894,0.0004620204,0.00010760972,0.000031833042,0.00015284904,0.0005786391,0.011235408,0.0004827809,0.95445025,0.006652215,0.025774546],"study_design_scores_gemma":[0.000014210597,0.000018089202,0.00024878455,0.00008321184,0.00003954913,0.00019694805,0.00044310477,0.13989569,0.0005481671,0.7867296,0.07175048,0.00003217334],"about_ca_topic_score_codex":0.0081688175,"about_ca_topic_score_gemma":0.0077315276,"teacher_disagreement_score":0.99452835,"about_ca_system_score_codex":0.0028777842,"about_ca_system_score_gemma":0.0031266862,"threshold_uncertainty_score":0.020879924},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0945348,0.00033011378,0.90131557,0.00035085945,0.00003816442,0.00008800964,0.0007267665,0.000566235,0.0020495148],"genre_scores_gemma":[0.7145822,0.0005183798,0.28003186,0.000059136564,0.000030737367,0.00013560022,0.0011526811,0.0000622894,0.0034269826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995247,0.00019276245,0.000017537675,0.00011346886,0.000106425425,0.000045111174],"domain_scores_gemma":[0.99846387,0.0010581365,0.00010935087,0.00014771796,0.00018379276,0.00003717483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093565497,0.0005359437,0.00053911516,0.00085442007,0.0004368332,0.00059246254,0.0006437132,0.00049183134,0.0009835595],"category_scores_gemma":[0.0048423987,0.00029886572,0.00067466,0.0011701041,0.00030991834,0.0008204765,0.00050742325,0.0012521949,0.00060335244],"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.00008782447,0.000074724056,0.014162112,0.00009420078,0.000104764666,0.00006368166,0.0002021039,0.85717905,0.0021096806,0.006917713,0.0017889531,0.117215246],"study_design_scores_gemma":[0.0000059303943,0.000019931957,0.0016684702,0.000010509154,0.000012382916,0.000021232578,0.00003474614,0.99175316,0.00090711715,0.0047867224,0.00077318976,0.000006593856],"about_ca_topic_score_codex":0.017520964,"about_ca_topic_score_gemma":0.024399042,"teacher_disagreement_score":0.017520964,"about_ca_system_score_codex":0.00055549503,"about_ca_system_score_gemma":0.0009330737,"threshold_uncertainty_score":0.03483796},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045442157,0.0060614794,0.8902962,0.0038729445,0.0009791893,0.00008659572,0.0015011766,0.0014119374,0.091246344],"genre_scores_gemma":[0.27476314,0.033077493,0.4876784,0.0018536838,0.0038567365,0.0007511004,0.008392227,0.0017883542,0.18783888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995685,0.00008933136,0.000017276254,0.0001673483,0.00013736935,0.000020099375],"domain_scores_gemma":[0.99864954,0.0007860265,0.000062127285,0.00030061408,0.00014197784,0.000059626844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006755875,0.00097498856,0.0006274625,0.0014254493,0.00056427764,0.0024269025,0.0009790382,0.0009234744,0.014134681],"category_scores_gemma":[0.0045505376,0.00053817563,0.0006452122,0.002063468,0.00097605464,0.005451888,0.0019719163,0.0021711448,0.0043492094],"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.00001900818,0.00002527394,0.000440009,0.0003235225,0.00007387449,0.00009784447,0.00013168823,0.04414406,0.0015048035,0.7230994,0.062928624,0.167212],"study_design_scores_gemma":[0.0000042079296,0.000007575235,0.00036184516,0.000057011886,0.000019896095,0.00011922149,0.000039173716,0.07999504,0.0005289259,0.8218173,0.09703461,0.00001527877],"about_ca_topic_score_codex":0.0010770638,"about_ca_topic_score_gemma":0.0015628932,"teacher_disagreement_score":0.014134681,"about_ca_system_score_codex":0.00095748686,"about_ca_system_score_gemma":0.0005415889,"threshold_uncertainty_score":0.0472852},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5271433,0.0017477006,0.4385408,0.0011035422,0.0001449057,0.0007937464,0.006510104,0.0041232207,0.019892689],"genre_scores_gemma":[0.93641406,0.0005484418,0.05763129,0.000059185804,0.00009030336,0.00019432668,0.003174693,0.00009532325,0.0017923353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986558,0.00038017804,0.000069126516,0.00025429434,0.0005394942,0.000100993995],"domain_scores_gemma":[0.9960588,0.0023757282,0.0005661233,0.00025359145,0.00057396403,0.00017176179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009306357,0.0009969728,0.00072683,0.00794841,0.0007391949,0.0019197079,0.0008435947,0.00062780466,0.0016184257],"category_scores_gemma":[0.0059170686,0.00026481866,0.0007545319,0.004153257,0.0005254689,0.0020616965,0.0009668293,0.00065635506,0.00073170697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008795011,0.0011092322,0.19525868,0.0013809563,0.0008993817,0.002301224,0.0030064352,0.21756999,0.033818472,0.06580392,0.020237112,0.45773515],"study_design_scores_gemma":[0.000020742447,0.00012345413,0.028407028,0.000052854863,0.00010827545,0.00033821614,0.0012062574,0.9295359,0.007124096,0.024343925,0.008687359,0.000051920524],"about_ca_topic_score_codex":0.0057930024,"about_ca_topic_score_gemma":0.0069226585,"teacher_disagreement_score":0.00794841,"about_ca_system_score_codex":0.00064004393,"about_ca_system_score_gemma":0.00051831314,"threshold_uncertainty_score":0.011518598},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012111524,0.0009789653,0.020540223,0.002830124,0.0044302917,0.0005369745,0.059339188,0.011089343,0.8990438],"genre_scores_gemma":[0.002980669,0.00073303166,0.004831517,0.00047666446,0.00086441945,0.00021362302,0.028024366,0.001966181,0.9599095],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926466,0.00011671771,0.000045789773,0.00011765502,0.00040193007,0.00005327347],"domain_scores_gemma":[0.99728715,0.00053867855,0.00010773108,0.00046149935,0.0011517922,0.000453199],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006630882,0.0012680938,0.0012919824,0.003559132,0.0012141954,0.00445132,0.0013678761,0.0011285648,0.78607094],"category_scores_gemma":[0.006848547,0.00035182392,0.00044293358,0.0056778844,0.00042738448,0.0033073938,0.001814215,0.0011645012,0.69022644],"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.000016894192,0.000026540352,0.000090310845,0.00007209285,0.0000021408453,0.000014616927,0.000010235507,0.00020901281,0.00017977542,0.0023629027,0.9369473,0.06006807],"study_design_scores_gemma":[0.000017060682,0.000016169468,0.00041331293,0.000082797735,0.0000052108117,0.000040911546,0.000026696142,0.0014355361,0.00038515302,0.0049655978,0.99260134,0.000010159651],"about_ca_topic_score_codex":0.004070478,"about_ca_topic_score_gemma":0.0058855168,"teacher_disagreement_score":0.21392906,"about_ca_system_score_codex":0.0013177634,"about_ca_system_score_gemma":0.0012609643,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7931405,0.00059467886,0.19981134,0.0011225615,0.000042934433,0.00014578861,0.00083486905,0.00044070813,0.0038667184],"genre_scores_gemma":[0.9732999,0.0001544008,0.025939286,0.00004163964,0.000026903834,0.00006161063,0.00022561823,0.00002447406,0.00022615699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983005,0.0008550458,0.00008870806,0.00034079197,0.00032540376,0.000089633024],"domain_scores_gemma":[0.97093517,0.021469759,0.003224441,0.002719686,0.0010556465,0.00059540366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002680421,0.0006330265,0.0005961535,0.0019266282,0.0007022805,0.00199359,0.00057573523,0.00078270526,0.0010508692],"category_scores_gemma":[0.03522533,0.0003917726,0.00066360785,0.0014100557,0.0013691384,0.0044622435,0.0012230129,0.0011015623,0.00021029214],"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.00079035264,0.00069062517,0.2038435,0.0006215057,0.00055163534,0.00033433334,0.0026249685,0.52044225,0.016846687,0.14140783,0.0042488496,0.10759744],"study_design_scores_gemma":[0.000023131903,0.00012343847,0.01572362,0.000035272984,0.00003263755,0.00019411839,0.000254757,0.8925161,0.0020589824,0.088123225,0.00085899443,0.000055721124],"about_ca_topic_score_codex":0.002080029,"about_ca_topic_score_gemma":0.0019399871,"teacher_disagreement_score":0.002680421,"about_ca_system_score_codex":0.0011919348,"about_ca_system_score_gemma":0.0004981986,"threshold_uncertainty_score":0.014175594},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005105562,0.00039940857,0.61867255,0.0018045306,0.0005523807,0.00036824693,0.011410304,0.002437698,0.35924926],"genre_scores_gemma":[0.16825293,0.0032440003,0.34384295,0.0009976018,0.00033084984,0.0013372031,0.023302628,0.001104982,0.45758677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962103,0.000075010226,0.000018426592,0.00014235402,0.00011167209,0.000031508956],"domain_scores_gemma":[0.9994073,0.0002151179,0.000038598948,0.00008307862,0.00020781811,0.000048124424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003104992,0.00053588394,0.00029577714,0.001574981,0.0006948258,0.0018266793,0.00069955084,0.0007477632,0.0984035],"category_scores_gemma":[0.0019949158,0.00025631857,0.00039320337,0.00133096,0.00038998065,0.0029591126,0.00091470825,0.0007991913,0.019068863],"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.000047165675,0.0000280782,0.00049817906,0.00023754116,0.000015191681,0.00023220587,0.00020057583,0.013351227,0.0024553875,0.7973816,0.07970186,0.10585101],"study_design_scores_gemma":[0.00001691422,0.000016807147,0.0003937326,0.000096358934,0.000018895234,0.00029620584,0.00013580457,0.03060147,0.0014682022,0.30320373,0.66373485,0.000017111004],"about_ca_topic_score_codex":0.003780262,"about_ca_topic_score_gemma":0.0041342527,"teacher_disagreement_score":0.0984035,"about_ca_system_score_codex":0.0008463254,"about_ca_system_score_gemma":0.0008313563,"threshold_uncertainty_score":0.32919252},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011883662,0.0009501931,0.7333238,0.0015090519,0.0006203895,0.000452596,0.041446622,0.07135538,0.14915343],"genre_scores_gemma":[0.020697296,0.0033168474,0.5477373,0.0011568518,0.0007830089,0.0026046527,0.08773857,0.031219697,0.30474582],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988009,0.0002790221,0.000077039695,0.00024261195,0.0005185801,0.00008187744],"domain_scores_gemma":[0.996887,0.001378655,0.00014009053,0.0007560074,0.00070832623,0.0001298909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016533501,0.0021449826,0.0011501713,0.005692856,0.0009967197,0.0031005898,0.0017934188,0.00084873644,0.20495044],"category_scores_gemma":[0.008194488,0.0011724142,0.0017118802,0.004225564,0.0004412933,0.004530623,0.0025406508,0.0019589681,0.15941274],"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.000027939172,0.00005363101,0.0005227983,0.00038459455,0.00006650977,0.000051622203,0.00024492454,0.0038431557,0.0008748391,0.07579177,0.6347086,0.28342962],"study_design_scores_gemma":[0.000019168609,0.00001086945,0.0007491171,0.00015225385,0.000038874692,0.00013927791,0.000094676594,0.026029576,0.0016268764,0.14450656,0.82659096,0.0000418447],"about_ca_topic_score_codex":0.0027678958,"about_ca_topic_score_gemma":0.0050103487,"teacher_disagreement_score":0.20495044,"about_ca_system_score_codex":0.00094564166,"about_ca_system_score_gemma":0.0014276115,"threshold_uncertainty_score":0.6856275},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012487603,0.011207809,0.0005684019,0.046332408,0.16379306,0.0004554645,0.031179387,0.0022807382,0.74293405],"genre_scores_gemma":[0.0023442334,0.0054723155,0.000399866,0.01547408,0.021143842,0.00016624521,0.014043619,0.0004868822,0.94046885],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919194,0.00006741503,0.000057427802,0.000086343294,0.00045911912,0.00013788189],"domain_scores_gemma":[0.9967057,0.00062507234,0.00026513773,0.00025957075,0.0010693951,0.0010751934],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012627497,0.0011129641,0.0009973077,0.0023690367,0.0012695743,0.0072520073,0.0014128577,0.0038011812,0.5406957],"category_scores_gemma":[0.0060185874,0.0004864916,0.0006963408,0.0024043142,0.00044792006,0.0031420905,0.0018506382,0.0028547174,0.44201785],"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.000041719813,0.000015067393,0.000055099255,0.00017197929,0.000001955466,0.00005750897,0.0000129315795,0.000012078275,0.00008269974,0.00031038516,0.9776163,0.021622248],"study_design_scores_gemma":[0.00000900278,0.000011670948,0.00043719105,0.000102472026,0.0000019067439,0.000032120322,0.000034500357,0.000015371368,0.000056897425,0.00013008037,0.9991641,0.0000047228245],"about_ca_topic_score_codex":0.002931164,"about_ca_topic_score_gemma":0.0076652616,"teacher_disagreement_score":0.45930427,"about_ca_system_score_codex":0.0012276378,"about_ca_system_score_gemma":0.0016985841,"threshold_uncertainty_score":0.65514183},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45495328,0.0047242334,0.46676904,0.009077633,0.00010435151,0.00013742175,0.0009829336,0.00013486946,0.06311625],"genre_scores_gemma":[0.9779514,0.0014549234,0.018739477,0.000120763274,0.000084523796,0.00007625958,0.0001971428,0.000012049092,0.0013635732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877733,0.0006289538,0.000048915983,0.0002681557,0.00017469007,0.000101971826],"domain_scores_gemma":[0.99165136,0.006158821,0.0012775984,0.00028373874,0.0002771575,0.0003512771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012783799,0.00038128174,0.0004962142,0.004739245,0.0011584361,0.0031675084,0.0007283453,0.0010508122,0.0039371816],"category_scores_gemma":[0.00920967,0.00029693727,0.0004217956,0.0045655197,0.0035456407,0.007660066,0.0020370095,0.00094872806,0.00019571313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004105644,0.00003389242,0.020964254,0.00018338815,0.00011637334,0.00022054378,0.0022860395,0.032382324,0.0006604326,0.9158307,0.0012970325,0.025984071],"study_design_scores_gemma":[0.000019578585,0.00006245187,0.023327198,0.00014061939,0.00007367398,0.0004441568,0.002367534,0.048832554,0.00036161556,0.91042167,0.013904736,0.000044248824],"about_ca_topic_score_codex":0.002073359,"about_ca_topic_score_gemma":0.0018680193,"teacher_disagreement_score":0.004739245,"about_ca_system_score_codex":0.0013799242,"about_ca_system_score_gemma":0.00045293194,"threshold_uncertainty_score":0.013171196},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77356386,0.001218024,0.21581665,0.00046573,0.00018015232,0.00022016444,0.0023804216,0.0023983219,0.003756631],"genre_scores_gemma":[0.96844316,0.00035248647,0.025450492,0.00003995479,0.000069967195,0.000059840462,0.0019297535,0.00005697343,0.0035974148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993032,0.00011991464,0.000056726323,0.0002277912,0.00019153043,0.000100850346],"domain_scores_gemma":[0.99608624,0.00184311,0.0006320043,0.00039244565,0.00087316585,0.00017308645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091031496,0.0013351993,0.00079136743,0.0022944477,0.0004106291,0.0007088411,0.0006787676,0.0008911064,0.0010278382],"category_scores_gemma":[0.005449784,0.0003070479,0.0008542593,0.0012979252,0.00024874846,0.0018913085,0.00038785752,0.0011508721,0.00134759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012826195,0.001114465,0.29207477,0.00038611857,0.00044658146,0.0011466673,0.00067992357,0.21533132,0.040596638,0.002841327,0.008787092,0.43531242],"study_design_scores_gemma":[0.000004635555,0.00009900417,0.022347962,0.000011910807,0.00004647039,0.00013826355,0.00004199852,0.9712142,0.0045311856,0.00085120235,0.0006894289,0.000023759732],"about_ca_topic_score_codex":0.010852425,"about_ca_topic_score_gemma":0.01443778,"teacher_disagreement_score":0.010852425,"about_ca_system_score_codex":0.00046687588,"about_ca_system_score_gemma":0.0003395634,"threshold_uncertainty_score":0.02157849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09203027,0.0030286023,0.8686726,0.003538719,0.00023718092,0.00013773164,0.0035165923,0.00491748,0.023920804],"genre_scores_gemma":[0.56557506,0.0029210767,0.42143625,0.00025684817,0.00015456585,0.00018941725,0.0030938978,0.0009118807,0.0054610306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991947,0.00036415688,0.000041589192,0.00016380375,0.00018951905,0.000046328005],"domain_scores_gemma":[0.9966665,0.002157083,0.0003264336,0.00032874043,0.00038904647,0.00013232348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012574566,0.00081000704,0.0003498556,0.0038061317,0.00086637517,0.0037751351,0.00074505777,0.0010116753,0.0075747315],"category_scores_gemma":[0.0075148507,0.00034948392,0.0005262556,0.0028685152,0.00073699234,0.004508303,0.0017287345,0.00091884384,0.00094084215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029493467,0.00012419824,0.013358168,0.0013835251,0.00029973596,0.0010876402,0.011433623,0.20763168,0.03349402,0.4081089,0.04718749,0.2755961],"study_design_scores_gemma":[0.000043273696,0.00004410309,0.006666577,0.0003077317,0.00007624641,0.0007891835,0.003743267,0.42879376,0.009808116,0.41764545,0.13199624,0.0000860469],"about_ca_topic_score_codex":0.0024640241,"about_ca_topic_score_gemma":0.0029786911,"teacher_disagreement_score":0.0075747315,"about_ca_system_score_codex":0.00072987395,"about_ca_system_score_gemma":0.0005614341,"threshold_uncertainty_score":0.02534002},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013154226,0.0007852934,0.9834179,0.00021695574,0.000063320615,0.000069900016,0.00031399966,0.0012934674,0.0006849193],"genre_scores_gemma":[0.20113419,0.0017233051,0.7890225,0.00011725126,0.0003457471,0.00044026432,0.00268393,0.00020545724,0.0043273014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987872,0.00028064888,0.00012280932,0.00031193334,0.0004136132,0.000083809246],"domain_scores_gemma":[0.9964503,0.0014596961,0.00045542023,0.000844248,0.0006793071,0.00011096313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001117271,0.0009344064,0.0012090661,0.0050232564,0.0007067608,0.0018606216,0.0012931493,0.0008522625,0.0027064288],"category_scores_gemma":[0.0058737965,0.00031293012,0.0012671731,0.0078042313,0.000513659,0.0030075468,0.0018422033,0.0013294454,0.0018305713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019562483,0.00024603162,0.0017854949,0.00024476083,0.00014644749,0.00011897585,0.0003331026,0.0563229,0.013468417,0.011713677,0.0054033124,0.9100213],"study_design_scores_gemma":[0.000046520847,0.00014701369,0.0018137752,0.000031279207,0.00006625169,0.00026208424,0.00026446674,0.94584763,0.0072593023,0.03665989,0.007567206,0.000034674078],"about_ca_topic_score_codex":0.0021531333,"about_ca_topic_score_gemma":0.0033571431,"teacher_disagreement_score":0.0050232564,"about_ca_system_score_codex":0.0005399542,"about_ca_system_score_gemma":0.0010262257,"threshold_uncertainty_score":0.009053946},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00714452,0.0058137462,0.21539983,0.0053541404,0.0016752309,0.00012019926,0.0011250504,0.0007717443,0.76259553],"genre_scores_gemma":[0.15357642,0.011662306,0.06321062,0.002349307,0.0020996784,0.000368758,0.002360005,0.00078127516,0.76359165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966943,0.00007961011,0.00000964509,0.00009944394,0.00011782352,0.000024021823],"domain_scores_gemma":[0.999453,0.00023227581,0.00003669754,0.00013625743,0.00010116893,0.000040551193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030964514,0.00080228917,0.0005876704,0.0011892086,0.00068048266,0.0017304404,0.00075694337,0.00082568027,0.037570182],"category_scores_gemma":[0.0018102531,0.00040628834,0.00038029163,0.0014643632,0.0009965787,0.0027688884,0.0008203451,0.0017809226,0.011147729],"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.000005662308,0.0000140597695,0.0000616512,0.00007158883,0.000009924232,0.00002610994,0.000056004657,0.0019705659,0.00037502605,0.89630663,0.055229135,0.04587363],"study_design_scores_gemma":[0.000004715996,0.000007302612,0.00016654022,0.000035146302,0.000009461799,0.000121244615,0.000030509673,0.0045667305,0.00030967116,0.82410705,0.17063358,0.000008140798],"about_ca_topic_score_codex":0.00065179355,"about_ca_topic_score_gemma":0.00088968483,"teacher_disagreement_score":0.037570182,"about_ca_system_score_codex":0.0008870135,"about_ca_system_score_gemma":0.00044968244,"threshold_uncertainty_score":0.1256848},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061169993,0.007210398,0.285345,0.004594131,0.0017840656,0.00025859292,0.0049581113,0.0027521586,0.6869806],"genre_scores_gemma":[0.08910552,0.015258461,0.08987913,0.0010280617,0.0020324558,0.0006193741,0.011194851,0.0015105592,0.78937155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995939,0.000086883985,0.000018906709,0.00014699649,0.00011364697,0.000039563794],"domain_scores_gemma":[0.99935013,0.0002311914,0.000040769424,0.00012437384,0.00017062029,0.00008299928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048774946,0.0007448447,0.0004336854,0.002221751,0.0010255362,0.004010284,0.000882497,0.00077566406,0.08346255],"category_scores_gemma":[0.0029606677,0.00040126944,0.0005662531,0.0033360333,0.00049758423,0.0061926846,0.0021192187,0.0011910598,0.03646551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042531632,0.000033017386,0.00041595372,0.00039732468,0.000035002588,0.00008717151,0.00043197145,0.0038601088,0.0017778324,0.42622313,0.1974858,0.36921027],"study_design_scores_gemma":[0.000005694831,0.000013356225,0.00043592532,0.00012081861,0.000021184547,0.0001905944,0.00020249737,0.007403564,0.0008275593,0.19470686,0.7960585,0.000013371979],"about_ca_topic_score_codex":0.0012881506,"about_ca_topic_score_gemma":0.0019518574,"teacher_disagreement_score":0.08346255,"about_ca_system_score_codex":0.0010369859,"about_ca_system_score_gemma":0.0007355872,"threshold_uncertainty_score":0.27921003},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002013815,0.0015095894,0.91777873,0.0014066352,0.00039658375,0.00020991397,0.0025520485,0.003054028,0.07107867],"genre_scores_gemma":[0.04949232,0.006098945,0.767687,0.0008136259,0.00088955835,0.0008604933,0.0093077,0.0025173079,0.16233315],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913317,0.00024221219,0.00004043659,0.00024388198,0.00029890166,0.000041290084],"domain_scores_gemma":[0.99737895,0.0015026322,0.00009650567,0.0005232743,0.00041974036,0.000078937985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016239694,0.0013594072,0.00061091594,0.003771932,0.00082028256,0.0029046738,0.0011636956,0.000686244,0.039060876],"category_scores_gemma":[0.00595301,0.0005334571,0.0011569826,0.0032144852,0.0007061801,0.0034508943,0.0023807394,0.0016350431,0.01807159],"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.000028688375,0.000046944842,0.000902812,0.00047995307,0.000096554024,0.00012586331,0.0005417572,0.0101535795,0.0023410998,0.23962747,0.14753626,0.59811914],"study_design_scores_gemma":[0.0000084822705,0.000020251131,0.0012964859,0.000293171,0.000055970384,0.00037522826,0.00036181248,0.056270115,0.0032028868,0.49267808,0.44539815,0.000039404014],"about_ca_topic_score_codex":0.0011125522,"about_ca_topic_score_gemma":0.0021028176,"teacher_disagreement_score":0.039060876,"about_ca_system_score_codex":0.0007392281,"about_ca_system_score_gemma":0.00091469946,"threshold_uncertainty_score":0.13067162},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024702698,0.0024718535,0.94086033,0.0013939885,0.00046677006,0.00008327581,0.0013838093,0.00142092,0.049448717],"genre_scores_gemma":[0.15051848,0.011771079,0.67174196,0.0012220368,0.0019958469,0.0005982658,0.007028045,0.00220484,0.1529195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994036,0.0001675698,0.000023183511,0.00017055898,0.00019890604,0.00003603377],"domain_scores_gemma":[0.9986743,0.0007828765,0.00006302091,0.00021796911,0.00021413516,0.000047783702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000932433,0.0012572705,0.0007070835,0.0027513953,0.00063751225,0.002246528,0.0010371202,0.00086619845,0.014506973],"category_scores_gemma":[0.0044755763,0.00050934847,0.001006602,0.0035895193,0.0009298021,0.0040998883,0.0017053636,0.0018638489,0.0069543514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025328058,0.00005596012,0.0012547713,0.00028030886,0.00009464328,0.00007610685,0.00031370344,0.021080527,0.0010835255,0.5179881,0.08566674,0.3720804],"study_design_scores_gemma":[0.0000045481097,0.000008331997,0.00087474694,0.00008766932,0.0000414264,0.00012997503,0.00013250935,0.11878712,0.0014211794,0.7634291,0.11506221,0.000021099693],"about_ca_topic_score_codex":0.0023165464,"about_ca_topic_score_gemma":0.0029527517,"teacher_disagreement_score":0.014506973,"about_ca_system_score_codex":0.0012840807,"about_ca_system_score_gemma":0.00070330454,"threshold_uncertainty_score":0.04853064},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005059469,0.0028511412,0.6525392,0.002978285,0.0010312407,0.00014250059,0.0024450785,0.00094486686,0.3320082],"genre_scores_gemma":[0.17541777,0.015771093,0.23891729,0.0017274043,0.0013165798,0.00068950036,0.0074589183,0.00081412785,0.55788726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973005,0.00005325164,0.000010295841,0.00011164094,0.000076130615,0.000018645225],"domain_scores_gemma":[0.99954563,0.00021354017,0.000025970123,0.00008271205,0.00009909302,0.000032965218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029868088,0.000681688,0.0003486001,0.0013169278,0.00061796233,0.0017994702,0.0006772278,0.0007106345,0.031368215],"category_scores_gemma":[0.0020646458,0.0002601113,0.00035800258,0.0014061574,0.00059225934,0.0028056363,0.001109371,0.0011174711,0.008955209],"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.000013480161,0.000018613306,0.00018533428,0.00017899874,0.000017657781,0.00006515289,0.00008717755,0.013066418,0.0010830323,0.7662764,0.060409177,0.15859851],"study_design_scores_gemma":[0.000004667703,0.0000107891665,0.00020773837,0.00008390299,0.000018952394,0.00017138489,0.000058641806,0.031276315,0.0010359866,0.62588894,0.34122726,0.000015356096],"about_ca_topic_score_codex":0.0013521236,"about_ca_topic_score_gemma":0.0016220039,"teacher_disagreement_score":0.031368215,"about_ca_system_score_codex":0.00089195673,"about_ca_system_score_gemma":0.00055398355,"threshold_uncertainty_score":0.104937196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008721033,0.001735033,0.0026310761,0.0011662167,0.0004539812,0.00006861743,0.9711279,0.006858983,0.0072370614],"genre_scores_gemma":[0.012217255,0.00059573265,0.0037097172,0.00027048987,0.00009285878,0.00005801375,0.97735023,0.0003525882,0.0053529833],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992717,0.00008192065,0.000045643734,0.00026504323,0.00021059808,0.00012508513],"domain_scores_gemma":[0.9987978,0.0002301112,0.000117672076,0.00034978983,0.00035512817,0.00014953486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000870311,0.0019159804,0.0012467162,0.0021413227,0.0006755937,0.002566708,0.0019843415,0.0021008474,0.022532893],"category_scores_gemma":[0.0038455476,0.0004785248,0.0015063495,0.0023205215,0.0004476287,0.0013466008,0.0017567471,0.0013119527,0.032358244],"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.0002043712,0.00006237767,0.004212197,0.00071547576,0.00008689404,0.00011608285,0.00003594128,0.0008962928,0.001502049,0.0006469002,0.9783281,0.013193259],"study_design_scores_gemma":[0.00036933366,0.00008850594,0.029112928,0.0004608355,0.00020606979,0.0009772719,0.00024326151,0.0140182655,0.0070090927,0.0061609056,0.9412618,0.00009174445],"about_ca_topic_score_codex":0.019620437,"about_ca_topic_score_gemma":0.06543049,"teacher_disagreement_score":0.022532893,"about_ca_system_score_codex":0.0009712305,"about_ca_system_score_gemma":0.0015057198,"threshold_uncertainty_score":0.07537997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122393146,0.00042463458,0.8546137,0.0022714,0.00011205511,0.000104557366,0.00020817328,0.00017451016,0.019697752],"genre_scores_gemma":[0.9560005,0.00039281216,0.03471486,0.00013991624,0.00008085338,0.0002847603,0.000105878535,0.000057957815,0.008222464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990114,0.00049830327,0.00002656757,0.00018921813,0.00014547439,0.00012893837],"domain_scores_gemma":[0.9951958,0.0033283117,0.0006003372,0.00022131069,0.0003569843,0.00029733955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017747249,0.0008042296,0.00054548244,0.00081750035,0.000990364,0.0017603197,0.0015475854,0.0016833954,0.0034580233],"category_scores_gemma":[0.00899157,0.00040217477,0.0008966104,0.00062250247,0.001661515,0.0035726181,0.001994558,0.0016389808,0.00045516598],"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.00006811844,0.00007993794,0.0027616238,0.00004090364,0.000033619057,0.00012094489,0.00041157473,0.7164287,0.0009981623,0.26994345,0.0012417729,0.007871225],"study_design_scores_gemma":[0.000006000821,0.000012783086,0.00025736017,0.000006227686,0.0000057331326,0.000015569445,0.000035125253,0.96257496,0.0000637053,0.036380757,0.00063456944,0.0000071606573],"about_ca_topic_score_codex":0.008349104,"about_ca_topic_score_gemma":0.0053676553,"teacher_disagreement_score":0.008349104,"about_ca_system_score_codex":0.0020720984,"about_ca_system_score_gemma":0.0009029851,"threshold_uncertainty_score":0.016600966},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068685915,0.005815505,0.8466681,0.0042257025,0.0013708842,0.00068687747,0.0087602185,0.0052735712,0.12033061],"genre_scores_gemma":[0.08427974,0.01175124,0.6895913,0.0012200609,0.0017105716,0.000927822,0.025003908,0.0013548562,0.18416046],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999186,0.00015122807,0.00004061993,0.00025188903,0.00033192677,0.000038361028],"domain_scores_gemma":[0.99883,0.00052102073,0.00006440252,0.00028763784,0.00024535725,0.00005153661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009930743,0.0010723032,0.00072200986,0.0036723414,0.0010853569,0.002164359,0.0012719393,0.0008063333,0.019901032],"category_scores_gemma":[0.0041394667,0.00047865688,0.0010807259,0.003975958,0.0004043288,0.0034588366,0.0017872126,0.001331984,0.01589394],"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.000022954908,0.000089344314,0.0012917933,0.0003704798,0.00007130742,0.00007527572,0.00016480708,0.005433958,0.0016682,0.06088111,0.1299426,0.79998815],"study_design_scores_gemma":[0.000011813803,0.00003894677,0.0036572756,0.0003513411,0.00008489998,0.000653687,0.00031074035,0.11336237,0.0064974683,0.25766787,0.61731136,0.000052256695],"about_ca_topic_score_codex":0.0015291293,"about_ca_topic_score_gemma":0.0031522124,"teacher_disagreement_score":0.019901032,"about_ca_system_score_codex":0.00071972393,"about_ca_system_score_gemma":0.00085956097,"threshold_uncertainty_score":0.06657559},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013424214,0.015904808,0.12545268,0.013963361,0.002961985,0.00003354922,0.00038794178,0.00035055928,0.83960265],"genre_scores_gemma":[0.08793433,0.03369004,0.05161668,0.0072229253,0.005698637,0.0002782153,0.00066716806,0.0007780398,0.812114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952614,0.00012484225,0.000014359767,0.00012335273,0.00017943076,0.000031796673],"domain_scores_gemma":[0.9993839,0.0003643652,0.000022094608,0.00010744863,0.00009184987,0.000030365922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006197769,0.00084803876,0.00043692667,0.0016508263,0.0014499679,0.0040874486,0.0008453626,0.0013171674,0.032896552],"category_scores_gemma":[0.0026613974,0.00036705623,0.0003996727,0.0018589179,0.0037966191,0.008480198,0.0014208271,0.0026987356,0.009648026],"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.000002414989,0.0000047677495,0.000038692408,0.000057091147,0.000003828788,0.00001305872,0.00019586913,0.000839953,0.00007316303,0.89848703,0.05768419,0.04259998],"study_design_scores_gemma":[9.418425e-7,0.0000020152859,0.00005795323,0.0000770723,0.000002529483,0.000041685256,0.00007895714,0.0009615991,0.000060845367,0.6326991,0.36601278,0.0000044921394],"about_ca_topic_score_codex":0.0021907988,"about_ca_topic_score_gemma":0.003287433,"teacher_disagreement_score":0.032896552,"about_ca_system_score_codex":0.0016751791,"about_ca_system_score_gemma":0.000727723,"threshold_uncertainty_score":0.1100499},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043789767,0.0042568306,0.46190453,0.0049000676,0.0011128946,0.00021855652,0.0014939153,0.0007798698,0.48154354],"genre_scores_gemma":[0.4948955,0.006320121,0.0811833,0.0010765473,0.0019455,0.00054549606,0.0013639391,0.0002780782,0.41239145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999608,0.00010187713,0.00001327499,0.00012670508,0.00011249712,0.000037721547],"domain_scores_gemma":[0.99922323,0.00034234015,0.000083046056,0.00013089771,0.00013206333,0.00008839026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039757718,0.0006509412,0.00031488616,0.0019841224,0.001169244,0.0023899989,0.00056246377,0.0007819739,0.021831276],"category_scores_gemma":[0.0032853119,0.00035015724,0.0003019647,0.0016034303,0.000845776,0.0043400857,0.0015860919,0.00095187966,0.0034706246],"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.00001864843,0.00001935913,0.0003951681,0.00008835056,0.000021446227,0.00008655623,0.00024570533,0.0046239663,0.001041609,0.89426565,0.020379823,0.07881367],"study_design_scores_gemma":[0.000005599412,0.000015883114,0.00079081,0.00006556513,0.000024992698,0.00033879708,0.00022803829,0.02736658,0.0011238063,0.8196074,0.15041299,0.000019399657],"about_ca_topic_score_codex":0.00089178246,"about_ca_topic_score_gemma":0.0013780968,"teacher_disagreement_score":0.021831276,"about_ca_system_score_codex":0.00081592397,"about_ca_system_score_gemma":0.00033563463,"threshold_uncertainty_score":0.073032916},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057388344,0.0029080156,0.9744736,0.0007497246,0.0002686682,0.000065201304,0.00076133717,0.0010176087,0.014017009],"genre_scores_gemma":[0.40003577,0.013472648,0.50852704,0.0005492125,0.0027318543,0.00056503963,0.0059246607,0.0012529365,0.06694083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910873,0.0002787801,0.00005483954,0.00022938388,0.00027438003,0.000053840737],"domain_scores_gemma":[0.99750704,0.0017778557,0.00012824936,0.00029711743,0.00022388302,0.000065823675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010218346,0.0012911612,0.0008795212,0.0025986084,0.0005593563,0.0025097535,0.0010577202,0.0006875658,0.007090793],"category_scores_gemma":[0.005008022,0.0005096122,0.0011778442,0.0027327621,0.0008100295,0.0034908112,0.0014330668,0.0016719429,0.0024857966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008529647,0.0001248946,0.0024309254,0.00051029533,0.00025375854,0.00024983153,0.0005082434,0.06826076,0.0035749157,0.41125593,0.038941216,0.4738039],"study_design_scores_gemma":[0.0000065428135,0.000017700875,0.0018221446,0.00007136114,0.00004617613,0.00015462622,0.00014723415,0.47663948,0.0016821976,0.4859419,0.033441883,0.000028685854],"about_ca_topic_score_codex":0.0015889094,"about_ca_topic_score_gemma":0.0014152748,"teacher_disagreement_score":0.007090793,"about_ca_system_score_codex":0.0007594925,"about_ca_system_score_gemma":0.0003978911,"threshold_uncertainty_score":0.023721099},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78883874,0.0010250537,0.1990257,0.0007292146,0.000038445472,0.00008988866,0.0005603846,0.00028523165,0.0094073415],"genre_scores_gemma":[0.98882675,0.0002927478,0.00915988,0.000068675974,0.000031878262,0.00005134448,0.00019774918,0.00003580234,0.0013353667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792236,0.00079940853,0.00006219529,0.00053632836,0.0003795968,0.00030012746],"domain_scores_gemma":[0.97462565,0.018651595,0.0031813956,0.0018406003,0.00087117054,0.00082958746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019549867,0.00077569846,0.0007539849,0.0019632566,0.0011458271,0.002112413,0.0018715648,0.001144136,0.0026989537],"category_scores_gemma":[0.020464433,0.0005490488,0.00069446664,0.001275744,0.0023256582,0.0036509582,0.0018526528,0.0011794526,0.00019755217],"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.00032445096,0.00014570651,0.022124315,0.00022799474,0.00016117908,0.00029265502,0.00068212085,0.80526906,0.008071634,0.13658838,0.0022276742,0.023884863],"study_design_scores_gemma":[0.000013581593,0.000046526297,0.002324184,0.000023000666,0.000013986898,0.00011373539,0.000092877366,0.9196558,0.0017782389,0.07477502,0.0011437509,0.000019315932],"about_ca_topic_score_codex":0.0042503225,"about_ca_topic_score_gemma":0.004520996,"teacher_disagreement_score":0.0042503225,"about_ca_system_score_codex":0.0029264605,"about_ca_system_score_gemma":0.0005998983,"threshold_uncertainty_score":0.021233022},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022602577,0.0036927948,0.94621694,0.0029697407,0.0007640496,0.00008159793,0.0031742798,0.0013355794,0.039504815],"genre_scores_gemma":[0.12771405,0.017675336,0.58544546,0.0020761434,0.0030032115,0.0008102089,0.014341731,0.0017587094,0.24717507],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918896,0.00030926027,0.000033956156,0.00024161294,0.00018619742,0.000040063736],"domain_scores_gemma":[0.99713206,0.0015967931,0.00012950372,0.0005508114,0.0004898492,0.00010096133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023679954,0.00082473754,0.0005722716,0.002171657,0.00060382095,0.0016950493,0.001000777,0.0006644907,0.02226181],"category_scores_gemma":[0.007892657,0.00044514268,0.00077962864,0.0025324961,0.000654506,0.0026342524,0.001485798,0.001853458,0.009888018],"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.000026355308,0.00004896744,0.0024273908,0.00020388316,0.00012965969,0.00005908426,0.00020000685,0.021425178,0.0005527458,0.37351444,0.14417516,0.45723715],"study_design_scores_gemma":[0.0000054139327,0.000015672429,0.0024656416,0.0001435012,0.00005236079,0.00014490874,0.000115804454,0.098749585,0.00068323495,0.67188114,0.22571266,0.000030034624],"about_ca_topic_score_codex":0.0032742508,"about_ca_topic_score_gemma":0.0047816513,"teacher_disagreement_score":0.02226181,"about_ca_system_score_codex":0.0010492831,"about_ca_system_score_gemma":0.001074031,"threshold_uncertainty_score":0.07447314},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033444366,0.0012933217,0.98969054,0.00024433056,0.00013434101,0.00005118781,0.00072902255,0.00079995726,0.0037129303],"genre_scores_gemma":[0.15241192,0.0037458956,0.8188019,0.00034370518,0.0007472989,0.00041962907,0.0053889737,0.0010247431,0.017116008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919003,0.00022473797,0.000038150163,0.00022043129,0.0002814435,0.000045260305],"domain_scores_gemma":[0.9977685,0.0013172859,0.00012507563,0.00043170917,0.00028308478,0.000074313495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013227118,0.0011362897,0.0011655226,0.0033280188,0.0006139091,0.0018931446,0.0019766365,0.00078386406,0.0057880096],"category_scores_gemma":[0.0052030776,0.00064175663,0.0016733706,0.0036222893,0.0005172303,0.0037679435,0.0021350505,0.0017640726,0.0023386434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013778846,0.0001467218,0.003013013,0.00059001555,0.0006451136,0.0001757675,0.0004104379,0.14172992,0.0053841337,0.22955616,0.03402718,0.5841837],"study_design_scores_gemma":[0.000008672022,0.000022886246,0.00088234514,0.000064078,0.00009940432,0.00011541588,0.000081907856,0.7746396,0.001404528,0.20651881,0.016139043,0.000023254546],"about_ca_topic_score_codex":0.001470595,"about_ca_topic_score_gemma":0.002357696,"teacher_disagreement_score":0.0057880096,"about_ca_system_score_codex":0.00076733547,"about_ca_system_score_gemma":0.00064142066,"threshold_uncertainty_score":0.019362807},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014855842,0.0024449239,0.7007164,0.0037949372,0.0007958733,0.0001557358,0.0012106501,0.0011509716,0.27487472],"genre_scores_gemma":[0.37106267,0.007787381,0.2154378,0.0009642401,0.0011393571,0.0006631124,0.0026831746,0.00063455827,0.39962777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952674,0.00012943325,0.000021829408,0.00010986637,0.00016461987,0.000047465983],"domain_scores_gemma":[0.99898714,0.00042451418,0.00007256523,0.00023673785,0.00019008547,0.00008905364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056474254,0.0007145181,0.00033343353,0.0014572456,0.0008956873,0.0029945425,0.0007443662,0.0007684013,0.017785164],"category_scores_gemma":[0.0039785253,0.00046007402,0.00047157137,0.0013323906,0.00084365427,0.0045073573,0.0021641396,0.0014742763,0.005016366],"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.000013004564,0.000017902654,0.00037988997,0.00010839954,0.000024101135,0.00006107514,0.00025587852,0.008746515,0.0008112763,0.87601316,0.021340758,0.09222805],"study_design_scores_gemma":[0.0000035987596,0.000011707023,0.00056301296,0.00008845007,0.000023781733,0.00016471608,0.00016571852,0.037837204,0.0008886149,0.82254964,0.13768314,0.000020495641],"about_ca_topic_score_codex":0.0013979932,"about_ca_topic_score_gemma":0.0019808458,"teacher_disagreement_score":0.017785164,"about_ca_system_score_codex":0.0010047667,"about_ca_system_score_gemma":0.0006496865,"threshold_uncertainty_score":0.059497297},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068929684,0.0015550655,0.9815392,0.00089777657,0.00012320488,0.000112471986,0.0011189895,0.0018160647,0.0059442865],"genre_scores_gemma":[0.18177477,0.0047289087,0.7827042,0.00054341723,0.00058514357,0.00051554426,0.0087089585,0.0010047033,0.019434411],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968924,0.0009538488,0.00016855983,0.00084616843,0.0010375093,0.00010164106],"domain_scores_gemma":[0.9935866,0.004188238,0.00018552868,0.0015210876,0.0003791452,0.00013943111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024030085,0.0012562728,0.0014082856,0.0025862504,0.0008906374,0.00430798,0.0022867748,0.00135172,0.0065902714],"category_scores_gemma":[0.01924981,0.0008679549,0.0012495707,0.0035322658,0.0011608535,0.008479809,0.003260763,0.0020788615,0.0033646582],"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.00014398372,0.00016263653,0.00390517,0.000787522,0.00019837962,0.00019795932,0.0010256452,0.07406678,0.007149473,0.30225414,0.04123844,0.56886995],"study_design_scores_gemma":[0.000013991839,0.000019946148,0.0007218146,0.00007744102,0.000029879731,0.00025181193,0.00024117964,0.44574717,0.0030541117,0.5178703,0.03194653,0.000025801504],"about_ca_topic_score_codex":0.001867198,"about_ca_topic_score_gemma":0.0027513301,"teacher_disagreement_score":0.0065902714,"about_ca_system_score_codex":0.0012233579,"about_ca_system_score_gemma":0.0008799432,"threshold_uncertainty_score":0.022046685},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98292625,0.00032297394,0.011086444,0.00095584703,0.000033770943,0.000032408792,0.0002461599,0.0001100021,0.004286247],"genre_scores_gemma":[0.99673444,0.00010505256,0.0020404977,0.00004800066,0.000013878799,0.000025568852,0.00024285809,0.000018197152,0.00077149755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995571,0.00014428374,0.00001397948,0.000102930724,0.00009364418,0.00008813927],"domain_scores_gemma":[0.9966857,0.0014478866,0.00067607994,0.00023526355,0.0003180203,0.00063705124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008630941,0.00028719095,0.0003821507,0.0013667679,0.0011321639,0.001348849,0.0007996526,0.00086759863,0.002329925],"category_scores_gemma":[0.011144329,0.00035767598,0.00033212706,0.00096290355,0.0012933088,0.0031686046,0.0017224401,0.0010287925,0.00024842212],"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.0013895303,0.00075434207,0.198299,0.00033206944,0.0004902864,0.0056849355,0.014617503,0.46823725,0.04759348,0.177937,0.019177627,0.06548695],"study_design_scores_gemma":[0.00009046074,0.0002944743,0.09843273,0.000063464635,0.00008967463,0.0008441728,0.0052731023,0.8166846,0.0035356316,0.06312384,0.011450543,0.00011720419],"about_ca_topic_score_codex":0.008707342,"about_ca_topic_score_gemma":0.007150327,"teacher_disagreement_score":0.008707342,"about_ca_system_score_codex":0.001224425,"about_ca_system_score_gemma":0.00039660695,"threshold_uncertainty_score":0.017313302},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049393624,0.0018847827,0.8599849,0.002836494,0.0010118423,0.000509666,0.019628558,0.01245564,0.096748844],"genre_scores_gemma":[0.08561561,0.0050772396,0.5979653,0.0010463881,0.0014375375,0.0012074576,0.052947007,0.005687038,0.24901642],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998868,0.00023722646,0.000070932336,0.0003664194,0.0003985124,0.00005890404],"domain_scores_gemma":[0.9975616,0.0011058332,0.00012935098,0.00046676863,0.0006547329,0.00008168877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011501926,0.001331965,0.00065746123,0.005763087,0.0011066193,0.0031183448,0.0012567568,0.00069750776,0.051814463],"category_scores_gemma":[0.0073556243,0.00043908908,0.0010601464,0.0049431566,0.0005561888,0.0043638963,0.0017683787,0.0013128084,0.033417393],"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.00005597069,0.000058555954,0.0009674093,0.00042916025,0.00008155027,0.00011021015,0.00032967,0.008180823,0.004299646,0.07978869,0.2098699,0.6958284],"study_design_scores_gemma":[0.000014052543,0.000029061175,0.0022984208,0.0002593646,0.00009395441,0.00034131922,0.0004332961,0.12457775,0.01094484,0.27213794,0.5888103,0.000059550213],"about_ca_topic_score_codex":0.0024654816,"about_ca_topic_score_gemma":0.0034325863,"teacher_disagreement_score":0.051814463,"about_ca_system_score_codex":0.0011347521,"about_ca_system_score_gemma":0.0009808415,"threshold_uncertainty_score":0.17333668},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048746066,0.0033306698,0.9390104,0.0015081196,0.00061173923,0.00010383988,0.0017855492,0.0008241667,0.047950976],"genre_scores_gemma":[0.25786105,0.012595876,0.5482238,0.0009530639,0.002335969,0.0006893715,0.009003138,0.0012760843,0.16706163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925405,0.00017700167,0.000036293713,0.00024384404,0.00024057101,0.000048171314],"domain_scores_gemma":[0.99835604,0.0008134465,0.000126165,0.00031237907,0.00031359808,0.00007830597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011345731,0.00090810756,0.0005694426,0.0028841551,0.0007897128,0.0023807916,0.001004657,0.00068555993,0.0113933645],"category_scores_gemma":[0.0053085256,0.00043464024,0.0009307492,0.0032193842,0.00075413537,0.0038520577,0.0014950446,0.0014342968,0.0038021328],"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.000032161828,0.00004855152,0.0015442101,0.0002217704,0.00009995805,0.00009658892,0.00032476764,0.022160763,0.0018839198,0.6012244,0.0491872,0.3231757],"study_design_scores_gemma":[0.000004714807,0.000013564593,0.0018963147,0.00009620798,0.00005455444,0.00022196471,0.00022158,0.22354908,0.0015765849,0.64184004,0.13049546,0.000029894505],"about_ca_topic_score_codex":0.0032034195,"about_ca_topic_score_gemma":0.0039751213,"teacher_disagreement_score":0.0113933645,"about_ca_system_score_codex":0.0012368696,"about_ca_system_score_gemma":0.00080588966,"threshold_uncertainty_score":0.038114607},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65709835,0.0007076178,0.32914424,0.0026832295,0.00006297497,0.00022667197,0.0023783548,0.00050543435,0.007193207],"genre_scores_gemma":[0.9687843,0.00040316646,0.026799647,0.00013951128,0.00005498209,0.0001657572,0.0010312643,0.00005657624,0.0025648226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997931,0.0010390579,0.00008324286,0.00057486456,0.00023240897,0.0001393363],"domain_scores_gemma":[0.9873834,0.007887523,0.002321119,0.0013626277,0.0006249042,0.0004203927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023987212,0.00077773427,0.0007568301,0.0023880133,0.0010237059,0.002277749,0.0027943754,0.002140958,0.002424929],"category_scores_gemma":[0.017920071,0.0006794918,0.0010333502,0.002158883,0.0016976643,0.005706646,0.0014899842,0.0010764136,0.0004284808],"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.00010181051,0.0001417688,0.018046435,0.00010867189,0.00011870298,0.00026563022,0.0005522805,0.88043815,0.00082085293,0.08750733,0.0023212472,0.009577092],"study_design_scores_gemma":[0.000008689757,0.000011450588,0.0009989925,0.000007995094,0.0000060466286,0.000050884977,0.00005969453,0.9606096,0.00012577492,0.03758619,0.000528077,0.0000065584477],"about_ca_topic_score_codex":0.00853871,"about_ca_topic_score_gemma":0.00941725,"teacher_disagreement_score":0.00853871,"about_ca_system_score_codex":0.0023172286,"about_ca_system_score_gemma":0.0005640956,"threshold_uncertainty_score":0.016978025},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048027713,0.0044030924,0.8219035,0.001187895,0.0005496242,0.000157388,0.0010092683,0.0019980806,0.120763406],"genre_scores_gemma":[0.34121162,0.007956761,0.5674128,0.00038274415,0.0004325376,0.00036434937,0.0025229142,0.0008969288,0.07881935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983585,0.00003242826,0.000007612767,0.000052956435,0.00005954853,0.000011569259],"domain_scores_gemma":[0.9994789,0.0002565502,0.00004465386,0.000081028375,0.000105028346,0.00003380153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021494144,0.00045443396,0.00027604788,0.0017471655,0.00054502045,0.0013651515,0.0005656249,0.0005417678,0.009281658],"category_scores_gemma":[0.0017343757,0.00032978778,0.0005000858,0.0029033318,0.00054113223,0.0027773133,0.00059869385,0.000930102,0.0024109592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068605535,0.000105282015,0.0028408081,0.0005931374,0.000055625787,0.0002975305,0.0009958005,0.032259155,0.018441815,0.51307774,0.020711008,0.4105535],"study_design_scores_gemma":[0.00002233672,0.00007110398,0.0039116777,0.00028423805,0.00006498185,0.0008191487,0.00033003744,0.25336888,0.009914508,0.52084684,0.21030886,0.00005738988],"about_ca_topic_score_codex":0.0008847868,"about_ca_topic_score_gemma":0.0018564449,"teacher_disagreement_score":0.009281658,"about_ca_system_score_codex":0.0005125822,"about_ca_system_score_gemma":0.00037437942,"threshold_uncertainty_score":0.031050265},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005383808,0.0035577335,0.9800443,0.00090946996,0.0003172162,0.00017083994,0.0004373652,0.00040074252,0.008778506],"genre_scores_gemma":[0.16637991,0.0033442178,0.8126448,0.0006292541,0.0019289912,0.0009198144,0.002849247,0.0008602548,0.010443444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9820404,0.0073647434,0.0011303672,0.0023476349,0.0066074454,0.0005093604],"domain_scores_gemma":[0.925584,0.059089907,0.0017014589,0.0046736537,0.008024972,0.0009259957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018163662,0.001694575,0.0029934435,0.008268152,0.0026422471,0.00562563,0.0052810935,0.0031796228,0.008344845],"category_scores_gemma":[0.09887946,0.0010811543,0.00252956,0.0077153603,0.0041441433,0.012001282,0.0046503423,0.0063069523,0.0026667034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003455171,0.00022374204,0.0028690277,0.0014201269,0.00033150666,0.00015780758,0.00043559898,0.061116334,0.0029035322,0.5364118,0.02998698,0.36379802],"study_design_scores_gemma":[0.000037071946,0.0000796079,0.00067844277,0.00026367855,0.00007692725,0.0001902561,0.00010170922,0.33584297,0.0016907993,0.64925957,0.011737084,0.000041830684],"about_ca_topic_score_codex":0.001839644,"about_ca_topic_score_gemma":0.0018840051,"teacher_disagreement_score":0.018163662,"about_ca_system_score_codex":0.0029716697,"about_ca_system_score_gemma":0.002118497,"threshold_uncertainty_score":0.0960598},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008764137,0.0045461734,0.7339403,0.0026688566,0.0013674349,0.00039328224,0.0016751828,0.0019385929,0.24470599],"genre_scores_gemma":[0.28035355,0.011169864,0.42668203,0.0014050445,0.0024786429,0.00088779605,0.0069472706,0.0012092222,0.26886663],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998961,0.00016523365,0.00005133723,0.00039671527,0.00037587335,0.00004994182],"domain_scores_gemma":[0.99864894,0.0004336383,0.00009316121,0.00037436708,0.000372491,0.000077304685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007916292,0.00080949394,0.00068606617,0.0038820566,0.0009586443,0.002591805,0.0013411912,0.0011598786,0.025958419],"category_scores_gemma":[0.0053875437,0.00034857437,0.000764512,0.0037401966,0.0009122099,0.005167385,0.0023866314,0.0013035851,0.009973196],"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.000034013636,0.000051780087,0.0007241548,0.0003506305,0.00006364918,0.000076270204,0.00019067514,0.010415133,0.0026350273,0.43806642,0.0610717,0.48632047],"study_design_scores_gemma":[0.000011297639,0.000058904527,0.0014852805,0.0001466898,0.00006398876,0.00069558277,0.0002409563,0.07159625,0.004873434,0.61383367,0.30695057,0.00004333629],"about_ca_topic_score_codex":0.0011268089,"about_ca_topic_score_gemma":0.0013434668,"teacher_disagreement_score":0.025958419,"about_ca_system_score_codex":0.0013111095,"about_ca_system_score_gemma":0.0007866533,"threshold_uncertainty_score":0.08683956},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069897342,0.029567087,0.83059204,0.020758225,0.012299199,0.00088559545,0.0064287093,0.0041852347,0.0882943],"genre_scores_gemma":[0.110004835,0.030451534,0.70473623,0.0061630066,0.006245465,0.0022695083,0.026530521,0.0030274184,0.11057148],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938087,0.002794964,0.00058492925,0.0011839301,0.0012852408,0.0003421794],"domain_scores_gemma":[0.99152195,0.0041179513,0.00025590017,0.0020032874,0.0015370814,0.0005638704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0092720995,0.002350569,0.0018642367,0.0023404353,0.0013407903,0.007694813,0.004086379,0.0030729936,0.03934557],"category_scores_gemma":[0.017912503,0.0012214658,0.0041803755,0.0022112792,0.0015069922,0.008472555,0.0051161265,0.004807491,0.012399529],"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.00035421175,0.00042531686,0.0031198962,0.001343017,0.00057270285,0.0007040359,0.0016906009,0.031217283,0.0021382943,0.25585216,0.33689967,0.36568284],"study_design_scores_gemma":[0.000058433212,0.00009818028,0.0011518754,0.0008799275,0.00014181713,0.0003524483,0.00040951272,0.0599,0.0012606808,0.1594279,0.7762288,0.00009041066],"about_ca_topic_score_codex":0.0073241405,"about_ca_topic_score_gemma":0.006300082,"teacher_disagreement_score":0.03934557,"about_ca_system_score_codex":0.002257541,"about_ca_system_score_gemma":0.0026242237,"threshold_uncertainty_score":0.13162404},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004731137,0.0019630138,0.8803486,0.0009697497,0.0009992628,0.00034185016,0.004461587,0.013044276,0.09314056],"genre_scores_gemma":[0.064502746,0.004499056,0.6290499,0.00074445625,0.0009575193,0.00044114536,0.015387497,0.0029069246,0.2815107],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994061,0.000050144325,0.0000274105,0.00023816167,0.00023499585,0.000043222946],"domain_scores_gemma":[0.9990645,0.00021735314,0.0000706937,0.00020102647,0.00039465103,0.000051705574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008944473,0.001334263,0.00074070256,0.003766106,0.00068020326,0.0022956468,0.001380515,0.0010649287,0.043976795],"category_scores_gemma":[0.0030273197,0.00053040765,0.00091519905,0.0029673271,0.00030951173,0.002549246,0.0013010547,0.001079842,0.040911067],"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.00006778074,0.00005499568,0.0011685161,0.00026363684,0.000046081164,0.00010147825,0.00008611641,0.004197723,0.008963836,0.02227853,0.10465196,0.8581194],"study_design_scores_gemma":[0.000028862582,0.00013199862,0.005243187,0.00029976794,0.00014778353,0.0012582161,0.00025050156,0.19985127,0.035415016,0.09561479,0.66164976,0.000108808505],"about_ca_topic_score_codex":0.0017971703,"about_ca_topic_score_gemma":0.002505816,"teacher_disagreement_score":0.043976795,"about_ca_system_score_codex":0.00061436364,"about_ca_system_score_gemma":0.0007361423,"threshold_uncertainty_score":0.14711702},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073913927,0.0048122057,0.8634969,0.0034394583,0.0009987316,0.00072344486,0.008557416,0.0050128605,0.10556757],"genre_scores_gemma":[0.08155939,0.009273664,0.71910596,0.0009981963,0.001167936,0.00088667404,0.02329524,0.0011374326,0.16257559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916184,0.00015536464,0.000043265616,0.00024553848,0.00035385336,0.00004014591],"domain_scores_gemma":[0.99891746,0.0004717478,0.00006291344,0.0002639027,0.00023776048,0.000046178826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009812256,0.0010506415,0.00073273794,0.003938315,0.0011012638,0.002079271,0.0012696002,0.0007495807,0.017451223],"category_scores_gemma":[0.0038061463,0.00048245245,0.0010721975,0.0040755747,0.0003942765,0.0032270518,0.001717827,0.0012088444,0.013658249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021769269,0.00008621738,0.0014702837,0.00033611458,0.00007159392,0.00007616185,0.00017260494,0.0056353295,0.0017236372,0.05251489,0.11303346,0.824858],"study_design_scores_gemma":[0.0000132441855,0.000044509277,0.004500488,0.00036972354,0.000097971555,0.0007662595,0.00039460254,0.13874482,0.008013826,0.25285703,0.59413815,0.000059389044],"about_ca_topic_score_codex":0.0017811974,"about_ca_topic_score_gemma":0.0038040117,"teacher_disagreement_score":0.017451223,"about_ca_system_score_codex":0.00072551204,"about_ca_system_score_gemma":0.00088535895,"threshold_uncertainty_score":0.058380187},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07523959,0.001259337,0.9144193,0.0005495124,0.00010614794,0.00030161862,0.0010178644,0.0012789553,0.0058276374],"genre_scores_gemma":[0.7286511,0.000992799,0.2630019,0.00019630602,0.00022202294,0.00021696316,0.0017709259,0.00018886651,0.004759045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967781,0.0012690618,0.00015734156,0.0005449491,0.0010484052,0.0002021678],"domain_scores_gemma":[0.9872814,0.006359778,0.0017932173,0.002315902,0.0019453946,0.00030437845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026104692,0.0009967563,0.0010863484,0.007945565,0.0014692919,0.0025532248,0.0019210879,0.0014514178,0.0028476869],"category_scores_gemma":[0.02283113,0.0005035873,0.000857296,0.0071632294,0.0007095456,0.0042906906,0.0020306595,0.0011900278,0.001107272],"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.00021762848,0.00033879167,0.015852977,0.0003157961,0.00039815408,0.0003018136,0.0005150401,0.6242721,0.0066140634,0.08689321,0.011155731,0.2531247],"study_design_scores_gemma":[0.0000165763,0.00005679232,0.002758444,0.000020066029,0.00006967796,0.000263069,0.000164009,0.9445735,0.0028382326,0.04372952,0.0054696053,0.000040484963],"about_ca_topic_score_codex":0.0060780924,"about_ca_topic_score_gemma":0.004733821,"teacher_disagreement_score":0.007945565,"about_ca_system_score_codex":0.0012413865,"about_ca_system_score_gemma":0.0011350249,"threshold_uncertainty_score":0.013805687},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019729333,0.0014013052,0.92143524,0.0011893852,0.00031371065,0.00019317064,0.002140821,0.0026955297,0.068657815],"genre_scores_gemma":[0.0447572,0.0053695845,0.7798055,0.0006993514,0.0006504441,0.0007545637,0.0076138745,0.002124997,0.15822445],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992073,0.00022341266,0.0000371545,0.00021268839,0.00028134586,0.000038088878],"domain_scores_gemma":[0.99777055,0.001282259,0.00008276051,0.0004342882,0.00036490484,0.00006524295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014805355,0.0012854744,0.000592208,0.0036717935,0.0007774234,0.002676821,0.0011053655,0.00063667586,0.03559974],"category_scores_gemma":[0.005175849,0.00052827137,0.0010675758,0.0031638758,0.0006847754,0.0031995042,0.0021960835,0.0015162224,0.015765602],"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.000025689882,0.000042033458,0.00088942284,0.00042875967,0.0000879769,0.000121927005,0.00054723374,0.01018392,0.0022875448,0.22281079,0.13670121,0.6258735],"study_design_scores_gemma":[0.000008339176,0.000019882005,0.0013779195,0.00029316705,0.000055860422,0.0004046176,0.0004015255,0.059646834,0.003485912,0.48236978,0.4518953,0.00004088095],"about_ca_topic_score_codex":0.0012469003,"about_ca_topic_score_gemma":0.0024422735,"teacher_disagreement_score":0.03559974,"about_ca_system_score_codex":0.0007172877,"about_ca_system_score_gemma":0.0008850882,"threshold_uncertainty_score":0.119093},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022833457,0.003194276,0.7997897,0.0017996993,0.0009895773,0.00022269152,0.0013783181,0.0025318905,0.18781047],"genre_scores_gemma":[0.06093657,0.010295811,0.51282334,0.0010436806,0.0013381214,0.0005736207,0.006128949,0.0019695342,0.4048905],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950767,0.000084225016,0.000019331483,0.00018403438,0.00017363974,0.0000311432],"domain_scores_gemma":[0.99929106,0.0002074336,0.000030029343,0.00022302414,0.00020811305,0.000040315666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006038561,0.0010820208,0.0006514225,0.0022735426,0.0010784392,0.0018735575,0.0013450532,0.0008473909,0.033085644],"category_scores_gemma":[0.0022994408,0.0004869653,0.00078406726,0.002764113,0.00064337614,0.0028219526,0.0016610562,0.0013767751,0.01756884],"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.000024987645,0.000037738606,0.00032284664,0.00030861644,0.00005181196,0.00007537826,0.00017198153,0.025562484,0.0017627493,0.259924,0.169751,0.54200643],"study_design_scores_gemma":[0.000007973831,0.000022785413,0.00066995056,0.00016590585,0.00004024759,0.00037108827,0.00014745239,0.07345346,0.0035289794,0.33442464,0.5871313,0.000036128455],"about_ca_topic_score_codex":0.0021870825,"about_ca_topic_score_gemma":0.0036407437,"teacher_disagreement_score":0.033085644,"about_ca_system_score_codex":0.0012025818,"about_ca_system_score_gemma":0.0008392148,"threshold_uncertainty_score":0.11068249},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013372094,0.0025883005,0.43688774,0.0041043023,0.0020840692,0.00020384409,0.0014336109,0.00073864724,0.53858745],"genre_scores_gemma":[0.25082222,0.006223173,0.09505891,0.0010792854,0.0018935547,0.00056632113,0.0029063772,0.00059502904,0.64085513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947804,0.0001425559,0.00002491549,0.00012817832,0.00019434954,0.000032061882],"domain_scores_gemma":[0.9990582,0.00038130477,0.00008459752,0.00019678632,0.00020425399,0.00007493482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046795188,0.0006556248,0.00032036423,0.0013250149,0.0009355837,0.0027682842,0.0005871861,0.00083170686,0.029300794],"category_scores_gemma":[0.0042228745,0.0002606982,0.00026193497,0.0013709089,0.00093574636,0.004787062,0.001537188,0.0012963235,0.008046742],"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.000010265777,0.00001444697,0.0001217363,0.000085697124,0.000006245551,0.000043000906,0.00015246191,0.0020488298,0.00061549386,0.87934107,0.025888296,0.091672406],"study_design_scores_gemma":[0.0000047039307,0.000013494304,0.0002167992,0.000059077054,0.000007603878,0.00015900866,0.00013227403,0.010288155,0.0007765855,0.7549093,0.23342001,0.0000129399505],"about_ca_topic_score_codex":0.00046377914,"about_ca_topic_score_gemma":0.00072768936,"teacher_disagreement_score":0.029300794,"about_ca_system_score_codex":0.00070577307,"about_ca_system_score_gemma":0.0005265463,"threshold_uncertainty_score":0.09802085},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009891415,0.014212205,0.21994875,0.0063543194,0.002705011,0.00015709312,0.0012323186,0.0013201502,0.7441787],"genre_scores_gemma":[0.15166,0.018616395,0.043304257,0.00086366193,0.0022495072,0.00026413606,0.0017137242,0.00084121374,0.78048706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966526,0.000057550646,0.000012370088,0.00011264625,0.00012003946,0.000032109507],"domain_scores_gemma":[0.9993777,0.0002521768,0.00004087747,0.00011179429,0.00015875814,0.00005855421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005754763,0.00072683,0.0005145864,0.0016074482,0.0007677799,0.0029787633,0.0006601167,0.000854475,0.037703104],"category_scores_gemma":[0.0030774698,0.0003857283,0.00049164053,0.0024182713,0.0006729759,0.004768664,0.001426137,0.0014212555,0.011433058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035470453,0.00003218638,0.00034277997,0.0003028004,0.000031442043,0.000064701584,0.00044236428,0.0045255483,0.0019786132,0.6118415,0.11599542,0.26440725],"study_design_scores_gemma":[0.0000103785405,0.00002346745,0.00090042764,0.00013865478,0.000036436573,0.00027501682,0.00022379412,0.023014216,0.0019382809,0.39001352,0.5833954,0.00003035935],"about_ca_topic_score_codex":0.001572919,"about_ca_topic_score_gemma":0.0015786466,"teacher_disagreement_score":0.037703104,"about_ca_system_score_codex":0.0012593936,"about_ca_system_score_gemma":0.0006670954,"threshold_uncertainty_score":0.12612945},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004574544,0.0050307824,0.6059845,0.0038773532,0.0011371779,0.00035525544,0.0040137097,0.0023092995,0.37271738],"genre_scores_gemma":[0.1059507,0.01100358,0.35058933,0.0014882009,0.0016352313,0.00081677857,0.0098091755,0.0012811652,0.5174259],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992155,0.00021799281,0.000025519103,0.00017509234,0.00032422805,0.000041739342],"domain_scores_gemma":[0.99888664,0.00055582094,0.00004983553,0.00021657295,0.00024368791,0.000047420705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009607171,0.00086541555,0.0005109926,0.003611153,0.0009894836,0.0024851582,0.0007837184,0.00072990527,0.035927735],"category_scores_gemma":[0.0035955613,0.00035310333,0.00066257775,0.0033236076,0.00065584324,0.0028620877,0.001358762,0.0010812382,0.017364377],"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.000012952914,0.00005012208,0.0011051493,0.00021192382,0.00004974535,0.00007240239,0.0003416922,0.005861125,0.00089271396,0.31195098,0.18329757,0.49615356],"study_design_scores_gemma":[0.0000042198394,0.000015927179,0.0020655105,0.00016188328,0.00003151573,0.00027458314,0.00037242405,0.04247981,0.0013877765,0.38654968,0.5666296,0.000027024427],"about_ca_topic_score_codex":0.002686019,"about_ca_topic_score_gemma":0.0043424126,"teacher_disagreement_score":0.035927735,"about_ca_system_score_codex":0.0011026516,"about_ca_system_score_gemma":0.00085610745,"threshold_uncertainty_score":0.12019026},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009061947,0.0043307072,0.7345168,0.0024883868,0.0011239734,0.00036446808,0.0014204181,0.001643348,0.24504998],"genre_scores_gemma":[0.2856444,0.010310797,0.42315945,0.0012785438,0.0020894955,0.0008301751,0.005864216,0.0010328455,0.26979005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903226,0.00016224569,0.0000480882,0.0003604796,0.000350138,0.00004675029],"domain_scores_gemma":[0.9987581,0.00040886202,0.00008741172,0.0003394344,0.00033525535,0.00007093434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074111734,0.0007539978,0.0006549715,0.003745102,0.0009414263,0.0024282732,0.0012526971,0.0010813335,0.023811556],"category_scores_gemma":[0.0048753317,0.00033240614,0.0007041838,0.0036111253,0.0009313328,0.0049094246,0.0022973074,0.0012161505,0.008347861],"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.000029505018,0.000045083067,0.0007113019,0.00030113102,0.000057255147,0.00007402339,0.00020261308,0.009985544,0.0023133769,0.45855948,0.055700827,0.47201982],"study_design_scores_gemma":[0.000010164261,0.00005195704,0.0014498313,0.00013343537,0.000057228935,0.00068047334,0.00025779218,0.06803623,0.004371251,0.6403351,0.2845761,0.00004048676],"about_ca_topic_score_codex":0.0011854102,"about_ca_topic_score_gemma":0.0014211574,"teacher_disagreement_score":0.023811556,"about_ca_system_score_codex":0.0012777378,"about_ca_system_score_gemma":0.00075908477,"threshold_uncertainty_score":0.079657555},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040562944,0.0080662975,0.7588245,0.005809094,0.0014422421,0.00012287323,0.0020068798,0.0020080707,0.21766365],"genre_scores_gemma":[0.18107918,0.030105706,0.3044908,0.0026614752,0.004766432,0.0008205586,0.00863746,0.0020485884,0.46538985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951756,0.0001004404,0.000018148829,0.0001628065,0.0001767435,0.00002435182],"domain_scores_gemma":[0.99869627,0.00073913875,0.00005246682,0.0003026617,0.00015794171,0.000051475283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005994204,0.00092405494,0.00052565924,0.0014016804,0.00055214646,0.0020439366,0.0007993837,0.00084947265,0.029727079],"category_scores_gemma":[0.0041462434,0.0004588499,0.00043750476,0.0015238959,0.0007939996,0.0046518478,0.0016679562,0.0017090344,0.010704226],"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.0000229745,0.000026110449,0.0003040437,0.00035482668,0.00004708234,0.000080189646,0.000114692324,0.021297755,0.0014801807,0.58254105,0.12683485,0.26689625],"study_design_scores_gemma":[0.0000050243143,0.000010414653,0.00028072583,0.00008308969,0.00001780177,0.00013615271,0.000037958245,0.035372764,0.0009596648,0.7110958,0.2519872,0.000013440071],"about_ca_topic_score_codex":0.0007058232,"about_ca_topic_score_gemma":0.0010298132,"teacher_disagreement_score":0.029727079,"about_ca_system_score_codex":0.00081626425,"about_ca_system_score_gemma":0.00050147774,"threshold_uncertainty_score":0.09944695},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042541446,0.005953646,0.88090914,0.0035726526,0.0008301043,0.00008385475,0.001319988,0.0012887891,0.10178766],"genre_scores_gemma":[0.24692667,0.031426884,0.50381696,0.0016578252,0.0030946773,0.00069471414,0.00701082,0.0015802296,0.2037912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996137,0.000081957434,0.000015699357,0.00014335963,0.0001273174,0.000017961025],"domain_scores_gemma":[0.9988796,0.0006460802,0.000050646915,0.000254595,0.0001198781,0.00004915304],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006101455,0.0009208105,0.00059480104,0.0014078955,0.0005545602,0.0023451932,0.00094551506,0.00088271487,0.014231808],"category_scores_gemma":[0.0038137457,0.00052605773,0.00059864053,0.0020524345,0.0009829408,0.0052471207,0.001872537,0.0020044385,0.004145675],"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.000015289917,0.000021924576,0.00039612065,0.00027767048,0.000063368665,0.00009586093,0.00013732242,0.038577102,0.0013870688,0.73255473,0.059738044,0.16673554],"study_design_scores_gemma":[0.000003861292,0.0000068400464,0.0003367023,0.000054991753,0.000017717448,0.00012742351,0.00004255833,0.07093101,0.0005182901,0.82364154,0.10430439,0.000014664766],"about_ca_topic_score_codex":0.0011414139,"about_ca_topic_score_gemma":0.0017415383,"teacher_disagreement_score":0.9857682,"about_ca_system_score_codex":0.0009278384,"about_ca_system_score_gemma":0.000523896,"threshold_uncertainty_score":0.047610104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116715044,0.0003073956,0.87518233,0.0007756269,0.000053703996,0.00006475802,0.00017902888,0.00025078873,0.0064713447],"genre_scores_gemma":[0.9529206,0.00050307915,0.041184697,0.00016985295,0.00007918845,0.00018848563,0.00013205939,0.00011865712,0.004703371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908066,0.0003528577,0.00003712854,0.00024905687,0.00017117348,0.000109129855],"domain_scores_gemma":[0.9919308,0.005190331,0.0013742814,0.00070943206,0.00044684642,0.00034826397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014604026,0.0007802117,0.0007834663,0.0013313815,0.0007906672,0.0020946686,0.0015495414,0.0014404304,0.002322988],"category_scores_gemma":[0.007962857,0.0008238295,0.0011914336,0.00081501174,0.0026741987,0.0035356795,0.0019428652,0.0019934324,0.0003373226],"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.00006515643,0.000048615413,0.0026834698,0.00009248682,0.000062346204,0.0004426068,0.00036568154,0.57149935,0.004419429,0.41422966,0.0009868267,0.005104377],"study_design_scores_gemma":[0.000008638041,0.000017816114,0.000251135,0.0000075405515,0.0000112343605,0.000063400425,0.000025355488,0.90799785,0.00038243135,0.09054231,0.0006840132,0.0000084087405],"about_ca_topic_score_codex":0.0039043538,"about_ca_topic_score_gemma":0.0038025086,"teacher_disagreement_score":0.0039043538,"about_ca_system_score_codex":0.0017496272,"about_ca_system_score_gemma":0.0007173335,"threshold_uncertainty_score":0.012694418},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010329208,0.023447467,0.92944366,0.0016117962,0.00085194485,0.0004421855,0.001403976,0.0029726324,0.029497279],"genre_scores_gemma":[0.122392155,0.015799154,0.81534916,0.00040199788,0.0014675232,0.000676634,0.005969871,0.0009597658,0.03698382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986431,0.00045173953,0.00012469414,0.00033675492,0.00038184138,0.00006197723],"domain_scores_gemma":[0.99805224,0.0010551997,0.00017669961,0.00020850188,0.00046679427,0.000040665644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015824995,0.0012594297,0.0008431299,0.004227992,0.0008538622,0.003135384,0.0010396874,0.00077887945,0.007844814],"category_scores_gemma":[0.0045945873,0.00035180687,0.00083615043,0.0058791256,0.00053952564,0.0047326703,0.0013667438,0.0009520634,0.0037061682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008852453,0.00006712085,0.0006069288,0.0011478239,0.00010940164,0.00015003556,0.0008236279,0.012498273,0.0068596564,0.045852564,0.02357984,0.9082163],"study_design_scores_gemma":[0.000052628893,0.0002522198,0.0040968666,0.00065496936,0.0003873959,0.0007525725,0.0015056588,0.26671067,0.022701288,0.19577536,0.50697696,0.00013340206],"about_ca_topic_score_codex":0.0015337493,"about_ca_topic_score_gemma":0.0021365872,"teacher_disagreement_score":0.007844814,"about_ca_system_score_codex":0.0009537057,"about_ca_system_score_gemma":0.00060862704,"threshold_uncertainty_score":0.026243508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7095204,0.0058218655,0.034338646,0.008696844,0.00011547048,0.0002761904,0.00084109453,0.00012316552,0.24026631],"genre_scores_gemma":[0.9916284,0.0014014913,0.0035532373,0.0001396654,0.00001718619,0.000057362417,0.000084373125,0.000009217459,0.003109082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99756336,0.001090541,0.00016555084,0.000298645,0.00032281064,0.00055909756],"domain_scores_gemma":[0.9911107,0.0045210198,0.0021378484,0.00076736923,0.00071234035,0.0007508205],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0035644325,0.0003211633,0.00035572896,0.004071835,0.0039134664,0.0060108732,0.0006002257,0.0009567897,0.007570019],"category_scores_gemma":[0.008440461,0.00034605974,0.00032162262,0.0065095155,0.0042023635,0.0054227626,0.0068535074,0.0013139803,0.0004094794],"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.00012405613,0.00007446161,0.044383083,0.00030460104,0.000036686033,0.002575436,0.019076828,0.0035036118,0.00047727,0.87534153,0.0023478311,0.051754527],"study_design_scores_gemma":[0.00008771302,0.00019372787,0.06584315,0.0020080172,0.00013447809,0.0032215975,0.09652231,0.018805047,0.0032547938,0.45105183,0.35872835,0.00014905994],"about_ca_topic_score_codex":0.010667327,"about_ca_topic_score_gemma":0.006925367,"teacher_disagreement_score":0.9993998,"about_ca_system_score_codex":0.004239044,"about_ca_system_score_gemma":0.004040328,"threshold_uncertainty_score":0.030756533},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011090395,0.026941964,0.91643363,0.0018411027,0.0011195834,0.00051910523,0.0017010235,0.0044206795,0.035932634],"genre_scores_gemma":[0.10061729,0.016000047,0.8294633,0.00043114318,0.001494821,0.0006949217,0.0070190085,0.0010372933,0.043242224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856865,0.0004224805,0.00013317553,0.0003423153,0.0004669788,0.00006627673],"domain_scores_gemma":[0.99809986,0.00092014996,0.00016368355,0.00019781965,0.0005765523,0.000041827712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016011868,0.0012235605,0.00090907636,0.0043304306,0.0008218533,0.0031532387,0.0010476994,0.0007107753,0.008807012],"category_scores_gemma":[0.004875665,0.00036201344,0.00084716483,0.0055844174,0.00048677155,0.004865528,0.001358291,0.0009219723,0.003966499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008949494,0.000060669645,0.00050996843,0.00085375545,0.00009365484,0.00012424088,0.0005679527,0.01056176,0.0059630424,0.036212333,0.02824515,0.9167181],"study_design_scores_gemma":[0.000060283688,0.00027273042,0.004162708,0.00063476886,0.00036426896,0.0007705928,0.0013779236,0.25916094,0.0271892,0.15884179,0.54702324,0.00014156653],"about_ca_topic_score_codex":0.0018208495,"about_ca_topic_score_gemma":0.0025661099,"teacher_disagreement_score":0.008807012,"about_ca_system_score_codex":0.0010220474,"about_ca_system_score_gemma":0.00071061077,"threshold_uncertainty_score":0.029462337},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051108617,0.0036767684,0.98056567,0.0008563899,0.00029956724,0.00015891502,0.00040404956,0.00037616133,0.008551592],"genre_scores_gemma":[0.16234252,0.0035213418,0.81729335,0.00060829835,0.0018770406,0.00085598876,0.0026684983,0.00083179737,0.01000126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9827077,0.007173133,0.0010654912,0.0022394108,0.006341848,0.00047254967],"domain_scores_gemma":[0.92977977,0.055978145,0.0016522928,0.0043723597,0.0073589785,0.00085845974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017489398,0.0016756137,0.002996834,0.008250608,0.002522499,0.0055652363,0.005098459,0.0031086628,0.0079758065],"category_scores_gemma":[0.09459515,0.0010553127,0.0024603175,0.0077960603,0.0041113175,0.011628416,0.004566155,0.006209923,0.002616211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031145234,0.00020683518,0.0027470035,0.0013515532,0.00031849544,0.00015327209,0.00042624032,0.061550092,0.002865285,0.5269956,0.029399745,0.37367436],"study_design_scores_gemma":[0.000033846733,0.00007566606,0.0006688753,0.00025868748,0.000072620234,0.00019241209,0.00010029824,0.3341764,0.001617558,0.6514344,0.011328698,0.000040657047],"about_ca_topic_score_codex":0.0018172788,"about_ca_topic_score_gemma":0.0018883258,"teacher_disagreement_score":0.017489398,"about_ca_system_score_codex":0.002933363,"about_ca_system_score_gemma":0.0020515304,"threshold_uncertainty_score":0.09249389},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044909283,0.0017558279,0.85502905,0.004328685,0.0015581936,0.00035116778,0.0012958678,0.0016644858,0.12952572],"genre_scores_gemma":[0.26409623,0.0060250093,0.38004503,0.0037291609,0.0036722245,0.0023976222,0.004179921,0.001949374,0.3339055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843305,0.0005735429,0.000045309687,0.00041080013,0.00043647617,0.000100822515],"domain_scores_gemma":[0.9964104,0.0018400932,0.0001866969,0.00094444136,0.00043949723,0.00017880203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017228969,0.00086794666,0.00093299063,0.001775624,0.0012356491,0.0019998203,0.0013085647,0.0010316859,0.03238425],"category_scores_gemma":[0.010678735,0.0003993444,0.00085684273,0.0017287345,0.0015462155,0.0033974696,0.0022360927,0.0028233351,0.009397059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003760466,0.00006194907,0.00026771583,0.000104814135,0.000028242777,0.000029225826,0.000057080393,0.009966595,0.0004995398,0.7967995,0.06171643,0.13043123],"study_design_scores_gemma":[0.000023465669,0.000021925958,0.00031336202,0.000061243314,0.000018494417,0.00008948354,0.00003197945,0.07334811,0.0007426264,0.83591795,0.089410804,0.00002050455],"about_ca_topic_score_codex":0.0012091807,"about_ca_topic_score_gemma":0.0014521028,"teacher_disagreement_score":0.03238425,"about_ca_system_score_codex":0.0015567325,"about_ca_system_score_gemma":0.0015875024,"threshold_uncertainty_score":0.10833609},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65709835,0.0007076178,0.32914424,0.0026832295,0.00006297497,0.00022667197,0.0023783548,0.00050543435,0.007193207],"genre_scores_gemma":[0.9687843,0.00040316646,0.026799647,0.00013951128,0.00005498209,0.0001657572,0.0010312643,0.00005657624,0.0025648226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997931,0.0010390579,0.00008324286,0.00057486456,0.00023240897,0.0001393363],"domain_scores_gemma":[0.9873834,0.007887523,0.002321119,0.0013626277,0.0006249042,0.0004203927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023987212,0.00077773427,0.0007568301,0.0023880133,0.0010237059,0.002277749,0.0027943754,0.002140958,0.002424929],"category_scores_gemma":[0.017920071,0.0006794918,0.0010333502,0.002158883,0.0016976643,0.005706646,0.0014899842,0.0010764136,0.0004284808],"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.00010181051,0.0001417688,0.018046435,0.00010867189,0.00011870298,0.00026563022,0.0005522805,0.88043815,0.00082085293,0.08750733,0.0023212472,0.009577092],"study_design_scores_gemma":[0.000008689757,0.000011450588,0.0009989925,0.000007995094,0.0000060466286,0.000050884977,0.00005969453,0.9606096,0.00012577492,0.03758619,0.000528077,0.0000065584477],"about_ca_topic_score_codex":0.00853871,"about_ca_topic_score_gemma":0.00941725,"teacher_disagreement_score":0.00853871,"about_ca_system_score_codex":0.0023172286,"about_ca_system_score_gemma":0.0005640956,"threshold_uncertainty_score":0.016978025},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022565564,0.003700122,0.79032815,0.0020976497,0.0013212323,0.00023922419,0.0016618394,0.0029709789,0.19542421],"genre_scores_gemma":[0.061108414,0.011742603,0.5008415,0.0011962232,0.0017522769,0.0006198581,0.007394629,0.002322995,0.41302153],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947244,0.000086437074,0.000020387259,0.00020389036,0.00018433791,0.00003261745],"domain_scores_gemma":[0.9992073,0.00023057313,0.000033128756,0.00024943746,0.00023352457,0.000046003934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064835843,0.0011539266,0.0006725124,0.00234274,0.0010988053,0.0020184298,0.0014117924,0.0009007758,0.03657423],"category_scores_gemma":[0.0025978524,0.0004978542,0.0008340167,0.0028235794,0.00064149586,0.0029920493,0.00174931,0.0014899203,0.021055402],"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.000027382608,0.000040495433,0.00031112003,0.00035142052,0.00005513091,0.000073023075,0.00015972416,0.024435362,0.0018672071,0.24998632,0.18614267,0.5365501],"study_design_scores_gemma":[0.000008075253,0.000023292565,0.0006518165,0.00017316558,0.000040393214,0.00034673352,0.00013018589,0.06667745,0.0034478523,0.3194984,0.6089669,0.000035813788],"about_ca_topic_score_codex":0.001973549,"about_ca_topic_score_gemma":0.0032069676,"teacher_disagreement_score":0.03657423,"about_ca_system_score_codex":0.0012246531,"about_ca_system_score_gemma":0.0008571894,"threshold_uncertainty_score":0.12235296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37944087,0.0022151282,0.5119692,0.0022825361,0.0010826159,0.0019220909,0.019746065,0.0011620165,0.08017952],"genre_scores_gemma":[0.8829405,0.00065097015,0.09249611,0.00022774577,0.00042348006,0.0029997332,0.0069363248,0.00020908137,0.013116054],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.98552424,0.007974449,0.0006728662,0.0023707363,0.0027412544,0.00071652123],"domain_scores_gemma":[0.94877595,0.038722936,0.004420936,0.0028386232,0.0044052247,0.00083636394],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.009783769,0.0009094155,0.0014098864,0.011543069,0.0020512443,0.0033305362,0.0016340658,0.0011767375,0.02142895],"category_scores_gemma":[0.05680616,0.00031135677,0.0013413241,0.018391594,0.0011341734,0.0028756082,0.0023715408,0.0020611256,0.0040526344],"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.0016181116,0.0010777282,0.30487698,0.0011758117,0.0023712781,0.0014745536,0.0059935465,0.024993546,0.0014071481,0.2667403,0.043221246,0.34504974],"study_design_scores_gemma":[0.00019817421,0.0016713818,0.21887594,0.00052687037,0.0010795182,0.0018467553,0.016155817,0.28499556,0.0034542049,0.331058,0.13982578,0.00031200115],"about_ca_topic_score_codex":0.0034843283,"about_ca_topic_score_gemma":0.0025524138,"teacher_disagreement_score":0.9884569,"about_ca_system_score_codex":0.0017024453,"about_ca_system_score_gemma":0.0022620275,"threshold_uncertainty_score":0.07168698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012683719,0.018574713,0.116888165,0.016149368,0.004134235,0.000035931564,0.00046414393,0.00043104103,0.84205395],"genre_scores_gemma":[0.07715004,0.035860345,0.045418423,0.007843732,0.0073995413,0.00027929398,0.0007843054,0.0009334746,0.8243308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949527,0.00012902445,0.000014772418,0.00013409014,0.00019355825,0.000033217755],"domain_scores_gemma":[0.9993136,0.00040608787,0.000023813862,0.00012114362,0.00009996603,0.000035392077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006430329,0.00094745064,0.00046536385,0.0016776266,0.001520289,0.0045616706,0.0008735853,0.0014347995,0.037526086],"category_scores_gemma":[0.0029595823,0.0003852777,0.0004341038,0.0019114045,0.0037275744,0.008880424,0.0015295992,0.0029591771,0.012324886],"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.000003007935,0.0000057722423,0.000041081596,0.000073698844,0.000004371089,0.0000143769175,0.00020403683,0.0008748283,0.000085614134,0.87491024,0.075544775,0.04823829],"study_design_scores_gemma":[0.000001001172,0.0000020956056,0.000056018056,0.00008528604,0.0000025863483,0.00004067402,0.000071770664,0.00087707327,0.000058825957,0.5919616,0.4068384,0.0000046542423],"about_ca_topic_score_codex":0.001911321,"about_ca_topic_score_gemma":0.0028326523,"teacher_disagreement_score":0.037526086,"about_ca_system_score_codex":0.0016561286,"about_ca_system_score_gemma":0.0007408264,"threshold_uncertainty_score":0.12553734},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063416352,0.006498793,0.2843009,0.004023987,0.0013816345,0.00023658943,0.004105122,0.002391525,0.69071984],"genre_scores_gemma":[0.087474234,0.013333734,0.08611356,0.0008746932,0.0016021803,0.0005449546,0.009018998,0.0012801,0.79975754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996357,0.00008012283,0.000016979213,0.00012976253,0.000102054306,0.00003553571],"domain_scores_gemma":[0.9994375,0.00020336865,0.00003564011,0.00010723787,0.00014573491,0.00007058458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043228478,0.0006818326,0.00041252587,0.0020576213,0.0009946148,0.0036514425,0.0008347506,0.000718523,0.07842154],"category_scores_gemma":[0.0025870614,0.0003868839,0.0005141135,0.0031385438,0.0004904325,0.0058826134,0.0019729263,0.0010937799,0.031541754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037859132,0.000029814702,0.00040290446,0.0003409045,0.000031520707,0.00008753356,0.00045708902,0.0036212883,0.0016845469,0.44744292,0.18153891,0.36432478],"study_design_scores_gemma":[0.000005433726,0.000012719747,0.00043722175,0.00011117296,0.00001983874,0.00020270108,0.00022342906,0.0075996635,0.00082944165,0.2030937,0.7874517,0.000013026927],"about_ca_topic_score_codex":0.0013601132,"about_ca_topic_score_gemma":0.002092454,"teacher_disagreement_score":0.07842154,"about_ca_system_score_codex":0.0009865236,"about_ca_system_score_gemma":0.0006761305,"threshold_uncertainty_score":0.26234615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013868472,0.00014377268,0.0003807376,0.0003974968,0.00015192317,0.00004019862,0.9941157,0.0013240433,0.0020592934],"genre_scores_gemma":[0.0019721882,0.000064309665,0.0011129451,0.00009546985,0.00003127607,0.000059047696,0.99467987,0.000098695025,0.0018861488],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870026,0.00024135824,0.00009884787,0.00041334218,0.00035666424,0.00018952486],"domain_scores_gemma":[0.9962788,0.00095389603,0.00031923509,0.0009612065,0.00095104426,0.0005357559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021236865,0.0029188471,0.0014299605,0.0036747323,0.0011237336,0.0029002605,0.003947547,0.0031819178,0.034519345],"category_scores_gemma":[0.010442194,0.0006979513,0.0017718821,0.00354858,0.00046119443,0.0015674932,0.0021272595,0.0017731239,0.039321683],"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.00007111042,0.00005295642,0.0023100192,0.00028534044,0.00005230887,0.000022520691,0.000018088223,0.00050645205,0.0001639815,0.0002380376,0.99243426,0.0038448568],"study_design_scores_gemma":[0.00071449013,0.00007118095,0.022083946,0.0003131836,0.00017266982,0.00017267706,0.00018792102,0.009680118,0.0017646375,0.0029344535,0.96183,0.0000747377],"about_ca_topic_score_codex":0.040900897,"about_ca_topic_score_gemma":0.12222965,"teacher_disagreement_score":0.040900897,"about_ca_system_score_codex":0.0016154082,"about_ca_system_score_gemma":0.0027131012,"threshold_uncertainty_score":0.115478694},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043234553,0.0047354815,0.48745346,0.0056860093,0.0014388681,0.00023191469,0.0017630231,0.00090407894,0.45455256],"genre_scores_gemma":[0.5046003,0.007040236,0.083353564,0.0012601274,0.0025515403,0.0005964313,0.0016608067,0.00032971945,0.3986073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995809,0.00010654992,0.000014037688,0.00014159699,0.000116707786,0.00004018616],"domain_scores_gemma":[0.9990972,0.00040025843,0.00009412387,0.00015305752,0.00015211444,0.00010333965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043412676,0.00070421066,0.00033199348,0.002007263,0.0011877517,0.0025303494,0.000587753,0.00082811347,0.02255775],"category_scores_gemma":[0.0037341642,0.00036650043,0.000327643,0.001626803,0.0008386037,0.0045545786,0.0016754702,0.0010515122,0.0039029503],"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.000022070604,0.000021912909,0.00041689118,0.00010419685,0.000024878982,0.00008697732,0.00023803338,0.005100108,0.001127567,0.88799965,0.023243433,0.08161421],"study_design_scores_gemma":[0.000006202295,0.00001733204,0.0007951349,0.00006957349,0.000026992486,0.00030969852,0.00020802705,0.029152377,0.0011343035,0.8150468,0.15321347,0.000020156145],"about_ca_topic_score_codex":0.00083599915,"about_ca_topic_score_gemma":0.0012421362,"teacher_disagreement_score":0.02255775,"about_ca_system_score_codex":0.0008371873,"about_ca_system_score_gemma":0.00035032618,"threshold_uncertainty_score":0.075463235},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053175434,0.00051075657,0.9417274,0.00037265435,0.000093656745,0.00016751574,0.0004805473,0.0011828933,0.0022891809],"genre_scores_gemma":[0.57807606,0.00055057777,0.4161566,0.00016286492,0.0002099743,0.00040824435,0.0014405219,0.00023760746,0.0027575714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968616,0.0011448724,0.00015519527,0.0007224891,0.0008946035,0.00022124838],"domain_scores_gemma":[0.9888721,0.005388261,0.00204559,0.0013909077,0.0016994503,0.0006037361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022839566,0.0010615406,0.0012480709,0.008034754,0.0017690024,0.002545869,0.0016946726,0.0014150115,0.0019144226],"category_scores_gemma":[0.015579347,0.0005839844,0.0011312277,0.005434613,0.0015457107,0.004512559,0.0035169888,0.0017434342,0.0013926977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008288869,0.00045916092,0.058466554,0.0010048852,0.0005754002,0.00087422755,0.0041556116,0.26849777,0.023020318,0.11247623,0.019693144,0.50994784],"study_design_scores_gemma":[0.000039037313,0.00012071458,0.0046217013,0.000057487618,0.000058450743,0.0005311578,0.0007624066,0.89796674,0.0051076915,0.08391974,0.006742712,0.00007215295],"about_ca_topic_score_codex":0.003304812,"about_ca_topic_score_gemma":0.0047326167,"teacher_disagreement_score":0.008034754,"about_ca_system_score_codex":0.0010128891,"about_ca_system_score_gemma":0.0007968624,"threshold_uncertainty_score":0.012078881},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5729736,0.0015688757,0.39089066,0.0024138007,0.0001267551,0.00019132458,0.006061857,0.0009393906,0.024833752],"genre_scores_gemma":[0.8992388,0.00079038384,0.09546109,0.000135853,0.00006031804,0.0002307416,0.0020480948,0.00013219351,0.0019024414],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993637,0.00029051164,0.000026275726,0.00020202663,0.000071661714,0.00004565834],"domain_scores_gemma":[0.9943111,0.0036019988,0.0011169906,0.00039148072,0.00034295072,0.00023548168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012831166,0.0005775487,0.00030972218,0.005497071,0.000859581,0.0017690209,0.00039359584,0.0005509665,0.004083733],"category_scores_gemma":[0.008416841,0.00022112715,0.00045346894,0.0033365614,0.0009756144,0.0028581345,0.0014244553,0.0007526675,0.00040623217],"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.0009767779,0.0002616725,0.36728254,0.0014928611,0.00095528935,0.00080042507,0.02834932,0.05553668,0.040959407,0.19394466,0.011368843,0.29807153],"study_design_scores_gemma":[0.00006303481,0.00017450505,0.31291708,0.00036907053,0.00029497215,0.0007017688,0.012690896,0.30101454,0.008355317,0.3243718,0.03887685,0.00017016623],"about_ca_topic_score_codex":0.013126516,"about_ca_topic_score_gemma":0.018720549,"teacher_disagreement_score":0.9868735,"about_ca_system_score_codex":0.0013218737,"about_ca_system_score_gemma":0.0006840967,"threshold_uncertainty_score":0.026100218},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021287007,0.0034135024,0.9469753,0.0025062235,0.0006024954,0.0000745896,0.0027175548,0.0012259684,0.04035569],"genre_scores_gemma":[0.11597192,0.015772795,0.59990585,0.0017804309,0.0022325974,0.00071596814,0.012036494,0.0015706683,0.2500133],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928623,0.0002755181,0.000029966519,0.00020308381,0.00016972251,0.000035435114],"domain_scores_gemma":[0.9976567,0.0013002126,0.0001066434,0.00044287462,0.0004130682,0.00008047018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021041539,0.00078680925,0.0005415899,0.0021523486,0.00057589496,0.0015481137,0.00093491754,0.0006072512,0.02107381],"category_scores_gemma":[0.006698591,0.00043998114,0.000715136,0.0024869568,0.000628938,0.002411724,0.0013606338,0.0016906761,0.008794155],"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.000022302129,0.000042771906,0.0023044092,0.0001801864,0.00011431236,0.00005733872,0.00020543521,0.021262977,0.0005281278,0.35867086,0.14093086,0.4756804],"study_design_scores_gemma":[0.0000051175853,0.000014486244,0.002487844,0.00014086641,0.000050093568,0.00015358042,0.00012660898,0.09987413,0.00071335863,0.66245407,0.2339497,0.000030166626],"about_ca_topic_score_codex":0.0036755844,"about_ca_topic_score_gemma":0.0056482307,"teacher_disagreement_score":0.02107381,"about_ca_system_score_codex":0.0010081024,"about_ca_system_score_gemma":0.0010318962,"threshold_uncertainty_score":0.07049894},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116715044,0.0003073956,0.87518233,0.0007756269,0.000053703996,0.00006475802,0.00017902888,0.00025078873,0.0064713447],"genre_scores_gemma":[0.9529206,0.00050307915,0.041184697,0.00016985295,0.00007918845,0.00018848563,0.00013205939,0.00011865712,0.004703371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908066,0.0003528577,0.00003712854,0.00024905687,0.00017117348,0.000109129855],"domain_scores_gemma":[0.9919308,0.005190331,0.0013742814,0.00070943206,0.00044684642,0.00034826397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014604026,0.0007802117,0.0007834663,0.0013313815,0.0007906672,0.0020946686,0.0015495414,0.0014404304,0.002322988],"category_scores_gemma":[0.007962857,0.0008238295,0.0011914336,0.00081501174,0.0026741987,0.0035356795,0.0019428652,0.0019934324,0.0003373226],"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.00006515643,0.000048615413,0.0026834698,0.00009248682,0.000062346204,0.0004426068,0.00036568154,0.57149935,0.004419429,0.41422966,0.0009868267,0.005104377],"study_design_scores_gemma":[0.000008638041,0.000017816114,0.000251135,0.0000075405515,0.0000112343605,0.000063400425,0.000025355488,0.90799785,0.00038243135,0.09054231,0.0006840132,0.0000084087405],"about_ca_topic_score_codex":0.0039043538,"about_ca_topic_score_gemma":0.0038025086,"teacher_disagreement_score":0.0039043538,"about_ca_system_score_codex":0.0017496272,"about_ca_system_score_gemma":0.0007173335,"threshold_uncertainty_score":0.012694418},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005388941,0.0019375578,0.8575486,0.002907759,0.00081430475,0.0003074923,0.0038553558,0.0020982327,0.12514184],"genre_scores_gemma":[0.2081294,0.008220976,0.53672034,0.0009972998,0.0012415717,0.00091846875,0.0169958,0.00091869786,0.22585753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995023,0.00012223134,0.000024781066,0.00014543779,0.00017128394,0.000033913624],"domain_scores_gemma":[0.9994549,0.00017805283,0.00003363213,0.00017677473,0.00012762976,0.000029048864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063838874,0.0006917116,0.00044005827,0.0022000733,0.0007405225,0.002319378,0.00090293435,0.00068644877,0.018196046],"category_scores_gemma":[0.0030465412,0.00028671135,0.00069990987,0.0023930294,0.00047805934,0.0037478856,0.0015058574,0.0011548387,0.006438636],"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.000022629963,0.000055412784,0.0004883168,0.00019809762,0.00003877411,0.00006211699,0.00022100483,0.016887613,0.0016292045,0.45737472,0.07931689,0.4437053],"study_design_scores_gemma":[0.000006977334,0.000015657883,0.0008634407,0.00014719639,0.000040341587,0.0001954405,0.00022617119,0.1526706,0.002194353,0.527568,0.3160426,0.000029302117],"about_ca_topic_score_codex":0.0027808219,"about_ca_topic_score_gemma":0.0031447262,"teacher_disagreement_score":0.018196046,"about_ca_system_score_codex":0.0010173193,"about_ca_system_score_gemma":0.00078765734,"threshold_uncertainty_score":0.06087184},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040940573,0.0013223373,0.97764516,0.0006500376,0.00036807405,0.00009968988,0.0010350608,0.0008033231,0.013982319],"genre_scores_gemma":[0.16703393,0.0039976793,0.7754924,0.0005912225,0.001403749,0.0007434931,0.007617399,0.0012093978,0.041910764],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980102,0.00057531,0.00008282888,0.00058983365,0.00063467363,0.0001071211],"domain_scores_gemma":[0.99653625,0.0017641331,0.00024501776,0.00070477655,0.00062457664,0.00012512326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016727574,0.001117454,0.0009483443,0.0032917447,0.0010112692,0.002298125,0.0014668341,0.00096616865,0.0097792195],"category_scores_gemma":[0.009625121,0.00061138836,0.0010399004,0.004082517,0.00074020046,0.0042777313,0.0026756462,0.0019463634,0.004371247],"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.00007243318,0.00009199651,0.0021520196,0.00035622934,0.000216175,0.00018892018,0.00046801267,0.035992894,0.0034176758,0.33266538,0.04901246,0.57536584],"study_design_scores_gemma":[0.000009845911,0.000024845918,0.0023471946,0.000096398646,0.000059166916,0.00023864013,0.00029845428,0.40173733,0.0026972343,0.5173009,0.07515393,0.000036124024],"about_ca_topic_score_codex":0.0011756569,"about_ca_topic_score_gemma":0.00195846,"teacher_disagreement_score":0.0097792195,"about_ca_system_score_codex":0.000809874,"about_ca_system_score_gemma":0.0008806373,"threshold_uncertainty_score":0.032714725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011756735,0.008305899,0.73963314,0.0039056179,0.0011390368,0.00015118819,0.001352011,0.0005473796,0.23320897],"genre_scores_gemma":[0.38917696,0.02480824,0.3404488,0.0012418999,0.00260564,0.00070130045,0.0037110932,0.0006399331,0.23666614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933904,0.00019801558,0.00003118788,0.00019788495,0.00020124228,0.000032664146],"domain_scores_gemma":[0.9986331,0.0008263217,0.000076263656,0.0002669398,0.00014065558,0.000056624307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065884687,0.0007527708,0.00040941307,0.0018117627,0.00090220076,0.002928313,0.0006953242,0.00065947475,0.011672759],"category_scores_gemma":[0.0032022838,0.00043311366,0.0005396442,0.0023483178,0.0010673164,0.0051459074,0.0019665032,0.0013163929,0.0027479997],"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.0000072612124,0.000011493077,0.00022536766,0.00014705023,0.000023476796,0.000054962748,0.00024592647,0.004168706,0.0005569747,0.9111117,0.0134439925,0.0700031],"study_design_scores_gemma":[0.0000022482457,0.000006373623,0.00046019157,0.00007540899,0.000018240191,0.00018919799,0.00012788549,0.02212642,0.00040218802,0.83134043,0.1452383,0.000013200636],"about_ca_topic_score_codex":0.00066471804,"about_ca_topic_score_gemma":0.0011188468,"teacher_disagreement_score":0.011672759,"about_ca_system_score_codex":0.0008073778,"about_ca_system_score_gemma":0.00043970667,"threshold_uncertainty_score":0.039049268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006430823,0.01207714,0.0023999233,0.065150835,0.74630356,0.00019124233,0.0030096315,0.0013403102,0.1688842],"genre_scores_gemma":[0.007843008,0.0168173,0.0022051036,0.03437922,0.38584507,0.00023452072,0.004494644,0.0014618988,0.5467192],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972669,0.00035142273,0.00022181949,0.00072977843,0.0011605885,0.00026959318],"domain_scores_gemma":[0.990716,0.0013456303,0.00049012754,0.000914427,0.004247254,0.0022866093],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002575194,0.001336488,0.001182218,0.0021044922,0.0015715446,0.0068977764,0.0022471638,0.0037365274,0.39941978],"category_scores_gemma":[0.014579468,0.00048287646,0.0011381941,0.0012531511,0.00092817034,0.0043062665,0.0028267498,0.005084404,0.25791273],"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.00003062898,0.00001450657,0.00008505641,0.00016134974,0.000006233024,0.000083677856,0.000019428475,0.000043213437,0.000114323026,0.0020618257,0.97062844,0.026751187],"study_design_scores_gemma":[0.0000075368885,0.000009205442,0.00010746064,0.000105572784,0.0000038717444,0.00010501648,0.000024628276,0.00004955152,0.00007373008,0.0011756708,0.9983334,0.000004406201],"about_ca_topic_score_codex":0.0009487636,"about_ca_topic_score_gemma":0.001221656,"teacher_disagreement_score":0.39941978,"about_ca_system_score_codex":0.0016910109,"about_ca_system_score_gemma":0.0028679126,"threshold_uncertainty_score":0.85665476},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5375914,0.0020920285,0.4522038,0.0008563475,0.000064230466,0.00021464445,0.0024287172,0.0013247391,0.0032241824],"genre_scores_gemma":[0.95324224,0.00035623263,0.043743487,0.00005322005,0.000048244463,0.00007720267,0.0016027825,0.00003105177,0.00084545003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992106,0.00019269525,0.00003381902,0.00026339624,0.00019586102,0.000103596394],"domain_scores_gemma":[0.9960859,0.0020516436,0.0007973821,0.00026650663,0.00051213085,0.0002865081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001313874,0.0005811941,0.0006051709,0.0043756715,0.0007822701,0.00091603346,0.00095438835,0.0010189192,0.000668494],"category_scores_gemma":[0.007998937,0.00036229103,0.0005741677,0.0022945045,0.00050575344,0.0022276784,0.0009070518,0.0010001508,0.00033306022],"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.0005796768,0.00042144945,0.16944937,0.00037092698,0.00032357287,0.00079065346,0.00085275416,0.5489585,0.0069366856,0.015896572,0.009592763,0.2458271],"study_design_scores_gemma":[0.000007213614,0.000020255444,0.0064739957,0.000013882795,0.000014640476,0.000083405044,0.00007177974,0.9827461,0.0006309844,0.009169596,0.00075981836,0.000008383707],"about_ca_topic_score_codex":0.0105442535,"about_ca_topic_score_gemma":0.01131152,"teacher_disagreement_score":0.0105442535,"about_ca_system_score_codex":0.0009434938,"about_ca_system_score_gemma":0.0004651625,"threshold_uncertainty_score":0.020965755},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59906197,0.07867113,0.078308016,0.017114244,0.0046625366,0.00072077126,0.00419326,0.0010919105,0.21617621],"genre_scores_gemma":[0.95605946,0.008136116,0.015262371,0.00071477774,0.0015717876,0.00014897098,0.002164242,0.00030858174,0.015633628],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.97268176,0.01046222,0.0018044388,0.0022927236,0.011351587,0.001407306],"domain_scores_gemma":[0.7817072,0.16215448,0.012712099,0.006224632,0.03322034,0.0039812573],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.016248884,0.0009413352,0.0012901932,0.018275058,0.0032106815,0.010226164,0.0015609916,0.0018893076,0.011703622],"category_scores_gemma":[0.15619713,0.0003084639,0.0010058072,0.039327692,0.0014543212,0.011698058,0.0011723884,0.0013544468,0.0031329931],"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.00084191596,0.001064846,0.23410192,0.0026521704,0.0005714203,0.0012713139,0.0049445583,0.008725489,0.0017409635,0.09907591,0.05274108,0.59226847],"study_design_scores_gemma":[0.0003587277,0.002036583,0.29943106,0.0021370018,0.0013545126,0.006125016,0.022516502,0.11038347,0.009699746,0.13389854,0.41160852,0.00045032054],"about_ca_topic_score_codex":0.0038647766,"about_ca_topic_score_gemma":0.0026249741,"teacher_disagreement_score":0.9837511,"about_ca_system_score_codex":0.0034274368,"about_ca_system_score_gemma":0.0021532378,"threshold_uncertainty_score":0.08593333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015068765,0.0008366575,0.9784042,0.0002031382,0.00008703973,0.00035064534,0.00022779989,0.0016103005,0.0032113676],"genre_scores_gemma":[0.2611494,0.0007441402,0.72902703,0.00027850116,0.0001427624,0.00058371027,0.0013785999,0.00029145033,0.0064043845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974917,0.0005881348,0.00012257775,0.0007698749,0.00077832176,0.00024945627],"domain_scores_gemma":[0.99445975,0.0023916597,0.00053842936,0.00079501665,0.0015381947,0.0002769248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028075033,0.001259275,0.0019726409,0.0050919857,0.0022143458,0.0020777232,0.0046748864,0.0018992318,0.003500931],"category_scores_gemma":[0.010470429,0.00057899056,0.0012225652,0.0040423507,0.0009846804,0.0035067229,0.0026105759,0.001281599,0.0020365966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040643316,0.0004654587,0.0057546217,0.00039915115,0.00029983826,0.00031682703,0.00037551482,0.22310673,0.008876741,0.028158026,0.015515376,0.71632534],"study_design_scores_gemma":[0.000043765132,0.00006615261,0.0005130468,0.000021723905,0.000048159738,0.00033409853,0.0000941909,0.97677124,0.0036077925,0.013120497,0.00535207,0.000027158272],"about_ca_topic_score_codex":0.0045712837,"about_ca_topic_score_gemma":0.0051444187,"teacher_disagreement_score":0.0050919857,"about_ca_system_score_codex":0.0014041067,"about_ca_system_score_gemma":0.0016662405,"threshold_uncertainty_score":0.014847636},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9150891,0.00086002157,0.074533306,0.0007610513,0.000040238367,0.000049078575,0.0015532392,0.0001718402,0.006942055],"genre_scores_gemma":[0.9939365,0.0003059461,0.004166321,0.000023514223,0.000017719496,0.00003368334,0.000714984,0.000013361889,0.00078787614],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962103,0.00009419216,0.000030404657,0.00010656233,0.000098732125,0.000049043098],"domain_scores_gemma":[0.9986785,0.0005075508,0.00040031795,0.00007572963,0.00024719315,0.00009064169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062302337,0.00026655028,0.00023661833,0.0030031635,0.00035220012,0.0011112229,0.000316325,0.00035083384,0.00137321],"category_scores_gemma":[0.003733327,0.00014769503,0.0004897201,0.0025696675,0.00052041357,0.0023748046,0.0005586519,0.00031227744,0.00013387713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017968498,0.000069336464,0.42990088,0.0003254662,0.0004396415,0.0008217142,0.0012672832,0.42174438,0.005437789,0.061500132,0.0055468567,0.07276677],"study_design_scores_gemma":[0.000009445318,0.00003785481,0.21374136,0.0000380017,0.00009033864,0.00025111972,0.00046095974,0.75465083,0.00095096166,0.026963474,0.002746847,0.000058814865],"about_ca_topic_score_codex":0.0067091803,"about_ca_topic_score_gemma":0.0045514167,"teacher_disagreement_score":0.0067091803,"about_ca_system_score_codex":0.001105504,"about_ca_system_score_gemma":0.00030588155,"threshold_uncertainty_score":0.013340294},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5765391,0.0019598866,0.40763345,0.0013437693,0.00006399623,0.00026316463,0.0011021293,0.0009799509,0.0101146195],"genre_scores_gemma":[0.9064335,0.00022146614,0.09091744,0.00008278521,0.000045280125,0.00008636792,0.00053567084,0.000078201905,0.0015992459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99769694,0.00071156974,0.000107998305,0.00068002107,0.0006078565,0.0001955716],"domain_scores_gemma":[0.9760533,0.012064608,0.003429492,0.0015737697,0.0055657076,0.0013132095],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0034891344,0.0003087911,0.00063915574,0.006457169,0.0019171123,0.0030276664,0.0008886547,0.001300846,0.0033680128],"category_scores_gemma":[0.02460096,0.0005024492,0.0005219454,0.0034749282,0.0023006375,0.0036077143,0.0026160916,0.00068330404,0.00075325376],"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.0017619481,0.00042624943,0.13008623,0.0013701294,0.00038319867,0.0008379999,0.007230356,0.1480152,0.047455415,0.403608,0.017476441,0.24134886],"study_design_scores_gemma":[0.00019059677,0.00018456824,0.04196596,0.00021052701,0.00015232118,0.0010170693,0.0017144404,0.60376406,0.01574871,0.3199979,0.014949138,0.00010468751],"about_ca_topic_score_codex":0.0029109877,"about_ca_topic_score_gemma":0.0022081293,"teacher_disagreement_score":0.99651086,"about_ca_system_score_codex":0.0014435209,"about_ca_system_score_gemma":0.001139472,"threshold_uncertainty_score":0.018452525},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04817262,0.0017110216,0.31720328,0.0018026824,0.0009682635,0.001385543,0.14988267,0.46979505,0.009078809],"genre_scores_gemma":[0.31405666,0.0021069776,0.45788565,0.0017350379,0.00063967606,0.001818513,0.19375002,0.011741116,0.016266352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991049,0.000110554945,0.0001173243,0.00029407805,0.0003194285,0.0000536251],"domain_scores_gemma":[0.9948007,0.0022742944,0.00039723088,0.0014041042,0.0004198168,0.0007038155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021389755,0.002244009,0.0014830973,0.006069883,0.0008766919,0.0025166066,0.0026659882,0.0011681808,0.010756082],"category_scores_gemma":[0.008185478,0.0010004386,0.0008101507,0.0041767485,0.0006384407,0.005642152,0.004205232,0.0015289197,0.0061921594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046343384,0.0015966694,0.040634837,0.0023873488,0.001992201,0.002421376,0.0019955179,0.018468065,0.04295124,0.01594771,0.39775142,0.46921927],"study_design_scores_gemma":[0.0008064478,0.0008185813,0.034761906,0.00025615186,0.0005146137,0.0013618952,0.0012015894,0.64748114,0.045234486,0.057106156,0.20985615,0.0006009156],"about_ca_topic_score_codex":0.005284862,"about_ca_topic_score_gemma":0.008437034,"teacher_disagreement_score":0.010756082,"about_ca_system_score_codex":0.0005409275,"about_ca_system_score_gemma":0.0012402082,"threshold_uncertainty_score":0.03598267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85103995,0.0003426973,0.13466719,0.0023472048,0.00006002896,0.00021715324,0.00075907813,0.00028935654,0.010277308],"genre_scores_gemma":[0.98373854,0.00014137449,0.01438636,0.00007148581,0.00002425745,0.00012270454,0.0002905667,0.000011313848,0.0012133601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995407,0.00018652891,0.000023341396,0.00010317139,0.00007062945,0.00007563846],"domain_scores_gemma":[0.99703825,0.0023267746,0.00027543388,0.000092139744,0.00017578999,0.00009166173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010582256,0.0006038823,0.00035058946,0.0012981126,0.0004137967,0.0016852274,0.00054266816,0.0007720573,0.0016644266],"category_scores_gemma":[0.0059956675,0.00021469625,0.000655676,0.00097326597,0.00046327699,0.0018930905,0.0006581509,0.0010292223,0.00049933465],"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.00064832275,0.001662805,0.37853256,0.00039992243,0.0003815486,0.00035693,0.0037763047,0.39423457,0.005187198,0.023183186,0.004821219,0.18681543],"study_design_scores_gemma":[0.000008351222,0.000073782794,0.018267775,0.000024049812,0.000025886935,0.00002650348,0.00040102252,0.9731365,0.00037042992,0.0067188335,0.00093097077,0.000015864453],"about_ca_topic_score_codex":0.012035452,"about_ca_topic_score_gemma":0.012171608,"teacher_disagreement_score":0.012035452,"about_ca_system_score_codex":0.0011912425,"about_ca_system_score_gemma":0.00067754666,"threshold_uncertainty_score":0.023930788},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9418309,0.002997571,0.048841596,0.0005776884,0.00023376071,0.00036179423,0.000560448,0.0014021324,0.0031941554],"genre_scores_gemma":[0.9447873,0.0004955635,0.053113844,0.00009861554,0.00005023678,0.00010785085,0.0006605614,0.00009168831,0.0005943289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99005044,0.0043987716,0.0008027836,0.0018078589,0.0022355204,0.0007046671],"domain_scores_gemma":[0.93164563,0.051599756,0.0031132747,0.0068981005,0.0057548597,0.000988397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008780707,0.001433924,0.0012661532,0.0022159037,0.0014643407,0.0023209322,0.0015582199,0.0025841023,0.00074160023],"category_scores_gemma":[0.06593383,0.0004894998,0.00091153785,0.0015291009,0.0009334801,0.0036932777,0.0009249596,0.0014284981,0.00034966238],"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.005241985,0.0026556172,0.08183842,0.0012223826,0.0021424633,0.00044948232,0.0008445608,0.55469674,0.029290037,0.004442866,0.0033663886,0.31380904],"study_design_scores_gemma":[0.0002823303,0.002503316,0.026906824,0.00010235941,0.0005122335,0.00034887053,0.0008545054,0.939871,0.022004668,0.004339911,0.002165925,0.00010816464],"about_ca_topic_score_codex":0.0068531735,"about_ca_topic_score_gemma":0.007988675,"teacher_disagreement_score":0.008780707,"about_ca_system_score_codex":0.0012800101,"about_ca_system_score_gemma":0.0012707029,"threshold_uncertainty_score":0.046437323},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008208449,0.0026537522,0.56419486,0.0053605246,0.0011268909,0.00019291899,0.0043914793,0.0010754478,0.4127957],"genre_scores_gemma":[0.31638712,0.008429501,0.090152405,0.002156061,0.0012340699,0.0010202966,0.0071963514,0.0007868444,0.5726374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995432,0.0001480769,0.000013935255,0.0001418862,0.000106146814,0.00004672324],"domain_scores_gemma":[0.999073,0.00044097897,0.00007090408,0.00020007533,0.00014776849,0.00006719302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062164164,0.0011325959,0.00071033114,0.001167917,0.0007395251,0.0023323859,0.0013463771,0.001630118,0.050827425],"category_scores_gemma":[0.0044143572,0.00040974087,0.00069276977,0.0014591848,0.0008019758,0.003537249,0.0012281776,0.0018774585,0.012071697],"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.000013033258,0.00003055652,0.00023179928,0.000063200925,0.000020662093,0.000058450685,0.00006292698,0.036618065,0.00016993526,0.8893258,0.04354372,0.029861916],"study_design_scores_gemma":[0.000010185117,0.000010441756,0.00013640955,0.00003362241,0.000015752557,0.0000751805,0.000041016832,0.10300309,0.00010409665,0.8275869,0.06897339,0.000009972348],"about_ca_topic_score_codex":0.0038932096,"about_ca_topic_score_gemma":0.003188278,"teacher_disagreement_score":0.050827425,"about_ca_system_score_codex":0.001274642,"about_ca_system_score_gemma":0.00074992224,"threshold_uncertainty_score":0.1700347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101277,0.00082847354,0.96548283,0.000652714,0.00015097324,0.000049378195,0.0007048458,0.0006604801,0.02134261],"genre_scores_gemma":[0.3810266,0.0029528278,0.57668257,0.0004334006,0.00048481987,0.00045033,0.005638762,0.0010017245,0.031328995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985337,0.00047408632,0.00010008693,0.0002709909,0.0004617784,0.0001593596],"domain_scores_gemma":[0.9964977,0.0016979468,0.0002564804,0.0008340357,0.00052511855,0.0001887881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015879234,0.0007959233,0.0011731761,0.0027163285,0.001023981,0.004153616,0.0025825053,0.0009525915,0.013313712],"category_scores_gemma":[0.00846067,0.00060627476,0.0011159033,0.0064790887,0.0012564893,0.007883674,0.00338623,0.0032823433,0.0020884562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006400954,0.000029676326,0.00031294764,0.00009709552,0.00001679787,0.000043062508,0.00012945323,0.033343997,0.0003454131,0.9053779,0.008026544,0.0522131],"study_design_scores_gemma":[0.0000062666636,0.000011355473,0.00008115379,0.000032520376,0.000010608404,0.000050353025,0.00007240374,0.19886078,0.00040462997,0.7879331,0.0125285955,0.000008201199],"about_ca_topic_score_codex":0.0029711004,"about_ca_topic_score_gemma":0.0026797378,"teacher_disagreement_score":0.013313712,"about_ca_system_score_codex":0.0015607071,"about_ca_system_score_gemma":0.0009184333,"threshold_uncertainty_score":0.044538796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034561504,0.00026325198,0.993129,0.00017581994,0.000044608572,0.000026397815,0.00010097973,0.00013322932,0.0026705507],"genre_scores_gemma":[0.20125511,0.0016195654,0.7789452,0.0004086174,0.0006273931,0.00035418005,0.00067761814,0.00036039425,0.015751943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936086,0.00024223066,0.000019898698,0.00014968024,0.00017394387,0.000053431453],"domain_scores_gemma":[0.9971929,0.0019714688,0.00013599067,0.00035874383,0.00022124658,0.000119674536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007761757,0.0009985346,0.001276347,0.0013392511,0.00077700644,0.0011667346,0.0022787384,0.0013318355,0.0051798946],"category_scores_gemma":[0.0044758655,0.0008355117,0.0013894975,0.0025737516,0.0011857885,0.0026635993,0.0019901907,0.0025592525,0.0009324676],"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.000078792524,0.000094079434,0.00047727337,0.0002931182,0.000105400955,0.00013695334,0.00026830376,0.48084366,0.00572933,0.4004531,0.01395419,0.09756581],"study_design_scores_gemma":[0.000007418427,0.000018859024,0.000094237665,0.000009313244,0.000013203679,0.000053001917,0.000025630932,0.8465864,0.0003521401,0.14954905,0.0032813305,0.000009499957],"about_ca_topic_score_codex":0.0040158792,"about_ca_topic_score_gemma":0.0063046985,"teacher_disagreement_score":0.0051798946,"about_ca_system_score_codex":0.00086977385,"about_ca_system_score_gemma":0.00050593907,"threshold_uncertainty_score":0.017328441},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06947065,0.00044399055,0.78262275,0.00065551064,0.00021127165,0.0004902726,0.0012297597,0.07565636,0.06921947],"genre_scores_gemma":[0.5335469,0.0004963379,0.43950683,0.00045051237,0.00007574281,0.0003365344,0.0019312805,0.0036839088,0.019971985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992225,0.00012928728,0.0000345005,0.00021677846,0.00034150254,0.000055372762],"domain_scores_gemma":[0.9973876,0.0014032905,0.00017681197,0.00068123353,0.00019927924,0.00015184053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010582726,0.0010644916,0.00050966925,0.0015382562,0.00076467736,0.0025822683,0.0021303662,0.00089369767,0.01398143],"category_scores_gemma":[0.00475344,0.00049208174,0.00064718607,0.00052432466,0.00081095315,0.0029888775,0.0027407047,0.0010408895,0.0025034857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006048109,0.0003947704,0.010674126,0.0007968039,0.00015907046,0.0011364205,0.0055723498,0.028729057,0.04167744,0.050988756,0.06477462,0.7944917],"study_design_scores_gemma":[0.0001358317,0.0005281791,0.018275728,0.00058911456,0.0001291073,0.0027418027,0.0026522952,0.45656273,0.082821794,0.10515786,0.330099,0.00030659197],"about_ca_topic_score_codex":0.0008462899,"about_ca_topic_score_gemma":0.0011976087,"teacher_disagreement_score":0.01398143,"about_ca_system_score_codex":0.00034308145,"about_ca_system_score_gemma":0.0005657924,"threshold_uncertainty_score":0.04677254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097121164,0.0011872668,0.8760233,0.00044245046,0.0002087753,0.000293303,0.0025732531,0.020982342,0.001168169],"genre_scores_gemma":[0.5260123,0.00052974484,0.46264002,0.00022404641,0.00011801103,0.00026491398,0.0069152303,0.0007607097,0.0025350123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984546,0.0002889752,0.00015355613,0.0004995339,0.00048695182,0.000116470714],"domain_scores_gemma":[0.9935875,0.0027519695,0.00082219846,0.0014690593,0.0010047077,0.0003645809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014051641,0.0011721757,0.0011559047,0.0038112411,0.0007423706,0.0016627731,0.0022373644,0.0011661546,0.0015142565],"category_scores_gemma":[0.011334468,0.00056600163,0.0007002532,0.0031315028,0.0006850019,0.0041816263,0.0019237421,0.0012473844,0.0011473579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001553286,0.0004313385,0.045739856,0.00072692015,0.000517974,0.0005919473,0.0008240683,0.18687274,0.02392731,0.015201444,0.020128584,0.7034844],"study_design_scores_gemma":[0.000041925938,0.000117134834,0.0016640162,0.000018178454,0.000029473498,0.00027692452,0.00008779213,0.96974295,0.007299219,0.017289307,0.003402274,0.000030800304],"about_ca_topic_score_codex":0.0034804924,"about_ca_topic_score_gemma":0.0045045465,"teacher_disagreement_score":0.0038112411,"about_ca_system_score_codex":0.00068140746,"about_ca_system_score_gemma":0.0010177686,"threshold_uncertainty_score":0.0074313283},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62687683,0.002418146,0.35102755,0.0016680269,0.00007023793,0.0006564491,0.0059785857,0.0008349939,0.01046913],"genre_scores_gemma":[0.9050539,0.0010259794,0.08847824,0.00009702182,0.00009859471,0.00022857943,0.003384875,0.000033922104,0.0015988012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985997,0.0006643425,0.00010501204,0.00022248611,0.00029795335,0.000110469126],"domain_scores_gemma":[0.99349713,0.0046623186,0.0006598256,0.00045460474,0.0005804377,0.00014569447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017282079,0.0009034937,0.0006080333,0.0067923316,0.00047721725,0.001542855,0.0006344806,0.00084610196,0.00059969013],"category_scores_gemma":[0.008144888,0.00031669525,0.00072579517,0.0038129778,0.00033356453,0.0037679977,0.00087513414,0.0007482718,0.0007196502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007903581,0.0011603456,0.21295276,0.0010209313,0.0005427159,0.00061937375,0.0026241133,0.05180776,0.021721236,0.014364606,0.008535673,0.6838601],"study_design_scores_gemma":[0.000022389613,0.00034568206,0.0668071,0.00012865473,0.00016237631,0.0004829612,0.0023631307,0.8840365,0.013426488,0.02311862,0.009032547,0.0000735324],"about_ca_topic_score_codex":0.0036851503,"about_ca_topic_score_gemma":0.0076229773,"teacher_disagreement_score":0.0067923316,"about_ca_system_score_codex":0.0006579831,"about_ca_system_score_gemma":0.00040688695,"threshold_uncertainty_score":0.009139717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049577404,0.0004551842,0.9465279,0.00027014024,0.000088106855,0.00004435347,0.00015069317,0.0006478412,0.002238367],"genre_scores_gemma":[0.93089443,0.0003012866,0.063263,0.00013569668,0.000089653695,0.00016020358,0.00035697655,0.00004234048,0.0047564246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996369,0.00005994026,0.000021448273,0.00012140548,0.000103457605,0.00005683354],"domain_scores_gemma":[0.9993563,0.0002620625,0.00009709138,0.000043157732,0.00021092586,0.000030360887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007265398,0.0006371618,0.0009411092,0.00076731946,0.00035584767,0.00077764795,0.0013631294,0.00084566954,0.0012307023],"category_scores_gemma":[0.0014524795,0.00031189807,0.00071648124,0.0006877253,0.00026058714,0.0010501717,0.0007219968,0.001066387,0.0004122808],"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.0000521514,0.000080135156,0.0027515441,0.000035108456,0.00009387494,0.00013184475,0.000048430455,0.9084116,0.0014267066,0.0022122848,0.0011642913,0.08359189],"study_design_scores_gemma":[6.3704937e-7,0.0000068681506,0.000094393174,0.0000011482834,0.0000036477686,0.000005516346,0.000002008048,0.99934024,0.000109772154,0.00035853777,0.000075619326,0.0000016141709],"about_ca_topic_score_codex":0.007263259,"about_ca_topic_score_gemma":0.006061224,"teacher_disagreement_score":0.007263259,"about_ca_system_score_codex":0.0005339081,"about_ca_system_score_gemma":0.0005323128,"threshold_uncertainty_score":0.014441967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3855174,0.001022807,0.5923725,0.00051046506,0.00013355378,0.00007798299,0.000122065,0.00055297883,0.01969031],"genre_scores_gemma":[0.9598858,0.00040961776,0.037670746,0.00008085992,0.000035638353,0.00005872259,0.00006775766,0.00008178359,0.0017091995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952936,0.00018367944,0.000012089246,0.0000872843,0.00010957786,0.0000780328],"domain_scores_gemma":[0.9982205,0.0010104937,0.00024051616,0.00019177064,0.00021488724,0.000121787845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071148935,0.00053510966,0.00036937054,0.00079252175,0.00039570397,0.0008350517,0.0008301072,0.00094384403,0.0010970257],"category_scores_gemma":[0.0054397653,0.0002913373,0.00026462207,0.0005145685,0.00083109766,0.001058265,0.0006115422,0.0005908267,0.00021163297],"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.00011819554,0.000088315915,0.0017916188,0.00021312432,0.00006525934,0.00031837318,0.00016711216,0.57805663,0.06733806,0.32578975,0.003304323,0.022749173],"study_design_scores_gemma":[0.000011322843,0.000021249676,0.0005346738,0.000013811507,0.000010923415,0.0000647329,0.00002464693,0.9575219,0.0044255345,0.036259916,0.0010900948,0.000021264172],"about_ca_topic_score_codex":0.0017940865,"about_ca_topic_score_gemma":0.0020445823,"teacher_disagreement_score":0.0017940865,"about_ca_system_score_codex":0.00091053394,"about_ca_system_score_gemma":0.0006178884,"threshold_uncertainty_score":0.0066064},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43957832,0.0020156386,0.5467427,0.0014704673,0.000107160165,0.00008940367,0.00013866961,0.00033881183,0.009518855],"genre_scores_gemma":[0.99142843,0.0006012178,0.006472191,0.000058591355,0.00003886108,0.000024259689,0.000044766468,0.000025192741,0.001306447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943,0.00022915125,0.00002048315,0.00006993986,0.00016124772,0.00008915661],"domain_scores_gemma":[0.9943651,0.004282326,0.00059687503,0.00018573178,0.00044843505,0.000121592086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016445082,0.0008149081,0.00059233356,0.0012390174,0.00041607645,0.00086962717,0.00078389427,0.0007665904,0.0009356648],"category_scores_gemma":[0.010760512,0.0002772136,0.0003748217,0.0006935407,0.0010312545,0.0012140168,0.0007270343,0.00062720093,0.000113638496],"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.000043866963,0.000030383557,0.00072660425,0.000041965468,0.000017523314,0.000049900955,0.000046084733,0.9769678,0.0020101562,0.015948072,0.0003153681,0.0038022792],"study_design_scores_gemma":[8.59944e-7,0.0000091389265,0.000078909434,0.0000018698545,0.0000019323181,0.0000057396423,0.000004114208,0.9982541,0.00015052699,0.0014543963,0.0000364991,0.000001793864],"about_ca_topic_score_codex":0.0044504493,"about_ca_topic_score_gemma":0.0017442678,"teacher_disagreement_score":0.0044504493,"about_ca_system_score_codex":0.0013477716,"about_ca_system_score_gemma":0.0005262202,"threshold_uncertainty_score":0.009778738},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031575706,0.0017793908,0.9501931,0.0007542873,0.0001138075,0.00025059114,0.0040750806,0.0036325925,0.0076254103],"genre_scores_gemma":[0.28080243,0.001941721,0.6989393,0.0006375334,0.00025789242,0.00052009226,0.008517799,0.00074641017,0.007636861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980354,0.0005304133,0.00015512186,0.0007041317,0.00046501512,0.000109924884],"domain_scores_gemma":[0.9932006,0.0036189456,0.00095118774,0.0013838216,0.0006214741,0.00022393986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009751962,0.00095564855,0.0009986003,0.005233152,0.0010066848,0.0035784743,0.0018345435,0.0017207969,0.007229231],"category_scores_gemma":[0.010371959,0.00086558424,0.0013538,0.005785132,0.0014035405,0.007990806,0.0017390712,0.0015863925,0.0016042121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025437985,0.00019141173,0.013098912,0.0011813758,0.00039617484,0.00044134393,0.0010665271,0.07948206,0.011524917,0.5503453,0.028266978,0.3137506],"study_design_scores_gemma":[0.000033908345,0.00006104533,0.0021192548,0.00014372953,0.00008593302,0.000966339,0.0003062092,0.25941887,0.0044993185,0.68639445,0.045916013,0.000054919976],"about_ca_topic_score_codex":0.002632773,"about_ca_topic_score_gemma":0.003910217,"teacher_disagreement_score":0.007229231,"about_ca_system_score_codex":0.001714471,"about_ca_system_score_gemma":0.0009483434,"threshold_uncertainty_score":0.024184227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3215219,0.0005836588,0.664884,0.0010097848,0.00016418568,0.00013528968,0.0003226587,0.0003587794,0.011019778],"genre_scores_gemma":[0.966624,0.00032978473,0.027057631,0.00012872563,0.000048973594,0.00019342905,0.000102629514,0.00004194842,0.0054727597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991153,0.00039695177,0.000039546285,0.00016802226,0.00012330402,0.00015694216],"domain_scores_gemma":[0.99601054,0.0025079644,0.0006535491,0.0002635333,0.0003256254,0.00023886166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018992262,0.00071630784,0.0011805051,0.0012981842,0.00091461453,0.0018322538,0.002061102,0.0024721269,0.0026513769],"category_scores_gemma":[0.006711835,0.0006523401,0.0011464095,0.0009286812,0.0026260766,0.0023137862,0.001757233,0.0019199929,0.0003132319],"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.00004703141,0.00004933237,0.0013314883,0.000025067275,0.000036880854,0.00016309558,0.00013730161,0.93588734,0.00090373924,0.05948516,0.00023163739,0.0017020147],"study_design_scores_gemma":[0.0000042095176,0.000007059875,0.00007628288,0.0000024847147,0.0000035839175,0.000007636392,0.000010774525,0.9941122,0.00004756737,0.0056418446,0.00008262923,0.0000036900142],"about_ca_topic_score_codex":0.01364286,"about_ca_topic_score_gemma":0.008531725,"teacher_disagreement_score":0.01364286,"about_ca_system_score_codex":0.0019862566,"about_ca_system_score_gemma":0.0009318379,"threshold_uncertainty_score":0.027126849},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08400807,0.00059296895,0.9106051,0.001373817,0.000057752215,0.00025212794,0.0004250123,0.0006408717,0.0020442675],"genre_scores_gemma":[0.6314986,0.00054650387,0.36132765,0.0005251182,0.0002186497,0.0005834007,0.0016700935,0.0003203691,0.0033097386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944031,0.0029247133,0.00022997412,0.0011359649,0.00084786874,0.0004583487],"domain_scores_gemma":[0.928524,0.06124298,0.0024998556,0.004190936,0.0020006495,0.0015414975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007199433,0.00154114,0.00263544,0.0009208605,0.00095866126,0.0023720257,0.0030740236,0.002409676,0.0035788792],"category_scores_gemma":[0.051998723,0.001215682,0.0010207391,0.0015526665,0.0024388582,0.0059883143,0.003164819,0.0035924672,0.0007224879],"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.0009995197,0.0005420994,0.0028182922,0.0005125023,0.00017847677,0.00022074301,0.00033954706,0.8372015,0.0035254334,0.071732245,0.0062082787,0.07572141],"study_design_scores_gemma":[0.000039432973,0.000066068926,0.0001963786,0.000008815417,0.00000845042,0.000033831933,0.000025461784,0.959235,0.00047827497,0.039694905,0.0002003714,0.000012860578],"about_ca_topic_score_codex":0.0051611974,"about_ca_topic_score_gemma":0.004606361,"teacher_disagreement_score":0.007199433,"about_ca_system_score_codex":0.002314122,"about_ca_system_score_gemma":0.0030987053,"threshold_uncertainty_score":0.03807473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019854076,0.00017775815,0.9777125,0.00044061616,0.000036755097,0.000082561455,0.00027193327,0.00038289538,0.0010409878],"genre_scores_gemma":[0.5385004,0.00040128428,0.45216954,0.000308457,0.00019908075,0.00031160435,0.0017789672,0.00027353043,0.0060571847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971597,0.0014211942,0.00007070219,0.0007079864,0.00038968693,0.00025068037],"domain_scores_gemma":[0.9888017,0.0072686663,0.0008975827,0.0014525241,0.0010012824,0.00057827384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039703515,0.0013672496,0.0020853826,0.0011772626,0.00093308924,0.0017406986,0.003836148,0.0023489525,0.0035061615],"category_scores_gemma":[0.01407832,0.0009394457,0.0011694963,0.0021380556,0.0018259613,0.0038276953,0.00225904,0.0035561367,0.0011184989],"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.00013960002,0.00012550941,0.00056630984,0.00011443935,0.000054901848,0.000112995585,0.000100203484,0.9351527,0.000887377,0.038288835,0.0031904518,0.021266632],"study_design_scores_gemma":[0.0000054413636,0.0000107651085,0.000049582017,0.0000020870289,0.0000022928152,0.000010468436,0.000007948715,0.9879408,0.0001258304,0.011680708,0.00015856896,0.0000055204573],"about_ca_topic_score_codex":0.0129657835,"about_ca_topic_score_gemma":0.012526693,"teacher_disagreement_score":0.0129657835,"about_ca_system_score_codex":0.0017884116,"about_ca_system_score_gemma":0.002099533,"threshold_uncertainty_score":0.025780678},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15195104,0.0005030118,0.8451952,0.0007537417,0.00004611832,0.00003571059,0.00053145655,0.00031695495,0.00066668296],"genre_scores_gemma":[0.93986994,0.0010146915,0.054269023,0.00011764619,0.00029370497,0.000075237134,0.0017320126,0.00010177001,0.0025260947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903226,0.00030133792,0.000052698182,0.0003846405,0.0001369093,0.000092171475],"domain_scores_gemma":[0.97653514,0.019812003,0.0015735696,0.0010802193,0.0005885211,0.00041056646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033911688,0.000989255,0.0012340007,0.0021112063,0.00046057848,0.001937448,0.0020510813,0.0024394405,0.0014991981],"category_scores_gemma":[0.02963387,0.001122862,0.0010881516,0.001437526,0.0015092194,0.0027631368,0.0013664926,0.0026162125,0.00043328878],"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.00052235916,0.00018562737,0.021839023,0.0003766819,0.00030976292,0.00032048873,0.0004558275,0.80586094,0.015587965,0.078915976,0.0019389314,0.07368648],"study_design_scores_gemma":[0.000013080365,0.000018131059,0.0019367521,0.000012405435,0.000014506273,0.00003606913,0.000017433593,0.97451526,0.0010709867,0.0220922,0.0002631173,0.000009977957],"about_ca_topic_score_codex":0.0038794132,"about_ca_topic_score_gemma":0.0038832186,"teacher_disagreement_score":0.0038794132,"about_ca_system_score_codex":0.001063973,"about_ca_system_score_gemma":0.0009930999,"threshold_uncertainty_score":0.017934382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002580203,0.00002301138,0.000084717416,0.000058078076,0.000017469392,0.000012431775,0.9989791,0.00028634752,0.00028087225],"genre_scores_gemma":[0.0016809634,0.00003127328,0.0006449475,0.000049720897,0.000013066465,0.00011147785,0.99668676,0.00007924408,0.0007026269],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991392,0.00010286632,0.00007972238,0.00026704196,0.00026384654,0.0001473416],"domain_scores_gemma":[0.99548584,0.0021792792,0.00030619456,0.000846656,0.0008897121,0.000292329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012965896,0.0025368687,0.0011221328,0.002508207,0.0010212103,0.0025012302,0.0026030464,0.0017403108,0.23105986],"category_scores_gemma":[0.01235033,0.00064777967,0.0013698289,0.0037575818,0.00054554566,0.0017500635,0.0017993631,0.0020321964,0.11213444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004708973,0.000046697973,0.0018510317,0.0004282132,0.000029926374,0.000021033897,0.000028017434,0.00075602904,0.00009624608,0.0005907996,0.9933159,0.0027890513],"study_design_scores_gemma":[0.0013692025,0.000152173,0.02768895,0.0009145771,0.000090446556,0.0003531068,0.00048724483,0.009668398,0.0015950736,0.011375726,0.94619936,0.000105676],"about_ca_topic_score_codex":0.016263815,"about_ca_topic_score_gemma":0.036561456,"teacher_disagreement_score":0.23105986,"about_ca_system_score_codex":0.0017172431,"about_ca_system_score_gemma":0.0018691862,"threshold_uncertainty_score":0.7729722},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037974513,0.0014279016,0.9903893,0.0020357962,0.00013838912,0.000081753125,0.0001799498,0.0003304122,0.0016189968],"genre_scores_gemma":[0.09624339,0.0037949614,0.8947232,0.0007966628,0.0007201286,0.0003886153,0.00054942246,0.00039336985,0.0023903134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969518,0.0017464595,0.000119970784,0.0005149912,0.0005714819,0.00009526179],"domain_scores_gemma":[0.98699594,0.008657693,0.000798334,0.0015260342,0.0014295395,0.00059248105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043101567,0.0010886794,0.0011637066,0.0059488863,0.0013323507,0.0037256978,0.0016247977,0.0017357037,0.0025431737],"category_scores_gemma":[0.023888702,0.0008540208,0.0014741746,0.0043637725,0.003123837,0.0057749297,0.004361699,0.003757746,0.00088289817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006887395,0.00009016269,0.0034765955,0.0005364656,0.00027961363,0.00023867976,0.0013750582,0.10234228,0.0021003198,0.7476805,0.011015173,0.13079627],"study_design_scores_gemma":[0.000013043581,0.0000140583,0.00065383746,0.000101667974,0.00002597365,0.000084980646,0.00018051689,0.21582289,0.00048220082,0.76685673,0.015731346,0.000032754393],"about_ca_topic_score_codex":0.004541425,"about_ca_topic_score_gemma":0.004186605,"teacher_disagreement_score":0.0059488863,"about_ca_system_score_codex":0.0022190518,"about_ca_system_score_gemma":0.0017163573,"threshold_uncertainty_score":0.022794604},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24910267,0.00050114846,0.7183713,0.0006586451,0.0002789101,0.00053203234,0.00682517,0.017289884,0.006440356],"genre_scores_gemma":[0.71593094,0.0002205731,0.27053577,0.0000963053,0.00007993758,0.00017426585,0.009106063,0.0002224369,0.0036336598],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981133,0.0004582475,0.00017163939,0.0005836176,0.00049152423,0.0001815936],"domain_scores_gemma":[0.9961433,0.001427653,0.00061729626,0.00088652596,0.0007436264,0.00018173363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015379076,0.0013292707,0.0007714288,0.0044313474,0.0006012345,0.0016982865,0.0011778902,0.001163198,0.0016424216],"category_scores_gemma":[0.0062075783,0.0002757659,0.0009209899,0.0022784567,0.00041491055,0.00438917,0.0015819601,0.0011416739,0.0013910818],"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.0012314445,0.0017679608,0.056181896,0.00066406047,0.00065635896,0.0008357646,0.0005337749,0.10555999,0.048227362,0.012591666,0.016815398,0.75493425],"study_design_scores_gemma":[0.000021425683,0.00016568323,0.008657655,0.00001763636,0.00004500725,0.00023072222,0.00020609016,0.95623195,0.023376968,0.0069829533,0.0040196558,0.0000443061],"about_ca_topic_score_codex":0.0039059473,"about_ca_topic_score_gemma":0.008261614,"teacher_disagreement_score":0.0044313474,"about_ca_system_score_codex":0.00063323614,"about_ca_system_score_gemma":0.0005538923,"threshold_uncertainty_score":0.008133292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920398,0.000051517898,0.0025830844,0.0010133333,0.000021190885,0.00023873807,0.00012695715,0.000035815745,0.0038895782],"genre_scores_gemma":[0.9940303,0.000060044465,0.0037288184,0.00026120286,0.0000137960615,0.0003449955,0.00009023616,0.000027066226,0.0014434949],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9901087,0.0071356446,0.00031741904,0.0007662426,0.0010788547,0.00059317064],"domain_scores_gemma":[0.94807035,0.039729174,0.004218426,0.0039746,0.0025815659,0.001425897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008421514,0.0005434199,0.00040561322,0.0008668264,0.003069116,0.0018542946,0.0015256512,0.0025822755,0.0029252726],"category_scores_gemma":[0.038136736,0.00042346978,0.0006118337,0.00081105484,0.0025708766,0.0030587835,0.0020212384,0.0024473267,0.000586407],"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.0027168256,0.017903412,0.38068545,0.0019171531,0.0004368296,0.024247594,0.33629945,0.02322698,0.021881448,0.026211452,0.0131929265,0.15128049],"study_design_scores_gemma":[0.00074471836,0.01081096,0.28941017,0.00085981865,0.0004142429,0.004049323,0.44338152,0.09163096,0.034855846,0.022968471,0.100146726,0.00072725816],"about_ca_topic_score_codex":0.006560706,"about_ca_topic_score_gemma":0.012946752,"teacher_disagreement_score":0.008421514,"about_ca_system_score_codex":0.0029692857,"about_ca_system_score_gemma":0.0014779029,"threshold_uncertainty_score":0.044537723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008042054,0.9945261,0.0017498799,0.00095869595,0.00021754118,0.000043314692,0.00022427016,0.00003095508,0.0014450869],"genre_scores_gemma":[0.005859791,0.9897905,0.0031301703,0.00034733297,0.00024333692,0.000061217936,0.00029414607,0.000010691131,0.00026282383],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974165,0.0007476272,0.0005324053,0.00040845165,0.0008084733,0.000086481006],"domain_scores_gemma":[0.98051685,0.014798139,0.001594349,0.0003330075,0.0024821246,0.0002756073],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0047348607,0.0011413683,0.0027129916,0.025755906,0.00083325536,0.0032645622,0.0016995732,0.0013222724,0.0040435563],"category_scores_gemma":[0.01817615,0.00059690257,0.0019049222,0.041509032,0.00091165816,0.003874953,0.0015454332,0.0012370211,0.0011714291],"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.000059812755,0.00010541467,0.0027506864,0.10673339,0.0008156569,0.00015169365,0.00035184884,0.0005822939,0.00042806484,0.006023381,0.021187505,0.86081034],"study_design_scores_gemma":[0.000056437835,0.00026062416,0.024734179,0.19786383,0.008126237,0.0021751067,0.0017458401,0.002421426,0.0014800311,0.016054032,0.7448545,0.0002278235],"about_ca_topic_score_codex":0.0045286356,"about_ca_topic_score_gemma":0.009640619,"teacher_disagreement_score":0.9742441,"about_ca_system_score_codex":0.0017230534,"about_ca_system_score_gemma":0.0073531317,"threshold_uncertainty_score":0.025040627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009178964,0.0002665689,0.98886335,0.00018527663,0.00002449511,0.000053052932,0.00007228319,0.0003095768,0.0010465301],"genre_scores_gemma":[0.55291957,0.0008702415,0.44026476,0.0002984676,0.00021225202,0.00046589557,0.0009531982,0.0002441003,0.0037714355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988914,0.00039895903,0.0000515923,0.0003190546,0.0002363506,0.00010267107],"domain_scores_gemma":[0.9975605,0.0015649542,0.0003142313,0.00019580667,0.00026001295,0.000104597675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014020937,0.001398053,0.0013854686,0.0020037633,0.0006812789,0.0012819811,0.0018339544,0.0012741011,0.0014200521],"category_scores_gemma":[0.0066992003,0.0005792221,0.0012740089,0.0018837568,0.0011129465,0.0027202996,0.0017246472,0.0019120332,0.0004456632],"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.00009389172,0.00011168787,0.0024963035,0.00024447203,0.00014523315,0.00015590696,0.00022901985,0.77053654,0.002546147,0.0476477,0.0037611118,0.17203198],"study_design_scores_gemma":[0.0000037466132,0.0000098304,0.00012667493,0.000007231814,0.000008750996,0.000018813129,0.00000999397,0.9877346,0.00042429718,0.011229641,0.0004210294,0.0000053518156],"about_ca_topic_score_codex":0.0040375097,"about_ca_topic_score_gemma":0.003894454,"teacher_disagreement_score":0.0040375097,"about_ca_system_score_codex":0.0013456796,"about_ca_system_score_gemma":0.0009670178,"threshold_uncertainty_score":0.009763658},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864071,0.0005021556,0.0027691468,0.0004932218,0.000055401157,0.000043722557,0.00038236205,0.000026496828,0.009320392],"genre_scores_gemma":[0.998279,0.00016132458,0.0006122849,0.00003571159,0.000019162053,0.000032958375,0.00024782066,0.000009051814,0.0006025972],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989957,0.0003475062,0.00005378543,0.00026338958,0.00018471568,0.00015479712],"domain_scores_gemma":[0.9952685,0.0016720672,0.0014603786,0.00037017054,0.00062462,0.00060419436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013055401,0.00025035045,0.00032495466,0.0019754188,0.0013986443,0.0023966178,0.00042204736,0.0004710367,0.0023212447],"category_scores_gemma":[0.010122582,0.0001686949,0.00019318645,0.0016871234,0.0010613352,0.0021128482,0.0019986893,0.0004462105,0.00024952737],"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.0006690129,0.00019322663,0.69678056,0.0006627847,0.0004520223,0.0010706701,0.15696709,0.0026320117,0.008862427,0.013486727,0.006252392,0.111971095],"study_design_scores_gemma":[0.000010046897,0.00010394711,0.894047,0.00013272336,0.00007860795,0.00033575407,0.08209797,0.0023729012,0.00071251456,0.0071520335,0.012912885,0.000043645974],"about_ca_topic_score_codex":0.0054659345,"about_ca_topic_score_gemma":0.0079153795,"teacher_disagreement_score":0.0054659345,"about_ca_system_score_codex":0.0010210858,"about_ca_system_score_gemma":0.00054340594,"threshold_uncertainty_score":0.010868192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67019516,0.0011780919,0.30842632,0.0020240077,0.00021276403,0.00033152723,0.0018969021,0.0061956435,0.009539519],"genre_scores_gemma":[0.8633912,0.00026382753,0.13028924,0.00029935004,0.000052033327,0.00028989383,0.0031484086,0.0005034576,0.0017624804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997387,0.0010543519,0.00011274163,0.0006078207,0.00064023054,0.00019781697],"domain_scores_gemma":[0.9777294,0.01395741,0.0012016278,0.003943409,0.0025330477,0.00063511357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062417295,0.0007606768,0.0010029682,0.0015449343,0.00091702986,0.0016203615,0.0021266877,0.0015441345,0.0016302072],"category_scores_gemma":[0.037279453,0.00052922766,0.0006605778,0.0011803962,0.0013045862,0.0031581705,0.0012615811,0.0015176067,0.0006041048],"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.0006084232,0.00030755432,0.0067680925,0.00020815068,0.00013141765,0.0001122484,0.00012380326,0.93315375,0.0040317844,0.017206358,0.006856188,0.030492289],"study_design_scores_gemma":[0.00003665467,0.00005061119,0.000272131,0.000005364736,0.0000066384077,0.000036074936,0.000012888492,0.99261224,0.0010415593,0.005539734,0.00037934456,0.0000066533216],"about_ca_topic_score_codex":0.008540486,"about_ca_topic_score_gemma":0.006863521,"teacher_disagreement_score":0.008540486,"about_ca_system_score_codex":0.0018190276,"about_ca_system_score_gemma":0.0014973497,"threshold_uncertainty_score":0.033009768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10151678,0.0005878678,0.8943034,0.00030989773,0.000065393186,0.000052483003,0.0005821776,0.0012644231,0.001317478],"genre_scores_gemma":[0.8618075,0.00044669062,0.13261145,0.00009773327,0.000060109884,0.000053636828,0.0013858461,0.00014372464,0.0033933271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962986,0.00007417035,0.000016041413,0.00013208055,0.000086583124,0.00006115802],"domain_scores_gemma":[0.9979997,0.0011526602,0.00026003318,0.00020886844,0.00027969843,0.00009892909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007786872,0.0009338412,0.0007699761,0.0020561002,0.0004647085,0.0009262648,0.0014914505,0.0011272818,0.001567679],"category_scores_gemma":[0.004011863,0.000477094,0.0005929591,0.0012359557,0.0005660456,0.0017460454,0.00095230964,0.00129875,0.0004437285],"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.0007655613,0.00022948063,0.012230497,0.00026337273,0.00031085705,0.0004219499,0.00018363266,0.61062485,0.02161422,0.023754809,0.0077165696,0.32188407],"study_design_scores_gemma":[0.0000025982024,0.000008786103,0.0005310718,0.000003917691,0.000009809143,0.000018425606,0.000007764038,0.9940084,0.0009817154,0.0042252922,0.00019878808,0.0000032636096],"about_ca_topic_score_codex":0.01083573,"about_ca_topic_score_gemma":0.01799817,"teacher_disagreement_score":0.01083573,"about_ca_system_score_codex":0.0009837066,"about_ca_system_score_gemma":0.0006935459,"threshold_uncertainty_score":0.02154535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017217305,0.00066426967,0.977433,0.00017506623,0.000063220505,0.0001592214,0.00007760121,0.0007470223,0.0034632785],"genre_scores_gemma":[0.25385818,0.00073822093,0.73731166,0.00011207171,0.00006720946,0.00049047504,0.0003919217,0.0001397807,0.006890426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934465,0.00011945346,0.00005505247,0.00018592972,0.00023833424,0.00005654859],"domain_scores_gemma":[0.9995484,0.00010328264,0.00006138617,0.000043394608,0.00022034743,0.000023277154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057718606,0.0007803013,0.0011446379,0.0019359796,0.0011220789,0.00095296634,0.0013110033,0.0010469746,0.001860937],"category_scores_gemma":[0.001577094,0.00046101265,0.0008900727,0.001680621,0.0006431996,0.0012279722,0.0007875188,0.0007480871,0.0007901189],"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.00014759427,0.000067954345,0.0021306777,0.00029901727,0.00019538749,0.00013032704,0.00038088975,0.6473889,0.010691169,0.028194968,0.005962592,0.30441064],"study_design_scores_gemma":[0.000021537653,0.000023018201,0.00046123282,0.000016762666,0.000015558473,0.00008546217,0.0000411587,0.98520154,0.002966333,0.007508918,0.0036245987,0.00003384292],"about_ca_topic_score_codex":0.013229986,"about_ca_topic_score_gemma":0.008480274,"teacher_disagreement_score":0.013229986,"about_ca_system_score_codex":0.0009797473,"about_ca_system_score_gemma":0.0020736498,"threshold_uncertainty_score":0.026305974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027082382,0.0004767422,0.9679356,0.0007544952,0.000056540426,0.00007681632,0.00079399504,0.00025218807,0.0025712796],"genre_scores_gemma":[0.7756584,0.0014740585,0.19031568,0.00047591308,0.00029104418,0.0009354579,0.00334063,0.00029667967,0.027212119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828786,0.0008348132,0.00007332269,0.00037578435,0.00027225702,0.00015596104],"domain_scores_gemma":[0.9901523,0.006832278,0.0010104185,0.0007817166,0.0007841994,0.00043912014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004302792,0.0009528288,0.0013846193,0.0013504145,0.0008409622,0.0021072428,0.0037304389,0.0019042098,0.008438195],"category_scores_gemma":[0.01558394,0.0008612465,0.0013292669,0.0017028344,0.0017033077,0.004986446,0.001848594,0.002843253,0.0017193675],"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.000103989616,0.00007185093,0.0021892646,0.00008014785,0.00008514934,0.000095419586,0.0003018904,0.51340246,0.00054857315,0.46812853,0.003244982,0.011747775],"study_design_scores_gemma":[0.00000680332,0.000006460159,0.00012402228,0.0000044785315,0.0000050818635,0.000010204542,0.000012896675,0.91745925,0.000049644146,0.08159712,0.0007180868,0.000005902907],"about_ca_topic_score_codex":0.008016839,"about_ca_topic_score_gemma":0.0093178,"teacher_disagreement_score":0.008438195,"about_ca_system_score_codex":0.0020466782,"about_ca_system_score_gemma":0.0009733596,"threshold_uncertainty_score":0.028228581},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9579978,0.00028689636,0.039414395,0.00045497785,0.000008402258,0.000028087718,0.00017885602,0.00011099578,0.0015195442],"genre_scores_gemma":[0.9960522,0.00008792073,0.0032490431,0.000025358335,0.000015000365,0.000023774246,0.00012007659,0.000015042124,0.00041172229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990777,0.00038526006,0.000035979276,0.0002748484,0.00013533769,0.00009092037],"domain_scores_gemma":[0.9807403,0.012304,0.0038893798,0.0011305519,0.00086952385,0.0010662806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020737762,0.00026788938,0.00046939263,0.0018438306,0.00087898714,0.0011804051,0.0011123334,0.00093785906,0.0011666268],"category_scores_gemma":[0.018785099,0.00050475076,0.00042876435,0.0007807684,0.0023037822,0.0037421053,0.0013764965,0.00081266195,0.00016549331],"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.00076739566,0.00047576847,0.17686146,0.00044646536,0.0004749971,0.0014215653,0.005550666,0.37503606,0.01822599,0.3729192,0.0051551866,0.0426653],"study_design_scores_gemma":[0.0000346184,0.0000956575,0.0402723,0.00004084677,0.00003914045,0.0004281393,0.0005902434,0.8493559,0.001305034,0.10674833,0.00102863,0.000061235514],"about_ca_topic_score_codex":0.0032405404,"about_ca_topic_score_gemma":0.003445385,"teacher_disagreement_score":0.0032405404,"about_ca_system_score_codex":0.0010088163,"about_ca_system_score_gemma":0.0002915034,"threshold_uncertainty_score":0.010967314},"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":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8991988,0.0030295197,0.055839837,0.017951347,0.00023109974,0.00007593561,0.0013519796,0.00035031897,0.0219712],"genre_scores_gemma":[0.99317694,0.0005851514,0.0035376388,0.000792027,0.00017631134,0.000023922232,0.0001874188,0.00010252099,0.0014179767],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824643,0.0008478763,0.0000570374,0.0004159391,0.00032909456,0.00010373706],"domain_scores_gemma":[0.968418,0.021081258,0.0040588467,0.003571746,0.0018152095,0.0010550191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035141122,0.00046211565,0.00062512024,0.001156072,0.0011007341,0.0025805174,0.00079869526,0.0010887422,0.003458296],"category_scores_gemma":[0.041481256,0.00035089708,0.0006411933,0.001728533,0.002510613,0.00748375,0.0015101928,0.0025054205,0.00059435813],"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.00052628375,0.00021471085,0.62091726,0.0004173977,0.0009501522,0.0010378764,0.0126956925,0.018723004,0.010830025,0.12497137,0.023882896,0.18483327],"study_design_scores_gemma":[0.000060401526,0.00044880674,0.652233,0.00029747788,0.00059449294,0.0010104548,0.0068620453,0.1392053,0.0074640256,0.15568727,0.035910986,0.00022583018],"about_ca_topic_score_codex":0.008255463,"about_ca_topic_score_gemma":0.0078037917,"teacher_disagreement_score":0.008255463,"about_ca_system_score_codex":0.0009381089,"about_ca_system_score_gemma":0.0005600952,"threshold_uncertainty_score":0.018584609},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015649238,0.00027297557,0.99615735,0.00010426126,0.00006556476,0.00007212949,0.00016491783,0.0010631089,0.000534746],"genre_scores_gemma":[0.060804732,0.0005948411,0.93356895,0.00015731565,0.00015612581,0.0005234115,0.0013752246,0.00035735357,0.002462028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802065,0.0007132398,0.000086444146,0.00043477668,0.0006177917,0.00012704104],"domain_scores_gemma":[0.99771655,0.00089274556,0.00024663686,0.0003619544,0.00066890655,0.00011318369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021366298,0.0024556476,0.0015279069,0.0029027313,0.0014763394,0.0013547248,0.002043953,0.0014522825,0.0026308917],"category_scores_gemma":[0.007801112,0.0006724246,0.0017213107,0.0032228564,0.0011799335,0.0020680516,0.0017733958,0.0021380659,0.00295361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042828344,0.00020689983,0.0025843952,0.0006886349,0.00049701985,0.0002860183,0.00053589017,0.26122236,0.015329298,0.056807928,0.03632964,0.62508357],"study_design_scores_gemma":[0.000020338335,0.000030732237,0.00062544586,0.00002523494,0.00002811708,0.00009380945,0.000054490945,0.9607834,0.0028747073,0.02710335,0.008321629,0.000038688093],"about_ca_topic_score_codex":0.009867651,"about_ca_topic_score_gemma":0.012265849,"teacher_disagreement_score":0.009867651,"about_ca_system_score_codex":0.0011299488,"about_ca_system_score_gemma":0.00189466,"threshold_uncertainty_score":0.019620419},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11961782,0.0021405427,0.85055524,0.0020989366,0.00018755779,0.000077685436,0.00011632585,0.00018646363,0.025019424],"genre_scores_gemma":[0.9689445,0.001595679,0.021934489,0.00020012494,0.00018563878,0.00014737823,0.00005316987,0.000044515,0.0068945033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995962,0.00018858681,0.000012947883,0.00007921494,0.000072775925,0.000050287872],"domain_scores_gemma":[0.99793124,0.0013881571,0.00033516725,0.00008583117,0.00018123853,0.00007852424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076079887,0.001036062,0.0005522912,0.0010263793,0.00066607044,0.0013603495,0.0011325415,0.0011533288,0.0022730215],"category_scores_gemma":[0.003430383,0.00032212067,0.0007528203,0.0005654721,0.0017001672,0.0014051996,0.0017204637,0.0012006727,0.000275118],"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.00003563932,0.000055988752,0.0011061305,0.00011872051,0.00006709519,0.00038437007,0.00037232102,0.5757124,0.0043567303,0.40862465,0.0010173329,0.008148643],"study_design_scores_gemma":[0.0000055231594,0.000016377213,0.00008404455,0.000008787777,0.000007697961,0.000028471719,0.000033145407,0.9374659,0.0002237506,0.061517186,0.000601198,0.000007844462],"about_ca_topic_score_codex":0.0027016117,"about_ca_topic_score_gemma":0.0016345754,"teacher_disagreement_score":0.0027016117,"about_ca_system_score_codex":0.0010942364,"about_ca_system_score_gemma":0.00060270616,"threshold_uncertainty_score":0.007939279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.714009,0.0002486519,0.28218803,0.00026729243,0.000017981389,0.00019843284,0.0013907469,0.00017446643,0.0015054024],"genre_scores_gemma":[0.944498,0.00022487156,0.053509094,0.00003893242,0.0000186873,0.00012714686,0.001157357,0.000013792063,0.00041204624],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618065,0.0025577117,0.00015381543,0.00069785805,0.00025109237,0.00015901105],"domain_scores_gemma":[0.9050582,0.074348554,0.010037484,0.0077731973,0.0018460392,0.0009365385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008247268,0.00049651606,0.00065672415,0.0027574701,0.00047723704,0.0012979376,0.0015972765,0.0011175626,0.0012556788],"category_scores_gemma":[0.0745006,0.0007340456,0.0009173466,0.0021251512,0.0012168625,0.0028630418,0.0011749645,0.0012329427,0.00028577037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005082833,0.00037937448,0.69467914,0.00035509607,0.0006876857,0.0003037506,0.0019830796,0.17433715,0.0020037477,0.04334352,0.0014175,0.080001615],"study_design_scores_gemma":[0.000053215586,0.00017237723,0.12453219,0.00010379367,0.00012372463,0.00029586468,0.0007758488,0.8313629,0.001609668,0.039091587,0.0018093314,0.00006947846],"about_ca_topic_score_codex":0.0058349436,"about_ca_topic_score_gemma":0.008362035,"teacher_disagreement_score":0.008247268,"about_ca_system_score_codex":0.0011713823,"about_ca_system_score_gemma":0.0005326505,"threshold_uncertainty_score":0.043616235},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009613078,0.0056068604,0.4539721,0.0018801058,0.0010287599,0.00009850908,0.001621824,0.0012852099,0.5248936],"genre_scores_gemma":[0.36407587,0.018625714,0.19494227,0.0015296591,0.0018437352,0.00047165705,0.0057562436,0.0013435953,0.41141123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997967,0.000023383272,0.0000075014923,0.00007693177,0.000072366216,0.000023167762],"domain_scores_gemma":[0.9997117,0.000092614486,0.000019756088,0.00009537931,0.000055264834,0.0000251908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017114982,0.0005954232,0.0004275646,0.0007989446,0.0005012722,0.001557941,0.0007960287,0.0006432508,0.029191708],"category_scores_gemma":[0.0012645182,0.00033680955,0.000278185,0.0010073032,0.0007099119,0.0027719948,0.001376161,0.0013670856,0.007168641],"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.000028460016,0.000018710549,0.00013213439,0.00020097502,0.000019345252,0.00008054236,0.000075693,0.014620543,0.0027464435,0.7167948,0.06437535,0.20090704],"study_design_scores_gemma":[0.000009539097,0.000016237233,0.00024199163,0.000085845655,0.00001504267,0.00032270706,0.000032791697,0.03520935,0.0014628541,0.76731354,0.19527291,0.00001702011],"about_ca_topic_score_codex":0.0006595015,"about_ca_topic_score_gemma":0.0010193785,"teacher_disagreement_score":0.029191708,"about_ca_system_score_codex":0.0005371115,"about_ca_system_score_gemma":0.00043868826,"threshold_uncertainty_score":0.09765595},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002170658,0.0003053415,0.99368227,0.00019077958,0.000063610205,0.00003935818,0.000040575917,0.00014855209,0.0033587662],"genre_scores_gemma":[0.056412227,0.00056852394,0.9379784,0.00015170392,0.00013043432,0.00027123702,0.0002249994,0.00043450913,0.003828011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857616,0.00074533303,0.00006783342,0.00020896377,0.00028448086,0.000117179254],"domain_scores_gemma":[0.99188834,0.006646191,0.00031314048,0.00040812252,0.0006120382,0.0001322237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035069094,0.0021894784,0.0019121305,0.002073044,0.0012369244,0.0021081977,0.0031047594,0.0021417986,0.006075546],"category_scores_gemma":[0.01707772,0.001967591,0.0022501692,0.0026815936,0.0019700122,0.0035459055,0.0025712189,0.0045015775,0.0011515098],"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.000028138482,0.00005441885,0.00015049937,0.00014871493,0.00003699171,0.000029734278,0.00011671078,0.88922864,0.00031211774,0.06582843,0.0029797826,0.041085783],"study_design_scores_gemma":[0.0000082002325,0.000008322626,0.000019860647,0.000021002968,0.0000068983045,0.000007842818,0.000020273119,0.9549446,0.00014381175,0.04355138,0.0012621175,0.0000057117336],"about_ca_topic_score_codex":0.009781557,"about_ca_topic_score_gemma":0.0108573865,"teacher_disagreement_score":0.009781557,"about_ca_system_score_codex":0.0025419306,"about_ca_system_score_gemma":0.0022076378,"threshold_uncertainty_score":0.020324647},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0093341535,0.0035958935,0.98215896,0.00094359694,0.0001364883,0.00002947412,0.00032010657,0.00058251224,0.0028987406],"genre_scores_gemma":[0.4083021,0.010327552,0.54243284,0.0003977806,0.0017616849,0.00045481182,0.0023372422,0.0009873112,0.03299877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993647,0.00028869155,0.000028097384,0.00013992,0.00012909583,0.000049478735],"domain_scores_gemma":[0.9970956,0.0024172652,0.00010032361,0.00018586812,0.0001327215,0.000068243244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016056938,0.00082018727,0.00093363127,0.0009453673,0.00048676552,0.0014182904,0.0014898741,0.0010207619,0.002750685],"category_scores_gemma":[0.005230374,0.00059912173,0.0012551747,0.0014019147,0.00058811303,0.0032536339,0.0011657076,0.0022206404,0.0010934429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015356267,0.00029867134,0.004389,0.00038357955,0.00031982647,0.00012414319,0.00079517165,0.32892478,0.0029129363,0.28347963,0.037655767,0.340563],"study_design_scores_gemma":[0.000004090699,0.000008481082,0.0005750289,0.00001727381,0.000019055286,0.000030019395,0.00003756374,0.89458114,0.0003080419,0.09918569,0.0052243834,0.00000915952],"about_ca_topic_score_codex":0.0053355424,"about_ca_topic_score_gemma":0.0073469006,"teacher_disagreement_score":0.0053355424,"about_ca_system_score_codex":0.0011117985,"about_ca_system_score_gemma":0.00060761307,"threshold_uncertainty_score":0.010608971},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008104091,0.0032236953,0.97289455,0.00071232725,0.0002408426,0.000027952257,0.00044588314,0.00031612845,0.014034565],"genre_scores_gemma":[0.47656974,0.020304233,0.4196797,0.0005546817,0.0026107277,0.00041956233,0.0036593426,0.0010346026,0.07516751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940777,0.00013226926,0.00002810953,0.00016062838,0.00021890004,0.000052398354],"domain_scores_gemma":[0.9973794,0.0018110041,0.00015981757,0.00024189406,0.00031967185,0.00008825611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011562868,0.0008996032,0.00067442446,0.0021144324,0.000484443,0.0018853642,0.001324063,0.00072321435,0.0048828744],"category_scores_gemma":[0.0067783366,0.0004651758,0.0009504484,0.0022325506,0.00074949,0.0037447726,0.0011319703,0.0014798808,0.0010098293],"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.00005355304,0.0000515741,0.0013876125,0.00031971198,0.000103706625,0.00018343798,0.0003543215,0.12905224,0.0033714287,0.67464674,0.018227085,0.17224868],"study_design_scores_gemma":[0.0000029049843,0.000010215134,0.00071961136,0.000043154447,0.00002761408,0.00012685201,0.000084520594,0.61003566,0.0006985413,0.3740324,0.014204846,0.000013582348],"about_ca_topic_score_codex":0.0028911794,"about_ca_topic_score_gemma":0.0024543444,"teacher_disagreement_score":0.0048828744,"about_ca_system_score_codex":0.001119824,"about_ca_system_score_gemma":0.00049715897,"threshold_uncertainty_score":0.016334832},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014379269,0.0118740015,0.8996126,0.0057519544,0.0014466087,0.00039231413,0.010518834,0.0045623523,0.05146206],"genre_scores_gemma":[0.13718909,0.022449879,0.7062563,0.0012659982,0.0029378731,0.0008001717,0.0362676,0.0013391118,0.09149408],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991636,0.00014914123,0.000048764115,0.00023098297,0.000375395,0.000032060263],"domain_scores_gemma":[0.99837494,0.0009766142,0.00008476362,0.00031315035,0.00019889299,0.000051718638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009694105,0.001157676,0.0007188353,0.004229366,0.0007091863,0.0025984652,0.0010675697,0.0008033376,0.0070917434],"category_scores_gemma":[0.0055628275,0.000556109,0.0010037028,0.0047295205,0.00053189864,0.0045562023,0.0017521391,0.0014172818,0.0071801003],"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.000030074045,0.00010894346,0.0026828898,0.0005121726,0.0001353818,0.00011541935,0.00025059137,0.005635717,0.0025800325,0.045358215,0.09633428,0.8462563],"study_design_scores_gemma":[0.0000119653405,0.00004786985,0.0057249456,0.00047102018,0.000115737435,0.0007279468,0.0004932362,0.17424874,0.009891323,0.39219555,0.4160017,0.00006993723],"about_ca_topic_score_codex":0.0009855547,"about_ca_topic_score_gemma":0.0024227859,"teacher_disagreement_score":0.0070917434,"about_ca_system_score_codex":0.0005198348,"about_ca_system_score_gemma":0.0005583357,"threshold_uncertainty_score":0.023724198},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004770315,0.0006040045,0.9873296,0.00034992534,0.000083594015,0.0001536676,0.0017182266,0.0037845029,0.001206132],"genre_scores_gemma":[0.20962511,0.0010142684,0.7728392,0.00051818334,0.00032678735,0.0007688719,0.00817012,0.00074919953,0.0059883143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983968,0.0005014189,0.000066121196,0.000527131,0.0003460046,0.00016245004],"domain_scores_gemma":[0.9967836,0.0016491816,0.00028552426,0.00046606403,0.0005487179,0.0002668164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022933816,0.0015730349,0.0014209517,0.0038297446,0.0015024993,0.0018147029,0.0034069149,0.0021546858,0.004220058],"category_scores_gemma":[0.00974695,0.0008848706,0.0019825217,0.0029569734,0.0009852923,0.0041188896,0.003048322,0.0032576693,0.0026767168],"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.00046308208,0.00045073562,0.01126992,0.00057546835,0.00047258675,0.0005173676,0.000745487,0.48772395,0.004782562,0.110945225,0.054061603,0.32799196],"study_design_scores_gemma":[0.000013125172,0.000020046582,0.00032038,0.000020467773,0.000013755652,0.000050801627,0.000035692923,0.95210296,0.00033872563,0.043827377,0.0032434254,0.00001322795],"about_ca_topic_score_codex":0.019954585,"about_ca_topic_score_gemma":0.035168614,"teacher_disagreement_score":0.019954585,"about_ca_system_score_codex":0.001514141,"about_ca_system_score_gemma":0.0018331611,"threshold_uncertainty_score":0.039676905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09809609,0.0011652027,0.891893,0.0010250906,0.00008884199,0.00012859986,0.0012510372,0.002780544,0.003571556],"genre_scores_gemma":[0.8112962,0.0006737298,0.17802092,0.0006752643,0.00008278925,0.00020431433,0.0024212226,0.00019231334,0.006433231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997161,0.000053276497,0.0000120334125,0.00010141274,0.00006026227,0.000056813227],"domain_scores_gemma":[0.99934596,0.0002518407,0.00009269979,0.000098089746,0.00013953041,0.00007192034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073044345,0.0009360108,0.0006737319,0.0012600488,0.0006594798,0.00083960674,0.001980659,0.0013487398,0.0018958524],"category_scores_gemma":[0.003313632,0.0004333728,0.00060345826,0.0013376927,0.0008114958,0.0023052765,0.0012906773,0.001402328,0.00040112375],"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.00026585898,0.0001998924,0.0042289803,0.00017516855,0.00013183396,0.00015770305,0.00017617778,0.763694,0.008742564,0.033399243,0.010133789,0.17869477],"study_design_scores_gemma":[0.000004173576,0.0000076176466,0.00015258834,0.0000038089154,0.00000561008,0.000011700141,0.000006169081,0.99353856,0.0005251521,0.005387734,0.00035330118,0.000003546354],"about_ca_topic_score_codex":0.03441153,"about_ca_topic_score_gemma":0.052918278,"teacher_disagreement_score":0.03441153,"about_ca_system_score_codex":0.0028227565,"about_ca_system_score_gemma":0.0013947517,"threshold_uncertainty_score":0.06842244},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050176896,0.0009948232,0.94078416,0.0015082008,0.00007525044,0.00007590084,0.00030388057,0.00040209366,0.005678755],"genre_scores_gemma":[0.8862563,0.0024348104,0.0987831,0.00072110235,0.00063064165,0.00070351455,0.0007465833,0.00030640067,0.009417652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953531,0.0029190239,0.0001372944,0.00061244325,0.0006322116,0.00034597123],"domain_scores_gemma":[0.9139728,0.07188139,0.0060689156,0.0037983228,0.0032039185,0.001074629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01370998,0.0012018163,0.002334806,0.0039359364,0.0012406607,0.0025755127,0.0040873806,0.0030792975,0.0064089173],"category_scores_gemma":[0.08911396,0.0014172669,0.002076802,0.003083506,0.0056317444,0.00819729,0.0032881717,0.004242546,0.0008708079],"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.000039344206,0.000042143,0.0020517774,0.00013341744,0.00008658298,0.0001738582,0.00025109705,0.16752574,0.00055431627,0.8204591,0.0020508256,0.006631752],"study_design_scores_gemma":[0.000013800187,0.000020552101,0.00063111435,0.000033883556,0.000025223553,0.00008922081,0.00006189146,0.65424055,0.000121312405,0.34370413,0.0010253086,0.00003297253],"about_ca_topic_score_codex":0.007157209,"about_ca_topic_score_gemma":0.005140652,"teacher_disagreement_score":0.01370998,"about_ca_system_score_codex":0.0033136099,"about_ca_system_score_gemma":0.0013443826,"threshold_uncertainty_score":0.07250613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64939594,0.0026600508,0.3362719,0.00064303924,0.00018082022,0.00026949638,0.00081316,0.0015686167,0.008196906],"genre_scores_gemma":[0.9298206,0.00040618813,0.06826407,0.000056712728,0.000029537163,0.000072902716,0.000650393,0.00013193501,0.0005677269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976279,0.0010548808,0.00012415997,0.00047511098,0.0005169111,0.00020112046],"domain_scores_gemma":[0.9797733,0.014876077,0.0013933122,0.0016844358,0.0017100906,0.00056295464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050279414,0.0012714263,0.0010322399,0.0049201148,0.0009861205,0.0016258856,0.0012459655,0.0010100545,0.0012785803],"category_scores_gemma":[0.031442814,0.000378709,0.00078720524,0.0023392464,0.001411832,0.00265687,0.001435401,0.00093871064,0.00037313765],"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.00043834135,0.00017214761,0.030814275,0.0007468828,0.00030422557,0.00032253982,0.0007113765,0.8385631,0.007720321,0.02259183,0.0032715078,0.094343424],"study_design_scores_gemma":[0.000025932282,0.00015425732,0.004875874,0.00008522133,0.00007378027,0.00023145329,0.0003562472,0.95469046,0.011310759,0.025906224,0.0022476888,0.00004214965],"about_ca_topic_score_codex":0.0035375683,"about_ca_topic_score_gemma":0.00406677,"teacher_disagreement_score":0.0050279414,"about_ca_system_score_codex":0.0012057212,"about_ca_system_score_gemma":0.0008524159,"threshold_uncertainty_score":0.026590586},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020179618,0.0006532733,0.97040355,0.0005539262,0.000116955685,0.00013239197,0.000244458,0.0006767814,0.0070391484],"genre_scores_gemma":[0.5375286,0.002235447,0.44760728,0.00031288445,0.00018093691,0.00072062225,0.0008214144,0.00039195505,0.010200808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923456,0.00038377554,0.000028793129,0.00013562528,0.00017182878,0.00004535393],"domain_scores_gemma":[0.9974848,0.0017686985,0.00018621307,0.0002689597,0.00021587276,0.00007544244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001021312,0.00062452175,0.00075548224,0.0015133115,0.0005389557,0.0012765038,0.0009687316,0.001236588,0.0036952065],"category_scores_gemma":[0.0062854686,0.00047494212,0.0011441567,0.0011401193,0.0010194038,0.0021428638,0.00085313106,0.0011212059,0.0007234811],"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.000039182698,0.000043229484,0.00076377305,0.00014051977,0.000063623695,0.00013147904,0.00015259678,0.59286964,0.002396223,0.3776319,0.0026359446,0.023131885],"study_design_scores_gemma":[0.000013716901,0.000010115656,0.00011766321,0.000011709549,0.000006323928,0.000036660647,0.000010914125,0.9222352,0.00047439238,0.07492989,0.002142699,0.000010711573],"about_ca_topic_score_codex":0.0037919579,"about_ca_topic_score_gemma":0.0024445667,"teacher_disagreement_score":0.0037919579,"about_ca_system_score_codex":0.00092560006,"about_ca_system_score_gemma":0.0006111894,"threshold_uncertainty_score":0.012361765},"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":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011319773,0.00049121334,0.00031513657,0.00040734437,0.00069021794,0.00005898578,0.95695376,0.0024613827,0.037490062],"genre_scores_gemma":[0.0015349716,0.00025555608,0.00054900866,0.00017540144,0.00009783008,0.00005013129,0.97384036,0.00042313468,0.023073627],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932814,0.00006229087,0.000036055455,0.0001552634,0.00024438248,0.000173873],"domain_scores_gemma":[0.9986784,0.00011277871,0.0000835819,0.00022977561,0.0005422638,0.00035324058],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00054112246,0.0014347886,0.0009823365,0.0029057595,0.0014125468,0.0043583782,0.0010800486,0.00078794523,0.19571944],"category_scores_gemma":[0.0021702524,0.0004493572,0.0008828234,0.004510814,0.00027672906,0.0021900097,0.0026231084,0.001454272,0.2827588],"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.000029597371,0.0000068185577,0.00034693553,0.00010450676,0.000006113958,0.000011295312,0.000015418791,0.000024211864,0.000111249625,0.00019025916,0.9951197,0.004033891],"study_design_scores_gemma":[0.000015360429,0.000010918728,0.0037793072,0.000074479605,0.0000048766606,0.000021905902,0.00011798716,0.00011949973,0.00019767047,0.00019845474,0.99544674,0.000012823879],"about_ca_topic_score_codex":0.06339107,"about_ca_topic_score_gemma":0.19550642,"teacher_disagreement_score":0.8042806,"about_ca_system_score_codex":0.001325562,"about_ca_system_score_gemma":0.0014681462,"threshold_uncertainty_score":0.6547468},"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":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022645392,0.0006726963,0.00077110296,0.0013847216,0.00117806,0.0001173903,0.8714861,0.013052072,0.109073445],"genre_scores_gemma":[0.0056211962,0.00078728184,0.0015843668,0.0009000246,0.0001529949,0.00012572111,0.8873062,0.0029906256,0.10053149],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994135,0.0000601118,0.000037893962,0.00015877653,0.0001638032,0.00016589869],"domain_scores_gemma":[0.99785304,0.00020023715,0.00006572662,0.0005777859,0.00087832706,0.0004248829],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00053160667,0.0014033827,0.0009483588,0.0023920576,0.0019503116,0.004303483,0.0014411145,0.001104353,0.3100513],"category_scores_gemma":[0.003951419,0.00056385185,0.0006939225,0.0050606322,0.0003985661,0.003661457,0.0031922855,0.0014541965,0.3496872],"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.000056950666,0.000005946037,0.00047365364,0.00007699093,0.0000071493914,0.000024449111,0.00003607935,0.00004128659,0.00016472985,0.00033776765,0.9911794,0.0075955084],"study_design_scores_gemma":[0.000018746847,0.0000061682376,0.0025771484,0.00011221793,0.0000043572654,0.00002259876,0.00017257061,0.00018498326,0.00020023581,0.0004237353,0.99625176,0.00002547471],"about_ca_topic_score_codex":0.31138277,"about_ca_topic_score_gemma":0.55135894,"teacher_disagreement_score":0.6899487,"about_ca_system_score_codex":0.0022346664,"about_ca_system_score_gemma":0.0035864557,"threshold_uncertainty_score":0.9841281},"labels":[],"label_agreement":null},{"id":"W4310220416","doi":"10.1093/comnet/cnac054","title":"Controllability of a class of swarm signalling networks","year":2022,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"China Scholarship Council","keywords":"Controllability; Degree (music); Computer science; Class (philosophy); Fraction (chemistry); Degree distribution; Swarm behaviour; Complex network; Modal; Distribution (mathematics); Mathematical optimization; Topology (electrical circuits); Mathematics; Applied mathematics; Artificial intelligence; Combinatorics; Physics; Mathematical analysis","score_opus":0.015717435576237556,"score_gpt":0.25922754359335876,"score_spread":0.2435101080171212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310220416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3832388,0.00023482656,0.59911716,0.00042105417,0.000043428852,0.00007045845,0.00014524159,0.00023583348,0.016493237],"genre_scores_gemma":[0.99501157,0.00005230691,0.0034807543,0.000020631127,0.000010170092,0.000028961344,0.000030093901,0.000007720413,0.0013577683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997398,0.000066989975,0.000008420189,0.00006809613,0.00006125465,0.000055379714],"domain_scores_gemma":[0.9986298,0.00081563625,0.00025789763,0.00006312764,0.00013752848,0.00009608408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000553325,0.0003978213,0.00033106428,0.0005546329,0.00045163513,0.0009415882,0.0006429971,0.00061274524,0.002312162],"category_scores_gemma":[0.0027870848,0.00016954537,0.00032830337,0.00021674359,0.0010648688,0.0008743581,0.000527947,0.0005739623,0.000100884325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000948713,0.000042580796,0.0014638811,0.000059893264,0.000032097407,0.00022761674,0.00012568333,0.8155707,0.011255566,0.16105667,0.0008389635,0.009231517],"study_design_scores_gemma":[0.0000046763475,0.00001140632,0.00019588365,0.0000021175345,0.0000018837603,0.000017288112,0.000014119677,0.9874593,0.00033198908,0.011792466,0.000165825,0.00000307257],"about_ca_topic_score_codex":0.003431575,"about_ca_topic_score_gemma":0.0015566658,"teacher_disagreement_score":0.003431575,"about_ca_system_score_codex":0.0008492448,"about_ca_system_score_gemma":0.00038184682,"threshold_uncertainty_score":0.0077348948},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014409776,0.00027798754,0.9739057,0.00041783997,0.00026092454,0.000116178126,0.0016718765,0.0029767947,0.0059629823],"genre_scores_gemma":[0.3263229,0.0007131382,0.63709,0.0004173148,0.00022093,0.00042857346,0.008535997,0.0019764688,0.024294721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919635,0.00015758829,0.00003363649,0.0002556808,0.0002874803,0.00006942681],"domain_scores_gemma":[0.99742633,0.00068440294,0.00018383023,0.0009709143,0.00050119666,0.00023337081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010017233,0.00096587965,0.00096029387,0.0017518688,0.0008446062,0.0014832343,0.001933511,0.001048325,0.005375798],"category_scores_gemma":[0.0059713796,0.00041204618,0.00069571525,0.0019321828,0.0010152952,0.0038535695,0.0029496483,0.0023106807,0.0015106386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000490424,0.00035259817,0.0010796158,0.00050477864,0.0001302034,0.00028531704,0.00029361024,0.19966595,0.014139804,0.2776145,0.056874935,0.44856828],"study_design_scores_gemma":[0.000035231777,0.000043764278,0.00024321824,0.00003300569,0.000022031762,0.00012799197,0.000055079436,0.843977,0.005207943,0.13455202,0.015681304,0.000021408176],"about_ca_topic_score_codex":0.0068651503,"about_ca_topic_score_gemma":0.011006635,"teacher_disagreement_score":0.0068651503,"about_ca_system_score_codex":0.001237869,"about_ca_system_score_gemma":0.0015522181,"threshold_uncertainty_score":0.017983854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000131397,0.009735845,0.0010763472,0.047112297,0.9322209,0.000049989725,0.00025717352,0.00022461837,0.00919152],"genre_scores_gemma":[0.001586366,0.010426482,0.0005055269,0.010613982,0.9523278,0.000049574697,0.00020295291,0.00019112282,0.024096072],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972263,0.00042998916,0.00021024159,0.00060041173,0.0012564274,0.00027654401],"domain_scores_gemma":[0.9881201,0.0037340883,0.0004744276,0.00054237834,0.004682912,0.0024461464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003996355,0.002193716,0.0020392209,0.0024847041,0.0023553674,0.0093736295,0.0030056604,0.0067094346,0.09336601],"category_scores_gemma":[0.01236485,0.0006645778,0.0019270125,0.0012516243,0.0017696004,0.0059332936,0.002350435,0.0098532,0.030558355],"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.000031932632,0.00001252456,0.000047534537,0.00018743685,0.000016283717,0.00006047717,0.000017341416,0.000057734032,0.00008385093,0.0018850176,0.9889181,0.008681838],"study_design_scores_gemma":[0.00003852085,0.00003214899,0.00016059847,0.0002093323,0.000029151586,0.000116672316,0.000042379485,0.0004117509,0.00016114756,0.004117888,0.99466383,0.000016677119],"about_ca_topic_score_codex":0.0011899406,"about_ca_topic_score_gemma":0.002103258,"teacher_disagreement_score":0.09336601,"about_ca_system_score_codex":0.0026090145,"about_ca_system_score_gemma":0.0022343837,"threshold_uncertainty_score":0.31234044},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25015783,0.00034708422,0.7419864,0.0007361995,0.000046977853,0.00009828577,0.00034751315,0.0009908107,0.0052889036],"genre_scores_gemma":[0.8858947,0.00032074802,0.109384224,0.00023582233,0.00004615198,0.000121330406,0.00040595524,0.00026970127,0.0033213603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999795,0.000049756087,0.000010048873,0.00006166574,0.000051740073,0.000031894684],"domain_scores_gemma":[0.9982469,0.0010081674,0.00025012434,0.00021526378,0.0001718673,0.00010765925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064176705,0.0004384341,0.00039858127,0.0010475197,0.0006202083,0.0008563309,0.0010611871,0.0008909213,0.0022994648],"category_scores_gemma":[0.0056546484,0.00038373086,0.0006793704,0.00056876155,0.0011228974,0.0017596479,0.0011901985,0.00083662145,0.00041559362],"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.00008735905,0.00005338446,0.013479795,0.00016518858,0.00006417974,0.0005132778,0.00049330364,0.71108085,0.01626953,0.21239941,0.003587705,0.04180593],"study_design_scores_gemma":[0.0000050415833,0.000012234847,0.0005971538,0.000006034635,0.000004603952,0.000071234106,0.00003244595,0.9526226,0.00080100814,0.045187887,0.0006527107,0.000007068707],"about_ca_topic_score_codex":0.0041020443,"about_ca_topic_score_gemma":0.00416175,"teacher_disagreement_score":0.0041020443,"about_ca_system_score_codex":0.0008114409,"about_ca_system_score_gemma":0.00054464006,"threshold_uncertainty_score":0.008156359},"labels":[],"label_agreement":null},{"id":"W4312051729","doi":"10.1093/comnet/cnac050","title":"Modularity of the ABCD random graph model with community structure","year":2022,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Community structure; Modularity (biology); Random graph; Computer science; Clique percolation method; Graph; Theoretical computer science; Algorithm; Mathematics; Combinatorics","score_opus":0.015242635359691042,"score_gpt":0.23832019864301532,"score_spread":0.2230775632833243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312051729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52070963,0.00086330494,0.4631143,0.0031536673,0.000089929876,0.0001369227,0.00061703,0.00046750542,0.010847665],"genre_scores_gemma":[0.9776718,0.0002059011,0.01899064,0.00018038848,0.00006786771,0.00010220673,0.00019576578,0.00007102484,0.002514451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998315,0.0009932308,0.000034411714,0.00028961286,0.00019625943,0.00017150276],"domain_scores_gemma":[0.98936635,0.006450472,0.0015423129,0.0006633747,0.0010344567,0.0009429427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038105838,0.0007551706,0.0011031554,0.0027419913,0.00091928826,0.0017720212,0.0024586222,0.0024513495,0.003074209],"category_scores_gemma":[0.017882548,0.00058087456,0.0009744611,0.0010032414,0.002797227,0.0027150565,0.0016392549,0.0013179717,0.0004127326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018168775,0.00010333032,0.004591679,0.00015488303,0.00008368264,0.00046600573,0.00031436115,0.40320197,0.0024467383,0.5778689,0.0042002397,0.0063864337],"study_design_scores_gemma":[0.000024248631,0.000016944812,0.00049340044,0.00001407608,0.000010222952,0.00008807565,0.0000301394,0.9125169,0.00014264739,0.08632835,0.000321379,0.000013622202],"about_ca_topic_score_codex":0.006686679,"about_ca_topic_score_gemma":0.003489491,"teacher_disagreement_score":0.006686679,"about_ca_system_score_codex":0.0019462752,"about_ca_system_score_gemma":0.0006533904,"threshold_uncertainty_score":0.02015251},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06162605,0.0007288836,0.9104268,0.0014075228,0.00014356402,0.00009591832,0.0007086043,0.00021476584,0.024647925],"genre_scores_gemma":[0.77316386,0.0017509239,0.15500645,0.00050934625,0.0004616831,0.00046060103,0.0012337413,0.0003336094,0.06707991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955875,0.00018782142,0.00001053338,0.00011803495,0.000079227306,0.000045657107],"domain_scores_gemma":[0.9971552,0.0019360326,0.00023820567,0.00018100005,0.00023084998,0.00025871582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012506328,0.0006524324,0.0011066989,0.0011974804,0.00083108695,0.0013701075,0.00312556,0.0020827695,0.0066711395],"category_scores_gemma":[0.0059714196,0.00066936034,0.0010006384,0.001703187,0.0013116641,0.0030909611,0.0016201485,0.0024583112,0.0006796787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048374244,0.000051643132,0.00045845375,0.000063129344,0.000032129712,0.00019306972,0.00016757927,0.43474075,0.0007730706,0.54636306,0.0043329056,0.0127758365],"study_design_scores_gemma":[0.000006954862,0.000008144128,0.00007872452,0.0000056063354,0.000007182268,0.000035547873,0.0000106868,0.894226,0.000042261836,0.10441542,0.00115769,0.0000057654925],"about_ca_topic_score_codex":0.006742447,"about_ca_topic_score_gemma":0.0061082263,"teacher_disagreement_score":0.006742447,"about_ca_system_score_codex":0.0014638654,"about_ca_system_score_gemma":0.00076032133,"threshold_uncertainty_score":0.022317171},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014532174,0.000090716574,0.98448086,0.00009558562,0.000010050257,0.00003995123,0.00004906143,0.0002474328,0.00045413518],"genre_scores_gemma":[0.4730966,0.00021328438,0.5239029,0.00012727919,0.00006813706,0.00025519374,0.00037522803,0.000116279036,0.0018450834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978638,0.0007015684,0.00007803579,0.0005546109,0.0006373564,0.00016461061],"domain_scores_gemma":[0.9950676,0.0026860826,0.0008094012,0.00046434585,0.0007700524,0.00020248852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025481137,0.0006683372,0.0009958664,0.0028753087,0.0012189315,0.0014324568,0.002353609,0.0013583539,0.0011283525],"category_scores_gemma":[0.009640206,0.0005883188,0.0010047762,0.0019966748,0.0014860344,0.0018979079,0.0023656243,0.0010231911,0.00038744122],"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.00010490058,0.000059398582,0.003984681,0.00012989293,0.00012683241,0.000157243,0.0002554244,0.8434999,0.0054668686,0.05360346,0.0018284285,0.09078303],"study_design_scores_gemma":[0.0000056138224,0.0000099635145,0.0002433505,0.0000052246896,0.000005231411,0.00002957773,0.000015733682,0.9808996,0.0007732195,0.017580396,0.0004239096,0.000008252848],"about_ca_topic_score_codex":0.005152806,"about_ca_topic_score_gemma":0.004863621,"teacher_disagreement_score":0.005152806,"about_ca_system_score_codex":0.0013533913,"about_ca_system_score_gemma":0.0012212144,"threshold_uncertainty_score":0.013475895},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007054875,0.004988128,0.7203513,0.003856981,0.0009411296,0.000352468,0.0061346097,0.0025128846,0.2538076],"genre_scores_gemma":[0.20976716,0.010775316,0.39100793,0.0014077424,0.0015522827,0.0012340284,0.017128933,0.0016656627,0.36546096],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990602,0.00032769662,0.000034133718,0.00022005694,0.0003120796,0.00004582063],"domain_scores_gemma":[0.9984492,0.00083446776,0.000077086785,0.0003424353,0.00024271604,0.000054012897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011528609,0.000774991,0.00054456736,0.0038351077,0.00090471393,0.0024571994,0.0006897903,0.00070042274,0.032208256],"category_scores_gemma":[0.005277345,0.0003686186,0.0007566084,0.0033826919,0.0006626162,0.0024600727,0.0012996237,0.0010664571,0.013367124],"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.000017371001,0.000054947664,0.0018776427,0.0002367453,0.00008026335,0.0000779892,0.0004214738,0.009476396,0.0008404307,0.38103724,0.15144585,0.4544336],"study_design_scores_gemma":[0.000006331177,0.0000202276,0.0029753852,0.00017651328,0.00004449052,0.00024072781,0.00037662234,0.076349296,0.0011737379,0.5067704,0.41183716,0.000029125773],"about_ca_topic_score_codex":0.002652873,"about_ca_topic_score_gemma":0.0035433369,"teacher_disagreement_score":0.032208256,"about_ca_system_score_codex":0.00093395164,"about_ca_system_score_gemma":0.0008175583,"threshold_uncertainty_score":0.107747376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019491097,0.0019831124,0.9730709,0.0013859356,0.00012745355,0.000022431117,0.00018417045,0.00036361362,0.0033711577],"genre_scores_gemma":[0.87748516,0.0037521,0.10903896,0.00037917926,0.0002775614,0.00010970644,0.00046502097,0.00013252698,0.00835984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954945,0.00021751257,0.000019381803,0.00009348883,0.00008115791,0.00003891052],"domain_scores_gemma":[0.9980136,0.001514377,0.00017755137,0.00008542504,0.00015984479,0.000049168724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011490958,0.00061900006,0.00076685345,0.0009594452,0.00027786137,0.001057627,0.0009805257,0.0012757599,0.002191956],"category_scores_gemma":[0.0049102916,0.0003555613,0.00079329655,0.0013250187,0.00061958766,0.00088990276,0.0007439435,0.0014445646,0.0005147321],"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.00001817299,0.00003062631,0.0011005775,0.00006331036,0.000050070015,0.00007764164,0.000054733842,0.86583734,0.00051603845,0.1039556,0.0017247504,0.026571084],"study_design_scores_gemma":[0.0000010164971,0.0000029413234,0.00011015372,0.0000047948583,0.0000025574454,0.0000066215885,0.000004415803,0.9753303,0.00003966714,0.024086509,0.0004079466,0.0000031054922],"about_ca_topic_score_codex":0.008118555,"about_ca_topic_score_gemma":0.0046805404,"teacher_disagreement_score":0.008118555,"about_ca_system_score_codex":0.000761389,"about_ca_system_score_gemma":0.00050750206,"threshold_uncertainty_score":0.016142607},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05152875,0.0020200233,0.93733287,0.0013025806,0.00008545702,0.000082302264,0.00014438164,0.00032313363,0.0071805483],"genre_scores_gemma":[0.79273826,0.0046253745,0.19734357,0.0003184037,0.0004447284,0.0002362908,0.0002722597,0.00026090932,0.0037602307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976427,0.0016999092,0.00007578178,0.00018025734,0.00031700628,0.000084239044],"domain_scores_gemma":[0.966859,0.030510385,0.0009295446,0.0007892314,0.00064226106,0.0002695634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005410874,0.0015075231,0.00097426894,0.0028709045,0.00092866534,0.0016372155,0.0011797549,0.0016793286,0.001444381],"category_scores_gemma":[0.037439674,0.0005615475,0.0010643394,0.0015807947,0.002199998,0.004964268,0.0014436095,0.0018609256,0.0004434735],"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.000034737568,0.00004716939,0.0014375458,0.00008429866,0.000059479917,0.000076923716,0.00012441496,0.85453165,0.0007619905,0.13001192,0.00056750537,0.0122623835],"study_design_scores_gemma":[0.0000031286154,0.000010919701,0.00008345111,0.000011106756,0.000006476425,0.00001138918,0.000007641392,0.97016555,0.000082117374,0.029401839,0.00021048225,0.000005906972],"about_ca_topic_score_codex":0.008532935,"about_ca_topic_score_gemma":0.0048687733,"teacher_disagreement_score":0.008532935,"about_ca_system_score_codex":0.0010752559,"about_ca_system_score_gemma":0.0007021275,"threshold_uncertainty_score":0.028615832},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5730585,0.0016040222,0.4058259,0.002210648,0.00047361729,0.00031605002,0.0050847735,0.0029819224,0.008444538],"genre_scores_gemma":[0.9002323,0.0001768779,0.09352978,0.00025715784,0.00007311133,0.00014728865,0.004097777,0.00022477178,0.0012609283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960574,0.0021749458,0.00013253743,0.00074723066,0.00067645445,0.00021150315],"domain_scores_gemma":[0.98238105,0.010663719,0.0012693194,0.002715452,0.0021613112,0.00080910046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004693516,0.0008032439,0.00090781087,0.0021755323,0.0009649889,0.0014509762,0.002163845,0.002152528,0.001533455],"category_scores_gemma":[0.022834156,0.00027898475,0.0008141646,0.00186568,0.001344138,0.0018517306,0.0015689901,0.0015479089,0.00040824388],"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.00078276644,0.00045001408,0.01111952,0.00044431933,0.0002017632,0.00028229,0.00015811344,0.890698,0.0046249838,0.03217791,0.013408488,0.045651853],"study_design_scores_gemma":[0.000033174445,0.00007306662,0.000855781,0.000013151924,0.00000859609,0.000074055984,0.000024472945,0.9834742,0.0014098957,0.012643999,0.0013779155,0.000011650535],"about_ca_topic_score_codex":0.005930316,"about_ca_topic_score_gemma":0.0050829826,"teacher_disagreement_score":0.005930316,"about_ca_system_score_codex":0.0014465641,"about_ca_system_score_gemma":0.00079985603,"threshold_uncertainty_score":0.024821997},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13300669,0.0006839217,0.8610336,0.0006746625,0.000035937876,0.00014652275,0.00037217315,0.00042932812,0.0036171277],"genre_scores_gemma":[0.7643756,0.0005967716,0.22839874,0.00023672733,0.00004533018,0.0002042039,0.00074602634,0.00011337296,0.0052833157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991418,0.00026534687,0.000038818536,0.00027255097,0.00015150214,0.0001299816],"domain_scores_gemma":[0.996567,0.0020309286,0.00043022895,0.00038251345,0.00030366814,0.0002857218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013308687,0.0006673065,0.0009854621,0.0014330032,0.0013029472,0.00160327,0.0017016489,0.001637185,0.0023401491],"category_scores_gemma":[0.007960055,0.0006609392,0.0010714373,0.0015744428,0.0011112489,0.004088699,0.0024452645,0.001415159,0.00035515308],"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.00019233952,0.00009220713,0.0025842316,0.00018775393,0.000079099584,0.00019875867,0.00032506287,0.82882464,0.0024618716,0.114613466,0.0035478738,0.046892628],"study_design_scores_gemma":[0.00001538003,0.00001891352,0.00017988583,0.00001245754,0.000009792154,0.000044978275,0.00005512062,0.9421188,0.00041637296,0.05626442,0.00085648906,0.0000074352893],"about_ca_topic_score_codex":0.00901135,"about_ca_topic_score_gemma":0.012435439,"teacher_disagreement_score":0.00901135,"about_ca_system_score_codex":0.0021171074,"about_ca_system_score_gemma":0.0011152995,"threshold_uncertainty_score":0.017917812},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4335487,0.004664838,0.39197725,0.003822468,0.00013277282,0.00021772934,0.002143832,0.00056252826,0.16292989],"genre_scores_gemma":[0.9146338,0.0013294325,0.061595634,0.00017796618,0.00014295595,0.00013363469,0.00092984317,0.00012308598,0.020933608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952126,0.00015510235,0.0000153934,0.00013319304,0.00010623421,0.000068846864],"domain_scores_gemma":[0.9956254,0.0026467098,0.000344706,0.00031819043,0.0005929497,0.0004720482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007531762,0.00020224375,0.00046185454,0.002224026,0.0015577518,0.002832651,0.0011861654,0.0010607474,0.009956784],"category_scores_gemma":[0.00810193,0.00041844134,0.00033396005,0.0022973183,0.0017967419,0.0044785095,0.0013396714,0.0009895622,0.0012698972],"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.00008729232,0.00003260327,0.0036262462,0.00015717324,0.000027813165,0.00009766035,0.0010424075,0.0116200615,0.002316849,0.9394101,0.006992559,0.034589227],"study_design_scores_gemma":[0.000014724979,0.000015835594,0.0027196596,0.00004441274,0.000015073093,0.00020254217,0.00049984496,0.04193987,0.0005689758,0.9457621,0.008206284,0.000010845255],"about_ca_topic_score_codex":0.0013880975,"about_ca_topic_score_gemma":0.0023223348,"teacher_disagreement_score":0.009956784,"about_ca_system_score_codex":0.000954599,"about_ca_system_score_gemma":0.00060348416,"threshold_uncertainty_score":0.033308744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011085856,0.00078051345,0.98500085,0.00030688342,0.0001367658,0.00008781245,0.00033230684,0.0008891682,0.0013798847],"genre_scores_gemma":[0.098920114,0.000613771,0.89393526,0.000112525,0.0002017263,0.0001571037,0.0011281044,0.00027341844,0.0046580373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917287,0.00022842408,0.000043137672,0.0002901234,0.00019473169,0.00007070426],"domain_scores_gemma":[0.9976417,0.0013694782,0.00021612404,0.00030282605,0.00034495772,0.0001249547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013754946,0.001000543,0.0013623545,0.0025778175,0.0007456043,0.0013382866,0.0021992894,0.0017629603,0.0037681463],"category_scores_gemma":[0.008884617,0.00068454636,0.001254472,0.003454907,0.0007411802,0.0025719004,0.001801088,0.0015156918,0.0022217701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041706147,0.00025946813,0.002872334,0.00084656675,0.00025975655,0.00021822086,0.00026622633,0.10302855,0.016216915,0.044893257,0.027001724,0.8037198],"study_design_scores_gemma":[0.000024547377,0.000055125984,0.00049718114,0.00004736832,0.000035237354,0.00018947526,0.000059478545,0.93079746,0.0039072903,0.060294233,0.0040659183,0.000026718906],"about_ca_topic_score_codex":0.0020085722,"about_ca_topic_score_gemma":0.0028439264,"teacher_disagreement_score":0.0037681463,"about_ca_system_score_codex":0.00037368818,"about_ca_system_score_gemma":0.000683645,"threshold_uncertainty_score":0.012605727},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05979976,0.00087557425,0.9343255,0.0007477315,0.000058946043,0.000055730598,0.000524205,0.0013625874,0.0022501089],"genre_scores_gemma":[0.82501143,0.00063425454,0.16934896,0.00034836197,0.00016936238,0.000084457104,0.0017414852,0.00021339554,0.0024483332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989108,0.00029022462,0.000030830397,0.00040531685,0.00026935653,0.00009348739],"domain_scores_gemma":[0.9966252,0.0019558112,0.00031689988,0.0005370083,0.00042828164,0.00013682751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014421173,0.0011966809,0.0009644222,0.0030957519,0.00063715206,0.0017644094,0.0023032539,0.0014883903,0.0015012209],"category_scores_gemma":[0.0061600176,0.0005525013,0.0010363178,0.0026517413,0.0008396307,0.0061612786,0.0024515442,0.0024044698,0.0006082139],"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.0002659042,0.00037461764,0.021965409,0.00035586857,0.00033567718,0.0005880646,0.0007876784,0.5736252,0.011971014,0.03469534,0.009853816,0.34518144],"study_design_scores_gemma":[0.0000050813405,0.0000277673,0.0007931508,0.000016293428,0.000028360904,0.000045736815,0.00005835769,0.9776945,0.0011969483,0.01919431,0.00093127484,0.000008224799],"about_ca_topic_score_codex":0.0068797786,"about_ca_topic_score_gemma":0.010091948,"teacher_disagreement_score":0.0068797786,"about_ca_system_score_codex":0.000879602,"about_ca_system_score_gemma":0.00066240254,"threshold_uncertainty_score":0.013679445},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33166963,0.012525351,0.58401525,0.0024098023,0.0006995518,0.0010956244,0.038507745,0.016720897,0.012356058],"genre_scores_gemma":[0.72135574,0.002112453,0.24061608,0.0006273567,0.00077260035,0.0008107485,0.02684624,0.0005587033,0.0063001784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986557,0.00032683442,0.00014355002,0.00043701756,0.0003153395,0.00012149157],"domain_scores_gemma":[0.9959324,0.0022912973,0.00053454086,0.0003733505,0.0006679767,0.00020056087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014956304,0.0011697125,0.0010561952,0.0054797344,0.00071341114,0.0014881826,0.0011616566,0.00091097347,0.0014750431],"category_scores_gemma":[0.008768981,0.00036028473,0.0006542865,0.0048580607,0.0003354803,0.0032525237,0.0011326909,0.00065699214,0.0024110153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021195596,0.0005666763,0.10154776,0.0021311084,0.0005231259,0.00079025986,0.0028396712,0.022133268,0.072951846,0.0062376563,0.054788854,0.7333702],"study_design_scores_gemma":[0.00024321376,0.0007261925,0.041935615,0.00022630571,0.00048551286,0.0014920831,0.0027389927,0.7754795,0.05950454,0.030917168,0.08603507,0.00021583824],"about_ca_topic_score_codex":0.003775695,"about_ca_topic_score_gemma":0.009045766,"teacher_disagreement_score":0.0054797344,"about_ca_system_score_codex":0.0005322202,"about_ca_system_score_gemma":0.00067372,"threshold_uncertainty_score":0.007909715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21503483,0.0070568365,0.6366654,0.021107046,0.00135229,0.00007752351,0.00027998397,0.0003239237,0.11810225],"genre_scores_gemma":[0.9579474,0.0015301931,0.027002355,0.0007308032,0.0007186947,0.000048901773,0.00008908398,0.00016814757,0.011764414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986117,0.0008286043,0.000021405873,0.00017322619,0.00026454605,0.00010050223],"domain_scores_gemma":[0.9715945,0.025304437,0.0009516945,0.0007813005,0.00080389495,0.000564068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004223219,0.0005636162,0.00065007387,0.00081061356,0.00082893495,0.0023521215,0.0013946919,0.001456373,0.003679732],"category_scores_gemma":[0.035177067,0.00025570052,0.0003144008,0.00087659626,0.0028035692,0.0047491374,0.0016402534,0.0026757051,0.00038152916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001409408,0.000050789036,0.00080478424,0.000089362075,0.000048543585,0.00007944086,0.00040874112,0.08564307,0.0006044358,0.8687594,0.007887574,0.035482954],"study_design_scores_gemma":[0.000012959818,0.000029410501,0.00033751526,0.000024863863,0.000016784035,0.0000374816,0.00013831863,0.22484867,0.0003173865,0.7712291,0.0029952356,0.000012225899],"about_ca_topic_score_codex":0.0011678404,"about_ca_topic_score_gemma":0.0016879356,"teacher_disagreement_score":0.004223219,"about_ca_system_score_codex":0.001097157,"about_ca_system_score_gemma":0.00046060173,"threshold_uncertainty_score":0.022334754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16872956,0.002729944,0.77164555,0.004703543,0.00029798519,0.00013557852,0.0008467923,0.00050663226,0.050404403],"genre_scores_gemma":[0.90538484,0.0020769683,0.0636098,0.0005824099,0.000564786,0.00025941996,0.0004907211,0.00026192577,0.02676911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921477,0.00041194045,0.000019464695,0.00013416211,0.00012902367,0.00009067324],"domain_scores_gemma":[0.99525756,0.0029442054,0.0005056236,0.000385215,0.00046007856,0.00044728618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017555208,0.0007663552,0.0013045818,0.0017373742,0.0009195129,0.0016222285,0.0025417407,0.0022033984,0.005270578],"category_scores_gemma":[0.009827763,0.00078913546,0.0011710426,0.0012954329,0.0021327417,0.0036950572,0.0014293765,0.0018387843,0.0007521621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044256205,0.000031930096,0.0006708703,0.00009890204,0.00003544851,0.00009449872,0.00014617472,0.10160138,0.0007519656,0.8850285,0.0049441005,0.0065519],"study_design_scores_gemma":[0.000015794743,0.000014054233,0.0003814088,0.000017983748,0.000017723874,0.00011583437,0.000023989092,0.43874255,0.00008653836,0.5591085,0.0014592812,0.000016312495],"about_ca_topic_score_codex":0.0054066433,"about_ca_topic_score_gemma":0.0038672707,"teacher_disagreement_score":0.0054066433,"about_ca_system_score_codex":0.0015791788,"about_ca_system_score_gemma":0.00087989,"threshold_uncertainty_score":0.017631829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041204087,0.003862957,0.94130564,0.0028302807,0.00047323937,0.00007244726,0.00065643596,0.0005242555,0.009070577],"genre_scores_gemma":[0.7513755,0.006362031,0.21185932,0.0011474678,0.0014543091,0.00047365943,0.0016396177,0.00076603895,0.024922067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988049,0.0005443466,0.000038931626,0.0002603746,0.00024599,0.00010537877],"domain_scores_gemma":[0.99264526,0.004995905,0.00081068376,0.0004980323,0.0006289903,0.00042117928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022336843,0.0009853627,0.0018327606,0.0019582205,0.0011623678,0.002134639,0.0033644647,0.0030315537,0.0033812115],"category_scores_gemma":[0.014298907,0.000881046,0.0013893183,0.002632529,0.0024139865,0.003949869,0.0028221083,0.0035367263,0.0007556828],"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.00009422146,0.00006169126,0.0019415589,0.00020561575,0.00006779052,0.00016981697,0.0002168028,0.43654278,0.0004464761,0.5116113,0.015283171,0.03335876],"study_design_scores_gemma":[0.000010218061,0.0000116622705,0.00019606331,0.000019442561,0.0000104680785,0.00004826318,0.000019677353,0.7859534,0.00007659264,0.21178778,0.0018500031,0.000016453356],"about_ca_topic_score_codex":0.013458137,"about_ca_topic_score_gemma":0.008181627,"teacher_disagreement_score":0.013458137,"about_ca_system_score_codex":0.0016773975,"about_ca_system_score_gemma":0.0011345645,"threshold_uncertainty_score":0.026759624},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013889344,0.0085993735,0.7528209,0.0032893466,0.0011727023,0.00020400345,0.0010675649,0.001132573,0.2178242],"genre_scores_gemma":[0.40049097,0.013302338,0.36676422,0.001184836,0.0025353925,0.00051808177,0.0043614297,0.0008241521,0.21001849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934214,0.00013896894,0.000030312023,0.0001817662,0.00027831973,0.000028599043],"domain_scores_gemma":[0.99863535,0.00062887336,0.00008847948,0.00030837406,0.00027842144,0.000060494775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007335707,0.00054021855,0.0005547358,0.0033800483,0.0006521421,0.0017097726,0.0009298499,0.00080486364,0.013059096],"category_scores_gemma":[0.0053643365,0.00029506176,0.0005363203,0.003954466,0.001115815,0.0037068091,0.0014208434,0.0011983373,0.0042755604],"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.000017122708,0.000031582207,0.000650631,0.00015687878,0.000042679407,0.00005141069,0.00015714412,0.010493059,0.0012525067,0.65033424,0.037521172,0.2992916],"study_design_scores_gemma":[0.0000044815442,0.00002884104,0.0013012638,0.000052100117,0.000023612352,0.00039344843,0.0001120245,0.057074603,0.0014445393,0.8248694,0.114676625,0.000019144547],"about_ca_topic_score_codex":0.0008890197,"about_ca_topic_score_gemma":0.0011060776,"teacher_disagreement_score":0.013059096,"about_ca_system_score_codex":0.001020916,"about_ca_system_score_gemma":0.0005870428,"threshold_uncertainty_score":0.043687046},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029997986,0.0001926482,0.966605,0.0002564568,0.000052435942,0.000076293996,0.000027128226,0.00065091415,0.0021411297],"genre_scores_gemma":[0.74823624,0.00010563278,0.24727836,0.00016000395,0.0000729811,0.00017433017,0.00014888884,0.00012892949,0.003694678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706835,0.00078631134,0.00012549548,0.000977262,0.00074175105,0.00030077022],"domain_scores_gemma":[0.98948425,0.004189805,0.001148179,0.0027353056,0.0019172095,0.0005251683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028364505,0.0008603697,0.002277272,0.0011826397,0.0012476993,0.00221264,0.0026867648,0.0015914433,0.003440549],"category_scores_gemma":[0.011722417,0.0006319104,0.0007852535,0.0009933558,0.0014041527,0.00309549,0.0039980747,0.001666008,0.0012482016],"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.00093829434,0.00032571403,0.0055272984,0.00043348758,0.00016522394,0.0005199984,0.00080719386,0.65967077,0.039239924,0.07169874,0.0058183824,0.21485502],"study_design_scores_gemma":[0.00006770457,0.0001272815,0.00055371464,0.000022309656,0.00003230342,0.00015634825,0.00013588942,0.96727407,0.006998945,0.022669977,0.0019369208,0.000024564692],"about_ca_topic_score_codex":0.0017396201,"about_ca_topic_score_gemma":0.0017709689,"teacher_disagreement_score":0.003440549,"about_ca_system_score_codex":0.001279182,"about_ca_system_score_gemma":0.001974478,"threshold_uncertainty_score":0.015000761},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14534286,0.0015837455,0.83931494,0.0008149854,0.00005536068,0.00007665595,0.0008933526,0.00032091362,0.011597144],"genre_scores_gemma":[0.940479,0.0012877772,0.05241895,0.00020586286,0.00015010116,0.00012714342,0.0009280936,0.00013699371,0.004266025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994149,0.00020456167,0.000025326919,0.00014357423,0.00014894588,0.00006266141],"domain_scores_gemma":[0.99841905,0.0007059074,0.00029748838,0.0002636795,0.00020792092,0.00010598518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008316058,0.0004508138,0.0005987952,0.002547401,0.00056832505,0.0011623251,0.0012606166,0.0008491044,0.0019106888],"category_scores_gemma":[0.0038808472,0.0003198738,0.00064284785,0.0012952689,0.0012894234,0.0019389209,0.0009915932,0.00071198447,0.00044565747],"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.00002036829,0.000015856504,0.002715816,0.000099625184,0.00004327923,0.00013309701,0.00022301814,0.391235,0.0021452918,0.58857685,0.001818858,0.012972953],"study_design_scores_gemma":[0.0000050447734,0.000013940268,0.0015769392,0.000017893788,0.000011457628,0.00014307395,0.000055521123,0.62768656,0.0004733311,0.3668377,0.0031610313,0.000017423208],"about_ca_topic_score_codex":0.0016883629,"about_ca_topic_score_gemma":0.0018896007,"teacher_disagreement_score":0.002547401,"about_ca_system_score_codex":0.0011840183,"about_ca_system_score_gemma":0.00037801234,"threshold_uncertainty_score":0.008590698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18620758,0.0036419441,0.7634757,0.0022187904,0.0002185898,0.00022737807,0.0005895992,0.0007443628,0.042676024],"genre_scores_gemma":[0.9261827,0.0016124737,0.059152085,0.00038752696,0.00020219194,0.0003055238,0.0002405581,0.00029572053,0.011621304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981034,0.00053008937,0.000109763714,0.0005436261,0.00042041074,0.00029270994],"domain_scores_gemma":[0.94543505,0.044640217,0.0026537448,0.00357919,0.0021694885,0.0015222863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00477059,0.00086805667,0.0009746603,0.0025833086,0.0013461155,0.0021223985,0.0028833256,0.0015709926,0.0114242025],"category_scores_gemma":[0.043386515,0.00055206596,0.0009343877,0.0019773515,0.0037109975,0.011029335,0.0017729965,0.0031795972,0.0011122057],"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.00014705108,0.00005225506,0.0014194433,0.00017621965,0.000048465623,0.00013045732,0.00030687326,0.05532695,0.002967515,0.92326736,0.0027643195,0.013393087],"study_design_scores_gemma":[0.000032512122,0.000051669707,0.0011148329,0.000060855327,0.000038507867,0.00022215035,0.00009361915,0.22363581,0.0028518117,0.76865,0.0031941808,0.000054106964],"about_ca_topic_score_codex":0.0019951018,"about_ca_topic_score_gemma":0.0016664516,"teacher_disagreement_score":0.0114242025,"about_ca_system_score_codex":0.003339515,"about_ca_system_score_gemma":0.0014070013,"threshold_uncertainty_score":0.038217783},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05662558,0.015661996,0.6559146,0.010929902,0.0011201497,0.00007776752,0.0009138891,0.00039058045,0.25836554],"genre_scores_gemma":[0.61681026,0.020960052,0.13145886,0.0017232625,0.00175085,0.00030175716,0.00082491216,0.00046274884,0.22570725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997806,0.00008881679,0.0000062430818,0.00004274721,0.00006458601,0.000017100214],"domain_scores_gemma":[0.9986564,0.0009937037,0.00009565683,0.00008894285,0.00010776424,0.00005747371],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.00043755668,0.0005224516,0.0004508385,0.0011461917,0.00055007683,0.0017238084,0.0005025496,0.00097301754,0.0069714664],"category_scores_gemma":[0.0037976222,0.0003305688,0.000298823,0.0014635378,0.00097175204,0.0028217537,0.0006770216,0.0011354915,0.0010537319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006306612,0.000005389693,0.00019082271,0.000050905543,0.000009564941,0.000035549794,0.00007785358,0.011577075,0.00030522884,0.9627858,0.008790176,0.016165305],"study_design_scores_gemma":[0.000002212935,0.0000031520133,0.0001884567,0.000022224302,0.0000035506662,0.000043367865,0.00002473434,0.026946895,0.000077901524,0.95887995,0.013802175,0.000005385323],"about_ca_topic_score_codex":0.001134693,"about_ca_topic_score_gemma":0.0021239775,"teacher_disagreement_score":0.9988538,"about_ca_system_score_codex":0.00088349986,"about_ca_system_score_gemma":0.0002923696,"threshold_uncertainty_score":0.023321927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09713811,0.0011385055,0.89434934,0.00054509344,0.000073939875,0.00023779087,0.00029437078,0.0018074596,0.00441536],"genre_scores_gemma":[0.45189267,0.00037562303,0.54534364,0.00029421726,0.000048696667,0.00029322342,0.00059712195,0.00037088452,0.00078392646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99511945,0.0020531118,0.00024139199,0.0010162808,0.0012817964,0.00028805333],"domain_scores_gemma":[0.97918326,0.014021269,0.0021299687,0.0028337452,0.0015185938,0.00031315873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008886155,0.0016782201,0.0019883825,0.0032802036,0.0014983745,0.0021763605,0.0023354336,0.0017963492,0.0017577694],"category_scores_gemma":[0.04119669,0.00080326997,0.0011630069,0.0027227367,0.0016687402,0.0038387945,0.0018293269,0.0015966273,0.0009430085],"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.00048419874,0.00030499406,0.013390204,0.00085068756,0.00072864897,0.00015348732,0.0005568888,0.61099756,0.009825703,0.044621915,0.007937485,0.31014818],"study_design_scores_gemma":[0.00006334257,0.0001432949,0.0017890636,0.00009056072,0.00007061928,0.00024802695,0.00015252994,0.91459835,0.007228078,0.072448045,0.003122382,0.00004576876],"about_ca_topic_score_codex":0.0017655746,"about_ca_topic_score_gemma":0.0032585473,"teacher_disagreement_score":0.008886155,"about_ca_system_score_codex":0.0017091264,"about_ca_system_score_gemma":0.0017723443,"threshold_uncertainty_score":0.046995044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011956159,0.0059174555,0.00063954736,0.032038186,0.9583949,0.000022690694,0.00014749882,0.000117190815,0.0026030038],"genre_scores_gemma":[0.00068749813,0.0042483956,0.00017199964,0.0062590498,0.9820942,0.000022380405,0.0000746417,0.000062820094,0.006378954],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976547,0.00028010775,0.00027539345,0.00052221783,0.0010207995,0.0002467368],"domain_scores_gemma":[0.990368,0.0036180678,0.00061025645,0.00033927782,0.0034668404,0.0015975178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029322975,0.0028954481,0.0029215685,0.0024135674,0.0016969936,0.00735072,0.003170554,0.008773642,0.042772677],"category_scores_gemma":[0.012350237,0.0009257274,0.00263149,0.0011173221,0.0016407875,0.0042657605,0.0014190543,0.011853623,0.016985023],"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.00005085153,0.000020125188,0.00006459392,0.00022985254,0.000027482907,0.00009852788,0.000007660896,0.000101659854,0.000104794206,0.00077797053,0.9910417,0.007474784],"study_design_scores_gemma":[0.00009391315,0.00006485884,0.00044119073,0.00036498116,0.00006190951,0.00033043214,0.00002657056,0.0010091923,0.00027697568,0.0032731353,0.9940316,0.00002533162],"about_ca_topic_score_codex":0.0007539148,"about_ca_topic_score_gemma":0.0015571045,"teacher_disagreement_score":0.042772677,"about_ca_system_score_codex":0.0020539449,"about_ca_system_score_gemma":0.0015769821,"threshold_uncertainty_score":0.14308888},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012830299,0.00010242457,0.9969409,0.00012865028,0.00003646819,0.000059722704,0.000041230105,0.00035143117,0.001056113],"genre_scores_gemma":[0.033714768,0.00024167821,0.96093917,0.00020007853,0.00007184249,0.00021742337,0.00033451262,0.00034602958,0.003934508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851245,0.00036883418,0.000091575435,0.00045353104,0.00045023666,0.00012344476],"domain_scores_gemma":[0.9983132,0.0005749509,0.00010782022,0.00042663002,0.00049279665,0.00008463834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024197246,0.0013103306,0.0018005369,0.0029581646,0.0014828128,0.0020888776,0.00355992,0.002670385,0.003886263],"category_scores_gemma":[0.007385047,0.000930355,0.0015920685,0.0033117034,0.0015950333,0.0027964609,0.0028333298,0.002325115,0.0026405714],"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.000083732484,0.00008838955,0.0006432547,0.00017644098,0.000091823946,0.00008914492,0.0002806244,0.62049073,0.0029553366,0.13664855,0.009952297,0.22849968],"study_design_scores_gemma":[0.000028048597,0.000018662542,0.00009216624,0.000014928569,0.000007842622,0.000036828384,0.00003115169,0.93082005,0.0007237527,0.059558798,0.008654865,0.000012889791],"about_ca_topic_score_codex":0.018856833,"about_ca_topic_score_gemma":0.020144956,"teacher_disagreement_score":0.018856833,"about_ca_system_score_codex":0.0023797783,"about_ca_system_score_gemma":0.003079656,"threshold_uncertainty_score":0.037494123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08984905,0.00039653934,0.9043405,0.00031446587,0.000076591845,0.00012312393,0.0012198568,0.0010462771,0.0026336259],"genre_scores_gemma":[0.7171707,0.00026946436,0.27546516,0.000093000584,0.0001553964,0.00013238612,0.0022611562,0.000121102144,0.0043316246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899083,0.00024917678,0.000042574276,0.00035212477,0.0002742396,0.00009104591],"domain_scores_gemma":[0.99587554,0.0023419817,0.00032500827,0.0006510156,0.00060772925,0.00019867244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014251379,0.00056373334,0.00092051964,0.0030186654,0.0008403763,0.0012491613,0.0012048326,0.0009471118,0.0016642],"category_scores_gemma":[0.009954551,0.00036236097,0.0006622085,0.0032395797,0.00033990448,0.0025088275,0.0011278167,0.0008571894,0.00070745795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007090419,0.0007391257,0.029173577,0.00041446052,0.0003539498,0.0004930936,0.00036456183,0.31403455,0.021162985,0.028142894,0.014205943,0.5902057],"study_design_scores_gemma":[0.000008312919,0.000023800663,0.0017429304,0.000009689634,0.000019681227,0.0000958236,0.00003926162,0.98244596,0.0013177946,0.013221274,0.0010684046,0.000007037926],"about_ca_topic_score_codex":0.0037823801,"about_ca_topic_score_gemma":0.0070344377,"teacher_disagreement_score":0.0037823801,"about_ca_system_score_codex":0.0005160927,"about_ca_system_score_gemma":0.0007583393,"threshold_uncertainty_score":0.007536888},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011415372,0.00019200146,0.9860926,0.00013121699,0.000049813614,0.00012444756,0.00013949831,0.0010262304,0.00082885084],"genre_scores_gemma":[0.13790932,0.00022634081,0.85691655,0.00015403812,0.00007412952,0.00029538042,0.0009997323,0.00016697876,0.003257431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888736,0.00022351478,0.000062167994,0.0002844585,0.00043739626,0.00010510913],"domain_scores_gemma":[0.9978902,0.0008503212,0.0002447043,0.00024842846,0.0006016962,0.00016472315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012866443,0.0009522367,0.0012531977,0.002804904,0.0011278389,0.0015448866,0.002216684,0.0016741611,0.0027386697],"category_scores_gemma":[0.006216515,0.00043777423,0.0008041622,0.002137362,0.00075663364,0.0027122805,0.0019746094,0.0012213308,0.0016082518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004314007,0.00021581608,0.0030847155,0.00026458837,0.00012585188,0.0003863103,0.00030665137,0.13420889,0.024247356,0.023242353,0.011797394,0.8016886],"study_design_scores_gemma":[0.00004472325,0.00005831359,0.00034831496,0.00001748537,0.000015130481,0.00021954872,0.00006484707,0.97949505,0.0045506805,0.011991727,0.0031740933,0.000020151081],"about_ca_topic_score_codex":0.0034653067,"about_ca_topic_score_gemma":0.0040910295,"teacher_disagreement_score":0.0034653067,"about_ca_system_score_codex":0.0008256508,"about_ca_system_score_gemma":0.0015822162,"threshold_uncertainty_score":0.00916183},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07020282,0.00091175333,0.92295104,0.00091375364,0.00009694346,0.000104298466,0.00057139486,0.0016254752,0.0026224446],"genre_scores_gemma":[0.81081885,0.0005289539,0.1808888,0.00055640645,0.00009619972,0.00021815783,0.0013552338,0.00021495347,0.005322385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967587,0.00007056474,0.000012099981,0.00012528092,0.0000663563,0.00004975291],"domain_scores_gemma":[0.9988753,0.0005728969,0.00015265375,0.00011104557,0.0001927732,0.00009527952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077348994,0.00077588734,0.00084386003,0.0010649181,0.00065187836,0.0008185878,0.0026765626,0.0015567131,0.0017413492],"category_scores_gemma":[0.004590779,0.00047479363,0.0007177927,0.0012914268,0.0008269819,0.0023091016,0.0014188861,0.0016122098,0.0003264554],"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.000116895724,0.000102367565,0.002078491,0.00010328267,0.000075904114,0.000096191565,0.0001163533,0.8881763,0.0023625153,0.022383334,0.0044137808,0.07997464],"study_design_scores_gemma":[0.0000029120347,0.000003958498,0.000050972605,0.0000018689439,0.0000022503598,0.000005469227,0.0000030972858,0.99555236,0.000110956,0.004149679,0.00011492815,0.0000015957912],"about_ca_topic_score_codex":0.031821813,"about_ca_topic_score_gemma":0.036446974,"teacher_disagreement_score":0.031821813,"about_ca_system_score_codex":0.0020594588,"about_ca_system_score_gemma":0.001368624,"threshold_uncertainty_score":0.06327319},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06590085,0.0007417335,0.9289244,0.00024637164,0.0001736116,0.00013633691,0.00047584594,0.0015844501,0.0018164287],"genre_scores_gemma":[0.65214133,0.0006181528,0.34146297,0.00014671499,0.0002684976,0.00020475758,0.0014819886,0.00014026744,0.0035353035],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993957,0.000111628724,0.00004083721,0.00016547875,0.00024167585,0.000044507728],"domain_scores_gemma":[0.99804866,0.000993992,0.00014031048,0.00019109652,0.0005320019,0.00009399935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008033021,0.0005331196,0.0010596793,0.003048451,0.00076189666,0.00095269305,0.0016242006,0.0010095389,0.0019492537],"category_scores_gemma":[0.0041780337,0.00028807644,0.00050690136,0.0021895887,0.00033223856,0.0019427903,0.0007044694,0.0008671857,0.00078898284],"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.00044090042,0.00058389344,0.009554516,0.00025642957,0.00022165374,0.00022106348,0.00012261175,0.28072265,0.007800738,0.011110388,0.009627208,0.67933804],"study_design_scores_gemma":[0.000010167937,0.000019648467,0.00043880017,0.000005887478,0.000018246847,0.000030098314,0.000011548017,0.9962799,0.00079538627,0.0020403406,0.00034208794,0.000007902065],"about_ca_topic_score_codex":0.00624054,"about_ca_topic_score_gemma":0.00649952,"teacher_disagreement_score":0.00624054,"about_ca_system_score_codex":0.00049572164,"about_ca_system_score_gemma":0.0008895429,"threshold_uncertainty_score":0.012408435},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011888364,0.0005680889,0.49313772,0.0008226496,0.00031791918,0.0010080236,0.07038941,0.40106648,0.02080131],"genre_scores_gemma":[0.099304885,0.0014264588,0.67176706,0.0009937881,0.0001949644,0.0034795182,0.15613833,0.033904564,0.032790396],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930084,0.00012416563,0.0000707005,0.00011816148,0.00032931962,0.000056935172],"domain_scores_gemma":[0.9983486,0.0009611338,0.00015184136,0.00022474924,0.00021451573,0.00009925205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012696155,0.0014390264,0.00076694886,0.0037138718,0.000636932,0.0015867142,0.0017031529,0.000556577,0.03066009],"category_scores_gemma":[0.004242256,0.00069818477,0.0013139916,0.002474037,0.00037929704,0.0028212897,0.002105018,0.0016181074,0.008260786],"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.0006067569,0.0003390417,0.00869101,0.0021232448,0.0004664815,0.0010997992,0.0016539505,0.020395853,0.019481031,0.032978483,0.49297202,0.41919225],"study_design_scores_gemma":[0.000331675,0.00021440673,0.009869682,0.0003701196,0.00013277352,0.0009987032,0.00044476255,0.23795605,0.02389024,0.060398,0.66510636,0.00028713729],"about_ca_topic_score_codex":0.0044446816,"about_ca_topic_score_gemma":0.008182966,"teacher_disagreement_score":0.03066009,"about_ca_system_score_codex":0.0006243548,"about_ca_system_score_gemma":0.0010648445,"threshold_uncertainty_score":0.10256821},"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":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28129506,0.0029848134,0.17317516,0.0017852955,0.0009861746,0.0008782015,0.4827807,0.005382628,0.050731916],"genre_scores_gemma":[0.62775224,0.001758741,0.14300139,0.00019226938,0.0006830144,0.0008740925,0.21051085,0.00048988144,0.014737467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998187,0.00040750788,0.0002078833,0.00041270207,0.00065043976,0.00013452017],"domain_scores_gemma":[0.99584854,0.001751835,0.00044497632,0.0008648727,0.00073333137,0.00035654948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009916697,0.0007677287,0.00075150724,0.013996216,0.0006887374,0.0026849434,0.0008843965,0.00087827834,0.00703261],"category_scores_gemma":[0.006726413,0.00032246168,0.0007621551,0.014533531,0.0002423645,0.0039659548,0.002022132,0.0009222961,0.0047001857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063009217,0.00067001226,0.29288733,0.002489077,0.0008165834,0.0005328138,0.0037522665,0.011252399,0.017794924,0.017868638,0.06653347,0.58477235],"study_design_scores_gemma":[0.000048341,0.00022962708,0.3622289,0.0007454065,0.00082823733,0.001315254,0.012768015,0.14180602,0.019666621,0.04651731,0.41362378,0.00022246056],"about_ca_topic_score_codex":0.010158408,"about_ca_topic_score_gemma":0.023268541,"teacher_disagreement_score":0.013996216,"about_ca_system_score_codex":0.0006152537,"about_ca_system_score_gemma":0.00074990187,"threshold_uncertainty_score":0.02352643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029460752,0.00055417995,0.967344,0.00050378114,0.00005970589,0.000050209117,0.00008253332,0.00022023603,0.0017245244],"genre_scores_gemma":[0.8772875,0.000479273,0.11500992,0.00026664624,0.00020125306,0.00020682746,0.00023524312,0.00012100886,0.0061924723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993038,0.00031603596,0.000029957271,0.00013648483,0.00011865394,0.00009514039],"domain_scores_gemma":[0.9941704,0.0046364744,0.00035347615,0.00016899088,0.00047010678,0.00020042076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020140326,0.0010009034,0.0020658937,0.0010667924,0.00059993804,0.001068522,0.0022689751,0.0017996457,0.0025135896],"category_scores_gemma":[0.0081629595,0.00075364,0.00075121474,0.0008663124,0.0012222689,0.0018668764,0.0014681806,0.0020589905,0.00033861282],"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.000071712486,0.000079605845,0.0008784826,0.00008119659,0.00006834212,0.0000461477,0.00006617959,0.95251566,0.00049682555,0.016356846,0.0012697537,0.028069226],"study_design_scores_gemma":[0.0000023010878,0.000004092918,0.000025326926,0.0000020431742,0.0000025833954,0.0000017700809,0.0000020894397,0.9971047,0.00003700789,0.0027753206,0.000041598574,0.0000012098562],"about_ca_topic_score_codex":0.010486712,"about_ca_topic_score_gemma":0.0108118225,"teacher_disagreement_score":0.010486712,"about_ca_system_score_codex":0.0016502748,"about_ca_system_score_gemma":0.0014752046,"threshold_uncertainty_score":0.020851374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857802,0.00022419875,0.0036966344,0.00047099983,0.000011557818,0.000019355186,0.00028773386,0.000025003152,0.009484472],"genre_scores_gemma":[0.99813277,0.000045434455,0.0009763158,0.00001755665,0.0000048026004,0.000012841643,0.00013286537,0.000008612219,0.00066881685],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99855226,0.00046053136,0.000053710668,0.00035073812,0.00036313097,0.00021958689],"domain_scores_gemma":[0.9859007,0.007331337,0.002932357,0.000970872,0.0017839494,0.001080801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026196002,0.00019778646,0.00032667394,0.0035647952,0.0015880194,0.0041101053,0.00080669107,0.00081469025,0.0042797],"category_scores_gemma":[0.024226269,0.00022577404,0.00025531466,0.002912404,0.0024767665,0.0071944585,0.0031974898,0.00075499894,0.00045511415],"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.00084926863,0.00018410424,0.66529137,0.0002316556,0.00015586535,0.00095705275,0.057154626,0.010841764,0.004548021,0.075226545,0.004954668,0.17960514],"study_design_scores_gemma":[0.000027528022,0.0002611303,0.81386554,0.00020490645,0.00010511589,0.00036199417,0.04994411,0.03812856,0.0015076591,0.070876546,0.024580827,0.00013607678],"about_ca_topic_score_codex":0.0138150165,"about_ca_topic_score_gemma":0.015588418,"teacher_disagreement_score":0.0138150165,"about_ca_system_score_codex":0.0024020553,"about_ca_system_score_gemma":0.00073985383,"threshold_uncertainty_score":0.027469218},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44332048,0.0019105951,0.53419423,0.00346822,0.0009922105,0.0009979084,0.0024582625,0.0014003182,0.011257796],"genre_scores_gemma":[0.96854603,0.00008627727,0.029286964,0.0003085612,0.00020224613,0.00034762514,0.0006166094,0.00019345853,0.00041216874],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.8415381,0.10177542,0.008258536,0.021346001,0.025209472,0.0018724024],"domain_scores_gemma":[0.17157778,0.7157265,0.026338933,0.06626151,0.017952586,0.002142683],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.14439763,0.000966095,0.0019345519,0.0038781806,0.0017688122,0.0050478275,0.0040188045,0.003424897,0.0036436075],"category_scores_gemma":[0.62524515,0.00056998886,0.002743644,0.0048426446,0.011505779,0.005577407,0.003669973,0.003416045,0.0009222825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005129197,0.00087511126,0.55655473,0.0018053493,0.008931457,0.0012527752,0.004296195,0.12648363,0.0073097195,0.10571409,0.012154339,0.16949332],"study_design_scores_gemma":[0.0009877972,0.0041481326,0.19355525,0.000645295,0.0023960257,0.0023072248,0.0023476083,0.51030034,0.019709641,0.24873441,0.014364866,0.00050337886],"about_ca_topic_score_codex":0.0024282963,"about_ca_topic_score_gemma":0.0009719807,"teacher_disagreement_score":0.8556024,"about_ca_system_score_codex":0.0015089745,"about_ca_system_score_gemma":0.0019597206,"threshold_uncertainty_score":0.7636568},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0497693,0.0004233318,0.93391484,0.0019126552,0.000067387155,0.00014199434,0.00015502544,0.000106184874,0.013509346],"genre_scores_gemma":[0.83419836,0.0010624651,0.15541282,0.00036889763,0.00021164524,0.00031986946,0.00013627793,0.00007778029,0.008211888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685115,0.0016612497,0.00008677557,0.0003963534,0.0006339063,0.00037058987],"domain_scores_gemma":[0.9901968,0.008037902,0.00064501475,0.00045991672,0.0003347799,0.00032564512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038529602,0.0015775649,0.0013286467,0.0011189459,0.0012680099,0.0030788789,0.0022418546,0.0024215851,0.0037926536],"category_scores_gemma":[0.014158255,0.0006714141,0.001222914,0.0010921531,0.002950128,0.0073077055,0.002155128,0.0036581117,0.00038816803],"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.0001346673,0.00011403022,0.0009170598,0.00015819861,0.00010789618,0.00029891494,0.00041242174,0.2874624,0.0033504225,0.6836737,0.0016711871,0.021699077],"study_design_scores_gemma":[0.00002406292,0.00009065814,0.00017789063,0.000022816563,0.000035710767,0.00008885956,0.00010378832,0.5010173,0.00082516606,0.4959572,0.0016289242,0.000027722308],"about_ca_topic_score_codex":0.0022713612,"about_ca_topic_score_gemma":0.002652372,"teacher_disagreement_score":0.0038529602,"about_ca_system_score_codex":0.0023750043,"about_ca_system_score_gemma":0.0017143005,"threshold_uncertainty_score":0.020376682},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050772324,0.00032292263,0.945852,0.0003013422,0.00003937125,0.00003776956,0.0007110625,0.00026488645,0.0016983348],"genre_scores_gemma":[0.7012492,0.0009930179,0.29021904,0.00007572684,0.00009248166,0.0002670786,0.0024131888,0.00020298667,0.0044872193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932444,0.00022939073,0.00004100753,0.00022313095,0.00013429858,0.000047760986],"domain_scores_gemma":[0.99611914,0.0022010317,0.0006488308,0.00042438434,0.00044329136,0.00016330328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010334271,0.0005640362,0.00029018076,0.0018130998,0.00044557292,0.0011065392,0.00066177215,0.0006251936,0.0024618194],"category_scores_gemma":[0.010593284,0.00032609393,0.000548272,0.0013836517,0.00093980425,0.0025066088,0.0012153926,0.0010878169,0.00032807936],"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.00011795875,0.000042187916,0.005474987,0.00017069769,0.000059323786,0.000261298,0.00078351586,0.5383063,0.0047471733,0.38033944,0.00249012,0.067206964],"study_design_scores_gemma":[0.00000418107,0.0000127972835,0.0006957524,0.00001711953,0.0000045280813,0.000050550272,0.00006165826,0.9075401,0.00061174145,0.08890013,0.0020913668,0.000010040431],"about_ca_topic_score_codex":0.0038697917,"about_ca_topic_score_gemma":0.0030674487,"teacher_disagreement_score":0.0038697917,"about_ca_system_score_codex":0.0011025895,"about_ca_system_score_gemma":0.0004731998,"threshold_uncertainty_score":0.008235633},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25400212,0.0009912839,0.7298762,0.0024098824,0.000104642284,0.00016852716,0.00064852723,0.00027357895,0.011525272],"genre_scores_gemma":[0.9310039,0.00062177615,0.06275809,0.00032295397,0.00010762068,0.00021309221,0.00029348815,0.00006790653,0.0046111834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875736,0.0007191141,0.000043134747,0.0002128791,0.00014604034,0.00012147219],"domain_scores_gemma":[0.99511445,0.0031907752,0.00059863995,0.0003952514,0.00035130192,0.0003496961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002588159,0.0007165352,0.00071941374,0.0013180835,0.000857763,0.0024218098,0.0016011244,0.0015542812,0.0019816293],"category_scores_gemma":[0.011774885,0.0006306394,0.00087659626,0.0010350074,0.0021848767,0.004112743,0.002482691,0.0016343077,0.00041207566],"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.00008003292,0.000048703416,0.004878761,0.00008619975,0.000058608923,0.00016421094,0.00046681656,0.6792929,0.00065970456,0.30606085,0.0014769784,0.0067261625],"study_design_scores_gemma":[0.000010008436,0.00001094756,0.0002693809,0.000012088366,0.000005669384,0.000027438222,0.00007443191,0.8975739,0.00007780234,0.101111144,0.00081823044,0.0000089547175],"about_ca_topic_score_codex":0.00620892,"about_ca_topic_score_gemma":0.005421986,"teacher_disagreement_score":0.00620892,"about_ca_system_score_codex":0.001443936,"about_ca_system_score_gemma":0.00064438133,"threshold_uncertainty_score":0.013687611},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35432985,0.025085853,0.5963959,0.003948565,0.00046912488,0.00011038575,0.00035937064,0.00050416845,0.018796742],"genre_scores_gemma":[0.94678766,0.0045327093,0.046336193,0.00015326121,0.00033706872,0.00004763762,0.00015093476,0.00007169206,0.0015829591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742585,0.0015735886,0.00007273733,0.0002995382,0.00048243048,0.00014589404],"domain_scores_gemma":[0.9588655,0.035442617,0.002316121,0.001237801,0.0015933716,0.00054447405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006121847,0.0013174816,0.0010672412,0.0033600274,0.0006699613,0.0021895699,0.0012919958,0.0015497841,0.001048715],"category_scores_gemma":[0.037606772,0.00033832988,0.00054120575,0.002092676,0.001844402,0.0044070138,0.00091354246,0.0012336611,0.00017219712],"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.00036097487,0.00019366913,0.016287662,0.0005599501,0.000540594,0.00015899527,0.00053730886,0.54416025,0.005612757,0.3059078,0.0042450186,0.12143505],"study_design_scores_gemma":[0.000043190423,0.00030489493,0.005295201,0.000106018706,0.000121267265,0.00012657692,0.0001960372,0.8561914,0.0015047998,0.1324173,0.0036159533,0.00007742409],"about_ca_topic_score_codex":0.0031709762,"about_ca_topic_score_gemma":0.0024672681,"teacher_disagreement_score":0.006121847,"about_ca_system_score_codex":0.0013543551,"about_ca_system_score_gemma":0.0006664679,"threshold_uncertainty_score":0.032375813},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19691366,0.0006126316,0.7966405,0.0005005893,0.00007137252,0.0002693015,0.0013758811,0.0014633543,0.002152629],"genre_scores_gemma":[0.71995115,0.0005201157,0.27245405,0.00010419987,0.00008359378,0.00019985905,0.003124795,0.00017742549,0.0033848642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988387,0.00026407625,0.000050418923,0.00036979382,0.00035329457,0.00012375825],"domain_scores_gemma":[0.99658173,0.0015794518,0.00042500903,0.0003748909,0.00080774125,0.00023126641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001914334,0.00067857804,0.0008273232,0.0045060306,0.00077726116,0.0015759981,0.0015620072,0.0007746982,0.0009622285],"category_scores_gemma":[0.007737599,0.00034707735,0.000605724,0.003541366,0.0005272492,0.0029536,0.0013131297,0.0008503319,0.0002985872],"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.0008933389,0.00045742586,0.026962327,0.00043361422,0.00028346758,0.00053048186,0.000579155,0.51977843,0.012761792,0.040299613,0.011250884,0.38576943],"study_design_scores_gemma":[0.000007706718,0.000015111516,0.0011594957,0.0000059779827,0.000008200341,0.00003920137,0.000053468604,0.98806727,0.0012572117,0.00871086,0.0006696013,0.000005942315],"about_ca_topic_score_codex":0.007824346,"about_ca_topic_score_gemma":0.0079288855,"teacher_disagreement_score":0.007824346,"about_ca_system_score_codex":0.0013930287,"about_ca_system_score_gemma":0.0008107264,"threshold_uncertainty_score":0.015557647},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076868124,0.00075223326,0.911193,0.00066906476,0.00012349206,0.0002978199,0.0007755513,0.0052288193,0.004091815],"genre_scores_gemma":[0.5453911,0.00037897716,0.44718236,0.00031966853,0.00012218747,0.00031367998,0.0019694057,0.000575638,0.0037469948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988636,0.0002742554,0.00006680073,0.00033933917,0.00032080803,0.00013529346],"domain_scores_gemma":[0.99735117,0.0010541693,0.0003784678,0.00048358043,0.000550366,0.0001822967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026884007,0.001312524,0.0010289149,0.0054103015,0.0010062362,0.0017831392,0.0018961348,0.0011770468,0.001632932],"category_scores_gemma":[0.008244972,0.0005465197,0.0010028993,0.002328428,0.0010388145,0.0033962056,0.0021756026,0.0010862951,0.00073842576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006571785,0.00037767587,0.021999743,0.0005612115,0.00039574917,0.00032550102,0.0005426117,0.2069432,0.030697959,0.030240754,0.017328518,0.68992984],"study_design_scores_gemma":[0.00004098423,0.000060241477,0.0019691463,0.000027172986,0.000044316206,0.00016883221,0.00011456031,0.9646726,0.009604819,0.020303076,0.0029606528,0.00003356584],"about_ca_topic_score_codex":0.002557043,"about_ca_topic_score_gemma":0.003216374,"teacher_disagreement_score":0.0054103015,"about_ca_system_score_codex":0.0011408237,"about_ca_system_score_gemma":0.0015835123,"threshold_uncertainty_score":0.014217854},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021714608,0.0057176556,0.98466843,0.0038515378,0.0003849043,0.00012957324,0.00033918075,0.0006085698,0.0021287391],"genre_scores_gemma":[0.046010375,0.011025643,0.935965,0.0015737392,0.0014392202,0.00046913433,0.0008416231,0.0006081457,0.0020671997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942492,0.0030778744,0.0002775901,0.0011356712,0.0010731359,0.00018657287],"domain_scores_gemma":[0.9817426,0.011819306,0.0011711619,0.0025331439,0.0018989015,0.0008349611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060504177,0.002235195,0.0022834146,0.00944264,0.0019931488,0.005829914,0.0031329095,0.0032609114,0.002777962],"category_scores_gemma":[0.030514408,0.0014036862,0.0024985895,0.007755629,0.0052495003,0.012866187,0.006576319,0.0075596846,0.0017097164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000899052,0.00009993969,0.003404422,0.0012108266,0.00038563655,0.0002977213,0.0018233709,0.057736453,0.0020519225,0.70627874,0.01794929,0.20867176],"study_design_scores_gemma":[0.0000132326795,0.000025190438,0.0006117256,0.00020811328,0.000041889376,0.00015276435,0.00024892937,0.089090705,0.00045161165,0.8741829,0.034907445,0.00006552873],"about_ca_topic_score_codex":0.006370355,"about_ca_topic_score_gemma":0.006359917,"teacher_disagreement_score":0.00944264,"about_ca_system_score_codex":0.0033542407,"about_ca_system_score_gemma":0.0024491688,"threshold_uncertainty_score":0.031998098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025449738,0.0005271065,0.9552891,0.00028536856,0.00015777834,0.00016878334,0.00023854441,0.011412852,0.0064706947],"genre_scores_gemma":[0.19273245,0.0002515523,0.8007047,0.00026539766,0.00007175429,0.00045889805,0.00084457896,0.001100538,0.003570144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993579,0.0001218033,0.00003630458,0.0001467465,0.00023543043,0.00010186097],"domain_scores_gemma":[0.99874264,0.00047158136,0.00009546895,0.00030498276,0.00026978212,0.00011554146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070856314,0.0016848439,0.0012859072,0.00096302613,0.0009976081,0.0011311996,0.0032270397,0.0011155355,0.0044219056],"category_scores_gemma":[0.0031065189,0.0007793382,0.0013552946,0.0012334425,0.0008041583,0.0017307329,0.0017131461,0.0015913532,0.0021507004],"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.0003577938,0.0002623427,0.0025150192,0.000332643,0.00017764383,0.00024397507,0.00033907813,0.7028936,0.01568522,0.01890226,0.017830143,0.2404602],"study_design_scores_gemma":[0.000055750756,0.000044632772,0.00012861074,0.0000070723704,0.000017054532,0.000047849782,0.000021800062,0.98850715,0.0024561984,0.0059238034,0.0027798752,0.000010290512],"about_ca_topic_score_codex":0.008156194,"about_ca_topic_score_gemma":0.013260442,"teacher_disagreement_score":0.008156194,"about_ca_system_score_codex":0.0011429975,"about_ca_system_score_gemma":0.0018569132,"threshold_uncertainty_score":0.01621741},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074878596,0.00022981103,0.92152864,0.000276841,0.000032363685,0.000044562035,0.00014021913,0.00012939291,0.0027395827],"genre_scores_gemma":[0.7939104,0.00068831944,0.20017652,0.000114084,0.00010797085,0.00027510192,0.00036332905,0.00010610752,0.0042582233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996518,0.0001643468,0.000016185386,0.00006859748,0.0000700445,0.00002897357],"domain_scores_gemma":[0.99902725,0.0005204263,0.00016615259,0.00014310335,0.00008853456,0.00005457057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069136097,0.0004811365,0.0003941724,0.00081636925,0.00032227024,0.00075372116,0.00048234995,0.00036135982,0.0009588877],"category_scores_gemma":[0.0030150583,0.00024959754,0.00076738524,0.0003953454,0.00094040786,0.0011400328,0.0009769873,0.00074853067,0.00014488421],"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.000020869953,0.00002055053,0.0012046449,0.000057224235,0.00005211121,0.00010264991,0.00016137613,0.60868204,0.0043376675,0.36932585,0.0008185322,0.015216508],"study_design_scores_gemma":[0.0000031175969,0.0000062681547,0.00023572746,0.000004255085,0.0000039117185,0.000015656771,0.000011866644,0.9060215,0.00038820642,0.0927289,0.000574753,0.0000058864553],"about_ca_topic_score_codex":0.0020487313,"about_ca_topic_score_gemma":0.0017723241,"teacher_disagreement_score":0.0020487313,"about_ca_system_score_codex":0.0008700494,"about_ca_system_score_gemma":0.00048362356,"threshold_uncertainty_score":0.0063126683},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3720379,0.0002492462,0.6186897,0.00022064359,0.000023727394,0.00007970403,0.00010839242,0.00023728628,0.00835339],"genre_scores_gemma":[0.9932248,0.00010374426,0.0052195475,0.000008110712,0.0000061915716,0.000029687479,0.000034571116,0.000013282976,0.0013600327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967575,0.000080121456,0.000011842431,0.00006916393,0.000104127204,0.000059037415],"domain_scores_gemma":[0.99886143,0.00050376914,0.00025538407,0.000054484248,0.00025651546,0.00006842274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007124419,0.0008361982,0.0004094859,0.0017894146,0.0005611912,0.0006430384,0.0007885732,0.00061828305,0.0018384114],"category_scores_gemma":[0.0022077227,0.00025958038,0.00078556634,0.00067043264,0.0007432887,0.0012539685,0.00063246797,0.00061275956,0.000112013004],"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.000017366729,0.000013974642,0.0016776057,0.000021846148,0.0000146829725,0.00012929726,0.000044509943,0.9862955,0.0014604914,0.0062651983,0.000109843306,0.003949757],"study_design_scores_gemma":[7.7082746e-7,0.000007611336,0.0002480176,0.0000013251051,0.000004404267,0.000009872823,0.000009727781,0.9980533,0.00014765792,0.0014623065,0.000052568532,0.000002398812],"about_ca_topic_score_codex":0.01880415,"about_ca_topic_score_gemma":0.0075262547,"teacher_disagreement_score":0.01880415,"about_ca_system_score_codex":0.001564073,"about_ca_system_score_gemma":0.0007254854,"threshold_uncertainty_score":0.037389398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2708677,0.0011070016,0.635158,0.0022998147,0.00019706141,0.00014405047,0.00070008205,0.00052753673,0.088998795],"genre_scores_gemma":[0.9535117,0.00060483004,0.012826577,0.00016056455,0.00019623348,0.00016909224,0.00028036517,0.00013210854,0.03211853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907255,0.00037097817,0.000032170137,0.0001812338,0.00013716849,0.0002058446],"domain_scores_gemma":[0.9951363,0.0029761582,0.0005839454,0.00045764344,0.00029535283,0.0005506237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018096209,0.0007007178,0.0016894459,0.0010339268,0.0013077353,0.00427386,0.0030585872,0.0019530663,0.013853789],"category_scores_gemma":[0.008048036,0.0006874114,0.0016506425,0.0012449732,0.0031217975,0.0048600505,0.0016134306,0.0032820504,0.0010025826],"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.000053360858,0.000040868497,0.0003277242,0.000059299262,0.000033463555,0.0001169384,0.00017896804,0.04000966,0.0004992253,0.9535938,0.0019247301,0.0031619696],"study_design_scores_gemma":[0.000030888183,0.00003035269,0.00019754593,0.000017844754,0.000018342262,0.00006432979,0.00005888441,0.21466246,0.00010223714,0.78363955,0.0011593126,0.000018266483],"about_ca_topic_score_codex":0.0033743412,"about_ca_topic_score_gemma":0.0031049158,"teacher_disagreement_score":0.013853789,"about_ca_system_score_codex":0.0024835924,"about_ca_system_score_gemma":0.001032176,"threshold_uncertainty_score":0.046345532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038448986,0.00087394635,0.95771974,0.00020125567,0.000063468964,0.000093663555,0.00018982026,0.00066187413,0.001747205],"genre_scores_gemma":[0.46294615,0.0007099492,0.5289591,0.00011889689,0.0002140836,0.00016263804,0.0008251954,0.00035274174,0.0057111937],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983229,0.00059497135,0.0000667675,0.0004440209,0.00042043583,0.00015087124],"domain_scores_gemma":[0.990888,0.006069877,0.0007189271,0.00069052423,0.0012288127,0.0004039024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023563234,0.0009059358,0.0013737149,0.00446247,0.0009807821,0.0016068155,0.002384481,0.0015281484,0.0021263498],"category_scores_gemma":[0.012679494,0.00078780705,0.0011885364,0.0031621484,0.0011283541,0.0029941653,0.0020553048,0.00149348,0.0006422361],"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.0006401393,0.00034001333,0.010878419,0.0010251253,0.00051943085,0.00035467304,0.0007090279,0.28702444,0.026444942,0.077947006,0.013018037,0.58109885],"study_design_scores_gemma":[0.000019326546,0.00004636237,0.0015690404,0.00003493616,0.00004147862,0.00013184368,0.000045961144,0.952637,0.0024914104,0.041718367,0.0012455377,0.000018826993],"about_ca_topic_score_codex":0.002860353,"about_ca_topic_score_gemma":0.004068265,"teacher_disagreement_score":0.00446247,"about_ca_system_score_codex":0.0012189368,"about_ca_system_score_gemma":0.00063532987,"threshold_uncertainty_score":0.012461543},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17336778,0.00073066185,0.8174197,0.0007323847,0.00009386251,0.00010292522,0.0017724311,0.0035073427,0.0022729116],"genre_scores_gemma":[0.84502167,0.00044147042,0.14839196,0.00016223986,0.00009599696,0.000098083496,0.003210365,0.00029242111,0.0022857187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998728,0.00025312204,0.00004796831,0.0005508439,0.00028814466,0.0001319313],"domain_scores_gemma":[0.9934429,0.0035972786,0.00087359577,0.0010768205,0.00070559775,0.00030379088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011849462,0.00092166406,0.00088359165,0.0037829247,0.0007968955,0.0012950179,0.0016723736,0.0009722878,0.0012211523],"category_scores_gemma":[0.01159252,0.00061292603,0.0007877522,0.0029818167,0.0009925555,0.0033142224,0.0017139822,0.0015052826,0.0006032329],"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.00041393796,0.00030782502,0.052393615,0.00038305644,0.00032253572,0.0008647599,0.0011206914,0.48842174,0.01193931,0.031418648,0.01587228,0.39654166],"study_design_scores_gemma":[0.000009117748,0.000015381864,0.0031081764,0.000011271399,0.000013393493,0.00011138537,0.00012832329,0.96617836,0.0013289131,0.027679205,0.0014061242,0.000010308986],"about_ca_topic_score_codex":0.009218041,"about_ca_topic_score_gemma":0.011612266,"teacher_disagreement_score":0.009218041,"about_ca_system_score_codex":0.0009573414,"about_ca_system_score_gemma":0.0005557291,"threshold_uncertainty_score":0.018328786},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47811952,0.0019777066,0.49455288,0.0028722407,0.000587684,0.0004819909,0.0069031706,0.006568176,0.007936541],"genre_scores_gemma":[0.80335844,0.0002836524,0.1864355,0.0003435059,0.00010827319,0.00022012027,0.006782811,0.0003409491,0.0021267051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659854,0.0015395386,0.0001374848,0.00079709885,0.0006977049,0.00022958724],"domain_scores_gemma":[0.9842631,0.009078267,0.0011067264,0.0025794283,0.0021512462,0.00082128326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046109003,0.0010666598,0.0011191986,0.0026986916,0.0012021752,0.0014173595,0.0026940063,0.0024277258,0.0015748888],"category_scores_gemma":[0.022054266,0.00035206502,0.0010467496,0.00214401,0.0011382602,0.002144557,0.0019314261,0.0017627581,0.00056495547],"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.00076596066,0.0004738361,0.013989861,0.00042340445,0.00020290635,0.00034616538,0.00015034493,0.8737755,0.0031877267,0.017095294,0.016384054,0.07320498],"study_design_scores_gemma":[0.000026462334,0.000051875802,0.00057054544,0.00000867035,0.0000073107676,0.000051413717,0.000021660864,0.991295,0.0009567352,0.005934191,0.0010684024,0.000007812106],"about_ca_topic_score_codex":0.010848198,"about_ca_topic_score_gemma":0.010363524,"teacher_disagreement_score":0.010848198,"about_ca_system_score_codex":0.0017501385,"about_ca_system_score_gemma":0.0010859831,"threshold_uncertainty_score":0.024385035},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042503353,0.001646744,0.8825486,0.0008716378,0.00063870224,0.00020736973,0.02439854,0.042621464,0.0045636483],"genre_scores_gemma":[0.4014467,0.0013411096,0.47040024,0.001094822,0.0002434547,0.000605886,0.08437967,0.002439336,0.038048845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975663,0.00003938497,0.000010940451,0.0000916003,0.000057611865,0.00004388777],"domain_scores_gemma":[0.99961853,0.000090990856,0.000020865262,0.00010815916,0.00012754672,0.000033899232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000457465,0.0013216352,0.0009721664,0.000773375,0.0003496957,0.0007457162,0.0022441552,0.0011301425,0.0073281634],"category_scores_gemma":[0.0016409705,0.00063928094,0.000758215,0.0011797571,0.00027277158,0.0016194353,0.0010975908,0.0024156384,0.0048536686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005290149,0.00042730966,0.0033244542,0.0002614169,0.00029187603,0.00014819401,0.00006007513,0.35976958,0.007840289,0.009250573,0.13539782,0.48269933],"study_design_scores_gemma":[0.000019287052,0.000033728153,0.00018958967,0.000010400308,0.000012863615,0.000020004494,0.000005757482,0.98956513,0.0025279636,0.004135602,0.0034693694,0.00001040519],"about_ca_topic_score_codex":0.024855575,"about_ca_topic_score_gemma":0.046050876,"teacher_disagreement_score":0.024855575,"about_ca_system_score_codex":0.00081620476,"about_ca_system_score_gemma":0.0011773322,"threshold_uncertainty_score":0.049421787},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07977019,0.00030531088,0.91530585,0.00030326124,0.00009499736,0.00009195324,0.00058374973,0.0018565651,0.0016880827],"genre_scores_gemma":[0.742138,0.00032110646,0.24901865,0.00014182988,0.0001758136,0.00011642877,0.0014291671,0.0002792073,0.006379795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987639,0.00022414801,0.000053479194,0.0004657242,0.0003305233,0.00016228923],"domain_scores_gemma":[0.98911554,0.007972042,0.0005339255,0.0013127171,0.0007340579,0.00033174167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013958692,0.0008559769,0.001543872,0.0024687804,0.0007177052,0.0016317359,0.0026564556,0.0011394188,0.0023490954],"category_scores_gemma":[0.010358821,0.0006358884,0.0008774695,0.0024922867,0.0011459138,0.0037397386,0.0026551988,0.0017989769,0.00050201005],"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.0006692259,0.00034247898,0.010845809,0.00036876925,0.00023798307,0.00048371905,0.0003990401,0.45775798,0.010047302,0.05853093,0.0077250926,0.45259172],"study_design_scores_gemma":[0.0000071866443,0.000019228497,0.0005730567,0.000005008357,0.000010869956,0.000049691283,0.00003076775,0.9630236,0.0009137047,0.03499991,0.00036079178,0.0000061831806],"about_ca_topic_score_codex":0.005474506,"about_ca_topic_score_gemma":0.006764143,"teacher_disagreement_score":0.005474506,"about_ca_system_score_codex":0.0009892983,"about_ca_system_score_gemma":0.00080571,"threshold_uncertainty_score":0.010885298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008059971,0.000085054344,0.9899995,0.00010605331,0.000042583844,0.00005836636,0.00003553317,0.00030270265,0.0013102227],"genre_scores_gemma":[0.16013543,0.00016239281,0.83590835,0.0001500641,0.000061395,0.00030584604,0.00019066113,0.00020280253,0.002883028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964285,0.00011887103,0.000016790453,0.00007037612,0.000113291426,0.00003777827],"domain_scores_gemma":[0.99872595,0.00079465593,0.00006703605,0.00010622816,0.00026079456,0.000045334215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010384728,0.00084867096,0.0010013564,0.0013204204,0.00061126426,0.00077265716,0.0016484611,0.0014931891,0.0030431296],"category_scores_gemma":[0.0043282253,0.000513378,0.0008562849,0.0013345649,0.0005795073,0.0010966335,0.0010874957,0.0015754806,0.0005309886],"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.000027623748,0.0000638477,0.00022430003,0.000029325345,0.000028378568,0.000036613008,0.000049719285,0.9060383,0.0014953194,0.007936411,0.0010147063,0.083055384],"study_design_scores_gemma":[0.000004075914,0.0000058559094,0.000018538036,0.0000023140246,0.0000029052314,0.0000046123214,0.0000026496946,0.9983699,0.0001947328,0.0012304981,0.00016239485,0.0000015732899],"about_ca_topic_score_codex":0.009951098,"about_ca_topic_score_gemma":0.009416605,"teacher_disagreement_score":0.009951098,"about_ca_system_score_codex":0.00096687255,"about_ca_system_score_gemma":0.0014939401,"threshold_uncertainty_score":0.019786298},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11685097,0.0013109654,0.8665391,0.0018096057,0.00015690844,0.0005024457,0.0011747691,0.00636895,0.005286373],"genre_scores_gemma":[0.5035326,0.00036269485,0.4884826,0.00043380747,0.00022547248,0.00061694736,0.0029597774,0.0005927173,0.0027933775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980355,0.00051882846,0.00013477069,0.00057002594,0.00048832747,0.0002525353],"domain_scores_gemma":[0.98945516,0.0065959957,0.0008831688,0.0017461121,0.00078849035,0.0005309803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003035521,0.0020674693,0.0018589629,0.0016938789,0.0013598455,0.0025787975,0.004604648,0.0023617528,0.0058925655],"category_scores_gemma":[0.021152267,0.0009096036,0.0011331324,0.0023693666,0.0013379947,0.0071494407,0.0031220466,0.0022267269,0.0019975756],"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.002034963,0.0006698428,0.008782535,0.000553917,0.00023555373,0.00022957042,0.000811806,0.51984584,0.0128079895,0.057534523,0.019720031,0.37677345],"study_design_scores_gemma":[0.0000792284,0.000067571185,0.00025522246,0.000016940585,0.000018546103,0.000041661493,0.000066157474,0.9568307,0.001181994,0.04066329,0.0007689577,0.000009798476],"about_ca_topic_score_codex":0.0044667134,"about_ca_topic_score_gemma":0.0068071703,"teacher_disagreement_score":0.0058925655,"about_ca_system_score_codex":0.0023321828,"about_ca_system_score_gemma":0.00207184,"threshold_uncertainty_score":0.019712627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1439756,0.0005136678,0.8102252,0.0013564376,0.00008687076,0.00014927979,0.0010448024,0.00051446666,0.0421337],"genre_scores_gemma":[0.94396096,0.00045067986,0.037985746,0.00019709211,0.000077794706,0.00021879241,0.00040845352,0.0000858259,0.01661467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938965,0.00017809214,0.000026620372,0.00018777658,0.0001244395,0.00009339956],"domain_scores_gemma":[0.99839693,0.00075145625,0.0002697088,0.00025922633,0.00017265166,0.00014999778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077801745,0.0003833382,0.0005832454,0.0010228495,0.0005744923,0.0015789864,0.0014498209,0.00091619446,0.00565054],"category_scores_gemma":[0.0032822858,0.00029515402,0.00078857696,0.0007834201,0.0017149502,0.0029683218,0.0010332252,0.0012613235,0.0006923467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026350264,0.000031108695,0.00075088267,0.000051098916,0.000026314605,0.00024260665,0.0002780062,0.06844955,0.0012718689,0.92161137,0.0015256925,0.005735248],"study_design_scores_gemma":[0.000019021574,0.00002849592,0.0003440954,0.000014645618,0.000019183892,0.0001766554,0.00007252972,0.42835602,0.00047466625,0.5651521,0.00532395,0.00001854479],"about_ca_topic_score_codex":0.0035260832,"about_ca_topic_score_gemma":0.0026035123,"teacher_disagreement_score":0.00565054,"about_ca_system_score_codex":0.0016916929,"about_ca_system_score_gemma":0.0006584081,"threshold_uncertainty_score":0.018902957},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1439756,0.0005136678,0.8102252,0.0013564376,0.00008687076,0.00014927979,0.0010448024,0.00051446666,0.0421337],"genre_scores_gemma":[0.94396096,0.00045067986,0.037985746,0.00019709211,0.000077794706,0.00021879241,0.00040845352,0.0000858259,0.01661467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938965,0.00017809214,0.000026620372,0.00018777658,0.0001244395,0.00009339956],"domain_scores_gemma":[0.99839693,0.00075145625,0.0002697088,0.00025922633,0.00017265166,0.00014999778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077801745,0.0003833382,0.0005832454,0.0010228495,0.0005744923,0.0015789864,0.0014498209,0.00091619446,0.00565054],"category_scores_gemma":[0.0032822858,0.00029515402,0.00078857696,0.0007834201,0.0017149502,0.0029683218,0.0010332252,0.0012613235,0.0006923467],"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.000026350264,0.000031108695,0.00075088267,0.000051098916,0.000026314605,0.00024260665,0.0002780062,0.06844955,0.0012718689,0.92161137,0.0015256925,0.005735248],"study_design_scores_gemma":[0.000019021574,0.00002849592,0.0003440954,0.000014645618,0.000019183892,0.0001766554,0.00007252972,0.42835602,0.00047466625,0.5651521,0.00532395,0.00001854479],"about_ca_topic_score_codex":0.0035260832,"about_ca_topic_score_gemma":0.0026035123,"teacher_disagreement_score":0.00565054,"about_ca_system_score_codex":0.0016916929,"about_ca_system_score_gemma":0.0006584081,"threshold_uncertainty_score":0.018902957},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059294427,0.9971192,0.0004959267,0.0011232244,0.0004978231,0.0000059860695,0.00007080268,0.000012991414,0.00061484316],"genre_scores_gemma":[0.00054514006,0.99731714,0.00059609645,0.000656709,0.0005496795,0.00001053995,0.000084435196,0.000004493466,0.0002358265],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995814,0.00011083524,0.00005755559,0.00009242596,0.0001332853,0.000024417539],"domain_scores_gemma":[0.9960264,0.0029057506,0.0002461369,0.00007740152,0.0005866809,0.00015761594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011873529,0.0010801175,0.0020407487,0.0044454793,0.00034869948,0.0018075737,0.0012043437,0.0015410401,0.005382392],"category_scores_gemma":[0.005347444,0.00031966466,0.00082735706,0.007774226,0.00083668163,0.0028553037,0.0009780728,0.002347468,0.0022105847],"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.00006601763,0.00006208304,0.00027013355,0.047315143,0.00027780453,0.00014056494,0.000087822555,0.00073092175,0.0006576995,0.01240544,0.12696467,0.8110217],"study_design_scores_gemma":[0.000018176273,0.000044654334,0.00066328514,0.011555147,0.0003588236,0.00037091746,0.00007602973,0.0002438136,0.00021343879,0.010739852,0.9756773,0.00003856249],"about_ca_topic_score_codex":0.002488251,"about_ca_topic_score_gemma":0.0036406745,"teacher_disagreement_score":0.005382392,"about_ca_system_score_codex":0.0010831218,"about_ca_system_score_gemma":0.0030289895,"threshold_uncertainty_score":0.018005908},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36243746,0.00084495824,0.63371366,0.0011000367,0.000030114725,0.00005794566,0.0002701863,0.00035602733,0.0011895538],"genre_scores_gemma":[0.93270063,0.00036309456,0.066089466,0.00006426534,0.000047090136,0.00004865319,0.00020635792,0.00003977647,0.00044048787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941576,0.00031746217,0.00002954416,0.00013475426,0.00005379855,0.00004860359],"domain_scores_gemma":[0.9865311,0.011691627,0.0008930018,0.0003897101,0.00024328641,0.0002512798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020056788,0.00043236703,0.00059320644,0.0015333899,0.0005361146,0.0008215107,0.0006402575,0.0010236654,0.00054349995],"category_scores_gemma":[0.017328337,0.0004812587,0.00064208306,0.00078526395,0.0013704762,0.0013473629,0.0011191788,0.0010620842,0.000085428415],"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.00017920135,0.00006995574,0.011855867,0.000094510666,0.000079749465,0.00031969638,0.00032812968,0.92290545,0.0036789668,0.034344427,0.00048031163,0.025663741],"study_design_scores_gemma":[0.0000044648104,0.000009933843,0.00095771434,0.0000066955104,0.000005175439,0.000030032215,0.00002423424,0.97810155,0.00026866831,0.020469079,0.00011478934,0.0000076124675],"about_ca_topic_score_codex":0.0034161815,"about_ca_topic_score_gemma":0.0034489871,"teacher_disagreement_score":0.0034161815,"about_ca_system_score_codex":0.00060028286,"about_ca_system_score_gemma":0.00038002583,"threshold_uncertainty_score":0.010607183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112900905,0.0010973009,0.8794275,0.00043284247,0.00006941719,0.00013894438,0.00018411248,0.001248425,0.0045006284],"genre_scores_gemma":[0.5086641,0.0002867541,0.48898935,0.00023352419,0.000048698497,0.00016219479,0.00038731968,0.00030379306,0.00092426914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964316,0.0016342096,0.00015426087,0.0006938909,0.0008475343,0.00023843882],"domain_scores_gemma":[0.9850404,0.010695744,0.0011695148,0.0017290864,0.0011054566,0.00025979892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059939628,0.0011206745,0.001449941,0.0022330743,0.0009774771,0.0017705947,0.001987304,0.0013986443,0.0018966331],"category_scores_gemma":[0.025686521,0.0005828347,0.000843291,0.0020337435,0.0013607376,0.0029581476,0.001543101,0.0013297176,0.0007382358],"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.000487137,0.00022645072,0.007682515,0.00044216856,0.0003189751,0.000110442874,0.00026778254,0.69310296,0.008655808,0.032403115,0.0063081766,0.24999441],"study_design_scores_gemma":[0.000028253937,0.00007807339,0.0007904348,0.000038418682,0.000027060632,0.00011270748,0.00005319362,0.9611907,0.004367446,0.032029755,0.0012649163,0.000019040312],"about_ca_topic_score_codex":0.0016144502,"about_ca_topic_score_gemma":0.0023849972,"teacher_disagreement_score":0.0059939628,"about_ca_system_score_codex":0.0015685174,"about_ca_system_score_gemma":0.0012929733,"threshold_uncertainty_score":0.03169948},"labels":[],"label_agreement":null},{"id":"W4383067313","doi":"10.1093/comnet/cnad024","title":"PageRank centrality with non-local random walk-based teleportation","year":2023,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Centrality; PageRank; Computer science; Katz centrality; Network science; Random walk; Measure (data warehouse); Theoretical computer science; Teleportation; Network theory; Flexibility (engineering); Node (physics); Complex network; Data mining; Quantum entanglement; Mathematics; World Wide Web; Physics; Quantum","score_opus":0.01279907006304856,"score_gpt":0.2633192313849608,"score_spread":0.25052016132191224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383067313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34964696,0.0011003579,0.63607275,0.0008339392,0.00022517488,0.00026931072,0.00063125964,0.0015132447,0.009707014],"genre_scores_gemma":[0.96054095,0.00012477959,0.037586518,0.000040922027,0.00006877066,0.00006986503,0.00020803334,0.00006784414,0.0012921791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99417794,0.002852499,0.00021062003,0.00095164985,0.0014706529,0.00033663659],"domain_scores_gemma":[0.9706777,0.019954417,0.0030284752,0.0032166638,0.002130956,0.0009918488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003251544,0.00091725576,0.0013219966,0.0036610465,0.0011614005,0.002741733,0.0013184337,0.0013372023,0.0034466216],"category_scores_gemma":[0.022975134,0.00030406372,0.00055622694,0.003595652,0.001717544,0.004359974,0.0017964552,0.0011599787,0.00062815804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075457885,0.00048687798,0.015089598,0.00048872654,0.00027246057,0.0005918582,0.00059812906,0.68179566,0.0099269375,0.16604248,0.0060833613,0.11786937],"study_design_scores_gemma":[0.00003976272,0.00016972523,0.0018835533,0.000020794543,0.000031186402,0.00028746063,0.00009131825,0.9445652,0.002613858,0.04910899,0.0011441429,0.00004406742],"about_ca_topic_score_codex":0.0025579785,"about_ca_topic_score_gemma":0.0031574876,"teacher_disagreement_score":0.0036610465,"about_ca_system_score_codex":0.0017333142,"about_ca_system_score_gemma":0.00077088835,"threshold_uncertainty_score":0.017196},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012028331,0.0005105475,0.9646077,0.0005622164,0.00020196868,0.00017524099,0.0053146165,0.014430673,0.0021686458],"genre_scores_gemma":[0.21688017,0.00097406836,0.7481113,0.0005415737,0.00019788454,0.0007926985,0.020530928,0.0023855232,0.009585823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952805,0.00014241681,0.000017941582,0.00018518002,0.000094337476,0.00003203876],"domain_scores_gemma":[0.99824727,0.0011227576,0.000084835425,0.0003438742,0.00011894588,0.000082274724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012607438,0.0015327234,0.0010639086,0.0020973843,0.00067723944,0.0016903622,0.0022337576,0.0016030975,0.008484999],"category_scores_gemma":[0.0073775207,0.0008888431,0.0011799093,0.001954287,0.00061789044,0.0031200515,0.002459144,0.002772993,0.0027072204],"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.00049644575,0.00032437764,0.002777411,0.0005334098,0.00046140878,0.00031581722,0.00016239955,0.5143293,0.0032678868,0.045159984,0.07417234,0.35799915],"study_design_scores_gemma":[0.000035076137,0.00001840232,0.000088703826,0.000011622677,0.000016525175,0.000025463953,0.000013528292,0.9748327,0.00052382745,0.02133379,0.0030940503,0.000006229566],"about_ca_topic_score_codex":0.0072292103,"about_ca_topic_score_gemma":0.014790596,"teacher_disagreement_score":0.008484999,"about_ca_system_score_codex":0.0009687459,"about_ca_system_score_gemma":0.0011649217,"threshold_uncertainty_score":0.028385103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10253911,0.0005374604,0.8923455,0.00035164398,0.00009754302,0.000093945426,0.000244241,0.0016094977,0.0021810608],"genre_scores_gemma":[0.91195124,0.00021225934,0.08399225,0.00024142774,0.000105747626,0.000103279264,0.0005822066,0.00010878358,0.0027027833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975127,0.00005266524,0.000013064997,0.00007907724,0.000059780472,0.00004405792],"domain_scores_gemma":[0.99839056,0.0008856555,0.00020181584,0.00012539687,0.00031172443,0.00008481937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007975263,0.0006633284,0.000691022,0.00071057316,0.00029928546,0.000535874,0.0016125775,0.00082317117,0.0010376449],"category_scores_gemma":[0.004064486,0.00031852262,0.00040927378,0.0005855221,0.0005097135,0.0016263067,0.00087299786,0.0011967933,0.00028506696],"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.0003408647,0.00032049778,0.009508878,0.00011291763,0.000091715374,0.00019413406,0.00010390047,0.7213888,0.0058715926,0.006441387,0.0051108575,0.25051445],"study_design_scores_gemma":[0.0000024043788,0.00000918271,0.00013182615,0.000001334209,0.0000016746288,0.0000067817296,0.0000022014933,0.99875546,0.00031148051,0.0007031515,0.00007309698,0.0000013753015],"about_ca_topic_score_codex":0.006042024,"about_ca_topic_score_gemma":0.00731073,"teacher_disagreement_score":0.006042024,"about_ca_system_score_codex":0.00085671415,"about_ca_system_score_gemma":0.0006515824,"threshold_uncertainty_score":0.012013733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004369765,0.0026593758,0.99228597,0.00040020116,0.00015731964,0.000027574548,0.0001913155,0.00073016173,0.0031110784],"genre_scores_gemma":[0.090225555,0.010188547,0.8538174,0.0006064277,0.0014330781,0.00077295315,0.0017658685,0.0020446472,0.039145634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980737,0.0010985066,0.00008644132,0.00027726986,0.00039749456,0.00006647703],"domain_scores_gemma":[0.99034834,0.00806293,0.00016476997,0.001020507,0.0003092963,0.00009409545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023345193,0.0015197397,0.0016442209,0.0023774314,0.0006724794,0.0021483002,0.0021659713,0.0018719363,0.012949367],"category_scores_gemma":[0.009664574,0.0015014125,0.0018673545,0.0032174597,0.0017932388,0.0030358008,0.0027497958,0.0033341171,0.00552412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024717796,0.00007405815,0.0006233655,0.0004935753,0.00019817043,0.00015040296,0.00032905117,0.09701372,0.0009370023,0.6190318,0.03860197,0.24252222],"study_design_scores_gemma":[0.000009996398,0.000006977173,0.0002025043,0.00004851092,0.000018899622,0.000068206355,0.000029558727,0.30358997,0.00022652799,0.6775592,0.018220976,0.000018854256],"about_ca_topic_score_codex":0.0048136204,"about_ca_topic_score_gemma":0.006526753,"teacher_disagreement_score":0.012949367,"about_ca_system_score_codex":0.0011783116,"about_ca_system_score_gemma":0.0007582732,"threshold_uncertainty_score":0.04332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038573353,0.0024570974,0.006054166,0.0036542348,0.0071279267,0.00015306954,0.0030325972,0.0011880801,0.975947],"genre_scores_gemma":[0.0013244083,0.0015504257,0.0018614559,0.0014284388,0.0010329766,0.00009652939,0.002201022,0.00035726794,0.99014753],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921453,0.000083555984,0.000027246959,0.00016125786,0.00042656143,0.00008682648],"domain_scores_gemma":[0.99881625,0.00017079232,0.000041461113,0.00017819717,0.0005410079,0.0002523579],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007967284,0.00095273176,0.0005752087,0.0017897196,0.0014211851,0.0045984252,0.0017177935,0.0017300327,0.6487907],"category_scores_gemma":[0.0031931933,0.00031665873,0.00057033636,0.0017022744,0.0005775388,0.0031596287,0.0028153707,0.0018074937,0.5543524],"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.000023279166,0.000029489374,0.00009360743,0.00014001323,0.0000022275917,0.000041611438,0.00009696305,0.000101466794,0.0002965775,0.03042437,0.8194753,0.1492751],"study_design_scores_gemma":[0.0000014555367,0.0000047657713,0.000052640095,0.000045962042,7.748092e-7,0.000024049144,0.000026450276,0.000018605213,0.000054000462,0.0032115,0.99655765,0.0000021041442],"about_ca_topic_score_codex":0.0021810264,"about_ca_topic_score_gemma":0.0031976402,"teacher_disagreement_score":0.35120928,"about_ca_system_score_codex":0.0012513353,"about_ca_system_score_gemma":0.002020097,"threshold_uncertainty_score":0.50095737},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008074895,0.0027046474,0.97948575,0.00082970806,0.00011833897,0.00009104768,0.0011556277,0.00085534604,0.0066846414],"genre_scores_gemma":[0.17492792,0.012382996,0.7790006,0.00029459244,0.00049114873,0.0005025654,0.007612155,0.00052189955,0.024266059],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994822,0.000118317344,0.00003611195,0.00017807704,0.00016664954,0.000018572217],"domain_scores_gemma":[0.99797684,0.0014203031,0.00012724572,0.00032513603,0.00012034291,0.000030100337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080635364,0.00097315933,0.00068502413,0.0020840296,0.00042184867,0.0021354253,0.0011624864,0.00070248096,0.004397058],"category_scores_gemma":[0.0058897897,0.0006766501,0.0009789752,0.002286826,0.0006133842,0.0037778586,0.0011040942,0.001193031,0.001982164],"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.00005932915,0.000099832345,0.0035754766,0.0007822457,0.00019937614,0.0002585597,0.00031493432,0.23101543,0.0036932707,0.1462022,0.026205068,0.58759433],"study_design_scores_gemma":[0.0000064263363,0.000023544073,0.0011071665,0.00012873049,0.00005052175,0.00022578904,0.000083891406,0.6214656,0.002810345,0.33099484,0.043081604,0.00002140358],"about_ca_topic_score_codex":0.0019047435,"about_ca_topic_score_gemma":0.0034307677,"teacher_disagreement_score":0.004397058,"about_ca_system_score_codex":0.00056319335,"about_ca_system_score_gemma":0.00054218393,"threshold_uncertainty_score":0.0147096515},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97130704,0.00048851117,0.009683255,0.0009057202,0.000031250565,0.00007477364,0.0028410174,0.000109358916,0.014559033],"genre_scores_gemma":[0.9933403,0.00025120832,0.0023082297,0.000026464613,0.000009438894,0.000033629254,0.0017044573,0.000009802082,0.002316284],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997805,0.000049988797,0.000007129197,0.000038393082,0.00005839658,0.00006557888],"domain_scores_gemma":[0.9991013,0.00029070384,0.00014700842,0.000056916262,0.00030855884,0.00009550187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005003144,0.00024848702,0.00016050572,0.002760976,0.00067403377,0.0005750917,0.0003527934,0.00028026736,0.0031067345],"category_scores_gemma":[0.0019106705,0.00009686864,0.0003596588,0.0031874597,0.00028353336,0.00081385154,0.00049803074,0.0002540423,0.00018474001],"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.00026338187,0.00012077749,0.43587184,0.0005543264,0.00019435263,0.0027865572,0.0032394717,0.32223517,0.004587794,0.10610886,0.027935266,0.09610215],"study_design_scores_gemma":[0.000013930874,0.000050692757,0.31045437,0.00007780992,0.00007745477,0.00036980578,0.0027106775,0.6528539,0.0010981663,0.013399855,0.018857023,0.000036291276],"about_ca_topic_score_codex":0.104723446,"about_ca_topic_score_gemma":0.07379019,"teacher_disagreement_score":0.104723446,"about_ca_system_score_codex":0.0022386122,"about_ca_system_score_gemma":0.0010596021,"threshold_uncertainty_score":0.20822781},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011424969,0.00020006156,0.980696,0.0005971253,0.00017196471,0.00020336891,0.00007047457,0.00046940212,0.0061665624],"genre_scores_gemma":[0.5556717,0.00041087557,0.42807433,0.00050628115,0.00028462146,0.0013436909,0.00023387754,0.00019594908,0.01327865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711084,0.001467821,0.00015735537,0.0003724593,0.00067885884,0.00021261693],"domain_scores_gemma":[0.99436015,0.004043886,0.00022517134,0.00069811236,0.0004030608,0.00026968017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040352116,0.000695902,0.0013673356,0.00092179276,0.0018478428,0.0020054174,0.0028642318,0.002030788,0.0044459263],"category_scores_gemma":[0.009726528,0.0005252215,0.00078188936,0.0017993777,0.0018478718,0.0031753413,0.0038789636,0.0018695117,0.00076872355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005804962,0.00029075355,0.00038271994,0.00022897284,0.00011665772,0.00020510027,0.0003520993,0.4117878,0.007861086,0.41512775,0.013358003,0.14970851],"study_design_scores_gemma":[0.000092413415,0.00006970158,0.00008136934,0.000014682822,0.000022185946,0.00006349482,0.000036571117,0.866407,0.0010278558,0.12785652,0.0043066535,0.000021446504],"about_ca_topic_score_codex":0.0012537434,"about_ca_topic_score_gemma":0.00155198,"teacher_disagreement_score":0.0044459263,"about_ca_system_score_codex":0.0014133608,"about_ca_system_score_gemma":0.002032269,"threshold_uncertainty_score":0.02134043},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01248828,0.00033379268,0.98192924,0.0005645072,0.00004262693,0.00008005281,0.0001691016,0.0006739943,0.0037183734],"genre_scores_gemma":[0.27533835,0.0005083808,0.71533763,0.00038555168,0.000118631055,0.00044232165,0.0008139567,0.0004804095,0.0065747127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987143,0.00045360046,0.000038848062,0.00040347292,0.00022324793,0.00016661476],"domain_scores_gemma":[0.99569786,0.0031447704,0.00035758785,0.00032497448,0.0003075617,0.00016726048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021666535,0.0017627454,0.0016089719,0.001715627,0.0012613775,0.0021296,0.0024726512,0.001943284,0.0039773122],"category_scores_gemma":[0.009469079,0.0012781809,0.0012046621,0.0024069531,0.0018595805,0.0032205335,0.0024320476,0.002519004,0.0009787588],"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.000049598966,0.00004422105,0.000372284,0.000089122375,0.00003685914,0.000033416083,0.00006836926,0.93858343,0.00047415515,0.027629407,0.0022130536,0.030406125],"study_design_scores_gemma":[0.000008620232,0.000007921685,0.000039411178,0.00000548343,0.0000035410708,0.000008604816,0.00001454529,0.97481877,0.00018743961,0.02437902,0.00052264513,0.0000039917504],"about_ca_topic_score_codex":0.010390496,"about_ca_topic_score_gemma":0.014611763,"teacher_disagreement_score":0.010390496,"about_ca_system_score_codex":0.0031313598,"about_ca_system_score_gemma":0.002387876,"threshold_uncertainty_score":0.02271974},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050967682,0.00045586246,0.94498223,0.00031360294,0.000044425742,0.000082034545,0.00008113845,0.0002715887,0.0028014183],"genre_scores_gemma":[0.8344788,0.00040864994,0.16123536,0.00011516189,0.0001075665,0.0001588069,0.00028324366,0.00012363588,0.0030888114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989692,0.00051339826,0.000041765084,0.00019866625,0.00018623834,0.00009066591],"domain_scores_gemma":[0.9969952,0.0020936262,0.0002744631,0.00021691268,0.00027805296,0.00014172238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012877004,0.001148303,0.0010463194,0.0014230818,0.0005497637,0.0012682738,0.0014122468,0.0011080476,0.0016581282],"category_scores_gemma":[0.0067185517,0.0004889549,0.0009725893,0.0011176021,0.001026658,0.0026905267,0.0012827531,0.0011016636,0.0003849781],"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.000135667,0.0001289718,0.0025439397,0.00016300827,0.00007648194,0.00014240685,0.00026010518,0.84638596,0.0033472287,0.03291051,0.0019055663,0.11200011],"study_design_scores_gemma":[0.0000033708313,0.000011580655,0.00008657226,0.0000044737203,0.00000472923,0.000009329265,0.000012210339,0.9947109,0.00030866484,0.00464464,0.00020022587,0.0000032266914],"about_ca_topic_score_codex":0.0036747118,"about_ca_topic_score_gemma":0.0040308773,"teacher_disagreement_score":0.0036747118,"about_ca_system_score_codex":0.0011308149,"about_ca_system_score_gemma":0.0006406863,"threshold_uncertainty_score":0.008204699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55909705,0.000639553,0.4306233,0.0014714061,0.00002994229,0.00005027975,0.00012214607,0.00021155628,0.007754827],"genre_scores_gemma":[0.9908765,0.00017440696,0.007603335,0.00006375268,0.000022013666,0.00003661976,0.000032338157,0.000012871992,0.0011782557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993685,0.0002872388,0.000024309906,0.00012292592,0.00009184828,0.0001052611],"domain_scores_gemma":[0.99380577,0.0032338353,0.0015889277,0.00034351178,0.0004264384,0.0006014752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011204659,0.00032429732,0.00052796456,0.001609885,0.00074599945,0.0014296385,0.0006801896,0.0010152236,0.0019333427],"category_scores_gemma":[0.0067270054,0.00032802712,0.0004479418,0.0006837076,0.0024640346,0.0023915854,0.0016155167,0.0006962824,0.0001783332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009610335,0.00005377205,0.005095301,0.00012820582,0.000066424895,0.00041641714,0.0008362969,0.21050414,0.0036752191,0.7690668,0.0014116287,0.008649538],"study_design_scores_gemma":[0.00002642331,0.00004091203,0.0017044235,0.000026344353,0.000014134991,0.000077844685,0.00019613856,0.67271775,0.00049922266,0.32395723,0.00072066864,0.000018880537],"about_ca_topic_score_codex":0.0024557821,"about_ca_topic_score_gemma":0.00151199,"teacher_disagreement_score":0.0024557821,"about_ca_system_score_codex":0.0011471332,"about_ca_system_score_gemma":0.0004136963,"threshold_uncertainty_score":0.008323073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8916983,0.00059888564,0.091266245,0.0021975848,0.00005477318,0.0001272336,0.00021112301,0.00014149926,0.013704382],"genre_scores_gemma":[0.99658823,0.00009537319,0.002652447,0.000032132768,0.000016774817,0.000022578452,0.000031388805,0.000006784111,0.0005543736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990626,0.0004556415,0.0000303886,0.00019832079,0.00012331351,0.00012983082],"domain_scores_gemma":[0.9788986,0.013862049,0.0033577029,0.00112836,0.0012612923,0.001491877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027537725,0.00029590802,0.0005469447,0.0020008904,0.0010721392,0.0020920488,0.0007919736,0.0009798631,0.004470947],"category_scores_gemma":[0.02248296,0.00032465707,0.00076990714,0.0010856951,0.0023800079,0.00361925,0.002048199,0.0009171889,0.00021636327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003438086,0.0002375919,0.12236985,0.00035498964,0.0002995011,0.00081240584,0.0034893735,0.26674348,0.0051073874,0.54768753,0.006461452,0.046092622],"study_design_scores_gemma":[0.000045847548,0.00012678039,0.029034525,0.00006954311,0.000094059964,0.00024908,0.0010951404,0.6835887,0.0011501395,0.28201008,0.0024824587,0.000053651387],"about_ca_topic_score_codex":0.004024286,"about_ca_topic_score_gemma":0.0033017038,"teacher_disagreement_score":0.004470947,"about_ca_system_score_codex":0.0014621357,"about_ca_system_score_gemma":0.0006682612,"threshold_uncertainty_score":0.014956772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97520965,0.00032011676,0.014524357,0.00051655655,0.00001614878,0.00009640262,0.000623477,0.00009880684,0.008594568],"genre_scores_gemma":[0.9929287,0.00012399492,0.005503653,0.00003392274,0.000011517397,0.00007848712,0.00029671084,0.00004207645,0.0009810512],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932853,0.0034711272,0.00033802819,0.0010415973,0.0014031423,0.00046083212],"domain_scores_gemma":[0.89286846,0.07542522,0.016000234,0.006715651,0.0065072197,0.0024832475],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0097127175,0.00041076337,0.00071190984,0.0066039683,0.0015425092,0.004794398,0.0009475008,0.00097327534,0.0038373254],"category_scores_gemma":[0.091936275,0.0004812461,0.00067583995,0.007466691,0.0031504103,0.009575965,0.0046084584,0.0016779988,0.0006216949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068089494,0.00028468203,0.70871156,0.00086000725,0.00047081566,0.0007428433,0.065904126,0.010936728,0.005464402,0.07234995,0.003254051,0.13033998],"study_design_scores_gemma":[0.00011055716,0.0005709573,0.7219089,0.00051233853,0.00042120315,0.0011798799,0.037760828,0.12548709,0.005688781,0.08282683,0.023154771,0.00037785043],"about_ca_topic_score_codex":0.012868882,"about_ca_topic_score_gemma":0.012023919,"teacher_disagreement_score":0.99339604,"about_ca_system_score_codex":0.0023201073,"about_ca_system_score_gemma":0.001502671,"threshold_uncertainty_score":0.05136633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027566159,0.0025841452,0.00011263334,0.020377852,0.9746406,0.000025660665,0.00005300069,0.000065537744,0.0021128764],"genre_scores_gemma":[0.00026193372,0.0022777712,0.00008563355,0.009787197,0.9779007,0.000024359051,0.000036510643,0.00004585509,0.009580003],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99415356,0.0006795509,0.00045606363,0.0007263521,0.0034823462,0.00050212565],"domain_scores_gemma":[0.98405415,0.0039703823,0.0011068538,0.00054717023,0.006228643,0.0040928745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068837125,0.0037495808,0.0041762446,0.0034126607,0.0037617092,0.012368991,0.0036201593,0.016071748,0.03150776],"category_scores_gemma":[0.016497048,0.0012206086,0.0027780002,0.0016612033,0.0028551326,0.0061479085,0.0023871663,0.020889228,0.026771773],"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.000031387837,0.000016260567,0.000024302082,0.00013915013,0.000011201599,0.00008192314,0.000008365824,0.000022618444,0.00006013057,0.00034726178,0.9950647,0.0041926913],"study_design_scores_gemma":[0.00004897281,0.000025627258,0.00022828412,0.00024917407,0.000027198737,0.00014925863,0.000032549986,0.00015972587,0.000105378414,0.0010500129,0.9979086,0.000015178653],"about_ca_topic_score_codex":0.0011840223,"about_ca_topic_score_gemma":0.004113471,"teacher_disagreement_score":0.03150776,"about_ca_system_score_codex":0.0030747994,"about_ca_system_score_gemma":0.0034410376,"threshold_uncertainty_score":0.10540396},"labels":[],"label_agreement":null},{"id":"W4385687128","doi":"10.1093/comnet/cnad028","title":"Hypergraph Artificial Benchmark for Community Detection (h–ABCD)","year":2023,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Hypergraph; Benchmark (surveying); Computer science; Community structure; Graph; Ground truth; Random graph; Algorithm; Theoretical computer science; Artificial intelligence; Discrete mathematics; Mathematics; Combinatorics; Cartography","score_opus":0.04547895218473307,"score_gpt":0.3071416032323553,"score_spread":0.2616626510476222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385687128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33109185,0.0027732342,0.6318345,0.0056373277,0.0011675295,0.00042830594,0.005602672,0.0031458205,0.01831868],"genre_scores_gemma":[0.8148412,0.00037420966,0.17497163,0.0010675035,0.00021248484,0.00025502144,0.004698413,0.0003145148,0.0032650076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965289,0.0020631007,0.00009551952,0.00065378414,0.0005193223,0.00013930122],"domain_scores_gemma":[0.9834743,0.01067204,0.00084009446,0.0021397108,0.0021067848,0.0007670609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042795492,0.000663752,0.0007502793,0.0019277353,0.0010165141,0.0017135319,0.0019468802,0.0020693778,0.0021604162],"category_scores_gemma":[0.01723284,0.00030652466,0.0008387927,0.001479494,0.0014905497,0.0017166891,0.001728287,0.0017172457,0.00043101888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061417883,0.00033507755,0.008604618,0.0004681833,0.00026529562,0.00028362314,0.00018872043,0.8102675,0.0046028723,0.075536825,0.031235835,0.067597315],"study_design_scores_gemma":[0.000044364995,0.000057183068,0.0006325147,0.000013120647,0.000010223147,0.00006960377,0.000021420186,0.9725425,0.0013978257,0.022417374,0.002779476,0.0000144782325],"about_ca_topic_score_codex":0.006495038,"about_ca_topic_score_gemma":0.005388908,"teacher_disagreement_score":0.006495038,"about_ca_system_score_codex":0.0018688544,"about_ca_system_score_gemma":0.0009482467,"threshold_uncertainty_score":0.022632718},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47857702,0.0022613027,0.46948588,0.006863351,0.00043773494,0.00034037814,0.006824487,0.000989735,0.034220003],"genre_scores_gemma":[0.96174145,0.0012270928,0.015210522,0.00017458752,0.00023551374,0.00027542593,0.0019584657,0.000066828165,0.019110186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989843,0.0005186392,0.000034781402,0.00018521842,0.000110521476,0.00016659813],"domain_scores_gemma":[0.9981951,0.00093357,0.00039591204,0.00012357322,0.00021389649,0.0001378985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013260879,0.0010401793,0.0011912555,0.0019163971,0.0006911623,0.0020222592,0.0017422844,0.0017995491,0.008463583],"category_scores_gemma":[0.003736533,0.00040641383,0.0016178663,0.0025574665,0.0014222986,0.0020009857,0.0015309724,0.0011507915,0.0011799656],"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.000085548265,0.00008682785,0.01650635,0.00006864483,0.0001772821,0.000429456,0.0002544166,0.8322774,0.0002808732,0.13462605,0.0040327366,0.011174428],"study_design_scores_gemma":[0.000017488173,0.000021210066,0.0021175507,0.000009764463,0.000022145756,0.000029823317,0.000056682427,0.9712054,0.000021835649,0.024744103,0.0017392777,0.000014787412],"about_ca_topic_score_codex":0.03303681,"about_ca_topic_score_gemma":0.013229519,"teacher_disagreement_score":0.03303681,"about_ca_system_score_codex":0.0014176226,"about_ca_system_score_gemma":0.0011504013,"threshold_uncertainty_score":0.06568903},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2526271,0.0011161631,0.7257159,0.00268219,0.00027687586,0.0004116497,0.004642661,0.00079523464,0.011732213],"genre_scores_gemma":[0.96025103,0.0009112318,0.021946225,0.00017098809,0.00013425616,0.00052752206,0.001682249,0.000054342152,0.01432218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911827,0.00022743584,0.0000532288,0.00030288173,0.00014615525,0.00015200379],"domain_scores_gemma":[0.9968188,0.0020924835,0.00043857467,0.0001563622,0.00036761755,0.00012605198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015200394,0.00082039286,0.0011684907,0.0010669103,0.00071558566,0.001473313,0.0019576615,0.0014495903,0.005048175],"category_scores_gemma":[0.004884073,0.00048204223,0.0008915331,0.0012587539,0.0010196961,0.0020432256,0.00091782754,0.0017167553,0.0009089156],"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.00029471563,0.00016734916,0.012498459,0.00018998298,0.00011176748,0.00084533927,0.0005044866,0.82683635,0.0021602083,0.1370853,0.0035865554,0.0157195],"study_design_scores_gemma":[0.00001196569,0.000017023436,0.00077319436,0.000007723612,0.000016712844,0.00003649999,0.000023692744,0.9905628,0.00013403488,0.007847482,0.00055766513,0.000011220387],"about_ca_topic_score_codex":0.023437962,"about_ca_topic_score_gemma":0.013770489,"teacher_disagreement_score":0.023437962,"about_ca_system_score_codex":0.0018160051,"about_ca_system_score_gemma":0.0014627806,"threshold_uncertainty_score":0.046603084},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009423119,0.00011350982,0.98850787,0.00016038393,0.000026314829,0.000037079786,0.00003936867,0.00077026803,0.0009220752],"genre_scores_gemma":[0.49698448,0.00038133038,0.49756047,0.0002690245,0.00013122654,0.00029832916,0.00052775117,0.00068254373,0.003164705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885285,0.00032068227,0.0000527953,0.00025916297,0.0004084059,0.00010608665],"domain_scores_gemma":[0.9944252,0.0034166088,0.00041944007,0.0006819689,0.00083018607,0.00022667687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018700092,0.0010926974,0.0011613789,0.0015619135,0.000841764,0.001355565,0.0018625719,0.00088852725,0.0025329504],"category_scores_gemma":[0.013583268,0.00053248025,0.0010269788,0.0014778305,0.0010484557,0.0027600545,0.0026240803,0.00183572,0.0010961446],"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.000045848596,0.00007292816,0.0010009805,0.0001358721,0.000058580703,0.00013363606,0.00012089325,0.8658429,0.003602583,0.059066888,0.002855279,0.0670637],"study_design_scores_gemma":[0.0000021847757,0.0000081822545,0.000051508046,0.0000019081301,0.000002135399,0.000010528259,0.0000063905486,0.981187,0.0002869843,0.018212456,0.00022745236,0.0000033615886],"about_ca_topic_score_codex":0.004093787,"about_ca_topic_score_gemma":0.0050393017,"teacher_disagreement_score":0.004093787,"about_ca_system_score_codex":0.0015772856,"about_ca_system_score_gemma":0.00148746,"threshold_uncertainty_score":0.011444092},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013393028,0.00063575077,0.9136911,0.0016742162,0.00017215543,0.000052244563,0.00028803706,0.00019443635,0.06989909],"genre_scores_gemma":[0.70875883,0.0021735204,0.13087022,0.0013089174,0.00079151115,0.000484839,0.0010149262,0.00038635204,0.15421088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861944,0.00058593904,0.000040128747,0.0003294543,0.00026986774,0.00015516956],"domain_scores_gemma":[0.9951931,0.002752659,0.00032008704,0.000762911,0.0007188455,0.0002524314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017874142,0.0010673479,0.0012568538,0.0009403658,0.0009564884,0.0024541775,0.0027326064,0.002360085,0.014795371],"category_scores_gemma":[0.012103697,0.0007423433,0.001241328,0.0010328182,0.002647306,0.004488802,0.002508122,0.0034235758,0.0034432802],"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.000020419542,0.000015757074,0.00017502,0.000030641317,0.000019268797,0.00005174785,0.00006158898,0.02406911,0.00021772744,0.96658474,0.0027226277,0.0060313535],"study_design_scores_gemma":[0.000013254552,0.000012822102,0.00011651627,0.000013345801,0.000012050524,0.00007255277,0.000020822967,0.17670497,0.00018564053,0.81844544,0.004386702,0.000015870932],"about_ca_topic_score_codex":0.0027419236,"about_ca_topic_score_gemma":0.001945292,"teacher_disagreement_score":0.014795371,"about_ca_system_score_codex":0.0014887176,"about_ca_system_score_gemma":0.0018701045,"threshold_uncertainty_score":0.0494954},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17931432,0.0012619005,0.8105091,0.00038729052,0.00008621571,0.00026389354,0.0022567438,0.0019638182,0.003956735],"genre_scores_gemma":[0.82041675,0.0005169237,0.17235377,0.00006467434,0.00014964119,0.00020494979,0.0027465187,0.0001301775,0.0034165531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988223,0.00023620516,0.00006105653,0.00036259525,0.0004063185,0.000111505746],"domain_scores_gemma":[0.99531496,0.0022587366,0.0007185325,0.00065201387,0.0007396918,0.00031609324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011028266,0.0008395587,0.0011701275,0.007872221,0.0009927904,0.0015448844,0.0014086458,0.0010754839,0.0018576884],"category_scores_gemma":[0.00769765,0.00045300173,0.0009201259,0.0047027,0.0005024176,0.0030924133,0.0019209692,0.0009509456,0.0013406593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010008734,0.00073779054,0.07472406,0.00090889103,0.0010209264,0.00092307717,0.0008620229,0.09737349,0.049734548,0.022935396,0.01814648,0.7316325],"study_design_scores_gemma":[0.000032571752,0.000091670896,0.00788191,0.000043243745,0.00011777075,0.00036423793,0.0002004531,0.96390116,0.005903928,0.018521085,0.0029104138,0.00003172533],"about_ca_topic_score_codex":0.002901037,"about_ca_topic_score_gemma":0.0066811894,"teacher_disagreement_score":0.007872221,"about_ca_system_score_codex":0.00044815603,"about_ca_system_score_gemma":0.000693575,"threshold_uncertainty_score":0.0062146187},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013611841,0.0007614557,0.9784226,0.00042695607,0.00010453882,0.00007437002,0.000822638,0.00338554,0.0023900496],"genre_scores_gemma":[0.3015332,0.0013814061,0.66638994,0.0006315151,0.00024302259,0.0003545654,0.0055704555,0.00090309646,0.022992697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996493,0.00006336728,0.000014303281,0.00012422979,0.00009194351,0.000056784836],"domain_scores_gemma":[0.9991998,0.00032365302,0.0000563873,0.00014768762,0.00021005662,0.00006250673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007535898,0.0010553156,0.0012316123,0.001061983,0.00073519966,0.0009527285,0.0033765465,0.0015875915,0.004931656],"category_scores_gemma":[0.002072481,0.0007908835,0.0011881912,0.0018285443,0.000673308,0.0014336584,0.0019121469,0.001930124,0.0018159385],"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.00024629454,0.00013212384,0.00071288826,0.00014095554,0.00020897781,0.00012152054,0.000045112076,0.6191458,0.008589316,0.023673637,0.018067319,0.32891607],"study_design_scores_gemma":[0.000004269993,0.0000083335335,0.00009078413,0.0000034790096,0.000011987809,0.000011463233,0.0000023207049,0.99288905,0.00079165923,0.005472518,0.00070931093,0.00000485152],"about_ca_topic_score_codex":0.032930005,"about_ca_topic_score_gemma":0.051284842,"teacher_disagreement_score":0.032930005,"about_ca_system_score_codex":0.0018801678,"about_ca_system_score_gemma":0.0019011345,"threshold_uncertainty_score":0.065476656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03145587,0.0006646274,0.9637144,0.0005425752,0.000051806448,0.00006074784,0.00030389274,0.00039113782,0.0028149425],"genre_scores_gemma":[0.8030279,0.0018476334,0.18602301,0.0003646779,0.00019303946,0.0002683827,0.0010903095,0.00016220045,0.0070228544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941015,0.00018354932,0.000023434452,0.00010503986,0.00020494341,0.00007283611],"domain_scores_gemma":[0.9978981,0.0011950048,0.00024304449,0.00038196615,0.00020577015,0.00007605607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009799798,0.00054183987,0.00067379675,0.00073356205,0.00032355892,0.00068334636,0.0011606318,0.0007026286,0.0017782976],"category_scores_gemma":[0.005153129,0.00024297072,0.00043135142,0.0011825366,0.0008889451,0.0020383485,0.0009070854,0.0010930451,0.00041070307],"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.00017183028,0.000070354225,0.00067621365,0.000112504466,0.00003233711,0.00014533509,0.00010530535,0.70905566,0.0063001853,0.21112259,0.0037151712,0.06849245],"study_design_scores_gemma":[0.0000049823907,0.000017355325,0.000073533454,0.000004753428,0.0000036442634,0.000024034736,0.0000064348665,0.9788118,0.0010162579,0.019451594,0.0005811436,0.000004479751],"about_ca_topic_score_codex":0.0035310893,"about_ca_topic_score_gemma":0.0033018745,"teacher_disagreement_score":0.0035310893,"about_ca_system_score_codex":0.0010060238,"about_ca_system_score_gemma":0.00081675715,"threshold_uncertainty_score":0.0072992444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8761698,0.00058350066,0.11185177,0.0007380562,0.00012324996,0.0006783068,0.0026629409,0.001117761,0.0060746926],"genre_scores_gemma":[0.9680655,0.00014945335,0.029602649,0.00009302595,0.000079474434,0.00024164558,0.00095660676,0.000029947882,0.0007816005],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684805,0.0014065539,0.00028431858,0.00051786285,0.0007541352,0.00018905685],"domain_scores_gemma":[0.9837159,0.0126559455,0.0016011518,0.00053771195,0.0012587665,0.00023051177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00391487,0.0007711051,0.0007099761,0.006179534,0.0004822026,0.0018861738,0.0004191757,0.0006643558,0.0015715925],"category_scores_gemma":[0.015022987,0.00022839865,0.00063123956,0.0032670377,0.0005021699,0.0023286806,0.00054576487,0.00075767696,0.0008820506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005794202,0.0012805482,0.6085517,0.00049345876,0.00046220567,0.00040341105,0.0034575656,0.016141124,0.011905767,0.002164521,0.0030369859,0.3515233],"study_design_scores_gemma":[0.000023000977,0.00057099544,0.47357544,0.000084053565,0.000106933636,0.00038847447,0.002752954,0.50738025,0.0051601967,0.0070009315,0.0028471574,0.000109536326],"about_ca_topic_score_codex":0.0024919156,"about_ca_topic_score_gemma":0.002554471,"teacher_disagreement_score":0.006179534,"about_ca_system_score_codex":0.00081104785,"about_ca_system_score_gemma":0.00030341683,"threshold_uncertainty_score":0.020704031},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031902255,0.013243366,0.556605,0.0060119494,0.003296525,0.0010516214,0.033796508,0.010098863,0.37270588],"genre_scores_gemma":[0.04647537,0.02309713,0.4947277,0.0025848544,0.0016523862,0.0018858968,0.0491186,0.0039743003,0.37648362],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685055,0.0007495511,0.00016784169,0.0006787473,0.0014353995,0.000118003794],"domain_scores_gemma":[0.99641246,0.0015625011,0.0002523486,0.0006690607,0.0009717713,0.0001319717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023736537,0.001484986,0.001056321,0.0064330106,0.0013773653,0.005213704,0.00224639,0.001342576,0.102873206],"category_scores_gemma":[0.011428867,0.00062369375,0.0014128408,0.0068809423,0.00082428334,0.0038230196,0.0022359926,0.0017755345,0.048816424],"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.000027531612,0.000028038772,0.0013564485,0.0008343494,0.00012256623,0.00013509249,0.00041635358,0.0067654853,0.00071087014,0.14802794,0.48741868,0.35415664],"study_design_scores_gemma":[0.0000060282737,0.00001491473,0.0009716595,0.00034975607,0.000029839803,0.00028667186,0.00024937047,0.011101793,0.00051039836,0.09002824,0.8964206,0.00003066436],"about_ca_topic_score_codex":0.003398894,"about_ca_topic_score_gemma":0.0054366267,"teacher_disagreement_score":0.102873206,"about_ca_system_score_codex":0.0018751001,"about_ca_system_score_gemma":0.0017993536,"threshold_uncertainty_score":0.34414518},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014860415,0.052528072,0.29395524,0.23883975,0.0061198627,0.0002599249,0.008242211,0.004900267,0.38029423],"genre_scores_gemma":[0.31732142,0.0842349,0.4965993,0.0135331405,0.0031708446,0.0007907544,0.0045669046,0.0041904077,0.07559236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968125,0.0019156418,0.00010922771,0.00029327854,0.00077120814,0.00009813226],"domain_scores_gemma":[0.9935876,0.004433644,0.00036692212,0.00064573,0.00077454315,0.00019157816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004772617,0.00076973956,0.00059622223,0.0065964493,0.0014607009,0.016660985,0.0012616604,0.0017854662,0.011960952],"category_scores_gemma":[0.024841307,0.00073231914,0.00046705996,0.0083024,0.0054096472,0.026920274,0.0021453183,0.002336804,0.0050453064],"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.000028599987,0.000015646709,0.001962076,0.0007152582,0.000060065715,0.00021834145,0.011465134,0.0010710052,0.0007225295,0.5429168,0.21648833,0.22433616],"study_design_scores_gemma":[0.0000072772136,0.0000059042086,0.0011346448,0.0007833788,0.000019620653,0.00033942563,0.008708335,0.00207417,0.0005044732,0.39540806,0.5909734,0.00004126949],"about_ca_topic_score_codex":0.0051057325,"about_ca_topic_score_gemma":0.0075055463,"teacher_disagreement_score":0.016660985,"about_ca_system_score_codex":0.00206271,"about_ca_system_score_gemma":0.0014923321,"threshold_uncertainty_score":0.040013373},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01413433,0.009641877,0.79327404,0.014991331,0.0011042929,0.00020989028,0.002499308,0.00096272683,0.1631822],"genre_scores_gemma":[0.62045276,0.021648854,0.14643899,0.0027332976,0.0023823439,0.0018775827,0.0025855068,0.00063391845,0.20124674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988966,0.00049501687,0.00004792309,0.00021555492,0.00022284895,0.00012213782],"domain_scores_gemma":[0.99706537,0.001917732,0.000258673,0.0002621121,0.00032204692,0.00017417257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021069138,0.0015991383,0.0013369222,0.0016888429,0.0013360241,0.0038696022,0.0027462675,0.0043611894,0.020450054],"category_scores_gemma":[0.0114398785,0.0006637954,0.001255915,0.002341638,0.0022431999,0.0069215344,0.0017695441,0.003262155,0.0046086577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000936722,0.000012168948,0.00019733673,0.00004935437,0.000017209824,0.000056430512,0.00014980866,0.037088,0.00007489879,0.9491693,0.008302703,0.0048733833],"study_design_scores_gemma":[0.000015910082,0.000008557689,0.00010514896,0.000030645733,0.000008600298,0.000062174,0.000056673478,0.12798135,0.000021537184,0.8547059,0.016991822,0.00001166636],"about_ca_topic_score_codex":0.009772361,"about_ca_topic_score_gemma":0.0062372885,"teacher_disagreement_score":0.020450054,"about_ca_system_score_codex":0.003010747,"about_ca_system_score_gemma":0.001233943,"threshold_uncertainty_score":0.068412244},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0307939,0.023028422,0.5404643,0.21414883,0.003540113,0.001186304,0.038815614,0.0014931015,0.1465294],"genre_scores_gemma":[0.42430115,0.040205687,0.45664415,0.02040658,0.004316794,0.0040166783,0.026410405,0.0011092526,0.022589305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.95978594,0.024831817,0.001993636,0.0042436514,0.008414856,0.0007299935],"domain_scores_gemma":[0.86682296,0.09419203,0.007240932,0.018574035,0.011394307,0.001775799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.043534357,0.00080914417,0.0015087783,0.0066911685,0.002268086,0.017118903,0.0030402709,0.0032611939,0.0051039574],"category_scores_gemma":[0.20033273,0.0013926346,0.0005991074,0.013366092,0.006419152,0.04052097,0.0035378796,0.0049109557,0.0041242954],"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.000071052054,0.00007549472,0.022916293,0.0019175614,0.00023578435,0.00022338275,0.008452484,0.0038791553,0.000808876,0.5474625,0.08547809,0.3284793],"study_design_scores_gemma":[0.00001307483,0.000025266076,0.008141811,0.0016691401,0.00006420724,0.00032163074,0.006069074,0.007424721,0.0007698453,0.7915573,0.18384245,0.00010130603],"about_ca_topic_score_codex":0.007623912,"about_ca_topic_score_gemma":0.00736933,"teacher_disagreement_score":0.043534357,"about_ca_system_score_codex":0.003326939,"about_ca_system_score_gemma":0.0050290124,"threshold_uncertainty_score":0.23023444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024810234,0.027994636,0.021031693,0.025886195,0.00084913365,0.00006676536,0.00027978086,0.000103326885,0.8989783],"genre_scores_gemma":[0.7711728,0.043959126,0.01364305,0.0042023547,0.0010079069,0.0002310192,0.00033967246,0.00011427383,0.16532972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988869,0.00053004955,0.000040029663,0.00020113625,0.00023315754,0.00010882219],"domain_scores_gemma":[0.9986534,0.0007440796,0.00017108594,0.00014934751,0.0001445276,0.00013754089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001342551,0.0003771711,0.00029518388,0.001470378,0.0028263882,0.008959861,0.0006358566,0.0013370088,0.012494612],"category_scores_gemma":[0.0036278404,0.00022425532,0.00018824435,0.0020648597,0.00946954,0.009026727,0.0030412725,0.001336397,0.0014105714],"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.000003866348,0.0000033276901,0.00029560336,0.000048051148,0.0000045816173,0.000026687878,0.0028958993,0.00031226908,0.00007318182,0.9725671,0.0048150653,0.01895434],"study_design_scores_gemma":[0.0000034136801,0.0000090021385,0.00093081594,0.0002388432,0.0000052343116,0.00012761407,0.0034479352,0.0004891837,0.000121122524,0.6234605,0.3711549,0.000011410851],"about_ca_topic_score_codex":0.003541403,"about_ca_topic_score_gemma":0.0031925864,"teacher_disagreement_score":0.012494612,"about_ca_system_score_codex":0.003084434,"about_ca_system_score_gemma":0.0014022213,"threshold_uncertainty_score":0.04179865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050196864,0.029150942,0.3491172,0.08596962,0.0027471643,0.00047895245,0.005387933,0.0006686588,0.4762827],"genre_scores_gemma":[0.749072,0.046459507,0.13659981,0.006426551,0.0032384156,0.00096099894,0.003224154,0.0002864477,0.05373213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861264,0.00063284097,0.00007438942,0.0003493973,0.0002359271,0.000094756506],"domain_scores_gemma":[0.99673754,0.0022764558,0.00031937961,0.00023719434,0.00022525019,0.00020412829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017965006,0.00043590018,0.0004647685,0.0031535008,0.0016449961,0.005288737,0.00062146,0.0012953195,0.007886886],"category_scores_gemma":[0.0075860457,0.00023087669,0.00036472754,0.004156765,0.00350954,0.010713339,0.0012500742,0.00087924843,0.001552407],"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.000015384236,0.000018853834,0.0022461438,0.00032952573,0.000024352252,0.00016430946,0.002036196,0.0010252178,0.00052754616,0.9139472,0.01763281,0.062032416],"study_design_scores_gemma":[0.0000022170639,0.000013310974,0.0018579251,0.00026253366,0.000016380323,0.000363608,0.0023450407,0.0022674606,0.00023884093,0.82224536,0.1703686,0.000018684521],"about_ca_topic_score_codex":0.0023583837,"about_ca_topic_score_gemma":0.0021423225,"teacher_disagreement_score":0.007886886,"about_ca_system_score_codex":0.0011776754,"about_ca_system_score_gemma":0.0008474458,"threshold_uncertainty_score":0.026384234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27814466,0.0003541084,0.71027493,0.00038331677,0.00009259604,0.00015950623,0.0001577782,0.001272933,0.009160189],"genre_scores_gemma":[0.777101,0.00037447654,0.21872233,0.00010746504,0.000023391483,0.00027603927,0.0003802899,0.00019266622,0.0028223307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973434,0.000091168964,0.000022361846,0.000046236342,0.00007373715,0.000032019554],"domain_scores_gemma":[0.9974057,0.0017870384,0.000147999,0.0002704631,0.00028217284,0.00010655609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009637443,0.00052370277,0.0004581456,0.000867864,0.00026257307,0.0009703924,0.0010525044,0.0011307185,0.0025405118],"category_scores_gemma":[0.0057694763,0.00022936276,0.00052184466,0.00063014403,0.00042984312,0.0013348922,0.00075333385,0.0006419041,0.000263648],"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.000106306936,0.00014065811,0.001430802,0.00009382208,0.000035953377,0.0000653095,0.00012991279,0.8995049,0.0025286211,0.022006199,0.0004839247,0.0734737],"study_design_scores_gemma":[0.00001115979,0.000037252234,0.00009407139,0.000006384683,0.000006766632,0.000017888568,0.000020904841,0.9949528,0.0006556666,0.0038092285,0.00038400549,0.0000039236656],"about_ca_topic_score_codex":0.001894715,"about_ca_topic_score_gemma":0.0017896609,"teacher_disagreement_score":0.0025405118,"about_ca_system_score_codex":0.0008866717,"about_ca_system_score_gemma":0.0006017516,"threshold_uncertainty_score":0.008498788},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4703447,0.0039661536,0.48983172,0.001052582,0.00044811465,0.0006355287,0.0011802161,0.01069627,0.02184474],"genre_scores_gemma":[0.7595817,0.00068598235,0.2315788,0.00021963127,0.000061940635,0.0002568869,0.0010668152,0.00008839917,0.006459837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882156,0.00016541127,0.00006476944,0.0002768269,0.00044106264,0.00023036393],"domain_scores_gemma":[0.9981073,0.0003774075,0.000103123115,0.0003146366,0.0009675974,0.00012988281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012214333,0.00065501087,0.00068909285,0.0009860402,0.0011059106,0.000974632,0.0015612816,0.0007778284,0.0027634508],"category_scores_gemma":[0.0026304177,0.00030810386,0.00057705183,0.0013626596,0.00026009342,0.0014862395,0.00055341126,0.00054077985,0.00065085065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001689633,0.0010544783,0.019552456,0.0006117747,0.0005097486,0.00031435263,0.00017029977,0.23311995,0.04623023,0.006383106,0.018286109,0.67207783],"study_design_scores_gemma":[0.00006561769,0.00027855294,0.0032926379,0.000009812489,0.00007557104,0.000119773504,0.00004662755,0.98130304,0.010772571,0.001056804,0.0029599466,0.00001904477],"about_ca_topic_score_codex":0.021430984,"about_ca_topic_score_gemma":0.024405058,"teacher_disagreement_score":0.021430984,"about_ca_system_score_codex":0.0013385116,"about_ca_system_score_gemma":0.0025511975,"threshold_uncertainty_score":0.042612433},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065577805,0.0005212776,0.92773587,0.0008717793,0.00008035931,0.0000722728,0.0005394397,0.0005135896,0.0040876493],"genre_scores_gemma":[0.859696,0.0005842021,0.13620438,0.0003150086,0.0001894975,0.000119818615,0.0009159731,0.000353647,0.0016215221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961584,0.0016170972,0.00016610754,0.0009371643,0.0007594061,0.00036174565],"domain_scores_gemma":[0.97036,0.019810174,0.0028167,0.0043465807,0.0019645758,0.0007019911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009698268,0.0012623973,0.0013534119,0.0022788804,0.00088231586,0.00378355,0.0026461869,0.0014991153,0.002849369],"category_scores_gemma":[0.047730498,0.0009473049,0.0022694804,0.0017043379,0.003113063,0.0057164705,0.0056153326,0.004002815,0.00031051814],"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.00013232524,0.000037974525,0.0049366937,0.00008390602,0.00023321304,0.0000645751,0.000169207,0.84679526,0.0014199966,0.12176306,0.0011152657,0.023248535],"study_design_scores_gemma":[0.0000043359073,0.00001644734,0.00054434745,0.000018378842,0.000026368562,0.000009131191,0.000030362131,0.90966225,0.00026753466,0.088897884,0.0005163792,0.000006529503],"about_ca_topic_score_codex":0.016841669,"about_ca_topic_score_gemma":0.007845241,"teacher_disagreement_score":0.016841669,"about_ca_system_score_codex":0.002876917,"about_ca_system_score_gemma":0.0027148165,"threshold_uncertainty_score":0.051289976},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6890322,0.004448662,0.28419134,0.005615642,0.00023533464,0.00014356388,0.0067767133,0.0014115031,0.008145049],"genre_scores_gemma":[0.92778426,0.00081834465,0.066569336,0.00017237545,0.00015039701,0.000083655876,0.003140297,0.00005908258,0.0012222476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992654,0.00029328137,0.000034324985,0.00019293679,0.00015472228,0.00005941542],"domain_scores_gemma":[0.98662055,0.010266598,0.0012048497,0.0005840442,0.0010320803,0.00029192952],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.002369147,0.0006918922,0.0005182563,0.0049008923,0.0005806692,0.0017065639,0.0010641529,0.001184654,0.0014114792],"category_scores_gemma":[0.016163455,0.00032164622,0.0005416111,0.0044724545,0.0006014517,0.0038798335,0.0007229263,0.0012180309,0.0004467836],"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.00023536239,0.00016671176,0.037449837,0.00019661098,0.00014321238,0.00015908838,0.00014955993,0.8777908,0.0010642667,0.009641739,0.005818196,0.0671845],"study_design_scores_gemma":[0.000005489358,0.000011209895,0.0016213297,0.000013287066,0.000015496204,0.000011790811,0.000022110997,0.9880541,0.00035896627,0.0090445075,0.00083520287,0.000006507519],"about_ca_topic_score_codex":0.012503611,"about_ca_topic_score_gemma":0.015188677,"teacher_disagreement_score":0.9950991,"about_ca_system_score_codex":0.0015875077,"about_ca_system_score_gemma":0.00070147816,"threshold_uncertainty_score":0.024861693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23800173,0.0008916503,0.50752,0.000854451,0.001035988,0.0010707848,0.054063104,0.18145958,0.015102697],"genre_scores_gemma":[0.31692824,0.0002639541,0.6100978,0.00014513337,0.00016250525,0.0005513955,0.05507698,0.0034191592,0.013354925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912494,0.00014854183,0.00007511684,0.0003069835,0.00027987547,0.00006449297],"domain_scores_gemma":[0.99654645,0.0015548904,0.00017877581,0.0005191553,0.001039292,0.00016151187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009462829,0.0010135826,0.0006067774,0.0059462986,0.0010315778,0.0012313208,0.0010993175,0.0009140779,0.008767792],"category_scores_gemma":[0.005891817,0.00026044357,0.00065841904,0.0040371264,0.00029299493,0.0015169386,0.0010151187,0.0006202015,0.004681647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013024902,0.0006644445,0.012130493,0.0011567244,0.00018131455,0.0009288308,0.0014085581,0.02093931,0.036885876,0.00630237,0.11310949,0.80499005],"study_design_scores_gemma":[0.00011169899,0.00017612817,0.012508776,0.00009296265,0.0001058004,0.00049114623,0.0008016844,0.856596,0.043264244,0.013475572,0.072243854,0.00013207908],"about_ca_topic_score_codex":0.006521841,"about_ca_topic_score_gemma":0.01584067,"teacher_disagreement_score":0.008767792,"about_ca_system_score_codex":0.00072052586,"about_ca_system_score_gemma":0.0009890049,"threshold_uncertainty_score":0.029331148},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56062675,0.0013597833,0.42478073,0.0019990655,0.00013183343,0.00023246804,0.0012286599,0.00038591577,0.009254788],"genre_scores_gemma":[0.9825463,0.00061200943,0.012877887,0.00011278889,0.000040241437,0.0001431763,0.00032576502,0.000035878176,0.0033058014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993204,0.00032573898,0.000024740617,0.00013013594,0.00009059621,0.000108380875],"domain_scores_gemma":[0.99392575,0.0047019804,0.0007199777,0.00015588522,0.000346068,0.0001502808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002068472,0.0008175475,0.00070948177,0.0017449994,0.000657696,0.000979858,0.0011854323,0.0014136793,0.0016060118],"category_scores_gemma":[0.008088728,0.00053258374,0.00085450266,0.0011357951,0.0010866212,0.0014843824,0.0010029566,0.0009559018,0.00023341409],"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.000026706466,0.000015115005,0.002326925,0.000031862804,0.000025497175,0.000103252634,0.00007603075,0.97935873,0.00037323567,0.0151972575,0.00035754946,0.0021078396],"study_design_scores_gemma":[0.0000022218655,0.0000046618493,0.00027529028,0.0000028476172,0.000003601556,0.00000880786,0.000014997685,0.9970108,0.000034724417,0.0025151419,0.00012292243,0.000003955109],"about_ca_topic_score_codex":0.029504925,"about_ca_topic_score_gemma":0.012891084,"teacher_disagreement_score":0.029504925,"about_ca_system_score_codex":0.0020658986,"about_ca_system_score_gemma":0.0007725695,"threshold_uncertainty_score":0.05866635},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055670258,0.0011247278,0.928244,0.0010432785,0.00010219703,0.00008041812,0.00059355615,0.00025589945,0.012885644],"genre_scores_gemma":[0.85784787,0.0026993402,0.11861683,0.0004260822,0.0004434502,0.0002607817,0.0013545747,0.00027945603,0.018071696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994307,0.0002074066,0.00002773474,0.00011927079,0.00016036206,0.00005446728],"domain_scores_gemma":[0.9979109,0.0009861233,0.00037333553,0.00022846085,0.00034567592,0.00015552022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000937877,0.00068529503,0.00074983435,0.0035760016,0.0008936057,0.0020141955,0.0018541233,0.0013087273,0.003703702],"category_scores_gemma":[0.0046181697,0.0005536204,0.0008604238,0.0022738858,0.0015500513,0.0035565693,0.0013252156,0.0011448141,0.00063400576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001646847,0.000020117834,0.0007890333,0.0000833931,0.000028355546,0.00008327509,0.00016739022,0.19932622,0.00090506003,0.7859097,0.0023569993,0.01031396],"study_design_scores_gemma":[0.0000057332045,0.00001292392,0.00048020386,0.000016981012,0.000011397382,0.00008940641,0.000065873435,0.55254376,0.00018682473,0.4431698,0.0034042657,0.000012813027],"about_ca_topic_score_codex":0.003412508,"about_ca_topic_score_gemma":0.0030812332,"teacher_disagreement_score":0.003703702,"about_ca_system_score_codex":0.0014154487,"about_ca_system_score_gemma":0.0006257992,"threshold_uncertainty_score":0.012390137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9943797,0.00007493604,0.003832344,0.00011989246,0.000005918949,0.000014415929,0.00013983028,0.000024610717,0.0014084202],"genre_scores_gemma":[0.99943167,0.000032775297,0.00020958204,0.0000045449888,0.0000013434346,0.0000038628486,0.00007747972,0.0000015700143,0.00023716323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997104,0.00007776142,0.000009101453,0.000046514964,0.000058479203,0.00009770447],"domain_scores_gemma":[0.9989427,0.0005019395,0.0001830931,0.00006038852,0.00022351417,0.00008838567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006560754,0.00028961914,0.00022382359,0.0013192288,0.00044744104,0.00044901035,0.00039097492,0.0003549106,0.00087082747],"category_scores_gemma":[0.0018419656,0.00012306368,0.00039817227,0.00083492405,0.00045738675,0.0012529787,0.0005901907,0.00033601467,0.000055341014],"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.00030943082,0.00008678443,0.17945182,0.00008087254,0.00021724957,0.0011368359,0.00052230305,0.77396727,0.005049218,0.016501188,0.0028210229,0.019856025],"study_design_scores_gemma":[0.000005919368,0.00008022232,0.061366886,0.000010871064,0.000086308464,0.00021520675,0.0006076884,0.93168414,0.0010136827,0.0044289376,0.00048108754,0.00001905033],"about_ca_topic_score_codex":0.017945213,"about_ca_topic_score_gemma":0.015814153,"teacher_disagreement_score":0.017945213,"about_ca_system_score_codex":0.0012224168,"about_ca_system_score_gemma":0.0005502522,"threshold_uncertainty_score":0.035681486},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12550078,0.00077379454,0.8680271,0.00044566634,0.0001354472,0.00006566054,0.00065184024,0.0024467672,0.0019529397],"genre_scores_gemma":[0.84409297,0.0004435389,0.15152678,0.00019853338,0.000098956145,0.000054255095,0.0015627019,0.00021755605,0.0018046845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992094,0.0001261431,0.000031393272,0.00029783515,0.000237987,0.00009720829],"domain_scores_gemma":[0.99791104,0.0008959554,0.00027387682,0.00034513147,0.0004184591,0.00015555613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081828795,0.0009655742,0.00091316,0.0029463698,0.00056648575,0.0011532826,0.0010855632,0.00090443593,0.0010846737],"category_scores_gemma":[0.0059996364,0.00033513442,0.00079009635,0.0018697833,0.00070214097,0.0019419915,0.001176037,0.0013633748,0.00059730606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047894154,0.00024088963,0.02462607,0.0002770113,0.00026833202,0.0009825889,0.0005321047,0.37024018,0.031176433,0.01847031,0.015462797,0.5372444],"study_design_scores_gemma":[0.000006271336,0.000028408887,0.0025764466,0.0000064777696,0.000013394642,0.00019536496,0.00010521345,0.983192,0.0027515248,0.009818552,0.001286707,0.000019632957],"about_ca_topic_score_codex":0.006202641,"about_ca_topic_score_gemma":0.008459907,"teacher_disagreement_score":0.006202641,"about_ca_system_score_codex":0.00084448187,"about_ca_system_score_gemma":0.00045747464,"threshold_uncertainty_score":0.012333095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06298056,0.00025159415,0.9353686,0.00023228946,0.00003700143,0.000065451364,0.00032587015,0.00034652773,0.00039215485],"genre_scores_gemma":[0.7885806,0.0004638941,0.20577101,0.00006199564,0.0002466029,0.00017262957,0.0017537125,0.00010350077,0.0028460326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891293,0.00031951675,0.00005591659,0.000377149,0.00023011843,0.00010437194],"domain_scores_gemma":[0.9896758,0.007279144,0.0009221242,0.00082104484,0.0008705562,0.00043125774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002424371,0.000995589,0.0013807254,0.00282885,0.00075900264,0.0014239616,0.0024260252,0.001653791,0.0014076708],"category_scores_gemma":[0.018853221,0.0007053293,0.0009970113,0.002103478,0.00082648237,0.0026862207,0.0017229427,0.0019041671,0.00048400383],"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.0005549438,0.00045116415,0.015973657,0.00026388123,0.00020713007,0.0002100569,0.00031004925,0.7785074,0.008012051,0.027019847,0.0034142763,0.16507557],"study_design_scores_gemma":[0.0000032894666,0.000007036635,0.00034892204,0.0000023203472,0.0000031906511,0.000011324686,0.0000068641652,0.9947737,0.00019890774,0.0045568338,0.00008524473,0.00000245157],"about_ca_topic_score_codex":0.006243247,"about_ca_topic_score_gemma":0.007334295,"teacher_disagreement_score":0.006243247,"about_ca_system_score_codex":0.0010492316,"about_ca_system_score_gemma":0.00091623294,"threshold_uncertainty_score":0.0128214955},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38499594,0.0015793648,0.5590776,0.0021075231,0.0002571163,0.00019546159,0.00055147405,0.00043954747,0.050795928],"genre_scores_gemma":[0.9716239,0.00052395853,0.023014056,0.0001929314,0.000075454016,0.00015725067,0.00016998865,0.00010336393,0.004139185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911207,0.0003356743,0.000041169016,0.00012426513,0.00019054706,0.0001962317],"domain_scores_gemma":[0.9976574,0.0010643301,0.0004554378,0.00033547563,0.00021918076,0.00026818784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013343387,0.00043631942,0.00082493003,0.0009433922,0.0013889505,0.0019435226,0.00095212826,0.0012574369,0.005083345],"category_scores_gemma":[0.008155508,0.00054347486,0.0009663974,0.00061321375,0.0026506823,0.0031914983,0.001213881,0.0015420082,0.00058588886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108326385,0.000047737325,0.000758682,0.00006746876,0.000028337427,0.0001221748,0.00013404989,0.19236274,0.0019749384,0.7927083,0.0023749808,0.009312296],"study_design_scores_gemma":[0.000036177298,0.000028564742,0.0004056631,0.000017010621,0.0000056347767,0.00004974839,0.00006926596,0.32292038,0.0004694739,0.6745995,0.0013807465,0.000017786746],"about_ca_topic_score_codex":0.0036486192,"about_ca_topic_score_gemma":0.0014257419,"teacher_disagreement_score":0.005083345,"about_ca_system_score_codex":0.0024032795,"about_ca_system_score_gemma":0.0010898884,"threshold_uncertainty_score":0.01743704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12873061,0.0013635352,0.8538009,0.0017477485,0.00018814443,0.00011920246,0.00026056828,0.00023429026,0.013555128],"genre_scores_gemma":[0.9737366,0.0006516284,0.017638067,0.00014934917,0.00009759862,0.0001350018,0.00009830333,0.000043920514,0.0074495417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992287,0.0003752108,0.000025945948,0.00014546553,0.000078728226,0.00014591082],"domain_scores_gemma":[0.9949832,0.0036280674,0.00063840015,0.00010462924,0.00040271436,0.00024299807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019907525,0.0016288164,0.001638771,0.0011522236,0.0006725307,0.0018828461,0.0014814785,0.0021912989,0.0021236907],"category_scores_gemma":[0.007034468,0.0007212094,0.00088485214,0.00060837273,0.0017705846,0.0016975438,0.0013492774,0.0014369539,0.00022426769],"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.00011691643,0.00006153113,0.0008350754,0.00010548376,0.0000778665,0.00019803649,0.000112024085,0.9623414,0.0009162928,0.029743943,0.0011008508,0.0043904884],"study_design_scores_gemma":[0.000009366118,0.000018046952,0.0000806903,0.000005054439,0.00001210362,0.000005552598,0.00001600928,0.995436,0.00005637234,0.004251525,0.000104539184,0.000004665685],"about_ca_topic_score_codex":0.014633042,"about_ca_topic_score_gemma":0.0066389586,"teacher_disagreement_score":0.014633042,"about_ca_system_score_codex":0.0017958704,"about_ca_system_score_gemma":0.0012153971,"threshold_uncertainty_score":0.02909571},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010569863,0.00042103513,0.9967738,0.00022327424,0.000056454668,0.00002312608,0.00015755682,0.0002763102,0.0010114794],"genre_scores_gemma":[0.06856099,0.0017631946,0.9212508,0.00030082252,0.00026696295,0.00044048828,0.0008883512,0.00062034116,0.0059079756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988147,0.0005536529,0.00006313156,0.00026366452,0.00025124254,0.000053643074],"domain_scores_gemma":[0.9965113,0.0018967242,0.0003793964,0.0006703572,0.00038592768,0.0001563068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026016643,0.0014157365,0.00092077843,0.0028624376,0.0008011192,0.00237933,0.0019485228,0.0016824492,0.0062972973],"category_scores_gemma":[0.010290107,0.0006151848,0.0018455216,0.0020796144,0.001882754,0.0037342738,0.0031204533,0.004267308,0.002311214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008916578,0.00005005875,0.0012750534,0.0004452532,0.0001981392,0.00023081155,0.000569764,0.14818816,0.0056774737,0.6683537,0.016676154,0.1582463],"study_design_scores_gemma":[0.000015954472,0.000040264455,0.00066870596,0.00009091881,0.000027243617,0.00025466539,0.00008410549,0.66636944,0.0024819344,0.29530972,0.0345874,0.000069637514],"about_ca_topic_score_codex":0.0028730757,"about_ca_topic_score_gemma":0.0031868704,"teacher_disagreement_score":0.0062972973,"about_ca_system_score_codex":0.0013978054,"about_ca_system_score_gemma":0.0013854238,"threshold_uncertainty_score":0.021066546},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11163556,0.0015868833,0.8750646,0.0003834874,0.00017496673,0.0005490035,0.0017730403,0.00064105453,0.008191444],"genre_scores_gemma":[0.6194374,0.00065167935,0.37532663,0.00011181986,0.00014798039,0.0007304601,0.0020302772,0.00009587218,0.0014679079],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728703,0.000693043,0.00020280124,0.0005408045,0.0011746782,0.00010163496],"domain_scores_gemma":[0.9939873,0.002642518,0.0012048306,0.0004774461,0.0014458697,0.00024206175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025115064,0.0006234168,0.0009575133,0.01040144,0.0009153586,0.0016401183,0.0011028626,0.0010272998,0.0015280959],"category_scores_gemma":[0.015001214,0.00022835856,0.00083125685,0.006311203,0.0009755814,0.0043760436,0.0015434795,0.0010231853,0.00033501172],"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.00039822282,0.00042612007,0.06445705,0.0013206333,0.0010420274,0.00048838905,0.001583583,0.18084641,0.03341623,0.18462119,0.013279979,0.51812005],"study_design_scores_gemma":[0.00004201495,0.0002977524,0.026425898,0.00016936097,0.00014949503,0.000779426,0.00056189747,0.85711503,0.0077934586,0.09246381,0.014038282,0.00016362326],"about_ca_topic_score_codex":0.0019167985,"about_ca_topic_score_gemma":0.0026746348,"teacher_disagreement_score":0.01040144,"about_ca_system_score_codex":0.0015458931,"about_ca_system_score_gemma":0.0011249337,"threshold_uncertainty_score":0.013282239},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023637287,0.00014986163,0.9747287,0.00025833363,0.000016162057,0.000024965531,0.00020852931,0.00026415105,0.0007119049],"genre_scores_gemma":[0.5952417,0.000547832,0.399193,0.00018838317,0.00009389683,0.00015329034,0.0016112567,0.00024368877,0.0027269411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988776,0.00047879628,0.00003889582,0.00036444046,0.00016432996,0.00007596508],"domain_scores_gemma":[0.9898386,0.007730761,0.00073379354,0.0010431418,0.00044497533,0.00020863532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022525792,0.0009298251,0.00093281013,0.0018089612,0.00066448154,0.0011753293,0.0017285625,0.0016330462,0.0018099508],"category_scores_gemma":[0.017195137,0.000831674,0.0010026108,0.001417167,0.001400361,0.0034747883,0.0016796676,0.0025873592,0.000514802],"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.00011411891,0.00004143639,0.00478171,0.00013898574,0.00010479464,0.00028970928,0.0002929263,0.87015057,0.0021371073,0.06851779,0.0019603616,0.051470496],"study_design_scores_gemma":[0.0000072245743,0.000008191435,0.00044409337,0.000014990968,0.000009256036,0.00005229698,0.00004118907,0.92704064,0.0007793717,0.07078994,0.00080111914,0.0000116427545],"about_ca_topic_score_codex":0.0062082843,"about_ca_topic_score_gemma":0.007090562,"teacher_disagreement_score":0.0062082843,"about_ca_system_score_codex":0.0010700505,"about_ca_system_score_gemma":0.0010133759,"threshold_uncertainty_score":0.012344241},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.997938,0.000053083793,0.000058607297,0.0003308716,0.000019847297,0.000013376054,0.00033753522,0.0000029176047,0.0012457275],"genre_scores_gemma":[0.9977404,0.000082832004,0.00007878621,0.00016092554,0.00002848586,0.00003286729,0.00055264536,0.00000455147,0.0013185163],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99961346,0.00011339812,0.00002309498,0.000062663465,0.000078710786,0.000108590015],"domain_scores_gemma":[0.9971029,0.00058393937,0.0009978529,0.00017766008,0.0006330972,0.00050450896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010901033,0.00017969546,0.00022435455,0.0007224859,0.0014150402,0.0014268992,0.00032259055,0.00072773336,0.0038840447],"category_scores_gemma":[0.004362111,0.00019070585,0.00021929837,0.0009448274,0.00055556226,0.001814303,0.0009703272,0.0013000328,0.0012400346],"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.0002561771,0.00084029924,0.9156832,0.00007611475,0.00007206675,0.0006286268,0.057914846,0.00009846412,0.001010315,0.00093300495,0.006606406,0.015880404],"study_design_scores_gemma":[0.0000058975265,0.00021331682,0.94129634,0.000025154945,0.000024503994,0.00010193944,0.05256223,0.00028143724,0.0002443768,0.00015195248,0.0050685573,0.000024228284],"about_ca_topic_score_codex":0.011723395,"about_ca_topic_score_gemma":0.02277611,"teacher_disagreement_score":0.011723395,"about_ca_system_score_codex":0.00062596117,"about_ca_system_score_gemma":0.00047722113,"threshold_uncertainty_score":0.023310304},"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":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23662543,0.004064201,0.25278294,0.002202857,0.001273091,0.0009364833,0.44480377,0.008423356,0.048887845],"genre_scores_gemma":[0.58541375,0.0021866425,0.20898187,0.00024318883,0.00092385843,0.0008553376,0.1857461,0.00063197187,0.015017278],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99822694,0.00041396936,0.00021993527,0.00040597253,0.00061803736,0.000115179006],"domain_scores_gemma":[0.99587435,0.0017813531,0.00042058865,0.0008204773,0.00075894996,0.00034428455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010790213,0.00088399247,0.0007495318,0.015283402,0.0006588924,0.0026299777,0.00089837966,0.0008710996,0.0061313733],"category_scores_gemma":[0.0062036556,0.00033454227,0.00078502006,0.01274781,0.00025720106,0.0041986876,0.0018870636,0.0008912792,0.0040721153],"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.00059626787,0.0006304093,0.2309464,0.0025519896,0.0008603807,0.00056463305,0.0030642247,0.012381225,0.01511459,0.013644956,0.077204056,0.6424408],"study_design_scores_gemma":[0.000053441836,0.00021191011,0.2978126,0.0008113311,0.0008896014,0.0013100815,0.011872261,0.16734827,0.019899078,0.052348826,0.44719028,0.0002524162],"about_ca_topic_score_codex":0.0120938085,"about_ca_topic_score_gemma":0.032649714,"teacher_disagreement_score":0.015283402,"about_ca_system_score_codex":0.00066409976,"about_ca_system_score_gemma":0.0007107456,"threshold_uncertainty_score":0.024046838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8068786,0.0033446657,0.14933942,0.0009166896,0.00010208317,0.00075084466,0.022340158,0.00029448862,0.01603314],"genre_scores_gemma":[0.9099789,0.0010540885,0.07256876,0.0000817784,0.00006288144,0.0007938047,0.013002235,0.000047974238,0.0024095257],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9970867,0.00132678,0.00018230868,0.0007279722,0.00053565105,0.00014057929],"domain_scores_gemma":[0.97980416,0.0128476,0.003451011,0.0013338276,0.002046451,0.00051689165],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0034623754,0.0002842948,0.0003024346,0.008927545,0.0007417006,0.0014665275,0.00041906585,0.00046695065,0.0016256534],"category_scores_gemma":[0.017108876,0.00017433759,0.0004172627,0.010369977,0.00042778862,0.0018451035,0.0012515063,0.00030195634,0.00034522804],"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.0002878476,0.00020516409,0.5947158,0.0023374076,0.0007502522,0.0009078009,0.009508652,0.011154711,0.01179581,0.047265626,0.012445449,0.30862555],"study_design_scores_gemma":[0.00006194504,0.00043775793,0.67615676,0.0011360188,0.0007826731,0.001759106,0.014155399,0.11737918,0.007846001,0.056368187,0.123775564,0.00014140873],"about_ca_topic_score_codex":0.007238672,"about_ca_topic_score_gemma":0.014059654,"teacher_disagreement_score":0.9910725,"about_ca_system_score_codex":0.0007942894,"about_ca_system_score_gemma":0.0022186518,"threshold_uncertainty_score":0.018311024},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10362097,0.00031929766,0.893542,0.00022063844,0.000033100674,0.00008164441,0.00042607685,0.0005482808,0.0012079893],"genre_scores_gemma":[0.7765504,0.0002924143,0.21959583,0.000058867558,0.00006902758,0.000112907044,0.0009189749,0.00012671885,0.0022749035],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988973,0.00040926374,0.00006451579,0.0002903702,0.00024790724,0.000090594476],"domain_scores_gemma":[0.99460924,0.0030394965,0.00080072274,0.00058289635,0.00070781255,0.00025978152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010273478,0.0005789541,0.0006567843,0.0045613153,0.00085398136,0.0014185868,0.0009192598,0.0009106312,0.0011678116],"category_scores_gemma":[0.008312091,0.0003842353,0.00081669487,0.0026572302,0.0007706901,0.0027428549,0.001445051,0.0009807644,0.00049799704],"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.0008122785,0.0009538108,0.04614449,0.00084311893,0.0005377047,0.00069587276,0.0018699543,0.25351843,0.043917924,0.12601382,0.009256265,0.5154363],"study_design_scores_gemma":[0.000008802922,0.000030262485,0.002114699,0.00002472146,0.000025268184,0.00012606206,0.00018949315,0.95448685,0.0025495845,0.039078765,0.0013520927,0.000013388858],"about_ca_topic_score_codex":0.002135902,"about_ca_topic_score_gemma":0.0036593492,"teacher_disagreement_score":0.0045613153,"about_ca_system_score_codex":0.0004630108,"about_ca_system_score_gemma":0.0005062821,"threshold_uncertainty_score":0.005433202},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5356011,0.00085976603,0.44713366,0.00076119637,0.000098919634,0.00038134915,0.0032423243,0.00096563634,0.010956023],"genre_scores_gemma":[0.9495623,0.00018570136,0.044796173,0.00004169048,0.00006251348,0.0001849465,0.0018117632,0.00006488649,0.0032900693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899656,0.00032676704,0.000052400777,0.00023448323,0.00026141512,0.00012838701],"domain_scores_gemma":[0.9954265,0.0021793563,0.0007334422,0.00040669413,0.000935075,0.00031902402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012445718,0.0003488478,0.00037131697,0.005177492,0.00089102314,0.001276668,0.00063304487,0.00048773552,0.002245644],"category_scores_gemma":[0.00909795,0.00023229381,0.00052392675,0.0026742546,0.0005673692,0.0020484768,0.0010807548,0.0004563659,0.00048739908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013361083,0.00044454308,0.1415738,0.0009468006,0.0007373437,0.0016399595,0.0062438515,0.20948856,0.03705988,0.2997876,0.023051547,0.27769],"study_design_scores_gemma":[0.000039817915,0.00008446238,0.025604906,0.00005742032,0.00006283072,0.00034263293,0.0013315835,0.8704303,0.004685739,0.08584263,0.011477675,0.000040130555],"about_ca_topic_score_codex":0.004462983,"about_ca_topic_score_gemma":0.0038355594,"teacher_disagreement_score":0.005177492,"about_ca_system_score_codex":0.0008196868,"about_ca_system_score_gemma":0.00039088435,"threshold_uncertainty_score":0.008873999},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05000904,0.0031732537,0.9242445,0.0010497033,0.00023593732,0.0001846953,0.0013811808,0.0004006496,0.019320963],"genre_scores_gemma":[0.5402592,0.0029869906,0.4449712,0.0003701661,0.0005355721,0.0006708297,0.0018129285,0.00023148589,0.008161645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974825,0.001094778,0.00014927985,0.0005392621,0.00054480345,0.00018948338],"domain_scores_gemma":[0.9931398,0.003909929,0.0008647403,0.00087473047,0.0007397662,0.0004711015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002348796,0.0008066657,0.0009742597,0.004858146,0.0014620424,0.0049343104,0.0012462906,0.0012176654,0.0048378576],"category_scores_gemma":[0.010346719,0.00042501403,0.0013938792,0.006829658,0.0018822567,0.006658355,0.0028949014,0.0018938025,0.0010395374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001265604,0.00017802606,0.010455244,0.00044898622,0.0002526181,0.00016841896,0.0019392432,0.025693322,0.0036959853,0.7783365,0.010949563,0.16775551],"study_design_scores_gemma":[0.000011465465,0.00007812436,0.0071087,0.000131525,0.00010981163,0.00028291237,0.0012960283,0.30246225,0.0012774414,0.670587,0.016583579,0.00007114112],"about_ca_topic_score_codex":0.0020063356,"about_ca_topic_score_gemma":0.0023193029,"teacher_disagreement_score":0.0049343104,"about_ca_system_score_codex":0.001248116,"about_ca_system_score_gemma":0.0008324593,"threshold_uncertainty_score":0.01618427},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03326765,0.0014205651,0.92296875,0.0018116963,0.00030754207,0.00018994517,0.00030503876,0.00054671115,0.039182223],"genre_scores_gemma":[0.5099896,0.00606745,0.43655023,0.0022106958,0.0010413311,0.0008950343,0.0017192304,0.0014400776,0.040086325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969613,0.0012790104,0.00009343511,0.0005728212,0.0007366043,0.00035682737],"domain_scores_gemma":[0.9820884,0.011001442,0.0012380099,0.0025260567,0.0019858575,0.001160304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054678796,0.0015417403,0.0013045756,0.0021525454,0.0023999298,0.0022369844,0.0028575202,0.0013621761,0.011393472],"category_scores_gemma":[0.02562158,0.00070429617,0.0019020487,0.0034949535,0.0031563311,0.006179475,0.0038963715,0.0035488817,0.0015649362],"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.0001324042,0.00012934199,0.0016867034,0.0003627939,0.0000723405,0.000272929,0.0006762383,0.17542028,0.0027107713,0.7575599,0.011957553,0.049018696],"study_design_scores_gemma":[0.000024958463,0.00007330819,0.0006362118,0.00007614999,0.000042329037,0.00022776917,0.00023626392,0.50486636,0.0016873559,0.47417152,0.017929154,0.000028566406],"about_ca_topic_score_codex":0.004569763,"about_ca_topic_score_gemma":0.003128442,"teacher_disagreement_score":0.011393472,"about_ca_system_score_codex":0.0025361846,"about_ca_system_score_gemma":0.00168892,"threshold_uncertainty_score":0.038114905},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04208372,0.002602913,0.940302,0.0010660632,0.00027970117,0.00024113682,0.0011862968,0.0007215887,0.011516612],"genre_scores_gemma":[0.6242541,0.0024423313,0.35831943,0.00065456424,0.0011620296,0.0010705648,0.0028432296,0.0007978192,0.008455928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99584574,0.0014229604,0.00020763895,0.0009919659,0.0013025705,0.00022923206],"domain_scores_gemma":[0.9803255,0.012923794,0.0016003784,0.0025886574,0.0017856482,0.00077605346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034858866,0.0007887686,0.0014230588,0.008332791,0.0017281059,0.002882639,0.0020711874,0.0021481928,0.008317831],"category_scores_gemma":[0.033050142,0.00055868225,0.0010902518,0.006031955,0.003278712,0.007480337,0.002842073,0.002742106,0.0018271523],"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.000091426344,0.000086326756,0.003816371,0.0003295405,0.00011104223,0.000116952586,0.00030803235,0.046044324,0.0029167382,0.86964196,0.008037084,0.06850019],"study_design_scores_gemma":[0.000020219724,0.000048334477,0.002229109,0.00008051849,0.000029093057,0.0002729543,0.000119288474,0.24212033,0.0015370785,0.74075043,0.012749222,0.000043451713],"about_ca_topic_score_codex":0.0013709174,"about_ca_topic_score_gemma":0.0011468797,"teacher_disagreement_score":0.008332791,"about_ca_system_score_codex":0.0016063467,"about_ca_system_score_gemma":0.0010044484,"threshold_uncertainty_score":0.027825892},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0472614,0.033465628,0.7123672,0.03312237,0.0016193804,0.0001215263,0.00055534655,0.0001673883,0.17131977],"genre_scores_gemma":[0.59446645,0.032170657,0.3288088,0.0042425846,0.002854463,0.0012162757,0.0010424064,0.000660389,0.034537986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9603186,0.022598628,0.002220864,0.0065979883,0.006810464,0.0014533907],"domain_scores_gemma":[0.89596486,0.0811818,0.005036611,0.006906623,0.008756171,0.0021539934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027738316,0.0017753688,0.0026430967,0.007826312,0.0054208417,0.016710164,0.0032421518,0.004610907,0.009150714],"category_scores_gemma":[0.0903155,0.0014052257,0.0031582443,0.011576321,0.031554516,0.049674828,0.0122893555,0.016488576,0.0021200064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055520654,0.000006630096,0.00016785518,0.000055167056,0.000013952447,0.000022639348,0.0009767889,0.0002280687,0.000048211354,0.99491537,0.0004481279,0.0031116374],"study_design_scores_gemma":[0.0000069040902,0.000011426196,0.00024847733,0.00013248838,0.00001586685,0.00010023684,0.00097357755,0.001823964,0.00013223971,0.981881,0.014655341,0.000018488272],"about_ca_topic_score_codex":0.006908207,"about_ca_topic_score_gemma":0.0042017847,"teacher_disagreement_score":0.027738316,"about_ca_system_score_codex":0.009657785,"about_ca_system_score_gemma":0.0038545853,"threshold_uncertainty_score":0.14669597},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1903604,0.00031735806,0.80146253,0.0012253245,0.000059260583,0.00006505908,0.00009181716,0.0006050197,0.005813215],"genre_scores_gemma":[0.94010335,0.0001432688,0.057217527,0.0002227259,0.000032061012,0.000085049585,0.00007501198,0.00007337692,0.0020477667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958223,0.0001641997,0.000017865801,0.00008737921,0.00006580235,0.00008255385],"domain_scores_gemma":[0.9967938,0.0022870097,0.00037800244,0.00021242391,0.0001416343,0.00018711032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014519755,0.0007377322,0.0008840629,0.00064170687,0.00042147285,0.0009969063,0.0013203154,0.0012335975,0.0015443696],"category_scores_gemma":[0.006747083,0.0005737025,0.0007347731,0.00028547412,0.0021618898,0.00201139,0.0015356496,0.0017455618,0.0001538925],"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.000033536897,0.000041041196,0.00079086534,0.000039430593,0.00003772288,0.000031157117,0.000043081207,0.9557293,0.0010954553,0.034012318,0.00041285114,0.0077332454],"study_design_scores_gemma":[0.0000038920325,0.000007838456,0.000046446705,0.0000023819782,0.0000019832808,0.0000030074923,0.0000028565892,0.98317564,0.00013790555,0.016551238,0.000064592394,0.000002199844],"about_ca_topic_score_codex":0.0040454175,"about_ca_topic_score_gemma":0.005597423,"teacher_disagreement_score":0.0040454175,"about_ca_system_score_codex":0.0016962917,"about_ca_system_score_gemma":0.0009964021,"threshold_uncertainty_score":0.012307465},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042083286,0.00043389326,0.93145394,0.00057975407,0.00014442964,0.00029329525,0.0019789701,0.020956026,0.0020764484],"genre_scores_gemma":[0.38059583,0.00021542986,0.60704786,0.0005195547,0.00016912153,0.0006604471,0.0064263456,0.001053737,0.0033116448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975708,0.00081931986,0.00013272134,0.0006328662,0.0006542281,0.00019010293],"domain_scores_gemma":[0.989096,0.0070822784,0.0008135099,0.0018294653,0.0007678951,0.00041090391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026527327,0.0014658167,0.0019462457,0.00294775,0.0008204588,0.0014773823,0.0039007508,0.0016312809,0.00584463],"category_scores_gemma":[0.019207597,0.00069606316,0.001560083,0.0021299466,0.00095783314,0.0029495864,0.002527155,0.0018345236,0.001841133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020000956,0.000733017,0.020660212,0.00077100436,0.00062371895,0.0013268832,0.00027702792,0.24859229,0.021986106,0.046191186,0.04397929,0.61285925],"study_design_scores_gemma":[0.00009545242,0.00008624394,0.0005250935,0.000008270157,0.000020497238,0.00016294677,0.000025542211,0.9725008,0.0030108872,0.02177145,0.0017761253,0.000016696398],"about_ca_topic_score_codex":0.0029700554,"about_ca_topic_score_gemma":0.0067532975,"teacher_disagreement_score":0.00584463,"about_ca_system_score_codex":0.00087329856,"about_ca_system_score_gemma":0.0018943802,"threshold_uncertainty_score":0.01955223},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41638857,0.0011392896,0.5551269,0.0013386194,0.00011970275,0.00009110762,0.00042641806,0.0003683551,0.025000947],"genre_scores_gemma":[0.9742036,0.0005932322,0.019281508,0.00013828195,0.00012158871,0.00009869719,0.00019854822,0.00009601696,0.0052684303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948895,0.00020077094,0.000013744301,0.00007634532,0.000094893214,0.00012539937],"domain_scores_gemma":[0.9966684,0.0019927586,0.0003414834,0.00031389878,0.00034760937,0.00033579185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083132455,0.0004978831,0.000617253,0.0015300994,0.00085225556,0.0012207715,0.0009267159,0.0009832807,0.004824815],"category_scores_gemma":[0.008168007,0.0003150444,0.00080615655,0.0010227609,0.0015852654,0.0025540993,0.0012784014,0.0013729165,0.00047345],"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.00005968227,0.0000538562,0.001795986,0.000088935565,0.000025555297,0.00015597443,0.00018629724,0.17625916,0.0019459467,0.8093631,0.0025826,0.007482743],"study_design_scores_gemma":[0.0000063183857,0.000016948574,0.00036069157,0.000010952625,0.000007915725,0.00007851874,0.000052204392,0.7001274,0.00043870293,0.29773962,0.001147218,0.000013609993],"about_ca_topic_score_codex":0.0030034776,"about_ca_topic_score_gemma":0.0031484147,"teacher_disagreement_score":0.004824815,"about_ca_system_score_codex":0.0012194552,"about_ca_system_score_gemma":0.0007505428,"threshold_uncertainty_score":0.01614064},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008708593,0.000054977834,0.9974855,0.000068134905,0.000016847516,0.00002935419,0.000020562671,0.000046455552,0.001407238],"genre_scores_gemma":[0.18923378,0.0004441256,0.80255324,0.00016917582,0.00009665951,0.0006267833,0.00015825022,0.0001972373,0.006520788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994122,0.0002792515,0.000018638659,0.000101293976,0.00013869216,0.0000500028],"domain_scores_gemma":[0.9990101,0.00067944365,0.00010344944,0.000049387458,0.00012497668,0.000032650278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016766958,0.0015352257,0.0010539868,0.0011237833,0.00066219113,0.00087773707,0.0012162733,0.0012246228,0.00434225],"category_scores_gemma":[0.003521509,0.00066312926,0.0010303343,0.0011248345,0.00095990644,0.0010230069,0.0014339992,0.002081626,0.000636297],"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.000017276612,0.000018124685,0.00014994363,0.000038850547,0.000029092664,0.000026732852,0.000026917865,0.96056694,0.000750538,0.021831397,0.0007979788,0.015746122],"study_design_scores_gemma":[0.0000032095368,0.000010160945,0.000025871916,0.0000046111313,0.000004705505,0.000006141205,0.0000044215767,0.9927856,0.00014629884,0.0063933167,0.00061267527,0.0000029742898],"about_ca_topic_score_codex":0.004848611,"about_ca_topic_score_gemma":0.0050447583,"teacher_disagreement_score":0.004848611,"about_ca_system_score_codex":0.0013922707,"about_ca_system_score_gemma":0.0016768123,"threshold_uncertainty_score":0.014526308},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42011368,0.0036375145,0.33829594,0.010288042,0.0003658121,0.00030530777,0.0028400663,0.00037703392,0.22377671],"genre_scores_gemma":[0.9248842,0.0016805171,0.062450923,0.00019602907,0.00008019784,0.00016387262,0.00043864438,0.00018633668,0.009919355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986689,0.0009341356,0.00003881178,0.00015684975,0.00013603062,0.00006524803],"domain_scores_gemma":[0.9958423,0.00305541,0.00035069123,0.00041917403,0.00021938457,0.00011301514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017856992,0.00032493423,0.00014642486,0.0035610471,0.0016186968,0.008309949,0.000512699,0.0007308327,0.0054623797],"category_scores_gemma":[0.006790382,0.00025813733,0.00024791976,0.003292629,0.004789145,0.010492754,0.0021884597,0.0009898456,0.00042778742],"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.000046699868,0.000016384382,0.0077305455,0.00023549955,0.000025888836,0.0004970974,0.18101987,0.002482759,0.0017033991,0.7513235,0.0049982076,0.04992014],"study_design_scores_gemma":[0.000016224001,0.000033825756,0.016469916,0.0008259415,0.000041776835,0.00085484853,0.19902523,0.021516567,0.0033481924,0.29197004,0.46583843,0.000058938276],"about_ca_topic_score_codex":0.0056388597,"about_ca_topic_score_gemma":0.008763383,"teacher_disagreement_score":0.008309949,"about_ca_system_score_codex":0.0016833338,"about_ca_system_score_gemma":0.0007157612,"threshold_uncertainty_score":0.018273473},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0878716,0.004023053,0.27337834,0.0015774145,0.0006742385,0.00031582455,0.00841402,0.0012274757,0.622518],"genre_scores_gemma":[0.76727223,0.0041734185,0.08715368,0.00032115495,0.0010812776,0.00040775034,0.007995049,0.00050515897,0.13109024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952686,0.00007545147,0.000021056538,0.0001093669,0.00022188753,0.00004543136],"domain_scores_gemma":[0.9990233,0.000407533,0.000086719025,0.00016470133,0.00022888725,0.00008886639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051687495,0.00044623626,0.00041786613,0.006119442,0.0009969766,0.002198166,0.0005989995,0.00039459177,0.014460133],"category_scores_gemma":[0.003424157,0.00014886091,0.00029391708,0.006665805,0.0005036367,0.0037574659,0.0012197776,0.00054572144,0.0025289946],"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.00009443906,0.00008559094,0.004008989,0.00025585812,0.00005796135,0.000109142864,0.00039414922,0.01356308,0.0036234541,0.61362493,0.056195654,0.30798677],"study_design_scores_gemma":[0.00001756528,0.000059968996,0.009392344,0.0001294156,0.00012014102,0.0005343923,0.00064353517,0.11124957,0.005972717,0.67901707,0.19281322,0.00005011357],"about_ca_topic_score_codex":0.0012044366,"about_ca_topic_score_gemma":0.0020134402,"teacher_disagreement_score":0.014460133,"about_ca_system_score_codex":0.0011164715,"about_ca_system_score_gemma":0.0003455868,"threshold_uncertainty_score":0.048373997},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7870299,0.00043135937,0.20742936,0.0006761484,0.000029658559,0.000050385177,0.0001402465,0.000108509164,0.0041044103],"genre_scores_gemma":[0.99575377,0.00013661131,0.0028074698,0.000011950381,0.000010763947,0.000017000277,0.000035958677,0.00000950475,0.0012168899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997105,0.000105070314,0.000009117056,0.00007212842,0.000037175017,0.00006590613],"domain_scores_gemma":[0.9961158,0.002683251,0.0006036641,0.00011713471,0.0003024693,0.00017771065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012599924,0.0006305673,0.0006161683,0.0011944018,0.0007592921,0.0013293284,0.0012416862,0.00087385677,0.0024408984],"category_scores_gemma":[0.006287393,0.0004811023,0.0009007324,0.0008565684,0.000986074,0.0020724158,0.0011424653,0.0010560418,0.0001228674],"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.00005896023,0.000058285725,0.008323544,0.00006688689,0.00008765567,0.00029702153,0.00026652886,0.9426054,0.00127326,0.042251326,0.00047439584,0.004236795],"study_design_scores_gemma":[0.0000020214834,0.000010619185,0.00090177846,0.0000035650778,0.000013747779,0.000017671142,0.000097613,0.9863819,0.00007608274,0.012404316,0.00008585399,0.0000047349436],"about_ca_topic_score_codex":0.015984047,"about_ca_topic_score_gemma":0.010151424,"teacher_disagreement_score":0.015984047,"about_ca_system_score_codex":0.0012570405,"about_ca_system_score_gemma":0.0008401229,"threshold_uncertainty_score":0.03178203},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5023151,0.0015080909,0.46963313,0.00072508544,0.00009492077,0.00028856666,0.012609933,0.00505067,0.007774563],"genre_scores_gemma":[0.8548896,0.00042415186,0.12856625,0.00010058813,0.00005509883,0.00012828589,0.013439695,0.00014452485,0.002251862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993623,0.00010760925,0.000045186847,0.0001953464,0.00019620842,0.0000934576],"domain_scores_gemma":[0.9977458,0.000844974,0.0004220462,0.00037825882,0.00046271973,0.00014630247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000735125,0.00063591235,0.0005387386,0.003938543,0.00052670774,0.0010855456,0.00080688327,0.00072002376,0.0014175909],"category_scores_gemma":[0.005299632,0.0002578033,0.0004426727,0.0029558672,0.00044796488,0.0020550194,0.0014069363,0.0008474701,0.00078794674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008519565,0.0003903004,0.13903813,0.0007259369,0.0002725043,0.0009689184,0.0011989045,0.19609861,0.034878954,0.024963202,0.01949207,0.58112055],"study_design_scores_gemma":[0.000016861883,0.000049839953,0.01127476,0.000035845,0.000022372222,0.0001986932,0.0002889781,0.95884883,0.005851054,0.017611573,0.0057845693,0.00001661732],"about_ca_topic_score_codex":0.005732409,"about_ca_topic_score_gemma":0.012975558,"teacher_disagreement_score":0.005732409,"about_ca_system_score_codex":0.0006536511,"about_ca_system_score_gemma":0.00069777167,"threshold_uncertainty_score":0.011398077},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58156085,0.017876709,0.319549,0.012569702,0.00033884132,0.0003022154,0.007851872,0.0007871992,0.059163585],"genre_scores_gemma":[0.9481019,0.002430261,0.044526037,0.0005335644,0.00028611577,0.0001697435,0.002005769,0.00024000554,0.001706675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9811716,0.014704617,0.00044150758,0.0016394878,0.0018461441,0.00019656439],"domain_scores_gemma":[0.3596387,0.5932951,0.008606186,0.02824049,0.0089424485,0.0012770214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.031859238,0.0007948709,0.00080206443,0.0044935606,0.0012059726,0.002910895,0.0038175827,0.0012668022,0.009162737],"category_scores_gemma":[0.36843055,0.00054071075,0.00070389564,0.007917626,0.0041552433,0.0147811575,0.0024536627,0.002473969,0.0011449297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081395975,0.0007091197,0.22809945,0.001962766,0.0010841026,0.0003212572,0.0048774774,0.024751984,0.0011851796,0.4326901,0.02399245,0.27951217],"study_design_scores_gemma":[0.000072764014,0.00015911185,0.05978781,0.0007148895,0.00035053902,0.00092222524,0.0052226395,0.108250454,0.0009518838,0.8036268,0.019881474,0.000059391547],"about_ca_topic_score_codex":0.0025615895,"about_ca_topic_score_gemma":0.0022000985,"teacher_disagreement_score":0.031859238,"about_ca_system_score_codex":0.0008042829,"about_ca_system_score_gemma":0.0007672226,"threshold_uncertainty_score":0.16848975},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018229613,0.003979027,0.9412445,0.0010668884,0.00029387404,0.0007366337,0.0131520005,0.017068408,0.004229134],"genre_scores_gemma":[0.15404624,0.001464772,0.8132934,0.0002316521,0.00024821944,0.0013146006,0.020105857,0.0012525967,0.008042644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973616,0.0012255623,0.00016936784,0.00039657866,0.0007010067,0.00014588199],"domain_scores_gemma":[0.99229044,0.0041143023,0.00047210665,0.0015314283,0.0012362591,0.00035545652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004895586,0.0013559879,0.0015793398,0.0070659593,0.001270718,0.0018844114,0.0015915092,0.001538372,0.004462758],"category_scores_gemma":[0.023514237,0.0012458237,0.0014606536,0.0042814678,0.0007281392,0.002749312,0.0023188705,0.0014636542,0.0042327447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049087015,0.0006653175,0.017063355,0.0019545737,0.0009343563,0.00040943196,0.0007112266,0.048800394,0.011789584,0.032395557,0.20347153,0.6813138],"study_design_scores_gemma":[0.00015288239,0.0001212174,0.012144454,0.00020907845,0.00022272531,0.0006460179,0.0003625488,0.8055592,0.010651015,0.13232341,0.03753979,0.00006762843],"about_ca_topic_score_codex":0.0048126634,"about_ca_topic_score_gemma":0.008020096,"teacher_disagreement_score":0.0070659593,"about_ca_system_score_codex":0.0007101456,"about_ca_system_score_gemma":0.0011714932,"threshold_uncertainty_score":0.025890648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031694718,0.00072185526,0.96441346,0.00028500514,0.00008073543,0.00005245174,0.00034954213,0.00052184134,0.0018804636],"genre_scores_gemma":[0.6722782,0.0010661307,0.3153022,0.00033046247,0.00008117834,0.00019463013,0.0022375903,0.00021730064,0.008292309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967265,0.00009058857,0.000022021002,0.00009734504,0.0000854872,0.000031936277],"domain_scores_gemma":[0.9993074,0.00033092554,0.0000753117,0.00010172079,0.00014453096,0.000040172636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075266825,0.0009739246,0.0006828399,0.00078974065,0.0002782598,0.0007016841,0.0012512816,0.00079363456,0.0017510668],"category_scores_gemma":[0.0028408978,0.00030475477,0.00059052045,0.00069433363,0.0005154447,0.0019955358,0.0011583009,0.0017163425,0.0004625855],"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.00010426892,0.00008460842,0.0012305095,0.00015644544,0.000060233928,0.00013766754,0.00009248213,0.7807052,0.0056300415,0.023136074,0.003514185,0.1851483],"study_design_scores_gemma":[0.0000021397602,0.000010035117,0.000058472026,0.000005070363,0.0000024833066,0.0000139702715,0.000005145732,0.9952625,0.00060401496,0.0036502106,0.0003829476,0.000002955123],"about_ca_topic_score_codex":0.004938018,"about_ca_topic_score_gemma":0.006268943,"teacher_disagreement_score":0.004938018,"about_ca_system_score_codex":0.000765227,"about_ca_system_score_gemma":0.00060723495,"threshold_uncertainty_score":0.009818554},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25928628,0.001510452,0.72388333,0.0029184364,0.0002812287,0.00025107403,0.0015130918,0.0007762894,0.0095798345],"genre_scores_gemma":[0.9454274,0.001065742,0.04381748,0.0002135205,0.00012216899,0.00020190765,0.00079330034,0.000070566,0.008287962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911743,0.00035999122,0.000040609084,0.00022985558,0.00013261651,0.00011948064],"domain_scores_gemma":[0.99487793,0.003859847,0.0005321166,0.0001859311,0.0003856206,0.00015857081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019985456,0.0009868912,0.001052569,0.002382653,0.00065179606,0.0017459639,0.0016250653,0.0024239742,0.002361874],"category_scores_gemma":[0.010250923,0.00066642696,0.0012005498,0.0015531871,0.0009937008,0.002119004,0.0010487919,0.0015643433,0.00053089904],"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.00008728703,0.000051163093,0.0039217817,0.00007282833,0.00005634019,0.00017860194,0.00016225611,0.92901874,0.00077859656,0.05115912,0.0016607888,0.012852517],"study_design_scores_gemma":[0.0000069907273,0.0000053247404,0.0001704038,0.0000038195785,0.000005944501,0.0000104828805,0.000009689414,0.9929686,0.000050800765,0.0064616525,0.00030123658,0.0000049833943],"about_ca_topic_score_codex":0.025538338,"about_ca_topic_score_gemma":0.015737088,"teacher_disagreement_score":0.025538338,"about_ca_system_score_codex":0.0018017689,"about_ca_system_score_gemma":0.0011108974,"threshold_uncertainty_score":0.050779343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050171793,0.017256845,0.63587916,0.009695799,0.00092892814,0.000046697212,0.00058492617,0.0006104622,0.2848254],"genre_scores_gemma":[0.70949286,0.020983124,0.0790348,0.0017877092,0.0033538237,0.00023057341,0.0006388264,0.00046665076,0.18401156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995485,0.00013847106,0.000017350174,0.00007932191,0.00018302636,0.00003329345],"domain_scores_gemma":[0.9971872,0.0020900082,0.00017734751,0.00017555304,0.00026039846,0.000109378656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007854761,0.0007931537,0.00074913545,0.0015597474,0.0005695595,0.0025276141,0.000953818,0.0013036887,0.006856225],"category_scores_gemma":[0.0051574307,0.00045404342,0.00042513173,0.0019001847,0.0024765297,0.0040304656,0.0010902445,0.0024520026,0.001174631],"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.0000031829977,0.000007970645,0.00004939988,0.00003718774,0.0000050232566,0.000021346143,0.000043957574,0.006124717,0.00017548168,0.9846985,0.0033842535,0.0054490524],"study_design_scores_gemma":[0.0000010404079,0.000002180118,0.000048555743,0.0000067012957,0.0000017081077,0.000023329805,0.000010544498,0.01493918,0.000055651806,0.9819697,0.0029383765,0.0000030214815],"about_ca_topic_score_codex":0.0013465862,"about_ca_topic_score_gemma":0.001170699,"teacher_disagreement_score":0.006856225,"about_ca_system_score_codex":0.0011526479,"about_ca_system_score_gemma":0.00044858534,"threshold_uncertainty_score":0.022936404},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16558413,0.0016174081,0.7999471,0.0011183807,0.00047736708,0.00032524872,0.0044143284,0.0049626133,0.021553373],"genre_scores_gemma":[0.6905469,0.0006576201,0.29052687,0.00014572425,0.00040315033,0.00020901207,0.0062961373,0.00029987746,0.010914759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995633,0.00006391758,0.000020002968,0.00012625109,0.00016466765,0.000061853105],"domain_scores_gemma":[0.9985857,0.0006342183,0.00012364115,0.000228558,0.00033505747,0.00009275276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007117409,0.0005475756,0.0006406051,0.002029844,0.00059720414,0.001279726,0.0011748474,0.0007855035,0.0033665467],"category_scores_gemma":[0.003889598,0.00020032113,0.00057405006,0.0024658358,0.0002669888,0.002535168,0.0008242708,0.00083667214,0.0018260516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047395832,0.00049594155,0.019181661,0.0003008138,0.00013988954,0.0001827795,0.00029405765,0.060857777,0.019374982,0.02296086,0.041737363,0.8339998],"study_design_scores_gemma":[0.000022112252,0.000059437774,0.004929297,0.000044359782,0.000046508296,0.00012959162,0.00012284392,0.9488445,0.0035758098,0.034449022,0.007756304,0.000020192467],"about_ca_topic_score_codex":0.0034023812,"about_ca_topic_score_gemma":0.0065965275,"teacher_disagreement_score":0.0034023812,"about_ca_system_score_codex":0.0004979726,"about_ca_system_score_gemma":0.0004961792,"threshold_uncertainty_score":0.011262238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011910523,0.00041663053,0.6326362,0.00052673765,0.00028622773,0.00026847536,0.054491594,0.29356018,0.0059033893],"genre_scores_gemma":[0.09923411,0.00089292176,0.7025103,0.00062072265,0.00016020522,0.0018140902,0.15240218,0.03424897,0.008116448],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992902,0.00012188453,0.00006899899,0.0002099937,0.00024088207,0.00006807044],"domain_scores_gemma":[0.9983119,0.0006142987,0.00017062486,0.00051284663,0.00031230508,0.000078108285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014310626,0.0016983608,0.00078781496,0.0032126266,0.0007151544,0.002661014,0.0017806583,0.0006577157,0.0237636],"category_scores_gemma":[0.0077704014,0.00076904445,0.002065997,0.0029635571,0.0005310949,0.0034375747,0.0024452135,0.0018731492,0.009176019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043739405,0.00027449842,0.011685377,0.0021467279,0.0007335587,0.00067532016,0.0012267639,0.064006284,0.015772788,0.07478201,0.512997,0.31526226],"study_design_scores_gemma":[0.00012320097,0.00010496863,0.00752485,0.00021875788,0.00012886219,0.000512016,0.0003655358,0.5871251,0.013376397,0.1455094,0.24488059,0.00013031553],"about_ca_topic_score_codex":0.004530068,"about_ca_topic_score_gemma":0.005865566,"teacher_disagreement_score":0.0237636,"about_ca_system_score_codex":0.00067653175,"about_ca_system_score_gemma":0.0017684873,"threshold_uncertainty_score":0.07949716},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033171363,0.00012750296,0.9940147,0.0002789793,0.00003611467,0.000039408234,0.00017174636,0.0007046837,0.0013097419],"genre_scores_gemma":[0.1925749,0.00047444642,0.7951536,0.00063419377,0.00034414403,0.00039205953,0.0019411744,0.00056405616,0.007921471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968772,0.0007158251,0.00012801935,0.0009309318,0.0011408741,0.00020719002],"domain_scores_gemma":[0.98774594,0.007296633,0.0008555588,0.0021883596,0.0014771646,0.00043643732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036530592,0.0012652103,0.0015413344,0.0027397417,0.001892188,0.0023910701,0.0033809703,0.0036140124,0.006139253],"category_scores_gemma":[0.018196132,0.00080246886,0.0015366502,0.0024131243,0.0028595522,0.0045023193,0.0032987583,0.0039809635,0.0028044067],"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.0003892315,0.00023555974,0.0017300332,0.00076297054,0.00017634266,0.00038417618,0.00048821358,0.39699155,0.013456835,0.33268926,0.024024894,0.22867091],"study_design_scores_gemma":[0.000033205644,0.0000333386,0.00019274054,0.000032825832,0.000015511667,0.000118767784,0.000048948143,0.8415043,0.0026837145,0.1515495,0.0037660496,0.000021179987],"about_ca_topic_score_codex":0.0033173095,"about_ca_topic_score_gemma":0.006627091,"teacher_disagreement_score":0.006139253,"about_ca_system_score_codex":0.002363577,"about_ca_system_score_gemma":0.0029460338,"threshold_uncertainty_score":0.020537853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014487551,0.0004271303,0.98087204,0.00027377062,0.000048759088,0.00026339138,0.000428157,0.00203144,0.0011677856],"genre_scores_gemma":[0.14117937,0.0002449197,0.8527706,0.0002269877,0.000067587454,0.0004231958,0.0023272664,0.00038146565,0.0023786747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904877,0.00021066559,0.000060619346,0.00026657432,0.00031562158,0.00009772346],"domain_scores_gemma":[0.997905,0.000966228,0.00023844982,0.000317705,0.00041165872,0.00016108448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017223369,0.0012295622,0.0017163776,0.004017316,0.001461462,0.0012792107,0.0030467848,0.0016051572,0.0023078618],"category_scores_gemma":[0.007550213,0.0007356065,0.0011091807,0.0036956451,0.00082175614,0.003434084,0.0031645934,0.0014413038,0.0008751424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004490793,0.0003028907,0.0041089808,0.00044817696,0.00028861375,0.00031024063,0.00051365147,0.35230905,0.007493154,0.030875074,0.025192656,0.5777084],"study_design_scores_gemma":[0.00004772648,0.000024438636,0.00016249015,0.00001824115,0.000016025995,0.000066221604,0.00006165848,0.9821216,0.0008526205,0.014467778,0.0021508913,0.000010368358],"about_ca_topic_score_codex":0.009518048,"about_ca_topic_score_gemma":0.016204704,"teacher_disagreement_score":0.009518048,"about_ca_system_score_codex":0.0011780042,"about_ca_system_score_gemma":0.002214857,"threshold_uncertainty_score":0.01892531},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949168,0.000090785885,0.0006149566,0.00013970662,0.000009785688,0.000023016546,0.00026978742,0.000037687794,0.0038974762],"genre_scores_gemma":[0.9967619,0.000074383315,0.0006138711,0.000054581273,0.000010183223,0.00003409858,0.0003899472,0.000026548074,0.0020343577],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994061,0.0001970611,0.00003461584,0.00011586901,0.00013337166,0.00011302343],"domain_scores_gemma":[0.9942888,0.0027621803,0.0010684566,0.00024363707,0.0005089224,0.0011279619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074606703,0.00019540789,0.00019056935,0.001614388,0.0008723447,0.0022762734,0.00029860713,0.0005033999,0.0045800903],"category_scores_gemma":[0.008360679,0.00015204506,0.000115166935,0.0011987443,0.00042470198,0.0021391353,0.0014222716,0.0004322794,0.0013194801],"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.00036750792,0.0001780451,0.8832174,0.00012927584,0.000040847473,0.00043675787,0.047171943,0.0002622905,0.0053850585,0.0017119368,0.0045401263,0.056558773],"study_design_scores_gemma":[0.000024799943,0.00022587164,0.8668515,0.000112319125,0.000043252898,0.0005852277,0.096647695,0.0074222735,0.0017394379,0.0016809016,0.024595173,0.0000715719],"about_ca_topic_score_codex":0.004734996,"about_ca_topic_score_gemma":0.010028552,"teacher_disagreement_score":0.004734996,"about_ca_system_score_codex":0.00029673293,"about_ca_system_score_gemma":0.0002419014,"threshold_uncertainty_score":0.01532191},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13293906,0.0012925778,0.8471406,0.0012543809,0.00007652816,0.00021842506,0.0034384888,0.0006814938,0.012958461],"genre_scores_gemma":[0.7339712,0.0013765981,0.2589567,0.00011016309,0.00011098328,0.00020773198,0.002184086,0.00010231359,0.0029803363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990664,0.0004566764,0.000041709918,0.00020209426,0.00017545147,0.000057706544],"domain_scores_gemma":[0.9923293,0.0058304397,0.000741129,0.0006214657,0.00032139997,0.0001562286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013344416,0.00080161827,0.00052708085,0.008235272,0.0006295462,0.0031027382,0.0007416024,0.00091312383,0.004166493],"category_scores_gemma":[0.012235187,0.00039213223,0.00083340897,0.007274817,0.00049103965,0.0044533047,0.0015827442,0.0011764219,0.00085579336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001886997,0.00045894476,0.097518384,0.0008911843,0.0007419889,0.0005018511,0.00266314,0.21266891,0.007185467,0.15246719,0.008759678,0.5159546],"study_design_scores_gemma":[0.000011325255,0.000037675287,0.012275602,0.00009144218,0.00008404782,0.00012429545,0.0011335311,0.7455776,0.0014141026,0.23299497,0.0062223333,0.000033066186],"about_ca_topic_score_codex":0.0045468975,"about_ca_topic_score_gemma":0.006619258,"teacher_disagreement_score":0.008235272,"about_ca_system_score_codex":0.00070732244,"about_ca_system_score_gemma":0.00089403533,"threshold_uncertainty_score":0.013938248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024593605,0.00065540586,0.0012001803,0.0006950679,0.00036954336,0.00018221603,0.9642617,0.00193217,0.0061101],"genre_scores_gemma":[0.024228455,0.00016391149,0.0021795817,0.00014421366,0.00012176512,0.00021009013,0.9696565,0.00009471536,0.0032006565],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986035,0.00038124627,0.00015952432,0.00026390786,0.00040099438,0.00019093526],"domain_scores_gemma":[0.9969643,0.0007166445,0.00028832268,0.00072631217,0.0010844604,0.00021997614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089788035,0.0013812161,0.00082917867,0.0027059922,0.0010725203,0.0012385495,0.001203604,0.0017431879,0.012029987],"category_scores_gemma":[0.005481858,0.0002969186,0.0006567414,0.003422556,0.00040793963,0.0015783333,0.001960187,0.0015445888,0.021608742],"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.0006139922,0.0002490353,0.0137294475,0.0009438672,0.00010077993,0.00028282605,0.00041624982,0.0015366715,0.0016513948,0.0009302691,0.95195854,0.02758696],"study_design_scores_gemma":[0.0002526572,0.00022306171,0.08623142,0.00039965918,0.00011019968,0.00047758577,0.0022443002,0.01197202,0.0044036363,0.0015570131,0.89193094,0.00019745651],"about_ca_topic_score_codex":0.018710619,"about_ca_topic_score_gemma":0.031040367,"teacher_disagreement_score":0.018710619,"about_ca_system_score_codex":0.0008034758,"about_ca_system_score_gemma":0.0010006736,"threshold_uncertainty_score":0.04024428},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024593605,0.00065540586,0.0012001803,0.0006950679,0.00036954336,0.00018221603,0.9642617,0.00193217,0.0061101],"genre_scores_gemma":[0.024228455,0.00016391149,0.0021795817,0.00014421366,0.00012176512,0.00021009013,0.9696565,0.00009471536,0.0032006565],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986035,0.00038124627,0.00015952432,0.00026390786,0.00040099438,0.00019093526],"domain_scores_gemma":[0.9969643,0.0007166445,0.00028832268,0.00072631217,0.0010844604,0.00021997614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089788035,0.0013812161,0.00082917867,0.0027059922,0.0010725203,0.0012385495,0.001203604,0.0017431879,0.012029987],"category_scores_gemma":[0.005481858,0.0002969186,0.0006567414,0.003422556,0.00040793963,0.0015783333,0.001960187,0.0015445888,0.021608742],"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.0006139922,0.0002490353,0.0137294475,0.0009438672,0.00010077993,0.00028282605,0.00041624982,0.0015366715,0.0016513948,0.0009302691,0.95195854,0.02758696],"study_design_scores_gemma":[0.0002526572,0.00022306171,0.08623142,0.00039965918,0.00011019968,0.00047758577,0.0022443002,0.01197202,0.0044036363,0.0015570131,0.89193094,0.00019745651],"about_ca_topic_score_codex":0.018710619,"about_ca_topic_score_gemma":0.031040367,"teacher_disagreement_score":0.018710619,"about_ca_system_score_codex":0.0008034758,"about_ca_system_score_gemma":0.0010006736,"threshold_uncertainty_score":0.04024428},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073053926,0.0030973451,0.1494532,0.0031146049,0.0005011372,0.0006588977,0.7446944,0.00657459,0.01885195],"genre_scores_gemma":[0.19769171,0.0015342357,0.07820633,0.00088933134,0.00015229663,0.00127549,0.70920974,0.0007337947,0.010307039],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988268,0.0004198825,0.00006109316,0.00037790454,0.00021788372,0.00009647788],"domain_scores_gemma":[0.99754095,0.0010860501,0.0002889132,0.00067951187,0.00033420458,0.00007033143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017254116,0.0013124513,0.00078673876,0.0019850933,0.00072557176,0.0017640146,0.0026646168,0.0014027382,0.0070503233],"category_scores_gemma":[0.009748511,0.00051177153,0.0010866693,0.0032665392,0.0006743473,0.0018493552,0.0010199313,0.0015866584,0.005839776],"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.0003876928,0.00027152727,0.020243622,0.0010738252,0.00032177434,0.0002700823,0.00022022147,0.10212939,0.0016857799,0.050641816,0.7553032,0.06745114],"study_design_scores_gemma":[0.00045974215,0.000107762746,0.016226314,0.00022765972,0.0001669461,0.00073929573,0.000263946,0.4596795,0.0038477865,0.13618122,0.38197738,0.0001223931],"about_ca_topic_score_codex":0.020178031,"about_ca_topic_score_gemma":0.049207684,"teacher_disagreement_score":0.020178031,"about_ca_system_score_codex":0.0017423708,"about_ca_system_score_gemma":0.0008636692,"threshold_uncertainty_score":0.040121138},"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":"other","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12501281,0.10546413,0.066566624,0.19379215,0.0075258464,0.00021104875,0.005256772,0.0012673311,0.4949033],"genre_scores_gemma":[0.8860722,0.025691528,0.008953843,0.0069174855,0.008017967,0.0003259066,0.0016299434,0.0004535228,0.06193739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99585825,0.001562429,0.00028824463,0.00099049,0.0009746895,0.00032591764],"domain_scores_gemma":[0.97501254,0.015750602,0.0027628827,0.0023202056,0.002957099,0.0011966187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004597284,0.0006118171,0.001407051,0.0068232664,0.0026503874,0.0069247307,0.001063755,0.0030436157,0.03559581],"category_scores_gemma":[0.045921136,0.0004980312,0.0009582626,0.0103541,0.0052351775,0.012435714,0.0037364354,0.002627202,0.0046131946],"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.00003361964,0.000027298185,0.002806924,0.00028850496,0.00005612191,0.00011462163,0.0009987996,0.0018153248,0.00017427564,0.8978227,0.045012835,0.050848946],"study_design_scores_gemma":[0.000013664323,0.000014998623,0.0032112803,0.0001399312,0.000016480435,0.00014647529,0.00028321522,0.0018680623,0.000106041654,0.9315351,0.062637724,0.000026950729],"about_ca_topic_score_codex":0.0024433963,"about_ca_topic_score_gemma":0.0015385118,"teacher_disagreement_score":0.03559581,"about_ca_system_score_codex":0.003609544,"about_ca_system_score_gemma":0.0010479335,"threshold_uncertainty_score":0.11907983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20067261,0.0009598176,0.79360634,0.0005938969,0.000050423903,0.000112988506,0.00017381924,0.0005161837,0.0033139535],"genre_scores_gemma":[0.7138524,0.00029780317,0.28414914,0.00013411614,0.000038692844,0.0001638654,0.00042620068,0.00010135461,0.000836458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973678,0.0013357758,0.00008349912,0.00041897182,0.0006173537,0.00017670293],"domain_scores_gemma":[0.98766965,0.009025818,0.0010739117,0.001019268,0.0009846274,0.00022668796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058411458,0.0010509948,0.0009804174,0.002472717,0.0007825893,0.0011544379,0.0016328931,0.0013633182,0.0010154626],"category_scores_gemma":[0.03424062,0.0004478073,0.0007472278,0.0020130742,0.0014515317,0.0026312321,0.001397601,0.0012197351,0.0001828477],"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.00012500893,0.00008306451,0.004497434,0.00011854247,0.00009124591,0.000042912932,0.0000953207,0.93970346,0.0009746091,0.01501739,0.00082931574,0.038421664],"study_design_scores_gemma":[0.000006296028,0.000022702206,0.00035549738,0.000007584471,0.00000665771,0.000015273246,0.000015493213,0.99164855,0.00042390864,0.0073337387,0.00016090716,0.0000033976573],"about_ca_topic_score_codex":0.005478443,"about_ca_topic_score_gemma":0.007402597,"teacher_disagreement_score":0.0058411458,"about_ca_system_score_codex":0.002555601,"about_ca_system_score_gemma":0.0014698075,"threshold_uncertainty_score":0.0308913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.597532,0.0072575966,0.3141865,0.004420524,0.00029626527,0.00011226985,0.00045548307,0.00039047407,0.07534888],"genre_scores_gemma":[0.98389614,0.0013370274,0.0111665325,0.00011093045,0.000110792265,0.000065056614,0.0001086333,0.00004886196,0.003156047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983907,0.000060667993,0.000004893131,0.000030385836,0.000042396485,0.000022499324],"domain_scores_gemma":[0.9995086,0.00021211802,0.000090050904,0.000041790387,0.000057424422,0.00008993813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030202486,0.0003378926,0.0002955136,0.0009931102,0.00075803295,0.0014676773,0.00041794416,0.0007899548,0.003814226],"category_scores_gemma":[0.0016209116,0.00020827672,0.00027233915,0.0003820724,0.0017474073,0.0022001446,0.00068604556,0.0007559976,0.00024361977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017494114,0.000013828284,0.00068140577,0.00008559635,0.000014934795,0.00010218528,0.00021546253,0.0509003,0.0025938335,0.939085,0.0014688455,0.0048209815],"study_design_scores_gemma":[0.000009265232,0.000011135554,0.0009048118,0.00002276094,0.000005362863,0.000057989273,0.00007958696,0.1849647,0.00037682304,0.8102213,0.0033342007,0.000012135348],"about_ca_topic_score_codex":0.0018118541,"about_ca_topic_score_gemma":0.0014292193,"teacher_disagreement_score":0.003814226,"about_ca_system_score_codex":0.0011063985,"about_ca_system_score_gemma":0.00034702674,"threshold_uncertainty_score":0.012759864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01624743,0.0031741406,0.96128726,0.0011047246,0.00034032372,0.00018189699,0.0017854506,0.0012698693,0.014608825],"genre_scores_gemma":[0.43356627,0.0039738873,0.51258695,0.0008689939,0.002934641,0.0017553807,0.008072908,0.0016392746,0.03460176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99626994,0.0011989627,0.00017798968,0.0011189857,0.0010455509,0.0001884561],"domain_scores_gemma":[0.980194,0.013902927,0.0010180778,0.0030225054,0.0012812845,0.00058120966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027686448,0.0012920888,0.002764944,0.009870997,0.0017872978,0.0034255923,0.00460172,0.0024992991,0.015037677],"category_scores_gemma":[0.028024802,0.0011826673,0.0016014408,0.009444673,0.0028733723,0.0105133,0.0034738125,0.0047514304,0.0027318227],"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.00014025065,0.00013816833,0.0020843993,0.00040925006,0.00015985446,0.000104000836,0.00024892864,0.039853882,0.0012414734,0.75833726,0.023627432,0.1736551],"study_design_scores_gemma":[0.000013169238,0.000022349006,0.00077744544,0.000054063432,0.00003612839,0.00013093393,0.000053170617,0.204585,0.00042653826,0.7872766,0.0066026472,0.000021931332],"about_ca_topic_score_codex":0.0022705626,"about_ca_topic_score_gemma":0.0023653395,"teacher_disagreement_score":0.015037677,"about_ca_system_score_codex":0.0022283357,"about_ca_system_score_gemma":0.0008472145,"threshold_uncertainty_score":0.05030608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22937293,0.0016758132,0.7578351,0.0015233225,0.00012887924,0.00018155536,0.0017242224,0.001980962,0.0055772234],"genre_scores_gemma":[0.66452515,0.0006642579,0.3262016,0.0001809958,0.00016247011,0.00020186555,0.0028539875,0.0005309426,0.004678709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984444,0.0005308554,0.000079870275,0.0004344551,0.00036210014,0.00014842396],"domain_scores_gemma":[0.9657675,0.026050989,0.0008968189,0.004934647,0.0017622081,0.00058786693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022320386,0.0010996577,0.0013151867,0.0017423567,0.0011649072,0.002763326,0.0038848198,0.0019117902,0.011203766],"category_scores_gemma":[0.040919654,0.00080837315,0.0010730333,0.002690538,0.0013579717,0.006617665,0.0021704559,0.002314404,0.0019722728],"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.0012638948,0.00060962245,0.02240851,0.000735012,0.00023754357,0.00020723198,0.00055721425,0.45388818,0.0072340076,0.11405366,0.023166971,0.37563816],"study_design_scores_gemma":[0.0000378599,0.000040907904,0.0020886422,0.000026591724,0.000033244887,0.000089299625,0.000096083495,0.93495387,0.0011221525,0.060425065,0.001073414,0.000012866217],"about_ca_topic_score_codex":0.004342347,"about_ca_topic_score_gemma":0.007693918,"teacher_disagreement_score":0.011203766,"about_ca_system_score_codex":0.0016039014,"about_ca_system_score_gemma":0.002202543,"threshold_uncertainty_score":0.037480354},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01227724,0.0010479395,0.91988784,0.005414348,0.0019552573,0.00023073498,0.00099175,0.008266473,0.04992839],"genre_scores_gemma":[0.1297713,0.0016830501,0.7572426,0.0027054646,0.00055413437,0.0004677654,0.0023374066,0.011520831,0.09371743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993048,0.00016504087,0.00003284244,0.00018753963,0.00021528853,0.00009452955],"domain_scores_gemma":[0.9972887,0.0009851787,0.000074338,0.0009283402,0.0005056956,0.00021774808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008861966,0.00093822373,0.00074843905,0.001051433,0.0015879989,0.0022563878,0.0012719696,0.0010061058,0.03965983],"category_scores_gemma":[0.0077243056,0.0008631809,0.0012175617,0.00080432306,0.0014220793,0.0060886447,0.003056346,0.00337394,0.011132712],"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.00016347854,0.00008478955,0.0006381817,0.0006174448,0.00011589136,0.00025646787,0.0007477113,0.024114283,0.011270856,0.46892816,0.17357086,0.31949183],"study_design_scores_gemma":[0.000034300527,0.000049464597,0.0003130415,0.00017820839,0.00007765971,0.00027847424,0.00034330128,0.055612363,0.0046740808,0.72570896,0.21269186,0.00003826263],"about_ca_topic_score_codex":0.002214584,"about_ca_topic_score_gemma":0.004494399,"teacher_disagreement_score":0.03965983,"about_ca_system_score_codex":0.00079286547,"about_ca_system_score_gemma":0.00074560713,"threshold_uncertainty_score":0.13267535},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9197069,0.0011781792,0.040194113,0.0015844362,0.00009361521,0.000056875546,0.00023700722,0.00020787769,0.036740985],"genre_scores_gemma":[0.9963432,0.00013144755,0.0018929143,0.00003815505,0.000029837856,0.0000072468592,0.00003341095,0.000030737778,0.0014931012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988858,0.0005446903,0.000045095363,0.00014744309,0.0001921235,0.00018490438],"domain_scores_gemma":[0.9654291,0.029544184,0.001758238,0.0015361833,0.0009343629,0.00079787965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026270146,0.0003924131,0.00061802915,0.00048627722,0.0004034377,0.002410677,0.00073673844,0.0011176096,0.008962698],"category_scores_gemma":[0.03482236,0.00038199866,0.00037182277,0.0005741844,0.0010521986,0.00451169,0.00073689397,0.0009423596,0.00066316593],"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.0032953823,0.001279271,0.027173739,0.00043297178,0.00035042263,0.000604806,0.00015679793,0.69866055,0.024625223,0.12074804,0.005438522,0.11723434],"study_design_scores_gemma":[0.00042261137,0.000859842,0.01824449,0.00004572851,0.0002677164,0.00038541452,0.00022162529,0.82843304,0.007313273,0.14167564,0.00207933,0.000051276056],"about_ca_topic_score_codex":0.0005722034,"about_ca_topic_score_gemma":0.0007611068,"teacher_disagreement_score":0.008962698,"about_ca_system_score_codex":0.0010290326,"about_ca_system_score_gemma":0.00080572115,"threshold_uncertainty_score":0.029983163},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055194334,0.00049505197,0.82980716,0.000278732,0.00025968824,0.00013799427,0.014821271,0.12676807,0.021912573],"genre_scores_gemma":[0.07997547,0.0014118821,0.81753075,0.00027854618,0.00012076375,0.0009842064,0.03234648,0.02641403,0.04093784],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972993,0.000048323767,0.000021768103,0.000058518173,0.00011815147,0.000023280518],"domain_scores_gemma":[0.99891806,0.0007276436,0.0000478422,0.00016416494,0.00009988245,0.000042322383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073735235,0.0014098046,0.00050720415,0.0021635888,0.00039619466,0.0013833605,0.0011574785,0.00052086095,0.07192563],"category_scores_gemma":[0.004124668,0.0006553855,0.00090185186,0.0013324122,0.00023187557,0.0024197865,0.0021214543,0.00118928,0.01292164],"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.00029835702,0.00018425859,0.0023042113,0.0015596242,0.00015299703,0.0006543227,0.0005698775,0.027734736,0.009722562,0.05314845,0.3034544,0.60021627],"study_design_scores_gemma":[0.00018754666,0.000114926195,0.0016410587,0.00041092883,0.00010482667,0.0014309051,0.00022270039,0.3183707,0.02794723,0.11848189,0.530977,0.00011027118],"about_ca_topic_score_codex":0.000948249,"about_ca_topic_score_gemma":0.0032738894,"teacher_disagreement_score":0.07192563,"about_ca_system_score_codex":0.00026204987,"about_ca_system_score_gemma":0.00047136325,"threshold_uncertainty_score":0.24061525},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1250511,0.009693656,0.46978644,0.032021776,0.0010826308,0.0002843341,0.0008945032,0.00077974953,0.3604059],"genre_scores_gemma":[0.75926375,0.0076641305,0.1922179,0.0021522164,0.00046412923,0.00023277068,0.00053914747,0.00021130416,0.03725464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837273,0.00087012065,0.000042920263,0.00038204613,0.00024918298,0.000082941035],"domain_scores_gemma":[0.99745566,0.0013981644,0.0002363429,0.00039879882,0.0002290085,0.00028203632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012853183,0.00045142593,0.00039017625,0.0020582734,0.002498776,0.0045506908,0.0008031792,0.0011830302,0.009822048],"category_scores_gemma":[0.0046226126,0.00032325275,0.00065934064,0.0019808381,0.0036410727,0.008977263,0.0020198133,0.0015084242,0.001504559],"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.000026645565,0.00007703535,0.0045286748,0.00019604544,0.000044725086,0.00023438585,0.010109215,0.0019974867,0.0006070451,0.89984995,0.013879482,0.06844938],"study_design_scores_gemma":[0.0000108036365,0.000040130006,0.0028344805,0.00018943794,0.00004311657,0.00045211017,0.008765192,0.009216211,0.00049144897,0.8086827,0.16921933,0.00005508213],"about_ca_topic_score_codex":0.00348313,"about_ca_topic_score_gemma":0.0062830476,"teacher_disagreement_score":0.009822048,"about_ca_system_score_codex":0.0013076246,"about_ca_system_score_gemma":0.00060739357,"threshold_uncertainty_score":0.032858014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44867444,0.0012928504,0.49773312,0.002533379,0.0002272944,0.0001137635,0.00041278315,0.00036710492,0.04864519],"genre_scores_gemma":[0.9796371,0.00046074257,0.016304597,0.00021296504,0.00005562396,0.0001099043,0.00013689662,0.000072923416,0.0030093354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992993,0.00025549845,0.000029939658,0.00010678923,0.00015106374,0.00015746766],"domain_scores_gemma":[0.9979747,0.00081589917,0.0003903366,0.000308885,0.0002410194,0.00026912388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012662677,0.00035737787,0.00062712503,0.0010314318,0.0011472666,0.0019262229,0.00079520646,0.0011584366,0.004197306],"category_scores_gemma":[0.007714751,0.0005349929,0.0008131248,0.0004949525,0.002248823,0.0032491079,0.0011434556,0.0014547623,0.00047762253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006285348,0.00002555623,0.0006700437,0.00004419369,0.000019760231,0.00009061455,0.000105427156,0.15012585,0.0019433219,0.8376882,0.0020761183,0.0071480223],"study_design_scores_gemma":[0.000023205674,0.00002039641,0.00043252006,0.000016129103,0.0000050923327,0.000048413876,0.0000634272,0.292503,0.00037745998,0.70522046,0.0012744676,0.000015329546],"about_ca_topic_score_codex":0.0027044911,"about_ca_topic_score_gemma":0.0011505006,"teacher_disagreement_score":0.004197306,"about_ca_system_score_codex":0.0019873192,"about_ca_system_score_gemma":0.00082304724,"threshold_uncertainty_score":0.014419079},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09641761,0.0011017848,0.88733906,0.002987408,0.00012741078,0.000058533627,0.00042463455,0.00033052883,0.011213032],"genre_scores_gemma":[0.95344496,0.0009603351,0.03750542,0.00037537247,0.0002225954,0.000102512546,0.00038716692,0.000108067674,0.0068935934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888533,0.0005484179,0.000033851215,0.00025612925,0.00016211403,0.000114273455],"domain_scores_gemma":[0.9872486,0.008742871,0.0018364167,0.0009999761,0.0006979414,0.00047419887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016502882,0.0006212182,0.00068344374,0.00116942,0.000774772,0.0018883797,0.00084921287,0.001141027,0.0043697758],"category_scores_gemma":[0.0124315275,0.00038267585,0.00049463904,0.00085084984,0.0023465669,0.0031556797,0.0013299488,0.0017918991,0.0005797711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074276155,0.000040577273,0.003262552,0.00013529357,0.00007349221,0.0002863639,0.00027862765,0.3006725,0.00232309,0.660936,0.006273563,0.025643682],"study_design_scores_gemma":[0.000012590486,0.000018285067,0.00066671637,0.000020207648,0.000009534182,0.000084871215,0.000059119895,0.55968374,0.00056273816,0.43627596,0.0025892076,0.000016992464],"about_ca_topic_score_codex":0.0016038296,"about_ca_topic_score_gemma":0.0013269995,"teacher_disagreement_score":0.0043697758,"about_ca_system_score_codex":0.0012142261,"about_ca_system_score_gemma":0.00040209654,"threshold_uncertainty_score":0.014618337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09641761,0.0011017848,0.88733906,0.002987408,0.00012741078,0.000058533627,0.00042463455,0.00033052883,0.011213032],"genre_scores_gemma":[0.95344496,0.0009603351,0.03750542,0.00037537247,0.0002225954,0.000102512546,0.00038716692,0.000108067674,0.0068935934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888533,0.0005484179,0.000033851215,0.00025612925,0.00016211403,0.000114273455],"domain_scores_gemma":[0.9872486,0.008742871,0.0018364167,0.0009999761,0.0006979414,0.00047419887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016502882,0.0006212182,0.00068344374,0.00116942,0.000774772,0.0018883797,0.00084921287,0.001141027,0.0043697758],"category_scores_gemma":[0.0124315275,0.00038267585,0.00049463904,0.00085084984,0.0023465669,0.0031556797,0.0013299488,0.0017918991,0.0005797711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074276155,0.000040577273,0.003262552,0.00013529357,0.00007349221,0.0002863639,0.00027862765,0.3006725,0.00232309,0.660936,0.006273563,0.025643682],"study_design_scores_gemma":[0.000012590486,0.000018285067,0.00066671637,0.000020207648,0.000009534182,0.000084871215,0.000059119895,0.55968374,0.00056273816,0.43627596,0.0025892076,0.000016992464],"about_ca_topic_score_codex":0.0016038296,"about_ca_topic_score_gemma":0.0013269995,"teacher_disagreement_score":0.0043697758,"about_ca_system_score_codex":0.0012142261,"about_ca_system_score_gemma":0.00040209654,"threshold_uncertainty_score":0.014618337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6444945,0.00092597876,0.34890524,0.0004602812,0.000042943637,0.00006625265,0.00043147538,0.0005052915,0.004168081],"genre_scores_gemma":[0.98049986,0.00022990108,0.018181045,0.00009705545,0.000023982437,0.000039597788,0.00025363002,0.000046209814,0.0006287004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993741,0.00013015498,0.000036403046,0.00016234888,0.00014731046,0.00014965297],"domain_scores_gemma":[0.9913765,0.0049626594,0.0013392557,0.0005437434,0.0007744065,0.0010033231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016345326,0.0004285047,0.0008031038,0.0021833729,0.00061177014,0.0015713164,0.001047653,0.0009954021,0.0024505183],"category_scores_gemma":[0.017343884,0.0006444388,0.00043071122,0.0008502225,0.0014176037,0.0030448574,0.0013534043,0.001262779,0.00034979422],"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.001375899,0.0002110752,0.024925113,0.0006189543,0.00017057109,0.0014740954,0.0010397136,0.22825724,0.08228042,0.6077587,0.004690003,0.047198337],"study_design_scores_gemma":[0.000051427738,0.00021694836,0.007164078,0.00008699509,0.00004946097,0.00088263274,0.0003134772,0.5844698,0.011884657,0.3927762,0.0020414253,0.00006290881],"about_ca_topic_score_codex":0.0006603156,"about_ca_topic_score_gemma":0.00063052523,"teacher_disagreement_score":0.0024505183,"about_ca_system_score_codex":0.0012749832,"about_ca_system_score_gemma":0.00026466773,"threshold_uncertainty_score":0.0092507005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08964044,0.00041677622,0.9069752,0.0004201444,0.0000686315,0.000036648074,0.00009244737,0.00057948247,0.0017702942],"genre_scores_gemma":[0.97526324,0.00013892753,0.023014927,0.00010275272,0.000019678388,0.0000486768,0.000092006594,0.000034019497,0.0012857909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996736,0.00008106124,0.000014759392,0.000109727116,0.000063640626,0.000057260313],"domain_scores_gemma":[0.99879056,0.00069550576,0.00018470964,0.00009491775,0.00016075867,0.000073601106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000900128,0.0007886964,0.0008306476,0.000372922,0.00033731488,0.00072441075,0.0012922081,0.0008433002,0.0009960439],"category_scores_gemma":[0.003570285,0.00041605398,0.0004561261,0.0003705104,0.0009401852,0.0013316834,0.0010412798,0.0015355027,0.00018349059],"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.000024971085,0.00001624969,0.00063425687,0.000011654304,0.00001221272,0.000031359312,0.000017409717,0.9854468,0.0005548474,0.0029019585,0.00026739843,0.010080955],"study_design_scores_gemma":[0.00000117287,0.0000047644417,0.00003124292,7.706326e-7,0.0000013674459,0.0000020447492,9.908159e-7,0.9988673,0.00007513114,0.0009858764,0.000028179202,0.0000010897572],"about_ca_topic_score_codex":0.009135301,"about_ca_topic_score_gemma":0.0086395005,"teacher_disagreement_score":0.009135301,"about_ca_system_score_codex":0.00093159283,"about_ca_system_score_gemma":0.0010056923,"threshold_uncertainty_score":0.018164277},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024597693,0.0004976204,0.9707327,0.00029077916,0.00004312992,0.00010308009,0.0005858963,0.00064431113,0.0025047257],"genre_scores_gemma":[0.45019612,0.0014226852,0.5422459,0.0002526776,0.00015691959,0.00027113184,0.0022557813,0.00024919078,0.0029495428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982582,0.0006995002,0.000100816964,0.00036839122,0.0004559172,0.00011726244],"domain_scores_gemma":[0.9927152,0.005246959,0.00061117066,0.0004768141,0.0008002504,0.00014973176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002068549,0.0008472157,0.00067413657,0.003216241,0.0007064487,0.0015646077,0.0010075303,0.0010380717,0.0019501407],"category_scores_gemma":[0.012437588,0.00041126393,0.0012072478,0.0039959354,0.00093249074,0.0029930493,0.0012892676,0.0014190659,0.0004442726],"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.00019583877,0.00017686823,0.0057920814,0.00028786325,0.00014337493,0.00019581991,0.00024991445,0.65411,0.006319134,0.14765774,0.0043706126,0.18050067],"study_design_scores_gemma":[0.000005824119,0.000026677135,0.00057374133,0.000016989035,0.000015895987,0.000044893102,0.000029657447,0.9465267,0.001006761,0.05041891,0.0013208969,0.000013076005],"about_ca_topic_score_codex":0.011734532,"about_ca_topic_score_gemma":0.0067571304,"teacher_disagreement_score":0.011734532,"about_ca_system_score_codex":0.0017526879,"about_ca_system_score_gemma":0.0011404973,"threshold_uncertainty_score":0.023332477},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010750927,0.00010761714,0.99098843,0.00008310735,0.000019141433,0.00010508349,0.00047861616,0.0061708246,0.0009721981],"genre_scores_gemma":[0.04131759,0.00029336303,0.95307374,0.000118673815,0.000058558402,0.0004999419,0.0016720733,0.0012375746,0.0017284014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895775,0.0003010673,0.00008365633,0.00022606172,0.00036347663,0.00006808226],"domain_scores_gemma":[0.9977938,0.0013882425,0.0001770578,0.00031110315,0.000235993,0.00009379251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002438878,0.0016462017,0.0013837492,0.0028567514,0.00079807977,0.0026820695,0.0029082322,0.0013549164,0.0072921836],"category_scores_gemma":[0.01021467,0.0008032405,0.002164804,0.0019276821,0.00075633335,0.0026328056,0.0028946758,0.002070144,0.0021879934],"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.00027387554,0.00025024702,0.0065346123,0.0015944899,0.00055323273,0.00066310354,0.00087883224,0.46617964,0.006859925,0.15647697,0.029266821,0.33046824],"study_design_scores_gemma":[0.000033016007,0.000027816854,0.0004006523,0.00006126613,0.000037069,0.0001618124,0.000051655603,0.930335,0.0021727122,0.04814601,0.018548762,0.000024227884],"about_ca_topic_score_codex":0.003585093,"about_ca_topic_score_gemma":0.011184595,"teacher_disagreement_score":0.0072921836,"about_ca_system_score_codex":0.000984436,"about_ca_system_score_gemma":0.0013309486,"threshold_uncertainty_score":0.02439475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80178523,0.0010791611,0.17496192,0.0018260286,0.00010973378,0.00011051945,0.00058694545,0.0001764724,0.019363992],"genre_scores_gemma":[0.98689276,0.00033768915,0.008039177,0.00009701598,0.00007814396,0.00006201288,0.00020683501,0.000032151616,0.004254381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992931,0.00036003735,0.000021012742,0.00013032068,0.00010699153,0.0000885685],"domain_scores_gemma":[0.9933171,0.0037622952,0.0007431052,0.00046192162,0.00072100374,0.0009945156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016215969,0.0003852454,0.0012240851,0.002252998,0.001305343,0.0023999184,0.0019787136,0.002196672,0.004994122],"category_scores_gemma":[0.011783754,0.00049075653,0.0007766115,0.0010337471,0.0016686972,0.0032278802,0.0015703973,0.00088863267,0.00047965534],"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.00023649754,0.00015809866,0.005814231,0.00018652591,0.00011062092,0.0002953572,0.000511492,0.2059034,0.001853073,0.77109516,0.004651979,0.009183522],"study_design_scores_gemma":[0.000033306565,0.000020874328,0.0007466666,0.000016807404,0.000017872884,0.000095117495,0.00011140754,0.71120393,0.0001304444,0.28689122,0.00071493105,0.000017356546],"about_ca_topic_score_codex":0.006206375,"about_ca_topic_score_gemma":0.0036598674,"teacher_disagreement_score":0.006206375,"about_ca_system_score_codex":0.001089458,"about_ca_system_score_gemma":0.00072140194,"threshold_uncertainty_score":0.016707003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035687923,0.00051267934,0.9602327,0.0003043753,0.00006610952,0.00003626692,0.00036159635,0.00031671554,0.0024816864],"genre_scores_gemma":[0.8352454,0.0013763652,0.15808316,0.0001768273,0.0001729205,0.00015295367,0.0013280426,0.00015171996,0.003312658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970955,0.0001087833,0.000014113557,0.00006401753,0.00007450096,0.000029139348],"domain_scores_gemma":[0.99773127,0.0014847745,0.00027752708,0.00020959752,0.00021613149,0.000080775455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078383455,0.0007144477,0.0005810233,0.0015469748,0.00047657266,0.00069478207,0.0010589139,0.0008071647,0.0019444504],"category_scores_gemma":[0.007388984,0.0003552916,0.0007681817,0.0014851736,0.0004663088,0.0018353846,0.00064167194,0.0011210399,0.00044376214],"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.000022261413,0.000014094377,0.00129646,0.000029783041,0.000019679981,0.000040266947,0.00003313583,0.9736824,0.00040437793,0.011985694,0.0008402311,0.011631667],"study_design_scores_gemma":[6.929091e-7,0.0000022951328,0.000083624014,0.0000022156248,0.0000019889105,0.000006062026,0.0000050366175,0.9958074,0.000040048275,0.0038060632,0.00024315457,0.000001425431],"about_ca_topic_score_codex":0.013931506,"about_ca_topic_score_gemma":0.010724327,"teacher_disagreement_score":0.013931506,"about_ca_system_score_codex":0.0010065343,"about_ca_system_score_gemma":0.00070931105,"threshold_uncertainty_score":0.027700841},"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":"commentary","genre_gemma":"methods","domain_codex":"methods","domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":"methods","domain_consensus":"methods","prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030478386,0.026786989,0.362008,0.52606857,0.0022183093,0.0023256189,0.0009183997,0.0005153687,0.048680417],"genre_scores_gemma":[0.5247435,0.014965959,0.42711484,0.020607408,0.0021629613,0.007836193,0.00053244905,0.00052447047,0.0015122688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.40021026,0.5139257,0.01792883,0.015251463,0.04829825,0.0043855547],"domain_scores_gemma":[0.12072001,0.7906094,0.008898877,0.048540045,0.026471099,0.004760592],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.5178431,0.0028691974,0.0046830424,0.018455785,0.014702232,0.055628106,0.011638341,0.010990223,0.0057393657],"category_scores_gemma":[0.65138066,0.004405585,0.0021343718,0.018980252,0.08723706,0.09593831,0.03147575,0.025162648,0.0020499034],"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.00012770697,0.00043421754,0.0112400465,0.005836183,0.00031547158,0.00044915313,0.081643246,0.0027153783,0.0003277063,0.7456361,0.01669662,0.13457826],"study_design_scores_gemma":[0.00007506741,0.00011389811,0.0015438517,0.0059011825,0.000058447225,0.00016626502,0.042199902,0.005910388,0.0003094274,0.90893376,0.034696802,0.00009108147],"about_ca_topic_score_codex":0.011742121,"about_ca_topic_score_gemma":0.013233211,"teacher_disagreement_score":0.48215687,"about_ca_system_score_codex":0.025053935,"about_ca_system_score_gemma":0.051024757,"threshold_uncertainty_score":0.5945853},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008882009,0.0042279423,0.942286,0.00089043024,0.0006069306,0.00012784057,0.0007878283,0.0012238263,0.04096706],"genre_scores_gemma":[0.13009217,0.006322991,0.77355754,0.0007221369,0.0008724167,0.00039758175,0.0026811035,0.0014930737,0.08386105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931383,0.00018338415,0.000038349113,0.00018398675,0.00022385921,0.000056580615],"domain_scores_gemma":[0.9955094,0.0027673033,0.000126927,0.000767412,0.0006421119,0.00018676248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011798819,0.0007432966,0.0012213989,0.0014182561,0.0011155567,0.0021260565,0.0015430598,0.0014897352,0.013772586],"category_scores_gemma":[0.009973518,0.0007618571,0.0008865813,0.0021621347,0.0010215144,0.0031540226,0.0017114908,0.0030371621,0.007094114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011115954,0.0000551549,0.00064360996,0.00040489263,0.00007055065,0.00011689785,0.00027849354,0.09455521,0.0040742103,0.47457442,0.05637953,0.36873582],"study_design_scores_gemma":[0.000023861407,0.00004749246,0.00032954232,0.00008868607,0.000037002726,0.00020715091,0.000053922715,0.41424754,0.0013015096,0.50395995,0.07968214,0.000021180453],"about_ca_topic_score_codex":0.0014476796,"about_ca_topic_score_gemma":0.002880077,"teacher_disagreement_score":0.013772586,"about_ca_system_score_codex":0.0007727657,"about_ca_system_score_gemma":0.00078253966,"threshold_uncertainty_score":0.046073854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07103029,0.0010232293,0.9099893,0.007143213,0.000095451935,0.000088518114,0.00006905977,0.00071575504,0.009845219],"genre_scores_gemma":[0.85353035,0.00072925416,0.14119798,0.00068154215,0.00012866147,0.00030979942,0.0000666969,0.00029074514,0.003064886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689156,0.0011858118,0.00019172329,0.0005850878,0.00078973826,0.0003561375],"domain_scores_gemma":[0.9824311,0.010188924,0.0017975147,0.0039196457,0.0008207206,0.00084212393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059763202,0.00095318427,0.0012411713,0.0014972392,0.002180985,0.0032385974,0.0017804005,0.0039364165,0.003774669],"category_scores_gemma":[0.034258354,0.0010497731,0.00097348815,0.0008442855,0.006261737,0.010396935,0.004495464,0.003527169,0.0005517929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010473405,0.00008858183,0.0023018082,0.00026479262,0.00014697562,0.00016096672,0.00041119623,0.34682903,0.0026999707,0.59614134,0.0043993713,0.046451356],"study_design_scores_gemma":[0.000029514684,0.00005413268,0.00026404829,0.000055489545,0.00002057847,0.000063846084,0.00010371716,0.24433187,0.0008499155,0.7511109,0.0030901316,0.000025882742],"about_ca_topic_score_codex":0.0011133071,"about_ca_topic_score_gemma":0.0014173243,"teacher_disagreement_score":0.0059763202,"about_ca_system_score_codex":0.0016701627,"about_ca_system_score_gemma":0.001812293,"threshold_uncertainty_score":0.031606197},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50615233,0.00081738783,0.4806241,0.0007267808,0.00010597145,0.000098309094,0.00083179254,0.00078677165,0.009856456],"genre_scores_gemma":[0.90504843,0.00019129891,0.09160039,0.000043855143,0.000024682828,0.0000535749,0.0006095115,0.00011951674,0.0023087172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996437,0.00018097286,0.000013127195,0.0000592897,0.000075150536,0.00002769912],"domain_scores_gemma":[0.9980488,0.0013494097,0.00022594155,0.00011445237,0.0002058972,0.00005545333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073806377,0.0004651727,0.00023005332,0.0019848703,0.0005132344,0.00090828585,0.0004295236,0.00053704367,0.0027315475],"category_scores_gemma":[0.005282221,0.00014142579,0.0002836542,0.0014154669,0.0006075534,0.001228951,0.00097213907,0.0006019151,0.00035753378],"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.0005623248,0.00022881276,0.027636101,0.00047887288,0.00016464105,0.0021503847,0.004452899,0.4979391,0.01541548,0.1217205,0.010663649,0.31858724],"study_design_scores_gemma":[0.000015518113,0.000044078002,0.0070665786,0.000054704145,0.00001907745,0.00025704896,0.0012064434,0.92273706,0.0041645584,0.055440668,0.008956921,0.00003737275],"about_ca_topic_score_codex":0.0036923266,"about_ca_topic_score_gemma":0.005559318,"teacher_disagreement_score":0.0036923266,"about_ca_system_score_codex":0.0005116389,"about_ca_system_score_gemma":0.00026990342,"threshold_uncertainty_score":0.009137988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010599255,0.1595109,0.48501647,0.05169878,0.21508461,0.00035905506,0.001650167,0.00087843795,0.07520236],"genre_scores_gemma":[0.13317095,0.16582614,0.09485044,0.016783604,0.4172829,0.0009038124,0.0028940018,0.0009408068,0.16734734],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884784,0.00029721108,0.00006393319,0.00047482536,0.00021862367,0.00009749578],"domain_scores_gemma":[0.9948325,0.0032950605,0.00027611208,0.00034527658,0.0008760091,0.00037496115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019421227,0.0014012795,0.0020144668,0.0016238481,0.0010344672,0.002433663,0.0014116901,0.0026446295,0.014240734],"category_scores_gemma":[0.005613741,0.0004922788,0.001630357,0.0028053056,0.0012135018,0.002409988,0.0013300229,0.003386748,0.0041956883],"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.00014836492,0.00024022527,0.0024084682,0.0012354063,0.00033663635,0.00081983476,0.00015385798,0.024522351,0.0025712545,0.19013114,0.6122069,0.16522555],"study_design_scores_gemma":[0.000048515518,0.00034665878,0.0030303684,0.00054532173,0.0002346781,0.0017541965,0.000115225055,0.15175854,0.0012568418,0.25726184,0.583517,0.00013084682],"about_ca_topic_score_codex":0.00164443,"about_ca_topic_score_gemma":0.0021762943,"teacher_disagreement_score":0.014240734,"about_ca_system_score_codex":0.0014898862,"about_ca_system_score_gemma":0.00078366353,"threshold_uncertainty_score":0.047640026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049546906,0.00020946913,0.9937424,0.0002774536,0.000026448575,0.000033966797,0.00007167329,0.00013715486,0.00054675527],"genre_scores_gemma":[0.57643694,0.0013854619,0.41428825,0.0003451484,0.0003763263,0.00057319505,0.0009388806,0.0003096057,0.0053461785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884665,0.0004623449,0.000059931328,0.00027253805,0.0002499655,0.00010865044],"domain_scores_gemma":[0.9957509,0.0032390156,0.0003741517,0.00015813719,0.0003324824,0.00014526134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024068293,0.0014657519,0.0015721717,0.00128074,0.0004801576,0.0013705806,0.0019305961,0.0014506674,0.0020721594],"category_scores_gemma":[0.007891951,0.00084707607,0.0012637314,0.0011474234,0.0011442489,0.0020117671,0.0017132196,0.0022024289,0.00046876713],"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.00006149111,0.000056314682,0.001631737,0.000119377466,0.00008784639,0.00016195839,0.000074684496,0.94687605,0.0008441602,0.018185263,0.0016336514,0.030267488],"study_design_scores_gemma":[0.0000014665967,0.0000051562647,0.0000978065,0.0000028195993,0.000002782997,0.000008418363,0.0000056166373,0.996179,0.00006719207,0.0034547953,0.00017248643,0.00000258147],"about_ca_topic_score_codex":0.006286768,"about_ca_topic_score_gemma":0.0040082824,"teacher_disagreement_score":0.006286768,"about_ca_system_score_codex":0.0010272538,"about_ca_system_score_gemma":0.0011532987,"threshold_uncertainty_score":0.012728691},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59915066,0.00055579055,0.39502934,0.00044314124,0.00004412187,0.000054781944,0.0014675593,0.0004546356,0.0027999484],"genre_scores_gemma":[0.9822557,0.00008493728,0.016776782,0.000020365009,0.000032830914,0.000016386091,0.0005310853,0.000016345059,0.00026562385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997154,0.00007572834,0.000010731307,0.00009049659,0.00007028752,0.000037310554],"domain_scores_gemma":[0.99665415,0.0017761348,0.0006775001,0.00031989854,0.00039667927,0.00017567737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056550204,0.00041394462,0.0004224924,0.0019849327,0.00028111623,0.0006189311,0.0005157209,0.0006287588,0.0008351285],"category_scores_gemma":[0.0062159467,0.00017690854,0.00026561876,0.0013242534,0.0005081788,0.0017361069,0.0006448947,0.00065770413,0.00030494801],"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.00059965596,0.00042240348,0.17796196,0.00028114987,0.00022715107,0.00046242954,0.00037589838,0.55969864,0.024028515,0.033253096,0.009155559,0.19353347],"study_design_scores_gemma":[0.000007111023,0.000037676513,0.011027101,0.000017708984,0.000018050569,0.000094287774,0.00006275687,0.96607935,0.0017973457,0.020094967,0.00075201987,0.000011631393],"about_ca_topic_score_codex":0.0018316451,"about_ca_topic_score_gemma":0.0023583397,"teacher_disagreement_score":0.0019849327,"about_ca_system_score_codex":0.0003812439,"about_ca_system_score_gemma":0.00018628065,"threshold_uncertainty_score":0.003641963},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5947624,0.0067128744,0.33519927,0.010986437,0.00017974332,0.0004137522,0.0031041054,0.00021086041,0.048430603],"genre_scores_gemma":[0.91451156,0.0019085527,0.07694157,0.00026108287,0.00011578293,0.0002546898,0.0010780942,0.00003776488,0.0048909136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992281,0.00039146733,0.000036456713,0.00017891327,0.000103115424,0.00006186291],"domain_scores_gemma":[0.9972269,0.0018676394,0.000450494,0.0001513757,0.00017566956,0.00012778952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016667116,0.00036026328,0.0002964827,0.0064114924,0.0014132626,0.00390202,0.00075053633,0.0009874838,0.0030785995],"category_scores_gemma":[0.004591958,0.00025582343,0.00048314856,0.0060898974,0.0019312972,0.004961739,0.0019919684,0.0008243725,0.00031424168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015605449,0.00020611042,0.1473991,0.00082384795,0.00034384563,0.0017852543,0.06126675,0.034937643,0.0024757888,0.53748006,0.0090775285,0.2040479],"study_design_scores_gemma":[0.0000326242,0.00011320438,0.18352762,0.000734926,0.00019156048,0.0011530737,0.08196547,0.25621864,0.0015195496,0.32269225,0.15170209,0.00014894805],"about_ca_topic_score_codex":0.010899171,"about_ca_topic_score_gemma":0.014606655,"teacher_disagreement_score":0.010899171,"about_ca_system_score_codex":0.0021502646,"about_ca_system_score_gemma":0.000999357,"threshold_uncertainty_score":0.021671474},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04235927,0.00017913019,0.9538355,0.00046284526,0.000030258105,0.00006915503,0.0005284001,0.00025801096,0.0022775112],"genre_scores_gemma":[0.6815229,0.00070949516,0.3087151,0.00025399544,0.00008997971,0.0003033102,0.0020244538,0.0003444206,0.006036225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998833,0.0005582567,0.000044229364,0.00031868293,0.00017416647,0.00007165783],"domain_scores_gemma":[0.99243224,0.0043211468,0.0010612445,0.001278874,0.00059049414,0.0003160401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001958763,0.0008669243,0.0007613523,0.0019183517,0.0007544028,0.0018730647,0.0015926166,0.0012070201,0.00350053],"category_scores_gemma":[0.014896683,0.00074812886,0.0010436424,0.0012657938,0.0020173285,0.0036202043,0.002609789,0.00202128,0.0008176706],"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.00012333997,0.00004678529,0.004902088,0.00014001701,0.00008324677,0.00019685333,0.0005446936,0.4890299,0.002187274,0.46434715,0.0035995925,0.034799043],"study_design_scores_gemma":[0.000008281884,0.000010731025,0.000404339,0.000016892707,0.000006977246,0.000036313668,0.000045619487,0.78323996,0.0003818848,0.21453437,0.0013021613,0.000012406677],"about_ca_topic_score_codex":0.00417342,"about_ca_topic_score_gemma":0.0052606626,"teacher_disagreement_score":0.00417342,"about_ca_system_score_codex":0.0018156051,"about_ca_system_score_gemma":0.00096623134,"threshold_uncertainty_score":0.013173163},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08829217,0.0004587023,0.90341604,0.0010134924,0.00004605299,0.00004012739,0.00021210998,0.00016214485,0.00635915],"genre_scores_gemma":[0.91312456,0.0007653784,0.073862866,0.00026532018,0.00015252049,0.0002522925,0.00048745432,0.00028237962,0.010807136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994184,0.00024644478,0.000018083589,0.000095730546,0.00013171589,0.000089538065],"domain_scores_gemma":[0.99704725,0.0018344703,0.00039005975,0.00017051291,0.00030269468,0.0002549633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002384777,0.0007095686,0.0009036736,0.0015760147,0.00060447946,0.0014567502,0.0020558243,0.0018560074,0.0035168084],"category_scores_gemma":[0.0076566776,0.00043866216,0.00071576255,0.00071688177,0.002050934,0.0031040658,0.0016382368,0.0015838855,0.00046418427],"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.00003321344,0.000020951768,0.0005238432,0.000066916116,0.000023853898,0.000110431494,0.00015022578,0.21340044,0.0018626245,0.7795107,0.0011536124,0.0031433185],"study_design_scores_gemma":[0.0000031049956,0.000007123067,0.000097228796,0.000007147899,0.0000034226887,0.000013432253,0.000012124952,0.90069324,0.00014777161,0.09872284,0.00028454242,0.0000079727115],"about_ca_topic_score_codex":0.0049314927,"about_ca_topic_score_gemma":0.0031274564,"teacher_disagreement_score":0.0049314927,"about_ca_system_score_codex":0.0014829519,"about_ca_system_score_gemma":0.0010308679,"threshold_uncertainty_score":0.012612104},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038498894,0.0019445239,0.0063667987,0.034586668,0.007051014,0.00011727445,0.0022594833,0.00060291885,0.94322145],"genre_scores_gemma":[0.08026541,0.0028812943,0.0062028393,0.03523875,0.0025219726,0.00020801781,0.0043235603,0.0008635005,0.8674948],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979462,0.0003205143,0.000057573445,0.00047028478,0.00088377076,0.00032163408],"domain_scores_gemma":[0.9962722,0.00067228643,0.00013859596,0.00047165045,0.0018616673,0.00058361737],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022604095,0.00059040956,0.00036024523,0.0011795368,0.0019317019,0.0051495517,0.0015322391,0.0018032393,0.3329367],"category_scores_gemma":[0.009914957,0.00016547581,0.00067833724,0.00085759826,0.0010595274,0.002861414,0.0022132327,0.0019777778,0.113066405],"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.00023055727,0.00008271284,0.0026662308,0.00047027177,0.000038180082,0.00027282824,0.00090577174,0.00030700964,0.0009050543,0.15880994,0.647127,0.18818448],"study_design_scores_gemma":[0.000018425508,0.000017261786,0.001452272,0.00025366808,0.000017496337,0.000134519,0.0010221784,0.000097492506,0.0006159883,0.024803782,0.9715588,0.000008068469],"about_ca_topic_score_codex":0.0063836793,"about_ca_topic_score_gemma":0.0067243106,"teacher_disagreement_score":0.6670633,"about_ca_system_score_codex":0.0027709142,"about_ca_system_score_gemma":0.003318601,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004589541,0.0019213529,0.006777603,0.0037947476,0.00672739,0.00018777169,0.004246158,0.001428728,0.9744572],"genre_scores_gemma":[0.0015845594,0.0013696987,0.0023494978,0.0014240058,0.0010079832,0.00012252832,0.0031525337,0.00041471276,0.98857445],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99917907,0.00008226588,0.000027964612,0.00016851217,0.000447856,0.000094320734],"domain_scores_gemma":[0.9986463,0.00018328577,0.000043722335,0.00019495936,0.0006313787,0.0003003587],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00084392604,0.00091970304,0.00056646415,0.001794786,0.0014729762,0.0043403106,0.0017864294,0.001656753,0.6635123],"category_scores_gemma":[0.0034602748,0.00030769673,0.00057142763,0.0016356255,0.0005253329,0.002722325,0.0027257602,0.0017481303,0.5751082],"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.000025705422,0.00003384897,0.00010262067,0.00013419228,0.000002460364,0.000039673214,0.000093424445,0.00010358268,0.00031944498,0.02875877,0.8312681,0.13911809],"study_design_scores_gemma":[0.000001954607,0.0000062305407,0.00006505859,0.000048170572,9.904766e-7,0.000025375055,0.000030450068,0.000020803496,0.000068730915,0.0035453578,0.9961844,0.0000023827238],"about_ca_topic_score_codex":0.0022701058,"about_ca_topic_score_gemma":0.00314181,"teacher_disagreement_score":0.3364877,"about_ca_system_score_codex":0.0012994894,"about_ca_system_score_gemma":0.0022392268,"threshold_uncertainty_score":0.47995883},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025410142,0.0039833374,0.008408791,0.0062098606,0.0036511405,0.0005402848,0.016143855,0.001199536,0.95732224],"genre_scores_gemma":[0.014381676,0.005132712,0.007311824,0.00554172,0.0014183454,0.0007986535,0.01750253,0.00073429366,0.9471783],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989924,0.00012783801,0.000039888582,0.00027550908,0.00036707486,0.00019734449],"domain_scores_gemma":[0.9984648,0.00024242418,0.00006934319,0.00018760191,0.00059878064,0.00043694943],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011404419,0.0009466513,0.0005683922,0.0015727406,0.0020785034,0.0036241072,0.0020918606,0.001417726,0.5601613],"category_scores_gemma":[0.004546485,0.0002531356,0.0005245856,0.0016183957,0.00061885465,0.0018803844,0.0024613591,0.0015087209,0.36232644],"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.00022608896,0.00018871353,0.0009019979,0.0004921146,0.000009028254,0.0002198067,0.00039338518,0.00017637051,0.00060683454,0.07619583,0.7183186,0.2022712],"study_design_scores_gemma":[0.000009045673,0.000023811728,0.00025340868,0.00012699509,0.0000036101158,0.000093392904,0.00009166744,0.000032716467,0.00012471576,0.006046686,0.99318933,0.0000047923877],"about_ca_topic_score_codex":0.0051373052,"about_ca_topic_score_gemma":0.0055944994,"teacher_disagreement_score":0.4398387,"about_ca_system_score_codex":0.0015877277,"about_ca_system_score_gemma":0.003487192,"threshold_uncertainty_score":0},"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":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00713227,0.00058340654,0.024893446,0.0011246883,0.0005732693,0.0005449568,0.91531926,0.005251991,0.04457677],"genre_scores_gemma":[0.040486228,0.00091419637,0.02738956,0.00034295165,0.00021008744,0.0010460197,0.89367515,0.00045498533,0.03548076],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986601,0.00022885662,0.000111665555,0.00029875842,0.0006094555,0.00009120728],"domain_scores_gemma":[0.99700195,0.00081711693,0.00020859037,0.0011556068,0.00058790017,0.00022884036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000989435,0.0007241816,0.00045692726,0.00446172,0.0006584787,0.0015486033,0.00088212336,0.0006420274,0.048498206],"category_scores_gemma":[0.007825872,0.00027054906,0.00057723833,0.0038515946,0.00023330106,0.0017143486,0.001297484,0.0008452329,0.039845336],"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.00014699323,0.00015718675,0.0065865205,0.0005620609,0.000078588244,0.00013080446,0.00018744469,0.0033375355,0.0019782837,0.021193966,0.7871825,0.17845817],"study_design_scores_gemma":[0.00002966083,0.000042760177,0.007828339,0.00012303339,0.000032199594,0.00024388713,0.0002585755,0.011988495,0.0022282568,0.017939841,0.95925486,0.00003013789],"about_ca_topic_score_codex":0.005978114,"about_ca_topic_score_gemma":0.010342257,"teacher_disagreement_score":0.048498206,"about_ca_system_score_codex":0.0006649145,"about_ca_system_score_gemma":0.0012115383,"threshold_uncertainty_score":0.16224271},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035931736,0.004444267,0.2197736,0.008817417,0.0037770881,0.00043649,0.0019149515,0.007963275,0.71694124],"genre_scores_gemma":[0.5621977,0.005599489,0.093541734,0.0051064924,0.0020950977,0.0010875098,0.003599147,0.004241052,0.32253182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984353,0.0002969037,0.000047524118,0.00050409744,0.000497029,0.00021917559],"domain_scores_gemma":[0.99462223,0.0013242152,0.00015949803,0.0025621592,0.001042284,0.00028961347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011943334,0.0011629774,0.0010335187,0.0013657211,0.0013842568,0.0028646854,0.0016278512,0.0012890846,0.093125954],"category_scores_gemma":[0.011360317,0.0005175114,0.0006868951,0.0015330039,0.0014215499,0.0072329417,0.0035464258,0.0025425255,0.023157489],"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.00011516029,0.0002120886,0.0010235426,0.00038177025,0.00005896482,0.0002228161,0.00051115354,0.0115757175,0.0090628285,0.5355105,0.14392342,0.2974021],"study_design_scores_gemma":[0.000030744715,0.00009435954,0.0009734606,0.00013529314,0.00004922156,0.00034145976,0.00053075823,0.035371874,0.0047496757,0.6304835,0.3272018,0.00003782574],"about_ca_topic_score_codex":0.0012526183,"about_ca_topic_score_gemma":0.0011400682,"teacher_disagreement_score":0.093125954,"about_ca_system_score_codex":0.0011893156,"about_ca_system_score_gemma":0.0011352532,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22108515,0.00048864784,0.7723485,0.0008034749,0.000106530715,0.00007522649,0.00026216393,0.0013409447,0.0034893588],"genre_scores_gemma":[0.9135314,0.00023500602,0.08376044,0.00007860186,0.000040134757,0.00009091353,0.00031255596,0.00010598228,0.0018448472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997861,0.00007170869,0.000010521298,0.00004680319,0.00005579233,0.00002917225],"domain_scores_gemma":[0.99809295,0.0014405552,0.00015212494,0.000086234504,0.000163537,0.00006459134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006173027,0.00073730946,0.00070443953,0.00067476166,0.00042055358,0.00097428466,0.0010401431,0.0012121917,0.00121917],"category_scores_gemma":[0.004174853,0.00047904695,0.00051185593,0.0005543087,0.00072464795,0.0012487931,0.0006184469,0.0012233934,0.00023233147],"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.000015161825,0.000010462542,0.00022172947,0.000008879588,0.000006639338,0.000015537462,0.0000065721397,0.9947501,0.0004316758,0.0014375924,0.00012247049,0.0029732008],"study_design_scores_gemma":[6.800196e-7,7.578306e-7,0.000013880424,2.2871421e-7,2.5421187e-7,5.1166006e-7,4.2996248e-7,0.99944896,0.00004354301,0.00048095165,0.000009403562,4.3787986e-7],"about_ca_topic_score_codex":0.020814795,"about_ca_topic_score_gemma":0.018035602,"teacher_disagreement_score":0.020814795,"about_ca_system_score_codex":0.0012731252,"about_ca_system_score_gemma":0.0010412531,"threshold_uncertainty_score":0.04138732},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9853644,0.00033438826,0.0003787499,0.0024240476,0.000028040911,0.00003523887,0.0038396167,0.000016032453,0.0075793588],"genre_scores_gemma":[0.9970246,0.0001818594,0.00026737186,0.000118658885,0.000009706445,0.000009712566,0.001588144,0.000005884781,0.00079394295],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985789,0.00019711668,0.00007523017,0.00021885932,0.000508968,0.00042087625],"domain_scores_gemma":[0.98657376,0.003181018,0.0024001924,0.00051901216,0.005359523,0.0019664809],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.002675678,0.00021576337,0.00035453335,0.0031041617,0.0026334783,0.003922837,0.0012213099,0.0007546555,0.0013536292],"category_scores_gemma":[0.02680367,0.00016287582,0.00025146475,0.008814178,0.0016247148,0.001364497,0.0019764542,0.0009174651,0.00016579326],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002227046,0.00005204844,0.95380545,0.000047184913,0.00023287196,0.00018266794,0.0033861834,0.012520794,0.00022853861,0.0055800625,0.0066751107,0.017066339],"study_design_scores_gemma":[0.000018158273,0.00004197063,0.9532747,0.00005452281,0.00009769786,0.00003461205,0.014332458,0.019783542,0.00024286346,0.0013504697,0.010726252,0.00004271463],"about_ca_topic_score_codex":0.9851112,"about_ca_topic_score_gemma":0.98815155,"teacher_disagreement_score":0.99732435,"about_ca_system_score_codex":0.01738951,"about_ca_system_score_gemma":0.026472827,"threshold_uncertainty_score":0.12617028},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028124727,0.001170084,0.9642753,0.0012831842,0.000042650885,0.00003940851,0.00088091585,0.00027383276,0.0039098966],"genre_scores_gemma":[0.6028194,0.0033875974,0.38870364,0.00024194935,0.00021178098,0.00019483123,0.0016556344,0.000121735226,0.0026634082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878293,0.0005811041,0.00006666932,0.00033589845,0.00018798411,0.000045382047],"domain_scores_gemma":[0.9795434,0.01651514,0.0015519975,0.0014370334,0.00060505985,0.00034725998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002616851,0.00093641435,0.0006565912,0.006019894,0.000836541,0.0040007913,0.0010489079,0.001000942,0.0042022457],"category_scores_gemma":[0.02268151,0.00054507056,0.0009172007,0.005209272,0.0020434104,0.009317734,0.0020679121,0.0020186268,0.0004701517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015198001,0.00014897026,0.018530378,0.0006496653,0.0005982121,0.00021408637,0.0017201896,0.1198738,0.0043273056,0.7063807,0.003113964,0.14429079],"study_design_scores_gemma":[0.0000074442924,0.000014264573,0.0024541698,0.000060255916,0.000067392284,0.00006713442,0.00019353467,0.21105829,0.00060416374,0.7819971,0.0034564943,0.000019804967],"about_ca_topic_score_codex":0.004730167,"about_ca_topic_score_gemma":0.005696692,"teacher_disagreement_score":0.006019894,"about_ca_system_score_codex":0.0012888783,"about_ca_system_score_gemma":0.0011175914,"threshold_uncertainty_score":0.014057934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8652838,0.00036673353,0.12372146,0.0007151223,0.000026428042,0.0000542127,0.00048008477,0.0002431112,0.00910904],"genre_scores_gemma":[0.9963343,0.00012840315,0.0017260902,0.000019636784,0.0000050636877,0.00002147316,0.0001439625,0.000012727584,0.0016082656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977416,0.000056027493,0.000009661715,0.00005216936,0.000047107853,0.00006094948],"domain_scores_gemma":[0.9996049,0.00014286948,0.0000801491,0.000020397836,0.00011280984,0.000038847935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005616722,0.00067462726,0.00041576184,0.0010065233,0.0004254003,0.0007730261,0.00089985185,0.0007759819,0.0014204518],"category_scores_gemma":[0.0011827005,0.0002561109,0.000719341,0.0005387582,0.0006451393,0.0011572856,0.00088234985,0.00059628615,0.00011379085],"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.000016872973,0.00000674813,0.0019865786,0.0000083242985,0.000010842487,0.00006937223,0.000027063998,0.99475646,0.00031396453,0.001430969,0.00015233006,0.0012204059],"study_design_scores_gemma":[7.166563e-7,0.0000027959904,0.00039443665,0.0000010983172,0.0000027220606,0.000006092857,0.00001050618,0.9991505,0.000037821108,0.00035863314,0.00003230214,0.0000023828702],"about_ca_topic_score_codex":0.049143888,"about_ca_topic_score_gemma":0.018789459,"teacher_disagreement_score":0.049143888,"about_ca_system_score_codex":0.0015550161,"about_ca_system_score_gemma":0.0008929465,"threshold_uncertainty_score":0.097715676},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11248008,0.0027386367,0.85045314,0.0049563786,0.00079377485,0.00013221243,0.0017757372,0.0012088325,0.025461199],"genre_scores_gemma":[0.90266836,0.0021875238,0.04630087,0.00057433796,0.0002755437,0.00020607415,0.0009839231,0.00024573057,0.046557665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958485,0.00014836411,0.000014775446,0.00014261983,0.000060749648,0.000048649657],"domain_scores_gemma":[0.9980197,0.0012983544,0.00020592439,0.0001573134,0.00021380222,0.000104903724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000890189,0.0008775966,0.0012823237,0.0012533786,0.00055249786,0.0015589991,0.0018938232,0.0029384606,0.007090921],"category_scores_gemma":[0.0061276117,0.0007135604,0.0009844871,0.0012166527,0.0012121507,0.0026011965,0.0009477581,0.0018879583,0.0014341677],"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.00007217446,0.000050531224,0.00065100216,0.00008397589,0.00007246268,0.000094754454,0.000057752783,0.7708113,0.0011709621,0.21065956,0.0035407185,0.012734764],"study_design_scores_gemma":[0.000008664913,0.000008168474,0.00009782487,0.0000050901394,0.000013320438,0.00001611346,0.0000060434913,0.9540252,0.0001407601,0.04490243,0.0007660709,0.000010351257],"about_ca_topic_score_codex":0.009363336,"about_ca_topic_score_gemma":0.00724184,"teacher_disagreement_score":0.009363336,"about_ca_system_score_codex":0.0012812013,"about_ca_system_score_gemma":0.00076620036,"threshold_uncertainty_score":0.023721516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19844323,0.00027119272,0.7960946,0.00032667536,0.000033536442,0.00010068607,0.00018329048,0.0002511566,0.0042956667],"genre_scores_gemma":[0.68455553,0.00045071,0.31082568,0.000066818764,0.00002481249,0.00017121158,0.00022532095,0.00007441288,0.00360551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968207,0.00016422878,0.000014981199,0.00006635126,0.000038958533,0.000033369903],"domain_scores_gemma":[0.9978084,0.0015764885,0.00017294477,0.00016346561,0.00014403558,0.00013466654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010070346,0.0006032987,0.0006831742,0.00093664596,0.00092378503,0.00094742223,0.0008682209,0.0011271798,0.0017313064],"category_scores_gemma":[0.005553761,0.0005072392,0.00089453976,0.00087234174,0.0009430714,0.0015005505,0.0012007917,0.0010208358,0.00025908143],"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.000050004637,0.000033095235,0.0009935789,0.00005600072,0.000028099672,0.0001310537,0.000113835486,0.9484076,0.00203258,0.039631635,0.00023635919,0.008286231],"study_design_scores_gemma":[0.000007689069,0.000017348171,0.000111889545,0.000005088328,0.0000068389886,0.000021495704,0.00001533655,0.9824362,0.00035059816,0.016725862,0.00029555705,0.0000060128546],"about_ca_topic_score_codex":0.0068535726,"about_ca_topic_score_gemma":0.0070320033,"teacher_disagreement_score":0.0068535726,"about_ca_system_score_codex":0.0009980885,"about_ca_system_score_gemma":0.0007959529,"threshold_uncertainty_score":0.01362735},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9858773,0.00043826265,0.0036532497,0.00052236224,0.000009698055,0.000031632342,0.0017456933,0.000043264787,0.0076785972],"genre_scores_gemma":[0.99350536,0.0002512946,0.0019645917,0.000024822355,0.000014587802,0.000048477283,0.0016487449,0.00002795194,0.0025141316],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99969256,0.00009248191,0.000014701162,0.00007430124,0.00006501643,0.000060998525],"domain_scores_gemma":[0.99690944,0.0015564695,0.00075806835,0.00019365623,0.00027734236,0.00030502133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005723046,0.00011041949,0.00022994434,0.0027179064,0.0009508454,0.0020759623,0.00051519694,0.00057723065,0.0030208891],"category_scores_gemma":[0.0051931706,0.00016167124,0.00022181492,0.0040082578,0.0008264249,0.0026315036,0.0012049834,0.00092590216,0.0005349796],"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.0005177341,0.00025375784,0.68507576,0.0002732441,0.0002046776,0.0014056249,0.04730021,0.018654503,0.004626268,0.09109523,0.015509554,0.1350835],"study_design_scores_gemma":[0.000014554636,0.00006190793,0.88590276,0.00013912439,0.000069022455,0.00035926822,0.025931127,0.045041878,0.0009063142,0.02040719,0.021110935,0.000055892786],"about_ca_topic_score_codex":0.01996561,"about_ca_topic_score_gemma":0.032748707,"teacher_disagreement_score":0.01996561,"about_ca_system_score_codex":0.0012339895,"about_ca_system_score_gemma":0.00045162003,"threshold_uncertainty_score":0.03969884},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6226815,0.00040761425,0.37292442,0.00023532817,0.000039197337,0.000100173835,0.00034890074,0.00037795474,0.0028848168],"genre_scores_gemma":[0.97207433,0.00018965574,0.026477395,0.000014741998,0.000012827432,0.00002443774,0.00022961525,0.000010749945,0.00096605415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998611,0.00003393078,0.000005547374,0.00003849036,0.00003409797,0.000026710943],"domain_scores_gemma":[0.99963903,0.00012953533,0.00006169589,0.000033238663,0.00010368402,0.000032729713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003177441,0.00082531926,0.0003199302,0.0017337713,0.00042264,0.00051182305,0.00040568376,0.000534675,0.0006999316],"category_scores_gemma":[0.000773155,0.00019134572,0.0004306402,0.0013152318,0.00038173728,0.0006099083,0.00046315556,0.00030865776,0.00011267494],"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.00020554198,0.00009493226,0.030086517,0.00015052837,0.00008122581,0.0011770594,0.00031317162,0.8670217,0.009628939,0.0069721914,0.0017875406,0.08248074],"study_design_scores_gemma":[0.0000036584127,0.000020938778,0.004446615,0.0000028667982,0.0000140412585,0.00006896292,0.00009641984,0.99338925,0.00080272555,0.0009064158,0.00023877756,0.000009347565],"about_ca_topic_score_codex":0.025273154,"about_ca_topic_score_gemma":0.019090332,"teacher_disagreement_score":0.025273154,"about_ca_system_score_codex":0.0004791282,"about_ca_system_score_gemma":0.00050501834,"threshold_uncertainty_score":0.05025208},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95193714,0.00060764333,0.015216539,0.0018266682,0.00005584622,0.000504296,0.0023652664,0.00036837,0.027118282],"genre_scores_gemma":[0.98000103,0.0003198971,0.008440071,0.00010651412,0.000008588907,0.000062647356,0.0013753225,0.000044770084,0.009641112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891603,0.00019785325,0.000044013264,0.00017630542,0.00032302894,0.00034269833],"domain_scores_gemma":[0.9983485,0.00045673444,0.000080282065,0.00014959594,0.00066085294,0.00030399405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082954374,0.0007270759,0.00047597996,0.0011884567,0.0054407045,0.0016209971,0.0021005925,0.001530635,0.004455375],"category_scores_gemma":[0.0024151225,0.000269142,0.00059352117,0.005386223,0.0016714671,0.0009374512,0.0008888142,0.00075420656,0.00048752312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0010829584,0.0010013485,0.10217661,0.0009579248,0.00045712918,0.015117748,0.007829573,0.6524845,0.007488761,0.041790735,0.040679928,0.12893279],"study_design_scores_gemma":[0.0002571086,0.00053093646,0.12568389,0.00015206168,0.00023248326,0.00095635984,0.033910707,0.7607731,0.0061673527,0.007665651,0.06342081,0.00024947544],"about_ca_topic_score_codex":0.9409819,"about_ca_topic_score_gemma":0.96520084,"teacher_disagreement_score":0.059018075,"about_ca_system_score_codex":0.024576705,"about_ca_system_score_gemma":0.015392938,"threshold_uncertainty_score":0.17831731},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8848359,0.00043664826,0.10945894,0.0003255,0.000023002263,0.00003393072,0.00008950183,0.000056582518,0.0047399644],"genre_scores_gemma":[0.99865913,0.000121602105,0.00075553847,0.000005214272,0.00000630275,0.00000664676,0.000016854892,0.0000034655652,0.00042525798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999864,0.000036108726,0.000007073613,0.00003128322,0.000029888775,0.000031715404],"domain_scores_gemma":[0.9992163,0.00028323612,0.00026971812,0.00005018647,0.00012329826,0.00005731004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003836345,0.00033407722,0.00028827094,0.00072204944,0.0004382684,0.00050260633,0.00042674103,0.00040230667,0.00094183587],"category_scores_gemma":[0.001909409,0.00019878564,0.00057019206,0.00044875877,0.00066290086,0.0010934377,0.0004583295,0.00042813295,0.000059678583],"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.0000673363,0.000040777042,0.045865096,0.00009988761,0.00009779618,0.00090830086,0.0006141975,0.89131457,0.0065459497,0.04287988,0.00067400193,0.010892227],"study_design_scores_gemma":[0.0000031401014,0.00002276483,0.0080639515,0.00000623182,0.000015718215,0.00010184001,0.000099762765,0.98409814,0.00030034495,0.007067146,0.00020874562,0.000012232816],"about_ca_topic_score_codex":0.0069947415,"about_ca_topic_score_gemma":0.0033905485,"teacher_disagreement_score":0.0069947415,"about_ca_system_score_codex":0.00061819144,"about_ca_system_score_gemma":0.00037724266,"threshold_uncertainty_score":0.013908088},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1337144,0.0011912744,0.7979147,0.0024861153,0.0004972619,0.00013852757,0.0023010387,0.00072085124,0.061035793],"genre_scores_gemma":[0.86002666,0.0009582598,0.07152791,0.0005796953,0.00033392067,0.0005133169,0.0010802659,0.00042590176,0.06455415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996074,0.0001428249,0.000015823158,0.00007700197,0.000076572185,0.000080334634],"domain_scores_gemma":[0.99696594,0.0022897467,0.0001517458,0.00012441089,0.00024695054,0.00022121563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086472847,0.00066038704,0.001287121,0.0009182645,0.0009867667,0.001719464,0.0028392964,0.0026184232,0.009627685],"category_scores_gemma":[0.004744691,0.0007720984,0.0015160613,0.0010156033,0.0013501188,0.0013228675,0.0014866167,0.0016376371,0.0013083807],"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.000017583689,0.00002211601,0.0007004021,0.000034118773,0.000021051625,0.000055550776,0.000097494274,0.94459033,0.000319749,0.050897907,0.0009939485,0.0022496681],"study_design_scores_gemma":[0.000002802968,0.000002720318,0.00006778224,0.0000028460386,0.000003547571,0.000006798574,0.000010467042,0.99442744,0.000044682485,0.0050396086,0.00038880765,0.0000025769627],"about_ca_topic_score_codex":0.039282013,"about_ca_topic_score_gemma":0.026921723,"teacher_disagreement_score":0.039282013,"about_ca_system_score_codex":0.001963136,"about_ca_system_score_gemma":0.0013978978,"threshold_uncertainty_score":0.07810676},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93915874,0.00045588033,0.054699786,0.0010160523,0.00005011502,0.00004113191,0.00040294637,0.00010037683,0.00407494],"genre_scores_gemma":[0.99630946,0.00017916488,0.0018159928,0.000031032985,0.000015129579,0.000024058203,0.00014047895,0.000008293298,0.0014763713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984074,0.000040572962,0.0000053519157,0.000044214834,0.000023755996,0.000045373305],"domain_scores_gemma":[0.9989748,0.0006566385,0.00014215811,0.000032523327,0.00013948485,0.00005442084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073723076,0.0003755016,0.00039963308,0.0009265694,0.0006283248,0.0008212235,0.00079107156,0.00065741426,0.0011323856],"category_scores_gemma":[0.0024509926,0.00025888436,0.0004882896,0.0006021776,0.00050097174,0.0014758264,0.00051104184,0.00058935344,0.00012569035],"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.00004221644,0.000044729317,0.016562916,0.00004267678,0.000039049264,0.0001612123,0.00016120324,0.95896304,0.0009736005,0.01755763,0.00093382335,0.0045179343],"study_design_scores_gemma":[0.0000010719358,0.0000039986176,0.000972979,0.0000011441643,0.0000056721733,0.0000053544068,0.000018133669,0.9979001,0.00004811784,0.0009793658,0.0000618456,0.000002215507],"about_ca_topic_score_codex":0.07629007,"about_ca_topic_score_gemma":0.036703177,"teacher_disagreement_score":0.07629007,"about_ca_system_score_codex":0.0015903384,"about_ca_system_score_gemma":0.0016383888,"threshold_uncertainty_score":0.15169203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9789408,0.00019579008,0.01817599,0.00026995412,0.0000725035,0.00005581885,0.00077418826,0.00032668034,0.0011883833],"genre_scores_gemma":[0.98856586,0.00009131871,0.009788859,0.000034991837,0.000020645282,0.000043816744,0.00088699424,0.00006035683,0.0005071767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976006,0.0008928287,0.0001365708,0.0006150538,0.0005415718,0.0002134609],"domain_scores_gemma":[0.92385095,0.06101706,0.0029585138,0.0061565214,0.0046989936,0.0013179904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042851367,0.00075558375,0.0004700141,0.0009963139,0.0008409234,0.0008305031,0.0011027482,0.0010429015,0.0029969325],"category_scores_gemma":[0.049243294,0.0003185931,0.0003528683,0.0010374996,0.0009381084,0.0023836982,0.0009485603,0.0013512482,0.00059380435],"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.007626745,0.0075853653,0.05957494,0.0013728965,0.00054006133,0.0003924414,0.0005422418,0.44171357,0.34995577,0.008204848,0.005421642,0.11706945],"study_design_scores_gemma":[0.00011102081,0.0016650391,0.012993607,0.000032516436,0.00006811692,0.000117476695,0.00012020433,0.8851952,0.09531126,0.0038717785,0.0004705171,0.000043352535],"about_ca_topic_score_codex":0.0025569396,"about_ca_topic_score_gemma":0.0024679713,"teacher_disagreement_score":0.0042851367,"about_ca_system_score_codex":0.0005357657,"about_ca_system_score_gemma":0.0006628863,"threshold_uncertainty_score":0.022662282},"labels":[],"label_agreement":null},{"id":"W4402162138","doi":"10.1093/comnet/cnae035","title":"Performance of community detection algorithms supported by node embeddings","year":2024,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Community structure; Partition (number theory); Cluster analysis; Algorithm; Embedding; Complex network; Artificial intelligence; Mathematics","score_opus":0.01644240105669042,"score_gpt":0.28135729733893694,"score_spread":0.2649148962822465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402162138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9297717,0.0013399855,0.060542617,0.00059032446,0.000256035,0.00014883588,0.00044101244,0.0037962075,0.003113148],"genre_scores_gemma":[0.94106495,0.00011627705,0.05706504,0.000060462193,0.000036834845,0.000036922596,0.00093008997,0.00009613091,0.0005933786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598604,0.0014314791,0.00033813049,0.0008710151,0.00095176086,0.00042159163],"domain_scores_gemma":[0.97877914,0.013969011,0.001407694,0.001892895,0.0028557747,0.0010955371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052960315,0.0014911196,0.0018009063,0.0028000667,0.0009799827,0.0020827972,0.0020433958,0.0022372387,0.0010491073],"category_scores_gemma":[0.025209514,0.00048724897,0.0006883682,0.0016998604,0.0008091099,0.0030706222,0.0018535559,0.0013133342,0.0005261966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0068732644,0.0013779224,0.025272677,0.00039638852,0.00065976323,0.00018255333,0.00029913927,0.6718979,0.01760548,0.0040422063,0.006345135,0.26504764],"study_design_scores_gemma":[0.000041622214,0.00013285491,0.0006632079,0.000006767046,0.000012198481,0.000025739946,0.000041320687,0.9955481,0.002810876,0.00060071924,0.00010731721,0.000009262812],"about_ca_topic_score_codex":0.007876241,"about_ca_topic_score_gemma":0.0044438397,"teacher_disagreement_score":0.007876241,"about_ca_system_score_codex":0.0014196187,"about_ca_system_score_gemma":0.0014452793,"threshold_uncertainty_score":0.028008461},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027504356,0.00020209959,0.99456763,0.00053055916,0.00002791775,0.00007657971,0.00037915944,0.00023688302,0.0012287612],"genre_scores_gemma":[0.10731007,0.00080460234,0.88838065,0.00021111303,0.00005383954,0.0004638725,0.0013207255,0.000097725206,0.0013573684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962708,0.0016390298,0.00043564057,0.0005760451,0.00086673663,0.00021170446],"domain_scores_gemma":[0.99394846,0.0034772477,0.0006282115,0.0010323443,0.0006600466,0.00025360816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004939696,0.0008419084,0.00084330415,0.004199154,0.0015566635,0.005210401,0.0024298977,0.001208537,0.0016267977],"category_scores_gemma":[0.013402488,0.00077297084,0.0031815458,0.0048271534,0.0020461446,0.009387259,0.004375202,0.0026879022,0.0005360653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005673758,0.000091079266,0.002319158,0.00027032182,0.00022624974,0.00030522066,0.0018061363,0.15759408,0.0016110995,0.75826186,0.0031388386,0.074319154],"study_design_scores_gemma":[0.000008886762,0.000013429659,0.0003442689,0.0000822693,0.000058879945,0.00008395698,0.00030517395,0.49673334,0.00053065486,0.48669216,0.015113822,0.000033191463],"about_ca_topic_score_codex":0.021980131,"about_ca_topic_score_gemma":0.032381058,"teacher_disagreement_score":0.021980131,"about_ca_system_score_codex":0.0034111477,"about_ca_system_score_gemma":0.003382137,"threshold_uncertainty_score":0.04370439},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48954356,0.0058979862,0.3692239,0.019138275,0.00089466694,0.00020780055,0.0014355718,0.00042758437,0.113230675],"genre_scores_gemma":[0.9405119,0.003528127,0.009971808,0.00072821806,0.0005047939,0.00010500154,0.0001686707,0.000093590286,0.04438794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993654,0.00035295103,0.00001643736,0.00008664867,0.000062302934,0.00011626287],"domain_scores_gemma":[0.9899575,0.0085655935,0.00059168687,0.0001948729,0.00032208508,0.00036830024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021152194,0.0010754653,0.0014759733,0.0011298788,0.0009913708,0.0029666133,0.002438472,0.0053101643,0.0075683175],"category_scores_gemma":[0.016875882,0.0008174002,0.000935037,0.0012343298,0.0022029663,0.0053805728,0.0013914985,0.0027793122,0.0008395739],"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.00026996672,0.000252194,0.0030255737,0.00030748948,0.00015024994,0.0009033267,0.00063106016,0.54465944,0.002695528,0.42075717,0.010005351,0.016342731],"study_design_scores_gemma":[0.000067312416,0.00008536828,0.0008038199,0.000033896427,0.00007251216,0.00016307863,0.00012216867,0.9030381,0.00016594272,0.09413177,0.0012791329,0.00003695585],"about_ca_topic_score_codex":0.0067970646,"about_ca_topic_score_gemma":0.0033292798,"teacher_disagreement_score":0.0075683175,"about_ca_system_score_codex":0.0013214118,"about_ca_system_score_gemma":0.00080368336,"threshold_uncertainty_score":0.025318563},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028866013,0.0018738171,0.8614802,0.0015620996,0.0007810804,0.00015577207,0.0032265384,0.0026056294,0.12542833],"genre_scores_gemma":[0.15993087,0.005631801,0.49884966,0.0019680506,0.0018488918,0.0010424504,0.01951132,0.0022418536,0.30897516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991054,0.00016949173,0.000031099335,0.00041210378,0.00020364569,0.00007824212],"domain_scores_gemma":[0.99838734,0.00068110484,0.00007762888,0.0004219951,0.00035025016,0.00008176536],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00090249826,0.0012337198,0.000952881,0.0017667826,0.001026192,0.0019599258,0.0018388018,0.0009686176,0.056078494],"category_scores_gemma":[0.004858547,0.0006149228,0.0013154617,0.0017493931,0.000978022,0.002986707,0.0019453596,0.0031629738,0.027566066],"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.00009008906,0.00009104059,0.00081011606,0.00031311935,0.0000817816,0.00008627371,0.00008226039,0.029403305,0.002105338,0.4420965,0.13138624,0.39345396],"study_design_scores_gemma":[0.00002702587,0.000031983345,0.0005210573,0.00013458816,0.000049908445,0.00015604282,0.00004634209,0.15620078,0.003169155,0.69004434,0.14959644,0.000022350046],"about_ca_topic_score_codex":0.0015475744,"about_ca_topic_score_gemma":0.003090332,"teacher_disagreement_score":0.9439215,"about_ca_system_score_codex":0.0012289943,"about_ca_system_score_gemma":0.0009060058,"threshold_uncertainty_score":0.18760127},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57680297,0.00035348794,0.41938064,0.00023477593,0.00003146772,0.000117403906,0.0006360144,0.00041891471,0.0020242378],"genre_scores_gemma":[0.950046,0.000067301546,0.04918295,0.00003720475,0.000015500673,0.00010670799,0.0002515752,0.000032832013,0.00025996807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988022,0.00043881012,0.00007737245,0.00033913585,0.00024631585,0.00009613229],"domain_scores_gemma":[0.99455184,0.0025522585,0.0015865419,0.0006672842,0.00026664056,0.000375407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034196312,0.0006652169,0.0006583689,0.0031889859,0.00070797355,0.0014300586,0.0014165795,0.0013120082,0.0014764351],"category_scores_gemma":[0.013000051,0.00033065357,0.0013347301,0.0018378699,0.0016345263,0.0024278827,0.0018805716,0.0011317121,0.00015359637],"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.0004926687,0.00018429235,0.108702876,0.00030900034,0.00070844195,0.00030747103,0.00091592205,0.7770207,0.022672825,0.042014558,0.00055040524,0.04612096],"study_design_scores_gemma":[0.000015340927,0.00025887866,0.03394018,0.000017487871,0.00005210195,0.00014729504,0.00036071028,0.941058,0.0017617418,0.021460477,0.000862034,0.00006580553],"about_ca_topic_score_codex":0.005844633,"about_ca_topic_score_gemma":0.0048090476,"teacher_disagreement_score":0.005844633,"about_ca_system_score_codex":0.0012536896,"about_ca_system_score_gemma":0.0005799933,"threshold_uncertainty_score":0.018085003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035711017,0.0023870661,0.97631353,0.0011579229,0.00026653186,0.000051989562,0.00020447248,0.000036385918,0.016010957],"genre_scores_gemma":[0.3906043,0.016168712,0.5448188,0.0017474006,0.003574503,0.0009857164,0.0010173352,0.00052031653,0.040562943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776924,0.0011361898,0.00010922437,0.0003120737,0.0005190884,0.00015421447],"domain_scores_gemma":[0.99362695,0.004799738,0.000383938,0.0002534309,0.0007547948,0.00018127164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036208834,0.002198553,0.001314038,0.0018182625,0.00094973994,0.003011391,0.0021584046,0.002112004,0.0048613283],"category_scores_gemma":[0.013386072,0.0008963503,0.0018400617,0.0025961415,0.002818746,0.0050779115,0.0027330988,0.0046334793,0.0007351096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031496274,0.00005482784,0.00033750405,0.0002252873,0.00005057851,0.00007900572,0.00015741904,0.13745561,0.0005868421,0.82931006,0.005649669,0.026061663],"study_design_scores_gemma":[0.000010060297,0.000017359294,0.0001277719,0.000045110613,0.000025122086,0.00003759802,0.000036825128,0.5982305,0.00023605477,0.39645568,0.0047627226,0.000015225449],"about_ca_topic_score_codex":0.005638082,"about_ca_topic_score_gemma":0.00722554,"teacher_disagreement_score":0.005638082,"about_ca_system_score_codex":0.0025672037,"about_ca_system_score_gemma":0.0013921055,"threshold_uncertainty_score":0.019149244},"labels":[],"label_agreement":null},{"id":"W4403587905","doi":"10.1093/comnet/cnae041","title":"Modularity based community detection in hypergraphs","year":2024,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Modularity (biology); Computer science; Theoretical computer science; Evolutionary biology","score_opus":0.02080883243451563,"score_gpt":0.28173336459266696,"score_spread":0.2609245321581513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403587905","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01959198,0.00017665981,0.9791093,0.00008328973,0.000016518969,0.00004903823,0.000030543604,0.0005647082,0.0003779735],"genre_scores_gemma":[0.40360403,0.00013112539,0.5940376,0.00013287477,0.000050399296,0.0001353155,0.00022386531,0.00019400063,0.0014908295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836594,0.0006120592,0.000051655075,0.00048352825,0.0003709405,0.000115802846],"domain_scores_gemma":[0.9956683,0.0021481055,0.0005414962,0.0005929271,0.00081079087,0.00023844757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021397064,0.00086902874,0.0012620786,0.0035745285,0.0008888752,0.0012915885,0.0020680104,0.0014616436,0.0014861759],"category_scores_gemma":[0.007844072,0.00053436344,0.00092719455,0.0018025073,0.0012780196,0.0025100184,0.0022745002,0.0012138197,0.0005138203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033962211,0.00020259139,0.0051468303,0.00028008904,0.00030635932,0.0003561929,0.00037124386,0.5567812,0.036658976,0.038260654,0.003369406,0.35792688],"study_design_scores_gemma":[0.000011924968,0.000024258152,0.00045081403,0.000008607248,0.000008752636,0.00004773778,0.000019718012,0.98143744,0.0035277905,0.013896901,0.000554816,0.0000111647905],"about_ca_topic_score_codex":0.0025475684,"about_ca_topic_score_gemma":0.0027351193,"teacher_disagreement_score":0.0035745285,"about_ca_system_score_codex":0.0011167858,"about_ca_system_score_gemma":0.0009470612,"threshold_uncertainty_score":0.011315942},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80325246,0.0025228662,0.18557476,0.00027991534,0.00016441195,0.0002765094,0.0016996282,0.0025415868,0.0036878546],"genre_scores_gemma":[0.94834954,0.00019068689,0.049220886,0.000033166038,0.00006374036,0.00005508047,0.0012725111,0.00013063541,0.0006837685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99383944,0.0030056129,0.00036014407,0.0009776276,0.0015086256,0.00030850907],"domain_scores_gemma":[0.9541341,0.03570093,0.002436235,0.003300551,0.0035882676,0.0008398589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067317165,0.0014446339,0.00129418,0.0065989555,0.0010339514,0.0017096879,0.0020763197,0.0021754827,0.0011922318],"category_scores_gemma":[0.042349998,0.00041176076,0.0010680732,0.0036115253,0.0006572664,0.0023728025,0.0013451857,0.0007997425,0.0005005849],"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.0033490576,0.0012580905,0.20110725,0.001543273,0.0035936038,0.0004393121,0.0010676185,0.37453842,0.026853662,0.006673329,0.006437719,0.3731388],"study_design_scores_gemma":[0.00005902221,0.0005142947,0.033387035,0.00005215402,0.0003344051,0.0005708117,0.00021672274,0.95097065,0.009875504,0.003110905,0.0008045748,0.00010400117],"about_ca_topic_score_codex":0.0058677164,"about_ca_topic_score_gemma":0.008530095,"teacher_disagreement_score":0.0067317165,"about_ca_system_score_codex":0.0007171107,"about_ca_system_score_gemma":0.0007347629,"threshold_uncertainty_score":0.03560114},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020883992,0.00050381717,0.966999,0.0003640383,0.00007697861,0.00021429718,0.000728544,0.0060716085,0.0041577257],"genre_scores_gemma":[0.13816643,0.00025560203,0.8534777,0.0002829726,0.000052421106,0.00035021204,0.0019936222,0.0010244647,0.004396558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985808,0.00039971192,0.000056619403,0.00038395936,0.00044484774,0.00013406649],"domain_scores_gemma":[0.9960892,0.0019671547,0.0004083287,0.00074101985,0.0006044418,0.00018986748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028832436,0.001909648,0.0016082956,0.0032893694,0.0014794891,0.0020165883,0.002981119,0.0019551606,0.005755802],"category_scores_gemma":[0.012543721,0.0009759979,0.0013284702,0.0021433104,0.0013264315,0.0041637523,0.0031211965,0.0018231502,0.0022838297],"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.00037250918,0.00020354959,0.004902973,0.000583716,0.00029466354,0.00019261087,0.0004763281,0.6077098,0.007344811,0.05781842,0.031906202,0.28819442],"study_design_scores_gemma":[0.00004172207,0.000025110028,0.00030244215,0.000030143361,0.00001593069,0.00007972374,0.000045132885,0.9607446,0.0018265444,0.033930022,0.0029426562,0.000015902213],"about_ca_topic_score_codex":0.009570743,"about_ca_topic_score_gemma":0.012871749,"teacher_disagreement_score":0.009570743,"about_ca_system_score_codex":0.0022029614,"about_ca_system_score_gemma":0.0032049837,"threshold_uncertainty_score":0.019255102},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015515736,0.00021660175,0.97676736,0.0005313283,0.00006446784,0.000060524624,0.000267581,0.00069406617,0.0058822697],"genre_scores_gemma":[0.3506803,0.00078269193,0.6367476,0.00032443937,0.00020485732,0.00041748484,0.0013388532,0.0007852792,0.008718476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992643,0.00024630103,0.000044505694,0.00013163897,0.00022448647,0.0000886027],"domain_scores_gemma":[0.9978237,0.00095090485,0.00024193697,0.0005638448,0.00027246907,0.00014710944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012643624,0.0009589457,0.00080997474,0.0010954671,0.001096342,0.0018598746,0.0017802456,0.001118898,0.007108305],"category_scores_gemma":[0.007907823,0.0005016828,0.0011467972,0.0011334076,0.0012396785,0.00406197,0.0020617426,0.002451536,0.0014610174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006654507,0.000054787524,0.00045198202,0.00017262717,0.000040711333,0.00010317806,0.00012864154,0.325746,0.0024898828,0.61921287,0.005905646,0.045627125],"study_design_scores_gemma":[0.0000042237707,0.000008633782,0.00003843505,0.000008568211,0.0000042181073,0.000020877671,0.000012104176,0.70765805,0.00035319765,0.28983954,0.0020462424,0.000005969608],"about_ca_topic_score_codex":0.0030352396,"about_ca_topic_score_gemma":0.0053259167,"teacher_disagreement_score":0.007108305,"about_ca_system_score_codex":0.0015985158,"about_ca_system_score_gemma":0.0013150389,"threshold_uncertainty_score":0.02377963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009561069,0.0002268481,0.98777467,0.00016259745,0.00002371631,0.0000788355,0.000046980647,0.00028914984,0.0018362207],"genre_scores_gemma":[0.4346929,0.0004805771,0.5592688,0.00021700881,0.000106130945,0.00068590866,0.00036890458,0.00021700261,0.003962905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872214,0.0005235689,0.00006711871,0.00023203492,0.00030410694,0.00015106476],"domain_scores_gemma":[0.99697757,0.0019796088,0.00028777492,0.00019369055,0.00040333212,0.00015799532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020809902,0.001317774,0.0018574091,0.0014822672,0.0009982849,0.0013636404,0.002395354,0.0013663117,0.0025457686],"category_scores_gemma":[0.007402562,0.0006264294,0.0011942583,0.0015126567,0.0010819611,0.0019805063,0.0019701715,0.0014148504,0.00066584797],"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.00009768912,0.00007984582,0.0022342238,0.00012632654,0.000089689376,0.00010452324,0.00026592542,0.86325705,0.0018310624,0.031803828,0.0025266095,0.09758319],"study_design_scores_gemma":[0.000009187238,0.000011906165,0.00007923403,0.0000060482057,0.000007648879,0.000014934075,0.0000148890385,0.99286836,0.00033340562,0.0062067606,0.00044280902,0.0000047621047],"about_ca_topic_score_codex":0.008439851,"about_ca_topic_score_gemma":0.009907372,"teacher_disagreement_score":0.008439851,"about_ca_system_score_codex":0.0016985033,"about_ca_system_score_gemma":0.0022147284,"threshold_uncertainty_score":0.01678145},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9276388,0.00035363602,0.0586238,0.00071982824,0.00006418241,0.00026016418,0.00038458718,0.00009913215,0.011855908],"genre_scores_gemma":[0.98063135,0.00015840256,0.017070955,0.000021927463,0.0000135469445,0.000061307015,0.00012445047,0.000018958008,0.0018990235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9987502,0.00069752225,0.000033644912,0.00011313521,0.000276729,0.00012876163],"domain_scores_gemma":[0.994371,0.0043694605,0.00023285061,0.00024747208,0.00052486185,0.00025444388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022962496,0.0006432364,0.00058807665,0.0016048911,0.0011594826,0.0011420246,0.00091681065,0.001413968,0.0020378015],"category_scores_gemma":[0.0048066424,0.00021404035,0.00060472783,0.0020177066,0.0011262263,0.0012690768,0.0008151337,0.00094204274,0.00016664468],"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.00037283247,0.00074226677,0.019468602,0.00025382012,0.00012290923,0.0066471356,0.0010852098,0.8997097,0.0036199281,0.03318383,0.0042107194,0.030583072],"study_design_scores_gemma":[0.00006850592,0.00025749535,0.0060263057,0.000026442687,0.000050958144,0.00067310606,0.0012567898,0.9778812,0.002190993,0.008574207,0.0029554327,0.00003850112],"about_ca_topic_score_codex":0.011630043,"about_ca_topic_score_gemma":0.014746672,"teacher_disagreement_score":0.011630043,"about_ca_system_score_codex":0.0018786401,"about_ca_system_score_gemma":0.00056940486,"threshold_uncertainty_score":0.023124754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951397,0.000053147804,0.0039567365,0.000108914595,0.0000013551486,0.000021397482,0.00013354464,0.000011507092,0.00057385856],"genre_scores_gemma":[0.9894442,0.00009743745,0.009978142,0.000013085464,0.0000034696845,0.000018832792,0.00017681425,0.0000058675273,0.00026216867],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996568,0.00017090703,0.00001738525,0.000069174945,0.000051211464,0.00003449289],"domain_scores_gemma":[0.99728477,0.0019633034,0.00030745342,0.000103235834,0.00021572411,0.00012542962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010766463,0.00026836997,0.00023450133,0.0017396723,0.0006008748,0.00069143414,0.00062057516,0.00053003186,0.00048206333],"category_scores_gemma":[0.0034629363,0.00013942573,0.00039044023,0.0015015432,0.0006412071,0.00097399094,0.0008034747,0.00031314557,0.00004280303],"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.00017749816,0.00025416733,0.7580742,0.00016732153,0.00023442142,0.0031006385,0.0038737142,0.18782884,0.0043045413,0.005411295,0.00089454575,0.035678867],"study_design_scores_gemma":[0.00003319858,0.0002771993,0.3878493,0.000059686703,0.000121869256,0.00069109054,0.0074280994,0.595827,0.0014992405,0.0047516176,0.0014155044,0.00004619543],"about_ca_topic_score_codex":0.068429,"about_ca_topic_score_gemma":0.11237444,"teacher_disagreement_score":0.068429,"about_ca_system_score_codex":0.0013843931,"about_ca_system_score_gemma":0.00050337537,"threshold_uncertainty_score":0.13606137},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37237287,0.00062291266,0.6134852,0.001363488,0.00006103857,0.000058932317,0.00021465032,0.00015682167,0.011664106],"genre_scores_gemma":[0.9646184,0.00024370034,0.033062577,0.00009603408,0.00005942019,0.000054191256,0.00012774047,0.000059530503,0.0016784082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980671,0.001091255,0.000053416963,0.00030029667,0.00034626955,0.00014172854],"domain_scores_gemma":[0.9749703,0.019460663,0.0023902971,0.0010325355,0.0011040291,0.0010422516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047767796,0.00032811626,0.0005695432,0.0024966053,0.001023785,0.0024629964,0.0008699152,0.001166494,0.0029870365],"category_scores_gemma":[0.03138702,0.00033556152,0.00052597653,0.0013559748,0.00352405,0.004710726,0.0014778416,0.001281604,0.00025725577],"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.000071809554,0.000026821139,0.0036931955,0.000039942657,0.00002304585,0.0001241976,0.00064137304,0.056668654,0.0013650203,0.9252506,0.0005073086,0.011588009],"study_design_scores_gemma":[0.000011088734,0.000035812456,0.0025320835,0.000024813473,0.000010892236,0.00009003775,0.0001934213,0.2189597,0.00039506666,0.7764191,0.0013037089,0.000024329314],"about_ca_topic_score_codex":0.0016910608,"about_ca_topic_score_gemma":0.0019840242,"teacher_disagreement_score":0.0047767796,"about_ca_system_score_codex":0.0017124442,"about_ca_system_score_gemma":0.0006496883,"threshold_uncertainty_score":0.025262296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7827495,0.0012598783,0.19535753,0.0008319614,0.00011721415,0.000052419407,0.000098436016,0.00018818465,0.019344945],"genre_scores_gemma":[0.9858086,0.00051096093,0.011092064,0.00005291064,0.00004586634,0.000032950986,0.000059329483,0.000044960296,0.0023524521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995448,0.00019933048,0.000018903434,0.000037696864,0.00011097374,0.00008827304],"domain_scores_gemma":[0.9976502,0.0015227711,0.00036307427,0.00013794973,0.0001677754,0.00015814113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018307039,0.0006976261,0.00057696603,0.0010770899,0.0008729658,0.0018152385,0.0009462165,0.0010898738,0.0017437297],"category_scores_gemma":[0.0037234416,0.00037800655,0.00071608875,0.0009926056,0.0023212954,0.0028664388,0.0008719595,0.0011226743,0.0001648932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006391434,0.00006270234,0.0009337593,0.000061498016,0.000037565314,0.00022635845,0.00019441819,0.29146066,0.002785242,0.7018983,0.00035549607,0.001920177],"study_design_scores_gemma":[0.000013310381,0.000020130243,0.00012296473,0.000006773517,0.0000061459677,0.0000263795,0.000024834313,0.8888186,0.0004963292,0.1102935,0.00015634428,0.000014762982],"about_ca_topic_score_codex":0.0041000014,"about_ca_topic_score_gemma":0.00186194,"teacher_disagreement_score":0.0041000014,"about_ca_system_score_codex":0.0014307036,"about_ca_system_score_gemma":0.00081539626,"threshold_uncertainty_score":0.010380566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7808288,0.0010737285,0.15531224,0.0022787058,0.00007332884,0.0001977041,0.00072695664,0.00024246509,0.059266098],"genre_scores_gemma":[0.98953843,0.0003123316,0.006549708,0.00004632051,0.000022283632,0.000078370496,0.0002381134,0.0000141635555,0.0032002663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991584,0.00021460089,0.000039269427,0.00026741103,0.00016776004,0.00015259538],"domain_scores_gemma":[0.9979475,0.00050570973,0.0005924063,0.00018223234,0.00052149856,0.0002506142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063580356,0.00024328528,0.00029362887,0.0024408672,0.0014058227,0.0020351065,0.0007494425,0.000775336,0.0052374676],"category_scores_gemma":[0.004056048,0.00026285963,0.00055731146,0.0018773619,0.0013709501,0.00374036,0.001652697,0.0004073214,0.00042999495],"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.00009708818,0.00012253286,0.19638562,0.00036728688,0.00020210269,0.001365364,0.007857202,0.061326995,0.005032457,0.6552398,0.009358409,0.06264511],"study_design_scores_gemma":[0.00006396247,0.00017964911,0.2324196,0.00024936482,0.0003183411,0.0014242582,0.012474843,0.36192125,0.0021859116,0.34352738,0.045073114,0.0001623174],"about_ca_topic_score_codex":0.008533265,"about_ca_topic_score_gemma":0.0072282422,"teacher_disagreement_score":0.008533265,"about_ca_system_score_codex":0.0020325147,"about_ca_system_score_gemma":0.00087385677,"threshold_uncertainty_score":0.017521024},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7694123,0.00140433,0.20084447,0.002212678,0.0001357234,0.00013341878,0.0005871899,0.00021250673,0.025057495],"genre_scores_gemma":[0.985622,0.00040003695,0.008607776,0.00011861801,0.000081541686,0.00006551483,0.0001805059,0.000033070537,0.0048910063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925786,0.0003644951,0.000023116729,0.0001338498,0.00011679386,0.000103941435],"domain_scores_gemma":[0.99308217,0.0037277674,0.0007776732,0.00047235988,0.0008679113,0.0010721006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016997836,0.00038892752,0.0014055751,0.0022826043,0.00151315,0.002434931,0.0021811011,0.002208871,0.0052103144],"category_scores_gemma":[0.012162537,0.00049084943,0.00082351523,0.0010951713,0.0018511737,0.0034752404,0.0016383943,0.0009516031,0.00048678755],"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.00021560362,0.0001295552,0.0042801425,0.00016889806,0.000094901654,0.00027499517,0.00047716207,0.1572909,0.0015667536,0.8233352,0.004074432,0.008091516],"study_design_scores_gemma":[0.000041594696,0.000024689112,0.00070444605,0.00001853359,0.00002051677,0.00011326942,0.00013285369,0.66204715,0.00012964464,0.33584204,0.00090523297,0.000020093057],"about_ca_topic_score_codex":0.007445919,"about_ca_topic_score_gemma":0.004068961,"teacher_disagreement_score":0.007445919,"about_ca_system_score_codex":0.0012073381,"about_ca_system_score_gemma":0.0008174867,"threshold_uncertainty_score":0.017430246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054332905,0.00095476594,0.94032204,0.0010573447,0.00009218099,0.000060579292,0.0001698538,0.00048256523,0.0025278714],"genre_scores_gemma":[0.920189,0.00063424284,0.07597268,0.00034394077,0.000089248766,0.00012927371,0.00027592358,0.00007373308,0.0022918608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995116,0.00019644445,0.00002198145,0.00013992615,0.00007141128,0.000058748155],"domain_scores_gemma":[0.99698216,0.0022264638,0.00029327924,0.000112558606,0.00024450567,0.0001410251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013009897,0.000955706,0.0010515418,0.00094981055,0.00037540033,0.000858294,0.0012335053,0.00135131,0.0015792144],"category_scores_gemma":[0.0059944685,0.0004669489,0.00061893486,0.0005522618,0.0010926839,0.001570766,0.00104246,0.0015121656,0.00021810892],"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.000017601456,0.000020176147,0.00085049233,0.000032382708,0.000019991832,0.000026503672,0.000017799306,0.9825361,0.00020309922,0.0047716266,0.00030050692,0.011203798],"study_design_scores_gemma":[0.0000023241778,0.0000072720204,0.00006498632,0.0000024899425,0.0000028812503,0.0000031781256,0.0000022636295,0.9942326,0.000043161606,0.0055403477,0.00009663487,0.0000018011242],"about_ca_topic_score_codex":0.009853438,"about_ca_topic_score_gemma":0.0110238595,"teacher_disagreement_score":0.009853438,"about_ca_system_score_codex":0.0017279735,"about_ca_system_score_gemma":0.0011736265,"threshold_uncertainty_score":0.019592166},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81781715,0.000154537,0.17458193,0.0005303016,0.00007351868,0.00027378852,0.0003415532,0.0005771262,0.0056501045],"genre_scores_gemma":[0.9612141,0.00008823396,0.037654083,0.000048669743,0.000012073161,0.00018484061,0.0001377913,0.000037412166,0.00062283844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935955,0.0003196611,0.00003037451,0.00009105711,0.00012156769,0.00007788542],"domain_scores_gemma":[0.9931914,0.005161547,0.00039329793,0.00056499225,0.0005149683,0.00017377686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012427222,0.0006277756,0.0006290109,0.0006660475,0.00057957775,0.00076856825,0.0010984009,0.0009627366,0.0012544355],"category_scores_gemma":[0.0071834223,0.00036331566,0.0005281802,0.0005532322,0.00081980985,0.0011772515,0.0007728427,0.0010165955,0.00011919793],"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.000042063846,0.00009050827,0.0018860478,0.000020553158,0.000024296005,0.000020224883,0.000041956242,0.9922036,0.00084228173,0.0021554958,0.00011404975,0.0025588602],"study_design_scores_gemma":[0.00000555142,0.000016618857,0.0001121383,0.0000010937599,0.0000026743344,0.0000026374312,0.000009256343,0.99894005,0.0003502259,0.00048562855,0.000072461335,0.0000015927733],"about_ca_topic_score_codex":0.010952891,"about_ca_topic_score_gemma":0.0075896434,"teacher_disagreement_score":0.010952891,"about_ca_system_score_codex":0.0011542102,"about_ca_system_score_gemma":0.0012003416,"threshold_uncertainty_score":0.021778286},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00707573,0.000065523476,0.991248,0.00010476975,0.000030971885,0.000087699336,0.000055292556,0.00040663622,0.0009252407],"genre_scores_gemma":[0.16230129,0.00011971612,0.83304465,0.00015482653,0.00004636865,0.0007657314,0.00037791792,0.0003397661,0.0028496669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991497,0.00040582463,0.00004583536,0.00019497208,0.00014324799,0.000060334944],"domain_scores_gemma":[0.99710375,0.0020561272,0.000177366,0.0002934896,0.00027562777,0.00009364777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017817462,0.0009431469,0.0010089788,0.0010803599,0.0007691027,0.00085531734,0.0015823842,0.0013506647,0.0034394586],"category_scores_gemma":[0.007964104,0.00075580704,0.0010368787,0.0008414031,0.0010392324,0.0010962813,0.0012631429,0.0016804297,0.0008818766],"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.000075885706,0.000043559376,0.00073480274,0.00005347522,0.00007747982,0.00006687406,0.00011007367,0.90891075,0.0029988831,0.034336876,0.0019208204,0.050670497],"study_design_scores_gemma":[0.00001439178,0.000017317783,0.000055007833,0.000004898518,0.000006305515,0.000011112995,0.0000065950403,0.986155,0.00041165127,0.012508298,0.0008042043,0.0000052192663],"about_ca_topic_score_codex":0.0037190611,"about_ca_topic_score_gemma":0.0053438516,"teacher_disagreement_score":0.0037190611,"about_ca_system_score_codex":0.0010916075,"about_ca_system_score_gemma":0.001347841,"threshold_uncertainty_score":0.01150614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26261318,0.0035599906,0.69420433,0.0021732855,0.00035201077,0.00019229311,0.012887027,0.013287302,0.010730575],"genre_scores_gemma":[0.7805457,0.0013948616,0.18777892,0.00056099304,0.00017088579,0.00016077104,0.021964757,0.00076596363,0.006657216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974054,0.00007396636,0.0000094396,0.00009626822,0.00004956565,0.000030225914],"domain_scores_gemma":[0.9991743,0.0004114803,0.00008432799,0.00013473467,0.00014732206,0.00004778151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030636485,0.0013141081,0.00042867096,0.0021086682,0.00040438105,0.00079455436,0.0007125832,0.00062670227,0.0030924028],"category_scores_gemma":[0.00232408,0.00033989977,0.0006274592,0.0022899953,0.0004078893,0.0022877455,0.0008063817,0.00093330006,0.0011279866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005818437,0.00036568174,0.035239033,0.00054866914,0.0003535481,0.00078574487,0.00075396476,0.36603358,0.0095517915,0.026702177,0.1000673,0.45901674],"study_design_scores_gemma":[0.00001238754,0.000038811,0.0019103452,0.000022555632,0.000022819226,0.0001005607,0.00009544578,0.97605294,0.0015353174,0.013730292,0.0064630494,0.000015455775],"about_ca_topic_score_codex":0.010025286,"about_ca_topic_score_gemma":0.020237949,"teacher_disagreement_score":0.010025286,"about_ca_system_score_codex":0.000504074,"about_ca_system_score_gemma":0.00042379202,"threshold_uncertainty_score":0.01993388},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029157929,0.000292119,0.9807192,0.0016143669,0.00018608771,0.00006243956,0.00037412965,0.00010745544,0.013728532],"genre_scores_gemma":[0.37210226,0.003053959,0.55308396,0.0025112343,0.0022363856,0.0010425298,0.0015940319,0.00029404077,0.064081654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986399,0.00051341654,0.00007075974,0.00042573552,0.00025921178,0.00009109451],"domain_scores_gemma":[0.9963858,0.0019484215,0.0003417736,0.0005525589,0.00059716415,0.000174313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002377108,0.0010081773,0.0010565942,0.0024839113,0.001586966,0.0026360145,0.0028667932,0.003399272,0.016028251],"category_scores_gemma":[0.011436175,0.00075889454,0.0012372802,0.0037656836,0.0022868651,0.0057603666,0.0019571278,0.002830984,0.0025975804],"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.0000025059219,0.0000066193356,0.000099890996,0.00003111328,0.00000994241,0.000032566753,0.000043111115,0.007379425,0.00012052831,0.98676234,0.001776509,0.0037355153],"study_design_scores_gemma":[0.0000053712783,0.0000043161244,0.000077464705,0.000011849748,0.000009765099,0.0000690015,0.000021452826,0.049298514,0.00005919887,0.94607395,0.0043604868,0.000008526039],"about_ca_topic_score_codex":0.0034687105,"about_ca_topic_score_gemma":0.0034961812,"teacher_disagreement_score":0.016028251,"about_ca_system_score_codex":0.0015826299,"about_ca_system_score_gemma":0.0012576329,"threshold_uncertainty_score":0.05361986},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59110457,0.0004997905,0.3986064,0.00099778,0.000052281524,0.00021162348,0.0002598492,0.00028446005,0.007983229],"genre_scores_gemma":[0.96144384,0.00014338999,0.035562057,0.00013469397,0.00008772539,0.0001669876,0.00019797956,0.000035737656,0.002227646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976509,0.001066219,0.000083998035,0.0006995332,0.0003008349,0.00019849358],"domain_scores_gemma":[0.9867199,0.008087691,0.0023326215,0.0010806705,0.00071210647,0.0010669818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030611982,0.0004811805,0.00071452564,0.0028756985,0.0017037805,0.0018076202,0.0010820837,0.0013039259,0.0025815733],"category_scores_gemma":[0.013436444,0.0003919011,0.00069136755,0.0011444542,0.0029916626,0.0041294084,0.0022499335,0.000687588,0.00036054038],"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.0010853681,0.0004187205,0.08554304,0.0006152574,0.0004964128,0.0018221429,0.011857045,0.1659818,0.013221986,0.5404112,0.006617903,0.17192921],"study_design_scores_gemma":[0.00006140924,0.0002542103,0.01896867,0.00007843942,0.00008662463,0.00070998963,0.002359467,0.5480762,0.0021919687,0.4210583,0.0060577723,0.000096889606],"about_ca_topic_score_codex":0.001563315,"about_ca_topic_score_gemma":0.0016036028,"teacher_disagreement_score":0.0030611982,"about_ca_system_score_codex":0.0012414319,"about_ca_system_score_gemma":0.0003728557,"threshold_uncertainty_score":0.016189396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14822696,0.001424245,0.84338725,0.0010182018,0.00012430655,0.00006417662,0.0007251363,0.001345022,0.0036847065],"genre_scores_gemma":[0.9581841,0.00048685545,0.037758987,0.00021841165,0.000068874564,0.000052365933,0.00066208834,0.00005591895,0.0025123414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980205,0.000041812662,0.00000818669,0.00006986081,0.00003823263,0.00003982509],"domain_scores_gemma":[0.9991472,0.00047276594,0.00009193502,0.00006166941,0.00018145538,0.000045060602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038770892,0.00056515634,0.00056822563,0.000942181,0.0003404414,0.00054313097,0.0013208186,0.0007296483,0.0013055911],"category_scores_gemma":[0.0032254937,0.00030895838,0.00041682972,0.00088375714,0.00046511999,0.0014610529,0.00071051123,0.0008275913,0.00023806117],"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.0002239353,0.00008534308,0.0069426927,0.00011518334,0.00007093121,0.00016405409,0.00011901761,0.84438324,0.0046596495,0.014733531,0.0044166837,0.12408577],"study_design_scores_gemma":[0.0000014436962,0.0000065223803,0.00026035475,0.000002272696,0.0000051042266,0.000011127209,0.0000052244022,0.99598014,0.00021436735,0.0033511885,0.00016006632,0.0000021604862],"about_ca_topic_score_codex":0.017921735,"about_ca_topic_score_gemma":0.023624424,"teacher_disagreement_score":0.017921735,"about_ca_system_score_codex":0.0013157242,"about_ca_system_score_gemma":0.0006068037,"threshold_uncertainty_score":0.035634875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03407186,0.0005128859,0.9581858,0.00031886352,0.000052579853,0.00010648918,0.00008057751,0.00024188416,0.0064290995],"genre_scores_gemma":[0.85010034,0.0007375279,0.1413362,0.00030278077,0.00015182969,0.00032060684,0.00019732912,0.00011853298,0.0067347935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902725,0.00029888307,0.000039532166,0.0002687549,0.0002500596,0.000115467745],"domain_scores_gemma":[0.99804926,0.0012480302,0.00018783474,0.00014165347,0.00024136911,0.000131792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015088373,0.0012476192,0.0014128428,0.0013629269,0.0009898654,0.0011655254,0.0025091206,0.001488948,0.0023998783],"category_scores_gemma":[0.0048960717,0.00067430973,0.0012248305,0.0010271061,0.0012965513,0.0024221416,0.0013230414,0.0012081825,0.0005996773],"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.00015202818,0.00014257993,0.0039337766,0.00023828623,0.00019620545,0.00034090114,0.0003960831,0.79890305,0.0074151224,0.089381136,0.004647293,0.09425349],"study_design_scores_gemma":[0.000008399164,0.000027793381,0.00022715308,0.0000074030027,0.000019846124,0.000041880197,0.000011410004,0.98842466,0.0006289858,0.010057255,0.00053449976,0.000010582297],"about_ca_topic_score_codex":0.007203841,"about_ca_topic_score_gemma":0.007383666,"teacher_disagreement_score":0.007203841,"about_ca_system_score_codex":0.0014285389,"about_ca_system_score_gemma":0.0011196502,"threshold_uncertainty_score":0.014323831},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79705584,0.0009246202,0.17313752,0.0003894445,0.00003874734,0.000067806126,0.00071590877,0.00020349241,0.02746655],"genre_scores_gemma":[0.9622212,0.0006045134,0.033321816,0.000043713986,0.000060169248,0.00007371246,0.00039070335,0.000051358893,0.0032326456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969375,0.000058543963,0.000016564549,0.00008147458,0.0000883091,0.000061342784],"domain_scores_gemma":[0.9971425,0.0018499759,0.0003726866,0.0001919657,0.00018038375,0.0002624796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038695618,0.00039753964,0.00030958315,0.0024328495,0.00072755734,0.00096260494,0.0005912179,0.00063195254,0.0032574618],"category_scores_gemma":[0.003936538,0.00027471568,0.00032854918,0.0010838489,0.0011267713,0.0022265448,0.0006769058,0.0006740007,0.0002576038],"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.0003786352,0.00009237383,0.012711419,0.00040572844,0.000071177376,0.00058827555,0.00084513094,0.14554588,0.017482636,0.71691394,0.005372146,0.09959271],"study_design_scores_gemma":[0.000030498471,0.00013939914,0.010405506,0.00007554379,0.00004172401,0.001258695,0.0003417581,0.393448,0.0078833,0.57342803,0.012896732,0.000050880473],"about_ca_topic_score_codex":0.0010105247,"about_ca_topic_score_gemma":0.0016445208,"teacher_disagreement_score":0.0032574618,"about_ca_system_score_codex":0.0010183025,"about_ca_system_score_gemma":0.00040813413,"threshold_uncertainty_score":0.010897279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7825591,0.00042875478,0.2093597,0.00039858033,0.000024056457,0.00011378209,0.00096244924,0.0004949681,0.0056586],"genre_scores_gemma":[0.9186054,0.00021932182,0.07846762,0.00004262559,0.000009477011,0.00012110888,0.0009923746,0.00010918042,0.0014329355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994574,0.00017008216,0.000018601075,0.00015550328,0.000113105794,0.000085336105],"domain_scores_gemma":[0.99392176,0.004632279,0.00045162227,0.0005417163,0.00023722592,0.00021535657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010416895,0.0005312787,0.0005512226,0.0011681108,0.0006636651,0.0009648128,0.0011872653,0.00079046417,0.003568498],"category_scores_gemma":[0.009316995,0.00030324332,0.0007760119,0.0010664337,0.00074760854,0.0021629692,0.0008707507,0.0006853624,0.00021198257],"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.00028014302,0.00012998584,0.0075806873,0.00021400326,0.00007509785,0.00017694317,0.00017927152,0.90661895,0.006149165,0.046035185,0.001740859,0.03081979],"study_design_scores_gemma":[0.000013598345,0.000058747068,0.0009796661,0.00000852898,0.00001601035,0.00008351832,0.00007082344,0.95984,0.0013885201,0.037079655,0.00045093658,0.0000100473235],"about_ca_topic_score_codex":0.0038178856,"about_ca_topic_score_gemma":0.0057783774,"teacher_disagreement_score":0.0038178856,"about_ca_system_score_codex":0.0014727953,"about_ca_system_score_gemma":0.0011871108,"threshold_uncertainty_score":0.011937797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098558806,0.0045194677,0.8846086,0.0023001358,0.00029440137,0.00044090013,0.0013677259,0.0027883716,0.005121611],"genre_scores_gemma":[0.72561806,0.001615106,0.26715344,0.00062027964,0.00018782832,0.0006758554,0.0023124418,0.0006428168,0.0011741258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9877851,0.0060509974,0.0008008543,0.001487102,0.0032608937,0.0006149746],"domain_scores_gemma":[0.9119825,0.06191435,0.005937572,0.007554005,0.011374503,0.0012371287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02505793,0.0032098682,0.002179127,0.0074417903,0.0011656693,0.0036605194,0.001833928,0.0035632267,0.0015742554],"category_scores_gemma":[0.10468771,0.0005810465,0.002371436,0.0052470537,0.0027392898,0.005757522,0.0038511448,0.0050643287,0.00066994975],"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.0006558914,0.0003615755,0.031426165,0.0009456701,0.0005676278,0.00035625542,0.0010411144,0.74604774,0.0039519793,0.045183346,0.00838887,0.16107365],"study_design_scores_gemma":[0.000020770744,0.0002483654,0.0033172646,0.00014608866,0.00004596432,0.00013319802,0.00017093297,0.9716276,0.0021241328,0.020137869,0.0019408563,0.00008699194],"about_ca_topic_score_codex":0.01053482,"about_ca_topic_score_gemma":0.0033885255,"teacher_disagreement_score":0.02505793,"about_ca_system_score_codex":0.0028445078,"about_ca_system_score_gemma":0.0022287406,"threshold_uncertainty_score":0.13252056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06740073,0.0011437545,0.92469406,0.0004599321,0.000115667564,0.000049674894,0.0010273994,0.0019078362,0.0032009776],"genre_scores_gemma":[0.8548615,0.0009775115,0.13640548,0.00023427434,0.0001235902,0.000078432946,0.0027077075,0.00017938693,0.004432011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981695,0.000048365502,0.000007778086,0.000053762382,0.000043981054,0.000029265806],"domain_scores_gemma":[0.9993622,0.0003328701,0.000071385286,0.00006957993,0.00013512382,0.000028990877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005041605,0.00077589694,0.0004898695,0.0010804567,0.00023416353,0.0004763453,0.001074182,0.00052712933,0.0015823963],"category_scores_gemma":[0.0024209311,0.00027787674,0.00051536295,0.0011147759,0.00031306857,0.0015591601,0.00058703724,0.0010024011,0.00054626865],"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.00023664667,0.000114484625,0.0038668537,0.000091794944,0.000079525205,0.00010597199,0.00007452471,0.7358445,0.0056600007,0.01220961,0.0068374416,0.23487866],"study_design_scores_gemma":[0.000001985423,0.0000054671427,0.0001429782,0.0000018461615,0.000004380715,0.00001008553,0.0000039073284,0.99700636,0.00038717178,0.0021685048,0.00026501872,0.0000022996785],"about_ca_topic_score_codex":0.012768044,"about_ca_topic_score_gemma":0.02136484,"teacher_disagreement_score":0.012768044,"about_ca_system_score_codex":0.00081003224,"about_ca_system_score_gemma":0.0006597052,"threshold_uncertainty_score":0.025387406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055084266,0.00045051926,0.9858197,0.0002459572,0.000095894335,0.00010053905,0.0006444258,0.0040053963,0.003129082],"genre_scores_gemma":[0.09209509,0.00058091513,0.8925786,0.00029437945,0.00013883358,0.00026930537,0.0028411853,0.0018922098,0.009309546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993748,0.00013981244,0.000022908604,0.00020797453,0.00020997222,0.00004462716],"domain_scores_gemma":[0.9985434,0.0006307031,0.00009259037,0.00043423867,0.00020053856,0.00009855319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006624199,0.0010889648,0.0011607009,0.0021885692,0.0009636736,0.0019381791,0.0028219807,0.001360299,0.007299878],"category_scores_gemma":[0.003455988,0.0008516832,0.0011012171,0.0026927372,0.0009961032,0.0026293858,0.0024298043,0.0024767958,0.0032095755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021649405,0.00018367374,0.0011747039,0.0007521192,0.00012701795,0.00025806183,0.0004615281,0.16744068,0.018622475,0.15909086,0.05454237,0.59713],"study_design_scores_gemma":[0.000032761698,0.000042762087,0.00061217253,0.000064669955,0.00003343059,0.00021591525,0.00008323505,0.82315654,0.0064655375,0.14134586,0.027917454,0.000029637275],"about_ca_topic_score_codex":0.003752826,"about_ca_topic_score_gemma":0.0062863887,"teacher_disagreement_score":0.007299878,"about_ca_system_score_codex":0.0013255426,"about_ca_system_score_gemma":0.0008305118,"threshold_uncertainty_score":0.0244205},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73740995,0.0016189802,0.22530192,0.007089809,0.00021665123,0.000117912845,0.0011769949,0.00048041335,0.026587287],"genre_scores_gemma":[0.9870934,0.0005418446,0.0031851379,0.0002604524,0.00012125716,0.00005898836,0.00017524222,0.000044563076,0.00851925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931955,0.00021613415,0.000025658084,0.00017870436,0.00008596607,0.00017394648],"domain_scores_gemma":[0.99302363,0.004090517,0.0009850444,0.0002531193,0.0005533178,0.0010943867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018217579,0.00081234454,0.0027059203,0.002495626,0.0008444211,0.0025912467,0.0021987264,0.0025353911,0.0067467596],"category_scores_gemma":[0.009152695,0.0007461463,0.00095998787,0.000939596,0.0027481723,0.0039783474,0.0016977354,0.0020280937,0.00047550153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026314813,0.00015111211,0.0048126117,0.00024725878,0.00012743557,0.0006453999,0.00038045252,0.33677283,0.005077398,0.64211696,0.004646529,0.004758969],"study_design_scores_gemma":[0.000047975176,0.000049336424,0.001635707,0.000032898726,0.000045615772,0.0002068617,0.000100752135,0.837094,0.00026375582,0.15997913,0.0005019415,0.00004205741],"about_ca_topic_score_codex":0.005796184,"about_ca_topic_score_gemma":0.003731249,"teacher_disagreement_score":0.0067467596,"about_ca_system_score_codex":0.0021504099,"about_ca_system_score_gemma":0.0012342756,"threshold_uncertainty_score":0.022570193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011024672,0.00020714516,0.9871564,0.00021155874,0.000044217035,0.00005330338,0.00015330547,0.00066952175,0.00047988398],"genre_scores_gemma":[0.26493576,0.00040585035,0.72064847,0.00032061053,0.00021236998,0.00031629714,0.0017866879,0.0009630814,0.01041083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841666,0.0006561599,0.000065715474,0.00042372427,0.00032233272,0.00011543812],"domain_scores_gemma":[0.9937828,0.0036958398,0.00035613016,0.0008959641,0.0010039893,0.0002652302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003358597,0.0013950758,0.0020163178,0.00224423,0.0012127236,0.0016161028,0.0040970896,0.0029198576,0.0020091534],"category_scores_gemma":[0.012127525,0.0012095084,0.0020283686,0.0024351429,0.0017694035,0.00259024,0.0031978032,0.0040061604,0.0012642159],"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.00022391556,0.00019832542,0.0011949586,0.00018695754,0.00022115793,0.00010451773,0.00027484435,0.8158806,0.00408759,0.027273305,0.009066626,0.1412872],"study_design_scores_gemma":[0.000004079672,0.0000047799563,0.000050431667,0.0000037171599,0.0000046559962,0.000007107689,0.000009152304,0.9913521,0.00022582039,0.008129449,0.00020536782,0.000003332508],"about_ca_topic_score_codex":0.015372341,"about_ca_topic_score_gemma":0.018659689,"teacher_disagreement_score":0.015372341,"about_ca_system_score_codex":0.0018284356,"about_ca_system_score_gemma":0.0016388483,"threshold_uncertainty_score":0.030565739},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10535637,0.0006002088,0.7305434,0.0006651973,0.00025967733,0.0006452197,0.038100813,0.09850231,0.025326928],"genre_scores_gemma":[0.43831807,0.00070173497,0.4898959,0.00043447028,0.00022413959,0.0015990579,0.03925511,0.006681962,0.02288952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996352,0.00013158387,0.000037486956,0.00008497663,0.00009335269,0.000017317509],"domain_scores_gemma":[0.99787724,0.0014342432,0.00021572241,0.00013995952,0.0002620385,0.000070871036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055596296,0.0007910922,0.0002755958,0.0030061372,0.00040276887,0.0012560287,0.00048568376,0.00039276583,0.009389423],"category_scores_gemma":[0.0055879825,0.00023015073,0.00028425033,0.0014891735,0.00022242083,0.002119742,0.0008371996,0.0005976075,0.003891472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010792306,0.0005356174,0.016568918,0.002359377,0.00035776407,0.0007217569,0.0032691013,0.012066037,0.08012586,0.043857746,0.1376643,0.7013943],"study_design_scores_gemma":[0.00014486212,0.00026840088,0.031178333,0.00028896378,0.0003065161,0.0008462794,0.0017505833,0.58667076,0.052869115,0.08984209,0.23567791,0.00015623185],"about_ca_topic_score_codex":0.0010642603,"about_ca_topic_score_gemma":0.00270747,"teacher_disagreement_score":0.009389423,"about_ca_system_score_codex":0.00033158605,"about_ca_system_score_gemma":0.00037656358,"threshold_uncertainty_score":0.031410754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93607455,0.0002701354,0.060382634,0.00015503861,0.000015034646,0.000030976327,0.0002761625,0.0001405769,0.0026548349],"genre_scores_gemma":[0.99693215,0.000042813233,0.0026941895,0.000006589792,0.0000067407204,0.00001177346,0.000089630696,0.0000058284745,0.00021025816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99971336,0.00010103473,0.000009199312,0.000077894794,0.000059891077,0.00003855833],"domain_scores_gemma":[0.9978491,0.0011827219,0.00045512887,0.000118550386,0.00023624206,0.00015822548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004404717,0.00023565965,0.00028118296,0.0015412839,0.00031792984,0.0006274676,0.00028417556,0.00028042664,0.0010461779],"category_scores_gemma":[0.0053448603,0.00018635829,0.00026454916,0.000807282,0.0005756148,0.000561744,0.00055623543,0.00022540087,0.0001039869],"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.00088001334,0.0001719581,0.12502572,0.0003128639,0.0002735672,0.00071214634,0.0018938247,0.70130825,0.03493494,0.044781316,0.0024265286,0.08727882],"study_design_scores_gemma":[0.000021469652,0.000060455543,0.06536537,0.000025326954,0.0000339418,0.00013407762,0.00034735308,0.9069293,0.00292605,0.022421777,0.0017083423,0.000026536145],"about_ca_topic_score_codex":0.0059374264,"about_ca_topic_score_gemma":0.0040401225,"teacher_disagreement_score":0.0059374264,"about_ca_system_score_codex":0.00057860743,"about_ca_system_score_gemma":0.0002132315,"threshold_uncertainty_score":0.011805713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015752388,0.00035287172,0.99565864,0.00040270653,0.000050295945,0.00003286077,0.00020519443,0.00007821753,0.0016439281],"genre_scores_gemma":[0.26016265,0.005887378,0.7235756,0.0007043117,0.0009007078,0.00073129596,0.0014577196,0.00026063639,0.006319754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987104,0.00072300876,0.00009026261,0.0001867417,0.00022485085,0.00006472099],"domain_scores_gemma":[0.99510866,0.0034646566,0.000544569,0.00042546098,0.00032729664,0.00012927224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002512688,0.001715988,0.00123178,0.003717392,0.00087842945,0.002205624,0.002450946,0.0017198119,0.0024288509],"category_scores_gemma":[0.010647592,0.0008951903,0.0023496968,0.0035692777,0.001740161,0.004203112,0.0023506316,0.0030582761,0.00083943945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008241239,0.000037948837,0.0005794423,0.000102865044,0.00007419606,0.00013343157,0.0001208321,0.3876186,0.00041966035,0.5962533,0.0016023606,0.013049182],"study_design_scores_gemma":[0.0000054683796,0.00001523297,0.00011492546,0.000025058269,0.000020214018,0.000045268076,0.000024625233,0.6193749,0.000078504454,0.3755332,0.0047474713,0.000015195435],"about_ca_topic_score_codex":0.0070817475,"about_ca_topic_score_gemma":0.0051537403,"teacher_disagreement_score":0.0070817475,"about_ca_system_score_codex":0.0017331287,"about_ca_system_score_gemma":0.0013375233,"threshold_uncertainty_score":0.014081061},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7089417,0.0008014012,0.16465817,0.00070397987,0.00016029109,0.00037422494,0.08983741,0.010091853,0.024430923],"genre_scores_gemma":[0.7855477,0.00047803545,0.121525496,0.00015818514,0.00006993784,0.0009333818,0.08387603,0.0016943095,0.005716983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972695,0.00007696683,0.000016961923,0.00009748104,0.00005557974,0.000026163232],"domain_scores_gemma":[0.9974644,0.0016733082,0.00025672014,0.0003308193,0.00018120732,0.000093495015],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005268631,0.00036635096,0.00023340585,0.002103143,0.0006357524,0.0009573162,0.0006762668,0.00043745575,0.008014821],"category_scores_gemma":[0.0069705155,0.00026786383,0.00040852575,0.0020621547,0.0005447953,0.0019698555,0.0013298031,0.00069210754,0.0014414308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013235713,0.0007232107,0.15984327,0.004606803,0.0006405764,0.0019350154,0.014702022,0.077849746,0.054912128,0.22293937,0.17653963,0.28398466],"study_design_scores_gemma":[0.00021813462,0.00030114062,0.12888727,0.00035600283,0.00021109331,0.0013735167,0.0039949953,0.43557382,0.020109124,0.2104987,0.19830242,0.00017385304],"about_ca_topic_score_codex":0.005608143,"about_ca_topic_score_gemma":0.011473323,"teacher_disagreement_score":0.9993237,"about_ca_system_score_codex":0.0004648968,"about_ca_system_score_gemma":0.00045601043,"threshold_uncertainty_score":0.026812255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78652364,0.0011783931,0.20050012,0.0008148146,0.00004774798,0.00018961536,0.0010268209,0.00038865194,0.0093302],"genre_scores_gemma":[0.9782211,0.0002102958,0.020944813,0.00001844583,0.0000127261965,0.000034374694,0.00021073506,0.000025576403,0.0003218724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988745,0.0004988245,0.000044625922,0.0001225714,0.0003382311,0.00012128143],"domain_scores_gemma":[0.9956826,0.0017037237,0.0011507277,0.0005159324,0.0007368114,0.00021011202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021075679,0.0012056613,0.00053412566,0.004504271,0.00041112438,0.0013585978,0.0010229046,0.0005484382,0.00094526954],"category_scores_gemma":[0.0087758275,0.00032038562,0.00071994006,0.002531404,0.0010623068,0.0029073334,0.0019884459,0.0005663881,0.00011434831],"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.00012331865,0.000077083816,0.102778465,0.00027060037,0.0003001839,0.0003207672,0.0006938954,0.81379575,0.0029682745,0.01756185,0.0011592959,0.059950512],"study_design_scores_gemma":[0.0000069905777,0.00023981326,0.04445158,0.00012546379,0.00012529138,0.00028813182,0.0010004691,0.9263941,0.0025970547,0.021741658,0.002962581,0.00006680007],"about_ca_topic_score_codex":0.01049217,"about_ca_topic_score_gemma":0.012186249,"teacher_disagreement_score":0.01049217,"about_ca_system_score_codex":0.0015780027,"about_ca_system_score_gemma":0.0010064763,"threshold_uncertainty_score":0.020862222},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11791124,0.0017698898,0.6027626,0.0011354301,0.0004195752,0.0008706836,0.01352719,0.24239585,0.019207485],"genre_scores_gemma":[0.4780954,0.00091469265,0.48234448,0.0012800316,0.00008615348,0.0018355657,0.015443358,0.014602927,0.005397456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998398,0.00050685805,0.00008064633,0.0002373542,0.00058897975,0.00018806351],"domain_scores_gemma":[0.9985291,0.0006333398,0.00013786151,0.00038461105,0.00016817419,0.000146899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002624521,0.001655874,0.0030384345,0.00081601617,0.0008338737,0.001948787,0.0054196236,0.0017529,0.016518444],"category_scores_gemma":[0.0039984034,0.0011299595,0.0024453832,0.00065841904,0.00081829686,0.0018765687,0.0036777381,0.002685315,0.0048434325],"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.0017419776,0.0006377181,0.0045606806,0.0017304072,0.00084368134,0.0005510105,0.00016319501,0.78154355,0.031332523,0.02107593,0.054184612,0.10163477],"study_design_scores_gemma":[0.0002794047,0.00017527088,0.0005610163,0.00003096457,0.00004219446,0.00007053989,0.000014322727,0.97800463,0.0059708003,0.007790947,0.0069786194,0.000081322345],"about_ca_topic_score_codex":0.004099359,"about_ca_topic_score_gemma":0.004312957,"teacher_disagreement_score":0.016518444,"about_ca_system_score_codex":0.0011735668,"about_ca_system_score_gemma":0.002891027,"threshold_uncertainty_score":0.055259705},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26527846,0.0009994099,0.7036041,0.0010920436,0.000081538186,0.00025018697,0.0010152755,0.0003011417,0.02737791],"genre_scores_gemma":[0.9150192,0.0008891009,0.07419693,0.00027231508,0.00015341742,0.0002724686,0.00082877383,0.00007106535,0.0082967505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808,0.0005831316,0.00012378555,0.0006089226,0.00039925022,0.00020489622],"domain_scores_gemma":[0.9955746,0.0025482024,0.00050846615,0.00050373736,0.00054503523,0.00032010133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014947171,0.0008164288,0.0008657669,0.00162533,0.0012287924,0.0018048949,0.0009228996,0.0007892867,0.003325066],"category_scores_gemma":[0.006193636,0.00034091115,0.00072254095,0.0016630009,0.0022161198,0.003460709,0.0016875138,0.00090956024,0.00038103736],"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.0002042964,0.000085875654,0.0041474416,0.00038022746,0.00011789315,0.00072098913,0.0009665154,0.11856621,0.007053091,0.81496656,0.003624948,0.04916603],"study_design_scores_gemma":[0.00003087396,0.00006779222,0.0013120088,0.000046723286,0.00003753201,0.00055023545,0.00026047957,0.14383526,0.0023352755,0.83995485,0.011543817,0.000025143836],"about_ca_topic_score_codex":0.0012638548,"about_ca_topic_score_gemma":0.0013014495,"teacher_disagreement_score":0.003325066,"about_ca_system_score_codex":0.0013977215,"about_ca_system_score_gemma":0.00062024436,"threshold_uncertainty_score":0.011123478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51482487,0.0006315232,0.45198825,0.0020891975,0.000106560285,0.00011905801,0.00024190951,0.00015846244,0.029840184],"genre_scores_gemma":[0.9717308,0.0003179504,0.02078341,0.00016708567,0.00006370152,0.00012047958,0.000067733265,0.000023929455,0.006724787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993394,0.00031538663,0.000019915053,0.00011276492,0.00010685873,0.0001057078],"domain_scores_gemma":[0.997449,0.0013124296,0.00047297284,0.00015515243,0.0001780337,0.00043242742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014261194,0.00046238446,0.0006895366,0.0010022217,0.0007091782,0.0016853141,0.0013183528,0.0014275577,0.0027228466],"category_scores_gemma":[0.006468492,0.00034466374,0.00067788287,0.0004753352,0.002479835,0.0031332953,0.0012861136,0.0012062237,0.00017265584],"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.000025147201,0.00001993729,0.00037244547,0.000022452039,0.0000112726275,0.00008212238,0.00009784452,0.03349943,0.00075578684,0.96294534,0.0004179382,0.0017502459],"study_design_scores_gemma":[0.00002162825,0.000036113095,0.0003795364,0.000012596352,0.0000071302065,0.00008071184,0.00008671041,0.42525506,0.00029937163,0.57308596,0.0007173407,0.000017848743],"about_ca_topic_score_codex":0.002280492,"about_ca_topic_score_gemma":0.0017120382,"teacher_disagreement_score":0.0027228466,"about_ca_system_score_codex":0.0016144011,"about_ca_system_score_gemma":0.00063133816,"threshold_uncertainty_score":0.011713386},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007581735,0.0008023354,0.9829487,0.000759504,0.00010164977,0.00028963128,0.00029731003,0.0013169603,0.0059022265],"genre_scores_gemma":[0.10397521,0.0006693524,0.8882559,0.00052402366,0.0002752062,0.00077257527,0.0010981342,0.0005280558,0.0039014842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710447,0.0009299465,0.00016202484,0.0007806127,0.00063186715,0.00039105653],"domain_scores_gemma":[0.99132603,0.006210982,0.0005634218,0.0008673078,0.0006736343,0.0003586455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031657908,0.0033445263,0.0028983157,0.0018516188,0.0013521777,0.003349632,0.004536448,0.0035379063,0.0077600586],"category_scores_gemma":[0.015320706,0.001370984,0.0028566455,0.0027222782,0.0014991623,0.00467786,0.0036998931,0.0044697654,0.002813869],"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.0003982326,0.00048664797,0.0019575243,0.0007880044,0.00021190563,0.00025005284,0.00036307258,0.6015408,0.0033517012,0.06902322,0.030699033,0.29092985],"study_design_scores_gemma":[0.000073692616,0.00004717888,0.00010841993,0.00002152394,0.000020210597,0.000084158084,0.000043486314,0.95953035,0.00050447945,0.03736673,0.0021872332,0.000012612058],"about_ca_topic_score_codex":0.004750364,"about_ca_topic_score_gemma":0.007962108,"teacher_disagreement_score":0.0077600586,"about_ca_system_score_codex":0.0026999088,"about_ca_system_score_gemma":0.0031891055,"threshold_uncertainty_score":0.025959969},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037417233,0.1320815,0.06516603,0.157844,0.5415106,0.0004251814,0.001291004,0.00085627614,0.0634082],"genre_scores_gemma":[0.21030301,0.062480252,0.011232204,0.01645881,0.63781905,0.00067515,0.0011461056,0.0005754539,0.059310004],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979225,0.0006890223,0.00009721707,0.0005437972,0.00057091727,0.00017667477],"domain_scores_gemma":[0.9915837,0.004773818,0.0005796459,0.00044734083,0.0013369893,0.0012784078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028187514,0.0006451734,0.001061576,0.0033429514,0.0021024724,0.0057179937,0.001113586,0.002364777,0.01656933],"category_scores_gemma":[0.008664764,0.00030040834,0.000989526,0.0024700125,0.0021028256,0.0033602526,0.0039744945,0.00371293,0.0023444335],"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.00014858182,0.00015040282,0.002980489,0.001855675,0.00015533273,0.00066908577,0.001944362,0.0011111149,0.0022514535,0.11588632,0.7175178,0.15532944],"study_design_scores_gemma":[0.00004305079,0.0003048486,0.008337217,0.0014952612,0.00014744875,0.0023747783,0.001627028,0.0050610425,0.001178642,0.104545265,0.87480986,0.0000755338],"about_ca_topic_score_codex":0.00052450085,"about_ca_topic_score_gemma":0.0006359854,"teacher_disagreement_score":0.01656933,"about_ca_system_score_codex":0.0012135468,"about_ca_system_score_gemma":0.001476795,"threshold_uncertainty_score":0.055429876},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13719364,0.0005438492,0.8520732,0.00033500284,0.00006864297,0.0001901717,0.0024906923,0.001866179,0.0052385875],"genre_scores_gemma":[0.5436357,0.00040957518,0.44910488,0.000062049025,0.00006298127,0.00034080943,0.0028586222,0.00043522258,0.0030901295],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858,0.00031729534,0.00011417502,0.0004143771,0.00045569421,0.000118490454],"domain_scores_gemma":[0.98891956,0.0046592318,0.0024905747,0.0016661888,0.0017937055,0.00047070955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022778832,0.0005426345,0.00062109943,0.0075220703,0.0010932257,0.0029440764,0.0010256447,0.00071464205,0.0069158603],"category_scores_gemma":[0.022199435,0.00042088743,0.0005581096,0.0048296414,0.0012345609,0.0052527133,0.0019881707,0.0011746348,0.0015287305],"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.00085835194,0.00014434481,0.078342505,0.00072848494,0.00021568421,0.0005031273,0.0041598594,0.07951409,0.04216183,0.17551707,0.008598108,0.6092566],"study_design_scores_gemma":[0.00003094165,0.0001850796,0.04416792,0.00025072167,0.000105122825,0.00068984844,0.0016546448,0.59759116,0.022696353,0.3091837,0.02330246,0.00014203016],"about_ca_topic_score_codex":0.0027438381,"about_ca_topic_score_gemma":0.002741604,"teacher_disagreement_score":0.0075220703,"about_ca_system_score_codex":0.0010161889,"about_ca_system_score_gemma":0.0007577672,"threshold_uncertainty_score":0.0231359},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021646144,0.039382983,0.018351097,0.09967288,0.53088856,0.0009672873,0.06496645,0.0050196783,0.23858653],"genre_scores_gemma":[0.016028035,0.032857344,0.00490809,0.014482382,0.47979948,0.0014849226,0.038907457,0.0019821958,0.4095501],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998095,0.00027106976,0.0002412368,0.00063008897,0.00058410916,0.00017849781],"domain_scores_gemma":[0.98091435,0.009376486,0.0018020124,0.0012640173,0.0025361835,0.004106974],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018588833,0.0026902782,0.0067847664,0.00881018,0.0016277048,0.009187332,0.002993919,0.008802364,0.6633012],"category_scores_gemma":[0.023930306,0.0009386211,0.0010234797,0.011010434,0.0013421611,0.009137779,0.005890575,0.0031121843,0.33850464],"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.000049669,0.000018686833,0.00010920613,0.0011726375,0.000010998273,0.000031649404,0.00002754643,0.00013155774,0.00017994626,0.0070948866,0.9539484,0.037224904],"study_design_scores_gemma":[0.00010015441,0.00011355704,0.0016890842,0.00086271047,0.00004597585,0.0003613893,0.000074375785,0.0012342405,0.00041037504,0.030004913,0.9650514,0.00005185245],"about_ca_topic_score_codex":0.00059957214,"about_ca_topic_score_gemma":0.0009875135,"teacher_disagreement_score":0.6633012,"about_ca_system_score_codex":0.0013333026,"about_ca_system_score_gemma":0.0018057465,"threshold_uncertainty_score":0.4802599},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952846,0.00023609944,0.0020885319,0.00050612754,0.000018877265,0.000023072927,0.00025119953,0.000015293488,0.0015762328],"genre_scores_gemma":[0.99868304,0.00015617313,0.00083468424,0.000031324893,0.000016541475,0.000015382806,0.00014231949,0.0000044626963,0.000115917086],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9942568,0.0036350207,0.00032602064,0.00063283165,0.0008571931,0.0002921686],"domain_scores_gemma":[0.84940034,0.11211019,0.023428861,0.005952211,0.006284405,0.0028239626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066205147,0.0002808213,0.00028148768,0.001690261,0.00074565795,0.0020254354,0.0009247653,0.0008959293,0.0018285051],"category_scores_gemma":[0.0652494,0.00027986843,0.00034589448,0.0023818316,0.0010679552,0.0032482834,0.0015968416,0.0010186926,0.00038338534],"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.00069276616,0.0007764961,0.93174124,0.0002007477,0.00037736932,0.000285243,0.002911201,0.012292715,0.0006951699,0.002030783,0.00150054,0.046495702],"study_design_scores_gemma":[0.000080065176,0.0008981026,0.9026369,0.00017374405,0.00020715166,0.00031652203,0.010256517,0.07567175,0.0012911222,0.005255384,0.0031554927,0.00005737694],"about_ca_topic_score_codex":0.0046688686,"about_ca_topic_score_gemma":0.0033765563,"teacher_disagreement_score":0.0066205147,"about_ca_system_score_codex":0.0007326671,"about_ca_system_score_gemma":0.00051920535,"threshold_uncertainty_score":0.03501302},"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":"review","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01013005,0.6650147,0.04904108,0.15944517,0.028765716,0.00012725119,0.0039179865,0.00021412114,0.08334405],"genre_scores_gemma":[0.10065642,0.73278683,0.025754238,0.02150856,0.052268073,0.0002893974,0.0030328836,0.00031572944,0.06338797],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99958926,0.00013770578,0.000024342562,0.00009891701,0.000112673144,0.00003714577],"domain_scores_gemma":[0.9967038,0.0024526857,0.00010757067,0.00008212761,0.00047410696,0.00017983782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012314914,0.0009895256,0.0006333937,0.0037908955,0.0009152823,0.0027090078,0.00056339765,0.0012154197,0.008919144],"category_scores_gemma":[0.004082457,0.00040841298,0.00071532786,0.005744312,0.00050281145,0.0032010784,0.0009765718,0.0022614647,0.0017233733],"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.00006676422,0.0001901088,0.00675253,0.0017386818,0.00018816133,0.00021634971,0.0010593856,0.0031566948,0.00058138376,0.09478597,0.49168995,0.39957404],"study_design_scores_gemma":[0.000012132636,0.0000920436,0.024268933,0.002431792,0.00016196068,0.00031450117,0.000661406,0.004148266,0.0006358244,0.10032915,0.86686605,0.000077932746],"about_ca_topic_score_codex":0.0073513817,"about_ca_topic_score_gemma":0.016631262,"teacher_disagreement_score":0.008919144,"about_ca_system_score_codex":0.0014988212,"about_ca_system_score_gemma":0.00089341716,"threshold_uncertainty_score":0.029837549},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008136678,0.000056072706,0.9910585,0.00004673702,0.000014414293,0.000012457162,0.000015698686,0.00022535924,0.0004340896],"genre_scores_gemma":[0.5703618,0.00021530666,0.42382723,0.00015879502,0.00006826322,0.00013172482,0.00019546376,0.00015550312,0.0048858486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996977,0.00007060007,0.000016435253,0.000057618247,0.00011346187,0.000044199147],"domain_scores_gemma":[0.99862623,0.0006813761,0.00017737968,0.00019375439,0.00025351733,0.000067711815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010365152,0.0007572763,0.0009445952,0.0005031823,0.0003700067,0.00083533826,0.0014428034,0.0009227616,0.0019162246],"category_scores_gemma":[0.003745835,0.0004888801,0.0004630121,0.0005820448,0.0007827683,0.0014529825,0.0013923482,0.001072248,0.0005654673],"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.00010541849,0.00005890308,0.0010311814,0.000084222665,0.000040965195,0.00009169213,0.00009222559,0.842979,0.0053230776,0.013447743,0.0012589273,0.13548663],"study_design_scores_gemma":[0.0000037015777,0.000011714354,0.000052393803,0.000002594323,0.0000015776372,0.000014695501,0.0000031881275,0.99742717,0.00047708926,0.001838239,0.00016494535,0.000002655476],"about_ca_topic_score_codex":0.0030906496,"about_ca_topic_score_gemma":0.0038432248,"teacher_disagreement_score":0.0030906496,"about_ca_system_score_codex":0.0005207671,"about_ca_system_score_gemma":0.0010010259,"threshold_uncertainty_score":0.00641042},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10456568,0.16994907,0.030102456,0.52100354,0.01803248,0.000091449154,0.004295609,0.00078132073,0.15117839],"genre_scores_gemma":[0.69906884,0.17885019,0.018025404,0.037103474,0.016102552,0.00021285335,0.0031612918,0.0011271395,0.046348237],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9954965,0.001510925,0.00031309735,0.00061222026,0.0016417789,0.00042542003],"domain_scores_gemma":[0.9453126,0.035854235,0.0032724785,0.0035630346,0.008427077,0.00357046],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.010979645,0.0006177129,0.00087572844,0.0114632035,0.0039525153,0.012683614,0.0012900395,0.0025429234,0.011239356],"category_scores_gemma":[0.056386743,0.0003475497,0.00080780603,0.019372959,0.0052689263,0.02528506,0.0052053244,0.004633123,0.002573846],"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.0002094532,0.00009020592,0.018019903,0.0014414459,0.0001617748,0.00058740523,0.028604133,0.0014192121,0.00038957025,0.25447336,0.19017735,0.5044262],"study_design_scores_gemma":[0.000012717771,0.000052891708,0.011194084,0.0017962038,0.00004428093,0.00033532293,0.021532914,0.0008229752,0.00039287828,0.16118255,0.8025648,0.000068435205],"about_ca_topic_score_codex":0.0038705121,"about_ca_topic_score_gemma":0.005637945,"teacher_disagreement_score":0.98902035,"about_ca_system_score_codex":0.0044562505,"about_ca_system_score_gemma":0.0037966068,"threshold_uncertainty_score":0.058066547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061412347,0.00017620977,0.9847666,0.00013604882,0.00010354896,0.00017590285,0.00054162985,0.0067842724,0.0011745805],"genre_scores_gemma":[0.082759395,0.00013397602,0.909664,0.00020256918,0.00007503242,0.0003787762,0.0020194415,0.0007046137,0.0040622414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913436,0.0001751892,0.000037647336,0.000283498,0.0002985237,0.00007080261],"domain_scores_gemma":[0.99835396,0.0007209925,0.00008087013,0.00036461922,0.0003528289,0.00012663705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012710165,0.001028913,0.0012932288,0.0024907498,0.0013925572,0.0010738673,0.0031491348,0.0014496546,0.004498401],"category_scores_gemma":[0.0051584607,0.00075381424,0.00089269894,0.00165894,0.0006473097,0.0021278944,0.0029944044,0.0015395685,0.002048277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041777815,0.00034394907,0.0031858222,0.00033654956,0.00029221116,0.0002511911,0.00016863915,0.1013912,0.013948055,0.017236793,0.038191278,0.8242365],"study_design_scores_gemma":[0.000067689565,0.00004705423,0.00026125176,0.000012789233,0.000025744203,0.00015309328,0.000025177453,0.97471875,0.004705102,0.012338225,0.007626657,0.000018381996],"about_ca_topic_score_codex":0.004413224,"about_ca_topic_score_gemma":0.011115041,"teacher_disagreement_score":0.004498401,"about_ca_system_score_codex":0.00066310685,"about_ca_system_score_gemma":0.0013542294,"threshold_uncertainty_score":0.015048623},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3201693,0.0010004865,0.67514086,0.0004345959,0.000025732126,0.000069623726,0.00039951375,0.00027548446,0.002484416],"genre_scores_gemma":[0.95256734,0.00028379474,0.046454113,0.000039161936,0.000036097765,0.00004278025,0.00023936875,0.000034239183,0.00030303773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989336,0.00036893945,0.000048538277,0.00029876444,0.00026314703,0.00008692369],"domain_scores_gemma":[0.9932469,0.0033709798,0.0016643226,0.0008200634,0.0006791187,0.00021854711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020007656,0.00034605112,0.0005012598,0.002633254,0.00056936144,0.0013388087,0.00069123413,0.0007716277,0.00046619214],"category_scores_gemma":[0.01601436,0.00038830607,0.00039105094,0.0013921519,0.0018379373,0.002004739,0.0011493104,0.0009503102,0.00016401005],"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.0002875971,0.00009829388,0.054338202,0.00052748097,0.00028725626,0.00056197145,0.0017924118,0.46337458,0.051873986,0.24575934,0.0031301072,0.17796879],"study_design_scores_gemma":[0.000010808614,0.000045391625,0.021847382,0.00004188945,0.000027553318,0.00021249049,0.00024720377,0.79539394,0.00362844,0.17647548,0.0020230438,0.000046421465],"about_ca_topic_score_codex":0.00153963,"about_ca_topic_score_gemma":0.0013663456,"teacher_disagreement_score":0.002633254,"about_ca_system_score_codex":0.0008417239,"about_ca_system_score_gemma":0.000531384,"threshold_uncertainty_score":0.010581195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04557912,0.0022280843,0.9108145,0.0010817247,0.00019099728,0.00060352625,0.0021958833,0.032431357,0.004874799],"genre_scores_gemma":[0.34843844,0.0010473377,0.62256676,0.0017209308,0.00023603828,0.00073705777,0.009653064,0.0018663921,0.013733878],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99841416,0.00054857234,0.00010704004,0.00054755574,0.0002626908,0.00012001632],"domain_scores_gemma":[0.9970988,0.0013217003,0.00016105351,0.0009595256,0.00034273844,0.000116221636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032521512,0.0024179053,0.0014872553,0.0019191909,0.00059637765,0.0017137186,0.0031406065,0.0026491636,0.005236325],"category_scores_gemma":[0.008974557,0.0009488378,0.0018069363,0.0013114618,0.00067573175,0.006773741,0.0024315536,0.0027118667,0.005164626],"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.0008899194,0.00064603507,0.0037800772,0.0007549948,0.00051401346,0.0004678285,0.00040792354,0.24526031,0.017174045,0.014085587,0.063714966,0.6523044],"study_design_scores_gemma":[0.00007813091,0.00021197188,0.00021676887,0.00002265698,0.00007296491,0.00023338934,0.000056122622,0.97636193,0.0057980735,0.010230261,0.00667903,0.000038694434],"about_ca_topic_score_codex":0.0058973245,"about_ca_topic_score_gemma":0.009288092,"teacher_disagreement_score":0.0058973245,"about_ca_system_score_codex":0.0014230948,"about_ca_system_score_gemma":0.0012689402,"threshold_uncertainty_score":0.017517269},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057259753,0.0009103724,0.9297337,0.00087003736,0.00007152811,0.00010638922,0.0006753903,0.0005070949,0.009865666],"genre_scores_gemma":[0.87388945,0.0013204039,0.118643485,0.00025872662,0.00013237218,0.00019606728,0.00037557597,0.00024146859,0.004942563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987948,0.00071890716,0.00004340223,0.00019803329,0.00016702242,0.00007772703],"domain_scores_gemma":[0.9962101,0.0029387604,0.0003590714,0.0002115846,0.00017209777,0.00010837708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016692494,0.0005884051,0.0007033988,0.002776649,0.00054564263,0.001687141,0.0014222641,0.001108661,0.004354356],"category_scores_gemma":[0.008352485,0.00042191704,0.0011730068,0.0015404145,0.0011859179,0.002792111,0.0014571553,0.0010032132,0.00064548646],"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.0000428228,0.000048891747,0.0029235247,0.00019051906,0.00011388049,0.00027094583,0.0001775926,0.6370305,0.002061263,0.34220824,0.002796567,0.0121353],"study_design_scores_gemma":[0.00000789346,0.000011755412,0.00041258847,0.000022588747,0.000014956059,0.00007931714,0.000018173345,0.86613756,0.0002173007,0.1320083,0.0010538734,0.000015748552],"about_ca_topic_score_codex":0.0044246186,"about_ca_topic_score_gemma":0.0031300457,"teacher_disagreement_score":0.0044246186,"about_ca_system_score_codex":0.0011113479,"about_ca_system_score_gemma":0.0005306891,"threshold_uncertainty_score":0.014566779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12046786,0.0011104926,0.8688916,0.002454149,0.00010420275,0.00022084982,0.0035408125,0.00073421135,0.0024758906],"genre_scores_gemma":[0.89982146,0.0017098046,0.08962838,0.00022421157,0.00024463504,0.0005158777,0.004044945,0.00011349181,0.0036972058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999065,0.0002798603,0.00007308018,0.00023627607,0.00023846759,0.00010735495],"domain_scores_gemma":[0.994718,0.0037745151,0.00060627796,0.00029774092,0.0005053396,0.000098103104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030196845,0.0008173489,0.0011041594,0.0020968337,0.0008694958,0.0015721739,0.0017144073,0.001543647,0.0015086081],"category_scores_gemma":[0.012499037,0.0005787285,0.00094609533,0.0023442307,0.0007485767,0.0041426243,0.0009596966,0.0014793581,0.00070252514],"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.00016238498,0.000092557704,0.014943379,0.00017639133,0.00009353584,0.0002460713,0.00030612852,0.89695996,0.002361542,0.045569126,0.0045504207,0.03453848],"study_design_scores_gemma":[0.000005657454,0.000009664784,0.0007587275,0.000005065465,0.000006820613,0.0000322279,0.000014326216,0.992396,0.0001201594,0.0061137164,0.00052951626,0.0000080883165],"about_ca_topic_score_codex":0.014628284,"about_ca_topic_score_gemma":0.013818713,"teacher_disagreement_score":0.014628284,"about_ca_system_score_codex":0.0013351878,"about_ca_system_score_gemma":0.00085890514,"threshold_uncertainty_score":0.029086292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5542453,0.00063709234,0.43455628,0.0006686143,0.00003190171,0.0000792282,0.00018732276,0.00014875576,0.009445443],"genre_scores_gemma":[0.9921795,0.0003299892,0.00600276,0.00002304031,0.000013385955,0.00002481856,0.000040482148,0.000011179862,0.0013748036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996959,0.00010886609,0.000010928993,0.00007803522,0.000054646167,0.00005157666],"domain_scores_gemma":[0.998475,0.00085098343,0.00033449964,0.000096261865,0.0001449476,0.00009824419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008387135,0.00043018354,0.00034318105,0.001472055,0.00047888482,0.001086468,0.0006271782,0.00062869384,0.00210436],"category_scores_gemma":[0.0049738237,0.00029246102,0.000807654,0.0008693803,0.0011641036,0.0030064546,0.0009987163,0.0007346278,0.0001334984],"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.00010554785,0.00007046347,0.019251367,0.000112580565,0.00013099352,0.0007295773,0.0008554001,0.5788943,0.004933002,0.36696216,0.00083240133,0.027122049],"study_design_scores_gemma":[0.0000066025773,0.00003314409,0.003454089,0.000011246872,0.00003619507,0.00009325626,0.00015899228,0.9202612,0.00046846355,0.0749199,0.00054089114,0.000015905895],"about_ca_topic_score_codex":0.003776251,"about_ca_topic_score_gemma":0.0027648243,"teacher_disagreement_score":0.003776251,"about_ca_system_score_codex":0.00105802,"about_ca_system_score_gemma":0.00043939138,"threshold_uncertainty_score":0.007676542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30845022,0.00047999463,0.6807276,0.0011849424,0.0000486384,0.00009948992,0.00046509522,0.00036156835,0.00818248],"genre_scores_gemma":[0.92538935,0.0004357714,0.07058078,0.0000987569,0.0000275599,0.00007515279,0.0001612984,0.0000640115,0.0031673731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969876,0.00019942163,0.000007375938,0.000033670574,0.000032798063,0.000028074764],"domain_scores_gemma":[0.99773395,0.0017833873,0.00017261041,0.000069017005,0.00017005658,0.00007091311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010634668,0.0004663106,0.0004037682,0.00075501483,0.0004967016,0.0006036073,0.0011009155,0.0009804636,0.0013195989],"category_scores_gemma":[0.0043208012,0.00023134713,0.000489785,0.0005983319,0.0004894186,0.00079764036,0.0006374591,0.0006093744,0.00012759032],"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.000019760524,0.00001985331,0.0015404895,0.000017403348,0.000019718735,0.000066756234,0.00005555449,0.9832008,0.0003895939,0.010825692,0.00030873893,0.0035357098],"study_design_scores_gemma":[0.0000029883022,0.000006613861,0.00021841317,0.0000020892012,0.0000040037585,0.000007008297,0.000011509889,0.9969254,0.000054004162,0.0025829473,0.00018203216,0.0000028705515],"about_ca_topic_score_codex":0.06653444,"about_ca_topic_score_gemma":0.05629205,"teacher_disagreement_score":0.06653444,"about_ca_system_score_codex":0.0014781064,"about_ca_system_score_gemma":0.0008751529,"threshold_uncertainty_score":0.1322943},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013019901,0.00011763297,0.9980355,0.00007124173,0.0000139890235,0.000016634665,0.000010594723,0.000047579713,0.00038484312],"genre_scores_gemma":[0.5759105,0.001857487,0.4177852,0.00042227568,0.00031151154,0.0004867219,0.00018201716,0.00018676766,0.002857458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984675,0.00059138983,0.00008120935,0.00045017173,0.00031900895,0.000090751746],"domain_scores_gemma":[0.9939803,0.004265284,0.0006931275,0.00037883758,0.0005679294,0.00011451557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002587183,0.0018777039,0.0013394635,0.0013758425,0.00045174232,0.0010745003,0.0015578585,0.0017077301,0.0014282906],"category_scores_gemma":[0.011717601,0.0007190915,0.001314155,0.0011657547,0.001923776,0.0019461421,0.0018523028,0.0013964283,0.0003844709],"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.00004353452,0.000026672033,0.0003273031,0.00018015773,0.00006390604,0.00007624387,0.0000989145,0.91171265,0.0032146329,0.0509561,0.0006794474,0.032620456],"study_design_scores_gemma":[0.000009984896,0.000057855115,0.00007661875,0.000014454596,0.000016762346,0.000024235604,0.000009312237,0.97966343,0.0005824136,0.018885344,0.0006485561,0.00001106364],"about_ca_topic_score_codex":0.0016381002,"about_ca_topic_score_gemma":0.0010569994,"teacher_disagreement_score":0.002587183,"about_ca_system_score_codex":0.00096563896,"about_ca_system_score_gemma":0.0010589502,"threshold_uncertainty_score":0.013682485},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015952712,0.0001718376,0.9823599,0.00028102795,0.00007523943,0.000021597263,0.00025527508,0.00069788867,0.00018449905],"genre_scores_gemma":[0.60553175,0.0005684219,0.38375357,0.00024363556,0.00036262805,0.00020542053,0.0030454083,0.00047943334,0.005809729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978536,0.00095327635,0.000100114565,0.00073231454,0.00020679136,0.00015387786],"domain_scores_gemma":[0.98330265,0.010719108,0.0014741985,0.0026727312,0.0013860764,0.0004453093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050901524,0.0015605942,0.0023089226,0.0022867771,0.0007980608,0.0019204774,0.004629929,0.0043450855,0.0019539888],"category_scores_gemma":[0.029590407,0.0013974733,0.0021664165,0.002862666,0.0017259627,0.004127844,0.0019610343,0.005708857,0.0016186461],"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.00020021715,0.00023995878,0.004523342,0.000105045794,0.00018065546,0.00014494425,0.00012692323,0.8959016,0.0008417528,0.018986426,0.0049425303,0.073806666],"study_design_scores_gemma":[0.0000053429367,0.00000855437,0.00020370175,0.0000051501333,0.0000068048253,0.0000124826,0.000006623885,0.9875668,0.00014899514,0.011834785,0.00019367783,0.00000713177],"about_ca_topic_score_codex":0.0071794037,"about_ca_topic_score_gemma":0.0061019296,"teacher_disagreement_score":0.0071794037,"about_ca_system_score_codex":0.000993008,"about_ca_system_score_gemma":0.0013589892,"threshold_uncertainty_score":0.026919603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020080676,0.00010246898,0.97832096,0.00020736903,0.00002314345,0.000029778053,0.000023185179,0.00021582202,0.0009965757],"genre_scores_gemma":[0.92104924,0.00012114434,0.077632576,0.00006357206,0.000026527983,0.00004431785,0.000041637133,0.000029796243,0.0009911616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900085,0.0003208705,0.000044961416,0.00024128013,0.00027767333,0.00011430422],"domain_scores_gemma":[0.99775285,0.0011850443,0.0003888732,0.00026131785,0.00031063205,0.00010128726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013972104,0.0008300996,0.00095755525,0.0004817576,0.00061174773,0.0014496503,0.0014027489,0.0009860153,0.0008589415],"category_scores_gemma":[0.005727563,0.00036802364,0.00051910913,0.0006419916,0.0013141218,0.0021153812,0.0020371801,0.0014356585,0.00013860877],"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.00010910735,0.00004699272,0.0014323964,0.00006123754,0.000034239874,0.00017018136,0.00006795789,0.92824924,0.0043117106,0.027117262,0.00082573807,0.037573993],"study_design_scores_gemma":[0.0000018188243,0.0000060664033,0.00003584727,9.274827e-7,0.000001376933,0.000014984824,0.0000034448167,0.995943,0.0002744411,0.0036308814,0.00008522041,0.0000020361551],"about_ca_topic_score_codex":0.0039336635,"about_ca_topic_score_gemma":0.003176635,"teacher_disagreement_score":0.0039336635,"about_ca_system_score_codex":0.0008723647,"about_ca_system_score_gemma":0.0012951783,"threshold_uncertainty_score":0.00782156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04664516,0.0001240015,0.95017254,0.0003159271,0.000022957754,0.00006471158,0.00042599285,0.0002484425,0.001980147],"genre_scores_gemma":[0.6770809,0.0004978951,0.31608108,0.00017474178,0.00006274515,0.0002789002,0.001499149,0.00026318725,0.0040614116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864024,0.0006056512,0.00005777062,0.00035612585,0.00025112822,0.00008922704],"domain_scores_gemma":[0.99185246,0.0044904426,0.0011494835,0.0014050804,0.0007837773,0.00031865804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022144017,0.00087688444,0.0007648177,0.0023091973,0.00078702864,0.0018850825,0.0015985636,0.0011274655,0.0030778619],"category_scores_gemma":[0.015925422,0.0007990139,0.0010942963,0.0013374379,0.0021064288,0.0034967528,0.0026411053,0.0019234355,0.0006758744],"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.0001437117,0.000045011868,0.0051540257,0.00012641733,0.0000699858,0.00019929076,0.0005629707,0.5703312,0.002540407,0.38264397,0.0022030855,0.035979867],"study_design_scores_gemma":[0.00000787538,0.000012591857,0.00045914482,0.000015623336,0.0000064122937,0.000037757476,0.00004930339,0.8490914,0.0004980186,0.14876904,0.0010393923,0.000013388963],"about_ca_topic_score_codex":0.0048310007,"about_ca_topic_score_gemma":0.0051443973,"teacher_disagreement_score":0.0048310007,"about_ca_system_score_codex":0.0018842465,"about_ca_system_score_gemma":0.0010697076,"threshold_uncertainty_score":0.013671279},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4645994,0.0008557771,0.5196007,0.0012806527,0.0000953725,0.00008048352,0.00014399213,0.0002555126,0.013088174],"genre_scores_gemma":[0.98319787,0.00031884966,0.013917201,0.00008594687,0.000059549726,0.00005301961,0.000037396923,0.000037423753,0.0022927802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996381,0.00013668838,0.000014853147,0.000096517855,0.00005854562,0.00005528522],"domain_scores_gemma":[0.99734604,0.0013724085,0.00060762063,0.0002539892,0.00016108931,0.0002587819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010647004,0.0004276029,0.00046280248,0.0009994732,0.00063334726,0.0013821424,0.0007898995,0.0011020504,0.0025596214],"category_scores_gemma":[0.0069078277,0.00036015475,0.0007056117,0.00044964024,0.0021431667,0.0025752555,0.001020181,0.0011945957,0.00019995742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051699444,0.000056010464,0.008171036,0.00013411812,0.00010942656,0.00046458028,0.0010791504,0.18453929,0.00932977,0.78132004,0.0015391543,0.01320577],"study_design_scores_gemma":[0.000010274032,0.00003017679,0.005512155,0.00001744135,0.000026711783,0.00013482111,0.00015774922,0.58410275,0.000499468,0.4082258,0.0012496761,0.00003296641],"about_ca_topic_score_codex":0.0022148264,"about_ca_topic_score_gemma":0.001401702,"teacher_disagreement_score":0.0025596214,"about_ca_system_score_codex":0.000997703,"about_ca_system_score_gemma":0.0004069372,"threshold_uncertainty_score":0.008562803},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038215898,0.00016844552,0.9943796,0.00008830928,0.000054704564,0.00007936121,0.000115712515,0.00054085156,0.00075141987],"genre_scores_gemma":[0.12356151,0.0003035711,0.87107706,0.00025281496,0.00012580548,0.0003655542,0.0008662493,0.00022124322,0.0032261738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971818,0.0008115836,0.00014913241,0.00075093436,0.00087331666,0.00023321637],"domain_scores_gemma":[0.99656206,0.0014233941,0.00036195904,0.00042075166,0.0010159833,0.00021587987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021231207,0.00096965634,0.0011611981,0.0047980966,0.0015886523,0.001595739,0.0020876862,0.0016577162,0.002139675],"category_scores_gemma":[0.00880499,0.00062551,0.0014471483,0.0034167771,0.0012633007,0.0023671428,0.0024143378,0.0015565663,0.0011753623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003380026,0.00019835199,0.0065678144,0.00068308273,0.00028763435,0.00049403927,0.000683517,0.08409913,0.036111467,0.09915926,0.018213963,0.7531639],"study_design_scores_gemma":[0.00004409699,0.00008783309,0.0018657956,0.00006837083,0.00006025642,0.00087941805,0.0001313215,0.918186,0.009832264,0.05338453,0.015373627,0.000086519205],"about_ca_topic_score_codex":0.0042842804,"about_ca_topic_score_gemma":0.0040919427,"teacher_disagreement_score":0.0047980966,"about_ca_system_score_codex":0.00094126083,"about_ca_system_score_gemma":0.0016313678,"threshold_uncertainty_score":0.011228263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919674,0.000110294015,0.007464077,0.000026578628,0.0000014461874,0.0000061086494,0.000095661846,0.000015536285,0.00031295317],"genre_scores_gemma":[0.9978993,0.000028100232,0.0019501392,0.000007765004,0.0000016350137,0.0000056915515,0.000057781843,0.0000024211224,0.000047090776],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996679,0.00007654499,0.000027742195,0.00011883002,0.000060294547,0.000048625312],"domain_scores_gemma":[0.99740183,0.0009978921,0.0010817088,0.00022968443,0.00013682475,0.00015196206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083569484,0.00022607324,0.0002521812,0.0008791185,0.0004465654,0.000665688,0.00044980462,0.00043200754,0.0005607789],"category_scores_gemma":[0.0035417327,0.00013511743,0.0003084151,0.0004764012,0.00067410315,0.001151298,0.0009511259,0.00032607248,0.000058980822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002496298,0.000062588944,0.83585715,0.00019544362,0.00024387575,0.00021141244,0.0008902689,0.0694196,0.070144735,0.0027229772,0.0001369391,0.01986533],"study_design_scores_gemma":[0.0000070717374,0.00013020575,0.87013954,0.000026042911,0.000062674386,0.00029068725,0.0009956523,0.11565075,0.007326215,0.0045840666,0.0007457457,0.000041341806],"about_ca_topic_score_codex":0.00348218,"about_ca_topic_score_gemma":0.0051870574,"teacher_disagreement_score":0.00348218,"about_ca_system_score_codex":0.00061809487,"about_ca_system_score_gemma":0.00021839609,"threshold_uncertainty_score":0.0069238544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051306766,0.0012142474,0.93797,0.00043449734,0.00029895164,0.00019515272,0.0006885852,0.0041671726,0.0037247362],"genre_scores_gemma":[0.34476444,0.0005810714,0.64159137,0.0003061065,0.0005998126,0.00022435686,0.002724743,0.00054627075,0.0086618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973984,0.00060737616,0.00010767601,0.00059679686,0.0010775141,0.00021222542],"domain_scores_gemma":[0.9911,0.0048474683,0.0005265657,0.0010210965,0.0021133916,0.00039144757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002750234,0.0019638892,0.0022595,0.006027711,0.0013679503,0.0019291304,0.00286606,0.0024876771,0.0037598424],"category_scores_gemma":[0.014004529,0.00090993516,0.001438499,0.0043095,0.00067522965,0.0032971215,0.0027582783,0.0022897185,0.003647666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004409286,0.00062285597,0.008914988,0.00027426044,0.0004740264,0.00012886547,0.000098459466,0.0571617,0.0234145,0.005247157,0.018835725,0.88438654],"study_design_scores_gemma":[0.00004192548,0.00009449665,0.0018339367,0.000023340475,0.00008902505,0.00018091117,0.000045084173,0.97885656,0.0064531555,0.010403617,0.0019511539,0.000026877686],"about_ca_topic_score_codex":0.004157586,"about_ca_topic_score_gemma":0.0077247554,"teacher_disagreement_score":0.006027711,"about_ca_system_score_codex":0.0005865353,"about_ca_system_score_gemma":0.0008363266,"threshold_uncertainty_score":0.014544785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38450408,0.013714843,0.48053372,0.005604995,0.0033230975,0.0009211985,0.034427762,0.021441907,0.055528395],"genre_scores_gemma":[0.58677596,0.0013601901,0.365185,0.0008868458,0.000604111,0.00052402605,0.02931979,0.0011271898,0.014216908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969708,0.0012598557,0.00014442726,0.00058340526,0.0007045172,0.0003369517],"domain_scores_gemma":[0.9918726,0.004029367,0.00038769247,0.0018549085,0.001295359,0.0005600908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037966208,0.0014389113,0.0013221998,0.002726883,0.0012948834,0.0022680839,0.0027292804,0.0027695035,0.005603422],"category_scores_gemma":[0.019129718,0.00044052457,0.001078527,0.002563276,0.0007206536,0.0025749833,0.0026971074,0.0019347656,0.0022369418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016858659,0.0011298083,0.008720147,0.001379385,0.0006271627,0.00022338536,0.00016404716,0.2933175,0.00632799,0.02109064,0.17164221,0.4936919],"study_design_scores_gemma":[0.00013572625,0.00032215728,0.0020098756,0.00006862874,0.000055792003,0.00016041983,0.000072229,0.954158,0.004587347,0.027144734,0.01125332,0.000031848922],"about_ca_topic_score_codex":0.007080064,"about_ca_topic_score_gemma":0.010067483,"teacher_disagreement_score":0.007080064,"about_ca_system_score_codex":0.0011647475,"about_ca_system_score_gemma":0.0014923356,"threshold_uncertainty_score":0.020078719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1384693,0.012114886,0.6849917,0.007665472,0.004467543,0.000609123,0.034727212,0.016416855,0.10053786],"genre_scores_gemma":[0.31146163,0.001550751,0.6040003,0.0012121606,0.0009415456,0.0005935218,0.0480267,0.0029559354,0.02925745],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997428,0.000981328,0.00010041794,0.0005956967,0.0006946073,0.00019980322],"domain_scores_gemma":[0.9915803,0.0046252045,0.00030646104,0.0015589818,0.0014118627,0.00051707635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032358172,0.0012723095,0.0010300154,0.0023897088,0.0016296111,0.0024997045,0.0033534532,0.0026086147,0.009831619],"category_scores_gemma":[0.018369302,0.00048787965,0.00096285396,0.0033533114,0.001200332,0.002506064,0.002331962,0.0019855013,0.004087053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008739967,0.00058364327,0.0026383759,0.0014876375,0.00025202704,0.00029791702,0.0002776352,0.17558633,0.0050073257,0.056051143,0.40646625,0.35047773],"study_design_scores_gemma":[0.00017134508,0.00023429724,0.001831014,0.00013531432,0.00004486699,0.00045921758,0.00014873054,0.81850857,0.0072060516,0.10919372,0.062019136,0.000047716407],"about_ca_topic_score_codex":0.004737502,"about_ca_topic_score_gemma":0.0073036077,"teacher_disagreement_score":0.009831619,"about_ca_system_score_codex":0.0010427858,"about_ca_system_score_gemma":0.0010494541,"threshold_uncertainty_score":0.03289002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9161796,0.0003947553,0.07387129,0.00071403483,0.0000384634,0.00035881027,0.00042226503,0.00013473941,0.007886147],"genre_scores_gemma":[0.9840974,0.00018549585,0.014580018,0.000020553316,0.000009437774,0.00005331633,0.0001395316,0.000012067091,0.0009021601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992229,0.00044337468,0.000026509711,0.00008620856,0.00014861918,0.0000722643],"domain_scores_gemma":[0.9958968,0.0031861458,0.00028033537,0.00022788736,0.00026494786,0.00014387966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014307472,0.00058448245,0.00032307004,0.0011797054,0.0007359455,0.0010472419,0.0008725168,0.0011186901,0.0014116028],"category_scores_gemma":[0.0050046532,0.00018210337,0.00040969456,0.0013638684,0.00089197623,0.0010435436,0.0006926869,0.0006649839,0.00013144239],"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.00031710576,0.0003586577,0.032745067,0.00025162747,0.000093931674,0.00549196,0.00065622834,0.89838713,0.0022289408,0.018713737,0.0034455496,0.037310068],"study_design_scores_gemma":[0.00006682811,0.0001984407,0.009908571,0.000039949435,0.00005162205,0.001035643,0.0010654256,0.972375,0.0022169172,0.009802602,0.0032087958,0.000030134774],"about_ca_topic_score_codex":0.012318045,"about_ca_topic_score_gemma":0.015214662,"teacher_disagreement_score":0.012318045,"about_ca_system_score_codex":0.0018484964,"about_ca_system_score_gemma":0.0006692781,"threshold_uncertainty_score":0.024492681},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26757216,0.0035173066,0.69414324,0.0033007269,0.00016450773,0.00018279934,0.0009894005,0.0010490934,0.029080747],"genre_scores_gemma":[0.96729827,0.0027608457,0.02601869,0.00025207805,0.0001763878,0.00019065739,0.00030060366,0.00009493707,0.0029075677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995192,0.00016812595,0.000017562552,0.00012345049,0.00010846087,0.000063314095],"domain_scores_gemma":[0.9952166,0.0028997285,0.00093735167,0.00041029058,0.0003515089,0.00018449876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010372467,0.00049559854,0.00052953704,0.0017737107,0.0004813101,0.00107834,0.0008842187,0.0012748004,0.0018946562],"category_scores_gemma":[0.011053723,0.00037218683,0.00046490363,0.0013453342,0.0014702764,0.00290016,0.0008042978,0.0008725484,0.0003281488],"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.000027353197,0.000019415975,0.0033203517,0.00013422166,0.000037441692,0.00026542356,0.00020052651,0.09050191,0.0023557027,0.8910779,0.0029037562,0.009155981],"study_design_scores_gemma":[0.000018878796,0.000026096579,0.005429997,0.000057814254,0.00003862953,0.00066295627,0.00014910144,0.32984278,0.0010952197,0.65615064,0.0064821034,0.000045834917],"about_ca_topic_score_codex":0.0017416817,"about_ca_topic_score_gemma":0.0017430343,"teacher_disagreement_score":0.0018946562,"about_ca_system_score_codex":0.0010061518,"about_ca_system_score_gemma":0.0004406237,"threshold_uncertainty_score":0.007300198},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09374807,0.00026925115,0.87796384,0.0011764861,0.00036963332,0.0004831223,0.0074131335,0.016877038,0.0016993991],"genre_scores_gemma":[0.511819,0.00028427402,0.47673416,0.00025671534,0.00016449693,0.0006917639,0.0070709186,0.00044790274,0.0025307776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992223,0.00038833678,0.000051640305,0.00017189795,0.00012672954,0.00003909742],"domain_scores_gemma":[0.9932808,0.004978776,0.00034066808,0.000518053,0.0006735904,0.00020804623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015765587,0.0008861379,0.00034576326,0.0011397158,0.0003890186,0.0010055734,0.0005489672,0.0007800448,0.0029125095],"category_scores_gemma":[0.015415148,0.00028321537,0.0005517603,0.00058056763,0.0003038079,0.0020692507,0.0013140541,0.0011858592,0.0013072243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019895067,0.0006002513,0.029206153,0.0016694107,0.00016857621,0.0012463178,0.006290108,0.09808627,0.054029856,0.021418326,0.048422936,0.7368724],"study_design_scores_gemma":[0.00007712649,0.00044142833,0.007896672,0.00007783711,0.00005013588,0.00025197802,0.0013559002,0.9020976,0.01479228,0.05217657,0.020694856,0.000087694316],"about_ca_topic_score_codex":0.0019509624,"about_ca_topic_score_gemma":0.0050768927,"teacher_disagreement_score":0.0029125095,"about_ca_system_score_codex":0.0005324657,"about_ca_system_score_gemma":0.0007798225,"threshold_uncertainty_score":0.009743333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01848088,0.00030730825,0.97721773,0.0003397935,0.000034963163,0.0000660936,0.00007857182,0.0000513936,0.003423338],"genre_scores_gemma":[0.6796759,0.000799738,0.31675348,0.00017377923,0.00012774889,0.00023876196,0.00022592576,0.000025405234,0.0019792523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977952,0.0010846865,0.00010308703,0.00043804952,0.0004638753,0.00011505796],"domain_scores_gemma":[0.9968989,0.0020130794,0.0003544013,0.00017267956,0.0003925915,0.00016837103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032619035,0.00085979444,0.00088997616,0.0018531467,0.00083241414,0.0020660737,0.0011830482,0.0010200342,0.002708651],"category_scores_gemma":[0.005880603,0.0004067902,0.001418909,0.0017764363,0.0017277581,0.0042644828,0.0013777687,0.0015522216,0.00022190905],"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.00006962591,0.00010469066,0.0019005107,0.00024935327,0.00019821755,0.00025177267,0.0005163671,0.33432844,0.0013977283,0.6129506,0.001210965,0.046821643],"study_design_scores_gemma":[0.000005923575,0.000032099044,0.00034572277,0.00002327147,0.00002788941,0.000040775685,0.00008390791,0.70301455,0.00021277498,0.29511186,0.0010847917,0.000016470529],"about_ca_topic_score_codex":0.003741787,"about_ca_topic_score_gemma":0.0043980666,"teacher_disagreement_score":0.003741787,"about_ca_system_score_codex":0.0023847565,"about_ca_system_score_gemma":0.0014876039,"threshold_uncertainty_score":0.017302692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008755501,0.000676481,0.9818138,0.0005306268,0.0002477389,0.00023447062,0.00035920544,0.0010366049,0.0063456064],"genre_scores_gemma":[0.25385612,0.0007900236,0.7256039,0.0005685571,0.00049079483,0.00064453343,0.0010921973,0.0007631797,0.016190633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952685,0.0013429769,0.00015358433,0.0010724161,0.00149428,0.0006682422],"domain_scores_gemma":[0.98529714,0.008346614,0.00043049813,0.0032369944,0.0019342565,0.00075449975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058966675,0.0024937403,0.004252432,0.002296524,0.0033078825,0.0039389753,0.011395476,0.0037154818,0.019001657],"category_scores_gemma":[0.032987192,0.0011888716,0.002215091,0.0056524584,0.0032374167,0.0075048674,0.005928663,0.0049423757,0.0041742544],"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.0010103264,0.00039192048,0.00083010073,0.00034835906,0.00012590016,0.00009013706,0.0003035029,0.6553835,0.0023031093,0.16669674,0.030726785,0.14178951],"study_design_scores_gemma":[0.000034665074,0.000036863847,0.000086260916,0.000019267523,0.000020374873,0.000039290568,0.00004558494,0.92004776,0.00042838225,0.07757507,0.0016484073,0.000018127594],"about_ca_topic_score_codex":0.016989706,"about_ca_topic_score_gemma":0.020431364,"teacher_disagreement_score":0.019001657,"about_ca_system_score_codex":0.006922236,"about_ca_system_score_gemma":0.006351816,"threshold_uncertainty_score":0.06356692},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16009478,0.004679332,0.7954819,0.0059953677,0.0007403379,0.00019529577,0.0006988477,0.0015469298,0.030567233],"genre_scores_gemma":[0.86152107,0.003327126,0.104904026,0.0019471884,0.00213242,0.0007475418,0.00093846617,0.00081140094,0.023670819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677926,0.001267856,0.00013952688,0.0006321892,0.0007551194,0.00042602408],"domain_scores_gemma":[0.94988334,0.034512896,0.0035765767,0.003492456,0.0033064205,0.005228268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060666464,0.0014257847,0.0040222947,0.007352495,0.0027313514,0.005374031,0.0054956796,0.0049380134,0.0071952115],"category_scores_gemma":[0.048308417,0.001408955,0.00178977,0.0037128981,0.0060869623,0.011498167,0.0048525357,0.0068788663,0.001024257],"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.00006328166,0.00008573087,0.00058969867,0.00018554107,0.000035122124,0.00016172256,0.00022168293,0.013644094,0.0008415439,0.9757405,0.0035197341,0.0049114097],"study_design_scores_gemma":[0.000027984963,0.000015167455,0.00039818833,0.00005036851,0.000017193192,0.00009476423,0.000046719,0.21525952,0.00013332545,0.78292096,0.0010088154,0.000027012959],"about_ca_topic_score_codex":0.0033272475,"about_ca_topic_score_gemma":0.003081296,"teacher_disagreement_score":0.007352495,"about_ca_system_score_codex":0.00431695,"about_ca_system_score_gemma":0.0018593974,"threshold_uncertainty_score":0.03208387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017459169,0.0002359248,0.9793919,0.00037454534,0.000076802404,0.00008396569,0.00065395824,0.00024567067,0.0014780717],"genre_scores_gemma":[0.74390495,0.000876721,0.22544694,0.00038709916,0.00032838053,0.00090888754,0.0025401176,0.00030789978,0.025299024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750924,0.001267864,0.0001034714,0.00055244647,0.00034705232,0.00021984088],"domain_scores_gemma":[0.98298764,0.012178295,0.0019230532,0.0013583059,0.0011791271,0.00037368038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003966409,0.0010031837,0.0018764337,0.0015955893,0.0007103887,0.0018753321,0.003953683,0.0022686925,0.011148292],"category_scores_gemma":[0.021070408,0.0008745935,0.0011515098,0.0020751522,0.0019689025,0.0041160076,0.0014921317,0.0029365486,0.0024394186],"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.00012155102,0.0000574128,0.0021363092,0.0000920834,0.00007082669,0.00020139235,0.00013368367,0.72218263,0.0008856676,0.25300387,0.0035237574,0.01759082],"study_design_scores_gemma":[0.0000106912785,0.000008776526,0.0001570507,0.000006676415,0.00000480571,0.000017422144,0.000008492057,0.9656709,0.00011441766,0.033194236,0.00079719897,0.000009328585],"about_ca_topic_score_codex":0.010547314,"about_ca_topic_score_gemma":0.010069508,"teacher_disagreement_score":0.011148292,"about_ca_system_score_codex":0.0014173372,"about_ca_system_score_gemma":0.0010201383,"threshold_uncertainty_score":0.037294805},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08717494,0.00017596464,0.9053412,0.00053485064,0.00008407618,0.00013042333,0.00017454267,0.0004392566,0.005944822],"genre_scores_gemma":[0.9293122,0.00007117906,0.06889806,0.00034178773,0.00005101095,0.00020993,0.0001884045,0.00013195557,0.00079539046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.97227275,0.016265618,0.0009897224,0.003929768,0.0054855347,0.0010566765],"domain_scores_gemma":[0.83773637,0.12629047,0.008748305,0.020800708,0.0048499904,0.0015741679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.029943747,0.0009858556,0.0016910874,0.0017184322,0.0012174537,0.0025716876,0.0044246544,0.0022948901,0.0041417927],"category_scores_gemma":[0.12844041,0.0006782684,0.0011376988,0.0013969159,0.007855507,0.0067433957,0.0050765,0.005248027,0.00060371344],"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.0008357886,0.00035842502,0.0065735765,0.00019216565,0.00027890535,0.00028627453,0.00024719688,0.1818911,0.0101412255,0.7627585,0.0015885624,0.034848332],"study_design_scores_gemma":[0.00007073819,0.00019688683,0.0011630518,0.000035463956,0.000024386041,0.00006966375,0.000045619512,0.72306544,0.0121981865,0.26259452,0.0004752171,0.000060796872],"about_ca_topic_score_codex":0.0005517532,"about_ca_topic_score_gemma":0.00027441542,"teacher_disagreement_score":0.029943747,"about_ca_system_score_codex":0.0017768787,"about_ca_system_score_gemma":0.0016403517,"threshold_uncertainty_score":0.15835959},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15803531,0.0006508646,0.81147987,0.00083406584,0.0003045595,0.0004687937,0.007471479,0.010404185,0.010350912],"genre_scores_gemma":[0.80425733,0.00015626031,0.18542616,0.00014625347,0.00016264284,0.00023738625,0.0045705955,0.00018206763,0.004861445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853075,0.00033916847,0.000060556602,0.0004476482,0.0004606875,0.00016116473],"domain_scores_gemma":[0.99593216,0.0018851091,0.00045450803,0.0006892099,0.000519366,0.0005196249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013672073,0.0008173068,0.0007375934,0.0032595978,0.0010110697,0.0014651791,0.00129154,0.00128948,0.0058593024],"category_scores_gemma":[0.007867459,0.0002858088,0.0004948791,0.0019736013,0.00035819155,0.002391178,0.0029962456,0.0010799586,0.001972244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022009984,0.0014791496,0.068478465,0.0007905664,0.00046386354,0.0013532254,0.0014786755,0.06957028,0.0448169,0.06099989,0.050148867,0.698219],"study_design_scores_gemma":[0.000050130184,0.00019118117,0.0121604465,0.00004735154,0.00007095514,0.00038907822,0.00045970027,0.9035723,0.01312189,0.05617559,0.013708961,0.0000524835],"about_ca_topic_score_codex":0.0024197658,"about_ca_topic_score_gemma":0.006925449,"teacher_disagreement_score":0.0058593024,"about_ca_system_score_codex":0.0005819197,"about_ca_system_score_gemma":0.0008936023,"threshold_uncertainty_score":0.019601345},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13325344,0.008290272,0.8402143,0.0053139697,0.00032360057,0.00016543653,0.0020851311,0.0005931775,0.009760687],"genre_scores_gemma":[0.85736024,0.0036182075,0.13460405,0.00023070682,0.0005463547,0.00020059072,0.0011375939,0.00015538887,0.0021468278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573284,0.0023126265,0.00017046068,0.000989981,0.0006705222,0.00012355205],"domain_scores_gemma":[0.9656938,0.029203746,0.0017119956,0.0019186401,0.00088368356,0.0005881939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045322683,0.0007484426,0.0010003782,0.007046805,0.001091385,0.0048155147,0.0012137005,0.0012632946,0.0032030267],"category_scores_gemma":[0.033966303,0.0005211845,0.0008950842,0.008111581,0.0028924772,0.0071264445,0.0020952248,0.0020812568,0.0004701844],"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.00042708174,0.00019385545,0.04527076,0.0013331567,0.0008729092,0.00030336055,0.0029839135,0.048662607,0.005649621,0.5710516,0.008619862,0.3146313],"study_design_scores_gemma":[0.00003544986,0.000057024346,0.015339482,0.00022632652,0.00022519029,0.00030779038,0.0010243753,0.30603644,0.0020192184,0.66062033,0.014051305,0.0000570842],"about_ca_topic_score_codex":0.002099742,"about_ca_topic_score_gemma":0.0016499534,"teacher_disagreement_score":0.007046805,"about_ca_system_score_codex":0.0012043839,"about_ca_system_score_gemma":0.0013682154,"threshold_uncertainty_score":0.023969173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05492372,0.000075008735,0.9424954,0.00017607995,0.000026454934,0.00005184517,0.000022537994,0.00012184588,0.0021069772],"genre_scores_gemma":[0.9579653,0.00004982842,0.040823944,0.000054729626,0.000017522492,0.00007859861,0.00002681165,0.000010211104,0.0009731399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990765,0.00028862208,0.00004629254,0.00023900767,0.00022098378,0.00012861345],"domain_scores_gemma":[0.9979488,0.000977002,0.00035275167,0.00018357341,0.00039010393,0.00014782434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017458143,0.0005936909,0.0005475466,0.00053748226,0.00057836535,0.00074723427,0.0013897867,0.00076276186,0.0013339301],"category_scores_gemma":[0.0050916327,0.00021761245,0.0004308455,0.00036782774,0.0005418339,0.0011328474,0.0014128865,0.00080546935,0.00015360588],"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.00015985411,0.00007848005,0.0015060441,0.000052787138,0.00006296501,0.00014913193,0.0002097743,0.9088051,0.008849934,0.027056918,0.0006075679,0.052461445],"study_design_scores_gemma":[0.000012603412,0.00004204737,0.00013683987,0.0000029431676,0.000009127901,0.000019322364,0.000019644722,0.9930708,0.0011417083,0.0052396143,0.0002993376,0.000006050258],"about_ca_topic_score_codex":0.0013389679,"about_ca_topic_score_gemma":0.001101012,"teacher_disagreement_score":0.0017458143,"about_ca_system_score_codex":0.0006273228,"about_ca_system_score_gemma":0.0009908883,"threshold_uncertainty_score":0.009232879},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20921193,0.001380824,0.7574924,0.0014945341,0.00038484373,0.00020506371,0.00043373712,0.0013429581,0.028053746],"genre_scores_gemma":[0.8868788,0.0005402511,0.10066918,0.00017810536,0.00036454274,0.0000641635,0.00031642316,0.00019900379,0.010789519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742883,0.00079877774,0.00007464285,0.0004015574,0.0009879123,0.00030821364],"domain_scores_gemma":[0.98331785,0.010942739,0.0007569043,0.0025183773,0.0018606576,0.0006035264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027327114,0.00062392384,0.0010666507,0.0010630145,0.0012856936,0.0021364307,0.00179859,0.001234675,0.005564059],"category_scores_gemma":[0.024732612,0.00047066648,0.00049908005,0.0013641702,0.00069992826,0.0049503646,0.0026102853,0.0020803062,0.0013554042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011658137,0.0010093264,0.009928136,0.00033584703,0.00017461789,0.00017042508,0.0011033287,0.1580566,0.02582191,0.09654086,0.017521046,0.68817204],"study_design_scores_gemma":[0.000057394293,0.00030589616,0.0019936704,0.000054498683,0.00012857103,0.0001600874,0.00027082008,0.91355485,0.013154961,0.062229637,0.008060969,0.000028593866],"about_ca_topic_score_codex":0.0033525801,"about_ca_topic_score_gemma":0.007629008,"teacher_disagreement_score":0.005564059,"about_ca_system_score_codex":0.000800872,"about_ca_system_score_gemma":0.0012456877,"threshold_uncertainty_score":0.018613636},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030112093,0.00033256123,0.9650675,0.00090406794,0.00006165143,0.000068421774,0.0006109257,0.00017906504,0.002663748],"genre_scores_gemma":[0.9063016,0.000611078,0.084248506,0.00028543329,0.00012589207,0.0003155767,0.0009927027,0.00009855152,0.0070207454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834836,0.00061480317,0.00007156761,0.0004817245,0.000278018,0.00020559477],"domain_scores_gemma":[0.99354905,0.0043641026,0.0006285521,0.0003929719,0.0007562887,0.00030905963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031223127,0.0009848492,0.0023886564,0.001318219,0.000994009,0.0018843971,0.00369472,0.0021661762,0.0049663577],"category_scores_gemma":[0.01051462,0.0006841192,0.0011665557,0.0026348163,0.0016343863,0.005440333,0.002094804,0.0024505917,0.00063181313],"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.000109268185,0.00004726259,0.0006589325,0.0000869525,0.000065669,0.0000988107,0.0001286588,0.8649252,0.00039855743,0.12103453,0.0019109787,0.010535121],"study_design_scores_gemma":[0.0000047285243,0.0000058087508,0.000052587184,0.0000023516234,0.0000060644156,0.0000066673597,0.000008947663,0.9727138,0.00003738422,0.027038256,0.00011853677,0.000004993212],"about_ca_topic_score_codex":0.012325264,"about_ca_topic_score_gemma":0.010156462,"teacher_disagreement_score":0.012325264,"about_ca_system_score_codex":0.0021691942,"about_ca_system_score_gemma":0.001881806,"threshold_uncertainty_score":0.024507046},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015748134,0.000087399116,0.98248714,0.00018664535,0.000036450783,0.00003303286,0.00006308182,0.00023721319,0.0011208304],"genre_scores_gemma":[0.7186311,0.00017377085,0.27769524,0.00015922023,0.00007126231,0.00019001524,0.00030601394,0.000094787385,0.0026785294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989003,0.00040095404,0.00005032528,0.00025477321,0.0003062566,0.00008734067],"domain_scores_gemma":[0.99383587,0.004065624,0.00048241304,0.00061347877,0.00082772307,0.0001747636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022111065,0.0008205735,0.0010782301,0.0010579379,0.0007872131,0.001006588,0.0017240593,0.00144534,0.002487521],"category_scores_gemma":[0.013344019,0.00048787362,0.00048351687,0.0010889211,0.00083974755,0.0030338864,0.0022247422,0.0017316543,0.0004949187],"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.00013136452,0.000064720865,0.0004503925,0.000044040855,0.000041021005,0.000049174345,0.00008894605,0.9165661,0.0033606023,0.02500991,0.001137556,0.05305619],"study_design_scores_gemma":[0.0000035354371,0.000007313534,0.000027495085,0.0000012332188,0.00000228718,0.000002766826,0.0000028425163,0.9940135,0.00028521728,0.00554336,0.00010861293,0.0000018678693],"about_ca_topic_score_codex":0.0038101515,"about_ca_topic_score_gemma":0.004381124,"teacher_disagreement_score":0.0038101515,"about_ca_system_score_codex":0.0010319774,"about_ca_system_score_gemma":0.0010370106,"threshold_uncertainty_score":0.011693597},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005002097,0.0011138965,0.990373,0.00075103086,0.00012684807,0.000088078195,0.0001231809,0.00027908746,0.002142806],"genre_scores_gemma":[0.47931924,0.0041855895,0.50336266,0.0010677751,0.00080460473,0.001326266,0.0009001066,0.0005774695,0.008456351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9891377,0.004592281,0.00051403727,0.0016378344,0.0035227991,0.0005953816],"domain_scores_gemma":[0.8381719,0.13613619,0.0046468303,0.010768497,0.008980316,0.00129628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023471562,0.00244132,0.001937306,0.0031410065,0.001546225,0.0023130872,0.0038207413,0.0026207317,0.004311768],"category_scores_gemma":[0.13742195,0.0008656395,0.0016016505,0.0021356235,0.004802183,0.0075560287,0.006581078,0.0058275876,0.0014012207],"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.00047890726,0.000092811904,0.005083203,0.00056511216,0.00021869002,0.0002600044,0.0006081511,0.5981905,0.0032655133,0.3120089,0.0043268325,0.074901365],"study_design_scores_gemma":[0.00002050096,0.000051217936,0.00039678,0.00010057905,0.000031105683,0.000089828565,0.00006073631,0.91461766,0.0012818566,0.08120617,0.0021125989,0.0000310185],"about_ca_topic_score_codex":0.0036498639,"about_ca_topic_score_gemma":0.0018270036,"teacher_disagreement_score":0.023471562,"about_ca_system_score_codex":0.0028879272,"about_ca_system_score_gemma":0.0019303041,"threshold_uncertainty_score":0.124130964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018424168,0.00083798287,0.9762156,0.0002825678,0.000115351664,0.000082035476,0.00064368156,0.0009057075,0.002492914],"genre_scores_gemma":[0.4015253,0.0014672255,0.5738798,0.00020022203,0.00028178346,0.00019396565,0.0040528146,0.0007488711,0.017650122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99837226,0.0004274201,0.00009830718,0.00053794816,0.00044119442,0.00012292559],"domain_scores_gemma":[0.9949333,0.0021418699,0.00037548813,0.0014652107,0.0008166033,0.00026755861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013139002,0.00088243815,0.0019060757,0.002916216,0.001472843,0.0020834873,0.0038298646,0.0014796434,0.0032016584],"category_scores_gemma":[0.0067959637,0.0009940933,0.001752773,0.0047683157,0.0009989205,0.003138077,0.0025101702,0.0017756798,0.0012955854],"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.00025132592,0.00017554547,0.00315355,0.00053902686,0.00032539442,0.00032453288,0.00040410963,0.6786452,0.0055300514,0.055152506,0.014791922,0.24070692],"study_design_scores_gemma":[0.0000051720804,0.000012585108,0.00058037194,0.000013290877,0.000028579494,0.0000639341,0.000044972447,0.96538734,0.0007057544,0.03085549,0.0022883993,0.000014131128],"about_ca_topic_score_codex":0.006288835,"about_ca_topic_score_gemma":0.012002594,"teacher_disagreement_score":0.006288835,"about_ca_system_score_codex":0.0016089429,"about_ca_system_score_gemma":0.001018927,"threshold_uncertainty_score":0.012504458},"labels":[],"label_agreement":null},{"id":"W4412936426","doi":"10.1093/comnet/cnaf008","title":"Two models of sparse and clustered dynamic networks","year":2025,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Information Technology Research Centre","keywords":"Combinatorics; Adjacency matrix; Markov chain; Prime (order theory); Bipartite graph; Mathematics; Transitive relation; Discrete mathematics; Graph; Statistics","score_opus":0.015479678029741838,"score_gpt":0.2885903414612192,"score_spread":0.2731106634314774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412936426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5898903,0.00054501917,0.3543379,0.0051965076,0.00015833515,0.00021041239,0.001764783,0.00064185465,0.04725484],"genre_scores_gemma":[0.97732157,0.00017897518,0.010300023,0.0002622711,0.00005118061,0.00013058637,0.00040260452,0.000042980842,0.011309886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920064,0.00026836095,0.000023355407,0.00019884043,0.00015720303,0.00015155673],"domain_scores_gemma":[0.99739313,0.0012954795,0.0003851862,0.00027085794,0.00035396378,0.00030127735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008445945,0.0004093873,0.000657721,0.0010156918,0.0006418521,0.0018860805,0.001747548,0.0018220216,0.0073776045],"category_scores_gemma":[0.0059727724,0.00048726363,0.0006670452,0.0010672845,0.0015382606,0.0026571378,0.0012792716,0.0011597465,0.000593155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001386014,0.00007881589,0.0014167946,0.00006186236,0.000043554173,0.00024399592,0.00031990107,0.6206897,0.0012141345,0.36772558,0.0036087818,0.0044582034],"study_design_scores_gemma":[0.00004530341,0.000030792853,0.00036204368,0.000008426136,0.000010899697,0.00006988208,0.00007527601,0.88859904,0.00013861431,0.1090922,0.001551807,0.000015699306],"about_ca_topic_score_codex":0.011502248,"about_ca_topic_score_gemma":0.008636389,"teacher_disagreement_score":0.011502248,"about_ca_system_score_codex":0.0019267711,"about_ca_system_score_gemma":0.0007466232,"threshold_uncertainty_score":0.024680495},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032514037,0.002075257,0.99451375,0.00013385169,0.00006985748,0.00012003447,0.00067829795,0.00065415114,0.0014296726],"genre_scores_gemma":[0.01527748,0.009786247,0.9681266,0.00016394045,0.00031506075,0.00091443793,0.0023790188,0.00050849246,0.002528678],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971181,0.0011094599,0.00033484722,0.0006316709,0.0007123828,0.00009354897],"domain_scores_gemma":[0.99342704,0.0043403413,0.0005233789,0.0009190243,0.0006813455,0.00010899864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028480783,0.002430528,0.001571309,0.008793087,0.0007085986,0.0026408527,0.0026117233,0.0017347257,0.008619655],"category_scores_gemma":[0.01169674,0.001095378,0.0032556574,0.010156126,0.0011462435,0.0029123416,0.0016780499,0.0024854098,0.005846991],"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.00007084461,0.0001781723,0.004145958,0.0030363442,0.0005191545,0.00038084778,0.00066533027,0.080069,0.0054633897,0.18563695,0.023453228,0.69638073],"study_design_scores_gemma":[0.00004468936,0.00009962378,0.0046133646,0.0008022493,0.0001659591,0.0012358837,0.00033100738,0.39014596,0.002956326,0.40098777,0.19842857,0.0001885838],"about_ca_topic_score_codex":0.0063615115,"about_ca_topic_score_gemma":0.0059168353,"teacher_disagreement_score":0.008793087,"about_ca_system_score_codex":0.0012034791,"about_ca_system_score_gemma":0.0017589821,"threshold_uncertainty_score":0.028835654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96666557,0.00012485219,0.029977243,0.0000610562,0.000004712883,0.00007540641,0.0002732208,0.00003891319,0.002778967],"genre_scores_gemma":[0.99636203,0.00007997026,0.003123566,0.0000036949386,0.0000027428982,0.000026269106,0.00019671998,0.0000047118174,0.00020032463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954647,0.00012166536,0.00002981663,0.00007991102,0.00013408522,0.00008807624],"domain_scores_gemma":[0.9979195,0.00093900814,0.0004171935,0.00011746225,0.0005078249,0.000098978715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005063265,0.000412145,0.00022088397,0.0030779908,0.0005277965,0.0006581998,0.00053178176,0.000399727,0.00094808365],"category_scores_gemma":[0.0037985854,0.00019069696,0.0004034706,0.0031518375,0.00047877006,0.0015882106,0.00058683363,0.0002235246,0.00006355206],"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.00015826133,0.000095525254,0.19833073,0.0002318997,0.00013682237,0.0011746754,0.0005625556,0.724771,0.00400267,0.015873902,0.0010117348,0.053650282],"study_design_scores_gemma":[0.000009296249,0.00014421323,0.13884093,0.000042195676,0.000116305724,0.0004927797,0.001805737,0.8484202,0.0019038882,0.0062450143,0.0019477052,0.0000317534],"about_ca_topic_score_codex":0.011319895,"about_ca_topic_score_gemma":0.014038322,"teacher_disagreement_score":0.011319895,"about_ca_system_score_codex":0.0007276336,"about_ca_system_score_gemma":0.00035362432,"threshold_uncertainty_score":0.022508025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97845,0.0002282579,0.0057244617,0.0012156867,0.000074335236,0.000014926372,0.00011376072,0.00012547823,0.014053123],"genre_scores_gemma":[0.9990864,0.00005444945,0.0001916405,0.000019206214,0.000022304386,0.0000035816852,0.000014978613,0.000012327993,0.0005951088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930406,0.00023008518,0.00001822205,0.00009772802,0.00013721846,0.00021263518],"domain_scores_gemma":[0.9877664,0.008677951,0.0007245882,0.00059239665,0.00075121893,0.0014873752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094472617,0.00021687694,0.0005627155,0.0007363896,0.0012017344,0.0021302223,0.0006176108,0.0009457339,0.009909781],"category_scores_gemma":[0.020237125,0.00021806236,0.00021871556,0.00043911903,0.0011037614,0.0033477927,0.0010834628,0.0009123594,0.00049635494],"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.0017064837,0.0013200223,0.062825225,0.0005695371,0.0002706711,0.0031263896,0.002600054,0.38825488,0.07936071,0.37822738,0.014973905,0.06676473],"study_design_scores_gemma":[0.00009679329,0.00035923033,0.03747361,0.000034864363,0.000092796596,0.0004906763,0.0013298751,0.8590456,0.007034052,0.09158797,0.0023799455,0.00007447306],"about_ca_topic_score_codex":0.0023137543,"about_ca_topic_score_gemma":0.0019781722,"teacher_disagreement_score":0.009909781,"about_ca_system_score_codex":0.0007681403,"about_ca_system_score_gemma":0.00079552137,"threshold_uncertainty_score":0.033151507},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013613316,0.0019913092,0.0056484602,0.9334527,0.04423593,0.0000093221015,0.0002172707,0.0004914038,0.012592293],"genre_scores_gemma":[0.15131313,0.004433397,0.012521171,0.5958963,0.06687298,0.00010382915,0.00047932615,0.003146965,0.16523294],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99489105,0.0014195845,0.00028849658,0.0010066207,0.0021190755,0.00027519374],"domain_scores_gemma":[0.94848424,0.030566722,0.0028668833,0.0045509157,0.009642142,0.0038891793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006608531,0.0008733806,0.0011350445,0.001605845,0.0033079598,0.0065443194,0.001920767,0.0081945965,0.019220673],"category_scores_gemma":[0.14366177,0.00042408847,0.00057176617,0.0015340135,0.008390937,0.014765896,0.00446407,0.018176459,0.010531754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071985996,0.000012281069,0.0005098881,0.00006534527,0.000028393639,0.00019560062,0.0006354444,0.00016025137,0.0001352829,0.07756949,0.9024446,0.018171294],"study_design_scores_gemma":[0.000029069646,0.000019049601,0.0006969394,0.00028116125,0.000030493302,0.00066862005,0.0011423903,0.0025894812,0.0006931308,0.27375418,0.71997505,0.00012044553],"about_ca_topic_score_codex":0.0043562064,"about_ca_topic_score_gemma":0.0034723617,"teacher_disagreement_score":0.019220673,"about_ca_system_score_codex":0.002989814,"about_ca_system_score_gemma":0.002485586,"threshold_uncertainty_score":0.06429958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17872305,0.00064298627,0.806923,0.00079635874,0.00006840276,0.00016002278,0.00066014566,0.0011549699,0.010871042],"genre_scores_gemma":[0.68678826,0.0005079003,0.3050857,0.0003395553,0.00012245493,0.00023932473,0.0009424161,0.00034026912,0.005634056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760205,0.00042989408,0.00018384824,0.0007908678,0.00059858395,0.00039479102],"domain_scores_gemma":[0.99280214,0.0038207874,0.00081653555,0.0017003153,0.00047747706,0.00038281345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001885996,0.0007143636,0.0010135536,0.0014340961,0.0014115537,0.0025859824,0.001926026,0.0011533321,0.004809921],"category_scores_gemma":[0.008080063,0.00065217353,0.0015521973,0.0021740773,0.0036419046,0.0077326577,0.0028327936,0.00279515,0.00063298515],"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.0005915677,0.0001882509,0.0040304363,0.0004154196,0.00007668824,0.0002532712,0.00065763196,0.12914556,0.018706078,0.7545799,0.0030137268,0.0883415],"study_design_scores_gemma":[0.000039202117,0.000078272635,0.000737822,0.000050445895,0.00003237596,0.00019717883,0.0001421707,0.18272507,0.010110408,0.80251044,0.0033312764,0.000045406174],"about_ca_topic_score_codex":0.0018785774,"about_ca_topic_score_gemma":0.0024096866,"teacher_disagreement_score":0.004809921,"about_ca_system_score_codex":0.0024209586,"about_ca_system_score_gemma":0.001313528,"threshold_uncertainty_score":0.01756537},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10213051,0.0012073336,0.88197064,0.0006020857,0.00012559426,0.00022335899,0.0017606779,0.007489246,0.0044905446],"genre_scores_gemma":[0.44694263,0.0007588165,0.54179853,0.0002965247,0.00013702057,0.00029782322,0.005520823,0.00069086277,0.0035569135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987154,0.00017336516,0.000103034705,0.00028875805,0.00056211255,0.00015746827],"domain_scores_gemma":[0.9955124,0.0017521617,0.000456025,0.0014601459,0.00057008624,0.00024909567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008778203,0.0010479101,0.0016319201,0.0022451743,0.0009901272,0.002358202,0.0030449748,0.0011289519,0.0026962417],"category_scores_gemma":[0.008786016,0.0005545624,0.00093327113,0.004788386,0.000808236,0.005264517,0.0021750003,0.0012500874,0.00144205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069763587,0.00046428715,0.010334327,0.00058569585,0.00015124228,0.00042779275,0.00096657104,0.22107129,0.032256898,0.057691008,0.033566475,0.6417869],"study_design_scores_gemma":[0.0000368939,0.00006379249,0.0006505439,0.00001612258,0.000023881657,0.00021998642,0.00015005478,0.9632051,0.004777897,0.027784696,0.0030481203,0.0000228781],"about_ca_topic_score_codex":0.006575123,"about_ca_topic_score_gemma":0.011001424,"teacher_disagreement_score":0.006575123,"about_ca_system_score_codex":0.0015139934,"about_ca_system_score_gemma":0.0021350475,"threshold_uncertainty_score":0.013073742},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007188392,0.00025648385,0.9863885,0.00020794004,0.000056943358,0.00013375928,0.00022510625,0.0015746042,0.003968342],"genre_scores_gemma":[0.09810872,0.00023464399,0.895977,0.00018496167,0.000045570832,0.0004676026,0.0008896213,0.00071560836,0.0033763673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917066,0.0002586589,0.000035202862,0.00019504872,0.0002255005,0.00011496872],"domain_scores_gemma":[0.99782336,0.0013431418,0.00018062885,0.00029383,0.00024734944,0.00011172159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012495916,0.0017609124,0.0012480292,0.0014593544,0.0009193394,0.0015346608,0.002389943,0.0016815563,0.0074112006],"category_scores_gemma":[0.0067885686,0.0009181906,0.0012318785,0.0017392162,0.0007686283,0.0022430879,0.0017528881,0.0020200296,0.0022666664],"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.00009588852,0.00007506492,0.00056974846,0.00016066286,0.00006831767,0.00006925461,0.00009268917,0.87892556,0.0017068234,0.01730179,0.008662488,0.09227175],"study_design_scores_gemma":[0.000017277487,0.000013585733,0.000048685335,0.000009599968,0.000005115478,0.000017366974,0.000018440422,0.99048525,0.00030179223,0.0077867685,0.0012918977,0.0000042461734],"about_ca_topic_score_codex":0.009369467,"about_ca_topic_score_gemma":0.01844534,"teacher_disagreement_score":0.009369467,"about_ca_system_score_codex":0.0016838809,"about_ca_system_score_gemma":0.0025307862,"threshold_uncertainty_score":0.02479297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4102725,0.002317766,0.5766274,0.0029910565,0.00011118767,0.0000718705,0.00048609867,0.0003554326,0.0067666927],"genre_scores_gemma":[0.9845547,0.0010887093,0.010965697,0.00010610584,0.00014898632,0.0001078438,0.00025132802,0.000059280585,0.0027174624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993812,0.00017672022,0.000042652086,0.00020079622,0.000112463225,0.000086141255],"domain_scores_gemma":[0.96959186,0.02407353,0.0030101873,0.0012121866,0.0011268089,0.0009854026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002425656,0.00045163019,0.0010388457,0.0027134623,0.000962269,0.0027586964,0.0013128014,0.0012153613,0.0034250144],"category_scores_gemma":[0.025014063,0.00066108286,0.00077172735,0.0014420204,0.0027000897,0.0058549102,0.0018306342,0.0021489023,0.00021000241],"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.0002026135,0.00011592969,0.010078696,0.0003518926,0.00024324925,0.0002881974,0.0008139803,0.24480222,0.004863633,0.7082284,0.0029142736,0.027096862],"study_design_scores_gemma":[0.000014058314,0.000031598374,0.0014714516,0.00002618281,0.000026585034,0.00007689261,0.000083863335,0.5999093,0.00028078552,0.39757925,0.00047928537,0.00002069872],"about_ca_topic_score_codex":0.0016273662,"about_ca_topic_score_gemma":0.0013779826,"teacher_disagreement_score":0.0034250144,"about_ca_system_score_codex":0.001051443,"about_ca_system_score_gemma":0.00064590684,"threshold_uncertainty_score":0.012828231},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16981733,0.00066501496,0.8179861,0.0037569173,0.00010562996,0.00015379682,0.0003042894,0.00009501588,0.007115954],"genre_scores_gemma":[0.95261127,0.0006556504,0.042561293,0.0002562423,0.00018610158,0.00023146386,0.00016881674,0.000034776593,0.0032944034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99376327,0.0034572217,0.00023599947,0.0012377688,0.0006793178,0.0006265443],"domain_scores_gemma":[0.96038187,0.031850144,0.0035948192,0.0011775767,0.0013922943,0.0016032486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009205947,0.00097353774,0.0036613788,0.001605417,0.0020643785,0.0050563794,0.0038375496,0.0036028652,0.0036103688],"category_scores_gemma":[0.027980298,0.0010044015,0.0018884958,0.0021346705,0.004965724,0.008022765,0.003157773,0.0026775175,0.0002523106],"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.00012687386,0.000112358764,0.0012315838,0.00016776378,0.00020483245,0.0002958552,0.00039031846,0.58952,0.00044824104,0.4004662,0.000925258,0.006110702],"study_design_scores_gemma":[0.000018979877,0.000024374012,0.00023657146,0.000010746102,0.000019572635,0.000018802439,0.000094145165,0.77107286,0.00007655276,0.22821808,0.0001878954,0.000021432754],"about_ca_topic_score_codex":0.0072897673,"about_ca_topic_score_gemma":0.0040937075,"teacher_disagreement_score":0.009205947,"about_ca_system_score_codex":0.0031011235,"about_ca_system_score_gemma":0.0023448807,"threshold_uncertainty_score":0.048686326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008324404,0.00016675559,0.99000144,0.00016710439,0.000026967582,0.00005749694,0.0000414487,0.00008299489,0.0011314853],"genre_scores_gemma":[0.63824147,0.00040512177,0.35459876,0.000250979,0.0002534995,0.00049421244,0.00034828373,0.000182681,0.0052250503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997482,0.0012333542,0.00009940934,0.00034649455,0.0006236021,0.0002152468],"domain_scores_gemma":[0.9936632,0.0046925927,0.0002527416,0.00035334803,0.00079026667,0.00024776283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037786518,0.00088406575,0.0028213125,0.0013294391,0.0011466395,0.0014255593,0.0044780755,0.0022809152,0.0026584223],"category_scores_gemma":[0.011279158,0.0007081844,0.0012890883,0.0018090103,0.0014877731,0.0031116016,0.0029851003,0.0016741977,0.00048580233],"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.00013463834,0.00013603843,0.0005721706,0.00018037728,0.00009695009,0.00006557288,0.00017342131,0.8617298,0.0020250203,0.06687374,0.0027171688,0.065295085],"study_design_scores_gemma":[0.00000452603,0.000008566702,0.0000238338,0.0000021159674,0.0000053428266,0.000004240206,0.0000044690696,0.9936039,0.00009895431,0.006127408,0.00011371511,0.0000030052056],"about_ca_topic_score_codex":0.005420194,"about_ca_topic_score_gemma":0.006633495,"teacher_disagreement_score":0.005420194,"about_ca_system_score_codex":0.0014971195,"about_ca_system_score_gemma":0.0017810932,"threshold_uncertainty_score":0.01998365},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017943024,0.00015821266,0.9916128,0.00041659758,0.00004053287,0.00012074514,0.0003165018,0.000331215,0.005209129],"genre_scores_gemma":[0.057635885,0.00057639164,0.9369749,0.00017928093,0.00007088051,0.0005020693,0.0008147968,0.00017009498,0.0030756458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958209,0.0020383126,0.00031855048,0.0006015315,0.001118938,0.00010183165],"domain_scores_gemma":[0.99165064,0.0055735703,0.0005807696,0.00074490166,0.0012166363,0.00023341588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064220144,0.00092938944,0.00078059355,0.0034072255,0.000836541,0.004327198,0.002844658,0.0011484851,0.008652501],"category_scores_gemma":[0.017226446,0.000580951,0.0015023629,0.0030373484,0.0012392298,0.0040535773,0.0029028237,0.0018178177,0.0016850235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013711544,0.00013645484,0.0026644343,0.0009287251,0.00022874583,0.00031504538,0.000650824,0.36057797,0.0013198543,0.46305367,0.006230993,0.16375625],"study_design_scores_gemma":[0.00002323716,0.00005164035,0.00048222297,0.00018426873,0.00004059638,0.00012307367,0.00014182994,0.7359797,0.00084001134,0.23552018,0.026575034,0.0000382618],"about_ca_topic_score_codex":0.0052261935,"about_ca_topic_score_gemma":0.006954773,"teacher_disagreement_score":0.008652501,"about_ca_system_score_codex":0.0019658904,"about_ca_system_score_gemma":0.0029830048,"threshold_uncertainty_score":0.033963263},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9572826,0.00025709227,0.036668647,0.00051966816,0.000031918924,0.0000857089,0.00021867028,0.000058207537,0.0048774634],"genre_scores_gemma":[0.99810326,0.00005517613,0.0014007583,0.000009781956,0.0000053471476,0.000018341081,0.000054580654,0.000002802671,0.00034996873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899787,0.00047143002,0.000043245236,0.00013922295,0.0002070451,0.00014115937],"domain_scores_gemma":[0.9949392,0.0033665318,0.0007996958,0.00016421522,0.0005229048,0.00020747307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022461945,0.00048269925,0.0004119339,0.001203212,0.00039118723,0.0012324443,0.00076450943,0.0007520076,0.0017459963],"category_scores_gemma":[0.008026795,0.00017650264,0.0005951347,0.0007598179,0.0006552318,0.0024337661,0.0007135464,0.0006264111,0.0000739851],"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.00032121633,0.0002484839,0.063555665,0.00012157152,0.0001433109,0.0005804158,0.00029057276,0.8903089,0.0017876718,0.026413126,0.001229283,0.014999716],"study_design_scores_gemma":[0.0000067222604,0.000058530502,0.004387597,0.0000046485998,0.000015608957,0.000027117128,0.00010084867,0.99231225,0.00032311515,0.0026261176,0.00012692493,0.000010443283],"about_ca_topic_score_codex":0.008474146,"about_ca_topic_score_gemma":0.004601019,"teacher_disagreement_score":0.008474146,"about_ca_system_score_codex":0.0016530394,"about_ca_system_score_gemma":0.00062270067,"threshold_uncertainty_score":0.016849637},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88037324,0.0020321794,0.107612036,0.0019551825,0.00007069599,0.00002892638,0.0003584937,0.000079903344,0.0074893143],"genre_scores_gemma":[0.990473,0.0005666035,0.0068611153,0.000052599196,0.00004185838,0.000016369482,0.00007886239,0.000010455975,0.0018990444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945754,0.00029437355,0.000018069712,0.00008697484,0.00006336092,0.00007960432],"domain_scores_gemma":[0.9750807,0.022802444,0.0010141904,0.0004108203,0.00036970444,0.00032203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025243894,0.00036163986,0.00047913461,0.0010468508,0.0003587426,0.0011536299,0.0005241982,0.00073097344,0.0020524627],"category_scores_gemma":[0.021491695,0.00027920533,0.00054286805,0.0012832927,0.0007093685,0.0026852754,0.00096637255,0.0010109657,0.00011078683],"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.0003387821,0.00017742271,0.06138104,0.00030137564,0.0004652815,0.0002696775,0.0005925735,0.760134,0.0048123794,0.110611245,0.0020995075,0.058816735],"study_design_scores_gemma":[0.000009766875,0.00007564359,0.016580988,0.000028571249,0.00010740383,0.00006903005,0.0002507009,0.9122786,0.00084001885,0.06918321,0.0005526037,0.000023360797],"about_ca_topic_score_codex":0.006341716,"about_ca_topic_score_gemma":0.006488039,"teacher_disagreement_score":0.006341716,"about_ca_system_score_codex":0.0012384051,"about_ca_system_score_gemma":0.00039635578,"threshold_uncertainty_score":0.013350427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025805676,0.00065172865,0.9671724,0.0005869943,0.0001199954,0.00006642961,0.0007718492,0.0023699473,0.0024549677],"genre_scores_gemma":[0.6731844,0.00087182084,0.31042352,0.0006879038,0.0002542231,0.0003551826,0.003931976,0.00064856105,0.009642386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994894,0.00015691874,0.000021501857,0.00017130557,0.00011288161,0.000048032864],"domain_scores_gemma":[0.9983374,0.0009176761,0.00017188107,0.00024467648,0.00024240758,0.00008600272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010350074,0.0012434372,0.00092873786,0.0012362677,0.00050016516,0.0014097213,0.0024497362,0.0016767939,0.0032079755],"category_scores_gemma":[0.0047301287,0.0006048909,0.0009209013,0.0011675295,0.0009187883,0.0032099125,0.001861038,0.0024835214,0.0014151759],"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.000094588126,0.00009287369,0.0021534378,0.000101050806,0.00008986068,0.000110592526,0.000086903055,0.8656749,0.0013517374,0.020623878,0.0077560153,0.10186416],"study_design_scores_gemma":[0.0000024650121,0.0000054262373,0.00005877637,0.0000039475094,0.0000024022174,0.0000069496814,0.0000038172307,0.9936603,0.00012600861,0.0058690445,0.0002576569,0.0000033152053],"about_ca_topic_score_codex":0.00927446,"about_ca_topic_score_gemma":0.012145168,"teacher_disagreement_score":0.00927446,"about_ca_system_score_codex":0.0009603222,"about_ca_system_score_gemma":0.00091555226,"threshold_uncertainty_score":0.018440962},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034975776,0.0015462701,0.996594,0.00019097984,0.000053750307,0.00001196641,0.00012732462,0.0004397828,0.0006860998],"genre_scores_gemma":[0.034480836,0.005745195,0.95161986,0.00029468597,0.0004480058,0.00027326794,0.0008005829,0.0010857426,0.005251841],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987639,0.00049311033,0.00006651989,0.00033129012,0.00031358472,0.000031538344],"domain_scores_gemma":[0.99210805,0.0066272835,0.00022332562,0.0005473532,0.00039839785,0.000095557596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027326285,0.0017124669,0.0013678051,0.0023492554,0.00036815085,0.0022466625,0.0022623837,0.0015570052,0.006400648],"category_scores_gemma":[0.012611712,0.0012571077,0.0013365193,0.0023417606,0.0013394782,0.0029485882,0.0019659137,0.0030498018,0.002972666],"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.00006379156,0.00008037858,0.0015086674,0.00096455676,0.00042223904,0.00017791387,0.0002566283,0.18048352,0.0032420445,0.23319943,0.034317877,0.54528296],"study_design_scores_gemma":[0.000009701453,0.00001582243,0.0005277653,0.000100626494,0.000048392492,0.00009998519,0.000025143743,0.6398187,0.0007642535,0.3454143,0.013147608,0.000027676802],"about_ca_topic_score_codex":0.0032426282,"about_ca_topic_score_gemma":0.0037561432,"teacher_disagreement_score":0.006400648,"about_ca_system_score_codex":0.0008962234,"about_ca_system_score_gemma":0.0009940303,"threshold_uncertainty_score":0.021412313},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012128431,0.00009802425,0.9976115,0.00007317121,0.000047923924,0.00003198425,0.000070791044,0.0005222655,0.00033156684],"genre_scores_gemma":[0.051565472,0.0002694916,0.9427526,0.00017847319,0.00015459744,0.00018858006,0.0008288807,0.00037727685,0.003684661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979152,0.00051061215,0.00010050418,0.00063909544,0.00071258657,0.000122008874],"domain_scores_gemma":[0.9977939,0.00059085106,0.00013966399,0.00047398542,0.0008505368,0.00015108264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016670355,0.0013034808,0.0018658974,0.0031119802,0.0014694086,0.0017002061,0.004190434,0.0018052557,0.0037008333],"category_scores_gemma":[0.0056868233,0.0007392281,0.0016878977,0.0034793876,0.0012126623,0.002901335,0.003440101,0.0029970862,0.0023963193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001808995,0.0002663548,0.0011635997,0.00027778465,0.00027962102,0.000097845535,0.00022045396,0.15013379,0.01017755,0.060063884,0.017405579,0.75973266],"study_design_scores_gemma":[0.000010420756,0.000017310917,0.00015207168,0.000008757582,0.000017520653,0.000045778008,0.000025345642,0.977785,0.0014267439,0.017405035,0.003089736,0.00001627737],"about_ca_topic_score_codex":0.010134702,"about_ca_topic_score_gemma":0.01385977,"teacher_disagreement_score":0.010134702,"about_ca_system_score_codex":0.0011838964,"about_ca_system_score_gemma":0.0022197012,"threshold_uncertainty_score":0.020151436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34254348,0.0014118719,0.64583313,0.00026763673,0.000055493525,0.00018146791,0.0038442176,0.0017067373,0.0041558985],"genre_scores_gemma":[0.78809214,0.00060018,0.20279503,0.00008201154,0.000101893645,0.0001645447,0.00476465,0.00019759718,0.003201919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934024,0.0001333027,0.00004692137,0.00025597133,0.00014873857,0.0000747588],"domain_scores_gemma":[0.99649787,0.002223362,0.00049112615,0.00028400085,0.0003271484,0.00017648752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047337372,0.00044661286,0.0005234635,0.0048065265,0.0005953407,0.0010897223,0.0009231498,0.00086782227,0.0012447431],"category_scores_gemma":[0.0035931366,0.00041118063,0.0007536738,0.005256031,0.00047322866,0.0016475588,0.00080555456,0.00067583413,0.00057734153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012721756,0.0006540388,0.14778106,0.0010490591,0.0009079469,0.001450637,0.0016710452,0.13306828,0.07220578,0.036591116,0.016131183,0.5872176],"study_design_scores_gemma":[0.000035873036,0.00011689125,0.040957004,0.000063851076,0.00020400276,0.00092667446,0.0007039361,0.89635706,0.008545748,0.045646872,0.006390783,0.00005137389],"about_ca_topic_score_codex":0.0046036774,"about_ca_topic_score_gemma":0.009736816,"teacher_disagreement_score":0.0048065265,"about_ca_system_score_codex":0.00046811718,"about_ca_system_score_gemma":0.0003817835,"threshold_uncertainty_score":0.009153783},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036677387,0.00041824495,0.9574523,0.00022566582,0.000042329033,0.000085346415,0.00022183523,0.00380245,0.0010744389],"genre_scores_gemma":[0.532596,0.00023390524,0.46238133,0.00029662583,0.00008260343,0.0002148061,0.0016165788,0.0006943774,0.0018839113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845934,0.0004461497,0.00006154461,0.0005289292,0.00037852788,0.00012560659],"domain_scores_gemma":[0.9950663,0.0025006454,0.0007268141,0.00076557224,0.00068026176,0.0002603869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025519985,0.0015613545,0.0014182721,0.0025578397,0.001197936,0.0012836966,0.0018791471,0.0015667657,0.0016374048],"category_scores_gemma":[0.012201187,0.0006879007,0.0015652202,0.0012670754,0.0013892865,0.0026671295,0.0019522002,0.0024299072,0.0010540843],"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.0003653231,0.00016825364,0.006424955,0.00019929992,0.00021243369,0.00012703432,0.0002352999,0.75042456,0.0152062075,0.015038838,0.0062775877,0.20532027],"study_design_scores_gemma":[0.000008413413,0.000017950479,0.00031066517,0.0000058321425,0.0000050318044,0.00002033887,0.00001009726,0.99195296,0.0014006958,0.006006339,0.00025364172,0.000008151473],"about_ca_topic_score_codex":0.0068651596,"about_ca_topic_score_gemma":0.009712938,"teacher_disagreement_score":0.0068651596,"about_ca_system_score_codex":0.0019016656,"about_ca_system_score_gemma":0.0014066444,"threshold_uncertainty_score":0.013797641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065035056,0.00008975517,0.9923896,0.000087648245,0.000030204172,0.000059771137,0.000022525135,0.00019982892,0.0006172323],"genre_scores_gemma":[0.44896758,0.0002107591,0.5463757,0.00019202584,0.00010101031,0.00047700305,0.0002032637,0.0001358326,0.003336896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979685,0.0006293933,0.00009677309,0.00043113364,0.0007041457,0.00017011342],"domain_scores_gemma":[0.9955713,0.002386779,0.0003842222,0.0002644004,0.0011841629,0.00020912742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002808095,0.000930056,0.0012973617,0.0019282785,0.0010470882,0.0008664527,0.0020456782,0.0014623447,0.0023127],"category_scores_gemma":[0.010639463,0.00040879182,0.0009365594,0.0013497473,0.0007473984,0.0018453881,0.0018493598,0.0013198478,0.0004349679],"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.00034977522,0.00019279531,0.0018839883,0.00034970933,0.00011422471,0.00024624632,0.0006923667,0.5827834,0.0139189735,0.040709034,0.004908955,0.35385054],"study_design_scores_gemma":[0.000011378103,0.000036396075,0.00008069079,0.0000065851405,0.000007982792,0.000026662752,0.000023963283,0.99388075,0.00093122385,0.004435007,0.00055145624,0.00000781717],"about_ca_topic_score_codex":0.0037041788,"about_ca_topic_score_gemma":0.0034571998,"teacher_disagreement_score":0.0037041788,"about_ca_system_score_codex":0.000989758,"about_ca_system_score_gemma":0.0017996457,"threshold_uncertainty_score":0.014850795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041476753,0.0028384174,0.9077598,0.0065406235,0.00034689732,0.00033987476,0.0006772464,0.0003431519,0.039677333],"genre_scores_gemma":[0.518606,0.005734672,0.42656824,0.00292466,0.0021718794,0.0013769066,0.00275491,0.0009185823,0.038944047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995701,0.0015040571,0.00020435364,0.0010805452,0.00098575,0.0005241711],"domain_scores_gemma":[0.98253953,0.013556127,0.0010534793,0.0012931707,0.00083014934,0.000727512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042375773,0.0031105103,0.0024974726,0.0024536103,0.0021917182,0.006654905,0.003975144,0.004001829,0.01609147],"category_scores_gemma":[0.023010885,0.0013132334,0.0032726137,0.004013363,0.0035275226,0.015771773,0.0037173124,0.0076850294,0.0014831913],"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.00018571824,0.0004858705,0.0013107592,0.00072764076,0.00017053357,0.00015182649,0.0005690801,0.161669,0.0015228821,0.7782664,0.014825122,0.0401152],"study_design_scores_gemma":[0.00008380366,0.000063470965,0.00035921118,0.00007122628,0.000056637262,0.000090054076,0.00014917464,0.1788751,0.00040747708,0.8137199,0.0060945493,0.000029382632],"about_ca_topic_score_codex":0.0021464955,"about_ca_topic_score_gemma":0.002755301,"teacher_disagreement_score":0.01609147,"about_ca_system_score_codex":0.003996395,"about_ca_system_score_gemma":0.0019506875,"threshold_uncertainty_score":0.05383134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20707776,0.014404869,0.69032156,0.057030942,0.0007164286,0.00017751293,0.0013200144,0.00058685715,0.028364139],"genre_scores_gemma":[0.9519579,0.0040659993,0.040099774,0.0013620314,0.0005363325,0.0001270926,0.00019826599,0.00014270897,0.0015099876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700266,0.0018539337,0.00012747721,0.00053523574,0.0003921242,0.00008852128],"domain_scores_gemma":[0.89884776,0.08773422,0.00504469,0.005367991,0.0020664192,0.00093892094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008544367,0.00068601285,0.0014495731,0.001876048,0.0014092382,0.0049994728,0.0014843139,0.0033673262,0.003694464],"category_scores_gemma":[0.119144365,0.0008629831,0.00076186436,0.0019335083,0.0051122783,0.016203746,0.0017656931,0.0040103504,0.00046106474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031477553,0.00007493135,0.009713533,0.0007293444,0.00023294755,0.0002870249,0.00054598233,0.19066493,0.0020244734,0.7154782,0.0076536285,0.07228028],"study_design_scores_gemma":[0.00004815165,0.000046746703,0.0016743618,0.00011317781,0.000052518197,0.0001208486,0.00010794991,0.2198263,0.000502959,0.7740067,0.0034612117,0.0000390634],"about_ca_topic_score_codex":0.0020407564,"about_ca_topic_score_gemma":0.0014207818,"teacher_disagreement_score":0.008544367,"about_ca_system_score_codex":0.0026254733,"about_ca_system_score_gemma":0.0010592444,"threshold_uncertainty_score":0.045187473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072870087,0.00012912005,0.99189466,0.00008191183,0.0000115986495,0.000018256549,0.000024466613,0.00005169323,0.0005012368],"genre_scores_gemma":[0.6042109,0.00055260345,0.39255455,0.00013020582,0.00012552079,0.00024590397,0.00028928238,0.00011657536,0.0017744455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986474,0.0005819802,0.00006353965,0.00028737035,0.00032810462,0.00009165342],"domain_scores_gemma":[0.99565166,0.0032158142,0.00032293244,0.00018474812,0.0004972765,0.00012754533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026700904,0.0010103662,0.0015998497,0.0019940047,0.0009072752,0.0012875568,0.0016430528,0.0013767376,0.0009597697],"category_scores_gemma":[0.009005723,0.0006116798,0.0014754351,0.0020834594,0.0012098184,0.0025995492,0.0017812202,0.0013314564,0.00020304426],"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.00009396231,0.000092288086,0.0011042684,0.00018058259,0.00018488104,0.0000907057,0.0001756482,0.87555796,0.0037312463,0.040498976,0.0012903742,0.076998994],"study_design_scores_gemma":[0.0000018374565,0.0000056090776,0.00007779383,0.000002643274,0.00000622475,0.000005978376,0.0000038051637,0.9938074,0.0002194346,0.005785027,0.00008040087,0.0000037981122],"about_ca_topic_score_codex":0.0040396946,"about_ca_topic_score_gemma":0.0038975857,"teacher_disagreement_score":0.0040396946,"about_ca_system_score_codex":0.0010688789,"about_ca_system_score_gemma":0.000978648,"threshold_uncertainty_score":0.014120996},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048272826,0.0023727994,0.9323677,0.0034204437,0.00010039139,0.00017430169,0.00060363393,0.000700751,0.011987151],"genre_scores_gemma":[0.846065,0.0044301827,0.1357493,0.0012691729,0.00089254545,0.0007670768,0.0011035702,0.0008667711,0.008856424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958962,0.001695126,0.00016706041,0.00077887526,0.000997861,0.00046496926],"domain_scores_gemma":[0.8758057,0.114254065,0.0030027793,0.0029517354,0.0024996903,0.001486111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007296282,0.0023863236,0.0026544617,0.0029281375,0.001769919,0.004758557,0.0035519504,0.0027737683,0.0060604624],"category_scores_gemma":[0.07779563,0.0012087241,0.0018036352,0.0035203977,0.0041034743,0.010215403,0.0038190465,0.0048273043,0.0009984281],"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.0003551692,0.00020674974,0.0031863058,0.00047602056,0.00012766353,0.0002258661,0.0005378758,0.6703828,0.002423023,0.27537435,0.007914723,0.03878947],"study_design_scores_gemma":[0.000022759205,0.000040279127,0.0003121,0.000048122547,0.000024585228,0.000050130864,0.000042152387,0.81019664,0.0007905276,0.18727703,0.0011784827,0.000017265878],"about_ca_topic_score_codex":0.004295387,"about_ca_topic_score_gemma":0.0030978292,"teacher_disagreement_score":0.007296282,"about_ca_system_score_codex":0.0046749106,"about_ca_system_score_gemma":0.0019562002,"threshold_uncertainty_score":0.038586855},"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":"editorial","genre_gemma":"commentary","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013400882,0.00424836,0.06862629,0.19569527,0.2914653,0.0028624218,0.22587943,0.026660943,0.18322185],"genre_scores_gemma":[0.013515894,0.004732062,0.041088372,0.024754707,0.04545423,0.002488363,0.07109451,0.015265593,0.7816062],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966659,0.00067794794,0.00028119044,0.00044151422,0.0017455508,0.00018781496],"domain_scores_gemma":[0.91149974,0.014613342,0.0010627063,0.005993615,0.06465803,0.00217253],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0060766437,0.001350383,0.0019157068,0.0054270923,0.0022770662,0.0038630937,0.0028452317,0.0032501966,0.75823367],"category_scores_gemma":[0.09348904,0.00080829236,0.0016886933,0.007492933,0.0007575997,0.0043185037,0.0034002508,0.0027433347,0.48861098],"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.0000073451133,0.000008071154,0.000031573098,0.00004100946,0.0000037941354,0.000013812482,0.000013634414,0.000044386226,0.000052597617,0.00043417275,0.9945521,0.0047975704],"study_design_scores_gemma":[0.00008147574,0.000020222646,0.0009212801,0.0001927557,0.000023516403,0.00010901369,0.00017158604,0.0011397885,0.0005487932,0.006961749,0.98973596,0.000094022194],"about_ca_topic_score_codex":0.03857324,"about_ca_topic_score_gemma":0.045781493,"teacher_disagreement_score":0.99392337,"about_ca_system_score_codex":0.0027990472,"about_ca_system_score_gemma":0.0043502375,"threshold_uncertainty_score":0.3448503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46760935,0.0012259297,0.4739423,0.0020790026,0.00009683674,0.00045286657,0.0002753234,0.0020877467,0.052230693],"genre_scores_gemma":[0.71597254,0.00032068978,0.27216363,0.00016495619,0.00003225282,0.00009499396,0.0001333571,0.00022130548,0.010896228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814403,0.0009869965,0.00007488696,0.00015870693,0.00049253996,0.00014299141],"domain_scores_gemma":[0.9871868,0.009545178,0.00035436056,0.0014661177,0.0011848487,0.00026278896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003195103,0.000490591,0.00037128685,0.00071009016,0.00061517156,0.0015692979,0.001545345,0.0020376851,0.005039952],"category_scores_gemma":[0.014346628,0.0001741027,0.0004114951,0.0011454179,0.0009409968,0.0019447161,0.0009911045,0.0009838585,0.0010305915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013377261,0.0021703066,0.009026385,0.0010908045,0.00010233365,0.0029404715,0.0019277903,0.21541691,0.017586943,0.06433153,0.012565233,0.6715035],"study_design_scores_gemma":[0.00021211275,0.0013609352,0.0028511032,0.00013284847,0.00012043397,0.00251504,0.0012388921,0.8511129,0.04787931,0.039458554,0.05306874,0.000049206134],"about_ca_topic_score_codex":0.002164013,"about_ca_topic_score_gemma":0.0033048638,"teacher_disagreement_score":0.005039952,"about_ca_system_score_codex":0.000862706,"about_ca_system_score_gemma":0.0005667034,"threshold_uncertainty_score":0.01689756},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7660995,0.0003991555,0.22786476,0.0014263777,0.00006495256,0.00004910026,0.00046578282,0.00021964287,0.0034107587],"genre_scores_gemma":[0.9932928,0.00017956093,0.00478595,0.0000930858,0.000039399674,0.000035699348,0.00018833335,0.000035371944,0.0013497999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994772,0.00021579584,0.000020235124,0.00013958816,0.0000687205,0.00007846466],"domain_scores_gemma":[0.9856725,0.010409752,0.0017697682,0.0006239198,0.00086896267,0.00065509725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017862236,0.00038026643,0.00069541566,0.0015885495,0.00062095444,0.0012830592,0.0013303459,0.0010540923,0.0018530065],"category_scores_gemma":[0.017084958,0.0005440035,0.00055465987,0.00059786194,0.0016206461,0.0025427311,0.0009781776,0.0010317438,0.00022137733],"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.00025268455,0.000072253664,0.005873291,0.000081312166,0.00008712139,0.00014373167,0.00019575116,0.80870366,0.005012718,0.17219472,0.0013668481,0.006015956],"study_design_scores_gemma":[0.000016910188,0.00002312451,0.0014643288,0.000008157113,0.000012422051,0.000035060384,0.000034021898,0.9189314,0.00047593232,0.07880564,0.00017748254,0.000015493246],"about_ca_topic_score_codex":0.0029040098,"about_ca_topic_score_gemma":0.0021227994,"teacher_disagreement_score":0.0029040098,"about_ca_system_score_codex":0.0013149136,"about_ca_system_score_gemma":0.00058014505,"threshold_uncertainty_score":0.009540379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2536275,0.00047062975,0.7366187,0.00054410676,0.00006604618,0.00014123673,0.00018314504,0.00022141286,0.008127164],"genre_scores_gemma":[0.9736492,0.00035697877,0.022749456,0.0000489815,0.000025613768,0.00009970559,0.00007485736,0.000025317146,0.0029698003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957603,0.00015972111,0.000018846495,0.00008801461,0.00008149435,0.000075888245],"domain_scores_gemma":[0.99638164,0.0022810358,0.0005873812,0.00023018394,0.0003270107,0.00019270813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001023213,0.0005119672,0.00050754606,0.0010932372,0.0005699044,0.0011139812,0.00089137256,0.0011128224,0.0016193397],"category_scores_gemma":[0.0069431965,0.0003432812,0.00070552155,0.0007538835,0.00095041207,0.0019536838,0.00085632934,0.0007002819,0.00021674111],"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.000077325094,0.000063517815,0.0055098045,0.00008668007,0.00005900855,0.00042524934,0.00035777345,0.87902975,0.0060128486,0.09602239,0.00085670094,0.01149897],"study_design_scores_gemma":[0.0000030252922,0.000007120617,0.00017802136,0.0000024862154,0.0000045688134,0.000018755318,0.000016746373,0.99508166,0.00020124674,0.004305945,0.0001770252,0.000003375469],"about_ca_topic_score_codex":0.0065312097,"about_ca_topic_score_gemma":0.0028203952,"teacher_disagreement_score":0.0065312097,"about_ca_system_score_codex":0.0010236148,"about_ca_system_score_gemma":0.00065926707,"threshold_uncertainty_score":0.012986362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85340095,0.02167152,0.049178075,0.037731867,0.0005887932,0.0001622531,0.0013406092,0.00083119265,0.035094615],"genre_scores_gemma":[0.98533905,0.0050177695,0.005186739,0.0008790986,0.00043982588,0.00003124174,0.00013769841,0.00008715934,0.0028814285],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993304,0.00017635265,0.0000269532,0.00013992775,0.00020480808,0.0001216524],"domain_scores_gemma":[0.99487704,0.0029693365,0.0006797161,0.000495256,0.0006142187,0.00036447763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023220687,0.00048672076,0.00078632805,0.0031512533,0.0016833311,0.0038946727,0.0005294828,0.0012595064,0.0031349116],"category_scores_gemma":[0.01201958,0.00043734672,0.0006576549,0.002279633,0.002242771,0.009101833,0.0016228674,0.0019869513,0.00054654],"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.0017561973,0.0003612639,0.2409361,0.0017581328,0.00073067285,0.0028863281,0.033832543,0.021525891,0.023127694,0.24524397,0.054581515,0.37325978],"study_design_scores_gemma":[0.0001433294,0.00054249464,0.28511548,0.00086120755,0.0003809096,0.0028200836,0.02366465,0.09936736,0.0067444537,0.4577088,0.12231793,0.0003332205],"about_ca_topic_score_codex":0.005561424,"about_ca_topic_score_gemma":0.005583268,"teacher_disagreement_score":0.005561424,"about_ca_system_score_codex":0.0010841654,"about_ca_system_score_gemma":0.0004461376,"threshold_uncertainty_score":0.012280405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09743243,0.00050331344,0.8911696,0.00070431276,0.00012350947,0.000052404288,0.0006667098,0.0045355335,0.0048121177],"genre_scores_gemma":[0.7349578,0.0008159622,0.25683394,0.00012399496,0.000047003563,0.000088554116,0.0006729417,0.0006207196,0.0058390927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997379,0.00005903771,0.000018044348,0.00007195554,0.00007643421,0.000036745478],"domain_scores_gemma":[0.9991757,0.0003847295,0.00008842813,0.00012466001,0.00015615246,0.000070338196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008359788,0.0006205728,0.00036829335,0.0017084529,0.0004043639,0.002685988,0.00047625205,0.00075652293,0.0058987364],"category_scores_gemma":[0.0025943334,0.00037555012,0.0004937497,0.0010743696,0.0006866771,0.0021901203,0.0014456194,0.0009862055,0.0008982787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001184882,0.00014092922,0.007861068,0.0006047902,0.0001220589,0.00081117806,0.0031045317,0.184984,0.10740222,0.17494693,0.010128805,0.5087086],"study_design_scores_gemma":[0.000060422968,0.00010655412,0.00530243,0.000107577,0.00008182185,0.00051451003,0.00097629253,0.8054335,0.033750407,0.13186523,0.02170863,0.00009255587],"about_ca_topic_score_codex":0.0031003468,"about_ca_topic_score_gemma":0.0022614293,"teacher_disagreement_score":0.0058987364,"about_ca_system_score_codex":0.00065103243,"about_ca_system_score_gemma":0.00045114933,"threshold_uncertainty_score":0.01973325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039708514,0.016260376,0.91403466,0.004483524,0.000583876,0.00017556634,0.00067615986,0.0007390344,0.023338318],"genre_scores_gemma":[0.63095087,0.017941391,0.31678104,0.0010519256,0.0008894218,0.00087964674,0.0013821244,0.000325918,0.029797597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99869734,0.00048745243,0.00008988578,0.00019025138,0.0004411866,0.00009383001],"domain_scores_gemma":[0.9976903,0.0016527012,0.00015168497,0.00018764939,0.00023959902,0.00007803584],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0020922618,0.0012539786,0.0011341246,0.0036577014,0.0009140056,0.0048290663,0.00091055216,0.0013304695,0.008072069],"category_scores_gemma":[0.0075115478,0.0004504875,0.00081583223,0.0043142186,0.0022144164,0.008638002,0.0020999538,0.0023915626,0.0018563219],"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.000087280154,0.000079573074,0.0015648425,0.00038725478,0.000092984854,0.00021442115,0.00052920147,0.040357757,0.0012537792,0.8290327,0.005241809,0.121158354],"study_design_scores_gemma":[0.000012719527,0.000022552105,0.00041532097,0.00009563739,0.000024548835,0.00008686866,0.00013399291,0.21283078,0.00066698424,0.77018064,0.015508936,0.0000209888],"about_ca_topic_score_codex":0.0021320882,"about_ca_topic_score_gemma":0.0011719195,"teacher_disagreement_score":0.9963423,"about_ca_system_score_codex":0.0013887534,"about_ca_system_score_gemma":0.0008469396,"threshold_uncertainty_score":0.027003765},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03403942,0.0007101859,0.8070916,0.0014011571,0.00036494748,0.0006618152,0.019895656,0.12191592,0.013919314],"genre_scores_gemma":[0.23887809,0.00066620525,0.7085956,0.00027707798,0.00027047782,0.00064509397,0.03897715,0.00350392,0.008186521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988691,0.0002542987,0.000067175904,0.00022130758,0.00052415207,0.00006390152],"domain_scores_gemma":[0.9973183,0.00095081347,0.00014889333,0.0010476478,0.00038444044,0.0001498433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011476901,0.0012945202,0.0010117679,0.0035661266,0.0007990165,0.0029664866,0.0014063482,0.00051943876,0.006890284],"category_scores_gemma":[0.0073580546,0.00075172854,0.0011486023,0.002579985,0.00043078267,0.003896066,0.0031576154,0.0014952574,0.00376088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005675587,0.00050923007,0.0086207315,0.00055083324,0.0006157852,0.0004911186,0.0006947783,0.098032184,0.019008048,0.060091052,0.20728402,0.60353464],"study_design_scores_gemma":[0.000059751008,0.00005946297,0.0016581863,0.000031725835,0.000043877244,0.00014768094,0.00015032952,0.88830644,0.004914752,0.07843686,0.026145501,0.000045335815],"about_ca_topic_score_codex":0.0048761326,"about_ca_topic_score_gemma":0.008405721,"teacher_disagreement_score":0.006890284,"about_ca_system_score_codex":0.00050857395,"about_ca_system_score_gemma":0.001048793,"threshold_uncertainty_score":0.023050368},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1291242,0.0004748352,0.8660503,0.00030703572,0.00002259022,0.00017928537,0.0011132348,0.0016568722,0.0010717203],"genre_scores_gemma":[0.4461059,0.0003791422,0.5475803,0.00011078558,0.00003527344,0.00026671367,0.004310249,0.00014698865,0.0010645909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988814,0.0002572619,0.00011006466,0.00033482985,0.00030935268,0.00010709912],"domain_scores_gemma":[0.9948219,0.0030804242,0.0008312193,0.00067130936,0.00048268933,0.0001124564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009127372,0.00097316026,0.0010655802,0.0053438134,0.0007100296,0.0011497232,0.0012840708,0.0010025903,0.001294066],"category_scores_gemma":[0.009075912,0.0005325137,0.0008893941,0.0044241296,0.0006631975,0.002427548,0.001330007,0.0008568031,0.0005521912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039808644,0.00040384164,0.038690962,0.00090537325,0.0004998883,0.0015955212,0.00097560725,0.1259801,0.027314577,0.02915715,0.008827197,0.76525164],"study_design_scores_gemma":[0.000051989264,0.00014264588,0.006772555,0.00007241927,0.000115021714,0.0011692259,0.00064891647,0.8436383,0.010103466,0.13172828,0.0055202628,0.00003689584],"about_ca_topic_score_codex":0.0017433862,"about_ca_topic_score_gemma":0.0030056057,"teacher_disagreement_score":0.0053438134,"about_ca_system_score_codex":0.00033202674,"about_ca_system_score_gemma":0.0005792726,"threshold_uncertainty_score":0.004827082},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016345425,0.036552966,0.056613818,0.17380063,0.42117456,0.008576705,0.028533634,0.013645761,0.24475646],"genre_scores_gemma":[0.07074017,0.043918703,0.046976138,0.02457097,0.09431779,0.0051747654,0.055430286,0.010236507,0.64863473],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9828523,0.0032909934,0.001366315,0.0014542724,0.010064247,0.0009719626],"domain_scores_gemma":[0.7912475,0.022792783,0.0066230274,0.014425601,0.15589733,0.009013744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014250947,0.0010285685,0.0020386986,0.007194408,0.0047031534,0.008713019,0.004377766,0.0032140086,0.24424893],"category_scores_gemma":[0.13475184,0.0008214371,0.001619026,0.0063303495,0.00148091,0.0054569268,0.0057167523,0.0024079564,0.13206607],"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.000082540326,0.00003233821,0.00075221184,0.0014528636,0.00004588229,0.00009872765,0.00008907969,0.000211072,0.0006724863,0.0013038758,0.8699966,0.12526232],"study_design_scores_gemma":[0.00004996917,0.00005035537,0.002101125,0.0006356168,0.000047299483,0.00013128977,0.00018727944,0.0012450296,0.0010758472,0.0022339043,0.99220467,0.00003770436],"about_ca_topic_score_codex":0.00426189,"about_ca_topic_score_gemma":0.013007494,"teacher_disagreement_score":0.24424893,"about_ca_system_score_codex":0.0020052944,"about_ca_system_score_gemma":0.010777951,"threshold_uncertainty_score":0.8170941},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011339445,0.04280014,0.04130196,0.20536543,0.47558787,0.008249216,0.025140762,0.009577622,0.1806376],"genre_scores_gemma":[0.065795526,0.068848364,0.046365704,0.035629716,0.12925035,0.0063962005,0.057492074,0.009781637,0.5804404],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9797172,0.0044182455,0.0017695926,0.0016957747,0.011270131,0.0011289833],"domain_scores_gemma":[0.7329465,0.027865764,0.008692282,0.016188718,0.20438646,0.009920189],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.017263774,0.0010859418,0.00236003,0.007465949,0.004913736,0.009509937,0.005011616,0.0038392656,0.23221906],"category_scores_gemma":[0.16746241,0.0009197719,0.0018178895,0.0067325076,0.0016838353,0.005741766,0.006129259,0.0027001759,0.12426505],"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.00007780448,0.000029789331,0.000630045,0.0018119339,0.00004897086,0.00008405484,0.00008402045,0.00016873522,0.00050915295,0.0010878075,0.88909936,0.10636838],"study_design_scores_gemma":[0.00005862941,0.0000540773,0.0019572196,0.000977033,0.000058159283,0.00012704087,0.00019780049,0.0010151708,0.0009436665,0.0022504989,0.99232024,0.00004047488],"about_ca_topic_score_codex":0.0041680965,"about_ca_topic_score_gemma":0.012771627,"teacher_disagreement_score":0.98273623,"about_ca_system_score_codex":0.0022496982,"about_ca_system_score_gemma":0.012330396,"threshold_uncertainty_score":0.7768501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00528633,0.0033556342,0.004094531,0.010122557,0.0018293723,0.00008484129,0.0038496007,0.0019348111,0.96944225],"genre_scores_gemma":[0.002135054,0.0005720117,0.00079344807,0.00014806083,0.000025917265,0.0000070197016,0.00031262235,0.000097159114,0.9959086],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997248,0.00002382191,0.0000067991637,0.00008383465,0.00009814649,0.00006249563],"domain_scores_gemma":[0.99854374,0.00016647353,0.000026737283,0.00008024579,0.0005641257,0.0006187103],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00049177714,0.00069821376,0.0005675399,0.0015358874,0.0026748104,0.0021918255,0.0008247367,0.00094146625,0.50510526],"category_scores_gemma":[0.0015149494,0.0004067617,0.00022159718,0.0014715756,0.00040911147,0.00088107,0.0008968979,0.00126093,0.14532927],"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.0000295211,0.000052619627,0.00066152326,0.000040694853,0.00000238389,0.000079540674,0.00008333932,0.0001515602,0.00017513048,0.005019217,0.8804621,0.11324225],"study_design_scores_gemma":[0.000007075728,0.000010751357,0.0025527352,0.000067607245,0.000005555455,0.00006205262,0.00026464206,0.0003715035,0.0002429134,0.0017144809,0.99469346,0.000007234708],"about_ca_topic_score_codex":0.0922231,"about_ca_topic_score_gemma":0.44082394,"teacher_disagreement_score":0.9077769,"about_ca_system_score_codex":0.0025806709,"about_ca_system_score_gemma":0.0048013446,"threshold_uncertainty_score":0.7059073},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017088633,0.00076642854,0.927733,0.00020634421,0.00017601448,0.00027867453,0.0015630794,0.04594571,0.0062421924],"genre_scores_gemma":[0.23790564,0.000538726,0.73601216,0.00048690732,0.00014690796,0.00037507608,0.007539912,0.0026903208,0.01430437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999443,0.00007290703,0.00002701999,0.00022519505,0.00014473735,0.000087116605],"domain_scores_gemma":[0.9993451,0.00017742884,0.000040060444,0.00025294002,0.0001339192,0.000050602815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009870238,0.0015148909,0.00090783765,0.0015435492,0.0006061147,0.001177575,0.0035435203,0.0010494376,0.012005892],"category_scores_gemma":[0.0031186873,0.0006994411,0.0008585423,0.0010878138,0.0006449681,0.0033702801,0.003088175,0.0014110182,0.006236325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038197206,0.00027272938,0.0011057925,0.00035511202,0.0001886358,0.00022511005,0.0001684762,0.06312679,0.035112336,0.011653285,0.043615613,0.8437942],"study_design_scores_gemma":[0.000050449897,0.000109978224,0.00038818622,0.000018466842,0.000035313,0.00017020754,0.00006615293,0.9534495,0.020221254,0.011541074,0.013914608,0.000034800352],"about_ca_topic_score_codex":0.014303626,"about_ca_topic_score_gemma":0.028686631,"teacher_disagreement_score":0.014303626,"about_ca_system_score_codex":0.00095258286,"about_ca_system_score_gemma":0.0013951017,"threshold_uncertainty_score":0.040163696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023336259,0.00008582768,0.00028869658,0.00016859462,0.000053390973,0.000025101093,0.99289364,0.00095686177,0.005294452],"genre_scores_gemma":[0.0015008532,0.00018415549,0.0010623221,0.00012316962,0.000022582932,0.00039220374,0.9883058,0.0006684335,0.007740437],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987754,0.00035174662,0.00013323601,0.0002962919,0.0002642452,0.00017909845],"domain_scores_gemma":[0.9953709,0.0014260972,0.00040166386,0.0015152514,0.00088071625,0.00040538976],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022495869,0.0009206004,0.0007782054,0.0035698528,0.0010046876,0.0038352846,0.0020214769,0.0008222281,0.24716023],"category_scores_gemma":[0.014934046,0.0007723413,0.00076322467,0.0051875003,0.00045740596,0.0024140428,0.0032835305,0.0015344023,0.2481509],"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.00003635817,0.000012160925,0.0010017289,0.000418245,0.000014608537,0.000013112103,0.00009464947,0.000096356416,0.000042465963,0.0010977368,0.99207896,0.005093627],"study_design_scores_gemma":[0.000052032847,0.000006392564,0.0021842623,0.00031270395,0.000007486369,0.00002474462,0.00021473532,0.00014207898,0.00020140204,0.0011993513,0.9956405,0.000014421384],"about_ca_topic_score_codex":0.014682426,"about_ca_topic_score_gemma":0.02613965,"teacher_disagreement_score":0.7528398,"about_ca_system_score_codex":0.001641697,"about_ca_system_score_gemma":0.0024032246,"threshold_uncertainty_score":0.8268333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46408662,0.001813509,0.0037846551,0.0016265651,0.0013978515,0.00038782097,0.491934,0.0009822731,0.033986773],"genre_scores_gemma":[0.43322203,0.0020532028,0.005567824,0.0017955262,0.00043572157,0.001136192,0.49895814,0.00040075547,0.05643057],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933594,0.00007845777,0.00015718909,0.00013165618,0.0002535976,0.0000431019],"domain_scores_gemma":[0.99719644,0.0007961149,0.0005850118,0.00044465126,0.0006687163,0.00030907127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008005,0.00061793375,0.0006839973,0.0011437513,0.0003886503,0.00082803104,0.0010560241,0.0006878049,0.057112854],"category_scores_gemma":[0.0018171888,0.00027919895,0.0004850164,0.0011939161,0.0003355508,0.000692312,0.00054932677,0.0008224263,0.016019652],"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.02192739,0.004363172,0.39139435,0.0040142825,0.0022480942,0.0015913092,0.00084634655,0.0020679529,0.08460781,0.0023501075,0.30497843,0.17961077],"study_design_scores_gemma":[0.001248833,0.0020932627,0.8400101,0.00025247002,0.00061954994,0.00069064356,0.00023743231,0.0012317444,0.01191024,0.00092439307,0.1406694,0.00011192534],"about_ca_topic_score_codex":0.0039593037,"about_ca_topic_score_gemma":0.0041026874,"teacher_disagreement_score":0.057112854,"about_ca_system_score_codex":0.00031246504,"about_ca_system_score_gemma":0.00036204502,"threshold_uncertainty_score":0.19106156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17162342,0.0333573,0.0047564856,0.10898436,0.0023116046,0.00014165536,0.004406563,0.00040057275,0.6740181],"genre_scores_gemma":[0.8511137,0.023407806,0.0026671188,0.0076512173,0.00031016965,0.000047408525,0.0011962486,0.00013295846,0.11347341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99372226,0.0005441391,0.00010013841,0.0003768283,0.0040130788,0.0012435222],"domain_scores_gemma":[0.9918018,0.0021025033,0.0007714408,0.00024305316,0.00392069,0.0011604822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020122898,0.0004934283,0.00040024598,0.005257101,0.019448772,0.013511197,0.0013501348,0.0016383976,0.0071097454],"category_scores_gemma":[0.008834812,0.00036702052,0.00039840883,0.011281078,0.008358588,0.0032068593,0.003650828,0.002399674,0.00059676287],"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.00012236569,0.00003302681,0.016989317,0.00054686895,0.000050766277,0.001449747,0.13794388,0.0010669903,0.0009029054,0.5091397,0.19542299,0.13633147],"study_design_scores_gemma":[0.00000798307,0.000012380786,0.01850015,0.00034796348,0.000032704058,0.00030409655,0.05450807,0.00072309107,0.00061749597,0.009420396,0.9154343,0.00009134902],"about_ca_topic_score_codex":0.98853344,"about_ca_topic_score_gemma":0.990961,"teacher_disagreement_score":0.12492272,"about_ca_system_score_codex":0.12492272,"about_ca_system_score_gemma":0.15326287,"threshold_uncertainty_score":0.906382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13146725,0.0013860591,0.042779554,0.012729413,0.0034711314,0.016222384,0.05947813,0.006102748,0.72636336],"genre_scores_gemma":[0.41869187,0.0033031963,0.044736113,0.015975507,0.00196509,0.044225074,0.05365192,0.0034842952,0.41396698],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9919178,0.002008615,0.00074995606,0.00046790368,0.0045141396,0.0003415821],"domain_scores_gemma":[0.9390138,0.032181296,0.0022545226,0.0041453177,0.019853322,0.0025518038],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.007932127,0.00068736396,0.0009408259,0.0020685773,0.0011045518,0.0028311494,0.0012081602,0.0011410422,0.31809607],"category_scores_gemma":[0.10462714,0.00035471792,0.0007562613,0.001269665,0.0010498981,0.0046136347,0.0023364995,0.003249801,0.122361],"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.0004715068,0.0014828354,0.009341646,0.00094865076,0.00002804229,0.00021859891,0.0042458484,0.0006744606,0.0007346033,0.010815649,0.70663774,0.2644004],"study_design_scores_gemma":[0.00031722375,0.0005714871,0.03803172,0.00067174435,0.000040062558,0.0005227358,0.0051497305,0.0017445071,0.0016743905,0.03211732,0.9189516,0.00020755273],"about_ca_topic_score_codex":0.0015049012,"about_ca_topic_score_gemma":0.0018324406,"teacher_disagreement_score":0.68190396,"about_ca_system_score_codex":0.0017170275,"about_ca_system_score_gemma":0.0020980663,"threshold_uncertainty_score":0.9726532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022921525,0.009777798,0.002015693,0.004547608,0.0045299046,0.000087179156,0.0025209866,0.0026555704,0.9715731],"genre_scores_gemma":[0.0041398285,0.0044025565,0.0009443021,0.0003424435,0.00029203194,0.000020965588,0.0007466491,0.00060059025,0.9885106],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947554,0.000023604078,0.000022169097,0.00006937135,0.00032881292,0.00008050556],"domain_scores_gemma":[0.9996278,0.000035690915,0.000019820667,0.00003172978,0.00013607259,0.000148859],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039402963,0.001249767,0.00052606576,0.0013837162,0.0015162266,0.004334209,0.0005528906,0.0014410794,0.6178075],"category_scores_gemma":[0.0010922014,0.0004337396,0.0003929212,0.0009835487,0.00048048134,0.0031046886,0.0028294348,0.0018525214,0.5787523],"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.00004034649,0.000037757603,0.00019996833,0.0002328568,0.0000066168877,0.00020650281,0.00016994156,0.00019578685,0.0015266695,0.0053809695,0.78159153,0.21041106],"study_design_scores_gemma":[0.0000024992044,0.000008137359,0.00029380416,0.00007504209,0.0000013273199,0.00016198892,0.00007540041,0.00003436801,0.0004057114,0.00045931144,0.99847716,0.000005354152],"about_ca_topic_score_codex":0.0034299088,"about_ca_topic_score_gemma":0.007327199,"teacher_disagreement_score":0.3821925,"about_ca_system_score_codex":0.0010106122,"about_ca_system_score_gemma":0.0016303081,"threshold_uncertainty_score":0.5451512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001076859,0.00043746486,0.001897127,0.004577273,0.0022315695,0.0015547646,0.05604767,0.011842846,0.9203344],"genre_scores_gemma":[0.0045944867,0.00052831,0.0023617933,0.0025105518,0.0010905709,0.0011445583,0.031833548,0.003952207,0.951984],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99732506,0.00035499214,0.00022180006,0.00019480284,0.0015219039,0.00038136216],"domain_scores_gemma":[0.98983335,0.0011712871,0.0006309521,0.00074511307,0.0053844354,0.0022348212],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018035071,0.0015330192,0.0015172904,0.0037390084,0.0021726647,0.004591204,0.0016213878,0.0025700121,0.8951613],"category_scores_gemma":[0.015387317,0.00078519544,0.0009325316,0.0037116548,0.0004435361,0.0035146852,0.00415082,0.002114872,0.88266176],"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.000009568889,0.000020347214,0.000033643257,0.000028572627,5.3473224e-7,0.0000090521535,0.000007793917,0.000012155788,0.0000324056,0.00023053148,0.9879935,0.011621949],"study_design_scores_gemma":[0.000022387914,0.000024903458,0.0007329012,0.0000593539,0.0000012292692,0.000037789752,0.000059941685,0.000059029935,0.00013518079,0.00053008774,0.9983259,0.000011366426],"about_ca_topic_score_codex":0.0033941257,"about_ca_topic_score_gemma":0.0045353025,"teacher_disagreement_score":0.10483873,"about_ca_system_score_codex":0.0013348465,"about_ca_system_score_gemma":0.0020867477,"threshold_uncertainty_score":0.14953965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020087064,0.00035003605,0.0008289775,0.0009580466,0.0013464786,0.00025286197,0.008258614,0.0024958127,0.98530835],"genre_scores_gemma":[0.00045793757,0.00019079704,0.00028250462,0.00022581001,0.00006340779,0.000045958277,0.0018291327,0.0008549495,0.99604946],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99727964,0.00009179967,0.000071695766,0.00025230245,0.0019906708,0.00031376645],"domain_scores_gemma":[0.9882023,0.000563092,0.00013692077,0.00076707685,0.009275875,0.0010548027],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00121641,0.0014183688,0.0013411784,0.0032349913,0.005997859,0.009388394,0.0031347536,0.0035377536,0.92306685],"category_scores_gemma":[0.008278802,0.0011502492,0.0011217342,0.0044816057,0.0016065553,0.0037700187,0.0027445715,0.0026250354,0.87165165],"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.000016568392,0.0000102046,0.0000323682,0.00007014933,7.7304435e-7,0.00002048516,0.000033058077,0.00002791375,0.0001851802,0.0015844334,0.98260546,0.015413432],"study_design_scores_gemma":[0.0000034883435,0.000004202817,0.00014144677,0.000038684335,6.9606637e-7,0.000020263333,0.000042459695,0.00001930055,0.0000925802,0.00017577769,0.99945503,0.0000062066997],"about_ca_topic_score_codex":0.34290588,"about_ca_topic_score_gemma":0.47610986,"teacher_disagreement_score":0.34290588,"about_ca_system_score_codex":0.01100159,"about_ca_system_score_gemma":0.020261165,"threshold_uncertainty_score":0.6818199},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005757133,0.00064118294,0.04302,0.0046639447,0.004018314,0.0016417869,0.83296716,0.073536634,0.038935278],"genre_scores_gemma":[0.020090768,0.0014476135,0.17419384,0.0049236626,0.0017906079,0.019717881,0.5935657,0.12229697,0.061973],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9876265,0.005337118,0.0016543501,0.0015299434,0.0031338322,0.00071819173],"domain_scores_gemma":[0.8883676,0.05286012,0.0037832821,0.030155791,0.022244183,0.0025890507],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.023043146,0.0022249646,0.002827891,0.0041246656,0.0014524686,0.0058828834,0.0050717727,0.0033965057,0.63721406],"category_scores_gemma":[0.19463384,0.0024005338,0.0041626412,0.0066016316,0.0010907453,0.0044854325,0.0039014197,0.004539341,0.4586706],"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.00026350538,0.000037023266,0.00037273066,0.0010941599,0.00016299888,0.000023205785,0.000080652375,0.00033990553,0.00012014154,0.0030508477,0.96885556,0.025599314],"study_design_scores_gemma":[0.0018044768,0.0000891716,0.0029213869,0.0015730936,0.0003720898,0.00012517945,0.0001437211,0.0020443033,0.0012881596,0.03491121,0.95451194,0.00021530449],"about_ca_topic_score_codex":0.009646308,"about_ca_topic_score_gemma":0.009621531,"teacher_disagreement_score":0.63721406,"about_ca_system_score_codex":0.0020272222,"about_ca_system_score_gemma":0.009281982,"threshold_uncertainty_score":0.5174701},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26928753,0.03106843,0.008182029,0.002316858,0.00085223746,0.00072094786,0.013327239,0.0014588764,0.6727859],"genre_scores_gemma":[0.91517633,0.012064086,0.008448936,0.0013929806,0.00033704666,0.00033378907,0.0076103862,0.0001836443,0.054452777],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998721,0.000012481288,0.000011699361,0.000048045982,0.000032563064,0.000023190798],"domain_scores_gemma":[0.9999269,0.0000069499474,0.000029409006,0.0000113544675,0.000016257452,0.000009093168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006286336,0.00059973705,0.00020844756,0.0012066655,0.0014105815,0.0005370214,0.0005073384,0.00056784373,0.017386446],"category_scores_gemma":[0.00028575867,0.00017664388,0.00015892857,0.0011085786,0.00035702597,0.0011942977,0.0007778595,0.0007368736,0.0043100608],"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.00039050932,0.00010793187,0.022029554,0.0017425262,0.000080036465,0.00342655,0.0033941227,0.0002830123,0.029428842,0.008963391,0.08440156,0.84575206],"study_design_scores_gemma":[0.000036777343,0.00013289045,0.12036285,0.00040463355,0.00006463118,0.010813401,0.0015749356,0.00020308295,0.002358275,0.0016565863,0.8623696,0.00002234376],"about_ca_topic_score_codex":0.004576327,"about_ca_topic_score_gemma":0.004478926,"teacher_disagreement_score":0.017386446,"about_ca_system_score_codex":0.00060925266,"about_ca_system_score_gemma":0.00037742124,"threshold_uncertainty_score":0.058163404},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055237784,0.0009116208,0.0008714905,0.00065067085,0.0013856648,0.00006848174,0.0041837413,0.0039530634,0.9874228],"genre_scores_gemma":[0.0017045109,0.0005466266,0.00046347792,0.00026104593,0.00013912283,0.00004475042,0.0022683819,0.0017007195,0.99287146],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998235,0.000013333558,0.0000058875344,0.000034426073,0.00008501104,0.000037980437],"domain_scores_gemma":[0.99958116,0.000042061038,0.000010541737,0.000058707436,0.00018391384,0.00012374009],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027923676,0.0009378162,0.00041812175,0.0009718201,0.0012567784,0.0035785525,0.00072859804,0.000935221,0.8822566],"category_scores_gemma":[0.0007602499,0.0003096115,0.00046386424,0.0013567435,0.00034625246,0.0022250484,0.0021011773,0.0011368439,0.7429222],"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.000026743026,0.000009826104,0.000052700656,0.00010664198,0.0000013342163,0.000041380255,0.00008372908,0.000018705767,0.000741662,0.001148169,0.94813454,0.049634587],"study_design_scores_gemma":[0.000004177511,0.0000057981306,0.0002544322,0.00003149773,8.891823e-7,0.000031051986,0.00006863412,0.000010721919,0.00011274619,0.00013244747,0.9993449,0.0000026613097],"about_ca_topic_score_codex":0.006252543,"about_ca_topic_score_gemma":0.022078779,"teacher_disagreement_score":0.11774337,"about_ca_system_score_codex":0.00077010965,"about_ca_system_score_gemma":0.00067154533,"threshold_uncertainty_score":0.16794658},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020732263,0.090051696,0.0068520685,0.021439003,0.041988637,0.000056564233,0.0004810008,0.00056195364,0.83649576],"genre_scores_gemma":[0.013266807,0.028533105,0.0017948945,0.0024271933,0.011188505,0.00003676189,0.00024327304,0.00034796214,0.94216144],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994808,0.00010255937,0.000016679343,0.00009026163,0.00028077973,0.000028934928],"domain_scores_gemma":[0.99894243,0.00048134325,0.00007290742,0.000108393615,0.00027478236,0.000120232566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007447614,0.0007420446,0.00042263902,0.0023575467,0.0019449356,0.0060379105,0.00045196418,0.0012114651,0.039155476],"category_scores_gemma":[0.0023651044,0.0003346488,0.00029783943,0.0017505992,0.0027738644,0.003663656,0.0011883961,0.0030817855,0.013030501],"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.000026240155,0.000011651174,0.00020129763,0.00026546617,0.000005981585,0.00010070167,0.0011086131,0.00014306317,0.00037159215,0.16977073,0.7507633,0.07723138],"study_design_scores_gemma":[9.80434e-7,0.0000025692432,0.00010537689,0.000087301705,0.0000017271979,0.00006487558,0.00014677802,0.000053182546,0.00007972613,0.0042642048,0.9951912,0.0000020749771],"about_ca_topic_score_codex":0.002531492,"about_ca_topic_score_gemma":0.0072314315,"teacher_disagreement_score":0.039155476,"about_ca_system_score_codex":0.0024374782,"about_ca_system_score_gemma":0.0019054371,"threshold_uncertainty_score":0.13098812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2538578,0.0314237,0.0057112332,0.0015697917,0.0022124348,0.0008151902,0.012734897,0.00080669246,0.69086826],"genre_scores_gemma":[0.93902427,0.005689457,0.0036603631,0.0005463347,0.00035726055,0.0004664242,0.007508852,0.000050076218,0.04269694],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9997428,0.000025431258,0.000027280375,0.00007593059,0.00008956175,0.000038976767],"domain_scores_gemma":[0.99969566,0.000050015744,0.00012327063,0.000020543986,0.00007192835,0.000038556213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012631042,0.000925963,0.00042251693,0.0033076731,0.0013955547,0.0004490097,0.00066279055,0.000613307,0.025902795],"category_scores_gemma":[0.00058521464,0.00022824081,0.00021712005,0.0021406575,0.00069409044,0.001149565,0.00088507554,0.0005271889,0.006336498],"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.0009770824,0.00009942368,0.034168962,0.0015195643,0.000059961494,0.0024822261,0.0011271914,0.0011512405,0.036079567,0.006542474,0.05022699,0.8655654],"study_design_scores_gemma":[0.00010438469,0.0004514335,0.57717735,0.0009258689,0.0001327455,0.0057022725,0.001660233,0.0013596971,0.005990606,0.0017195747,0.4046843,0.00009157444],"about_ca_topic_score_codex":0.024182724,"about_ca_topic_score_gemma":0.03694589,"teacher_disagreement_score":0.025902795,"about_ca_system_score_codex":0.0015225549,"about_ca_system_score_gemma":0.00055434805,"threshold_uncertainty_score":0.08665353},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9441812,0.002112285,0.010745151,0.0008773847,0.00021525612,0.00033361305,0.0047623715,0.0006390245,0.03613379],"genre_scores_gemma":[0.9155098,0.0010818365,0.032578915,0.0004980362,0.00002818547,0.00015661216,0.0034743047,0.00055942906,0.04611294],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990615,0.00007708686,0.000038151586,0.00026609868,0.00043615466,0.0001210207],"domain_scores_gemma":[0.99866676,0.00028274953,0.00015714407,0.0001744305,0.0006248379,0.0000939636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008647314,0.00033898687,0.00020798977,0.0010626864,0.0028613135,0.0010129971,0.0008016828,0.0008566517,0.0048012445],"category_scores_gemma":[0.0015072727,0.0002749835,0.0002458875,0.0009534686,0.0010786112,0.00032958132,0.0005900709,0.000556954,0.0016327361],"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.00053165125,0.00011808191,0.13930814,0.0010372027,0.00015313597,0.007190984,0.009686457,0.0013095005,0.73573,0.0014952892,0.014237629,0.08920188],"study_design_scores_gemma":[0.0000101408405,0.00016471162,0.59064007,0.0001948232,0.00018539045,0.0057460763,0.005911147,0.00122751,0.28548902,0.0003451748,0.1100136,0.000072383904],"about_ca_topic_score_codex":0.14140014,"about_ca_topic_score_gemma":0.45705757,"teacher_disagreement_score":0.14140014,"about_ca_system_score_codex":0.0021327862,"about_ca_system_score_gemma":0.0010098794,"threshold_uncertainty_score":0.28115422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.184551,0.057248518,0.009231288,0.0016544475,0.0011152516,0.0010510243,0.010325423,0.0013033918,0.7335196],"genre_scores_gemma":[0.88423926,0.018685669,0.008458134,0.0011508459,0.000320911,0.00044086864,0.0047144354,0.00018445513,0.08180539],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9997197,0.000019285051,0.0000329119,0.00009858285,0.000080535596,0.00004892946],"domain_scores_gemma":[0.9997576,0.00003377473,0.00007296309,0.00003306321,0.00007830291,0.000024346058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013894051,0.0010277716,0.0006693779,0.0026299711,0.003719842,0.0008504753,0.0010610183,0.0010842165,0.018352991],"category_scores_gemma":[0.00047073935,0.0005095872,0.0003016367,0.0019403637,0.0009824216,0.0022065695,0.0014548115,0.0010168547,0.009826602],"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.00069153204,0.00017351481,0.025926031,0.0029378133,0.00018830455,0.0060116965,0.003589389,0.0013881403,0.039116707,0.009373768,0.06114833,0.8494549],"study_design_scores_gemma":[0.0001130392,0.00013733818,0.23608115,0.0018142011,0.00030746267,0.017819738,0.0038358811,0.00070043106,0.00441773,0.0037950734,0.73089343,0.000084566906],"about_ca_topic_score_codex":0.05017823,"about_ca_topic_score_gemma":0.091001794,"teacher_disagreement_score":0.05017823,"about_ca_system_score_codex":0.0015478956,"about_ca_system_score_gemma":0.0011780462,"threshold_uncertainty_score":0.099772334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3952076,0.05954974,0.011462277,0.0026767338,0.005299428,0.0017272045,0.016195724,0.000978702,0.50690264],"genre_scores_gemma":[0.8729112,0.024298979,0.01333901,0.0033253997,0.0013941692,0.0008845152,0.01918959,0.000085896405,0.06457116],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997621,0.00001604554,0.00002414445,0.00006752004,0.00009770123,0.000032418757],"domain_scores_gemma":[0.9997578,0.000040306466,0.00006778272,0.000018408808,0.000088749905,0.00002687631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020387843,0.00078705524,0.00035075628,0.0015155092,0.0010488939,0.0005110852,0.0005540517,0.0007312873,0.010678373],"category_scores_gemma":[0.0006513247,0.00026198465,0.00016411846,0.001037095,0.0006194787,0.0014671149,0.00091284676,0.0005447338,0.0072016623],"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.00035863605,0.00015271729,0.06510563,0.0024709243,0.00017838938,0.0050039105,0.002958845,0.0016171355,0.03325696,0.00809984,0.117937885,0.7628591],"study_design_scores_gemma":[0.000122053476,0.00041108284,0.22933145,0.0013932267,0.00017971163,0.012564933,0.0026756865,0.0011169009,0.004372631,0.0026581413,0.7451083,0.00006588839],"about_ca_topic_score_codex":0.013097841,"about_ca_topic_score_gemma":0.02033615,"teacher_disagreement_score":0.013097841,"about_ca_system_score_codex":0.0007319266,"about_ca_system_score_gemma":0.0007954505,"threshold_uncertainty_score":0.035722733},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019967656,0.0005041046,0.061475333,0.0005883828,0.00056440994,0.0002670983,0.017424975,0.8599363,0.057242677],"genre_scores_gemma":[0.0330623,0.0006759818,0.07209605,0.0019022363,0.00018950975,0.0012097182,0.06195936,0.7286353,0.10026946],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99873453,0.00013358935,0.00007124154,0.00026863103,0.0004933503,0.00029873394],"domain_scores_gemma":[0.99819946,0.000339553,0.00007384551,0.00047245063,0.0006416327,0.0002729496],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001606947,0.0041696248,0.0018982178,0.00180101,0.0009699816,0.0051659737,0.008726452,0.0029668757,0.33201358],"category_scores_gemma":[0.006272633,0.003015795,0.0018590647,0.0017679654,0.001080765,0.0037469333,0.004278034,0.005165971,0.30860147],"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.00031280244,0.000074407,0.00066269113,0.00038652107,0.00007761765,0.00009460875,0.00014281517,0.0014114521,0.001720192,0.0064234515,0.9543914,0.034302097],"study_design_scores_gemma":[0.00073851686,0.00006765552,0.001261841,0.00020964233,0.0000682585,0.0002079849,0.000097829514,0.033287052,0.023373295,0.015856275,0.9246569,0.00017453525],"about_ca_topic_score_codex":0.008456539,"about_ca_topic_score_gemma":0.00884935,"teacher_disagreement_score":0.33201358,"about_ca_system_score_codex":0.0027967058,"about_ca_system_score_gemma":0.002530051,"threshold_uncertainty_score":0.9528016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039012806,0.9968567,0.00030399347,0.0005047905,0.0003770121,0.000010228731,0.000060393995,0.000021418198,0.00147538],"genre_scores_gemma":[0.0021034328,0.99589807,0.00034453813,0.00021717958,0.00030321322,0.000009971804,0.00009470065,0.0000050169883,0.0010237682],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966776,0.00005134235,0.000051576684,0.00005488163,0.00014279729,0.000031704432],"domain_scores_gemma":[0.9994399,0.00018704482,0.00008842798,0.000018535406,0.00021730628,0.000048807004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083226344,0.00057663344,0.00079148705,0.0021661774,0.0003197174,0.0012286666,0.0005595085,0.0007252421,0.0052725286],"category_scores_gemma":[0.0011301581,0.00024723852,0.00049962645,0.0017967606,0.0003668117,0.0014410156,0.00059724884,0.0009748339,0.0020358486],"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.00014083592,0.000062158535,0.00028330347,0.024247345,0.00010408475,0.00017232425,0.000099400604,0.0002936023,0.0044015176,0.0048986035,0.031085912,0.93421096],"study_design_scores_gemma":[0.000012340908,0.00012006001,0.00065813656,0.002261102,0.0001122675,0.0006866287,0.000056181016,0.00010548065,0.0016023696,0.0012992984,0.99306846,0.000017739514],"about_ca_topic_score_codex":0.0007127696,"about_ca_topic_score_gemma":0.0011244215,"teacher_disagreement_score":0.0052725286,"about_ca_system_score_codex":0.0005818387,"about_ca_system_score_gemma":0.0015050374,"threshold_uncertainty_score":0.017638385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009297941,0.00006034888,0.00003583172,0.00002044802,0.000009559459,0.0000053709327,0.9967458,0.00014220132,0.0028873964],"genre_scores_gemma":[0.00066639355,0.00018448826,0.00020466495,0.000016598924,0.0000047526923,0.000038201983,0.9890611,0.00013812921,0.0096856095],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999406,0.000025654872,0.0000526686,0.00014198366,0.0002417302,0.00013198069],"domain_scores_gemma":[0.99834025,0.0001148022,0.0001517638,0.00024844168,0.0009432423,0.0002015147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003835848,0.0016257826,0.0013045147,0.0043834704,0.0012892749,0.0029903087,0.0014475763,0.0004909325,0.16036975],"category_scores_gemma":[0.0025289068,0.0010334211,0.00054642465,0.018824082,0.0004544749,0.0012115528,0.0009979645,0.00083430525,0.16419144],"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.000024455356,0.00000383188,0.00079293444,0.0003451354,0.000010135897,0.00001489004,0.00004579296,0.00008993299,0.00006396767,0.0002662175,0.99326754,0.0050751916],"study_design_scores_gemma":[0.000025465237,0.0000025973004,0.010096827,0.00011267046,0.000008336255,0.000019871139,0.00010331042,0.00008183961,0.00011591147,0.00017057717,0.9892496,0.000012922679],"about_ca_topic_score_codex":0.83983785,"about_ca_topic_score_gemma":0.9064089,"teacher_disagreement_score":0.16036975,"about_ca_system_score_codex":0.007779631,"about_ca_system_score_gemma":0.012428625,"threshold_uncertainty_score":0.53649026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009325617,0.00007805895,0.000039302002,0.000092171635,0.000026655274,0.00007264627,0.99545246,0.00005714815,0.0032491065],"genre_scores_gemma":[0.008748896,0.00045957658,0.00044402241,0.00026591631,0.000029479608,0.00043833847,0.979681,0.000062616025,0.009870088],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9976694,0.00010363142,0.00026944416,0.00031984292,0.0010942429,0.0005433509],"domain_scores_gemma":[0.9897864,0.00030066463,0.000527114,0.000329707,0.008373457,0.00068274635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012769379,0.0010382165,0.0011456497,0.004630718,0.00262637,0.0025143,0.0020342611,0.0006746398,0.050848547],"category_scores_gemma":[0.008030923,0.0008444375,0.00086920586,0.023060521,0.00032714236,0.0012168295,0.0011699788,0.0012494618,0.022005789],"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.000070939845,0.000032897347,0.01480435,0.00031932507,0.000029575172,0.000023876653,0.00010952331,0.00015862283,0.000020897109,0.00027124866,0.97883373,0.0053248922],"study_design_scores_gemma":[0.00023056683,0.000046978046,0.5746285,0.0008227102,0.00008369984,0.00007516413,0.0014432021,0.00088650495,0.0002744959,0.0002715221,0.42115694,0.00007980132],"about_ca_topic_score_codex":0.98560506,"about_ca_topic_score_gemma":0.9881521,"teacher_disagreement_score":0.050848547,"about_ca_system_score_codex":0.027144844,"about_ca_system_score_gemma":0.05047645,"threshold_uncertainty_score":0.19695055},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031054118,0.00023278416,0.02117152,0.00048399542,0.0007454566,0.00085176656,0.8976823,0.06679534,0.008931452],"genre_scores_gemma":[0.011444473,0.00049709296,0.06604278,0.0010734622,0.00019655663,0.0080350125,0.81651205,0.07050005,0.025698522],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9984138,0.00015681087,0.0002387512,0.00041099696,0.0006069564,0.00017264142],"domain_scores_gemma":[0.9932413,0.0027772714,0.00047546823,0.0014646717,0.0015934821,0.0004477578],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018619568,0.0026298235,0.0021685027,0.0030746197,0.0013732747,0.002554906,0.0027010182,0.0014664626,0.44962493],"category_scores_gemma":[0.013466667,0.0015412663,0.0018504823,0.0030951558,0.0009792127,0.0022690087,0.0034288561,0.0031074998,0.2612092],"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.00060614233,0.00012471945,0.001998786,0.0022475144,0.00008698405,0.00022201544,0.00027349338,0.0008826378,0.004472505,0.0016586703,0.9613817,0.02604489],"study_design_scores_gemma":[0.0012499515,0.00029128673,0.02071755,0.0013985971,0.00016067277,0.00086508866,0.0002074111,0.0037332838,0.013730691,0.015796244,0.9415734,0.00027582629],"about_ca_topic_score_codex":0.0037875294,"about_ca_topic_score_gemma":0.0049128155,"teacher_disagreement_score":0.44962493,"about_ca_system_score_codex":0.0008343621,"about_ca_system_score_gemma":0.0027659342,"threshold_uncertainty_score":0.78504324},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000815182,0.000033740213,0.0002768969,0.000040577936,0.00002119699,0.00012490508,0.9977144,0.00031398976,0.0006591144],"genre_scores_gemma":[0.001908866,0.000038122034,0.0008753258,0.00005854821,0.000010812981,0.00093609263,0.9951384,0.0000925888,0.00094122865],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976057,0.00057564635,0.0005736242,0.0005520864,0.0004879676,0.00020500753],"domain_scores_gemma":[0.9938426,0.0016965144,0.00080481515,0.0015547904,0.00181286,0.00028835997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003039557,0.0010227526,0.0009964667,0.0047529796,0.000563283,0.0013522581,0.0015578067,0.000985059,0.04154107],"category_scores_gemma":[0.01413318,0.00066635106,0.001067795,0.0061205872,0.0003595421,0.0010195762,0.0017020206,0.0012762466,0.037196398],"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.00012619556,0.0000852663,0.015014578,0.0006569227,0.000077711105,0.00003895846,0.00007103933,0.00060670654,0.0001044578,0.00055553915,0.97372174,0.00894072],"study_design_scores_gemma":[0.00041357853,0.00006685875,0.07352914,0.00048725953,0.000068883,0.00020014605,0.0003952409,0.0015435477,0.0004804062,0.0014825435,0.92125213,0.00008024061],"about_ca_topic_score_codex":0.022586534,"about_ca_topic_score_gemma":0.03290219,"teacher_disagreement_score":0.04154107,"about_ca_system_score_codex":0.0012036487,"about_ca_system_score_gemma":0.0016923099,"threshold_uncertainty_score":0.1389687},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006680562,0.000022687256,0.00031541768,0.00008634124,0.000020725713,0.00003884359,0.99834335,0.00016165132,0.00034294717],"genre_scores_gemma":[0.03579348,0.0002196529,0.006601148,0.00075511774,0.00017216781,0.0025412221,0.9424182,0.0006772564,0.010821691],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925154,0.0001422877,0.00011906941,0.00022293942,0.00014428435,0.00011980523],"domain_scores_gemma":[0.9804434,0.015244015,0.0015350115,0.0011027441,0.0011398722,0.00053497776],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013735265,0.001033489,0.0014354816,0.0016875297,0.0010072183,0.0015571194,0.0019479943,0.0014159497,0.74057245],"category_scores_gemma":[0.029550638,0.0006123658,0.0015132056,0.0029533878,0.00022368963,0.0014106916,0.0009117919,0.0010135209,0.06041522],"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.0011675991,0.00022134994,0.03295623,0.005154881,0.0005723111,0.00038963108,0.00025047406,0.0015661678,0.00034955025,0.0015790612,0.93613905,0.019653825],"study_design_scores_gemma":[0.017164323,0.0012674872,0.3171236,0.009706565,0.0022706944,0.003007906,0.0013724561,0.009833665,0.0025390887,0.0219044,0.613263,0.0005467803],"about_ca_topic_score_codex":0.013766061,"about_ca_topic_score_gemma":0.01898885,"teacher_disagreement_score":0.74057245,"about_ca_system_score_codex":0.0007177674,"about_ca_system_score_gemma":0.0017602805,"threshold_uncertainty_score":0.3700419},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012057075,0.01006941,0.020278506,0.009894285,0.0070521897,0.000781199,0.1693388,0.028702244,0.74182636],"genre_scores_gemma":[0.029019414,0.0027592278,0.005279567,0.00044897103,0.0009286351,0.0003737294,0.032835435,0.006555781,0.92179924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984366,0.00025570602,0.00005645735,0.00025973452,0.0007529629,0.00023861486],"domain_scores_gemma":[0.9978307,0.00051588874,0.00015179387,0.00040172093,0.00067354424,0.00042639437],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023624562,0.0015482502,0.0015418644,0.003085858,0.0017987209,0.0071456134,0.0017093371,0.0024547041,0.4593268],"category_scores_gemma":[0.0045909383,0.00046908806,0.0011725783,0.0033210686,0.0010629512,0.0026469773,0.0017147763,0.0031750211,0.23592761],"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.00070312485,0.00018408138,0.001419203,0.00033227395,0.000065933804,0.00032928,0.0003271341,0.0019523574,0.0017941982,0.03502279,0.8685329,0.08933669],"study_design_scores_gemma":[0.00010726354,0.000047427042,0.0029855617,0.00014864316,0.000007515787,0.00008920899,0.00012011847,0.00072800915,0.0013769405,0.0029617588,0.99139977,0.000027801716],"about_ca_topic_score_codex":0.102076806,"about_ca_topic_score_gemma":0.09034857,"teacher_disagreement_score":0.4593268,"about_ca_system_score_codex":0.0061550247,"about_ca_system_score_gemma":0.006132041,"threshold_uncertainty_score":0.7712047},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029740347,0.09040346,0.005809501,0.51599425,0.050617628,0.00035016699,0.0047039906,0.0020631372,0.30031756],"genre_scores_gemma":[0.048065446,0.048554137,0.0041354853,0.023590751,0.0033859338,0.00016939292,0.0013944478,0.00037747377,0.87032694],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99811506,0.0001753242,0.00007878889,0.0004255842,0.0007345183,0.00047079718],"domain_scores_gemma":[0.986672,0.0007108218,0.00031982074,0.00012824079,0.0066915555,0.0054776613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020859952,0.0007816993,0.0011251448,0.0020914366,0.0045501855,0.004076643,0.001390948,0.0017431622,0.09824896],"category_scores_gemma":[0.005787565,0.0004848493,0.0003688336,0.0017453608,0.0012145928,0.0016995489,0.0015286832,0.0033042138,0.029687133],"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.00018456606,0.000120385295,0.007653605,0.0003480917,0.000026804018,0.0005632177,0.0011150216,0.00028611216,0.0011530925,0.007747458,0.8540556,0.12674609],"study_design_scores_gemma":[0.000015016074,0.000045646815,0.004831211,0.00032555597,0.00001797295,0.0005556089,0.0012896967,0.0002799766,0.00063742406,0.0012584153,0.99071246,0.000030989475],"about_ca_topic_score_codex":0.1739889,"about_ca_topic_score_gemma":0.2581588,"teacher_disagreement_score":0.1739889,"about_ca_system_score_codex":0.0130964415,"about_ca_system_score_gemma":0.048298337,"threshold_uncertainty_score":0.34595227},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020106029,0.47518456,0.007176697,0.08389474,0.011771449,0.00006290952,0.00077292824,0.00023175047,0.40079898],"genre_scores_gemma":[0.094208494,0.2707791,0.004592666,0.003305936,0.0024561095,0.00011441632,0.0006997405,0.0001105061,0.623733],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999373,0.000016938042,0.0000037857658,0.000010096781,0.000018585864,0.000013200044],"domain_scores_gemma":[0.99985373,0.00003766887,0.000010075047,0.000004299429,0.00003935462,0.000054821216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057803583,0.00044761403,0.00023325703,0.0005537347,0.00078739837,0.0021064968,0.00037032375,0.0005005758,0.013093749],"category_scores_gemma":[0.00034658125,0.00013661402,0.00014914919,0.0016316505,0.00078337383,0.001804353,0.00082984107,0.00089198473,0.0013625524],"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.000028433391,0.000039451617,0.0010734176,0.00044480403,0.000010719209,0.0002785031,0.0042864266,0.0007873268,0.00047110848,0.054311045,0.7552578,0.18301111],"study_design_scores_gemma":[0.0000049340583,0.0000149509515,0.0045980555,0.00029432483,0.000008950826,0.000115326206,0.0036095595,0.00025452796,0.00020205279,0.009334806,0.98155403,0.000008555416],"about_ca_topic_score_codex":0.013397865,"about_ca_topic_score_gemma":0.04772224,"teacher_disagreement_score":0.013397865,"about_ca_system_score_codex":0.0022800441,"about_ca_system_score_gemma":0.0031262704,"threshold_uncertainty_score":0.043802917},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09426896,0.002773644,0.77482706,0.0021520169,0.0007339178,0.0036182867,0.018996427,0.083302975,0.019326674],"genre_scores_gemma":[0.29449323,0.0011131711,0.65896195,0.00058002665,0.00021625638,0.0010585437,0.022859503,0.0004127504,0.020304568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986847,0.0001600066,0.00012012729,0.00044416165,0.0004973419,0.000093635026],"domain_scores_gemma":[0.99800473,0.00029694973,0.00016382756,0.0003961908,0.0009689227,0.00016940401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012979128,0.0015102014,0.0011684541,0.0048303865,0.002108335,0.0011444172,0.0023782821,0.0017148245,0.004845672],"category_scores_gemma":[0.0039565307,0.0006183049,0.0015400772,0.0038051014,0.00025796803,0.0025793605,0.0015431577,0.001196844,0.0051708724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011308842,0.0010177909,0.0322833,0.0011608128,0.00061874656,0.0014328316,0.0007742435,0.018361265,0.027604897,0.0071163015,0.12933798,0.7791609],"study_design_scores_gemma":[0.00023547879,0.00045808518,0.010690289,0.00017157098,0.00042182737,0.0013145454,0.000421497,0.87744135,0.01879803,0.006015616,0.08377467,0.00025692122],"about_ca_topic_score_codex":0.048560742,"about_ca_topic_score_gemma":0.07921095,"teacher_disagreement_score":0.048560742,"about_ca_system_score_codex":0.0009759724,"about_ca_system_score_gemma":0.0017680008,"threshold_uncertainty_score":0.09655619},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7757727,0.0010636668,0.20448042,0.0022094487,0.0002614537,0.00016115594,0.00035440613,0.0008390489,0.014857721],"genre_scores_gemma":[0.99008894,0.00017007628,0.007614244,0.00013361273,0.0000660323,0.000038562826,0.00005881969,0.0000306783,0.0017989848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991359,0.00036773243,0.000024322939,0.00018121711,0.00018507491,0.00010582566],"domain_scores_gemma":[0.9887921,0.008417148,0.00072262646,0.0012625722,0.00042327915,0.0003821205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00210337,0.00039766546,0.00071472244,0.0016061196,0.0014021144,0.0016247605,0.0010244435,0.0011602322,0.00362868],"category_scores_gemma":[0.016016232,0.0007967155,0.00047836843,0.0009737237,0.0015769843,0.004154632,0.0030709738,0.001307858,0.0005012531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015065656,0.00055114186,0.033759713,0.00052479253,0.00036077696,0.0017533001,0.008264991,0.26358312,0.03596798,0.39781496,0.016435482,0.23947711],"study_design_scores_gemma":[0.00007635894,0.00018430983,0.004599984,0.000055978617,0.0000979942,0.00039219696,0.0009466069,0.7851351,0.004056969,0.20126943,0.0031379787,0.00004703804],"about_ca_topic_score_codex":0.0010080731,"about_ca_topic_score_gemma":0.0024239605,"teacher_disagreement_score":0.00362868,"about_ca_system_score_codex":0.0006627262,"about_ca_system_score_gemma":0.00041257523,"threshold_uncertainty_score":0.012139142},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30463707,0.001137988,0.6665976,0.0027172377,0.00019557089,0.0010000288,0.011650772,0.0067205415,0.0053432593],"genre_scores_gemma":[0.36809963,0.00039634336,0.6215506,0.00012223455,0.00008203262,0.0004959924,0.0071267406,0.0002755168,0.001850971],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977962,0.0008842508,0.00012164613,0.00042180638,0.00065993925,0.000116218434],"domain_scores_gemma":[0.9892586,0.0073654,0.0008358072,0.00093179423,0.0012941747,0.0003143542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046352367,0.0007544707,0.0006298609,0.005528751,0.0016493418,0.0017879128,0.0011784823,0.0013423669,0.0014083057],"category_scores_gemma":[0.022153627,0.00042996914,0.0008919546,0.0046605375,0.0006801345,0.0019300212,0.0018108058,0.001723576,0.00072783016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061946,0.0009286452,0.08778723,0.0008273373,0.00042166002,0.0011847388,0.002658664,0.3581876,0.008157673,0.05990975,0.03971621,0.439601],"study_design_scores_gemma":[0.00003107738,0.00004730192,0.0063437526,0.000034161847,0.000014205402,0.00018739361,0.00033249287,0.96956974,0.0019462749,0.014026128,0.0074420385,0.00002532522],"about_ca_topic_score_codex":0.015641138,"about_ca_topic_score_gemma":0.016613577,"teacher_disagreement_score":0.015641138,"about_ca_system_score_codex":0.0015212651,"about_ca_system_score_gemma":0.0011450077,"threshold_uncertainty_score":0.031100214},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03324504,0.07852445,0.00566298,0.51237524,0.040292684,0.00032560236,0.0046674362,0.0021642242,0.32274234],"genre_scores_gemma":[0.053432833,0.041881606,0.0037849736,0.022499705,0.0026596922,0.00015576839,0.0013567697,0.00037855527,0.87385],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983304,0.0001673005,0.000060967363,0.0003834632,0.00064609584,0.00041174467],"domain_scores_gemma":[0.98817074,0.00068704644,0.0002685624,0.00011797474,0.005809435,0.0049463194],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018904804,0.0007072556,0.0010055322,0.0018557971,0.004813911,0.003733937,0.0012786838,0.0015440191,0.10244059],"category_scores_gemma":[0.0052293353,0.0004436756,0.00031922763,0.0015191966,0.0011611461,0.0014599715,0.0013987954,0.0031722726,0.02800754],"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.00015427153,0.00011179685,0.0065096687,0.00027926604,0.000022255592,0.0004856465,0.0010845868,0.000247912,0.0010271238,0.0071528177,0.8749733,0.10795133],"study_design_scores_gemma":[0.000013937185,0.000043754553,0.0049034036,0.00028507292,0.000016170254,0.0005295405,0.0013961556,0.00031274816,0.0006205311,0.0012019738,0.9906447,0.00003212406],"about_ca_topic_score_codex":0.19441405,"about_ca_topic_score_gemma":0.29365447,"teacher_disagreement_score":0.8975594,"about_ca_system_score_codex":0.012895987,"about_ca_system_score_gemma":0.042528924,"threshold_uncertainty_score":0.38656485},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061145917,0.00089336495,0.9085597,0.004676654,0.00014685064,0.00017503726,0.001044562,0.00032311006,0.023034796],"genre_scores_gemma":[0.82614064,0.0010809088,0.1489743,0.0005932525,0.00024054018,0.0005330427,0.0008095896,0.000104208695,0.021523554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987901,0.00055066595,0.000037354457,0.00029234844,0.00019129101,0.00013821748],"domain_scores_gemma":[0.99520385,0.0035828392,0.00035841326,0.00017791032,0.00038254692,0.0002944529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022106364,0.00067247526,0.0012574136,0.0016038617,0.0014427601,0.003470463,0.003377203,0.0027605519,0.007628372],"category_scores_gemma":[0.012714277,0.00075821544,0.0010573878,0.0018763482,0.002113693,0.005739779,0.0020432002,0.00240207,0.0009282752],"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.0001247572,0.00008936349,0.0018734304,0.00008691833,0.00006774987,0.000192625,0.00045363183,0.60563046,0.0002655704,0.36581114,0.0051746806,0.020229695],"study_design_scores_gemma":[0.000019093992,0.00001241044,0.00017586075,0.000017430084,0.000010757028,0.000027263273,0.000037069847,0.89887315,0.000033911256,0.099476725,0.0013055047,0.000010723392],"about_ca_topic_score_codex":0.022986775,"about_ca_topic_score_gemma":0.019103354,"teacher_disagreement_score":0.022986775,"about_ca_system_score_codex":0.0030842698,"about_ca_system_score_gemma":0.0017513611,"threshold_uncertainty_score":0.045705914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013597419,0.00064337003,0.00043917226,0.00055319763,0.00054574566,0.00006508772,0.008007599,0.0004644699,0.9879216],"genre_scores_gemma":[0.0025951015,0.00049756485,0.00029033687,0.00010052854,0.00004021787,0.00003662892,0.0020671275,0.00017341122,0.99419916],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994073,0.000032938788,0.000023579607,0.00024189032,0.00021241127,0.00008183204],"domain_scores_gemma":[0.9992237,0.000103439204,0.000047504884,0.000110549125,0.00024069015,0.00027398037],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038009646,0.0017409705,0.00065943325,0.0013599278,0.004216919,0.005669946,0.0010945497,0.0014032425,0.8516695],"category_scores_gemma":[0.0012942066,0.00064335903,0.000481189,0.0027208857,0.00074799015,0.002835702,0.0025089548,0.001921752,0.58734226],"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.00020366478,0.00027173915,0.002343025,0.0002198161,0.000016643438,0.00043494877,0.00027900346,0.00022766256,0.00076867815,0.0065645436,0.80220085,0.18646938],"study_design_scores_gemma":[0.000026323287,0.000021036269,0.0029527196,0.00010170481,0.0000051847414,0.00008514231,0.00029337322,0.00012701684,0.00016823405,0.0005809671,0.99562824,0.000010046678],"about_ca_topic_score_codex":0.029214397,"about_ca_topic_score_gemma":0.1011574,"teacher_disagreement_score":0.8516695,"about_ca_system_score_codex":0.0018545073,"about_ca_system_score_gemma":0.0028001468,"threshold_uncertainty_score":0.21157551},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043628495,0.003451462,0.0025037094,0.0047794026,0.0012298888,0.00019681381,0.01718344,0.0017540545,0.92527264],"genre_scores_gemma":[0.14541534,0.0012023172,0.0055223503,0.001328631,0.000087217835,0.00022345722,0.008141091,0.00034981986,0.8377299],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978477,0.000023109296,0.000008142672,0.00006129257,0.00005829056,0.00006443538],"domain_scores_gemma":[0.9997379,0.000027267055,0.000023768214,0.00003797223,0.00010356561,0.00006956621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028477603,0.00072872336,0.00036468133,0.0009236716,0.0030332636,0.0016394601,0.0008066568,0.0004949947,0.1233537],"category_scores_gemma":[0.0005672338,0.00017248109,0.0002312706,0.00085566996,0.00076450396,0.0005850063,0.0014658693,0.0009920076,0.038219076],"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.0011297574,0.00012730356,0.012013068,0.0005708316,0.00005261413,0.0021072011,0.0016455721,0.00091402064,0.007149635,0.03727819,0.4430977,0.493914],"study_design_scores_gemma":[0.000034645705,0.000065830696,0.02137916,0.000104244806,0.0000091461,0.0004490216,0.0011060294,0.00030512467,0.0012333032,0.0018512715,0.9734402,0.000022092578],"about_ca_topic_score_codex":0.102353394,"about_ca_topic_score_gemma":0.21442233,"teacher_disagreement_score":0.1233537,"about_ca_system_score_codex":0.0036522283,"about_ca_system_score_gemma":0.0026949688,"threshold_uncertainty_score":0.41265923},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23894925,0.03476524,0.00058786036,0.011158373,0.00049506244,0.000036241814,0.00023116378,0.00006051318,0.71371627],"genre_scores_gemma":[0.7858356,0.0040679635,0.00024691038,0.0005074981,0.00022125983,0.000013452396,0.00006984361,0.00003551075,0.2090019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914265,0.00031508945,0.000021514925,0.00011060247,0.00018107753,0.0002290775],"domain_scores_gemma":[0.9992987,0.00030555326,0.00013825214,0.000049125945,0.00009417849,0.00011404165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007870342,0.00028998553,0.00023366304,0.0020765855,0.0070346277,0.0061062984,0.00036439826,0.0010135691,0.014780067],"category_scores_gemma":[0.0017930605,0.00017145264,0.0002234952,0.002138778,0.006733572,0.0011724147,0.0017704886,0.0012414615,0.0008278969],"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.0001382588,0.0000484363,0.006923975,0.00018576067,0.000023021079,0.0012322097,0.18859342,0.00053759426,0.00080415356,0.6506676,0.035548676,0.11529687],"study_design_scores_gemma":[0.0000110721385,0.000037530503,0.028763242,0.00022841743,0.0000072347693,0.00026485286,0.013275704,0.00012076616,0.00028467647,0.005955367,0.9510404,0.000010787797],"about_ca_topic_score_codex":0.15830149,"about_ca_topic_score_gemma":0.29961616,"teacher_disagreement_score":0.15830149,"about_ca_system_score_codex":0.018473268,"about_ca_system_score_gemma":0.0041969437,"threshold_uncertainty_score":0.3147601},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007971666,0.019392697,0.016974412,0.34539014,0.005659657,0.0001870306,0.0034036564,0.0041828994,0.59683794],"genre_scores_gemma":[0.11545063,0.036690358,0.07685462,0.078972265,0.0034369985,0.0006625594,0.0112547325,0.0043991082,0.67227876],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99610573,0.0016581743,0.00014158458,0.0004877388,0.00095748826,0.0006493467],"domain_scores_gemma":[0.98453933,0.0033722364,0.00084290473,0.0013288554,0.005687237,0.004229389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009016452,0.00088908616,0.0009091106,0.0037332894,0.004054488,0.012705499,0.0022261834,0.0032201523,0.07270703],"category_scores_gemma":[0.021020629,0.00057749473,0.00063839206,0.0046513975,0.0017563734,0.012711693,0.0038924722,0.0030746008,0.04046818],"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.000109361645,0.00010839454,0.0058322293,0.00032074752,0.00004166602,0.000098501594,0.0015085993,0.00039944044,0.00019488146,0.037246305,0.6342837,0.31985608],"study_design_scores_gemma":[0.00002411912,0.000023259545,0.0048306743,0.0005148779,0.000023726421,0.00013407775,0.0032758783,0.0011883621,0.00040800506,0.019664045,0.96986085,0.00005201489],"about_ca_topic_score_codex":0.027659638,"about_ca_topic_score_gemma":0.062369514,"teacher_disagreement_score":0.07270703,"about_ca_system_score_codex":0.005081556,"about_ca_system_score_gemma":0.008213088,"threshold_uncertainty_score":0.24322921},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018148168,0.0047651585,0.00092131254,0.7706263,0.03926432,0.00013863428,0.0012524438,0.0005788627,0.18063813],"genre_scores_gemma":[0.0052447543,0.0014249332,0.00042659784,0.21674977,0.0032066961,0.00006947878,0.0002794381,0.00010832079,0.77249],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993986,0.000092549555,0.000030746945,0.000114446164,0.00023195749,0.00013165377],"domain_scores_gemma":[0.99804974,0.0006528101,0.00008684976,0.00008071182,0.0007710281,0.0003588898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010766285,0.00039422617,0.00047083068,0.00054867007,0.00501833,0.0029390012,0.00067196233,0.006197467,0.11701629],"category_scores_gemma":[0.007890091,0.00046450674,0.00030806303,0.00047908485,0.00075017347,0.0015484218,0.0009882612,0.006512721,0.051330045],"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.0000065055133,0.0000025963095,0.00006295936,0.0000059733375,7.1324337e-7,0.000026835874,0.00002590637,0.0000036486674,0.0000307337,0.0006519308,0.9969189,0.0022633423],"study_design_scores_gemma":[0.0000051165366,0.000006081765,0.00053812214,0.0000350566,0.000001483605,0.00003868536,0.00019262532,0.000034062312,0.000056496934,0.0004896343,0.99859554,0.000007185862],"about_ca_topic_score_codex":0.030898983,"about_ca_topic_score_gemma":0.077005856,"teacher_disagreement_score":0.11701629,"about_ca_system_score_codex":0.0015263923,"about_ca_system_score_gemma":0.003038017,"threshold_uncertainty_score":0.39145845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959859,0.0010565326,0.0005053626,0.00019560149,0.000045609722,0.000012369517,0.0003362239,0.000011345776,0.0018510233],"genre_scores_gemma":[0.9944681,0.0007852265,0.0002618595,0.00006478005,0.00003944046,0.000022659404,0.00031815327,0.000012325038,0.004027392],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99994826,0.000013148275,0.000002935803,0.000012810593,0.000011861394,0.000010874615],"domain_scores_gemma":[0.99975413,0.000107335705,0.000029309715,0.000011710147,0.000034687022,0.000062811996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029213695,0.00014516672,0.0002054748,0.00023528136,0.00011928787,0.0001887296,0.00020716345,0.00020669721,0.0042129545],"category_scores_gemma":[0.0008002322,0.000106153384,0.0000947009,0.00014928421,0.00012228006,0.000079777776,0.00020882653,0.00020539509,0.0005286333],"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.009135572,0.00088050327,0.20821059,0.0006494108,0.00033097467,0.0026870035,0.0016192864,0.0062830183,0.5005762,0.0009558948,0.01237897,0.25629252],"study_design_scores_gemma":[0.000036899743,0.00074718177,0.9904359,0.000047889498,0.000034012577,0.00047135196,0.00024509264,0.0019407155,0.004978578,0.00018454094,0.000867777,0.00000999987],"about_ca_topic_score_codex":0.0009281248,"about_ca_topic_score_gemma":0.00097261387,"teacher_disagreement_score":0.0042129545,"about_ca_system_score_codex":0.0001161568,"about_ca_system_score_gemma":0.00009422547,"threshold_uncertainty_score":0.014093697},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09219094,0.0003700858,0.8914052,0.00072739826,0.00008679087,0.00005289485,0.00011519412,0.00018658058,0.014864815],"genre_scores_gemma":[0.94230264,0.00040406032,0.04583929,0.00018528837,0.00006745709,0.00007310258,0.00008101152,0.000047984195,0.010999149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997478,0.00008953692,0.0000074310274,0.00006014235,0.000053837783,0.000041186373],"domain_scores_gemma":[0.9991737,0.0004520621,0.00009525274,0.00008472471,0.000105098865,0.00008918833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055111013,0.0004113247,0.00060338405,0.00054209045,0.00055204175,0.0010607713,0.0015937756,0.0017001745,0.0028424868],"category_scores_gemma":[0.0019921798,0.0003050094,0.00043615434,0.00054038595,0.00087592285,0.002709492,0.001293607,0.0009830105,0.00044982586],"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.00014456589,0.00010782351,0.0006978686,0.0000928997,0.000044955847,0.00024413892,0.00012809587,0.7574593,0.007936836,0.21575432,0.0018805973,0.015508547],"study_design_scores_gemma":[0.0000045639495,0.0000080952295,0.000039720122,0.0000023283756,0.0000044827398,0.000012354093,0.0000068594127,0.98485434,0.00018457952,0.014676509,0.0002020429,0.0000040734462],"about_ca_topic_score_codex":0.0017527965,"about_ca_topic_score_gemma":0.0016869475,"teacher_disagreement_score":0.0028424868,"about_ca_system_score_codex":0.0006005352,"about_ca_system_score_gemma":0.0005385261,"threshold_uncertainty_score":0.009509087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54623365,0.0031376441,0.4320256,0.0029909902,0.00009611589,0.00042767797,0.001209824,0.00032800276,0.01355048],"genre_scores_gemma":[0.89563483,0.0005999912,0.102417685,0.00007995584,0.00011552104,0.0001937004,0.00040455072,0.00002606167,0.0005275991],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99508744,0.0025006102,0.00025829853,0.0007286851,0.0012768471,0.00014818106],"domain_scores_gemma":[0.9186032,0.066696376,0.0068945806,0.0029509894,0.0036759665,0.0011788118],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.007317026,0.0006143083,0.0013158815,0.016875764,0.0019363038,0.0041020326,0.0016168794,0.0015307677,0.0018553962],"category_scores_gemma":[0.06688622,0.00038002056,0.00046802283,0.013544663,0.0027194407,0.0077574085,0.0022462758,0.0011889345,0.00031339377],"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.0007720628,0.0008495546,0.24055253,0.00282164,0.0012623734,0.0010505653,0.009056659,0.051812846,0.010812783,0.18244965,0.004732271,0.49382702],"study_design_scores_gemma":[0.00014111964,0.00041606324,0.11321717,0.0005949535,0.00051913457,0.0009524436,0.010910724,0.46237502,0.005455403,0.39186117,0.0133335,0.00022323825],"about_ca_topic_score_codex":0.0017169488,"about_ca_topic_score_gemma":0.0027213944,"teacher_disagreement_score":0.98312426,"about_ca_system_score_codex":0.0011121839,"about_ca_system_score_gemma":0.0010270121,"threshold_uncertainty_score":0.038696587},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03299893,0.030919094,0.0097529115,0.112979405,0.07231825,0.0013016692,0.04134246,0.0015080543,0.69687927],"genre_scores_gemma":[0.023905674,0.005780486,0.0020522368,0.00089164457,0.0018116059,0.00019074493,0.011077072,0.00033250012,0.95395815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989887,0.00014877888,0.000040973857,0.00020016186,0.00045775712,0.0001635761],"domain_scores_gemma":[0.9967386,0.0004558714,0.00007180292,0.00019731827,0.0016980116,0.0008383248],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024318034,0.0007531669,0.00093531143,0.0023092413,0.0032743614,0.005019647,0.0010600837,0.0011936056,0.20633446],"category_scores_gemma":[0.003309504,0.00031174705,0.00033939208,0.002709268,0.0008073671,0.001983858,0.0018277908,0.0016333081,0.040793527],"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.0000893215,0.00004764699,0.0011109642,0.00012226884,0.00001444999,0.000108040585,0.00033863567,0.00015119469,0.00022376882,0.0015631991,0.9424988,0.05373168],"study_design_scores_gemma":[0.000015597769,0.000019549214,0.008175299,0.00022864231,0.000008763384,0.000033520137,0.0012193257,0.00045039415,0.00017406071,0.0011760169,0.9884851,0.00001372321],"about_ca_topic_score_codex":0.08610086,"about_ca_topic_score_gemma":0.27739665,"teacher_disagreement_score":0.7936655,"about_ca_system_score_codex":0.003888176,"about_ca_system_score_gemma":0.004079176,"threshold_uncertainty_score":0.69025755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01734834,0.11994923,0.80348074,0.0026603055,0.0005696539,0.00012746398,0.0003210773,0.00042805306,0.055115215],"genre_scores_gemma":[0.5349114,0.27502918,0.1560948,0.0011973534,0.0012333444,0.00040430418,0.0009629519,0.00024497675,0.029921679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995442,0.00016512212,0.000036542264,0.000058436817,0.00016632104,0.000029277946],"domain_scores_gemma":[0.99903584,0.00064610795,0.00007197252,0.000052253825,0.00017429491,0.00001959795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012947269,0.0011282422,0.00093566976,0.0020110435,0.0003173251,0.0013403223,0.0014704927,0.0011675173,0.0015397428],"category_scores_gemma":[0.0018747064,0.0005341705,0.0012469799,0.002001578,0.0006659961,0.0016609804,0.00072630646,0.0011714346,0.000518844],"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.00004623468,0.0001749274,0.0018686649,0.0018420147,0.00020255642,0.00032411143,0.00023299809,0.5499965,0.002944031,0.26629877,0.009163216,0.16690595],"study_design_scores_gemma":[0.000005147453,0.00006645085,0.0003460556,0.00029958555,0.00004483597,0.00015651711,0.00006034001,0.9235269,0.0008016664,0.04182955,0.032833792,0.000029170067],"about_ca_topic_score_codex":0.0031539267,"about_ca_topic_score_gemma":0.0018558016,"teacher_disagreement_score":0.0031539267,"about_ca_system_score_codex":0.0010900093,"about_ca_system_score_gemma":0.00082643126,"threshold_uncertainty_score":0.007908583},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5552575,0.0058677057,0.36207476,0.0033591778,0.0017295952,0.0007512668,0.02862462,0.0128821675,0.029453194],"genre_scores_gemma":[0.7603752,0.0005731448,0.20954537,0.00044975543,0.00027428626,0.000364605,0.021445254,0.0004578124,0.0065145968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968292,0.0013399033,0.00017551413,0.00062391243,0.0006844095,0.00034699868],"domain_scores_gemma":[0.99099874,0.0041267774,0.0005118794,0.0020163823,0.0017750148,0.00057122414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004263948,0.0013265951,0.0012650791,0.003091395,0.0015018199,0.002132902,0.00222028,0.002689278,0.0052253134],"category_scores_gemma":[0.023291826,0.00037090937,0.0011859349,0.002236765,0.0006415078,0.002110949,0.002386251,0.001534389,0.0017640028],"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.002829089,0.0016275797,0.020241972,0.0016935137,0.0011002482,0.00035960352,0.00023483763,0.46513823,0.0087344935,0.020679597,0.10992352,0.36743727],"study_design_scores_gemma":[0.00011927324,0.00025300935,0.0031582117,0.00004785217,0.000064542946,0.000117468655,0.0000684525,0.9749517,0.0037359064,0.011930954,0.0055290707,0.000023602783],"about_ca_topic_score_codex":0.009878274,"about_ca_topic_score_gemma":0.013052904,"teacher_disagreement_score":0.009878274,"about_ca_system_score_codex":0.0012533846,"about_ca_system_score_gemma":0.0018195793,"threshold_uncertainty_score":0.022550225},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029891124,0.0006282969,0.9568863,0.0020272653,0.00011516279,0.00063504535,0.0019933144,0.004121333,0.0037021157],"genre_scores_gemma":[0.37651533,0.0007589408,0.60520023,0.0011375344,0.00023896736,0.00076661236,0.0053391587,0.00044355745,0.009599723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942491,0.0015576865,0.0004357586,0.0015057698,0.0017894177,0.0004621121],"domain_scores_gemma":[0.9883052,0.0038938748,0.0010341171,0.0046322695,0.0014178535,0.00071674585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038120667,0.0016484697,0.0030070853,0.0033555129,0.0027935398,0.0040044123,0.007064722,0.0034361472,0.0038571625],"category_scores_gemma":[0.020303011,0.0010308282,0.0024914844,0.005613581,0.0025080708,0.007927828,0.008466413,0.0026033635,0.0025359737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012398418,0.0008005044,0.0044669798,0.0008132721,0.00038238708,0.00038253664,0.000985336,0.3633545,0.01112421,0.16445765,0.062194757,0.389798],"study_design_scores_gemma":[0.00010725923,0.00010067274,0.00029689455,0.00002380307,0.00003689632,0.00019920262,0.000116168594,0.9016299,0.004242197,0.08723655,0.0059713703,0.00003897682],"about_ca_topic_score_codex":0.012562925,"about_ca_topic_score_gemma":0.018246036,"teacher_disagreement_score":0.012562925,"about_ca_system_score_codex":0.003527236,"about_ca_system_score_gemma":0.006262393,"threshold_uncertainty_score":0.02559203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023315005,0.0004753196,0.9720268,0.0002461061,0.00006806411,0.00003648529,0.000043187916,0.00027213545,0.0035168617],"genre_scores_gemma":[0.9299616,0.00049782114,0.06505031,0.00011787832,0.000048449838,0.00015878894,0.000087373955,0.000034571687,0.0040432047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996119,0.00012852145,0.00002180401,0.00008503926,0.000096771175,0.000056025776],"domain_scores_gemma":[0.9991425,0.0005398763,0.00010514971,0.000030798343,0.00015641659,0.000025205625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011739385,0.0008137019,0.0008414039,0.0003114678,0.00035366966,0.00078364485,0.0011069024,0.0010321682,0.001548217],"category_scores_gemma":[0.0029295748,0.00039172985,0.00049527106,0.000385763,0.00060661347,0.0008895154,0.000645353,0.0013544178,0.0001628915],"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.000022437902,0.000007392647,0.000088199,0.000019178817,0.000009230302,0.000012320026,0.000013262106,0.99010885,0.00024272322,0.002493313,0.00014199676,0.0068412004],"study_design_scores_gemma":[0.0000018822034,0.0000071154636,0.000011638878,0.0000015907967,0.0000018684252,0.000001674539,0.000001373169,0.99934787,0.00006619846,0.0004960431,0.0000615172,0.0000010940666],"about_ca_topic_score_codex":0.017763568,"about_ca_topic_score_gemma":0.009091007,"teacher_disagreement_score":0.017763568,"about_ca_system_score_codex":0.001025123,"about_ca_system_score_gemma":0.0009862375,"threshold_uncertainty_score":0.03532034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022198275,0.00018805449,0.88459295,0.0044060377,0.0005498046,0.0011714889,0.0006612943,0.0029294107,0.08330274],"genre_scores_gemma":[0.20962876,0.0003510537,0.754329,0.00073106936,0.0001613901,0.0010832465,0.001096324,0.0006642866,0.031954817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959431,0.0016322703,0.00022212585,0.0005643278,0.0013447974,0.0002932878],"domain_scores_gemma":[0.9885768,0.004679013,0.0008087768,0.0029856346,0.0019529245,0.0009967564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058963043,0.0006743518,0.00049099844,0.002074479,0.0034080127,0.004945228,0.0022310715,0.0015693053,0.011480291],"category_scores_gemma":[0.015535172,0.000558029,0.000940813,0.00152347,0.0021664815,0.006900805,0.008493118,0.0020013426,0.006505034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023923068,0.00030816492,0.008199655,0.000605767,0.00006127319,0.0012494827,0.0144283855,0.014757887,0.020526597,0.46477258,0.05947976,0.4153712],"study_design_scores_gemma":[0.000041868625,0.00013044495,0.0029151014,0.00036269837,0.000052679552,0.00055745675,0.0075439974,0.13284409,0.01956494,0.16418932,0.67166346,0.00013390578],"about_ca_topic_score_codex":0.004920712,"about_ca_topic_score_gemma":0.00712753,"teacher_disagreement_score":0.011480291,"about_ca_system_score_codex":0.0016407883,"about_ca_system_score_gemma":0.003378415,"threshold_uncertainty_score":0.03840542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95810384,0.0003608055,0.036679078,0.0002609308,0.00007959542,0.000059391597,0.00058909657,0.00014321465,0.003724109],"genre_scores_gemma":[0.99681973,0.00007383985,0.0022888444,0.00002770347,0.000017372318,0.000019228451,0.0001665577,0.00002693856,0.00055981416],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9997813,0.00004651862,0.0000075416315,0.00007740489,0.000049438786,0.000037847618],"domain_scores_gemma":[0.9987244,0.00080834544,0.00015163222,0.00007859287,0.00010036126,0.00013663706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037293107,0.00026007855,0.0002944205,0.0004540609,0.00025042612,0.0006944064,0.00030545637,0.00041943413,0.002136103],"category_scores_gemma":[0.0059890356,0.00020544443,0.00014070346,0.00048790174,0.00028973568,0.000966251,0.0009244684,0.0005541787,0.00029493464],"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.002763558,0.0006364657,0.12982002,0.00048191013,0.0005543668,0.0009795212,0.0035361382,0.05029587,0.4679671,0.007921435,0.006065868,0.32897776],"study_design_scores_gemma":[0.00004672395,0.00037173508,0.63638884,0.00005875169,0.000113766,0.0005761571,0.0009714394,0.31953758,0.017747382,0.021842863,0.0022773934,0.000067281784],"about_ca_topic_score_codex":0.0017947237,"about_ca_topic_score_gemma":0.0033507103,"teacher_disagreement_score":0.002136103,"about_ca_system_score_codex":0.00019693981,"about_ca_system_score_gemma":0.00019652132,"threshold_uncertainty_score":0.007146001},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0320914,0.00063503714,0.9645425,0.00031636198,0.000039973427,0.000032166176,0.00030604366,0.00033560113,0.0017008712],"genre_scores_gemma":[0.8245792,0.001118622,0.16899592,0.00014490332,0.00019825192,0.00016085166,0.0009732807,0.00010579337,0.0037231275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995697,0.0001258822,0.000018081517,0.00011142924,0.00012684932,0.000047906473],"domain_scores_gemma":[0.9981091,0.0010868879,0.00024933516,0.00010027075,0.0003072979,0.00014697957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011333276,0.00087316305,0.0006490397,0.002522885,0.00055926485,0.0009930482,0.0014173574,0.0007714516,0.0014239745],"category_scores_gemma":[0.0044024717,0.00031062381,0.00074222207,0.0019186211,0.00060597,0.0019520955,0.0008799101,0.0011690592,0.00035656404],"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.00006126153,0.000063742016,0.008702005,0.00006946033,0.00011327386,0.00014042175,0.00013952177,0.89346427,0.001896407,0.049828116,0.002129948,0.043391593],"study_design_scores_gemma":[0.0000021800586,0.000005857213,0.00028023598,0.0000028519246,0.0000065183103,0.00001589878,0.000007997475,0.99208903,0.000094029645,0.007170491,0.00032073463,0.0000040874734],"about_ca_topic_score_codex":0.015869487,"about_ca_topic_score_gemma":0.017517786,"teacher_disagreement_score":0.015869487,"about_ca_system_score_codex":0.001228621,"about_ca_system_score_gemma":0.0009945541,"threshold_uncertainty_score":0.03155428},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5644438,0.0050355056,0.41838792,0.0010041788,0.00010453658,0.00030050694,0.0031266878,0.0011506259,0.006446233],"genre_scores_gemma":[0.8872843,0.0008110708,0.10775742,0.00013992659,0.00007186145,0.00013085999,0.0029826933,0.00012982951,0.0006920896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967186,0.0011282937,0.00021975777,0.0007294022,0.0010403272,0.0001635673],"domain_scores_gemma":[0.98032814,0.012113125,0.0028366472,0.0019959381,0.0021283906,0.0005977547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004822034,0.0011930702,0.0009843572,0.0061211474,0.0009804467,0.0020949396,0.0013162342,0.0014402329,0.0010250635],"category_scores_gemma":[0.044095468,0.00040844243,0.00076256564,0.0033417745,0.0021116734,0.0047736224,0.0026178441,0.0012172769,0.0003556864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010274113,0.0002805377,0.1464996,0.0029502618,0.001147882,0.0008299305,0.003090337,0.37281793,0.022585807,0.06286741,0.01145407,0.37444884],"study_design_scores_gemma":[0.00007267654,0.00036227336,0.025243327,0.00034340232,0.00021905951,0.00094033714,0.0011975036,0.8414868,0.014521863,0.10884521,0.006669152,0.00009833417],"about_ca_topic_score_codex":0.0031469273,"about_ca_topic_score_gemma":0.0050967494,"teacher_disagreement_score":0.0061211474,"about_ca_system_score_codex":0.0013136606,"about_ca_system_score_gemma":0.00081638363,"threshold_uncertainty_score":0.025501668},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33524,0.0019957842,0.6546154,0.00042227184,0.00016180452,0.0002660523,0.0020739536,0.001913192,0.003311616],"genre_scores_gemma":[0.8615244,0.00096585526,0.13216305,0.000073682626,0.00021735256,0.00016183,0.0027547749,0.00007064282,0.0020685396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988035,0.00028364177,0.00008184276,0.0003382493,0.000387848,0.00010502305],"domain_scores_gemma":[0.9969163,0.0015764091,0.0006261546,0.00032111775,0.00042158115,0.00013849894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010371059,0.00093515683,0.00073357596,0.0047216397,0.00047102798,0.0011028975,0.0008491664,0.00081941107,0.00059360574],"category_scores_gemma":[0.005290365,0.00026776476,0.0005129368,0.0029234663,0.00028267503,0.0017750737,0.0011478442,0.0006954693,0.00042243802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010607884,0.0004859886,0.07272782,0.00082872,0.0006321779,0.0013805422,0.0014260004,0.102942206,0.066660054,0.009102005,0.011576376,0.73117733],"study_design_scores_gemma":[0.000020507763,0.00009885147,0.029099708,0.000026885878,0.00006304955,0.00039491671,0.00039046677,0.9465673,0.012648332,0.0062298956,0.0044271788,0.000032909837],"about_ca_topic_score_codex":0.0022854547,"about_ca_topic_score_gemma":0.0023331272,"teacher_disagreement_score":0.0047216397,"about_ca_system_score_codex":0.00039615954,"about_ca_system_score_gemma":0.00027504168,"threshold_uncertainty_score":0.0054848194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92796296,0.0011256124,0.05978513,0.000807612,0.000042390202,0.00014445536,0.00048550323,0.00022917194,0.009417267],"genre_scores_gemma":[0.9854511,0.00033248425,0.012679726,0.000028410366,0.000041059884,0.00005356761,0.00015552957,0.000027891405,0.0012300516],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979519,0.0007387435,0.00009903065,0.00046476477,0.0005692014,0.00017632921],"domain_scores_gemma":[0.9797951,0.014663381,0.0030843879,0.0010342466,0.00090601394,0.0005169071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030032275,0.0007928265,0.00062447827,0.0028828897,0.0009176653,0.0034404902,0.0005787911,0.0007818815,0.0014319296],"category_scores_gemma":[0.015194805,0.00054662465,0.0005937446,0.0021810783,0.0007482198,0.004325916,0.0015768169,0.0010546212,0.0005953835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006247704,0.0008254582,0.5792514,0.0005499684,0.0006141417,0.0006801704,0.0048160814,0.060960602,0.029876124,0.025527434,0.0028731162,0.29340065],"study_design_scores_gemma":[0.000051215888,0.00076917233,0.38699523,0.00010841979,0.00037892605,0.00071398204,0.0040879347,0.54460317,0.020481082,0.032638144,0.009023204,0.000149541],"about_ca_topic_score_codex":0.002876203,"about_ca_topic_score_gemma":0.0031926772,"teacher_disagreement_score":0.0034404902,"about_ca_system_score_codex":0.00080967176,"about_ca_system_score_gemma":0.0007957481,"threshold_uncertainty_score":0.01588273},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00940371,0.0006068585,0.9848696,0.00046747332,0.000045904577,0.00007485999,0.000108559645,0.001095049,0.0033279515],"genre_scores_gemma":[0.16476433,0.0013648269,0.8278628,0.00032521042,0.0003534254,0.0002652993,0.0005302678,0.0004054783,0.0041283537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654526,0.0014951049,0.00019541162,0.00054888654,0.0010763154,0.00013898713],"domain_scores_gemma":[0.99005604,0.006780696,0.0006228627,0.0012550767,0.0011034749,0.00018192433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004288157,0.0010974657,0.0007905275,0.008343149,0.0011062035,0.0030612652,0.001602105,0.0013959955,0.003096619],"category_scores_gemma":[0.019136725,0.000538828,0.0016636361,0.0061819972,0.0014400382,0.0048978487,0.003261631,0.0018936421,0.0018418037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017403344,0.0004120678,0.0070677036,0.0007444689,0.00023529395,0.00054029556,0.0011477853,0.0688535,0.009151545,0.32633105,0.0074435566,0.57789874],"study_design_scores_gemma":[0.000027264932,0.0000691476,0.00081279373,0.000111428475,0.00006681906,0.0002676591,0.00023227898,0.66565937,0.00420324,0.3030955,0.025413495,0.00004097825],"about_ca_topic_score_codex":0.0011381333,"about_ca_topic_score_gemma":0.0016946283,"teacher_disagreement_score":0.008343149,"about_ca_system_score_codex":0.0007381271,"about_ca_system_score_gemma":0.0009138915,"threshold_uncertainty_score":0.022678196},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12840697,0.0032383774,0.855508,0.002659773,0.00019771587,0.000086452885,0.0028506774,0.0023119473,0.0047400524],"genre_scores_gemma":[0.85734385,0.0023340506,0.13119711,0.00023216703,0.00028688824,0.0002544818,0.0030733813,0.0001812193,0.0050968733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993938,0.0002704102,0.000043220352,0.00014778746,0.00009569315,0.000049111462],"domain_scores_gemma":[0.99400514,0.0045270766,0.0006286002,0.00025853192,0.00048561953,0.000095043295],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0020269337,0.0009804622,0.0008261738,0.003695426,0.00059340155,0.0014177643,0.0015959752,0.0014458528,0.002328703],"category_scores_gemma":[0.015653007,0.00051371893,0.0010663942,0.005224753,0.00061502884,0.003169094,0.00067353324,0.0020788072,0.00080274313],"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.000023879598,0.00002984756,0.0022296242,0.000051308525,0.00004949379,0.000025734675,0.00004495468,0.966028,0.00019294051,0.010033113,0.0009374745,0.020353658],"study_design_scores_gemma":[0.0000015848203,0.0000034728746,0.0002223229,0.00000481671,0.0000037908385,0.000005061361,0.0000039734614,0.9891627,0.000047142374,0.010299591,0.0002421957,0.0000034737423],"about_ca_topic_score_codex":0.025888503,"about_ca_topic_score_gemma":0.025404058,"teacher_disagreement_score":0.9963046,"about_ca_system_score_codex":0.0022976014,"about_ca_system_score_gemma":0.00097088586,"threshold_uncertainty_score":0.051475644},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045863464,0.120454796,0.79052716,0.0051372186,0.0028003466,0.00023713785,0.0036235359,0.0032538755,0.06937954],"genre_scores_gemma":[0.044793334,0.16044836,0.69442964,0.0009552492,0.0038656832,0.0005258319,0.0070872046,0.0011110898,0.0867836],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871624,0.00023677252,0.00008955968,0.00022969361,0.000685707,0.000042006453],"domain_scores_gemma":[0.99461406,0.00403534,0.00013207339,0.0005814057,0.00054261286,0.00009453653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019073935,0.0010645762,0.0012712349,0.0047383136,0.0004713053,0.00228496,0.0012524084,0.0008301958,0.010861391],"category_scores_gemma":[0.0064017554,0.0006160109,0.0009036173,0.008152334,0.0007028493,0.0053275363,0.0012808468,0.0016362874,0.008169583],"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.000016128273,0.00005914361,0.0005913349,0.0010850051,0.00007406218,0.000045908128,0.00013546011,0.00504793,0.0008259016,0.051955156,0.08639613,0.8537679],"study_design_scores_gemma":[0.000010517917,0.00003096817,0.0022203422,0.0005046051,0.00007609982,0.00045280188,0.0001319686,0.05504951,0.002046243,0.2488729,0.690559,0.00004497411],"about_ca_topic_score_codex":0.0018420246,"about_ca_topic_score_gemma":0.003081365,"teacher_disagreement_score":0.010861391,"about_ca_system_score_codex":0.00069557206,"about_ca_system_score_gemma":0.00088687195,"threshold_uncertainty_score":0.03633499},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036197565,0.14425457,0.48128742,0.023499716,0.062451955,0.0010618846,0.025070297,0.01292155,0.2132551],"genre_scores_gemma":[0.053554848,0.04921278,0.23062818,0.001611844,0.003841264,0.0006693079,0.031953834,0.002320457,0.6262075],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865156,0.0003750774,0.000077468285,0.0003161883,0.00047265063,0.00010710533],"domain_scores_gemma":[0.99797493,0.00066156266,0.000050204344,0.00036194164,0.00065347465,0.00029789534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036131658,0.0012877544,0.0023216014,0.0015159162,0.0007714531,0.0037524693,0.0014817577,0.0011012906,0.042436972],"category_scores_gemma":[0.004357201,0.0005322237,0.00087574054,0.0020359599,0.0006262903,0.0030238933,0.0020545148,0.001541305,0.01890332],"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.00023426717,0.00021461777,0.0004955781,0.0004925534,0.00006785721,0.00009212769,0.00016103772,0.0031275894,0.0018829812,0.006630215,0.5097994,0.47680178],"study_design_scores_gemma":[0.00007388955,0.00016547562,0.004886941,0.0004912002,0.00012773667,0.0003684866,0.00033590323,0.024839222,0.0033655623,0.018361919,0.9469357,0.00004789326],"about_ca_topic_score_codex":0.00868182,"about_ca_topic_score_gemma":0.014694007,"teacher_disagreement_score":0.042436972,"about_ca_system_score_codex":0.0013393647,"about_ca_system_score_gemma":0.00352646,"threshold_uncertainty_score":0.14196587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5387539,0.0013939784,0.44331777,0.002460612,0.00007718153,0.000052131232,0.00023427699,0.000253626,0.013456492],"genre_scores_gemma":[0.99284333,0.00025563804,0.006402726,0.00005821575,0.000040432737,0.000021318749,0.0000382096,0.00001558036,0.00032437983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994967,0.0001972463,0.000018935201,0.000105264764,0.00012466236,0.00005725062],"domain_scores_gemma":[0.9933369,0.0042087287,0.0011425187,0.00053355924,0.00047348154,0.00030491882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00101536,0.0003481617,0.00034877128,0.0016255017,0.00057993026,0.0014218247,0.0005359803,0.000756155,0.0015907352],"category_scores_gemma":[0.011218518,0.00023432073,0.00031282718,0.0007594972,0.002064861,0.0027767047,0.001038215,0.0007463778,0.00017978357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038537462,0.00004243166,0.0058802115,0.0001132705,0.00003400874,0.0003256364,0.00053818856,0.14178509,0.007349262,0.8291183,0.0011154404,0.013659591],"study_design_scores_gemma":[0.00000784967,0.000022598308,0.003988757,0.00003773462,0.000009359786,0.00024601183,0.0003332103,0.37248012,0.0009935133,0.6206857,0.0011669891,0.000028193816],"about_ca_topic_score_codex":0.0008668503,"about_ca_topic_score_gemma":0.0006423493,"teacher_disagreement_score":0.0016255017,"about_ca_system_score_codex":0.00059261057,"about_ca_system_score_gemma":0.0002705777,"threshold_uncertainty_score":0.005369842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5387539,0.0013939784,0.44331777,0.002460612,0.00007718153,0.000052131232,0.00023427699,0.000253626,0.013456492],"genre_scores_gemma":[0.99284333,0.00025563804,0.006402726,0.00005821575,0.000040432737,0.000021318749,0.0000382096,0.00001558036,0.00032437983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994967,0.0001972463,0.000018935201,0.000105264764,0.00012466236,0.00005725062],"domain_scores_gemma":[0.9933369,0.0042087287,0.0011425187,0.00053355924,0.00047348154,0.00030491882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00101536,0.0003481617,0.00034877128,0.0016255017,0.00057993026,0.0014218247,0.0005359803,0.000756155,0.0015907352],"category_scores_gemma":[0.011218518,0.00023432073,0.00031282718,0.0007594972,0.002064861,0.0027767047,0.001038215,0.0007463778,0.00017978357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038537462,0.00004243166,0.0058802115,0.0001132705,0.00003400874,0.0003256364,0.00053818856,0.14178509,0.007349262,0.8291183,0.0011154404,0.013659591],"study_design_scores_gemma":[0.00000784967,0.000022598308,0.003988757,0.00003773462,0.000009359786,0.00024601183,0.0003332103,0.37248012,0.0009935133,0.6206857,0.0011669891,0.000028193816],"about_ca_topic_score_codex":0.0008668503,"about_ca_topic_score_gemma":0.0006423493,"teacher_disagreement_score":0.0016255017,"about_ca_system_score_codex":0.00059261057,"about_ca_system_score_gemma":0.0002705777,"threshold_uncertainty_score":0.005369842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013112273,0.030294916,0.037887115,0.012050155,0.0107718045,0.00017294218,0.0026439999,0.002972366,0.9018955],"genre_scores_gemma":[0.006095788,0.017601712,0.017337145,0.005627978,0.0028091064,0.0001365124,0.002713063,0.0012168367,0.946462],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996892,0.000026891643,0.000011289658,0.000064439235,0.00018076222,0.000027322132],"domain_scores_gemma":[0.9994486,0.0001932169,0.000023880717,0.00006505743,0.00017775632,0.000091496484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025817595,0.0011421454,0.00077697943,0.0017958131,0.0009476732,0.0020899812,0.0008073105,0.001140198,0.11801056],"category_scores_gemma":[0.0014032472,0.00052824296,0.00078195456,0.0027819315,0.00063104916,0.0036386393,0.0013692784,0.0028276783,0.08026463],"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.000008175772,0.000039012313,0.00006323006,0.00013870191,0.0000054961984,0.00005115538,0.00006692235,0.00052506145,0.00047483935,0.032043338,0.8630024,0.10358164],"study_design_scores_gemma":[0.0000024652243,0.000014261496,0.00019988115,0.00010036327,0.0000024500391,0.00012908338,0.000024597703,0.00029723017,0.00012598294,0.02023972,0.97885907,0.000004786963],"about_ca_topic_score_codex":0.0012608393,"about_ca_topic_score_gemma":0.00304044,"teacher_disagreement_score":0.11801056,"about_ca_system_score_codex":0.0011672871,"about_ca_system_score_gemma":0.0009792104,"threshold_uncertainty_score":0.39478463},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0673905,0.0006615175,0.9090972,0.0017887207,0.000055638164,0.00015977806,0.00036957493,0.0003597548,0.020117365],"genre_scores_gemma":[0.85888934,0.0007544078,0.13008921,0.0006618105,0.00017622959,0.00037623514,0.0005057031,0.0002129608,0.008334192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984126,0.0005992377,0.000049519356,0.00047858345,0.00028990177,0.00017011173],"domain_scores_gemma":[0.99477273,0.004141596,0.0003329836,0.00027590178,0.00022155781,0.0002552828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016520732,0.0014368363,0.0015955004,0.00092815974,0.001009876,0.0019789387,0.0016155206,0.0017907702,0.0058360393],"category_scores_gemma":[0.008870943,0.00081123604,0.00158204,0.0012089493,0.0021179426,0.0036222877,0.0025144683,0.0022588496,0.00048580853],"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.00013213586,0.00012683167,0.0019142384,0.00026211803,0.00011974801,0.00035439717,0.00023374414,0.61669403,0.0016686558,0.33747733,0.007088011,0.03392882],"study_design_scores_gemma":[0.000023995808,0.00003894291,0.0003045998,0.00001812491,0.000028580509,0.0000916241,0.000044695003,0.79916584,0.00064364495,0.19761762,0.0020070581,0.000015333579],"about_ca_topic_score_codex":0.005331788,"about_ca_topic_score_gemma":0.004615034,"teacher_disagreement_score":0.0058360393,"about_ca_system_score_codex":0.0020694535,"about_ca_system_score_gemma":0.0013846469,"threshold_uncertainty_score":0.019523501},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04573648,0.002335014,0.9391751,0.0033332624,0.00012967623,0.00021007762,0.0011670311,0.0010303851,0.006882979],"genre_scores_gemma":[0.5587415,0.0032642502,0.42751417,0.0010124068,0.0006112868,0.0005920248,0.0031147844,0.00049166504,0.004657937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99248946,0.0029321872,0.000519212,0.0013997743,0.00240494,0.00025453535],"domain_scores_gemma":[0.9659257,0.027308315,0.0017861999,0.002469186,0.0020295503,0.00048096883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043350942,0.0008712279,0.0012227404,0.002932554,0.0015010086,0.004844982,0.0014564284,0.0016327712,0.0031051903],"category_scores_gemma":[0.040250722,0.00062233367,0.0008030013,0.005309394,0.002128026,0.010607838,0.0031105133,0.0030426162,0.0009335419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041939144,0.00017277879,0.0072414884,0.0008545706,0.00014915984,0.0007259549,0.0020261917,0.1502298,0.009004008,0.56528217,0.026867867,0.2370266],"study_design_scores_gemma":[0.000045480727,0.00005480903,0.0006503996,0.00004987217,0.000033631142,0.00056999683,0.0006066873,0.4552378,0.0036475551,0.5200417,0.01901971,0.00004231022],"about_ca_topic_score_codex":0.0024838427,"about_ca_topic_score_gemma":0.0025652875,"teacher_disagreement_score":0.004844982,"about_ca_system_score_codex":0.0018513465,"about_ca_system_score_gemma":0.001020147,"threshold_uncertainty_score":0.02292645},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09710863,0.003115151,0.12934019,0.13937558,0.0053390735,0.0004859615,0.0005747061,0.0010600173,0.62360066],"genre_scores_gemma":[0.8862412,0.00063828466,0.019629546,0.017695509,0.0011648657,0.00080587075,0.000285513,0.0014035576,0.07213561],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97956777,0.015864033,0.0003050708,0.0013884495,0.0017632562,0.0011114143],"domain_scores_gemma":[0.9798233,0.012943841,0.0011899295,0.001716868,0.00175065,0.0025754643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007955105,0.0012010238,0.0010126285,0.0017639381,0.015227921,0.01599928,0.003122378,0.010949766,0.0155764725],"category_scores_gemma":[0.03437521,0.00081874337,0.0010471366,0.0018162237,0.01860752,0.021204002,0.02102905,0.017158132,0.004090686],"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.00010559491,0.000028908928,0.00045297868,0.00013265743,0.000025496713,0.00070489215,0.7530425,0.000113730406,0.0031724337,0.21722236,0.018042084,0.0069563654],"study_design_scores_gemma":[0.00006118426,0.00008838854,0.0009560658,0.00044052838,0.00004257238,0.0010962524,0.31281462,0.0011204574,0.0013848885,0.1319558,0.5499256,0.000113683775],"about_ca_topic_score_codex":0.0026151438,"about_ca_topic_score_gemma":0.002635197,"teacher_disagreement_score":0.01599928,"about_ca_system_score_codex":0.0030995847,"about_ca_system_score_gemma":0.002344449,"threshold_uncertainty_score":0.052108526},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73701775,0.0043968554,0.22964606,0.0015050136,0.00022813142,0.0003414695,0.01577589,0.0013438317,0.0097448835],"genre_scores_gemma":[0.86125404,0.0016530554,0.107622,0.00022960856,0.0003379269,0.0002073409,0.022437122,0.00012235972,0.0061366586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999343,0.00009856788,0.000066932735,0.00025218102,0.00017383596,0.00006549601],"domain_scores_gemma":[0.997538,0.0013927041,0.00042309484,0.00028598763,0.0002233308,0.00013689134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035779018,0.00072273205,0.00062427425,0.003968534,0.0006614014,0.0009028182,0.001265815,0.0012012189,0.0019306605],"category_scores_gemma":[0.003877545,0.0004216547,0.0011566657,0.0037735861,0.00038879132,0.0023630555,0.0008427331,0.00076427014,0.0011193772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011489799,0.0010332011,0.23135579,0.0017996146,0.0012633892,0.0032308942,0.00097364804,0.047201935,0.024073118,0.021464758,0.03356472,0.63288987],"study_design_scores_gemma":[0.000110424546,0.0004757794,0.09058814,0.00028526122,0.0007362325,0.004113244,0.0014029552,0.7451669,0.014104295,0.110814035,0.032125372,0.00007741388],"about_ca_topic_score_codex":0.002075496,"about_ca_topic_score_gemma":0.0064570075,"teacher_disagreement_score":0.003968534,"about_ca_system_score_codex":0.0003320188,"about_ca_system_score_gemma":0.00039953235,"threshold_uncertainty_score":0.0064586997},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5137582,0.0010665653,0.47495714,0.0007200731,0.000039418028,0.00017515848,0.005586056,0.00093367713,0.0027636767],"genre_scores_gemma":[0.9001725,0.000663603,0.09288762,0.000069619724,0.000084104526,0.00009566844,0.004227761,0.000049297625,0.0017497881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993012,0.00022544414,0.000041316172,0.00023152647,0.00014194888,0.000058432415],"domain_scores_gemma":[0.99678564,0.0022523045,0.00029161983,0.00031422084,0.0002040087,0.00015220689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006306923,0.0006872762,0.0007290377,0.003006949,0.00061246235,0.0012022634,0.00094450294,0.0011232547,0.00086465105],"category_scores_gemma":[0.004803685,0.00071082986,0.0010063152,0.002873151,0.00039322494,0.0033862668,0.0009853255,0.0009120175,0.0007625973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088173844,0.0011880747,0.2609491,0.00071842514,0.00091218913,0.0013346474,0.0013143879,0.3009473,0.018649014,0.024077646,0.009930769,0.37909672],"study_design_scores_gemma":[0.0000060314364,0.000037937392,0.011147731,0.00001912448,0.000060013626,0.00020676848,0.00013958845,0.9709872,0.0011466752,0.015232833,0.0010030556,0.000013106487],"about_ca_topic_score_codex":0.009168699,"about_ca_topic_score_gemma":0.022734294,"teacher_disagreement_score":0.009168699,"about_ca_system_score_codex":0.0005815837,"about_ca_system_score_gemma":0.0005498216,"threshold_uncertainty_score":0.018230617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08210825,0.0004335299,0.91358304,0.00065237324,0.000056734738,0.00006536595,0.00024412002,0.00048751492,0.0023690888],"genre_scores_gemma":[0.8165001,0.00043720123,0.17886207,0.00019022178,0.00037487302,0.00025658312,0.00077877135,0.00008255095,0.0025176643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872416,0.0005601171,0.000068794834,0.00032971645,0.00024687182,0.00007023149],"domain_scores_gemma":[0.9806302,0.016873093,0.00065719296,0.0009059383,0.0006496108,0.00028387975],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.002345028,0.00075237494,0.0009408403,0.00202956,0.00049069175,0.0011084223,0.0012845332,0.0011820951,0.0013889208],"category_scores_gemma":[0.020144232,0.0003644768,0.00074873795,0.0015430194,0.0010253502,0.0032578337,0.0016233295,0.0015954206,0.0004466005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028434844,0.00049131404,0.023859603,0.00038244954,0.00043053587,0.00011428341,0.0005491783,0.35655242,0.004433052,0.06378527,0.0068701715,0.54224735],"study_design_scores_gemma":[0.000011600824,0.000051433468,0.0008948194,0.000011776433,0.000026145528,0.000026713224,0.000031684824,0.9356845,0.00078766595,0.06193248,0.0005325568,0.00000860404],"about_ca_topic_score_codex":0.0017302377,"about_ca_topic_score_gemma":0.0029149947,"teacher_disagreement_score":0.99797046,"about_ca_system_score_codex":0.0008068883,"about_ca_system_score_gemma":0.0004938834,"threshold_uncertainty_score":0.012401819},"labels":[],"label_agreement":null}]}