{"data":{"id":"kill-borsuk-1993","statement_oneline":"Borsuk's conjecture (1933): every bounded set in R^n can be partitioned into n+1 sets of smaller diameter.","renown":{"score":4,"rationale":"A 1933 geometric conjecture, textbook material for decades.","scored_by":"founder"},"attackability":{"score":2,"rationale":"Finite set-system witness in dimension 1325; findable in principle, but only after the right combinatorial reframing.","subscores":{"finite_witness":4,"oracle_cost":3,"freshness":1,"seedability":2},"scored_by":"founder"},"ranking_score":8,"verification_tier":null,"ai_systems":[],"posed_by":null,"years_open":null,"notability":null,"source_trackers":[],"status":"confirmed","added":"1993-01-01","resolution_type":"counterexample","resolver":"Jeff Kahn and Gil Kalai","resolution_date":"1993-01-01","evidence_url":"https://arxiv.org/abs/math/9307229","evidence_note":"False in dimension 1325 (now known false for all n >= 64) via finite set systems; a 60-year-old geometric conjecture killed by combinatorics.","method_note":null,"effective_status":"confirmed","claims":[],"status_events":[{"id":"seed-kill-borsuk-1993","conjecture_id":"kill-borsuk-1993","status":"confirmed","date":"1993-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."}