{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2T37ITPMHNHPXGQ5M2OM2MNLQU","short_pith_number":"pith:2T37ITPM","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"},"canonical_sha256":"d4f7f44dec3b4efb9a1d669ccd31ab85169e4045edfe7fa88e072197f3ef37a3","source":{"kind":"arxiv","id":"1612.04196","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04196","created_at":"2026-05-18T00:55:05Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04196v1","created_at":"2026-05-18T00:55:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04196","created_at":"2026-05-18T00:55:05Z"},{"alias_kind":"pith_short_12","alias_value":"2T37ITPMHNHP","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2T37ITPMHNHPXGQ5","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2T37ITPM","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2T37ITPMHNHPXGQ5M2OM2MNLQU","target":"record","payload":{"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"},"canonical_sha256":"d4f7f44dec3b4efb9a1d669ccd31ab85169e4045edfe7fa88e072197f3ef37a3","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"},"source_kind":"arxiv","source_id":"1612.04196","source_version":1,"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-18T00:55:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EBs6lpM93lds2ZuWhD9jwxYf07KCOA59XMqoDvA8BUf8bcuJTCw6qcaJD6AvJaQjkQ5iI0/M4dhZuQW7x0aLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T11:36:26.399282Z"},"content_sha256":"228ce81bfcbf8fbc69d9aae60df95e4f32c85312caca41f990565c81cfae3624","schema_version":"1.0","event_id":"sha256:228ce81bfcbf8fbc69d9aae60df95e4f32c85312caca41f990565c81cfae3624"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2T37ITPMHNHPXGQ5M2OM2MNLQU","target":"graph","payload":{"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"},"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-18T00:55:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+yexHyvcw/A7neAPkqNltfReY7Ao9nJfUudkiiLbWUDc6EbZkka0/nPiCVScxxX3Msu4YxAieoP8RZ8CEePsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T11:36:26.399646Z"},"content_sha256":"6146773fd4545c0796c10d21d18f9bab138f78716aa59aa75c24142650d34ecb","schema_version":"1.0","event_id":"sha256:6146773fd4545c0796c10d21d18f9bab138f78716aa59aa75c24142650d34ecb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2T37ITPMHNHPXGQ5M2OM2MNLQU/bundle.json","state_url":"https://pith.science/pith/2T37ITPMHNHPXGQ5M2OM2MNLQU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2T37ITPMHNHPXGQ5M2OM2MNLQU/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-06-24T11:36:26Z","links":{"resolver":"https://pith.science/pith/2T37ITPMHNHPXGQ5M2OM2MNLQU","bundle":"https://pith.science/pith/2T37ITPMHNHPXGQ5M2OM2MNLQU/bundle.json","state":"https://pith.science/pith/2T37ITPMHNHPXGQ5M2OM2MNLQU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2T37ITPMHNHPXGQ5M2OM2MNLQU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2T37ITPMHNHPXGQ5M2OM2MNLQU","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":"37d6b6694526111820aff320fdf513af4771a83dab805ed45f4dcdf31f95e115","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-12-13T14:23:34Z","title_canon_sha256":"8a79a07660b5b47ef51ee4123f8a69d4b860917c4f67d19b6cb14f3af792aa3e"},"schema_version":"1.0","source":{"id":"1612.04196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04196","created_at":"2026-05-18T00:55:05Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04196v1","created_at":"2026-05-18T00:55:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04196","created_at":"2026-05-18T00:55:05Z"},{"alias_kind":"pith_short_12","alias_value":"2T37ITPMHNHP","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2T37ITPMHNHPXGQ5","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2T37ITPM","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:6146773fd4545c0796c10d21d18f9bab138f78716aa59aa75c24142650d34ecb","target":"graph","created_at":"2026-05-18T00:55:05Z","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":"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","authors_text":"Leonardo Robol, Luca Gemignani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-12-13T14:23:34Z","title":"Fast Hessenberg reduction of some rank structured matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04196","kind":"arxiv","version":1},"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:228ce81bfcbf8fbc69d9aae60df95e4f32c85312caca41f990565c81cfae3624","target":"record","created_at":"2026-05-18T00:55:05Z","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":"37d6b6694526111820aff320fdf513af4771a83dab805ed45f4dcdf31f95e115","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-12-13T14:23:34Z","title_canon_sha256":"8a79a07660b5b47ef51ee4123f8a69d4b860917c4f67d19b6cb14f3af792aa3e"},"schema_version":"1.0","source":{"id":"1612.04196","kind":"arxiv","version":1}},"canonical_sha256":"d4f7f44dec3b4efb9a1d669ccd31ab85169e4045edfe7fa88e072197f3ef37a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4f7f44dec3b4efb9a1d669ccd31ab85169e4045edfe7fa88e072197f3ef37a3","first_computed_at":"2026-05-18T00:55:05.176039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:05.176039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7kOFcMFBdpZffYQoF+nUtw+ETAIkIT0NL4aq/o5A6HR30S+9vLnCowvfmopTY5wyJ327smmTILWBaQklfbEkBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:05.176512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.04196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:228ce81bfcbf8fbc69d9aae60df95e4f32c85312caca41f990565c81cfae3624","sha256:6146773fd4545c0796c10d21d18f9bab138f78716aa59aa75c24142650d34ecb"],"state_sha256":"1352b4e83c61f25220ee6f84e3d32929a13df82e77333dd589f2ce0b01b9b753"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CwMRZzoXTbBXrjlRQHdZBRw6uTrkv7u0sUjUhtMRAKtOrnihQCnJ1hil4ybA/JNY5F6nsbMM3nV9MLi0cqpxDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T11:36:26.401533Z","bundle_sha256":"1e65566a4bc3dfdd2ff5cbe337d4fbf484f36a7d9efcf5de905062c6e446c767"}}