{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:T3LE46WAEVDA3DMN6FZ7HGRR4U","short_pith_number":"pith:T3LE46WA","canonical_record":{"source":{"id":"1907.06537","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T15:05:10Z","cross_cats_sorted":[],"title_canon_sha256":"b0018cfe78d51f8a9d9d3e6869d9b819df69c0eb9af2ad288ed12854a9d42eb1","abstract_canon_sha256":"707db87d0575f0bdab269ac433dc75a4b8b6c0fe94f173fd6e014014bfd23245"},"schema_version":"1.0"},"canonical_sha256":"9ed64e7ac025460d8d8df173f39a31e51ce2f285e5c5fcc8c78ad031fc61dc41","source":{"kind":"arxiv","id":"1907.06537","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06537","created_at":"2026-07-05T02:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06537v4","created_at":"2026-07-05T02:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06537","created_at":"2026-07-05T02:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"T3LE46WAEVDA","created_at":"2026-07-05T02:01:09Z"},{"alias_kind":"pith_short_16","alias_value":"T3LE46WAEVDA3DMN","created_at":"2026-07-05T02:01:09Z"},{"alias_kind":"pith_short_8","alias_value":"T3LE46WA","created_at":"2026-07-05T02:01:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:T3LE46WAEVDA3DMN6FZ7HGRR4U","target":"record","payload":{"canonical_record":{"source":{"id":"1907.06537","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T15:05:10Z","cross_cats_sorted":[],"title_canon_sha256":"b0018cfe78d51f8a9d9d3e6869d9b819df69c0eb9af2ad288ed12854a9d42eb1","abstract_canon_sha256":"707db87d0575f0bdab269ac433dc75a4b8b6c0fe94f173fd6e014014bfd23245"},"schema_version":"1.0"},"canonical_sha256":"9ed64e7ac025460d8d8df173f39a31e51ce2f285e5c5fcc8c78ad031fc61dc41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:01:09.471500Z","signature_b64":"M3hrcUp+L4hCF7z76FsTiJ6s6V3nMCofm3+Hl1PVyV22JYBVCAe8Y3pCRF7AGorOqKvpPa04IQ/7ZsFuCqegBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ed64e7ac025460d8d8df173f39a31e51ce2f285e5c5fcc8c78ad031fc61dc41","last_reissued_at":"2026-07-05T02:01:09.471117Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:01:09.471117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.06537","source_version":4,"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-07-05T02:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NfStjm1MbdFLjbnF6qRpZKSRfi/fk5lHaI35wQcbkKYCzU58cqTVAObR4OQu+e1GycER/GMYcn9X1/fOs6/yAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T17:03:05.649397Z"},"content_sha256":"953c89026f3e3c30919f77a3fdcb8dc78fac238788ff5bbcc84d0f6d5bc0b747","schema_version":"1.0","event_id":"sha256:953c89026f3e3c30919f77a3fdcb8dc78fac238788ff5bbcc84d0f6d5bc0b747"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:T3LE46WAEVDA3DMN6FZ7HGRR4U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the Kreiss Constant of a Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Tim Mitchell","submitted_at":"2019-07-15T15:05:10Z","abstract_excerpt":"We establish the first globally convergent algorithms for computing the Kreiss constant of a matrix to arbitrary accuracy. We propose three different iterations for continuous-time Kreiss constants and analogues for discrete-time Kreiss constants. With standard eigensolvers, the methods do $\\mathcal{O}(n^6)$ work, but we show how this theoretical work complexity can be lowered to $\\mathcal{O}(n^4)$ on average and $\\mathcal{O}(n^5)$ in the worst case via divide-and-conquer variants. Finally, locally optimal Kreiss constant approximations can be efficiently obtained for large-scale matrices via "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06537","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/1907.06537/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"},"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-07-05T02:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1D31eF8FLZhtZS30WQ7F3YLljOaaz+8qKnOxo9Izh/Y9z65RRTOnwSG7CEbFfdfz2nNTn21TW1DvL5S4XLnADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T17:03:05.649932Z"},"content_sha256":"364c2ca6f4b0b64df85e60cd6bf5d1c15a07ca182ac95546b68fadf27e729a9c","schema_version":"1.0","event_id":"sha256:364c2ca6f4b0b64df85e60cd6bf5d1c15a07ca182ac95546b68fadf27e729a9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T3LE46WAEVDA3DMN6FZ7HGRR4U/bundle.json","state_url":"https://pith.science/pith/T3LE46WAEVDA3DMN6FZ7HGRR4U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T3LE46WAEVDA3DMN6FZ7HGRR4U/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-08-05T17:03:05Z","links":{"resolver":"https://pith.science/pith/T3LE46WAEVDA3DMN6FZ7HGRR4U","bundle":"https://pith.science/pith/T3LE46WAEVDA3DMN6FZ7HGRR4U/bundle.json","state":"https://pith.science/pith/T3LE46WAEVDA3DMN6FZ7HGRR4U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T3LE46WAEVDA3DMN6FZ7HGRR4U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:T3LE46WAEVDA3DMN6FZ7HGRR4U","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":"707db87d0575f0bdab269ac433dc75a4b8b6c0fe94f173fd6e014014bfd23245","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T15:05:10Z","title_canon_sha256":"b0018cfe78d51f8a9d9d3e6869d9b819df69c0eb9af2ad288ed12854a9d42eb1"},"schema_version":"1.0","source":{"id":"1907.06537","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06537","created_at":"2026-07-05T02:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06537v4","created_at":"2026-07-05T02:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06537","created_at":"2026-07-05T02:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"T3LE46WAEVDA","created_at":"2026-07-05T02:01:09Z"},{"alias_kind":"pith_short_16","alias_value":"T3LE46WAEVDA3DMN","created_at":"2026-07-05T02:01:09Z"},{"alias_kind":"pith_short_8","alias_value":"T3LE46WA","created_at":"2026-07-05T02:01:09Z"}],"graph_snapshots":[{"event_id":"sha256:364c2ca6f4b0b64df85e60cd6bf5d1c15a07ca182ac95546b68fadf27e729a9c","target":"graph","created_at":"2026-07-05T02:01:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.06537/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We establish the first globally convergent algorithms for computing the Kreiss constant of a matrix to arbitrary accuracy. We propose three different iterations for continuous-time Kreiss constants and analogues for discrete-time Kreiss constants. With standard eigensolvers, the methods do $\\mathcal{O}(n^6)$ work, but we show how this theoretical work complexity can be lowered to $\\mathcal{O}(n^4)$ on average and $\\mathcal{O}(n^5)$ in the worst case via divide-and-conquer variants. Finally, locally optimal Kreiss constant approximations can be efficiently obtained for large-scale matrices via ","authors_text":"Tim Mitchell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T15:05:10Z","title":"Computing the Kreiss Constant of a Matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06537","kind":"arxiv","version":4},"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:953c89026f3e3c30919f77a3fdcb8dc78fac238788ff5bbcc84d0f6d5bc0b747","target":"record","created_at":"2026-07-05T02:01:09Z","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":"707db87d0575f0bdab269ac433dc75a4b8b6c0fe94f173fd6e014014bfd23245","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T15:05:10Z","title_canon_sha256":"b0018cfe78d51f8a9d9d3e6869d9b819df69c0eb9af2ad288ed12854a9d42eb1"},"schema_version":"1.0","source":{"id":"1907.06537","kind":"arxiv","version":4}},"canonical_sha256":"9ed64e7ac025460d8d8df173f39a31e51ce2f285e5c5fcc8c78ad031fc61dc41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ed64e7ac025460d8d8df173f39a31e51ce2f285e5c5fcc8c78ad031fc61dc41","first_computed_at":"2026-07-05T02:01:09.471117Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:01:09.471117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M3hrcUp+L4hCF7z76FsTiJ6s6V3nMCofm3+Hl1PVyV22JYBVCAe8Y3pCRF7AGorOqKvpPa04IQ/7ZsFuCqegBg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:01:09.471500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.06537","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:953c89026f3e3c30919f77a3fdcb8dc78fac238788ff5bbcc84d0f6d5bc0b747","sha256:364c2ca6f4b0b64df85e60cd6bf5d1c15a07ca182ac95546b68fadf27e729a9c"],"state_sha256":"8a6f4040b23629d5f12788fd6743f861ee0344b605f5562814787ee6cba54907"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U8ge3LVSbnYAfzUD4DFuiGkTgOi7wFTjSCziTkhzoG+tqHw86WfBGC2gtZrOduGzCKzAKlPCiZdti5QZ3z20Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T17:03:05.656343Z","bundle_sha256":"f1540be1e83e039e4b62f16888c15fbca80d811c893696ae030af308566ff976"}}