{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VE4ES2ZMIICHQX6U2A5FVRKHHK","short_pith_number":"pith:VE4ES2ZM","schema_version":"1.0","canonical_sha256":"a938496b2c4204785fd4d03a5ac5473aa10b0b4228db4599aa951d092fdc77b3","source":{"kind":"arxiv","id":"1404.6000","version":4},"attestation_state":"computed","paper":{"title":"Robust and computationally feasible community detection in the presence of arbitrary outlier nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"T. Tony Cai, Xiaodong Li","submitted_at":"2014-04-23T23:36:19Z","abstract_excerpt":"Community detection, which aims to cluster $N$ nodes in a given graph into $r$ distinct groups based on the observed undirected edges, is an important problem in network data analysis. In this paper, the popular stochastic block model (SBM) is extended to the generalized stochastic block model (GSBM) that allows for adversarial outlier nodes, which are connected with the other nodes in the graph in an arbitrary way. Under this model, we introduce a procedure using convex optimization followed by $k$-means algorithm with $k=r$. Both theoretical and numerical properties of the method are analyze"},"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":"1404.6000","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-04-23T23:36:19Z","cross_cats_sorted":["cs.IT","math.IT","math.OC","stat.ML","stat.TH"],"title_canon_sha256":"329f31913e698b213da5597003a18772c6e0c1538ec3b5eb537f3bce9a3bda8f","abstract_canon_sha256":"301b78d07d65381416839be735bb4c9218415ba03bda7b3effe41bdebc7b8ff3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:27.323247Z","signature_b64":"6L5E7EUzlbn9bxsYbjDnr8DzmLh7XLwHeShywGOr/RXovVDr5rdKnLXGDobRTKGFqi6PorKmR0HpCXWdOfglDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a938496b2c4204785fd4d03a5ac5473aa10b0b4228db4599aa951d092fdc77b3","last_reissued_at":"2026-05-18T01:58:27.322681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:27.322681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust and computationally feasible community detection in the presence of arbitrary outlier nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"T. Tony Cai, Xiaodong Li","submitted_at":"2014-04-23T23:36:19Z","abstract_excerpt":"Community detection, which aims to cluster $N$ nodes in a given graph into $r$ distinct groups based on the observed undirected edges, is an important problem in network data analysis. In this paper, the popular stochastic block model (SBM) is extended to the generalized stochastic block model (GSBM) that allows for adversarial outlier nodes, which are connected with the other nodes in the graph in an arbitrary way. Under this model, we introduce a procedure using convex optimization followed by $k$-means algorithm with $k=r$. Both theoretical and numerical properties of the method are analyze"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6000","kind":"arxiv","version":4},"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":"1404.6000","created_at":"2026-05-18T01:58:27.322791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6000v4","created_at":"2026-05-18T01:58:27.322791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6000","created_at":"2026-05-18T01:58:27.322791+00:00"},{"alias_kind":"pith_short_12","alias_value":"VE4ES2ZMIICH","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"VE4ES2ZMIICHQX6U","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"VE4ES2ZM","created_at":"2026-05-18T12:28:52.271510+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/VE4ES2ZMIICHQX6U2A5FVRKHHK","json":"https://pith.science/pith/VE4ES2ZMIICHQX6U2A5FVRKHHK.json","graph_json":"https://pith.science/api/pith-number/VE4ES2ZMIICHQX6U2A5FVRKHHK/graph.json","events_json":"https://pith.science/api/pith-number/VE4ES2ZMIICHQX6U2A5FVRKHHK/events.json","paper":"https://pith.science/paper/VE4ES2ZM"},"agent_actions":{"view_html":"https://pith.science/pith/VE4ES2ZMIICHQX6U2A5FVRKHHK","download_json":"https://pith.science/pith/VE4ES2ZMIICHQX6U2A5FVRKHHK.json","view_paper":"https://pith.science/paper/VE4ES2ZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6000&json=true","fetch_graph":"https://pith.science/api/pith-number/VE4ES2ZMIICHQX6U2A5FVRKHHK/graph.json","fetch_events":"https://pith.science/api/pith-number/VE4ES2ZMIICHQX6U2A5FVRKHHK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VE4ES2ZMIICHQX6U2A5FVRKHHK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VE4ES2ZMIICHQX6U2A5FVRKHHK/action/storage_attestation","attest_author":"https://pith.science/pith/VE4ES2ZMIICHQX6U2A5FVRKHHK/action/author_attestation","sign_citation":"https://pith.science/pith/VE4ES2ZMIICHQX6U2A5FVRKHHK/action/citation_signature","submit_replication":"https://pith.science/pith/VE4ES2ZMIICHQX6U2A5FVRKHHK/action/replication_record"}},"created_at":"2026-05-18T01:58:27.322791+00:00","updated_at":"2026-05-18T01:58:27.322791+00:00"}