{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ETBL3QNXWBYMBMMM6RXPSBI5C6","short_pith_number":"pith:ETBL3QNX","schema_version":"1.0","canonical_sha256":"24c2bdc1b7b070c0b18cf46ef9051d1796c380ed0c2591339222b33bdc731c36","source":{"kind":"arxiv","id":"2011.03248","version":1},"attestation_state":"computed","paper":{"title":"ASFGNN: Automated Separated-Federated Graph Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Benyu Zhang, Bingzhe Wu, Chaochao Chen, Jun Zhou, Li Wang, Longfei Zheng","submitted_at":"2020-11-06T09:21:34Z","abstract_excerpt":"Graph Neural Networks (GNNs) have achieved remarkable performance by taking advantage of graph data. The success of GNN models always depends on rich features and adjacent relationships. However, in practice, such data are usually isolated by different data owners (clients) and thus are likely to be Non-Independent and Identically Distributed (Non-IID). Meanwhile, considering the limited network status of data owners, hyper-parameters optimization for collaborative learning approaches is time-consuming in data isolation scenarios. To address these problems, we propose an Automated Separated-Fe"},"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":"2011.03248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-06T09:21:34Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"c4c197ecd0b63d731f847cd9854ee23a72f6717f88f843ea41d197851666e08c","abstract_canon_sha256":"a99edce9562058910cb2813970cd68171a83f928da02f767c0b43b0b35d17a1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:49:41.318093Z","signature_b64":"NhSbmXxnw/twXsGU2QqVqzIqNCUftBq3hpbIDno+ZGHvRZoLiCmRv2piQfWldIb8blLPUyWN32jBBycknFsLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24c2bdc1b7b070c0b18cf46ef9051d1796c380ed0c2591339222b33bdc731c36","last_reissued_at":"2026-07-05T01:49:41.317665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:49:41.317665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ASFGNN: Automated Separated-Federated Graph Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Benyu Zhang, Bingzhe Wu, Chaochao Chen, Jun Zhou, Li Wang, Longfei Zheng","submitted_at":"2020-11-06T09:21:34Z","abstract_excerpt":"Graph Neural Networks (GNNs) have achieved remarkable performance by taking advantage of graph data. The success of GNN models always depends on rich features and adjacent relationships. However, in practice, such data are usually isolated by different data owners (clients) and thus are likely to be Non-Independent and Identically Distributed (Non-IID). Meanwhile, considering the limited network status of data owners, hyper-parameters optimization for collaborative learning approaches is time-consuming in data isolation scenarios. To address these problems, we propose an Automated Separated-Fe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03248","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/2011.03248/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":"2011.03248","created_at":"2026-07-05T01:49:41.317727+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.03248v1","created_at":"2026-07-05T01:49:41.317727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03248","created_at":"2026-07-05T01:49:41.317727+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETBL3QNXWBYM","created_at":"2026-07-05T01:49:41.317727+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETBL3QNXWBYMBMMM","created_at":"2026-07-05T01:49:41.317727+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETBL3QNX","created_at":"2026-07-05T01:49:41.317727+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.16144","citing_title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ETBL3QNXWBYMBMMM6RXPSBI5C6","json":"https://pith.science/pith/ETBL3QNXWBYMBMMM6RXPSBI5C6.json","graph_json":"https://pith.science/api/pith-number/ETBL3QNXWBYMBMMM6RXPSBI5C6/graph.json","events_json":"https://pith.science/api/pith-number/ETBL3QNXWBYMBMMM6RXPSBI5C6/events.json","paper":"https://pith.science/paper/ETBL3QNX"},"agent_actions":{"view_html":"https://pith.science/pith/ETBL3QNXWBYMBMMM6RXPSBI5C6","download_json":"https://pith.science/pith/ETBL3QNXWBYMBMMM6RXPSBI5C6.json","view_paper":"https://pith.science/paper/ETBL3QNX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.03248&json=true","fetch_graph":"https://pith.science/api/pith-number/ETBL3QNXWBYMBMMM6RXPSBI5C6/graph.json","fetch_events":"https://pith.science/api/pith-number/ETBL3QNXWBYMBMMM6RXPSBI5C6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETBL3QNXWBYMBMMM6RXPSBI5C6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETBL3QNXWBYMBMMM6RXPSBI5C6/action/storage_attestation","attest_author":"https://pith.science/pith/ETBL3QNXWBYMBMMM6RXPSBI5C6/action/author_attestation","sign_citation":"https://pith.science/pith/ETBL3QNXWBYMBMMM6RXPSBI5C6/action/citation_signature","submit_replication":"https://pith.science/pith/ETBL3QNXWBYMBMMM6RXPSBI5C6/action/replication_record"}},"created_at":"2026-07-05T01:49:41.317727+00:00","updated_at":"2026-07-05T01:49:41.317727+00:00"}