{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CM6O6SOZOVGY52HLC4Y47WB5UE","short_pith_number":"pith:CM6O6SOZ","schema_version":"1.0","canonical_sha256":"133cef49d9754d8ee8eb1731cfd83da11c70fdeb304b9f135d894ba1d8fad1e2","source":{"kind":"arxiv","id":"1710.04886","version":1},"attestation_state":"computed","paper":{"title":"High Dimensional Cluster Analysis Using Path Lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"physics.data-an","authors_text":"Kevin McIlhany, Stephen Wiggins","submitted_at":"2017-10-13T12:08:37Z","abstract_excerpt":"A hierarchical scheme for clustering data is presented which applies to spaces with a high number of dimension ($N_{_{D}}>3$). The data set is first reduced to a smaller set of partitions (multi-dimensional bins). Multiple clustering techniques are used, including spectral clustering, however, new techniques are also introduced based on the path length between partitions that are connected to one another. A Line-Of-Sight algorithm is also developed for clustering. A test bank of 12 data sets with varying properties is used to expose the strengths and weaknesses of each technique. Finally, a ro"},"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":"1710.04886","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2017-10-13T12:08:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3dc1bb03ffe640c0c24ea15f85f6928922d3485a4cb79fd9a0f065a567bf062d","abstract_canon_sha256":"a601bc093cc5e3871f617936e2c9313cfd3d3879a833c79beea4b6e2c1d5cc66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:56.412818Z","signature_b64":"5RQco52MUJn2bAekp+h96Dw0TGSMOZQewqJBcp0RJUfeic+EEbhCTjfsGZWvNeWpeIN0KUr83cNpSGbVV0NUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"133cef49d9754d8ee8eb1731cfd83da11c70fdeb304b9f135d894ba1d8fad1e2","last_reissued_at":"2026-05-18T00:32:56.412177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:56.412177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High Dimensional Cluster Analysis Using Path Lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"physics.data-an","authors_text":"Kevin McIlhany, Stephen Wiggins","submitted_at":"2017-10-13T12:08:37Z","abstract_excerpt":"A hierarchical scheme for clustering data is presented which applies to spaces with a high number of dimension ($N_{_{D}}>3$). The data set is first reduced to a smaller set of partitions (multi-dimensional bins). Multiple clustering techniques are used, including spectral clustering, however, new techniques are also introduced based on the path length between partitions that are connected to one another. A Line-Of-Sight algorithm is also developed for clustering. A test bank of 12 data sets with varying properties is used to expose the strengths and weaknesses of each technique. Finally, a ro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04886","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":"1710.04886","created_at":"2026-05-18T00:32:56.412261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.04886v1","created_at":"2026-05-18T00:32:56.412261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04886","created_at":"2026-05-18T00:32:56.412261+00:00"},{"alias_kind":"pith_short_12","alias_value":"CM6O6SOZOVGY","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CM6O6SOZOVGY52HL","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CM6O6SOZ","created_at":"2026-05-18T12:31:10.602751+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/CM6O6SOZOVGY52HLC4Y47WB5UE","json":"https://pith.science/pith/CM6O6SOZOVGY52HLC4Y47WB5UE.json","graph_json":"https://pith.science/api/pith-number/CM6O6SOZOVGY52HLC4Y47WB5UE/graph.json","events_json":"https://pith.science/api/pith-number/CM6O6SOZOVGY52HLC4Y47WB5UE/events.json","paper":"https://pith.science/paper/CM6O6SOZ"},"agent_actions":{"view_html":"https://pith.science/pith/CM6O6SOZOVGY52HLC4Y47WB5UE","download_json":"https://pith.science/pith/CM6O6SOZOVGY52HLC4Y47WB5UE.json","view_paper":"https://pith.science/paper/CM6O6SOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.04886&json=true","fetch_graph":"https://pith.science/api/pith-number/CM6O6SOZOVGY52HLC4Y47WB5UE/graph.json","fetch_events":"https://pith.science/api/pith-number/CM6O6SOZOVGY52HLC4Y47WB5UE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CM6O6SOZOVGY52HLC4Y47WB5UE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CM6O6SOZOVGY52HLC4Y47WB5UE/action/storage_attestation","attest_author":"https://pith.science/pith/CM6O6SOZOVGY52HLC4Y47WB5UE/action/author_attestation","sign_citation":"https://pith.science/pith/CM6O6SOZOVGY52HLC4Y47WB5UE/action/citation_signature","submit_replication":"https://pith.science/pith/CM6O6SOZOVGY52HLC4Y47WB5UE/action/replication_record"}},"created_at":"2026-05-18T00:32:56.412261+00:00","updated_at":"2026-05-18T00:32:56.412261+00:00"}