{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001075623,0.0007542292,0.0007062625,0.0009175037,0.0005400835,0.001254789,0.004917282,0.0004028664,0.00005196176],"category_scores_gemma":[0.0001738203,0.0007180669,0.000243502,0.001107776,0.001562054,0.0007660456,0.001458332,0.001240669,0.00009579588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003870045,"about_ca_system_score_gemma":0.0007843206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002043362,"about_ca_topic_score_gemma":0.00008788212,"domain_scores_codex":[0.994584,0.00007013245,0.0006763638,0.00222938,0.001394173,0.00104598],"domain_scores_gemma":[0.9962587,0.0005029383,0.00031756,0.002297964,0.0003228481,0.0002999252],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006661065,0.00009874604,0.00002957813,0.00009584946,0.00002609156,0.0002678025,0.0009701812,0.007263404,0.00002303032,0.2705196,0.0001724023,0.7205267],"study_design_scores_gemma":[0.0002232365,0.0001699115,0.00006672728,0.000219816,0.000007652019,0.0001470837,7.885463e-8,0.2914326,0.0001043526,0.702068,0.004822032,0.0007386075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007985822,0.0004569183,0.985146,0.001219793,0.003324667,0.0005921038,0.000009091218,0.0002863903,0.008885172],"genre_scores_gemma":[0.01991066,0.00002321558,0.9745445,0.004359375,0.0003974585,0.00002494738,0.000008272337,0.00006738011,0.0006642281],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7197881,"threshold_uncertainty_score":0.999782,"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."}}