{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TO4YV5GICBYCOJGSM6KS4GHNQM","short_pith_number":"pith:TO4YV5GI","schema_version":"1.0","canonical_sha256":"9bb98af4c810702724d267952e18ed830b27d5867fcf900f92f2710e66ea577f","source":{"kind":"arxiv","id":"1412.6623","version":4},"attestation_state":"computed","paper":{"title":"Word Representations via Gaussian Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Andrew McCallum, Luke Vilnis","submitted_at":"2014-12-20T07:42:40Z","abstract_excerpt":"Current work in lexical distributed representations maps each word to a point vector in low-dimensional space. Mapping instead to a density provides many interesting advantages, including better capturing uncertainty about a representation and its relationships, expressing asymmetries more naturally than dot product or cosine similarity, and enabling more expressive parameterization of decision boundaries. This paper advocates for density-based distributed embeddings and presents a method for learning representations in the space of Gaussian distributions. We compare performance on various wor"},"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":"1412.6623","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-12-20T07:42:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"04ff6036c48db556a1561b9f579bea09744099c07642798c4cf15e747a8a3f3d","abstract_canon_sha256":"37b34b3dff79325ac26b8967b41d46df10e2bb6ff3817fbd829dabae21dd4cf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:21.685421Z","signature_b64":"TFRZKkqngKca+DbfURSp+oa1ofXWcaId1NjrtG/TXhOmvh02Nzk5mDppd44uoRLKG0F3OS8clfZMSHfSKAAOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bb98af4c810702724d267952e18ed830b27d5867fcf900f92f2710e66ea577f","last_reissued_at":"2026-05-18T02:17:21.684710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:21.684710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Word Representations via Gaussian Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Andrew McCallum, Luke Vilnis","submitted_at":"2014-12-20T07:42:40Z","abstract_excerpt":"Current work in lexical distributed representations maps each word to a point vector in low-dimensional space. Mapping instead to a density provides many interesting advantages, including better capturing uncertainty about a representation and its relationships, expressing asymmetries more naturally than dot product or cosine similarity, and enabling more expressive parameterization of decision boundaries. This paper advocates for density-based distributed embeddings and presents a method for learning representations in the space of Gaussian distributions. We compare performance on various wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6623","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":"1412.6623","created_at":"2026-05-18T02:17:21.684815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6623v4","created_at":"2026-05-18T02:17:21.684815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6623","created_at":"2026-05-18T02:17:21.684815+00:00"},{"alias_kind":"pith_short_12","alias_value":"TO4YV5GICBYC","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TO4YV5GICBYCOJGS","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TO4YV5GI","created_at":"2026-05-18T12:28:49.207871+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/TO4YV5GICBYCOJGSM6KS4GHNQM","json":"https://pith.science/pith/TO4YV5GICBYCOJGSM6KS4GHNQM.json","graph_json":"https://pith.science/api/pith-number/TO4YV5GICBYCOJGSM6KS4GHNQM/graph.json","events_json":"https://pith.science/api/pith-number/TO4YV5GICBYCOJGSM6KS4GHNQM/events.json","paper":"https://pith.science/paper/TO4YV5GI"},"agent_actions":{"view_html":"https://pith.science/pith/TO4YV5GICBYCOJGSM6KS4GHNQM","download_json":"https://pith.science/pith/TO4YV5GICBYCOJGSM6KS4GHNQM.json","view_paper":"https://pith.science/paper/TO4YV5GI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6623&json=true","fetch_graph":"https://pith.science/api/pith-number/TO4YV5GICBYCOJGSM6KS4GHNQM/graph.json","fetch_events":"https://pith.science/api/pith-number/TO4YV5GICBYCOJGSM6KS4GHNQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TO4YV5GICBYCOJGSM6KS4GHNQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TO4YV5GICBYCOJGSM6KS4GHNQM/action/storage_attestation","attest_author":"https://pith.science/pith/TO4YV5GICBYCOJGSM6KS4GHNQM/action/author_attestation","sign_citation":"https://pith.science/pith/TO4YV5GICBYCOJGSM6KS4GHNQM/action/citation_signature","submit_replication":"https://pith.science/pith/TO4YV5GICBYCOJGSM6KS4GHNQM/action/replication_record"}},"created_at":"2026-05-18T02:17:21.684815+00:00","updated_at":"2026-05-18T02:17:21.684815+00:00"}