{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4KF6L7NW6HPIAJEBF5D6PYFZIL","short_pith_number":"pith:4KF6L7NW","schema_version":"1.0","canonical_sha256":"e28be5fdb6f1de8024812f47e7e0b942ecab6dc09cc0c47ab8453b56b0c8300c","source":{"kind":"arxiv","id":"1709.01199","version":1},"attestation_state":"computed","paper":{"title":"Using $k$-way Co-occurrences for Learning Word Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Danushka Bollegala, Ken-ichi Kawarabayashi, Yuichi Yoshida","submitted_at":"2017-09-05T00:25:58Z","abstract_excerpt":"Co-occurrences between two words provide useful insights into the semantics of those words. Consequently, numerous prior work on word embedding learning have used co-occurrences between two words as the training signal for learning word embeddings. However, in natural language texts it is common for multiple words to be related and co-occurring in the same context. We extend the notion of co-occurrences to cover $k(\\geq\\!\\!2)$-way co-occurrences among a set of $k$-words. Specifically, we prove a theoretical relationship between the joint probability of $k(\\geq\\!\\!2)$ words, and the sum of $\\el"},"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":"1709.01199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-09-05T00:25:58Z","cross_cats_sorted":[],"title_canon_sha256":"311232b6e2c8973f091f335bf0ccc8685b344195da40b7a93035d2059e7fa02a","abstract_canon_sha256":"f7e8dc4a15842fa20e83d0e5019de3eaa4c2d07d7054aaeaca1c04941fa27626"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:00.664382Z","signature_b64":"P6kEvBehpnZVLuojAsQZplny699wsF2Xcwot2FNjmuijLgzVMvgX43nbhDIT2L3nzaGtEqaPDZAWogo/uJWAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e28be5fdb6f1de8024812f47e7e0b942ecab6dc09cc0c47ab8453b56b0c8300c","last_reissued_at":"2026-05-18T00:36:00.663876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:00.663876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using $k$-way Co-occurrences for Learning Word Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Danushka Bollegala, Ken-ichi Kawarabayashi, Yuichi Yoshida","submitted_at":"2017-09-05T00:25:58Z","abstract_excerpt":"Co-occurrences between two words provide useful insights into the semantics of those words. Consequently, numerous prior work on word embedding learning have used co-occurrences between two words as the training signal for learning word embeddings. However, in natural language texts it is common for multiple words to be related and co-occurring in the same context. We extend the notion of co-occurrences to cover $k(\\geq\\!\\!2)$-way co-occurrences among a set of $k$-words. Specifically, we prove a theoretical relationship between the joint probability of $k(\\geq\\!\\!2)$ words, and the sum of $\\el"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01199","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":"1709.01199","created_at":"2026-05-18T00:36:00.663969+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01199v1","created_at":"2026-05-18T00:36:00.663969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01199","created_at":"2026-05-18T00:36:00.663969+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KF6L7NW6HPI","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KF6L7NW6HPIAJEB","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KF6L7NW","created_at":"2026-05-18T12:31:00.734936+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/4KF6L7NW6HPIAJEBF5D6PYFZIL","json":"https://pith.science/pith/4KF6L7NW6HPIAJEBF5D6PYFZIL.json","graph_json":"https://pith.science/api/pith-number/4KF6L7NW6HPIAJEBF5D6PYFZIL/graph.json","events_json":"https://pith.science/api/pith-number/4KF6L7NW6HPIAJEBF5D6PYFZIL/events.json","paper":"https://pith.science/paper/4KF6L7NW"},"agent_actions":{"view_html":"https://pith.science/pith/4KF6L7NW6HPIAJEBF5D6PYFZIL","download_json":"https://pith.science/pith/4KF6L7NW6HPIAJEBF5D6PYFZIL.json","view_paper":"https://pith.science/paper/4KF6L7NW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01199&json=true","fetch_graph":"https://pith.science/api/pith-number/4KF6L7NW6HPIAJEBF5D6PYFZIL/graph.json","fetch_events":"https://pith.science/api/pith-number/4KF6L7NW6HPIAJEBF5D6PYFZIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KF6L7NW6HPIAJEBF5D6PYFZIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KF6L7NW6HPIAJEBF5D6PYFZIL/action/storage_attestation","attest_author":"https://pith.science/pith/4KF6L7NW6HPIAJEBF5D6PYFZIL/action/author_attestation","sign_citation":"https://pith.science/pith/4KF6L7NW6HPIAJEBF5D6PYFZIL/action/citation_signature","submit_replication":"https://pith.science/pith/4KF6L7NW6HPIAJEBF5D6PYFZIL/action/replication_record"}},"created_at":"2026-05-18T00:36:00.663969+00:00","updated_at":"2026-05-18T00:36:00.663969+00:00"}