{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GVZ5HMU2Z2C333DVOSJF7A4MR3","short_pith_number":"pith:GVZ5HMU2","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"},"canonical_sha256":"3573d3b29ace85bdec7574925f838c8ed54403928fcb5344781218bd84810e31","source":{"kind":"arxiv","id":"1410.5837","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5837","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5837v3","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5837","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"pith_short_12","alias_value":"GVZ5HMU2Z2C3","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GVZ5HMU2Z2C333DV","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GVZ5HMU2","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GVZ5HMU2Z2C333DVOSJF7A4MR3","target":"record","payload":{"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"},"canonical_sha256":"3573d3b29ace85bdec7574925f838c8ed54403928fcb5344781218bd84810e31","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"},"source_kind":"arxiv","source_id":"1410.5837","source_version":3,"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-18T01:26:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAjJkDJJY6vilg5Euj6ebqihbydQ8dldtpuhHy5QFvMfwl/r91D7V54ipyIBuidijb1bvwn+YNLf5mMFTpOwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:39:10.121910Z"},"content_sha256":"22a205a875a53fa79aa271d4341751834d9d94604d5d461ebc679dbc8f69f84d","schema_version":"1.0","event_id":"sha256:22a205a875a53fa79aa271d4341751834d9d94604d5d461ebc679dbc8f69f84d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GVZ5HMU2Z2C333DVOSJF7A4MR3","target":"graph","payload":{"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"},"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-18T01:26:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Os8n+drrW3MePp27vu9oTSkV0Imcb4mq3U7a2lpLSRh9eJCzpA+g7MUceLP7S8h4khCJzBGw7aZ7st/bAn4JCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:39:10.122468Z"},"content_sha256":"a836248062be51f1698374b60539cc82e1098bcde2d0a0882b5fa15349d089ff","schema_version":"1.0","event_id":"sha256:a836248062be51f1698374b60539cc82e1098bcde2d0a0882b5fa15349d089ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3/bundle.json","state_url":"https://pith.science/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3/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-06-06T20:39:10Z","links":{"resolver":"https://pith.science/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3","bundle":"https://pith.science/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3/bundle.json","state":"https://pith.science/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVZ5HMU2Z2C333DVOSJF7A4MR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GVZ5HMU2Z2C333DVOSJF7A4MR3","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":"835597333d8e312bcd4b70a5029c222bd930a0b1c10d99cd03bf23ebf7557f04","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-10-21T20:03:15Z","title_canon_sha256":"ef874d8e6f7438c19c9f3bec97a2309af9303ffa9e72fcb89c2ac5b4de67b53a"},"schema_version":"1.0","source":{"id":"1410.5837","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5837","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5837v3","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5837","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"pith_short_12","alias_value":"GVZ5HMU2Z2C3","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GVZ5HMU2Z2C333DV","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GVZ5HMU2","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:a836248062be51f1698374b60539cc82e1098bcde2d0a0882b5fa15349d089ff","target":"graph","created_at":"2026-05-18T01:26:50Z","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":"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","authors_text":"Chao Gao, Harrison H. Zhou, Yu Lu","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-10-21T20:03:15Z","title":"Rate-optimal graphon estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5837","kind":"arxiv","version":3},"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:22a205a875a53fa79aa271d4341751834d9d94604d5d461ebc679dbc8f69f84d","target":"record","created_at":"2026-05-18T01:26:50Z","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":"835597333d8e312bcd4b70a5029c222bd930a0b1c10d99cd03bf23ebf7557f04","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-10-21T20:03:15Z","title_canon_sha256":"ef874d8e6f7438c19c9f3bec97a2309af9303ffa9e72fcb89c2ac5b4de67b53a"},"schema_version":"1.0","source":{"id":"1410.5837","kind":"arxiv","version":3}},"canonical_sha256":"3573d3b29ace85bdec7574925f838c8ed54403928fcb5344781218bd84810e31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3573d3b29ace85bdec7574925f838c8ed54403928fcb5344781218bd84810e31","first_computed_at":"2026-05-18T01:26:50.502228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:50.502228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g9zA0wa6HAUBlrEDxQ0kb9jkD85yPOVE+C5/cgmsMtbbWdi+Jx7kgJ1ZIb2moL2haEwj8JH/rxKQhtpIbUd4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:50.503018Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5837","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22a205a875a53fa79aa271d4341751834d9d94604d5d461ebc679dbc8f69f84d","sha256:a836248062be51f1698374b60539cc82e1098bcde2d0a0882b5fa15349d089ff"],"state_sha256":"966bc9260c2d53d0195372c93595e5861fb3f760ad5d3ddc5a8feb11b4eeb925"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"umvOaNEi5NWn3GTQrr/EUVmG13nF62y9IOfkvPVvF8paYEc/WezYqED/nlBjG5dZW4eMNXKr3v4mlzpTz+LNBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:39:10.125447Z","bundle_sha256":"897bb011b96bf25aeb7acc0ff4ea5c09b9b56ee0a68e8343e29b5a4defd5fdcf"}}