{"work":{"id":"a4a25e66-8de3-4c82-acfc-23967e5f3b24","openalex_id":"https://openalex.org/W3155451407","doi":"10.1109/focs52979.2021.00010","arxiv_id":"2979.2021","raw_key":"raw:aaee06a000bec25da8567b86","title":"Spectral hypergraph sparsifiers of nearly linear size","authors":null,"authors_text":"[KKTY21a] Michael Kapralov, Robert Krauthgamer, Jakab Tardos, and Yuichi Yoshida","year":2021,"venue":null,"abstract":null,"external_url":"https://arxiv.org/abs/2979.2021","cited_by_count":20,"metadata_source":"arxiv_reference","metadata_fetched_at":"2026-08-05T02:28:24.338817+00:00","pith_arxiv_id":null,"created_at":"2026-05-09T22:24:01.170071+00:00","updated_at":"2026-08-05T02:28:24.338817+00:00","title_quality_ok":false,"display_title":"Korhonen, A single-exponential time 2-approximation algorithm for treewidth, in: IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS 2021), 2022, pp","render_title":"Korhonen, A single-exponential time 2-approximation algorithm for treewidth, in: IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS 2021), 2022, pp"},"hub":{"state":{"work_id":"a4a25e66-8de3-4c82-acfc-23967e5f3b24","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":35,"external_cited_by_count":20,"distinct_field_count":13,"first_pith_cited_at":"2024-03-19T13:49:31+00:00","last_pith_cited_at":"2026-07-09T09:05:00+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-08-23T12:59:26.478482+00:00","tier_text":"hub"},"tier":"hub","role_counts":[{"context_role":"background","n":2},{"context_role":"other","n":1}],"polarity_counts":[{"context_polarity":"background","n":2},{"context_polarity":"unclear","n":1}],"runs":{},"summary":{},"graph":{},"authors":[]}}