{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:E6X5BMQBAW7PNBZKCO63UGO5R5","short_pith_number":"pith:E6X5BMQB","canonical_record":{"source":{"id":"1505.07102","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2015-05-26T09:36:11Z","cross_cats_sorted":[],"title_canon_sha256":"5780d49205803234960c1b3633cda7a85f019f25b516734edc046589ec496ede","abstract_canon_sha256":"2cda9320bd1b47aa849b2d32c72f121cf6ad492f088bb2709d2e97c98244aad3"},"schema_version":"1.0"},"canonical_sha256":"27afd0b20105bef6872a13bdba19dd8f53691d4db5a4ee10e998c5e730d96cef","source":{"kind":"arxiv","id":"1505.07102","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07102","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07102v1","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07102","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"E6X5BMQBAW7P","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"E6X5BMQBAW7PNBZK","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"E6X5BMQB","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:E6X5BMQBAW7PNBZKCO63UGO5R5","target":"record","payload":{"canonical_record":{"source":{"id":"1505.07102","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2015-05-26T09:36:11Z","cross_cats_sorted":[],"title_canon_sha256":"5780d49205803234960c1b3633cda7a85f019f25b516734edc046589ec496ede","abstract_canon_sha256":"2cda9320bd1b47aa849b2d32c72f121cf6ad492f088bb2709d2e97c98244aad3"},"schema_version":"1.0"},"canonical_sha256":"27afd0b20105bef6872a13bdba19dd8f53691d4db5a4ee10e998c5e730d96cef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:07.462677Z","signature_b64":"mcaPUeZQXiOVeOAwWdIedeiyN1F77gBhmnxjuXM2Ig5I3hoRho3lS4iON6eshWRUvIZPJr/nexgH2VWsqOU9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27afd0b20105bef6872a13bdba19dd8f53691d4db5a4ee10e998c5e730d96cef","last_reissued_at":"2026-05-18T02:02:07.461903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:07.461903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.07102","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:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z54tSHqJJv6Fpr47G/u5JBrw/8xDqHKGa54P0IvpD7CTHdPaKtKztNKA25kraZ/gu03DWK7+J0zwosXFJzO0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:02:40.027966Z"},"content_sha256":"9c6e6d1d74040281e8eb3272cdd13785587fb4034cee496d754bef58ee9344f5","schema_version":"1.0","event_id":"sha256:9c6e6d1d74040281e8eb3272cdd13785587fb4034cee496d754bef58ee9344f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:E6X5BMQBAW7PNBZKCO63UGO5R5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new Lanczos type algorithm for system of linear equations","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Abdellah Salhi, Muhammad Farooq","submitted_at":"2015-05-26T09:36:11Z","abstract_excerpt":"Lanczos-type algorithms are efficient and easy to implement. Unfortunately they breakdown frequently and well before convergence has been achieved. These algorithms are typically based on recurrence relations which involve formal orthogonal polynomials of low degree. In this paper, we consider a recurrence relation that has not been studied before and which involves a relatively higher degree polynomial. Interestingly, it leads to an algorithm that shows superior stability when compared to existing Lanczos-type algorithms. This new algorithm is derived and described. It is then compared to the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07102","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:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yfW/lpVuWmLN9Qz4JlnSGDveUkuarWfZi0anR/rHkjJkg+Li+1xGdCYiZgPHm+fSjvmqrIpiOqrLByCGayHNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:02:40.028310Z"},"content_sha256":"09660f90b885fc9d43bfb273a1c7a214ed8013b173f22ef013b14ace0d33b48c","schema_version":"1.0","event_id":"sha256:09660f90b885fc9d43bfb273a1c7a214ed8013b173f22ef013b14ace0d33b48c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E6X5BMQBAW7PNBZKCO63UGO5R5/bundle.json","state_url":"https://pith.science/pith/E6X5BMQBAW7PNBZKCO63UGO5R5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E6X5BMQBAW7PNBZKCO63UGO5R5/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-06-01T04:02:40Z","links":{"resolver":"https://pith.science/pith/E6X5BMQBAW7PNBZKCO63UGO5R5","bundle":"https://pith.science/pith/E6X5BMQBAW7PNBZKCO63UGO5R5/bundle.json","state":"https://pith.science/pith/E6X5BMQBAW7PNBZKCO63UGO5R5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E6X5BMQBAW7PNBZKCO63UGO5R5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E6X5BMQBAW7PNBZKCO63UGO5R5","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":"2cda9320bd1b47aa849b2d32c72f121cf6ad492f088bb2709d2e97c98244aad3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2015-05-26T09:36:11Z","title_canon_sha256":"5780d49205803234960c1b3633cda7a85f019f25b516734edc046589ec496ede"},"schema_version":"1.0","source":{"id":"1505.07102","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07102","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07102v1","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07102","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"E6X5BMQBAW7P","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"E6X5BMQBAW7PNBZK","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"E6X5BMQB","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:09660f90b885fc9d43bfb273a1c7a214ed8013b173f22ef013b14ace0d33b48c","target":"graph","created_at":"2026-05-18T02:02:07Z","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 efficient and easy to implement. Unfortunately they breakdown frequently and well before convergence has been achieved. These algorithms are typically based on recurrence relations which involve formal orthogonal polynomials of low degree. In this paper, we consider a recurrence relation that has not been studied before and which involves a relatively higher degree polynomial. Interestingly, it leads to an algorithm that shows superior stability when compared to existing Lanczos-type algorithms. This new algorithm is derived and described. It is then compared to the","authors_text":"Abdellah Salhi, Muhammad Farooq","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2015-05-26T09:36:11Z","title":"A new Lanczos type algorithm for system of linear equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07102","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:9c6e6d1d74040281e8eb3272cdd13785587fb4034cee496d754bef58ee9344f5","target":"record","created_at":"2026-05-18T02:02:07Z","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":"2cda9320bd1b47aa849b2d32c72f121cf6ad492f088bb2709d2e97c98244aad3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2015-05-26T09:36:11Z","title_canon_sha256":"5780d49205803234960c1b3633cda7a85f019f25b516734edc046589ec496ede"},"schema_version":"1.0","source":{"id":"1505.07102","kind":"arxiv","version":1}},"canonical_sha256":"27afd0b20105bef6872a13bdba19dd8f53691d4db5a4ee10e998c5e730d96cef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27afd0b20105bef6872a13bdba19dd8f53691d4db5a4ee10e998c5e730d96cef","first_computed_at":"2026-05-18T02:02:07.461903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:02:07.461903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mcaPUeZQXiOVeOAwWdIedeiyN1F77gBhmnxjuXM2Ig5I3hoRho3lS4iON6eshWRUvIZPJr/nexgH2VWsqOU9Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:02:07.462677Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.07102","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c6e6d1d74040281e8eb3272cdd13785587fb4034cee496d754bef58ee9344f5","sha256:09660f90b885fc9d43bfb273a1c7a214ed8013b173f22ef013b14ace0d33b48c"],"state_sha256":"10598df7fecf96d3a9ab55a5c14d2847bee4c3ebe317a35815b3602ba9b3d7c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v7tlQ60a+L/jxtViqh4tsNH4rv8Iaz7Hc68BOGrZARZ5fTmP8cqqEi+VHi8X7cl9xRx9PXNRR2SoSw5iO81OAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:02:40.033450Z","bundle_sha256":"2aee3599407b3108f25c8c684f9c2bef414f3e76338ff0dab2ade5fd3f20a701"}}