{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XTWSJNVA2CRTXYFWEG4STKBEVA","short_pith_number":"pith:XTWSJNVA","canonical_record":{"source":{"id":"1307.8136","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.ME","submitted_at":"2013-07-30T20:19:26Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a50706e817e9872e992b9485d12b33c79d6908f4e50d8cd3a1f826b612d689ff","abstract_canon_sha256":"be20b36945c60519f764682bd8776956355e63f3eb0ad51080269ddf21d83718"},"schema_version":"1.0"},"canonical_sha256":"bced24b6a0d0a33be0b621b929a824a82188b31f2ed8c8bd993c5da56487e234","source":{"kind":"arxiv","id":"1307.8136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8136","created_at":"2026-05-18T03:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8136v1","created_at":"2026-05-18T03:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8136","created_at":"2026-05-18T03:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"XTWSJNVA2CRT","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XTWSJNVA2CRTXYFW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XTWSJNVA","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XTWSJNVA2CRTXYFWEG4STKBEVA","target":"record","payload":{"canonical_record":{"source":{"id":"1307.8136","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.ME","submitted_at":"2013-07-30T20:19:26Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a50706e817e9872e992b9485d12b33c79d6908f4e50d8cd3a1f826b612d689ff","abstract_canon_sha256":"be20b36945c60519f764682bd8776956355e63f3eb0ad51080269ddf21d83718"},"schema_version":"1.0"},"canonical_sha256":"bced24b6a0d0a33be0b621b929a824a82188b31f2ed8c8bd993c5da56487e234","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:02.301462Z","signature_b64":"OnALK6JesaTrUX5UqeW5M9XdagwmD0VqvFTHG98lw8UE1GghXIpqXkpIbJex1YkLFF9bnT/aY+fu5v6o+4esDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bced24b6a0d0a33be0b621b929a824a82188b31f2ed8c8bd993c5da56487e234","last_reissued_at":"2026-05-18T03:17:02.300638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:02.300638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.8136","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-05-18T03:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ISOekNeYVUgUYt4qq+Dmdiw0UavQAYd5qSaqGLeUMIJ5TUr1ltlw49uEvp4ESZpJlHovHTFsR1TAeTyNpM/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:17:35.833223Z"},"content_sha256":"4f48f449b3f79342c62ac882be20ce871fcb633d05a5529817abf4a23f8ed933","schema_version":"1.0","event_id":"sha256:4f48f449b3f79342c62ac882be20ce871fcb633d05a5529817abf4a23f8ed933"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XTWSJNVA2CRTXYFWEG4STKBEVA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DeBaCl: A Python Package for Interactive DEnsity-BAsed CLustering","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.ME","authors_text":"Alessandro Rinaldo, Brian P. Kent, Timothy Verstynen","submitted_at":"2013-07-30T20:19:26Z","abstract_excerpt":"The level set tree approach of Hartigan (1975) provides a probabilistically based and highly interpretable encoding of the clustering behavior of a dataset. By representing the hierarchy of data modes as a dendrogram of the level sets of a density estimator, this approach offers many advantages for exploratory analysis and clustering, especially for complex and high-dimensional data. Several R packages exist for level set tree estimation, but their practical usefulness is limited by computational inefficiency, absence of interactive graphical capabilities and, from a theoretical perspective, r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8136","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":""},"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-18T03:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z2bMDbZdUhD6dTDEedBACnSpVNSPlWw5WGWRqBQKttIeeWE89y0jxy/WoSW41DZrgm8+0UhV5BFow0jnGouOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:17:35.833592Z"},"content_sha256":"25a81bfb99fb9233415d3a9043c64e2997b9f7cce5b70307236013feeb63ec8c","schema_version":"1.0","event_id":"sha256:25a81bfb99fb9233415d3a9043c64e2997b9f7cce5b70307236013feeb63ec8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XTWSJNVA2CRTXYFWEG4STKBEVA/bundle.json","state_url":"https://pith.science/pith/XTWSJNVA2CRTXYFWEG4STKBEVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XTWSJNVA2CRTXYFWEG4STKBEVA/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-03T08:17:35Z","links":{"resolver":"https://pith.science/pith/XTWSJNVA2CRTXYFWEG4STKBEVA","bundle":"https://pith.science/pith/XTWSJNVA2CRTXYFWEG4STKBEVA/bundle.json","state":"https://pith.science/pith/XTWSJNVA2CRTXYFWEG4STKBEVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XTWSJNVA2CRTXYFWEG4STKBEVA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XTWSJNVA2CRTXYFWEG4STKBEVA","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":"be20b36945c60519f764682bd8776956355e63f3eb0ad51080269ddf21d83718","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.ME","submitted_at":"2013-07-30T20:19:26Z","title_canon_sha256":"a50706e817e9872e992b9485d12b33c79d6908f4e50d8cd3a1f826b612d689ff"},"schema_version":"1.0","source":{"id":"1307.8136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8136","created_at":"2026-05-18T03:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8136v1","created_at":"2026-05-18T03:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8136","created_at":"2026-05-18T03:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"XTWSJNVA2CRT","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XTWSJNVA2CRTXYFW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XTWSJNVA","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:25a81bfb99fb9233415d3a9043c64e2997b9f7cce5b70307236013feeb63ec8c","target":"graph","created_at":"2026-05-18T03:17:02Z","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":"The level set tree approach of Hartigan (1975) provides a probabilistically based and highly interpretable encoding of the clustering behavior of a dataset. By representing the hierarchy of data modes as a dendrogram of the level sets of a density estimator, this approach offers many advantages for exploratory analysis and clustering, especially for complex and high-dimensional data. Several R packages exist for level set tree estimation, but their practical usefulness is limited by computational inefficiency, absence of interactive graphical capabilities and, from a theoretical perspective, r","authors_text":"Alessandro Rinaldo, Brian P. Kent, Timothy Verstynen","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.ME","submitted_at":"2013-07-30T20:19:26Z","title":"DeBaCl: A Python Package for Interactive DEnsity-BAsed CLustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8136","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:4f48f449b3f79342c62ac882be20ce871fcb633d05a5529817abf4a23f8ed933","target":"record","created_at":"2026-05-18T03:17:02Z","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":"be20b36945c60519f764682bd8776956355e63f3eb0ad51080269ddf21d83718","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.ME","submitted_at":"2013-07-30T20:19:26Z","title_canon_sha256":"a50706e817e9872e992b9485d12b33c79d6908f4e50d8cd3a1f826b612d689ff"},"schema_version":"1.0","source":{"id":"1307.8136","kind":"arxiv","version":1}},"canonical_sha256":"bced24b6a0d0a33be0b621b929a824a82188b31f2ed8c8bd993c5da56487e234","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bced24b6a0d0a33be0b621b929a824a82188b31f2ed8c8bd993c5da56487e234","first_computed_at":"2026-05-18T03:17:02.300638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:02.300638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OnALK6JesaTrUX5UqeW5M9XdagwmD0VqvFTHG98lw8UE1GghXIpqXkpIbJex1YkLFF9bnT/aY+fu5v6o+4esDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:02.301462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.8136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f48f449b3f79342c62ac882be20ce871fcb633d05a5529817abf4a23f8ed933","sha256:25a81bfb99fb9233415d3a9043c64e2997b9f7cce5b70307236013feeb63ec8c"],"state_sha256":"1b90a14bebd9d41ca07c5a703edcc0a323d61d407f559b6aca45190dcce5b5a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qAjnXAweCT0Sd9WPVyazD/0TXJHQq7a2g6FO8fXyFnBF5MrDB5Y9yE0sXKY1f39cDNH8FUwK7wOCjtBBpOrzBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:17:35.835503Z","bundle_sha256":"bb7aaffd758fbfa6f111c8ffa6d8606636329de48456c8fb2b838c5208163854"}}