{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":6,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":6,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"2c1ce6233988","filters":{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mario Ventresca","is_ca":false},{"name":"Dionne M. Aleman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05083340851624824,"gpt":0.3539425798192488,"spread":0.3031091713030005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001236844,0.001088421,0.000881691,0.001958579,0.001033098,0.001131134,0.001244897,0.001083392,0.001365398],"category_scores_gemma":[0.006883207,0.0007911255,0.000565993,0.001140202,0.00102061,0.002070001,0.001507262,0.0008484222,0.0002252329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001352511,"about_ca_system_score_gemma":0.001450404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008271876,"about_ca_topic_score_gemma":0.009627126,"domain_scores_codex":[0.99951,0.0001388675,0.00002662264,0.000139882,0.0001079462,0.00007670132],"domain_scores_gemma":[0.9953211,0.003407998,0.000533241,0.0002062491,0.000347259,0.0001841342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001903541,0.00006949866,0.004823625,0.0002694609,0.0000685352,0.0002686291,0.0002739563,0.9104361,0.005318678,0.01327218,0.002024461,0.06298451],"study_design_scores_gemma":[0.00001282348,0.00001861072,0.0003782959,0.000009349831,0.00001001869,0.00004208674,0.0000821018,0.9836221,0.001284141,0.01400175,0.0005333308,0.000005344502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1962236,0.0006384385,0.7992406,0.0005329199,0.00003515915,0.0002371273,0.000323349,0.0007159329,0.002052869],"genre_scores_gemma":[0.5998061,0.0003514121,0.3975188,0.00009110214,0.00002468155,0.0001699166,0.0006808067,0.0001282982,0.001228828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008271876,"threshold_uncertainty_score":0.01644742,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hyoungshick Kim","is_ca":false},{"name":"Konstantin Beznosov","is_ca":true},{"name":"Eiko Yoneki","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03092943649076229,"gpt":0.3021121997038541,"spread":0.2711827632130918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004255567,0.0009322646,0.001169907,0.001145009,0.0009264338,0.001567854,0.001771458,0.001358106,0.001639966],"category_scores_gemma":[0.02703027,0.0006152288,0.0007968229,0.001128211,0.001590852,0.00397257,0.001209345,0.001191643,0.0002342104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001189534,"about_ca_system_score_gemma":0.0007131324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001728614,"about_ca_topic_score_gemma":0.00140363,"domain_scores_codex":[0.9981477,0.001150219,0.00005053756,0.0002997973,0.0002220188,0.000129709],"domain_scores_gemma":[0.9768811,0.01995841,0.0009222275,0.0008095635,0.000987979,0.0004407038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002830668,0.0003355704,0.006384789,0.0004767659,0.0002134398,0.0004257388,0.001162143,0.6484701,0.01128858,0.2731701,0.003204452,0.05458513],"study_design_scores_gemma":[0.00003375594,0.0001050081,0.0005709297,0.00002127938,0.00004126173,0.0001079323,0.0000852848,0.9566708,0.001724391,0.03923379,0.001390058,0.00001559275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2156055,0.002028852,0.7633178,0.001606384,0.00006881245,0.0001797942,0.00008986191,0.000185882,0.01691714],"genre_scores_gemma":[0.9332159,0.0009812394,0.06270872,0.000153602,0.0001405246,0.0001249958,0.00005872161,0.00008435961,0.002531864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004255567,"threshold_uncertainty_score":0.02250582,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Amir Afrasiabi Rad","is_ca":true},{"name":"Paola Flocchini","is_ca":true},{"name":"Joanne Gaudet","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01967955333360307,"gpt":0.3261911815532441,"spread":0.3065116282196411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.001626773,0.000490758,0.000557899,0.005176768,0.0008381627,0.001600048,0.001015925,0.0008672705,0.00234762],"category_scores_gemma":[0.01336233,0.0002744937,0.0007488522,0.003037643,0.0008955742,0.002316373,0.001250582,0.0008330743,0.0003097122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001508136,"about_ca_system_score_gemma":0.0008126795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004165224,"about_ca_topic_score_gemma":0.003849429,"domain_scores_codex":[0.9988332,0.0002604803,0.00008489866,0.0003604456,0.0003506182,0.0001103134],"domain_scores_gemma":[0.9907673,0.006077821,0.001357644,0.0005255407,0.0008685351,0.0004031279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004139466,0.0002159514,0.05795097,0.0005150012,0.0002641651,0.0008584582,0.001803495,0.5515605,0.01632249,0.09204149,0.00366052,0.2743931],"study_design_scores_gemma":[0.00001028576,0.00005663906,0.007095848,0.00003086509,0.00002858087,0.0002541504,0.00022673,0.9507764,0.002544229,0.03738908,0.001565737,0.00002153176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2548391,0.0003544687,0.7402753,0.0004653652,0.00002916946,0.0001121711,0.0007162253,0.0005594366,0.002648745],"genre_scores_gemma":[0.7054015,0.00017301,0.2917326,0.00006031466,0.00002837127,0.0001634377,0.001130714,0.00007212815,0.001237931],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9948232,"threshold_uncertainty_score":0.01094234,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Shikhar Sharma","is_ca":true},{"name":"Anurag Singh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01234345132166591,"gpt":0.3080290841803198,"spread":0.2956856328586538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001317246,0.001114057,0.0007658478,0.002761272,0.0009242689,0.001428449,0.001693275,0.001220521,0.005307005],"category_scores_gemma":[0.007168644,0.000434399,0.0008056474,0.002046479,0.0006175684,0.002639207,0.001476086,0.001214027,0.001220198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001326087,"about_ca_system_score_gemma":0.001279733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00551292,"about_ca_topic_score_gemma":0.005567828,"domain_scores_codex":[0.9991639,0.0001363961,0.0000598718,0.0002001958,0.000352022,0.00008773517],"domain_scores_gemma":[0.9979588,0.0008613005,0.000264005,0.0002717334,0.0005346417,0.0001096092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002521293,0.0001788868,0.004560467,0.0001379005,0.00009233445,0.0002363986,0.0001699519,0.4502125,0.007853621,0.02778594,0.004619533,0.5039003],"study_design_scores_gemma":[0.000005348986,0.00001278973,0.000194865,0.0000060392,0.000007354814,0.00002700103,0.00001314114,0.991632,0.001103139,0.006367147,0.0006262353,0.000004800588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01749328,0.00009245214,0.9801506,0.00008802676,0.00003219546,0.00009626841,0.0001719665,0.0008677844,0.001007507],"genre_scores_gemma":[0.2700892,0.0001725928,0.7238813,0.00009016668,0.00007315582,0.0003008154,0.0009321737,0.0002071006,0.004253486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00551292,"threshold_uncertainty_score":0.01775372,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Dave McKenney","is_ca":true},{"name":"Tony White","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007407544784645074,"gpt":0.2665411802693939,"spread":0.2591336354847489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002685361,0.0008001218,0.0006846002,0.0008645193,0.0005821153,0.001636287,0.001587715,0.001053397,0.002546231],"category_scores_gemma":[0.008515167,0.00032742,0.000776307,0.000564065,0.002796927,0.001776951,0.002153818,0.001895867,0.0002552397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001989819,"about_ca_system_score_gemma":0.001254486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003799899,"about_ca_topic_score_gemma":0.001853209,"domain_scores_codex":[0.9988248,0.0005561507,0.00003865751,0.0002213581,0.0002695531,0.00008939405],"domain_scores_gemma":[0.994185,0.003989843,0.0006319204,0.0003587027,0.0006017154,0.0002327724],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002891477,0.00003431622,0.0004542144,0.00007513961,0.00002896937,0.00005676122,0.0001121107,0.8031631,0.001160399,0.1824249,0.0005923265,0.01186877],"study_design_scores_gemma":[0.00001163402,0.00001647592,0.00006130148,0.000008172626,0.000003288162,0.00001010884,0.00001146164,0.9380733,0.0001919974,0.06079964,0.0008077139,0.000004881224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01126325,0.0001643807,0.9836379,0.000577501,0.000043336,0.00004964897,0.00002406004,0.00006653633,0.0041733],"genre_scores_gemma":[0.8632544,0.0007183985,0.1311943,0.0002105407,0.0001875726,0.0003185977,0.00007288127,0.00007209224,0.003971212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003799899,"threshold_uncertainty_score":0.01443714,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jiping Zheng","is_ca":true},{"name":"Siman Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03746973910793022,"gpt":0.34414050124533,"spread":0.3066707621373997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002630546,0.001156083,0.001531637,0.003585845,0.001586784,0.001807625,0.001895934,0.001437284,0.002325983],"category_scores_gemma":[0.008362925,0.0005181304,0.0009838518,0.002937851,0.001192,0.004628044,0.001859262,0.001290643,0.000889523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009015928,"about_ca_system_score_gemma":0.001476879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003185439,"about_ca_topic_score_gemma":0.005156513,"domain_scores_codex":[0.9974764,0.0008291824,0.0001625016,0.0005656865,0.0007412684,0.0002249009],"domain_scores_gemma":[0.9946522,0.002296599,0.0007412447,0.000889212,0.000982385,0.000438426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006008007,0.0006521425,0.01513551,0.0004479324,0.0001641286,0.0003660927,0.001174638,0.162354,0.01415766,0.04699806,0.01075884,0.7471901],"study_design_scores_gemma":[0.0000660135,0.0003085694,0.001936433,0.00003489689,0.00006124092,0.0002832327,0.0002551973,0.9597319,0.00701632,0.02535562,0.004893878,0.0000567293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06571577,0.0004497604,0.9276616,0.0002623326,0.00007979899,0.0002049147,0.0002099532,0.002046383,0.003369467],"genre_scores_gemma":[0.4735867,0.0002675863,0.5212078,0.00009889058,0.0001425725,0.0002169734,0.000686417,0.0001887749,0.003604201],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003585845,"threshold_uncertainty_score":0.01391184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}