{"id":"W6893227800","doi":"10.5281/zenodo.15772009","title":"Concurrent Binary Search Trees Supporting Split and Join","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Traverse; Optimal binary search tree; Binary search tree; Join (topology); Binary tree; Node (physics); Random binary tree; Tree (set theory); Weight-balanced tree","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.002101128,0.0004421074,0.001081067,0.0007310169,0.001335908,0.00235258,0.002067113,0.001013942,0.001670778],"category_scores_gemma":[0.01049,0.0004922666,0.0005040091,0.001413846,0.001157282,0.004778014,0.002296397,0.001215011,0.0004630907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006220179,"about_ca_system_score_gemma":0.001160975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002677362,"about_ca_topic_score_gemma":0.002358118,"domain_scores_codex":[0.9984272,0.0002464569,0.0001333342,0.0003615625,0.0004946861,0.0003368457],"domain_scores_gemma":[0.9924272,0.003845372,0.0008050877,0.001335921,0.0009999517,0.0005864999],"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.002813541,0.0007006741,0.007920207,0.0007079269,0.0001638069,0.001020705,0.001913514,0.3974105,0.09873994,0.1977526,0.005028835,0.2858277],"study_design_scores_gemma":[0.0001415464,0.0002841668,0.0006595216,0.00003000328,0.00006370671,0.0003449547,0.000255497,0.8549994,0.01924332,0.1190047,0.004934574,0.00003860073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1719361,0.0006525809,0.8226154,0.0004797483,0.00007346417,0.0001488446,0.0002093394,0.001063599,0.002820791],"genre_scores_gemma":[0.7438361,0.0002812753,0.2529145,0.00008549856,0.00008439818,0.00013723,0.0003183708,0.0001807743,0.002161803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002677362,"threshold_uncertainty_score":0.01111192,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02834605984928738,"score_gpt":0.2730796931195397,"score_spread":0.2447336332702524,"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."}}