{"meta":{"query_hash":"2c1ce6233988","filters":{"venue":"Computational Social Networks"},"cohort_total":6,"direct_labels_cover":0,"predictions_cover":6,"exported":6,"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/2c1ce6233988","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computational+Social+Networks"},"results":[{"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":"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":"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":"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":"W2797404894","doi":"10.1186/s40649-018-0052-z","title":"Towards distribution-based control of social networks","year":2018,"lang":"en","type":"article","venue":"Computational Social Networks","topic":"Opinion Dynamics and Social Influence","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":"Carleton University","funders":"","keywords":"Control (management); Computer science; Reinforcement learning; State (computer science); Complex network; Scale (ratio); Artificial intelligence; Distributed computing; Machine learning","score_opus":0.007407544784645074,"score_gpt":0.26654118026939394,"score_spread":0.2591336354847489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797404894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011263253,0.00016438072,0.9836379,0.00057750096,0.000043336004,0.000049648974,0.00002406004,0.00006653633,0.0041733],"genre_scores_gemma":[0.86325437,0.0007183985,0.13119431,0.00021054069,0.00018757262,0.00031859774,0.00007288127,0.00007209224,0.0039712116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988248,0.00055615074,0.00003865751,0.00022135812,0.00026955307,0.000089394045],"domain_scores_gemma":[0.99418503,0.003989843,0.00063192035,0.00035870273,0.0006017154,0.00023277244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002685361,0.00080012175,0.0006846002,0.00086451933,0.00058211526,0.0016362866,0.0015877148,0.0010533972,0.002546231],"category_scores_gemma":[0.008515167,0.00032742004,0.000776307,0.000564065,0.0027969275,0.0017769514,0.0021538178,0.0018958668,0.0002552397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028914774,0.000034316225,0.0004542144,0.000075139615,0.000028969369,0.000056761215,0.0001121107,0.8031631,0.0011603989,0.18242492,0.0005923265,0.011868768],"study_design_scores_gemma":[0.000011634024,0.000016475924,0.00006130148,0.000008172626,0.0000032881624,0.000010108837,0.000011461642,0.93807334,0.00019199739,0.060799636,0.0008077139,0.0000048812244],"about_ca_topic_score_codex":0.0037998995,"about_ca_topic_score_gemma":0.0018532085,"teacher_disagreement_score":0.0037998995,"about_ca_system_score_codex":0.0019898186,"about_ca_system_score_gemma":0.0012544863,"threshold_uncertainty_score":0.014437139},"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}]}