{"id":"W3166952120","doi":"10.1007/978-3-030-36412-0_10","title":"A Randomized Approximation Algorithm for Metric Triangle Packing","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Triangle inequality; Approximation algorithm; Combinatorics; Disjoint sets; Randomized algorithm; Vertex (graph theory); Mathematics; Metric (unit); Graph; Discrete mathematics; Algorithm; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003692904,0.0006264655,0.00145217,0.002195455,0.0003388964,0.000871647,0.003416057,0.0003701093,0.00001779295],"category_scores_gemma":[0.0004266147,0.000550652,0.0006122562,0.001430137,0.0006836768,0.0008020337,0.00104004,0.0006634477,0.00003496941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002818466,"about_ca_system_score_gemma":0.0006300061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001329784,"about_ca_topic_score_gemma":0.00000886718,"domain_scores_codex":[0.995358,0.0001006488,0.0008753364,0.001761475,0.001128612,0.000775932],"domain_scores_gemma":[0.9940355,0.003346538,0.0006026615,0.001457369,0.0004105382,0.0001473423],"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.0001262415,0.00002625862,4.970527e-7,0.00005672122,0.00002773085,0.000007960408,0.0003459706,0.002970883,0.000004575706,0.07683086,0.00001233677,0.9195899],"study_design_scores_gemma":[0.01471526,0.00009026807,0.000001202489,0.0002142498,0.00001716399,0.0000220631,1.218992e-7,0.6581823,0.0002322449,0.3253645,0.0007045652,0.0004560841],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000003002506,0.0009087481,0.9904213,0.0003817496,0.003494203,0.002253153,0.00001671041,0.0002200571,0.002301085],"genre_scores_gemma":[0.002038964,0.00005610921,0.9958312,0.0007014378,0.0006091399,0.00006768529,0.00001880203,0.00004211157,0.0006345853],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9191339,"threshold_uncertainty_score":0.9996945,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0277038657742993,"score_gpt":0.2624524088311046,"score_spread":0.2347485430568053,"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."}}