{"id":"W2405008717","doi":"","title":"Minimal Covers of Maximal Cliques for Interval Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Interval (graph theory); Combinatorics; Independence (probability theory); Discrete mathematics; Independence number; Order (exchange); Upper and lower bounds; Interval graph; Pathwidth; Graph; Statistics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002550966,0.0001080833,0.0002600018,0.0001964663,0.00005219934,0.00004861694,0.0008561219,0.00006288545,0.00001684201],"category_scores_gemma":[0.000153702,0.00008936925,0.00019963,0.0008331363,0.00005732086,0.0002948585,0.0001226648,0.00006809349,0.000008080561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001584606,"about_ca_system_score_gemma":0.00002082652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002124709,"about_ca_topic_score_gemma":9.720131e-7,"domain_scores_codex":[0.998995,0.0000335567,0.0002636923,0.0002855519,0.0001923637,0.0002298538],"domain_scores_gemma":[0.9991791,0.0001521774,0.0001166105,0.000367254,0.0001066014,0.00007822629],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002424241,0.0001713643,0.001008397,0.000003812566,0.00002700742,0.000003753465,0.00004831761,0.000001903779,0.0001772187,0.9785548,0.003368286,0.01661089],"study_design_scores_gemma":[0.0006442748,0.001280414,0.01570633,0.000007635592,0.00002308211,0.000002650022,0.00001695028,0.00111884,0.003211296,0.974002,0.003831471,0.0001550715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9570144,0.0002803066,0.0363998,0.002363454,0.001065237,0.0002305715,0.00003917379,0.0001670062,0.002440039],"genre_scores_gemma":[0.9906841,0.0000177624,0.008880099,0.0003107528,0.000004423833,0.000004769053,0.000009298958,0.000002401276,0.00008641211],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03366967,"threshold_uncertainty_score":0.3644372,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01653703275778776,"score_gpt":0.2634478112292585,"score_spread":0.2469107784714707,"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."}}