{"id":"W2117485843","doi":"10.1016/j.jda.2009.06.001","title":"Ordered interval routing schemes","year":2009,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Disjoint sets; Mathematics; Interval graph; Routing (electronic design automation); Equal-cost multi-path routing; Discrete mathematics; Static routing; Computer science; Graph; Line graph; Routing protocol; Computer network; Pathwidth","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.001197214,0.0006489287,0.00096448,0.001391012,0.001437447,0.003107631,0.002359313,0.00102384,0.0220131],"category_scores_gemma":[0.004591278,0.000493777,0.0006905125,0.002419541,0.0008574267,0.004164201,0.002676035,0.00207206,0.003759458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001303185,"about_ca_system_score_gemma":0.001088015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000572378,"about_ca_topic_score_gemma":0.0007627691,"domain_scores_codex":[0.9986864,0.0002680551,0.0001276384,0.0002463733,0.0004209645,0.0002505829],"domain_scores_gemma":[0.9963858,0.0007945444,0.0002234291,0.001835573,0.0004657623,0.0002948836],"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.0006466458,0.0003021136,0.0004235864,0.00019775,0.00003409608,0.0001005689,0.0002805985,0.02528983,0.008439831,0.7726931,0.01576533,0.1758266],"study_design_scores_gemma":[0.0002239907,0.0004085341,0.0004449229,0.0001176498,0.00009007988,0.0003604065,0.0002974177,0.1552977,0.01158574,0.7609297,0.07015692,0.00008681953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09111156,0.0007583059,0.7804334,0.001053147,0.0005198719,0.0006140796,0.001944838,0.00268946,0.1208753],"genre_scores_gemma":[0.5434235,0.0009538138,0.4047948,0.0004211308,0.0002360666,0.0004402282,0.00258565,0.0005354636,0.04660937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0220131,"threshold_uncertainty_score":0.07364112,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02052610191514567,"score_gpt":0.3183674353720518,"score_spread":0.2978413334569061,"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."}}