{"id":"W2160909640","doi":"10.1145/1806689.1806703","title":"Hardness amplification in proof complexity","year":2010,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Degree (music); Proof complexity; Discrete mathematics; Rank (graph theory); Mathematics; Resolution (logic); Tree (set theory); Structural proof theory; Proof of concept; Combinatorial proof; Combinatorics; Proof theory; Computer science; Physics; Programming language","routes":{"ca_aff":true,"ca_fund":false,"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.0002730752,0.00007456345,0.00009342052,0.0001084256,0.00007491485,0.0001100988,0.0007957093,0.00004197751,0.00007926099],"category_scores_gemma":[0.00002827128,0.00006836188,0.00003100406,0.000454273,0.00009296226,0.0003391483,0.0001657984,0.0002223025,0.00005203682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000920134,"about_ca_system_score_gemma":0.00003097197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001324989,"about_ca_topic_score_gemma":0.0009237227,"domain_scores_codex":[0.999216,0.0000247241,0.000156589,0.000272593,0.0001522926,0.0001778542],"domain_scores_gemma":[0.9992815,0.00003201728,0.00003370491,0.0005514779,0.00004799616,0.00005336656],"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":[9.352682e-7,0.00008832193,0.001566789,0.000003876187,0.000001153914,0.000001119119,0.0001496642,0.000002648295,0.001404923,0.9586387,0.0003411958,0.03780073],"study_design_scores_gemma":[0.0004194089,0.0000325518,0.17983,0.000008569681,0.000001058573,0.00002145873,0.00002491476,0.1581206,0.008611169,0.6275653,0.02504816,0.000316887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05489336,0.00000674386,0.9166878,0.001938546,0.0010078,0.00020591,0.000001493227,0.0002076179,0.02505074],"genre_scores_gemma":[0.8181349,5.946324e-7,0.1813696,0.000188436,0.0000386121,0.00001657015,0.000002298358,0.000002822524,0.0002461637],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7632416,"threshold_uncertainty_score":0.2787716,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04004660596034626,"score_gpt":0.2741328864339488,"score_spread":0.2340862804736025,"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."}}