{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y3M5GIBD4TAS5EDVFGCSUZ24E4","short_pith_number":"pith:Y3M5GIBD","canonical_record":{"source":{"id":"1812.06535","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-16T21:03:32Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"683e3c8a87cfc05f230306e5a59cdaff3d30a53be45f29f2c3bc51ee939567a4","abstract_canon_sha256":"a9f3e3678c4b278e6e869222e31c29de3f5da098c13f84ef98a090216a299c11"},"schema_version":"1.0"},"canonical_sha256":"c6d9d32023e4c12e907529852a675c271aa5abcf2e174a880896d206f58cb83b","source":{"kind":"arxiv","id":"1812.06535","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06535","created_at":"2026-05-17T23:50:06Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06535v2","created_at":"2026-05-17T23:50:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06535","created_at":"2026-05-17T23:50:06Z"},{"alias_kind":"pith_short_12","alias_value":"Y3M5GIBD4TAS","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y3M5GIBD4TAS5EDV","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y3M5GIBD","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y3M5GIBD4TAS5EDVFGCSUZ24E4","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06535","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-16T21:03:32Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"683e3c8a87cfc05f230306e5a59cdaff3d30a53be45f29f2c3bc51ee939567a4","abstract_canon_sha256":"a9f3e3678c4b278e6e869222e31c29de3f5da098c13f84ef98a090216a299c11"},"schema_version":"1.0"},"canonical_sha256":"c6d9d32023e4c12e907529852a675c271aa5abcf2e174a880896d206f58cb83b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:06.627255Z","signature_b64":"eBQGvk0uBKjE8jEXkRywtampv7PUKtbKcmsT12/Y5mT3YR2iOvkamkdVlKA3Y4kPuT1MgjyGkImiARQgYkuvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6d9d32023e4c12e907529852a675c271aa5abcf2e174a880896d206f58cb83b","last_reissued_at":"2026-05-17T23:50:06.626700Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:06.626700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06535","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-17T23:50:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5eKI9GEWRBIYaJFLithYnpX+SNda9/3ekGOtshK/y0VVyW1QofciXYlWPm+0aBuzyexSmDfgdXZx0tnHmrymDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:54:40.757615Z"},"content_sha256":"69cf9193e50bcf24c126d35e386bf8f8368354f93d48f9db080c0a9ce2732f56","schema_version":"1.0","event_id":"sha256:69cf9193e50bcf24c126d35e386bf8f8368354f93d48f9db080c0a9ce2732f56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y3M5GIBD4TAS5EDVFGCSUZ24E4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Clustering Based on a Mixture of Autoencoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jacob Goldberger, Sharon Gannot, Shlomo E. Chazan","submitted_at":"2018-12-16T21:03:32Z","abstract_excerpt":"In this paper we propose a Deep Autoencoder MIxture Clustering (DAMIC) algorithm based on a mixture of deep autoencoders where each cluster is represented by an autoencoder. A clustering network transforms the data into another space and then selects one of the clusters. Next, the autoencoder associated with this cluster is used to reconstruct the data-point. The clustering algorithm jointly learns the nonlinear data representation and the set of autoencoders. The optimal clustering is found by minimizing the reconstruction loss of the mixture of autoencoder network. Unlike other deep clusteri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06535","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-17T23:50:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fk+hPKEOKkpWw4jCoTlChhG6BmPzUMHwQxT+0UqsdLNK0/pI1Xs3qqbNWVQeywti4N+BDX1nu5IbmPQi7jaSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:54:40.757997Z"},"content_sha256":"86956e2f2d583eca413a16c6acae9a54a20d8d3a77059b9c2d0955c49ccc8ce9","schema_version":"1.0","event_id":"sha256:86956e2f2d583eca413a16c6acae9a54a20d8d3a77059b9c2d0955c49ccc8ce9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y3M5GIBD4TAS5EDVFGCSUZ24E4/bundle.json","state_url":"https://pith.science/pith/Y3M5GIBD4TAS5EDVFGCSUZ24E4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y3M5GIBD4TAS5EDVFGCSUZ24E4/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-05-30T06:54:40Z","links":{"resolver":"https://pith.science/pith/Y3M5GIBD4TAS5EDVFGCSUZ24E4","bundle":"https://pith.science/pith/Y3M5GIBD4TAS5EDVFGCSUZ24E4/bundle.json","state":"https://pith.science/pith/Y3M5GIBD4TAS5EDVFGCSUZ24E4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y3M5GIBD4TAS5EDVFGCSUZ24E4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y3M5GIBD4TAS5EDVFGCSUZ24E4","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":"a9f3e3678c4b278e6e869222e31c29de3f5da098c13f84ef98a090216a299c11","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-16T21:03:32Z","title_canon_sha256":"683e3c8a87cfc05f230306e5a59cdaff3d30a53be45f29f2c3bc51ee939567a4"},"schema_version":"1.0","source":{"id":"1812.06535","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06535","created_at":"2026-05-17T23:50:06Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06535v2","created_at":"2026-05-17T23:50:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06535","created_at":"2026-05-17T23:50:06Z"},{"alias_kind":"pith_short_12","alias_value":"Y3M5GIBD4TAS","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y3M5GIBD4TAS5EDV","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y3M5GIBD","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:86956e2f2d583eca413a16c6acae9a54a20d8d3a77059b9c2d0955c49ccc8ce9","target":"graph","created_at":"2026-05-17T23:50:06Z","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":"In this paper we propose a Deep Autoencoder MIxture Clustering (DAMIC) algorithm based on a mixture of deep autoencoders where each cluster is represented by an autoencoder. A clustering network transforms the data into another space and then selects one of the clusters. Next, the autoencoder associated with this cluster is used to reconstruct the data-point. The clustering algorithm jointly learns the nonlinear data representation and the set of autoencoders. The optimal clustering is found by minimizing the reconstruction loss of the mixture of autoencoder network. Unlike other deep clusteri","authors_text":"Jacob Goldberger, Sharon Gannot, Shlomo E. Chazan","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-16T21:03:32Z","title":"Deep Clustering Based on a Mixture of Autoencoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06535","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:69cf9193e50bcf24c126d35e386bf8f8368354f93d48f9db080c0a9ce2732f56","target":"record","created_at":"2026-05-17T23:50:06Z","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":"a9f3e3678c4b278e6e869222e31c29de3f5da098c13f84ef98a090216a299c11","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-16T21:03:32Z","title_canon_sha256":"683e3c8a87cfc05f230306e5a59cdaff3d30a53be45f29f2c3bc51ee939567a4"},"schema_version":"1.0","source":{"id":"1812.06535","kind":"arxiv","version":2}},"canonical_sha256":"c6d9d32023e4c12e907529852a675c271aa5abcf2e174a880896d206f58cb83b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6d9d32023e4c12e907529852a675c271aa5abcf2e174a880896d206f58cb83b","first_computed_at":"2026-05-17T23:50:06.626700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:06.626700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eBQGvk0uBKjE8jEXkRywtampv7PUKtbKcmsT12/Y5mT3YR2iOvkamkdVlKA3Y4kPuT1MgjyGkImiARQgYkuvAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:06.627255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06535","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69cf9193e50bcf24c126d35e386bf8f8368354f93d48f9db080c0a9ce2732f56","sha256:86956e2f2d583eca413a16c6acae9a54a20d8d3a77059b9c2d0955c49ccc8ce9"],"state_sha256":"4477ee72695eb36d0d2bc9fc92ac4eb81ff4ec7ccf25277c0814f38e77c358f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ren+ums7zS5tPl190kD/43rJp8SSgHuE729cnkURp5P4F5HK403ZTCl8kf0wXDJxu6lpU3vS79YN4y3Z8N1wDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:54:40.759945Z","bundle_sha256":"4bc8b6272db385ceb0087dfc69d8cee90db96b863a30e9adadd53e54c0b75a74"}}