{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01076565,0.004110902,0.002538025,0.00653885,0.00336905,0.007536188,0.005849819,0.003372993,0.0367665],"category_scores_gemma":[0.07483146,0.002303426,0.005039311,0.005464898,0.007445267,0.01408297,0.01284782,0.0127913,0.007003715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006019951,"about_ca_system_score_gemma":0.003007261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001457495,"about_ca_topic_score_gemma":0.001434074,"domain_scores_codex":[0.9846245,0.004367869,0.0006853334,0.002227256,0.006887198,0.0012078],"domain_scores_gemma":[0.9264155,0.05170663,0.003402564,0.008086977,0.008595264,0.001793135],"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.00002805422,0.00006627613,0.0001995389,0.0002445038,0.00005409743,0.0001109967,0.00012378,0.003992094,0.0006414125,0.9741339,0.008581076,0.01182423],"study_design_scores_gemma":[0.00002949031,0.00002050183,0.0001145332,0.00007206989,0.00003485388,0.0001678178,0.00003008173,0.01376261,0.0009680646,0.9736357,0.01113356,0.00003060415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003580179,0.002493401,0.9313701,0.004636512,0.0008292783,0.0002270087,0.0009926936,0.0008164473,0.0550543],"genre_scores_gemma":[0.3512338,0.007303107,0.5776612,0.01101943,0.005254846,0.003577786,0.003534679,0.002203982,0.03821118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0367665,"threshold_uncertainty_score":0.1229962,"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."}}