{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DJYWC2C44RZYGQ4RCJTWJ3AXWQ","short_pith_number":"pith:DJYWC2C4","canonical_record":{"source":{"id":"1403.0326","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.NA","submitted_at":"2014-03-03T06:34:11Z","cross_cats_sorted":[],"title_canon_sha256":"ca4d0c98187d3adda3b933b2ebfcc1f72c5cee512a9a7083c41ea45541e05110","abstract_canon_sha256":"6181234ef9bea56b871f253593d205068b0b9055da6895c6886c737ebd9b88a6"},"schema_version":"1.0"},"canonical_sha256":"1a7161685ce473834391126764ec17b4164b043857c7da958f4c12a62bea876a","source":{"kind":"arxiv","id":"1403.0326","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0326","created_at":"2026-05-18T02:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0326v1","created_at":"2026-05-18T02:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0326","created_at":"2026-05-18T02:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"DJYWC2C44RZY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DJYWC2C44RZYGQ4R","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DJYWC2C4","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DJYWC2C44RZYGQ4RCJTWJ3AXWQ","target":"record","payload":{"canonical_record":{"source":{"id":"1403.0326","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.NA","submitted_at":"2014-03-03T06:34:11Z","cross_cats_sorted":[],"title_canon_sha256":"ca4d0c98187d3adda3b933b2ebfcc1f72c5cee512a9a7083c41ea45541e05110","abstract_canon_sha256":"6181234ef9bea56b871f253593d205068b0b9055da6895c6886c737ebd9b88a6"},"schema_version":"1.0"},"canonical_sha256":"1a7161685ce473834391126764ec17b4164b043857c7da958f4c12a62bea876a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:25.603530Z","signature_b64":"ViFEA1JWODLHzb68OywPay9rKrFamcWcfhSXuIRKddDaoiiC9EMmGHdUK8s/rYv98w8c50zk24Jzz50iUSrGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a7161685ce473834391126764ec17b4164b043857c7da958f4c12a62bea876a","last_reissued_at":"2026-05-18T02:52:25.602977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:25.602977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.0326","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:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZEIGKDf4ntACeG+GY2VpxSQlAMPjhPtFdb7u3OpulNGZk413DTXQ1AVcoHEgHsAVW4HMcIOkYZTKxKDv0p2xAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:01:09.335130Z"},"content_sha256":"d1c95263f6c4196d6f1510405dfcce8f834ab3c89c060580a0b28be9d072cdf3","schema_version":"1.0","event_id":"sha256:d1c95263f6c4196d6f1510405dfcce8f834ab3c89c060580a0b28be9d072cdf3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DJYWC2C44RZYGQ4RCJTWJ3AXWQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An alternative derivation of a new Lanczos-type algorithm for systems of linear equations","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Abdellah Salhi, Muhammad Farooq, Saif Ullah","submitted_at":"2014-03-03T06:34:11Z","abstract_excerpt":"Various recurrence relations between formal orthogonal polynomials can be used to derive Lanczos-type algorithms. In this paper, we consider recurrence relation $A_{12}$ for the choice $U_i(x)=P_i(x)$, where $U_i$ is an auxiliary family of polynomials of exact degree $i$. It leads to a Lanczos-type algorithm that shows superior stability when compared to existing Lanczos-type algorithms. The new algorithm is derived and described. It is then computationally compared to the most robust algorithms of this type, namely $A_{12}$, $A_5/B_{10}$ and $A_8/B_{10}$, on the same test problems. Numerical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0326","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:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2RKcg9Tjl5b8Dyxg5Btgc5/Q3kIuHo04EQoGq9ZJc7zsjGIDc6bCNyO1PoALrP2RNOPi2elBF01B2y3lcgNPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:01:09.335981Z"},"content_sha256":"1021affb528520cc7b6237964ef5d90886df6084af130ca7eb6c960bd7e1f1a0","schema_version":"1.0","event_id":"sha256:1021affb528520cc7b6237964ef5d90886df6084af130ca7eb6c960bd7e1f1a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DJYWC2C44RZYGQ4RCJTWJ3AXWQ/bundle.json","state_url":"https://pith.science/pith/DJYWC2C44RZYGQ4RCJTWJ3AXWQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DJYWC2C44RZYGQ4RCJTWJ3AXWQ/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-31T04:01:09Z","links":{"resolver":"https://pith.science/pith/DJYWC2C44RZYGQ4RCJTWJ3AXWQ","bundle":"https://pith.science/pith/DJYWC2C44RZYGQ4RCJTWJ3AXWQ/bundle.json","state":"https://pith.science/pith/DJYWC2C44RZYGQ4RCJTWJ3AXWQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DJYWC2C44RZYGQ4RCJTWJ3AXWQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DJYWC2C44RZYGQ4RCJTWJ3AXWQ","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":"6181234ef9bea56b871f253593d205068b0b9055da6895c6886c737ebd9b88a6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.NA","submitted_at":"2014-03-03T06:34:11Z","title_canon_sha256":"ca4d0c98187d3adda3b933b2ebfcc1f72c5cee512a9a7083c41ea45541e05110"},"schema_version":"1.0","source":{"id":"1403.0326","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0326","created_at":"2026-05-18T02:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0326v1","created_at":"2026-05-18T02:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0326","created_at":"2026-05-18T02:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"DJYWC2C44RZY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DJYWC2C44RZYGQ4R","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DJYWC2C4","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:1021affb528520cc7b6237964ef5d90886df6084af130ca7eb6c960bd7e1f1a0","target":"graph","created_at":"2026-05-18T02:52:25Z","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":"Various recurrence relations between formal orthogonal polynomials can be used to derive Lanczos-type algorithms. In this paper, we consider recurrence relation $A_{12}$ for the choice $U_i(x)=P_i(x)$, where $U_i$ is an auxiliary family of polynomials of exact degree $i$. It leads to a Lanczos-type algorithm that shows superior stability when compared to existing Lanczos-type algorithms. The new algorithm is derived and described. It is then computationally compared to the most robust algorithms of this type, namely $A_{12}$, $A_5/B_{10}$ and $A_8/B_{10}$, on the same test problems. Numerical ","authors_text":"Abdellah Salhi, Muhammad Farooq, Saif Ullah","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.NA","submitted_at":"2014-03-03T06:34:11Z","title":"An alternative derivation of a new Lanczos-type algorithm for systems of linear equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0326","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:d1c95263f6c4196d6f1510405dfcce8f834ab3c89c060580a0b28be9d072cdf3","target":"record","created_at":"2026-05-18T02:52:25Z","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":"6181234ef9bea56b871f253593d205068b0b9055da6895c6886c737ebd9b88a6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.NA","submitted_at":"2014-03-03T06:34:11Z","title_canon_sha256":"ca4d0c98187d3adda3b933b2ebfcc1f72c5cee512a9a7083c41ea45541e05110"},"schema_version":"1.0","source":{"id":"1403.0326","kind":"arxiv","version":1}},"canonical_sha256":"1a7161685ce473834391126764ec17b4164b043857c7da958f4c12a62bea876a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a7161685ce473834391126764ec17b4164b043857c7da958f4c12a62bea876a","first_computed_at":"2026-05-18T02:52:25.602977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:25.602977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ViFEA1JWODLHzb68OywPay9rKrFamcWcfhSXuIRKddDaoiiC9EMmGHdUK8s/rYv98w8c50zk24Jzz50iUSrGDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:25.603530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.0326","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1c95263f6c4196d6f1510405dfcce8f834ab3c89c060580a0b28be9d072cdf3","sha256:1021affb528520cc7b6237964ef5d90886df6084af130ca7eb6c960bd7e1f1a0"],"state_sha256":"500d1de89eb381f59598060a4582c71b646d78b0805e3d6f9a252b95a5dd69aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PLuC1a8hXMp5z0FBfbbYqneHJQblTUqyjBq2Kbx3mBHIwROtkYr4PM4Je6PHe4I10OGDDSMEWOczecwfRUwuDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:01:09.340031Z","bundle_sha256":"5fdde17dd06f2591bde42ccc7457dc50f72956abacfc10d7e3a89f5b66bef1bf"}}