{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:T6YPJFGYGMGFL2R6IMLDXJ2LNR","short_pith_number":"pith:T6YPJFGY","schema_version":"1.0","canonical_sha256":"9fb0f494d8330c55ea3e43163ba74b6c7afc0a799344fd25a7bfe86e3c4f6a59","source":{"kind":"arxiv","id":"1811.12593","version":1},"attestation_state":"computed","paper":{"title":"Two-sample Test of Community Memberships of Weighted Stochastic Block Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Hongzhe Li, Yezheng Li","submitted_at":"2018-11-30T03:14:16Z","abstract_excerpt":"Suppose two networks are observed for the same set of nodes, where each network is assumed to be generated from a weighted stochastic block model. This paper considers the problem of testing whether the community memberships of the two networks are the same. A test statistic based on singular subspace distance is developed. Under the weighted stochastic block models with dense graphs, the limiting distribution of the proposed test statistic is developed. Simulation results show that the test has correct empirical type 1 errors under the dense graphs. The test also behaves as expected in empiri"},"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":"1811.12593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-11-30T03:14:16Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"b9c093a361a5869ee22f5bab2e58d94cdd954e2a1c678c6646637ffc0959bdee","abstract_canon_sha256":"5c2fea171e6a2646e7916482bfdba9ee88f5d919924211d785b06fb4a65e0759"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:29.136458Z","signature_b64":"0UczeKjC256y5+oCOpFoY7UZHkoB5U8PFV6z2UQQ4jGJ7IUzIHfZzyrwYmIfgI0RQkgzmOTw9JuwlpY9hdBSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fb0f494d8330c55ea3e43163ba74b6c7afc0a799344fd25a7bfe86e3c4f6a59","last_reissued_at":"2026-05-17T23:59:29.135828Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:29.135828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-sample Test of Community Memberships of Weighted Stochastic Block Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Hongzhe Li, Yezheng Li","submitted_at":"2018-11-30T03:14:16Z","abstract_excerpt":"Suppose two networks are observed for the same set of nodes, where each network is assumed to be generated from a weighted stochastic block model. This paper considers the problem of testing whether the community memberships of the two networks are the same. A test statistic based on singular subspace distance is developed. Under the weighted stochastic block models with dense graphs, the limiting distribution of the proposed test statistic is developed. Simulation results show that the test has correct empirical type 1 errors under the dense graphs. The test also behaves as expected in empiri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12593","kind":"arxiv","version":1},"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":"1811.12593","created_at":"2026-05-17T23:59:29.135934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.12593v1","created_at":"2026-05-17T23:59:29.135934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12593","created_at":"2026-05-17T23:59:29.135934+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6YPJFGYGMGF","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6YPJFGYGMGFL2R6","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6YPJFGY","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.17767","citing_title":"Feature Learning in Linear-Width Two-Layer Networks: Two vs. One Step of Gradient Descent","ref_index":177,"is_internal_anchor":true},{"citing_arxiv_id":"2409.01599","citing_title":"Multivariate Inference of Network Moments by Subsampling","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17767","citing_title":"Feature Learning in Linear-Width Two-Layer Networks: Two vs. One Step of Gradient Descent","ref_index":177,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T6YPJFGYGMGFL2R6IMLDXJ2LNR","json":"https://pith.science/pith/T6YPJFGYGMGFL2R6IMLDXJ2LNR.json","graph_json":"https://pith.science/api/pith-number/T6YPJFGYGMGFL2R6IMLDXJ2LNR/graph.json","events_json":"https://pith.science/api/pith-number/T6YPJFGYGMGFL2R6IMLDXJ2LNR/events.json","paper":"https://pith.science/paper/T6YPJFGY"},"agent_actions":{"view_html":"https://pith.science/pith/T6YPJFGYGMGFL2R6IMLDXJ2LNR","download_json":"https://pith.science/pith/T6YPJFGYGMGFL2R6IMLDXJ2LNR.json","view_paper":"https://pith.science/paper/T6YPJFGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.12593&json=true","fetch_graph":"https://pith.science/api/pith-number/T6YPJFGYGMGFL2R6IMLDXJ2LNR/graph.json","fetch_events":"https://pith.science/api/pith-number/T6YPJFGYGMGFL2R6IMLDXJ2LNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6YPJFGYGMGFL2R6IMLDXJ2LNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6YPJFGYGMGFL2R6IMLDXJ2LNR/action/storage_attestation","attest_author":"https://pith.science/pith/T6YPJFGYGMGFL2R6IMLDXJ2LNR/action/author_attestation","sign_citation":"https://pith.science/pith/T6YPJFGYGMGFL2R6IMLDXJ2LNR/action/citation_signature","submit_replication":"https://pith.science/pith/T6YPJFGYGMGFL2R6IMLDXJ2LNR/action/replication_record"}},"created_at":"2026-05-17T23:59:29.135934+00:00","updated_at":"2026-05-17T23:59:29.135934+00:00"}