{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QEF5FL266TPSSJHUU6SJDCUCKY","short_pith_number":"pith:QEF5FL26","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"},"canonical_sha256":"810bd2af5ef4df2924f4a7a4918a82560512ecce8d11ff8056dda9f6af3384a6","source":{"kind":"arxiv","id":"2605.26854","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26854","created_at":"2026-05-27T01:06:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26854v1","created_at":"2026-05-27T01:06:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26854","created_at":"2026-05-27T01:06:15Z"},{"alias_kind":"pith_short_12","alias_value":"QEF5FL266TPS","created_at":"2026-05-27T01:06:15Z"},{"alias_kind":"pith_short_16","alias_value":"QEF5FL266TPSSJHU","created_at":"2026-05-27T01:06:15Z"},{"alias_kind":"pith_short_8","alias_value":"QEF5FL26","created_at":"2026-05-27T01:06:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QEF5FL266TPSSJHUU6SJDCUCKY","target":"record","payload":{"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"},"canonical_sha256":"810bd2af5ef4df2924f4a7a4918a82560512ecce8d11ff8056dda9f6af3384a6","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"},"source_kind":"arxiv","source_id":"2605.26854","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:06:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0JFbZICR2/EmICuc38QFNwNbvWvsQ1NnOlC8/2fqHeNYQ/a8qCOw4Ua5mymbrC2BiiJxaokXx6C1nLJPQ5k6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T19:55:01.810308Z"},"content_sha256":"ce8050b9bcfbbb20785cf48f14f5baee46fc747c8e10f63bd622888841e1fe70","schema_version":"1.0","event_id":"sha256:ce8050b9bcfbbb20785cf48f14f5baee46fc747c8e10f63bd622888841e1fe70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QEF5FL266TPSSJHUU6SJDCUCKY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:06:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1bU7Fss2jo1PrhKFpi3uFpR9f6m+0b4/S3pqCOosMW/gwNiUYP3WDdS1pLv2izxI3gloXVyWqm353vuY4vXaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T19:55:01.810693Z"},"content_sha256":"690380c5522e5f106244865db69d3f73dbb0d1bdaf294fff03c0df10c7b5f8cd","schema_version":"1.0","event_id":"sha256:690380c5522e5f106244865db69d3f73dbb0d1bdaf294fff03c0df10c7b5f8cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEF5FL266TPSSJHUU6SJDCUCKY/bundle.json","state_url":"https://pith.science/pith/QEF5FL266TPSSJHUU6SJDCUCKY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEF5FL266TPSSJHUU6SJDCUCKY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T19:55:01Z","links":{"resolver":"https://pith.science/pith/QEF5FL266TPSSJHUU6SJDCUCKY","bundle":"https://pith.science/pith/QEF5FL266TPSSJHUU6SJDCUCKY/bundle.json","state":"https://pith.science/pith/QEF5FL266TPSSJHUU6SJDCUCKY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEF5FL266TPSSJHUU6SJDCUCKY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QEF5FL266TPSSJHUU6SJDCUCKY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7389fa52b1a2f6713ebc0bf86a39e1993e51729412dce6db20d562345f6689b1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-26T11:14:59Z","title_canon_sha256":"b14674b5b558047a2234558d20e541a2bfe97349fe6031084ed4c39a97ad8e1c"},"schema_version":"1.0","source":{"id":"2605.26854","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26854","created_at":"2026-05-27T01:06:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26854v1","created_at":"2026-05-27T01:06:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26854","created_at":"2026-05-27T01:06:15Z"},{"alias_kind":"pith_short_12","alias_value":"QEF5FL266TPS","created_at":"2026-05-27T01:06:15Z"},{"alias_kind":"pith_short_16","alias_value":"QEF5FL266TPSSJHU","created_at":"2026-05-27T01:06:15Z"},{"alias_kind":"pith_short_8","alias_value":"QEF5FL26","created_at":"2026-05-27T01:06:15Z"}],"graph_snapshots":[{"event_id":"sha256:690380c5522e5f106244865db69d3f73dbb0d1bdaf294fff03c0df10c7b5f8cd","target":"graph","created_at":"2026-05-27T01:06:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.26854/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Eran Treister, Ido Ben-Yair, Lars Ruthotto, Yali Fink","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-26T11:14:59Z","title":"RAPNet: Accelerating Algebraic Multigrid with Learned Sparse Corrections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26854","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ce8050b9bcfbbb20785cf48f14f5baee46fc747c8e10f63bd622888841e1fe70","target":"record","created_at":"2026-05-27T01:06:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7389fa52b1a2f6713ebc0bf86a39e1993e51729412dce6db20d562345f6689b1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-26T11:14:59Z","title_canon_sha256":"b14674b5b558047a2234558d20e541a2bfe97349fe6031084ed4c39a97ad8e1c"},"schema_version":"1.0","source":{"id":"2605.26854","kind":"arxiv","version":1}},"canonical_sha256":"810bd2af5ef4df2924f4a7a4918a82560512ecce8d11ff8056dda9f6af3384a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"810bd2af5ef4df2924f4a7a4918a82560512ecce8d11ff8056dda9f6af3384a6","first_computed_at":"2026-05-27T01:06:15.765765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:06:15.765765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v6IQY396oT+cGXfg7UozfxbTkjCFzGaEmtiphxYHP+T2lZxQJ38GPQQiVJy6x1LYHkqw7s1p0qSSUSyRUWNhCA==","signature_status":"signed_v1","signed_at":"2026-05-27T01:06:15.766681Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.26854","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce8050b9bcfbbb20785cf48f14f5baee46fc747c8e10f63bd622888841e1fe70","sha256:690380c5522e5f106244865db69d3f73dbb0d1bdaf294fff03c0df10c7b5f8cd"],"state_sha256":"541b8e6a6c3ea15d09ec09b4def3e1b887028914e6019c4a90a5c99c7e9e0e83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u17dJBfKoYcOl9v9uksiEokmMWoLbmKBhG2swrJl/X9X/h/4Vq/H7sv/qa234FAoigwXc7eElLaiJENuMQXxDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T19:55:01.812650Z","bundle_sha256":"139751f7c96092c00f269710cac53ab3a361bbe7fbd86a575701d229b0bdecae"}}