{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:M6GG7MI7TDBLRN3NWP7LWJZZE4","short_pith_number":"pith:M6GG7MI7","schema_version":"1.0","canonical_sha256":"678c6fb11f98c2b8b76db3febb273927257e84b23aaf2c53db5dab91bfb49e90","source":{"kind":"arxiv","id":"2006.05535","version":9},"attestation_state":"computed","paper":{"title":"Locally Private Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Gatica-Perez, Sina Sajadmanesh","submitted_at":"2020-06-09T22:36:06Z","abstract_excerpt":"Graph Neural Networks (GNNs) have demonstrated superior performance in learning node representations for various graph inference tasks. However, learning over graph data can raise privacy concerns when nodes represent people or human-related variables that involve sensitive or personal information. While numerous techniques have been proposed for privacy-preserving deep learning over non-relational data, there is less work addressing the privacy issues pertained to applying deep learning algorithms on graphs. In this paper, we study the problem of node data privacy, where graph nodes have pote"},"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":"2006.05535","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-09T22:36:06Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"05db35569a73d966a717c6a1224b2bbf70463e870cd19bb73beab9ee89ac478b","abstract_canon_sha256":"962973fb7a776b2542de30cae635777409199cd45718a8f123a2a4f73f7a0972"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:55:51.918435Z","signature_b64":"c2FyMUVLQcrPAWocMH0QUmnSbG5kP49Ww7NXr2DCZlt4lAAHYltmCaLCoaliEjw/87tQqYy4KB5sI94Qq4w/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"678c6fb11f98c2b8b76db3febb273927257e84b23aaf2c53db5dab91bfb49e90","last_reissued_at":"2026-07-05T02:55:51.918046Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:55:51.918046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locally Private Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Gatica-Perez, Sina Sajadmanesh","submitted_at":"2020-06-09T22:36:06Z","abstract_excerpt":"Graph Neural Networks (GNNs) have demonstrated superior performance in learning node representations for various graph inference tasks. However, learning over graph data can raise privacy concerns when nodes represent people or human-related variables that involve sensitive or personal information. While numerous techniques have been proposed for privacy-preserving deep learning over non-relational data, there is less work addressing the privacy issues pertained to applying deep learning algorithms on graphs. In this paper, we study the problem of node data privacy, where graph nodes have pote"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.05535","kind":"arxiv","version":9},"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/2006.05535/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":"2006.05535","created_at":"2026-07-05T02:55:51.918100+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.05535v9","created_at":"2026-07-05T02:55:51.918100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.05535","created_at":"2026-07-05T02:55:51.918100+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6GG7MI7TDBL","created_at":"2026-07-05T02:55:51.918100+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6GG7MI7TDBLRN3N","created_at":"2026-07-05T02:55:51.918100+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6GG7MI7","created_at":"2026-07-05T02:55:51.918100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.16541","citing_title":"A Comprehensive Data-centric Overview of Federated Graph Learning","ref_index":64,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M6GG7MI7TDBLRN3NWP7LWJZZE4","json":"https://pith.science/pith/M6GG7MI7TDBLRN3NWP7LWJZZE4.json","graph_json":"https://pith.science/api/pith-number/M6GG7MI7TDBLRN3NWP7LWJZZE4/graph.json","events_json":"https://pith.science/api/pith-number/M6GG7MI7TDBLRN3NWP7LWJZZE4/events.json","paper":"https://pith.science/paper/M6GG7MI7"},"agent_actions":{"view_html":"https://pith.science/pith/M6GG7MI7TDBLRN3NWP7LWJZZE4","download_json":"https://pith.science/pith/M6GG7MI7TDBLRN3NWP7LWJZZE4.json","view_paper":"https://pith.science/paper/M6GG7MI7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.05535&json=true","fetch_graph":"https://pith.science/api/pith-number/M6GG7MI7TDBLRN3NWP7LWJZZE4/graph.json","fetch_events":"https://pith.science/api/pith-number/M6GG7MI7TDBLRN3NWP7LWJZZE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6GG7MI7TDBLRN3NWP7LWJZZE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6GG7MI7TDBLRN3NWP7LWJZZE4/action/storage_attestation","attest_author":"https://pith.science/pith/M6GG7MI7TDBLRN3NWP7LWJZZE4/action/author_attestation","sign_citation":"https://pith.science/pith/M6GG7MI7TDBLRN3NWP7LWJZZE4/action/citation_signature","submit_replication":"https://pith.science/pith/M6GG7MI7TDBLRN3NWP7LWJZZE4/action/replication_record"}},"created_at":"2026-07-05T02:55:51.918100+00:00","updated_at":"2026-07-05T02:55:51.918100+00:00"}