{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KFN3G5OYNLJVKM6WVBJ2KWB4ON","short_pith_number":"pith:KFN3G5OY","canonical_record":{"source":{"id":"1610.04794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-15T22:51:06Z","cross_cats_sorted":[],"title_canon_sha256":"d949fc60a596e98e53d402083385e50584da41abfe1112a171422a6d350d0c4b","abstract_canon_sha256":"829923c2715ccf087e04e24970b61d4724486b8a1128e74a9c9c24862e5de8e1"},"schema_version":"1.0"},"canonical_sha256":"515bb375d86ad35533d6a853a5583c73403f0f0df8c22a9af3df70b56a473c7a","source":{"kind":"arxiv","id":"1610.04794","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04794","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04794v2","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04794","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"KFN3G5OYNLJV","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KFN3G5OYNLJVKM6W","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KFN3G5OY","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KFN3G5OYNLJVKM6WVBJ2KWB4ON","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-15T22:51:06Z","cross_cats_sorted":[],"title_canon_sha256":"d949fc60a596e98e53d402083385e50584da41abfe1112a171422a6d350d0c4b","abstract_canon_sha256":"829923c2715ccf087e04e24970b61d4724486b8a1128e74a9c9c24862e5de8e1"},"schema_version":"1.0"},"canonical_sha256":"515bb375d86ad35533d6a853a5583c73403f0f0df8c22a9af3df70b56a473c7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:23.784133Z","signature_b64":"v7Sxdn0r0lXHsrvWXGeZrBzAnpHLYtDdsX8qN8OH3+PrDt1xUrHrahrl6mXyVy94pgfUXNpCxdT1qwJWeNX7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"515bb375d86ad35533d6a853a5583c73403f0f0df8c22a9af3df70b56a473c7a","last_reissued_at":"2026-05-18T00:42:23.783696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:23.783696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04794","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:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYDLmXVf7JagAVFG5nSYr8xSQglfyizcuH2laNg1L63K+PKGysosR/J11c5ZCtkXNpo54HXMUmngRhN1quTgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:24:53.930919Z"},"content_sha256":"f013bff6af3eeeafad0903c27b4ac77b6f72d655f2e99f152f3b9936627e2c73","schema_version":"1.0","event_id":"sha256:f013bff6af3eeeafad0903c27b4ac77b6f72d655f2e99f152f3b9936627e2c73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KFN3G5OYNLJVKM6WVBJ2KWB4ON","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bo Yang, Mingyi Hong, Nicholas D. Sidiropoulos, Xiao Fu","submitted_at":"2016-10-15T22:51:06Z","abstract_excerpt":"Most learning approaches treat dimensionality reduction (DR) and clustering separately (i.e., sequentially), but recent research has shown that optimizing the two tasks jointly can substantially improve the performance of both. The premise behind the latter genre is that the data samples are obtained via linear transformation of latent representations that are easy to cluster; but in practice, the transformation from the latent space to the data can be more complicated. In this work, we assume that this transformation is an unknown and possibly nonlinear function. To recover the `clustering-fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04794","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:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CHsg7M+DEBMQelxrY44UP7NINTSoJB8FWmajQO21Zf9nMo5ouJzYUgMAgtdbwoXvy4jN7jyM5hvgiMkZ00s6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:24:53.931618Z"},"content_sha256":"3b656905be717694970a51f30fb943147db6071349d3f7b12581bb40a84be9db","schema_version":"1.0","event_id":"sha256:3b656905be717694970a51f30fb943147db6071349d3f7b12581bb40a84be9db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KFN3G5OYNLJVKM6WVBJ2KWB4ON/bundle.json","state_url":"https://pith.science/pith/KFN3G5OYNLJVKM6WVBJ2KWB4ON/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KFN3G5OYNLJVKM6WVBJ2KWB4ON/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-09T07:24:53Z","links":{"resolver":"https://pith.science/pith/KFN3G5OYNLJVKM6WVBJ2KWB4ON","bundle":"https://pith.science/pith/KFN3G5OYNLJVKM6WVBJ2KWB4ON/bundle.json","state":"https://pith.science/pith/KFN3G5OYNLJVKM6WVBJ2KWB4ON/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KFN3G5OYNLJVKM6WVBJ2KWB4ON/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KFN3G5OYNLJVKM6WVBJ2KWB4ON","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":"829923c2715ccf087e04e24970b61d4724486b8a1128e74a9c9c24862e5de8e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-15T22:51:06Z","title_canon_sha256":"d949fc60a596e98e53d402083385e50584da41abfe1112a171422a6d350d0c4b"},"schema_version":"1.0","source":{"id":"1610.04794","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04794","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04794v2","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04794","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"KFN3G5OYNLJV","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KFN3G5OYNLJVKM6W","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KFN3G5OY","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:3b656905be717694970a51f30fb943147db6071349d3f7b12581bb40a84be9db","target":"graph","created_at":"2026-05-18T00:42:23Z","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":"Most learning approaches treat dimensionality reduction (DR) and clustering separately (i.e., sequentially), but recent research has shown that optimizing the two tasks jointly can substantially improve the performance of both. The premise behind the latter genre is that the data samples are obtained via linear transformation of latent representations that are easy to cluster; but in practice, the transformation from the latent space to the data can be more complicated. In this work, we assume that this transformation is an unknown and possibly nonlinear function. To recover the `clustering-fr","authors_text":"Bo Yang, Mingyi Hong, Nicholas D. Sidiropoulos, Xiao Fu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-15T22:51:06Z","title":"Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04794","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:f013bff6af3eeeafad0903c27b4ac77b6f72d655f2e99f152f3b9936627e2c73","target":"record","created_at":"2026-05-18T00:42:23Z","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":"829923c2715ccf087e04e24970b61d4724486b8a1128e74a9c9c24862e5de8e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-15T22:51:06Z","title_canon_sha256":"d949fc60a596e98e53d402083385e50584da41abfe1112a171422a6d350d0c4b"},"schema_version":"1.0","source":{"id":"1610.04794","kind":"arxiv","version":2}},"canonical_sha256":"515bb375d86ad35533d6a853a5583c73403f0f0df8c22a9af3df70b56a473c7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"515bb375d86ad35533d6a853a5583c73403f0f0df8c22a9af3df70b56a473c7a","first_computed_at":"2026-05-18T00:42:23.783696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:23.783696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v7Sxdn0r0lXHsrvWXGeZrBzAnpHLYtDdsX8qN8OH3+PrDt1xUrHrahrl6mXyVy94pgfUXNpCxdT1qwJWeNX7DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:23.784133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04794","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f013bff6af3eeeafad0903c27b4ac77b6f72d655f2e99f152f3b9936627e2c73","sha256:3b656905be717694970a51f30fb943147db6071349d3f7b12581bb40a84be9db"],"state_sha256":"a30ef6a83fb35886eda33dfa31119940eb9e0fb674fd452980496b4c3d0b1ac4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1x62YKbpSXeeuVG1CVIAgAy/cPzsLMI2IMgb0RAysMBy76ffmmYqAq/aVMTFCC3bTGu1eO5RtbMC7HQvE5ApDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:24:53.935555Z","bundle_sha256":"acad8f9b00c9add06806544a1fa333bdd7eededa86f8eb8e9f8320cc24143f0e"}}