{"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":"99087df654ab46a198001cf62799274d","problem_id":"0177d28a-4e76-4267-b46b-06350e083798","problem_name":"Erdős–Ko–Rado for k=3 — sharp bound","domain":"Combinatorics","statement":"For n ≥ 7, the maximum intersecting family of 3-element subsets of {1,...,n} has size C(n-1,2). Verify computationally for all n ≤ 12.","status":"computational_evidence","url":"https://assignee.net/math#result-99087df654ab46a198001cf62799274d","doi":null},"verification":{"state":"COMPUTATIONAL_EVIDENCE","label":"Computational evidence","proof_claim":false,"method":"python_computation","result":"no_counterexample","n_cases":55,"counterexample_available":false,"cpu_seconds":0.02,"lean4_source_public":false},"artifact_set":[{"type":"manifest","label":"Math result manifest","url":"https://assignee.net/math/99087df654ab46a198001cf62799274d/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."]}