{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ET4UV6RXRHHGUGQEQTCYLREQGI","short_pith_number":"pith:ET4UV6RX","schema_version":"1.0","canonical_sha256":"24f94afa3789ce6a1a0484c585c4903202f3725a5fd5914fc7575f0b0ecda349","source":{"kind":"arxiv","id":"1410.3898","version":2},"attestation_state":"computed","paper":{"title":"An ADMM Algorithm for Clustering Partially Observed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Necdet Serhat Aybat, Sahar Zarmehri, Soundar Kumara","submitted_at":"2014-10-15T00:14:36Z","abstract_excerpt":"Community detection has attracted increasing attention during the past decade, and many algorithms have been proposed to find the underlying community structure in a given network. Many of these algorithms are based on modularity maximization, and these methods suffer from the resolution limit. In order to detect the underlying cluster structure, we propose a new convex formulation to decompose a partially observed adjacency matrix of a network into low-rank and sparse components. In such decomposition, the low-rank component encodes the cluster structure under certain assumptions. We also dev"},"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":"1410.3898","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-15T00:14:36Z","cross_cats_sorted":[],"title_canon_sha256":"5d272a31d02a55a9541c93a4e9fed757045deea0e2aebd48ada8c090ec030f40","abstract_canon_sha256":"d25d56cf0ba7bd7744c37864fa8b17981c435e13648ad7405a2e6a10205636e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:41.183503Z","signature_b64":"zBmnCTV1sPQBKlb22uCShWlwC6nnVIAM7lc0s3zgkdka/aT1WJcqjvSdJe58xiLoKBmaSS+HafKmWEhxDenOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24f94afa3789ce6a1a0484c585c4903202f3725a5fd5914fc7575f0b0ecda349","last_reissued_at":"2026-05-18T02:28:41.183006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:41.183006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An ADMM Algorithm for Clustering Partially Observed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Necdet Serhat Aybat, Sahar Zarmehri, Soundar Kumara","submitted_at":"2014-10-15T00:14:36Z","abstract_excerpt":"Community detection has attracted increasing attention during the past decade, and many algorithms have been proposed to find the underlying community structure in a given network. Many of these algorithms are based on modularity maximization, and these methods suffer from the resolution limit. In order to detect the underlying cluster structure, we propose a new convex formulation to decompose a partially observed adjacency matrix of a network into low-rank and sparse components. In such decomposition, the low-rank component encodes the cluster structure under certain assumptions. We also dev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3898","kind":"arxiv","version":2},"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":"1410.3898","created_at":"2026-05-18T02:28:41.183092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3898v2","created_at":"2026-05-18T02:28:41.183092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3898","created_at":"2026-05-18T02:28:41.183092+00:00"},{"alias_kind":"pith_short_12","alias_value":"ET4UV6RXRHHG","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"ET4UV6RXRHHGUGQE","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"ET4UV6RX","created_at":"2026-05-18T12:28:28.263976+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/ET4UV6RXRHHGUGQEQTCYLREQGI","json":"https://pith.science/pith/ET4UV6RXRHHGUGQEQTCYLREQGI.json","graph_json":"https://pith.science/api/pith-number/ET4UV6RXRHHGUGQEQTCYLREQGI/graph.json","events_json":"https://pith.science/api/pith-number/ET4UV6RXRHHGUGQEQTCYLREQGI/events.json","paper":"https://pith.science/paper/ET4UV6RX"},"agent_actions":{"view_html":"https://pith.science/pith/ET4UV6RXRHHGUGQEQTCYLREQGI","download_json":"https://pith.science/pith/ET4UV6RXRHHGUGQEQTCYLREQGI.json","view_paper":"https://pith.science/paper/ET4UV6RX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3898&json=true","fetch_graph":"https://pith.science/api/pith-number/ET4UV6RXRHHGUGQEQTCYLREQGI/graph.json","fetch_events":"https://pith.science/api/pith-number/ET4UV6RXRHHGUGQEQTCYLREQGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ET4UV6RXRHHGUGQEQTCYLREQGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ET4UV6RXRHHGUGQEQTCYLREQGI/action/storage_attestation","attest_author":"https://pith.science/pith/ET4UV6RXRHHGUGQEQTCYLREQGI/action/author_attestation","sign_citation":"https://pith.science/pith/ET4UV6RXRHHGUGQEQTCYLREQGI/action/citation_signature","submit_replication":"https://pith.science/pith/ET4UV6RXRHHGUGQEQTCYLREQGI/action/replication_record"}},"created_at":"2026-05-18T02:28:41.183092+00:00","updated_at":"2026-05-18T02:28:41.183092+00:00"}