{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IFKOLA7HW5O5DWTAXZK5DOHHPK","short_pith_number":"pith:IFKOLA7H","schema_version":"1.0","canonical_sha256":"4154e583e7b75dd1da60be55d1b8e77ab003b11986245e8e2e535b2e95bc5a87","source":{"kind":"arxiv","id":"2503.14750","version":4},"attestation_state":"computed","paper":{"title":"Matrix nearness problems and eigenvalue optimization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA","math.DS","math.OC"],"primary_cat":"math.NA","authors_text":"Christian Lubich, Nicola Guglielmi","submitted_at":"2025-03-18T21:37:42Z","abstract_excerpt":"This book is about solving matrix nearness problems that are related to eigenvalues or singular values or pseudospectra. These problems arise in great diversity in various fields, be they related to dynamics, as in questions of robust stability and robust control, or related to graphs, as in questions of clustering and ranking. Algorithms for such problems work with matrix perturbations that drive eigenvalues or singular values or Rayleigh quotients to desired locations.\n  Remarkably, the optimal perturbation matrices are typically of rank one or are projections of rank-1 matrices onto a linea"},"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":"2503.14750","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2025-03-18T21:37:42Z","cross_cats_sorted":["cs.NA","math.DS","math.OC"],"title_canon_sha256":"d2c3c4365639beaa8bc72e834ed344121145f0e1e9206e8f538dc3fdba18d286","abstract_canon_sha256":"7f76283173e731345144bcf847e7a50d1cae98fea87bb28d9e00be36e65bb200"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T02:21:16.790536Z","signature_b64":"LNzfKtwdyC/wEOpjnL0dZ6pZdMHyMYLm8yQNOklhvnx+CMGKdLG+8AgS1/Moj88mWxm88YGugio6etL8ANRqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4154e583e7b75dd1da60be55d1b8e77ab003b11986245e8e2e535b2e95bc5a87","last_reissued_at":"2026-07-14T02:21:16.789563Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T02:21:16.789563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix nearness problems and eigenvalue optimization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA","math.DS","math.OC"],"primary_cat":"math.NA","authors_text":"Christian Lubich, Nicola Guglielmi","submitted_at":"2025-03-18T21:37:42Z","abstract_excerpt":"This book is about solving matrix nearness problems that are related to eigenvalues or singular values or pseudospectra. These problems arise in great diversity in various fields, be they related to dynamics, as in questions of robust stability and robust control, or related to graphs, as in questions of clustering and ranking. Algorithms for such problems work with matrix perturbations that drive eigenvalues or singular values or Rayleigh quotients to desired locations.\n  Remarkably, the optimal perturbation matrices are typically of rank one or are projections of rank-1 matrices onto a linea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.14750","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.14750/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2503.14750","created_at":"2026-07-14T02:21:16.790015+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.14750v4","created_at":"2026-07-14T02:21:16.790015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.14750","created_at":"2026-07-14T02:21:16.790015+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFKOLA7HW5O5","created_at":"2026-07-14T02:21:16.790015+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFKOLA7HW5O5DWTA","created_at":"2026-07-14T02:21:16.790015+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFKOLA7H","created_at":"2026-07-14T02:21:16.790015+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.28980","citing_title":"Manifold-based Algorithms for the Hadamard Decomposition","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2509.26344","citing_title":"Nearest matrix with multiple eigenvalues by Riemannian optimization","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13891","citing_title":"Characterization of stability radii for robustly asymptotically stable dissipative Hamiltonian differential-algebraic systems","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IFKOLA7HW5O5DWTAXZK5DOHHPK","json":"https://pith.science/pith/IFKOLA7HW5O5DWTAXZK5DOHHPK.json","graph_json":"https://pith.science/api/pith-number/IFKOLA7HW5O5DWTAXZK5DOHHPK/graph.json","events_json":"https://pith.science/api/pith-number/IFKOLA7HW5O5DWTAXZK5DOHHPK/events.json","paper":"https://pith.science/paper/IFKOLA7H"},"agent_actions":{"view_html":"https://pith.science/pith/IFKOLA7HW5O5DWTAXZK5DOHHPK","download_json":"https://pith.science/pith/IFKOLA7HW5O5DWTAXZK5DOHHPK.json","view_paper":"https://pith.science/paper/IFKOLA7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.14750&json=true","fetch_graph":"https://pith.science/api/pith-number/IFKOLA7HW5O5DWTAXZK5DOHHPK/graph.json","fetch_events":"https://pith.science/api/pith-number/IFKOLA7HW5O5DWTAXZK5DOHHPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFKOLA7HW5O5DWTAXZK5DOHHPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFKOLA7HW5O5DWTAXZK5DOHHPK/action/storage_attestation","attest_author":"https://pith.science/pith/IFKOLA7HW5O5DWTAXZK5DOHHPK/action/author_attestation","sign_citation":"https://pith.science/pith/IFKOLA7HW5O5DWTAXZK5DOHHPK/action/citation_signature","submit_replication":"https://pith.science/pith/IFKOLA7HW5O5DWTAXZK5DOHHPK/action/replication_record"}},"created_at":"2026-07-14T02:21:16.790015+00:00","updated_at":"2026-07-14T02:21:16.790015+00:00"}