{"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":"d59304923c22459faadfd6d248575512","problem_id":"555e8600-aa11-4efa-a4a2-40e3e5ef8383","problem_name":"Turán number ex(n, K_4) — tight bound verification","domain":"Graph Theory","statement":"ex(n, K_4) = t_3(n) (Turán number). Verify the Turán graph T(n,3) is the unique extremal graph for K_4-free.","status":"computational_evidence","url":"https://assignee.net/math#result-d59304923c22459faadfd6d248575512","doi":"10.5281/zenodo.20563127"},"verification":{"state":"COMPUTATIONAL_EVIDENCE","label":"Computational evidence","proof_claim":false,"method":"python_computation","result":"no_counterexample","n_cases":3333,"counterexample_available":false,"cpu_seconds":0.04,"lean4_source_public":false},"artifact_set":[{"type":"manifest","label":"Math result manifest","url":"https://assignee.net/math/d59304923c22459faadfd6d248575512/manifest.json","format":"application/json"},{"type":"report","label":"Public report PDF","url":"https://assignee.net/math/d59304923c22459faadfd6d248575512/paper.pdf","format":"application/pdf"},{"type":"external_record","label":"DOI","url":"https://doi.org/10.5281/zenodo.20563127","format":"text/html"}],"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."]}