{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002314723,0.0001363752,0.0001350446,0.0005080156,0.0002513348,0.0003398047,0.0007146351,0.00003866387,0.00001353672],"category_scores_gemma":[0.00001655413,0.0001268924,0.00005990643,0.003138563,0.00001965132,0.000388612,0.0004456435,0.00008971741,0.00006037247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001097273,"about_ca_system_score_gemma":0.00005031809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001089215,"about_ca_topic_score_gemma":0.00006186927,"domain_scores_codex":[0.9987516,0.00003927661,0.0001927268,0.0005104657,0.000224606,0.0002813546],"domain_scores_gemma":[0.9992864,0.00002143854,0.00003429449,0.0005270873,0.00004954591,0.0000812213],"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.0000759889,0.001442839,0.00105778,0.0001593526,0.0002842541,0.00002163626,0.0009415521,0.001668636,0.0004812994,0.3431325,0.5584316,0.09230255],"study_design_scores_gemma":[0.0009241567,0.0001072835,0.01631342,0.00002513986,0.00002155588,0.000003286784,0.0001082116,0.9504051,0.0004752382,0.006553375,0.02470194,0.0003612524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008155556,0.00003137233,0.8824285,0.001921935,0.0009280414,0.0004515957,0.000002022658,0.0003251619,0.1130958],"genre_scores_gemma":[0.4584339,0.00019609,0.3696123,0.005016275,0.0001435977,0.0005575453,0.00007103625,0.00003127485,0.1659379],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9487365,"threshold_uncertainty_score":0.5174523,"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."}}