{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:L4YIHRGUM423TV64HIG6AG4SY4","short_pith_number":"pith:L4YIHRGU","canonical_record":{"source":{"id":"1704.05837","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-19T17:45:15Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"1cb5ce2b3739c3712855132ce7a8f86933ef49eea734ab7489c1be4dade78b22","abstract_canon_sha256":"32b6f930f6889f80e2dad0c2a840b0c7bd5c846a8e09fbca70d3f7e64c3358fc"},"schema_version":"1.0"},"canonical_sha256":"5f3083c4d46735b9d7dc3a0de01b92c73769a5feb9e91f73f0b9dbc7a5c0e694","source":{"kind":"arxiv","id":"1704.05837","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05837","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05837v2","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05837","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"L4YIHRGUM423","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L4YIHRGUM423TV64","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L4YIHRGU","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:L4YIHRGUM423TV64HIG6AG4SY4","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05837","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-19T17:45:15Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"1cb5ce2b3739c3712855132ce7a8f86933ef49eea734ab7489c1be4dade78b22","abstract_canon_sha256":"32b6f930f6889f80e2dad0c2a840b0c7bd5c846a8e09fbca70d3f7e64c3358fc"},"schema_version":"1.0"},"canonical_sha256":"5f3083c4d46735b9d7dc3a0de01b92c73769a5feb9e91f73f0b9dbc7a5c0e694","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:53.755366Z","signature_b64":"D8TuNTsW42U9CKuixXH/j6f7UX2KqpGVDXI9XMq7RtZbtjVbtDFu3KC2v7z+IzSuZLoJSOywuzVTpIfM2PI6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f3083c4d46735b9d7dc3a0de01b92c73769a5feb9e91f73f0b9dbc7a5c0e694","last_reissued_at":"2026-05-18T00:45:53.754705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:53.754705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05837","source_version":2,"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:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2QgZrkfaOchAaiIUoW8TYnRNNu2/Ar8uJSSB2nAm7FFPf/2wpVRmPUScgmHpBsX/6lS5ANfpOk3KX87BzmA0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:59:57.546515Z"},"content_sha256":"e24d7c7b5f4a8c04de9864a2993415b01ffde0440fe79bc0f0d702bf77cdbe94","schema_version":"1.0","event_id":"sha256:e24d7c7b5f4a8c04de9864a2993415b01ffde0440fe79bc0f0d702bf77cdbe94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:L4YIHRGUM423TV64HIG6AG4SY4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable computation of Jordan chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.NA","authors_text":"Adi Pick, Felipe Hern\\'andez, Steven G. Johnson","submitted_at":"2017-04-19T17:45:15Z","abstract_excerpt":"We present an algorithm to compute the Jordan chain of a nearly defective matrix with a $2\\times2$ Jordan block. The algorithm is based on an inverse-iteration procedure and only needs information about the invariant subspace corresponding to the Jordan chain, making it suitable for use with large matrices arising in applications, in contrast with existing algorithms which rely on an SVD. The algorithm produces the eigenvector and Jordan vector with $O(\\varepsilon)$ error, with $\\varepsilon$ being the distance of the given matrix to an exactly defective matrix. As an example, we demonstrate th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05837","kind":"arxiv","version":2},"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:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EVVH16TuwM1uMZ/y0ROuTy1/9fsQNG9soSmCYkab71RPMRfe1CgwlnjLnJusc3F25cp0Mz393cZkc2wctT05Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:59:57.547204Z"},"content_sha256":"476bea2583f9528d615d662b9b61691e331913c319496c913ea9a8b118bd4c5d","schema_version":"1.0","event_id":"sha256:476bea2583f9528d615d662b9b61691e331913c319496c913ea9a8b118bd4c5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4YIHRGUM423TV64HIG6AG4SY4/bundle.json","state_url":"https://pith.science/pith/L4YIHRGUM423TV64HIG6AG4SY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4YIHRGUM423TV64HIG6AG4SY4/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-25T17:59:57Z","links":{"resolver":"https://pith.science/pith/L4YIHRGUM423TV64HIG6AG4SY4","bundle":"https://pith.science/pith/L4YIHRGUM423TV64HIG6AG4SY4/bundle.json","state":"https://pith.science/pith/L4YIHRGUM423TV64HIG6AG4SY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4YIHRGUM423TV64HIG6AG4SY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:L4YIHRGUM423TV64HIG6AG4SY4","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":"32b6f930f6889f80e2dad0c2a840b0c7bd5c846a8e09fbca70d3f7e64c3358fc","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-19T17:45:15Z","title_canon_sha256":"1cb5ce2b3739c3712855132ce7a8f86933ef49eea734ab7489c1be4dade78b22"},"schema_version":"1.0","source":{"id":"1704.05837","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05837","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05837v2","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05837","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"L4YIHRGUM423","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L4YIHRGUM423TV64","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L4YIHRGU","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:476bea2583f9528d615d662b9b61691e331913c319496c913ea9a8b118bd4c5d","target":"graph","created_at":"2026-05-18T00:45:53Z","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 present an algorithm to compute the Jordan chain of a nearly defective matrix with a $2\\times2$ Jordan block. The algorithm is based on an inverse-iteration procedure and only needs information about the invariant subspace corresponding to the Jordan chain, making it suitable for use with large matrices arising in applications, in contrast with existing algorithms which rely on an SVD. The algorithm produces the eigenvector and Jordan vector with $O(\\varepsilon)$ error, with $\\varepsilon$ being the distance of the given matrix to an exactly defective matrix. As an example, we demonstrate th","authors_text":"Adi Pick, Felipe Hern\\'andez, Steven G. Johnson","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-19T17:45:15Z","title":"Scalable computation of Jordan chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05837","kind":"arxiv","version":2},"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:e24d7c7b5f4a8c04de9864a2993415b01ffde0440fe79bc0f0d702bf77cdbe94","target":"record","created_at":"2026-05-18T00:45:53Z","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":"32b6f930f6889f80e2dad0c2a840b0c7bd5c846a8e09fbca70d3f7e64c3358fc","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-19T17:45:15Z","title_canon_sha256":"1cb5ce2b3739c3712855132ce7a8f86933ef49eea734ab7489c1be4dade78b22"},"schema_version":"1.0","source":{"id":"1704.05837","kind":"arxiv","version":2}},"canonical_sha256":"5f3083c4d46735b9d7dc3a0de01b92c73769a5feb9e91f73f0b9dbc7a5c0e694","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f3083c4d46735b9d7dc3a0de01b92c73769a5feb9e91f73f0b9dbc7a5c0e694","first_computed_at":"2026-05-18T00:45:53.754705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:53.754705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D8TuNTsW42U9CKuixXH/j6f7UX2KqpGVDXI9XMq7RtZbtjVbtDFu3KC2v7z+IzSuZLoJSOywuzVTpIfM2PI6Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:53.755366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05837","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e24d7c7b5f4a8c04de9864a2993415b01ffde0440fe79bc0f0d702bf77cdbe94","sha256:476bea2583f9528d615d662b9b61691e331913c319496c913ea9a8b118bd4c5d"],"state_sha256":"f4009c66e6d0c548a0f6d0e31db96a0a910282d72a9f94c01d8b74af33a2818f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+w77F20dTJ159KkqVjIZucH8J9eE+Qpv1yr8oed2C/z4Ikfka5nmLP6fl7bU8nLn84jcXy25+ZFHI0tWL2ARAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:59:57.550935Z","bundle_sha256":"71208a9f38cdda71a18b8b6a0e063174006595267fb0bb1a34c5b1839a385299"}}