{"id":"W4205196045","doi":"10.1109/ojcoms.2021.3135290","title":"Low-Complexity Resource Allocation for Dense Cellular Vehicle-to-Everything (C-V2X) Communications","year":2021,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Resource allocation; Scalability; Cellular network; Quality of service; Mathematical optimization; Optimization problem; Computational complexity theory; Channel (broadcasting); Computer network; Distributed computing; Algorithm; 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.0007223681,0.0007689624,0.0008154197,0.0003519764,0.0004966055,0.0009512546,0.001230061,0.0005087107,0.0024709],"category_scores_gemma":[0.001741779,0.0003332334,0.0004390748,0.0006693989,0.0005602313,0.001061106,0.001347895,0.001002087,0.0004474956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007795766,"about_ca_system_score_gemma":0.001145292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002899563,"about_ca_topic_score_gemma":0.002816447,"domain_scores_codex":[0.9994271,0.0001673893,0.00001876095,0.0001071441,0.0001675049,0.0001122557],"domain_scores_gemma":[0.9994724,0.0003006886,0.00006163997,0.00005298497,0.0000769904,0.00003535988],"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.00008912691,0.00006149055,0.0003794516,0.00009740485,0.00001693972,0.00008266792,0.00006758287,0.8921145,0.004869785,0.02409476,0.002344522,0.07578184],"study_design_scores_gemma":[0.000005570082,0.00001830131,0.00003939008,0.000002963808,0.000002764787,0.00001816266,0.00001341917,0.9958686,0.0005775372,0.003008336,0.0004415712,0.000003437986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.010291,0.0002374822,0.9863067,0.0001043652,0.00002713468,0.00004018888,0.00001918311,0.0001818956,0.002792106],"genre_scores_gemma":[0.771685,0.0005151618,0.2241943,0.000155281,0.00005205352,0.0001972093,0.0001020618,0.00007454296,0.0030244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002899563,"threshold_uncertainty_score":0.008266032,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06462855490022049,"score_gpt":0.2951307418216423,"score_spread":0.2305021869214219,"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."}}