{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5OY46DIEGCFSD5DYJWQI6IB3Y3","short_pith_number":"pith:5OY46DIE","schema_version":"1.0","canonical_sha256":"ebb1cf0d04308b21f4784da08f203bc6e184560f87ebf81bc849ad6123a09e03","source":{"kind":"arxiv","id":"1810.01049","version":1},"attestation_state":"computed","paper":{"title":"A Unified Framework for Clustering Constrained Data without Locality Property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CG","authors_text":"Hu Ding, Jinhui Xu","submitted_at":"2018-10-02T03:18:15Z","abstract_excerpt":"In this paper, we consider a class of constrained clustering problems of points in $\\mathbb{R}^{d}$, where $d$ could be rather high. A common feature of these problems is that their optimal clusterings no longer have the locality property (due to the additional constraints), which is a key property required by many algorithms for their unconstrained counterparts. To overcome the difficulty caused by the loss of locality, we present in this paper a unified framework, called {\\em Peeling-and-Enclosing (PnE)}, to iteratively solve two variants of the constrained clustering problems, {\\em constrai"},"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":"1810.01049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-10-02T03:18:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9a901a7da7b3e01dee191700f8a803849496b14a40c0782e6edbea75da6b4461","abstract_canon_sha256":"1760f908ff03552b3401919ff410ad1549a6eb5fe1f0e8ff11716c2f1cd94c79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:19.040528Z","signature_b64":"2SyKdwWXmjil0xfGek1eLYYdoCFJkJ8wQeepSsNDW7pclxvtCW9Maf5sYM5Pa2GSWKgO43w+RA146NPGqzbWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebb1cf0d04308b21f4784da08f203bc6e184560f87ebf81bc849ad6123a09e03","last_reissued_at":"2026-05-18T00:04:19.039774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:19.039774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Framework for Clustering Constrained Data without Locality Property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CG","authors_text":"Hu Ding, Jinhui Xu","submitted_at":"2018-10-02T03:18:15Z","abstract_excerpt":"In this paper, we consider a class of constrained clustering problems of points in $\\mathbb{R}^{d}$, where $d$ could be rather high. A common feature of these problems is that their optimal clusterings no longer have the locality property (due to the additional constraints), which is a key property required by many algorithms for their unconstrained counterparts. To overcome the difficulty caused by the loss of locality, we present in this paper a unified framework, called {\\em Peeling-and-Enclosing (PnE)}, to iteratively solve two variants of the constrained clustering problems, {\\em constrai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01049","kind":"arxiv","version":1},"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":"1810.01049","created_at":"2026-05-18T00:04:19.039885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01049v1","created_at":"2026-05-18T00:04:19.039885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01049","created_at":"2026-05-18T00:04:19.039885+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OY46DIEGCFS","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OY46DIEGCFSD5DY","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OY46DIE","created_at":"2026-05-18T12:32:08.215937+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/5OY46DIEGCFSD5DYJWQI6IB3Y3","json":"https://pith.science/pith/5OY46DIEGCFSD5DYJWQI6IB3Y3.json","graph_json":"https://pith.science/api/pith-number/5OY46DIEGCFSD5DYJWQI6IB3Y3/graph.json","events_json":"https://pith.science/api/pith-number/5OY46DIEGCFSD5DYJWQI6IB3Y3/events.json","paper":"https://pith.science/paper/5OY46DIE"},"agent_actions":{"view_html":"https://pith.science/pith/5OY46DIEGCFSD5DYJWQI6IB3Y3","download_json":"https://pith.science/pith/5OY46DIEGCFSD5DYJWQI6IB3Y3.json","view_paper":"https://pith.science/paper/5OY46DIE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01049&json=true","fetch_graph":"https://pith.science/api/pith-number/5OY46DIEGCFSD5DYJWQI6IB3Y3/graph.json","fetch_events":"https://pith.science/api/pith-number/5OY46DIEGCFSD5DYJWQI6IB3Y3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OY46DIEGCFSD5DYJWQI6IB3Y3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OY46DIEGCFSD5DYJWQI6IB3Y3/action/storage_attestation","attest_author":"https://pith.science/pith/5OY46DIEGCFSD5DYJWQI6IB3Y3/action/author_attestation","sign_citation":"https://pith.science/pith/5OY46DIEGCFSD5DYJWQI6IB3Y3/action/citation_signature","submit_replication":"https://pith.science/pith/5OY46DIEGCFSD5DYJWQI6IB3Y3/action/replication_record"}},"created_at":"2026-05-18T00:04:19.039885+00:00","updated_at":"2026-05-18T00:04:19.039885+00:00"}