{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7UIDIGV54BC37F27RQQBY7HSH2","short_pith_number":"pith:7UIDIGV5","schema_version":"1.0","canonical_sha256":"fd10341abde045bf975f8c201c7cf23ebec2086500235b558a1edf6c8eb7cf30","source":{"kind":"arxiv","id":"1807.04787","version":1},"attestation_state":"computed","paper":{"title":"Low-Rank Kernel Matrix Approximation Using Skeletonized Interpolation With Endo- or Exo-Vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Cleve Ashcraft, Eric Darve, Fran\\c{c}ois-Henry Rouet, L\\'eopold Cambier, Pierre L'Eplatennier, Yun Huang, Zixi Xu","submitted_at":"2018-07-12T18:54:08Z","abstract_excerpt":"The efficient compression of kernel matrices, for instance the off-diagonal blocks of discretized integral equations, is a crucial step in many algorithms. In this paper, we study the application of Skeletonized Interpolation to construct such factorizations. In particular, we study four different strategies for selecting the initial candidate pivots of the algorithm: Chebyshev grids, points on a sphere, maximally-dispersed and random vertices. Among them, the first two introduce new interpolation points (exo-vertices) while the last two are subsets of the given clusters (endo- vertices). We p"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1807.04787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-07-12T18:54:08Z","cross_cats_sorted":[],"title_canon_sha256":"ddfd82bd07480e971fea71717c24db843da0854f92518b6e1d77902e717c5733","abstract_canon_sha256":"0aa9428394f75974500d36269d7920411476de8f8da73ef96be7e0c4595deb07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:51.427798Z","signature_b64":"DaK7KgXxUNgD81PILmXiJ7QbQe5cxOlQgP/vxzRtd23F7o21unNPBBhyz0B03hJrfhZAse3lND2he6wEUCW1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd10341abde045bf975f8c201c7cf23ebec2086500235b558a1edf6c8eb7cf30","last_reissued_at":"2026-05-18T00:10:51.427353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:51.427353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Rank Kernel Matrix Approximation Using Skeletonized Interpolation With Endo- or Exo-Vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Cleve Ashcraft, Eric Darve, Fran\\c{c}ois-Henry Rouet, L\\'eopold Cambier, Pierre L'Eplatennier, Yun Huang, Zixi Xu","submitted_at":"2018-07-12T18:54:08Z","abstract_excerpt":"The efficient compression of kernel matrices, for instance the off-diagonal blocks of discretized integral equations, is a crucial step in many algorithms. In this paper, we study the application of Skeletonized Interpolation to construct such factorizations. In particular, we study four different strategies for selecting the initial candidate pivots of the algorithm: Chebyshev grids, points on a sphere, maximally-dispersed and random vertices. Among them, the first two introduce new interpolation points (exo-vertices) while the last two are subsets of the given clusters (endo- vertices). We p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04787","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.04787","created_at":"2026-05-18T00:10:51.427424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.04787v1","created_at":"2026-05-18T00:10:51.427424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04787","created_at":"2026-05-18T00:10:51.427424+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UIDIGV54BC3","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UIDIGV54BC37F27","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UIDIGV5","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7UIDIGV54BC37F27RQQBY7HSH2","json":"https://pith.science/pith/7UIDIGV54BC37F27RQQBY7HSH2.json","graph_json":"https://pith.science/api/pith-number/7UIDIGV54BC37F27RQQBY7HSH2/graph.json","events_json":"https://pith.science/api/pith-number/7UIDIGV54BC37F27RQQBY7HSH2/events.json","paper":"https://pith.science/paper/7UIDIGV5"},"agent_actions":{"view_html":"https://pith.science/pith/7UIDIGV54BC37F27RQQBY7HSH2","download_json":"https://pith.science/pith/7UIDIGV54BC37F27RQQBY7HSH2.json","view_paper":"https://pith.science/paper/7UIDIGV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.04787&json=true","fetch_graph":"https://pith.science/api/pith-number/7UIDIGV54BC37F27RQQBY7HSH2/graph.json","fetch_events":"https://pith.science/api/pith-number/7UIDIGV54BC37F27RQQBY7HSH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UIDIGV54BC37F27RQQBY7HSH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UIDIGV54BC37F27RQQBY7HSH2/action/storage_attestation","attest_author":"https://pith.science/pith/7UIDIGV54BC37F27RQQBY7HSH2/action/author_attestation","sign_citation":"https://pith.science/pith/7UIDIGV54BC37F27RQQBY7HSH2/action/citation_signature","submit_replication":"https://pith.science/pith/7UIDIGV54BC37F27RQQBY7HSH2/action/replication_record"}},"created_at":"2026-05-18T00:10:51.427424+00:00","updated_at":"2026-05-18T00:10:51.427424+00:00"}