{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008642548,0.0001391802,0.0002714069,0.0002335802,0.0001060238,0.0001781062,0.001372884,0.00004777466,0.00001464722],"category_scores_gemma":[0.0002276985,0.0001070625,0.0001990828,0.0005179824,0.0000567896,0.001237499,0.0001631312,0.0004475385,0.00001291021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005216774,"about_ca_system_score_gemma":0.00008818198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001070933,"about_ca_topic_score_gemma":3.923622e-7,"domain_scores_codex":[0.9982474,0.0001113688,0.0004850473,0.0001888046,0.0005953551,0.0003720317],"domain_scores_gemma":[0.9987276,0.0001006735,0.0003360109,0.0003479191,0.0002979763,0.0001898739],"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.00007524699,0.0001308873,0.0002841018,0.000007983802,0.00009500834,0.0003599874,0.0008466974,0.0001926242,0.006620065,0.07619404,0.0006918806,0.9145015],"study_design_scores_gemma":[0.006450091,0.006669325,0.01295855,0.0007495185,0.000066033,0.003024526,0.00110405,0.2355175,0.05264586,0.6574579,0.02178495,0.001571643],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01435842,0.0005901249,0.9804521,0.002607888,0.0003236947,0.0000684922,0.000001088143,0.0000429373,0.001555211],"genre_scores_gemma":[0.7410606,0.00005090641,0.2582207,0.0002304768,0.0002504937,5.252544e-7,3.633562e-7,0.000008397957,0.0001774808],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9129298,"threshold_uncertainty_score":0.4365884,"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."}}