{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015611869,0.00018919702,0.97983515,0.00032899802,0.00023407239,0.00017138678,0.000011930868,0.0001298575,0.0034875139],"genre_scores_gemma":[0.9922811,8.440605e-7,0.004918327,0.00029564777,0.0019477542,0.000033344226,0.00045978988,0.00003201039,0.0000311874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978406,0.00023260467,0.00053632644,0.00037908833,0.0004071374,0.00060427067],"domain_scores_gemma":[0.9989109,0.00040472634,0.00013422772,0.0001303768,0.000258429,0.00016131275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006777241,0.00023232657,0.00040007214,0.00012328704,0.00035472494,0.00017953615,0.00028900677,0.00009688342,0.0002537952],"category_scores_gemma":[0.000023175633,0.00026695727,0.0001948213,0.00074267504,0.00013932974,0.0001915682,0.00022325838,0.00041087013,0.000021380636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001853403,0.00021754208,0.058488503,0.0000027899446,0.000042381504,0.0000046932782,0.0002458727,0.79664844,4.851112e-7,0.12862681,0.012586921,0.0031170165],"study_design_scores_gemma":[0.00054922176,0.000012811837,0.03609811,0.000021777283,0.00002530185,6.5432806e-7,0.00024525667,0.9082981,2.915203e-7,0.053534474,0.0009604343,0.00025358703],"about_ca_topic_score_codex":0.000090066125,"about_ca_topic_score_gemma":0.000025738433,"teacher_disagreement_score":0.97666925,"about_ca_system_score_codex":0.00011915767,"about_ca_system_score_gemma":0.00006678946,"threshold_uncertainty_score":0.99997824},"labels":[],"label_agreement":null},{"id":"W2108424850","doi":"10.1186/s40649-015-0013-8","title":"A study on the influential neighbors to maximize information diffusion in online social networks","year":2015,"lang":"en","type":"article","venue":"Computational Social Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Iran Telecommunication Research Center; National Research Foundation of Korea; National IT Industry Promotion Agency; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Maximization; Viral marketing; Computer science; Diffusion; Social network (sociolinguistics); Control (management); Mathematical optimization; Data science; Operations research; Social media; Mathematics; World Wide Web; Artificial intelligence","score_opus":0.03092943649076229,"score_gpt":0.3021121997038541,"score_spread":0.2711827632130918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108424850","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5833909,0.000008046373,0.41264707,0.0016330364,0.000214435,0.0008477454,0.000016653825,0.00009241978,0.0011496873],"genre_scores_gemma":[0.99548113,2.5311e-7,0.00036798025,0.0012285209,0.0023712572,0.00010422676,0.00041223541,0.000019792153,0.0000146193315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979817,0.00030699116,0.00058987516,0.0002349076,0.0005287137,0.00035779644],"domain_scores_gemma":[0.9990565,0.00023500898,0.0002466248,0.00013190946,0.00022870615,0.00010122159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054864556,0.0002432184,0.00032918045,0.00014588569,0.00045403294,0.00017840862,0.00033730993,0.0000865125,0.000064070315],"category_scores_gemma":[0.000019122252,0.00021009019,0.00015315438,0.0009368519,0.000054872376,0.00024420547,0.00025144345,0.00045891642,0.000019749517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012954717,0.0005026982,0.024693439,6.2618506e-7,0.000077375844,0.0000011741316,0.003286427,0.912354,1.1279595e-7,0.016961541,0.017783357,0.024209697],"study_design_scores_gemma":[0.0014576114,0.00014815426,0.27517667,0.000017339496,0.00004720974,2.111696e-7,0.0037298596,0.69932514,1.7684071e-7,0.017924603,0.001821536,0.00035146892],"about_ca_topic_score_codex":0.00022408181,"about_ca_topic_score_gemma":0.0000719739,"teacher_disagreement_score":0.4122791,"about_ca_system_score_codex":0.00015108437,"about_ca_system_score_gemma":0.000072286864,"threshold_uncertainty_score":0.85672295},"labels":[],"label_agreement":null},{"id":"W2663163049","doi":"10.1186/s40649-016-0034-y","title":"An efficient method for link prediction in weighted multiplex networks","year":2016,"lang":"en","type":"article","venue":"Computational Social Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Spurious relationship; Link (geometry); Similarity (geometry); Set (abstract data type); Data mining; Complex network; Relation (database); Artificial intelligence; Dependency (UML); Multiplex; Variety (cybernetics); Extension (predicate logic); Machine learning; Theoretical computer science","score_opus":0.012343451321665908,"score_gpt":0.30802908418031977,"score_spread":0.29568563285865385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2663163049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00675052,0.000038458966,0.9916988,0.0004058421,0.00020492917,0.0004924578,0.00004307423,0.00014927473,0.00021663855],"genre_scores_gemma":[0.93617976,0.0000010800813,0.05926106,0.00008727804,0.0037402892,0.00018222815,0.00046581533,0.00003322419,0.00004928745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827427,0.00022218614,0.00048938114,0.00042011443,0.00019905069,0.0003949742],"domain_scores_gemma":[0.9987575,0.00061544334,0.00020394176,0.00013940477,0.00019651257,0.00008724075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005627532,0.0002051218,0.00031267796,0.000108503744,0.00029876304,0.000053943066,0.00020732553,0.0001242741,0.00015033523],"category_scores_gemma":[0.0000060624684,0.00017633341,0.00020686093,0.00040189477,0.000060030765,0.000120744204,0.00004963191,0.0001654382,0.0000032971807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045593773,0.00011621026,0.0090297125,0.0000013086833,0.000045727866,2.444564e-7,0.00006559911,0.785221,0.000008824971,0.022284482,0.0022668259,0.18091448],"study_design_scores_gemma":[0.0008728818,0.000043066648,0.025557796,0.000025027379,0.000030829717,1.7285205e-7,0.000018786079,0.93986547,0.0000040377095,0.03222139,0.0011666953,0.00019382329],"about_ca_topic_score_codex":0.00005504763,"about_ca_topic_score_gemma":0.00001819746,"teacher_disagreement_score":0.9324377,"about_ca_system_score_codex":0.000108114575,"about_ca_system_score_gemma":0.00004044395,"threshold_uncertainty_score":0.7190668},"labels":[],"label_agreement":null},{"id":"W2735320078","doi":"10.1186/s40649-017-0041-7","title":"Computation and analysis of temporal betweenness in a knowledge mobilization network","year":2017,"lang":"en","type":"article","venue":"Computational Social Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Betweenness centrality; Centrality; Computer science; Network science; Dynamic network analysis; Social network analysis; Network analysis; Artificial intelligence; Theoretical computer science; Measure (data warehouse); Network theory; Complex network; Data mining; Mathematics; Computer network; Statistics","score_opus":0.019679553333603075,"score_gpt":0.3261911815532441,"score_spread":0.30651162821964106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735320078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2342261,0.00010547444,0.7643503,0.000056566274,0.00005126726,0.00015416197,0.0000117514655,0.000024184488,0.0010202278],"genre_scores_gemma":[0.99459267,0.0000025180696,0.004243615,0.000010975266,0.00047200185,0.00001845994,0.0006343359,0.0000125770075,0.000012873354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988046,0.00012164563,0.00046286132,0.0002613873,0.00014645484,0.00020301959],"domain_scores_gemma":[0.9989133,0.00022340016,0.0005119158,0.00013290846,0.00017597778,0.00004251026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039049707,0.00014566477,0.00048668063,0.00018841153,0.000490958,0.00010075447,0.000184477,0.00006678227,0.000033241184],"category_scores_gemma":[0.0000070483497,0.00016602351,0.00016577213,0.0007181885,0.00016703694,0.00018975342,0.00014512838,0.00012985902,5.4530614e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066404646,0.000045895238,0.46385506,0.0000027504211,0.00025110316,1.741831e-7,0.00013811071,0.50930995,2.62492e-7,0.010702268,0.00019567534,0.015492137],"study_design_scores_gemma":[0.00015989038,0.0000066919883,0.44897613,0.000011343542,0.00016557261,2.5641326e-8,0.000023896313,0.52942264,2.781172e-7,0.02112722,0.000023571945,0.00008275216],"about_ca_topic_score_codex":0.00029601503,"about_ca_topic_score_gemma":0.00023880835,"teacher_disagreement_score":0.76036656,"about_ca_system_score_codex":0.000031396143,"about_ca_system_score_gemma":0.0000340394,"threshold_uncertainty_score":0.67702425},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0132653145,0.00002202343,0.9828939,0.00066790247,0.000539207,0.0001567106,0.00026734752,0.00003343464,0.0021541691],"genre_scores_gemma":[0.9941912,2.6888682e-7,0.00024849433,0.00033701694,0.004311667,0.00001662994,0.0008528603,0.000015905995,0.000025915064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987834,0.00009609335,0.0003730368,0.00019828182,0.00025329334,0.00029591165],"domain_scores_gemma":[0.9989994,0.00012900027,0.00027008908,0.00005895349,0.0004800831,0.000062430714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020245372,0.00015561651,0.0002855829,0.00002021168,0.000687792,0.00005160252,0.00017775506,0.00012004157,0.00026433234],"category_scores_gemma":[0.0000068770696,0.00017249727,0.00022038202,0.00028683068,0.00041601917,0.00007751262,0.000027413318,0.0001889451,0.000007865077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006388027,0.00015429132,0.009403391,0.0000050171875,0.00013878847,3.3740588e-7,0.00027512046,0.35798162,0.0000014608821,0.6099032,0.0057141497,0.016358702],"study_design_scores_gemma":[0.00086028245,0.00004459333,0.0553758,0.000009101239,0.000027694332,4.8806594e-8,0.00006722584,0.92030406,0.0000015589669,0.021162529,0.0019499648,0.00019715255],"about_ca_topic_score_codex":0.00008542254,"about_ca_topic_score_gemma":0.0000030585193,"teacher_disagreement_score":0.9826454,"about_ca_system_score_codex":0.000051031013,"about_ca_system_score_gemma":0.00016144116,"threshold_uncertainty_score":0.70342344},"labels":[],"label_agreement":null},{"id":"W2891465282","doi":"10.1186/s40649-018-0055-9","title":"Adding ReputationRank to member promotion using skyline operator in social networks","year":2018,"lang":"en","type":"article","venue":"Computational Social Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"Fundamental Research Funds for the Central Universities; Nanjing University of Aeronautics and Astronautics; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Skyline; Promotion (chess); Operator (biology); Computer science; Business; Political science; Biology; Data mining; Genetics","score_opus":0.03746973910793022,"score_gpt":0.34414050124532997,"score_spread":0.30667076213739974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891465282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11233618,0.000021534153,0.8848121,0.0004425551,0.00022301596,0.00040992314,0.000010253091,0.00011076466,0.0016336591],"genre_scores_gemma":[0.9743651,3.3743012e-7,0.01466137,0.00036588914,0.010123439,0.000053908814,0.00034082384,0.000045239285,0.00004388803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979041,0.00021243814,0.0006169677,0.00046475398,0.00032117037,0.00048055995],"domain_scores_gemma":[0.9990609,0.00011597966,0.00022635226,0.00010228202,0.0004001451,0.0000943276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048448076,0.00025741186,0.00038792213,0.00016865319,0.0008864328,0.00016366671,0.00020984105,0.00012637037,0.00047723463],"category_scores_gemma":[0.000010496546,0.0003008985,0.00017288784,0.0012739067,0.00010992734,0.00025243728,0.00015351344,0.00030452793,0.000015240441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038909187,0.0001488903,0.008501893,0.000002623122,0.000094597504,0.0000017483169,0.00065382535,0.94134444,0.00001455327,0.020662492,0.008157607,0.020378403],"study_design_scores_gemma":[0.0003839765,0.00004080256,0.013766372,0.000035478923,0.00004059422,6.5907614e-7,0.00008507081,0.97053057,0.0000060226675,0.013857421,0.0009231412,0.0003298678],"about_ca_topic_score_codex":0.00009246263,"about_ca_topic_score_gemma":0.000049785314,"teacher_disagreement_score":0.87015074,"about_ca_system_score_codex":0.000195439,"about_ca_system_score_gemma":0.00008111061,"threshold_uncertainty_score":0.9999443},"labels":[],"label_agreement":null}]}