{"id":"W2405783155","doi":"","title":"Constructive Proofs of Concentration Bounds.","year":2010,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Mathematical proof; Discrete mathematics; Product (mathematics); Constructive; Constructive proof; Simple (philosophy); Chernoff bound; Random variable; Direct proof; Upper and lower bounds; Direct product; Combinatorics; Computer science; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.00008621072,0.00004377978,0.00006537703,0.00002242206,0.00004807276,0.00004285919,0.0003083968,0.00002706782,0.00006578567],"category_scores_gemma":[0.00001944562,0.00003792275,0.00002819358,0.0001591507,0.0001686668,0.0002519382,0.0000661863,0.0000910227,0.000006608619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002879362,"about_ca_system_score_gemma":0.00005193596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001956202,"about_ca_topic_score_gemma":0.00002617569,"domain_scores_codex":[0.9995516,0.00001088799,0.000106745,0.000127084,0.0001143977,0.00008927894],"domain_scores_gemma":[0.9995707,0.00003796311,0.00004580404,0.0002297509,0.00008469553,0.00003111342],"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":[7.886637e-7,0.00001876596,0.0007742603,0.000002270194,0.000003721366,4.914561e-7,0.0001728647,5.208122e-7,0.005993553,0.960217,0.0001209831,0.03269478],"study_design_scores_gemma":[0.0007675628,0.0001640697,0.01463698,0.00001248926,0.000005702637,0.00006563601,0.00009057011,0.09058362,0.258445,0.6253424,0.009567413,0.0003184692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.172702,0.00001630985,0.7543148,0.0004973076,0.001779377,0.0001870607,0.000002941717,0.0001435715,0.07035663],"genre_scores_gemma":[0.8401988,7.423156e-7,0.1596448,0.00005391398,0.00003347706,0.000002196654,5.090096e-7,0.00000106393,0.0000645113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6674969,"threshold_uncertainty_score":0.1546445,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006978116070101357,"score_gpt":0.2256066407101111,"score_spread":0.2186285246400097,"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."}}