{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001566306,0.00129646,0.001848421,0.0007494921,0.0004647585,0.001209934,0.001982141,0.0009830062,0.004334456],"category_scores_gemma":[0.002792889,0.0008801047,0.001230695,0.001254556,0.0007792625,0.002049755,0.0006917241,0.001058016,0.0007448451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001026873,"about_ca_system_score_gemma":0.00159767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001839383,"about_ca_topic_score_gemma":0.00225027,"domain_scores_codex":[0.9990945,0.0002889856,0.00006236772,0.0001884515,0.0002680754,0.00009757325],"domain_scores_gemma":[0.9982814,0.0009346698,0.0003203924,0.0002364199,0.0001343934,0.00009287308],"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.0001593928,0.00006771946,0.0002962056,0.000203658,0.00005472944,0.0001153738,0.00004975556,0.9481325,0.005733983,0.01954065,0.0009529313,0.02469311],"study_design_scores_gemma":[0.00004274367,0.0001210053,0.0002323048,0.000009751469,0.00001907676,0.00004841068,0.00001181437,0.9838123,0.00141261,0.01332581,0.0009490988,0.0000150788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06186114,0.0005199582,0.9317957,0.0001834636,0.0001079151,0.0001942973,0.0002186661,0.0004164913,0.004702365],"genre_scores_gemma":[0.6970545,0.0005184825,0.2935922,0.0001126984,0.00009357653,0.000337733,0.0004009898,0.0002226767,0.007667167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004334456,"threshold_uncertainty_score":0.0145002,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003502604,0.0009539075,0.0008980206,0.0005989607,0.0006134994,0.001278567,0.001715113,0.0008401073,0.004922319],"category_scores_gemma":[0.0006542101,0.0004250357,0.0007828634,0.001054714,0.0006136923,0.002132485,0.001004922,0.0009127759,0.0003900063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001375302,"about_ca_system_score_gemma":0.0009354139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02235532,"about_ca_topic_score_gemma":0.01555341,"domain_scores_codex":[0.9994789,0.000177314,0.00001722154,0.000140367,0.00008893193,0.00009726261],"domain_scores_gemma":[0.9997234,0.00007382176,0.00006668833,0.00002019122,0.00007944981,0.000036347],"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.00001870864,0.000009803078,0.0001518105,0.00001242138,0.000008617952,0.00006308236,0.00001807831,0.9877108,0.0002157739,0.01007837,0.0003309412,0.001381689],"study_design_scores_gemma":[0.000003966398,0.000009250639,0.00005854396,0.000001398404,0.000005428372,0.00001087445,0.000007568377,0.9968547,0.00003141657,0.002586951,0.0004271753,0.00000278228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1136851,0.000397527,0.8625956,0.0004886913,0.0001333678,0.0001063618,0.0008902255,0.0004376757,0.02126548],"genre_scores_gemma":[0.9558203,0.000418039,0.02640542,0.00004632246,0.00005787498,0.0001820594,0.0004710853,0.00004330735,0.01655563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02235532,"threshold_uncertainty_score":0.0444504,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002411478,0.0006513759,0.0007591014,0.0007660132,0.000767133,0.001237232,0.0009661732,0.001608306,0.00518686],"category_scores_gemma":[0.01540733,0.0003421187,0.0008330144,0.0008827501,0.002552489,0.004505333,0.001612982,0.003629557,0.0009123138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004689229,"about_ca_system_score_gemma":0.0005402584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001022765,"about_ca_topic_score_gemma":0.000776646,"domain_scores_codex":[0.9987771,0.0004578024,0.0000566911,0.0002011481,0.0004261779,0.00008110418],"domain_scores_gemma":[0.9939229,0.004671771,0.0003247025,0.000419929,0.0005115048,0.0001492188],"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.00001742847,0.00001185896,0.0002207935,0.00009313477,0.00001107791,0.0001853201,0.0001371577,0.02186524,0.001517851,0.9624886,0.00408526,0.009366418],"study_design_scores_gemma":[0.00001073286,0.00004719896,0.0002521789,0.00004503374,0.000009424104,0.0001718532,0.00004136731,0.1125026,0.00143328,0.8693795,0.01607177,0.00003509673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02036578,0.004231893,0.9410636,0.004328188,0.001475386,0.00002029982,0.00007996754,0.0002391927,0.02819567],"genre_scores_gemma":[0.6925055,0.01324185,0.2504921,0.004357182,0.007085877,0.0001001324,0.0001985881,0.0009660297,0.03105283],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00518686,"threshold_uncertainty_score":0.01735175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}