{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WL67ZA65QWGCHSSG5MD35BA3F5","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":"a815e6b6d532789039354b59e4cf783a2aebe1053cc425f36678413cb3838b60","cross_cats_sorted":["cs.LG","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-04-07T04:19:11Z","title_canon_sha256":"2a4073995b97606222cd52bb46107236d2d6758ad95a2db15fe836f947fdbdc4"},"schema_version":"1.0","source":{"id":"1604.01871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01871","created_at":"2026-05-18T01:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01871v1","created_at":"2026-05-18T01:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01871","created_at":"2026-05-18T01:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"WL67ZA65QWGC","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WL67ZA65QWGCHSSG","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WL67ZA65","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:8033318676f1a574339b3bc816201c61bd511888405786c53264666d88316e6c","target":"graph","created_at":"2026-05-18T01:17:31Z","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":"Block graphons (also called stochastic block models) are an important and widely-studied class of models for random networks. We provide a lower bound on the accuracy of estimators for block graphons with a large number of blocks. We show that, given only the number $k$ of blocks and an upper bound $\\rho$ on the values (connection probabilities) of the graphon, every estimator incurs error at least on the order of $\\min(\\rho, \\sqrt{\\rho k^2/n^2})$ in the $\\delta_2$ metric with constant probability, in the worst case over graphons. In particular, our bound rules out any nontrivial estimation (t","authors_text":"Adam Smith, Audra McMillan","cross_cats":["cs.LG","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-04-07T04:19:11Z","title":"When is Nontrivial Estimation Possible for Graphons and Stochastic Block Models?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01871","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:94dc3c8b8754873f9fb49a821cab7c3ced6c551839022b36086ebc41e083eceb","target":"record","created_at":"2026-05-18T01:17:31Z","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":"a815e6b6d532789039354b59e4cf783a2aebe1053cc425f36678413cb3838b60","cross_cats_sorted":["cs.LG","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-04-07T04:19:11Z","title_canon_sha256":"2a4073995b97606222cd52bb46107236d2d6758ad95a2db15fe836f947fdbdc4"},"schema_version":"1.0","source":{"id":"1604.01871","kind":"arxiv","version":1}},"canonical_sha256":"b2fdfc83dd858c23ca46eb07be841b2f796a38042249438cb016bf0e6f617b54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2fdfc83dd858c23ca46eb07be841b2f796a38042249438cb016bf0e6f617b54","first_computed_at":"2026-05-18T01:17:31.873420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:31.873420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CZk0jrQbu6tfIDfcsRVwsMmhpqImn+3retDM6K6u4tmoOXjlS/N11qVc72XdoXXK4QXvC/8MrMs7NpPBHeHdDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:31.874240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94dc3c8b8754873f9fb49a821cab7c3ced6c551839022b36086ebc41e083eceb","sha256:8033318676f1a574339b3bc816201c61bd511888405786c53264666d88316e6c"],"state_sha256":"e207301aacce104957daa88719e3f44d73c51fc18e99706165f677f0a8ee73b1"}