{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7IC5QM3ZRBHFTOHH5CZAIMEXEK","short_pith_number":"pith:7IC5QM3Z","schema_version":"1.0","canonical_sha256":"fa05d83379884e59b8e7e8b2043097228f36faf3352f941b62e4f36fdd858c99","source":{"kind":"arxiv","id":"2606.12577","version":1},"attestation_state":"computed","paper":{"title":"Cascading Smoothers for Multigrid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Robert I. Saye","submitted_at":"2026-06-10T18:25:45Z","abstract_excerpt":"Multigrid methods are among the most effective frameworks for solving large-scale sparse systems. However, achieving their hallmark linear scaling and rapid convergence crucially depends on an effective smoother algorithm, whose design is often highly problem-dependent. This paper develops a new approach, referred to as \\textit{cascading smoothers} due to their operation as an ordered sequence of single-step block-diagonal smoothers. Each level in the cascade is optimised to maximally damp the output of prior steps via a Frobenius norm minimisation of the corresponding error propagators. In pa"},"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":"2606.12577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-06-10T18:25:45Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"bc6687d7202880491e90aa5fba75432e71ffe2c32462e4d98f37d647fe42af9b","abstract_canon_sha256":"4154c242bb1affe11a1df3fc9f8c986a2a8316ca291a1551a424347facea5499"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T00:07:55.347996Z","signature_b64":"vPHHiYZ3b9xTPz07WyrVNzh2Zb6nzP9gUC3fLXe/Lu+al2GnlQkjaCeAnwoQr/M6fc7Mu5x8c2RdDQc4rBUJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa05d83379884e59b8e7e8b2043097228f36faf3352f941b62e4f36fdd858c99","last_reissued_at":"2026-06-12T00:07:55.347587Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T00:07:55.347587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cascading Smoothers for Multigrid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Robert I. Saye","submitted_at":"2026-06-10T18:25:45Z","abstract_excerpt":"Multigrid methods are among the most effective frameworks for solving large-scale sparse systems. However, achieving their hallmark linear scaling and rapid convergence crucially depends on an effective smoother algorithm, whose design is often highly problem-dependent. This paper develops a new approach, referred to as \\textit{cascading smoothers} due to their operation as an ordered sequence of single-step block-diagonal smoothers. Each level in the cascade is optimised to maximally damp the output of prior steps via a Frobenius norm minimisation of the corresponding error propagators. In pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12577","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.12577/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.12577","created_at":"2026-06-12T00:07:55.347652+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12577v1","created_at":"2026-06-12T00:07:55.347652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12577","created_at":"2026-06-12T00:07:55.347652+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IC5QM3ZRBHF","created_at":"2026-06-12T00:07:55.347652+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IC5QM3ZRBHFTOHH","created_at":"2026-06-12T00:07:55.347652+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IC5QM3Z","created_at":"2026-06-12T00:07:55.347652+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/7IC5QM3ZRBHFTOHH5CZAIMEXEK","json":"https://pith.science/pith/7IC5QM3ZRBHFTOHH5CZAIMEXEK.json","graph_json":"https://pith.science/api/pith-number/7IC5QM3ZRBHFTOHH5CZAIMEXEK/graph.json","events_json":"https://pith.science/api/pith-number/7IC5QM3ZRBHFTOHH5CZAIMEXEK/events.json","paper":"https://pith.science/paper/7IC5QM3Z"},"agent_actions":{"view_html":"https://pith.science/pith/7IC5QM3ZRBHFTOHH5CZAIMEXEK","download_json":"https://pith.science/pith/7IC5QM3ZRBHFTOHH5CZAIMEXEK.json","view_paper":"https://pith.science/paper/7IC5QM3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12577&json=true","fetch_graph":"https://pith.science/api/pith-number/7IC5QM3ZRBHFTOHH5CZAIMEXEK/graph.json","fetch_events":"https://pith.science/api/pith-number/7IC5QM3ZRBHFTOHH5CZAIMEXEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IC5QM3ZRBHFTOHH5CZAIMEXEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IC5QM3ZRBHFTOHH5CZAIMEXEK/action/storage_attestation","attest_author":"https://pith.science/pith/7IC5QM3ZRBHFTOHH5CZAIMEXEK/action/author_attestation","sign_citation":"https://pith.science/pith/7IC5QM3ZRBHFTOHH5CZAIMEXEK/action/citation_signature","submit_replication":"https://pith.science/pith/7IC5QM3ZRBHFTOHH5CZAIMEXEK/action/replication_record"}},"created_at":"2026-06-12T00:07:55.347652+00:00","updated_at":"2026-06-12T00:07:55.347652+00:00"}