{"data":{"id":"kill-hedetniemi-2019","statement_oneline":"Hedetniemi's conjecture (1966): the chromatic number of a tensor product of graphs equals the minimum of the factors' chromatic numbers.","renown":{"score":4,"rationale":"A famous 1966 coloring conjecture, believed by most of the field for 53 years.","scored_by":"founder"},"attackability":{"score":1,"rationale":"Counterexamples are astronomically large exponential graphs; no search would have found them. Fell to insight.","subscores":{"finite_witness":3,"oracle_cost":1,"freshness":1,"seedability":1},"scored_by":"founder"},"ranking_score":4,"verification_tier":null,"ai_systems":[],"posed_by":null,"years_open":null,"notability":null,"source_trackers":[],"status":"confirmed","added":"2019-05-01","resolution_type":"counterexample","resolver":"Yaroslav Shitov","resolution_date":"2019-05-01","evidence_url":"https://arxiv.org/abs/1905.02167","evidence_note":"Refuted after 53 years via exponential graphs; published in Annals of Mathematics. The counterexamples are enormous but the argument is three pages.","method_note":"Classic kill: a reminder that even pencil-and-paper refutations arrive after half a century of consensus belief.","effective_status":"confirmed","claims":[],"status_events":[{"id":"seed-kill-hedetniemi-2019","conjecture_id":"kill-hedetniemi-2019","status":"confirmed","date":"2019-05-01T00:00:00.000Z","actor":"human-admin","rationale":"Loaded from unified seed data.","note":"Loaded from unified seed data."}],"public_actions":[],"resolutions":[]},"notice":"Status is community- and machine-tracked and may lag. Verify independently before investing effort."}