{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:USPSNBHLTL6OW7RJUEMHNMRBQE","short_pith_number":"pith:USPSNBHL","schema_version":"1.0","canonical_sha256":"a49f2684eb9afceb7e29a11876b221810725339ea48f52c70a987159a5134545","source":{"kind":"arxiv","id":"1904.08412","version":1},"attestation_state":"computed","paper":{"title":"SCE: A manifold regularized set-covering method for data partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.CV","authors_text":"Dacheng Tao, Quanmao Lu, Xuelong Li, Yongsheng Dong","submitted_at":"2019-04-17T04:43:17Z","abstract_excerpt":"Cluster analysis plays a very important role in data analysis. In these years, cluster ensemble, as a cluster analysis tool, has drawn much attention for its robustness, stability, and accuracy. Many efforts have been done to combine different initial clustering results into a single clustering solution with better performance. However, they neglect the structure information of the raw data in performing the cluster ensemble. In this paper, we propose a Structural Cluster Ensemble (SCE) algorithm for data partitioning formulated as a set-covering problem. In particular, we construct a Laplacia"},"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":"1904.08412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-17T04:43:17Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"dd29ff3ff9ae2e43f1972271b141ecf61a2354d9011efc820ac742d8496285c4","abstract_canon_sha256":"1b8cb38cec0b8530f187b04792092f1042e7201c6ef1894185e6815a025d64d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:14.293238Z","signature_b64":"cH4EId8+Lz7r4fM4mGYv1t32g5opiFR7RYcz6IVIGIfBmK1gCnyFvcOSI3issL/BK8mhvL4U4Ki8QE8G28QmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a49f2684eb9afceb7e29a11876b221810725339ea48f52c70a987159a5134545","last_reissued_at":"2026-05-17T23:48:14.292542Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:14.292542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SCE: A manifold regularized set-covering method for data partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.CV","authors_text":"Dacheng Tao, Quanmao Lu, Xuelong Li, Yongsheng Dong","submitted_at":"2019-04-17T04:43:17Z","abstract_excerpt":"Cluster analysis plays a very important role in data analysis. In these years, cluster ensemble, as a cluster analysis tool, has drawn much attention for its robustness, stability, and accuracy. Many efforts have been done to combine different initial clustering results into a single clustering solution with better performance. However, they neglect the structure information of the raw data in performing the cluster ensemble. In this paper, we propose a Structural Cluster Ensemble (SCE) algorithm for data partitioning formulated as a set-covering problem. In particular, we construct a Laplacia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08412","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":"1904.08412","created_at":"2026-05-17T23:48:14.292658+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08412v1","created_at":"2026-05-17T23:48:14.292658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08412","created_at":"2026-05-17T23:48:14.292658+00:00"},{"alias_kind":"pith_short_12","alias_value":"USPSNBHLTL6O","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"USPSNBHLTL6OW7RJ","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"USPSNBHL","created_at":"2026-05-18T12:33:30.264802+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/USPSNBHLTL6OW7RJUEMHNMRBQE","json":"https://pith.science/pith/USPSNBHLTL6OW7RJUEMHNMRBQE.json","graph_json":"https://pith.science/api/pith-number/USPSNBHLTL6OW7RJUEMHNMRBQE/graph.json","events_json":"https://pith.science/api/pith-number/USPSNBHLTL6OW7RJUEMHNMRBQE/events.json","paper":"https://pith.science/paper/USPSNBHL"},"agent_actions":{"view_html":"https://pith.science/pith/USPSNBHLTL6OW7RJUEMHNMRBQE","download_json":"https://pith.science/pith/USPSNBHLTL6OW7RJUEMHNMRBQE.json","view_paper":"https://pith.science/paper/USPSNBHL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08412&json=true","fetch_graph":"https://pith.science/api/pith-number/USPSNBHLTL6OW7RJUEMHNMRBQE/graph.json","fetch_events":"https://pith.science/api/pith-number/USPSNBHLTL6OW7RJUEMHNMRBQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USPSNBHLTL6OW7RJUEMHNMRBQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USPSNBHLTL6OW7RJUEMHNMRBQE/action/storage_attestation","attest_author":"https://pith.science/pith/USPSNBHLTL6OW7RJUEMHNMRBQE/action/author_attestation","sign_citation":"https://pith.science/pith/USPSNBHLTL6OW7RJUEMHNMRBQE/action/citation_signature","submit_replication":"https://pith.science/pith/USPSNBHLTL6OW7RJUEMHNMRBQE/action/replication_record"}},"created_at":"2026-05-17T23:48:14.292658+00:00","updated_at":"2026-05-17T23:48:14.292658+00:00"}