{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001283608,0.00004063614,0.0000616977,0.00002267563,0.00003846476,0.00001094618,0.0003120277,0.00001991116,0.00000209881],"category_scores_gemma":[0.000006381798,0.00002597534,0.00005420835,0.0001521286,0.00003380392,0.0001333279,0.0001907588,0.00003815688,0.000001049447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004803272,"about_ca_system_score_gemma":0.00002013194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005785921,"about_ca_topic_score_gemma":0.00009392019,"domain_scores_codex":[0.999552,0.00001830093,0.0001320909,0.00008282041,0.0001154059,0.00009936473],"domain_scores_gemma":[0.999622,0.00003281469,0.00006631117,0.0001830698,0.00008696601,0.000008795525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002149997,0.0003676908,0.03718146,0.00003973524,0.00002455807,6.317255e-7,0.0006622953,0.1436207,0.03240119,0.5558352,0.01408666,0.2157583],"study_design_scores_gemma":[0.0001077782,0.00001907982,0.03558583,0.00002087951,0.000002603551,9.996241e-7,0.00000513241,0.9426304,0.01277435,0.008776496,0.00003811469,0.00003835922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2633865,0.00003095941,0.7250971,0.00006712994,0.00007889121,0.00003148927,4.239601e-7,0.00002197978,0.01128559],"genre_scores_gemma":[0.9873796,0.000001087884,0.01187821,0.0000533863,0.00002512866,6.361482e-7,2.569393e-7,0.000001503004,0.000660201],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7990096,"threshold_uncertainty_score":0.1059244,"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."}}