{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DRBJZHFBZMEDHLWY3OIOBDKC3E","short_pith_number":"pith:DRBJZHFB","canonical_record":{"source":{"id":"1112.2903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-12-13T14:28:12Z","cross_cats_sorted":[],"title_canon_sha256":"3118ec7acd604fb0b5a0af8d2ad48d934ae6b5c8f560d5df22f47e8c9630f655","abstract_canon_sha256":"24137047278a71c4e8b84de3c05f706a5f01ee7c384028142ab705cd09f36533"},"schema_version":"1.0"},"canonical_sha256":"1c429c9ca1cb0833aed8db90e08d42d936b47d34d2f815e0627f0a93e5fe25d9","source":{"kind":"arxiv","id":"1112.2903","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2903","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2903v1","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2903","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"DRBJZHFBZMED","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DRBJZHFBZMEDHLWY","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DRBJZHFB","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DRBJZHFBZMEDHLWY3OIOBDKC3E","target":"record","payload":{"canonical_record":{"source":{"id":"1112.2903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-12-13T14:28:12Z","cross_cats_sorted":[],"title_canon_sha256":"3118ec7acd604fb0b5a0af8d2ad48d934ae6b5c8f560d5df22f47e8c9630f655","abstract_canon_sha256":"24137047278a71c4e8b84de3c05f706a5f01ee7c384028142ab705cd09f36533"},"schema_version":"1.0"},"canonical_sha256":"1c429c9ca1cb0833aed8db90e08d42d936b47d34d2f815e0627f0a93e5fe25d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:32.058309Z","signature_b64":"DHDBL36QZ9K5sNCIOtvdNg86N5tgtwYuY/kHBMoArVSxUr1LXhyjdsZn9UoQIU3Uyay3DXT2DS3P5SKC6jIEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c429c9ca1cb0833aed8db90e08d42d936b47d34d2f815e0627f0a93e5fe25d9","last_reissued_at":"2026-05-18T04:06:32.057353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:32.057353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.2903","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-18T04:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8V7aq1AqqQ70a82Uoq5svF2YQIvVGmUxnmw80VFGndlKJagB9J+0KejW/5cJOBKihoLzWB+dpAQ889ElVSA6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:55:29.435481Z"},"content_sha256":"cf66bcafd2cbc410f07461d2945323aff56f2ac92591f83fef33003006d39313","schema_version":"1.0","event_id":"sha256:cf66bcafd2cbc410f07461d2945323aff56f2ac92591f83fef33003006d39313"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DRBJZHFBZMEDHLWY3OIOBDKC3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large Scale Correlation Clustering Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Meirav Galun, Shai Bagon","submitted_at":"2011-12-13T14:28:12Z","abstract_excerpt":"Clustering is a fundamental task in unsupervised learning. The focus of this paper is the Correlation Clustering functional which combines positive and negative affinities between the data points. The contribution of this paper is two fold: (i) Provide a theoretic analysis of the functional. (ii) New optimization algorithms which can cope with large scale problems (>100K variables) that are infeasible using existing methods. Our theoretic analysis provides a probabilistic generative interpretation for the functional, and justifies its intrinsic \"model-selection\" capability. Furthermore, we dra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2903","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-18T04:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8y+i/J10P9tczAk/aHVgXP9UNWDB1gXLbpREgfOMi3nvXm0gRSXiTl41LmWnWhySU87VcU9P5poGJQrgWPWUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:55:29.435875Z"},"content_sha256":"eb0b1271c89f2695358ef3686c779b56cb4b1768d71725cd409ae68c38555b79","schema_version":"1.0","event_id":"sha256:eb0b1271c89f2695358ef3686c779b56cb4b1768d71725cd409ae68c38555b79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DRBJZHFBZMEDHLWY3OIOBDKC3E/bundle.json","state_url":"https://pith.science/pith/DRBJZHFBZMEDHLWY3OIOBDKC3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DRBJZHFBZMEDHLWY3OIOBDKC3E/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-02T13:55:29Z","links":{"resolver":"https://pith.science/pith/DRBJZHFBZMEDHLWY3OIOBDKC3E","bundle":"https://pith.science/pith/DRBJZHFBZMEDHLWY3OIOBDKC3E/bundle.json","state":"https://pith.science/pith/DRBJZHFBZMEDHLWY3OIOBDKC3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DRBJZHFBZMEDHLWY3OIOBDKC3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DRBJZHFBZMEDHLWY3OIOBDKC3E","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":"24137047278a71c4e8b84de3c05f706a5f01ee7c384028142ab705cd09f36533","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-12-13T14:28:12Z","title_canon_sha256":"3118ec7acd604fb0b5a0af8d2ad48d934ae6b5c8f560d5df22f47e8c9630f655"},"schema_version":"1.0","source":{"id":"1112.2903","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2903","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2903v1","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2903","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"DRBJZHFBZMED","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DRBJZHFBZMEDHLWY","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DRBJZHFB","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:eb0b1271c89f2695358ef3686c779b56cb4b1768d71725cd409ae68c38555b79","target":"graph","created_at":"2026-05-18T04:06:32Z","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":"Clustering is a fundamental task in unsupervised learning. The focus of this paper is the Correlation Clustering functional which combines positive and negative affinities between the data points. The contribution of this paper is two fold: (i) Provide a theoretic analysis of the functional. (ii) New optimization algorithms which can cope with large scale problems (>100K variables) that are infeasible using existing methods. Our theoretic analysis provides a probabilistic generative interpretation for the functional, and justifies its intrinsic \"model-selection\" capability. Furthermore, we dra","authors_text":"Meirav Galun, Shai Bagon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-12-13T14:28:12Z","title":"Large Scale Correlation Clustering Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2903","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:cf66bcafd2cbc410f07461d2945323aff56f2ac92591f83fef33003006d39313","target":"record","created_at":"2026-05-18T04:06:32Z","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":"24137047278a71c4e8b84de3c05f706a5f01ee7c384028142ab705cd09f36533","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-12-13T14:28:12Z","title_canon_sha256":"3118ec7acd604fb0b5a0af8d2ad48d934ae6b5c8f560d5df22f47e8c9630f655"},"schema_version":"1.0","source":{"id":"1112.2903","kind":"arxiv","version":1}},"canonical_sha256":"1c429c9ca1cb0833aed8db90e08d42d936b47d34d2f815e0627f0a93e5fe25d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c429c9ca1cb0833aed8db90e08d42d936b47d34d2f815e0627f0a93e5fe25d9","first_computed_at":"2026-05-18T04:06:32.057353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:32.057353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DHDBL36QZ9K5sNCIOtvdNg86N5tgtwYuY/kHBMoArVSxUr1LXhyjdsZn9UoQIU3Uyay3DXT2DS3P5SKC6jIEBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:32.058309Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2903","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf66bcafd2cbc410f07461d2945323aff56f2ac92591f83fef33003006d39313","sha256:eb0b1271c89f2695358ef3686c779b56cb4b1768d71725cd409ae68c38555b79"],"state_sha256":"388293aff71954d85f1681385b9e907caf2cebf685a125b63c1755e4c1b3fa28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wGKN80JWKivKoAK+fqT+dmYEhnN/L6Ngafuu0gJJtJY92EppBDJaFMB0nYLwFgoruqMHqMpyQSYsm5gdhPrMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:55:29.437819Z","bundle_sha256":"22f499918026102d2a464b2390a0ea9f8fdf286398799a756371ed08b1e206ee"}}