{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:V5ULULCGV3FCMDY2UWIR3CAVMV","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":"2e224cbde992e1d6f4042f6d5caf98ec864bf1a163d3d69e601f0e3088b7d381","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-29T13:47:23Z","title_canon_sha256":"e27e9979bf0029d44850b5e92784d08ad85d2ac91de1a151878d5cf3909a65f2"},"schema_version":"1.0","source":{"id":"2402.19163","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.19163","created_at":"2026-07-05T11:11:20Z"},{"alias_kind":"arxiv_version","alias_value":"2402.19163v3","created_at":"2026-07-05T11:11:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.19163","created_at":"2026-07-05T11:11:20Z"},{"alias_kind":"pith_short_12","alias_value":"V5ULULCGV3FC","created_at":"2026-07-05T11:11:20Z"},{"alias_kind":"pith_short_16","alias_value":"V5ULULCGV3FCMDY2","created_at":"2026-07-05T11:11:20Z"},{"alias_kind":"pith_short_8","alias_value":"V5ULULCG","created_at":"2026-07-05T11:11:20Z"}],"graph_snapshots":[{"event_id":"sha256:073bc27fe9ba362bb0e3babcdfd4a077b92f9fb35bdecbbb8096c176d5135592","target":"graph","created_at":"2026-07-05T11:11:20Z","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/2402.19163/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We address the challenge of federated learning on graph-structured data distributed across multiple clients. Specifically, we focus on the prevalent scenario of interconnected subgraphs, where interconnections between different clients play a critical role. We present a novel framework for this scenario, named FedStruct, that harnesses deep structural dependencies. To uphold privacy, unlike existing methods, FedStruct eliminates the necessity of sharing or generating sensitive node features or embeddings among clients. Instead, it leverages explicit global graph structure information to captur","authors_text":"Alexandre Graell i Amat, Javad Aliakbari, Johan \\\"Ostman","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-29T13:47:23Z","title":"Decoupled Subgraph Federated Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.19163","kind":"arxiv","version":3},"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:134e80e941bc4ded0af7767eb69ef1726dcb2c49f63ccbb8c582ff1bb2c3eabc","target":"record","created_at":"2026-07-05T11:11:20Z","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":"2e224cbde992e1d6f4042f6d5caf98ec864bf1a163d3d69e601f0e3088b7d381","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-29T13:47:23Z","title_canon_sha256":"e27e9979bf0029d44850b5e92784d08ad85d2ac91de1a151878d5cf3909a65f2"},"schema_version":"1.0","source":{"id":"2402.19163","kind":"arxiv","version":3}},"canonical_sha256":"af68ba2c46aeca260f1aa5911d88156550c61d3cca329f2352eb7a9df9e265ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af68ba2c46aeca260f1aa5911d88156550c61d3cca329f2352eb7a9df9e265ea","first_computed_at":"2026-07-05T11:11:20.214193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:11:20.214193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/fFoD7EnbtpBFN05NCXVocX8mSLR8UEEp3bNaQN+lMXkh9UgheLhH+s6tppmNwMA5u42UtHOel0fx2KRuzKEDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:11:20.214685Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.19163","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:134e80e941bc4ded0af7767eb69ef1726dcb2c49f63ccbb8c582ff1bb2c3eabc","sha256:073bc27fe9ba362bb0e3babcdfd4a077b92f9fb35bdecbbb8096c176d5135592"],"state_sha256":"c10129f19c15a735bca08006ed218bba56fe9f36ce8c8c4bbef6c07dcca73769"}