{"meta":{"query_hash":"a9a70c0abc7b","filters":{"venue":"ISRN Operations Research"},"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/a9a70c0abc7b","api":"https://metacan.xera.ac/api/v1/cohort?venue=ISRN+Operations+Research"},"results":[{"id":"W2132103269","doi":"10.1155/2013/203032","title":"A New Formulation of the Set Covering Problem for Metaheuristic Approaches","year":2013,"lang":"en","type":"article","venue":"ISRN Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Metaheuristic; Heuristic; Redundancy (engineering); Mathematical optimization; Computer science; Set (abstract data type); Computation; Greedy algorithm; Algorithm; Mathematics","score_opus":0.17930486376530602,"score_gpt":0.37034667105220825,"score_spread":0.19104180728690223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132103269","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.04797953,0.000054697604,0.9473728,0.00053055485,0.00006974463,0.0017388812,0.000014230598,0.000077976685,0.0021615808],"genre_scores_gemma":[0.70973593,0.0000054783045,0.28860536,0.0000053474782,0.000050598617,0.00026808374,0.000012269634,0.00002476376,0.0012921413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900466,0.00012703106,0.00024174713,0.000120208584,0.00027137436,0.00023497701],"domain_scores_gemma":[0.99913746,0.00024122556,0.000011752983,0.00028025385,0.00027870337,0.000050599836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086405064,0.00007406561,0.00010433287,0.000118367956,0.00022015753,0.00012429367,0.0002189961,0.000077236444,0.00008169025],"category_scores_gemma":[0.0004061116,0.00005743803,0.000045985347,0.00050625607,0.000027022745,0.0002534542,0.000058396945,0.0002320814,0.000019099478],"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.0000015058379,0.0000069289167,0.00022159691,0.000068232606,0.000019839992,1.4408728e-8,0.0005240815,0.98012394,0.0057262974,0.006580343,0.0011665982,0.0055606463],"study_design_scores_gemma":[0.0001907455,0.000017919483,0.0010688513,0.000019083933,0.0000063734874,9.0000464e-7,0.00012229645,0.98771435,0.009326145,0.0009545517,0.0005143859,0.00006442283],"about_ca_topic_score_codex":0.00017454631,"about_ca_topic_score_gemma":0.000097792035,"teacher_disagreement_score":0.6617564,"about_ca_system_score_codex":0.000069548245,"about_ca_system_score_gemma":0.00009832034,"threshold_uncertainty_score":0.23422548},"labels":[],"label_agreement":null}]}