{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GDADL6BJ576YPTWVWC4KTDQZQM","short_pith_number":"pith:GDADL6BJ","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"},"canonical_sha256":"30c035f829effd87ced5b0b8a98e1983329dce1a67f9d0ad3e071d23b6ebbc89","source":{"kind":"arxiv","id":"1803.03831","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03831","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03831v1","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03831","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"GDADL6BJ576Y","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GDADL6BJ576YPTWV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GDADL6BJ","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GDADL6BJ576YPTWVWC4KTDQZQM","target":"record","payload":{"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"},"canonical_sha256":"30c035f829effd87ced5b0b8a98e1983329dce1a67f9d0ad3e071d23b6ebbc89","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"},"source_kind":"arxiv","source_id":"1803.03831","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VM6PhywzwU9oJh7TDTY5Y/N3N1Zq7Nt5Uxzi8yYMGq2CPcIfdTfNR8xImY9iBzzBjdVJcugqr1zjAXDDmlHDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:21:25.488743Z"},"content_sha256":"7f9f957b875a0dc52af3035e5f504fa0cbd648c757a91a80009e29befcd9adb5","schema_version":"1.0","event_id":"sha256:7f9f957b875a0dc52af3035e5f504fa0cbd648c757a91a80009e29befcd9adb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GDADL6BJ576YPTWVWC4KTDQZQM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rnElQUxNsSympWe+BVXUq8P0orI/qrlpNXtcITksNbPHY0PFV6gHT2MIu2DwF04ZI2p26IL1q4M7fuS+tYtDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:21:25.489457Z"},"content_sha256":"d8f24d7096d0ff5fe7cab685108abcfb21f1224f11d0266bb3077809fed45900","schema_version":"1.0","event_id":"sha256:d8f24d7096d0ff5fe7cab685108abcfb21f1224f11d0266bb3077809fed45900"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GDADL6BJ576YPTWVWC4KTDQZQM/bundle.json","state_url":"https://pith.science/pith/GDADL6BJ576YPTWVWC4KTDQZQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GDADL6BJ576YPTWVWC4KTDQZQM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T21:21:25Z","links":{"resolver":"https://pith.science/pith/GDADL6BJ576YPTWVWC4KTDQZQM","bundle":"https://pith.science/pith/GDADL6BJ576YPTWVWC4KTDQZQM/bundle.json","state":"https://pith.science/pith/GDADL6BJ576YPTWVWC4KTDQZQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GDADL6BJ576YPTWVWC4KTDQZQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GDADL6BJ576YPTWVWC4KTDQZQM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0e47ca57bcae0dafe04f45a1fc9a1b9cf34cecd83b4dbabb35eb0b42869d09c7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-10T16:26:47Z","title_canon_sha256":"99de453cdee60ef24a3ce0a117c137d7d9e1ec4b4ac875bb20d1f71b5d48becf"},"schema_version":"1.0","source":{"id":"1803.03831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03831","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03831v1","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03831","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"GDADL6BJ576Y","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GDADL6BJ576YPTWV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GDADL6BJ","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:d8f24d7096d0ff5fe7cab685108abcfb21f1224f11d0266bb3077809fed45900","target":"graph","created_at":"2026-05-18T00:21:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Anne Morvan, C\\'edric Gouy-Pailler, Florian Yger, Jamal Atif, Rafael Pinot","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-10T16:26:47Z","title":"Graph-based Clustering under Differential Privacy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03831","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7f9f957b875a0dc52af3035e5f504fa0cbd648c757a91a80009e29befcd9adb5","target":"record","created_at":"2026-05-18T00:21:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0e47ca57bcae0dafe04f45a1fc9a1b9cf34cecd83b4dbabb35eb0b42869d09c7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-10T16:26:47Z","title_canon_sha256":"99de453cdee60ef24a3ce0a117c137d7d9e1ec4b4ac875bb20d1f71b5d48becf"},"schema_version":"1.0","source":{"id":"1803.03831","kind":"arxiv","version":1}},"canonical_sha256":"30c035f829effd87ced5b0b8a98e1983329dce1a67f9d0ad3e071d23b6ebbc89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30c035f829effd87ced5b0b8a98e1983329dce1a67f9d0ad3e071d23b6ebbc89","first_computed_at":"2026-05-18T00:21:33.660327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:33.660327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lDsYtmXtO9HmzJBRdWAREBJzw2XfI3hVA8q8kzAlss+Hk3oFtjWyHlYapyvHQTVF/Ny6pz0XmiKDwg2LabXXDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:33.660854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f9f957b875a0dc52af3035e5f504fa0cbd648c757a91a80009e29befcd9adb5","sha256:d8f24d7096d0ff5fe7cab685108abcfb21f1224f11d0266bb3077809fed45900"],"state_sha256":"fb4ab96a38fa86229bc403536355a6ab4f7157859f587648683f002dcc5ea48e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DbPZc/q9Xyg+tQsWUnVN/eXVB/2vGY3uwzwmGPimcbyG28x15DR0S07iFmKv2xBKiEBu1SdAt6LVisv2aRIRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:21:25.493352Z","bundle_sha256":"c945120ae93cd541064e0fb165620eec7de00af9abd0d60c779c2084b91754b4"}}