{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:I333JUHT3LKTL55R2L3RHAPZK4","short_pith_number":"pith:I333JUHT","schema_version":"1.0","canonical_sha256":"46f7b4d0f3dad535f7b1d2f71381f95715cd934040283ec38014f38660b21850","source":{"kind":"arxiv","id":"1412.7335","version":1},"attestation_state":"computed","paper":{"title":"Accurate Community Detection in the Stochastic Block Model via Spectral Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Alexandre Proutiere, Se-Young Yun","submitted_at":"2014-12-23T12:12:48Z","abstract_excerpt":"We consider the problem of community detection in the Stochastic Block Model with a finite number $K$ of communities of sizes linearly growing with the network size $n$. This model consists in a random graph such that each pair of vertices is connected independently with probability $p$ within communities and $q$ across communities. One observes a realization of this random graph, and the objective is to reconstruct the communities from this observation. We show that under spectral algorithms, the number of misclassified vertices does not exceed $s$ with high probability as $n$ grows large, wh"},"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":"1412.7335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-12-23T12:12:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bf2f456e7eede0adbebcbaada11829e5a6dd9f1a2a2274ceb1c1b382b7e6ba63","abstract_canon_sha256":"f306292f32754d685ab7e1bc994a2db226fecdc95b78d7e86a64a2a56ce58322"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:39.121811Z","signature_b64":"CjEVfI5K795ToPLFiNECAYyr2mN6JaMGO6EamI22WluJ1nAkcroNI5f+J6xhRHXhQi5+C2NvhqZcwkphiTAbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46f7b4d0f3dad535f7b1d2f71381f95715cd934040283ec38014f38660b21850","last_reissued_at":"2026-05-18T02:30:39.121327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:39.121327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accurate Community Detection in the Stochastic Block Model via Spectral Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Alexandre Proutiere, Se-Young Yun","submitted_at":"2014-12-23T12:12:48Z","abstract_excerpt":"We consider the problem of community detection in the Stochastic Block Model with a finite number $K$ of communities of sizes linearly growing with the network size $n$. This model consists in a random graph such that each pair of vertices is connected independently with probability $p$ within communities and $q$ across communities. One observes a realization of this random graph, and the objective is to reconstruct the communities from this observation. We show that under spectral algorithms, the number of misclassified vertices does not exceed $s$ with high probability as $n$ grows large, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7335","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":"1412.7335","created_at":"2026-05-18T02:30:39.121400+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.7335v1","created_at":"2026-05-18T02:30:39.121400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7335","created_at":"2026-05-18T02:30:39.121400+00:00"},{"alias_kind":"pith_short_12","alias_value":"I333JUHT3LKT","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"I333JUHT3LKTL55R","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"I333JUHT","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2309.00578","citing_title":"Consistency of Lloyd's Algorithm Under Perturbations","ref_index":68,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I333JUHT3LKTL55R2L3RHAPZK4","json":"https://pith.science/pith/I333JUHT3LKTL55R2L3RHAPZK4.json","graph_json":"https://pith.science/api/pith-number/I333JUHT3LKTL55R2L3RHAPZK4/graph.json","events_json":"https://pith.science/api/pith-number/I333JUHT3LKTL55R2L3RHAPZK4/events.json","paper":"https://pith.science/paper/I333JUHT"},"agent_actions":{"view_html":"https://pith.science/pith/I333JUHT3LKTL55R2L3RHAPZK4","download_json":"https://pith.science/pith/I333JUHT3LKTL55R2L3RHAPZK4.json","view_paper":"https://pith.science/paper/I333JUHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.7335&json=true","fetch_graph":"https://pith.science/api/pith-number/I333JUHT3LKTL55R2L3RHAPZK4/graph.json","fetch_events":"https://pith.science/api/pith-number/I333JUHT3LKTL55R2L3RHAPZK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I333JUHT3LKTL55R2L3RHAPZK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I333JUHT3LKTL55R2L3RHAPZK4/action/storage_attestation","attest_author":"https://pith.science/pith/I333JUHT3LKTL55R2L3RHAPZK4/action/author_attestation","sign_citation":"https://pith.science/pith/I333JUHT3LKTL55R2L3RHAPZK4/action/citation_signature","submit_replication":"https://pith.science/pith/I333JUHT3LKTL55R2L3RHAPZK4/action/replication_record"}},"created_at":"2026-05-18T02:30:39.121400+00:00","updated_at":"2026-05-18T02:30:39.121400+00:00"}