{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2C6FYMHJQWNEAFUIFXOSBOT73S","short_pith_number":"pith:2C6FYMHJ","canonical_record":{"source":{"id":"1705.03556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-05-09T22:09:01Z","cross_cats_sorted":["cs.CL","cs.LG","cs.NE"],"title_canon_sha256":"e2165a23b074a72ef8eef566ca0130e51a4b3b14c7901709aa75f879d3060a7e","abstract_canon_sha256":"ca71ee90781d5341d66be01d2dd2893c65f7561d3c409d219fb2a4adeb7c7fe9"},"schema_version":"1.0"},"canonical_sha256":"d0bc5c30e9859a4016882ddd20ba7fdcb08e25b7534375fc048a8815fd8fea41","source":{"kind":"arxiv","id":"1705.03556","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03556","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03556v2","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03556","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"pith_short_12","alias_value":"2C6FYMHJQWNE","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2C6FYMHJQWNEAFUI","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2C6FYMHJ","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2C6FYMHJQWNEAFUIFXOSBOT73S","target":"record","payload":{"canonical_record":{"source":{"id":"1705.03556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-05-09T22:09:01Z","cross_cats_sorted":["cs.CL","cs.LG","cs.NE"],"title_canon_sha256":"e2165a23b074a72ef8eef566ca0130e51a4b3b14c7901709aa75f879d3060a7e","abstract_canon_sha256":"ca71ee90781d5341d66be01d2dd2893c65f7561d3c409d219fb2a4adeb7c7fe9"},"schema_version":"1.0"},"canonical_sha256":"d0bc5c30e9859a4016882ddd20ba7fdcb08e25b7534375fc048a8815fd8fea41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:12.928890Z","signature_b64":"SVrpdok/0EuuLIgwJAqgTMmVNtNsvdWoCKWA3eWwlC+xUsJZkdP3D2+OzjSLbc52CvmyLWVgvqBLLbpaYAbqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0bc5c30e9859a4016882ddd20ba7fdcb08e25b7534375fc048a8815fd8fea41","last_reissued_at":"2026-05-18T00:40:12.928228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:12.928228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.03556","source_version":2,"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-18T00:40:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1W70YWw5FVUtaZPN3VsaZNV5bfpbXDvXfTwNqnJ9BhVlLlfkrGnF8RitkhgIwFlrDSX0ETVaITKqRhUm+ZsoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:17:35.708670Z"},"content_sha256":"6467243a0a76af92ffb8404172ee38a380157e61ce0b781230b0e0e81a34d775","schema_version":"1.0","event_id":"sha256:6467243a0a76af92ffb8404172ee38a380157e61ce0b781230b0e0e81a34d775"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2C6FYMHJQWNEAFUIFXOSBOT73S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relevance-based Word Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG","cs.NE"],"primary_cat":"cs.IR","authors_text":"Hamed Zamani, W. Bruce Croft","submitted_at":"2017-05-09T22:09:01Z","abstract_excerpt":"Learning a high-dimensional dense representation for vocabulary terms, also known as a word embedding, has recently attracted much attention in natural language processing and information retrieval tasks. The embedding vectors are typically learned based on term proximity in a large corpus. This means that the objective in well-known word embedding algorithms, e.g., word2vec, is to accurately predict adjacent word(s) for a given word or context. However, this objective is not necessarily equivalent to the goal of many information retrieval (IR) tasks. The primary objective in various IR tasks "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03556","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"},"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-18T00:40:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"prFMLvTtzyXZelIbW7jlTLliAzNqx77lkzRl8Mx1vtUoHs9e+zRkojXsER0tQllnMTuBmqu9LOeIaRKipoy3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:17:35.709335Z"},"content_sha256":"b27d452094a1a5c8a50b4faf5b0de43737b6c5eb95442c023f7df31ff7d1dce2","schema_version":"1.0","event_id":"sha256:b27d452094a1a5c8a50b4faf5b0de43737b6c5eb95442c023f7df31ff7d1dce2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2C6FYMHJQWNEAFUIFXOSBOT73S/bundle.json","state_url":"https://pith.science/pith/2C6FYMHJQWNEAFUIFXOSBOT73S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2C6FYMHJQWNEAFUIFXOSBOT73S/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-06-11T20:17:35Z","links":{"resolver":"https://pith.science/pith/2C6FYMHJQWNEAFUIFXOSBOT73S","bundle":"https://pith.science/pith/2C6FYMHJQWNEAFUIFXOSBOT73S/bundle.json","state":"https://pith.science/pith/2C6FYMHJQWNEAFUIFXOSBOT73S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2C6FYMHJQWNEAFUIFXOSBOT73S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2C6FYMHJQWNEAFUIFXOSBOT73S","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":"ca71ee90781d5341d66be01d2dd2893c65f7561d3c409d219fb2a4adeb7c7fe9","cross_cats_sorted":["cs.CL","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-05-09T22:09:01Z","title_canon_sha256":"e2165a23b074a72ef8eef566ca0130e51a4b3b14c7901709aa75f879d3060a7e"},"schema_version":"1.0","source":{"id":"1705.03556","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03556","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03556v2","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03556","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"pith_short_12","alias_value":"2C6FYMHJQWNE","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2C6FYMHJQWNEAFUI","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2C6FYMHJ","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:b27d452094a1a5c8a50b4faf5b0de43737b6c5eb95442c023f7df31ff7d1dce2","target":"graph","created_at":"2026-05-18T00:40:12Z","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":"Learning a high-dimensional dense representation for vocabulary terms, also known as a word embedding, has recently attracted much attention in natural language processing and information retrieval tasks. The embedding vectors are typically learned based on term proximity in a large corpus. This means that the objective in well-known word embedding algorithms, e.g., word2vec, is to accurately predict adjacent word(s) for a given word or context. However, this objective is not necessarily equivalent to the goal of many information retrieval (IR) tasks. The primary objective in various IR tasks ","authors_text":"Hamed Zamani, W. Bruce Croft","cross_cats":["cs.CL","cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-05-09T22:09:01Z","title":"Relevance-based Word Embedding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03556","kind":"arxiv","version":2},"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:6467243a0a76af92ffb8404172ee38a380157e61ce0b781230b0e0e81a34d775","target":"record","created_at":"2026-05-18T00:40:12Z","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":"ca71ee90781d5341d66be01d2dd2893c65f7561d3c409d219fb2a4adeb7c7fe9","cross_cats_sorted":["cs.CL","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-05-09T22:09:01Z","title_canon_sha256":"e2165a23b074a72ef8eef566ca0130e51a4b3b14c7901709aa75f879d3060a7e"},"schema_version":"1.0","source":{"id":"1705.03556","kind":"arxiv","version":2}},"canonical_sha256":"d0bc5c30e9859a4016882ddd20ba7fdcb08e25b7534375fc048a8815fd8fea41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0bc5c30e9859a4016882ddd20ba7fdcb08e25b7534375fc048a8815fd8fea41","first_computed_at":"2026-05-18T00:40:12.928228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:12.928228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SVrpdok/0EuuLIgwJAqgTMmVNtNsvdWoCKWA3eWwlC+xUsJZkdP3D2+OzjSLbc52CvmyLWVgvqBLLbpaYAbqAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:12.928890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03556","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6467243a0a76af92ffb8404172ee38a380157e61ce0b781230b0e0e81a34d775","sha256:b27d452094a1a5c8a50b4faf5b0de43737b6c5eb95442c023f7df31ff7d1dce2"],"state_sha256":"e868f7a078b13e2515512101e16c9f82da59f090dfd121365b5a9be873a35775"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CjbW1E3manswPvCDNs08bJNSf7e5Rl/j6UL0nTmOV+zLbB2Dhjl1qm0iwVz2B5E6z1FzyzanIroC76YUAjbLDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T20:17:35.713252Z","bundle_sha256":"0af151ed43206cc7df740122b60c08bf019b838a49f45e6575159bddde398500"}}