{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HW7IO7MZSW44L4VS7JQRROARFZ","short_pith_number":"pith:HW7IO7MZ","canonical_record":{"source":{"id":"1705.07837","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-22T16:32:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dad2adffd35c10072e5ad62d3ba1656b1926a1077f4a5c3ffb0abaabdf9d1b4e","abstract_canon_sha256":"10d23a482783159d594884709eb09b5e54c4e432b5de1fa7392c24a3c05d5dc2"},"schema_version":"1.0"},"canonical_sha256":"3dbe877d9995b9c5f2b2fa6118b8112e666a86aab5aff305a039311aef465899","source":{"kind":"arxiv","id":"1705.07837","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07837","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07837v3","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07837","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"pith_short_12","alias_value":"HW7IO7MZSW44","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HW7IO7MZSW44L4VS","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HW7IO7MZ","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HW7IO7MZSW44L4VS7JQRROARFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07837","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-22T16:32:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dad2adffd35c10072e5ad62d3ba1656b1926a1077f4a5c3ffb0abaabdf9d1b4e","abstract_canon_sha256":"10d23a482783159d594884709eb09b5e54c4e432b5de1fa7392c24a3c05d5dc2"},"schema_version":"1.0"},"canonical_sha256":"3dbe877d9995b9c5f2b2fa6118b8112e666a86aab5aff305a039311aef465899","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:39.041009Z","signature_b64":"Epno48erfgEdN7GYBe657M8GQzlvT2Kthg8TyBm3dQgUIhOIniBEktAjGbV2H2k6Z2onX49hdVGAQR9FfnFBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dbe877d9995b9c5f2b2fa6118b8112e666a86aab5aff305a039311aef465899","last_reissued_at":"2026-05-17T23:56:39.040531Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:39.040531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07837","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-17T23:56:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cMEplTy6caa1cE9bXDfyYx6nHacntQ3fzzBenHetq2rl0xRFkJxfMnewk9pQNkj1kW8/tYb8G4C1tgedWJpkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:12:04.964349Z"},"content_sha256":"33b11ef91cce2ed5b5d4cd31345c00543115656721b98c2802f2eef19239cc7f","schema_version":"1.0","event_id":"sha256:33b11ef91cce2ed5b5d4cd31345c00543115656721b98c2802f2eef19239cc7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HW7IO7MZSW44L4VS7JQRROARFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Daniel Kuhn, Kilian Schindler, Napat Rujeerapaiboon, Wolfram Wiesemann","submitted_at":"2017-05-22T16:32:23Z","abstract_excerpt":"Plain vanilla K-means clustering has proven to be successful in practice, yet it suffers from outlier sensitivity and may produce highly unbalanced clusters. To mitigate both shortcomings, we formulate a joint outlier detection and clustering problem, which assigns a prescribed number of datapoints to an auxiliary outlier cluster and performs cardinality-constrained K-means clustering on the residual dataset, treating the cluster cardinalities as a given input. We cast this problem as a mixed-integer linear program (MILP) that admits tractable semidefinite and linear programming relaxations. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07837","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-17T23:56:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIazHgPtFjajrV44BAbBFqlsdP21JF069s2++nQwGy27+rZKycD3PUWU4IXEmAhjRY4xCWGBvYIKoLql/JcVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:12:04.965074Z"},"content_sha256":"1da207b359665f28202000605d7b2069a887cee155fbec8ad18da6b78e91fb12","schema_version":"1.0","event_id":"sha256:1da207b359665f28202000605d7b2069a887cee155fbec8ad18da6b78e91fb12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HW7IO7MZSW44L4VS7JQRROARFZ/bundle.json","state_url":"https://pith.science/pith/HW7IO7MZSW44L4VS7JQRROARFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HW7IO7MZSW44L4VS7JQRROARFZ/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-26T23:12:04Z","links":{"resolver":"https://pith.science/pith/HW7IO7MZSW44L4VS7JQRROARFZ","bundle":"https://pith.science/pith/HW7IO7MZSW44L4VS7JQRROARFZ/bundle.json","state":"https://pith.science/pith/HW7IO7MZSW44L4VS7JQRROARFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HW7IO7MZSW44L4VS7JQRROARFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HW7IO7MZSW44L4VS7JQRROARFZ","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":"10d23a482783159d594884709eb09b5e54c4e432b5de1fa7392c24a3c05d5dc2","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-22T16:32:23Z","title_canon_sha256":"dad2adffd35c10072e5ad62d3ba1656b1926a1077f4a5c3ffb0abaabdf9d1b4e"},"schema_version":"1.0","source":{"id":"1705.07837","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07837","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07837v3","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07837","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"pith_short_12","alias_value":"HW7IO7MZSW44","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HW7IO7MZSW44L4VS","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HW7IO7MZ","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:1da207b359665f28202000605d7b2069a887cee155fbec8ad18da6b78e91fb12","target":"graph","created_at":"2026-05-17T23:56:39Z","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":"Plain vanilla K-means clustering has proven to be successful in practice, yet it suffers from outlier sensitivity and may produce highly unbalanced clusters. To mitigate both shortcomings, we formulate a joint outlier detection and clustering problem, which assigns a prescribed number of datapoints to an auxiliary outlier cluster and performs cardinality-constrained K-means clustering on the residual dataset, treating the cluster cardinalities as a given input. We cast this problem as a mixed-integer linear program (MILP) that admits tractable semidefinite and linear programming relaxations. W","authors_text":"Daniel Kuhn, Kilian Schindler, Napat Rujeerapaiboon, Wolfram Wiesemann","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-22T16:32:23Z","title":"Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07837","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:33b11ef91cce2ed5b5d4cd31345c00543115656721b98c2802f2eef19239cc7f","target":"record","created_at":"2026-05-17T23:56:39Z","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":"10d23a482783159d594884709eb09b5e54c4e432b5de1fa7392c24a3c05d5dc2","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-22T16:32:23Z","title_canon_sha256":"dad2adffd35c10072e5ad62d3ba1656b1926a1077f4a5c3ffb0abaabdf9d1b4e"},"schema_version":"1.0","source":{"id":"1705.07837","kind":"arxiv","version":3}},"canonical_sha256":"3dbe877d9995b9c5f2b2fa6118b8112e666a86aab5aff305a039311aef465899","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dbe877d9995b9c5f2b2fa6118b8112e666a86aab5aff305a039311aef465899","first_computed_at":"2026-05-17T23:56:39.040531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:39.040531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Epno48erfgEdN7GYBe657M8GQzlvT2Kthg8TyBm3dQgUIhOIniBEktAjGbV2H2k6Z2onX49hdVGAQR9FfnFBBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:39.041009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07837","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33b11ef91cce2ed5b5d4cd31345c00543115656721b98c2802f2eef19239cc7f","sha256:1da207b359665f28202000605d7b2069a887cee155fbec8ad18da6b78e91fb12"],"state_sha256":"e85e391e35fb87413b16f03741668a10b37e335bc4f9b3794cdb44fc36e893be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQWotyihlxa5k3Ncx3dV/fnBcANyrsLOlczGnfFmVT/SgbmiiqnLcRV0dpVxyCpjEg+rfduATVQRAuZEycmxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:12:04.968718Z","bundle_sha256":"758e57f0ed3d96a5777f48de3ef9a68dce0563b3249ce4e423087eb7a9842ec5"}}