{"meta":{"query_hash":"90f69b93f5fc","filters":{"venue":"電子情報通信学会技術研究報告. COMP, コンピュテーション"},"cohort_total":1,"direct_labels_cover":0,"predictions_cover":1,"exported":1,"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/90f69b93f5fc","api":"https://metacan.xera.ac/api/v1/cohort?venue=%E9%9B%BB%E5%AD%90%E6%83%85%E5%A0%B1%E9%80%9A%E4%BF%A1%E5%AD%A6%E4%BC%9A%E6%8A%80%E8%A1%93%E7%A0%94%E7%A9%B6%E5%A0%B1%E5%91%8A.+COMP%2C+%E3%82%B3%E3%83%B3%E3%83%94%E3%83%A5%E3%83%86%E3%83%BC%E3%82%B7%E3%83%A7%E3%83%B3"},"results":[{"id":"W407282568","doi":"","title":"枝コストに制限を加えたk-Canadian Traveller Problemの競合比解析","year":2010,"lang":"ja","type":"article","venue":"電子情報通信学会技術研究報告. COMP, コンピュテーション","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.01567056958695733,"score_gpt":0.24469134619955182,"score_spread":0.22902077661259448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W407282568","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.30974674,0.0035360076,0.37631565,0.014635687,0.00055843336,0.0004080648,0.0043958235,0.00029049796,0.29011315],"genre_scores_gemma":[0.8513179,0.0014847975,0.065521955,0.00036849966,0.000097608616,0.00016019806,0.0010403646,0.00008746043,0.07992122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995732,0.000098713645,0.00001091659,0.000105855215,0.000078029,0.00013324863],"domain_scores_gemma":[0.99961984,0.00014567534,0.000035345103,0.000014930874,0.000113127295,0.00007106823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073621736,0.0006953583,0.00055397226,0.00067393325,0.0015655049,0.0027390162,0.0014291056,0.0016643299,0.011732475],"category_scores_gemma":[0.0019654264,0.0003847191,0.0005199108,0.0011380276,0.0011678899,0.0019001785,0.0009967359,0.0013320321,0.0005197374],"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.00030125323,0.000095247626,0.0021682414,0.0003094729,0.00007177282,0.00025848692,0.00026021266,0.50788665,0.000700684,0.40476942,0.027925441,0.05525318],"study_design_scores_gemma":[0.00010626319,0.000076811986,0.0018614467,0.00009887434,0.000061836814,0.00018590977,0.0011120962,0.7490925,0.0013057396,0.214664,0.03134161,0.000092865346],"about_ca_topic_score_codex":0.3193151,"about_ca_topic_score_gemma":0.26689735,"teacher_disagreement_score":0.3193151,"about_ca_system_score_codex":0.007386096,"about_ca_system_score_gemma":0.008468086,"threshold_uncertainty_score":0.63491297},"labels":[],"label_agreement":null}]}