{"id":"W6979296102","doi":"","title":"Small hitting sets for longest paths and cycles","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Agence Nationale de la Recherche; National Science Foundation","keywords":"Graph; Upper and lower bounds; Mathematical proof; Path graph; Connectivity; Complete graph; Intersection graph; Path (computing); Strength of a graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003383376,0.002618233,0.003141922,0.007384355,0.002743074,0.005352141,0.005851158,0.003041527,0.01804253],"category_scores_gemma":[0.0560213,0.001790283,0.002938412,0.005775256,0.006205687,0.01577579,0.006935908,0.008492596,0.002082797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005004157,"about_ca_system_score_gemma":0.001642036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002960287,"about_ca_topic_score_gemma":0.003122252,"domain_scores_codex":[0.9948173,0.001099329,0.0002348342,0.001481143,0.001373559,0.0009939271],"domain_scores_gemma":[0.9082927,0.0765618,0.004076635,0.005783218,0.002053837,0.003231866],"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.0006305925,0.0001492607,0.003418089,0.0007145723,0.0001784873,0.0003367624,0.001057311,0.06438912,0.005913051,0.8851242,0.009603076,0.02848536],"study_design_scores_gemma":[0.00005372568,0.00005345609,0.0006864997,0.0001008148,0.00004698737,0.0001679423,0.0001152822,0.07831394,0.001817954,0.9142666,0.004320378,0.00005655136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4165977,0.01615536,0.4421608,0.007977423,0.0006579389,0.0003409953,0.004425649,0.00302883,0.1086552],"genre_scores_gemma":[0.9100695,0.005566544,0.06378639,0.001641054,0.001393303,0.001024428,0.003556951,0.001069437,0.01189244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01804253,"threshold_uncertainty_score":0.06035829,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06631587931356754,"score_gpt":0.3299141863886663,"score_spread":0.2635983070750988,"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."}}