{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006333623,0.0006203854,0.0008393539,0.0002785054,0.0005499415,0.002022932,0.001149692,0.0006479255,0.00002337794],"category_scores_gemma":[0.00009431782,0.0006190576,0.0003393328,0.0003961518,0.0001176523,0.001475403,0.002145652,0.0008376623,0.00008379855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003313981,"about_ca_system_score_gemma":0.0002609661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009206945,"about_ca_topic_score_gemma":0.00001823028,"domain_scores_codex":[0.9968202,0.00008783764,0.001080044,0.0006747657,0.000632064,0.0007051175],"domain_scores_gemma":[0.9970279,0.0001187352,0.0007974037,0.001212963,0.0005664626,0.0002765199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001862139,0.006956874,0.01738632,0.04539561,0.007450741,0.000637303,0.286251,0.007829485,0.004522302,0.1097605,0.4070254,0.1049223],"study_design_scores_gemma":[0.004518513,0.0002657735,0.001409663,0.001656321,0.000093897,0.000175986,0.001572109,0.8773536,0.001266855,0.0009115167,0.1091804,0.001595406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.174529,0.0005145022,0.8045453,0.000738699,0.004289814,0.003166932,0.001425375,0.0006277672,0.01016257],"genre_scores_gemma":[0.8930405,0.0003825334,0.09634009,0.0008184018,0.0003837881,0.0003839208,0.003394147,0.0001079551,0.00514866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8695241,"threshold_uncertainty_score":0.9996261,"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."}}