{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:U3ZLR7KDJZRCDJNQWEWFL34LAG","short_pith_number":"pith:U3ZLR7KD","canonical_record":{"source":{"id":"1503.05464","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2015-03-18T16:01:25Z","cross_cats_sorted":[],"title_canon_sha256":"177b0779c4bbef48f2bfdbf8398dde032920d86e6f6ea94eddd261d71004b56e","abstract_canon_sha256":"b934fc2febe7895ee4f00352f8b8cec50b02d057af580cc5b8d5ec49db27f291"},"schema_version":"1.0"},"canonical_sha256":"a6f2b8fd434e6221a5b0b12c55ef8b01ac6a389d2b0157114883799f201b7fbb","source":{"kind":"arxiv","id":"1503.05464","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05464","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05464v2","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05464","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"pith_short_12","alias_value":"U3ZLR7KDJZRC","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U3ZLR7KDJZRCDJNQ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U3ZLR7KD","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:U3ZLR7KDJZRCDJNQWEWFL34LAG","target":"record","payload":{"canonical_record":{"source":{"id":"1503.05464","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2015-03-18T16:01:25Z","cross_cats_sorted":[],"title_canon_sha256":"177b0779c4bbef48f2bfdbf8398dde032920d86e6f6ea94eddd261d71004b56e","abstract_canon_sha256":"b934fc2febe7895ee4f00352f8b8cec50b02d057af580cc5b8d5ec49db27f291"},"schema_version":"1.0"},"canonical_sha256":"a6f2b8fd434e6221a5b0b12c55ef8b01ac6a389d2b0157114883799f201b7fbb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:48.967846Z","signature_b64":"Ad7j5Ix7NcAWfIHDQg+83FiUJ1IWgxJR2JUDUapCIscREOL6ZWefVqoWMb4RuXTOoceMKTCZB1z8NKrstnjUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6f2b8fd434e6221a5b0b12c55ef8b01ac6a389d2b0157114883799f201b7fbb","last_reissued_at":"2026-05-18T01:37:48.967177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:48.967177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.05464","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-05-18T01:37:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fCwack3PD3TkOKgPEOIG8EllECjdmm81HUZvHgQ+1uFDyiszQYE/4bfwLRyVTTa7khO0ZTPYJlbAmZHLyKWMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:07:06.653433Z"},"content_sha256":"ed6e7d42526e26c17148c9347160a2c9da2715facdfccbd72a7733f4e8edd94e","schema_version":"1.0","event_id":"sha256:ed6e7d42526e26c17148c9347160a2c9da2715facdfccbd72a7733f4e8edd94e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:U3ZLR7KDJZRCDJNQWEWFL34LAG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A distributed-memory package for dense Hierarchically Semi-Separable matrix computations using randomization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Artem Napov, Fran\\c{c}ois-Henry Rouet, Pieter Ghysels, Xiaoye S. Li","submitted_at":"2015-03-18T16:01:25Z","abstract_excerpt":"We present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable representations (HSS). Such matrices appear in many applications, e.g., finite element methods, boundary element methods, etc. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05464","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":""},"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:37:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zI+sVMkuJ0pLkVyG8gTnzGn/9oi9EKdWDuK5Gu1UjqH9DeFrjFFIEG3m7lH18ZsCb2kfsCvFuV59Dc+aoWsiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:07:06.654077Z"},"content_sha256":"9d3bd9c63f92c7ad82514bd19c1bda180ce72f2905e751524ae5fc0dec2e545e","schema_version":"1.0","event_id":"sha256:9d3bd9c63f92c7ad82514bd19c1bda180ce72f2905e751524ae5fc0dec2e545e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U3ZLR7KDJZRCDJNQWEWFL34LAG/bundle.json","state_url":"https://pith.science/pith/U3ZLR7KDJZRCDJNQWEWFL34LAG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U3ZLR7KDJZRCDJNQWEWFL34LAG/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-07T02:07:06Z","links":{"resolver":"https://pith.science/pith/U3ZLR7KDJZRCDJNQWEWFL34LAG","bundle":"https://pith.science/pith/U3ZLR7KDJZRCDJNQWEWFL34LAG/bundle.json","state":"https://pith.science/pith/U3ZLR7KDJZRCDJNQWEWFL34LAG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U3ZLR7KDJZRCDJNQWEWFL34LAG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:U3ZLR7KDJZRCDJNQWEWFL34LAG","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":"b934fc2febe7895ee4f00352f8b8cec50b02d057af580cc5b8d5ec49db27f291","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2015-03-18T16:01:25Z","title_canon_sha256":"177b0779c4bbef48f2bfdbf8398dde032920d86e6f6ea94eddd261d71004b56e"},"schema_version":"1.0","source":{"id":"1503.05464","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05464","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05464v2","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05464","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"pith_short_12","alias_value":"U3ZLR7KDJZRC","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U3ZLR7KDJZRCDJNQ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U3ZLR7KD","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:9d3bd9c63f92c7ad82514bd19c1bda180ce72f2905e751524ae5fc0dec2e545e","target":"graph","created_at":"2026-05-18T01:37:48Z","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":"We present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable representations (HSS). Such matrices appear in many applications, e.g., finite element methods, boundary element methods, etc. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm","authors_text":"Artem Napov, Fran\\c{c}ois-Henry Rouet, Pieter Ghysels, Xiaoye S. Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2015-03-18T16:01:25Z","title":"A distributed-memory package for dense Hierarchically Semi-Separable matrix computations using randomization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05464","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:ed6e7d42526e26c17148c9347160a2c9da2715facdfccbd72a7733f4e8edd94e","target":"record","created_at":"2026-05-18T01:37:48Z","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":"b934fc2febe7895ee4f00352f8b8cec50b02d057af580cc5b8d5ec49db27f291","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2015-03-18T16:01:25Z","title_canon_sha256":"177b0779c4bbef48f2bfdbf8398dde032920d86e6f6ea94eddd261d71004b56e"},"schema_version":"1.0","source":{"id":"1503.05464","kind":"arxiv","version":2}},"canonical_sha256":"a6f2b8fd434e6221a5b0b12c55ef8b01ac6a389d2b0157114883799f201b7fbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6f2b8fd434e6221a5b0b12c55ef8b01ac6a389d2b0157114883799f201b7fbb","first_computed_at":"2026-05-18T01:37:48.967177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:48.967177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ad7j5Ix7NcAWfIHDQg+83FiUJ1IWgxJR2JUDUapCIscREOL6ZWefVqoWMb4RuXTOoceMKTCZB1z8NKrstnjUCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:48.967846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.05464","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed6e7d42526e26c17148c9347160a2c9da2715facdfccbd72a7733f4e8edd94e","sha256:9d3bd9c63f92c7ad82514bd19c1bda180ce72f2905e751524ae5fc0dec2e545e"],"state_sha256":"c20372399b5724061384d98002036bf2a9bac0337888f45f5b1c4f8e0a35f8ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v9sZB5VPJe427XVFIfkbsrXIvOParoFD+xgp4zILWGuhxDGxYkorMy6F64KEGOD1lrS9Opd5Yemck2ECa5jlCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T02:07:06.657126Z","bundle_sha256":"75e2b2426811e98ce2188c4f16bc22454e94cf6a85ea4e2a569eed2b34732b25"}}