{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004209201,0.0003839439,0.0005037893,0.0003864868,0.0006515765,0.00136399,0.002671199,0.0003903921,0.00002986564],"category_scores_gemma":[0.0001196312,0.0004451398,0.0003203659,0.0004171602,0.0003715042,0.0006998052,0.002758845,0.0007489765,0.000006438384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007865635,"about_ca_system_score_gemma":0.0005345332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008063235,"about_ca_topic_score_gemma":0.0004759917,"domain_scores_codex":[0.9977515,0.00008701263,0.0002455419,0.001271984,0.0001205571,0.0005233627],"domain_scores_gemma":[0.9974678,0.000548334,0.0002586894,0.001151228,0.0002041572,0.0003698338],"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.000358675,0.0001768439,0.00162648,0.0001940494,0.0001982343,0.0001131922,0.0005200598,0.008729553,0.00009647694,0.9807631,0.000969283,0.006254096],"study_design_scores_gemma":[0.002343097,0.00006643512,0.0006709707,0.0001237996,0.00009859737,0.000005882482,0.00002788441,0.4707254,0.00009687365,0.5077385,0.01747861,0.0006239614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1680949,0.0001891134,0.8284216,0.000318851,0.002023874,0.0005357558,0.00003711047,0.0002065135,0.00017231],"genre_scores_gemma":[0.9622338,0.0004541565,0.03552887,0.0001799742,0.0004095487,0.000003210578,0.00002504111,0.00002852565,0.001136879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7941389,"threshold_uncertainty_score":0.9998,"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."}}