{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"9bc7e87df1f8","filters":{"venue":"系统科学与系统工程学报(英文版)"}},"results":[{"id":"W2361742132","doi":"","title":"LOT SIZING WITH NON-ZERO SETUP TIMES FOR REWORK","year":2008,"lang":"en","type":"article","venue":"系统科学与系统工程学报(英文版)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Rework; Sizing; Scheduling (production processes); Product (mathematics); Batch production; Production (economics); Computer science; Reliability engineering; Mathematical optimization; Engineering; Operations management; Mathematics; Economics","authors":[{"name":"PO Box","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01094142889652282,"gpt":0.2012722213406203,"spread":0.1903307924440975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001073259,0.0002298923,0.0002429831,0.000102493,0.0001965889,0.000041265,0.0001731295,0.0001229257,0.0000993292],"category_scores_gemma":[0.00003862453,0.0002104768,0.00007475349,0.0003074302,0.00005114809,0.0001493271,0.00001918014,0.0001727102,0.0001194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004709866,"about_ca_system_score_gemma":0.00003552164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001439842,"about_ca_topic_score_gemma":0.000006931141,"domain_scores_codex":[0.9989408,0.000009331557,0.0002301754,0.0002503608,0.000187634,0.000381674],"domain_scores_gemma":[0.9993424,0.0001019151,0.00004057665,0.0003063634,0.00008415569,0.0001246087],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001355655,0.0001159709,0.002698975,0.0002452409,0.0003112372,0.00007928986,0.005112317,0.9367922,0.0005626632,0.0006355286,0.04283256,0.01047845],"study_design_scores_gemma":[0.003015408,0.0003012488,0.001471903,0.0002652406,0.00009556218,0.0001550362,0.0005272368,0.9514859,0.01108577,0.0003004972,0.03005283,0.001243322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1022066,0.001062845,0.8776935,0.0002659921,0.001005962,0.0006290358,0.00003625897,0.001686717,0.01541303],"genre_scores_gemma":[0.6239603,0.0001407277,0.3718783,0.000228974,0.0004095326,0.0000955626,0.00006259499,0.0001435858,0.003080493],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5217536,"threshold_uncertainty_score":0.8582996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2356668080","doi":"","title":"URBAN TRANSIT ASSIGNMENT MODEL BASED ON AUGMENTED NETWORK WITH IN-VEHICLE CONGESTION AND TRANSFER CONGESTION","year":2011,"lang":"en","type":"article","venue":"系统科学与系统工程学报(英文版)","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Transit (satellite); Computer science; Urban transit; Traffic congestion; Transfer (computing); Transport engineering; Path (computing); Mathematical optimization; Public transport; Simulation; Computer network; Engineering; Mathematics","authors":[{"name":"Moe Key","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02722335887137216,"gpt":0.232615456467935,"spread":0.2053920975965629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000431797,0.0001502996,0.000159633,0.0000958271,0.0002799789,0.0000373233,0.00007864769,0.0001392455,0.00009044282],"category_scores_gemma":[0.00001107487,0.000141787,0.0000276301,0.000284924,0.0001401265,0.0002177072,0.000001377733,0.0001507006,0.000004589954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006899737,"about_ca_system_score_gemma":0.0001018359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000853666,"about_ca_topic_score_gemma":0.003629791,"domain_scores_codex":[0.9987103,0.0001397834,0.0002188334,0.0002961573,0.0003383247,0.0002966359],"domain_scores_gemma":[0.9995887,0.00006309786,0.00004304912,0.0001116061,0.00006428782,0.0001292421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00142401,0.0004079442,0.1263632,0.00003380517,0.00003332939,0.00002667037,0.05897673,0.782277,0.0001086764,0.02427808,0.0006048871,0.005465618],"study_design_scores_gemma":[0.005824183,0.0008834397,0.4517201,0.0005254869,0.0001680233,0.000001079772,0.003599773,0.5339855,0.0004512495,0.0007025482,0.001325743,0.0008128804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7240958,0.0001248199,0.2514285,0.001323115,0.0001877271,0.0009218905,0.00002990238,0.0003160544,0.02157229],"genre_scores_gemma":[0.9970884,0.00003868765,0.00212438,0.0003139887,0.00004068415,0.00004264473,0.00005292848,0.00001813264,0.0002801794],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3253569,"threshold_uncertainty_score":0.5781906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3145864822","doi":"","title":"A NOTE ON THE STOCHASTIC ROOTS OF STOCHASTIC MATRICES","year":2003,"lang":"zh","type":"article","venue":"系统科学与系统工程学报(英文版)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Root (linguistics); Continuous-time stochastic process; Stochastic modelling; Matrix (chemical analysis); Applied mathematics; Stochastic process; Stochastic optimization; Stochastic differential equation; Mathematical optimization; Statistics","authors":[{"name":"HE Eldon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01615475487002311,"gpt":0.2514418949697846,"spread":0.2352871400997615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002064547,0.0006630989,0.000724572,0.0003400958,0.0005485371,0.0003102602,0.002222187,0.000263166,0.0006806545],"category_scores_gemma":[0.001089201,0.0004856513,0.0003865226,0.001538971,0.0004178177,0.0003675636,0.0003698313,0.0007542632,0.001054124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009524473,"about_ca_system_score_gemma":0.0003590885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007448928,"about_ca_topic_score_gemma":0.00001764954,"domain_scores_codex":[0.9951418,0.000805157,0.0009188845,0.0009928021,0.001119172,0.001022154],"domain_scores_gemma":[0.9943917,0.002461838,0.0006766766,0.001930186,0.0002414922,0.0002980385],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009047995,0.000485948,0.000006721943,0.0001316189,0.0001055031,0.00004060344,0.003230511,0.01000991,0.0003726826,0.9727154,0.0009140209,0.01189662],"study_design_scores_gemma":[0.005577628,0.004305798,0.001151733,0.002981964,0.0008270955,0.0004776351,0.002817345,0.4428531,0.005317372,0.5214574,0.008002199,0.004230732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02418677,0.002577659,0.9445803,0.001863263,0.00336961,0.001316898,0.00008788691,0.0002133464,0.02180425],"genre_scores_gemma":[0.994405,0.00002371471,0.002358035,0.0005616541,0.0003142391,0.00004561763,0.000002547221,0.000055375,0.002233811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9702182,"threshold_uncertainty_score":0.9997595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}