{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RLDSDNNDTK4TQE35OPNT7W4PF6","short_pith_number":"pith:RLDSDNND","canonical_record":{"source":{"id":"1810.02183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-10-04T13:00:27Z","cross_cats_sorted":["cs.CR","cs.DS","math.PR","stat.TH"],"title_canon_sha256":"3a2bf66a7b2e128e1cecd25e739f193e990b3384b701fe604b88f5d65b0556cb","abstract_canon_sha256":"c81ba0db3a22cfd92c3a2cd7c5541e55309c7bd11061ca7683cab614cb69c19d"},"schema_version":"1.0"},"canonical_sha256":"8ac721b5a39ab938137d73db3fdb8f2f9f1d198fe0f7f0b97c4bafa6cc2eb74d","source":{"kind":"arxiv","id":"1810.02183","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02183","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02183v1","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02183","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"RLDSDNNDTK4T","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RLDSDNNDTK4TQE35","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RLDSDNND","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RLDSDNNDTK4TQE35OPNT7W4PF6","target":"record","payload":{"canonical_record":{"source":{"id":"1810.02183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-10-04T13:00:27Z","cross_cats_sorted":["cs.CR","cs.DS","math.PR","stat.TH"],"title_canon_sha256":"3a2bf66a7b2e128e1cecd25e739f193e990b3384b701fe604b88f5d65b0556cb","abstract_canon_sha256":"c81ba0db3a22cfd92c3a2cd7c5541e55309c7bd11061ca7683cab614cb69c19d"},"schema_version":"1.0"},"canonical_sha256":"8ac721b5a39ab938137d73db3fdb8f2f9f1d198fe0f7f0b97c4bafa6cc2eb74d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:06.014250Z","signature_b64":"lW3OTSYLrVwsXD/xUcH0GHNaSyLYNQkx8AA88HA1Z4KFyQZ9Sl0XjzhVwqUxwsefbNoxx1ImbK3G6VnS2e0SCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ac721b5a39ab938137d73db3fdb8f2f9f1d198fe0f7f0b97c4bafa6cc2eb74d","last_reissued_at":"2026-05-18T00:04:06.013697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:06.013697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.02183","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:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HWlwwO1poGXIoCELAaRQJz7bgcxro2bmU3AKUDnzR9rirk+u2YhXc4cYXEmhGElM9fqyFCb3Uce24GY1NwyQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:12:06.050340Z"},"content_sha256":"263df4113c116d9530db5674f913b8e4f5d259407273aa6567835f18b228025e","schema_version":"1.0","event_id":"sha256:263df4113c116d9530db5674f913b8e4f5d259407273aa6567835f18b228025e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RLDSDNNDTK4TQE35OPNT7W4PF6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Adam Smith, Christian Borgs, Ilias Zadik, Jennifer Chayes","submitted_at":"2018-10-04T13:00:27Z","abstract_excerpt":"Motivated by growing concerns over ensuring privacy on social networks, we develop new algorithms and impossibility results for fitting complex statistical models to network data subject to rigorous privacy guarantees. We consider the so-called node-differentially private algorithms, which compute information about a graph or network while provably revealing almost no information about the presence or absence of a particular node in the graph.\n  We provide new algorithms for node-differentially private estimation for a popular and expressive family of network models: stochastic block models an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02183","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:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pA8uaUkgAS6hTx46tQJ2p4ugUrKM7j++Xd0TRuvdWk0tgYOYtC8kZkqtZr52pVZ2fSDA90PjckGZ+8F793ZUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:12:06.051044Z"},"content_sha256":"9a927e7536ea9d41bf3d555dfa74e66843e61704ac81639a049d42be62dcc18c","schema_version":"1.0","event_id":"sha256:9a927e7536ea9d41bf3d555dfa74e66843e61704ac81639a049d42be62dcc18c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLDSDNNDTK4TQE35OPNT7W4PF6/bundle.json","state_url":"https://pith.science/pith/RLDSDNNDTK4TQE35OPNT7W4PF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLDSDNNDTK4TQE35OPNT7W4PF6/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-29T15:12:06Z","links":{"resolver":"https://pith.science/pith/RLDSDNNDTK4TQE35OPNT7W4PF6","bundle":"https://pith.science/pith/RLDSDNNDTK4TQE35OPNT7W4PF6/bundle.json","state":"https://pith.science/pith/RLDSDNNDTK4TQE35OPNT7W4PF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLDSDNNDTK4TQE35OPNT7W4PF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RLDSDNNDTK4TQE35OPNT7W4PF6","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":"c81ba0db3a22cfd92c3a2cd7c5541e55309c7bd11061ca7683cab614cb69c19d","cross_cats_sorted":["cs.CR","cs.DS","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-10-04T13:00:27Z","title_canon_sha256":"3a2bf66a7b2e128e1cecd25e739f193e990b3384b701fe604b88f5d65b0556cb"},"schema_version":"1.0","source":{"id":"1810.02183","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02183","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02183v1","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02183","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"RLDSDNNDTK4T","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RLDSDNNDTK4TQE35","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RLDSDNND","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:9a927e7536ea9d41bf3d555dfa74e66843e61704ac81639a049d42be62dcc18c","target":"graph","created_at":"2026-05-18T00:04:06Z","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":"Motivated by growing concerns over ensuring privacy on social networks, we develop new algorithms and impossibility results for fitting complex statistical models to network data subject to rigorous privacy guarantees. We consider the so-called node-differentially private algorithms, which compute information about a graph or network while provably revealing almost no information about the presence or absence of a particular node in the graph.\n  We provide new algorithms for node-differentially private estimation for a popular and expressive family of network models: stochastic block models an","authors_text":"Adam Smith, Christian Borgs, Ilias Zadik, Jennifer Chayes","cross_cats":["cs.CR","cs.DS","math.PR","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-10-04T13:00:27Z","title":"Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02183","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:263df4113c116d9530db5674f913b8e4f5d259407273aa6567835f18b228025e","target":"record","created_at":"2026-05-18T00:04:06Z","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":"c81ba0db3a22cfd92c3a2cd7c5541e55309c7bd11061ca7683cab614cb69c19d","cross_cats_sorted":["cs.CR","cs.DS","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-10-04T13:00:27Z","title_canon_sha256":"3a2bf66a7b2e128e1cecd25e739f193e990b3384b701fe604b88f5d65b0556cb"},"schema_version":"1.0","source":{"id":"1810.02183","kind":"arxiv","version":1}},"canonical_sha256":"8ac721b5a39ab938137d73db3fdb8f2f9f1d198fe0f7f0b97c4bafa6cc2eb74d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ac721b5a39ab938137d73db3fdb8f2f9f1d198fe0f7f0b97c4bafa6cc2eb74d","first_computed_at":"2026-05-18T00:04:06.013697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:06.013697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lW3OTSYLrVwsXD/xUcH0GHNaSyLYNQkx8AA88HA1Z4KFyQZ9Sl0XjzhVwqUxwsefbNoxx1ImbK3G6VnS2e0SCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:06.014250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02183","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:263df4113c116d9530db5674f913b8e4f5d259407273aa6567835f18b228025e","sha256:9a927e7536ea9d41bf3d555dfa74e66843e61704ac81639a049d42be62dcc18c"],"state_sha256":"39d99546e0831e04262ca0aac137c17fa6ec5d19dc304a95bb9c72241426072f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s6tBVGxYliOsSDWD5ZzytXvvcykBxNLz4bwtF1b1ohaeCmYXfK5XqgqBL1rmFRFtjgst5K84uKbhGUl4Stc6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:12:06.054633Z","bundle_sha256":"29b6e435fcbd28cb256e5d0ebdf1c798e6980ae47a4ecb0f31836d8cd6c37ae8"}}