{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":28,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":28,"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"},"query_hash":"f48d896ef942","filters":{"venue":"Tsinghua Science & Technology"}},"results":[{"id":"W1815337875","doi":"10.1109/tst.2014.6961028","title":"A survey of MRI-based brain tumor segmentation methods","year":2014,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":385,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"National Natural Science Foundation of China","keywords":"Magnetic resonance imaging; Segmentation; Brain tumor; White matter; Medicine; Brain morphometry; Computer science; Radiology; Artificial intelligence; Pathology","retraction":null,"screen_n_in":null,"score":{"opus":0.05643494966167163,"gpt":0.3670277960383451,"spread":0.3105928463766735,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.003515077,0.0001219324,0.0001874941,0.001148876,0.0003067008,0.00004713444,0.000727511,0.00007661364,0.0000413327],"category_scores_gemma":[0.00954958,0.0001164011,0.00003140781,0.005470872,0.00245563,0.0002040445,0.00008018665,0.0001824309,0.00003933627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001079822,"about_ca_system_score_gemma":0.0002286637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006206402,"about_ca_topic_score_gemma":0.00003196537,"domain_scores_codex":[0.9978926,0.0004611998,0.0003267481,0.0006083553,0.0003686096,0.0003424408],"domain_scores_gemma":[0.998284,0.0006187174,0.0003092425,0.0005585604,0.0001629812,0.00006651533],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000009663859,0.0000421292,0.001050088,0.000005215353,3.415214e-7,4.243604e-7,0.00004492409,0.00005803546,0.9453198,0.00536396,0.00003040821,0.04807502],"study_design_scores_gemma":[0.000253054,0.0001639856,0.01164304,0.000009148211,0.000002536929,0.00001533646,0.00006703477,0.04306361,0.9420694,0.001566277,0.001030812,0.0001157834],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6127272,0.000009315793,0.3808135,0.003821189,0.0004139983,0.0002615745,0.000004784537,0.0004310881,0.001517359],"genre_scores_gemma":[0.9810243,7.818749e-7,0.0177836,0.00104846,0.000008291663,0.00002353341,0.0000010127,0.00001099886,0.00009901713],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3682971,"threshold_uncertainty_score":0.9987934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984419556","doi":"10.1109/tst.2014.6787363","title":"Energy-theft detection issues for advanced metering infrastructure in smart grid","year":2014,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Electricity Theft Detection Techniques","field":"Engineering","cited_by":326,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer security; Smart grid; Smart meter; Computer science; Metering mode; Critical infrastructure; Resource (disambiguation); Energy (signal processing); Engineering; Computer network; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.003456107286073668,"gpt":0.2261262956483151,"spread":0.2226701883622415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004699634,0.0001959969,0.0002425171,0.002132751,0.0001837026,0.00004626978,0.0005336935,0.000233146,0.000005348692],"category_scores_gemma":[0.0002634347,0.0002085252,0.00003931926,0.002796714,0.0003632326,0.0003513405,0.00007764269,0.0002834976,0.000003495432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003554163,"about_ca_system_score_gemma":0.00002405044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000303459,"about_ca_topic_score_gemma":0.000104531,"domain_scores_codex":[0.9985871,0.00001474999,0.000267635,0.0003872151,0.0001720136,0.0005712348],"domain_scores_gemma":[0.9993862,0.00004201303,0.00005923478,0.0003868941,0.00007908806,0.00004657354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000005569962,0.000004197196,0.0000800251,0.00001160493,0.000002139888,3.803737e-7,0.00006261287,0.001773021,0.7429309,0.0006200507,0.00001369736,0.2544957],"study_design_scores_gemma":[0.0001749821,0.0001981189,0.0001079635,0.00002420875,0.000003567968,0.00002708641,0.00003023921,0.06015461,0.8996965,0.02416738,0.01520351,0.0002118514],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5114129,0.0001472308,0.4841291,0.000145757,0.0005759827,0.0002078699,0.000001264887,0.002780307,0.0005996101],"genre_scores_gemma":[0.9837307,0.0000479658,0.01593862,0.00003968901,0.00005967328,0.0001159986,6.75545e-7,0.00003448105,0.00003225296],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4723177,"threshold_uncertainty_score":0.8503413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144425137","doi":"10.1109/tst.2013.6522585","title":"Erasure coding for cloud storage systems: A survey","year":2013,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":69,"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":"Erasure; Computer science; Cloud computing; Cloud storage; Erasure code; Coding (social sciences); Operating system; Algorithm; Decoding methods; Mathematics; Programming language; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03159143285073643,"gpt":0.2828868283690719,"spread":0.2512953955183355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001401674,0.0002967783,0.0003925884,0.001560281,0.0007408877,0.0005669657,0.00539264,0.0002547757,0.000005320922],"category_scores_gemma":[0.001494583,0.0002458756,0.00003519189,0.006065007,0.002522538,0.00239614,0.001239037,0.0003659854,0.0001111017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000360468,"about_ca_system_score_gemma":0.0003457754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001073754,"about_ca_topic_score_gemma":0.00003417101,"domain_scores_codex":[0.9967443,0.00004058199,0.0003636348,0.001196529,0.0005246004,0.001130306],"domain_scores_gemma":[0.9965124,0.0002626679,0.0002748064,0.002142229,0.0006955439,0.000112419],"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.00001439368,0.0001180433,0.003577329,0.00006345151,0.00002451692,0.00003791801,0.0002711535,0.001152065,0.06824885,0.8757243,0.003123179,0.04764482],"study_design_scores_gemma":[0.004422733,0.004365064,0.01031376,0.0006994584,0.00005502901,0.0017186,0.004433353,0.5084109,0.1510781,0.226726,0.08210862,0.005668389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07886256,0.0002717464,0.9134513,0.002475723,0.0007440501,0.0009702076,0.0000182199,0.00303805,0.0001681071],"genre_scores_gemma":[0.8438792,0.000009986066,0.1555802,0.00007927429,0.00002646864,0.0002849486,0.000003776246,0.00001879074,0.0001172874],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7650167,"threshold_uncertainty_score":0.9999993,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01934774664668551,"gpt":0.3153019390577153,"spread":0.2959541924110298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002547422,0.0001426997,0.0003271862,0.001614753,0.0002443393,0.00005201314,0.0004362504,0.00003966207,0.0002281323],"category_scores_gemma":[0.000008827835,0.00009378564,0.00007369206,0.004269856,0.001696371,0.0001360285,0.000211185,0.0001087452,0.00004987195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005358452,"about_ca_system_score_gemma":0.00004274996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003815535,"about_ca_topic_score_gemma":0.000009923753,"domain_scores_codex":[0.9987396,0.0000187989,0.0001755189,0.0005109681,0.0001934422,0.000361678],"domain_scores_gemma":[0.9991891,0.00005711797,0.0001066939,0.000499126,0.00008500027,0.00006296254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002035757,0.0001980498,0.4079344,0.000001421405,0.0004795227,0.00000356652,0.0006017339,0.00003797857,0.1106955,0.3410133,0.0009259674,0.1380883],"study_design_scores_gemma":[0.001477491,0.001133609,0.07657079,0.0001673099,0.001283337,0.000009883936,0.002013666,0.009860373,0.4601395,0.3980524,0.04742247,0.001869125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9435464,0.00002045848,0.0427927,0.001855891,0.00002244863,0.00009824998,0.00000319059,0.0002082145,0.0114525],"genre_scores_gemma":[0.9975684,0.000001340209,0.001981459,0.00006561629,0.00003429775,0.00001899642,8.155265e-7,0.000004021397,0.0003250108],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3494441,"threshold_uncertainty_score":0.6250352,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02125943195332981,"gpt":0.3226243666990314,"spread":0.3013649347457016,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.001064003,0.0001874496,0.0002731291,0.0008739576,0.001523425,0.00008044313,0.000887153,0.00009720666,0.0002514923],"category_scores_gemma":[0.00007205984,0.0001785925,0.00009256921,0.002907597,0.003410976,0.0001557409,0.0002759046,0.0006518886,0.00004757697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001377649,"about_ca_system_score_gemma":0.0001806053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004305665,"about_ca_topic_score_gemma":0.00003149952,"domain_scores_codex":[0.9982764,0.0001523706,0.0002949706,0.0004033033,0.0003241176,0.0005488045],"domain_scores_gemma":[0.9986112,0.0001018902,0.0001601247,0.0008517639,0.0001865268,0.00008851647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003646974,0.0007025782,0.03925237,0.000009570384,0.00004814553,0.000004643705,0.0004587429,0.002325641,0.7901098,0.03628111,0.00009924838,0.1303435],"study_design_scores_gemma":[0.0005663707,0.0003481329,0.0004039998,0.00003379745,0.00003403187,0.000003720842,0.0001358777,0.5700725,0.4052774,0.02162093,0.001245145,0.000258153],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.623677,0.000003444049,0.3746321,0.0001759531,0.0001404318,0.0001346037,0.000001861793,0.0002860988,0.0009485806],"genre_scores_gemma":[0.9942014,2.80312e-7,0.005496391,0.00006249485,0.0001885991,0.00001774502,0.000002130813,0.00001306856,0.00001790683],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5677468,"threshold_uncertainty_score":0.9997765,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040337771","doi":"10.1016/s1007-0214(10)70090-0","title":"Location specific cell transmission model for freeway traffic","year":2010,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Traffic control and management","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Cell Transmission Model; Computer science; Transmission (telecommunications); Traffic flow (computer networking); Field (mathematics); Simulation; Traffic model; Transport engineering; Engineering; Traffic congestion; Telecommunications; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.007603721105807031,"gpt":0.2040946231148668,"spread":0.1964909020090598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002431893,0.0001243393,0.0001186978,0.0005718337,0.0001747263,0.00004095522,0.0005063511,0.0001286485,0.00001087708],"category_scores_gemma":[0.00001104665,0.0001184852,0.00003258808,0.0009457326,0.000361536,0.0001559311,0.00002520235,0.0002047278,0.0000218927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005142355,"about_ca_system_score_gemma":0.00005405116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.91719e-7,"about_ca_topic_score_gemma":0.00001616168,"domain_scores_codex":[0.9989895,0.000001472716,0.0001649594,0.0002989061,0.0001487199,0.0003964709],"domain_scores_gemma":[0.9994942,0.00001153599,0.00002297362,0.0003471276,0.0000616272,0.00006254459],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002993488,0.00002620932,0.000001134815,0.00002374491,0.000001204137,4.340297e-7,0.0001693202,0.3495212,0.421506,0.004261132,0.0002568324,0.2242298],"study_design_scores_gemma":[0.0003449623,0.00003292438,0.00003131838,0.000008573121,0.000006990453,0.000002619249,0.0000604233,0.940963,0.02525087,0.001025386,0.03212371,0.0001492025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3363975,0.0002695003,0.6589228,0.0007250921,0.0005336158,0.000373419,0.000001398814,0.001364296,0.001412421],"genre_scores_gemma":[0.9780017,0.00002723837,0.02162252,0.00001762496,0.00003395366,0.00004873378,0.000001222018,0.00001731978,0.0002296764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6416042,"threshold_uncertainty_score":0.4831685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W66789461","doi":"10.1109/tst.2014.6733205","title":"Towards a cost-efficient MapReduce: Mitigating power peaks for Hadoop clusters","year":2014,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Scalability; Computer science; Inefficiency; Distributed computing; Big data; Software; Power consumption; Power (physics); Database; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01260418994756148,"gpt":0.2641181345769154,"spread":0.2515139446293539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002047748,0.000253942,0.0002827902,0.001127903,0.0009970301,0.0003731556,0.003528003,0.0001410104,0.000003784643],"category_scores_gemma":[0.0006313269,0.0002284077,0.0001047355,0.003123771,0.001348895,0.00006069361,0.001789866,0.00027049,0.00003840712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002457925,"about_ca_system_score_gemma":0.0002004247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000158352,"about_ca_topic_score_gemma":0.000001594734,"domain_scores_codex":[0.9967258,0.00004085395,0.0003832543,0.001129313,0.0006071688,0.001113602],"domain_scores_gemma":[0.9980115,0.0001010687,0.0002170016,0.001267695,0.0002376967,0.0001650615],"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.00001013612,0.0002345867,0.0002061518,0.0000470832,0.00002031452,0.00001050489,0.003210775,0.04320865,0.01522328,0.3181488,0.000963229,0.6187165],"study_design_scores_gemma":[0.0005479229,0.0003282406,0.0002298623,0.00008398313,0.000009392415,0.00005461415,0.0005561447,0.9501351,0.01185673,0.005572085,0.03022006,0.0004058221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3574343,0.00004283058,0.6237135,0.01015987,0.0009316819,0.0005589706,7.571366e-7,0.0009615861,0.006196507],"genre_scores_gemma":[0.9213149,3.989599e-7,0.07750676,0.000738888,0.0000581394,0.00006663602,3.778322e-7,0.00001496824,0.0002989261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9069265,"threshold_uncertainty_score":0.9314197,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048683157","doi":"10.1016/s1007-0214(08)70129-9","title":"Computer simulation of dynamic interactions between vehicle and long span box girder bridges","year":2008,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Railway Engineering and Dynamics","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Bridge (graph theory); Box girder; Structural engineering; Span (engineering); Engineering; Axle; Finite element method; Girder; Beam bridge","retraction":null,"screen_n_in":null,"score":{"opus":0.009548851398213244,"gpt":0.243886566428147,"spread":0.2343377150299338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000840098,0.0001000857,0.0001490131,0.0007883718,0.0001247922,0.000015077,0.000184111,0.0000757505,0.00000230923],"category_scores_gemma":[0.00002791396,0.0001074017,0.0000180314,0.001011251,0.0006028126,0.000209764,0.00006348796,0.0001691042,0.000005989454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008151603,"about_ca_system_score_gemma":0.00002042687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007936937,"about_ca_topic_score_gemma":0.000007655872,"domain_scores_codex":[0.9993173,0.00000325236,0.0001684802,0.0001817731,0.00009979093,0.0002294393],"domain_scores_gemma":[0.9996229,0.00004360236,0.00003007453,0.0002100436,0.00005124666,0.00004211425],"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":[7.826914e-7,0.000008844161,0.02096217,0.00001737255,0.000007241358,0.000004003795,0.0001761976,0.9450784,0.009707339,0.000138774,0.000005379225,0.02389345],"study_design_scores_gemma":[0.00008615789,0.00003050041,0.07886771,0.00002226676,0.000005373836,0.00002981997,0.0000226174,0.9181364,0.002475456,0.00009882746,0.0001228358,0.0001021039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6924098,0.00005121923,0.3068296,0.00007342955,0.0001336138,0.00004155738,0.00000278208,0.0003832393,0.00007484866],"genre_scores_gemma":[0.9953085,0.00001981611,0.004594367,0.000004176856,0.00002156371,0.000001814177,0.000002159536,0.00001420198,0.00003344532],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3028987,"threshold_uncertainty_score":0.4379715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386041553","doi":"10.26599/tst.2022.9010054","title":"Modeling Long- and Short-Term Service Recommendations with a Deep Multi-Interest Network for Edge Computing","year":2023,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Key Research and Development Program of China; State Key Laboratory of Novel Software Technology; Fundamental Research Funds for the Central Universities; Nanjing University; Ministry of Industry and Information Technology of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Exploit; Term (time); Service (business); Context (archaeology); Recommender system; Service provider; Task (project management); Edge computing; Service discovery; Core network; Wireless network; Mobile edge computing; Data mining; Distributed computing; World Wide Web; Wireless; Computer network; Artificial intelligence; Web service; Computer security; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.07534615194663036,"gpt":0.3292923692686234,"spread":0.253946217321993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110405,0.0002120666,0.0002749663,0.0008795182,0.0009774234,0.0003749168,0.00156485,0.0001325304,7.928125e-7],"category_scores_gemma":[0.00004625693,0.0001852577,0.00003152446,0.00444244,0.000296975,0.0006374764,0.001005897,0.0002267774,0.000007086653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008911904,"about_ca_system_score_gemma":0.0001102648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004447546,"about_ca_topic_score_gemma":0.0005799856,"domain_scores_codex":[0.9978127,0.00002562495,0.0003511261,0.0008440767,0.0001695414,0.000796918],"domain_scores_gemma":[0.9987324,0.00008496834,0.00009999591,0.0007041218,0.0002705483,0.0001079788],"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.00002769799,0.0002764296,0.04128259,0.0002964889,0.00009993825,0.0000776552,0.007102538,0.01984193,0.009512718,0.155364,0.0009879832,0.76513],"study_design_scores_gemma":[0.0002205535,0.0001380185,0.0004150417,0.000180634,0.000006494753,0.0001242312,0.0002759477,0.994655,0.0009301443,0.002361104,0.0004349448,0.0002578487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1329941,0.00007475216,0.8587419,0.00556504,0.0003234774,0.0004652034,0.000001484532,0.001771867,0.00006223518],"genre_scores_gemma":[0.75009,0.00001483109,0.2495804,0.0001803086,0.0000432434,0.00005709743,0.000003376082,0.00001484917,0.00001589817],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9748131,"threshold_uncertainty_score":0.755459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008429997","doi":"10.1016/s1007-0214(08)70126-3","title":"Dynamic analysis of cable roofs under transient wind: A comparison between time domain and frequency domain approaches","year":2008,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Structural Engineering and Vibration Analysis","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Nonlinear system; Transient (computer programming); Frequency domain; Time domain; Computer science; Finite element method; Roof; Engineering; Structural engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01655533729747242,"gpt":0.2303064184038579,"spread":0.2137510811063855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002228012,0.0001759144,0.0005101772,0.002209838,0.0001822421,0.00001932755,0.0003273092,0.0001466581,0.00003158589],"category_scores_gemma":[0.00001342518,0.0001667592,0.00008169341,0.005830405,0.001204055,0.0001579455,0.00003569196,0.0001860221,0.000004738617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001457673,"about_ca_system_score_gemma":0.00004324253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005853351,"about_ca_topic_score_gemma":0.00003490641,"domain_scores_codex":[0.9987016,0.00001259525,0.0003498609,0.0003260834,0.0002580106,0.0003518547],"domain_scores_gemma":[0.999454,0.00002854043,0.00006228379,0.0003384269,0.00003564015,0.00008114651],"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.00000223834,0.00002032191,0.01226351,0.00002295902,0.0004831348,0.000004024001,0.001793851,0.821987,0.1584274,0.002267815,0.000008601619,0.002719169],"study_design_scores_gemma":[0.0002883762,0.00006956582,0.0570636,0.00001612186,0.000365003,0.00002514206,0.001180876,0.9267811,0.01070334,0.003069869,0.00004877952,0.0003882328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7568877,0.0002593198,0.2419802,0.0001377561,0.00002283282,0.00005991721,0.000007438196,0.0002851349,0.0003596271],"genre_scores_gemma":[0.9785801,0.0000115445,0.02135346,0.000005102544,0.000004389412,0.00000348135,0.00001051697,0.00001253936,0.00001885831],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2216924,"threshold_uncertainty_score":0.6800241,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1927555499","doi":"10.1109/tst.2015.7128934","title":"On scaling software-Defined Networking in wide-area networks","year":2015,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":8,"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":"Software-defined networking; Computer science; Scaling; Software; Computer network; Operating system; Mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02621502048607532,"gpt":0.2532766395334496,"spread":0.2270616190473743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002275276,0.0003857555,0.0004787052,0.002026585,0.0004596659,0.000393265,0.003578335,0.0003852272,0.000005249388],"category_scores_gemma":[0.001458444,0.0003640996,0.00007381115,0.0113298,0.001179265,0.0008144352,0.001258582,0.0008366907,0.00007509562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005080805,"about_ca_system_score_gemma":0.0005307813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006382551,"about_ca_topic_score_gemma":0.00004197365,"domain_scores_codex":[0.9955221,0.0000643503,0.0005806649,0.001365497,0.0008106867,0.001656658],"domain_scores_gemma":[0.9972171,0.0004684666,0.0002435985,0.001521111,0.000230212,0.0003195759],"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.00007080637,0.0003345931,0.09397723,0.000009065752,0.00001553907,0.0003443442,0.001018839,0.3838233,0.0001759462,0.1674791,0.003723431,0.3490278],"study_design_scores_gemma":[0.001542589,0.0006108573,0.002531109,0.0004077119,0.00001011457,0.0001683933,0.0001469728,0.8167539,0.0005596179,0.1685725,0.00757525,0.001120961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1061799,0.0009517058,0.8842009,0.002360553,0.002466635,0.0002945017,3.94291e-7,0.002162179,0.001383197],"genre_scores_gemma":[0.9528555,0.0000310063,0.04558876,0.001306073,0.0001042477,0.00003493137,0.000001374218,0.00002858418,0.0000495143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8466756,"threshold_uncertainty_score":0.9998811,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W241339743","doi":"10.1109/tst.2012.6151903","title":"Rise and fall of the peer-to-peer empire","year":2012,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"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":"Popularity; Peer-to-peer; Computer science; The Internet; Argument (complex analysis); World Wide Web; Peer review; Computer security; Political science; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.01703925682806431,"gpt":0.2764331828903869,"spread":0.2593939260623226,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002008751,0.0002528389,0.0003137988,0.00142833,0.000483721,0.0001379922,0.006250773,0.000247547,0.000002914173],"category_scores_gemma":[0.001985833,0.0001877716,0.00005233291,0.008931127,0.00271277,0.0007656089,0.005221286,0.0004252701,0.00007923268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001529061,"about_ca_system_score_gemma":0.0002012348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004948199,"about_ca_topic_score_gemma":0.0000335158,"domain_scores_codex":[0.9964615,0.00003347382,0.0003472551,0.0007478171,0.001207096,0.001202826],"domain_scores_gemma":[0.9968169,0.00006691316,0.000165026,0.002191053,0.0005310195,0.0002291355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001104833,0.0002443182,0.1589381,0.0000218642,0.00002112318,0.000009991939,0.005701045,0.0002076596,0.1168776,0.3360117,0.01303561,0.36892],"study_design_scores_gemma":[0.0006451684,0.0007022631,0.1195812,0.0001989128,0.00003689433,0.0004943463,0.001514655,0.004477873,0.3961727,0.04322105,0.4315108,0.001444105],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8787664,0.0003824819,0.03551104,0.08108719,0.000926677,0.0004197442,0.000003435484,0.001097319,0.001805733],"genre_scores_gemma":[0.9320539,0.000004373862,0.06657133,0.000563306,0.0000349109,0.00002942608,9.156619e-8,0.000012062,0.0007305705],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4184752,"threshold_uncertainty_score":0.9995314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408100312","doi":"10.26599/tst.2024.9010065","title":"Social Media-Driven User Community Finding with Privacy Protection","year":2025,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"China Postdoctoral Science Foundation","keywords":"Internet privacy; Privacy protection; Computer science; Social media; Computer security; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.0505621800898568,"gpt":0.341973125649909,"spread":0.2914109455600522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.00213281,0.0001535085,0.0002092319,0.001362945,0.006929194,0.0002402903,0.002132709,0.0003107041,0.00002349974],"category_scores_gemma":[0.003530606,0.0001452295,0.00003461567,0.006412132,0.005501627,0.0009339458,0.0009323384,0.0009442925,0.00002798474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006453645,"about_ca_system_score_gemma":0.0009609381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002252126,"about_ca_topic_score_gemma":0.004215159,"domain_scores_codex":[0.9979044,0.0002539216,0.0002181511,0.0004108773,0.0005471424,0.0006655372],"domain_scores_gemma":[0.9987942,0.00009507137,0.0001579585,0.0006201455,0.0002607822,0.00007185889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00018284,0.0006950911,0.02006607,0.0000967424,0.00005267101,0.00001504069,0.1087563,0.00001847669,0.05987129,0.6528022,0.001708306,0.155735],"study_design_scores_gemma":[0.002659711,0.0006422664,0.02915289,0.0004805004,0.0001302549,0.00003782096,0.1009433,0.0006113808,0.07556099,0.4763037,0.3118954,0.001581778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9532753,0.00003904718,0.01463591,0.01889423,0.0005827651,0.000801731,0.000004453875,0.001111638,0.01065489],"genre_scores_gemma":[0.9979681,0.00001556298,0.001560566,0.0001086961,0.0001020011,0.00008035365,0.000002659061,0.000008181179,0.0001538803],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3101871,"threshold_uncertainty_score":0.9972048,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412030713","doi":"10.26599/tst.2024.9010216","title":"Learning Fine-Grained User Preference for Personalized Recommendation","year":2025,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Preference; Computer science; Information retrieval; Human–computer interaction; Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03092815123050258,"gpt":0.3062304388535652,"spread":0.2753022876230626,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001325866,0.0001797357,0.0002559516,0.001507334,0.0007262476,0.00029547,0.001910986,0.0001661452,0.00001196563],"category_scores_gemma":[0.0005126502,0.0001654618,0.00006448004,0.003624643,0.0005347658,0.0007123028,0.0005592887,0.0002632856,0.000009702594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001935119,"about_ca_system_score_gemma":0.000337062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002205532,"about_ca_topic_score_gemma":0.0000117569,"domain_scores_codex":[0.9980843,0.000046243,0.0003348821,0.0007720282,0.0001933196,0.0005692095],"domain_scores_gemma":[0.9987684,0.000118856,0.0001749833,0.0005853774,0.0002998924,0.00005245786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000007009774,0.00004212229,0.001101644,0.00002343995,0.000009455078,7.962896e-7,0.0004441641,0.000006021739,0.01973536,0.7498035,0.002229343,0.2265972],"study_design_scores_gemma":[0.000880627,0.000471064,0.0003207375,0.000159832,0.00001226956,0.00002423625,0.0003791321,0.03495053,0.08524838,0.1050577,0.7720385,0.0004569892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007281811,0.00007843921,0.9681864,0.01345488,0.0005312984,0.0005279831,0.000001232529,0.001539776,0.008398166],"genre_scores_gemma":[0.8666819,0.00001254244,0.127823,0.0002129341,0.00001930295,0.0002305687,0.000002883373,0.000008269245,0.005008589],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8594001,"threshold_uncertainty_score":0.6747338,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969602909","doi":"10.1109/tst.2013.6522586","title":"On meeting deadlines in datacenter networks","year":2013,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":3,"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":"Computer science; Partition (number theory); Cloud computing; Distributed computing; Latency (audio); Computer network; Network congestion; Throughput; Network packet; Wireless; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.008911858474087363,"gpt":0.2350650129121377,"spread":0.2261531544380503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007413889,0.0001537225,0.0001627032,0.001296098,0.0002939688,0.0002869324,0.00284741,0.00008947332,0.000007603353],"category_scores_gemma":[0.0001834298,0.0001282401,0.00002659458,0.00393913,0.0005678502,0.0001228176,0.001600983,0.0003021554,0.000150867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001191162,"about_ca_system_score_gemma":0.00004305543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008921415,"about_ca_topic_score_gemma":0.00001181896,"domain_scores_codex":[0.9979135,0.00002724414,0.0002643894,0.000732826,0.0003290302,0.0007330118],"domain_scores_gemma":[0.9987164,0.00006947846,0.00009758757,0.0009784054,0.00006973369,0.00006843725],"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.000004947211,0.0003547599,0.01847105,0.0000149611,0.00001001843,0.00007861468,0.0007451891,0.1766422,0.004312863,0.2776024,0.00228095,0.5194821],"study_design_scores_gemma":[0.0002352406,0.0001026538,0.002723328,0.000108227,0.000001273606,0.00001871447,0.00011505,0.9832924,0.001043522,0.01004164,0.002088001,0.0002299631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8966377,0.00008864215,0.08822247,0.007893209,0.0005153649,0.0002486531,7.703096e-8,0.0006757872,0.005718057],"genre_scores_gemma":[0.9885612,0.000002585833,0.01049636,0.0006868517,0.0000365925,0.0000171394,1.863222e-7,0.00000662218,0.0001924556],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8066502,"threshold_uncertainty_score":0.5291244,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01066192649364501,"gpt":0.2645979031093727,"spread":0.2539359766157277,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007219869,0.00009515828,0.0001210106,0.0003896372,0.001472435,0.00006401193,0.0006920801,0.00002118362,0.00008396319],"category_scores_gemma":[0.000008451314,0.00008039804,0.00005584191,0.002193479,0.0003602305,0.0001530202,0.0004258874,0.0002091412,0.000003060608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001345782,"about_ca_system_score_gemma":0.00008010474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004017912,"about_ca_topic_score_gemma":0.000002493944,"domain_scores_codex":[0.9989238,0.00001699134,0.0001965249,0.0003177573,0.0002314593,0.0003134164],"domain_scores_gemma":[0.9993213,0.00005453863,0.0001665461,0.0003584106,0.00008074618,0.00001840112],"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.000003576584,0.00004726839,0.001623996,0.000001932502,0.00001492571,1.314982e-7,0.0002300586,0.01365402,0.00603047,0.05402075,0.0002759664,0.9240969],"study_design_scores_gemma":[0.0001405225,0.00005965428,0.0001105493,0.000004049346,0.00001971039,0.000003000584,0.0006802873,0.9345064,0.002512882,0.05398086,0.007870701,0.0001113962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006414847,0.00003485226,0.9905484,0.0009985475,0.0001150231,0.0005569078,0.000005992114,0.0002686255,0.001056849],"genre_scores_gemma":[0.9128327,5.845792e-7,0.08628104,0.00003297584,0.00006430835,0.0006087099,0.00001202469,0.000009411632,0.0001582911],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9239855,"threshold_uncertainty_score":0.9998275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109807708","doi":"10.1016/s1007-0214(10)70044-4","title":"Microring-assisted coupling between dissimilar waveguides","year":2010,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Photonic and Optical Devices","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"U.S. Army Medical Research and Development Command; Tsinghua National Laboratory for Information Science and Technology","keywords":"Resonator; Coupling (piping); Power (physics); Coupled mode theory; Integrated optics; Optoelectronics; Evanescent wave; Field (mathematics); Optics; Materials science; Physics; Refractive index","retraction":null,"screen_n_in":null,"score":{"opus":0.01233400911876776,"gpt":0.2553937546893996,"spread":0.2430597455706318,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003619472,0.0001650515,0.0002141926,0.000555206,0.0002761572,0.00008213965,0.0008586992,0.0002239508,0.00003923609],"category_scores_gemma":[0.0001703447,0.0001518402,0.00003574924,0.001661983,0.001500632,0.0002338023,0.0001589197,0.0005670909,0.00008502987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006928251,"about_ca_system_score_gemma":0.00007234586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000821205,"about_ca_topic_score_gemma":0.00001664242,"domain_scores_codex":[0.9985821,0.000001604558,0.0002393469,0.0003367703,0.000212919,0.0006272421],"domain_scores_gemma":[0.9992614,0.00004426186,0.00003320041,0.0004666371,0.00006441887,0.0001301283],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[7.896819e-7,0.00001122457,0.005564964,0.00001599659,0.000008131089,0.000008476549,0.0000544613,0.000204558,0.9740323,0.007936985,0.00002079386,0.01214128],"study_design_scores_gemma":[0.0002289682,0.00004745229,0.01735529,0.00005198428,0.00002850884,0.00005058733,0.0001606518,0.07685508,0.8787205,0.003579365,0.02243583,0.0004858087],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9869657,0.0001256211,0.001741804,0.0004017707,0.0005604522,0.00009057766,0.000003508703,0.001328694,0.008781916],"genre_scores_gemma":[0.9926704,0.00001320503,0.007152667,0.00002449842,0.00006170106,0.000008296916,0.00000124083,0.00002056927,0.00004737876],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09531187,"threshold_uncertainty_score":0.6191865,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402449838","doi":"10.26599/tst.2023.9010145","title":"Improve GMRACCF Qualifications via Collaborative Filtering in Vehicle Sales Chain","year":2024,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Nipissing University","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Business; Chain (unit); Automotive engineering; Computer science; Manufacturing engineering; Engineering; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01468861387140532,"gpt":0.2941336108151629,"spread":0.2794449969437576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007985187,0.0001472786,0.0001873305,0.00158662,0.0002615258,0.0003700512,0.001872913,0.0001238792,0.000004682191],"category_scores_gemma":[0.0003233077,0.0001328652,0.00002711265,0.008024347,0.001215959,0.0009268831,0.0005565129,0.0002582562,0.0001376927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001911889,"about_ca_system_score_gemma":0.0004708549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005988904,"about_ca_topic_score_gemma":0.0001175053,"domain_scores_codex":[0.9980995,0.00003192764,0.0002867296,0.0007689882,0.0002659763,0.0005468881],"domain_scores_gemma":[0.9989191,0.0001275328,0.00006211236,0.0007297873,0.0001094436,0.00005205343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000001767581,0.00004217787,0.0008630886,0.00001630996,0.000004328268,0.0000635998,0.002822479,0.00005439093,0.5751712,0.3427544,0.0000579121,0.07814827],"study_design_scores_gemma":[0.0003666885,0.0003377825,0.006675102,0.000221531,0.000009018215,0.0001267405,0.003981859,0.3676571,0.496097,0.1142767,0.009480979,0.0007694914],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5597385,0.001799238,0.4137285,0.01942736,0.001308966,0.0003537004,0.000004223604,0.002054178,0.001585329],"genre_scores_gemma":[0.9727004,0.00002801502,0.02697976,0.0001019409,0.00002300592,0.00004889158,5.333507e-7,0.000006972916,0.0001104931],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4129618,"threshold_uncertainty_score":0.5418087,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405179551","doi":"10.26599/tst.2023.9010121","title":"Maximization of k-Submodular Function with d-Knapsack Constraints Over Sliding Window","year":2024,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Submodular set function; Knapsack problem; Sliding window protocol; Maximization; Window (computing); Function (biology); Mathematics; Mathematical optimization; Computer science; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.01043570830292928,"gpt":0.2377892844926169,"spread":0.2273535761896876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005647022,0.0001487145,0.0001803957,0.001601063,0.0002768346,0.00022219,0.001137985,0.0001048943,0.00003209593],"category_scores_gemma":[0.00006986075,0.0001276373,0.00004186884,0.006900207,0.002230392,0.001012796,0.000321813,0.0002387886,0.00001751786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009077378,"about_ca_system_score_gemma":0.0003171995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001044468,"about_ca_topic_score_gemma":0.000004134265,"domain_scores_codex":[0.9982012,0.00001771369,0.0002386651,0.0006516271,0.0004862314,0.0004045611],"domain_scores_gemma":[0.9990395,0.00004165486,0.00009342929,0.0006135824,0.0001554564,0.00005635666],"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.000005771975,0.00004370207,0.0009358277,0.0000426703,0.00001695039,0.0000279711,0.0003829568,0.0003715223,0.05202951,0.7831249,0.00002725173,0.162991],"study_design_scores_gemma":[0.000730984,0.001105053,0.004248524,0.000668318,0.00005222295,0.0006689836,0.0004844381,0.5378739,0.1638636,0.2840667,0.005422155,0.0008150465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.115532,0.0003135008,0.8806991,0.0007066496,0.0006301997,0.0001498252,0.000001860251,0.0007131505,0.001253735],"genre_scores_gemma":[0.9511304,0.00001214539,0.04872009,0.00005322822,0.00002315744,0.000007048466,8.197094e-7,0.000007762748,0.0000452948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8355985,"threshold_uncertainty_score":0.8217971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386041537","doi":"10.26599/tst.2022.9010013","title":"Maximizing Submodular+Supermodular Functions Subject to a Fairness Constraint","year":2023,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Beijing University of Technology; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Constraint (computer-aided design); Greedy algorithm; Mathematical optimization; Mathematics; Function (biology); Approximation algorithm; Curvature","retraction":null,"screen_n_in":null,"score":{"opus":0.02530050457586893,"gpt":0.2690948986667293,"spread":0.2437943940908603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.001301763,0.0002461614,0.0002885966,0.004023801,0.001256035,0.0003831216,0.00350804,0.0001290674,0.0000180086],"category_scores_gemma":[0.0004298534,0.0002507454,0.00009523724,0.02191206,0.002149567,0.0007269792,0.001842276,0.0003778875,0.0006809539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001772137,"about_ca_system_score_gemma":0.000394052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004581332,"about_ca_topic_score_gemma":0.00002029468,"domain_scores_codex":[0.9965762,0.00003578423,0.0003316891,0.001201117,0.0006642762,0.001190961],"domain_scores_gemma":[0.9978609,0.00007172224,0.00007228697,0.001513785,0.0002482418,0.0002330278],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004827532,0.00009241667,0.001178786,0.00001365942,0.00001551529,0.0001845737,0.001332208,0.0009212996,0.1153599,0.6096541,0.0004695815,0.2707731],"study_design_scores_gemma":[0.001287425,0.001093728,0.01813721,0.0002496594,0.00003360713,0.001610073,0.004504402,0.3300948,0.1265557,0.4656685,0.04814696,0.002617865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.367152,0.00003329023,0.6167834,0.009857308,0.001208911,0.0002981764,0.000005609377,0.003190198,0.00147112],"genre_scores_gemma":[0.9574276,0.000005930439,0.04192271,0.0003182144,0.00004408208,0.00006214336,0.00000179061,0.00001356209,0.0002039997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5902756,"threshold_uncertainty_score":0.9999945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385332647","doi":"10.26599/tst.2023.9010013","title":"Fair $k$-Center Problem with Outliers on Massive Data","year":2023,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Outlier; Cluster analysis; Computer science; Center (category theory); Big data; Artificial intelligence; Data mining; Theoretical computer science; Algorithm; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.04442015362285633,"gpt":0.27174426727092,"spread":0.2273241136480637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006680935,0.000167381,0.0001417142,0.001933533,0.0004675347,0.0002024289,0.001757106,0.00006043219,0.0001126008],"category_scores_gemma":[0.000150923,0.0001342742,0.00001753287,0.006420731,0.0009156212,0.001229296,0.001189375,0.0001600344,0.003037504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006801219,"about_ca_system_score_gemma":0.00005864659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001214969,"about_ca_topic_score_gemma":0.0001590863,"domain_scores_codex":[0.9979452,0.000003369543,0.0002060746,0.0007750519,0.0004998828,0.0005704174],"domain_scores_gemma":[0.9985982,0.000005941647,0.00007701063,0.001156979,0.0001451175,0.00001679346],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001624156,0.00079626,0.0563838,0.000420166,0.00009884329,0.0001374436,0.0004556632,0.01183654,0.004544827,0.6434299,0.09741315,0.184321],"study_design_scores_gemma":[0.001212867,0.000126238,0.007128071,0.0001535272,0.00004724477,0.000004095437,0.004270168,0.09140862,0.0004599326,0.009351,0.8850314,0.0008068683],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7306995,0.00002021171,0.004316109,0.1038675,0.001728826,0.001626702,0.00002110165,0.005760964,0.1519591],"genre_scores_gemma":[0.996661,0.000006568929,0.0004878831,0.00138201,0.00007546311,0.00003305036,0.00005307385,0.00001580886,0.001285135],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7876182,"threshold_uncertainty_score":0.9977387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966003099","doi":"10.1109/tst.2012.6151904","title":"Uncover the peer distribution in BitTorrent","year":2012,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"BitTorrent; Download; Computer science; BitTorrent tracker; The Internet; Peer-to-peer; Computer network; File Transfer Protocol; Bandwidth (computing); World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01501945326760794,"gpt":0.274986406261742,"spread":0.2599669529941341,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002259536,0.0001981863,0.0001919598,0.0009951377,0.0003935729,0.0001859041,0.004815984,0.0001898864,0.000006016877],"category_scores_gemma":[0.001102325,0.000142917,0.00003715455,0.01119569,0.001547024,0.001064237,0.002255184,0.0004952187,0.0002508036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005929201,"about_ca_system_score_gemma":0.000191293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004214976,"about_ca_topic_score_gemma":0.0000320664,"domain_scores_codex":[0.9969327,0.00003203703,0.0002852725,0.0005933724,0.0008409896,0.00131557],"domain_scores_gemma":[0.9979815,0.00007119902,0.0001012779,0.001541256,0.0001932691,0.0001114338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004850047,0.0001951728,0.05847171,0.000003666725,0.000004794577,0.00001172827,0.001128689,0.0004366215,0.01027877,0.7367284,0.007904961,0.1848306],"study_design_scores_gemma":[0.0007198408,0.0004247651,0.1167532,0.0001180921,0.0000153923,0.0003545742,0.001264,0.01872768,0.1348832,0.09242918,0.6328582,0.001451865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6563529,0.0004591946,0.2681569,0.06905585,0.002035642,0.0004590121,0.000004258752,0.001947464,0.001528722],"genre_scores_gemma":[0.9900675,0.000006707717,0.009270306,0.0003747978,0.00005167622,0.00005505827,0.000001262234,0.00000690872,0.0001657188],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6442993,"threshold_uncertainty_score":0.8949377,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4399849664","doi":"10.26599/tst.2023.9010107","title":"Two-Stage Submodular Maximization Under Knapsack Problem","year":2024,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Qinglan Project of Jiangsu Province of China; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Knapsack problem; Submodular set function; Maximization; Mathematics; Stage (stratigraphy); Mathematical optimization; Computer science; Biology; Paleontology","retraction":null,"screen_n_in":null,"score":{"opus":0.01857924213785202,"gpt":0.2797868052830199,"spread":0.2612075631451679,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008283941,0.0002001431,0.0001802175,0.001999247,0.0005436395,0.0007528062,0.002647565,0.0001224379,0.00004146759],"category_scores_gemma":[0.00005453344,0.0001875645,0.00006325873,0.009806574,0.001783767,0.001339822,0.0009509811,0.0003792531,0.000189208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001906018,"about_ca_system_score_gemma":0.0004175067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003120627,"about_ca_topic_score_gemma":0.0000143334,"domain_scores_codex":[0.9974211,0.00002608337,0.0002782772,0.00102883,0.00054035,0.0007053447],"domain_scores_gemma":[0.9986544,0.00004011945,0.00006319841,0.001004126,0.0001401088,0.00009807949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[6.388174e-7,0.00002982392,0.00006492736,0.00001487321,0.000005059921,0.00003445531,0.0001977511,0.001139269,0.01136397,0.9365436,0.00005980812,0.05054577],"study_design_scores_gemma":[0.0001753454,0.0001157034,0.0001115914,0.00008129513,0.000006588998,0.0001675571,0.0001335199,0.4459049,0.02343019,0.509517,0.01998473,0.0003716448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01991025,0.0006399946,0.9630514,0.007158425,0.001004405,0.0002363523,0.000002510217,0.002592878,0.005403744],"genre_scores_gemma":[0.8239562,0.00002536125,0.1750305,0.0002345696,0.00004542043,0.00002004559,0.000001389689,0.00001361107,0.0006729693],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8040459,"threshold_uncertainty_score":0.7648656,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402153668","doi":"10.26599/tst.2024.9010056","title":"Mixed Strategy Nash Equilibrium for Scheduling Games on Batching-Machines with Activation Cost","year":2024,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Nash equilibrium; Computer science; Scheduling (production processes); Epsilon-equilibrium; Best response; Mathematical optimization; Mathematical economics; Economics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1000009481646914,"gpt":0.4008223774677241,"spread":0.3008214293030327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002830885,0.0002055193,0.0002467226,0.001715565,0.0005749044,0.0007790806,0.001532653,0.0001384013,0.00005174248],"category_scores_gemma":[0.001850344,0.0001388561,0.00006178051,0.006070146,0.001817889,0.0008261493,0.0001682089,0.0003254281,0.0001945778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001039932,"about_ca_system_score_gemma":0.0004355914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006545244,"about_ca_topic_score_gemma":0.00001010917,"domain_scores_codex":[0.9971802,0.00004145344,0.0004006421,0.001045491,0.0008077366,0.0005244323],"domain_scores_gemma":[0.9975845,0.001047585,0.0001552997,0.0007962641,0.0003225502,0.00009382561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004832336,0.00005460893,0.0001527276,0.000007931955,0.000007028778,0.000002347053,0.0002272301,0.005198305,0.2365835,0.5378491,0.0001692171,0.2196997],"study_design_scores_gemma":[0.0003338043,0.0006067894,0.000473846,0.0001768358,0.00001875201,0.0000507783,0.002260955,0.1062253,0.3005308,0.5723079,0.01661414,0.0004000268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8526692,0.00006751797,0.1358792,0.007470504,0.0002782223,0.0005215851,0.00001228166,0.0005737277,0.002527737],"genre_scores_gemma":[0.9926437,0.000001727396,0.00608129,0.0001391088,0.00007243836,0.0001410573,0.000003245176,0.00001885858,0.0008985409],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2192997,"threshold_uncertainty_score":0.7512692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408100306","doi":"10.26599/tst.2024.9010214","title":"A Lasserre SDP Rounding Approximation Algorithm for Max Directed 3-Section","year":2025,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Rounding; Section (typography); Algorithm; Mathematics; Combinatorics; Computer science; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007105163409990493,"gpt":0.276988987768301,"spread":0.2698838243583105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002631845,0.0001462764,0.0002158414,0.001618309,0.0002948576,0.00005916622,0.0004006437,0.0001643372,0.000003809417],"category_scores_gemma":[0.0002108612,0.000148364,0.00004894619,0.005750401,0.0003988866,0.0003816562,0.00007743136,0.0002006437,0.000004612917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004941345,"about_ca_system_score_gemma":0.00004154257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007697258,"about_ca_topic_score_gemma":0.000006180346,"domain_scores_codex":[0.9988362,0.000006632907,0.0002385363,0.0003632262,0.0001514324,0.0004040384],"domain_scores_gemma":[0.9994396,0.00003904601,0.00005246263,0.0003012789,0.0001352894,0.00003233916],"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.000002914848,0.00003141398,0.0001892073,0.00003293575,0.00001949624,0.000001002476,0.00003983402,0.001600608,0.3360554,0.008340277,0.0002070058,0.6534799],"study_design_scores_gemma":[0.0001275284,0.00004009415,0.00009301431,0.00004275402,0.00002148399,0.000005965222,0.000110898,0.6875497,0.2786469,0.02411878,0.009065102,0.0001778486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02292822,0.0001288046,0.9696565,0.0002628261,0.0003362178,0.0002924148,0.000002062312,0.00482399,0.001569018],"genre_scores_gemma":[0.6405739,0.00002712223,0.3588114,0.00003205068,0.00003456257,0.0001974238,0.000005055657,0.0000176128,0.0003008647],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.685949,"threshold_uncertainty_score":0.6050107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2217296360","doi":"","title":"Principal resonance of parametrically excited moving viscoelastic belts with geometrical nonlinearity","year":2004,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Vibration and Dynamic Analysis","field":"Engineering","cited_by":0,"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":"Nonlinear system; Viscoelasticity; Multiple-scale analysis; Vibration; Mechanics; Stability (learning theory); Differential equation; Equations of motion; Classical mechanics; Physics; Tension (geology); Resonance (particle physics); Mathematical analysis; Mathematics; Control theory (sociology); Computer science; Acoustics; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.006769209373159127,"gpt":0.2285428771813988,"spread":0.2217736678082396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002545702,0.0001428807,0.0002659381,0.002671117,0.0001362248,0.00003385889,0.0005093858,0.000140646,0.00001147033],"category_scores_gemma":[0.0005982197,0.0001229715,0.00003674657,0.0154368,0.001201924,0.0002244759,0.000103125,0.0002853785,0.00001457424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002346983,"about_ca_system_score_gemma":0.0001813608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000258641,"about_ca_topic_score_gemma":0.00003281039,"domain_scores_codex":[0.9984918,0.000006028263,0.0003071253,0.0003332154,0.0004494122,0.0004124329],"domain_scores_gemma":[0.9992545,0.00004476734,0.00007498467,0.0003820524,0.0001537988,0.00008985574],"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.00002492834,0.0001984626,0.01180789,0.00003831197,0.00003088756,0.00003945237,0.0002247473,0.922599,0.02207451,0.01569263,0.000004308783,0.02726491],"study_design_scores_gemma":[0.0008234181,0.0003499478,0.0283156,0.0000821603,0.00003864694,0.00006599395,0.0001728414,0.9514987,0.0162473,0.001686224,0.0003472139,0.0003719231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5765238,0.00009736943,0.4223791,0.0001837846,0.00003786175,0.0000650963,0.000002062762,0.000329641,0.0003812537],"genre_scores_gemma":[0.9641021,0.00001637403,0.03580623,0.00002738078,0.00001036351,0.000004605805,0.00000134407,0.00001235962,0.00001928235],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3875782,"threshold_uncertainty_score":0.7416868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4417225581","doi":"10.26599/tst.2025.9010048","title":"Design and Validation of Optimizer Parameter Critical Conditions via Coupled Transfer Functions and Phase Trajectories","year":2025,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Spacecraft Dynamics and Control","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Hainan University; National Natural Science Foundation of China","keywords":"Interpretability; Stochastic gradient descent; Trajectory; Transfer function; Generalizability theory; Gradient descent; Momentum (technical analysis); Phase (matter)","retraction":null,"screen_n_in":null,"score":{"opus":0.008832630618471901,"gpt":0.2644346671338151,"spread":0.2556020365153432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001530593,0.00008343337,0.0001430497,0.0005006435,0.0001530879,0.00003597626,0.00008584337,0.00008867061,0.00001282772],"category_scores_gemma":[0.0001102274,0.00008274232,0.0000138321,0.0007565395,0.00128166,0.0001492369,0.00001471478,0.0001012866,6.827452e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002937428,"about_ca_system_score_gemma":0.00004649946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000506582,"about_ca_topic_score_gemma":0.000002173258,"domain_scores_codex":[0.9994316,0.000008026415,0.0001379909,0.0001720324,0.00007098255,0.0001793817],"domain_scores_gemma":[0.9996159,0.0001398011,0.000007160369,0.000133014,0.00007176024,0.00003235011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001670394,0.00004986847,0.0002490762,0.00002381574,0.00002130695,0.000001535828,0.0001360918,0.005352278,0.9721587,0.01811291,0.000009661212,0.003868012],"study_design_scores_gemma":[0.0007118451,0.0001156036,0.0001389339,0.00002224861,0.00006040734,0.00001379,0.0001791274,0.9286626,0.060792,0.009168079,0.00003331413,0.0001020415],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4089193,0.0001193243,0.5902507,0.0003575458,0.00009384794,0.00009815558,0.000003078226,0.0001073928,0.00005072804],"genre_scores_gemma":[0.9952285,0.00002015689,0.004667277,0.00001666395,0.000003316163,0.00003725572,0.000001272789,0.000005400414,0.00002013637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9233103,"threshold_uncertainty_score":0.472233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W7116896472","doi":"10.26599/tst.2024.9010243","title":"From Model Parameters to Data Quality: Implicit Factor Evaluation of Model Extraction Attacks","year":2025,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Selection (genetic algorithm); Quality (philosophy); Range (aeronautics); Key (lock); Annotation; Focus (optics); Deep learning; Data quality","retraction":null,"screen_n_in":null,"score":{"opus":0.1548274608443632,"gpt":0.4612913278443817,"spread":0.3064638670000185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002894485,0.0001910056,0.0003155544,0.001494169,0.0003179531,0.0001367496,0.005304031,0.000197173,0.000005720117],"category_scores_gemma":[0.002720698,0.0001962691,0.00003645552,0.003924253,0.0005664367,0.001589242,0.002778344,0.0003818339,0.00001154908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000419701,"about_ca_system_score_gemma":0.001200323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003695177,"about_ca_topic_score_gemma":0.00004057737,"domain_scores_codex":[0.9965374,0.0001033048,0.0005158455,0.001285199,0.001086066,0.0004721232],"domain_scores_gemma":[0.9960501,0.0001614058,0.0003035091,0.00293092,0.0004783318,0.00007575436],"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.000007608978,0.00003654567,0.0003895158,0.000004135194,0.000009073088,3.382957e-7,0.0005023296,0.7445893,0.1055697,0.02265418,0.0000563967,0.1261809],"study_design_scores_gemma":[0.0002237919,0.00002290683,0.0004899509,0.0000326491,0.00002291744,0.000001161586,0.0001459576,0.9066905,0.01475304,0.07742348,0.00002920542,0.0001644135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3464286,0.00002321371,0.6498527,0.002508516,0.0002734533,0.000234719,0.00001351131,0.0002382846,0.0004269661],"genre_scores_gemma":[0.6869401,0.00000149368,0.3128417,0.0001499235,0.000008558378,0.00001409162,0.000004372514,0.000005637508,0.00003407586],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3405115,"threshold_uncertainty_score":0.9856297,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}