{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72409576,0.0001248199,0.25142846,0.0013231147,0.00018772706,0.0009218905,0.000029902381,0.0003160544,0.021572286],"genre_scores_gemma":[0.9970884,0.00003868765,0.0021243803,0.00031398868,0.000040684146,0.00004264473,0.000052928477,0.000018132636,0.00028017937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987103,0.00013978341,0.00021883345,0.00029615726,0.00033832472,0.00029663593],"domain_scores_gemma":[0.9995887,0.00006309786,0.000043049116,0.0001116061,0.00006428782,0.00012924206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043179697,0.00015029963,0.00015963301,0.000095827105,0.00027997894,0.000037323298,0.00007864769,0.00013924555,0.000090442816],"category_scores_gemma":[0.000011074874,0.000141787,0.000027630098,0.00028492403,0.00014012647,0.0002177072,0.0000013777335,0.00015070057,0.0000045899537],"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.0014240098,0.00040794417,0.12636323,0.00003380517,0.000033329386,0.000026670366,0.058976732,0.78227705,0.0001086764,0.02427808,0.00060488714,0.005465618],"study_design_scores_gemma":[0.0058241826,0.0008834397,0.45172012,0.00052548695,0.00016802328,0.0000010797717,0.0035997734,0.5339855,0.00045124948,0.00070254825,0.0013257428,0.0008128804],"about_ca_topic_score_codex":0.000853666,"about_ca_topic_score_gemma":0.0036297909,"teacher_disagreement_score":0.32535687,"about_ca_system_score_codex":0.000068997375,"about_ca_system_score_gemma":0.00010183595,"threshold_uncertainty_score":0.57819057},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10220663,0.0010628445,0.87769353,0.00026599213,0.0010059619,0.0006290358,0.000036258974,0.0016867167,0.015413025],"genre_scores_gemma":[0.62396026,0.0001407277,0.3718783,0.00022897402,0.00040953263,0.0000955626,0.00006259499,0.0001435858,0.0030804933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989408,0.000009331557,0.00023017543,0.0002503608,0.00018763401,0.00038167398],"domain_scores_gemma":[0.9993424,0.00010191509,0.00004057665,0.00030636336,0.00008415569,0.00012460866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107325875,0.00022989232,0.00024298311,0.000102492966,0.0001965889,0.000041265004,0.00017312948,0.0001229257,0.0000993292],"category_scores_gemma":[0.000038624534,0.00021047684,0.00007475349,0.00030743016,0.000051148094,0.00014932711,0.00001918014,0.00017271016,0.00011940002],"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.00013556551,0.000115970906,0.0026989754,0.00024524092,0.0003112372,0.00007928986,0.005112317,0.9367922,0.0005626632,0.0006355286,0.042832565,0.010478448],"study_design_scores_gemma":[0.0030154083,0.00030124877,0.0014719028,0.00026524064,0.00009556218,0.00015503618,0.00052723684,0.95148593,0.011085774,0.0003004972,0.03005283,0.001243322],"about_ca_topic_score_codex":0.000014398418,"about_ca_topic_score_gemma":0.000006931141,"teacher_disagreement_score":0.5217536,"about_ca_system_score_codex":0.000047098656,"about_ca_system_score_gemma":0.000035521643,"threshold_uncertainty_score":0.8582996},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024186773,0.0025776592,0.9445803,0.0018632627,0.00336961,0.0013168979,0.00008788691,0.00021334641,0.02180425],"genre_scores_gemma":[0.99440503,0.000023714709,0.0023580354,0.0005616541,0.0003142391,0.000045617635,0.0000025472211,0.000055375,0.0022338112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951418,0.000805157,0.00091888447,0.0009928021,0.0011191717,0.001022154],"domain_scores_gemma":[0.99439174,0.0024618376,0.00067667663,0.0019301863,0.0002414922,0.0002980385],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020645473,0.0006630989,0.000724572,0.0003400958,0.0005485371,0.00031026016,0.0022221871,0.00026316597,0.0006806545],"category_scores_gemma":[0.0010892008,0.0004856513,0.00038652265,0.0015389706,0.0004178177,0.00036756363,0.00036983125,0.0007542632,0.0010541241],"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.00009047995,0.00048594803,0.000006721943,0.00013161892,0.000105503124,0.00004060344,0.0032305112,0.010009906,0.00037268258,0.9727154,0.00091402093,0.011896617],"study_design_scores_gemma":[0.0055776276,0.0043057976,0.0011517328,0.0029819643,0.00082709553,0.0004776351,0.0028173446,0.4428531,0.0053173723,0.52145743,0.008002199,0.0042307316],"about_ca_topic_score_codex":0.00007448928,"about_ca_topic_score_gemma":0.000017649543,"teacher_disagreement_score":0.97021824,"about_ca_system_score_codex":0.00009524473,"about_ca_system_score_gemma":0.0003590885,"threshold_uncertainty_score":0.9997595},"labels":[],"label_agreement":null}]}