{"id":"W4411259610","doi":"10.1145/3735950.3735953","title":"Arborescent Garbage Collection: A Dynamic Graph Approach to Immediate Cycle Collection","year":2025,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Garbage collection; Computer science; Manual memory management; Graph; Parallel computing; Database; Garbage; Programming language; Theoretical computer science","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.001389882,0.001008057,0.0009613242,0.002886293,0.001496449,0.00208048,0.004182333,0.0008114653,0.003865934],"category_scores_gemma":[0.004321831,0.0007684749,0.001213129,0.003203199,0.002703559,0.005365604,0.00347111,0.001762788,0.001155564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001466267,"about_ca_system_score_gemma":0.002372306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00683827,"about_ca_topic_score_gemma":0.01262299,"domain_scores_codex":[0.9987733,0.000328633,0.00006361085,0.0003200295,0.0003521396,0.0001622298],"domain_scores_gemma":[0.9966372,0.001096023,0.0002787017,0.00127179,0.0005340307,0.0001822095],"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.0003454918,0.0002050462,0.001131107,0.0006002368,0.0001181884,0.0003539499,0.001178233,0.1677686,0.01599096,0.5256627,0.01168562,0.27496],"study_design_scores_gemma":[0.00004990095,0.0001391891,0.0003300616,0.0001157739,0.0001171761,0.0003128903,0.0002086439,0.4831017,0.01279981,0.4564666,0.04624975,0.0001086482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005125107,0.0005553605,0.9877537,0.0002633941,0.00007396253,0.0001017017,0.0001257985,0.002238084,0.003763011],"genre_scores_gemma":[0.2127193,0.001712248,0.7683733,0.0004812189,0.0002271362,0.0003589468,0.0006244885,0.002490397,0.01301295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00683827,"threshold_uncertainty_score":0.01359689,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00653791225284416,"score_gpt":0.2288611160288647,"score_spread":0.2223232037760206,"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."}}