{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:74WM6JBWELEM3S6QO7V5R3PNP4","short_pith_number":"pith:74WM6JBW","canonical_record":{"source":{"id":"1811.02722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-07T01:54:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"606b522deb3ecde455c3f58907d904124ed9da9f163fe2756c8453adc332796d","abstract_canon_sha256":"a768fe5f674e810913adcad8f3177cdb5c19d12acbfecf96569d26fc0d5c32a8"},"schema_version":"1.0"},"canonical_sha256":"ff2ccf243622c8cdcbd077ebd8eded7f187b3f44317545d8cc9a87e124dfbe2c","source":{"kind":"arxiv","id":"1811.02722","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02722","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02722v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02722","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"74WM6JBWELEM","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"74WM6JBWELEM3S6Q","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"74WM6JBW","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:74WM6JBWELEM3S6QO7V5R3PNP4","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-07T01:54:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"606b522deb3ecde455c3f58907d904124ed9da9f163fe2756c8453adc332796d","abstract_canon_sha256":"a768fe5f674e810913adcad8f3177cdb5c19d12acbfecf96569d26fc0d5c32a8"},"schema_version":"1.0"},"canonical_sha256":"ff2ccf243622c8cdcbd077ebd8eded7f187b3f44317545d8cc9a87e124dfbe2c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:20.946680Z","signature_b64":"lCEwGFRkf/Wy6VGxuHZHybGQhZFcigVHz5a3yDFTRiosb0/HFOY+aafVY0kERIz0NFPsYNmZm/xOSR+SlUF4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff2ccf243622c8cdcbd077ebd8eded7f187b3f44317545d8cc9a87e124dfbe2c","last_reissued_at":"2026-05-18T00:01:20.946176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:20.946176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02722","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-18T00:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VSwWDxKCrNDH8DM2pYBipK84uJSVWD5/onFfoBYlAlBiPjmLzZk5mybOmKCjD6rIcKOflwlc8uTR5lbczFCYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:31:49.098286Z"},"content_sha256":"bc5af2a4df541c4c4e40aec957a19d7e58bb92e059e89e5a497063282db00dd2","schema_version":"1.0","event_id":"sha256:bc5af2a4df541c4c4e40aec957a19d7e58bb92e059e89e5a497063282db00dd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:74WM6JBWELEM3S6QO7V5R3PNP4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Bottom-up Subspace Clustering using FP-Trees for High Dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Christopher Leckie, Jianzhong Qi, Minh Tuan Doan, Sutharshan Rajasegarar","submitted_at":"2018-11-07T01:54:39Z","abstract_excerpt":"Subspace clustering aims to find groups of similar objects (clusters) that exist in lower dimensional subspaces from a high dimensional dataset. It has a wide range of applications, such as analysing high dimensional sensor data or DNA sequences. However, existing algorithms have limitations in finding clusters in non-disjoint subspaces and scaling to large data, which impinge their applicability in areas such as bioinformatics and the Internet of Things. We aim to address such limitations by proposing a subspace clustering algorithm using a bottom-up strategy. Our algorithm first searches for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02722","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-18T00:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/St3j+W9qUIlpuJnyWYHcoE7i5yGl1fUxnaa+9d3bv/MYK8M/2zKjKdkaNtuFhgqRZO/M563PUs8GMXhkAbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:31:49.098654Z"},"content_sha256":"4e2c8b511d448e0e5ca31e26922ca86dcfb1c4f5a10cd9cbb5a307575f5541ed","schema_version":"1.0","event_id":"sha256:4e2c8b511d448e0e5ca31e26922ca86dcfb1c4f5a10cd9cbb5a307575f5541ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74WM6JBWELEM3S6QO7V5R3PNP4/bundle.json","state_url":"https://pith.science/pith/74WM6JBWELEM3S6QO7V5R3PNP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74WM6JBWELEM3S6QO7V5R3PNP4/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-01T10:31:49Z","links":{"resolver":"https://pith.science/pith/74WM6JBWELEM3S6QO7V5R3PNP4","bundle":"https://pith.science/pith/74WM6JBWELEM3S6QO7V5R3PNP4/bundle.json","state":"https://pith.science/pith/74WM6JBWELEM3S6QO7V5R3PNP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74WM6JBWELEM3S6QO7V5R3PNP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:74WM6JBWELEM3S6QO7V5R3PNP4","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":"a768fe5f674e810913adcad8f3177cdb5c19d12acbfecf96569d26fc0d5c32a8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-07T01:54:39Z","title_canon_sha256":"606b522deb3ecde455c3f58907d904124ed9da9f163fe2756c8453adc332796d"},"schema_version":"1.0","source":{"id":"1811.02722","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02722","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02722v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02722","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"74WM6JBWELEM","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"74WM6JBWELEM3S6Q","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"74WM6JBW","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:4e2c8b511d448e0e5ca31e26922ca86dcfb1c4f5a10cd9cbb5a307575f5541ed","target":"graph","created_at":"2026-05-18T00:01:20Z","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":"Subspace clustering aims to find groups of similar objects (clusters) that exist in lower dimensional subspaces from a high dimensional dataset. It has a wide range of applications, such as analysing high dimensional sensor data or DNA sequences. However, existing algorithms have limitations in finding clusters in non-disjoint subspaces and scaling to large data, which impinge their applicability in areas such as bioinformatics and the Internet of Things. We aim to address such limitations by proposing a subspace clustering algorithm using a bottom-up strategy. Our algorithm first searches for","authors_text":"Christopher Leckie, Jianzhong Qi, Minh Tuan Doan, Sutharshan Rajasegarar","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-07T01:54:39Z","title":"Scalable Bottom-up Subspace Clustering using FP-Trees for High Dimensional Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02722","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:bc5af2a4df541c4c4e40aec957a19d7e58bb92e059e89e5a497063282db00dd2","target":"record","created_at":"2026-05-18T00:01:20Z","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":"a768fe5f674e810913adcad8f3177cdb5c19d12acbfecf96569d26fc0d5c32a8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-07T01:54:39Z","title_canon_sha256":"606b522deb3ecde455c3f58907d904124ed9da9f163fe2756c8453adc332796d"},"schema_version":"1.0","source":{"id":"1811.02722","kind":"arxiv","version":1}},"canonical_sha256":"ff2ccf243622c8cdcbd077ebd8eded7f187b3f44317545d8cc9a87e124dfbe2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff2ccf243622c8cdcbd077ebd8eded7f187b3f44317545d8cc9a87e124dfbe2c","first_computed_at":"2026-05-18T00:01:20.946176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:20.946176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lCEwGFRkf/Wy6VGxuHZHybGQhZFcigVHz5a3yDFTRiosb0/HFOY+aafVY0kERIz0NFPsYNmZm/xOSR+SlUF4CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:20.946680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02722","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc5af2a4df541c4c4e40aec957a19d7e58bb92e059e89e5a497063282db00dd2","sha256:4e2c8b511d448e0e5ca31e26922ca86dcfb1c4f5a10cd9cbb5a307575f5541ed"],"state_sha256":"804e4d195d51a3f5ba222dd03eb1499cbf88206886557c4ae44f3e9b1135b28f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CUc0BOYEnbbXNWPtDQELZBl0//r8soGpkJ+Ad0THy17MQcktcHEqv7gEaEzqgXOKh+njpAviHNJXXgEDnhQLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:31:49.100586Z","bundle_sha256":"53212169101ce4379841b4e9a05731bd774fa7a33c301b70ac0a582d27fb4c49"}}