{"work":{"id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","openalex_id":null,"doi":null,"arxiv_id":"1803.00567","raw_key":null,"title":"Computational","authors":null,"authors_text":"Peyr","year":2018,"venue":null,"abstract":null,"external_url":"https://arxiv.org/abs/1803.00567","cited_by_count":null,"metadata_source":"arxiv_reference","metadata_fetched_at":"2026-06-27T19:01:08.824258+00:00","pith_arxiv_id":null,"created_at":"2026-05-09T00:24:28.620333+00:00","updated_at":"2026-06-27T19:01:08.824258+00:00","title_quality_ok":false,"display_title":"Computational optima l transport","render_title":"Computational optima l transport"},"hub":{"state":{"work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":12,"external_cited_by_count":null,"distinct_field_count":8,"first_pith_cited_at":"2019-06-29T18:56:32+00:00","last_pith_cited_at":"2026-06-23T14:24:43+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-07-01T05:01:06.644410+00:00","tier_text":"hub"},"tier":"hub","role_counts":[{"context_role":"background","n":2},{"context_role":"method","n":1}],"polarity_counts":[{"context_polarity":"background","n":2},{"context_polarity":"use_method","n":1}],"runs":{},"summary":{},"graph":{},"authors":[]}}