{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GDADL6BJ576YPTWVWC4KTDQZQM","short_pith_number":"pith:GDADL6BJ","schema_version":"1.0","canonical_sha256":"30c035f829effd87ced5b0b8a98e1983329dce1a67f9d0ad3e071d23b6ebbc89","source":{"kind":"arxiv","id":"1803.03831","version":1},"attestation_state":"computed","paper":{"title":"Graph-based Clustering under Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Anne Morvan, C\\'edric Gouy-Pailler, Florian Yger, Jamal Atif, Rafael Pinot","submitted_at":"2018-03-10T16:26:47Z","abstract_excerpt":"In this paper, we present the first differentially private clustering method for arbitrary-shaped node clusters in a graph. This algorithm takes as input only an approximate Minimum Spanning Tree (MST) $\\mathcal{T}$ released under weight differential privacy constraints from the graph. Then, the underlying nonconvex clustering partition is successfully recovered from cutting optimal cuts on $\\mathcal{T}$. As opposed to existing methods, our algorithm is theoretically well-motivated. Experiments support our theoretical findings."},"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":"1803.03831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-10T16:26:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"99de453cdee60ef24a3ce0a117c137d7d9e1ec4b4ac875bb20d1f71b5d48becf","abstract_canon_sha256":"0e47ca57bcae0dafe04f45a1fc9a1b9cf34cecd83b4dbabb35eb0b42869d09c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:33.660854Z","signature_b64":"lDsYtmXtO9HmzJBRdWAREBJzw2XfI3hVA8q8kzAlss+Hk3oFtjWyHlYapyvHQTVF/Ny6pz0XmiKDwg2LabXXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30c035f829effd87ced5b0b8a98e1983329dce1a67f9d0ad3e071d23b6ebbc89","last_reissued_at":"2026-05-18T00:21:33.660327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:33.660327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-based Clustering under Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Anne Morvan, C\\'edric Gouy-Pailler, Florian Yger, Jamal Atif, Rafael Pinot","submitted_at":"2018-03-10T16:26:47Z","abstract_excerpt":"In this paper, we present the first differentially private clustering method for arbitrary-shaped node clusters in a graph. This algorithm takes as input only an approximate Minimum Spanning Tree (MST) $\\mathcal{T}$ released under weight differential privacy constraints from the graph. Then, the underlying nonconvex clustering partition is successfully recovered from cutting optimal cuts on $\\mathcal{T}$. As opposed to existing methods, our algorithm is theoretically well-motivated. Experiments support our theoretical findings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03831","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":""},"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":"1803.03831","created_at":"2026-05-18T00:21:33.660417+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03831v1","created_at":"2026-05-18T00:21:33.660417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03831","created_at":"2026-05-18T00:21:33.660417+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDADL6BJ576Y","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDADL6BJ576YPTWV","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDADL6BJ","created_at":"2026-05-18T12:32:25.280505+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/GDADL6BJ576YPTWVWC4KTDQZQM","json":"https://pith.science/pith/GDADL6BJ576YPTWVWC4KTDQZQM.json","graph_json":"https://pith.science/api/pith-number/GDADL6BJ576YPTWVWC4KTDQZQM/graph.json","events_json":"https://pith.science/api/pith-number/GDADL6BJ576YPTWVWC4KTDQZQM/events.json","paper":"https://pith.science/paper/GDADL6BJ"},"agent_actions":{"view_html":"https://pith.science/pith/GDADL6BJ576YPTWVWC4KTDQZQM","download_json":"https://pith.science/pith/GDADL6BJ576YPTWVWC4KTDQZQM.json","view_paper":"https://pith.science/paper/GDADL6BJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03831&json=true","fetch_graph":"https://pith.science/api/pith-number/GDADL6BJ576YPTWVWC4KTDQZQM/graph.json","fetch_events":"https://pith.science/api/pith-number/GDADL6BJ576YPTWVWC4KTDQZQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDADL6BJ576YPTWVWC4KTDQZQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDADL6BJ576YPTWVWC4KTDQZQM/action/storage_attestation","attest_author":"https://pith.science/pith/GDADL6BJ576YPTWVWC4KTDQZQM/action/author_attestation","sign_citation":"https://pith.science/pith/GDADL6BJ576YPTWVWC4KTDQZQM/action/citation_signature","submit_replication":"https://pith.science/pith/GDADL6BJ576YPTWVWC4KTDQZQM/action/replication_record"}},"created_at":"2026-05-18T00:21:33.660417+00:00","updated_at":"2026-05-18T00:21:33.660417+00:00"}