{"meta":{"query_hash":"f48d896ef942","filters":{"venue":"Tsinghua Science & Technology"},"cohort_total":28,"direct_labels_cover":0,"predictions_cover":28,"exported":28,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/f48d896ef942","api":"https://metacan.xera.ac/api/v1/cohort?venue=Tsinghua+Science+%26+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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.056434949661671625,"score_gpt":0.3670277960383451,"score_spread":0.3105928463766735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1815337875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61272717,0.000009315793,0.3808135,0.0038211888,0.00041399826,0.00026157455,0.0000047845374,0.00043108815,0.0015173592],"genre_scores_gemma":[0.9810243,7.818749e-7,0.0177836,0.0010484598,0.000008291663,0.000023533414,0.0000010126997,0.000010998859,0.00009901713],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978926,0.00046119984,0.00032674812,0.0006083553,0.00036860956,0.00034244082],"domain_scores_gemma":[0.998284,0.0006187174,0.00030924246,0.00055856036,0.0001629812,0.00006651533],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.003515077,0.00012193236,0.00018749414,0.0011488759,0.00030670076,0.000047134443,0.000727511,0.000076613636,0.000041332696],"category_scores_gemma":[0.00954958,0.00011640107,0.000031407813,0.005470872,0.0024556303,0.00020404454,0.00008018665,0.00018243087,0.000039336268],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009663859,0.000042129195,0.0010500875,0.0000052153528,3.4152137e-7,4.2436042e-7,0.00004492409,0.00005803546,0.9453198,0.00536396,0.000030408213,0.048075024],"study_design_scores_gemma":[0.00025305402,0.00016398563,0.011643045,0.000009148211,0.0000025369293,0.00001533646,0.00006703477,0.043063615,0.94206935,0.0015662775,0.0010308117,0.00011578345],"about_ca_topic_score_codex":0.00006206402,"about_ca_topic_score_gemma":0.000031965374,"teacher_disagreement_score":0.3682971,"about_ca_system_score_codex":0.000107982196,"about_ca_system_score_gemma":0.00022866373,"threshold_uncertainty_score":0.9987934},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Software-defined networking; Computer science; Scaling; Software; Computer network; Operating system; Mathematics; Geometry","score_opus":0.02621502048607532,"score_gpt":0.2532766395334496,"score_spread":0.22706161904737426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927555499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10617988,0.00095170585,0.88420093,0.002360553,0.0024666348,0.00029450166,3.9429096e-7,0.002162179,0.0013831967],"genre_scores_gemma":[0.9528555,0.0000310063,0.04558876,0.001306073,0.0001042477,0.000034931374,0.0000013742183,0.000028584178,0.0000495143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552214,0.0000643503,0.0005806649,0.0013654968,0.00081068673,0.0016566576],"domain_scores_gemma":[0.99721706,0.00046846658,0.00024359852,0.0015211107,0.00023021197,0.00031957586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022752755,0.0003857555,0.00047870525,0.002026585,0.0004596659,0.000393265,0.0035783348,0.00038522723,0.0000052493883],"category_scores_gemma":[0.0014584442,0.00036409957,0.00007381115,0.011329797,0.0011792651,0.0008144352,0.001258582,0.0008366907,0.00007509562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007080637,0.00033459312,0.09397723,0.000009065752,0.000015539066,0.00034434418,0.001018839,0.38382334,0.0001759462,0.16747907,0.0037234311,0.3490278],"study_design_scores_gemma":[0.0015425887,0.0006108573,0.0025311091,0.00040771186,0.000010114573,0.00016839331,0.0001469728,0.81675386,0.0005596179,0.16857255,0.00757525,0.0011209612],"about_ca_topic_score_codex":0.00006382551,"about_ca_topic_score_gemma":0.00004197365,"teacher_disagreement_score":0.84667563,"about_ca_system_score_codex":0.0005080805,"about_ca_system_score_gemma":0.0005307813,"threshold_uncertainty_score":0.9998811},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015019453267607938,"score_gpt":0.27498640626174203,"score_spread":0.2599669529941341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966003099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6563529,0.0004591946,0.26815695,0.06905585,0.0020356418,0.00045901205,0.000004258752,0.0019474644,0.0015287219],"genre_scores_gemma":[0.99006754,0.000006707717,0.009270306,0.00037479776,0.000051676216,0.000055058266,0.0000012622337,0.0000069087205,0.00016571877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99693274,0.00003203703,0.0002852725,0.0005933724,0.0008409896,0.0013155696],"domain_scores_gemma":[0.99798155,0.00007119902,0.00010127785,0.0015412564,0.00019326914,0.0001114338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022595362,0.00019818633,0.00019195983,0.0009951377,0.0003935729,0.0001859041,0.004815984,0.00018988643,0.0000060168773],"category_scores_gemma":[0.0011023253,0.00014291698,0.000037154547,0.011195688,0.0015470242,0.0010642369,0.0022551839,0.0004952187,0.0002508036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004850047,0.00019517276,0.058471713,0.0000036667245,0.000004794577,0.000011728266,0.0011286892,0.00043662149,0.01027877,0.7367284,0.007904961,0.1848306],"study_design_scores_gemma":[0.0007198408,0.00042476508,0.116753206,0.00011809208,0.000015392301,0.00035457418,0.0012640004,0.018727684,0.13488324,0.092429176,0.63285816,0.001451865],"about_ca_topic_score_codex":0.00004214976,"about_ca_topic_score_gemma":0.0000320664,"teacher_disagreement_score":0.64429927,"about_ca_system_score_codex":0.0005929201,"about_ca_system_score_gemma":0.00019129296,"threshold_uncertainty_score":0.8949377},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008911858474087363,"score_gpt":0.23506501291213772,"score_spread":0.22615315443805034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969602909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89663774,0.000088642155,0.08822247,0.007893209,0.00051536487,0.0002486531,7.703096e-8,0.00067578716,0.005718057],"genre_scores_gemma":[0.9885612,0.0000025858326,0.010496364,0.0006868517,0.000036592504,0.0000171394,1.8632224e-7,0.00000662218,0.00019245557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979135,0.00002724414,0.00026438935,0.00073282595,0.00032903015,0.00073301175],"domain_scores_gemma":[0.99871635,0.00006947846,0.000097587574,0.0009784054,0.000069733695,0.00006843725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074138894,0.00015372249,0.00016270317,0.001296098,0.00029396877,0.00028693237,0.00284741,0.000089473324,0.0000076033534],"category_scores_gemma":[0.00018342977,0.00012824015,0.000026594576,0.0039391303,0.0005678502,0.00012281757,0.0016009834,0.0003021554,0.00015086698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004947211,0.0003547599,0.018471053,0.000014961099,0.000010018429,0.00007861468,0.00074518914,0.17664218,0.0043128626,0.2776024,0.00228095,0.5194821],"study_design_scores_gemma":[0.00023524064,0.000102653794,0.0027233283,0.000108226996,0.0000012736065,0.000018714472,0.00011504996,0.9832924,0.0010435223,0.010041644,0.0020880008,0.0002299631],"about_ca_topic_score_codex":0.00008921415,"about_ca_topic_score_gemma":0.0000118189555,"teacher_disagreement_score":0.8066502,"about_ca_system_score_codex":0.00011911617,"about_ca_system_score_gemma":0.00004305543,"threshold_uncertainty_score":0.5291244},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0034561072860736677,"score_gpt":0.22612629564831513,"score_spread":0.22267018836224145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984419556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5114129,0.0001472308,0.48412907,0.00014575696,0.0005759827,0.00020786992,0.0000012648869,0.0027803073,0.0005996101],"genre_scores_gemma":[0.9837307,0.000047965805,0.015938615,0.00003968901,0.00005967328,0.0001159986,6.7554504e-7,0.00003448105,0.000032252956],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99858713,0.000014749995,0.00026763495,0.00038721506,0.00017201358,0.0005712348],"domain_scores_gemma":[0.9993862,0.000042013035,0.000059234775,0.0003868941,0.00007908806,0.000046573543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004699634,0.00019599694,0.0002425171,0.0021327508,0.00018370259,0.000046269775,0.0005336935,0.00023314603,0.0000053486915],"category_scores_gemma":[0.0002634347,0.00020852525,0.000039319257,0.002796714,0.00036323263,0.0003513405,0.00007764269,0.00028349765,0.0000034954323],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055699625,0.0000041971957,0.0000800251,0.000011604929,0.000002139888,3.8037368e-7,0.00006261287,0.0017730206,0.74293095,0.0006200507,0.000013697356,0.2544957],"study_design_scores_gemma":[0.00017498208,0.00019811887,0.00010796349,0.000024208752,0.0000035679677,0.000027086411,0.00003023921,0.060154606,0.89969647,0.024167376,0.015203514,0.00021185144],"about_ca_topic_score_codex":0.000030345904,"about_ca_topic_score_gemma":0.00010453102,"teacher_disagreement_score":0.47231773,"about_ca_system_score_codex":0.0003554163,"about_ca_system_score_gemma":0.000024050438,"threshold_uncertainty_score":0.85034126},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016555337297472418,"score_gpt":0.23030641840385793,"score_spread":0.21375108110638552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008429997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75688773,0.00025931982,0.24198022,0.0001377561,0.000022832823,0.00005991721,0.000007438196,0.00028513494,0.0003596271],"genre_scores_gemma":[0.9785801,0.000011544499,0.02135346,0.000005102544,0.0000043894115,0.00000348135,0.000010516968,0.000012539356,0.000018858305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987016,0.000012595248,0.00034986087,0.0003260834,0.00025801055,0.0003518547],"domain_scores_gemma":[0.99945396,0.000028540428,0.00006228379,0.00033842694,0.000035640147,0.000081146514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022280116,0.00017591444,0.00051017717,0.0022098375,0.00018224209,0.000019327554,0.0003273092,0.00014665809,0.000031585885],"category_scores_gemma":[0.000013425185,0.00016675916,0.00008169341,0.005830405,0.0012040546,0.0001579455,0.000035691963,0.0001860221,0.0000047386166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022383397,0.000020321906,0.012263508,0.000022959015,0.00048313482,0.0000040240006,0.0017938511,0.821987,0.15842742,0.0022678147,0.000008601619,0.0027191692],"study_design_scores_gemma":[0.00028837624,0.000069565824,0.057063602,0.000016121863,0.000365003,0.000025142057,0.0011808764,0.92678106,0.010703343,0.0030698695,0.000048779522,0.00038823282],"about_ca_topic_score_codex":0.000058533515,"about_ca_topic_score_gemma":0.000034906407,"teacher_disagreement_score":0.22169237,"about_ca_system_score_codex":0.0001457673,"about_ca_system_score_gemma":0.000043242526,"threshold_uncertainty_score":0.6800241},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007603721105807031,"score_gpt":0.20409462311486684,"score_spread":0.1964909020090598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040337771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33639747,0.00026950033,0.6589228,0.0007250921,0.00053361576,0.00037341897,0.0000013988138,0.0013642958,0.0014124215],"genre_scores_gemma":[0.9780017,0.00002723837,0.021622522,0.000017624958,0.00003395366,0.000048733782,0.0000012220177,0.00001731978,0.0002296764],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898946,0.0000014727157,0.0001649594,0.0002989061,0.00014871988,0.00039647095],"domain_scores_gemma":[0.9994942,0.000011535992,0.000022973618,0.00034712764,0.0000616272,0.00006254459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024318934,0.00012433928,0.00011869776,0.0005718337,0.00017472629,0.00004095522,0.00050635106,0.00012864853,0.000010877081],"category_scores_gemma":[0.000011046645,0.00011848518,0.000032588083,0.0009457326,0.00036153602,0.00015593113,0.000025202346,0.00020472777,0.000021892698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029934877,0.000026209318,0.0000011348149,0.000023744911,0.0000012041365,4.3402966e-7,0.00016932024,0.3495212,0.42150602,0.004261132,0.00025683237,0.22422978],"study_design_scores_gemma":[0.00034496226,0.000032924378,0.00003131838,0.000008573121,0.000006990453,0.0000026192486,0.000060423296,0.94096303,0.025250874,0.0010253856,0.03212371,0.0001492025],"about_ca_topic_score_codex":7.91719e-7,"about_ca_topic_score_gemma":0.000016161679,"teacher_disagreement_score":0.64160424,"about_ca_system_score_codex":0.00005142355,"about_ca_system_score_gemma":0.00005405116,"threshold_uncertainty_score":0.48316854},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009548851398213244,"score_gpt":0.24388656642814702,"score_spread":0.23433771502993378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048683157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69240975,0.000051219227,0.30682957,0.000073429546,0.00013361382,0.000041557385,0.0000027820802,0.00038323933,0.00007484866],"genre_scores_gemma":[0.99530846,0.00001981611,0.0045943665,0.000004176856,0.000021563706,0.0000018141772,0.000002159536,0.00001420198,0.000033445318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993173,0.0000032523596,0.00016848024,0.0001817731,0.00009979093,0.00022943935],"domain_scores_gemma":[0.99962294,0.000043602362,0.00003007453,0.00021004362,0.00005124666,0.000042114254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000840098,0.00010008568,0.00014901308,0.00078837184,0.00012479216,0.000015076998,0.00018411096,0.0000757505,0.0000023092302],"category_scores_gemma":[0.000027913964,0.00010740172,0.000018031396,0.0010112514,0.0006028126,0.000209764,0.00006348796,0.00016910418,0.0000059894537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.8269136e-7,0.000008844161,0.020962166,0.000017372555,0.000007241358,0.000004003795,0.00017619757,0.94507843,0.009707339,0.00013877399,0.000005379225,0.023893453],"study_design_scores_gemma":[0.00008615789,0.000030500409,0.07886771,0.000022266762,0.0000053738363,0.000029819968,0.000022617403,0.91813636,0.0024754559,0.000098827455,0.00012283576,0.00010210393],"about_ca_topic_score_codex":0.000007936937,"about_ca_topic_score_gemma":0.000007655872,"teacher_disagreement_score":0.3028987,"about_ca_system_score_codex":0.00008151603,"about_ca_system_score_gemma":0.000020426873,"threshold_uncertainty_score":0.4379715},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012334009118767765,"score_gpt":0.25539375468939957,"score_spread":0.2430597455706318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109807708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98696566,0.00012562108,0.0017418044,0.00040177067,0.0005604522,0.00009057766,0.0000035087028,0.0013286939,0.008781916],"genre_scores_gemma":[0.9926704,0.000013205033,0.0071526673,0.000024498424,0.00006170106,0.000008296916,0.0000012408299,0.000020569267,0.000047378762],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985821,0.0000016045578,0.00023934695,0.00033677035,0.00021291898,0.00062724215],"domain_scores_gemma":[0.9992614,0.00004426186,0.00003320041,0.00046663714,0.00006441887,0.00013012833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036194717,0.00016505148,0.00021419257,0.00055520603,0.00027615723,0.000082139646,0.0008586992,0.00022395076,0.000039236093],"category_scores_gemma":[0.00017034468,0.00015184024,0.000035749243,0.0016619826,0.0015006317,0.00023380229,0.00015891969,0.00056709093,0.000085029875],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.896819e-7,0.000011224567,0.005564964,0.000015996595,0.000008131089,0.000008476549,0.000054461303,0.00020455803,0.97403234,0.007936985,0.000020793863,0.012141279],"study_design_scores_gemma":[0.00022896817,0.00004745229,0.017355287,0.000051984283,0.000028508844,0.00005058733,0.00016065176,0.07685508,0.87872046,0.0035793653,0.022435835,0.00048580873],"about_ca_topic_score_codex":0.00000821205,"about_ca_topic_score_gemma":0.00001664242,"teacher_disagreement_score":0.095311865,"about_ca_system_score_codex":0.000069282505,"about_ca_system_score_gemma":0.00007234586,"threshold_uncertainty_score":0.6191865},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03159143285073643,"score_gpt":0.2828868283690719,"score_spread":0.25129539551833546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144425137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078862555,0.00027174636,0.9134513,0.0024757227,0.0007440501,0.0009702076,0.000018219898,0.0030380497,0.00016810713],"genre_scores_gemma":[0.8438792,0.000009986066,0.15558024,0.00007927429,0.000026468642,0.00028494856,0.0000037762459,0.000018790743,0.00011728745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674433,0.00004058199,0.0003636348,0.0011965291,0.00052460044,0.0011303064],"domain_scores_gemma":[0.99651235,0.0002626679,0.00027480637,0.002142229,0.00069554395,0.000112419046],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014016738,0.0002967783,0.00039258835,0.0015602815,0.00074088766,0.00056696567,0.00539264,0.0002547757,0.0000053209224],"category_scores_gemma":[0.0014945825,0.00024587565,0.000035191886,0.0060650073,0.002522538,0.0023961405,0.001239037,0.00036598535,0.000111101675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014393683,0.00011804327,0.003577329,0.00006345151,0.000024516921,0.000037918006,0.00027115352,0.0011520655,0.06824885,0.87572426,0.0031231788,0.04764482],"study_design_scores_gemma":[0.0044227326,0.0043650637,0.010313761,0.00069945835,0.00005502901,0.0017186003,0.0044333525,0.5084109,0.15107815,0.22672597,0.08210862,0.005668389],"about_ca_topic_score_codex":0.00010737543,"about_ca_topic_score_gemma":0.00003417101,"teacher_disagreement_score":0.7650167,"about_ca_system_score_codex":0.00036046797,"about_ca_system_score_gemma":0.0003457754,"threshold_uncertainty_score":0.99999934},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006769209373159127,"score_gpt":0.22854287718139876,"score_spread":0.22177366780823965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2217296360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57652384,0.00009736943,0.4223791,0.00018378458,0.00003786175,0.000065096305,0.0000020627622,0.00032964096,0.0003812537],"genre_scores_gemma":[0.9641021,0.000016374033,0.035806227,0.00002738078,0.000010363506,0.000004605805,0.0000013440704,0.000012359623,0.00001928235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849176,0.0000060282628,0.00030712527,0.00033321543,0.00044941218,0.00041243286],"domain_scores_gemma":[0.9992545,0.00004476734,0.00007498467,0.00038205244,0.00015379883,0.00008985574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025457024,0.00014288074,0.00026593808,0.0026711167,0.00013622477,0.00003385889,0.00050938583,0.00014064604,0.000011470329],"category_scores_gemma":[0.0005982197,0.0001229715,0.000036746573,0.015436796,0.0012019244,0.00022447588,0.000103124985,0.00028537854,0.00001457424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002492834,0.00019846257,0.011807886,0.000038311973,0.00003088756,0.000039452374,0.00022474735,0.92259896,0.022074511,0.01569263,0.000004308783,0.027264908],"study_design_scores_gemma":[0.00082341814,0.00034994778,0.028315596,0.0000821603,0.000038646944,0.00006599395,0.00017284144,0.95149875,0.016247302,0.0016862237,0.00034721394,0.00037192315],"about_ca_topic_score_codex":0.000025864101,"about_ca_topic_score_gemma":0.000032810385,"teacher_disagreement_score":0.38757822,"about_ca_system_score_codex":0.00023469834,"about_ca_system_score_gemma":0.00018136083,"threshold_uncertainty_score":0.7416868},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.019347746646685506,"score_gpt":0.31530193905771525,"score_spread":0.29595419241102977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318541620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94354635,0.000020458481,0.0427927,0.0018558908,0.000022448628,0.000098249984,0.0000031905902,0.00020821451,0.011452502],"genre_scores_gemma":[0.9975684,0.0000013402085,0.0019814586,0.00006561629,0.000034297755,0.000018996423,8.155265e-7,0.000004021397,0.00032501083],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987396,0.000018798903,0.0001755189,0.0005109681,0.00019344217,0.00036167802],"domain_scores_gemma":[0.9991891,0.000057117973,0.00010669394,0.00049912604,0.00008500027,0.00006296254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002547422,0.00014269966,0.0003271862,0.0016147529,0.00024433935,0.00005201314,0.00043625044,0.00003966207,0.0002281323],"category_scores_gemma":[0.000008827835,0.00009378564,0.00007369206,0.0042698556,0.0016963715,0.00013602852,0.000211185,0.00010874521,0.000049871953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020357575,0.0001980498,0.40793437,0.0000014214055,0.00047952266,0.0000035665203,0.00060173386,0.000037978567,0.11069549,0.34101325,0.00092596735,0.13808827],"study_design_scores_gemma":[0.0014774908,0.0011336085,0.076570794,0.00016730986,0.0012833372,0.000009883936,0.0020136659,0.009860373,0.46013954,0.3980524,0.04742247,0.0018691246],"about_ca_topic_score_codex":0.000038155355,"about_ca_topic_score_gemma":0.000009923753,"teacher_disagreement_score":0.34944406,"about_ca_system_score_codex":0.00005358452,"about_ca_system_score_gemma":0.000042749958,"threshold_uncertainty_score":0.62503517},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017039256828064307,"score_gpt":0.27643318289038693,"score_spread":0.25939392606232264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W241339743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87876636,0.0003824819,0.035511043,0.081087194,0.000926677,0.00041974423,0.000003435484,0.0010973192,0.0018057332],"genre_scores_gemma":[0.9320539,0.0000043738623,0.06657133,0.00056330604,0.0000349109,0.000029426083,9.156619e-8,0.000012061998,0.0007305705],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964615,0.00003347382,0.00034725512,0.0007478171,0.0012070964,0.0012028264],"domain_scores_gemma":[0.9968169,0.00006691316,0.000165026,0.0021910525,0.00053101947,0.00022913552],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0020087508,0.00025283892,0.00031379884,0.00142833,0.00048372103,0.00013799217,0.006250773,0.00024754702,0.0000029141727],"category_scores_gemma":[0.0019858326,0.0001877716,0.000052332914,0.008931127,0.0027127701,0.00076560886,0.005221286,0.00042527012,0.00007923268],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011048333,0.00024431816,0.15893805,0.000021864198,0.000021123184,0.000009991939,0.0057010446,0.00020765964,0.116877615,0.3360117,0.013035611,0.36891997],"study_design_scores_gemma":[0.00064516836,0.00070226315,0.11958123,0.0001989128,0.000036894326,0.00049434626,0.001514655,0.0044778725,0.3961727,0.043221053,0.4315108,0.0014441054],"about_ca_topic_score_codex":0.000049481987,"about_ca_topic_score_gemma":0.000033515797,"teacher_disagreement_score":0.41847518,"about_ca_system_score_codex":0.00015290611,"about_ca_system_score_gemma":0.00020123484,"threshold_uncertainty_score":0.99953145},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021259431953329813,"score_gpt":0.3226243666990314,"score_spread":0.3013649347457016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790068678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62367696,0.0000034440488,0.3746321,0.00017595314,0.00014043179,0.00013460375,0.0000018617931,0.00028609883,0.00094858056],"genre_scores_gemma":[0.99420136,2.8031198e-7,0.0054963906,0.00006249485,0.00018859906,0.000017745024,0.0000021308126,0.00001306856,0.000017906832],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982764,0.00015237062,0.00029497058,0.00040330333,0.0003241176,0.0005488045],"domain_scores_gemma":[0.99861115,0.00010189024,0.00016012469,0.0008517639,0.00018652678,0.00008851647],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0010640026,0.00018744964,0.00027312912,0.00087395764,0.001523425,0.000080443126,0.000887153,0.00009720666,0.00025149225],"category_scores_gemma":[0.00007205984,0.00017859254,0.000092569215,0.0029075975,0.0034109757,0.00015574093,0.00027590457,0.0006518886,0.000047576974],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036469736,0.0007025782,0.039252367,0.0000095703845,0.000048145528,0.000004643705,0.0004587429,0.0023256412,0.79010975,0.03628111,0.00009924838,0.1303435],"study_design_scores_gemma":[0.0005663707,0.0003481329,0.0004039998,0.00003379745,0.00003403187,0.0000037208417,0.00013587774,0.5700725,0.40527737,0.02162093,0.0012451448,0.000258153],"about_ca_topic_score_codex":0.0004305665,"about_ca_topic_score_gemma":0.000031499516,"teacher_disagreement_score":0.5677468,"about_ca_system_score_codex":0.00013776489,"about_ca_system_score_gemma":0.00018060532,"threshold_uncertainty_score":0.9997765},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01066192649364501,"score_gpt":0.2645979031093727,"score_spread":0.2539359766157277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220735151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064148465,0.000034852263,0.9905484,0.0009985475,0.00011502309,0.00055690785,0.0000059921135,0.00026862547,0.001056849],"genre_scores_gemma":[0.9128327,5.845792e-7,0.08628104,0.000032975837,0.000064308355,0.00060870993,0.000012024694,0.000009411632,0.00015829109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892384,0.000016991342,0.00019652494,0.00031775728,0.00023145929,0.00031341644],"domain_scores_gemma":[0.99932134,0.000054538632,0.00016654613,0.00035841065,0.000080746184,0.000018401119],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007219869,0.000095158284,0.00012101056,0.00038963716,0.0014724348,0.00006401193,0.0006920801,0.000021183618,0.00008396319],"category_scores_gemma":[0.000008451314,0.000080398044,0.00005584191,0.0021934789,0.00036023048,0.00015302023,0.00042588744,0.00020914116,0.000003060608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035765838,0.000047268393,0.0016239957,0.000001932502,0.000014925707,1.3149821e-7,0.00023005856,0.013654024,0.0060304697,0.05402075,0.00027596636,0.9240969],"study_design_scores_gemma":[0.00014052255,0.00005965428,0.0001105493,0.000004049346,0.00001971039,0.0000030005845,0.0006802873,0.9345064,0.002512882,0.053980857,0.007870701,0.000111396206],"about_ca_topic_score_codex":0.000040179122,"about_ca_topic_score_gemma":0.0000024939438,"teacher_disagreement_score":0.9239855,"about_ca_system_score_codex":0.0001345782,"about_ca_system_score_gemma":0.000080104735,"threshold_uncertainty_score":0.9998275},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.044420153622856326,"score_gpt":0.27174426727092,"score_spread":0.22732411364806365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385332647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73069954,0.000020211708,0.0043161088,0.103867486,0.0017288261,0.0016267017,0.000021101649,0.0057609645,0.15195908],"genre_scores_gemma":[0.996661,0.000006568929,0.0004878831,0.0013820099,0.00007546311,0.00003305036,0.000053073854,0.00001580886,0.0012851346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979452,0.0000033695435,0.0002060746,0.00077505194,0.0004998828,0.0005704174],"domain_scores_gemma":[0.99859816,0.0000059416466,0.000077010634,0.0011569787,0.0001451175,0.000016793461],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006680935,0.000167381,0.00014171416,0.0019335329,0.0004675347,0.00020242886,0.0017571056,0.00006043219,0.000112600756],"category_scores_gemma":[0.00015092299,0.00013427419,0.000017532871,0.0064207306,0.00091562123,0.0012292955,0.001189375,0.00016003444,0.0030375037],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016241558,0.00079625996,0.0563838,0.00042016603,0.000098843295,0.0001374436,0.0004556632,0.011836536,0.004544827,0.64342993,0.097413145,0.18432096],"study_design_scores_gemma":[0.0012128665,0.00012623797,0.007128071,0.00015352717,0.00004724477,0.0000040954374,0.0042701685,0.09140862,0.00045993263,0.009351,0.8850314,0.00080686825],"about_ca_topic_score_codex":0.00012149692,"about_ca_topic_score_gemma":0.00015908631,"teacher_disagreement_score":0.7876182,"about_ca_system_score_codex":0.00006801219,"about_ca_system_score_gemma":0.00005864659,"threshold_uncertainty_score":0.9977387},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.025300504575868934,"score_gpt":0.26909489866672925,"score_spread":0.24379439409086032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386041537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36715198,0.000033290235,0.61678344,0.009857308,0.0012089107,0.00029817643,0.0000056093772,0.0031901975,0.0014711196],"genre_scores_gemma":[0.95742756,0.000005930439,0.04192271,0.00031821436,0.00004408208,0.00006214336,0.0000017906103,0.000013562092,0.00020399969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965762,0.000035784233,0.00033168908,0.0012011171,0.0006642762,0.001190961],"domain_scores_gemma":[0.9978609,0.000071722236,0.000072286966,0.001513785,0.00024824182,0.00023302781],"candidate_categories":["metaepi_narrow","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0013017625,0.00024616145,0.0002885966,0.004023801,0.0012560348,0.00038312163,0.0035080395,0.00012906741,0.000018008597],"category_scores_gemma":[0.0004298534,0.0002507454,0.000095237236,0.021912057,0.0021495675,0.0007269792,0.0018422764,0.00037788748,0.0006809539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048275324,0.000092416674,0.0011787856,0.000013659424,0.000015515288,0.00018457366,0.0013322079,0.00092129956,0.11535995,0.60965407,0.00046958154,0.27077314],"study_design_scores_gemma":[0.0012874248,0.0010937279,0.018137207,0.00024965938,0.000033607128,0.0016100735,0.004504402,0.33009484,0.12655573,0.4656685,0.048146963,0.0026178649],"about_ca_topic_score_codex":0.000045813318,"about_ca_topic_score_gemma":0.000020294678,"teacher_disagreement_score":0.5902756,"about_ca_system_score_codex":0.00017721369,"about_ca_system_score_gemma":0.00039405195,"threshold_uncertainty_score":0.99999446},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07534615194663036,"score_gpt":0.3292923692686234,"score_spread":0.253946217321993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386041553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13299407,0.00007475216,0.8587419,0.0055650403,0.00032347738,0.00046520337,0.0000014845316,0.0017718672,0.00006223518],"genre_scores_gemma":[0.75009,0.0000148310855,0.24958037,0.00018030856,0.000043243403,0.000057097433,0.0000033760823,0.000014849173,0.000015898171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978127,0.000025624948,0.0003511261,0.0008440767,0.00016954142,0.000796918],"domain_scores_gemma":[0.9987324,0.00008496834,0.00009999591,0.00070412183,0.00027054833,0.00010797882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110405,0.0002120666,0.0002749663,0.00087951816,0.0009774234,0.00037491682,0.0015648495,0.00013253043,7.928125e-7],"category_scores_gemma":[0.00004625693,0.0001852577,0.00003152446,0.0044424403,0.000296975,0.00063747645,0.0010058966,0.00022677741,0.0000070866527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027697986,0.00027642964,0.04128259,0.0002964889,0.00009993825,0.000077655204,0.007102538,0.019841928,0.009512718,0.15536399,0.0009879832,0.76513004],"study_design_scores_gemma":[0.00022055347,0.00013801851,0.00041504172,0.00018063403,0.0000064947526,0.00012423123,0.00027594768,0.994655,0.00093014434,0.0023611041,0.00043494484,0.0002578487],"about_ca_topic_score_codex":0.000044475455,"about_ca_topic_score_gemma":0.00057998556,"teacher_disagreement_score":0.9748131,"about_ca_system_score_codex":0.000089119036,"about_ca_system_score_gemma":0.000110264824,"threshold_uncertainty_score":0.75545895},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01857924213785202,"score_gpt":0.27978680528301986,"score_spread":0.26120756314516785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399849664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01991025,0.0006399946,0.96305144,0.007158425,0.0010044047,0.00023635227,0.0000025102174,0.0025928782,0.0054037436],"genre_scores_gemma":[0.8239562,0.000025361254,0.17503047,0.00023456961,0.00004542043,0.000020045594,0.0000013896894,0.000013611071,0.00067296927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974211,0.000026083373,0.00027827718,0.0010288298,0.00054035004,0.0007053447],"domain_scores_gemma":[0.99865437,0.000040119452,0.000063198415,0.0010041264,0.00014010875,0.00009807949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008283941,0.00020014308,0.00018021748,0.001999247,0.00054363953,0.0007528062,0.0026475654,0.00012243792,0.000041467585],"category_scores_gemma":[0.000054533437,0.00018756445,0.000063258725,0.009806574,0.0017837669,0.0013398223,0.0009509811,0.00037925306,0.00018920796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.388174e-7,0.00002982392,0.00006492736,0.000014873209,0.0000050599215,0.00003445531,0.00019775105,0.0011392685,0.011363967,0.93654364,0.000059808117,0.05054577],"study_design_scores_gemma":[0.00017534541,0.000115703435,0.00011159143,0.00008129513,0.000006588998,0.00016755705,0.00013351992,0.44590488,0.023430185,0.50951695,0.019984733,0.00037164483],"about_ca_topic_score_codex":0.000031206266,"about_ca_topic_score_gemma":0.0000143333955,"teacher_disagreement_score":0.8040459,"about_ca_system_score_codex":0.00019060183,"about_ca_system_score_gemma":0.00041750667,"threshold_uncertainty_score":0.76486564},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10000094816469142,"score_gpt":0.4008223774677241,"score_spread":0.3008214293030327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402153668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85266924,0.00006751797,0.13587916,0.0074705044,0.00027822226,0.0005215851,0.000012281658,0.00057372765,0.0025277366],"genre_scores_gemma":[0.9926437,0.0000017273962,0.0060812896,0.00013910877,0.00007243836,0.00014105729,0.0000032451755,0.00001885858,0.0008985409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971802,0.000041453437,0.0004006421,0.0010454907,0.0008077366,0.00052443234],"domain_scores_gemma":[0.99758446,0.0010475849,0.00015529967,0.0007962641,0.00032255016,0.000093825605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028308847,0.00020551935,0.00024672263,0.0017155645,0.00057490444,0.0007790806,0.0015326533,0.00013840132,0.00005174248],"category_scores_gemma":[0.0018503444,0.00013885609,0.000061780505,0.006070146,0.0018178892,0.0008261493,0.00016820892,0.0003254281,0.00019457785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004832336,0.000054608932,0.00015272759,0.000007931955,0.000007028778,0.0000023470527,0.00022723006,0.0051983045,0.23658349,0.5378491,0.00016921714,0.2196997],"study_design_scores_gemma":[0.00033380432,0.0006067894,0.00047384604,0.00017683585,0.000018752009,0.0000507783,0.0022609548,0.10622535,0.3005308,0.57230794,0.016614141,0.00040002682],"about_ca_topic_score_codex":0.0000065452437,"about_ca_topic_score_gemma":0.000010109174,"teacher_disagreement_score":0.21929967,"about_ca_system_score_codex":0.00010399323,"about_ca_system_score_gemma":0.00043559136,"threshold_uncertainty_score":0.7512692},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014688613871405324,"score_gpt":0.29413361081516287,"score_spread":0.2794449969437576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402449838","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5597385,0.001799238,0.41372848,0.01942736,0.0013089661,0.00035370042,0.0000042236043,0.0020541782,0.0015853293],"genre_scores_gemma":[0.97270036,0.000028015022,0.026979765,0.00010194093,0.00002300592,0.000048891576,5.3335066e-7,0.0000069729163,0.00011049309],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980995,0.000031927644,0.00028672957,0.0007689882,0.00026597633,0.0005468881],"domain_scores_gemma":[0.99891907,0.00012753275,0.00006211236,0.00072978734,0.00010944359,0.000052053427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079851865,0.00014727861,0.0001873305,0.0015866203,0.00026152577,0.00037005125,0.0018729133,0.00012387922,0.0000046821906],"category_scores_gemma":[0.0003233077,0.00013286524,0.00002711265,0.008024347,0.0012159592,0.00092688313,0.00055651285,0.00025825624,0.00013769274],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017675815,0.00004217787,0.0008630886,0.000016309963,0.0000043282676,0.0000635998,0.0028224792,0.000054390934,0.57517123,0.34275442,0.000057912104,0.07814827],"study_design_scores_gemma":[0.00036668847,0.00033778246,0.0066751023,0.00022153098,0.000009018215,0.00012674053,0.0039818594,0.36765712,0.496097,0.11427667,0.009480979,0.0007694914],"about_ca_topic_score_codex":0.000059889036,"about_ca_topic_score_gemma":0.00011750526,"teacher_disagreement_score":0.41296184,"about_ca_system_score_codex":0.00019118888,"about_ca_system_score_gemma":0.00047085487,"threshold_uncertainty_score":0.5418087},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010435708302929282,"score_gpt":0.23778928449261688,"score_spread":0.2273535761896876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405179551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11553201,0.0003135008,0.8806991,0.0007066496,0.0006301997,0.0001498252,0.0000018602515,0.0007131505,0.001253735],"genre_scores_gemma":[0.95113045,0.000012145394,0.04872009,0.000053228225,0.00002315744,0.000007048466,8.197094e-7,0.000007762748,0.0000452948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982012,0.000017713694,0.00023866507,0.0006516271,0.00048623138,0.0004045611],"domain_scores_gemma":[0.99903953,0.00004165486,0.00009342929,0.00061358244,0.00015545644,0.000056356657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005647022,0.00014871446,0.00018039574,0.0016010634,0.00027683462,0.00022218999,0.0011379849,0.00010489432,0.000032095926],"category_scores_gemma":[0.000069860755,0.00012763732,0.000041868836,0.006900207,0.0022303916,0.0010127962,0.00032181302,0.00023878862,0.000017517865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057719753,0.00004370207,0.00093582773,0.0000426703,0.000016950395,0.000027971104,0.0003829568,0.00037152227,0.05202951,0.7831249,0.000027251728,0.16299096],"study_design_scores_gemma":[0.000730984,0.0011050531,0.004248524,0.000668318,0.000052222946,0.00066898356,0.0004844381,0.5378739,0.16386361,0.28406674,0.0054221554,0.0008150465],"about_ca_topic_score_codex":0.000010444678,"about_ca_topic_score_gemma":0.000004134265,"teacher_disagreement_score":0.83559847,"about_ca_system_score_codex":0.00009077378,"about_ca_system_score_gemma":0.00031719953,"threshold_uncertainty_score":0.8217971},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007105163409990493,"score_gpt":0.276988987768301,"score_spread":0.2698838243583105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408100306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022928225,0.00012880465,0.96965647,0.00026282607,0.00033621778,0.00029241483,0.000002062312,0.00482399,0.0015690183],"genre_scores_gemma":[0.6405739,0.000027122229,0.3588114,0.000032050677,0.00003456257,0.00019742384,0.000005055657,0.000017612803,0.00030086475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883616,0.0000066329067,0.00023853629,0.00036322622,0.00015143237,0.00040403835],"domain_scores_gemma":[0.9994396,0.000039046008,0.000052462634,0.00030127892,0.00013528937,0.00003233916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026318448,0.00014627645,0.00021584143,0.0016183091,0.00029485763,0.00005916622,0.00040064374,0.00016433724,0.0000038094165],"category_scores_gemma":[0.0002108612,0.00014836396,0.00004894619,0.005750401,0.00039888662,0.00038165617,0.00007743136,0.00020064366,0.0000046129167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029148475,0.00003141398,0.0001892073,0.00003293575,0.000019496243,0.0000010024758,0.00003983402,0.0016006083,0.33605543,0.008340277,0.00020700575,0.6534799],"study_design_scores_gemma":[0.0001275284,0.000040094146,0.000093014314,0.00004275402,0.000021483993,0.0000059652216,0.00011089801,0.68754965,0.2786469,0.024118783,0.009065102,0.0001778486],"about_ca_topic_score_codex":0.000007697258,"about_ca_topic_score_gemma":0.0000061803457,"teacher_disagreement_score":0.685949,"about_ca_system_score_codex":0.0004941345,"about_ca_system_score_gemma":0.000041542567,"threshold_uncertainty_score":0.6050107},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0505621800898568,"score_gpt":0.341973125649909,"score_spread":0.2914109455600522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408100312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9532753,0.000039047176,0.014635906,0.018894227,0.0005827651,0.00080173096,0.000004453875,0.0011116382,0.010654895],"genre_scores_gemma":[0.9979681,0.000015562975,0.001560566,0.00010869607,0.00010200114,0.000080353646,0.000002659061,0.000008181179,0.00015388028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790436,0.00025392158,0.00021815106,0.00041087728,0.0005471424,0.0006655372],"domain_scores_gemma":[0.9987942,0.00009507137,0.00015795848,0.0006201455,0.0002607822,0.00007185889],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0021328102,0.00015350846,0.00020923186,0.0013629452,0.0069291936,0.00024029029,0.0021327094,0.00031070408,0.000023499737],"category_scores_gemma":[0.0035306064,0.00014522945,0.00003461567,0.006412132,0.005501627,0.0009339458,0.00093233836,0.0009442925,0.000027984743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018283997,0.0006950911,0.02006607,0.0000967424,0.00005267101,0.000015040688,0.10875627,0.00001847669,0.05987129,0.6528022,0.0017083061,0.15573497],"study_design_scores_gemma":[0.0026597113,0.0006422664,0.029152893,0.00048050043,0.00013025492,0.000037820962,0.10094329,0.0006113808,0.07556099,0.4763037,0.3118954,0.0015817778],"about_ca_topic_score_codex":0.0022521259,"about_ca_topic_score_gemma":0.0042151585,"teacher_disagreement_score":0.3101871,"about_ca_system_score_codex":0.0006453645,"about_ca_system_score_gemma":0.0009609381,"threshold_uncertainty_score":0.99720484},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030928151230502576,"score_gpt":0.30623043885356516,"score_spread":0.2753022876230626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412030713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007281811,0.00007843921,0.96818644,0.013454876,0.0005312984,0.00052798307,0.0000012325295,0.0015397763,0.008398166],"genre_scores_gemma":[0.86668193,0.0000125424385,0.127823,0.00021293407,0.000019302946,0.0002305687,0.000002883373,0.000008269245,0.0050085885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980843,0.000046243,0.00033488215,0.0007720282,0.00019331965,0.0005692095],"domain_scores_gemma":[0.99876845,0.000118856005,0.00017498335,0.0005853774,0.00029989245,0.00005245786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013258663,0.00017973571,0.00025595163,0.0015073337,0.0007262476,0.00029547,0.0019109859,0.00016614523,0.000011965626],"category_scores_gemma":[0.0005126502,0.00016546184,0.00006448004,0.003624643,0.0005347658,0.0007123028,0.00055928866,0.00026328562,0.000009702594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070097735,0.000042122287,0.0011016437,0.000023439954,0.000009455078,7.962896e-7,0.00044416412,0.0000060217394,0.019735359,0.7498035,0.002229343,0.22659719],"study_design_scores_gemma":[0.00088062696,0.00047106404,0.00032073745,0.00015983201,0.000012269559,0.000024236251,0.0003791321,0.03495053,0.08524838,0.1050577,0.7720385,0.00045698925],"about_ca_topic_score_codex":0.000022055317,"about_ca_topic_score_gemma":0.000011756896,"teacher_disagreement_score":0.8594001,"about_ca_system_score_codex":0.00019351192,"about_ca_system_score_gemma":0.00033706197,"threshold_uncertainty_score":0.6747338},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.008832630618471901,"score_gpt":0.26443466713381514,"score_spread":0.25560203651534324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417225581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40891927,0.00011932429,0.5902507,0.00035754582,0.000093847935,0.00009815558,0.0000030782262,0.00010739278,0.000050728042],"genre_scores_gemma":[0.9952285,0.000020156893,0.0046672774,0.000016663951,0.0000033161627,0.00003725572,0.000001272789,0.0000054004136,0.000020136367],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994316,0.000008026415,0.00013799092,0.00017203238,0.000070982554,0.00017938168],"domain_scores_gemma":[0.9996159,0.0001398011,0.0000071603695,0.00013301401,0.00007176024,0.00003235011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015305926,0.00008343337,0.00014304969,0.00050064345,0.00015308787,0.000035976263,0.00008584337,0.00008867061,0.0000128277225],"category_scores_gemma":[0.00011022736,0.00008274232,0.000013832102,0.00075653946,0.0012816602,0.00014923692,0.000014714779,0.00010128658,6.827452e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016703942,0.000049868475,0.0002490762,0.000023815744,0.000021306952,0.0000015358285,0.00013609177,0.005352278,0.97215873,0.01811291,0.000009661212,0.0038680125],"study_design_scores_gemma":[0.0007118451,0.00011560361,0.00013893392,0.00002224861,0.000060407336,0.000013790001,0.0001791274,0.9286626,0.060792003,0.009168079,0.00003331413,0.000102041486],"about_ca_topic_score_codex":0.00000506582,"about_ca_topic_score_gemma":0.0000021732578,"teacher_disagreement_score":0.92331034,"about_ca_system_score_codex":0.000029374283,"about_ca_system_score_gemma":0.000046499463,"threshold_uncertainty_score":0.47223303},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012604189947561475,"score_gpt":0.26411813457691535,"score_spread":0.2515139446293539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66789461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3574343,0.000042830583,0.6237135,0.010159871,0.0009316819,0.0005589706,7.571366e-7,0.0009615861,0.0061965073],"genre_scores_gemma":[0.9213149,3.989599e-7,0.07750676,0.00073888805,0.000058139398,0.00006663602,3.7783224e-7,0.000014968244,0.00029892608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967258,0.000040853945,0.00038325434,0.0011293133,0.0006071688,0.0011136023],"domain_scores_gemma":[0.99801147,0.00010106866,0.00021700158,0.0012676955,0.00023769667,0.0001650615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020477476,0.00025394198,0.0002827902,0.0011279033,0.0009970301,0.00037315564,0.003528003,0.0001410104,0.0000037846428],"category_scores_gemma":[0.0006313269,0.00022840772,0.00010473547,0.003123771,0.0013488955,0.00006069361,0.0017898664,0.00027048998,0.000038407125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010136117,0.00023458667,0.00020615185,0.0000470832,0.000020314517,0.0000105048875,0.0032107753,0.043208648,0.015223282,0.3181488,0.000963229,0.6187165],"study_design_scores_gemma":[0.00054792286,0.00032824057,0.00022986227,0.00008398313,0.000009392415,0.00005461415,0.00055614475,0.9501351,0.011856727,0.0055720853,0.030220063,0.00040582207],"about_ca_topic_score_codex":0.000015835198,"about_ca_topic_score_gemma":0.0000015947337,"teacher_disagreement_score":0.9069265,"about_ca_system_score_codex":0.00024579247,"about_ca_system_score_gemma":0.00020042474,"threshold_uncertainty_score":0.9314197},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.15482746084436322,"score_gpt":0.4612913278443817,"score_spread":0.3064638670000185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116896472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34642863,0.000023213706,0.6498527,0.0025085162,0.00027345328,0.00023471902,0.000013511307,0.00023828456,0.00042696611],"genre_scores_gemma":[0.6869401,0.0000014936802,0.31284174,0.00014992351,0.000008558378,0.000014091622,0.0000043725145,0.000005637508,0.00003407586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653745,0.00010330479,0.0005158455,0.0012851992,0.0010860665,0.00047212318],"domain_scores_gemma":[0.99605006,0.00016140583,0.00030350906,0.00293092,0.0004783318,0.00007575436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002894485,0.00019100563,0.00031555438,0.0014941688,0.00031795315,0.00013674964,0.005304031,0.00019717297,0.000005720117],"category_scores_gemma":[0.002720698,0.00019626915,0.00003645552,0.003924253,0.0005664367,0.0015892424,0.002778344,0.00038183387,0.000011549077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076089777,0.00003654567,0.00038951577,0.000004135194,0.000009073088,3.3829568e-7,0.0005023296,0.74458927,0.105569676,0.022654176,0.000056396704,0.12618093],"study_design_scores_gemma":[0.00022379191,0.00002290683,0.00048995094,0.000032649095,0.000022917444,0.0000011615862,0.00014595756,0.90669054,0.014753042,0.07742348,0.000029205425,0.00016441346],"about_ca_topic_score_codex":0.00036951771,"about_ca_topic_score_gemma":0.00004057737,"teacher_disagreement_score":0.34051147,"about_ca_system_score_codex":0.000419701,"about_ca_system_score_gemma":0.0012003225,"threshold_uncertainty_score":0.98562974},"labels":[],"label_agreement":null}]}