{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DPTWY2DXFEMQJKASNRJOASH76U","short_pith_number":"pith:DPTWY2DX","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"},"canonical_sha256":"1be76c6877291904a8126c52e048fff5248b7f0d3f6a8496d309f9ba6e44f566","source":{"kind":"arxiv","id":"1807.11620","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11620","created_at":"2026-05-17T23:50:12Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11620v1","created_at":"2026-05-17T23:50:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11620","created_at":"2026-05-17T23:50:12Z"},{"alias_kind":"pith_short_12","alias_value":"DPTWY2DXFEMQ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DPTWY2DXFEMQJKAS","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DPTWY2DX","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DPTWY2DXFEMQJKASNRJOASH76U","target":"record","payload":{"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"},"canonical_sha256":"1be76c6877291904a8126c52e048fff5248b7f0d3f6a8496d309f9ba6e44f566","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"},"source_kind":"arxiv","source_id":"1807.11620","source_version":1,"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-17T23:50:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jndGlnC6U4IBPOnJY7Mo8lGWtRQzhmlsIH03q1880XkVAc8RcWpxZ0k2DkifOngmmhy7WuA12p2kTX04NmXPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:38:30.651160Z"},"content_sha256":"d839e7a4afea47710d2374e5093a214ccfdfd1fedf2a90aaca099d0abd7f1bd5","schema_version":"1.0","event_id":"sha256:d839e7a4afea47710d2374e5093a214ccfdfd1fedf2a90aaca099d0abd7f1bd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DPTWY2DXFEMQJKASNRJOASH76U","target":"graph","payload":{"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"},"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-17T23:50:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eAZNoLXc5KkAHyEj47qBqJ/0RGAJyUR21rUKsGAD++mMX21/l5atwTkAm6d5Bw3ir8zHaRM6fSd5B5+ygz3eCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:38:30.651529Z"},"content_sha256":"760a9e505e239d8695fba0a6d819ca3442fc73eaf37a94675b8b3a87dad1a5ca","schema_version":"1.0","event_id":"sha256:760a9e505e239d8695fba0a6d819ca3442fc73eaf37a94675b8b3a87dad1a5ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPTWY2DXFEMQJKASNRJOASH76U/bundle.json","state_url":"https://pith.science/pith/DPTWY2DXFEMQJKASNRJOASH76U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPTWY2DXFEMQJKASNRJOASH76U/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-05-30T04:38:30Z","links":{"resolver":"https://pith.science/pith/DPTWY2DXFEMQJKASNRJOASH76U","bundle":"https://pith.science/pith/DPTWY2DXFEMQJKASNRJOASH76U/bundle.json","state":"https://pith.science/pith/DPTWY2DXFEMQJKASNRJOASH76U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPTWY2DXFEMQJKASNRJOASH76U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DPTWY2DXFEMQJKASNRJOASH76U","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":"59b050079985d0250e21adfc1f2e4eeec1df315388737fbe552ccfac70ac12f0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-31T01:10:04Z","title_canon_sha256":"8f83add98808ee6d8ed2e369f13f15de66a63477ff458e7bc55e7abc4ea7c323"},"schema_version":"1.0","source":{"id":"1807.11620","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11620","created_at":"2026-05-17T23:50:12Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11620v1","created_at":"2026-05-17T23:50:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11620","created_at":"2026-05-17T23:50:12Z"},{"alias_kind":"pith_short_12","alias_value":"DPTWY2DXFEMQ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DPTWY2DXFEMQJKAS","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DPTWY2DX","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:760a9e505e239d8695fba0a6d819ca3442fc73eaf37a94675b8b3a87dad1a5ca","target":"graph","created_at":"2026-05-17T23:50:12Z","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":"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 ","authors_text":"Biao Chen, Donald J. Bucci, Pramod K. Varshney, Qunwei Li, Tiexing Wang, Yingbin Liang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-31T01:10:04Z","title":"K-medoids Clustering of Data Sequences with Composite Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11620","kind":"arxiv","version":1},"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:d839e7a4afea47710d2374e5093a214ccfdfd1fedf2a90aaca099d0abd7f1bd5","target":"record","created_at":"2026-05-17T23:50:12Z","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":"59b050079985d0250e21adfc1f2e4eeec1df315388737fbe552ccfac70ac12f0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-31T01:10:04Z","title_canon_sha256":"8f83add98808ee6d8ed2e369f13f15de66a63477ff458e7bc55e7abc4ea7c323"},"schema_version":"1.0","source":{"id":"1807.11620","kind":"arxiv","version":1}},"canonical_sha256":"1be76c6877291904a8126c52e048fff5248b7f0d3f6a8496d309f9ba6e44f566","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1be76c6877291904a8126c52e048fff5248b7f0d3f6a8496d309f9ba6e44f566","first_computed_at":"2026-05-17T23:50:12.972946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:12.972946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/3s469YUVCZEPik2niqyC+rSwJMJhKxsnINWmdMJJxj6WczHkNOH5ndg+BB6OpMmS+d7N+3bOC57nPYPiMsEDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:12.973460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.11620","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d839e7a4afea47710d2374e5093a214ccfdfd1fedf2a90aaca099d0abd7f1bd5","sha256:760a9e505e239d8695fba0a6d819ca3442fc73eaf37a94675b8b3a87dad1a5ca"],"state_sha256":"26c842c2e33e695335bc5c8ff3699b6b4a6a1a34cebdca39923e74d409ef5a5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EnM4j+lwWO6n6NcVDNcWMA9xlk6jYBbONvuYnCglD82smM53iSZMsJxZL5wiKVs0wcxGiqE37DJOGuezvt+sCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:38:30.653781Z","bundle_sha256":"d4cece45467c1181d269991fced2b16be524511187568a0316c8662c6f93c7bd"}}