{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:L4MMBQZIT44UM5CYORPTWXE6V6","short_pith_number":"pith:L4MMBQZI","canonical_record":{"source":{"id":"2410.06265","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-08T18:03:35Z","cross_cats_sorted":[],"title_canon_sha256":"562d53c00b3d7c0a28bd9ef3b401365b27f962a205e522b983e098d7f4af5839","abstract_canon_sha256":"6f81012a03af0fd39a5f347db87cdf962e75ca9526a69f595809146ca6f119ea"},"schema_version":"1.0"},"canonical_sha256":"5f18c0c3289f39467458745f3b5c9eafb0d49e1da088eded5a3b50e52d2ee77f","source":{"kind":"arxiv","id":"2410.06265","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.06265","created_at":"2026-07-05T09:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"2410.06265v1","created_at":"2026-07-05T09:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06265","created_at":"2026-07-05T09:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"L4MMBQZIT44U","created_at":"2026-07-05T09:17:59Z"},{"alias_kind":"pith_short_16","alias_value":"L4MMBQZIT44UM5CY","created_at":"2026-07-05T09:17:59Z"},{"alias_kind":"pith_short_8","alias_value":"L4MMBQZI","created_at":"2026-07-05T09:17:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:L4MMBQZIT44UM5CYORPTWXE6V6","target":"record","payload":{"canonical_record":{"source":{"id":"2410.06265","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-08T18:03:35Z","cross_cats_sorted":[],"title_canon_sha256":"562d53c00b3d7c0a28bd9ef3b401365b27f962a205e522b983e098d7f4af5839","abstract_canon_sha256":"6f81012a03af0fd39a5f347db87cdf962e75ca9526a69f595809146ca6f119ea"},"schema_version":"1.0"},"canonical_sha256":"5f18c0c3289f39467458745f3b5c9eafb0d49e1da088eded5a3b50e52d2ee77f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:17:59.060481Z","signature_b64":"5ttjLOtLWPJyUrPpYvV+Q/q2bxI1x3M+In5HOBkPXh3OTEDCVLaH/82AKW8z8+JELKwkzi8cIUpAGwoObcrDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f18c0c3289f39467458745f3b5c9eafb0d49e1da088eded5a3b50e52d2ee77f","last_reissued_at":"2026-07-05T09:17:59.060008Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:17:59.060008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.06265","source_version":1,"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-07-05T09:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"etf1G7bQGeAw8TF4OStPBIjsjQ3DcEM56oNvAArpFVY9LFlTFSXqSQx4ZXISpsqtTRwiJlVzgAhqm5+W6H2QBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:32:30.930906Z"},"content_sha256":"9d4f97f3c7570f257272f2e4efedf3132392f540f679aaaaa985fa3d16864398","schema_version":"1.0","event_id":"sha256:9d4f97f3c7570f257272f2e4efedf3132392f540f679aaaaa985fa3d16864398"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:L4MMBQZIT44UM5CYORPTWXE6V6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SHADE: Deep Density-based Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Beer, Christian B\\\"ohm, Claudia Plant, Collin Leiber, Lukas Miklautz, Pascal Weber, Walid Durani","submitted_at":"2024-10-08T18:03:35Z","abstract_excerpt":"Detecting arbitrarily shaped clusters in high-dimensional noisy data is challenging for current clustering methods. We introduce SHADE (Structure-preserving High-dimensional Analysis with Density-based Exploration), the first deep clustering algorithm that incorporates density-connectivity into its loss function. Similar to existing deep clustering algorithms, SHADE supports high-dimensional and large data sets with the expressive power of a deep autoencoder. In contrast to most existing deep clustering methods that rely on a centroid-based clustering objective, SHADE incorporates a novel loss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06265","kind":"arxiv","version":1},"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/2410.06265/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"},"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-07-05T09:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"svPKCX20Gpsv1hPD8NUAzDa6HEJ0kvS8gmrrFWbsG1OR4d9sw95gp9iwkpCHrqdm0mGzdwAvr+QzX2XeiCdkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:32:30.931778Z"},"content_sha256":"93d8b62b758c6269a777bfc42a3f5b6c38fc840007c08664903bbf617628cf81","schema_version":"1.0","event_id":"sha256:93d8b62b758c6269a777bfc42a3f5b6c38fc840007c08664903bbf617628cf81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4MMBQZIT44UM5CYORPTWXE6V6/bundle.json","state_url":"https://pith.science/pith/L4MMBQZIT44UM5CYORPTWXE6V6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4MMBQZIT44UM5CYORPTWXE6V6/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-08-03T15:32:30Z","links":{"resolver":"https://pith.science/pith/L4MMBQZIT44UM5CYORPTWXE6V6","bundle":"https://pith.science/pith/L4MMBQZIT44UM5CYORPTWXE6V6/bundle.json","state":"https://pith.science/pith/L4MMBQZIT44UM5CYORPTWXE6V6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4MMBQZIT44UM5CYORPTWXE6V6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:L4MMBQZIT44UM5CYORPTWXE6V6","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":"6f81012a03af0fd39a5f347db87cdf962e75ca9526a69f595809146ca6f119ea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-08T18:03:35Z","title_canon_sha256":"562d53c00b3d7c0a28bd9ef3b401365b27f962a205e522b983e098d7f4af5839"},"schema_version":"1.0","source":{"id":"2410.06265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.06265","created_at":"2026-07-05T09:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"2410.06265v1","created_at":"2026-07-05T09:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06265","created_at":"2026-07-05T09:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"L4MMBQZIT44U","created_at":"2026-07-05T09:17:59Z"},{"alias_kind":"pith_short_16","alias_value":"L4MMBQZIT44UM5CY","created_at":"2026-07-05T09:17:59Z"},{"alias_kind":"pith_short_8","alias_value":"L4MMBQZI","created_at":"2026-07-05T09:17:59Z"}],"graph_snapshots":[{"event_id":"sha256:93d8b62b758c6269a777bfc42a3f5b6c38fc840007c08664903bbf617628cf81","target":"graph","created_at":"2026-07-05T09:17:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.06265/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Detecting arbitrarily shaped clusters in high-dimensional noisy data is challenging for current clustering methods. We introduce SHADE (Structure-preserving High-dimensional Analysis with Density-based Exploration), the first deep clustering algorithm that incorporates density-connectivity into its loss function. Similar to existing deep clustering algorithms, SHADE supports high-dimensional and large data sets with the expressive power of a deep autoencoder. In contrast to most existing deep clustering methods that rely on a centroid-based clustering objective, SHADE incorporates a novel loss","authors_text":"Anna Beer, Christian B\\\"ohm, Claudia Plant, Collin Leiber, Lukas Miklautz, Pascal Weber, Walid Durani","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-08T18:03:35Z","title":"SHADE: Deep Density-based Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06265","kind":"arxiv","version":1},"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:9d4f97f3c7570f257272f2e4efedf3132392f540f679aaaaa985fa3d16864398","target":"record","created_at":"2026-07-05T09:17:59Z","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":"6f81012a03af0fd39a5f347db87cdf962e75ca9526a69f595809146ca6f119ea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-08T18:03:35Z","title_canon_sha256":"562d53c00b3d7c0a28bd9ef3b401365b27f962a205e522b983e098d7f4af5839"},"schema_version":"1.0","source":{"id":"2410.06265","kind":"arxiv","version":1}},"canonical_sha256":"5f18c0c3289f39467458745f3b5c9eafb0d49e1da088eded5a3b50e52d2ee77f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f18c0c3289f39467458745f3b5c9eafb0d49e1da088eded5a3b50e52d2ee77f","first_computed_at":"2026-07-05T09:17:59.060008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:17:59.060008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ttjLOtLWPJyUrPpYvV+Q/q2bxI1x3M+In5HOBkPXh3OTEDCVLaH/82AKW8z8+JELKwkzi8cIUpAGwoObcrDBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:17:59.060481Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.06265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d4f97f3c7570f257272f2e4efedf3132392f540f679aaaaa985fa3d16864398","sha256:93d8b62b758c6269a777bfc42a3f5b6c38fc840007c08664903bbf617628cf81"],"state_sha256":"88678094b9159e570d4987a99b06df99c496301901d44831232f676fd559316f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ApMJE/G4q2KkyNM3TpsOtgDitUexy1CRU13GNsHp4zIBgFsZSfR8PRKgCFFfxLwAOqgL0noFgYMfRuNzwwvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:32:30.938668Z","bundle_sha256":"df4b68e70013734ef5cbcb5437d2a81e05ad2cb3615395e9b0fa6c4ff8912f9e"}}