{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KY23G67TU3WNDWB7CFKU4PCQY6","short_pith_number":"pith:KY23G67T","schema_version":"1.0","canonical_sha256":"5635b37bf3a6ecd1d83f11554e3c50c7967f63dd7dc1d3395dbf01a6fa659d1d","source":{"kind":"arxiv","id":"1910.01590","version":3},"attestation_state":"computed","paper":{"title":"DPSOM: Deep Probabilistic Clustering with Self-Organizing Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gunnar R\\\"atsch, Julia Vogt, Laura Manduchi, Matthias H\\\"user, Vincent Fortuin","submitted_at":"2019-10-03T16:47:33Z","abstract_excerpt":"Generating interpretable visualizations from complex data is a common problem in many applications. Two key ingredients for tackling this issue are clustering and representation learning. However, current methods do not yet successfully combine the strengths of these two approaches. Existing representation learning models which rely on latent topological structure such as self-organising maps, exhibit markedly lower clustering performance compared to recent deep clustering methods. To close this performance gap, we (a) present a novel way to fit self-organizing maps with probabilistic cluster "},"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":"1910.01590","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-03T16:47:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"71bd220b6d24a0095d6c33bdd2fff0e39712a08b6540b2b116d4142f9b427fe7","abstract_canon_sha256":"f82dee483f4de30bf4b5cbb19eac6583ae57681e92051f83a15daa129c83dcae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:09:01.020918Z","signature_b64":"d1vf6EsjKvaFxqd5NqHl3m753OTPTxfcjV38XYd3AyVIG927elsCKRCcrlHtxM/p8spOlWt8cGk7Pre80NwaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5635b37bf3a6ecd1d83f11554e3c50c7967f63dd7dc1d3395dbf01a6fa659d1d","last_reissued_at":"2026-07-05T01:09:01.020519Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:09:01.020519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DPSOM: Deep Probabilistic Clustering with Self-Organizing Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gunnar R\\\"atsch, Julia Vogt, Laura Manduchi, Matthias H\\\"user, Vincent Fortuin","submitted_at":"2019-10-03T16:47:33Z","abstract_excerpt":"Generating interpretable visualizations from complex data is a common problem in many applications. Two key ingredients for tackling this issue are clustering and representation learning. However, current methods do not yet successfully combine the strengths of these two approaches. Existing representation learning models which rely on latent topological structure such as self-organising maps, exhibit markedly lower clustering performance compared to recent deep clustering methods. To close this performance gap, we (a) present a novel way to fit self-organizing maps with probabilistic cluster "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.01590","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.01590/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.01590","created_at":"2026-07-05T01:09:01.020575+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.01590v3","created_at":"2026-07-05T01:09:01.020575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.01590","created_at":"2026-07-05T01:09:01.020575+00:00"},{"alias_kind":"pith_short_12","alias_value":"KY23G67TU3WN","created_at":"2026-07-05T01:09:01.020575+00:00"},{"alias_kind":"pith_short_16","alias_value":"KY23G67TU3WNDWB7","created_at":"2026-07-05T01:09:01.020575+00:00"},{"alias_kind":"pith_short_8","alias_value":"KY23G67T","created_at":"2026-07-05T01:09:01.020575+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.20582","citing_title":"Bridging the Gap: A Decade Review of Time-Series Clustering Methods","ref_index":165,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KY23G67TU3WNDWB7CFKU4PCQY6","json":"https://pith.science/pith/KY23G67TU3WNDWB7CFKU4PCQY6.json","graph_json":"https://pith.science/api/pith-number/KY23G67TU3WNDWB7CFKU4PCQY6/graph.json","events_json":"https://pith.science/api/pith-number/KY23G67TU3WNDWB7CFKU4PCQY6/events.json","paper":"https://pith.science/paper/KY23G67T"},"agent_actions":{"view_html":"https://pith.science/pith/KY23G67TU3WNDWB7CFKU4PCQY6","download_json":"https://pith.science/pith/KY23G67TU3WNDWB7CFKU4PCQY6.json","view_paper":"https://pith.science/paper/KY23G67T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.01590&json=true","fetch_graph":"https://pith.science/api/pith-number/KY23G67TU3WNDWB7CFKU4PCQY6/graph.json","fetch_events":"https://pith.science/api/pith-number/KY23G67TU3WNDWB7CFKU4PCQY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KY23G67TU3WNDWB7CFKU4PCQY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KY23G67TU3WNDWB7CFKU4PCQY6/action/storage_attestation","attest_author":"https://pith.science/pith/KY23G67TU3WNDWB7CFKU4PCQY6/action/author_attestation","sign_citation":"https://pith.science/pith/KY23G67TU3WNDWB7CFKU4PCQY6/action/citation_signature","submit_replication":"https://pith.science/pith/KY23G67TU3WNDWB7CFKU4PCQY6/action/replication_record"}},"created_at":"2026-07-05T01:09:01.020575+00:00","updated_at":"2026-07-05T01:09:01.020575+00:00"}