{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZXS3JBIU2KNHE5765DDJXAPEKM","short_pith_number":"pith:ZXS3JBIU","canonical_record":{"source":{"id":"1204.6699","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-30T16:45:20Z","cross_cats_sorted":[],"title_canon_sha256":"580402bd25ad0f5876c9675fc6cbe4b2549ad3981ab68aa83598c91622591fb8","abstract_canon_sha256":"f9b0c6416c821c3fd8825d179d90a5f2719c324da2c7d9327d60d31fabf3eb22"},"schema_version":"1.0"},"canonical_sha256":"cde5b48514d29a7277fee8c69b81e45301ecffc0367a98e5631141c691f40e9e","source":{"kind":"arxiv","id":"1204.6699","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6699","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6699v2","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6699","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZXS3JBIU2KNH","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZXS3JBIU2KNHE576","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZXS3JBIU","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZXS3JBIU2KNHE5765DDJXAPEKM","target":"record","payload":{"canonical_record":{"source":{"id":"1204.6699","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-30T16:45:20Z","cross_cats_sorted":[],"title_canon_sha256":"580402bd25ad0f5876c9675fc6cbe4b2549ad3981ab68aa83598c91622591fb8","abstract_canon_sha256":"f9b0c6416c821c3fd8825d179d90a5f2719c324da2c7d9327d60d31fabf3eb22"},"schema_version":"1.0"},"canonical_sha256":"cde5b48514d29a7277fee8c69b81e45301ecffc0367a98e5631141c691f40e9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:43.483575Z","signature_b64":"h7qPiDjcrxzYdNPqei709Uunmphsg+ZHC+QOzSD/osIKj0ZPHSvdsfjHfWKujzCCLKXU0rhqsRaDwtuxRYtaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cde5b48514d29a7277fee8c69b81e45301ecffc0367a98e5631141c691f40e9e","last_reissued_at":"2026-05-18T03:45:43.482954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:43.482954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.6699","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-18T03:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEyDTX0EHWzN2GzjAxQExkqFwJPmPaPAqxfIMLr0Ty8+woOOqbJXoyVjkWUzNN06EcFBqRJLWeFS2mtKM6tAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T07:20:37.379471Z"},"content_sha256":"575b6c35d35a2b03e8d2fc08686f68d9a6030d52328ddcd6d88d89f78b42295c","schema_version":"1.0","event_id":"sha256:575b6c35d35a2b03e8d2fc08686f68d9a6030d52328ddcd6d88d89f78b42295c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZXS3JBIU2KNHE5765DDJXAPEKM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chromatic Clustering in High Dimensional Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hu Ding, Jinhui Xu","submitted_at":"2012-04-30T16:45:20Z","abstract_excerpt":"In this paper, we study a new type of clustering problem, called {\\em Chromatic Clustering}, in high dimensional space. Chromatic clustering seeks to partition a set of colored points into groups (or clusters) so that no group contains points with the same color and a certain objective function is optimized. In this paper, we consider two variants of the problem, chromatic $k$-means clustering (denoted as $k$-CMeans) and chromatic $k$-medians clustering (denoted as $k$-CMedians), and investigate their hardness and approximation solutions. For $k$-CMeans, we show that the additional coloring co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6699","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-18T03:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KA16+ASO6KU+jnqAczihK179cJ0nif89cC2QVUabsjKPtSuidBvbVuTSvy7/rNvwtZkHWDUeUbYrzw1vYuQxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T07:20:37.379819Z"},"content_sha256":"826aa70595f094b2be0ee59cba56682e605f7f6c0650c38386b553d2c9c3c8e9","schema_version":"1.0","event_id":"sha256:826aa70595f094b2be0ee59cba56682e605f7f6c0650c38386b553d2c9c3c8e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXS3JBIU2KNHE5765DDJXAPEKM/bundle.json","state_url":"https://pith.science/pith/ZXS3JBIU2KNHE5765DDJXAPEKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXS3JBIU2KNHE5765DDJXAPEKM/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-04T07:20:37Z","links":{"resolver":"https://pith.science/pith/ZXS3JBIU2KNHE5765DDJXAPEKM","bundle":"https://pith.science/pith/ZXS3JBIU2KNHE5765DDJXAPEKM/bundle.json","state":"https://pith.science/pith/ZXS3JBIU2KNHE5765DDJXAPEKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXS3JBIU2KNHE5765DDJXAPEKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZXS3JBIU2KNHE5765DDJXAPEKM","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":"f9b0c6416c821c3fd8825d179d90a5f2719c324da2c7d9327d60d31fabf3eb22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-30T16:45:20Z","title_canon_sha256":"580402bd25ad0f5876c9675fc6cbe4b2549ad3981ab68aa83598c91622591fb8"},"schema_version":"1.0","source":{"id":"1204.6699","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6699","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6699v2","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6699","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZXS3JBIU2KNH","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZXS3JBIU2KNHE576","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZXS3JBIU","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:826aa70595f094b2be0ee59cba56682e605f7f6c0650c38386b553d2c9c3c8e9","target":"graph","created_at":"2026-05-18T03:45:43Z","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":"In this paper, we study a new type of clustering problem, called {\\em Chromatic Clustering}, in high dimensional space. Chromatic clustering seeks to partition a set of colored points into groups (or clusters) so that no group contains points with the same color and a certain objective function is optimized. In this paper, we consider two variants of the problem, chromatic $k$-means clustering (denoted as $k$-CMeans) and chromatic $k$-medians clustering (denoted as $k$-CMedians), and investigate their hardness and approximation solutions. For $k$-CMeans, we show that the additional coloring co","authors_text":"Hu Ding, Jinhui Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-30T16:45:20Z","title":"Chromatic Clustering in High Dimensional Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6699","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:575b6c35d35a2b03e8d2fc08686f68d9a6030d52328ddcd6d88d89f78b42295c","target":"record","created_at":"2026-05-18T03:45:43Z","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":"f9b0c6416c821c3fd8825d179d90a5f2719c324da2c7d9327d60d31fabf3eb22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-30T16:45:20Z","title_canon_sha256":"580402bd25ad0f5876c9675fc6cbe4b2549ad3981ab68aa83598c91622591fb8"},"schema_version":"1.0","source":{"id":"1204.6699","kind":"arxiv","version":2}},"canonical_sha256":"cde5b48514d29a7277fee8c69b81e45301ecffc0367a98e5631141c691f40e9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cde5b48514d29a7277fee8c69b81e45301ecffc0367a98e5631141c691f40e9e","first_computed_at":"2026-05-18T03:45:43.482954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:43.482954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h7qPiDjcrxzYdNPqei709Uunmphsg+ZHC+QOzSD/osIKj0ZPHSvdsfjHfWKujzCCLKXU0rhqsRaDwtuxRYtaAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:43.483575Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.6699","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:575b6c35d35a2b03e8d2fc08686f68d9a6030d52328ddcd6d88d89f78b42295c","sha256:826aa70595f094b2be0ee59cba56682e605f7f6c0650c38386b553d2c9c3c8e9"],"state_sha256":"76cc3b2162b48cd2a55bbb9798b73d89bf4c4f75522e4c9cea1e3fe935ce7592"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b97nROSiDqQ6vLBshyQccoippUPwmIgkm5Mo0IoBQJRWsWEAuwaBFSDnOCXST5RCwxIPilkHWgPMxoG5GWDtDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T07:20:37.381718Z","bundle_sha256":"bab5d8aa8ac678e0b26ca0c37afac3c3d50d863883ec31d2735f1a770fe95ea5"}}