{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002239511,0.0002763302,0.0003996413,0.0004531006,0.0002381915,0.000123301,0.0009357231,0.0003023084,0.00001610049],"category_scores_gemma":[0.0001491073,0.0002558789,0.0000648861,0.0008020359,0.0003447226,0.0007804902,0.0003649553,0.000413164,0.00004744219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000695926,"about_ca_system_score_gemma":0.00009095006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006459883,"about_ca_topic_score_gemma":0.00005710366,"domain_scores_codex":[0.9982532,0.00003161399,0.0003650126,0.0005717023,0.00026352,0.0005149001],"domain_scores_gemma":[0.9986216,0.00007392149,0.0002341351,0.0008042607,0.0001518234,0.000114271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001207723,0.000116413,0.00732687,0.00002241323,0.0001115028,0.0000328389,0.0001636859,0.00105033,0.002814594,0.4178765,0.002813004,0.5676598],"study_design_scores_gemma":[0.007722807,0.002444684,0.02294634,0.001414969,0.0001895145,0.0002108514,0.0008231791,0.3420097,0.03197065,0.03311974,0.5538191,0.003328449],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8243137,0.0009450926,0.1260824,0.03413921,0.001239424,0.001094079,0.00000990398,0.002225539,0.009950639],"genre_scores_gemma":[0.9715756,0.00008162124,0.02733732,0.0002373041,0.00004877739,0.00009037424,0.000001511963,0.00001544719,0.0006120143],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5643314,"threshold_uncertainty_score":0.9999893,"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."}}