{"id":"W4400591932","doi":"10.1007/s00224-024-10184-w","title":"Lower Bounds on the Amortized Time Complexity of Shared Objects","year":2024,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Amortized analysis; Computer science; Mathematics; Combinatorics; Data structure; Programming language","routes":{"ca_aff":true,"ca_fund":true,"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.008401525,0.004280659,0.003498658,0.005025096,0.003585592,0.01122643,0.009267488,0.004694512,0.02135277],"category_scores_gemma":[0.05842335,0.001734668,0.003358705,0.006574653,0.005534931,0.02321696,0.008297666,0.01101711,0.00300949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01039203,"about_ca_system_score_gemma":0.00616592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004365596,"about_ca_topic_score_gemma":0.005058138,"domain_scores_codex":[0.987597,0.002584905,0.0005972164,0.001666447,0.00406874,0.00348551],"domain_scores_gemma":[0.8841413,0.09188444,0.002901556,0.01268163,0.004369714,0.004021294],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004240251,0.001005731,0.005305075,0.001566739,0.0005740141,0.0004554752,0.0011092,0.2844703,0.01895181,0.5336893,0.04402784,0.1046044],"study_design_scores_gemma":[0.0001835032,0.0001902119,0.001649717,0.0001805774,0.0002046427,0.0002541091,0.000191188,0.5481767,0.004195261,0.4379973,0.006689549,0.00008720103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.223349,0.01779662,0.6107262,0.02447578,0.00243584,0.000423039,0.004505029,0.004936563,0.1113519],"genre_scores_gemma":[0.8123615,0.005793619,0.1389113,0.003209099,0.00402055,0.001090203,0.003410448,0.003748371,0.02745489],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02135277,"threshold_uncertainty_score":0.07539976,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03001749341853861,"score_gpt":0.2548150286115388,"score_spread":0.2247975351930002,"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."}}