{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HM6GHZQERPWAUOMJQKJYNJB7XY","short_pith_number":"pith:HM6GHZQE","canonical_record":{"source":{"id":"1107.2379","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-12T19:27:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e3a7d3aadce85494c157f860447a9a904fcf491266044d26ad6ab7cffe8d68e9","abstract_canon_sha256":"a3a8d714fffa8009ebc2ab681e867353d1dba56ff833eba3d050c611012355dc"},"schema_version":"1.0"},"canonical_sha256":"3b3c63e6048bec0a3989829386a43fbe3b897a6fb7ecf25275b284a69199b1e5","source":{"kind":"arxiv","id":"1107.2379","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2379","created_at":"2026-05-18T02:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2379v5","created_at":"2026-05-18T02:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2379","created_at":"2026-05-18T02:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"HM6GHZQERPWA","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HM6GHZQERPWAUOMJ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HM6GHZQE","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HM6GHZQERPWAUOMJQKJYNJB7XY","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2379","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-12T19:27:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e3a7d3aadce85494c157f860447a9a904fcf491266044d26ad6ab7cffe8d68e9","abstract_canon_sha256":"a3a8d714fffa8009ebc2ab681e867353d1dba56ff833eba3d050c611012355dc"},"schema_version":"1.0"},"canonical_sha256":"3b3c63e6048bec0a3989829386a43fbe3b897a6fb7ecf25275b284a69199b1e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:00.752189Z","signature_b64":"DTWufMNxIkD12gAZTT4TUTC45qUcQqP9pEUzoGCghV6wrLqtm9vXdJCXuOw/Sjiq8BJZAX/XxFbbWrMeiF8lCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b3c63e6048bec0a3989829386a43fbe3b897a6fb7ecf25275b284a69199b1e5","last_reissued_at":"2026-05-18T02:44:00.751752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:00.751752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2379","source_version":5,"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:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0cyBL+E4HYUXNhAj7xXhwifGClZVqMh4uCTNvBKmk+JWeM0y25kLgnkD57yCpznLEAu1oVpbVOdVi5BrJJjzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:47:13.861307Z"},"content_sha256":"ef3e554260d2b2ab789c6a8670b30956a1fda63ca3768f9cde1b01d0167fadaf","schema_version":"1.0","event_id":"sha256:ef3e554260d2b2ab789c6a8670b30956a1fda63ca3768f9cde1b01d0167fadaf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HM6GHZQERPWAUOMJQKJYNJB7XY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data Stability in Clustering: A Closer Look","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Lev Reyzin, Shalev Ben-David","submitted_at":"2011-07-12T19:27:12Z","abstract_excerpt":"We consider the model introduced by Bilu and Linial (2010), who study problems for which the optimal clustering does not change when distances are perturbed. They show that even when a problem is NP-hard, it is sometimes possible to obtain efficient algorithms for instances resilient to certain multiplicative perturbations, e.g. on the order of $O(\\sqrt{n})$ for max-cut clustering. Awasthi et al. (2010) consider center-based objectives, and Balcan and Liang (2011) analyze the $k$-median and min-sum objectives, giving efficient algorithms for instances resilient to certain constant multiplicati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2379","kind":"arxiv","version":5},"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:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1rn1/9ZbSSqL8VBKiAdch0+1pyGBHJS6f3mUG0VYNPgqABOgnQmSya5Tovd2irQWizR5Qhqtwa3DHuLEoqiHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:47:13.861782Z"},"content_sha256":"e6d2f76a0b81b3ec50575f3a7f4167702347cb8ac9a46a3d4b32c11266a7de3e","schema_version":"1.0","event_id":"sha256:e6d2f76a0b81b3ec50575f3a7f4167702347cb8ac9a46a3d4b32c11266a7de3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HM6GHZQERPWAUOMJQKJYNJB7XY/bundle.json","state_url":"https://pith.science/pith/HM6GHZQERPWAUOMJQKJYNJB7XY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HM6GHZQERPWAUOMJQKJYNJB7XY/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-26T09:47:13Z","links":{"resolver":"https://pith.science/pith/HM6GHZQERPWAUOMJQKJYNJB7XY","bundle":"https://pith.science/pith/HM6GHZQERPWAUOMJQKJYNJB7XY/bundle.json","state":"https://pith.science/pith/HM6GHZQERPWAUOMJQKJYNJB7XY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HM6GHZQERPWAUOMJQKJYNJB7XY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HM6GHZQERPWAUOMJQKJYNJB7XY","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":"a3a8d714fffa8009ebc2ab681e867353d1dba56ff833eba3d050c611012355dc","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-12T19:27:12Z","title_canon_sha256":"e3a7d3aadce85494c157f860447a9a904fcf491266044d26ad6ab7cffe8d68e9"},"schema_version":"1.0","source":{"id":"1107.2379","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2379","created_at":"2026-05-18T02:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2379v5","created_at":"2026-05-18T02:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2379","created_at":"2026-05-18T02:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"HM6GHZQERPWA","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HM6GHZQERPWAUOMJ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HM6GHZQE","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:e6d2f76a0b81b3ec50575f3a7f4167702347cb8ac9a46a3d4b32c11266a7de3e","target":"graph","created_at":"2026-05-18T02:44:00Z","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":"We consider the model introduced by Bilu and Linial (2010), who study problems for which the optimal clustering does not change when distances are perturbed. They show that even when a problem is NP-hard, it is sometimes possible to obtain efficient algorithms for instances resilient to certain multiplicative perturbations, e.g. on the order of $O(\\sqrt{n})$ for max-cut clustering. Awasthi et al. (2010) consider center-based objectives, and Balcan and Liang (2011) analyze the $k$-median and min-sum objectives, giving efficient algorithms for instances resilient to certain constant multiplicati","authors_text":"Lev Reyzin, Shalev Ben-David","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-12T19:27:12Z","title":"Data Stability in Clustering: A Closer Look"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2379","kind":"arxiv","version":5},"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:ef3e554260d2b2ab789c6a8670b30956a1fda63ca3768f9cde1b01d0167fadaf","target":"record","created_at":"2026-05-18T02:44:00Z","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":"a3a8d714fffa8009ebc2ab681e867353d1dba56ff833eba3d050c611012355dc","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-12T19:27:12Z","title_canon_sha256":"e3a7d3aadce85494c157f860447a9a904fcf491266044d26ad6ab7cffe8d68e9"},"schema_version":"1.0","source":{"id":"1107.2379","kind":"arxiv","version":5}},"canonical_sha256":"3b3c63e6048bec0a3989829386a43fbe3b897a6fb7ecf25275b284a69199b1e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b3c63e6048bec0a3989829386a43fbe3b897a6fb7ecf25275b284a69199b1e5","first_computed_at":"2026-05-18T02:44:00.751752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:00.751752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DTWufMNxIkD12gAZTT4TUTC45qUcQqP9pEUzoGCghV6wrLqtm9vXdJCXuOw/Sjiq8BJZAX/XxFbbWrMeiF8lCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:00.752189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2379","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef3e554260d2b2ab789c6a8670b30956a1fda63ca3768f9cde1b01d0167fadaf","sha256:e6d2f76a0b81b3ec50575f3a7f4167702347cb8ac9a46a3d4b32c11266a7de3e"],"state_sha256":"c397d50e7d24ffb89c22511df0ccd66638a85f651e236bc3356c6aeed1ee1d5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3CrIq8fOcZSDlnaXj3imLvF+Tz4Gqn1m6Y74meNtvEbjfoI6uDrEZSHGRsJJefTX/mgAhxV26TS9Piw1F8nEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:47:13.864474Z","bundle_sha256":"706a5e27fc2694d6bd41ec727ef3c3bed40aef284ca4cecf08e73cfdd0a39406"}}