Source author record

Chao Gong

Explore this author’s publications, collaborators and research topics. This catalog record has not been claimed by its author.

ResearcherUnclaimed source record

Catalog footprint

Research overview

3works
2topics
4close collaborators

Published work

3 publications

preprint2026arXiv

ImageAttributionBench: How Far Are We from Generalizable Attribution?

The rapid advancement of generative AI has enabled the creation of highly realistic and diverse synthetic images, posing critical challenges for image provenance and misinformation detection. This underscores the urgent need for effective image attribution. However, existing attribution datasets are constrained by limited scale, outdated generation methods, and insufficient semantic diversity - hindering the development of robust and generalizable attribution models. To address these limitations, we introduce ImageAttributionBench, a comprehensive dataset comprising images synthesized by a wide array of advanced generative models with state-of-the-art (SOTA) architectures. Covering multiple real-world semantic domains, the dataset offers rich diversity and scale to support and accelerate progress in image attribution research. To simulate real-world attribution scenarios, we evaluate several SOTA attribution methods on ImageAttributionBench under two challenging settings: (1) training on a standard balanced split and testing on degraded images, and (2) training and testing on semantically disjoint splits. In both cases, current methods exhibit consistently poor performance, revealing significant limitations in their robustness and generalization to unseen semantic content. Our work provides a rigorous benchmark to facilitate the development and evaluation of future image attribution methods.

preprint2020arXiv

Intersecting families of vector spaces with maximum covering number

Let VV be an nn-dimensional vector space over the finite field Fq\mathbb{F}_q. Suppose that F\mathscr{F} is an intersecting family of mm-dimensional subspaces of VV. The covering number of F\mathscr{F} is the minimum dimension of a subspace of VV which intersects all elements of F\mathscr{F}. In this paper, we give the tight upper bound for the size of F\mathscr{F} whose covering number is mm, and describe the structure of F\mathscr{F} which reaches the upper bound. Moreover, we determine the structure of an maximum intersecting family of singular linear space with the maximum covering number.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.