{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6G5YGVO4LP5SBZAXGNWCTUWGRX","short_pith_number":"pith:6G5YGVO4","canonical_record":{"source":{"id":"1706.08996","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-27T18:20:40Z","cross_cats_sorted":[],"title_canon_sha256":"8455f7e6cf40936c97d5f80ae9d6c54b9aea8f6ada5a6ea597ae642a29ac7325","abstract_canon_sha256":"8e53d403f72c6ba052ac24d92352f6379245d994d85ec11e6edb1c6f4f94867d"},"schema_version":"1.0"},"canonical_sha256":"f1bb8355dc5bfb20e417336c29d2c68ddf7dcd1573d91a0f50ed5aadbeb69bf4","source":{"kind":"arxiv","id":"1706.08996","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08996","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08996v3","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08996","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"pith_short_12","alias_value":"6G5YGVO4LP5S","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6G5YGVO4LP5SBZAX","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6G5YGVO4","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6G5YGVO4LP5SBZAXGNWCTUWGRX","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08996","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-27T18:20:40Z","cross_cats_sorted":[],"title_canon_sha256":"8455f7e6cf40936c97d5f80ae9d6c54b9aea8f6ada5a6ea597ae642a29ac7325","abstract_canon_sha256":"8e53d403f72c6ba052ac24d92352f6379245d994d85ec11e6edb1c6f4f94867d"},"schema_version":"1.0"},"canonical_sha256":"f1bb8355dc5bfb20e417336c29d2c68ddf7dcd1573d91a0f50ed5aadbeb69bf4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:41.748629Z","signature_b64":"fIXDPffPQAV9rCmkFqCt9glPDKIeohvRk/pvncJ16tATFQt7CPETi4dPr3ir/ZOy5BWmEWv0vwEef050Tq0DAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1bb8355dc5bfb20e417336c29d2c68ddf7dcd1573d91a0f50ed5aadbeb69bf4","last_reissued_at":"2026-05-18T00:06:41.748088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:41.748088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08996","source_version":3,"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-18T00:06:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0eoVQt0yIlAwXzzC2yE8yZJvJmczH7x9EX17P5/Po9TfChqOB+IzpnIHVL0EUuA/lMet3tmECD2494uhnkdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:08:02.430333Z"},"content_sha256":"dc1984c2dc5333648db67ed21beda1a0ff825c8dd185572a054ec8a499e999e9","schema_version":"1.0","event_id":"sha256:dc1984c2dc5333648db67ed21beda1a0ff825c8dd185572a054ec8a499e999e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6G5YGVO4LP5SBZAXGNWCTUWGRX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Good Clusterings Have Large Volume","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"F. Happach, S. Borgwardt","submitted_at":"2017-06-27T18:20:40Z","abstract_excerpt":"The clustering of a data set is one of the core tasks in data analytics. Many clustering algorithms exhibit a strong contrast between a favorable performance in practice and bad theoretical worst-cases. Prime examples are least-squares assignments and the popular $k$-means algorithm. We are interested in this contrast and study it through polyhedral theory. Several popular clustering algorithms can be connected to finding a vertex of the so-called bounded-shape partition polytopes. The vertices correspond to clusterings with extraordinary separation properties, in particular allowing the const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08996","kind":"arxiv","version":3},"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-18T00:06:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/O0q+u2mYv+mXUQEk6YmCNKVV7OjAVia2muYbYioXMx6z9PG+ZTrcAJq3yy7oF7Asz76tdhrzx1lASiO7UUrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:08:02.430680Z"},"content_sha256":"b4549f2e90d870ab3d0b567dcbca2299b568eb6ca25758258ebce6671cd1de33","schema_version":"1.0","event_id":"sha256:b4549f2e90d870ab3d0b567dcbca2299b568eb6ca25758258ebce6671cd1de33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6G5YGVO4LP5SBZAXGNWCTUWGRX/bundle.json","state_url":"https://pith.science/pith/6G5YGVO4LP5SBZAXGNWCTUWGRX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6G5YGVO4LP5SBZAXGNWCTUWGRX/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-03T16:08:02Z","links":{"resolver":"https://pith.science/pith/6G5YGVO4LP5SBZAXGNWCTUWGRX","bundle":"https://pith.science/pith/6G5YGVO4LP5SBZAXGNWCTUWGRX/bundle.json","state":"https://pith.science/pith/6G5YGVO4LP5SBZAXGNWCTUWGRX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6G5YGVO4LP5SBZAXGNWCTUWGRX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6G5YGVO4LP5SBZAXGNWCTUWGRX","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":"8e53d403f72c6ba052ac24d92352f6379245d994d85ec11e6edb1c6f4f94867d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-27T18:20:40Z","title_canon_sha256":"8455f7e6cf40936c97d5f80ae9d6c54b9aea8f6ada5a6ea597ae642a29ac7325"},"schema_version":"1.0","source":{"id":"1706.08996","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08996","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08996v3","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08996","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"pith_short_12","alias_value":"6G5YGVO4LP5S","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6G5YGVO4LP5SBZAX","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6G5YGVO4","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:b4549f2e90d870ab3d0b567dcbca2299b568eb6ca25758258ebce6671cd1de33","target":"graph","created_at":"2026-05-18T00:06:41Z","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":"The clustering of a data set is one of the core tasks in data analytics. Many clustering algorithms exhibit a strong contrast between a favorable performance in practice and bad theoretical worst-cases. Prime examples are least-squares assignments and the popular $k$-means algorithm. We are interested in this contrast and study it through polyhedral theory. Several popular clustering algorithms can be connected to finding a vertex of the so-called bounded-shape partition polytopes. The vertices correspond to clusterings with extraordinary separation properties, in particular allowing the const","authors_text":"F. Happach, S. Borgwardt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-27T18:20:40Z","title":"Good Clusterings Have Large Volume"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08996","kind":"arxiv","version":3},"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:dc1984c2dc5333648db67ed21beda1a0ff825c8dd185572a054ec8a499e999e9","target":"record","created_at":"2026-05-18T00:06:41Z","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":"8e53d403f72c6ba052ac24d92352f6379245d994d85ec11e6edb1c6f4f94867d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-27T18:20:40Z","title_canon_sha256":"8455f7e6cf40936c97d5f80ae9d6c54b9aea8f6ada5a6ea597ae642a29ac7325"},"schema_version":"1.0","source":{"id":"1706.08996","kind":"arxiv","version":3}},"canonical_sha256":"f1bb8355dc5bfb20e417336c29d2c68ddf7dcd1573d91a0f50ed5aadbeb69bf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1bb8355dc5bfb20e417336c29d2c68ddf7dcd1573d91a0f50ed5aadbeb69bf4","first_computed_at":"2026-05-18T00:06:41.748088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:41.748088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fIXDPffPQAV9rCmkFqCt9glPDKIeohvRk/pvncJ16tATFQt7CPETi4dPr3ir/ZOy5BWmEWv0vwEef050Tq0DAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:41.748629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08996","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc1984c2dc5333648db67ed21beda1a0ff825c8dd185572a054ec8a499e999e9","sha256:b4549f2e90d870ab3d0b567dcbca2299b568eb6ca25758258ebce6671cd1de33"],"state_sha256":"0942ef9fb60794783c7ae1659d2e9407bc1d137eced9724c58fe5d13b4cadaf5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n9b4ukEorF0axW469522xqk6ifdMjyUSf+y5uVKaJS6ad07N+1qvJmoV8TxKPz7nyBCljTwHsGpBeFBWX39MAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:08:02.432630Z","bundle_sha256":"57ff5a8cc662bdbe65af963c43c633683409ff0dcb1692a550f04caf0b2b5a23"}}