{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IFXBGBH7G4TH2EFAKNIII4FZQ2","short_pith_number":"pith:IFXBGBH7","schema_version":"1.0","canonical_sha256":"416e1304ff37267d10a053508470b986a8e5260484501243c4c95aa41660d0ff","source":{"kind":"arxiv","id":"2409.04297","version":3},"attestation_state":"computed","paper":{"title":"Minimization of the Pseudospectral Abscissa of a Quadratic Matrix Polynomial","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Emre Mengi, Volker Mehrmann","submitted_at":"2024-09-06T14:13:57Z","abstract_excerpt":"For a quadratic matrix polynomial dependent on parameters and a given tolerance $\\epsilon > 0$, the minimization of the $\\epsilon$-pseudospectral abscissa over the set of permissible parameter values is discussed, with applications in damping optimization and brake squeal reductions in mind. An approach is introduced that is based on nonsmooth and global optimization (or smooth optimization techniques such as BFGS if there are many parameters) equipped with a globally convergent criss-cross algorithm to compute the $\\epsilon$-pseudospectral abscissa objective when the matrix polynomial is of s"},"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":"2409.04297","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-09-06T14:13:57Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"c2d978b54734439eaa3a39f0b724fb6cafd972045f9405560967f39beda55a31","abstract_canon_sha256":"5e2915a395361fcf83db7011d68daa11457deb42023a2f98aae55f1d43063b79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:35.616668Z","signature_b64":"Ylq6WyvMsDb/QvPquRk/tS627Rm/aPYwWjaW+clAnY7hHdmC9kNYPzchccAVPaxAaa1iT34oNzLSLjHu7NlGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"416e1304ff37267d10a053508470b986a8e5260484501243c4c95aa41660d0ff","last_reissued_at":"2026-07-05T12:02:35.616124Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:35.616124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimization of the Pseudospectral Abscissa of a Quadratic Matrix Polynomial","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Emre Mengi, Volker Mehrmann","submitted_at":"2024-09-06T14:13:57Z","abstract_excerpt":"For a quadratic matrix polynomial dependent on parameters and a given tolerance $\\epsilon > 0$, the minimization of the $\\epsilon$-pseudospectral abscissa over the set of permissible parameter values is discussed, with applications in damping optimization and brake squeal reductions in mind. An approach is introduced that is based on nonsmooth and global optimization (or smooth optimization techniques such as BFGS if there are many parameters) equipped with a globally convergent criss-cross algorithm to compute the $\\epsilon$-pseudospectral abscissa objective when the matrix polynomial is of s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.04297","kind":"arxiv","version":3},"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/2409.04297/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":"2409.04297","created_at":"2026-07-05T12:02:35.616187+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.04297v3","created_at":"2026-07-05T12:02:35.616187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04297","created_at":"2026-07-05T12:02:35.616187+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFXBGBH7G4TH","created_at":"2026-07-05T12:02:35.616187+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFXBGBH7G4TH2EFA","created_at":"2026-07-05T12:02:35.616187+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFXBGBH7","created_at":"2026-07-05T12:02:35.616187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05535","citing_title":"Approximation of the Pseudospectral Abscissa via Eigenvalue Perturbation Theory","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IFXBGBH7G4TH2EFAKNIII4FZQ2","json":"https://pith.science/pith/IFXBGBH7G4TH2EFAKNIII4FZQ2.json","graph_json":"https://pith.science/api/pith-number/IFXBGBH7G4TH2EFAKNIII4FZQ2/graph.json","events_json":"https://pith.science/api/pith-number/IFXBGBH7G4TH2EFAKNIII4FZQ2/events.json","paper":"https://pith.science/paper/IFXBGBH7"},"agent_actions":{"view_html":"https://pith.science/pith/IFXBGBH7G4TH2EFAKNIII4FZQ2","download_json":"https://pith.science/pith/IFXBGBH7G4TH2EFAKNIII4FZQ2.json","view_paper":"https://pith.science/paper/IFXBGBH7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.04297&json=true","fetch_graph":"https://pith.science/api/pith-number/IFXBGBH7G4TH2EFAKNIII4FZQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/IFXBGBH7G4TH2EFAKNIII4FZQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFXBGBH7G4TH2EFAKNIII4FZQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFXBGBH7G4TH2EFAKNIII4FZQ2/action/storage_attestation","attest_author":"https://pith.science/pith/IFXBGBH7G4TH2EFAKNIII4FZQ2/action/author_attestation","sign_citation":"https://pith.science/pith/IFXBGBH7G4TH2EFAKNIII4FZQ2/action/citation_signature","submit_replication":"https://pith.science/pith/IFXBGBH7G4TH2EFAKNIII4FZQ2/action/replication_record"}},"created_at":"2026-07-05T12:02:35.616187+00:00","updated_at":"2026-07-05T12:02:35.616187+00:00"}