{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003746054,0.0007598396,0.00203294,0.0020417,0.001723264,0.004471933,0.004040798,0.002232999,0.005675273],"category_scores_gemma":[0.02527039,0.001525576,0.001465592,0.00332229,0.002885606,0.007072366,0.002624355,0.002859402,0.0004849119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001957919,"about_ca_system_score_gemma":0.0009385814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001476659,"about_ca_topic_score_gemma":0.001900245,"domain_scores_codex":[0.9973659,0.001050762,0.0001197914,0.0006259927,0.000513527,0.0003240495],"domain_scores_gemma":[0.9710231,0.02201619,0.002854718,0.001607328,0.001092933,0.001405752],"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.0004829782,0.0001658713,0.002716595,0.0002024513,0.000115701,0.0003066481,0.0007087884,0.1423014,0.002082929,0.8306164,0.004097216,0.01620309],"study_design_scores_gemma":[0.0001330387,0.00006015699,0.0008248042,0.00003231946,0.00007148794,0.0003205872,0.0002282469,0.3986731,0.0006339189,0.5970002,0.001990792,0.00003135079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3165225,0.001864924,0.6600009,0.002900584,0.0002044643,0.0002294853,0.0006493717,0.0003738744,0.0172538],"genre_scores_gemma":[0.9212146,0.001263423,0.06540851,0.0003976006,0.0004157921,0.0002546968,0.0005966496,0.0001509239,0.01029785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005675273,"threshold_uncertainty_score":0.01981121,"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."}}