Pith. sign in

REVIEW 1 cited by

Scalable Framework for Classifying AI-Generated Content Across Modalities

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.00375 v2 pith:2TKUT2VT submitted 2025-02-01 cs.CV

classification cs.CV
keywords generativeai-generatedclassifyingcontentframeworkacrossdefactify4distinguishing
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The rapid growth of generative AI technologies has heightened the importance of effectively distinguishing between human and AI-generated content, as well as classifying outputs from diverse generative models. This paper presents a scalable framework that integrates perceptual hashing, similarity measurement, and pseudo-labeling to address these challenges. Our method enables the incorporation of new generative models without retraining, ensuring adaptability and robustness in dynamic scenarios. Comprehensive evaluations on the Defactify4 dataset demonstrate competitive performance in text and image classification tasks, achieving high accuracy across both distinguishing human and AI-generated content and classifying among generative methods. These results highlight the framework's potential for real-world applications as generative AI continues to evolve. Source codes are publicly available at https://github.com/ffyyytt/defactify4.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Hierarchical Document Parsing via Large Margin Feature Matching and Heuristics

    cs.CL 2025-02 conditional novelty 4.0 of 10

    By adding an ArcFace-style margin to a CLIP-like matching loss and applying dataset-specific greedy rules, the solution reaches 0.98904 private-leaderboard accuracy on the VRD-IU document hierarchy task.

Pith tools