{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZXS3JBIU2KNHE5765DDJXAPEKM","short_pith_number":"pith:ZXS3JBIU","schema_version":"1.0","canonical_sha256":"cde5b48514d29a7277fee8c69b81e45301ecffc0367a98e5631141c691f40e9e","source":{"kind":"arxiv","id":"1204.6699","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.6699","created_at":"2026-05-18T03:45:43.483054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.6699v2","created_at":"2026-05-18T03:45:43.483054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6699","created_at":"2026-05-18T03:45:43.483054+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXS3JBIU2KNH","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXS3JBIU2KNHE576","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXS3JBIU","created_at":"2026-05-18T12:27:30.460161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZXS3JBIU2KNHE5765DDJXAPEKM","json":"https://pith.science/pith/ZXS3JBIU2KNHE5765DDJXAPEKM.json","graph_json":"https://pith.science/api/pith-number/ZXS3JBIU2KNHE5765DDJXAPEKM/graph.json","events_json":"https://pith.science/api/pith-number/ZXS3JBIU2KNHE5765DDJXAPEKM/events.json","paper":"https://pith.science/paper/ZXS3JBIU"},"agent_actions":{"view_html":"https://pith.science/pith/ZXS3JBIU2KNHE5765DDJXAPEKM","download_json":"https://pith.science/pith/ZXS3JBIU2KNHE5765DDJXAPEKM.json","view_paper":"https://pith.science/paper/ZXS3JBIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.6699&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXS3JBIU2KNHE5765DDJXAPEKM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXS3JBIU2KNHE5765DDJXAPEKM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXS3JBIU2KNHE5765DDJXAPEKM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXS3JBIU2KNHE5765DDJXAPEKM/action/storage_attestation","attest_author":"https://pith.science/pith/ZXS3JBIU2KNHE5765DDJXAPEKM/action/author_attestation","sign_citation":"https://pith.science/pith/ZXS3JBIU2KNHE5765DDJXAPEKM/action/citation_signature","submit_replication":"https://pith.science/pith/ZXS3JBIU2KNHE5765DDJXAPEKM/action/replication_record"}},"created_at":"2026-05-18T03:45:43.483054+00:00","updated_at":"2026-05-18T03:45:43.483054+00:00"}