{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QEF5FL266TPSSJHUU6SJDCUCKY","short_pith_number":"pith:QEF5FL26","schema_version":"1.0","canonical_sha256":"810bd2af5ef4df2924f4a7a4918a82560512ecce8d11ff8056dda9f6af3384a6","source":{"kind":"arxiv","id":"2605.26854","version":1},"attestation_state":"computed","paper":{"title":"RAPNet: Accelerating Algebraic Multigrid with Learned Sparse Corrections","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eran Treister, Ido Ben-Yair, Lars Ruthotto, Yali Fink","submitted_at":"2026-05-26T11:14:59Z","abstract_excerpt":"The scalable solution of large sparse linear systems is a bottleneck in scientific computing and graph analysis. While algebraic multigrid (AMG) offers optimal linear scaling, its performance is severely constrained by the trade-off between the sparsity and convergence quality of coarse-grid operators. Classical AMG heuristics struggle to balance these objectives, often sacrificing stability or performance for sparsity. We propose RAPNet, a graph neural network (GNN) framework that resolves this trade-off by learning to generate sparse, robust coarse operators directly from the sparse algebrai"},"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":"2605.26854","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-26T11:14:59Z","cross_cats_sorted":[],"title_canon_sha256":"b14674b5b558047a2234558d20e541a2bfe97349fe6031084ed4c39a97ad8e1c","abstract_canon_sha256":"7389fa52b1a2f6713ebc0bf86a39e1993e51729412dce6db20d562345f6689b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:06:15.766681Z","signature_b64":"v6IQY396oT+cGXfg7UozfxbTkjCFzGaEmtiphxYHP+T2lZxQJ38GPQQiVJy6x1LYHkqw7s1p0qSSUSyRUWNhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"810bd2af5ef4df2924f4a7a4918a82560512ecce8d11ff8056dda9f6af3384a6","last_reissued_at":"2026-05-27T01:06:15.765765Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:06:15.765765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RAPNet: Accelerating Algebraic Multigrid with Learned Sparse Corrections","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eran Treister, Ido Ben-Yair, Lars Ruthotto, Yali Fink","submitted_at":"2026-05-26T11:14:59Z","abstract_excerpt":"The scalable solution of large sparse linear systems is a bottleneck in scientific computing and graph analysis. While algebraic multigrid (AMG) offers optimal linear scaling, its performance is severely constrained by the trade-off between the sparsity and convergence quality of coarse-grid operators. Classical AMG heuristics struggle to balance these objectives, often sacrificing stability or performance for sparsity. We propose RAPNet, a graph neural network (GNN) framework that resolves this trade-off by learning to generate sparse, robust coarse operators directly from the sparse algebrai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26854","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/2605.26854/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":"2605.26854","created_at":"2026-05-27T01:06:15.765915+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.26854v1","created_at":"2026-05-27T01:06:15.765915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26854","created_at":"2026-05-27T01:06:15.765915+00:00"},{"alias_kind":"pith_short_12","alias_value":"QEF5FL266TPS","created_at":"2026-05-27T01:06:15.765915+00:00"},{"alias_kind":"pith_short_16","alias_value":"QEF5FL266TPSSJHU","created_at":"2026-05-27T01:06:15.765915+00:00"},{"alias_kind":"pith_short_8","alias_value":"QEF5FL26","created_at":"2026-05-27T01:06:15.765915+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/QEF5FL266TPSSJHUU6SJDCUCKY","json":"https://pith.science/pith/QEF5FL266TPSSJHUU6SJDCUCKY.json","graph_json":"https://pith.science/api/pith-number/QEF5FL266TPSSJHUU6SJDCUCKY/graph.json","events_json":"https://pith.science/api/pith-number/QEF5FL266TPSSJHUU6SJDCUCKY/events.json","paper":"https://pith.science/paper/QEF5FL26"},"agent_actions":{"view_html":"https://pith.science/pith/QEF5FL266TPSSJHUU6SJDCUCKY","download_json":"https://pith.science/pith/QEF5FL266TPSSJHUU6SJDCUCKY.json","view_paper":"https://pith.science/paper/QEF5FL26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.26854&json=true","fetch_graph":"https://pith.science/api/pith-number/QEF5FL266TPSSJHUU6SJDCUCKY/graph.json","fetch_events":"https://pith.science/api/pith-number/QEF5FL266TPSSJHUU6SJDCUCKY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QEF5FL266TPSSJHUU6SJDCUCKY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QEF5FL266TPSSJHUU6SJDCUCKY/action/storage_attestation","attest_author":"https://pith.science/pith/QEF5FL266TPSSJHUU6SJDCUCKY/action/author_attestation","sign_citation":"https://pith.science/pith/QEF5FL266TPSSJHUU6SJDCUCKY/action/citation_signature","submit_replication":"https://pith.science/pith/QEF5FL266TPSSJHUU6SJDCUCKY/action/replication_record"}},"created_at":"2026-05-27T01:06:15.765915+00:00","updated_at":"2026-05-27T01:06:15.765915+00:00"}