{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JXXEMETVEL5RCO73LVJJCI7RYM","short_pith_number":"pith:JXXEMETV","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"},"canonical_sha256":"4dee46127522fb113bfb5d529123f1c31808fab13101b73bcf6fa2fe4cf42057","source":{"kind":"arxiv","id":"1506.02761","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02761","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02761v4","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02761","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"JXXEMETVEL5R","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JXXEMETVEL5RCO73","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JXXEMETV","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JXXEMETVEL5RCO73LVJJCI7RYM","target":"record","payload":{"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"},"canonical_sha256":"4dee46127522fb113bfb5d529123f1c31808fab13101b73bcf6fa2fe4cf42057","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"},"source_kind":"arxiv","source_id":"1506.02761","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dnE6sEwYrtsyieJDGI2Q/O6ltWGeKxCkBBiCTmtkbArzOvcgWVOF2cK1fdHcWQeSRUH+w2tRQoLa1R35PlT+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:29:32.048008Z"},"content_sha256":"94e56234f29eef4f2c4890ddfd7bf1dd377e9b63c0fbd58b06e804765b746782","schema_version":"1.0","event_id":"sha256:94e56234f29eef4f2c4890ddfd7bf1dd377e9b63c0fbd58b06e804765b746782"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JXXEMETVEL5RCO73LVJJCI7RYM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mOPWlKRJyF/wjxCDcYyyVq0/FiNe/53uWmu4Gmz/SqZ1tE4XNVwZ/Qc0YaNMRr1ioVeP3kY1oLPuCt2w06Q2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:29:32.048700Z"},"content_sha256":"96cbc5276a946ccbd74ea94517d34714190c2609f2514a21336fa45b513e2fb5","schema_version":"1.0","event_id":"sha256:96cbc5276a946ccbd74ea94517d34714190c2609f2514a21336fa45b513e2fb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXXEMETVEL5RCO73LVJJCI7RYM/bundle.json","state_url":"https://pith.science/pith/JXXEMETVEL5RCO73LVJJCI7RYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXXEMETVEL5RCO73LVJJCI7RYM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T04:29:32Z","links":{"resolver":"https://pith.science/pith/JXXEMETVEL5RCO73LVJJCI7RYM","bundle":"https://pith.science/pith/JXXEMETVEL5RCO73LVJJCI7RYM/bundle.json","state":"https://pith.science/pith/JXXEMETVEL5RCO73LVJJCI7RYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXXEMETVEL5RCO73LVJJCI7RYM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JXXEMETVEL5RCO73LVJJCI7RYM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5cd19de662848dcf9bc0ee5a7b45ab056dde1f4f7ac921c5f01b70952216d73d","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-09T03:08:06Z","title_canon_sha256":"b43900555b9528cc24fdcd653888127de2b03ec4f1874dea13e008888f9f3834"},"schema_version":"1.0","source":{"id":"1506.02761","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02761","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02761v4","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02761","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"JXXEMETVEL5R","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JXXEMETVEL5RCO73","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JXXEMETV","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:96cbc5276a946ccbd74ea94517d34714190c2609f2514a21336fa45b513e2fb5","target":"graph","created_at":"2026-05-18T01:03:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hyokun Yun, Pinar Yanardag, Shihao Ji, Shin Matsushima, S. V. N. Vishwanathan","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-09T03:08:06Z","title":"WordRank: Learning Word Embeddings via Robust Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02761","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:94e56234f29eef4f2c4890ddfd7bf1dd377e9b63c0fbd58b06e804765b746782","target":"record","created_at":"2026-05-18T01:03:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5cd19de662848dcf9bc0ee5a7b45ab056dde1f4f7ac921c5f01b70952216d73d","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-09T03:08:06Z","title_canon_sha256":"b43900555b9528cc24fdcd653888127de2b03ec4f1874dea13e008888f9f3834"},"schema_version":"1.0","source":{"id":"1506.02761","kind":"arxiv","version":4}},"canonical_sha256":"4dee46127522fb113bfb5d529123f1c31808fab13101b73bcf6fa2fe4cf42057","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4dee46127522fb113bfb5d529123f1c31808fab13101b73bcf6fa2fe4cf42057","first_computed_at":"2026-05-18T01:03:44.444428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:44.444428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"baCpjgwcr8+t3tkvHjwq2KnIjJEzt0ikLUMOY6zJdq3XPK8kxJDPCB1q/ObZUuIhUfAXUzNRC9nMwdebVgjdCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:44.444786Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02761","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94e56234f29eef4f2c4890ddfd7bf1dd377e9b63c0fbd58b06e804765b746782","sha256:96cbc5276a946ccbd74ea94517d34714190c2609f2514a21336fa45b513e2fb5"],"state_sha256":"59e48131a0940d15d81b122f1456f031403ad391a129283fa4fe4880556846a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLcpb47XAoOyO2eznE72AQZT2hCBJfWp/Y3cUkP05/eGp8stVDtRvTXsVQGCiFpPasTed9Ml/VDX/eHcXhgMDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:29:32.052300Z","bundle_sha256":"cad44b6525ad7a0ceff04804155030f9ea2a4bc849990b2e18c037a80c17ad46"}}