{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GZ3UJB5FP3RCRNF5LKJ2M47JOY","short_pith_number":"pith:GZ3UJB5F","schema_version":"1.0","canonical_sha256":"36774487a57ee228b4bd5a93a673e976391d205ac9eb0457eaa618561df00f6f","source":{"kind":"arxiv","id":"1311.2334","version":4},"attestation_state":"computed","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$"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.2334","created_at":"2026-05-18T03:00:49.094331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.2334v4","created_at":"2026-05-18T03:00:49.094331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2334","created_at":"2026-05-18T03:00:49.094331+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZ3UJB5FP3RC","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZ3UJB5FP3RCRNF5","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZ3UJB5F","created_at":"2026-05-18T12:27:46.883200+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/GZ3UJB5FP3RCRNF5LKJ2M47JOY","json":"https://pith.science/pith/GZ3UJB5FP3RCRNF5LKJ2M47JOY.json","graph_json":"https://pith.science/api/pith-number/GZ3UJB5FP3RCRNF5LKJ2M47JOY/graph.json","events_json":"https://pith.science/api/pith-number/GZ3UJB5FP3RCRNF5LKJ2M47JOY/events.json","paper":"https://pith.science/paper/GZ3UJB5F"},"agent_actions":{"view_html":"https://pith.science/pith/GZ3UJB5FP3RCRNF5LKJ2M47JOY","download_json":"https://pith.science/pith/GZ3UJB5FP3RCRNF5LKJ2M47JOY.json","view_paper":"https://pith.science/paper/GZ3UJB5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.2334&json=true","fetch_graph":"https://pith.science/api/pith-number/GZ3UJB5FP3RCRNF5LKJ2M47JOY/graph.json","fetch_events":"https://pith.science/api/pith-number/GZ3UJB5FP3RCRNF5LKJ2M47JOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZ3UJB5FP3RCRNF5LKJ2M47JOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZ3UJB5FP3RCRNF5LKJ2M47JOY/action/storage_attestation","attest_author":"https://pith.science/pith/GZ3UJB5FP3RCRNF5LKJ2M47JOY/action/author_attestation","sign_citation":"https://pith.science/pith/GZ3UJB5FP3RCRNF5LKJ2M47JOY/action/citation_signature","submit_replication":"https://pith.science/pith/GZ3UJB5FP3RCRNF5LKJ2M47JOY/action/replication_record"}},"created_at":"2026-05-18T03:00:49.094331+00:00","updated_at":"2026-05-18T03:00:49.094331+00:00"}