{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2OWSAZ2VB3WS26O7QWANQFHQPV","short_pith_number":"pith:2OWSAZ2V","schema_version":"1.0","canonical_sha256":"d3ad2067550eed2d79df8580d814f07d4d4586a419273141b285629c4bff52c2","source":{"kind":"arxiv","id":"2406.18937","version":2},"attestation_state":"computed","paper":{"title":"Federated Graph Semantic and Structural Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bo Du, Guancheng Wan, Mang Ye, Wenke Huang","submitted_at":"2024-06-27T07:08:28Z","abstract_excerpt":"Federated graph learning collaboratively learns a global graph neural network with distributed graphs, where the non-independent and identically distributed property is one of the major challenges. Most relative arts focus on traditional distributed tasks like images and voices, incapable of graph structures. This paper firstly reveals that local client distortion is brought by both node-level semantics and graph-level structure. First, for node-level semantics, we find that contrasting nodes from distinct classes is beneficial to provide a well-performing discrimination. We pull the local nod"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2406.18937","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-27T07:08:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7f737b4cf871657f44ab27f06f1d8d2788191671926c9ef37f74e5b768145972","abstract_canon_sha256":"ddbe60053c116204d7e8262bedb3a99af18cbc47bdbf6d92b118812b2d549466"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:38:12.507604Z","signature_b64":"+DqWBspFKlx22ws12a7F6++35YXPJj5zW1wJExFW94shAJ55YT7edL7FvCfLt7mUI0JN1tmC2xqYcbvmHmHHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3ad2067550eed2d79df8580d814f07d4d4586a419273141b285629c4bff52c2","last_reissued_at":"2026-07-05T08:38:12.507134Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:38:12.507134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Federated Graph Semantic and Structural Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bo Du, Guancheng Wan, Mang Ye, Wenke Huang","submitted_at":"2024-06-27T07:08:28Z","abstract_excerpt":"Federated graph learning collaboratively learns a global graph neural network with distributed graphs, where the non-independent and identically distributed property is one of the major challenges. Most relative arts focus on traditional distributed tasks like images and voices, incapable of graph structures. This paper firstly reveals that local client distortion is brought by both node-level semantics and graph-level structure. First, for node-level semantics, we find that contrasting nodes from distinct classes is beneficial to provide a well-performing discrimination. We pull the local nod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.18937","kind":"arxiv","version":2},"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/2406.18937/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2406.18937","created_at":"2026-07-05T08:38:12.507199+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.18937v2","created_at":"2026-07-05T08:38:12.507199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.18937","created_at":"2026-07-05T08:38:12.507199+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OWSAZ2VB3WS","created_at":"2026-07-05T08:38:12.507199+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OWSAZ2VB3WS26O7","created_at":"2026-07-05T08:38:12.507199+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OWSAZ2V","created_at":"2026-07-05T08:38:12.507199+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.08409","citing_title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2OWSAZ2VB3WS26O7QWANQFHQPV","json":"https://pith.science/pith/2OWSAZ2VB3WS26O7QWANQFHQPV.json","graph_json":"https://pith.science/api/pith-number/2OWSAZ2VB3WS26O7QWANQFHQPV/graph.json","events_json":"https://pith.science/api/pith-number/2OWSAZ2VB3WS26O7QWANQFHQPV/events.json","paper":"https://pith.science/paper/2OWSAZ2V"},"agent_actions":{"view_html":"https://pith.science/pith/2OWSAZ2VB3WS26O7QWANQFHQPV","download_json":"https://pith.science/pith/2OWSAZ2VB3WS26O7QWANQFHQPV.json","view_paper":"https://pith.science/paper/2OWSAZ2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.18937&json=true","fetch_graph":"https://pith.science/api/pith-number/2OWSAZ2VB3WS26O7QWANQFHQPV/graph.json","fetch_events":"https://pith.science/api/pith-number/2OWSAZ2VB3WS26O7QWANQFHQPV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OWSAZ2VB3WS26O7QWANQFHQPV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OWSAZ2VB3WS26O7QWANQFHQPV/action/storage_attestation","attest_author":"https://pith.science/pith/2OWSAZ2VB3WS26O7QWANQFHQPV/action/author_attestation","sign_citation":"https://pith.science/pith/2OWSAZ2VB3WS26O7QWANQFHQPV/action/citation_signature","submit_replication":"https://pith.science/pith/2OWSAZ2VB3WS26O7QWANQFHQPV/action/replication_record"}},"created_at":"2026-07-05T08:38:12.507199+00:00","updated_at":"2026-07-05T08:38:12.507199+00:00"}