{"id":"W3037831187","doi":"10.1016/j.tcs.2022.08.001","title":"APX-hardness and approximation for the k-burning number problem","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; Mathematics; APX; Generalization; Approximation algorithm; Sequence (biology); Binary logarithm; Running time; Graph; Discrete mathematics; Physics; Algorithm; Chemistry","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.001107213,0.00007354993,0.00009402583,0.00002956928,0.001054497,0.0001560655,0.0004604302,0.000004987975,0.0002852372],"category_scores_gemma":[0.000003529924,0.00005203285,0.00004367785,0.0003790442,0.0006975546,0.00009167693,0.0005995848,0.0001169244,0.000001970595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001808796,"about_ca_system_score_gemma":0.00002446477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005342122,"about_ca_topic_score_gemma":6.054437e-8,"domain_scores_codex":[0.9991276,0.00005254589,0.0001209472,0.0002503902,0.0002384978,0.0002100355],"domain_scores_gemma":[0.9994628,0.000179372,0.00004883616,0.0002100236,0.00005513598,0.00004379423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003951932,0.00001864135,0.0005872223,0.000001906084,0.000005771524,5.753508e-8,0.0002093991,0.0003978536,0.00004515388,0.9300222,0.0001983311,0.06850949],"study_design_scores_gemma":[0.0000722032,0.00002800224,0.0001541879,0.000002865112,0.00001246956,0.000001851835,0.00004168209,0.602345,0.0001936272,0.395326,0.001752172,0.00006994441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01882062,0.000009073717,0.9777374,0.0004396328,0.00008011481,0.0002867977,0.000003162655,0.00004419224,0.002579016],"genre_scores_gemma":[0.9557691,2.401739e-7,0.04385037,0.0000823225,0.0001354841,0.0001320915,0.000003193875,0.000005330569,0.0000219028],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9369485,"threshold_uncertainty_score":0.8110442,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008813310435495127,"score_gpt":0.2630747561018924,"score_spread":0.2542614456663973,"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."}}