{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:J5JRG5CUW2O4CN6YG2UUBDASUT","short_pith_number":"pith:J5JRG5CU","canonical_record":{"source":{"id":"2509.08409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-09-10T08:55:23Z","cross_cats_sorted":[],"title_canon_sha256":"29c5ec06e14b1964081a063a9e1921a2a41dd6eb4d16b200257060a2822a5bb6","abstract_canon_sha256":"6e75ef14eaf34bce50d308617ff16dc9df8c4d029d7d119cdf49a09f85f67823"},"schema_version":"1.0"},"canonical_sha256":"4f53137454b69dc137d836a9408c12a4f0de915dab9db93a1c7562d3aee722d6","source":{"kind":"arxiv","id":"2509.08409","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08409","created_at":"2026-07-05T12:08:29Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08409v1","created_at":"2026-07-05T12:08:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08409","created_at":"2026-07-05T12:08:29Z"},{"alias_kind":"pith_short_12","alias_value":"J5JRG5CUW2O4","created_at":"2026-07-05T12:08:29Z"},{"alias_kind":"pith_short_16","alias_value":"J5JRG5CUW2O4CN6Y","created_at":"2026-07-05T12:08:29Z"},{"alias_kind":"pith_short_8","alias_value":"J5JRG5CU","created_at":"2026-07-05T12:08:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:J5JRG5CUW2O4CN6YG2UUBDASUT","target":"record","payload":{"canonical_record":{"source":{"id":"2509.08409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-09-10T08:55:23Z","cross_cats_sorted":[],"title_canon_sha256":"29c5ec06e14b1964081a063a9e1921a2a41dd6eb4d16b200257060a2822a5bb6","abstract_canon_sha256":"6e75ef14eaf34bce50d308617ff16dc9df8c4d029d7d119cdf49a09f85f67823"},"schema_version":"1.0"},"canonical_sha256":"4f53137454b69dc137d836a9408c12a4f0de915dab9db93a1c7562d3aee722d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:08:29.432462Z","signature_b64":"sIghxnhm0WlmMxS5qqOO3YiXyqi5gyqR2MUzjjQCa29AVZNOM8sUQ+VENO62+lqCFokiS0vRkUaVr0rsmQPbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f53137454b69dc137d836a9408c12a4f0de915dab9db93a1c7562d3aee722d6","last_reissued_at":"2026-07-05T12:08:29.431935Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:08:29.431935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.08409","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-05T12:08:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sWeOpLAE1Rd6uC+o6+lQXJnbDRuDEORWGODOhD5t0PebUE4I9gRMmE0w4L/qM2hSTdw1/gnGE3/QQznjPi87Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:17:18.716825Z"},"content_sha256":"48eae89e44bbb24d6c5c741d73cab8368f07f6fa28850acee43d88f585161280","schema_version":"1.0","event_id":"sha256:48eae89e44bbb24d6c5c741d73cab8368f07f6fa28850acee43d88f585161280"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:J5JRG5CUW2O4CN6YG2UUBDASUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chenxia Tang, Hongli Xu, Jianchun Liu, Liusheng Huang, Qianpiao Ma, Shilong Wang","submitted_at":"2025-09-10T08:55:23Z","abstract_excerpt":"Decentralized Federated Graph Learning (DFGL) overcomes potential bottlenecks of the parameter server in FGL by establishing a peer-to-peer (P2P) communication network among workers. However, while extensive cross-worker communication of graph node embeddings is crucial for DFGL training, it introduces substantial communication costs. Most existing works typically construct sparse network topologies or utilize graph neighbor sampling methods to alleviate the communication overhead in DFGL. Intuitively, integrating these methods may offer promise for doubly improving communication efficiency in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08409","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/2509.08409/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-05T12:08:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHHc/O4rsBm8XIo15AO0ekuNbU0fQdLDah5zNy739uDmsT2CLezCVgh7I1cXlsckolbQJt+SoM6cl+8PAiWNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:17:18.717306Z"},"content_sha256":"b51015bcc45f92633e9043a6f5902417c0d2b92e27eea1c0508ba6e926acb5d1","schema_version":"1.0","event_id":"sha256:b51015bcc45f92633e9043a6f5902417c0d2b92e27eea1c0508ba6e926acb5d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J5JRG5CUW2O4CN6YG2UUBDASUT/bundle.json","state_url":"https://pith.science/pith/J5JRG5CUW2O4CN6YG2UUBDASUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J5JRG5CUW2O4CN6YG2UUBDASUT/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-05T09:17:18Z","links":{"resolver":"https://pith.science/pith/J5JRG5CUW2O4CN6YG2UUBDASUT","bundle":"https://pith.science/pith/J5JRG5CUW2O4CN6YG2UUBDASUT/bundle.json","state":"https://pith.science/pith/J5JRG5CUW2O4CN6YG2UUBDASUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J5JRG5CUW2O4CN6YG2UUBDASUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:J5JRG5CUW2O4CN6YG2UUBDASUT","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":"6e75ef14eaf34bce50d308617ff16dc9df8c4d029d7d119cdf49a09f85f67823","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-09-10T08:55:23Z","title_canon_sha256":"29c5ec06e14b1964081a063a9e1921a2a41dd6eb4d16b200257060a2822a5bb6"},"schema_version":"1.0","source":{"id":"2509.08409","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08409","created_at":"2026-07-05T12:08:29Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08409v1","created_at":"2026-07-05T12:08:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08409","created_at":"2026-07-05T12:08:29Z"},{"alias_kind":"pith_short_12","alias_value":"J5JRG5CUW2O4","created_at":"2026-07-05T12:08:29Z"},{"alias_kind":"pith_short_16","alias_value":"J5JRG5CUW2O4CN6Y","created_at":"2026-07-05T12:08:29Z"},{"alias_kind":"pith_short_8","alias_value":"J5JRG5CU","created_at":"2026-07-05T12:08:29Z"}],"graph_snapshots":[{"event_id":"sha256:b51015bcc45f92633e9043a6f5902417c0d2b92e27eea1c0508ba6e926acb5d1","target":"graph","created_at":"2026-07-05T12:08:29Z","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/2509.08409/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decentralized Federated Graph Learning (DFGL) overcomes potential bottlenecks of the parameter server in FGL by establishing a peer-to-peer (P2P) communication network among workers. However, while extensive cross-worker communication of graph node embeddings is crucial for DFGL training, it introduces substantial communication costs. Most existing works typically construct sparse network topologies or utilize graph neighbor sampling methods to alleviate the communication overhead in DFGL. Intuitively, integrating these methods may offer promise for doubly improving communication efficiency in","authors_text":"Chenxia Tang, Hongli Xu, Jianchun Liu, Liusheng Huang, Qianpiao Ma, Shilong Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08409","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:48eae89e44bbb24d6c5c741d73cab8368f07f6fa28850acee43d88f585161280","target":"record","created_at":"2026-07-05T12:08:29Z","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":"6e75ef14eaf34bce50d308617ff16dc9df8c4d029d7d119cdf49a09f85f67823","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-09-10T08:55:23Z","title_canon_sha256":"29c5ec06e14b1964081a063a9e1921a2a41dd6eb4d16b200257060a2822a5bb6"},"schema_version":"1.0","source":{"id":"2509.08409","kind":"arxiv","version":1}},"canonical_sha256":"4f53137454b69dc137d836a9408c12a4f0de915dab9db93a1c7562d3aee722d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f53137454b69dc137d836a9408c12a4f0de915dab9db93a1c7562d3aee722d6","first_computed_at":"2026-07-05T12:08:29.431935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:08:29.431935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sIghxnhm0WlmMxS5qqOO3YiXyqi5gyqR2MUzjjQCa29AVZNOM8sUQ+VENO62+lqCFokiS0vRkUaVr0rsmQPbCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:08:29.432462Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.08409","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48eae89e44bbb24d6c5c741d73cab8368f07f6fa28850acee43d88f585161280","sha256:b51015bcc45f92633e9043a6f5902417c0d2b92e27eea1c0508ba6e926acb5d1"],"state_sha256":"63b7ebb1b64acf4845aea4b81cc66798bf1523fc6444a68b3646daaf7fdb7f3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KUIfqf9IdrwYwZW1YZfQND5f8YACVKuRHcNCtOeuVp9U6f67RWPGMKHn2nlO/TNaVtUnLbZ427hAzQH++tHMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T09:17:18.721489Z","bundle_sha256":"c47b01f864a2361d942d48bcbeb180b09c7df648b42fdcfc6c854fea8dbc05bc"}}