{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3VXN445AAILLTMFBFJQNPAIYKJ","short_pith_number":"pith:3VXN445A","schema_version":"1.0","canonical_sha256":"dd6ede73a00216b9b0a12a60d78118526a7d215d082344f9d223c71f8df47b6c","source":{"kind":"arxiv","id":"1501.06450","version":2},"attestation_state":"computed","paper":{"title":"IT-map: an Effective Nonlinear Dimensionality Reduction Method for Interactive Clustering","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Teng Qiu, Yongjie Li","submitted_at":"2015-01-26T15:37:22Z","abstract_excerpt":"Scientists in many fields have the common and basic need of dimensionality reduction: visualizing the underlying structure of the massive multivariate data in a low-dimensional space. However, many dimensionality reduction methods confront the so-called \"crowding problem\" that clusters tend to overlap with each other in the embedding. Previously, researchers expect to avoid that problem and seek to make clusters maximally separated in the embedding. However, the proposed in-tree (IT) based method, called IT-map, allows clusters in the embedding to be locally overlapped, while seeking to make t"},"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":"1501.06450","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ML","submitted_at":"2015-01-26T15:37:22Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"a6278b26a4a44652d289edceda4a1c75ba97879a90501e515309d8265640ea00","abstract_canon_sha256":"027b42684608b982ccb93accbad5ae6577bde60b0fd1650940a7929c09712219"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:51.331178Z","signature_b64":"ltpvfw1KEHbDE89Kn+2ixAv6FUmQ+s7tIGHP4mDVa62dfMiwEVhbPZ2i7mpSPsTjZl7SL4N5QhWJaC8za/cIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd6ede73a00216b9b0a12a60d78118526a7d215d082344f9d223c71f8df47b6c","last_reissued_at":"2026-05-18T02:21:51.330533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:51.330533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"IT-map: an Effective Nonlinear Dimensionality Reduction Method for Interactive Clustering","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Teng Qiu, Yongjie Li","submitted_at":"2015-01-26T15:37:22Z","abstract_excerpt":"Scientists in many fields have the common and basic need of dimensionality reduction: visualizing the underlying structure of the massive multivariate data in a low-dimensional space. However, many dimensionality reduction methods confront the so-called \"crowding problem\" that clusters tend to overlap with each other in the embedding. Previously, researchers expect to avoid that problem and seek to make clusters maximally separated in the embedding. However, the proposed in-tree (IT) based method, called IT-map, allows clusters in the embedding to be locally overlapped, while seeking to make t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06450","kind":"arxiv","version":2},"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":"1501.06450","created_at":"2026-05-18T02:21:51.330644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06450v2","created_at":"2026-05-18T02:21:51.330644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06450","created_at":"2026-05-18T02:21:51.330644+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VXN445AAILL","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VXN445AAILLTMFB","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VXN445A","created_at":"2026-05-18T12:29:02.477457+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/3VXN445AAILLTMFBFJQNPAIYKJ","json":"https://pith.science/pith/3VXN445AAILLTMFBFJQNPAIYKJ.json","graph_json":"https://pith.science/api/pith-number/3VXN445AAILLTMFBFJQNPAIYKJ/graph.json","events_json":"https://pith.science/api/pith-number/3VXN445AAILLTMFBFJQNPAIYKJ/events.json","paper":"https://pith.science/paper/3VXN445A"},"agent_actions":{"view_html":"https://pith.science/pith/3VXN445AAILLTMFBFJQNPAIYKJ","download_json":"https://pith.science/pith/3VXN445AAILLTMFBFJQNPAIYKJ.json","view_paper":"https://pith.science/paper/3VXN445A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06450&json=true","fetch_graph":"https://pith.science/api/pith-number/3VXN445AAILLTMFBFJQNPAIYKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3VXN445AAILLTMFBFJQNPAIYKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VXN445AAILLTMFBFJQNPAIYKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VXN445AAILLTMFBFJQNPAIYKJ/action/storage_attestation","attest_author":"https://pith.science/pith/3VXN445AAILLTMFBFJQNPAIYKJ/action/author_attestation","sign_citation":"https://pith.science/pith/3VXN445AAILLTMFBFJQNPAIYKJ/action/citation_signature","submit_replication":"https://pith.science/pith/3VXN445AAILLTMFBFJQNPAIYKJ/action/replication_record"}},"created_at":"2026-05-18T02:21:51.330644+00:00","updated_at":"2026-05-18T02:21:51.330644+00:00"}