{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:M3BSE2PNTX3GLQIXHCFDHJNUB4","short_pith_number":"pith:M3BSE2PN","schema_version":"1.0","canonical_sha256":"66c32269ed9df665c117388a33a5b40f18efd0c19f3bb35557d0763b04a81ec9","source":{"kind":"arxiv","id":"2509.26344","version":2},"attestation_state":"computed","paper":{"title":"Nearest matrix with multiple eigenvalues by Riemannian optimization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Federico Poloni, Lauri Nyman, Vanni Noferini","submitted_at":"2025-09-30T14:50:45Z","abstract_excerpt":"Given a square complex matrix $A$, we tackle the problem of finding the nearest matrix with multiple eigenvalues or, equivalently when $A$ had distinct eigenvalues, the nearest defective matrix. To this goal, we extend the general framework described in [M. Gnazzo, V. Noferini, L. Nyman, F. Poloni, \\emph{Riemann-Oracle: A general-purpose Riemannian optimizer to solve nearness problems in matrix theory}, Found. Comput. Math., To appear] and based on variable projection and Riemannian optimization, allowing the ambient manifold to simultaneously track left and right eigenvectors. Our method also"},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2509.26344","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2025-09-30T14:50:45Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"7f296ba592483607c90c26316eeccbdd6824ab31a26249ff040afaca54378034","abstract_canon_sha256":"ae990f3a1ddc72df6563284a83c63b259e9b72523ec208135c4fb4dfb405703c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:12.167580Z","signature_b64":"ARyTVBGLFPOb19xEz9gbqKz/jb83f1Q64IpH9hHCKR63OQBLwUUhE+t3uy+ZICwPVFt4eswPfyeXCgcNVM1PCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66c32269ed9df665c117388a33a5b40f18efd0c19f3bb35557d0763b04a81ec9","last_reissued_at":"2026-05-18T03:10:12.166750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:12.166750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearest matrix with multiple eigenvalues by Riemannian optimization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Federico Poloni, Lauri Nyman, Vanni Noferini","submitted_at":"2025-09-30T14:50:45Z","abstract_excerpt":"Given a square complex matrix $A$, we tackle the problem of finding the nearest matrix with multiple eigenvalues or, equivalently when $A$ had distinct eigenvalues, the nearest defective matrix. To this goal, we extend the general framework described in [M. Gnazzo, V. Noferini, L. Nyman, F. Poloni, \\emph{Riemann-Oracle: A general-purpose Riemannian optimizer to solve nearness problems in matrix theory}, Found. Comput. Math., To appear] and based on variable projection and Riemannian optimization, allowing the ambient manifold to simultaneously track left and right eigenvectors. Our method also"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.26344","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"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":"2509.26344","created_at":"2026-05-18T03:10:12.166878+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.26344v2","created_at":"2026-05-18T03:10:12.166878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.26344","created_at":"2026-05-18T03:10:12.166878+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3BSE2PNTX3G","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3BSE2PNTX3GLQIX","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3BSE2PN","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4","json":"https://pith.science/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4.json","graph_json":"https://pith.science/api/pith-number/M3BSE2PNTX3GLQIXHCFDHJNUB4/graph.json","events_json":"https://pith.science/api/pith-number/M3BSE2PNTX3GLQIXHCFDHJNUB4/events.json","paper":"https://pith.science/paper/M3BSE2PN"},"agent_actions":{"view_html":"https://pith.science/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4","download_json":"https://pith.science/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4.json","view_paper":"https://pith.science/paper/M3BSE2PN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.26344&json=true","fetch_graph":"https://pith.science/api/pith-number/M3BSE2PNTX3GLQIXHCFDHJNUB4/graph.json","fetch_events":"https://pith.science/api/pith-number/M3BSE2PNTX3GLQIXHCFDHJNUB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4/action/storage_attestation","attest_author":"https://pith.science/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4/action/author_attestation","sign_citation":"https://pith.science/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4/action/citation_signature","submit_replication":"https://pith.science/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4/action/replication_record"}},"created_at":"2026-05-18T03:10:12.166878+00:00","updated_at":"2026-05-18T03:10:12.166878+00:00"}