{"id":"W1983111002","doi":"10.1109/ccece.2012.6334994","title":"Capacity regions for multi-hop ad-hoc wireless networks using conflict graphs","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computation; Wireless ad hoc network; Computer science; Computational complexity theory; Wireless; Theoretical computer science; Wireless network; Topology (electrical circuits); Graph; Communication complexity; Distributed computing; Hop (telecommunications); Reduction (mathematics); Algorithm; Mathematics; Computer network; Telecommunications; Combinatorics","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.003746681,0.001473343,0.000949526,0.002248518,0.0006572868,0.002388025,0.002040515,0.0007923681,0.002236841],"category_scores_gemma":[0.0119522,0.0006672347,0.001526525,0.002090978,0.00187223,0.004069314,0.001869636,0.002220545,0.0004029227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002170356,"about_ca_system_score_gemma":0.0009995369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002069023,"about_ca_topic_score_gemma":0.0007914132,"domain_scores_codex":[0.9974861,0.001327577,0.0001013658,0.0002203685,0.0005951329,0.0002694656],"domain_scores_gemma":[0.9908235,0.007282473,0.0004552522,0.0004092703,0.0008632077,0.0001663497],"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.00007344124,0.00002768335,0.0003865757,0.000163716,0.00004735577,0.00009143589,0.0001438609,0.6561445,0.001475519,0.3258658,0.001441791,0.01413833],"study_design_scores_gemma":[0.000007399985,0.00002529049,0.0001307809,0.00003339593,0.00001105056,0.00005564558,0.00003730477,0.8675177,0.001085237,0.1295798,0.001497556,0.00001895197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01261237,0.001224044,0.9785718,0.0002690203,0.00002648865,0.00005913336,0.0001522086,0.0001183114,0.006966573],"genre_scores_gemma":[0.7677451,0.002943316,0.2242171,0.0002516314,0.0002178982,0.000607135,0.0004830178,0.0002748788,0.003259957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003746681,"threshold_uncertainty_score":0.01981455,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09745314554039257,"score_gpt":0.2983326827866247,"score_spread":0.2008795372462321,"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."}}