{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:03Z","timestamp":1750307043164,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"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":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214075","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"1091-1106","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Probabilistic existence of rigid combinatorial structures"],"prefix":"10.1145","author":[{"given":"Greg","family":"Kuperberg","sequence":"first","affiliation":[{"name":"University of California, Davis, Davis, CA, USA"}]},{"given":"Shachar","family":"Lovett","sequence":"additional","affiliation":[{"name":"Institute for Advanced Study, Princeton, NJ, USA"}]},{"given":"Ron","family":"Peled","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Almost k-wise vs k-wise independent permutations, and uniformity for general group actions","author":"Alon N.","year":"2011","unstructured":"N. Alon and S. Lovett . Almost k-wise vs k-wise independent permutations, and uniformity for general group actions , 2011 . ECCC TR 11-049. N. Alon and S. Lovett. Almost k-wise vs k-wise independent permutations, and uniformity for general group actions, 2011. ECCC TR11-049."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1997.2780"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.7"},{"key":"e_1_3_2_2_4_1","first-page":"611","volume-title":"Handbook of combinatorics","author":"Cameron P. J.","year":"1995","unstructured":"P. J. Cameron . Permutation groups . In Handbook of combinatorics , Vol. 1 , 2, pages 611 -- 645 . Elsevier , 1995 . P. J. Cameron. Permutation groups. In Handbook of combinatorics, Vol. 1, 2, pages 611--645. Elsevier, 1995."},{"key":"e_1_3_2_2_5_1","volume-title":"The CRC handbook of combinatorial designs. Discrete Mathematics and its Applications","author":"Colbourn C. J.","year":"2007","unstructured":"C. J. Colbourn and J. H. Dinitz , editors . The CRC handbook of combinatorial designs. Discrete Mathematics and its Applications . Chapman & Hall\/CRC , 2 nd edition, 2007 . C. J. Colbourn and J. H. Dinitz, editors. The CRC handbook of combinatorial designs. Discrete Mathematics and its Applications. Chapman & Hall\/CRC, 2nd edition, 2007.","edition":"2"},{"key":"e_1_3_2_2_6_1","first-page":"609","volume-title":"Math. Soc. J. Bolyai","author":"Erdos P.","year":"1975","unstructured":"P. Erdos and L. Lov\u00e1sz . Problems and results on 3-chromatic hypergraphs and some related questions. In Infinite and Finite Sets, number 11 in Coll . Math. Soc. J. Bolyai , pages 609 -- 627 . North-Holland , 1975 . P. Erdos and L. Lov\u00e1sz. Problems and results on 3-chromatic hypergraphs and some related questions. In Infinite and Finite Sets, number 11 in Coll. Math. Soc. J. Bolyai, pages 609--627. North-Holland, 1975."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.4169\/000298909X474909"},{"key":"e_1_3_2_2_8_1","volume-title":"A recursive construction of t-wise uniform permutations","author":"Finucane H.","year":"2012","unstructured":"H. Finucane , R. Peled , and Y. Yaari . A recursive construction of t-wise uniform permutations . 2012 . H. Finucane, R. Peled, and Y. Yaari. A recursive construction of t-wise uniform permutations. 2012."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1478-6","volume-title":"Orthogonal arrays: Theory and applications","author":"Hedayat A. S.","year":"1999","unstructured":"A. S. Hedayat , N. J. A. Sloane , and J. Stufken . Orthogonal arrays: Theory and applications . Springer-Verlag , 1999 . A. S. Hedayat, N. J. A. Sloane, and J. Stufken. Orthogonal arrays: Theory and applications. Springer-Verlag, 1999."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_30"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211053"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00222-007-0065-y"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480192228140"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.2478\/s12175-008-0109-9"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536462"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667060"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/B978-0-7204-2262-7.50034-X","volume-title":"Survey of combinatorial theory","author":"Rao C. R.","year":"1973","unstructured":"C. R. Rao . Some combinatorial problems of arrays and applications to design of experiments . In J. N. Srivastava, editor, Survey of combinatorial theory , chapter 29, pages 349 -- 359 . North-Holland , 1973 . C. R. Rao. Some combinatorial problems of arrays and applications to design of experiments. In J. N. Srivastava, editor, Survey of combinatorial theory, chapter 29, pages 349--359. North-Holland, 1973."},{"issue":"3","key":"e_1_3_2_2_18_1","first-page":"737","article-title":"On $t$-designs","volume":"12","author":"Ray-Chaudhuri D. K.","year":"1975","unstructured":"D. K. Ray-Chaudhuri and R. M. Wilson . On $t$-designs . Osaka J. Math. , 12 ( 3 ): 737 -- 744 , 1975 . D. K. Ray-Chaudhuri and R. M. Wilson. On $t$-designs. Osaka J. Math., 12(3):737--744, 1975.","journal-title":"Osaka J. Math."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1985-0784009-0"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(87)90061-6"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214075","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:56Z","timestamp":1750238456000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":20,"alternative-id":["10.1145\/2213977.2214075","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214075","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}