{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002398034,0.0001037903,0.0002329091,0.0001831654,0.0005976239,0.0007458026,0.0009348914,0.00003100676,1.693267e-7],"category_scores_gemma":[0.00001742141,0.00005730007,0.00007993413,0.0004447835,0.0002439667,0.0004993315,0.0002499746,0.00009928548,3.217979e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001395913,"about_ca_system_score_gemma":0.0001167085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008128953,"about_ca_topic_score_gemma":0.000001312105,"domain_scores_codex":[0.9987599,0.00007363348,0.0004512554,0.0002334647,0.0003009102,0.0001808103],"domain_scores_gemma":[0.9987022,0.0006284745,0.0002486061,0.0001661255,0.0001960927,0.00005847504],"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.00005747583,0.00006426136,0.000548186,0.0003088814,0.0001415094,0.00001841474,0.002296775,0.001099796,0.00002591884,0.4905005,0.01876404,0.4861742],"study_design_scores_gemma":[0.001262424,0.0005095594,0.004084512,0.0005231621,0.00002894047,0.0004894645,0.0003746005,0.9487057,0.00007456888,0.01479843,0.02898667,0.0001619086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001938216,0.001927371,0.989589,0.003328723,0.002048883,0.0001920646,0.000003418298,0.00001897837,0.0009532944],"genre_scores_gemma":[0.5784063,0.0001565054,0.4199521,0.0005384046,0.0005555203,0.000009634588,1.557682e-7,0.000003799472,0.0003775854],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.947606,"threshold_uncertainty_score":0.7191792,"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."}}