{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2T37ITPMHNHPXGQ5M2OM2MNLQU","short_pith_number":"pith:2T37ITPM","schema_version":"1.0","canonical_sha256":"d4f7f44dec3b4efb9a1d669ccd31ab85169e4045edfe7fa88e072197f3ef37a3","source":{"kind":"arxiv","id":"1612.04196","version":1},"attestation_state":"computed","paper":{"title":"Fast Hessenberg reduction of some rank structured matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Leonardo Robol, Luca Gemignani","submitted_at":"2016-12-13T14:23:34Z","abstract_excerpt":"We develop two fast algorithms for Hessenberg reduction of a structured matrix $A = D + UV^H$ where $D$ is a real or unitary $n \\times n$ diagonal matrix and $U, V \\in\\mathbb{C}^{n \\times k}$. The proposed algorithm for the real case exploits a two--stage approach by first reducing the matrix to a generalized Hessenberg form and then completing the reduction by annihilation of the unwanted sub-diagonals. It is shown that the novel method requires $O(n^2k)$ arithmetic operations and it is significantly faster than other reduction algorithms for rank structured matrices. The method is then exten"},"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":"1612.04196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-12-13T14:23:34Z","cross_cats_sorted":[],"title_canon_sha256":"8a79a07660b5b47ef51ee4123f8a69d4b860917c4f67d19b6cb14f3af792aa3e","abstract_canon_sha256":"37d6b6694526111820aff320fdf513af4771a83dab805ed45f4dcdf31f95e115"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:05.176512Z","signature_b64":"7kOFcMFBdpZffYQoF+nUtw+ETAIkIT0NL4aq/o5A6HR30S+9vLnCowvfmopTY5wyJ327smmTILWBaQklfbEkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4f7f44dec3b4efb9a1d669ccd31ab85169e4045edfe7fa88e072197f3ef37a3","last_reissued_at":"2026-05-18T00:55:05.176039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:05.176039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Hessenberg reduction of some rank structured matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Leonardo Robol, Luca Gemignani","submitted_at":"2016-12-13T14:23:34Z","abstract_excerpt":"We develop two fast algorithms for Hessenberg reduction of a structured matrix $A = D + UV^H$ where $D$ is a real or unitary $n \\times n$ diagonal matrix and $U, V \\in\\mathbb{C}^{n \\times k}$. The proposed algorithm for the real case exploits a two--stage approach by first reducing the matrix to a generalized Hessenberg form and then completing the reduction by annihilation of the unwanted sub-diagonals. It is shown that the novel method requires $O(n^2k)$ arithmetic operations and it is significantly faster than other reduction algorithms for rank structured matrices. The method is then exten"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04196","kind":"arxiv","version":1},"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":"1612.04196","created_at":"2026-05-18T00:55:05.176108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.04196v1","created_at":"2026-05-18T00:55:05.176108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04196","created_at":"2026-05-18T00:55:05.176108+00:00"},{"alias_kind":"pith_short_12","alias_value":"2T37ITPMHNHP","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2T37ITPMHNHPXGQ5","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2T37ITPM","created_at":"2026-05-18T12:29:55.572404+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/2T37ITPMHNHPXGQ5M2OM2MNLQU","json":"https://pith.science/pith/2T37ITPMHNHPXGQ5M2OM2MNLQU.json","graph_json":"https://pith.science/api/pith-number/2T37ITPMHNHPXGQ5M2OM2MNLQU/graph.json","events_json":"https://pith.science/api/pith-number/2T37ITPMHNHPXGQ5M2OM2MNLQU/events.json","paper":"https://pith.science/paper/2T37ITPM"},"agent_actions":{"view_html":"https://pith.science/pith/2T37ITPMHNHPXGQ5M2OM2MNLQU","download_json":"https://pith.science/pith/2T37ITPMHNHPXGQ5M2OM2MNLQU.json","view_paper":"https://pith.science/paper/2T37ITPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.04196&json=true","fetch_graph":"https://pith.science/api/pith-number/2T37ITPMHNHPXGQ5M2OM2MNLQU/graph.json","fetch_events":"https://pith.science/api/pith-number/2T37ITPMHNHPXGQ5M2OM2MNLQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2T37ITPMHNHPXGQ5M2OM2MNLQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2T37ITPMHNHPXGQ5M2OM2MNLQU/action/storage_attestation","attest_author":"https://pith.science/pith/2T37ITPMHNHPXGQ5M2OM2MNLQU/action/author_attestation","sign_citation":"https://pith.science/pith/2T37ITPMHNHPXGQ5M2OM2MNLQU/action/citation_signature","submit_replication":"https://pith.science/pith/2T37ITPMHNHPXGQ5M2OM2MNLQU/action/replication_record"}},"created_at":"2026-05-18T00:55:05.176108+00:00","updated_at":"2026-05-18T00:55:05.176108+00:00"}