{"id":"W2949074990","doi":"10.48550/arxiv.1012.2291","title":"Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Mathematics; Upper and lower bounds; Min entropy; Entropy (arrow of time); Discrete mathematics; Bitwise operation; Binary logarithm; Quantum; Decoding methods; Combinatorics; Entropy rate; Statistical physics; Joint quantum entropy; Principle of maximum entropy; Statistics; Quantum mechanics; Mathematical analysis; Physics; Computer science","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.005945452,0.001631467,0.001706472,0.002776953,0.001631273,0.003893781,0.003517315,0.002130701,0.005232566],"category_scores_gemma":[0.04236287,0.0009196833,0.0015281,0.002621642,0.005786152,0.01248542,0.005567007,0.006954947,0.0009288723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004187951,"about_ca_system_score_gemma":0.001730235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008785065,"about_ca_topic_score_gemma":0.001040527,"domain_scores_codex":[0.993901,0.002035358,0.0002649545,0.0009198521,0.002021246,0.0008576422],"domain_scores_gemma":[0.9491303,0.03867423,0.001849336,0.006070063,0.00293525,0.001340866],"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.0002634956,0.00009771353,0.0009890962,0.0002197988,0.00005526187,0.00009376366,0.0002409974,0.06450421,0.004359835,0.9078143,0.002301842,0.01905969],"study_design_scores_gemma":[0.00002584893,0.00005631771,0.0004503102,0.00005637102,0.00002697298,0.00009182912,0.00003668769,0.3235509,0.005219253,0.6683292,0.002107223,0.00004890687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06758802,0.002921747,0.896261,0.00385684,0.000233273,0.0001170752,0.0004959306,0.0005137257,0.02801231],"genre_scores_gemma":[0.8217803,0.002405659,0.1624043,0.001347825,0.0008363607,0.0006045767,0.0006537961,0.0005750339,0.009392303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005945452,"threshold_uncertainty_score":0.03144294,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1536613408288277,"score_gpt":0.2483281426718979,"score_spread":0.09466680184307019,"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."}}