{"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":"b8d0385a8fb445358f019a96156c229a","problem_id":"0c127b28-4e62-4599-988e-363ce785755a","problem_name":"Fibonacci primes — density conjecture","domain":"Number Theory","statement":"For every Fibonacci prime F_p with index p > 3, the quantity (p-1)/2 is a prime number. In other words, the indices of Fibonacci primes greater than 2 are either 4 or twice a prime (Sophie Germain prime structure in the index).","status":"falsified","url":"https://assignee.net/math#result-b8d0385a8fb445358f019a96156c229a","doi":null},"verification":{"state":"FALSIFIED","label":"Falsified","proof_claim":false,"method":"python_computation","result":"falsified","n_cases":0,"counterexample_available":true,"cpu_seconds":0.04,"lean4_source_public":false},"artifact_set":[{"type":"manifest","label":"Math result manifest","url":"https://assignee.net/math/b8d0385a8fb445358f019a96156c229a/manifest.json","format":"application/json"},{"type":"report","label":"Public report PDF","url":"https://assignee.net/math/b8d0385a8fb445358f019a96156c229a/paper.pdf","format":"application/pdf"}],"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."]}