{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:46Z","timestamp":1781031466797,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"JSPS KAKENHI","award":["23H00468"],"award-info":[{"award-number":["23H00468"]}]},{"name":"JSPS KAKENHI","award":["23K18460"],"award-info":[{"award-number":["23K18460"]}]},{"name":"JSPS KAKENHI","award":["23K17455"],"award-info":[{"award-number":["23K17455"]}]},{"name":"JSPS KAKENHI","award":["23K16837"],"award-info":[{"award-number":["23K16837"]}]},{"name":"JSPS KAKENHI","award":["24K21317"],"award-info":[{"award-number":["24K21317"]}]},{"name":"JSPS KAKENHI","award":["24H00071"],"award-info":[{"award-number":["24H00071"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800838","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1278-1289","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Hardness Amplification beyond Boolean Functions"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5448-6761","authenticated-orcid":false,"given":"Nobutaka","family":"Shimizu","sequence":"first","affiliation":[{"name":"Institute of Science Tokyo, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5552-8457","authenticated-orcid":false,"given":"Kenji","family":"Yasunaga","sequence":"additional","affiliation":[{"name":"Institute of Science Tokyo, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.187"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520041"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.90"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792543"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","unstructured":"Enric Boix-Adser\u00e0 Matthew Brennan and Guy Bresler. 2021. The Average-Case Complexity of Counting Cliques in Erd\u00f6s\u2013R\u00e9nyi Hypergraphs. SIAM J. Comput. FOCS19\u201339\u2013FOCS19\u201380. issn:0097-5397 https:\/\/doi.org\/10.1137\/20M1316044 10.1137\/20M1316044","DOI":"10.1137\/20M1316044"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00077"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_35"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1276650"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20604"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"Ashish Gola Igor Shinkar and Harsimran Singh. 2024. Matrix Multiplication Reductions. 34:15 pages. https:\/\/doi.org\/10.4230\/LIPICS.APPROX\/RANDOM.2024.34 10.4230\/LIPICS.APPROX\/RANDOM.2024.34","DOI":"10.4230\/LIPICS.APPROX\/RANDOM.2024.34"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2020.1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-88946-2_3"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"e_1_3_2_1_15_1","volume-title":"On Yao\u2019s XOR-lemma","author":"Goldreich Oded","unstructured":"Oded Goldreich, Noam Nisan, and Avi Wigderson. 2011. On Yao\u2019s XOR-lemma. Springer-Verlag, Berlin, Heidelberg. 273\u2013301. isbn:9783642226694"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00017"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480198344540"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2018.00094"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447281"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585189"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649751"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718244"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796290"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734030"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030402"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00103-K"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2025.2"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/focs63196.2025.00090"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-023-00238-9"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/080735096"},{"key":"e_1_3_2_1_33_1","unstructured":"Nobutaka Shimizu and Kenji Yasunaga. 2026. Hardness Amplification Beyond Boolean Functions. Electronic Colloquium on Computational Complexity (ECCC). issn:1433-8092 https:\/\/eccc.weizmann.ac.il\/report\/2026\/038\/"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9781139165464"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1730"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238187"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214051"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000010"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978971.92"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.45"},{"key":"e_1_3_2_1_41_1","unstructured":"Jia Zheng. 2014. A Uniform Min-Max Theorem and Characterizations of Computational Randomness."}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800838","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:04:42Z","timestamp":1781028282000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800838"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":41,"alternative-id":["10.1145\/3798129.3800838","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800838","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}