{"work":{"id":"20b46a8a-93ca-4b81-bea2-08ea27ec32b5","openalex_id":"https://openalex.org/W2199357291","doi":"10.1007/978-3-642-25878-7_34","arxiv_id":null,"raw_key":null,"title":"Sarkar.Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane, page 355–366","authors":null,"authors_text":"Sarkar, Rik , editor =","year":2012,"venue":"Lecture notes in computer science","abstract":null,"external_url":"https://doi.org/10.1007/978-3-642-25878-7_34","cited_by_count":158,"metadata_source":"openalex","metadata_fetched_at":"2026-08-05T02:28:24.338817+00:00","pith_arxiv_id":null,"created_at":"2026-05-09T03:14:58.056638+00:00","updated_at":"2026-08-05T02:28:24.338817+00:00","title_quality_ok":true,"display_title":"Sarkar.Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane, page 355–366","render_title":"Sarkar.Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane, page 355–366"},"hub":{"state":{"work_id":"20b46a8a-93ca-4b81-bea2-08ea27ec32b5","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":11,"external_cited_by_count":null,"distinct_field_count":7,"first_pith_cited_at":"2026-03-09T21:54:08+00:00","last_pith_cited_at":"2026-06-17T14:50:29+00:00","author_build_status":"not_needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"not_needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-06-29T19:59:14.262000+00:00","tier_text":"hub"},"tier":"hub","role_counts":[{"context_role":"background","n":1},{"context_role":"method","n":1}],"polarity_counts":[{"context_polarity":"background","n":1},{"context_polarity":"use_method","n":1}],"runs":{},"summary":{},"graph":{},"authors":[]}}