{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"a9a70c0abc7b","filters":{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.179304863765306,"gpt":0.3703466710522083,"spread":0.1910418072869022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008640506,0.00007406561,0.0001043329,0.000118368,0.0002201575,0.0001242937,0.0002189961,0.00007723644,0.00008169025],"category_scores_gemma":[0.0004061116,0.00005743803,0.00004598535,0.0005062561,0.00002702274,0.0002534542,0.00005839694,0.0002320814,0.00001909948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006954824,"about_ca_system_score_gemma":0.00009832034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001745463,"about_ca_topic_score_gemma":0.00009779204,"domain_scores_codex":[0.9990047,0.0001270311,0.0002417471,0.0001202086,0.0002713744,0.000234977],"domain_scores_gemma":[0.9991375,0.0002412256,0.00001175298,0.0002802539,0.0002787034,0.00005059984],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001505838,0.000006928917,0.0002215969,0.00006823261,0.00001983999,1.440873e-8,0.0005240815,0.9801239,0.005726297,0.006580343,0.001166598,0.005560646],"study_design_scores_gemma":[0.0001907455,0.00001791948,0.001068851,0.00001908393,0.000006373487,9.000046e-7,0.0001222964,0.9877144,0.009326145,0.0009545517,0.0005143859,0.00006442283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04797953,0.0000546976,0.9473728,0.0005305549,0.00006974463,0.001738881,0.0000142306,0.00007797669,0.002161581],"genre_scores_gemma":[0.7097359,0.000005478305,0.2886054,0.000005347478,0.00005059862,0.0002680837,0.00001226963,0.00002476376,0.001292141],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6617564,"threshold_uncertainty_score":0.2342255,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}