{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002748574,0.0003962838,0.0004038677,0.0006998102,0.0008161375,0.0008359461,0.0005583056,0.0003665607,0.00236208],"category_scores_gemma":[0.001587967,0.0003451839,0.0002947379,0.0006262347,0.0005722342,0.0009441287,0.0009155257,0.0003306028,0.000174186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001047787,"about_ca_system_score_gemma":0.0004748934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003074651,"about_ca_topic_score_gemma":0.003920907,"domain_scores_codex":[0.9996998,0.00008926704,0.00001677486,0.00005980785,0.00005209578,0.00008227784],"domain_scores_gemma":[0.9993374,0.0002657128,0.000132854,0.00006826999,0.00007594599,0.0001198093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004650321,0.00006584847,0.002259894,0.0001895775,0.00007962371,0.0004310982,0.0004968345,0.7328786,0.01313999,0.1898119,0.003135216,0.05704638],"study_design_scores_gemma":[0.00004754635,0.0001172679,0.0008627693,0.00003692158,0.00002924478,0.0001073621,0.0002843031,0.8738078,0.003614232,0.113773,0.007298674,0.0000208707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7783722,0.0006569366,0.2028727,0.000398398,0.00005194786,0.0001939996,0.0003028851,0.0002545722,0.01689632],"genre_scores_gemma":[0.9548984,0.0003109936,0.04000979,0.00007919328,0.0000195462,0.0001301398,0.0002554636,0.00004086727,0.00425558],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003074651,"threshold_uncertainty_score":0.007901907,"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."}}