{"id":"W4409449443","doi":"10.1016/j.tcs.2025.115258","title":"Approximation algorithms for maximum weighted throughput on unrelated machines","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Throughput; Algorithm; Computer science; Approximation algorithm; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005190001,0.0001390931,0.0001372446,0.0001818495,0.0002172807,0.0001327284,0.0003687132,0.00006612208,0.00002565588],"category_scores_gemma":[0.00006124448,0.0001153747,0.00004288047,0.0008347482,0.0004743498,0.0001241375,0.00005620472,0.0001291267,0.00002384584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005425894,"about_ca_system_score_gemma":0.00002729715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.587311e-7,"about_ca_topic_score_gemma":5.727554e-8,"domain_scores_codex":[0.9990034,0.00002378017,0.00019371,0.0002893496,0.0002101733,0.0002795632],"domain_scores_gemma":[0.9993333,0.0002133061,0.0000168539,0.0002465393,0.0001184145,0.00007165125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001137652,0.0000285787,0.000004437516,0.00002160147,0.00001026211,6.019238e-7,0.00009680856,0.08587499,0.00007785339,0.7995685,0.00009744809,0.1142075],"study_design_scores_gemma":[0.000298197,0.00004596048,0.00004635567,0.00003857864,0.000007309146,0.000001413711,0.000003397037,0.8816616,0.003387478,0.1143308,0.00006046223,0.0001184434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003818227,0.00003062439,0.9885358,0.0004144756,0.001213578,0.0002307874,0.00000438328,0.0005059783,0.005246152],"genre_scores_gemma":[0.3935865,0.00000530728,0.6059592,0.0002861401,0.00009445709,0.00001978406,0.000009547483,0.00001269462,0.00002633752],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7957866,"threshold_uncertainty_score":0.4704843,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009445664617846294,"score_gpt":0.2547615915623328,"score_spread":0.2453159269444865,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}