{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CDGCDTPARJAZ34OWJH462WHBIA","short_pith_number":"pith:CDGCDTPA","canonical_record":{"source":{"id":"1405.2839","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.NA","submitted_at":"2014-05-09T02:07:38Z","cross_cats_sorted":[],"title_canon_sha256":"47af91f9324aa359b48494626c1a40177967ebf97c75559cf8d0f5212687f475","abstract_canon_sha256":"87e2231843c0704977a265268604e532bd2f2a3a539bc2ed799c2a0d803dc7a1"},"schema_version":"1.0"},"canonical_sha256":"10cc21cde08a419df1d649f9ed58e1403fd624d4346c16b42faf5647341e83cb","source":{"kind":"arxiv","id":"1405.2839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2839","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2839v1","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2839","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"CDGCDTPARJAZ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CDGCDTPARJAZ34OW","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CDGCDTPA","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CDGCDTPARJAZ34OWJH462WHBIA","target":"record","payload":{"canonical_record":{"source":{"id":"1405.2839","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.NA","submitted_at":"2014-05-09T02:07:38Z","cross_cats_sorted":[],"title_canon_sha256":"47af91f9324aa359b48494626c1a40177967ebf97c75559cf8d0f5212687f475","abstract_canon_sha256":"87e2231843c0704977a265268604e532bd2f2a3a539bc2ed799c2a0d803dc7a1"},"schema_version":"1.0"},"canonical_sha256":"10cc21cde08a419df1d649f9ed58e1403fd624d4346c16b42faf5647341e83cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:17.041045Z","signature_b64":"ix8DpyqhPR1CHSo6wHI5s3bgfaafiju/1I64UotFU9b2s/790JBCrePe4QzkatQ3d0CgqjnrK4bu6o3PTg3iBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10cc21cde08a419df1d649f9ed58e1403fd624d4346c16b42faf5647341e83cb","last_reissued_at":"2026-05-18T02:48:17.040674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:17.040674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.2839","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-18T02:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HixYai2MtABK/u4v1iQ7fvxzBBPkVO8uTWz6EdogbvCFj4kCdT59J0/yZniFdtRpklHl+TQlvmwM8b898QcQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:21:34.880913Z"},"content_sha256":"0dba9651b1cf5d22486fb1c00417c8dcd1ce7c56973ed4d75993b12e728d6b6c","schema_version":"1.0","event_id":"sha256:0dba9651b1cf5d22486fb1c00417c8dcd1ce7c56973ed4d75993b12e728d6b6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CDGCDTPARJAZ34OWJH462WHBIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Switching Approach to Avoid Breakdown in Lanczos-type Algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Abdellah Salhi, Muhammad Farooq","submitted_at":"2014-05-09T02:07:38Z","abstract_excerpt":"Lanczos-type algorithms are well known for their inherent instability. They typically breakdown when relevant orthogonal polynomials do not exist. Current approaches to avoiding breakdown rely on jumping over the non-existent polynomials to resume computation. This jumping strategy may have to be used many times during the solution process. We suggest an alternative to jumping which consists in switching between different algorithms that have been generated using different recurrence relations between orthogonal polynomials. This approach can be implemented as three different strategies: ST1, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2839","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-18T02:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AsNTk9fa7mmdvfmSwijUBNOU45Dc9YPLa/MnaWmZBi1+Tmo3HG+mTmXSpwhTa1M2Uxj6dSQBleNhYXv67eaYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:21:34.881560Z"},"content_sha256":"2d691bbc0e9114481ffe63bc24ec2e37833f7b58b4cc9fafce59195fd55d2845","schema_version":"1.0","event_id":"sha256:2d691bbc0e9114481ffe63bc24ec2e37833f7b58b4cc9fafce59195fd55d2845"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CDGCDTPARJAZ34OWJH462WHBIA/bundle.json","state_url":"https://pith.science/pith/CDGCDTPARJAZ34OWJH462WHBIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CDGCDTPARJAZ34OWJH462WHBIA/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-31T09:21:34Z","links":{"resolver":"https://pith.science/pith/CDGCDTPARJAZ34OWJH462WHBIA","bundle":"https://pith.science/pith/CDGCDTPARJAZ34OWJH462WHBIA/bundle.json","state":"https://pith.science/pith/CDGCDTPARJAZ34OWJH462WHBIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CDGCDTPARJAZ34OWJH462WHBIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CDGCDTPARJAZ34OWJH462WHBIA","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":"87e2231843c0704977a265268604e532bd2f2a3a539bc2ed799c2a0d803dc7a1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.NA","submitted_at":"2014-05-09T02:07:38Z","title_canon_sha256":"47af91f9324aa359b48494626c1a40177967ebf97c75559cf8d0f5212687f475"},"schema_version":"1.0","source":{"id":"1405.2839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2839","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2839v1","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2839","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"CDGCDTPARJAZ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CDGCDTPARJAZ34OW","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CDGCDTPA","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:2d691bbc0e9114481ffe63bc24ec2e37833f7b58b4cc9fafce59195fd55d2845","target":"graph","created_at":"2026-05-18T02:48:17Z","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":"Lanczos-type algorithms are well known for their inherent instability. They typically breakdown when relevant orthogonal polynomials do not exist. Current approaches to avoiding breakdown rely on jumping over the non-existent polynomials to resume computation. This jumping strategy may have to be used many times during the solution process. We suggest an alternative to jumping which consists in switching between different algorithms that have been generated using different recurrence relations between orthogonal polynomials. This approach can be implemented as three different strategies: ST1, ","authors_text":"Abdellah Salhi, Muhammad Farooq","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.NA","submitted_at":"2014-05-09T02:07:38Z","title":"A Switching Approach to Avoid Breakdown in Lanczos-type Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2839","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:0dba9651b1cf5d22486fb1c00417c8dcd1ce7c56973ed4d75993b12e728d6b6c","target":"record","created_at":"2026-05-18T02:48:17Z","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":"87e2231843c0704977a265268604e532bd2f2a3a539bc2ed799c2a0d803dc7a1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.NA","submitted_at":"2014-05-09T02:07:38Z","title_canon_sha256":"47af91f9324aa359b48494626c1a40177967ebf97c75559cf8d0f5212687f475"},"schema_version":"1.0","source":{"id":"1405.2839","kind":"arxiv","version":1}},"canonical_sha256":"10cc21cde08a419df1d649f9ed58e1403fd624d4346c16b42faf5647341e83cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10cc21cde08a419df1d649f9ed58e1403fd624d4346c16b42faf5647341e83cb","first_computed_at":"2026-05-18T02:48:17.040674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:17.040674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ix8DpyqhPR1CHSo6wHI5s3bgfaafiju/1I64UotFU9b2s/790JBCrePe4QzkatQ3d0CgqjnrK4bu6o3PTg3iBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:17.041045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.2839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0dba9651b1cf5d22486fb1c00417c8dcd1ce7c56973ed4d75993b12e728d6b6c","sha256:2d691bbc0e9114481ffe63bc24ec2e37833f7b58b4cc9fafce59195fd55d2845"],"state_sha256":"7383c34d82eedc3bd1e4af2fbef3599a7b93f2f6bcf0a345e518a05f59ef8341"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rXVG1oQnNVjzEDyybTk6935ImhTB2y25EnnQrm8mddEI9oEkwzjU55wG13t1VFOugCMn7MwM4mepqwyhCuaVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:21:34.884751Z","bundle_sha256":"f7db0a3aca7b2ac92862d5f688c220c604db5bee0b0c87d1a5fc089717bf5437"}}