{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JWU5NRC26JB4F73J4ULSLV4XQV","short_pith_number":"pith:JWU5NRC2","schema_version":"1.0","canonical_sha256":"4da9d6c45af243c2ff69e51725d7978566c1efc4546c2e825abbe0655ec9cf9d","source":{"kind":"arxiv","id":"1706.10273","version":1},"attestation_state":"computed","paper":{"title":"Community Detection by $L_0$-penalized Graph Laplacian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"(2) Department of Mathematics, Chong Chen (1), Nan Lin (2) ((1) School of Mathematical Sciences, Peking University, Ruibin Xi (1), Washington University in St. Louis)","submitted_at":"2017-06-30T17:01:03Z","abstract_excerpt":"Community detection in network analysis aims at partitioning nodes in a network into $K$ disjoint communities. Most currently available algorithms assume that $K$ is known, but choosing a correct $K$ is generally very difficult for real networks. In addition, many real networks contain outlier nodes not belonging to any community, but currently very few algorithm can handle networks with outliers. In this paper, we propose a novel model free tightness criterion and an efficient algorithm to maximize this criterion for community detection. This tightness criterion is closely related with the gr"},"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":"1706.10273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-06-30T17:01:03Z","cross_cats_sorted":[],"title_canon_sha256":"4711fb86d5b103d2d067e09bc9ff43b28ac6a9791052b92e1668327c984140ff","abstract_canon_sha256":"7b8da14676b80543971a8b504e31d8ba800e04b489be9ad9b36502b4893cdb18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:08.973449Z","signature_b64":"7vGrtQEPqXDKME6yb+I3KRoeOELrQlVdtr1klGJ4zNxYCIYu9zCI9l7fzrJbohooS2kLJNXMYtHQIBpEoeKUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4da9d6c45af243c2ff69e51725d7978566c1efc4546c2e825abbe0655ec9cf9d","last_reissued_at":"2026-05-18T00:41:08.972849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:08.972849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Community Detection by $L_0$-penalized Graph Laplacian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"(2) Department of Mathematics, Chong Chen (1), Nan Lin (2) ((1) School of Mathematical Sciences, Peking University, Ruibin Xi (1), Washington University in St. Louis)","submitted_at":"2017-06-30T17:01:03Z","abstract_excerpt":"Community detection in network analysis aims at partitioning nodes in a network into $K$ disjoint communities. Most currently available algorithms assume that $K$ is known, but choosing a correct $K$ is generally very difficult for real networks. In addition, many real networks contain outlier nodes not belonging to any community, but currently very few algorithm can handle networks with outliers. In this paper, we propose a novel model free tightness criterion and an efficient algorithm to maximize this criterion for community detection. This tightness criterion is closely related with the gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10273","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":"1706.10273","created_at":"2026-05-18T00:41:08.972924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.10273v1","created_at":"2026-05-18T00:41:08.972924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10273","created_at":"2026-05-18T00:41:08.972924+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWU5NRC26JB4","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWU5NRC26JB4F73J","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWU5NRC2","created_at":"2026-05-18T12:31:24.725408+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/JWU5NRC26JB4F73J4ULSLV4XQV","json":"https://pith.science/pith/JWU5NRC26JB4F73J4ULSLV4XQV.json","graph_json":"https://pith.science/api/pith-number/JWU5NRC26JB4F73J4ULSLV4XQV/graph.json","events_json":"https://pith.science/api/pith-number/JWU5NRC26JB4F73J4ULSLV4XQV/events.json","paper":"https://pith.science/paper/JWU5NRC2"},"agent_actions":{"view_html":"https://pith.science/pith/JWU5NRC26JB4F73J4ULSLV4XQV","download_json":"https://pith.science/pith/JWU5NRC26JB4F73J4ULSLV4XQV.json","view_paper":"https://pith.science/paper/JWU5NRC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.10273&json=true","fetch_graph":"https://pith.science/api/pith-number/JWU5NRC26JB4F73J4ULSLV4XQV/graph.json","fetch_events":"https://pith.science/api/pith-number/JWU5NRC26JB4F73J4ULSLV4XQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWU5NRC26JB4F73J4ULSLV4XQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWU5NRC26JB4F73J4ULSLV4XQV/action/storage_attestation","attest_author":"https://pith.science/pith/JWU5NRC26JB4F73J4ULSLV4XQV/action/author_attestation","sign_citation":"https://pith.science/pith/JWU5NRC26JB4F73J4ULSLV4XQV/action/citation_signature","submit_replication":"https://pith.science/pith/JWU5NRC26JB4F73J4ULSLV4XQV/action/replication_record"}},"created_at":"2026-05-18T00:41:08.972924+00:00","updated_at":"2026-05-18T00:41:08.972924+00:00"}