{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YDRWBLJW5CCFY4SIUENFXMQC4A","short_pith_number":"pith:YDRWBLJW","canonical_record":{"source":{"id":"2608.02128","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-03T12:18:58Z","cross_cats_sorted":[],"title_canon_sha256":"bc116ea8e2b44cdc342c8a76a9d92e8a56a613d7d01f991b536b21b554ecaa83","abstract_canon_sha256":"29e94f135a618a0e08b749606f79fa8c5c55110041f1be0cb0e4652d312685ac"},"schema_version":"1.0"},"canonical_sha256":"c0e360ad36e8845c7248a11a5bb202e001ba05957c63f92dc4dc7528a4d7dffa","source":{"kind":"arxiv","id":"2608.02128","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.02128","created_at":"2026-08-04T02:11:04Z"},{"alias_kind":"arxiv_version","alias_value":"2608.02128v1","created_at":"2026-08-04T02:11:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.02128","created_at":"2026-08-04T02:11:04Z"},{"alias_kind":"pith_short_12","alias_value":"YDRWBLJW5CCF","created_at":"2026-08-04T02:11:04Z"},{"alias_kind":"pith_short_16","alias_value":"YDRWBLJW5CCFY4SI","created_at":"2026-08-04T02:11:04Z"},{"alias_kind":"pith_short_8","alias_value":"YDRWBLJW","created_at":"2026-08-04T02:11:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YDRWBLJW5CCFY4SIUENFXMQC4A","target":"record","payload":{"canonical_record":{"source":{"id":"2608.02128","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-03T12:18:58Z","cross_cats_sorted":[],"title_canon_sha256":"bc116ea8e2b44cdc342c8a76a9d92e8a56a613d7d01f991b536b21b554ecaa83","abstract_canon_sha256":"29e94f135a618a0e08b749606f79fa8c5c55110041f1be0cb0e4652d312685ac"},"schema_version":"1.0"},"canonical_sha256":"c0e360ad36e8845c7248a11a5bb202e001ba05957c63f92dc4dc7528a4d7dffa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:11:04.067821Z","signature_b64":"LZRyM8COzjvvZYlJhB+2MgzRGzO6p5BcOdg2CfrALquLACu65jGxE8qF7Zi0DpOcaogZjLo5hcn/oznWHBZOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0e360ad36e8845c7248a11a5bb202e001ba05957c63f92dc4dc7528a4d7dffa","last_reissued_at":"2026-08-04T02:11:04.065968Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:11:04.065968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.02128","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-08-04T02:11:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"msIFLYuhUJDrcT8cjwQGO9aokAV3X0Sbe23SGG5XDqu9uhrFoxCpucGJ/gNJd5+wmIX0PqetBE7bAZ7JkpwaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:05:15.362679Z"},"content_sha256":"5a31140b3cd98b802e10bba5c7372f7e9e2a55720715132fe08fbc6403519155","schema_version":"1.0","event_id":"sha256:5a31140b3cd98b802e10bba5c7372f7e9e2a55720715132fe08fbc6403519155"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YDRWBLJW5CCFY4SIUENFXMQC4A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aline Roumy, Antonin Joly, Nicolas Keriven","submitted_at":"2026-08-03T12:18:58Z","abstract_excerpt":"Training Graph Neural Networks on large graphs is challenged by the memory cost of storing all node representations across layers. We show that several existing scalable approaches can be written as structured modifications of the GNN propagation matrix, providing a unified perspective that exposes their respective limitations. In particular, graph coarsening replaces it by a low-rank approximation that enables spectral guarantees but assigns uniform representations to clustered nodes, while Cluster-GCN restricts the propagation matrix to intra-cluster connections that allow efficient batching"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.02128","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/2608.02128/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-08-04T02:11:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j7b1fpBzmL7k4WN7nk4cJMSSeVIG9S+Di78wEEI2e6Hq/dKL0xGBT5/+dBte1n3/IARvkXW06joLogt+EuuJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:05:15.363201Z"},"content_sha256":"69f7057383e15efaeae3742a8fa6afd081676d518a4b4bab7dff8934a542bf8a","schema_version":"1.0","event_id":"sha256:69f7057383e15efaeae3742a8fa6afd081676d518a4b4bab7dff8934a542bf8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDRWBLJW5CCFY4SIUENFXMQC4A/bundle.json","state_url":"https://pith.science/pith/YDRWBLJW5CCFY4SIUENFXMQC4A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDRWBLJW5CCFY4SIUENFXMQC4A/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-07T05:05:15Z","links":{"resolver":"https://pith.science/pith/YDRWBLJW5CCFY4SIUENFXMQC4A","bundle":"https://pith.science/pith/YDRWBLJW5CCFY4SIUENFXMQC4A/bundle.json","state":"https://pith.science/pith/YDRWBLJW5CCFY4SIUENFXMQC4A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDRWBLJW5CCFY4SIUENFXMQC4A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YDRWBLJW5CCFY4SIUENFXMQC4A","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":"29e94f135a618a0e08b749606f79fa8c5c55110041f1be0cb0e4652d312685ac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-03T12:18:58Z","title_canon_sha256":"bc116ea8e2b44cdc342c8a76a9d92e8a56a613d7d01f991b536b21b554ecaa83"},"schema_version":"1.0","source":{"id":"2608.02128","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.02128","created_at":"2026-08-04T02:11:04Z"},{"alias_kind":"arxiv_version","alias_value":"2608.02128v1","created_at":"2026-08-04T02:11:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.02128","created_at":"2026-08-04T02:11:04Z"},{"alias_kind":"pith_short_12","alias_value":"YDRWBLJW5CCF","created_at":"2026-08-04T02:11:04Z"},{"alias_kind":"pith_short_16","alias_value":"YDRWBLJW5CCFY4SI","created_at":"2026-08-04T02:11:04Z"},{"alias_kind":"pith_short_8","alias_value":"YDRWBLJW","created_at":"2026-08-04T02:11:04Z"}],"graph_snapshots":[{"event_id":"sha256:69f7057383e15efaeae3742a8fa6afd081676d518a4b4bab7dff8934a542bf8a","target":"graph","created_at":"2026-08-04T02:11:04Z","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/2608.02128/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Training Graph Neural Networks on large graphs is challenged by the memory cost of storing all node representations across layers. We show that several existing scalable approaches can be written as structured modifications of the GNN propagation matrix, providing a unified perspective that exposes their respective limitations. In particular, graph coarsening replaces it by a low-rank approximation that enables spectral guarantees but assigns uniform representations to clustered nodes, while Cluster-GCN restricts the propagation matrix to intra-cluster connections that allow efficient batching","authors_text":"Aline Roumy, Antonin Joly, Nicolas Keriven","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.02128","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:5a31140b3cd98b802e10bba5c7372f7e9e2a55720715132fe08fbc6403519155","target":"record","created_at":"2026-08-04T02:11:04Z","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":"29e94f135a618a0e08b749606f79fa8c5c55110041f1be0cb0e4652d312685ac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-03T12:18:58Z","title_canon_sha256":"bc116ea8e2b44cdc342c8a76a9d92e8a56a613d7d01f991b536b21b554ecaa83"},"schema_version":"1.0","source":{"id":"2608.02128","kind":"arxiv","version":1}},"canonical_sha256":"c0e360ad36e8845c7248a11a5bb202e001ba05957c63f92dc4dc7528a4d7dffa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0e360ad36e8845c7248a11a5bb202e001ba05957c63f92dc4dc7528a4d7dffa","first_computed_at":"2026-08-04T02:11:04.065968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-04T02:11:04.065968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LZRyM8COzjvvZYlJhB+2MgzRGzO6p5BcOdg2CfrALquLACu65jGxE8qF7Zi0DpOcaogZjLo5hcn/oznWHBZOBA==","signature_status":"signed_v1","signed_at":"2026-08-04T02:11:04.067821Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.02128","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a31140b3cd98b802e10bba5c7372f7e9e2a55720715132fe08fbc6403519155","sha256:69f7057383e15efaeae3742a8fa6afd081676d518a4b4bab7dff8934a542bf8a"],"state_sha256":"6f02de6682a4007a7a47dd92d8a88b3f091fefb74d5dfeeb0f127f035f3a9513"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LJPct1mYYm0mhR5A4D/qUrUi7h8mbbKeMqpYyWUh+5SeIB2k/kiinzs7MH0rnwogL7qaHACizTc67h+uva2XDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T05:05:15.368169Z","bundle_sha256":"6ee7e726859474502db6dedfcacde20bb3b686decfa6a987124dbd6d21de4f5c"}}