{"data":{"id":"kill-euler-sum-powers-1966","statement_oneline":"Euler's sum of powers conjecture (1769): at least n nth powers are needed to sum to an nth power.","renown":{"score":4,"rationale":"Euler's own conjecture, standing 197 years.","scored_by":"founder"},"attackability":{"score":4,"rationale":"A single quintuple of integers, found by direct machine search in 1966; the founding example of the genre.","subscores":{"finite_witness":5,"oracle_cost":5,"freshness":2,"seedability":2},"scored_by":"founder"},"ranking_score":16,"verification_tier":null,"ai_systems":[],"posed_by":null,"years_open":null,"notability":null,"source_trackers":[],"status":"confirmed","added":"1966-01-01","resolution_type":"counterexample","resolver":"L. J. Lander and T. R. Parkin","resolution_date":"1966-01-01","evidence_url":"https://www.ams.org/journals/bull/1966-72-06/S0002-9904-1966-11654-3/","evidence_note":"27^5 + 84^5 + 110^5 + 133^5 = 144^5, found by direct search on a CDC 6600; the announcement is one of the shortest papers ever published.","method_note":"The patron saint of computer counterexamples, 1966. The gold rush is sixty years old; only the speed is new.","effective_status":"confirmed","claims":[],"status_events":[{"id":"seed-kill-euler-sum-powers-1966","conjecture_id":"kill-euler-sum-powers-1966","status":"confirmed","date":"1966-01-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."}