{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GVZ5HMU2Z2C333DVOSJF7A4MR3","short_pith_number":"pith:GVZ5HMU2","schema_version":"1.0","canonical_sha256":"3573d3b29ace85bdec7574925f838c8ed54403928fcb5344781218bd84810e31","source":{"kind":"arxiv","id":"1410.5837","version":3},"attestation_state":"computed","paper":{"title":"Rate-optimal graphon estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Chao Gao, Harrison H. Zhou, Yu Lu","submitted_at":"2014-10-21T20:03:15Z","abstract_excerpt":"Network analysis is becoming one of the most active research areas in statistics. Significant advances have been made recently on developing theories, methodologies and algorithms for analyzing networks. However, there has been little fundamental study on optimal estimation. In this paper, we establish optimal rate of convergence for graphon estimation. For the stochastic block model with $k$ clusters, we show that the optimal rate under the mean squared error is $n^{-1}\\log k+k^2/n^2$. The minimax upper bound improves the existing results in literature through a technique of solving a quadrat"},"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":"1410.5837","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-10-21T20:03:15Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"ef874d8e6f7438c19c9f3bec97a2309af9303ffa9e72fcb89c2ac5b4de67b53a","abstract_canon_sha256":"835597333d8e312bcd4b70a5029c222bd930a0b1c10d99cd03bf23ebf7557f04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:50.503018Z","signature_b64":"g9zA0wa6HAUBlrEDxQ0kb9jkD85yPOVE+C5/cgmsMtbbWdi+Jx7kgJ1ZIb2moL2haEwj8JH/rxKQhtpIbUd4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3573d3b29ace85bdec7574925f838c8ed54403928fcb5344781218bd84810e31","last_reissued_at":"2026-05-18T01:26:50.502228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:50.502228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate-optimal graphon estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Chao Gao, Harrison H. Zhou, Yu Lu","submitted_at":"2014-10-21T20:03:15Z","abstract_excerpt":"Network analysis is becoming one of the most active research areas in statistics. Significant advances have been made recently on developing theories, methodologies and algorithms for analyzing networks. However, there has been little fundamental study on optimal estimation. In this paper, we establish optimal rate of convergence for graphon estimation. For the stochastic block model with $k$ clusters, we show that the optimal rate under the mean squared error is $n^{-1}\\log k+k^2/n^2$. The minimax upper bound improves the existing results in literature through a technique of solving a quadrat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5837","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.5837","created_at":"2026-05-18T01:26:50.502371+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5837v3","created_at":"2026-05-18T01:26:50.502371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5837","created_at":"2026-05-18T01:26:50.502371+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVZ5HMU2Z2C3","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVZ5HMU2Z2C333DV","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVZ5HMU2","created_at":"2026-05-18T12:28:30.664211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3","json":"https://pith.science/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3.json","graph_json":"https://pith.science/api/pith-number/GVZ5HMU2Z2C333DVOSJF7A4MR3/graph.json","events_json":"https://pith.science/api/pith-number/GVZ5HMU2Z2C333DVOSJF7A4MR3/events.json","paper":"https://pith.science/paper/GVZ5HMU2"},"agent_actions":{"view_html":"https://pith.science/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3","download_json":"https://pith.science/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3.json","view_paper":"https://pith.science/paper/GVZ5HMU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5837&json=true","fetch_graph":"https://pith.science/api/pith-number/GVZ5HMU2Z2C333DVOSJF7A4MR3/graph.json","fetch_events":"https://pith.science/api/pith-number/GVZ5HMU2Z2C333DVOSJF7A4MR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3/action/storage_attestation","attest_author":"https://pith.science/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3/action/author_attestation","sign_citation":"https://pith.science/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3/action/citation_signature","submit_replication":"https://pith.science/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3/action/replication_record"}},"created_at":"2026-05-18T01:26:50.502371+00:00","updated_at":"2026-05-18T01:26:50.502371+00:00"}