{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:B3S2JLWR7XNC7BZYUXZHVAGYCU","short_pith_number":"pith:B3S2JLWR","schema_version":"1.0","canonical_sha256":"0ee5a4aed1fdda2f8738a5f27a80d8153e737c6533f4590e74f973c8ab8e993d","source":{"kind":"arxiv","id":"1712.08872","version":1},"attestation_state":"computed","paper":{"title":"Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"David Keyes, George Turkiyyah, Gustavo Ch\\'avez, Stefano Zampini","submitted_at":"2017-12-24T03:23:12Z","abstract_excerpt":"We present a robust and scalable preconditioner for the solution of large-scale linear systems that arise from the discretization of elliptic PDEs amenable to rank compression. The preconditioner is based on hierarchical low-rank approximations and the cyclic reduction method. The setup and application phases of the preconditioner achieve log-linear complexity in memory footprint and number of operations, and numerical experiments exhibit good weak and strong scalability at large processor counts in a distributed memory environment. Numerical experiments with linear systems that feature symmet"},"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":"1712.08872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-24T03:23:12Z","cross_cats_sorted":[],"title_canon_sha256":"f6af2d8b8f653f201bce4d06e17d9ff30d0f57054ec52541f0c171729d9fc4c6","abstract_canon_sha256":"dc9e7b49a65559b1ca4e1f1d8d612281d70194e73aad4d7d62dac4663650d307"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:14.952058Z","signature_b64":"ILvGXiCKJMV3+/qpLyeRIXk7DmIY+Cji6RefDJ0zJ5RU6Z0pASKNh7KjxMZWb/h/7Hhr4c36KugxfvMOL8qBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ee5a4aed1fdda2f8738a5f27a80d8153e737c6533f4590e74f973c8ab8e993d","last_reissued_at":"2026-05-18T00:27:14.951662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:14.951662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"David Keyes, George Turkiyyah, Gustavo Ch\\'avez, Stefano Zampini","submitted_at":"2017-12-24T03:23:12Z","abstract_excerpt":"We present a robust and scalable preconditioner for the solution of large-scale linear systems that arise from the discretization of elliptic PDEs amenable to rank compression. The preconditioner is based on hierarchical low-rank approximations and the cyclic reduction method. The setup and application phases of the preconditioner achieve log-linear complexity in memory footprint and number of operations, and numerical experiments exhibit good weak and strong scalability at large processor counts in a distributed memory environment. Numerical experiments with linear systems that feature symmet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08872","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":"1712.08872","created_at":"2026-05-18T00:27:14.951729+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.08872v1","created_at":"2026-05-18T00:27:14.951729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08872","created_at":"2026-05-18T00:27:14.951729+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3S2JLWR7XNC","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3S2JLWR7XNC7BZY","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3S2JLWR","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/B3S2JLWR7XNC7BZYUXZHVAGYCU","json":"https://pith.science/pith/B3S2JLWR7XNC7BZYUXZHVAGYCU.json","graph_json":"https://pith.science/api/pith-number/B3S2JLWR7XNC7BZYUXZHVAGYCU/graph.json","events_json":"https://pith.science/api/pith-number/B3S2JLWR7XNC7BZYUXZHVAGYCU/events.json","paper":"https://pith.science/paper/B3S2JLWR"},"agent_actions":{"view_html":"https://pith.science/pith/B3S2JLWR7XNC7BZYUXZHVAGYCU","download_json":"https://pith.science/pith/B3S2JLWR7XNC7BZYUXZHVAGYCU.json","view_paper":"https://pith.science/paper/B3S2JLWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.08872&json=true","fetch_graph":"https://pith.science/api/pith-number/B3S2JLWR7XNC7BZYUXZHVAGYCU/graph.json","fetch_events":"https://pith.science/api/pith-number/B3S2JLWR7XNC7BZYUXZHVAGYCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3S2JLWR7XNC7BZYUXZHVAGYCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3S2JLWR7XNC7BZYUXZHVAGYCU/action/storage_attestation","attest_author":"https://pith.science/pith/B3S2JLWR7XNC7BZYUXZHVAGYCU/action/author_attestation","sign_citation":"https://pith.science/pith/B3S2JLWR7XNC7BZYUXZHVAGYCU/action/citation_signature","submit_replication":"https://pith.science/pith/B3S2JLWR7XNC7BZYUXZHVAGYCU/action/replication_record"}},"created_at":"2026-05-18T00:27:14.951729+00:00","updated_at":"2026-05-18T00:27:14.951729+00:00"}