{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DAKTDB7SWLGWMG4L45DWAVVGKH","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":"6a8e3166e1a2475315c751a0920c599ffa4088b71da281e9b149f232fa1987d2","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-01-19T14:45:06Z","title_canon_sha256":"cae03b112f87e61aacbc14d41a384f75d8c36d443976fd0af3ce0b16020a28c1"},"schema_version":"1.0","source":{"id":"1801.06423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06423","created_at":"2026-05-18T00:25:30Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06423v1","created_at":"2026-05-18T00:25:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06423","created_at":"2026-05-18T00:25:30Z"},{"alias_kind":"pith_short_12","alias_value":"DAKTDB7SWLGW","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DAKTDB7SWLGWMG4L","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DAKTDB7S","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:a86299dc739810c9bb0e138a368a71d238ad3b36ffd8a6eb556b147058c9657d","target":"graph","created_at":"2026-05-18T00:25:30Z","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":"We investigate the problem of nodes clustering under privacy constraints when representing a dataset as a graph. Our contribution is threefold. First we formally define the concept of differential privacy for structured databases such as graphs, and give an alternative definition based on a new neighborhood notion between graphs. This definition is adapted to particular frameworks that can be met in various application fields such as genomics, world wide web, population survey, etc. Second, we introduce a new algorithm to tackle the issue of privately releasing an approximated minimum spanning","authors_text":"Rafael Pinot","cross_cats":["math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-01-19T14:45:06Z","title":"Minimum spanning tree release under differential privacy constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06423","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:1f878bc5293ed73fc3d3045e6444bbdb8d76c94bc8192ede18a2839e7d232dcc","target":"record","created_at":"2026-05-18T00:25:30Z","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":"6a8e3166e1a2475315c751a0920c599ffa4088b71da281e9b149f232fa1987d2","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-01-19T14:45:06Z","title_canon_sha256":"cae03b112f87e61aacbc14d41a384f75d8c36d443976fd0af3ce0b16020a28c1"},"schema_version":"1.0","source":{"id":"1801.06423","kind":"arxiv","version":1}},"canonical_sha256":"18153187f2b2cd661b8be7476056a651f45f1255fd5bfd032e194b39eba12269","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18153187f2b2cd661b8be7476056a651f45f1255fd5bfd032e194b39eba12269","first_computed_at":"2026-05-18T00:25:30.191988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:30.191988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1iYso9gpggu77X+XpHTU6En2dfEvTDtx0KP/IoqaXWrYL+dMOC0cKvZ92MKZuVuEf7fYqo7GAAy+8GSYCaPLDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:30.192636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.06423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f878bc5293ed73fc3d3045e6444bbdb8d76c94bc8192ede18a2839e7d232dcc","sha256:a86299dc739810c9bb0e138a368a71d238ad3b36ffd8a6eb556b147058c9657d"],"state_sha256":"fbf20164851c9c69f7454956030a625c17fe4bbe4b24c9df259b0cf58a3a3c20"}