{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T10:15:02Z","timestamp":1783160102618,"version":"3.54.6"},"reference-count":38,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["123B2012"],"award-info":[{"award-number":["123B2012"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371343"],"award-info":[{"award-number":["12371343"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12525110"],"award-info":[{"award-number":["12525110"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.jctb.2026.05.001","type":"journal-article","created":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T16:54:50Z","timestamp":1778864090000},"page":"335-366","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Maximum in-general-position set in a random subset of Fqd"],"prefix":"10.1016","volume":"179","author":[{"given":"Yaobin","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaxi","family":"Nie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wentao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jctb.2026.05.001_br0010","article-title":"The Probabilistic Method","author":"Alon","year":"2016"},{"key":"10.1016\/j.jctb.2026.05.001_br0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.comgeo.2026.102244","article-title":"Maximum number of points in general position in a random subset of finite 3-dimensional spaces","volume":"133","author":"Balogh","year":"2026","journal-title":"Comput. Geom."},{"issue":"3","key":"10.1016\/j.jctb.2026.05.001_br0030","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1090\/S0894-0347-2014-00816-X","article-title":"Independent sets in hypergraphs","volume":"28","author":"Balogh","year":"2015","journal-title":"J. Am. Math. Soc."},{"key":"10.1016\/j.jctb.2026.05.001_br0040","article-title":"On the number of points in general position in the plane","volume":"16","author":"Balogh","year":"2018","journal-title":"Discrete Anal."},{"issue":"4","key":"10.1016\/j.jctb.2026.05.001_br0050","doi-asserted-by":"crossref","first-page":"1630","DOI":"10.1007\/s00454-023-00622-w","article-title":"Counting arcs in Fq2","volume":"72","author":"Bhowmick","year":"2024","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"10.1016\/j.jctb.2026.05.001_br0060","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s11856-012-0184-z","article-title":"Tur\u00e1n numbers for Ks,t-free graphs: topological obstructions and algebraic constructions","volume":"197","author":"Blagojevi\u0107","year":"2013","journal-title":"Isr. J. Math."},{"issue":"11","key":"10.1016\/j.jctb.2026.05.001_br0070","doi-asserted-by":"crossref","first-page":"2039","DOI":"10.1215\/00127094-2023-0043","article-title":"Extremal graphs without exponentially small bicliques","volume":"173","author":"Bukh","year":"2024","journal-title":"Duke Math. J."},{"issue":"12","key":"10.1016\/j.jctb.2026.05.001_br0080","doi-asserted-by":"crossref","first-page":"3043","DOI":"10.1007\/s11425-024-2384-x","article-title":"Random Tur\u00e1n and counting results for general position sets over finite fields","volume":"68","author":"Chen","year":"2025","journal-title":"Sci. China, Math."},{"issue":"2","key":"10.1016\/j.jctb.2026.05.001_br0090","doi-asserted-by":"crossref","first-page":"367","DOI":"10.4007\/annals.2016.184.2.2","article-title":"Combinatorial theorems in sparse random sets","volume":"184","author":"Conlon","year":"2016","journal-title":"Ann. Math. (2)"},{"key":"10.1016\/j.jctb.2026.05.001_br0100","series-title":"Amusements in Mathematics","author":"Dudeney","year":"1959"},{"key":"10.1016\/j.jctb.2026.05.001_br0110","series-title":"STOC'12\u2014Proceedings of the 2012 ACM Symposium on Theory of Computing","first-page":"351","article-title":"Subspace evasive sets","author":"Dvir","year":"2012"},{"key":"10.1016\/j.jctb.2026.05.001_br0120","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0012-365X(86)90009-9","article-title":"On some metric and combinatorial geometric problems","volume":"60","author":"Erd\u0151s","year":"1986","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/j.jctb.2026.05.001_br0130","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF02579292","article-title":"Supersaturated graphs and hypergraphs","volume":"3","author":"Erd\u0151s","year":"1983","journal-title":"Combinatorica"},{"issue":"1","key":"10.1016\/j.jctb.2026.05.001_br0140","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1006\/jcta.1997.2829","article-title":"Progress in the no-three-in-line problem. II","volume":"81","author":"Flammenkamp","year":"1998","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.jctb.2026.05.001_br0150","series-title":"26th Annual IEEE Conference on Computational Complexity","first-page":"77","article-title":"Linear-algebraic list decoding of folded Reed-Solomon codes","author":"Guruswami","year":"2011"},{"key":"10.1016\/j.jctb.2026.05.001_br0160","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/0097-3165(75)90043-6","article-title":"Some advances in the no-three-in-line problem","volume":"18","author":"Hall","year":"1975","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.jctb.2026.05.001_br0170","article-title":"Balanced supersaturation and Tur\u00e1n numbers in random graphs","volume":"3","author":"Jiang","year":"2024","journal-title":"Adv. Comb."},{"issue":"2","key":"10.1016\/j.jctb.2026.05.001_br0180","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01200906","article-title":"On K4-free subgraphs of random graphs","volume":"17","author":"Kohayakawa","year":"1997","journal-title":"Combinatorica"},{"issue":"4","key":"10.1016\/j.jctb.2026.05.001_br0190","doi-asserted-by":"crossref","first-page":"2249","DOI":"10.1112\/jlms.12561","article-title":"Minimum degree conditions for tight Hamilton cycles","volume":"105","author":"Lang","year":"2022","journal-title":"J. Lond. Math. Soc. (2)"},{"key":"10.1016\/j.jctb.2026.05.001_br0200","series-title":"Algorithmic Aspects in Information and Management: 4th International Conference, AAIM 2008, Proceedings 4","first-page":"259","article-title":"No \u2113 grid-points in spaces of small dimension","author":"Lefmann","year":"2008"},{"key":"10.1016\/j.jctb.2026.05.001_br0210","series-title":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"6199","article-title":"Evasive sets, twisted varieties, and container-clique trees","author":"Lim","year":"2026"},{"key":"10.1016\/j.jctb.2026.05.001_br0220","author":"McKinley"},{"key":"10.1016\/j.jctb.2026.05.001_br0230","author":"Milojevi\u0107"},{"key":"10.1016\/j.jctb.2026.05.001_br0240","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1016\/j.aim.2016.05.001","article-title":"The number of C2\u2113-free graphs","volume":"298","author":"Morris","year":"2016","journal-title":"Adv. Math."},{"key":"10.1016\/j.jctb.2026.05.001_br0250","author":"Mubayi"},{"key":"10.1016\/j.jctb.2026.05.001_br0260","first-page":"1","article-title":"The number of arcs in Fq2 of a given cardinality","author":"Nenadov","year":"2025","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.jctb.2026.05.001_br0270","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.jctb.2024.02.002","article-title":"Tur\u00e1n theorems for even cycles in random hypergraph","volume":"167","author":"Nie","year":"2024","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"10.1016\/j.jctb.2026.05.001_br0280","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1137\/25M1743545","article-title":"Random Tur\u00e1n theorem for expansions of spanning subgraphs of tight trees","volume":"40","author":"Nie","year":"2026","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.jctb.2026.05.001_br0290","author":"Nie"},{"issue":"4","key":"10.1016\/j.jctb.2026.05.001_br0300","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s00453-006-0158-9","article-title":"No-three-in-line-in-3D","volume":"47","author":"P\u00f3r","year":"2007","journal-title":"Algorithmica"},{"key":"10.1016\/j.jctb.2026.05.001_br0310","series-title":"Complexity of Computations and Proofs","first-page":"327","article-title":"Pseudorandom sets and explicit constructions of Ramsey graphs","volume":"vol. 13","author":"Pudl\u00e1k","year":"2004"},{"key":"10.1016\/j.jctb.2026.05.001_br0320","first-page":"15","article-title":"Arcs in Fq2","volume":"103:Paper No. 103512","author":"Roche-Newton","year":"2022","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.jctb.2026.05.001_br0330","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1112\/jlms\/s1-26.3.198","article-title":"On a problem of Heilbronn","volume":"26","author":"Roth","year":"1951","journal-title":"J. Lond. Math. Soc."},{"issue":"3","key":"10.1016\/j.jctb.2026.05.001_br0340","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1007\/s00222-014-0562-8","article-title":"Hypergraph containers","volume":"201","author":"Saxton","year":"2015","journal-title":"Invent. Math."},{"issue":"2","key":"10.1016\/j.jctb.2026.05.001_br0350","doi-asserted-by":"crossref","first-page":"333","DOI":"10.4007\/annals.2016.184.2.1","article-title":"Extremal results for random discrete structures","volume":"184","author":"Schacht","year":"2016","journal-title":"Ann. Math. (2)"},{"issue":"2","key":"10.1016\/j.jctb.2026.05.001_br0360","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1002\/jgt.23015","article-title":"Random polynomial graphs for random Tur\u00e1n problems","volume":"105","author":"Spiro","year":"2024","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.jctb.2026.05.001_br0370","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1007\/s00454-023-00601-1","article-title":"Evasive sets, covering by subspaces, and point-hyperplane incidences","volume":"72","author":"Sudakov","year":"2024","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.jctb.2026.05.001_br0380","series-title":"39th International Symposium on Computational Geometry","article-title":"On higher dimensional point sets in general position","volume":"vol. 258","author":"Suk","year":"2023"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895626000274?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895626000274?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T09:15:59Z","timestamp":1783156559000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895626000274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":38,"alternative-id":["S0095895626000274"],"URL":"https:\/\/doi.org\/10.1016\/j.jctb.2026.05.001","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Maximum in-general-position set in a random subset of","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series B","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jctb.2026.05.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}