{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006777241,0.0002323266,0.0004000721,0.000123287,0.0003547249,0.0001795361,0.0002890068,0.00009688342,0.0002537952],"category_scores_gemma":[0.00002317563,0.0002669573,0.0001948213,0.000742675,0.0001393297,0.0001915682,0.0002232584,0.0004108701,0.00002138064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001191577,"about_ca_system_score_gemma":0.00006678946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009006613,"about_ca_topic_score_gemma":0.00002573843,"domain_scores_codex":[0.9978406,0.0002326047,0.0005363264,0.0003790883,0.0004071374,0.0006042707],"domain_scores_gemma":[0.9989109,0.0004047263,0.0001342277,0.0001303768,0.000258429,0.0001613128],"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.00001853403,0.0002175421,0.0584885,0.000002789945,0.0000423815,0.000004693278,0.0002458727,0.7966484,4.851112e-7,0.1286268,0.01258692,0.003117017],"study_design_scores_gemma":[0.0005492218,0.00001281184,0.03609811,0.00002177728,0.00002530185,6.543281e-7,0.0002452567,0.9082981,2.915203e-7,0.05353447,0.0009604343,0.000253587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01561187,0.000189197,0.9798352,0.000328998,0.0002340724,0.0001713868,0.00001193087,0.0001298575,0.003487514],"genre_scores_gemma":[0.9922811,8.440605e-7,0.004918327,0.0002956478,0.001947754,0.00003334423,0.0004597899,0.00003201039,0.0000311874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9766693,"threshold_uncertainty_score":0.9999782,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005486456,0.0002432184,0.0003291804,0.0001458857,0.0004540329,0.0001784086,0.0003373099,0.0000865125,0.00006407031],"category_scores_gemma":[0.00001912225,0.0002100902,0.0001531544,0.0009368519,0.00005487238,0.0002442055,0.0002514434,0.0004589164,0.00001974952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001510844,"about_ca_system_score_gemma":0.00007228686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002240818,"about_ca_topic_score_gemma":0.0000719739,"domain_scores_codex":[0.9979817,0.0003069912,0.0005898752,0.0002349076,0.0005287137,0.0003577964],"domain_scores_gemma":[0.9990565,0.000235009,0.0002466248,0.0001319095,0.0002287062,0.0001012216],"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.0001295472,0.0005026982,0.02469344,6.261851e-7,0.00007737584,0.000001174132,0.003286427,0.912354,1.12796e-7,0.01696154,0.01778336,0.0242097],"study_design_scores_gemma":[0.001457611,0.0001481543,0.2751767,0.0000173395,0.00004720974,2.111696e-7,0.00372986,0.6993251,1.768407e-7,0.0179246,0.001821536,0.0003514689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5833909,0.000008046373,0.4126471,0.001633036,0.000214435,0.0008477454,0.00001665382,0.00009241978,0.001149687],"genre_scores_gemma":[0.9954811,2.5311e-7,0.0003679802,0.001228521,0.002371257,0.0001042268,0.0004122354,0.00001979215,0.00001461933],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4122791,"threshold_uncertainty_score":0.856723,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003904971,0.0001456648,0.0004866806,0.0001884115,0.000490958,0.0001007545,0.000184477,0.00006678227,0.00003324118],"category_scores_gemma":[0.00000704835,0.0001660235,0.0001657721,0.0007181885,0.0001670369,0.0001897534,0.0001451284,0.000129859,5.453061e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003139614,"about_ca_system_score_gemma":0.0000340394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000296015,"about_ca_topic_score_gemma":0.0002388084,"domain_scores_codex":[0.9988046,0.0001216456,0.0004628613,0.0002613873,0.0001464548,0.0002030196],"domain_scores_gemma":[0.9989133,0.0002234002,0.0005119158,0.0001329085,0.0001759778,0.00004251026],"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.000006640465,0.00004589524,0.4638551,0.000002750421,0.0002511032,1.741831e-7,0.0001381107,0.5093099,2.62492e-7,0.01070227,0.0001956753,0.01549214],"study_design_scores_gemma":[0.0001598904,0.000006691988,0.4489761,0.00001134354,0.0001655726,2.564133e-8,0.00002389631,0.5294226,2.781172e-7,0.02112722,0.00002357195,0.00008275216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2342261,0.0001054744,0.7643503,0.00005656627,0.00005126726,0.000154162,0.00001175147,0.00002418449,0.001020228],"genre_scores_gemma":[0.9945927,0.00000251807,0.004243615,0.00001097527,0.0004720018,0.00001845994,0.0006343359,0.00001257701,0.00001287335],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7603666,"threshold_uncertainty_score":0.6770242,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005627532,0.0002051218,0.000312678,0.0001085037,0.000298763,0.00005394307,0.0002073255,0.0001242741,0.0001503352],"category_scores_gemma":[0.000006062468,0.0001763334,0.0002068609,0.0004018948,0.00006003076,0.0001207442,0.00004963191,0.0001654382,0.000003297181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001081146,"about_ca_system_score_gemma":0.00004044395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005504763,"about_ca_topic_score_gemma":0.00001819746,"domain_scores_codex":[0.9982743,0.0002221861,0.0004893811,0.0004201144,0.0001990507,0.0003949742],"domain_scores_gemma":[0.9987575,0.0006154433,0.0002039418,0.0001394048,0.0001965126,0.00008724075],"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.00004559377,0.0001162103,0.009029713,0.000001308683,0.00004572787,2.444564e-7,0.00006559911,0.785221,0.000008824971,0.02228448,0.002266826,0.1809145],"study_design_scores_gemma":[0.0008728818,0.00004306665,0.0255578,0.00002502738,0.00003082972,1.728521e-7,0.00001878608,0.9398655,0.000004037709,0.03222139,0.001166695,0.0001938233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00675052,0.00003845897,0.9916988,0.0004058421,0.0002049292,0.0004924578,0.00004307423,0.0001492747,0.0002166386],"genre_scores_gemma":[0.9361798,0.000001080081,0.05926106,0.00008727804,0.003740289,0.0001822281,0.0004658153,0.00003322419,0.00004928745],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9324377,"threshold_uncertainty_score":0.7190668,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002024537,0.0001556165,0.0002855829,0.00002021168,0.000687792,0.00005160252,0.0001777551,0.0001200416,0.0002643323],"category_scores_gemma":[0.00000687707,0.0001724973,0.000220382,0.0002868307,0.0004160192,0.00007751262,0.00002741332,0.0001889451,0.000007865077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005103101,"about_ca_system_score_gemma":0.0001614412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008542254,"about_ca_topic_score_gemma":0.000003058519,"domain_scores_codex":[0.9987834,0.00009609335,0.0003730368,0.0001982818,0.0002532933,0.0002959117],"domain_scores_gemma":[0.9989994,0.0001290003,0.0002700891,0.00005895349,0.0004800831,0.00006243071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006388027,0.0001542913,0.009403391,0.000005017188,0.0001387885,3.374059e-7,0.0002751205,0.3579816,0.000001460882,0.6099032,0.00571415,0.0163587],"study_design_scores_gemma":[0.0008602825,0.00004459333,0.0553758,0.000009101239,0.00002769433,4.880659e-8,0.00006722584,0.9203041,0.000001558967,0.02116253,0.001949965,0.0001971525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01326531,0.00002202343,0.9828939,0.0006679025,0.000539207,0.0001567106,0.0002673475,0.00003343464,0.002154169],"genre_scores_gemma":[0.9941912,2.688868e-7,0.0002484943,0.0003370169,0.004311667,0.00001662994,0.0008528603,0.00001590599,0.00002591506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9826454,"threshold_uncertainty_score":0.7034234,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004844808,0.0002574119,0.0003879221,0.0001686532,0.0008864328,0.0001636667,0.000209841,0.0001263704,0.0004772346],"category_scores_gemma":[0.00001049655,0.0003008985,0.0001728878,0.001273907,0.0001099273,0.0002524373,0.0001535134,0.0003045279,0.00001524044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000195439,"about_ca_system_score_gemma":0.00008111061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009246263,"about_ca_topic_score_gemma":0.00004978531,"domain_scores_codex":[0.9979041,0.0002124381,0.0006169677,0.000464754,0.0003211704,0.0004805599],"domain_scores_gemma":[0.9990609,0.0001159797,0.0002263523,0.000102282,0.0004001451,0.0000943276],"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.00003890919,0.0001488903,0.008501893,0.000002623122,0.0000945975,0.000001748317,0.0006538254,0.9413444,0.00001455327,0.02066249,0.008157607,0.0203784],"study_design_scores_gemma":[0.0003839765,0.00004080256,0.01376637,0.00003547892,0.00004059422,6.590761e-7,0.00008507081,0.9705306,0.000006022668,0.01385742,0.0009231412,0.0003298678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1123362,0.00002153415,0.8848121,0.0004425551,0.000223016,0.0004099231,0.00001025309,0.0001107647,0.001633659],"genre_scores_gemma":[0.9743651,3.374301e-7,0.01466137,0.0003658891,0.01012344,0.00005390881,0.0003408238,0.00004523929,0.00004388803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8701507,"threshold_uncertainty_score":0.9999443,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}