{"meta":{"query_hash":"9bc7e87df1f8","filters":{"venue":"系统科学与系统工程学报(英文版)"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/9bc7e87df1f8","api":"https://metacan.xera.ac/api/v1/cohort?venue=%E7%B3%BB%E7%BB%9F%E7%A7%91%E5%AD%A6%E4%B8%8E%E7%B3%BB%E7%BB%9F%E5%B7%A5%E7%A8%8B%E5%AD%A6%E6%8A%A5%28%E8%8B%B1%E6%96%87%E7%89%88%29"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02722335887137216,"score_gpt":0.23261545646793502,"score_spread":0.20539209759656285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2356668080","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.1136851,0.000397527,0.8625956,0.00048869126,0.0001333678,0.000106361826,0.00089022546,0.00043767566,0.021265484],"genre_scores_gemma":[0.9558203,0.00041803904,0.026405416,0.000046322464,0.000057874982,0.00018205936,0.0004710853,0.000043307355,0.016555626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994789,0.00017731402,0.000017221542,0.00014036705,0.000088931934,0.00009726261],"domain_scores_gemma":[0.9997234,0.00007382176,0.00006668833,0.000020191217,0.00007944981,0.000036346995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003502604,0.0009539075,0.00089802063,0.00059896073,0.0006134994,0.0012785675,0.0017151134,0.0008401073,0.004922319],"category_scores_gemma":[0.0006542101,0.00042503572,0.0007828634,0.0010547141,0.00061369233,0.002132485,0.0010049217,0.00091277587,0.00039000632],"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.000018708635,0.000009803078,0.00015181053,0.000012421382,0.000008617952,0.00006308236,0.000018078314,0.9877108,0.00021577389,0.0100783715,0.00033094117,0.0013816886],"study_design_scores_gemma":[0.0000039663983,0.000009250639,0.000058543956,0.0000013984037,0.0000054283723,0.000010874448,0.0000075683765,0.99685466,0.000031416574,0.0025869508,0.00042717534,0.0000027822805],"about_ca_topic_score_codex":0.022355322,"about_ca_topic_score_gemma":0.0155534055,"teacher_disagreement_score":0.022355322,"about_ca_system_score_codex":0.0013753015,"about_ca_system_score_gemma":0.0009354139,"threshold_uncertainty_score":0.044450402},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010941428896522819,"score_gpt":0.20127222134062028,"score_spread":0.19033079244409745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2361742132","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.061861143,0.0005199582,0.93179566,0.00018346365,0.00010791506,0.00019429732,0.00021866613,0.0004164913,0.0047023655],"genre_scores_gemma":[0.6970545,0.0005184825,0.29359215,0.00011269844,0.00009357653,0.00033773296,0.00040098978,0.00022267672,0.007667167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990945,0.0002889856,0.00006236772,0.00018845154,0.0002680754,0.00009757325],"domain_scores_gemma":[0.99828136,0.0009346698,0.00032039243,0.00023641993,0.00013439337,0.00009287308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015663062,0.0012964599,0.0018484207,0.00074949214,0.00046475852,0.0012099335,0.0019821406,0.0009830062,0.004334456],"category_scores_gemma":[0.002792889,0.00088010466,0.0012306952,0.0012545557,0.0007792625,0.0020497553,0.0006917241,0.0010580155,0.00074484514],"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.00015939279,0.00006771946,0.0002962056,0.00020365798,0.00005472944,0.00011537377,0.000049755556,0.9481325,0.005733983,0.019540653,0.0009529313,0.02469311],"study_design_scores_gemma":[0.00004274367,0.000121005294,0.00023230478,0.000009751469,0.00001907676,0.00004841068,0.000011814366,0.9838123,0.0014126103,0.013325812,0.0009490988,0.000015078803],"about_ca_topic_score_codex":0.0018393829,"about_ca_topic_score_gemma":0.0022502698,"teacher_disagreement_score":0.004334456,"about_ca_system_score_codex":0.0010268727,"about_ca_system_score_gemma":0.0015976698,"threshold_uncertainty_score":0.014500201},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016154754870023106,"score_gpt":0.2514418949697846,"score_spread":0.23528714009976148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145864822","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020365776,0.0042318935,0.9410636,0.0043281876,0.0014753862,0.000020299818,0.00007996754,0.00023919271,0.028195674],"genre_scores_gemma":[0.6925055,0.0132418545,0.2504921,0.0043571824,0.0070858765,0.00010013245,0.00019858812,0.0009660297,0.031052828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987771,0.00045780244,0.000056691104,0.0002011481,0.00042617792,0.000081104175],"domain_scores_gemma":[0.9939229,0.004671771,0.00032470247,0.000419929,0.0005115048,0.00014921885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024114777,0.0006513759,0.0007591014,0.00076601317,0.000767133,0.0012372319,0.0009661732,0.0016083063,0.0051868604],"category_scores_gemma":[0.015407333,0.00034211873,0.0008330144,0.00088275014,0.0025524888,0.0045053335,0.0016129821,0.0036295573,0.00091231376],"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.00001742847,0.000011858962,0.00022079346,0.00009313477,0.000011077915,0.00018532008,0.00013715771,0.021865241,0.001517851,0.9624886,0.0040852604,0.009366418],"study_design_scores_gemma":[0.000010732857,0.00004719896,0.0002521789,0.000045033736,0.000009424104,0.00017185319,0.00004136731,0.1125026,0.0014332801,0.8693795,0.016071774,0.000035096735],"about_ca_topic_score_codex":0.0010227647,"about_ca_topic_score_gemma":0.00077664596,"teacher_disagreement_score":0.0051868604,"about_ca_system_score_codex":0.00046892287,"about_ca_system_score_gemma":0.0005402584,"threshold_uncertainty_score":0.017351747},"labels":[],"label_agreement":null}]}