{"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":"acbbcf2dd78d","filters":{"venue":"SOP Transactions on Applied Mathematics"}},"results":[{"id":"W2171724490","doi":"10.15764/aphy.2015.01003","title":"Approximation Algorithms for Subclasses of the Makespan Problem on Unrelated Parallel Machines with Restricted Processing Times","year":2015,"lang":"en","type":"article","venue":"SOP Transactions on Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Job shop scheduling; Computer science; Algorithm; Mathematical optimization; Parallel computing; Mathematics; Computer network","authors":[{"name":"Daniel R. Page","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02494501088715391,"gpt":0.238016168670221,"spread":0.2130711577830671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002350618,0.002063003,0.002226013,0.001271736,0.001168958,0.002447544,0.00365211,0.001583104,0.003389315],"category_scores_gemma":[0.009824427,0.001047195,0.002085418,0.002432948,0.0008877284,0.003874103,0.002722107,0.003006675,0.0006197875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00304847,"about_ca_system_score_gemma":0.00240937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005732388,"about_ca_topic_score_gemma":0.006529771,"domain_scores_codex":[0.9978599,0.0005091815,0.0001323382,0.0005479197,0.0004255101,0.0005250731],"domain_scores_gemma":[0.9952332,0.003095664,0.0004941496,0.0006210308,0.0002352287,0.0003206588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001015217,0.0005920848,0.001967026,0.0005559123,0.0002504954,0.0003013508,0.0005685765,0.8240571,0.004184619,0.05496413,0.01185659,0.09968691],"study_design_scores_gemma":[0.0000751417,0.0000596575,0.0002551213,0.00002593808,0.0000288131,0.00007575713,0.00006317906,0.9599194,0.0006184874,0.03711117,0.001757313,0.0000100139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1189254,0.00261282,0.8575743,0.00161617,0.0002578112,0.0003959998,0.0007630514,0.002185277,0.01566907],"genre_scores_gemma":[0.5187752,0.00172753,0.4665427,0.0007459417,0.000384371,0.0008487173,0.002685581,0.0008121991,0.007477704],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005732388,"threshold_uncertainty_score":0.02211827,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}