{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4SLFE572LFQ3WEVETLP66CI56S","short_pith_number":"pith:4SLFE572","canonical_record":{"source":{"id":"1805.08994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-23T07:55:13Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"ec8e72fc29bd70a6a5a6ff52a238b94ceb3ca7fc0626a0178613da3d0e8a0697","abstract_canon_sha256":"6f1de1b73e98689673292eb5bda53bef8b08d48e9b415c8c7f95d2c681829028"},"schema_version":"1.0"},"canonical_sha256":"e4965277fa5961bb12a49adfef091df489e6ea54117db617fb5ab9a42778340a","source":{"kind":"arxiv","id":"1805.08994","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08994","created_at":"2026-06-04T19:11:55Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08994v2","created_at":"2026-06-04T19:11:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08994","created_at":"2026-06-04T19:11:55Z"},{"alias_kind":"pith_short_12","alias_value":"4SLFE572LFQ3","created_at":"2026-06-04T19:11:55Z"},{"alias_kind":"pith_short_16","alias_value":"4SLFE572LFQ3WEVE","created_at":"2026-06-04T19:11:55Z"},{"alias_kind":"pith_short_8","alias_value":"4SLFE572","created_at":"2026-06-04T19:11:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4SLFE572LFQ3WEVETLP66CI56S","target":"record","payload":{"canonical_record":{"source":{"id":"1805.08994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-23T07:55:13Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"ec8e72fc29bd70a6a5a6ff52a238b94ceb3ca7fc0626a0178613da3d0e8a0697","abstract_canon_sha256":"6f1de1b73e98689673292eb5bda53bef8b08d48e9b415c8c7f95d2c681829028"},"schema_version":"1.0"},"canonical_sha256":"e4965277fa5961bb12a49adfef091df489e6ea54117db617fb5ab9a42778340a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T19:11:55.036581Z","signature_b64":"nTfHv0GNVbatIKCdZurnEkhPpLrsuOQdnYkIOZaHMabVtuPdC+mYkIZxObmojb3mzV/u75tJcyR7PSkffoxQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4965277fa5961bb12a49adfef091df489e6ea54117db617fb5ab9a42778340a","last_reissued_at":"2026-06-04T19:11:55.036161Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T19:11:55.036161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.08994","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-06-04T19:11:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBTZ1xSfWi1Lwn4njoQXew7Hmbxt4Zy8q9hYUGX5mxkgWH/LcbVBnbzd511VRLh5XJmCCZOyptJ+94mX3S27BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:58:38.472719Z"},"content_sha256":"61d51471dade0f7144a8840b0a7958ed2442ad37d151a912af0a7a034ccb94d1","schema_version":"1.0","event_id":"sha256:61d51471dade0f7144a8840b0a7958ed2442ad37d151a912af0a7a034ccb94d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4SLFE572LFQ3WEVETLP66CI56S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the growth factor upper bound for Aasen's algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Linzhang Lu, Yuehua Feng","submitted_at":"2018-05-23T07:55:13Z","abstract_excerpt":"Aasen's algorithm factorizes a symmetric indefinite matrix $A$ as $A = P^TLTL^TP$, where $P$ is a permutation matrix, $L$ is unit lower triangular with its first column being the first column of the identity matrix, and $T$ is tridiagonal. In this note, we provide a growth factor upper bound for Aasen's algorithm which is much smaller than that given by Higham. We also show that the upper bound we have given is not tight when the matrix dimension is greater than or equal to $6$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08994","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1805.08994/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-06-04T19:11:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j7tOFwQ/MaheDXdaHyU+L9mv8YuU4ztAT9/w2haglufFbeP7q5x5QBxy/aT1sFwboeEeO4ILOEq84/a2pfEXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:58:38.473092Z"},"content_sha256":"476141c04830e9675f6ffa72eb5606072f20ae53a6591d91ad759b5c59f9c7aa","schema_version":"1.0","event_id":"sha256:476141c04830e9675f6ffa72eb5606072f20ae53a6591d91ad759b5c59f9c7aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SLFE572LFQ3WEVETLP66CI56S/bundle.json","state_url":"https://pith.science/pith/4SLFE572LFQ3WEVETLP66CI56S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SLFE572LFQ3WEVETLP66CI56S/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-27T16:58:38Z","links":{"resolver":"https://pith.science/pith/4SLFE572LFQ3WEVETLP66CI56S","bundle":"https://pith.science/pith/4SLFE572LFQ3WEVETLP66CI56S/bundle.json","state":"https://pith.science/pith/4SLFE572LFQ3WEVETLP66CI56S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SLFE572LFQ3WEVETLP66CI56S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4SLFE572LFQ3WEVETLP66CI56S","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":"6f1de1b73e98689673292eb5bda53bef8b08d48e9b415c8c7f95d2c681829028","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-23T07:55:13Z","title_canon_sha256":"ec8e72fc29bd70a6a5a6ff52a238b94ceb3ca7fc0626a0178613da3d0e8a0697"},"schema_version":"1.0","source":{"id":"1805.08994","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08994","created_at":"2026-06-04T19:11:55Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08994v2","created_at":"2026-06-04T19:11:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08994","created_at":"2026-06-04T19:11:55Z"},{"alias_kind":"pith_short_12","alias_value":"4SLFE572LFQ3","created_at":"2026-06-04T19:11:55Z"},{"alias_kind":"pith_short_16","alias_value":"4SLFE572LFQ3WEVE","created_at":"2026-06-04T19:11:55Z"},{"alias_kind":"pith_short_8","alias_value":"4SLFE572","created_at":"2026-06-04T19:11:55Z"}],"graph_snapshots":[{"event_id":"sha256:476141c04830e9675f6ffa72eb5606072f20ae53a6591d91ad759b5c59f9c7aa","target":"graph","created_at":"2026-06-04T19:11:55Z","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/1805.08994/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Aasen's algorithm factorizes a symmetric indefinite matrix $A$ as $A = P^TLTL^TP$, where $P$ is a permutation matrix, $L$ is unit lower triangular with its first column being the first column of the identity matrix, and $T$ is tridiagonal. In this note, we provide a growth factor upper bound for Aasen's algorithm which is much smaller than that given by Higham. We also show that the upper bound we have given is not tight when the matrix dimension is greater than or equal to $6$.","authors_text":"Linzhang Lu, Yuehua Feng","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-23T07:55:13Z","title":"On the growth factor upper bound for Aasen's algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08994","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:61d51471dade0f7144a8840b0a7958ed2442ad37d151a912af0a7a034ccb94d1","target":"record","created_at":"2026-06-04T19:11:55Z","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":"6f1de1b73e98689673292eb5bda53bef8b08d48e9b415c8c7f95d2c681829028","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-23T07:55:13Z","title_canon_sha256":"ec8e72fc29bd70a6a5a6ff52a238b94ceb3ca7fc0626a0178613da3d0e8a0697"},"schema_version":"1.0","source":{"id":"1805.08994","kind":"arxiv","version":2}},"canonical_sha256":"e4965277fa5961bb12a49adfef091df489e6ea54117db617fb5ab9a42778340a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4965277fa5961bb12a49adfef091df489e6ea54117db617fb5ab9a42778340a","first_computed_at":"2026-06-04T19:11:55.036161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T19:11:55.036161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nTfHv0GNVbatIKCdZurnEkhPpLrsuOQdnYkIOZaHMabVtuPdC+mYkIZxObmojb3mzV/u75tJcyR7PSkffoxQAA==","signature_status":"signed_v1","signed_at":"2026-06-04T19:11:55.036581Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08994","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61d51471dade0f7144a8840b0a7958ed2442ad37d151a912af0a7a034ccb94d1","sha256:476141c04830e9675f6ffa72eb5606072f20ae53a6591d91ad759b5c59f9c7aa"],"state_sha256":"f6e82b126e59bd14ca70e3ad94157c675ef347940c3c768fdc76a686e0010f82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kxsD484Vgg5cT1wIDuv3aaNPGnXKeu0SMii1i9oZksCa2SilBlqHtyfWI4YQCfkaD45m3YeqBg8BgA5anmMDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:58:38.475072Z","bundle_sha256":"e891606ec50728aa61c5fe956a1bbe5cad80a3ced1ee3f0d5470d00cc913d0b4"}}