{"id":"W2328826103","doi":"10.2316/journal.211.2012.1.211-1056","title":"APPROXIMATION ALGORITHMS FOR SP-MULTICAST TREES IN 2D GRIDS1","year":2012,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Multicast; Computer science; Protocol Independent Multicast; Algorithm; Computer network","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005927866,0.000165881,0.0002122587,0.00005931545,0.0002360352,0.0001315557,0.0001751718,0.0000918271,7.176467e-7],"category_scores_gemma":[0.00002527149,0.0001466643,0.0000431218,0.0002488181,0.00006170095,0.0002654096,0.000142063,0.0001414211,9.241062e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000105981,"about_ca_system_score_gemma":0.000006227357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000087415,"about_ca_topic_score_gemma":0.000001640626,"domain_scores_codex":[0.9988267,0.00007267828,0.0002399732,0.0002935783,0.00008126372,0.0004858096],"domain_scores_gemma":[0.9992962,0.0002810075,0.00007895034,0.0001557671,0.00003048076,0.0001575509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001015214,0.0004896495,0.03401022,0.00007748226,0.00006926255,0.000007607108,0.002452574,0.09385393,0.00004365431,0.1823576,0.0005787169,0.6859577],"study_design_scores_gemma":[0.0008216468,0.00004961191,0.03504132,0.00003621389,0.000008059695,0.00002178038,0.00008529424,0.9582262,0.000008486313,0.005256353,0.0002469186,0.0001980943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06758527,0.001583349,0.9301059,0.0001416513,0.0002499785,0.0001908319,0.00001041266,0.00008683449,0.0000457995],"genre_scores_gemma":[0.9578514,0.00005812932,0.04169135,0.00007020936,0.0002346173,0.00001484949,0.00006505593,0.000006158417,0.000008217389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8902661,"threshold_uncertainty_score":0.5980796,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01964743289847732,"score_gpt":0.2591272715088043,"score_spread":0.239479838610327,"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."}}