{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GZ3UJB5FP3RCRNF5LKJ2M47JOY","short_pith_number":"pith:GZ3UJB5F","canonical_record":{"source":{"id":"1311.2334","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-11T02:37:16Z","cross_cats_sorted":[],"title_canon_sha256":"d8552f826b9f6e9f9ebd4f55f4a8a1948d1a07cd4c8a547a897953f0563b91a5","abstract_canon_sha256":"67477d8aff61df79c95d0b67f9348fda079003ee1d8a86b237022ecc6928d1ab"},"schema_version":"1.0"},"canonical_sha256":"36774487a57ee228b4bd5a93a673e976391d205ac9eb0457eaa618561df00f6f","source":{"kind":"arxiv","id":"1311.2334","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2334","created_at":"2026-05-18T03:00:49Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2334v4","created_at":"2026-05-18T03:00:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2334","created_at":"2026-05-18T03:00:49Z"},{"alias_kind":"pith_short_12","alias_value":"GZ3UJB5FP3RC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"GZ3UJB5FP3RCRNF5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"GZ3UJB5F","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GZ3UJB5FP3RCRNF5LKJ2M47JOY","target":"record","payload":{"canonical_record":{"source":{"id":"1311.2334","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-11T02:37:16Z","cross_cats_sorted":[],"title_canon_sha256":"d8552f826b9f6e9f9ebd4f55f4a8a1948d1a07cd4c8a547a897953f0563b91a5","abstract_canon_sha256":"67477d8aff61df79c95d0b67f9348fda079003ee1d8a86b237022ecc6928d1ab"},"schema_version":"1.0"},"canonical_sha256":"36774487a57ee228b4bd5a93a673e976391d205ac9eb0457eaa618561df00f6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:49.094945Z","signature_b64":"QfnYycVtuQCJkY//nTsBy13Bce+i3asKiz07N9UyREyxFABHvfBsytD5nvS7XVgQIt1oo8FyQEALF/cpNGWqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36774487a57ee228b4bd5a93a673e976391d205ac9eb0457eaa618561df00f6f","last_reissued_at":"2026-05-18T03:00:49.094221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:49.094221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.2334","source_version":4,"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-18T03:00:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UI5RIMK3ARO9y2Y3rI8ubUysfwH72GT6SLtSf4ftoPvpu6Htqy9v8PuNWev0M9v5VTQu43bZBQ7ir9k8p1jDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:42:04.678975Z"},"content_sha256":"f02962a63d4d245c49defd2d05bfc859d1f165169aa33ec6ad95b6bf010999dc","schema_version":"1.0","event_id":"sha256:f02962a63d4d245c49defd2d05bfc859d1f165169aa33ec6ad95b6bf010999dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GZ3UJB5FP3RCRNF5LKJ2M47JOY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Embed and Conquer: Scalable Embeddings for Kernel k-Means on MapReduce","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ahmed Elgohary, Ahmed K. Farahat, Fakhri Karray, Mohamed S. Kamel","submitted_at":"2013-11-11T02:37:16Z","abstract_excerpt":"The kernel $k$-means is an effective method for data clustering which extends the commonly-used $k$-means algorithm to work on a similarity matrix over complex data structures. The kernel $k$-means algorithm is however computationally very complex as it requires the complete data matrix to be calculated and stored. Further, the kernelized nature of the kernel $k$-means algorithm hinders the parallelization of its computations on modern infrastructures for distributed computing. In this paper, we are defining a family of kernel-based low-dimensional embeddings that allows for scaling kernel $k$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2334","kind":"arxiv","version":4},"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-18T03:00:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5PHdA9YgchOOeedl5g7vvjAFr1xz5tkspBciXa9CWHuKy0pHum8uqNQUh1YDt1fwiti99/FwzJsE89l44sO3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:42:04.679301Z"},"content_sha256":"194f2b583b3b48604dbadd913f76719308df8b053ced0a3ab45436760e069f86","schema_version":"1.0","event_id":"sha256:194f2b583b3b48604dbadd913f76719308df8b053ced0a3ab45436760e069f86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZ3UJB5FP3RCRNF5LKJ2M47JOY/bundle.json","state_url":"https://pith.science/pith/GZ3UJB5FP3RCRNF5LKJ2M47JOY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZ3UJB5FP3RCRNF5LKJ2M47JOY/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-08T11:42:04Z","links":{"resolver":"https://pith.science/pith/GZ3UJB5FP3RCRNF5LKJ2M47JOY","bundle":"https://pith.science/pith/GZ3UJB5FP3RCRNF5LKJ2M47JOY/bundle.json","state":"https://pith.science/pith/GZ3UJB5FP3RCRNF5LKJ2M47JOY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZ3UJB5FP3RCRNF5LKJ2M47JOY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GZ3UJB5FP3RCRNF5LKJ2M47JOY","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":"67477d8aff61df79c95d0b67f9348fda079003ee1d8a86b237022ecc6928d1ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-11T02:37:16Z","title_canon_sha256":"d8552f826b9f6e9f9ebd4f55f4a8a1948d1a07cd4c8a547a897953f0563b91a5"},"schema_version":"1.0","source":{"id":"1311.2334","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2334","created_at":"2026-05-18T03:00:49Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2334v4","created_at":"2026-05-18T03:00:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2334","created_at":"2026-05-18T03:00:49Z"},{"alias_kind":"pith_short_12","alias_value":"GZ3UJB5FP3RC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"GZ3UJB5FP3RCRNF5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"GZ3UJB5F","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:194f2b583b3b48604dbadd913f76719308df8b053ced0a3ab45436760e069f86","target":"graph","created_at":"2026-05-18T03:00:49Z","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":"The kernel $k$-means is an effective method for data clustering which extends the commonly-used $k$-means algorithm to work on a similarity matrix over complex data structures. The kernel $k$-means algorithm is however computationally very complex as it requires the complete data matrix to be calculated and stored. Further, the kernelized nature of the kernel $k$-means algorithm hinders the parallelization of its computations on modern infrastructures for distributed computing. In this paper, we are defining a family of kernel-based low-dimensional embeddings that allows for scaling kernel $k$","authors_text":"Ahmed Elgohary, Ahmed K. Farahat, Fakhri Karray, Mohamed S. Kamel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-11T02:37:16Z","title":"Embed and Conquer: Scalable Embeddings for Kernel k-Means on MapReduce"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2334","kind":"arxiv","version":4},"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:f02962a63d4d245c49defd2d05bfc859d1f165169aa33ec6ad95b6bf010999dc","target":"record","created_at":"2026-05-18T03:00:49Z","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":"67477d8aff61df79c95d0b67f9348fda079003ee1d8a86b237022ecc6928d1ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-11T02:37:16Z","title_canon_sha256":"d8552f826b9f6e9f9ebd4f55f4a8a1948d1a07cd4c8a547a897953f0563b91a5"},"schema_version":"1.0","source":{"id":"1311.2334","kind":"arxiv","version":4}},"canonical_sha256":"36774487a57ee228b4bd5a93a673e976391d205ac9eb0457eaa618561df00f6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36774487a57ee228b4bd5a93a673e976391d205ac9eb0457eaa618561df00f6f","first_computed_at":"2026-05-18T03:00:49.094221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:49.094221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QfnYycVtuQCJkY//nTsBy13Bce+i3asKiz07N9UyREyxFABHvfBsytD5nvS7XVgQIt1oo8FyQEALF/cpNGWqBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:49.094945Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2334","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f02962a63d4d245c49defd2d05bfc859d1f165169aa33ec6ad95b6bf010999dc","sha256:194f2b583b3b48604dbadd913f76719308df8b053ced0a3ab45436760e069f86"],"state_sha256":"7fbe5be8ec4df1794aeca4e61dbd94031b11ff83cac7a6ef7d78cb091c37d80b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CHL6tjfGVRexGTotRRJJU5KVfwkZwoAZbwX4/PReVx8PnaT29YDB4knA8tATgn+FV/DcmeostG5g1i9+OlEvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T11:42:04.681101Z","bundle_sha256":"6ce1f90cff5dcd63fcb50e60bdaad820cff955274c169009a99df3e2d2ffba3e"}}