{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006997408,0.001883723,0.001514525,0.003537259,0.002020739,0.005957586,0.005007627,0.002134564,0.02906066],"category_scores_gemma":[0.04769953,0.001772866,0.003203814,0.002773423,0.007380305,0.02001978,0.01384379,0.01336895,0.004204595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003492573,"about_ca_system_score_gemma":0.001493331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008802073,"about_ca_topic_score_gemma":0.0006797052,"domain_scores_codex":[0.984172,0.003219016,0.0007768712,0.003181776,0.00695139,0.001698884],"domain_scores_gemma":[0.9311942,0.04470091,0.001429792,0.01813281,0.00349389,0.001048494],"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.0002596288,0.0001622541,0.000920234,0.0006479084,0.00007336315,0.0002345159,0.0005303796,0.009881769,0.01034795,0.8943973,0.01115908,0.07138561],"study_design_scores_gemma":[0.00008199878,0.000108891,0.0006831978,0.0001244299,0.0001213813,0.0006909836,0.0001181747,0.06457689,0.01615351,0.8880113,0.0292554,0.00007386865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03121167,0.002000105,0.8700223,0.006924815,0.0005031009,0.000331778,0.0005064146,0.004410803,0.08408894],"genre_scores_gemma":[0.6561413,0.002612154,0.2966725,0.003293608,0.001353612,0.000857505,0.0007386025,0.0025408,0.03578997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02906066,"threshold_uncertainty_score":0.09721762,"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."}}