{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006960022,0.0002802055,0.0003085788,0.0003856387,0.0002347344,0.0002797454,0.001596536,0.000210685,0.00000433105],"category_scores_gemma":[0.00002659019,0.0003346769,0.0001732617,0.0004756004,0.00005384145,0.0001769567,0.0006546191,0.0002106682,0.00002056285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001813551,"about_ca_system_score_gemma":0.0002234243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000167571,"about_ca_topic_score_gemma":0.00002857493,"domain_scores_codex":[0.997928,0.0002069061,0.0002988821,0.001091549,0.000109133,0.0003655779],"domain_scores_gemma":[0.9979769,0.0001475074,0.0003494428,0.001088682,0.0002892466,0.0001482232],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008891649,0.00004570487,0.00006856288,0.00006451817,0.00004090762,0.00002177082,0.0002828597,0.9330764,0.00002556571,0.06488203,0.0007172106,0.0007655252],"study_design_scores_gemma":[0.0004929036,0.00008621727,0.0001036388,0.00005447412,0.00003536562,0.000002046325,0.0003185273,0.9928368,0.0002490453,0.005406806,0.00005414025,0.0003599876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02914091,0.00001538373,0.966683,0.00005451102,0.0009108696,0.0009714436,0.00004460737,0.001807023,0.000372263],"genre_scores_gemma":[0.9685255,0.00001701492,0.03058575,0.00003299783,0.00009261641,0.00001173495,0.0001370338,0.00002661533,0.0005706946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9393846,"threshold_uncertainty_score":0.9999105,"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."}}