{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:T3LREQCC5DKBVIHVZJODAINTCR","short_pith_number":"pith:T3LREQCC","schema_version":"1.0","canonical_sha256":"9ed7124042e8d41aa0f5ca5c3021b3145ac19bafc8d4c51ecbca358d1a645fc8","source":{"kind":"arxiv","id":"1705.08039","version":2},"attestation_state":"computed","paper":{"title":"Poincar\\'e Embeddings for Learning Hierarchical Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Douwe Kiela, Maximilian Nickel","submitted_at":"2017-05-22T23:14:36Z","abstract_excerpt":"Representation learning has become an invaluable approach for learning from symbolic data such as text and graphs. However, while complex symbolic datasets often exhibit a latent hierarchical structure, state-of-the-art methods typically learn embeddings in Euclidean vector spaces, which do not account for this property. For this purpose, we introduce a new approach for learning hierarchical representations of symbolic data by embedding them into hyperbolic space -- or more precisely into an n-dimensional Poincar\\'e ball. Due to the underlying hyperbolic geometry, this allows us to learn parsi"},"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":"1705.08039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-22T23:14:36Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8a48e4a5b89a1aa290440591efb84cf71549dae7a64982a109db323eb4f6183f","abstract_canon_sha256":"e4243de18f062698082e397f29446d0ea5150146046705d81313db63c6d68f8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:39.049587Z","signature_b64":"gY1jm5GHXLe3ZBd5bljo/Pu1LptlzUT+EixKTJNSYoaFdDbIOUImQQg2kBCmlV4BqniY8+6BdYTO4C9gU0nGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ed7124042e8d41aa0f5ca5c3021b3145ac19bafc8d4c51ecbca358d1a645fc8","last_reissued_at":"2026-05-18T00:43:39.048935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:39.048935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Poincar\\'e Embeddings for Learning Hierarchical Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Douwe Kiela, Maximilian Nickel","submitted_at":"2017-05-22T23:14:36Z","abstract_excerpt":"Representation learning has become an invaluable approach for learning from symbolic data such as text and graphs. However, while complex symbolic datasets often exhibit a latent hierarchical structure, state-of-the-art methods typically learn embeddings in Euclidean vector spaces, which do not account for this property. For this purpose, we introduce a new approach for learning hierarchical representations of symbolic data by embedding them into hyperbolic space -- or more precisely into an n-dimensional Poincar\\'e ball. Due to the underlying hyperbolic geometry, this allows us to learn parsi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08039","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.08039","created_at":"2026-05-18T00:43:39.049033+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08039v2","created_at":"2026-05-18T00:43:39.049033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08039","created_at":"2026-05-18T00:43:39.049033+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3LREQCC5DKB","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3LREQCC5DKBVIHV","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3LREQCC","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2511.16698","citing_title":"Hierarchical Retrieval with Out-Of-Vocabulary Queries: A Case Study on SNOMED CT","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2603.08965","citing_title":"Semantic Level of Detail for Knowledge Graphs: Discovering Abstraction Boundaries via Spectral Heat Diffusion","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2604.24337","citing_title":"New non-Euclidean neural quantum states from additional types of hyperbolic recurrent neural networks","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T3LREQCC5DKBVIHVZJODAINTCR","json":"https://pith.science/pith/T3LREQCC5DKBVIHVZJODAINTCR.json","graph_json":"https://pith.science/api/pith-number/T3LREQCC5DKBVIHVZJODAINTCR/graph.json","events_json":"https://pith.science/api/pith-number/T3LREQCC5DKBVIHVZJODAINTCR/events.json","paper":"https://pith.science/paper/T3LREQCC"},"agent_actions":{"view_html":"https://pith.science/pith/T3LREQCC5DKBVIHVZJODAINTCR","download_json":"https://pith.science/pith/T3LREQCC5DKBVIHVZJODAINTCR.json","view_paper":"https://pith.science/paper/T3LREQCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08039&json=true","fetch_graph":"https://pith.science/api/pith-number/T3LREQCC5DKBVIHVZJODAINTCR/graph.json","fetch_events":"https://pith.science/api/pith-number/T3LREQCC5DKBVIHVZJODAINTCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3LREQCC5DKBVIHVZJODAINTCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3LREQCC5DKBVIHVZJODAINTCR/action/storage_attestation","attest_author":"https://pith.science/pith/T3LREQCC5DKBVIHVZJODAINTCR/action/author_attestation","sign_citation":"https://pith.science/pith/T3LREQCC5DKBVIHVZJODAINTCR/action/citation_signature","submit_replication":"https://pith.science/pith/T3LREQCC5DKBVIHVZJODAINTCR/action/replication_record"}},"created_at":"2026-05-18T00:43:39.049033+00:00","updated_at":"2026-05-18T00:43:39.049033+00:00"}