{"id":"W3191976396","doi":"10.4230/lipics.disc.2021.12","title":"Space and Time Bounded Multiversion Garbage Collection","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"Horizon 2020 Framework Programme","keywords":"Garbage collection; Amortized analysis; Computer science; Garbage; Bounded function; Pointer (user interface); Concurrency; Constant (computer programming); Reachability; Concurrency control; Set (abstract data type); Data structure; Algorithm; Theoretical computer science; Programming language; Mathematics; Artificial intelligence","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.003178825,0.001434677,0.001225368,0.002516565,0.001867266,0.003562355,0.004609848,0.000882139,0.00530431],"category_scores_gemma":[0.01035078,0.0008649048,0.001693796,0.003548216,0.003032907,0.006633379,0.006076113,0.002169839,0.001792454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002174922,"about_ca_system_score_gemma":0.003102604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001991709,"about_ca_topic_score_gemma":0.003026947,"domain_scores_codex":[0.9945755,0.0007502584,0.0005033523,0.0009198086,0.002631125,0.0006199756],"domain_scores_gemma":[0.986702,0.002855744,0.0009949675,0.007534583,0.001567597,0.0003450634],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009309372,0.0002052316,0.003148835,0.0009705303,0.0001757508,0.0002398653,0.001150533,0.132823,0.06525686,0.2880608,0.01256603,0.4944715],"study_design_scores_gemma":[0.0001779149,0.0003563827,0.0007346286,0.0001841935,0.0002024149,0.0005484422,0.0002259753,0.5065783,0.1970417,0.2329319,0.06080307,0.0002150377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007779618,0.0004234445,0.9854724,0.0001506755,0.00005483164,0.0000712619,0.0001384567,0.004038386,0.001870804],"genre_scores_gemma":[0.1841768,0.0004616885,0.8081536,0.0001632151,0.0000836574,0.0003071304,0.0006384612,0.001446668,0.004568705],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00530431,"threshold_uncertainty_score":0.01774466,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01013403197380855,"score_gpt":0.2330566467617833,"score_spread":0.2229226147879747,"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."}}