{"id":"W3134117472","doi":"10.1007/978-3-030-68211-8_22","title":"APX-Hardness and Approximation for the k-Burning Number Problem","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; APX; Generalization; Approximation algorithm; Running time; Graph; Mathematics; Sequence (biology); Binary logarithm; Discrete mathematics; Physics; Algorithm; Chemistry; Mathematical analysis","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.0004480881,0.0002362492,0.0002902529,0.00009177854,0.00028088,0.0003246684,0.0004540152,0.00006720969,0.00008162393],"category_scores_gemma":[0.000007435478,0.0001766951,0.0001070166,0.000193372,0.0002537617,0.0001130154,0.00035185,0.0003232185,0.000002040741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000435139,"about_ca_system_score_gemma":0.000103113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002311537,"about_ca_topic_score_gemma":0.00001376899,"domain_scores_codex":[0.9986627,0.00001441377,0.0002461487,0.0005721379,0.0002537227,0.0002508832],"domain_scores_gemma":[0.9988882,0.0003315315,0.0001759969,0.0004042975,0.0001613502,0.00003863853],"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.000002318576,0.0000108274,0.0005367199,0.00002846551,0.0000354299,8.472862e-7,0.0002744827,0.004813018,0.00003178114,0.05450373,0.00008813236,0.9396743],"study_design_scores_gemma":[0.0001600082,0.00002386127,0.00007073795,0.0003327572,0.00006269772,0.000005792181,0.000001254369,0.530831,0.000604819,0.4540415,0.01345295,0.0004126093],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006491473,0.0002269974,0.9952673,0.000259166,0.0001885038,0.0004521531,0.000005123988,0.00003413824,0.003501683],"genre_scores_gemma":[0.452514,0.00002656162,0.5432005,0.0003557391,0.001875459,0.0001425296,0.00006991201,0.00006115699,0.001754163],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9392616,"threshold_uncertainty_score":0.7205418,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01519672817404732,"score_gpt":0.2623620611385883,"score_spread":0.247165332964541,"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."}}