{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TUSJ4WW6QJZJMCGGETNFZ7F7OL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6d747ceccda0c62c79d2b1eb217eb07f894dc6bc8bd10a6796273fae0a71dacb","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-30T21:19:30Z","title_canon_sha256":"db6635dc431aea9278665d6a41000182291e1186fc273688268f68df0512d630"},"schema_version":"1.0","source":{"id":"1708.09477","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09477","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09477v3","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09477","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"pith_short_12","alias_value":"TUSJ4WW6QJZJ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TUSJ4WW6QJZJMCGG","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TUSJ4WW6","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:2f913368cbdb0fc8ac62f85376c86552f8cbbd99340b5d0b263fe9b00ec139a6","target":"graph","created_at":"2026-05-18T00:07:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The community detection problem for graphs asks one to partition the n vertices V of a graph G into k communities, or clusters, such that there are many intracluster edges and few intercluster edges. Of course this is equivalent to finding a permutation matrix P such that, if A denotes the adjacency matrix of G, then PAP^T is approximately block diagonal. As there are k^n possible partitions of n vertices into k subsets, directly determining the optimal clustering is clearly infeasible. Instead one seeks to solve a more tractable approximation to the clustering problem. In this paper we reform","authors_text":"Daniel McKenzie, Ming-Jun Lai","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-30T21:19:30Z","title":"A Compressive Sensing Approach to Community Detection with Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09477","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3383c10df174a1738f0486593678fefdacee0231f6d27cf72acf883a9a4dae9f","target":"record","created_at":"2026-05-18T00:07:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6d747ceccda0c62c79d2b1eb217eb07f894dc6bc8bd10a6796273fae0a71dacb","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-30T21:19:30Z","title_canon_sha256":"db6635dc431aea9278665d6a41000182291e1186fc273688268f68df0512d630"},"schema_version":"1.0","source":{"id":"1708.09477","kind":"arxiv","version":3}},"canonical_sha256":"9d249e5ade82729608c624da5cfcbf72c39155add7e0c8c9c6768bb05ae90946","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d249e5ade82729608c624da5cfcbf72c39155add7e0c8c9c6768bb05ae90946","first_computed_at":"2026-05-18T00:07:50.602629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:50.602629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eMUAuG0njo1MI6c2BUQka+uzlx+zZS8U4sLCL18EGEeJaaFSCQVYLSk9kwRTPM8EqdA5oh+WagBaoYorg/ZhDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:50.603311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09477","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3383c10df174a1738f0486593678fefdacee0231f6d27cf72acf883a9a4dae9f","sha256:2f913368cbdb0fc8ac62f85376c86552f8cbbd99340b5d0b263fe9b00ec139a6"],"state_sha256":"cc4e22f692d535ce27bb6c3195c63d4d814487627164c1cc501b9b3fd5241e0f"}