{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VQAL6VRVE7HJF54GL6HT6SWSQD","short_pith_number":"pith:VQAL6VRV","canonical_record":{"source":{"id":"1705.05443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-15T20:42:17Z","cross_cats_sorted":[],"title_canon_sha256":"8b0c77f9881bb0ed9669ac29333ce504cf13af425b46f9b09398fb33aee6763a","abstract_canon_sha256":"9cec89eb7e22487f7e40a01f9f7db5bf44ebfc3c98d6f6d606867fdfe1ac5641"},"schema_version":"1.0"},"canonical_sha256":"ac00bf563527ce92f7865f8f3f4ad280db8631e2368368a6a46c7d3b784a64fb","source":{"kind":"arxiv","id":"1705.05443","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05443","created_at":"2026-05-18T00:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05443v1","created_at":"2026-05-18T00:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05443","created_at":"2026-05-18T00:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"VQAL6VRVE7HJ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VQAL6VRVE7HJF54G","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VQAL6VRV","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VQAL6VRVE7HJF54GL6HT6SWSQD","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-15T20:42:17Z","cross_cats_sorted":[],"title_canon_sha256":"8b0c77f9881bb0ed9669ac29333ce504cf13af425b46f9b09398fb33aee6763a","abstract_canon_sha256":"9cec89eb7e22487f7e40a01f9f7db5bf44ebfc3c98d6f6d606867fdfe1ac5641"},"schema_version":"1.0"},"canonical_sha256":"ac00bf563527ce92f7865f8f3f4ad280db8631e2368368a6a46c7d3b784a64fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:22.722616Z","signature_b64":"iVXVAjqL4cgKNKJI839Aaq89YTp/SIF1swUlMY3EYjjmIVoib27To9fGZLI/XfHh9rbgdDNjXCbXiyRJMgOQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac00bf563527ce92f7865f8f3f4ad280db8631e2368368a6a46c7d3b784a64fb","last_reissued_at":"2026-05-18T00:44:22.722032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:22.722032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05443","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-18T00:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RTw5vo6sDZejG4JzKlyMFrehdpnWf+EIx0fUEJde78ctkISngebrBia7LSLva32+WQPpLN/4ClHJbBSs2sCyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:15:58.901158Z"},"content_sha256":"4df7f356c81296e6a9bc56436cada8a2014624fa9a0218bde700d0747fe01feb","schema_version":"1.0","event_id":"sha256:4df7f356c81296e6a9bc56436cada8a2014624fa9a0218bde700d0747fe01feb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VQAL6VRVE7HJF54GL6HT6SWSQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SMASH: Structured matrix approximation by separation and hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Difeng Cai, Edmond Chow, Yousef Saad, Yuanzhe Xi","submitted_at":"2017-05-15T20:42:17Z","abstract_excerpt":"This paper presents an efficient method to perform Structured Matrix Approximation by Separation and Hierarchy (SMASH), when the original dense matrix is associated with a kernel function. Given points in a domain, a tree structure is first constructed based on an adaptive partitioning of the computational domain to facilitate subsequent approximation procedures. In contrast to existing schemes based on either analytic or purely algebraic approximations, SMASH takes advantage of both approaches and greatly improves the efficiency. The algorithm follows a bottom-up traversal of the tree and is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05443","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-18T00:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t6ZoXa6QdmxoNO896J1fADrnmZJr0GIrR4rkX2yL0cd9OwDkwQUpnHYZz6R68y2O+Y69ltWrJHY+F68vEgZQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:15:58.901627Z"},"content_sha256":"68f3c850902582f7bed72345d92f5a3a0639a40b0dee6cfb857cea39a07df05a","schema_version":"1.0","event_id":"sha256:68f3c850902582f7bed72345d92f5a3a0639a40b0dee6cfb857cea39a07df05a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQAL6VRVE7HJF54GL6HT6SWSQD/bundle.json","state_url":"https://pith.science/pith/VQAL6VRVE7HJF54GL6HT6SWSQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQAL6VRVE7HJF54GL6HT6SWSQD/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-02T12:15:58Z","links":{"resolver":"https://pith.science/pith/VQAL6VRVE7HJF54GL6HT6SWSQD","bundle":"https://pith.science/pith/VQAL6VRVE7HJF54GL6HT6SWSQD/bundle.json","state":"https://pith.science/pith/VQAL6VRVE7HJF54GL6HT6SWSQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQAL6VRVE7HJF54GL6HT6SWSQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VQAL6VRVE7HJF54GL6HT6SWSQD","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":"9cec89eb7e22487f7e40a01f9f7db5bf44ebfc3c98d6f6d606867fdfe1ac5641","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-15T20:42:17Z","title_canon_sha256":"8b0c77f9881bb0ed9669ac29333ce504cf13af425b46f9b09398fb33aee6763a"},"schema_version":"1.0","source":{"id":"1705.05443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05443","created_at":"2026-05-18T00:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05443v1","created_at":"2026-05-18T00:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05443","created_at":"2026-05-18T00:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"VQAL6VRVE7HJ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VQAL6VRVE7HJF54G","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VQAL6VRV","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:68f3c850902582f7bed72345d92f5a3a0639a40b0dee6cfb857cea39a07df05a","target":"graph","created_at":"2026-05-18T00:44:22Z","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":"This paper presents an efficient method to perform Structured Matrix Approximation by Separation and Hierarchy (SMASH), when the original dense matrix is associated with a kernel function. Given points in a domain, a tree structure is first constructed based on an adaptive partitioning of the computational domain to facilitate subsequent approximation procedures. In contrast to existing schemes based on either analytic or purely algebraic approximations, SMASH takes advantage of both approaches and greatly improves the efficiency. The algorithm follows a bottom-up traversal of the tree and is ","authors_text":"Difeng Cai, Edmond Chow, Yousef Saad, Yuanzhe Xi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-15T20:42:17Z","title":"SMASH: Structured matrix approximation by separation and hierarchy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05443","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:4df7f356c81296e6a9bc56436cada8a2014624fa9a0218bde700d0747fe01feb","target":"record","created_at":"2026-05-18T00:44:22Z","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":"9cec89eb7e22487f7e40a01f9f7db5bf44ebfc3c98d6f6d606867fdfe1ac5641","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-15T20:42:17Z","title_canon_sha256":"8b0c77f9881bb0ed9669ac29333ce504cf13af425b46f9b09398fb33aee6763a"},"schema_version":"1.0","source":{"id":"1705.05443","kind":"arxiv","version":1}},"canonical_sha256":"ac00bf563527ce92f7865f8f3f4ad280db8631e2368368a6a46c7d3b784a64fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac00bf563527ce92f7865f8f3f4ad280db8631e2368368a6a46c7d3b784a64fb","first_computed_at":"2026-05-18T00:44:22.722032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:22.722032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iVXVAjqL4cgKNKJI839Aaq89YTp/SIF1swUlMY3EYjjmIVoib27To9fGZLI/XfHh9rbgdDNjXCbXiyRJMgOQCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:22.722616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4df7f356c81296e6a9bc56436cada8a2014624fa9a0218bde700d0747fe01feb","sha256:68f3c850902582f7bed72345d92f5a3a0639a40b0dee6cfb857cea39a07df05a"],"state_sha256":"5be0cb3e14cf7e79e10c1a2bc0071108a2230ab9ce18728d1d80594dd25782c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jb4W0GYZz6emC7OKhrKWuBQFNeM0kw161eCRJrYfDvWQdytejlu/dZlxE/4WRP1XpsLiXuN5h8pUK88PtyHzBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:15:58.903905Z","bundle_sha256":"407ed03017347680ff404dd69274635edcc6389999688c1b8b78d5e4ff6a96a7"}}