{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RUY43ZPLU646ABYUI6V6NT2UHK","short_pith_number":"pith:RUY43ZPL","schema_version":"1.0","canonical_sha256":"8d31cde5eba7b9e0071447abe6cf543aa2749bbda5ffd3d4a948be97fe1c56b2","source":{"kind":"arxiv","id":"1604.00617","version":1},"attestation_state":"computed","paper":{"title":"A Direct Elliptic Solver Based on Hierarchically Low-rank Schur Complements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"David Keyes, George Turkiyyah, Gustavo Ch\\'avez","submitted_at":"2016-04-03T09:52:40Z","abstract_excerpt":"A parallel fast direct solver for rank-compressible block tridiagonal linear systems is presented. Algorithmic synergies between Cyclic Reduction and Hierarchical matrix arithmetic operations result in a solver with $O(N \\log^2 N)$ arithmetic complexity and $O(N \\log N)$ memory footprint. We provide a baseline for performance and applicability by comparing with well known implementations of the $\\mathcal{H}$-LU factorization and algebraic multigrid with a parallel implementation that leverages the concurrency features of the method. Numerical experiments reveal that this method is comparable w"},"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":"1604.00617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-04-03T09:52:40Z","cross_cats_sorted":[],"title_canon_sha256":"e0c7f71662fe5ef39c89850c0e480080ae0f0f6299f9e8306469ec6a73c1c4f1","abstract_canon_sha256":"0a7ffd6e200fd8a8b4b0e292a1cdd62ca4c77f1a5faacf2c60d8e3bc611d256c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:22.330050Z","signature_b64":"6HmMHmYuyIROQo4lYdq0n46CXhJTBy0Zy1jI7g5H8y523kZGgQg/weGOPnbHk8EP5/3JYZFF+onLyWgOF6z2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d31cde5eba7b9e0071447abe6cf543aa2749bbda5ffd3d4a948be97fe1c56b2","last_reissued_at":"2026-05-18T00:27:22.329586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:22.329586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Direct Elliptic Solver Based on Hierarchically Low-rank Schur Complements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"David Keyes, George Turkiyyah, Gustavo Ch\\'avez","submitted_at":"2016-04-03T09:52:40Z","abstract_excerpt":"A parallel fast direct solver for rank-compressible block tridiagonal linear systems is presented. Algorithmic synergies between Cyclic Reduction and Hierarchical matrix arithmetic operations result in a solver with $O(N \\log^2 N)$ arithmetic complexity and $O(N \\log N)$ memory footprint. We provide a baseline for performance and applicability by comparing with well known implementations of the $\\mathcal{H}$-LU factorization and algebraic multigrid with a parallel implementation that leverages the concurrency features of the method. Numerical experiments reveal that this method is comparable w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00617","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":"1604.00617","created_at":"2026-05-18T00:27:22.329654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00617v1","created_at":"2026-05-18T00:27:22.329654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00617","created_at":"2026-05-18T00:27:22.329654+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUY43ZPLU646","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUY43ZPLU646ABYU","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUY43ZPL","created_at":"2026-05-18T12:30:41.710351+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/RUY43ZPLU646ABYUI6V6NT2UHK","json":"https://pith.science/pith/RUY43ZPLU646ABYUI6V6NT2UHK.json","graph_json":"https://pith.science/api/pith-number/RUY43ZPLU646ABYUI6V6NT2UHK/graph.json","events_json":"https://pith.science/api/pith-number/RUY43ZPLU646ABYUI6V6NT2UHK/events.json","paper":"https://pith.science/paper/RUY43ZPL"},"agent_actions":{"view_html":"https://pith.science/pith/RUY43ZPLU646ABYUI6V6NT2UHK","download_json":"https://pith.science/pith/RUY43ZPLU646ABYUI6V6NT2UHK.json","view_paper":"https://pith.science/paper/RUY43ZPL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00617&json=true","fetch_graph":"https://pith.science/api/pith-number/RUY43ZPLU646ABYUI6V6NT2UHK/graph.json","fetch_events":"https://pith.science/api/pith-number/RUY43ZPLU646ABYUI6V6NT2UHK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUY43ZPLU646ABYUI6V6NT2UHK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUY43ZPLU646ABYUI6V6NT2UHK/action/storage_attestation","attest_author":"https://pith.science/pith/RUY43ZPLU646ABYUI6V6NT2UHK/action/author_attestation","sign_citation":"https://pith.science/pith/RUY43ZPLU646ABYUI6V6NT2UHK/action/citation_signature","submit_replication":"https://pith.science/pith/RUY43ZPLU646ABYUI6V6NT2UHK/action/replication_record"}},"created_at":"2026-05-18T00:27:22.329654+00:00","updated_at":"2026-05-18T00:27:22.329654+00:00"}