{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:31Z","timestamp":1773377011032,"version":"3.50.1"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195428","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["A Unified Approach and Solutions for $n$-Task Problems"],"prefix":"10.1109","author":[{"given":"Daiki","family":"Suruga","sequence":"first","affiliation":[{"name":"Graduate School of Mathematics, Nagoya University,Nagoya,Japan"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Direct sum theorems beyond query complexity","author":"Suruga","year":"2024"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref3","volume-title":"Information-spectrum methods in information theory, ser. Stochastic Modelling and Applied Probability","volume":"50","author":"Han","year":"2003"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511976667"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139525343"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49725-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.07.020"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.26421\/QIC10.3-4-1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.29"},{"key":"ref10","article-title":"A composition theorem for decision tree complexity","author":"Montanaro","year":"2013","journal-title":"arXiv preprint"},{"key":"ref11","first-page":"206","article-title":"Towards better separation between deterministic and randomized query complexity","volume-title":"35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","author":"Mukhopadhyay"},{"issue":"1","key":"ref12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4086\/toc.2018.v014a005","article-title":"Randomized query complexity of sab-otaged and composed functions","volume":"14","author":"Ben-David","year":"2018","journal-title":"Theory of Computing"},{"key":"ref13","first-page":"1","article-title":"Optimal separation and strong direct sum for randomized query complexity","volume-title":"34th Computational Complexity Conference","author":"Blais"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00031"},{"key":"ref15","article-title":"A majority lemma for randomised query complexity","volume-title":"36th Computational Complexity Conference","author":"Goos"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2023.v019a011"},{"key":"ref17","first-page":"16:1","article-title":"A Strong Direct Sum Theorem for Distributional Query Complexity","volume-title":"39th Computational Complexity Conference","volume":"300","author":"Blanc"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792235864"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959901"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_26"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"ref22","article-title":"Direct sums in ran-domized communication complexity","volume":"44","author":"Barak","year":"2009","journal-title":"Electronic Colloquium on Computational Complexity"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.28"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.86"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.42"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.125"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554844"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/17M1139254"},{"key":"ref29","article-title":"A near-optimal direct-sum theorem for communication complexity","author":"Jain","year":"2020","journal-title":"arXiv preprint"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00125"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-96-1090-7_33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374460"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22670-0_23"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/130938517"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195428.pdf?arnumber=11195428","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:01Z","timestamp":1773347401000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195428\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195428","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}