{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ECVUFHIYTTMK25FEF7NUSJZM3U","short_pith_number":"pith:ECVUFHIY","schema_version":"1.0","canonical_sha256":"20ab429d189cd8ad74a42fdb49272cdd39145edd1f595af15ff540b18733b667","source":{"kind":"arxiv","id":"2106.13430","version":6},"attestation_state":"computed","paper":{"title":"Subgraph Federated Learning with Missing Neighbor Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Carl Yang, Ke Zhang, Lichao Sun, Siu Ming Yiu, Xiaoxiao Li","submitted_at":"2021-06-25T04:58:55Z","abstract_excerpt":"Graphs have been widely used in data mining and machine learning due to their unique representation of real-world objects and their interactions. As graphs are getting bigger and bigger nowadays, it is common to see their subgraphs separately collected and stored in multiple local systems. Therefore, it is natural to consider the subgraph federated learning setting, where each local system holds a small subgraph that may be biased from the distribution of the whole graph. Hence, the subgraph federated learning aims to collaboratively train a powerful and generalizable graph mining model withou"},"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.13430","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-25T04:58:55Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"ad0b4d75e78f4d1fc08d75c062f65b39a7082e4560e2a4ad31886f2745960722","abstract_canon_sha256":"0d74aa01677802d09504235dc63f1c98a6545e80bd8ac86cb33ce8ce5b37eeb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:29:29.286569Z","signature_b64":"xKOvuVJrPpiXwF9crk4JbFNoxuVO7S+F89XRB6SQXAqnjMjYG8OgJ7mCANPNtyPtFDb1QqToWBXqBhhGta9yCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20ab429d189cd8ad74a42fdb49272cdd39145edd1f595af15ff540b18733b667","last_reissued_at":"2026-07-05T03:29:29.286050Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:29:29.286050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subgraph Federated Learning with Missing Neighbor Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Carl Yang, Ke Zhang, Lichao Sun, Siu Ming Yiu, Xiaoxiao Li","submitted_at":"2021-06-25T04:58:55Z","abstract_excerpt":"Graphs have been widely used in data mining and machine learning due to their unique representation of real-world objects and their interactions. As graphs are getting bigger and bigger nowadays, it is common to see their subgraphs separately collected and stored in multiple local systems. Therefore, it is natural to consider the subgraph federated learning setting, where each local system holds a small subgraph that may be biased from the distribution of the whole graph. Hence, the subgraph federated learning aims to collaboratively train a powerful and generalizable graph mining model withou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.13430","kind":"arxiv","version":6},"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.13430/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.13430","created_at":"2026-07-05T03:29:29.286121+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.13430v6","created_at":"2026-07-05T03:29:29.286121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.13430","created_at":"2026-07-05T03:29:29.286121+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECVUFHIYTTMK","created_at":"2026-07-05T03:29:29.286121+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECVUFHIYTTMK25FE","created_at":"2026-07-05T03:29:29.286121+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECVUFHIY","created_at":"2026-07-05T03:29:29.286121+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":56,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ECVUFHIYTTMK25FEF7NUSJZM3U","json":"https://pith.science/pith/ECVUFHIYTTMK25FEF7NUSJZM3U.json","graph_json":"https://pith.science/api/pith-number/ECVUFHIYTTMK25FEF7NUSJZM3U/graph.json","events_json":"https://pith.science/api/pith-number/ECVUFHIYTTMK25FEF7NUSJZM3U/events.json","paper":"https://pith.science/paper/ECVUFHIY"},"agent_actions":{"view_html":"https://pith.science/pith/ECVUFHIYTTMK25FEF7NUSJZM3U","download_json":"https://pith.science/pith/ECVUFHIYTTMK25FEF7NUSJZM3U.json","view_paper":"https://pith.science/paper/ECVUFHIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.13430&json=true","fetch_graph":"https://pith.science/api/pith-number/ECVUFHIYTTMK25FEF7NUSJZM3U/graph.json","fetch_events":"https://pith.science/api/pith-number/ECVUFHIYTTMK25FEF7NUSJZM3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECVUFHIYTTMK25FEF7NUSJZM3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECVUFHIYTTMK25FEF7NUSJZM3U/action/storage_attestation","attest_author":"https://pith.science/pith/ECVUFHIYTTMK25FEF7NUSJZM3U/action/author_attestation","sign_citation":"https://pith.science/pith/ECVUFHIYTTMK25FEF7NUSJZM3U/action/citation_signature","submit_replication":"https://pith.science/pith/ECVUFHIYTTMK25FEF7NUSJZM3U/action/replication_record"}},"created_at":"2026-07-05T03:29:29.286121+00:00","updated_at":"2026-07-05T03:29:29.286121+00:00"}