{"id":"W2246565182","doi":"","title":"Stable Routing and Unique-Max Coloring on Trees","year":2013,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bounded function; Combinatorics; Mathematics; Connection (principal bundle); Shortest path problem; Tree (set theory); Routing (electronic design automation); Path (computing); Discrete mathematics; Integer (computer science); Computer science; Computer network; 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.0009171208,0.0007444421,0.0005157413,0.000840241,0.0009054642,0.001190928,0.0008015262,0.0003896384,0.002840875],"category_scores_gemma":[0.004241531,0.0003653731,0.0005007617,0.00140504,0.001190334,0.002838713,0.001445654,0.001065351,0.0006676799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001348511,"about_ca_system_score_gemma":0.0008274828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001660861,"about_ca_topic_score_gemma":0.002825154,"domain_scores_codex":[0.9992054,0.0002424238,0.00003146322,0.0001377729,0.0001891067,0.0001938516],"domain_scores_gemma":[0.9977242,0.001171108,0.0002391734,0.0004491268,0.0002614647,0.0001548802],"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.0003411226,0.00007350082,0.001076277,0.0001793116,0.00003427634,0.000126426,0.0003099013,0.2534502,0.01457839,0.5593889,0.007603589,0.1628381],"study_design_scores_gemma":[0.00003176059,0.00008431122,0.0003802015,0.00002096962,0.00001598766,0.0001158991,0.00008389039,0.3964584,0.006615326,0.5887439,0.007427774,0.00002161732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08847086,0.0005317402,0.8991201,0.0003945708,0.00007220719,0.00004916716,0.000171396,0.0007271909,0.01046271],"genre_scores_gemma":[0.6214639,0.0009297621,0.3664013,0.0002312262,0.0001500867,0.0001398131,0.0004335177,0.0004877304,0.009762584],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002840875,"threshold_uncertainty_score":0.009784162,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01007124733084899,"score_gpt":0.212794912678893,"score_spread":0.202723665348044,"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."}}