{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5TUGLCOBY7KG7E55KRFVTSE5LJ","short_pith_number":"pith:5TUGLCOB","canonical_record":{"source":{"id":"1104.4803","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-04-25T20:33:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6da9f37f18c0cb4a60ac4dd130fc09d854c8e6c159e833fe5a82005d512f40fe","abstract_canon_sha256":"7a98552499a95a04fd9da87c78cfe875c7b261ec06345bf529ea1a52778b3968"},"schema_version":"1.0"},"canonical_sha256":"ece86589c1c7d46f93bd544b59c89d5a4aaba0119afd5dbc689a9923aeb13676","source":{"kind":"arxiv","id":"1104.4803","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4803","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4803v4","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4803","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"5TUGLCOBY7KG","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5TUGLCOBY7KG7E55","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5TUGLCOB","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5TUGLCOBY7KG7E55KRFVTSE5LJ","target":"record","payload":{"canonical_record":{"source":{"id":"1104.4803","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-04-25T20:33:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6da9f37f18c0cb4a60ac4dd130fc09d854c8e6c159e833fe5a82005d512f40fe","abstract_canon_sha256":"7a98552499a95a04fd9da87c78cfe875c7b261ec06345bf529ea1a52778b3968"},"schema_version":"1.0"},"canonical_sha256":"ece86589c1c7d46f93bd544b59c89d5a4aaba0119afd5dbc689a9923aeb13676","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:39.665175Z","signature_b64":"zjYRSvdt0wYMeEny7bcICK8Q+ob5J6sr9x/NarU+WwYGmu6Pa94Q5TJhGjqyCKk1xQAzmyiHw/XTSTaexGMpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ece86589c1c7d46f93bd544b59c89d5a4aaba0119afd5dbc689a9923aeb13676","last_reissued_at":"2026-05-18T02:46:39.664742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:39.664742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.4803","source_version":4,"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:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80BCKVQ7aKuOvfJjM01V6mXwYIi5BGXVUcQ6j2OrNCkjIx/8w1VpkUBQbXqGduyw1CaCtnxl2CPDnHijyN9nCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:34:36.502796Z"},"content_sha256":"a4ad774801d29fb6a3764cc95a8e442940768957152142f5a6af6e3ba9075ad2","schema_version":"1.0","event_id":"sha256:a4ad774801d29fb6a3764cc95a8e442940768957152142f5a6af6e3ba9075ad2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5TUGLCOBY7KG7E55KRFVTSE5LJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering Partially Observed Graphs via Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ali Jalali, Huan Xu, Sujay Sanghavi, Yudong Chen","submitted_at":"2011-04-25T20:33:55Z","abstract_excerpt":"This paper considers the problem of clustering a partially observed unweighted graph---i.e., one where for some node pairs we know there is an edge between them, for some others we know there is no edge, and for the remaining we do not know whether or not there is an edge. We want to organize the nodes into disjoint clusters so that there is relatively dense (observed) connectivity within clusters, and sparse across clusters.\n  We take a novel yet natural approach to this problem, by focusing on finding the clustering that minimizes the number of \"disagreements\"---i.e., the sum of the number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4803","kind":"arxiv","version":4},"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:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2lv37VvaDl8vFy/wlorUnTdK9rLKHeLF2enaGZOQ03al8priwNUmYtRe2t0e9illqe0CogeV1dZEWJd1z8VXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:34:36.503143Z"},"content_sha256":"900738d2f3b4b002b1aa9c6c1bac726d368586050de143b45e6515a00de3604e","schema_version":"1.0","event_id":"sha256:900738d2f3b4b002b1aa9c6c1bac726d368586050de143b45e6515a00de3604e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TUGLCOBY7KG7E55KRFVTSE5LJ/bundle.json","state_url":"https://pith.science/pith/5TUGLCOBY7KG7E55KRFVTSE5LJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TUGLCOBY7KG7E55KRFVTSE5LJ/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-06-05T06:34:36Z","links":{"resolver":"https://pith.science/pith/5TUGLCOBY7KG7E55KRFVTSE5LJ","bundle":"https://pith.science/pith/5TUGLCOBY7KG7E55KRFVTSE5LJ/bundle.json","state":"https://pith.science/pith/5TUGLCOBY7KG7E55KRFVTSE5LJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TUGLCOBY7KG7E55KRFVTSE5LJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5TUGLCOBY7KG7E55KRFVTSE5LJ","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":"7a98552499a95a04fd9da87c78cfe875c7b261ec06345bf529ea1a52778b3968","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-04-25T20:33:55Z","title_canon_sha256":"6da9f37f18c0cb4a60ac4dd130fc09d854c8e6c159e833fe5a82005d512f40fe"},"schema_version":"1.0","source":{"id":"1104.4803","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4803","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4803v4","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4803","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"5TUGLCOBY7KG","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5TUGLCOBY7KG7E55","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5TUGLCOB","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:900738d2f3b4b002b1aa9c6c1bac726d368586050de143b45e6515a00de3604e","target":"graph","created_at":"2026-05-18T02:46:39Z","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":"This paper considers the problem of clustering a partially observed unweighted graph---i.e., one where for some node pairs we know there is an edge between them, for some others we know there is no edge, and for the remaining we do not know whether or not there is an edge. We want to organize the nodes into disjoint clusters so that there is relatively dense (observed) connectivity within clusters, and sparse across clusters.\n  We take a novel yet natural approach to this problem, by focusing on finding the clustering that minimizes the number of \"disagreements\"---i.e., the sum of the number o","authors_text":"Ali Jalali, Huan Xu, Sujay Sanghavi, Yudong Chen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-04-25T20:33:55Z","title":"Clustering Partially Observed Graphs via Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4803","kind":"arxiv","version":4},"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:a4ad774801d29fb6a3764cc95a8e442940768957152142f5a6af6e3ba9075ad2","target":"record","created_at":"2026-05-18T02:46:39Z","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":"7a98552499a95a04fd9da87c78cfe875c7b261ec06345bf529ea1a52778b3968","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-04-25T20:33:55Z","title_canon_sha256":"6da9f37f18c0cb4a60ac4dd130fc09d854c8e6c159e833fe5a82005d512f40fe"},"schema_version":"1.0","source":{"id":"1104.4803","kind":"arxiv","version":4}},"canonical_sha256":"ece86589c1c7d46f93bd544b59c89d5a4aaba0119afd5dbc689a9923aeb13676","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ece86589c1c7d46f93bd544b59c89d5a4aaba0119afd5dbc689a9923aeb13676","first_computed_at":"2026-05-18T02:46:39.664742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:39.664742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zjYRSvdt0wYMeEny7bcICK8Q+ob5J6sr9x/NarU+WwYGmu6Pa94Q5TJhGjqyCKk1xQAzmyiHw/XTSTaexGMpDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:39.665175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.4803","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4ad774801d29fb6a3764cc95a8e442940768957152142f5a6af6e3ba9075ad2","sha256:900738d2f3b4b002b1aa9c6c1bac726d368586050de143b45e6515a00de3604e"],"state_sha256":"8c9f85a151d8f4eab546616148b405c6ef46dd3219f3908a250d4e85a2f771a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F71li1GWXIigAzUwb9pxQZVknKyZjtTx8j4UAYEdn2BpW0l0bCi3NZWygoGLd5Z9R9qomNBPrgXQK71SftUNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:34:36.505666Z","bundle_sha256":"cfd104e20703f28f60dcfab07a2aad0089559c2d945be03207f603115746c9bb"}}