{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009413798,0.0004481585,0.0006157649,0.0003276158,0.0002030966,0.00009219258,0.0006366136,0.0005311275,0.00003042035],"category_scores_gemma":[0.0005294956,0.0005001088,0.0005817158,0.0003297685,0.0001093872,0.0001085065,0.0006590302,0.0004712154,0.000002524649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003401311,"about_ca_system_score_gemma":0.0001565188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005714032,"about_ca_topic_score_gemma":0.0001198098,"domain_scores_codex":[0.9978193,0.0001805325,0.0003520982,0.001015657,0.0001250498,0.0005073359],"domain_scores_gemma":[0.9973233,0.0006611767,0.0004320258,0.001131427,0.0002729486,0.0001791197],"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.0003131931,0.0003362111,0.0002950061,0.001716568,0.0003528104,0.0001455699,0.0006292674,0.004509874,0.0002087137,0.9742435,0.01628059,0.0009687149],"study_design_scores_gemma":[0.002059209,0.0001984362,0.00007216287,0.0004036636,0.0006947917,0.000002561868,0.0007385114,0.42261,0.0003386684,0.5502453,0.02137767,0.001258975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1874393,0.00002863257,0.8053749,0.0001663002,0.001790446,0.001342231,0.0001828972,0.0004636009,0.003211769],"genre_scores_gemma":[0.8662426,0.0002378332,0.04249596,0.0001214918,0.0007001266,0.00003599132,0.0002522426,0.0002231752,0.08969052],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7628789,"threshold_uncertainty_score":0.9997451,"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."}}