{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:T67S34XY2GAW34REO5XPMEMWRQ","short_pith_number":"pith:T67S34XY","canonical_record":{"source":{"id":"1607.06303","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NA","submitted_at":"2016-07-21T12:58:36Z","cross_cats_sorted":["cs.DC","math.NA"],"title_canon_sha256":"8adfcb1c30628003724e9e54cfca97d2a30436da2bf40e7317743cd03c174380","abstract_canon_sha256":"e3e3a8de2462ba407de9afde4c69a1489392db094e8ee70845f90167654de886"},"schema_version":"1.0"},"canonical_sha256":"9fbf2df2f8d1816df224776ef611968c1de19a05e5ea69858e4b8340dc12a293","source":{"kind":"arxiv","id":"1607.06303","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06303","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06303v1","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06303","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"pith_short_12","alias_value":"T67S34XY2GAW","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T67S34XY2GAW34RE","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T67S34XY","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:T67S34XY2GAW34REO5XPMEMWRQ","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06303","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NA","submitted_at":"2016-07-21T12:58:36Z","cross_cats_sorted":["cs.DC","math.NA"],"title_canon_sha256":"8adfcb1c30628003724e9e54cfca97d2a30436da2bf40e7317743cd03c174380","abstract_canon_sha256":"e3e3a8de2462ba407de9afde4c69a1489392db094e8ee70845f90167654de886"},"schema_version":"1.0"},"canonical_sha256":"9fbf2df2f8d1816df224776ef611968c1de19a05e5ea69858e4b8340dc12a293","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:42.077197Z","signature_b64":"AfG9DxgJXySVHhYzK9J66/lZ78lK/9K+BGyP8sn5Rubs/CaPUIXBoTWv4CxIG8QbEv9W24guBN1snjRUSADoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fbf2df2f8d1816df224776ef611968c1de19a05e5ea69858e4b8340dc12a293","last_reissued_at":"2026-05-18T01:10:42.076824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:42.076824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06303","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-18T01:10:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/qSswR0K8gJiXP3yTx6skPKTAZZVyhQABCuWw+XG4gcm7jak7dNdfKpsL5gTEc0yFOUUhzeWVZaer8/M3C4hDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:40:06.064788Z"},"content_sha256":"da1dedd526d3d812887da650ae87c2371642ea6deeed076d9eba6b24e6c4c692","schema_version":"1.0","event_id":"sha256:da1dedd526d3d812887da650ae87c2371642ea6deeed076d9eba6b24e6c4c692"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:T67S34XY2GAW34REO5XPMEMWRQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Performance Algorithms for Computing the Sign Function of Triangular Matrices","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DC","math.NA"],"primary_cat":"cs.NA","authors_text":"Oded Schwartz, Sivan Toledo, Vadim Stotland","submitted_at":"2016-07-21T12:58:36Z","abstract_excerpt":"Algorithms and implementations for computing the sign function of a triangular matrix are fundamental building blocks in algorithms for computing the sign of arbitrary square real or complex matrices. We present novel recursive and cache efficient algorithms that are based on Higham's stabilized specialization of Parlett's substitution algorithm for computing the sign of a triangular matrix. We show that the new recursive algorithms are asymptotically optimal in terms of the number of cache misses that they generate. One of the novel algorithms that we present performs more arithmetic than the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06303","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-18T01:10:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vahyoPqKEQsXfhLXCSEkYIKF0PQYJ9l3EL5PpB27DbYJFr1Ww/4+Ml4a5y1Ut5a96bhC7xxTEmpI7yLoc2nqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:40:06.065143Z"},"content_sha256":"12de89421b3326d2b703f1231e21a2eded4e7d02175f323e784a0481613ae7a6","schema_version":"1.0","event_id":"sha256:12de89421b3326d2b703f1231e21a2eded4e7d02175f323e784a0481613ae7a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T67S34XY2GAW34REO5XPMEMWRQ/bundle.json","state_url":"https://pith.science/pith/T67S34XY2GAW34REO5XPMEMWRQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T67S34XY2GAW34REO5XPMEMWRQ/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-30T19:40:06Z","links":{"resolver":"https://pith.science/pith/T67S34XY2GAW34REO5XPMEMWRQ","bundle":"https://pith.science/pith/T67S34XY2GAW34REO5XPMEMWRQ/bundle.json","state":"https://pith.science/pith/T67S34XY2GAW34REO5XPMEMWRQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T67S34XY2GAW34REO5XPMEMWRQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:T67S34XY2GAW34REO5XPMEMWRQ","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":"e3e3a8de2462ba407de9afde4c69a1489392db094e8ee70845f90167654de886","cross_cats_sorted":["cs.DC","math.NA"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NA","submitted_at":"2016-07-21T12:58:36Z","title_canon_sha256":"8adfcb1c30628003724e9e54cfca97d2a30436da2bf40e7317743cd03c174380"},"schema_version":"1.0","source":{"id":"1607.06303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06303","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06303v1","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06303","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"pith_short_12","alias_value":"T67S34XY2GAW","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T67S34XY2GAW34RE","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T67S34XY","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:12de89421b3326d2b703f1231e21a2eded4e7d02175f323e784a0481613ae7a6","target":"graph","created_at":"2026-05-18T01:10:42Z","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":"Algorithms and implementations for computing the sign function of a triangular matrix are fundamental building blocks in algorithms for computing the sign of arbitrary square real or complex matrices. We present novel recursive and cache efficient algorithms that are based on Higham's stabilized specialization of Parlett's substitution algorithm for computing the sign of a triangular matrix. We show that the new recursive algorithms are asymptotically optimal in terms of the number of cache misses that they generate. One of the novel algorithms that we present performs more arithmetic than the","authors_text":"Oded Schwartz, Sivan Toledo, Vadim Stotland","cross_cats":["cs.DC","math.NA"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NA","submitted_at":"2016-07-21T12:58:36Z","title":"High-Performance Algorithms for Computing the Sign Function of Triangular Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06303","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:da1dedd526d3d812887da650ae87c2371642ea6deeed076d9eba6b24e6c4c692","target":"record","created_at":"2026-05-18T01:10:42Z","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":"e3e3a8de2462ba407de9afde4c69a1489392db094e8ee70845f90167654de886","cross_cats_sorted":["cs.DC","math.NA"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NA","submitted_at":"2016-07-21T12:58:36Z","title_canon_sha256":"8adfcb1c30628003724e9e54cfca97d2a30436da2bf40e7317743cd03c174380"},"schema_version":"1.0","source":{"id":"1607.06303","kind":"arxiv","version":1}},"canonical_sha256":"9fbf2df2f8d1816df224776ef611968c1de19a05e5ea69858e4b8340dc12a293","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fbf2df2f8d1816df224776ef611968c1de19a05e5ea69858e4b8340dc12a293","first_computed_at":"2026-05-18T01:10:42.076824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:42.076824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AfG9DxgJXySVHhYzK9J66/lZ78lK/9K+BGyP8sn5Rubs/CaPUIXBoTWv4CxIG8QbEv9W24guBN1snjRUSADoAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:42.077197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da1dedd526d3d812887da650ae87c2371642ea6deeed076d9eba6b24e6c4c692","sha256:12de89421b3326d2b703f1231e21a2eded4e7d02175f323e784a0481613ae7a6"],"state_sha256":"a7903ea023e666c1397f784d45e287657b553df6d23a838d7b655f5bbdae5f12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jFsg+jcIgDYGY4N9Naix5D286CAQ6wg8xw0QNQir0thTVqcD3l12dwPkIjRfJtcHpjudIUFCJx7XgOHx5WHTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:40:06.067666Z","bundle_sha256":"9eac3a783bfb5ea6cf0a5dcec99b6bddb96e3c6cddcafba65718e1bb4f59a720"}}