{"id":"https://openalex.org/W7115170442","doi":"https://doi.org/10.1145/3785512.3785516","title":"Nine lower bound conjectures on streaming approximation algorithms for CSPs","display_name":"Nine lower bound conjectures on streaming approximation algorithms for CSPs","publication_year":2025,"publication_date":"2025-12-15","ids":{"openalex":"https://openalex.org/W7115170442","doi":"https://doi.org/10.1145/3785512.3785516"},"language":"en","primary_location":{"id":"doi:10.1145/3785512.3785516","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3785512.3785516","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Noah G. Singer","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Noah G. Singer","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.66540089,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"56","issue":"4","first_page":"25","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.933899998664856,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.933899998664856,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.01269999984651804,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.0071000000461936,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.560699999332428},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5275999903678894},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3847000002861023},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.33629998564720154}],"concepts":[{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.560699999332428},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5365999937057495},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5275999903678894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4894999861717224},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3847000002861023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3756999969482422},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3538999855518341},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33739998936653137},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.33629998564720154},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33500000834465027},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.2711000144481659}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3785512.3785516","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3785512.3785516","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1978676170","https://openalex.org/W1985123706","https://openalex.org/W1999032440","https://openalex.org/W2038691311","https://openalex.org/W2060383163","https://openalex.org/W2083756938","https://openalex.org/W2087038607","https://openalex.org/W2110871651","https://openalex.org/W2120358419","https://openalex.org/W2146489710","https://openalex.org/W2166566648","https://openalex.org/W2296544654","https://openalex.org/W2569746101","https://openalex.org/W2952096125","https://openalex.org/W2963692174","https://openalex.org/W2964228188","https://openalex.org/W3126995463","https://openalex.org/W3127944880","https://openalex.org/W3165922329","https://openalex.org/W3173219382","https://openalex.org/W4316652369","https://openalex.org/W4316652429","https://openalex.org/W4365563484","https://openalex.org/W4390097919","https://openalex.org/W4390098210","https://openalex.org/W4392295253","https://openalex.org/W4399521669","https://openalex.org/W4406141985","https://openalex.org/W4406143068"],"related_works":[],"abstract_inverted_index":{"Request":[0],"for":[1],"Columns!":[2],"I":[3],"invite":[4],"any":[5],"reader":[6],"who":[7],"has":[8],"knowledge":[9],"of":[10],"some":[11],"area":[12,29],"to":[13,18],"contact":[14],"me":[15],"and":[16,39],"arrange":[17],"write":[19],"a":[20],"column":[21],"about":[22],"open":[23],"problems":[24],"in":[25],"that":[26],"area.":[27],"That":[28],"can":[30],"be":[31],"(1)":[32],"broad":[33],"or":[34,36,43,46],"narrow":[35],"anywhere":[37,47],"inbetween,":[38],"(2)":[40],"really":[41,44],"important":[42],"unimportant":[45],"inbetween.":[48]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-12-15T00:00:00"}