{"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":"other","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.20790978,0.002041394,0.06728314,0.007433399,0.02940325,0.004905713,0.0008016586,0.0041180593,0.6761036],"genre_scores_gemma":[0.8085963,0.00014614999,0.17999059,0.0007176782,0.0016947245,0.00008133739,0.00014158874,0.0005328312,0.008098808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99329203,0.000374377,0.0015621482,0.0013695434,0.0008708216,0.002531059],"domain_scores_gemma":[0.9946856,0.00043388456,0.00030935797,0.0020831428,0.00045260732,0.0020354204],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0018973851,0.0012890549,0.0011837387,0.0010661948,0.00079149584,0.0006734765,0.001596124,0.0013794401,0.010341644],"category_scores_gemma":[0.0004816552,0.0015179381,0.0004868355,0.0016247896,0.00037019185,0.00053400715,0.00022949647,0.003280564,0.004795246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023713794,0.0015171085,0.01832631,0.0030910631,0.0027882494,0.0010577327,0.024677185,0.4067485,0.1470079,0.0636028,0.10390958,0.22703643],"study_design_scores_gemma":[0.0028303696,0.0001917641,0.015947305,0.00035302367,0.00032614204,0.0002726943,0.00039666804,0.5253128,0.0060373116,0.0008504866,0.4441134,0.003368077],"about_ca_topic_score_codex":0.008832008,"about_ca_topic_score_gemma":0.025615077,"teacher_disagreement_score":0.6680048,"about_ca_system_score_codex":0.0004624068,"about_ca_system_score_gemma":0.0007832611,"threshold_uncertainty_score":0.9999861},"labels":[],"label_agreement":null}]}