{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UJGKUZOPMGHKIFLJONJYQEXD2C","short_pith_number":"pith:UJGKUZOP","canonical_record":{"source":{"id":"1611.02435","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-08T09:11:52Z","cross_cats_sorted":[],"title_canon_sha256":"6e879e50dda07d7c455ac4d8702864b74c445d0c5c4b52bb955c4f9da827c8de","abstract_canon_sha256":"8acce21b7fefcc5839d598756dc39f6f0028218b22a0fb7824ea773ea7ce3fd0"},"schema_version":"1.0"},"canonical_sha256":"a24caa65cf618ea4156973538812e3d09857051464c58029a07be9b122c6857c","source":{"kind":"arxiv","id":"1611.02435","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02435","created_at":"2026-05-18T00:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02435v3","created_at":"2026-05-18T00:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02435","created_at":"2026-05-18T00:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"UJGKUZOPMGHK","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UJGKUZOPMGHKIFLJ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UJGKUZOP","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UJGKUZOPMGHKIFLJONJYQEXD2C","target":"record","payload":{"canonical_record":{"source":{"id":"1611.02435","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-08T09:11:52Z","cross_cats_sorted":[],"title_canon_sha256":"6e879e50dda07d7c455ac4d8702864b74c445d0c5c4b52bb955c4f9da827c8de","abstract_canon_sha256":"8acce21b7fefcc5839d598756dc39f6f0028218b22a0fb7824ea773ea7ce3fd0"},"schema_version":"1.0"},"canonical_sha256":"a24caa65cf618ea4156973538812e3d09857051464c58029a07be9b122c6857c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:24.625944Z","signature_b64":"Oeu4a/XulMPGLXLhCEW6Z+toXTpjQBupe5zpWUliT0gp+YLeXGGxPMPiq+M4I+hYt+b8sXj+lRCbA5Xz3RF7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a24caa65cf618ea4156973538812e3d09857051464c58029a07be9b122c6857c","last_reissued_at":"2026-05-18T00:10:24.625264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:24.625264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.02435","source_version":3,"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:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xWhhPweywhVMXoHUQHQUyYR2jPon4Q7Z/uidNP6YFpsqI1h9LeOBbBQNfjcVED+AqaDCTc73EWS6mTxXlRnCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:51:05.125164Z"},"content_sha256":"6e5654a4291a086bcaf8e7d2ed37cb724e865f8a33d42cec85dd6487715dd6b1","schema_version":"1.0","event_id":"sha256:6e5654a4291a086bcaf8e7d2ed37cb724e865f8a33d42cec85dd6487715dd6b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UJGKUZOPMGHKIFLJONJYQEXD2C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and backward stable computation of roots of polynomials, Part II: backward error analysis; companion matrix and companion pencil","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"David S. Watkins, Jared L. Aurentz, Leonardo Robol, Raf Vandebril, Thomas Mach","submitted_at":"2016-11-08T09:11:52Z","abstract_excerpt":"This work is a continuation of \"Fast and backward stable computation of roots of polynomials\" by J.L. Aurentz, T. Mach, R. Vandebril, and D.S. Watkins, SIAM Journal on Matrix Analysis and Applications, 36(3): 942--973, 2015. In that paper we introduced a companion QR algorithm that finds the roots of a polynomial by computing the eigenvalues of the companion matrix in $O(n^{2})$ time using $O(n)$ memory. We proved that the method is backward stable. Here we introduce, as an alternative, a companion QZ algorithm that solves a generalized eigenvalue problem for a companion pencil. More important"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02435","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":""},"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:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OdSiEe7JKtVtcXJDd8GPRBg3A/3LuqRQpggx2VPmBYA3LmMaQ943V1OQDo6bp8BG82/JVXpcHJczoiZ/oFtQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:51:05.125852Z"},"content_sha256":"886a69b6dfb859a7343172f781ed82b54b67743c53ce7dc215d5bee76af11143","schema_version":"1.0","event_id":"sha256:886a69b6dfb859a7343172f781ed82b54b67743c53ce7dc215d5bee76af11143"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJGKUZOPMGHKIFLJONJYQEXD2C/bundle.json","state_url":"https://pith.science/pith/UJGKUZOPMGHKIFLJONJYQEXD2C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJGKUZOPMGHKIFLJONJYQEXD2C/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-31T05:51:05Z","links":{"resolver":"https://pith.science/pith/UJGKUZOPMGHKIFLJONJYQEXD2C","bundle":"https://pith.science/pith/UJGKUZOPMGHKIFLJONJYQEXD2C/bundle.json","state":"https://pith.science/pith/UJGKUZOPMGHKIFLJONJYQEXD2C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJGKUZOPMGHKIFLJONJYQEXD2C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UJGKUZOPMGHKIFLJONJYQEXD2C","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":"8acce21b7fefcc5839d598756dc39f6f0028218b22a0fb7824ea773ea7ce3fd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-08T09:11:52Z","title_canon_sha256":"6e879e50dda07d7c455ac4d8702864b74c445d0c5c4b52bb955c4f9da827c8de"},"schema_version":"1.0","source":{"id":"1611.02435","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02435","created_at":"2026-05-18T00:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02435v3","created_at":"2026-05-18T00:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02435","created_at":"2026-05-18T00:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"UJGKUZOPMGHK","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UJGKUZOPMGHKIFLJ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UJGKUZOP","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:886a69b6dfb859a7343172f781ed82b54b67743c53ce7dc215d5bee76af11143","target":"graph","created_at":"2026-05-18T00:10:24Z","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":"This work is a continuation of \"Fast and backward stable computation of roots of polynomials\" by J.L. Aurentz, T. Mach, R. Vandebril, and D.S. Watkins, SIAM Journal on Matrix Analysis and Applications, 36(3): 942--973, 2015. In that paper we introduced a companion QR algorithm that finds the roots of a polynomial by computing the eigenvalues of the companion matrix in $O(n^{2})$ time using $O(n)$ memory. We proved that the method is backward stable. Here we introduce, as an alternative, a companion QZ algorithm that solves a generalized eigenvalue problem for a companion pencil. More important","authors_text":"David S. Watkins, Jared L. Aurentz, Leonardo Robol, Raf Vandebril, Thomas Mach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-08T09:11:52Z","title":"Fast and backward stable computation of roots of polynomials, Part II: backward error analysis; companion matrix and companion pencil"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02435","kind":"arxiv","version":3},"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:6e5654a4291a086bcaf8e7d2ed37cb724e865f8a33d42cec85dd6487715dd6b1","target":"record","created_at":"2026-05-18T00:10:24Z","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":"8acce21b7fefcc5839d598756dc39f6f0028218b22a0fb7824ea773ea7ce3fd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-08T09:11:52Z","title_canon_sha256":"6e879e50dda07d7c455ac4d8702864b74c445d0c5c4b52bb955c4f9da827c8de"},"schema_version":"1.0","source":{"id":"1611.02435","kind":"arxiv","version":3}},"canonical_sha256":"a24caa65cf618ea4156973538812e3d09857051464c58029a07be9b122c6857c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a24caa65cf618ea4156973538812e3d09857051464c58029a07be9b122c6857c","first_computed_at":"2026-05-18T00:10:24.625264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:24.625264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oeu4a/XulMPGLXLhCEW6Z+toXTpjQBupe5zpWUliT0gp+YLeXGGxPMPiq+M4I+hYt+b8sXj+lRCbA5Xz3RF7AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:24.625944Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02435","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e5654a4291a086bcaf8e7d2ed37cb724e865f8a33d42cec85dd6487715dd6b1","sha256:886a69b6dfb859a7343172f781ed82b54b67743c53ce7dc215d5bee76af11143"],"state_sha256":"635a3cd8d081afbfe69c6f2eb9ac22142f8c4c01c1249842d1fc4dfdfadf92ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vjg5E5N53vwraFp1Sm4uFqpbtSTrBPhXdzBfF5FiUd3Mv2VfgqQzIHrNtpodNPptOrERS7M1Y0bgFl2LHPo2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:51:05.129266Z","bundle_sha256":"ae2d9778b04d5638ed5e294ee21292e83e643ca59e7acd1566f15afc791e9e13"}}