{"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":"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.002183133,0.0012504485,0.98933315,0.000506658,0.00019199435,0.0001120189,0.00007639098,0.00006959519,0.006276516],"genre_scores_gemma":[0.07255021,0.0024900753,0.91843575,0.00040371143,0.00039024057,0.00053060235,0.00021346346,0.00014055983,0.00484536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982875,0.0008692452,0.00008601803,0.00017773735,0.00049132266,0.0000880505],"domain_scores_gemma":[0.9989944,0.00059179845,0.0001116533,0.00012713746,0.00014196933,0.000032968066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001696584,0.001469012,0.00092736067,0.0009784438,0.00043561813,0.0016873435,0.0018419666,0.0018256849,0.0035562753],"category_scores_gemma":[0.003810872,0.0005749355,0.0019439296,0.001965345,0.00094191753,0.001871441,0.0013360719,0.0029024512,0.0007015891],"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.00003746983,0.00009729488,0.00029876234,0.00065061625,0.00012265502,0.0002570728,0.00019754206,0.5321197,0.004525474,0.33935204,0.008380842,0.1139606],"study_design_scores_gemma":[0.000036887177,0.00012483129,0.00019429144,0.00017511335,0.00005986695,0.00041565608,0.00008584824,0.83458275,0.0017126688,0.11973596,0.042839464,0.0000366751],"about_ca_topic_score_codex":0.0010052789,"about_ca_topic_score_gemma":0.0013574472,"teacher_disagreement_score":0.0035562753,"about_ca_system_score_codex":0.001247018,"about_ca_system_score_gemma":0.0011124474,"threshold_uncertainty_score":0.011896968},"labels":[],"label_agreement":null}]}