{"id":"W2774310322","doi":"10.1109/iceca.2017.8203701","title":"Construction of estimated level based balanced binary search tree","year":2017,"lang":"en","type":"article","venue":"2017 International conference of Electronics, Communication and Aerospace Technology (ICECA)","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Tree traversal; Binary search tree; Binary tree; Computer science; Data structure; Tree (set theory); Binary number; Block (permutation group theory); Linked list; Memory management; Self-balancing binary search tree; Node (physics); Optimal binary search tree; Key (lock); Auxiliary memory; Tree structure; Algorithm; Interval tree; Mathematics; Arithmetic; Semiconductor memory; Computer hardware; Operating system; Engineering; Combinatorics","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.0003160559,0.0001791328,0.0003068041,0.0004949503,0.0003317278,0.0001122007,0.004693513,0.0002406099,0.0000165872],"category_scores_gemma":[0.0006437093,0.0001886356,0.00004355142,0.0002178205,0.001778028,0.000838738,0.001418734,0.0004616803,0.00000487997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008419976,"about_ca_system_score_gemma":0.0002768403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006290249,"about_ca_topic_score_gemma":0.0001733454,"domain_scores_codex":[0.9987114,0.00004661038,0.0003489328,0.000365903,0.0002675584,0.0002596138],"domain_scores_gemma":[0.9957618,0.0001132785,0.0007670572,0.002557158,0.000765661,0.00003508664],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003144955,0.00008125708,0.007703876,0.00001787054,0.00004792607,0.000001549487,0.00005014254,0.00004261202,0.05594147,0.8945577,0.00009000622,0.04143413],"study_design_scores_gemma":[0.003018173,0.0007416256,0.0365924,0.0005797389,0.00003521037,0.00007581016,0.0006617913,0.3043995,0.4919304,0.1601938,0.001051229,0.0007202234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3597746,0.002049309,0.5832202,0.04508344,0.0002792808,0.0005506657,0.0001232771,0.0008391808,0.008079973],"genre_scores_gemma":[0.8139133,0.001562696,0.1843511,0.00001749124,0.000003118845,0.00001929976,0.00003130054,0.000007343423,0.00009433369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7343639,"threshold_uncertainty_score":0.8721793,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09255252992105223,"score_gpt":0.3422129583233829,"score_spread":0.2496604284023307,"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."}}