{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TNYUTNIKYY4OOLKLZDZTJRWHBR","short_pith_number":"pith:TNYUTNIK","canonical_record":{"source":{"id":"1704.03421","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-04-11T17:05:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3f348e9adf484e5f71109ce3dddb40882046c45ae4678ab8b2715198506fd5c2","abstract_canon_sha256":"64ac417f6d2de5bb124625712fcc585238d0fc048fcac13030226c9ebc36657b"},"schema_version":"1.0"},"canonical_sha256":"9b7149b50ac638e72d4bc8f334c6c70c72c983c79e7258165f7ca46751be04cb","source":{"kind":"arxiv","id":"1704.03421","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03421","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03421v2","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03421","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"TNYUTNIKYY4O","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TNYUTNIKYY4OOLKL","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TNYUTNIK","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TNYUTNIKYY4OOLKLZDZTJRWHBR","target":"record","payload":{"canonical_record":{"source":{"id":"1704.03421","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-04-11T17:05:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3f348e9adf484e5f71109ce3dddb40882046c45ae4678ab8b2715198506fd5c2","abstract_canon_sha256":"64ac417f6d2de5bb124625712fcc585238d0fc048fcac13030226c9ebc36657b"},"schema_version":"1.0"},"canonical_sha256":"9b7149b50ac638e72d4bc8f334c6c70c72c983c79e7258165f7ca46751be04cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:39.959196Z","signature_b64":"3yCV8zCxKyqmNvnCc2iw5ZwpDmYV0jRGvFgb/0jv048i0IgmqgAP41GCgY2Jf8knvxvn6JrEQT6UfNDxO7gUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b7149b50ac638e72d4bc8f334c6c70c72c983c79e7258165f7ca46751be04cb","last_reissued_at":"2026-05-18T00:22:39.958732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:39.958732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.03421","source_version":2,"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-18T00:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4MbW2r7IOI8pFxQdLrK6bYGAew/ZraYBmtoLd4XbZoo5Wjb9s+CT8LL/50S4ordWqA6h+EnisB3WSr+Ykm27CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:35:29.856654Z"},"content_sha256":"25efbdfc42af8e3f828ef40ea8271ea871c4bd43af512e3b66d0b7f6f78e3916","schema_version":"1.0","event_id":"sha256:25efbdfc42af8e3f828ef40ea8271ea871c4bd43af512e3b66d0b7f6f78e3916"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TNYUTNIKYY4OOLKLZDZTJRWHBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Large Scale Clustering based on Data Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"Malika Bendechache, M-Tahar Kechadi, Nhien-An Le-Khac","submitted_at":"2017-04-11T17:05:01Z","abstract_excerpt":"Clustering techniques are very attractive for extracting and identifying patterns in datasets. However, their application to very large spatial datasets presents numerous challenges such as high-dimensionality data, heterogeneity, and high complexity of some algorithms. For instance, some algorithms may have linear complexity but they require the domain knowledge in order to determine their input parameters. Distributed clustering techniques constitute a very good alternative to the big data challenges (e.g.,Volume, Variety, Veracity, and Velocity). Usually these techniques consist of two phas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03421","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"},"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-18T00:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QKwVrbTyX61uc43PusaOX20S5OZP2ciqvigKg8Re4F0tYurzTvJu9Oe1LENRW3A2X4tdOJKJmzoV/afYlpF8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:35:29.857005Z"},"content_sha256":"f9e959e747643e31cefce19c04494652132bc58252d39e45dbae5232a9aeb962","schema_version":"1.0","event_id":"sha256:f9e959e747643e31cefce19c04494652132bc58252d39e45dbae5232a9aeb962"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNYUTNIKYY4OOLKLZDZTJRWHBR/bundle.json","state_url":"https://pith.science/pith/TNYUTNIKYY4OOLKLZDZTJRWHBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNYUTNIKYY4OOLKLZDZTJRWHBR/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-06-28T10:35:29Z","links":{"resolver":"https://pith.science/pith/TNYUTNIKYY4OOLKLZDZTJRWHBR","bundle":"https://pith.science/pith/TNYUTNIKYY4OOLKLZDZTJRWHBR/bundle.json","state":"https://pith.science/pith/TNYUTNIKYY4OOLKLZDZTJRWHBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNYUTNIKYY4OOLKLZDZTJRWHBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TNYUTNIKYY4OOLKLZDZTJRWHBR","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":"64ac417f6d2de5bb124625712fcc585238d0fc048fcac13030226c9ebc36657b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-04-11T17:05:01Z","title_canon_sha256":"3f348e9adf484e5f71109ce3dddb40882046c45ae4678ab8b2715198506fd5c2"},"schema_version":"1.0","source":{"id":"1704.03421","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03421","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03421v2","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03421","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"TNYUTNIKYY4O","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TNYUTNIKYY4OOLKL","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TNYUTNIK","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:f9e959e747643e31cefce19c04494652132bc58252d39e45dbae5232a9aeb962","target":"graph","created_at":"2026-05-18T00:22:39Z","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":"Clustering techniques are very attractive for extracting and identifying patterns in datasets. However, their application to very large spatial datasets presents numerous challenges such as high-dimensionality data, heterogeneity, and high complexity of some algorithms. For instance, some algorithms may have linear complexity but they require the domain knowledge in order to determine their input parameters. Distributed clustering techniques constitute a very good alternative to the big data challenges (e.g.,Volume, Variety, Veracity, and Velocity). Usually these techniques consist of two phas","authors_text":"Malika Bendechache, M-Tahar Kechadi, Nhien-An Le-Khac","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-04-11T17:05:01Z","title":"Efficient Large Scale Clustering based on Data Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03421","kind":"arxiv","version":2},"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:25efbdfc42af8e3f828ef40ea8271ea871c4bd43af512e3b66d0b7f6f78e3916","target":"record","created_at":"2026-05-18T00:22:39Z","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":"64ac417f6d2de5bb124625712fcc585238d0fc048fcac13030226c9ebc36657b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-04-11T17:05:01Z","title_canon_sha256":"3f348e9adf484e5f71109ce3dddb40882046c45ae4678ab8b2715198506fd5c2"},"schema_version":"1.0","source":{"id":"1704.03421","kind":"arxiv","version":2}},"canonical_sha256":"9b7149b50ac638e72d4bc8f334c6c70c72c983c79e7258165f7ca46751be04cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b7149b50ac638e72d4bc8f334c6c70c72c983c79e7258165f7ca46751be04cb","first_computed_at":"2026-05-18T00:22:39.958732Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:39.958732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3yCV8zCxKyqmNvnCc2iw5ZwpDmYV0jRGvFgb/0jv048i0IgmqgAP41GCgY2Jf8knvxvn6JrEQT6UfNDxO7gUAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:39.959196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03421","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25efbdfc42af8e3f828ef40ea8271ea871c4bd43af512e3b66d0b7f6f78e3916","sha256:f9e959e747643e31cefce19c04494652132bc58252d39e45dbae5232a9aeb962"],"state_sha256":"772e03dae7093b4225677b8ad712d38ea1317e266dc8281dd11782758171c50e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FGKJlRP+U3pYyTMe+CDF5xnMWv0a8fEe4gCqGatdsM4WGla+5gX6oyTauQkQMgWkomqOJqADWP6DTMmd8OTAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T10:35:29.858965Z","bundle_sha256":"c88dad5d2d405e1d6772f7ceb997bc55e8d236e3d4d3d4fda36bd6d251efa08f"}}