{"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012417076,0.25870872,0.7098012,0.0011526247,0.0006799883,0.0003143234,0.00078205176,0.0029257047,0.013218406],"genre_scores_gemma":[0.08696256,0.31444874,0.5766205,0.001163812,0.0016511371,0.0004612622,0.0039765206,0.0013596093,0.013355908],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889576,0.00012464696,0.0001409417,0.00029645933,0.00048208446,0.00006008112],"domain_scores_gemma":[0.99869895,0.00046933896,0.00011356287,0.00011309748,0.0005604477,0.000044448283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012250766,0.00161491,0.0016422097,0.005947905,0.0006167191,0.0016851929,0.0020385173,0.0017969452,0.0025959837],"category_scores_gemma":[0.0028388733,0.0008312664,0.0018460997,0.005915557,0.00061605085,0.0017344359,0.00066104316,0.0009162072,0.0032873016],"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.00010971305,0.000060399663,0.0011643912,0.0023881574,0.00013278687,0.00017991864,0.00009738697,0.0054180473,0.011825337,0.0017875389,0.008347611,0.96848875],"study_design_scores_gemma":[0.00009855544,0.0006662257,0.02139236,0.0032870886,0.0014295228,0.014575358,0.00064412993,0.31662288,0.12066993,0.015306046,0.50476325,0.00054460636],"about_ca_topic_score_codex":0.0032865785,"about_ca_topic_score_gemma":0.002957356,"teacher_disagreement_score":0.005947905,"about_ca_system_score_codex":0.0005764584,"about_ca_system_score_gemma":0.001183357,"threshold_uncertainty_score":0.008684456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032733522,0.17831975,0.6634809,0.01685321,0.0027915551,0.00024988785,0.000100759804,0.000659725,0.10481069],"genre_scores_gemma":[0.5126152,0.24931619,0.21721411,0.0033306277,0.0049579004,0.00065214257,0.00020430742,0.0002450463,0.011464593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823135,0.00049753423,0.000118130396,0.00021911599,0.0007840689,0.0001497795],"domain_scores_gemma":[0.9957703,0.002721718,0.0002795336,0.000438846,0.0006699123,0.00011958794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002606333,0.0008815369,0.0006941682,0.0016637318,0.001100404,0.0027936234,0.0012860745,0.0015154702,0.0022951192],"category_scores_gemma":[0.00812886,0.00047939867,0.0004898606,0.0027736549,0.0019344579,0.009291717,0.0018884805,0.002292498,0.00059827603],"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.000031559626,0.000051000145,0.0007279268,0.00084339426,0.000030624306,0.00021307555,0.00042141066,0.031019557,0.0040286384,0.76455534,0.005317633,0.1927598],"study_design_scores_gemma":[0.000029922703,0.00020868736,0.000839972,0.0010220086,0.00006153938,0.00053615257,0.00051525136,0.17587854,0.005837469,0.65023476,0.16476063,0.00007507129],"about_ca_topic_score_codex":0.0008378126,"about_ca_topic_score_gemma":0.0007613407,"teacher_disagreement_score":0.0027936234,"about_ca_system_score_codex":0.0014935028,"about_ca_system_score_gemma":0.0010828695,"threshold_uncertainty_score":0.013783753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9744217,0.00047538267,0.02211008,0.000289372,0.000030090285,0.00005263512,0.00045914378,0.0005166649,0.0016449583],"genre_scores_gemma":[0.99352574,0.00016991684,0.0054842685,0.00002153651,0.000012187374,0.000019349147,0.00034622662,0.000048744336,0.00037211616],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855727,0.00042539957,0.00007104064,0.0003017219,0.0004725064,0.00017203932],"domain_scores_gemma":[0.99473697,0.0023554603,0.000653124,0.0009016723,0.0010319934,0.0003207172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012606586,0.00029281285,0.0006257077,0.0022265774,0.00075635716,0.0011126428,0.00084934925,0.0007239332,0.0004603511],"category_scores_gemma":[0.01171261,0.00034550758,0.0002828705,0.0013466098,0.0008339158,0.0023387915,0.0013000439,0.000676465,0.00027699326],"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.0015636976,0.0007556721,0.42311504,0.00083348504,0.0004384355,0.0046673976,0.013878475,0.14828816,0.10490935,0.043869253,0.0120943235,0.24558674],"study_design_scores_gemma":[0.00006108422,0.0003142507,0.15246598,0.000098302764,0.00010972323,0.002309842,0.003984557,0.77709264,0.026462631,0.025616495,0.011359615,0.00012488209],"about_ca_topic_score_codex":0.0035199127,"about_ca_topic_score_gemma":0.0026924736,"teacher_disagreement_score":0.0035199127,"about_ca_system_score_codex":0.00060264586,"about_ca_system_score_gemma":0.00051352725,"threshold_uncertainty_score":0.0069988966},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053811878,0.0073672864,0.92308545,0.0022250484,0.0006262259,0.00024585318,0.00011995636,0.00036221233,0.012156179],"genre_scores_gemma":[0.84009093,0.006805258,0.14451298,0.00092982483,0.0006562327,0.0003962131,0.00011937923,0.0002676102,0.006221556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639434,0.0015439542,0.00021340273,0.00044803822,0.00089328084,0.00050706044],"domain_scores_gemma":[0.9812329,0.013853589,0.0014428559,0.00081631367,0.0018799035,0.0007744902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008067141,0.0015354143,0.001432622,0.0014392773,0.0018841702,0.0029128941,0.0025674235,0.0012796177,0.002819506],"category_scores_gemma":[0.02292192,0.0010118913,0.00052435417,0.0013508886,0.0017413326,0.005887702,0.0019910517,0.002113535,0.0004541321],"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.0005702568,0.00013959105,0.0012228873,0.00069020945,0.000060385057,0.00026480888,0.0005476446,0.55116045,0.0056946687,0.34939513,0.005968312,0.08428565],"study_design_scores_gemma":[0.00007640321,0.00021235058,0.00024673186,0.000120691664,0.00004562418,0.00012982106,0.00018172145,0.86478,0.0029722755,0.1213482,0.009836275,0.000049989798],"about_ca_topic_score_codex":0.0028179083,"about_ca_topic_score_gemma":0.0027146097,"teacher_disagreement_score":0.008067141,"about_ca_system_score_codex":0.0030467687,"about_ca_system_score_gemma":0.0023409496,"threshold_uncertainty_score":0.042663634},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08660026,0.000547367,0.905806,0.001702342,0.00006375523,0.00014139673,0.00004859085,0.0003070714,0.004783095],"genre_scores_gemma":[0.9639285,0.00043976598,0.03463698,0.00013962378,0.000033075117,0.00004059232,0.00003849359,0.00001153873,0.00073135615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749243,0.0010937923,0.000115471244,0.00026941384,0.00078363944,0.00024526176],"domain_scores_gemma":[0.99176896,0.005354737,0.0010562585,0.0007915939,0.00084341515,0.00018496107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027608671,0.0005365507,0.00082783337,0.0010739629,0.0008233281,0.0020181485,0.0009577993,0.0017579074,0.0008469393],"category_scores_gemma":[0.012109886,0.00029054287,0.00059361284,0.0009065506,0.0015069835,0.0059851026,0.0016214278,0.001857418,0.00020720394],"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.0003760254,0.0003091614,0.020768106,0.0003841281,0.0001203353,0.0009068644,0.0011637947,0.43266132,0.017735587,0.32977828,0.0052072178,0.19058919],"study_design_scores_gemma":[0.000006706614,0.000088111105,0.001440105,0.00004484842,0.00001986765,0.0003393095,0.00026420414,0.94463825,0.004625909,0.046825353,0.0016781741,0.00002909206],"about_ca_topic_score_codex":0.0014503857,"about_ca_topic_score_gemma":0.0016073303,"teacher_disagreement_score":0.0027608671,"about_ca_system_score_codex":0.0013710702,"about_ca_system_score_gemma":0.0008404596,"threshold_uncertainty_score":0.014601052},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37080386,0.00033102557,0.6229737,0.00006752982,0.000012759585,0.000030356789,0.000094651834,0.00023667462,0.0054494403],"genre_scores_gemma":[0.971856,0.0004166017,0.026311707,0.000011018615,0.000008996923,0.000022098187,0.000073417126,0.000027199645,0.0012728852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999231,0.000018665785,0.0000031678992,0.000013433719,0.000031685533,0.0000098437595],"domain_scores_gemma":[0.9998022,0.00010782801,0.000024457126,0.000023553946,0.000033819237,0.000008231408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016643554,0.00027416646,0.00029293515,0.00056486955,0.00017153949,0.0003288933,0.00026001062,0.0003500279,0.0010833261],"category_scores_gemma":[0.00033631863,0.00014446028,0.00030733406,0.0002494974,0.00033992133,0.00041112537,0.00020067403,0.00015295972,0.00013839403],"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.00012920049,0.000042798547,0.0037150776,0.0001557616,0.000032871536,0.00019492253,0.00018202318,0.86094093,0.06801398,0.005021634,0.00019980548,0.061370995],"study_design_scores_gemma":[0.0000066991643,0.00006414815,0.005738841,0.000014111894,0.000009441725,0.00012136805,0.0001567737,0.983889,0.00785709,0.0012159774,0.0009116486,0.0000149424195],"about_ca_topic_score_codex":0.001088932,"about_ca_topic_score_gemma":0.0011010891,"teacher_disagreement_score":0.001088932,"about_ca_system_score_codex":0.00016678585,"about_ca_system_score_gemma":0.0001679353,"threshold_uncertainty_score":0.003624022},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11768957,0.00049546873,0.8534973,0.00044610837,0.00018570121,0.00011801412,0.0015013344,0.0005986596,0.02546781],"genre_scores_gemma":[0.9413779,0.0005806663,0.028536502,0.00013442394,0.00009325974,0.00027068544,0.00097038574,0.00013487776,0.027901325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996176,0.00007444106,0.000013674014,0.00010467311,0.00010968519,0.000079921585],"domain_scores_gemma":[0.9996922,0.00007771455,0.000056581906,0.00003785396,0.00010474415,0.000030883213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002859451,0.0006368956,0.000674878,0.0006898094,0.00053679675,0.001124796,0.0025201172,0.0013552131,0.0038523853],"category_scores_gemma":[0.0009731728,0.0003332146,0.0008818406,0.00095976517,0.00060334266,0.0018596301,0.00063509593,0.0009906777,0.00095318333],"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.000015159451,0.000013482273,0.00044287648,0.000013244622,0.000011336496,0.00010894589,0.00005948862,0.961846,0.0010757466,0.03296133,0.00080257654,0.0026499138],"study_design_scores_gemma":[0.0000052532832,0.000011173366,0.00012887422,0.0000021328015,0.000006839756,0.000050748808,0.000010294929,0.9946689,0.00011874079,0.0037080445,0.0012814067,0.00000757417],"about_ca_topic_score_codex":0.018068405,"about_ca_topic_score_gemma":0.009115369,"teacher_disagreement_score":0.018068405,"about_ca_system_score_codex":0.0014375069,"about_ca_system_score_gemma":0.0009254479,"threshold_uncertainty_score":0.03592646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97579896,0.00006501982,0.016315479,0.000081525824,0.000019420377,0.000026378433,0.0001966005,0.00014472555,0.0073518343],"genre_scores_gemma":[0.9953825,0.00003659656,0.0028840313,0.000013472589,0.0000026880832,0.000034239147,0.00012527315,0.000014117335,0.0015070551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999889,0.000035681962,0.0000051046504,0.000014686015,0.000027898703,0.00002754936],"domain_scores_gemma":[0.9995178,0.00033816663,0.00003390367,0.000022676179,0.00004967919,0.00003776083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025627483,0.00036449084,0.00046790685,0.00037541392,0.0003708491,0.00037901112,0.0005879063,0.00092664035,0.003605612],"category_scores_gemma":[0.00079701695,0.00025435493,0.00032372616,0.0003726217,0.00046061203,0.0004252791,0.0004771313,0.00046690417,0.00018588196],"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.000048390644,0.00004044181,0.0011618115,0.000015850355,0.000012340985,0.00008359871,0.000051998435,0.9944442,0.0020608874,0.00090289186,0.00011141759,0.0010661],"study_design_scores_gemma":[0.0000060504326,0.000021288768,0.00037721303,0.0000013503918,0.0000020053062,0.0000061864107,0.00001814428,0.9990459,0.0002943216,0.00013562693,0.00008982519,0.0000019951578],"about_ca_topic_score_codex":0.007527152,"about_ca_topic_score_gemma":0.0063042627,"teacher_disagreement_score":0.007527152,"about_ca_system_score_codex":0.00042899905,"about_ca_system_score_gemma":0.0004273808,"threshold_uncertainty_score":0.014966667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73781216,0.0009216764,0.2516717,0.000230302,0.00021785349,0.00014558123,0.00006036514,0.00045249987,0.008487836],"genre_scores_gemma":[0.94948876,0.0002836288,0.047786128,0.000042468208,0.000028468716,0.000055274795,0.000027201564,0.000013787422,0.002274247],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99967754,0.00006235141,0.00001577083,0.00005762231,0.00014158933,0.000045214812],"domain_scores_gemma":[0.99963737,0.00012605256,0.00007874631,0.00008152267,0.000053785392,0.000022520457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041673836,0.00064370065,0.00037365916,0.00025032135,0.0002636842,0.0003938618,0.00086920586,0.0006042986,0.00082271284],"category_scores_gemma":[0.0006130715,0.00033329276,0.00036270055,0.00019698996,0.00045180955,0.0005691699,0.0006794297,0.00043152497,0.00020495451],"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.0000813311,0.00009010314,0.00034805253,0.00015515409,0.000031079355,0.00028192365,0.00010484883,0.017722925,0.953115,0.015662083,0.00016104388,0.012246426],"study_design_scores_gemma":[0.0000862401,0.0005215104,0.0010453245,0.000016149144,0.000042852982,0.00052890595,0.00003647417,0.3060066,0.68170947,0.0046091257,0.0053218105,0.00007554763],"about_ca_topic_score_codex":0.00017454084,"about_ca_topic_score_gemma":0.00024202737,"teacher_disagreement_score":0.00086920586,"about_ca_system_score_codex":0.00030251217,"about_ca_system_score_gemma":0.0001632625,"threshold_uncertainty_score":0.002752304},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010191176,0.8570648,0.09954415,0.0015891508,0.00068505463,0.00012910705,0.00024027276,0.00025903952,0.030297281],"genre_scores_gemma":[0.07521387,0.8767469,0.04024231,0.0005110915,0.0014229816,0.00015330844,0.0003999023,0.00008238457,0.005227299],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936634,0.00011993514,0.000059018977,0.000089511894,0.00031323003,0.000052043793],"domain_scores_gemma":[0.9985234,0.0009547945,0.00008765753,0.00010641659,0.00029611375,0.000031641663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007364152,0.00074405485,0.0008040403,0.002459621,0.0005804451,0.001472226,0.0011148194,0.0011831959,0.0032848949],"category_scores_gemma":[0.0021549936,0.00050664076,0.0005975688,0.0037535746,0.0009293796,0.0030427696,0.00097494584,0.0014365709,0.0011775572],"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.000092218055,0.00012883595,0.0011736483,0.0065374463,0.00006654828,0.00020729186,0.00032076624,0.01768808,0.007471722,0.12043479,0.017497184,0.82838154],"study_design_scores_gemma":[0.00004928168,0.0006669309,0.0025979606,0.0032270798,0.00015846892,0.0036207763,0.00053167756,0.12171045,0.021309657,0.110802464,0.73508334,0.00024192076],"about_ca_topic_score_codex":0.0015908404,"about_ca_topic_score_gemma":0.0007560685,"teacher_disagreement_score":0.0032848949,"about_ca_system_score_codex":0.00088264677,"about_ca_system_score_gemma":0.0012434775,"threshold_uncertainty_score":0.01098907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9540079,0.00014590104,0.041852918,0.00010391201,0.000017674924,0.000012244346,0.000017231945,0.00006434107,0.0037778313],"genre_scores_gemma":[0.9975413,0.00004708111,0.0015330738,0.000005993957,0.0000040859572,0.000005440287,0.0000098743,0.0000047070894,0.00084845186],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999285,0.000015169743,0.0000029619605,0.0000141696155,0.000023524168,0.000015726213],"domain_scores_gemma":[0.99988854,0.000042403237,0.000029212966,0.00001416043,0.00001349678,0.000012232109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018581515,0.00028101786,0.00020802388,0.00030247497,0.00020839114,0.0003116356,0.00031123505,0.00039060347,0.000809607],"category_scores_gemma":[0.0004309478,0.00013141807,0.0001978319,0.00015914209,0.0006571737,0.00042714702,0.00036019855,0.00021258228,0.00014842139],"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.0004938041,0.00010673215,0.0033457018,0.00015583957,0.00003330666,0.0013242449,0.0009710296,0.15253675,0.78470486,0.031566307,0.00044848467,0.024312902],"study_design_scores_gemma":[0.000014522611,0.00015636168,0.0019503054,0.000008151102,0.0000063619027,0.00015022361,0.00012445415,0.96172756,0.032234557,0.0031219444,0.000489078,0.000016477838],"about_ca_topic_score_codex":0.00027582952,"about_ca_topic_score_gemma":0.00020173607,"teacher_disagreement_score":0.000809607,"about_ca_system_score_codex":0.00013981355,"about_ca_system_score_gemma":0.00007850718,"threshold_uncertainty_score":0.002708435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.937702,0.0028950702,0.008160838,0.0016136076,0.000100594865,0.00007138375,0.009571881,0.00033752032,0.039547153],"genre_scores_gemma":[0.99194264,0.00069784385,0.0014376773,0.000057522448,0.00007528761,0.000038791455,0.0037441123,0.00006876346,0.0019372427],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990496,0.0003264754,0.000050088493,0.00011231243,0.00032566252,0.00013588755],"domain_scores_gemma":[0.9894671,0.007150572,0.0010121695,0.0004637487,0.0015387279,0.00036775076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012506614,0.00026742416,0.000330267,0.0069281384,0.000987838,0.0011666201,0.00025830916,0.00041663667,0.0037288317],"category_scores_gemma":[0.010396876,0.00014531879,0.00037453024,0.0098144915,0.0005120348,0.0027593644,0.00065292045,0.0003525618,0.00067168486],"study_design_candidate":"observational","study_design_consensus":"observational","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.0009681306,0.00013236082,0.712144,0.0007464909,0.00036864117,0.0019967398,0.0049923426,0.037841424,0.0031390907,0.0711815,0.0358065,0.1306827],"study_design_scores_gemma":[0.000022262528,0.0001461979,0.6568926,0.00024607158,0.00014596246,0.0011950769,0.007046171,0.23660679,0.0024814778,0.015701411,0.0793813,0.0001346607],"about_ca_topic_score_codex":0.01016389,"about_ca_topic_score_gemma":0.010587553,"teacher_disagreement_score":0.01016389,"about_ca_system_score_codex":0.001048284,"about_ca_system_score_gemma":0.00033393266,"threshold_uncertainty_score":0.020209491},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022851784,0.35940862,0.13213226,0.28699744,0.0057688584,0.00019952949,0.00038895497,0.00067046186,0.19158214],"genre_scores_gemma":[0.48846337,0.33606052,0.097822234,0.028413706,0.017330414,0.0006974346,0.00034710098,0.00092461973,0.02994053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9844364,0.0069473186,0.00061699667,0.0028550893,0.0043799854,0.00076411426],"domain_scores_gemma":[0.95142394,0.03575703,0.0011163622,0.004884469,0.005014617,0.001803555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019230094,0.0012138798,0.0025063416,0.0036456299,0.0040940517,0.014793933,0.0034419405,0.008656335,0.006562403],"category_scores_gemma":[0.04778759,0.0012915166,0.0010058192,0.003893252,0.033292964,0.045127597,0.007107605,0.013201393,0.0029851783],"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.0000721945,0.000047885922,0.0004087625,0.0004892452,0.000027872564,0.00012620362,0.0015657482,0.0015178784,0.00024223853,0.93043786,0.009399499,0.05566453],"study_design_scores_gemma":[0.000034139153,0.000079156765,0.00044980284,0.0010460683,0.000019936906,0.00017440824,0.001246314,0.0047373325,0.00036392757,0.7169992,0.2747823,0.000067352936],"about_ca_topic_score_codex":0.0038203218,"about_ca_topic_score_gemma":0.0017667187,"teacher_disagreement_score":0.019230094,"about_ca_system_score_codex":0.0074145156,"about_ca_system_score_gemma":0.005794939,"threshold_uncertainty_score":0.10169971},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031623032,0.00010505125,0.9670497,0.000052479183,0.000013823832,0.00007684746,0.0000432679,0.00047798952,0.0005579089],"genre_scores_gemma":[0.5060196,0.00012923645,0.4918686,0.00006901766,0.000028826456,0.00021395984,0.00029401487,0.00009002648,0.0012867271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837863,0.0004920086,0.000080500155,0.00037817654,0.0005370819,0.0001336387],"domain_scores_gemma":[0.99526924,0.0023151615,0.0005442072,0.00047305474,0.0011671868,0.00023112644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001827897,0.0007029819,0.00095730036,0.0035512098,0.0008366641,0.00096908095,0.0013970588,0.00080016017,0.00084512786],"category_scores_gemma":[0.008462743,0.00034803344,0.0009044592,0.0017626717,0.00085179484,0.0018173817,0.0016654601,0.0008287976,0.00030519877],"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.00030704273,0.0001871157,0.011419107,0.00027482086,0.00025178064,0.0004246858,0.000621854,0.608454,0.024221601,0.040594146,0.0027292958,0.31051463],"study_design_scores_gemma":[0.00000501248,0.000013714817,0.00032826405,0.000003268016,0.000006208848,0.000034265748,0.000013584839,0.99445856,0.0013169592,0.003597217,0.00021490299,0.000007954577],"about_ca_topic_score_codex":0.0050969976,"about_ca_topic_score_gemma":0.0045533744,"teacher_disagreement_score":0.0050969976,"about_ca_system_score_codex":0.0006627897,"about_ca_system_score_gemma":0.0009670311,"threshold_uncertainty_score":0.010134697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010341039,0.0004638669,0.9814601,0.000563461,0.000113609036,0.00015671678,0.00036364407,0.0008948775,0.005642641],"genre_scores_gemma":[0.15771808,0.00058591506,0.83022815,0.0005734931,0.00018885947,0.0006904682,0.002672472,0.00047044433,0.0068720784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984542,0.0004041861,0.00007072338,0.00036163212,0.00042632344,0.00028287678],"domain_scores_gemma":[0.9968641,0.0015639438,0.00026551748,0.0005242004,0.00057840184,0.00020400512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019727375,0.002141874,0.0019579048,0.0016929375,0.0013175388,0.0018793261,0.0031854028,0.0028198562,0.010255947],"category_scores_gemma":[0.009922018,0.0007399716,0.0014651784,0.003421499,0.000896791,0.0035045259,0.0032982768,0.002895806,0.003537286],"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.000480925,0.000330917,0.0017617955,0.00048429077,0.00012243539,0.00022662833,0.00028229016,0.62992865,0.0025605643,0.09317156,0.038473286,0.2321767],"study_design_scores_gemma":[0.00007433261,0.00004497121,0.00016366289,0.000022515187,0.000017256687,0.00009778649,0.000052206888,0.94767183,0.0003967012,0.048478063,0.0029688121,0.000011973656],"about_ca_topic_score_codex":0.0066035553,"about_ca_topic_score_gemma":0.008369571,"teacher_disagreement_score":0.010255947,"about_ca_system_score_codex":0.0021673383,"about_ca_system_score_gemma":0.0034366387,"threshold_uncertainty_score":0.034309506},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05153985,0.0003706962,0.9441848,0.0013442658,0.00012748504,0.000116895404,0.00018486819,0.0005442586,0.0015869183],"genre_scores_gemma":[0.7542613,0.00044521003,0.23928398,0.00041479222,0.00026577935,0.0002196157,0.00042995383,0.00022326568,0.0044560526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945868,0.0016413741,0.00022426955,0.0015007552,0.00095679297,0.0010899453],"domain_scores_gemma":[0.9803344,0.012655618,0.0015299862,0.0023490377,0.0020539095,0.0010770628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009118616,0.0013589303,0.0029696925,0.0014038847,0.003185197,0.0028739243,0.005114969,0.0030353998,0.0028446203],"category_scores_gemma":[0.031871345,0.0006232124,0.0015130341,0.0025909562,0.0032028563,0.0074565485,0.003908453,0.0031917137,0.0004857217],"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.0010897951,0.00022446574,0.002352979,0.00018815925,0.00012830709,0.00026906983,0.00038376267,0.77787775,0.0016515921,0.16023399,0.008553167,0.047046985],"study_design_scores_gemma":[0.000050615035,0.0000443763,0.0002069327,0.0000070611773,0.00001562149,0.00005721351,0.00009012519,0.8942547,0.0009990454,0.10354242,0.0007121036,0.000019852876],"about_ca_topic_score_codex":0.0068237735,"about_ca_topic_score_gemma":0.004042216,"teacher_disagreement_score":0.009118616,"about_ca_system_score_codex":0.003209284,"about_ca_system_score_gemma":0.0036669213,"threshold_uncertainty_score":0.04822445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051013127,0.00091444486,0.9399795,0.0009882797,0.000090251524,0.00012719192,0.00039196556,0.00036423656,0.0061310166],"genre_scores_gemma":[0.74664575,0.0013630729,0.2401986,0.00048129703,0.00037491086,0.00040035762,0.0005199079,0.00041890074,0.009597319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997686,0.0010029705,0.00006677277,0.00051172083,0.0003616071,0.00037102215],"domain_scores_gemma":[0.99188316,0.0061144135,0.000604662,0.00058630505,0.00040407042,0.0004073858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049160635,0.0028227523,0.0030580186,0.001039722,0.00069428893,0.0023257579,0.0026397351,0.0017530752,0.0044594714],"category_scores_gemma":[0.0121695,0.0006787433,0.0011715853,0.0024312146,0.0014449836,0.005007613,0.0020298297,0.0022449743,0.00081734103],"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.00039826886,0.00026063548,0.00095731596,0.0004429895,0.00014263284,0.00017321977,0.00012331054,0.7724376,0.0038085862,0.15110436,0.0059623257,0.064188845],"study_design_scores_gemma":[0.000023550272,0.00007631745,0.00014491598,0.000015011981,0.00001632363,0.00006489442,0.000021115544,0.9231208,0.0010450027,0.07471689,0.0007438855,0.000011286018],"about_ca_topic_score_codex":0.0017806479,"about_ca_topic_score_gemma":0.0015642033,"teacher_disagreement_score":0.0049160635,"about_ca_system_score_codex":0.0029790548,"about_ca_system_score_gemma":0.0021365006,"threshold_uncertainty_score":0.02599889},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17548987,0.0021083143,0.8173436,0.0010983931,0.000094797215,0.000056086064,0.00074063265,0.0005996505,0.0024687178],"genre_scores_gemma":[0.92619324,0.00086897373,0.06658184,0.0002506815,0.00009442759,0.00007435743,0.0008340838,0.000038429433,0.0050639394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997192,0.00008061678,0.000013589805,0.00009968629,0.000042327214,0.000044607215],"domain_scores_gemma":[0.9995289,0.0002562918,0.00006481129,0.000046146542,0.00007147855,0.00003234388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006274308,0.00063059013,0.00064559974,0.00070842507,0.0003030283,0.0006194244,0.0012874508,0.001012221,0.0007648767],"category_scores_gemma":[0.0015953097,0.00044193192,0.00082006765,0.0010248149,0.00030022854,0.0014069558,0.00048753008,0.001313867,0.0003816103],"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.00018057712,0.00014598861,0.0071782777,0.00005698108,0.00012919045,0.00012815636,0.00009517343,0.9244113,0.0023157967,0.005187329,0.0019784998,0.058192767],"study_design_scores_gemma":[0.0000012909239,0.0000065663276,0.00024547224,0.0000011700392,0.0000047708036,0.000008202596,0.0000026043283,0.9988618,0.0000725656,0.0006807991,0.00011285442,0.0000020135517],"about_ca_topic_score_codex":0.02577008,"about_ca_topic_score_gemma":0.033344246,"teacher_disagreement_score":0.02577008,"about_ca_system_score_codex":0.0010362017,"about_ca_system_score_gemma":0.0004807798,"threshold_uncertainty_score":0.051240146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027805427,0.0029035215,0.9488866,0.0016495622,0.00025603225,0.0005284563,0.0019801345,0.00072011893,0.0152702965],"genre_scores_gemma":[0.46265906,0.00419158,0.49928558,0.001459268,0.0006644559,0.0017512393,0.0048568705,0.000803192,0.024328802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960756,0.001755738,0.0001651985,0.00091368717,0.00050375034,0.00058607844],"domain_scores_gemma":[0.9964992,0.002069622,0.00033466908,0.0003158392,0.00043539068,0.00034530117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040949793,0.0029411889,0.004024968,0.0013949071,0.0010934252,0.0030247862,0.0027128637,0.0029373122,0.009953207],"category_scores_gemma":[0.006392166,0.0011891082,0.0020903691,0.0044575813,0.0011839377,0.0041847965,0.0025492134,0.002888003,0.00213136],"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.00068371004,0.00052680465,0.0013096821,0.0020478573,0.000368903,0.0006220396,0.00023378177,0.76434195,0.003994956,0.07310472,0.040114835,0.11265071],"study_design_scores_gemma":[0.000087454886,0.00020117914,0.00044083243,0.00006473956,0.00007157485,0.0002128538,0.00009877931,0.9230369,0.0016128557,0.06840757,0.0057150307,0.00005021307],"about_ca_topic_score_codex":0.0033135044,"about_ca_topic_score_gemma":0.0037042124,"teacher_disagreement_score":0.009953207,"about_ca_system_score_codex":0.0019798912,"about_ca_system_score_gemma":0.0027981407,"threshold_uncertainty_score":0.033296764},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13903771,0.00041772306,0.83237016,0.0009395127,0.00008622867,0.00034111727,0.00020643206,0.00011203304,0.026489131],"genre_scores_gemma":[0.8886953,0.00052233203,0.09939694,0.00025878675,0.00011090704,0.00081674184,0.00016439684,0.000042465315,0.009992183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654996,0.0019098716,0.00016778355,0.00041332416,0.00050910655,0.00045005468],"domain_scores_gemma":[0.99258476,0.005610184,0.0007318022,0.00019770082,0.0004444529,0.00043105116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030024913,0.002080242,0.0018909465,0.0012765384,0.0010157456,0.0026453629,0.0017242047,0.001818537,0.0034586755],"category_scores_gemma":[0.011804979,0.0006485837,0.0014209868,0.001041765,0.0026435708,0.0039367513,0.001866344,0.0019374249,0.00039532883],"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.00020397933,0.00014310915,0.0008141072,0.0001791796,0.00011586646,0.00029472692,0.00026557318,0.25408354,0.0017437323,0.73420674,0.001158936,0.006790531],"study_design_scores_gemma":[0.000080938495,0.00007801504,0.00022284266,0.000021243435,0.000021858135,0.00007253591,0.00007468196,0.72088027,0.0004203271,0.27703917,0.0010554583,0.000032665237],"about_ca_topic_score_codex":0.0040839734,"about_ca_topic_score_gemma":0.0030482986,"teacher_disagreement_score":0.0040839734,"about_ca_system_score_codex":0.0030989954,"about_ca_system_score_gemma":0.0021862264,"threshold_uncertainty_score":0.022484899},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04949202,0.00021361577,0.94661534,0.0002275032,0.00004608324,0.00014486961,0.000070479015,0.00043595655,0.0027540573],"genre_scores_gemma":[0.75876725,0.00025985902,0.23824129,0.00017109765,0.000059112288,0.00019254223,0.000358252,0.00008566855,0.0018649414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.993554,0.0015940279,0.00048773456,0.0012795347,0.0022622994,0.00082240754],"domain_scores_gemma":[0.9906136,0.0036359334,0.0009868176,0.00062817964,0.0036946,0.0004409336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059983274,0.0012369356,0.0020833483,0.004114286,0.0029842574,0.0026484167,0.0020554469,0.0018220043,0.002536187],"category_scores_gemma":[0.019815598,0.00051547075,0.0015816408,0.0033221706,0.001291246,0.004791275,0.002292015,0.001246666,0.0003579898],"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.00036640585,0.00039396642,0.009189949,0.0003703191,0.00013027091,0.00023166032,0.00090807,0.592763,0.004811776,0.02759157,0.0038857104,0.35935733],"study_design_scores_gemma":[0.000024179359,0.000084706226,0.0010160769,0.000020501802,0.00004151237,0.00003926311,0.0001849607,0.98691654,0.0015883616,0.009001998,0.0010521457,0.000029710474],"about_ca_topic_score_codex":0.035442885,"about_ca_topic_score_gemma":0.01892738,"teacher_disagreement_score":0.035442885,"about_ca_system_score_codex":0.002884993,"about_ca_system_score_gemma":0.00510174,"threshold_uncertainty_score":0.070473194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011857511,0.0008527858,0.9843962,0.00031429672,0.00007026827,0.00011618372,0.00023663217,0.00039178217,0.0017644579],"genre_scores_gemma":[0.39856744,0.0017602073,0.5915769,0.0005247619,0.00017540882,0.00076202373,0.0011300932,0.00034716283,0.0051560123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984914,0.00051737425,0.00008025536,0.0004569085,0.00022631655,0.00022781572],"domain_scores_gemma":[0.99726355,0.0018976774,0.000294956,0.0001908386,0.00020204147,0.00015094905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022985952,0.0023852603,0.0034257912,0.00095017895,0.00064360554,0.0015842814,0.002452525,0.0015789218,0.005430687],"category_scores_gemma":[0.0051017734,0.0009438072,0.0014400512,0.0031212945,0.0009806621,0.0029103237,0.0018178221,0.0024923105,0.00096434035],"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.00021770824,0.00015831302,0.0007089281,0.0003954315,0.00010849723,0.00013116302,0.00006525855,0.90601164,0.0015068614,0.018358959,0.005395571,0.06694156],"study_design_scores_gemma":[0.000023761304,0.000050405062,0.00010569672,0.000011727125,0.000011980339,0.000027676913,0.000019865225,0.99007916,0.0005084341,0.008627423,0.0005237782,0.000010112249],"about_ca_topic_score_codex":0.007589586,"about_ca_topic_score_gemma":0.0075666024,"teacher_disagreement_score":0.007589586,"about_ca_system_score_codex":0.0019311998,"about_ca_system_score_gemma":0.0025240171,"threshold_uncertainty_score":0.018167496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010554381,0.0003182486,0.98404735,0.00025077027,0.00011320751,0.00008017585,0.000115037765,0.0008629956,0.003657741],"genre_scores_gemma":[0.18908395,0.00032426268,0.8057367,0.0002848863,0.000089910325,0.00024484322,0.0004456665,0.00016075383,0.0036289769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910766,0.00020117898,0.000049880036,0.00018723763,0.00028759163,0.00016640147],"domain_scores_gemma":[0.9990472,0.000478551,0.00008500402,0.00015386281,0.00015728522,0.0000779834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000998166,0.001082756,0.0014423357,0.00076771074,0.0007498812,0.0012126444,0.0012772876,0.0012086504,0.0058056717],"category_scores_gemma":[0.0031220068,0.00038523768,0.0008329807,0.0012718606,0.0005810512,0.0012589139,0.0015041592,0.002230109,0.0012663576],"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.0003530468,0.00025691674,0.00065427733,0.00017603186,0.000053366875,0.00015346716,0.00011369656,0.6611617,0.0047665937,0.03685553,0.013935617,0.28151977],"study_design_scores_gemma":[0.000047214682,0.000057818197,0.00006747459,0.000014137374,0.0000064264746,0.00005707825,0.000029651823,0.9829395,0.0010699515,0.013945346,0.0017546893,0.000010711695],"about_ca_topic_score_codex":0.0037811014,"about_ca_topic_score_gemma":0.004080226,"teacher_disagreement_score":0.0058056717,"about_ca_system_score_codex":0.0010765063,"about_ca_system_score_gemma":0.0018142177,"threshold_uncertainty_score":0.019421875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03471691,0.00018495705,0.9624353,0.00038651525,0.000031005493,0.00027283444,0.00016309349,0.00059397705,0.0012154173],"genre_scores_gemma":[0.5925782,0.00013640133,0.40441084,0.00015101362,0.00007054051,0.0002442559,0.0003476592,0.000057392586,0.0020038306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994389,0.0017408682,0.0002469355,0.0011306427,0.0020513153,0.00044117446],"domain_scores_gemma":[0.9870302,0.00458601,0.0017143703,0.004418896,0.0017802498,0.00047032937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003547946,0.0006801646,0.0010912794,0.0029889913,0.0016943419,0.0016478898,0.0020939938,0.0015645898,0.00092776323],"category_scores_gemma":[0.013695125,0.00045086947,0.001144681,0.0021062803,0.0014958441,0.00447258,0.0045247725,0.0014636514,0.0004458765],"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.0007335972,0.0006892145,0.026123151,0.00053230295,0.00030042438,0.0007110898,0.0030525504,0.11003712,0.07076674,0.10367725,0.005301642,0.67807496],"study_design_scores_gemma":[0.000044811462,0.00019775421,0.0037176716,0.00004327313,0.0000552356,0.0008449745,0.0009116943,0.88320816,0.033983633,0.06993945,0.00697868,0.00007462892],"about_ca_topic_score_codex":0.0020822869,"about_ca_topic_score_gemma":0.0024473835,"teacher_disagreement_score":0.003547946,"about_ca_system_score_codex":0.0010381636,"about_ca_system_score_gemma":0.0017897119,"threshold_uncertainty_score":0.018763602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12604916,0.0019170803,0.86597645,0.0003440973,0.00005881277,0.000095390846,0.0014314926,0.0019271236,0.00220029],"genre_scores_gemma":[0.8706129,0.00075355277,0.12403594,0.00022547718,0.00006068728,0.000061839986,0.002355886,0.00009010957,0.001803586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911076,0.00031175747,0.00004522867,0.00028902834,0.00016940667,0.00007383712],"domain_scores_gemma":[0.99813485,0.0009977644,0.0001712164,0.00041183288,0.00021078462,0.00007353595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001035617,0.0010236416,0.0012991929,0.002265557,0.00036352282,0.0007469239,0.0010788369,0.0011258879,0.0012371248],"category_scores_gemma":[0.0040439423,0.00053431536,0.0009860368,0.0031204727,0.00040008576,0.002464268,0.0007358477,0.0014284076,0.0008660804],"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.00080995605,0.00073390926,0.032567702,0.00045889107,0.0008032619,0.00022675068,0.00044523887,0.3419496,0.012588275,0.010702995,0.012128858,0.5865846],"study_design_scores_gemma":[0.000017662773,0.00010595702,0.0033250456,0.00001767777,0.00007013946,0.00009198343,0.000059629252,0.98121244,0.0013636503,0.012389121,0.0013216863,0.00002491905],"about_ca_topic_score_codex":0.011710734,"about_ca_topic_score_gemma":0.029357748,"teacher_disagreement_score":0.011710734,"about_ca_system_score_codex":0.0007916213,"about_ca_system_score_gemma":0.00057855336,"threshold_uncertainty_score":0.02328515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08065966,0.0003783142,0.9123341,0.0003048817,0.00004720027,0.00020911513,0.00006485044,0.0007201342,0.005281788],"genre_scores_gemma":[0.922741,0.00017208024,0.075487785,0.00007293336,0.000013073376,0.00036053298,0.00008897452,0.00014473511,0.0009188669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921274,0.00025100037,0.000053826112,0.00014445555,0.0002221508,0.000115793126],"domain_scores_gemma":[0.9972869,0.0014567222,0.00040594547,0.00016405435,0.00059869746,0.000087653745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002662538,0.0013301667,0.00068421307,0.0008521119,0.00055071607,0.0012927554,0.00065436785,0.0009169587,0.0021098987],"category_scores_gemma":[0.009343709,0.0004518069,0.00051451405,0.0002670346,0.0012533935,0.0010877023,0.0010541008,0.0011246749,0.00043408334],"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.00018051229,0.00008080126,0.0013158355,0.00024690875,0.000034787034,0.00013934747,0.00015250403,0.9436307,0.016321369,0.013560279,0.0008437505,0.023493247],"study_design_scores_gemma":[0.00001691917,0.00007414649,0.00019484854,0.000016486545,0.000005889603,0.000013869935,0.000021772537,0.9916053,0.006242311,0.0013975913,0.0004001845,0.000010527146],"about_ca_topic_score_codex":0.0025910435,"about_ca_topic_score_gemma":0.0012787136,"teacher_disagreement_score":0.002662538,"about_ca_system_score_codex":0.00088559854,"about_ca_system_score_gemma":0.0018577088,"threshold_uncertainty_score":0.014081001},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07301011,0.0009342174,0.91541415,0.0014879232,0.0002133795,0.00016654377,0.000092395494,0.002348871,0.006332409],"genre_scores_gemma":[0.85063803,0.0004510297,0.14584321,0.0003005494,0.00010012722,0.000091771035,0.00012668631,0.00025902013,0.002189607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999456,0.000108522705,0.000018811985,0.000078598554,0.00021834722,0.000119716766],"domain_scores_gemma":[0.99932706,0.00016105316,0.000047382382,0.000089896064,0.00028327643,0.00009126427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009833388,0.0008216501,0.0006286195,0.0005873537,0.0011886706,0.0011997164,0.002105028,0.000647947,0.0010229284],"category_scores_gemma":[0.0019200579,0.00037866135,0.00040035223,0.0008203302,0.00050923997,0.001595401,0.0014068633,0.0010114373,0.0003173847],"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.0005468986,0.0005604154,0.0046666693,0.0005118268,0.00018410159,0.00043039862,0.00061704055,0.52514213,0.06366208,0.02971043,0.023295622,0.3506724],"study_design_scores_gemma":[0.000042649597,0.00013923753,0.0010451868,0.000018236751,0.000034470184,0.000119257784,0.00032777604,0.9566136,0.015152142,0.017844804,0.008632155,0.0000304344],"about_ca_topic_score_codex":0.0043947916,"about_ca_topic_score_gemma":0.005948928,"teacher_disagreement_score":0.0043947916,"about_ca_system_score_codex":0.0007726428,"about_ca_system_score_gemma":0.0016541485,"threshold_uncertainty_score":0.008738458},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5816902,0.0018694787,0.4090821,0.0016815307,0.00017269177,0.00024793923,0.0003651864,0.0013874514,0.0035034649],"genre_scores_gemma":[0.97586006,0.00011449919,0.023424847,0.00010341832,0.000022890275,0.000034278582,0.00014233465,0.000072477844,0.00022518841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9907879,0.0051513696,0.00055673614,0.0008958908,0.002067315,0.0005407341],"domain_scores_gemma":[0.8932444,0.0822528,0.0058454517,0.013162932,0.004364915,0.0011294717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016741555,0.0015081752,0.001075493,0.0011008201,0.00054031564,0.0016164551,0.0009961388,0.001470784,0.001098953],"category_scores_gemma":[0.106338166,0.00039629874,0.00071428734,0.0006312949,0.0022659139,0.0036391858,0.0023014182,0.0027243984,0.00022133828],"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.0015661643,0.00022244266,0.014211575,0.00024711055,0.00026839,0.00015147167,0.00013161493,0.907728,0.006628472,0.011963534,0.0015144721,0.055366796],"study_design_scores_gemma":[0.000024751063,0.00024875003,0.0011210139,0.000033077307,0.000026043419,0.000062685234,0.000034069864,0.9873518,0.005234836,0.005605428,0.0002377164,0.000019858455],"about_ca_topic_score_codex":0.0016129944,"about_ca_topic_score_gemma":0.0012725779,"teacher_disagreement_score":0.016741555,"about_ca_system_score_codex":0.0016068699,"about_ca_system_score_gemma":0.0011568519,"threshold_uncertainty_score":0.088538885},"labels":[],"label_agreement":null}]}