{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:BN7A34FEA4LBVGBFVQVEUOACYK","short_pith_number":"pith:BN7A34FE","canonical_record":{"source":{"id":"2405.18127","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-28T12:39:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"fa063583dd33f288c95fe8596c9c9d0932eacdecc8c281f47414cc00cf8b449c","abstract_canon_sha256":"42abc114b2198438edef5acd26d93549fdefc0efb3cdaddb398883d9d94e540f"},"schema_version":"1.0"},"canonical_sha256":"0b7e0df0a407161a9825ac2a4a3802c2a63abc132120414907d8a20a810c62ec","source":{"kind":"arxiv","id":"2405.18127","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.18127","created_at":"2026-07-05T08:24:15Z"},{"alias_kind":"arxiv_version","alias_value":"2405.18127v1","created_at":"2026-07-05T08:24:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.18127","created_at":"2026-07-05T08:24:15Z"},{"alias_kind":"pith_short_12","alias_value":"BN7A34FEA4LB","created_at":"2026-07-05T08:24:15Z"},{"alias_kind":"pith_short_16","alias_value":"BN7A34FEA4LBVGBF","created_at":"2026-07-05T08:24:15Z"},{"alias_kind":"pith_short_8","alias_value":"BN7A34FE","created_at":"2026-07-05T08:24:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:BN7A34FEA4LBVGBFVQVEUOACYK","target":"record","payload":{"canonical_record":{"source":{"id":"2405.18127","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-28T12:39:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"fa063583dd33f288c95fe8596c9c9d0932eacdecc8c281f47414cc00cf8b449c","abstract_canon_sha256":"42abc114b2198438edef5acd26d93549fdefc0efb3cdaddb398883d9d94e540f"},"schema_version":"1.0"},"canonical_sha256":"0b7e0df0a407161a9825ac2a4a3802c2a63abc132120414907d8a20a810c62ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:15.973030Z","signature_b64":"Dst2mopa3KvEeytwOnRcWd+qGNKYTmjTKbbAFxTF/m3mXJNqYn5QTHn+usIKgp0BiuIKXUe2p1NjXOLUJoIjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b7e0df0a407161a9825ac2a4a3802c2a63abc132120414907d8a20a810c62ec","last_reissued_at":"2026-07-05T08:24:15.972548Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:15.972548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.18127","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-07-05T08:24:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z0drE0w31lIeGw7X40LKSlHE5+IJ1W8EZAa5r2bA+HsyS/Ld7s3Jcn9PjmUWCpAS9xcVeZQHNYWwtanQgIVCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:42:28.021203Z"},"content_sha256":"b41cc38011f42a05c25e4b866b446ad4b0273d5b2df2a9692fa379b89105e4f3","schema_version":"1.0","event_id":"sha256:b41cc38011f42a05c25e4b866b446ad4b0273d5b2df2a9692fa379b89105e4f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:BN7A34FEA4LBVGBFVQVEUOACYK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Coarsening with Message-Passing Guarantees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Antonin Joly, Nicolas Keriven","submitted_at":"2024-05-28T12:39:24Z","abstract_excerpt":"Graph coarsening aims to reduce the size of a large graph while preserving some of its key properties, which has been used in many applications to reduce computational load and memory footprint. For instance, in graph machine learning, training Graph Neural Networks (GNNs) on coarsened graphs leads to drastic savings in time and memory. However, GNNs rely on the Message-Passing (MP) paradigm, and classical spectral preservation guarantees for graph coarsening do not directly lead to theoretical guarantees when performing naive message-passing on the coarsened graph. In this work, we propose a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.18127","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/2405.18127/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-07-05T08:24:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S4QIwelMHwx532OhwQkC2dNja2xVYHrCpodYR9VAVbrLaL6NPdx7TziaedGLvOv6D4ZFUwr/SWT2y+0s6EMsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:42:28.022058Z"},"content_sha256":"3caed828aff1208d3dc698ac379e4f90171e982e56f234a780ea7acb80c49dee","schema_version":"1.0","event_id":"sha256:3caed828aff1208d3dc698ac379e4f90171e982e56f234a780ea7acb80c49dee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BN7A34FEA4LBVGBFVQVEUOACYK/bundle.json","state_url":"https://pith.science/pith/BN7A34FEA4LBVGBFVQVEUOACYK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BN7A34FEA4LBVGBFVQVEUOACYK/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-08-10T19:42:28Z","links":{"resolver":"https://pith.science/pith/BN7A34FEA4LBVGBFVQVEUOACYK","bundle":"https://pith.science/pith/BN7A34FEA4LBVGBFVQVEUOACYK/bundle.json","state":"https://pith.science/pith/BN7A34FEA4LBVGBFVQVEUOACYK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BN7A34FEA4LBVGBFVQVEUOACYK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:BN7A34FEA4LBVGBFVQVEUOACYK","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":"42abc114b2198438edef5acd26d93549fdefc0efb3cdaddb398883d9d94e540f","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-28T12:39:24Z","title_canon_sha256":"fa063583dd33f288c95fe8596c9c9d0932eacdecc8c281f47414cc00cf8b449c"},"schema_version":"1.0","source":{"id":"2405.18127","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.18127","created_at":"2026-07-05T08:24:15Z"},{"alias_kind":"arxiv_version","alias_value":"2405.18127v1","created_at":"2026-07-05T08:24:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.18127","created_at":"2026-07-05T08:24:15Z"},{"alias_kind":"pith_short_12","alias_value":"BN7A34FEA4LB","created_at":"2026-07-05T08:24:15Z"},{"alias_kind":"pith_short_16","alias_value":"BN7A34FEA4LBVGBF","created_at":"2026-07-05T08:24:15Z"},{"alias_kind":"pith_short_8","alias_value":"BN7A34FE","created_at":"2026-07-05T08:24:15Z"}],"graph_snapshots":[{"event_id":"sha256:3caed828aff1208d3dc698ac379e4f90171e982e56f234a780ea7acb80c49dee","target":"graph","created_at":"2026-07-05T08:24: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/2405.18127/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph coarsening aims to reduce the size of a large graph while preserving some of its key properties, which has been used in many applications to reduce computational load and memory footprint. For instance, in graph machine learning, training Graph Neural Networks (GNNs) on coarsened graphs leads to drastic savings in time and memory. However, GNNs rely on the Message-Passing (MP) paradigm, and classical spectral preservation guarantees for graph coarsening do not directly lead to theoretical guarantees when performing naive message-passing on the coarsened graph. In this work, we propose a ","authors_text":"Antonin Joly, Nicolas Keriven","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-28T12:39:24Z","title":"Graph Coarsening with Message-Passing Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.18127","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:b41cc38011f42a05c25e4b866b446ad4b0273d5b2df2a9692fa379b89105e4f3","target":"record","created_at":"2026-07-05T08:24: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":"42abc114b2198438edef5acd26d93549fdefc0efb3cdaddb398883d9d94e540f","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-28T12:39:24Z","title_canon_sha256":"fa063583dd33f288c95fe8596c9c9d0932eacdecc8c281f47414cc00cf8b449c"},"schema_version":"1.0","source":{"id":"2405.18127","kind":"arxiv","version":1}},"canonical_sha256":"0b7e0df0a407161a9825ac2a4a3802c2a63abc132120414907d8a20a810c62ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b7e0df0a407161a9825ac2a4a3802c2a63abc132120414907d8a20a810c62ec","first_computed_at":"2026-07-05T08:24:15.972548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:24:15.972548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dst2mopa3KvEeytwOnRcWd+qGNKYTmjTKbbAFxTF/m3mXJNqYn5QTHn+usIKgp0BiuIKXUe2p1NjXOLUJoIjCA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:24:15.973030Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.18127","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b41cc38011f42a05c25e4b866b446ad4b0273d5b2df2a9692fa379b89105e4f3","sha256:3caed828aff1208d3dc698ac379e4f90171e982e56f234a780ea7acb80c49dee"],"state_sha256":"e53992265846f4735b02248128f513302bb0870bed68ef5c142a7c5fb9648e4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hvWW2v8bahdFuoByrAIAV7SfyolXaCEHB8G4OhC4djEaTgG06AHr8xf8T7GY0nCJi+MtsDg935uejTFdPQD1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T19:42:28.073331Z","bundle_sha256":"1bf4bed0fe211d7b7ec9a108d87f16da4f7090977c56883767b08c0e4a55528e"}}