{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:CYVVBOB4GKHVPGBV75WQDV5M5A","short_pith_number":"pith:CYVVBOB4","schema_version":"1.0","canonical_sha256":"162b50b83c328f579835ff6d01d7ace83510925d58f3ef77f91f19464015dfe5","source":{"kind":"arxiv","id":"2106.13423","version":5},"attestation_state":"computed","paper":{"title":"Federated Graph Classification over Non-IID Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Carl Yang, Han Xie, Jing Ma, Li Xiong","submitted_at":"2021-06-25T04:25:29Z","abstract_excerpt":"Federated learning has emerged as an important paradigm for training machine learning models in different domains. For graph-level tasks such as graph classification, graphs can also be regarded as a special type of data samples, which can be collected and stored in separate local systems. Similar to other domains, multiple local systems, each holding a small set of graphs, may benefit from collaboratively training a powerful graph mining model, such as the popular graph neural networks (GNNs). To provide more motivation towards such endeavors, we analyze real-world graphs from different domai"},"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":"2106.13423","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-25T04:25:29Z","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"title_canon_sha256":"15c91cf041dc526753219f3fc0a943977064c9d15a65e258d85c64a2e74ccf1f","abstract_canon_sha256":"3d0b027a3728a1370e6d0fe7a591741b31bbdb6f3d0323fad0583bdb8a0051c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:29:50.379544Z","signature_b64":"sO5qiPvRpaTFEGmhIG0KAjBcclDtq5OjaJ5Y1gtfxhaXC0QxsrQjJ6l+pIVMorZawVlsbBhExy8gCXhQRbaCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"162b50b83c328f579835ff6d01d7ace83510925d58f3ef77f91f19464015dfe5","last_reissued_at":"2026-07-05T03:29:50.379050Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:29:50.379050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Federated Graph Classification over Non-IID Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Carl Yang, Han Xie, Jing Ma, Li Xiong","submitted_at":"2021-06-25T04:25:29Z","abstract_excerpt":"Federated learning has emerged as an important paradigm for training machine learning models in different domains. For graph-level tasks such as graph classification, graphs can also be regarded as a special type of data samples, which can be collected and stored in separate local systems. Similar to other domains, multiple local systems, each holding a small set of graphs, may benefit from collaboratively training a powerful graph mining model, such as the popular graph neural networks (GNNs). To provide more motivation towards such endeavors, we analyze real-world graphs from different domai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.13423","kind":"arxiv","version":5},"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/2106.13423/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":"2106.13423","created_at":"2026-07-05T03:29:50.379108+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.13423v5","created_at":"2026-07-05T03:29:50.379108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.13423","created_at":"2026-07-05T03:29:50.379108+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYVVBOB4GKHV","created_at":"2026-07-05T03:29:50.379108+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYVVBOB4GKHVPGBV","created_at":"2026-07-05T03:29:50.379108+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYVVBOB4","created_at":"2026-07-05T03:29:50.379108+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.12098","citing_title":"Federated Contrastive Learning of Graph-Level Representations","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CYVVBOB4GKHVPGBV75WQDV5M5A","json":"https://pith.science/pith/CYVVBOB4GKHVPGBV75WQDV5M5A.json","graph_json":"https://pith.science/api/pith-number/CYVVBOB4GKHVPGBV75WQDV5M5A/graph.json","events_json":"https://pith.science/api/pith-number/CYVVBOB4GKHVPGBV75WQDV5M5A/events.json","paper":"https://pith.science/paper/CYVVBOB4"},"agent_actions":{"view_html":"https://pith.science/pith/CYVVBOB4GKHVPGBV75WQDV5M5A","download_json":"https://pith.science/pith/CYVVBOB4GKHVPGBV75WQDV5M5A.json","view_paper":"https://pith.science/paper/CYVVBOB4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.13423&json=true","fetch_graph":"https://pith.science/api/pith-number/CYVVBOB4GKHVPGBV75WQDV5M5A/graph.json","fetch_events":"https://pith.science/api/pith-number/CYVVBOB4GKHVPGBV75WQDV5M5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYVVBOB4GKHVPGBV75WQDV5M5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYVVBOB4GKHVPGBV75WQDV5M5A/action/storage_attestation","attest_author":"https://pith.science/pith/CYVVBOB4GKHVPGBV75WQDV5M5A/action/author_attestation","sign_citation":"https://pith.science/pith/CYVVBOB4GKHVPGBV75WQDV5M5A/action/citation_signature","submit_replication":"https://pith.science/pith/CYVVBOB4GKHVPGBV75WQDV5M5A/action/replication_record"}},"created_at":"2026-07-05T03:29:50.379108+00:00","updated_at":"2026-07-05T03:29:50.379108+00:00"}