{"id":"W4386147958","doi":"10.48550/arxiv.2308.11736","title":"Smooth min-entropy lower bounds for approximation chains","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Combinatorics; Entropy (arrow of time); Equipartition theorem; Sigma; Mathematics; Physics; Statistical physics; Discrete mathematics; Quantum mechanics; Mathematical analysis","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003970538,0.001638756,0.001498305,0.002560016,0.001547394,0.002712264,0.002379149,0.001667988,0.006930212],"category_scores_gemma":[0.0264517,0.0008157483,0.001798474,0.001699882,0.005691692,0.007612549,0.005383817,0.005637865,0.0008323618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003303484,"about_ca_system_score_gemma":0.001264834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001175371,"about_ca_topic_score_gemma":0.001090398,"domain_scores_codex":[0.9967063,0.0007633929,0.000158122,0.0006993439,0.001091177,0.0005815657],"domain_scores_gemma":[0.9782041,0.01563945,0.001332312,0.002706682,0.001061861,0.001055614],"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.000266609,0.00005946271,0.00211228,0.0001878557,0.00008011859,0.0001694224,0.0003200558,0.1328533,0.005312773,0.8471643,0.001156506,0.01031732],"study_design_scores_gemma":[0.00001177555,0.00007283061,0.000705496,0.00004784677,0.0000231318,0.00007448603,0.00004307222,0.4783551,0.002883123,0.5167553,0.0009900372,0.00003783446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2013679,0.001947199,0.7582445,0.001546552,0.0001327584,0.0001383859,0.0007132863,0.0004725962,0.03543681],"genre_scores_gemma":[0.9313076,0.0009908314,0.05816604,0.0004719664,0.0002261037,0.0002777347,0.0006404718,0.0003122068,0.007606857],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006930212,"threshold_uncertainty_score":0.02396858,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2291256863720948,"score_gpt":0.2740217540377214,"score_spread":0.04489606766562657,"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."}}