{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005018294,0.002129118,0.003246539,0.001517465,0.002229887,0.005195021,0.006218151,0.00289113,0.01699799],"category_scores_gemma":[0.02956084,0.001348323,0.004522228,0.002320208,0.004584874,0.01740997,0.009136789,0.009983612,0.003474998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004570156,"about_ca_system_score_gemma":0.002474629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004180959,"about_ca_topic_score_gemma":0.005824092,"domain_scores_codex":[0.9921479,0.001479876,0.0004636974,0.002434733,0.002070352,0.00140345],"domain_scores_gemma":[0.9714808,0.01478333,0.001007166,0.01108292,0.0009177225,0.0007280104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001865663,0.0009344043,0.004967416,0.001555636,0.0003120809,0.0003479985,0.001169313,0.4258974,0.0132436,0.4015877,0.03013209,0.1179867],"study_design_scores_gemma":[0.0001550629,0.0001481281,0.0009887594,0.0000975703,0.00007968121,0.0001706454,0.0001849928,0.4716254,0.002741578,0.5139085,0.009844314,0.00005545272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1516372,0.003129434,0.7905145,0.007975811,0.0007408635,0.00040812,0.002144604,0.004550222,0.03889913],"genre_scores_gemma":[0.64882,0.001106959,0.3296365,0.002463459,0.0005195685,0.0007165045,0.002378563,0.001987257,0.01237102],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01699799,"threshold_uncertainty_score":0.05686396,"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."}}