{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:R4E4GWHM4F6ZJDMIUPBBGPBPDF","short_pith_number":"pith:R4E4GWHM","schema_version":"1.0","canonical_sha256":"8f09c358ece17d948d88a3c2133c2f194fd0b70ddc7cfe23e89d352b9bfc361e","source":{"kind":"arxiv","id":"2204.12087","version":2},"attestation_state":"computed","paper":{"title":"Optimal Network Membership Estimation Under Severe Degree Heterogeneity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Jingming Wang, Zheng Tracy Ke","submitted_at":"2022-04-26T05:56:44Z","abstract_excerpt":"Real networks often have severe degree heterogeneity, with the maximum, average, and minimum node degrees differing significantly. This paper examines the impact of degree heterogeneity on statistical limits of network data analysis. Introducing the heterogeneity distribution (HD) under a degree-corrected mixed-membership network model, we show that the optimal rate of mixed membership estimation is an explicit functional of the HD. This result confirms that severe degree heterogeneity may decelerate the error rate, even when the overall sparsity remains unchanged.\n  To obtain a rate-optimal m"},"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":"2204.12087","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-04-26T05:56:44Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"429e5613d7746fe22cfcf09664607855a6181fe5bbc06b2a33f58c618526fb78","abstract_canon_sha256":"734aca02f05ebbec17f211f833e481d2af20551facc994eca7edfcac22f5f5cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:04.080108Z","signature_b64":"3VNoPcJbBPmlHv2DfO0EYIfz0WgrG+Nvo4Xo+2wzv1z1wlel1aIbuaNLeVu4t0m+rtm8aKet+w2nu4EFyd3pBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f09c358ece17d948d88a3c2133c2f194fd0b70ddc7cfe23e89d352b9bfc361e","last_reissued_at":"2026-07-05T08:47:04.079589Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:04.079589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Network Membership Estimation Under Severe Degree Heterogeneity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Jingming Wang, Zheng Tracy Ke","submitted_at":"2022-04-26T05:56:44Z","abstract_excerpt":"Real networks often have severe degree heterogeneity, with the maximum, average, and minimum node degrees differing significantly. This paper examines the impact of degree heterogeneity on statistical limits of network data analysis. Introducing the heterogeneity distribution (HD) under a degree-corrected mixed-membership network model, we show that the optimal rate of mixed membership estimation is an explicit functional of the HD. This result confirms that severe degree heterogeneity may decelerate the error rate, even when the overall sparsity remains unchanged.\n  To obtain a rate-optimal m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.12087","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/2204.12087/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":"2204.12087","created_at":"2026-07-05T08:47:04.079661+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.12087v2","created_at":"2026-07-05T08:47:04.079661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.12087","created_at":"2026-07-05T08:47:04.079661+00:00"},{"alias_kind":"pith_short_12","alias_value":"R4E4GWHM4F6Z","created_at":"2026-07-05T08:47:04.079661+00:00"},{"alias_kind":"pith_short_16","alias_value":"R4E4GWHM4F6ZJDMI","created_at":"2026-07-05T08:47:04.079661+00:00"},{"alias_kind":"pith_short_8","alias_value":"R4E4GWHM","created_at":"2026-07-05T08:47:04.079661+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08089","citing_title":"Bias-Corrected Multiplier Bootstrap Inference for Spectral Edges of Large Covariance Matrices","ref_index":61,"is_internal_anchor":true},{"citing_arxiv_id":"2411.11728","citing_title":"Davis-Kahan Theorem in the two-to-infinity norm and its application to perfect clustering","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R4E4GWHM4F6ZJDMIUPBBGPBPDF","json":"https://pith.science/pith/R4E4GWHM4F6ZJDMIUPBBGPBPDF.json","graph_json":"https://pith.science/api/pith-number/R4E4GWHM4F6ZJDMIUPBBGPBPDF/graph.json","events_json":"https://pith.science/api/pith-number/R4E4GWHM4F6ZJDMIUPBBGPBPDF/events.json","paper":"https://pith.science/paper/R4E4GWHM"},"agent_actions":{"view_html":"https://pith.science/pith/R4E4GWHM4F6ZJDMIUPBBGPBPDF","download_json":"https://pith.science/pith/R4E4GWHM4F6ZJDMIUPBBGPBPDF.json","view_paper":"https://pith.science/paper/R4E4GWHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.12087&json=true","fetch_graph":"https://pith.science/api/pith-number/R4E4GWHM4F6ZJDMIUPBBGPBPDF/graph.json","fetch_events":"https://pith.science/api/pith-number/R4E4GWHM4F6ZJDMIUPBBGPBPDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R4E4GWHM4F6ZJDMIUPBBGPBPDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R4E4GWHM4F6ZJDMIUPBBGPBPDF/action/storage_attestation","attest_author":"https://pith.science/pith/R4E4GWHM4F6ZJDMIUPBBGPBPDF/action/author_attestation","sign_citation":"https://pith.science/pith/R4E4GWHM4F6ZJDMIUPBBGPBPDF/action/citation_signature","submit_replication":"https://pith.science/pith/R4E4GWHM4F6ZJDMIUPBBGPBPDF/action/replication_record"}},"created_at":"2026-07-05T08:47:04.079661+00:00","updated_at":"2026-07-05T08:47:04.079661+00:00"}