{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ET4UV6RXRHHGUGQEQTCYLREQGI","short_pith_number":"pith:ET4UV6RX","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"},"canonical_sha256":"24f94afa3789ce6a1a0484c585c4903202f3725a5fd5914fc7575f0b0ecda349","source":{"kind":"arxiv","id":"1410.3898","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3898","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3898v2","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3898","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"pith_short_12","alias_value":"ET4UV6RXRHHG","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"ET4UV6RXRHHGUGQE","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"ET4UV6RX","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ET4UV6RXRHHGUGQEQTCYLREQGI","target":"record","payload":{"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"},"canonical_sha256":"24f94afa3789ce6a1a0484c585c4903202f3725a5fd5914fc7575f0b0ecda349","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"},"source_kind":"arxiv","source_id":"1410.3898","source_version":2,"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-18T02:28:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"by2DzKNeGFjJ7t8p9spK5MS7AlvM6Ta4viOWR4/0YVLyXRk6gV72wu3mJ3AOBqFDf7frOCnY0vT5nrtQmHRqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:15:53.919959Z"},"content_sha256":"70810b8114c9e21aa0bea6b0c322f9d215682b455feada24acd355fdcabf3a4d","schema_version":"1.0","event_id":"sha256:70810b8114c9e21aa0bea6b0c322f9d215682b455feada24acd355fdcabf3a4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ET4UV6RXRHHGUGQEQTCYLREQGI","target":"graph","payload":{"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"},"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-18T02:28:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRhyoigqhxooTpRFmz8irm31gtpsL5Ja4Aa9oUfyfY730I7KIh3n4MpYLd36dlAERtqT0WSJkc6iouqiG3hrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:15:53.920633Z"},"content_sha256":"e62e2e257f23cf683d73098295eacecd78a92d068b4d3d6c5481ec39fc452004","schema_version":"1.0","event_id":"sha256:e62e2e257f23cf683d73098295eacecd78a92d068b4d3d6c5481ec39fc452004"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ET4UV6RXRHHGUGQEQTCYLREQGI/bundle.json","state_url":"https://pith.science/pith/ET4UV6RXRHHGUGQEQTCYLREQGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ET4UV6RXRHHGUGQEQTCYLREQGI/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-26T04:15:53Z","links":{"resolver":"https://pith.science/pith/ET4UV6RXRHHGUGQEQTCYLREQGI","bundle":"https://pith.science/pith/ET4UV6RXRHHGUGQEQTCYLREQGI/bundle.json","state":"https://pith.science/pith/ET4UV6RXRHHGUGQEQTCYLREQGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ET4UV6RXRHHGUGQEQTCYLREQGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ET4UV6RXRHHGUGQEQTCYLREQGI","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":"d25d56cf0ba7bd7744c37864fa8b17981c435e13648ad7405a2e6a10205636e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-15T00:14:36Z","title_canon_sha256":"5d272a31d02a55a9541c93a4e9fed757045deea0e2aebd48ada8c090ec030f40"},"schema_version":"1.0","source":{"id":"1410.3898","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3898","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3898v2","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3898","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"pith_short_12","alias_value":"ET4UV6RXRHHG","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"ET4UV6RXRHHGUGQE","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"ET4UV6RX","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:e62e2e257f23cf683d73098295eacecd78a92d068b4d3d6c5481ec39fc452004","target":"graph","created_at":"2026-05-18T02:28:41Z","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":"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","authors_text":"Necdet Serhat Aybat, Sahar Zarmehri, Soundar Kumara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-15T00:14:36Z","title":"An ADMM Algorithm for Clustering Partially Observed Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3898","kind":"arxiv","version":2},"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:70810b8114c9e21aa0bea6b0c322f9d215682b455feada24acd355fdcabf3a4d","target":"record","created_at":"2026-05-18T02:28:41Z","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":"d25d56cf0ba7bd7744c37864fa8b17981c435e13648ad7405a2e6a10205636e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-15T00:14:36Z","title_canon_sha256":"5d272a31d02a55a9541c93a4e9fed757045deea0e2aebd48ada8c090ec030f40"},"schema_version":"1.0","source":{"id":"1410.3898","kind":"arxiv","version":2}},"canonical_sha256":"24f94afa3789ce6a1a0484c585c4903202f3725a5fd5914fc7575f0b0ecda349","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24f94afa3789ce6a1a0484c585c4903202f3725a5fd5914fc7575f0b0ecda349","first_computed_at":"2026-05-18T02:28:41.183006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:41.183006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zBmnCTV1sPQBKlb22uCShWlwC6nnVIAM7lc0s3zgkdka/aT1WJcqjvSdJe58xiLoKBmaSS+HafKmWEhxDenOBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:41.183503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3898","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70810b8114c9e21aa0bea6b0c322f9d215682b455feada24acd355fdcabf3a4d","sha256:e62e2e257f23cf683d73098295eacecd78a92d068b4d3d6c5481ec39fc452004"],"state_sha256":"0f26a24283adc82d94af0ee9e4ad62c1148b101c1b462d2021e336874eda4d5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d/FMs+fY/5owOeV/9JhC0ssTXZ4AquDehRckg/AUt6D0l0W8kAtJyVEmRnzED96b2zrJIDeaXMFmZoYxOf1HDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:15:53.923586Z","bundle_sha256":"1516f36807941b1ac75849e14f156ed541e3108283b346c347cbcbafc1b40465"}}