{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZMWGKKRCJTTT6QV4KBZFQYCO4N","short_pith_number":"pith:ZMWGKKRC","schema_version":"1.0","canonical_sha256":"cb2c652a224ce73f42bc507258604ee34db1b575bfacd92b133cffe95a0d480d","source":{"kind":"arxiv","id":"1712.09005","version":1},"attestation_state":"computed","paper":{"title":"Efficient Algorithms for t-distributed Stochastic Neighborhood Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"George C. Linderman, Jeremy G. Hoskins, Manas Rachh, Stefan Steinerberger, Yuval Kluger","submitted_at":"2017-12-25T04:51:25Z","abstract_excerpt":"t-distributed Stochastic Neighborhood Embedding (t-SNE) is a method for dimensionality reduction and visualization that has become widely popular in recent years. Efficient implementations of t-SNE are available, but they scale poorly to datasets with hundreds of thousands to millions of high dimensional data-points. We present Fast Fourier Transform-accelerated Interpolation-based t-SNE (FIt-SNE), which dramatically accelerates the computation of t-SNE. The most time-consuming step of t-SNE is a convolution that we accelerate by interpolating onto an equispaced grid and subsequently using the"},"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":"1712.09005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-25T04:51:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ba69e1dec9dfe34d14049815a127cbe13c6d64826ce9991a7749bb0d1ffa74ab","abstract_canon_sha256":"7769ce1792598937503ce07b1f167f5475780b836c2b59ca03ef25d5bd87285b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:55.823665Z","signature_b64":"c0ulvp7LbAHrN1n4ddn+ZYJ5DsbxpvRbajOoEzWdkfFHDywAukczeiqkf8Cz2ljs7jQwJpGyO1PU/qywHDkYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb2c652a224ce73f42bc507258604ee34db1b575bfacd92b133cffe95a0d480d","last_reissued_at":"2026-05-17T23:52:55.822854Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:55.822854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms for t-distributed Stochastic Neighborhood Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"George C. Linderman, Jeremy G. Hoskins, Manas Rachh, Stefan Steinerberger, Yuval Kluger","submitted_at":"2017-12-25T04:51:25Z","abstract_excerpt":"t-distributed Stochastic Neighborhood Embedding (t-SNE) is a method for dimensionality reduction and visualization that has become widely popular in recent years. Efficient implementations of t-SNE are available, but they scale poorly to datasets with hundreds of thousands to millions of high dimensional data-points. We present Fast Fourier Transform-accelerated Interpolation-based t-SNE (FIt-SNE), which dramatically accelerates the computation of t-SNE. The most time-consuming step of t-SNE is a convolution that we accelerate by interpolating onto an equispaced grid and subsequently using the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09005","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":"1712.09005","created_at":"2026-05-17T23:52:55.822985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09005v1","created_at":"2026-05-17T23:52:55.822985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09005","created_at":"2026-05-17T23:52:55.822985+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMWGKKRCJTTT","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMWGKKRCJTTT6QV4","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMWGKKRC","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1802.03426","citing_title":"UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZMWGKKRCJTTT6QV4KBZFQYCO4N","json":"https://pith.science/pith/ZMWGKKRCJTTT6QV4KBZFQYCO4N.json","graph_json":"https://pith.science/api/pith-number/ZMWGKKRCJTTT6QV4KBZFQYCO4N/graph.json","events_json":"https://pith.science/api/pith-number/ZMWGKKRCJTTT6QV4KBZFQYCO4N/events.json","paper":"https://pith.science/paper/ZMWGKKRC"},"agent_actions":{"view_html":"https://pith.science/pith/ZMWGKKRCJTTT6QV4KBZFQYCO4N","download_json":"https://pith.science/pith/ZMWGKKRCJTTT6QV4KBZFQYCO4N.json","view_paper":"https://pith.science/paper/ZMWGKKRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09005&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMWGKKRCJTTT6QV4KBZFQYCO4N/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMWGKKRCJTTT6QV4KBZFQYCO4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMWGKKRCJTTT6QV4KBZFQYCO4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMWGKKRCJTTT6QV4KBZFQYCO4N/action/storage_attestation","attest_author":"https://pith.science/pith/ZMWGKKRCJTTT6QV4KBZFQYCO4N/action/author_attestation","sign_citation":"https://pith.science/pith/ZMWGKKRCJTTT6QV4KBZFQYCO4N/action/citation_signature","submit_replication":"https://pith.science/pith/ZMWGKKRCJTTT6QV4KBZFQYCO4N/action/replication_record"}},"created_at":"2026-05-17T23:52:55.822985+00:00","updated_at":"2026-05-17T23:52:55.822985+00:00"}