{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4CJCRBYSRPVH3QRYTSPPUA5BHX","short_pith_number":"pith:4CJCRBYS","schema_version":"1.0","canonical_sha256":"e0922887128bea7dc2389c9efa03a13df17523d3d8362434b2367f676042d3ec","source":{"kind":"arxiv","id":"1805.10759","version":1},"attestation_state":"computed","paper":{"title":"Clustering by latent dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Neeraj Kashyap, Shohei Hidaka","submitted_at":"2018-05-28T04:01:31Z","abstract_excerpt":"This paper introduces a new clustering technique, called {\\em dimensional clustering}, which clusters each data point by its latent {\\em pointwise dimension}, which is a measure of the dimensionality of the data set local to that point. Pointwise dimension is invariant under a broad class of transformations. As a result, dimensional clustering can be usefully applied to a wide range of datasets. Concretely, we present a statistical model which estimates the pointwise dimension of a dataset around the points in that dataset using the distance of each point from its $n^{\\text{th}}$ nearest neigh"},"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":"1805.10759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-28T04:01:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"460b59776515502afe814274a07d761b2335832ed176bd71c26c5c63fd4bc797","abstract_canon_sha256":"276c170fc9a7974bf65585947aa2b06170e909385f01b23f18355fdd51c9eb8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:51.506251Z","signature_b64":"7iLoKIEKO5/elPluE87XD/02UR8uEJxfW/U60ZhtOk4Wz8QWbyHAQRtwkdWu4WjFbuEze532fqBmG4bM6rz4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0922887128bea7dc2389c9efa03a13df17523d3d8362434b2367f676042d3ec","last_reissued_at":"2026-05-18T00:14:51.505530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:51.505530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering by latent dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Neeraj Kashyap, Shohei Hidaka","submitted_at":"2018-05-28T04:01:31Z","abstract_excerpt":"This paper introduces a new clustering technique, called {\\em dimensional clustering}, which clusters each data point by its latent {\\em pointwise dimension}, which is a measure of the dimensionality of the data set local to that point. Pointwise dimension is invariant under a broad class of transformations. As a result, dimensional clustering can be usefully applied to a wide range of datasets. Concretely, we present a statistical model which estimates the pointwise dimension of a dataset around the points in that dataset using the distance of each point from its $n^{\\text{th}}$ nearest neigh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10759","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.10759","created_at":"2026-05-18T00:14:51.505641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10759v1","created_at":"2026-05-18T00:14:51.505641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10759","created_at":"2026-05-18T00:14:51.505641+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CJCRBYSRPVH","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CJCRBYSRPVH3QRY","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CJCRBYS","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4CJCRBYSRPVH3QRYTSPPUA5BHX","json":"https://pith.science/pith/4CJCRBYSRPVH3QRYTSPPUA5BHX.json","graph_json":"https://pith.science/api/pith-number/4CJCRBYSRPVH3QRYTSPPUA5BHX/graph.json","events_json":"https://pith.science/api/pith-number/4CJCRBYSRPVH3QRYTSPPUA5BHX/events.json","paper":"https://pith.science/paper/4CJCRBYS"},"agent_actions":{"view_html":"https://pith.science/pith/4CJCRBYSRPVH3QRYTSPPUA5BHX","download_json":"https://pith.science/pith/4CJCRBYSRPVH3QRYTSPPUA5BHX.json","view_paper":"https://pith.science/paper/4CJCRBYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10759&json=true","fetch_graph":"https://pith.science/api/pith-number/4CJCRBYSRPVH3QRYTSPPUA5BHX/graph.json","fetch_events":"https://pith.science/api/pith-number/4CJCRBYSRPVH3QRYTSPPUA5BHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CJCRBYSRPVH3QRYTSPPUA5BHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CJCRBYSRPVH3QRYTSPPUA5BHX/action/storage_attestation","attest_author":"https://pith.science/pith/4CJCRBYSRPVH3QRYTSPPUA5BHX/action/author_attestation","sign_citation":"https://pith.science/pith/4CJCRBYSRPVH3QRYTSPPUA5BHX/action/citation_signature","submit_replication":"https://pith.science/pith/4CJCRBYSRPVH3QRYTSPPUA5BHX/action/replication_record"}},"created_at":"2026-05-18T00:14:51.505641+00:00","updated_at":"2026-05-18T00:14:51.505641+00:00"}