{"data":{"id":"collatz-1937","statement_oneline":"Iterating n -> n/2 (even) or 3n+1 (odd) from any positive integer eventually reaches 1.","statement_full_latex":"For every $n \\in \\mathbb{Z}^{+}$, iterating $T(n) = n/2$ ($n$ even), $3n+1$ ($n$ odd) eventually reaches $1$.","source":{"title":"Collatz conjecture (1937)","arxiv":null,"url":"https://en.wikipedia.org/wiki/Collatz_conjecture","year":1937,"area":"math.NT"},"renown":{"score":5,"rationale":"The most famous easy-to-state open problem; Erdős: mathematics is not yet ripe for it.","scored_by":"founder"},"attackability":{"score":1,"rationale":"A counterexample is either a nontrivial cycle (finite, checkable) or a divergent orbit (not finitely witnessable); orbits verified beyond 2^68, and Tao proved almost-boundedness. Trophy.","subscores":{"finite_witness":2,"oracle_cost":5,"freshness":0,"seedability":1},"scored_by":"founder"},"status":"open","last_verified_open":"2026-01-15","added":"2026-07-25","ranking_score":5,"verification_tier":null,"ai_systems":[],"posed_by":null,"years_open":null,"notability":null,"source_trackers":[],"resolution_type":null,"resolver":null,"resolution_date":null,"evidence_url":null,"evidence_note":null,"method_note":null,"effective_status":"open","claims":[],"status_events":[{"id":"seed-collatz-1937","conjecture_id":"collatz-1937","status":"open","date":"2026-07-25T00:00:00.000Z","actor":"human-admin","rationale":"Loaded from unified seed data.","note":"Loaded from unified seed data."}],"public_actions":[{"name":"claim","method":"POST","href":"/c/collatz-1937/claim","verification":"email magic link"},{"name":"report_resolution","method":"POST","href":"/c/collatz-1937/resolve","verification":"admin review"}],"resolutions":[]},"notice":"Status is community- and machine-tracked and may lag. Verify independently before investing effort."}