{"data":{"id":"lf-two-spectra-determine-a-tree","statement_oneline":"Two trees with the same Laplacian spectrum and the same (n−2,2) support-forest profile are isomorphic.","statement_full_latex":"Two trees with the same Laplacian spectrum and the same (n−2,2) support-forest profile are isomorphic. Open residue: Open injectivity claim for all trees.","source":{"title":"The (n-2,2)-Spectrum of a Graph","arxiv":"2605.17501v1","url":"https://arxiv.org/abs/2605.17501","year":2026,"area":"Spectral graph theory"},"renown":{"score":1,"rationale":"Recent research-paper conjecture; renown scored at catalog level per Rubric v1.","scored_by":"rubric-v1"},"attackability":{"score":4,"rationale":"A counterexample is just a pair of nonisomorphic trees with matching exact integer invariants; tree generation scales well.","scored_by":"rubric-v1","subscores":{"finite_witness":4,"oracle_cost":4,"freshness":5,"seedability":4}},"verification_tier":null,"ai_systems":[],"posed_by":null,"years_open":0,"notability":null,"source_trackers":[],"status":"open","ranking_score":4,"last_verified_open":"2026-07-27","added":"2026-07-27","resolution_type":null,"resolver":null,"resolution_date":null,"evidence_url":null,"evidence_note":null,"method_note":null,"submitted_by":"Luke Francis","verification_note":"Generate unlabeled trees, compute characteristic polynomials and support-forest profiles exactly, and hash for collisions. — Current arXiv revision checked; source-stated open/partial. Independent literature and author confirmation still required. Editorially screened candidate; not independently certified open. Author confirmation pending.","openconjecture_id":"2794","effective_status":"open","claims":[],"status_events":[{"id":"seed-lf-two-spectra-determine-a-tree","conjecture_id":"lf-two-spectra-determine-a-tree","status":"open","date":"2026-07-27T00:00:00.000Z","actor":"human-admin","rationale":"Imported Tier 1 contributor candidate from Luke Francis.","note":"Editorially screened candidate; author confirmation pending."}],"public_actions":[{"name":"claim","method":"POST","href":"/c/lf-two-spectra-determine-a-tree/claim","verification":"email magic link"},{"name":"report_resolution","method":"POST","href":"/c/lf-two-spectra-determine-a-tree/resolve","verification":"admin review"}],"resolutions":[]},"notice":"Status is community- and machine-tracked and may lag. Verify independently before investing effort."}