{"work":{"id":"c016149e-231e-40ae-a771-6cdae0f78587","openalex_id":null,"doi":null,"arxiv_id":"6700.2020","raw_key":"raw:2e158d69c788ea87f417477d","title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages =","authors":null,"authors_text":"Optimal streaming approximations for all boolean max-2csps and max-ksat , author =","year":2020,"venue":null,"abstract":null,"external_url":"https://arxiv.org/abs/6700.2020","cited_by_count":null,"metadata_source":"arxiv_reference","metadata_fetched_at":"2026-05-25T04:50:20.164696+00:00","pith_arxiv_id":null,"created_at":"2026-05-10T08:32:51.423293+00:00","updated_at":"2026-06-05T21:23:00.469572+00:00","title_quality_ok":false,"display_title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages =","render_title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages ="},"hub":{"state":{"work_id":"c016149e-231e-40ae-a771-6cdae0f78587","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":17,"external_cited_by_count":null,"distinct_field_count":4,"first_pith_cited_at":"2025-02-13T09:27:10+00:00","last_pith_cited_at":"2026-05-21T23:50:12+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-12T07:59:28.391548+00:00","tier_text":"hub"},"tier":"hub","role_counts":[{"context_role":"background","n":1}],"polarity_counts":[{"context_polarity":"background","n":1}],"runs":{},"summary":{},"graph":{},"authors":[]}}