{"id":"W4411141435","doi":"10.1145/3725240","title":"Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Spanning tree; Minimum spanning tree; Minimum degree spanning tree; Combinatorics; Perturbation (astronomy); Mathematics; Physics","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":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0007960676,0.0001612368,0.0002070176,0.0002272526,0.0001265509,0.0001432591,0.09012894,0.00006403822,0.000001383793],"category_scores_gemma":[0.008152371,0.0001280891,0.00005548649,0.0007121661,0.0001191415,0.001280113,0.250284,0.000120655,0.000001308635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004450688,"about_ca_system_score_gemma":0.00001410126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003100976,"about_ca_topic_score_gemma":2.605868e-7,"domain_scores_codex":[0.9983718,0.000005276459,0.0003653311,0.0006228499,0.0003832762,0.0002514831],"domain_scores_gemma":[0.9892777,0.000127046,0.0003829993,0.01007353,0.0001211971,0.00001749785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001256188,0.0002877069,0.001930885,0.00164923,0.0004485141,6.233606e-7,0.00009728827,0.00004028924,0.007074493,0.2021202,0.6811937,0.1050314],"study_design_scores_gemma":[0.0009360341,0.0002161494,0.004611975,0.001068561,0.0001351808,9.371353e-7,0.0001639727,0.2793671,0.04181264,0.6534608,0.0179381,0.000288479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1658163,0.0003729489,0.6077154,0.2098348,0.001165177,0.003155156,0.0002859435,0.0009888747,0.01066533],"genre_scores_gemma":[0.1460842,0.00006393252,0.8531748,0.0001675601,0.00001756221,0.00004010918,0.0000291463,0.00001046021,0.0004121964],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6632556,"threshold_uncertainty_score":0.9759738,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05061472259112793,"score_gpt":0.3086069096880938,"score_spread":0.2579921870969659,"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."}}