{"id":"W1985988498","doi":"10.1109/tvt.2012.2200051","title":"An Optimal Probabilistic Multiple-Access Scheme for Cognitive Radios","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Queue; Queueing theory; Network packet; Scheduling (production processes); Computer network; Transmitter power output; Channel (broadcasting); Probabilistic logic; Cognitive radio; Queuing delay; Transmission (telecommunications); Real-time computing; Transmitter; Mathematical optimization; Wireless; Telecommunications; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002317024,0.0002605992,0.0002873517,0.0004322242,0.0004001967,0.0001161594,0.0006175763,0.000288015,0.000009338535],"category_scores_gemma":[0.0000364087,0.0002617511,0.0001459552,0.0007811302,0.0001947745,0.0008040941,0.000006573746,0.0004126501,0.00002191659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000955571,"about_ca_system_score_gemma":0.00005196432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006137589,"about_ca_topic_score_gemma":0.0000183127,"domain_scores_codex":[0.9982382,0.00006641408,0.0002556633,0.0005583235,0.0001744254,0.0007069397],"domain_scores_gemma":[0.9987794,0.000261824,0.00008535033,0.0005190089,0.0001941656,0.0001602716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004451962,0.003583816,0.0007790161,0.0001026705,0.0005612695,0.00007827111,0.0008783131,0.03379433,0.0244409,0.02017167,0.0000903679,0.9150742],"study_design_scores_gemma":[0.001731323,0.000727639,0.0002842337,0.00008469277,0.00008820917,0.000258268,0.0001222918,0.8505787,0.1438967,0.0008908888,0.0007305056,0.0006065031],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2079537,0.0001298305,0.7894163,0.0004519872,0.0004471714,0.0006806017,0.0000154256,0.000876662,0.0000284163],"genre_scores_gemma":[0.9532062,0.00001697779,0.0461986,0.0001735155,0.0001053803,0.0002435744,0.000004111774,0.00003963262,0.00001194755],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9144677,"threshold_uncertainty_score":0.9999835,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02274498271664163,"score_gpt":0.2850438040541834,"score_spread":0.2622988213375418,"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."}}