{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PHX445XD33TEA4JMEVRTFROTRF","short_pith_number":"pith:PHX445XD","schema_version":"1.0","canonical_sha256":"79efce76e3dee640712c256332c5d38972de6a08dff9dc6e2a909840b2b779a1","source":{"kind":"arxiv","id":"2202.00636","version":2},"attestation_state":"computed","paper":{"title":"Differentially Private Community Detection for Stochastic Block Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","cs.LG","math.IT"],"primary_cat":"cs.SI","authors_text":"Anil Vullikanti, Dung Nguyen, Mohamed Seif, Ravi Tandon","submitted_at":"2022-01-31T18:59:19Z","abstract_excerpt":"The goal of community detection over graphs is to recover underlying labels/attributes of users (e.g., political affiliation) given the connectivity between users (represented by adjacency matrix of a graph). There has been significant recent progress on understanding the fundamental limits of community detection when the graph is generated from a stochastic block model (SBM). Specifically, sharp information theoretic limits and efficient algorithms have been obtained for SBMs as a function of $p$ and $q$, which represent the intra-community and inter-community connection probabilities. In thi"},"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":"2202.00636","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2022-01-31T18:59:19Z","cross_cats_sorted":["cs.CR","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"f7654006d70d2298181c9233c832db91cf79db220fbc54e2d7b3f858171f94fa","abstract_canon_sha256":"b96075a4b742f9300c06ae99abf65904aafecc6470b0a74431d8b7002338041f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:42:15.719005Z","signature_b64":"fkAWqp98zRj4KaMrJnT4kV597GIRnP1pHBf/ecFBXKxAjp88NlxKC3FZpBtUcWL+aWbYaBhp+YbS+YHB2O5eBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79efce76e3dee640712c256332c5d38972de6a08dff9dc6e2a909840b2b779a1","last_reissued_at":"2026-07-05T06:42:15.718570Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:42:15.718570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentially Private Community Detection for Stochastic Block Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","cs.LG","math.IT"],"primary_cat":"cs.SI","authors_text":"Anil Vullikanti, Dung Nguyen, Mohamed Seif, Ravi Tandon","submitted_at":"2022-01-31T18:59:19Z","abstract_excerpt":"The goal of community detection over graphs is to recover underlying labels/attributes of users (e.g., political affiliation) given the connectivity between users (represented by adjacency matrix of a graph). There has been significant recent progress on understanding the fundamental limits of community detection when the graph is generated from a stochastic block model (SBM). Specifically, sharp information theoretic limits and efficient algorithms have been obtained for SBMs as a function of $p$ and $q$, which represent the intra-community and inter-community connection probabilities. In thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.00636","kind":"arxiv","version":2},"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/2202.00636/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":"2202.00636","created_at":"2026-07-05T06:42:15.718634+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.00636v2","created_at":"2026-07-05T06:42:15.718634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.00636","created_at":"2026-07-05T06:42:15.718634+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHX445XD33TE","created_at":"2026-07-05T06:42:15.718634+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHX445XD33TEA4JM","created_at":"2026-07-05T06:42:15.718634+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHX445XD","created_at":"2026-07-05T06:42:15.718634+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.20828","citing_title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","ref_index":78,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PHX445XD33TEA4JMEVRTFROTRF","json":"https://pith.science/pith/PHX445XD33TEA4JMEVRTFROTRF.json","graph_json":"https://pith.science/api/pith-number/PHX445XD33TEA4JMEVRTFROTRF/graph.json","events_json":"https://pith.science/api/pith-number/PHX445XD33TEA4JMEVRTFROTRF/events.json","paper":"https://pith.science/paper/PHX445XD"},"agent_actions":{"view_html":"https://pith.science/pith/PHX445XD33TEA4JMEVRTFROTRF","download_json":"https://pith.science/pith/PHX445XD33TEA4JMEVRTFROTRF.json","view_paper":"https://pith.science/paper/PHX445XD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.00636&json=true","fetch_graph":"https://pith.science/api/pith-number/PHX445XD33TEA4JMEVRTFROTRF/graph.json","fetch_events":"https://pith.science/api/pith-number/PHX445XD33TEA4JMEVRTFROTRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHX445XD33TEA4JMEVRTFROTRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHX445XD33TEA4JMEVRTFROTRF/action/storage_attestation","attest_author":"https://pith.science/pith/PHX445XD33TEA4JMEVRTFROTRF/action/author_attestation","sign_citation":"https://pith.science/pith/PHX445XD33TEA4JMEVRTFROTRF/action/citation_signature","submit_replication":"https://pith.science/pith/PHX445XD33TEA4JMEVRTFROTRF/action/replication_record"}},"created_at":"2026-07-05T06:42:15.718634+00:00","updated_at":"2026-07-05T06:42:15.718634+00:00"}