{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DPTWY2DXFEMQJKASNRJOASH76U","short_pith_number":"pith:DPTWY2DX","schema_version":"1.0","canonical_sha256":"1be76c6877291904a8126c52e048fff5248b7f0d3f6a8496d309f9ba6e44f566","source":{"kind":"arxiv","id":"1807.11620","version":1},"attestation_state":"computed","paper":{"title":"K-medoids Clustering of Data Sequences with Composite Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Biao Chen, Donald J. Bucci, Pramod K. Varshney, Qunwei Li, Tiexing Wang, Yingbin Liang","submitted_at":"2018-07-31T01:10:04Z","abstract_excerpt":"This paper studies clustering of data sequences using the k-medoids algorithm. All the data sequences are assumed to be generated from \\emph{unknown} continuous distributions, which form clusters with each cluster containing a composite set of closely located distributions (based on a certain distance metric between distributions). The maximum intra-cluster distance is assumed to be smaller than the minimum inter-cluster distance, and both values are assumed to be known. The goal is to group the data sequences together if their underlying generative distributions (which are unknown) belong to "},"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":"1807.11620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-31T01:10:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8f83add98808ee6d8ed2e369f13f15de66a63477ff458e7bc55e7abc4ea7c323","abstract_canon_sha256":"59b050079985d0250e21adfc1f2e4eeec1df315388737fbe552ccfac70ac12f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:12.973460Z","signature_b64":"/3s469YUVCZEPik2niqyC+rSwJMJhKxsnINWmdMJJxj6WczHkNOH5ndg+BB6OpMmS+d7N+3bOC57nPYPiMsEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1be76c6877291904a8126c52e048fff5248b7f0d3f6a8496d309f9ba6e44f566","last_reissued_at":"2026-05-17T23:50:12.972946Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:12.972946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"K-medoids Clustering of Data Sequences with Composite Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Biao Chen, Donald J. Bucci, Pramod K. Varshney, Qunwei Li, Tiexing Wang, Yingbin Liang","submitted_at":"2018-07-31T01:10:04Z","abstract_excerpt":"This paper studies clustering of data sequences using the k-medoids algorithm. All the data sequences are assumed to be generated from \\emph{unknown} continuous distributions, which form clusters with each cluster containing a composite set of closely located distributions (based on a certain distance metric between distributions). The maximum intra-cluster distance is assumed to be smaller than the minimum inter-cluster distance, and both values are assumed to be known. The goal is to group the data sequences together if their underlying generative distributions (which are unknown) belong to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11620","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":"1807.11620","created_at":"2026-05-17T23:50:12.973022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.11620v1","created_at":"2026-05-17T23:50:12.973022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11620","created_at":"2026-05-17T23:50:12.973022+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPTWY2DXFEMQ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPTWY2DXFEMQJKAS","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPTWY2DX","created_at":"2026-05-18T12:32:19.392346+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/DPTWY2DXFEMQJKASNRJOASH76U","json":"https://pith.science/pith/DPTWY2DXFEMQJKASNRJOASH76U.json","graph_json":"https://pith.science/api/pith-number/DPTWY2DXFEMQJKASNRJOASH76U/graph.json","events_json":"https://pith.science/api/pith-number/DPTWY2DXFEMQJKASNRJOASH76U/events.json","paper":"https://pith.science/paper/DPTWY2DX"},"agent_actions":{"view_html":"https://pith.science/pith/DPTWY2DXFEMQJKASNRJOASH76U","download_json":"https://pith.science/pith/DPTWY2DXFEMQJKASNRJOASH76U.json","view_paper":"https://pith.science/paper/DPTWY2DX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.11620&json=true","fetch_graph":"https://pith.science/api/pith-number/DPTWY2DXFEMQJKASNRJOASH76U/graph.json","fetch_events":"https://pith.science/api/pith-number/DPTWY2DXFEMQJKASNRJOASH76U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPTWY2DXFEMQJKASNRJOASH76U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPTWY2DXFEMQJKASNRJOASH76U/action/storage_attestation","attest_author":"https://pith.science/pith/DPTWY2DXFEMQJKASNRJOASH76U/action/author_attestation","sign_citation":"https://pith.science/pith/DPTWY2DXFEMQJKASNRJOASH76U/action/citation_signature","submit_replication":"https://pith.science/pith/DPTWY2DXFEMQJKASNRJOASH76U/action/replication_record"}},"created_at":"2026-05-17T23:50:12.973022+00:00","updated_at":"2026-05-17T23:50:12.973022+00:00"}