{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MH7K6I6OMT6LEQBJ7QTXZFQSMM","short_pith_number":"pith:MH7K6I6O","canonical_record":{"source":{"id":"1705.07157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T19:30:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"22c42ec2f2b21f3f6ff00e7e9e285e55e31c87dba5984e35507378d8fb24ca5a","abstract_canon_sha256":"085357117c0ca71b58161f9b82eeacc6af1ad1feebce26953b8f03a33cc10dc7"},"schema_version":"1.0"},"canonical_sha256":"61feaf23ce64fcb24029fc277c9612630cb178c823b913e5ef6f4f5bd7036614","source":{"kind":"arxiv","id":"1705.07157","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07157","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07157v1","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07157","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"pith_short_12","alias_value":"MH7K6I6OMT6L","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MH7K6I6OMT6LEQBJ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MH7K6I6O","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MH7K6I6OMT6LEQBJ7QTXZFQSMM","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T19:30:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"22c42ec2f2b21f3f6ff00e7e9e285e55e31c87dba5984e35507378d8fb24ca5a","abstract_canon_sha256":"085357117c0ca71b58161f9b82eeacc6af1ad1feebce26953b8f03a33cc10dc7"},"schema_version":"1.0"},"canonical_sha256":"61feaf23ce64fcb24029fc277c9612630cb178c823b913e5ef6f4f5bd7036614","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:19.716430Z","signature_b64":"7WkPioaLnUHMmB6nJFOGv6Hgp4Bv3AF10Rq3gz3zU1X9X1sP4lTZoT3gKHVzilnajOhA84Oh6nZrEVqaM7YWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61feaf23ce64fcb24029fc277c9612630cb178c823b913e5ef6f4f5bd7036614","last_reissued_at":"2026-05-17T23:57:19.715929Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:19.715929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07157","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-17T23:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lH17UXLPI+mvYHSEZGwfdlkOlWaroIMn3K0QQ1pOUjWQMhpb+Fy2ULjeRhuhDZzvU0wd0WjL1j6Eshg0N4fvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:02:38.432706Z"},"content_sha256":"13f17578b1dbcbc2742df4f181cfc46dd02def68f0360e04718f489d4b607cbe","schema_version":"1.0","event_id":"sha256:13f17578b1dbcbc2742df4f181cfc46dd02def68f0360e04718f489d4b607cbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MH7K6I6OMT6LEQBJ7QTXZFQSMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering under Local Stability: Bridging the Gap between Worst-Case and Beyond Worst-Case Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Colin White, Maria-Florina Balcan","submitted_at":"2017-05-19T19:30:33Z","abstract_excerpt":"Recently, there has been substantial interest in clustering research that takes a beyond worst-case approach to the analysis of algorithms. The typical idea is to design a clustering algorithm that outputs a near-optimal solution, provided the data satisfy a natural stability notion. For example, Bilu and Linial (2010) and Awasthi et al. (2012) presented algorithms that output near-optimal solutions, assuming the optimal solution is preserved under small perturbations to the input distances. A drawback to this approach is that the algorithms are often explicitly built according to the stabilit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07157","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-17T23:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O3/DwNX6foz8FBdYJRGI20hKH0YbF12LY1okDuc2ycxL+cQKv52s+Wd5yhSFLZpg/rvrQJ4JIrK0t/W4eMFpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:02:38.433055Z"},"content_sha256":"6d171ff9d61d678da07c3f8b15097713dd730e0f81bbe5cf4c61a5888cb77fc3","schema_version":"1.0","event_id":"sha256:6d171ff9d61d678da07c3f8b15097713dd730e0f81bbe5cf4c61a5888cb77fc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MH7K6I6OMT6LEQBJ7QTXZFQSMM/bundle.json","state_url":"https://pith.science/pith/MH7K6I6OMT6LEQBJ7QTXZFQSMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MH7K6I6OMT6LEQBJ7QTXZFQSMM/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-04T22:02:38Z","links":{"resolver":"https://pith.science/pith/MH7K6I6OMT6LEQBJ7QTXZFQSMM","bundle":"https://pith.science/pith/MH7K6I6OMT6LEQBJ7QTXZFQSMM/bundle.json","state":"https://pith.science/pith/MH7K6I6OMT6LEQBJ7QTXZFQSMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MH7K6I6OMT6LEQBJ7QTXZFQSMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MH7K6I6OMT6LEQBJ7QTXZFQSMM","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":"085357117c0ca71b58161f9b82eeacc6af1ad1feebce26953b8f03a33cc10dc7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T19:30:33Z","title_canon_sha256":"22c42ec2f2b21f3f6ff00e7e9e285e55e31c87dba5984e35507378d8fb24ca5a"},"schema_version":"1.0","source":{"id":"1705.07157","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07157","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07157v1","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07157","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"pith_short_12","alias_value":"MH7K6I6OMT6L","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MH7K6I6OMT6LEQBJ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MH7K6I6O","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:6d171ff9d61d678da07c3f8b15097713dd730e0f81bbe5cf4c61a5888cb77fc3","target":"graph","created_at":"2026-05-17T23:57:19Z","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":"Recently, there has been substantial interest in clustering research that takes a beyond worst-case approach to the analysis of algorithms. The typical idea is to design a clustering algorithm that outputs a near-optimal solution, provided the data satisfy a natural stability notion. For example, Bilu and Linial (2010) and Awasthi et al. (2012) presented algorithms that output near-optimal solutions, assuming the optimal solution is preserved under small perturbations to the input distances. A drawback to this approach is that the algorithms are often explicitly built according to the stabilit","authors_text":"Colin White, Maria-Florina Balcan","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T19:30:33Z","title":"Clustering under Local Stability: Bridging the Gap between Worst-Case and Beyond Worst-Case Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07157","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:13f17578b1dbcbc2742df4f181cfc46dd02def68f0360e04718f489d4b607cbe","target":"record","created_at":"2026-05-17T23:57:19Z","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":"085357117c0ca71b58161f9b82eeacc6af1ad1feebce26953b8f03a33cc10dc7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T19:30:33Z","title_canon_sha256":"22c42ec2f2b21f3f6ff00e7e9e285e55e31c87dba5984e35507378d8fb24ca5a"},"schema_version":"1.0","source":{"id":"1705.07157","kind":"arxiv","version":1}},"canonical_sha256":"61feaf23ce64fcb24029fc277c9612630cb178c823b913e5ef6f4f5bd7036614","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61feaf23ce64fcb24029fc277c9612630cb178c823b913e5ef6f4f5bd7036614","first_computed_at":"2026-05-17T23:57:19.715929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:19.715929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7WkPioaLnUHMmB6nJFOGv6Hgp4Bv3AF10Rq3gz3zU1X9X1sP4lTZoT3gKHVzilnajOhA84Oh6nZrEVqaM7YWAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:19.716430Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07157","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13f17578b1dbcbc2742df4f181cfc46dd02def68f0360e04718f489d4b607cbe","sha256:6d171ff9d61d678da07c3f8b15097713dd730e0f81bbe5cf4c61a5888cb77fc3"],"state_sha256":"68f77db4de3aec26a035e52d4b54e90654422d97baa33506beefb3f3f81876a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xx5ajnzOAY+ybtGZxay6c9C8Gz2J66AyFlwb43YZNW5/9bej4VD61uoux1EZhNMn2ocl3imF5TylHDiwID6pDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:02:38.435255Z","bundle_sha256":"ae061b4f6cd92cb58b0ce5c806bae656ce2dffe6f482a9e159b1b9b6fdf62fd1"}}