{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004168465,0.002362,0.004000574,0.001765779,0.003100789,0.006895915,0.008051115,0.004894007,0.0229398],"category_scores_gemma":[0.0301824,0.00149436,0.003277403,0.004019602,0.004735692,0.02140733,0.007158541,0.0120926,0.002887616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004027318,"about_ca_system_score_gemma":0.003097611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003170878,"about_ca_topic_score_gemma":0.002711689,"domain_scores_codex":[0.9956645,0.001271512,0.0002152761,0.001124454,0.0009651179,0.0007591049],"domain_scores_gemma":[0.9694059,0.02343677,0.00137031,0.003591587,0.0009262688,0.00126915],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002390458,0.0007440801,0.004064822,0.001820415,0.0003589634,0.0004438377,0.001009633,0.1920839,0.0032237,0.6500891,0.06226467,0.08150639],"study_design_scores_gemma":[0.0001397527,0.00005570317,0.0005064802,0.00007777724,0.00005989743,0.0002109936,0.0001629191,0.1675044,0.0007349878,0.8264704,0.004047222,0.00002941213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2119078,0.005989849,0.6576011,0.03230708,0.00135329,0.0005206158,0.006698295,0.002803043,0.08081897],"genre_scores_gemma":[0.7572981,0.003961702,0.1794674,0.003733777,0.001919268,0.001062911,0.005753895,0.001494088,0.04530874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0229398,"threshold_uncertainty_score":0.07674128,"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."}}