{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JXXEMETVEL5RCO73LVJJCI7RYM","short_pith_number":"pith:JXXEMETV","schema_version":"1.0","canonical_sha256":"4dee46127522fb113bfb5d529123f1c31808fab13101b73bcf6fa2fe4cf42057","source":{"kind":"arxiv","id":"1506.02761","version":4},"attestation_state":"computed","paper":{"title":"WordRank: Learning Word Embeddings via Robust Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Hyokun Yun, Pinar Yanardag, Shihao Ji, Shin Matsushima, S. V. N. Vishwanathan","submitted_at":"2015-06-09T03:08:06Z","abstract_excerpt":"Embedding words in a vector space has gained a lot of attention in recent years. While state-of-the-art methods provide efficient computation of word similarities via a low-dimensional matrix embedding, their motivation is often left unclear. In this paper, we argue that word embedding can be naturally viewed as a ranking problem due to the ranking nature of the evaluation metrics. Then, based on this insight, we propose a novel framework WordRank that efficiently estimates word representations via robust ranking, in which the attention mechanism and robustness to noise are readily achieved vi"},"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":"1506.02761","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-09T03:08:06Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b43900555b9528cc24fdcd653888127de2b03ec4f1874dea13e008888f9f3834","abstract_canon_sha256":"5cd19de662848dcf9bc0ee5a7b45ab056dde1f4f7ac921c5f01b70952216d73d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:44.444786Z","signature_b64":"baCpjgwcr8+t3tkvHjwq2KnIjJEzt0ikLUMOY6zJdq3XPK8kxJDPCB1q/ObZUuIhUfAXUzNRC9nMwdebVgjdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dee46127522fb113bfb5d529123f1c31808fab13101b73bcf6fa2fe4cf42057","last_reissued_at":"2026-05-18T01:03:44.444428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:44.444428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"WordRank: Learning Word Embeddings via Robust Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Hyokun Yun, Pinar Yanardag, Shihao Ji, Shin Matsushima, S. V. N. Vishwanathan","submitted_at":"2015-06-09T03:08:06Z","abstract_excerpt":"Embedding words in a vector space has gained a lot of attention in recent years. While state-of-the-art methods provide efficient computation of word similarities via a low-dimensional matrix embedding, their motivation is often left unclear. In this paper, we argue that word embedding can be naturally viewed as a ranking problem due to the ranking nature of the evaluation metrics. Then, based on this insight, we propose a novel framework WordRank that efficiently estimates word representations via robust ranking, in which the attention mechanism and robustness to noise are readily achieved vi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02761","kind":"arxiv","version":4},"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":"1506.02761","created_at":"2026-05-18T01:03:44.444485+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02761v4","created_at":"2026-05-18T01:03:44.444485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02761","created_at":"2026-05-18T01:03:44.444485+00:00"},{"alias_kind":"pith_short_12","alias_value":"JXXEMETVEL5R","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JXXEMETVEL5RCO73","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JXXEMETV","created_at":"2026-05-18T12:29:27.538025+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/JXXEMETVEL5RCO73LVJJCI7RYM","json":"https://pith.science/pith/JXXEMETVEL5RCO73LVJJCI7RYM.json","graph_json":"https://pith.science/api/pith-number/JXXEMETVEL5RCO73LVJJCI7RYM/graph.json","events_json":"https://pith.science/api/pith-number/JXXEMETVEL5RCO73LVJJCI7RYM/events.json","paper":"https://pith.science/paper/JXXEMETV"},"agent_actions":{"view_html":"https://pith.science/pith/JXXEMETVEL5RCO73LVJJCI7RYM","download_json":"https://pith.science/pith/JXXEMETVEL5RCO73LVJJCI7RYM.json","view_paper":"https://pith.science/paper/JXXEMETV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02761&json=true","fetch_graph":"https://pith.science/api/pith-number/JXXEMETVEL5RCO73LVJJCI7RYM/graph.json","fetch_events":"https://pith.science/api/pith-number/JXXEMETVEL5RCO73LVJJCI7RYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JXXEMETVEL5RCO73LVJJCI7RYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JXXEMETVEL5RCO73LVJJCI7RYM/action/storage_attestation","attest_author":"https://pith.science/pith/JXXEMETVEL5RCO73LVJJCI7RYM/action/author_attestation","sign_citation":"https://pith.science/pith/JXXEMETVEL5RCO73LVJJCI7RYM/action/citation_signature","submit_replication":"https://pith.science/pith/JXXEMETVEL5RCO73LVJJCI7RYM/action/replication_record"}},"created_at":"2026-05-18T01:03:44.444485+00:00","updated_at":"2026-05-18T01:03:44.444485+00:00"}