{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:Q47USIN2VURK4ODMWXSKNKU73W","short_pith_number":"pith:Q47USIN2","canonical_record":{"source":{"id":"1009.3594","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-18T22:57:43Z","cross_cats_sorted":[],"title_canon_sha256":"1d88d66930d3a97a857e0afa8720bb4e2698507accb20ea477ea3055d9b6c82c","abstract_canon_sha256":"a6a004a574ae462eb8148261092236e9248484d652575fb3d40dd0dd4ba48880"},"schema_version":"1.0"},"canonical_sha256":"873f4921baad22ae386cb5e4a6aa9fdd99c8bcba923a2b073054d8fc57bef984","source":{"kind":"arxiv","id":"1009.3594","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3594","created_at":"2026-05-18T04:15:48Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3594v2","created_at":"2026-05-18T04:15:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3594","created_at":"2026-05-18T04:15:48Z"},{"alias_kind":"pith_short_12","alias_value":"Q47USIN2VURK","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"Q47USIN2VURK4ODM","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"Q47USIN2","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:Q47USIN2VURK4ODMWXSKNKU73W","target":"record","payload":{"canonical_record":{"source":{"id":"1009.3594","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-18T22:57:43Z","cross_cats_sorted":[],"title_canon_sha256":"1d88d66930d3a97a857e0afa8720bb4e2698507accb20ea477ea3055d9b6c82c","abstract_canon_sha256":"a6a004a574ae462eb8148261092236e9248484d652575fb3d40dd0dd4ba48880"},"schema_version":"1.0"},"canonical_sha256":"873f4921baad22ae386cb5e4a6aa9fdd99c8bcba923a2b073054d8fc57bef984","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:48.121701Z","signature_b64":"MSfvNaU8FOri8OLw69wvtrxkFrk9MP7jIePpTPmQIxhESZ8iRLEHK1Twt+MT2tKtKyu9FsA/oygIDym0UKulBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"873f4921baad22ae386cb5e4a6aa9fdd99c8bcba923a2b073054d8fc57bef984","last_reissued_at":"2026-05-18T04:15:48.121002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:48.121002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.3594","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-18T04:15:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gk+ZeZwQSlp4JHcKjsNO9rCGHUcvwq10VVCSsCXZeGCfouD107Bbz556kUCJEGu4POTBweWXhu5xhyC80QwLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T00:53:01.262722Z"},"content_sha256":"9ffab068fa6ea5902219e6a1aaf190b32adc71484b5cec0caffa310cac8683ce","schema_version":"1.0","event_id":"sha256:9ffab068fa6ea5902219e6a1aaf190b32adc71484b5cec0caffa310cac8683ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:Q47USIN2VURK4ODMWXSKNKU73W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Center-based Clustering under Perturbation Stability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Avrim Blum, Or Sheffet, Pranjal Awasthi","submitted_at":"2010-09-18T22:57:43Z","abstract_excerpt":"Clustering under most popular objective functions is NP-hard, even to approximate well, and so unlikely to be efficiently solvable in the worst case. Recently, Bilu and Linial \\cite{Bilu09} suggested an approach aimed at bypassing this computational barrier by using properties of instances one might hope to hold in practice. In particular, they argue that instances in practice should be stable to small perturbations in the metric space and give an efficient algorithm for clustering instances of the Max-Cut problem that are stable to perturbations of size $O(n^{1/2})$. In addition, they conject"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3594","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-18T04:15:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBw/6xO1CmyHLiWf/EIXqiHfU3XzRfXHL90vXOxP1vTBciCRT0EI47HuztEqE2NylzPFL/Wfm/qX8YAxIPjgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T00:53:01.263087Z"},"content_sha256":"60854fdda02ec5c7d95f1fcde3ce4bd05ce5466987167a72fec941b48b7384ca","schema_version":"1.0","event_id":"sha256:60854fdda02ec5c7d95f1fcde3ce4bd05ce5466987167a72fec941b48b7384ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q47USIN2VURK4ODMWXSKNKU73W/bundle.json","state_url":"https://pith.science/pith/Q47USIN2VURK4ODMWXSKNKU73W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q47USIN2VURK4ODMWXSKNKU73W/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-07-05T00:53:01Z","links":{"resolver":"https://pith.science/pith/Q47USIN2VURK4ODMWXSKNKU73W","bundle":"https://pith.science/pith/Q47USIN2VURK4ODMWXSKNKU73W/bundle.json","state":"https://pith.science/pith/Q47USIN2VURK4ODMWXSKNKU73W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q47USIN2VURK4ODMWXSKNKU73W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:Q47USIN2VURK4ODMWXSKNKU73W","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":"a6a004a574ae462eb8148261092236e9248484d652575fb3d40dd0dd4ba48880","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-18T22:57:43Z","title_canon_sha256":"1d88d66930d3a97a857e0afa8720bb4e2698507accb20ea477ea3055d9b6c82c"},"schema_version":"1.0","source":{"id":"1009.3594","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3594","created_at":"2026-05-18T04:15:48Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3594v2","created_at":"2026-05-18T04:15:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3594","created_at":"2026-05-18T04:15:48Z"},{"alias_kind":"pith_short_12","alias_value":"Q47USIN2VURK","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"Q47USIN2VURK4ODM","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"Q47USIN2","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:60854fdda02ec5c7d95f1fcde3ce4bd05ce5466987167a72fec941b48b7384ca","target":"graph","created_at":"2026-05-18T04:15:48Z","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 under most popular objective functions is NP-hard, even to approximate well, and so unlikely to be efficiently solvable in the worst case. Recently, Bilu and Linial \\cite{Bilu09} suggested an approach aimed at bypassing this computational barrier by using properties of instances one might hope to hold in practice. In particular, they argue that instances in practice should be stable to small perturbations in the metric space and give an efficient algorithm for clustering instances of the Max-Cut problem that are stable to perturbations of size $O(n^{1/2})$. In addition, they conject","authors_text":"Avrim Blum, Or Sheffet, Pranjal Awasthi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-18T22:57:43Z","title":"Center-based Clustering under Perturbation Stability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3594","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:9ffab068fa6ea5902219e6a1aaf190b32adc71484b5cec0caffa310cac8683ce","target":"record","created_at":"2026-05-18T04:15:48Z","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":"a6a004a574ae462eb8148261092236e9248484d652575fb3d40dd0dd4ba48880","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-18T22:57:43Z","title_canon_sha256":"1d88d66930d3a97a857e0afa8720bb4e2698507accb20ea477ea3055d9b6c82c"},"schema_version":"1.0","source":{"id":"1009.3594","kind":"arxiv","version":2}},"canonical_sha256":"873f4921baad22ae386cb5e4a6aa9fdd99c8bcba923a2b073054d8fc57bef984","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"873f4921baad22ae386cb5e4a6aa9fdd99c8bcba923a2b073054d8fc57bef984","first_computed_at":"2026-05-18T04:15:48.121002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:48.121002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MSfvNaU8FOri8OLw69wvtrxkFrk9MP7jIePpTPmQIxhESZ8iRLEHK1Twt+MT2tKtKyu9FsA/oygIDym0UKulBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:48.121701Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.3594","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ffab068fa6ea5902219e6a1aaf190b32adc71484b5cec0caffa310cac8683ce","sha256:60854fdda02ec5c7d95f1fcde3ce4bd05ce5466987167a72fec941b48b7384ca"],"state_sha256":"49ec238066cec2a78de1c01dbb4d71a43d104398321bf7f67e332ea1e337d604"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/YpkQbGpkz95UVjIRjiXkRo96usokKHpiI2o/5143NkZu+ZlZjeYgUcfKFTD7XggYyO7aj/bErj9GbXTEX1WDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T00:53:01.265057Z","bundle_sha256":"1aacea3813d1e0ec1429a0232774f1a7c31f3525ba981e9d8c38a894fcf30c05"}}