{"id":"W2071645752","doi":"10.1016/j.jda.2008.11.002","title":"Threshold dominating cliques in random graphs and interval routing","year":2008,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Random graph; Interval graph; Discrete mathematics; Interval (graph theory); Indifference graph; Chordal graph; Block graph; Split graph; Routing (electronic design automation); Clique; Pathwidth; Graph; Computer science; Line graph; 1-planar graph","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":[],"consensus_categories":[],"category_scores_codex":[0.001867698,0.0001431849,0.0003683538,0.0004191499,0.0001319226,0.00008841533,0.0006886078,0.00005674338,0.000003276227],"category_scores_gemma":[0.0002717975,0.0001114632,0.0001399111,0.0004827391,0.0001834861,0.001233791,0.0002827882,0.0005992324,0.000001013204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004501415,"about_ca_system_score_gemma":0.00006997724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009482284,"about_ca_topic_score_gemma":0.000004468835,"domain_scores_codex":[0.9981825,0.0001968528,0.0006058199,0.000213581,0.0004605661,0.0003406319],"domain_scores_gemma":[0.9987829,0.0003818978,0.000322203,0.000211304,0.0001579651,0.0001437545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002011991,0.0006621979,0.172138,0.0001846562,0.0005273874,0.009705629,0.0391706,0.001735564,0.01358045,0.2075014,0.0006577679,0.5521243],"study_design_scores_gemma":[0.02569329,0.00311632,0.06614406,0.001664687,0.00004386237,0.0101345,0.002259421,0.3530417,0.01833312,0.5175546,0.0004547837,0.001559587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6644626,0.001580677,0.3322361,0.0005379742,0.0002316098,0.0001418974,0.000001363275,0.00003052252,0.0007771808],"genre_scores_gemma":[0.9238176,0.0004859962,0.07551057,0.00006326077,0.00006386139,0.0000023649,2.018431e-7,0.00001098101,0.00004518832],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5505648,"threshold_uncertainty_score":0.4545336,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02449650749774298,"score_gpt":0.3068081951278628,"score_spread":0.2823116876301199,"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."}}