{"schema":"https://assignee.net/schemas/math-result-v1","schema_version":"1.0","contract_version":"math-result-v1.0","schema_documentation":"https://assignee.net/schemas","changelog_url":"https://assignee.net/changelog","publisher":{"name":"Assignee Research","url":"https://assignee.net"},"result":{"id":"84e7e3b311544ebb9c047ba44a9732e5","problem_id":"c4b853ff-3d65-4d53-8824-a116e9599c24","problem_name":"Cap set problem F_3^6 — verify maximum size = 112","domain":"Combinatorics","statement":"The maximum cap set size in F_3^6 is exactly 112, and this bound is achieved only by the canonical construction S_3^6 ⊂ F_3^6","status":"falsified","url":"https://assignee.net/math#result-84e7e3b311544ebb9c047ba44a9732e5","doi":null},"verification":{"state":"FALSIFIED","label":"Falsified","proof_claim":false,"method":"python_computation","result":"falsified","n_cases":0,"counterexample_available":true,"cpu_seconds":0.02,"lean4_source_public":false},"artifact_set":[{"type":"manifest","label":"Math result manifest","url":"https://assignee.net/math/84e7e3b311544ebb9c047ba44a9732e5/manifest.json","format":"application/json"}],"interpretation":"Computational evidence is not a formal proof. Formal verification is claimed only when public Lean4 source is attached.","limitations":["Python check code, local file paths, and private execution logs are not exposed in public manifests.","Computational evidence reports bounded search only and can be invalidated by later counterexamples.","Formal proof verification requires public Lean4 source; otherwise the record remains a proof attempt or report."]}