{"id":"W4415829623","doi":"10.1016/j.jcss.2025.103727","title":"Algorithms and hardness results for the (k,ℓ)-cover problem","year":2025,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada","keywords":"Approximation algorithm; Efficient algorithm; Minification; Key (lock)","routes":{"ca_aff":true,"ca_fund":true,"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.001721268,0.001944198,0.001664805,0.00157026,0.002450526,0.006166528,0.004066614,0.003811153,0.008251145],"category_scores_gemma":[0.01210406,0.001149942,0.002871624,0.003188084,0.002700932,0.01349873,0.00307372,0.005239833,0.001703908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003855867,"about_ca_system_score_gemma":0.002834098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004286352,"about_ca_topic_score_gemma":0.003686616,"domain_scores_codex":[0.9966678,0.0006281575,0.0002419364,0.001093278,0.0006613464,0.0007074988],"domain_scores_gemma":[0.9864646,0.009842196,0.001095956,0.001603761,0.0004592975,0.0005341246],"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.003623042,0.002100257,0.011639,0.0028736,0.0005735423,0.000915942,0.002097698,0.320532,0.01549165,0.3390963,0.07485791,0.226199],"study_design_scores_gemma":[0.0004937707,0.0002132287,0.002941829,0.0001984857,0.0002468597,0.001437546,0.0004585778,0.4692757,0.006927554,0.4984288,0.01925686,0.0001207917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2967536,0.005611297,0.6074074,0.01829722,0.0004185167,0.0008643283,0.006537191,0.003811199,0.06029936],"genre_scores_gemma":[0.6358578,0.004416228,0.3270545,0.001962197,0.001175979,0.0009591824,0.01080197,0.001009987,0.01676227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008251145,"threshold_uncertainty_score":0.02797639,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02773475657801595,"score_gpt":0.2790050750009111,"score_spread":0.2512703184228952,"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."}}