{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BIMWR2PXWSDIPKGNWQCJBKYZE4","short_pith_number":"pith:BIMWR2PX","schema_version":"1.0","canonical_sha256":"0a1968e9f7b48687a8cdb40490ab19271eb1273287d77a913c91cb743ed18b53","source":{"kind":"arxiv","id":"1701.00182","version":3},"attestation_state":"computed","paper":{"title":"Accelerated Cyclic Reduction: A Distributed-Memory Fast Solver for Structured Linear Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.AP","authors_text":"David Keyes, George Turkiyyah, Gustavo Ch\\'avez, Hatem Ltaief, Stefano Zampini","submitted_at":"2017-01-01T00:47:04Z","abstract_excerpt":"We present Accelerated Cyclic Reduction (ACR), a distributed-memory fast direct solver for rank-compressible block tridiagonal linear systems arising from the discretization of elliptic operators, developed here for three dimensions. Algorithmic synergies between Cyclic Reduction and hierarchical matrix arithmetic operations result in a solver that has $O(k~N \\log N~(\\log N + k^2))$ arithmetic complexity and $O(k~N \\log N)$ memory footprint, where $N$ is the number of degrees of freedom and $k$ is the rank of a typical off-diagonal block, and which exhibits substantial concurrency. We provide "},"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":"1701.00182","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2017-01-01T00:47:04Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"7ab0b013c38cfad2325b271248dc16d858f5b55ed532ce921c26a47edf1138e3","abstract_canon_sha256":"1cbe1d05a3ff973cf502e90e0f357f76577a516e2491e5e08a6a24e8757ae47f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:46.583068Z","signature_b64":"SasHt9z9ntTpGxQeKjBtuN8jHBPrq800rle14PF2AbxMe8ZXDz/pSK/MvPAgsMAesuK52E4tQSN0IsDQ0DxUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a1968e9f7b48687a8cdb40490ab19271eb1273287d77a913c91cb743ed18b53","last_reissued_at":"2026-05-18T00:26:46.582523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:46.582523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Cyclic Reduction: A Distributed-Memory Fast Solver for Structured Linear Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.AP","authors_text":"David Keyes, George Turkiyyah, Gustavo Ch\\'avez, Hatem Ltaief, Stefano Zampini","submitted_at":"2017-01-01T00:47:04Z","abstract_excerpt":"We present Accelerated Cyclic Reduction (ACR), a distributed-memory fast direct solver for rank-compressible block tridiagonal linear systems arising from the discretization of elliptic operators, developed here for three dimensions. Algorithmic synergies between Cyclic Reduction and hierarchical matrix arithmetic operations result in a solver that has $O(k~N \\log N~(\\log N + k^2))$ arithmetic complexity and $O(k~N \\log N)$ memory footprint, where $N$ is the number of degrees of freedom and $k$ is the rank of a typical off-diagonal block, and which exhibits substantial concurrency. We provide "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00182","kind":"arxiv","version":3},"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":"1701.00182","created_at":"2026-05-18T00:26:46.582616+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00182v3","created_at":"2026-05-18T00:26:46.582616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00182","created_at":"2026-05-18T00:26:46.582616+00:00"},{"alias_kind":"pith_short_12","alias_value":"BIMWR2PXWSDI","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BIMWR2PXWSDIPKGN","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BIMWR2PX","created_at":"2026-05-18T12:31:08.081275+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/BIMWR2PXWSDIPKGNWQCJBKYZE4","json":"https://pith.science/pith/BIMWR2PXWSDIPKGNWQCJBKYZE4.json","graph_json":"https://pith.science/api/pith-number/BIMWR2PXWSDIPKGNWQCJBKYZE4/graph.json","events_json":"https://pith.science/api/pith-number/BIMWR2PXWSDIPKGNWQCJBKYZE4/events.json","paper":"https://pith.science/paper/BIMWR2PX"},"agent_actions":{"view_html":"https://pith.science/pith/BIMWR2PXWSDIPKGNWQCJBKYZE4","download_json":"https://pith.science/pith/BIMWR2PXWSDIPKGNWQCJBKYZE4.json","view_paper":"https://pith.science/paper/BIMWR2PX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00182&json=true","fetch_graph":"https://pith.science/api/pith-number/BIMWR2PXWSDIPKGNWQCJBKYZE4/graph.json","fetch_events":"https://pith.science/api/pith-number/BIMWR2PXWSDIPKGNWQCJBKYZE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BIMWR2PXWSDIPKGNWQCJBKYZE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BIMWR2PXWSDIPKGNWQCJBKYZE4/action/storage_attestation","attest_author":"https://pith.science/pith/BIMWR2PXWSDIPKGNWQCJBKYZE4/action/author_attestation","sign_citation":"https://pith.science/pith/BIMWR2PXWSDIPKGNWQCJBKYZE4/action/citation_signature","submit_replication":"https://pith.science/pith/BIMWR2PXWSDIPKGNWQCJBKYZE4/action/replication_record"}},"created_at":"2026-05-18T00:26:46.582616+00:00","updated_at":"2026-05-18T00:26:46.582616+00:00"}