{"id":"W2062257519","doi":"","title":"Approximation algorithms for labeling hierarchical taxonomies","year":2008,"lang":"en","type":"article","venue":"CaltechAUTHORS (California Institute of Technology)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear programming relaxation; Approximation algorithm; Extension (predicate logic); Mathematics; Algorithm; Linear programming; Steiner tree problem; Discrete mathematics; Combinatorics; Relaxation (psychology); Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.0004132996,0.0002506606,0.0003948115,0.0008116554,0.0003608855,0.00004521406,0.001691204,0.0002829437,0.000004097726],"category_scores_gemma":[0.0002940543,0.0002380577,0.0001344455,0.001091608,0.0005597509,0.0007719858,0.0006610744,0.0002932873,0.00005026484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005555665,"about_ca_system_score_gemma":0.00009007916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006501999,"about_ca_topic_score_gemma":0.000002389053,"domain_scores_codex":[0.9980973,0.00001333275,0.0005575945,0.000607198,0.0002590297,0.0004655589],"domain_scores_gemma":[0.9985901,0.00003265264,0.0002446009,0.0008864526,0.0001557056,0.00009051155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002043252,0.0002181911,0.0003667383,0.0001563865,0.00008254904,0.0000355779,0.00007390192,0.000244726,0.002029996,0.6395,0.003253212,0.3540183],"study_design_scores_gemma":[0.001707656,0.0003779283,0.00009216777,0.0001249411,0.0000444657,0.0001009524,0.00005439414,0.3213538,0.04643474,0.09477287,0.5341301,0.0008059643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01727312,0.0001538466,0.9766034,0.003254494,0.0007017419,0.0006956073,0.0001106716,0.0008523766,0.0003547209],"genre_scores_gemma":[0.06580676,0.0001072408,0.9333662,0.0001048864,0.00009856583,0.0002537149,0.00007693718,0.00001967134,0.0001660205],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5447271,"threshold_uncertainty_score":0.970771,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0422268616914309,"score_gpt":0.2626705395891018,"score_spread":0.2204436778976709,"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."}}