{"id":"W7134998384","doi":"","title":"A Concurrent List with Adaptive Bounds","year":2025,"lang":"en","type":"other","venue":"YorkSpace (York University)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Set (abstract data type); Bounded function; Amortized analysis; Data structure; Key (lock); Concurrent data structure; Concurrency","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.002185893,0.0006542678,0.0007151224,0.001362281,0.002141037,0.003827706,0.00347001,0.0009561941,0.006375419],"category_scores_gemma":[0.01023501,0.0007297414,0.0007275999,0.002155259,0.002094232,0.008662594,0.005720228,0.00203533,0.001731002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00201916,"about_ca_system_score_gemma":0.002608667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002919973,"about_ca_topic_score_gemma":0.002496895,"domain_scores_codex":[0.9964324,0.0004594757,0.0003286629,0.0007623481,0.00156149,0.0004555022],"domain_scores_gemma":[0.9909067,0.002381114,0.0005957799,0.004140625,0.001512553,0.000463094],"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.001237166,0.0003326548,0.004440376,0.0003795281,0.00008126253,0.0002965628,0.000980542,0.06046949,0.0339396,0.5974465,0.01054725,0.2898491],"study_design_scores_gemma":[0.0003353998,0.0005889555,0.0006438245,0.00009186436,0.0001436773,0.0005716715,0.0002328329,0.5604659,0.04934862,0.3173924,0.07003206,0.000152698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06481103,0.0005710976,0.9148956,0.0006085443,0.0001983668,0.0002114498,0.0003103845,0.00511997,0.01327363],"genre_scores_gemma":[0.4657472,0.0002948187,0.5164634,0.0003568038,0.0002278269,0.0005597573,0.0005226691,0.0008935221,0.01493401],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006375419,"threshold_uncertainty_score":0.02132797,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01165322766349858,"score_gpt":0.194893188028209,"score_spread":0.1832399603647104,"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."}}