{"id":"W1584124733","doi":"10.1613/jair.3713","title":"Generating Approximate Solutions to the TTP using a Linear Distance Relaxation","year":2012,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Canadian Mathematical Society","keywords":"Tournament; Linear programming relaxation; Combinatorics; Mathematics; Linear programming; Schedule; Scheduling (production processes); Mathematical optimization; Modulo; Relaxation (psychology); Computer science; Discrete mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.04135709,0.0001074072,0.0002311537,0.0007156473,0.001634783,0.0005035573,0.001003313,0.00007672705,0.0001376837],"category_scores_gemma":[0.02821022,0.00006526514,0.0001752994,0.003240311,0.0002350877,0.0006748062,0.0002077857,0.0008342268,0.0005240302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001848231,"about_ca_system_score_gemma":0.0003559514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006345896,"about_ca_topic_score_gemma":0.00006441302,"domain_scores_codex":[0.9938561,0.001020582,0.001272238,0.0002168865,0.002775335,0.0008588714],"domain_scores_gemma":[0.9933217,0.002503491,0.0004533677,0.0005052228,0.002850089,0.0003661892],"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.0002072942,0.0005664155,0.002049746,0.00000817432,0.00006966031,0.00001023313,0.01130997,0.6774558,0.04652346,0.07368591,0.004684244,0.1834291],"study_design_scores_gemma":[0.00002864848,0.000164305,0.0002157305,0.000085197,0.00002411871,0.00009426683,0.01049208,0.9317183,0.01571357,0.02900807,0.01228267,0.0001730174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2351992,0.0007065097,0.7583492,0.00451983,0.000902534,0.0001555104,0.000004431854,0.000008678099,0.0001541036],"genre_scores_gemma":[0.9459999,0.00002474374,0.0516274,0.0000751832,0.002025873,0.000005252091,3.773393e-7,0.00001202064,0.0002293095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7108006,"threshold_uncertainty_score":0.999665,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.6328128500768635,"score_gpt":0.5480436522897456,"score_spread":0.08476919778711789,"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."}}