{"id":"W2001432254","doi":"10.1016/j.dam.2003.11.009","title":"A note on line broadcast in digraphs under the edge-disjoint paths mode","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Concordia University; University of Ottawa","keywords":"Digraph; Mathematics; Combinatorics; Disjoint sets; Time complexity; Line (geometry); Approximation algorithm; Enhanced Data Rates for GSM Evolution; Integer (computer science); Node (physics); Discrete mathematics; Tree (set theory); Degree (music); Running time; Algorithm; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002286782,0.0007135872,0.001503846,0.001359035,0.002206747,0.003529754,0.002462278,0.002431839,0.008896643],"category_scores_gemma":[0.01760203,0.0006373315,0.001243312,0.00312653,0.0037326,0.01041278,0.003455712,0.00553427,0.00113117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002760338,"about_ca_system_score_gemma":0.001256706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002920795,"about_ca_topic_score_gemma":0.001959417,"domain_scores_codex":[0.9977169,0.0008298063,0.00009074702,0.0004690306,0.0005063539,0.0003872056],"domain_scores_gemma":[0.984013,0.01229928,0.0007117181,0.001563077,0.0008423348,0.0005706482],"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.0002757112,0.0000420938,0.0003971817,0.0001650675,0.00003228373,0.0001295688,0.0003760161,0.01359858,0.001585349,0.9464137,0.01230838,0.02467618],"study_design_scores_gemma":[0.00006397232,0.0000677752,0.0002247308,0.00005213511,0.00005305561,0.0001754003,0.0001721972,0.05693991,0.001183419,0.9281248,0.01290205,0.00004051669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07687211,0.004884921,0.7864501,0.01488413,0.001746596,0.000171377,0.0008254979,0.0008387207,0.1133265],"genre_scores_gemma":[0.8237686,0.01017098,0.119786,0.004352084,0.005090553,0.0004824396,0.000560782,0.0005121926,0.03527648],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008896643,"threshold_uncertainty_score":0.02976227,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02844779790054058,"score_gpt":0.2786110544461827,"score_spread":0.2501632565456421,"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."}}