{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EPOKSQSNY3ZHYCRFIKTBOV6CKF","short_pith_number":"pith:EPOKSQSN","canonical_record":{"source":{"id":"1708.01072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-03T09:34:54Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"d6602094cb6e7539971d02e86e65d36fa450179cbfd494c6805f74d4af5afec6","abstract_canon_sha256":"991ebf420245b5d6976bbb96b2fc1ceb95d41f729eb107f0ced43166796fdee0"},"schema_version":"1.0"},"canonical_sha256":"23dca9424dc6f27c0a2542a61757c25157dd6ea5cdb394710b7f4c92c2b82660","source":{"kind":"arxiv","id":"1708.01072","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01072","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01072v1","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01072","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"EPOKSQSNY3ZH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EPOKSQSNY3ZHYCRF","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EPOKSQSN","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EPOKSQSNY3ZHYCRFIKTBOV6CKF","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-03T09:34:54Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"d6602094cb6e7539971d02e86e65d36fa450179cbfd494c6805f74d4af5afec6","abstract_canon_sha256":"991ebf420245b5d6976bbb96b2fc1ceb95d41f729eb107f0ced43166796fdee0"},"schema_version":"1.0"},"canonical_sha256":"23dca9424dc6f27c0a2542a61757c25157dd6ea5cdb394710b7f4c92c2b82660","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:40.694521Z","signature_b64":"wb4Y3EmaWh43+/KHNUzY4wCUkBUziaUpFZ8TL3RHGtOIwYIjVHwOS/sdHVwKSqKqKBPE9J091w4TV6D51aPJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23dca9424dc6f27c0a2542a61757c25157dd6ea5cdb394710b7f4c92c2b82660","last_reissued_at":"2026-05-18T00:38:40.693904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:40.693904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01072","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GHeeMCToJJB9RMhaw7ukv7/nxmFLYI8uyN5BEWkQSf4oZQf8g2mLVhB/EH4syXDrRz0hwVWpwLUn4ZqLZT/eBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:57:18.638702Z"},"content_sha256":"aba7644becfa5ed33e5514cbc0da724e0b87f218260d52fd8ddac75769e6f559","schema_version":"1.0","event_id":"sha256:aba7644becfa5ed33e5514cbc0da724e0b87f218260d52fd8ddac75769e6f559"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EPOKSQSNY3ZHYCRFIKTBOV6CKF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"math.OC","authors_text":"Haoyang Liu, Junyu Zhang, Shuzhong Zhang, Zaiwen Wen","submitted_at":"2017-08-03T09:34:54Z","abstract_excerpt":"In this paper, we consider the community detection problem under either the stochastic block model (SBM) assumption or the degree-correlated stochastic block model (DCSBM) assumption. The modularity maximization formulation for the community detection problem is NP-hard in general. In this paper, we propose a sparse and low-rank completely positive relaxation for the modularity maximization problem, we then develop an efficient row-by-row (RBR) type block coordinate descent (BCD) algorithm to solve the relaxation and prove an $\\mathcal{O}(1/\\sqrt{N})$ convergence rate to a stationary point whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01072","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D6VRnTxTWPMsYiWK5Lb0705nkCTgR+TvHaY5qfjn6I8IqT9lM92J6rRKoeQU3Uh+liUGnKIIO01CZo1DWk60Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:57:18.639388Z"},"content_sha256":"07b3cd737e68e554712cd4fac570e43bb3b9efba22070febd60da7a4784e3ad6","schema_version":"1.0","event_id":"sha256:07b3cd737e68e554712cd4fac570e43bb3b9efba22070febd60da7a4784e3ad6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EPOKSQSNY3ZHYCRFIKTBOV6CKF/bundle.json","state_url":"https://pith.science/pith/EPOKSQSNY3ZHYCRFIKTBOV6CKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EPOKSQSNY3ZHYCRFIKTBOV6CKF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T11:57:18Z","links":{"resolver":"https://pith.science/pith/EPOKSQSNY3ZHYCRFIKTBOV6CKF","bundle":"https://pith.science/pith/EPOKSQSNY3ZHYCRFIKTBOV6CKF/bundle.json","state":"https://pith.science/pith/EPOKSQSNY3ZHYCRFIKTBOV6CKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EPOKSQSNY3ZHYCRFIKTBOV6CKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EPOKSQSNY3ZHYCRFIKTBOV6CKF","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":"991ebf420245b5d6976bbb96b2fc1ceb95d41f729eb107f0ced43166796fdee0","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-03T09:34:54Z","title_canon_sha256":"d6602094cb6e7539971d02e86e65d36fa450179cbfd494c6805f74d4af5afec6"},"schema_version":"1.0","source":{"id":"1708.01072","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01072","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01072v1","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01072","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"EPOKSQSNY3ZH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EPOKSQSNY3ZHYCRF","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EPOKSQSN","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:07b3cd737e68e554712cd4fac570e43bb3b9efba22070febd60da7a4784e3ad6","target":"graph","created_at":"2026-05-18T00:38:40Z","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":"In this paper, we consider the community detection problem under either the stochastic block model (SBM) assumption or the degree-correlated stochastic block model (DCSBM) assumption. The modularity maximization formulation for the community detection problem is NP-hard in general. In this paper, we propose a sparse and low-rank completely positive relaxation for the modularity maximization problem, we then develop an efficient row-by-row (RBR) type block coordinate descent (BCD) algorithm to solve the relaxation and prove an $\\mathcal{O}(1/\\sqrt{N})$ convergence rate to a stationary point whe","authors_text":"Haoyang Liu, Junyu Zhang, Shuzhong Zhang, Zaiwen Wen","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-03T09:34:54Z","title":"A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01072","kind":"arxiv","version":1},"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:aba7644becfa5ed33e5514cbc0da724e0b87f218260d52fd8ddac75769e6f559","target":"record","created_at":"2026-05-18T00:38:40Z","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":"991ebf420245b5d6976bbb96b2fc1ceb95d41f729eb107f0ced43166796fdee0","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-03T09:34:54Z","title_canon_sha256":"d6602094cb6e7539971d02e86e65d36fa450179cbfd494c6805f74d4af5afec6"},"schema_version":"1.0","source":{"id":"1708.01072","kind":"arxiv","version":1}},"canonical_sha256":"23dca9424dc6f27c0a2542a61757c25157dd6ea5cdb394710b7f4c92c2b82660","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23dca9424dc6f27c0a2542a61757c25157dd6ea5cdb394710b7f4c92c2b82660","first_computed_at":"2026-05-18T00:38:40.693904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:40.693904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wb4Y3EmaWh43+/KHNUzY4wCUkBUziaUpFZ8TL3RHGtOIwYIjVHwOS/sdHVwKSqKqKBPE9J091w4TV6D51aPJDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:40.694521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01072","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aba7644becfa5ed33e5514cbc0da724e0b87f218260d52fd8ddac75769e6f559","sha256:07b3cd737e68e554712cd4fac570e43bb3b9efba22070febd60da7a4784e3ad6"],"state_sha256":"9c8c325ef9fd355f62f70c07ab8863f9b33e4e6ad522af7b16b0c0b193ceeb9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jkHG47aCQcyL8t7m+ARQ4mD1EnU/9rQyrLQLLR+1xYFHHiudVmSkekCoMJ9oUBC2wmsq+RvLZ/B8Jdul73jjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:57:18.643567Z","bundle_sha256":"04aa76c3803acbc2598dc829319141d8bfd857fd8efa7c7e0f2b886a858b28f2"}}