{"id":"W2952468857","doi":"10.48550/arxiv.0812.3890","title":"Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward Cooperative Networks","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Selection (genetic algorithm); Computer science; Optimal allocation; Computer network; Mathematical optimization; Operations research; Mathematics; Artificial intelligence; Physics","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.0007980087,0.0004620157,0.0005385936,0.0003049951,0.0002832226,0.0005068845,0.000559049,0.0005199713,0.0007500423],"category_scores_gemma":[0.002427022,0.0002505527,0.0001684734,0.0004733757,0.0007427609,0.0008197958,0.0006458576,0.0003009691,0.0001599221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006561668,"about_ca_system_score_gemma":0.0004588451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001722922,"about_ca_topic_score_gemma":0.001802416,"domain_scores_codex":[0.9996378,0.0001915111,0.00001398441,0.00005016676,0.0000575247,0.00004898932],"domain_scores_gemma":[0.9992518,0.0005395797,0.00007423668,0.00005140298,0.00005904919,0.0000239723],"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.00008148247,0.00001973016,0.0002376034,0.00002428467,0.000008630794,0.00007624349,0.0001057029,0.9649137,0.003193317,0.01662082,0.0003311831,0.01438725],"study_design_scores_gemma":[0.0000161884,0.00002980618,0.00007102789,0.000002551819,0.000004366719,0.00002142314,0.00002469648,0.9871014,0.001515981,0.01096025,0.0002482557,0.000004046941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1870623,0.0002615676,0.8077806,0.0002356487,0.00001346505,0.00004485388,0.00008528747,0.0001608717,0.004355376],"genre_scores_gemma":[0.9385753,0.0001534511,0.0596103,0.00002449739,0.000008652262,0.00007032332,0.00003230829,0.00001707702,0.001508035],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001722922,"threshold_uncertainty_score":0.004760861,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03909891575768135,"score_gpt":0.2742635277647624,"score_spread":0.2351646120070811,"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."}}