{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QFWG4VOR7VWVVGIFSYSRKZBBFK","short_pith_number":"pith:QFWG4VOR","schema_version":"1.0","canonical_sha256":"816c6e55d1fd6d5a990596251564212aa89dea90d98ed8e8658e276aa4af951d","source":{"kind":"arxiv","id":"1212.4093","version":5},"attestation_state":"computed","paper":{"title":"Co-clustering separately exchangeable network data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"David Choi, Patrick J. Wolfe","submitted_at":"2012-12-17T18:31:53Z","abstract_excerpt":"This article establishes the performance of stochastic blockmodels in addressing the co-clustering problem of partitioning a binary array into subsets, assuming only that the data are generated by a nonparametric process satisfying the condition of separate exchangeability. We provide oracle inequalities with rate of convergence $\\mathcal{O}_P(n^{-1/4})$ corresponding to profile likelihood maximization and mean-square error minimization, and show that the blockmodel can be interpreted in this setting as an optimal piecewise-constant approximation to the generative nonparametric model. We also "},"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":"1212.4093","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-12-17T18:31:53Z","cross_cats_sorted":["cs.SI","math.CO","stat.ML","stat.TH"],"title_canon_sha256":"5fb1f5101d845d36f770e6d206263117a1e9c1f24827dc9e46dcb44e8060b3d0","abstract_canon_sha256":"8e9f427f8a4ba0daa008c28b88130fe5e058caf3f0329afba14fa6c8f80faf1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:05.778410Z","signature_b64":"Ee2CVNbjudRT3Ga+a1Yf+gXgFN5+mf2D6baQG3hdQeQlJ+jh6SmjHkZ42Z8FjlPoflf4eFlqEBow/Ptwlf5oBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"816c6e55d1fd6d5a990596251564212aa89dea90d98ed8e8658e276aa4af951d","last_reissued_at":"2026-05-18T03:02:05.777826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:05.777826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Co-clustering separately exchangeable network data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"David Choi, Patrick J. Wolfe","submitted_at":"2012-12-17T18:31:53Z","abstract_excerpt":"This article establishes the performance of stochastic blockmodels in addressing the co-clustering problem of partitioning a binary array into subsets, assuming only that the data are generated by a nonparametric process satisfying the condition of separate exchangeability. We provide oracle inequalities with rate of convergence $\\mathcal{O}_P(n^{-1/4})$ corresponding to profile likelihood maximization and mean-square error minimization, and show that the blockmodel can be interpreted in this setting as an optimal piecewise-constant approximation to the generative nonparametric model. We also "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4093","kind":"arxiv","version":5},"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":"1212.4093","created_at":"2026-05-18T03:02:05.777906+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.4093v5","created_at":"2026-05-18T03:02:05.777906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4093","created_at":"2026-05-18T03:02:05.777906+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFWG4VOR7VWV","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFWG4VOR7VWVVGIF","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFWG4VOR","created_at":"2026-05-18T12:27:18.751474+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/QFWG4VOR7VWVVGIFSYSRKZBBFK","json":"https://pith.science/pith/QFWG4VOR7VWVVGIFSYSRKZBBFK.json","graph_json":"https://pith.science/api/pith-number/QFWG4VOR7VWVVGIFSYSRKZBBFK/graph.json","events_json":"https://pith.science/api/pith-number/QFWG4VOR7VWVVGIFSYSRKZBBFK/events.json","paper":"https://pith.science/paper/QFWG4VOR"},"agent_actions":{"view_html":"https://pith.science/pith/QFWG4VOR7VWVVGIFSYSRKZBBFK","download_json":"https://pith.science/pith/QFWG4VOR7VWVVGIFSYSRKZBBFK.json","view_paper":"https://pith.science/paper/QFWG4VOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.4093&json=true","fetch_graph":"https://pith.science/api/pith-number/QFWG4VOR7VWVVGIFSYSRKZBBFK/graph.json","fetch_events":"https://pith.science/api/pith-number/QFWG4VOR7VWVVGIFSYSRKZBBFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFWG4VOR7VWVVGIFSYSRKZBBFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFWG4VOR7VWVVGIFSYSRKZBBFK/action/storage_attestation","attest_author":"https://pith.science/pith/QFWG4VOR7VWVVGIFSYSRKZBBFK/action/author_attestation","sign_citation":"https://pith.science/pith/QFWG4VOR7VWVVGIFSYSRKZBBFK/action/citation_signature","submit_replication":"https://pith.science/pith/QFWG4VOR7VWVVGIFSYSRKZBBFK/action/replication_record"}},"created_at":"2026-05-18T03:02:05.777906+00:00","updated_at":"2026-05-18T03:02:05.777906+00:00"}