{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VASC5TRIUFAML4YLTVRJOYTZWL","short_pith_number":"pith:VASC5TRI","schema_version":"1.0","canonical_sha256":"a8242ece28a140c5f30b9d62976279b2fc294d532d92b108d9a042be57b99fc6","source":{"kind":"arxiv","id":"2605.17501","version":1},"attestation_state":"computed","paper":{"title":"The (n-2,2)-Spectrum of a Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A weighted trace polynomial from the (n-2,2) representation reconstructs every tree from its second moment except for one exceptional n.","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Boris Shapiro","submitted_at":"2026-05-17T15:22:15Z","abstract_excerpt":"We study a representation-theoretic refinement of the ordinary Laplacian spectrum of a graph. Given a graph $G$ on $n$ vertices, one may associate to it the element \\[ X_G=\\sum_{ij\\in E(G)} (ij)\\in \\C[S_n]. \\] The action of $X_G$ in irreducible representations of $S_n$ produces spectral invariants of graphs. The standard representation $(n-1,1)$ recovers the ordinary graph Laplacian spectrum, up to the elementary affine change $X_G=mI-L_G$, where $m=|E(G)|$. The next component, $(n-2,2)$, gives the first representation-theoretic correction. We give an explicit edge-space model for this compone"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.17501","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-17T15:22:15Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"28ec32a24b47e1accb5f6240bb6b6e008a1e708be31b61e2376f43778d1285e9","abstract_canon_sha256":"40d82b5368e9e9d319e5220e4ff85e57df1823532c3e396d1a9cd11a52a63581"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:42.471475Z","signature_b64":"YX8XC2a1u7edtNWTDZ2n7QJxXlNVeF4RTn5FtVGwCovAbikkHyLT1hjGaP80yyGstXJAVt1KQnYm8+vNhqTBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8242ece28a140c5f30b9d62976279b2fc294d532d92b108d9a042be57b99fc6","last_reissued_at":"2026-05-20T00:04:42.470854Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:42.470854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The (n-2,2)-Spectrum of a Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A weighted trace polynomial from the (n-2,2) representation reconstructs every tree from its second moment except for one exceptional n.","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Boris Shapiro","submitted_at":"2026-05-17T15:22:15Z","abstract_excerpt":"We study a representation-theoretic refinement of the ordinary Laplacian spectrum of a graph. Given a graph $G$ on $n$ vertices, one may associate to it the element \\[ X_G=\\sum_{ij\\in E(G)} (ij)\\in \\C[S_n]. \\] The action of $X_G$ in irreducible representations of $S_n$ produces spectral invariants of graphs. The standard representation $(n-1,1)$ recovers the ordinary graph Laplacian spectrum, up to the elementary affine change $X_G=mI-L_G$, where $m=|E(G)|$. The next component, $(n-2,2)$, gives the first representation-theoretic correction. We give an explicit edge-space model for this compone"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The weighted trace polynomial already reconstructs every tree from the second moment, except for a single exceptional value of n where the fourth moment suffices.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The explicit edge-space model for the (n-2,2) component induces an operator whose trace moments are exactly the stated linear combinations of support-forest counts, with no hidden dependencies on the choice of basis or on graph-specific normalizations.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Defines the (n-2,2) component of the S_n-representation of the graph element X_G, derives its edge-space model and trace moments in terms of support-forest counts, and proves that a weighted trace polynomial reconstructs all trees from the second moment except for one exceptional n.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A weighted trace polynomial from the (n-2,2) representation reconstructs every tree from its second moment except for one exceptional n.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"18058f77a062ba4f9ed70f2452ee97beddc7239608408af2faf704702f8d24e2"},"source":{"id":"2605.17501","kind":"arxiv","version":1},"verdict":{"id":"6c6b1e13-69c6-4e6d-b13d-c1ee00799300","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T22:36:23.171624Z","strongest_claim":"The weighted trace polynomial already reconstructs every tree from the second moment, except for a single exceptional value of n where the fourth moment suffices.","one_line_summary":"Defines the (n-2,2) component of the S_n-representation of the graph element X_G, derives its edge-space model and trace moments in terms of support-forest counts, and proves that a weighted trace polynomial reconstructs all trees from the second moment except for one exceptional n.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The explicit edge-space model for the (n-2,2) component induces an operator whose trace moments are exactly the stated linear combinations of support-forest counts, with no hidden dependencies on the choice of basis or on graph-specific normalizations.","pith_extraction_headline":"A weighted trace polynomial from the (n-2,2) representation reconstructs every tree from its second moment except for one exceptional n."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17501/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T23:01:19.522299Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T22:41:16.933953Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.666693Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.636517Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"1a2c0c5e20b1959fedfb4a5e4a852ac950aab1515345761367d648745d8f8e9b"},"references":{"count":10,"sample":[{"doi":"","year":1988,"title":"Diaconis,Group Representations in Probability and Statistics, Institute of Mathematical Statistics Lecture Notes– Monograph Series, vol","work_id":"0a906be5-84f0-46aa-b259-95cb85992c67","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2001,"title":"C. Godsil and G. Royle,Algebraic Graph Theory, Graduate Texts in Mathematics, vol. 207, Springer, New York, 2001","work_id":"fb86b010-e6c5-47ff-ad19-a99725e9f20c","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1982,"title":"C. D. Godsil and B. D. McKay,Constructing cospectral graphs, Aequationes Math.25(1982), 257–268","work_id":"74ef949a-06a8-4634-9df5-b9da1f004acd","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"W. H. Haemers and E. Spence,Enumeration of cospectral graphs, European J. Combin.25(2004), no. 2, 199–211","work_id":"a96a22aa-8699-4afa-bae4-b1301f538f0c","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"B. D. McKay and A. Piperno,Practical graph isomorphism, II, J. Symbolic Comput.60(2014), 94–112","work_id":"f0a14ba3-1f5c-420a-9e8b-435bd07aa780","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":10,"snapshot_sha256":"d6f9fdc1597137288b5781a2868e9c07bf42880373d5a4953a861ea4d616ac8c","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f96740ccdc5eadcaff08364ea7747fd4359bb236e4cb43a75fa530b95bddd6f1"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.17501","created_at":"2026-05-20T00:04:42.470950+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.17501v1","created_at":"2026-05-20T00:04:42.470950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17501","created_at":"2026-05-20T00:04:42.470950+00:00"},{"alias_kind":"pith_short_12","alias_value":"VASC5TRIUFAM","created_at":"2026-05-20T00:04:42.470950+00:00"},{"alias_kind":"pith_short_16","alias_value":"VASC5TRIUFAML4YL","created_at":"2026-05-20T00:04:42.470950+00:00"},{"alias_kind":"pith_short_8","alias_value":"VASC5TRI","created_at":"2026-05-20T00:04:42.470950+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VASC5TRIUFAML4YLTVRJOYTZWL","json":"https://pith.science/pith/VASC5TRIUFAML4YLTVRJOYTZWL.json","graph_json":"https://pith.science/api/pith-number/VASC5TRIUFAML4YLTVRJOYTZWL/graph.json","events_json":"https://pith.science/api/pith-number/VASC5TRIUFAML4YLTVRJOYTZWL/events.json","paper":"https://pith.science/paper/VASC5TRI"},"agent_actions":{"view_html":"https://pith.science/pith/VASC5TRIUFAML4YLTVRJOYTZWL","download_json":"https://pith.science/pith/VASC5TRIUFAML4YLTVRJOYTZWL.json","view_paper":"https://pith.science/paper/VASC5TRI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.17501&json=true","fetch_graph":"https://pith.science/api/pith-number/VASC5TRIUFAML4YLTVRJOYTZWL/graph.json","fetch_events":"https://pith.science/api/pith-number/VASC5TRIUFAML4YLTVRJOYTZWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VASC5TRIUFAML4YLTVRJOYTZWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VASC5TRIUFAML4YLTVRJOYTZWL/action/storage_attestation","attest_author":"https://pith.science/pith/VASC5TRIUFAML4YLTVRJOYTZWL/action/author_attestation","sign_citation":"https://pith.science/pith/VASC5TRIUFAML4YLTVRJOYTZWL/action/citation_signature","submit_replication":"https://pith.science/pith/VASC5TRIUFAML4YLTVRJOYTZWL/action/replication_record"}},"created_at":"2026-05-20T00:04:42.470950+00:00","updated_at":"2026-05-20T00:04:42.470950+00:00"}