{"id":"W2105217716","doi":"10.1007/978-3-642-23211-4_10","title":"Approximate Bit Vectors for Fast Unification","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto; University of Manitoba","funders":"","keywords":"Unification; Bit (key); Computer science; Bit array; Algorithm; Parsing; Theoretical computer science; Artificial intelligence; Programming language; Type (biology)","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"],"consensus_categories":[],"category_scores_codex":[0.0009460491,0.0004694281,0.0004314427,0.000682576,0.0002569433,0.0004210217,0.003646749,0.0002884197,0.00002113547],"category_scores_gemma":[0.00005837561,0.00041675,0.0001524491,0.000446451,0.0005091096,0.0005983316,0.000777385,0.0003931009,0.00004519123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001744611,"about_ca_system_score_gemma":0.0002915609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001404418,"about_ca_topic_score_gemma":0.00001118388,"domain_scores_codex":[0.9969147,0.00002343717,0.000456065,0.001457438,0.0005241653,0.0006241519],"domain_scores_gemma":[0.997404,0.0003604593,0.0003253133,0.001556231,0.0002098836,0.0001441286],"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.000005568899,0.00002655255,0.000009902774,0.0000520488,0.000008895804,0.000008807004,0.0007968955,0.00108242,0.0004709982,0.2943098,0.000030816,0.7031974],"study_design_scores_gemma":[0.0002245372,0.0001614764,0.0001104032,0.0002248736,0.000009116317,0.00003167089,1.828897e-7,0.3999041,0.00431856,0.5916918,0.002651727,0.0006715856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007194186,0.0002530465,0.993728,0.0002892019,0.001735413,0.0005725375,0.00001111367,0.00028901,0.003049765],"genre_scores_gemma":[0.1644512,0.00006320937,0.8317308,0.001502269,0.0007753153,0.00006980541,0.0000280783,0.00009091449,0.001288371],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7025257,"threshold_uncertainty_score":0.9998285,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02224939784190304,"score_gpt":0.2334661805742715,"score_spread":0.2112167827323684,"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."}}