{"id":"W7096919117","doi":"","title":"University of Alberta Correct and Efficient Search Algorithms in the Presence of Repetitions","year":2008,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Search algorithm; Key (lock); Feature (linguistics); Search engine indexing","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002084822,0.001131675,0.00171518,0.002294188,0.002328684,0.004780741,0.002455848,0.002540105,0.02211452],"category_scores_gemma":[0.02404337,0.001074908,0.001176981,0.003184454,0.003273026,0.003472555,0.002119678,0.004195894,0.00432692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005809683,"about_ca_system_score_gemma":0.00709187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.06277515,"about_ca_topic_score_gemma":0.08212788,"domain_scores_codex":[0.9963617,0.0007361651,0.0001531269,0.0008192896,0.001455434,0.0004742516],"domain_scores_gemma":[0.9768277,0.01439661,0.0008000789,0.003502395,0.003702111,0.0007710588],"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.001605538,0.0003174156,0.003676752,0.0006537801,0.0001473358,0.0006193499,0.0005274613,0.2088064,0.00830186,0.4873924,0.07732423,0.2106275],"study_design_scores_gemma":[0.0002728832,0.0001019744,0.001600281,0.0002116707,0.0001232662,0.0004715493,0.0001802899,0.3369106,0.007427907,0.5949337,0.05766374,0.0001020646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1474278,0.008243465,0.5685019,0.02153439,0.002804679,0.0002305179,0.002314401,0.005032821,0.2439101],"genre_scores_gemma":[0.5732851,0.003967021,0.2854213,0.001094376,0.001114607,0.0001823029,0.002653179,0.001130036,0.131152],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06277515,"threshold_uncertainty_score":0.1248195,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02883123464871475,"score_gpt":0.2300964380406954,"score_spread":0.2012652033919807,"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."}}