{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:M3BSE2PNTX3GLQIXHCFDHJNUB4","short_pith_number":"pith:M3BSE2PN","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"},"canonical_sha256":"66c32269ed9df665c117388a33a5b40f18efd0c19f3bb35557d0763b04a81ec9","source":{"kind":"arxiv","id":"2509.26344","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.26344","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"2509.26344v2","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.26344","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"M3BSE2PNTX3G","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"M3BSE2PNTX3GLQIX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"M3BSE2PN","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:M3BSE2PNTX3GLQIXHCFDHJNUB4","target":"record","payload":{"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"},"canonical_sha256":"66c32269ed9df665c117388a33a5b40f18efd0c19f3bb35557d0763b04a81ec9","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"},"source_kind":"arxiv","source_id":"2509.26344","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sGZDBxE/YlA/GmBon4RdUG0Q9XF2lVklW+xW1F6i5MXqnEWfKCK2YkuqsI1LGC0FNCRUjTBcWHfmKDQdJELmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:14:41.422184Z"},"content_sha256":"6e74e21c3a36be8be3e2a9309f975880bb987cd6e09aa5c0bf6c79b271ea9487","schema_version":"1.0","event_id":"sha256:6e74e21c3a36be8be3e2a9309f975880bb987cd6e09aa5c0bf6c79b271ea9487"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:M3BSE2PNTX3GLQIXHCFDHJNUB4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eL5qZ88r0o2mFpjZ9oV87Sl0d7YrpFwyxYzvQhwr4WKYXsHukZL3JhRhU8YXF6UEpAMRbvZJg0peODag95HzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:14:41.422554Z"},"content_sha256":"1b67cc5251e78ab02914edf2d463a5726c500260e213662bec71e6dce153e2aa","schema_version":"1.0","event_id":"sha256:1b67cc5251e78ab02914edf2d463a5726c500260e213662bec71e6dce153e2aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4/bundle.json","state_url":"https://pith.science/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-21T13:14:41Z","links":{"resolver":"https://pith.science/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4","bundle":"https://pith.science/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4/bundle.json","state":"https://pith.science/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3BSE2PNTX3GLQIXHCFDHJNUB4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:M3BSE2PNTX3GLQIXHCFDHJNUB4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ae990f3a1ddc72df6563284a83c63b259e9b72523ec208135c4fb4dfb405703c","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2025-09-30T14:50:45Z","title_canon_sha256":"7f296ba592483607c90c26316eeccbdd6824ab31a26249ff040afaca54378034"},"schema_version":"1.0","source":{"id":"2509.26344","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.26344","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"2509.26344v2","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.26344","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"M3BSE2PNTX3G","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"M3BSE2PNTX3GLQIX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"M3BSE2PN","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:1b67cc5251e78ab02914edf2d463a5726c500260e213662bec71e6dce153e2aa","target":"graph","created_at":"2026-05-18T03:10:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Federico Poloni, Lauri Nyman, Vanni Noferini","cross_cats":["cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2025-09-30T14:50:45Z","title":"Nearest matrix with multiple eigenvalues by Riemannian optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.26344","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6e74e21c3a36be8be3e2a9309f975880bb987cd6e09aa5c0bf6c79b271ea9487","target":"record","created_at":"2026-05-18T03:10:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ae990f3a1ddc72df6563284a83c63b259e9b72523ec208135c4fb4dfb405703c","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2025-09-30T14:50:45Z","title_canon_sha256":"7f296ba592483607c90c26316eeccbdd6824ab31a26249ff040afaca54378034"},"schema_version":"1.0","source":{"id":"2509.26344","kind":"arxiv","version":2}},"canonical_sha256":"66c32269ed9df665c117388a33a5b40f18efd0c19f3bb35557d0763b04a81ec9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66c32269ed9df665c117388a33a5b40f18efd0c19f3bb35557d0763b04a81ec9","first_computed_at":"2026-05-18T03:10:12.166750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:12.166750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ARyTVBGLFPOb19xEz9gbqKz/jb83f1Q64IpH9hHCKR63OQBLwUUhE+t3uy+ZICwPVFt4eswPfyeXCgcNVM1PCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:12.167580Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.26344","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e74e21c3a36be8be3e2a9309f975880bb987cd6e09aa5c0bf6c79b271ea9487","sha256:1b67cc5251e78ab02914edf2d463a5726c500260e213662bec71e6dce153e2aa"],"state_sha256":"d482eab0e198167bd53d9d6bb4b4c647740e3af11134591a5eb44fed279efd37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AVlJ1dmlQt+4B9lfKkGo37HiB+Gfjos6RqYWJZZ3jMz3vj8AA/yy1RaSGKq9jqlDcWCbgZx7epD+RnwNEXY4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T13:14:41.424600Z","bundle_sha256":"1cc2e7faf5de32c3ef72e78cd41581cfc6d5ff3ef1efacab7200b0d727d90f02"}}