{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OOTOXJXUAV4BDYMBWMGITRYK7U","short_pith_number":"pith:OOTOXJXU","schema_version":"1.0","canonical_sha256":"73a6eba6f4057811e181b30c89c70afd35d3397d5096331117fc8c34e855ddf0","source":{"kind":"arxiv","id":"1806.04313","version":1},"attestation_state":"computed","paper":{"title":"Embedding Text in Hyperbolic Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Andrew M. Dai, Bhuwan Dhingra, Christopher J. Shallue, George E. Dahl, Mohammad Norouzi","submitted_at":"2018-06-12T03:25:15Z","abstract_excerpt":"Natural language text exhibits hierarchical structure in a variety of respects. Ideally, we could incorporate our prior knowledge of this hierarchical structure into unsupervised learning algorithms that work on text data. Recent work by Nickel & Kiela (2017) proposed using hyperbolic instead of Euclidean embedding spaces to represent hierarchical data and demonstrated encouraging results when embedding graphs. In this work, we extend their method with a re-parameterization technique that allows us to learn hyperbolic embeddings of arbitrarily parameterized objects. We apply this framework to "},"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":"1806.04313","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-12T03:25:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"689d1990aeabd254008a8089e52d25c6e7a9b6faf9d32868488dc3ce8b6264cb","abstract_canon_sha256":"f29afb4e0b799ba103adbacbe05c3e873a11b074c742d887972383e26eda1739"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:35.910198Z","signature_b64":"flRPDKaA7UssTBcz9Fku4SHxOX1wZt9QFCoBZvxjvmUUmSJB36efaLOhE3QX6xc2QKda4tVPoYB6a5cJhPa3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73a6eba6f4057811e181b30c89c70afd35d3397d5096331117fc8c34e855ddf0","last_reissued_at":"2026-05-18T00:13:35.909607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:35.909607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding Text in Hyperbolic Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Andrew M. Dai, Bhuwan Dhingra, Christopher J. Shallue, George E. Dahl, Mohammad Norouzi","submitted_at":"2018-06-12T03:25:15Z","abstract_excerpt":"Natural language text exhibits hierarchical structure in a variety of respects. Ideally, we could incorporate our prior knowledge of this hierarchical structure into unsupervised learning algorithms that work on text data. Recent work by Nickel & Kiela (2017) proposed using hyperbolic instead of Euclidean embedding spaces to represent hierarchical data and demonstrated encouraging results when embedding graphs. In this work, we extend their method with a re-parameterization technique that allows us to learn hyperbolic embeddings of arbitrarily parameterized objects. We apply this framework to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04313","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":"1806.04313","created_at":"2026-05-18T00:13:35.909686+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04313v1","created_at":"2026-05-18T00:13:35.909686+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04313","created_at":"2026-05-18T00:13:35.909686+00:00"},{"alias_kind":"pith_short_12","alias_value":"OOTOXJXUAV4B","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OOTOXJXUAV4BDYMB","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OOTOXJXU","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08650","citing_title":"Snomed2Vec: Random Walk and Poincar\\'e Embeddings of a Clinical Knowledge Base for Healthcare Analytics","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OOTOXJXUAV4BDYMBWMGITRYK7U","json":"https://pith.science/pith/OOTOXJXUAV4BDYMBWMGITRYK7U.json","graph_json":"https://pith.science/api/pith-number/OOTOXJXUAV4BDYMBWMGITRYK7U/graph.json","events_json":"https://pith.science/api/pith-number/OOTOXJXUAV4BDYMBWMGITRYK7U/events.json","paper":"https://pith.science/paper/OOTOXJXU"},"agent_actions":{"view_html":"https://pith.science/pith/OOTOXJXUAV4BDYMBWMGITRYK7U","download_json":"https://pith.science/pith/OOTOXJXUAV4BDYMBWMGITRYK7U.json","view_paper":"https://pith.science/paper/OOTOXJXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04313&json=true","fetch_graph":"https://pith.science/api/pith-number/OOTOXJXUAV4BDYMBWMGITRYK7U/graph.json","fetch_events":"https://pith.science/api/pith-number/OOTOXJXUAV4BDYMBWMGITRYK7U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OOTOXJXUAV4BDYMBWMGITRYK7U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OOTOXJXUAV4BDYMBWMGITRYK7U/action/storage_attestation","attest_author":"https://pith.science/pith/OOTOXJXUAV4BDYMBWMGITRYK7U/action/author_attestation","sign_citation":"https://pith.science/pith/OOTOXJXUAV4BDYMBWMGITRYK7U/action/citation_signature","submit_replication":"https://pith.science/pith/OOTOXJXUAV4BDYMBWMGITRYK7U/action/replication_record"}},"created_at":"2026-05-18T00:13:35.909686+00:00","updated_at":"2026-05-18T00:13:35.909686+00:00"}