{"id":"W2115368216","doi":"10.1109/ccece.2005.1557157","title":"Formal description of the ADT-model of B-trees","year":2006,"lang":"en","type":"article","venue":"","topic":"Cognitive Computing and Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Tree traversal; Tree (set theory); Programming language; Formal specification; Implementation; Theoretical computer science; Mathematics","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.002112753,0.0007494918,0.0007489566,0.001596102,0.001285866,0.003526517,0.002451818,0.001559749,0.006516634],"category_scores_gemma":[0.003628213,0.000718332,0.002029947,0.001633485,0.002581059,0.005530917,0.001755695,0.003405503,0.00230097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001896391,"about_ca_system_score_gemma":0.002888338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004629134,"about_ca_topic_score_gemma":0.003500191,"domain_scores_codex":[0.9979559,0.0003828451,0.0002767846,0.0003003698,0.0008731649,0.0002108687],"domain_scores_gemma":[0.9980863,0.0006653597,0.0002142264,0.0003278931,0.0005761276,0.0001300149],"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.00001538953,0.00002100516,0.0001140766,0.00008186815,0.000008820704,0.0001965824,0.0002047158,0.009185261,0.00158447,0.9792508,0.001289832,0.008047126],"study_design_scores_gemma":[0.00005682444,0.00004669314,0.0001149321,0.0001229893,0.00003281995,0.0005769187,0.0001319653,0.1100946,0.003622785,0.792571,0.09258061,0.00004786033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002192223,0.0003500181,0.9868903,0.0003640317,0.00009424608,0.0001141398,0.0003833757,0.0004755694,0.009136094],"genre_scores_gemma":[0.1123235,0.001387197,0.8698043,0.0004957117,0.0002371907,0.001021085,0.001613346,0.0003596313,0.01275813],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006516634,"threshold_uncertainty_score":0.02180034,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02278361286429363,"score_gpt":0.2082293559253152,"score_spread":0.1854457430610215,"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."}}