{"id":"W4388328539","doi":"10.4230/lipics.icalp.2024.7","title":"Finer-Grained Reductions in Fine-Grained Hardness of Approximation","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Environment and Climate Change Canada; Israel Science Foundation; European Commission","keywords":"Approx; Hardness of approximation; Approximation algorithm; Combinatorics; Dimension (graph theory); Euclidean geometry; Mathematics; Product (mathematics); Alphabet; Order (exchange); Time complexity; Euclidean distance; Discrete mathematics; Algorithm; Computer science; Geometry","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004000271,0.0002735508,0.0004152028,0.000913151,0.000113429,0.00006321802,0.001709109,0.0002348632,0.00001813687],"category_scores_gemma":[0.0001107109,0.0003373003,0.0002588046,0.0022366,0.0001855193,0.0003214185,0.001641526,0.0005312798,0.00002901638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001386115,"about_ca_system_score_gemma":0.0002144816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004483083,"about_ca_topic_score_gemma":0.000284419,"domain_scores_codex":[0.9980817,0.0001532365,0.0003605597,0.0009532687,0.0001327019,0.0003185062],"domain_scores_gemma":[0.9980419,0.0001302491,0.0003097887,0.00123694,0.0001898856,0.0000911936],"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.00003713166,0.0003650718,0.001533923,0.0003323826,0.000117498,0.0001842855,0.0010597,0.2354534,0.0001653725,0.756909,0.001375292,0.002466865],"study_design_scores_gemma":[0.0005420247,0.0000392154,0.004781987,0.0001839753,0.00002721759,0.000003220116,0.000107698,0.7139183,0.0001862901,0.2796008,0.0002409181,0.000368419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1744545,0.00002771417,0.8209293,0.0007600474,0.001776769,0.0004943885,0.00005874944,0.0004674552,0.001031095],"genre_scores_gemma":[0.987639,0.00005289504,0.009368873,0.00001836405,0.0000734541,0.000004624792,0.0000660259,0.0000187691,0.002757992],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8131846,"threshold_uncertainty_score":0.9999079,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1407650846031546,"score_gpt":0.2107074094673119,"score_spread":0.06994232486415722,"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."}}