{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:M3HQILKELZZVPQSYGY2RK6767P","short_pith_number":"pith:M3HQILKE","canonical_record":{"source":{"id":"1703.09823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-03-28T21:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"b99de31811b9e6a6b958a2df0d5dd729a00737998efbf2ee5bce17517489ab1d","abstract_canon_sha256":"c2592721755ad3b29217a5212e021116b94dc7bc563dfdfdff7da39a383524f1"},"schema_version":"1.0"},"canonical_sha256":"66cf042d445e7357c2583635157bfefbc38e3f595d5fc6d665b90bf791b2090e","source":{"kind":"arxiv","id":"1703.09823","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09823","created_at":"2026-05-18T00:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09823v1","created_at":"2026-05-18T00:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09823","created_at":"2026-05-18T00:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"M3HQILKELZZV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M3HQILKELZZVPQSY","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M3HQILKE","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:M3HQILKELZZVPQSYGY2RK6767P","target":"record","payload":{"canonical_record":{"source":{"id":"1703.09823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-03-28T21:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"b99de31811b9e6a6b958a2df0d5dd729a00737998efbf2ee5bce17517489ab1d","abstract_canon_sha256":"c2592721755ad3b29217a5212e021116b94dc7bc563dfdfdff7da39a383524f1"},"schema_version":"1.0"},"canonical_sha256":"66cf042d445e7357c2583635157bfefbc38e3f595d5fc6d665b90bf791b2090e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:39.330606Z","signature_b64":"VsfbwqIy6Zy3T95mca/SLD6pSkBTlRfOC1RO+4DXJdi/tCAlaTzD486kKKCespoBw2oQYUHUGd187iN47vQqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66cf042d445e7357c2583635157bfefbc38e3f595d5fc6d665b90bf791b2090e","last_reissued_at":"2026-05-18T00:47:39.329753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:39.329753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.09823","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-18T00:47:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pUSDvgh1t9C3Qb3ImXWVUffg0J/Rp9dFQKf0d2uuJl4H9KW0kdcKu5xXL8emGi5rPn2u2w48zUKpaAI15oXhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:39:01.636472Z"},"content_sha256":"438ea2c09947b5ecb8c22ba195d32d4c982a2fc0bd127c34e2206ac7be0e39dc","schema_version":"1.0","event_id":"sha256:438ea2c09947b5ecb8c22ba195d32d4c982a2fc0bd127c34e2206ac7be0e39dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:M3HQILKELZZVPQSYGY2RK6767P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variance-based Clustering Technique for Distributed Data Mining Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Lamine M. Aouad, Nhien-An Le-Khac, Tahar Kechadi","submitted_at":"2017-03-28T21:59:33Z","abstract_excerpt":"Nowadays, huge amounts of data are naturally collected in distributed sites due to different facts and moving these data through the network for extracting useful knowledge is almost unfeasible for either technical reasons or policies. Furthermore, classical par- allel algorithms cannot be applied, specially in loosely coupled environments. This requires to develop scalable distributed algorithms able to return the global knowledge by aggregating local results in an effective way. In this paper we propose a distributed algorithm based on independent local clustering processes and a global merg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09823","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-18T00:47:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"duToNw5fbIZIJcOm4MlN4hnDUFlj7f8x0pkYnZuKB8W2sSL0YVYNKqI3cSqV5i1quWkqwwBiALrZap2IMLMXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:39:01.636838Z"},"content_sha256":"ee3365853f1cb6f9ee3a46339112ebcb5aba67e22cf59e26d9efcea08ccd8c64","schema_version":"1.0","event_id":"sha256:ee3365853f1cb6f9ee3a46339112ebcb5aba67e22cf59e26d9efcea08ccd8c64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3HQILKELZZVPQSYGY2RK6767P/bundle.json","state_url":"https://pith.science/pith/M3HQILKELZZVPQSYGY2RK6767P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3HQILKELZZVPQSYGY2RK6767P/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-20T15:39:01Z","links":{"resolver":"https://pith.science/pith/M3HQILKELZZVPQSYGY2RK6767P","bundle":"https://pith.science/pith/M3HQILKELZZVPQSYGY2RK6767P/bundle.json","state":"https://pith.science/pith/M3HQILKELZZVPQSYGY2RK6767P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3HQILKELZZVPQSYGY2RK6767P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:M3HQILKELZZVPQSYGY2RK6767P","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":"c2592721755ad3b29217a5212e021116b94dc7bc563dfdfdff7da39a383524f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-03-28T21:59:33Z","title_canon_sha256":"b99de31811b9e6a6b958a2df0d5dd729a00737998efbf2ee5bce17517489ab1d"},"schema_version":"1.0","source":{"id":"1703.09823","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09823","created_at":"2026-05-18T00:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09823v1","created_at":"2026-05-18T00:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09823","created_at":"2026-05-18T00:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"M3HQILKELZZV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M3HQILKELZZVPQSY","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M3HQILKE","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:ee3365853f1cb6f9ee3a46339112ebcb5aba67e22cf59e26d9efcea08ccd8c64","target":"graph","created_at":"2026-05-18T00:47: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":"Nowadays, huge amounts of data are naturally collected in distributed sites due to different facts and moving these data through the network for extracting useful knowledge is almost unfeasible for either technical reasons or policies. Furthermore, classical par- allel algorithms cannot be applied, specially in loosely coupled environments. This requires to develop scalable distributed algorithms able to return the global knowledge by aggregating local results in an effective way. In this paper we propose a distributed algorithm based on independent local clustering processes and a global merg","authors_text":"Lamine M. Aouad, Nhien-An Le-Khac, Tahar Kechadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-03-28T21:59:33Z","title":"Variance-based Clustering Technique for Distributed Data Mining Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09823","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:438ea2c09947b5ecb8c22ba195d32d4c982a2fc0bd127c34e2206ac7be0e39dc","target":"record","created_at":"2026-05-18T00:47: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":"c2592721755ad3b29217a5212e021116b94dc7bc563dfdfdff7da39a383524f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-03-28T21:59:33Z","title_canon_sha256":"b99de31811b9e6a6b958a2df0d5dd729a00737998efbf2ee5bce17517489ab1d"},"schema_version":"1.0","source":{"id":"1703.09823","kind":"arxiv","version":1}},"canonical_sha256":"66cf042d445e7357c2583635157bfefbc38e3f595d5fc6d665b90bf791b2090e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66cf042d445e7357c2583635157bfefbc38e3f595d5fc6d665b90bf791b2090e","first_computed_at":"2026-05-18T00:47:39.329753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:39.329753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VsfbwqIy6Zy3T95mca/SLD6pSkBTlRfOC1RO+4DXJdi/tCAlaTzD486kKKCespoBw2oQYUHUGd187iN47vQqAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:39.330606Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.09823","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:438ea2c09947b5ecb8c22ba195d32d4c982a2fc0bd127c34e2206ac7be0e39dc","sha256:ee3365853f1cb6f9ee3a46339112ebcb5aba67e22cf59e26d9efcea08ccd8c64"],"state_sha256":"92ef843656cd516c7763c469481b5307b10f79eae197be4b051794941790ba45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LSIU7mQj0WUw9uKRtLRAiB7ulHIv7CzxB8Fd7fkp8aV//80HQoFTytuelhLmvOFDH1uRm/UrXqXNia5l0CDNDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T15:39:01.638769Z","bundle_sha256":"cf77d89006fbc909d6744f9e3b3728c9ae002a19066a0337ecc1d40336b1ecc3"}}