{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T16:31:16Z","timestamp":1792168276986,"version":"4.4.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,11]],"date-time":"2015-01-11T00:00:00Z","timestamp":1420934400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"USA-Israel BSF","award":["2010418"],"award-info":[{"award-number":["2010418"]}]},{"name":"Citi Foundation"},{"name":"Israel Science Foundation","award":["897\/13"],"award-info":[{"award-number":["897\/13"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,1,11]]},"DOI":"10.1145\/2688073.2688093","type":"proceedings-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T15:42:45Z","timestamp":1421077365000},"page":"367-376","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["Sketching Cuts in Graphs and Hypergraphs"],"prefix":"10.1145","author":[{"given":"Dmitry","family":"Kogan","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Krauthgamer","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_27"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095156"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213560"},{"key":"e_1_3_2_1_4_1","volume-title":"The sketching complexity of graph cuts. CoRR, abs\/1403.7058","author":"Andoni A.","year":"2014"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237827"},{"key":"e_1_3_2_1_6_1","first-page":"0207078","article-title":"Randomized approximation schemes for cuts and ows in capacitated graphs. CoRR, cs.","author":"Karger A. A.","year":"2002","journal-title":"DS\/0"},{"key":"e_1_3_2_1_7_1","volume-title":"Sparse sums of positive semidefinite matrices. CoRR, abs\/1107.0088","author":"de Carli Silva M. K.","year":"2011"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806725"},{"key":"e_1_3_2_1_9_1","first-page":"290","volume-title":"On the structure of the system of minimum edge cuts in a graph. Issledovaniya po Diskretnoi Optimizatsii","author":"Dinitz E. A.","year":"1976"},{"key":"e_1_3_2_1_10_1","volume-title":"Single pass sparsification in the streaming model with edge deletions. CoRR, abs\/1203.4900","author":"Goel A.","year":"2012"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00079-8"},{"key":"e_1_3_2_1_14_1","unstructured":"P. Indyk A. McGregor I. Newman and K. Onak. Open questions in data streams property testing and related topics. http:\/\/people:cs:umass:edu\/~mcgregor\/papers\/11-openproblems:pdf 2011. See Also http:\/\/sublinear:info\/45.  P. Indyk A. McGregor I. Newman and K. Onak. Open questions in data streams property testing and related topics. http:\/\/people:cs:umass:edu\/~mcgregor\/papers\/11-openproblems:pdf 2011. See Also http:\/\/sublinear:info\/45."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722213"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.66"},{"key":"e_1_3_2_1_17_1","first-page":"30","volume-title":"Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '93","author":"Karger D. R.","year":"1993"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/314613.314833"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.24.2.383"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.58"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447372"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806698"},{"issue":"2","key":"e_1_3_2_1_24_1","first-page":"47","article-title":"Lower bound of network reliability","volume":"8","author":"Lomonosov M. V.","year":"1972","journal-title":"Problemy Peredachi Informatsii"},{"key":"e_1_3_2_1_25_1","unstructured":"A. Louis. Hypergraph Markov operators eigenvalues and approximation algorithms. CoRR abs\/1408.2425 2014.arXiv:1408:2425.  A. Louis. Hypergraph Markov operators eigenvalues and approximation algorithms. CoRR abs\/1408.2425 2014.arXiv:1408:2425."},{"key":"e_1_3_2_1_26_1","first-page":"339","volume-title":"Algorithms and Techniques (APPROX\/RANDOM 2014","volume":"28","author":"Louis A.","year":"2014"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627692.2627694"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.28"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480194271323"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/100801809"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130114"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/SmartGridComm.2014.7007750"},{"key":"e_1_3_2_1_34_1","first-page":"11","volume-title":"Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Yu W.","year":"2011"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.10.017"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_13"}],"event":{"name":"ITCS'15: Innovations in Theoretical Computer Science","location":"Rehovot Israel","acronym":"ITCS'15","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688073.2688093","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2688073.2688093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:03Z","timestamp":1750212783000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688073.2688093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,11]]},"references-count":35,"alternative-id":["10.1145\/2688073.2688093","10.1145\/2688073"],"URL":"https:\/\/doi.org\/10.1145\/2688073.2688093","relation":{},"subject":[],"published":{"date-parts":[[2015,1,11]]},"assertion":[{"value":"2015-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}