{"id":"W1954494745","doi":"10.1007/3-540-44839-x_28","title":"Scheduling Intervals Using Independent Sets in Claw-Free Graphs","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Computer science; Scheduling (production processes); Time complexity; Combinatorics; Execution time; Running time; Discrete mathematics; Algorithm; Parallel computing; Mathematics; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":false,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002103569,0.0005475755,0.0005973842,0.001917232,0.000225254,0.0008535024,0.004603544,0.0004225511,0.0000389316],"category_scores_gemma":[0.0002064686,0.0005362929,0.0001511226,0.001317339,0.0004898399,0.0009794008,0.002217678,0.001356733,0.00001965303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004933009,"about_ca_system_score_gemma":0.000625162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004492182,"about_ca_topic_score_gemma":0.0001842695,"domain_scores_codex":[0.9951556,0.0001286144,0.0007940802,0.001673495,0.001329763,0.0009184316],"domain_scores_gemma":[0.9971486,0.0002662296,0.0003066735,0.001752341,0.0002837165,0.000242418],"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.000005791527,0.00007123399,0.0003627204,0.00007038224,0.00001503418,0.0002028267,0.001506178,0.8100151,0.0001553083,0.05029681,0.00001961478,0.137279],"study_design_scores_gemma":[0.0004461267,0.00007386457,0.0000471612,0.0005412779,0.000002828997,0.0000660413,3.228882e-7,0.7759467,0.0002819375,0.2218596,0.0002019824,0.0005321364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003570555,0.0003964075,0.9942095,0.0008006446,0.001470391,0.0005217465,0.00000335856,0.0001127035,0.002128229],"genre_scores_gemma":[0.05347684,0.00009380739,0.9430656,0.003078386,0.0000869178,0.000008679774,0.000003655659,0.0000475384,0.0001385216],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1715628,"threshold_uncertainty_score":0.9997088,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03839137146645097,"score_gpt":0.2875737718261409,"score_spread":0.2491824003596899,"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."}}