{"id":"W4321176235","doi":"10.48550/arxiv.2302.07800","title":"An Efficient B-tree Implementation for Memory-Constrained Embedded Systems","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Implementation; Tree (set theory); Embedded system; Process (computing); Variety (cybernetics); Automation; Distributed computing; Operating system; Computer hardware; Programming language; Engineering","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.0005100753,0.0004295793,0.0004392249,0.0006824576,0.0005962498,0.001013644,0.001487388,0.0005913002,0.004888183],"category_scores_gemma":[0.002011666,0.0003231021,0.0003163389,0.001661412,0.0003019356,0.001679947,0.0008550085,0.0006629454,0.001985491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004963949,"about_ca_system_score_gemma":0.001110803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002570226,"about_ca_topic_score_gemma":0.00416817,"domain_scores_codex":[0.9994418,0.0001182379,0.00005667124,0.00005718483,0.0002510522,0.00007497231],"domain_scores_gemma":[0.9993017,0.0002202983,0.00004935064,0.000130115,0.0002506751,0.00004800099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009674391,0.0003522258,0.001658597,0.0006466965,0.0001258667,0.0005368533,0.0003824672,0.1821831,0.07933618,0.08221384,0.05008993,0.6015068],"study_design_scores_gemma":[0.0001728185,0.0002397859,0.0004192766,0.00005281295,0.00003486438,0.0002383927,0.00008731098,0.9185472,0.02139287,0.03140712,0.02736254,0.00004496828],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02216683,0.0006352346,0.9661628,0.0002757385,0.00009325761,0.00008767896,0.0003123073,0.004628794,0.005637286],"genre_scores_gemma":[0.181688,0.0003704264,0.8128635,0.0001477793,0.00003293951,0.0001563501,0.0006697488,0.0003861476,0.003685005],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004888183,"threshold_uncertainty_score":0.01635259,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09073197706562114,"score_gpt":0.2539132472490481,"score_spread":0.163181270183427,"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."}}