{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T10:05:44Z","timestamp":1775729144811,"version":"3.50.1"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2013,3,6]],"date-time":"2013-03-06T00:00:00Z","timestamp":1362528000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2013,3,6]]},"DOI":"10.1145\/2447712.2447732","type":"journal-article","created":{"date-parts":[[2013,3,8]],"date-time":"2013-03-08T15:00:42Z","timestamp":1362754842000},"page":"70-78","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Computational geometry column 55"],"prefix":"10.1145","volume":"44","author":[{"given":"Suresh","family":"Venkatasubramanian","sequence":"first","affiliation":[{"name":"University of Utah"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213994"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.26.2.193.10561"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(93)90224-C"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213988"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/3116673.3117149"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/792764.793393"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2018158.2018181"},{"key":"e_1_2_1_8_1","volume-title":"Communication Complexity","author":"Kushilevitz E.","year":"2006","unstructured":"E. Kushilevitz and N. Nisan . Communication Complexity . Cambridge University Press , 2006 . E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 2006."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1038\/44565"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0803205106"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.104"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873687"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/070709967"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90024-Y"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2447712.2447732","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2447712.2447732","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:10Z","timestamp":1750239250000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2447712.2447732"}},"subtitle":["new developments in nonnegative matrix factorization"],"short-title":[],"issued":{"date-parts":[[2013,3,6]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3,6]]}},"alternative-id":["10.1145\/2447712.2447732"],"URL":"https:\/\/doi.org\/10.1145\/2447712.2447732","relation":{},"ISSN":["0163-5700"],"issn-type":[{"value":"0163-5700","type":"print"}],"subject":[],"published":{"date-parts":[[2013,3,6]]},"assertion":[{"value":"2013-03-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}