{"id":"W1499475083","doi":"10.1007/3-540-44849-7_26","title":"Nearly Bounded Error Probabilistic Sets","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Connection (principal bundle); Time complexity; Probabilistic logic; Bounded function; Complexity class; Discrete mathematics; Class (philosophy); Combinatorics; Randomized algorithm; Cryptography; Polynomial; Probabilistic analysis of algorithms; Computer science; Computational complexity theory; Mathematics; Algorithm; Artificial intelligence","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.003453978,0.001480497,0.002133339,0.001676328,0.001721203,0.003883095,0.003565466,0.002537714,0.01260034],"category_scores_gemma":[0.02978677,0.001338573,0.001339909,0.00228727,0.00388953,0.00722305,0.00896081,0.006371656,0.00285107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002639885,"about_ca_system_score_gemma":0.001115743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007777487,"about_ca_topic_score_gemma":0.0006868136,"domain_scores_codex":[0.9949443,0.001089299,0.0002024437,0.000842452,0.002586934,0.0003345461],"domain_scores_gemma":[0.9804485,0.01189918,0.000814621,0.00487711,0.00137942,0.0005811566],"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.0001222529,0.0000231573,0.0002460268,0.00010295,0.00002645547,0.00003642727,0.00008202672,0.03314635,0.0009724547,0.9320892,0.004623964,0.0285288],"study_design_scores_gemma":[0.00001068186,0.00001871258,0.0001380795,0.00002595791,0.00001048399,0.00007231341,0.000016786,0.07682985,0.001101172,0.9172256,0.004537552,0.00001281481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02266935,0.001446953,0.9037136,0.002211249,0.0003960146,0.00008058755,0.0006050938,0.0009703182,0.06790672],"genre_scores_gemma":[0.6266916,0.002460273,0.283047,0.001817797,0.001040868,0.0005625655,0.00216522,0.001324149,0.08089063],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01260034,"threshold_uncertainty_score":0.04215229,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02953993998092934,"score_gpt":0.2593161153289079,"score_spread":0.2297761753479786,"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."}}