{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HWWRGPZRWLZPF7GBRUKOGFSKMT","short_pith_number":"pith:HWWRGPZR","schema_version":"1.0","canonical_sha256":"3dad133f31b2f2f2fcc18d14e3164a64fa1bbba5ea86abdf16945c795583389b","source":{"kind":"arxiv","id":"1503.02115","version":5},"attestation_state":"computed","paper":{"title":"Community Detection and Classification in Hierarchical Stochastic Blockmodels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ML","authors_text":"Avanti Athreya, Carey E. Priebe, Minh Tang, Vince Lyzinski, Youngser Park","submitted_at":"2015-03-07T01:40:25Z","abstract_excerpt":"We propose a robust, scalable, integrated methodology for community detection and community comparison in graphs. In our procedure, we first embed a graph into an appropriate Euclidean space to obtain a low-dimensional representation, and then cluster the vertices into communities. We next employ nonparametric graph inference techniques to identify structural similarity among these communities. These two steps are then applied recursively on the communities, allowing us to detect more fine-grained structure. We describe a hierarchical stochastic blockmodel---namely, a stochastic blockmodel wit"},"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":"1503.02115","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-07T01:40:25Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"e81797d1af4fbd16941e1fd2a03e24ee83d1a7b40c7387a1ccc33aa2227bd95c","abstract_canon_sha256":"7b2c57706f7491325b72e9ef8d5f69e2d2b53267b505972c8d998a08f71d7882"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:54.173476Z","signature_b64":"n69OGc7r8jwcIYBV0UisSMLSRCvWG4B6vcZH9Dz4QWzCtULv5CqIoKlhttxgDVUHLhnvsBnWYWD2xuVei6V6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dad133f31b2f2f2fcc18d14e3164a64fa1bbba5ea86abdf16945c795583389b","last_reissued_at":"2026-05-18T01:07:54.172839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:54.172839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Community Detection and Classification in Hierarchical Stochastic Blockmodels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ML","authors_text":"Avanti Athreya, Carey E. Priebe, Minh Tang, Vince Lyzinski, Youngser Park","submitted_at":"2015-03-07T01:40:25Z","abstract_excerpt":"We propose a robust, scalable, integrated methodology for community detection and community comparison in graphs. In our procedure, we first embed a graph into an appropriate Euclidean space to obtain a low-dimensional representation, and then cluster the vertices into communities. We next employ nonparametric graph inference techniques to identify structural similarity among these communities. These two steps are then applied recursively on the communities, allowing us to detect more fine-grained structure. We describe a hierarchical stochastic blockmodel---namely, a stochastic blockmodel wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02115","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":"1503.02115","created_at":"2026-05-18T01:07:54.172931+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02115v5","created_at":"2026-05-18T01:07:54.172931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02115","created_at":"2026-05-18T01:07:54.172931+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWWRGPZRWLZP","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWWRGPZRWLZPF7GB","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWWRGPZR","created_at":"2026-05-18T12:29:25.134429+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/HWWRGPZRWLZPF7GBRUKOGFSKMT","json":"https://pith.science/pith/HWWRGPZRWLZPF7GBRUKOGFSKMT.json","graph_json":"https://pith.science/api/pith-number/HWWRGPZRWLZPF7GBRUKOGFSKMT/graph.json","events_json":"https://pith.science/api/pith-number/HWWRGPZRWLZPF7GBRUKOGFSKMT/events.json","paper":"https://pith.science/paper/HWWRGPZR"},"agent_actions":{"view_html":"https://pith.science/pith/HWWRGPZRWLZPF7GBRUKOGFSKMT","download_json":"https://pith.science/pith/HWWRGPZRWLZPF7GBRUKOGFSKMT.json","view_paper":"https://pith.science/paper/HWWRGPZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02115&json=true","fetch_graph":"https://pith.science/api/pith-number/HWWRGPZRWLZPF7GBRUKOGFSKMT/graph.json","fetch_events":"https://pith.science/api/pith-number/HWWRGPZRWLZPF7GBRUKOGFSKMT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWWRGPZRWLZPF7GBRUKOGFSKMT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWWRGPZRWLZPF7GBRUKOGFSKMT/action/storage_attestation","attest_author":"https://pith.science/pith/HWWRGPZRWLZPF7GBRUKOGFSKMT/action/author_attestation","sign_citation":"https://pith.science/pith/HWWRGPZRWLZPF7GBRUKOGFSKMT/action/citation_signature","submit_replication":"https://pith.science/pith/HWWRGPZRWLZPF7GBRUKOGFSKMT/action/replication_record"}},"created_at":"2026-05-18T01:07:54.172931+00:00","updated_at":"2026-05-18T01:07:54.172931+00:00"}