{"id":"W4239505110","doi":"10.1002/net.20155","title":"Vertex disjoint routings of cycles over tori","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Partition (number theory); Disjoint sets; Computer science; Vertex (graph theory); Hypergraph; Shortest path problem; Mathematics; Torus; Combinatorics; Graph; Computer network; Topology (electrical circuits); Discrete mathematics","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.0001292375,0.0001302212,0.0001839381,0.00004055615,0.00002408755,0.000007152268,0.0001597198,0.0001771506,0.0000307556],"category_scores_gemma":[0.00004087809,0.0001242833,0.00005412925,0.0002305042,0.00007773226,0.00007447004,0.00006426559,0.0002634836,0.000006978029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005460988,"about_ca_system_score_gemma":0.000001879967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003509874,"about_ca_topic_score_gemma":0.00001394958,"domain_scores_codex":[0.9991254,0.000003242606,0.0002498307,0.0001244758,0.0001122424,0.0003847932],"domain_scores_gemma":[0.9995036,0.0001485491,0.00003112693,0.0002476652,0.00001887236,0.00005025143],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002606843,0.00002735768,0.005647365,0.00003549146,0.00005119102,0.00001760173,0.00006274808,0.7822414,0.0009083678,0.02148006,0.005931429,0.1835709],"study_design_scores_gemma":[0.0007192963,0.0001194813,0.07195245,0.0002374559,0.0000411674,0.000008711826,0.0001774266,0.8956332,0.004275466,0.01289968,0.01314923,0.0007864986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3588556,0.002123273,0.6195467,0.00002905941,0.0009990318,0.0001502934,0.000001702555,0.001459118,0.01683523],"genre_scores_gemma":[0.9859721,0.0001574156,0.01361137,0.00002685108,0.0001656416,0.00000267396,0.000002526632,0.00003154783,0.00002984471],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6271165,"threshold_uncertainty_score":0.5068127,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00574838940446828,"score_gpt":0.2192482288374307,"score_spread":0.2134998394329624,"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."}}