{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ZQVIY7NTOB4QGT4XIQX3RD2G37","short_pith_number":"pith:ZQVIY7NT","schema_version":"1.0","canonical_sha256":"cc2a8c7db37079034f97442fb88f46dfe0101c0ef8d8f3e342810c77fd661689","source":{"kind":"arxiv","id":"2201.09398","version":1},"attestation_state":"computed","paper":{"title":"Towards Private Learning on Decentralized Graphs with Local Differential Privacy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Baochun Li, Cong Wang, Wanyu Lin","submitted_at":"2022-01-23T23:20:56Z","abstract_excerpt":"Many real-world networks are inherently decentralized. For example, in social networks, each user maintains a local view of a social graph, such as a list of friends and her profile. It is typical to collect these local views of social graphs and conduct graph learning tasks. However, learning over graphs can raise privacy concerns as these local views often contain sensitive information.\n  In this paper, we seek to ensure private graph learning on a decentralized network graph. Towards this objective, we propose {\\em Solitude}, a new privacy-preserving learning framework based on graph neural"},"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":"2201.09398","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-23T23:20:56Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"caf31f48865af02dd43b4845971c279ab51a79931ca26b7e2c03d272e44b5b74","abstract_canon_sha256":"4bc9264d2266a5895abbc76524b68bebaacd96d378007348e1089a435e0ab9b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:50:57.177283Z","signature_b64":"/3yt9m533XwuAHgLtV2nwcTl7lis632csE+NtoHQQ59QKWBJNpWXmCixTL+sRx26fw5C4c0oOs2HvBqIUN3oCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc2a8c7db37079034f97442fb88f46dfe0101c0ef8d8f3e342810c77fd661689","last_reissued_at":"2026-07-05T03:50:57.176847Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:50:57.176847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Private Learning on Decentralized Graphs with Local Differential Privacy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Baochun Li, Cong Wang, Wanyu Lin","submitted_at":"2022-01-23T23:20:56Z","abstract_excerpt":"Many real-world networks are inherently decentralized. For example, in social networks, each user maintains a local view of a social graph, such as a list of friends and her profile. It is typical to collect these local views of social graphs and conduct graph learning tasks. However, learning over graphs can raise privacy concerns as these local views often contain sensitive information.\n  In this paper, we seek to ensure private graph learning on a decentralized network graph. Towards this objective, we propose {\\em Solitude}, a new privacy-preserving learning framework based on graph neural"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.09398","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/2201.09398/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":"2201.09398","created_at":"2026-07-05T03:50:57.176913+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.09398v1","created_at":"2026-07-05T03:50:57.176913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.09398","created_at":"2026-07-05T03:50:57.176913+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQVIY7NTOB4Q","created_at":"2026-07-05T03:50:57.176913+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQVIY7NTOB4QGT4X","created_at":"2026-07-05T03:50:57.176913+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQVIY7NT","created_at":"2026-07-05T03:50:57.176913+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZQVIY7NTOB4QGT4XIQX3RD2G37","json":"https://pith.science/pith/ZQVIY7NTOB4QGT4XIQX3RD2G37.json","graph_json":"https://pith.science/api/pith-number/ZQVIY7NTOB4QGT4XIQX3RD2G37/graph.json","events_json":"https://pith.science/api/pith-number/ZQVIY7NTOB4QGT4XIQX3RD2G37/events.json","paper":"https://pith.science/paper/ZQVIY7NT"},"agent_actions":{"view_html":"https://pith.science/pith/ZQVIY7NTOB4QGT4XIQX3RD2G37","download_json":"https://pith.science/pith/ZQVIY7NTOB4QGT4XIQX3RD2G37.json","view_paper":"https://pith.science/paper/ZQVIY7NT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.09398&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQVIY7NTOB4QGT4XIQX3RD2G37/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQVIY7NTOB4QGT4XIQX3RD2G37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQVIY7NTOB4QGT4XIQX3RD2G37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQVIY7NTOB4QGT4XIQX3RD2G37/action/storage_attestation","attest_author":"https://pith.science/pith/ZQVIY7NTOB4QGT4XIQX3RD2G37/action/author_attestation","sign_citation":"https://pith.science/pith/ZQVIY7NTOB4QGT4XIQX3RD2G37/action/citation_signature","submit_replication":"https://pith.science/pith/ZQVIY7NTOB4QGT4XIQX3RD2G37/action/replication_record"}},"created_at":"2026-07-05T03:50:57.176913+00:00","updated_at":"2026-07-05T03:50:57.176913+00:00"}