{"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","author_layer_release":"2026-06-26"},"query_hash":"f97d7b77db1e","filters":{"venue":"IJCCI"}},"results":[{"id":"W2550943709","doi":"","title":"A Pruning based Ant Colony Algorithm for Minimum Vertex Cover Problem.","year":2009,"lang":"en","type":"article","venue":"IJCCI","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Vertex cover; Tree traversal; Graph traversal; Algorithm; Vertex (graph theory); Feedback vertex set; Edge cover; Pruning; Mathematics; Cardinality (data modeling); Ant colony optimization algorithms; Reachability; Computer science; Graph; Combinatorics; Mathematical optimization; Approximation algorithm; Data mining","authors":[{"name":"Ali D. Mehrabi","is_ca":false},{"name":"Saeed Mehrabi","is_ca":true},{"name":"Abbas Mehrabi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01345453991789349,"gpt":0.2624972349315403,"spread":0.2490426950136468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002791923,0.0001377852,0.0001705636,0.0000735704,0.00006646933,0.00004249862,0.0001148053,0.00009198431,0.00004958548],"category_scores_gemma":[0.00006991327,0.0001483507,0.00005875124,0.0001939291,0.00001110228,0.00008937692,0.000007785311,0.00009830289,0.00002132778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007477283,"about_ca_system_score_gemma":0.00003488634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000181571,"about_ca_topic_score_gemma":4.432309e-7,"domain_scores_codex":[0.999189,0.00003089514,0.0002058703,0.0001671666,0.0001174379,0.0002896732],"domain_scores_gemma":[0.9995105,0.0001476017,0.00003394102,0.0001758976,0.00006089832,0.00007117456],"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.00001747924,0.00006672966,0.0000965804,0.00007005538,0.00003445619,0.00000806182,0.0003076459,0.7496878,0.00836464,0.0001888349,0.01421129,0.2269465],"study_design_scores_gemma":[0.0008250199,0.0000947206,0.0002836442,0.00003965729,0.00001633837,0.000002705749,0.000008644794,0.9805043,0.004346037,0.0001818051,0.01350928,0.000187861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003676276,0.00008775286,0.9916936,0.000208465,0.00022366,0.0004356749,0.00001888096,0.0005031974,0.003152475],"genre_scores_gemma":[0.09848016,0.000004801682,0.9004713,0.0003881209,0.00009151673,0.00004131348,0.00002331477,0.00004464472,0.0004548818],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2308165,"threshold_uncertainty_score":0.6049566,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}