Skip to content

satyaki-mitra/text_authentication

Repository files navigation

title TEXT-AUTH — Evidence-Based Text Forensics System
emoji 🔍
colorFrom blue
colorTo purple
sdk docker
sdk_version 4.36.0
app_file text_auth_app.py
pinned false
license mit

🛡️ TEXT-AUTH: Evidence-First Text Forensics & Authenticity Assessment

Python FastAPI Docker License NLP Explainable AI Evidence Based Human in the Loop Uncertainty Quantified No Authorship Claims Hugging Face API

TEXT-AUTH is a research-oriented, production-minded text forensics system that evaluates written content using multiple independent linguistic, statistical, and semantic signals. Rather than claiming authorship or identifying a generation source, the platform performs evidence-based probabilistic assessment of textual consistency patterns. It reports confidence-calibrated signals, uncertainty estimates, and human-interpretable explanations to support downstream decision-making. TEXT-AUTH is designed as a decision-support and forensic analysis tool, not a binary classifier or attribution oracle.

Live Deployment Link: AI Text Authenticator Platform

Demo


📋 Table of Contents


🚀 Overview

Problem. Modern text—whether human-written, assisted, edited, or fully generated—often exhibits patterns that are difficult to evaluate using binary classifiers.

Solution. A domain-aware analysis system combining six orthogonal evidence signals (Perplexity, Entropy, Structural, Semantic, Linguistic, Multi-perturbation stability) analysis into a confidence‑calibrated ensemble. Outputs are explainable with sentence‑level highlighting, and downloadable reports (JSON/PDF).

Live Deployment Link: AI Text Authenticator Platform

MVP Scope. End‑to‑end FastAPI backend, lightweight HTML UI, modular metrics, Hugging Face model auto‑download, and a prototype ensemble forensic analyzer. Model weights are not committed to the repo; they are fetched at first run.


🎯 Key Differentiators

Feature Description Impact
Domain‑Aware Detection Calibrated thresholds and metric weights for 16 content types (Academic, Technical, Creative, Social Media, etc.) Improved signal calibration and reduced false positives compared to generic binary systems
6-Signal Evidence Ensemble Orthogonal statistical, syntactic, and semantic indicators Robust assessments with reduced false positives
Explainability Sentence‑level scoring, highlights, and human‑readable reasoning Trust & auditability
Auto Model Fetch First‑run download from Hugging Face, local cache, offline fallback Lightweight repo & reproducible runs
Extensible Design Plug‑in metrics, model registry, and retraining pipeline hooks Easy research iteration

📊 Supported Domains & Threshold Configuration

The platform supports domain-aware forensic analysis tailored to the following 16 domains, each with specific synthetic-text consistency thresholds and metric weights defined in config/threshold_config.py. These configurations are used by the ensemble forensic analyzer to adapt its evidence aggregation process.

Domains:

  • general (Default fallback)
  • academic
  • creative
  • ai_ml
  • software_dev
  • technical_doc
  • engineering
  • science
  • business
  • legal
  • medical
  • journalism
  • marketing
  • social_media
  • blog_personal
  • tutorial

Threshold Configuration Details (config/threshold_config.py):

Each domain is configured with specific thresholds for the six detection metrics and an ensemble threshold. The weights determine the relative importance of each metric's output during the ensemble aggregation phase.

  • High-Consistency Threshold: If a metric's synthetic-consistency score exceeds this value, it contributes stronger evidence toward a synthetic-consistency assessment for that metric.
  • Low-Consistency Threshold: If a metric's Authentic probability falls below this value, it contributes evidence toward higher human-authored consistency for that metric.
  • Weight: The relative weight assigned to the metric's result during ensemble combination (normalized internally to sum to 1.0 for active metrics).

Confidence-Calibrated Aggregation (High Level)

  1. Start with domain-specific base weights (defined in config/threshold_config.py).
  2. Adjust these weights dynamically based on each metric's individual confidence score using a scaling function.
  3. Normalize the adjusted weights.
  4. Compute the final weighted aggregate probability.

🏗️ System Architecture

%%{init: {
  "theme": "dark",
  "themeVariables": {
    "fontSize": "10px",
    "fontFamily": "Segoe UI, Helvetica, Arial, sans-serif"
  }
}}%%
flowchart TD
    classDef frontend fill:#4CAF50,stroke:#2E7D32,color:white;
    classDef api fill:#2196F3,stroke:#0D47A1,color:white;
    classDef orchestrator fill:#FF9800,stroke:#E65100,color:white;
    classDef metrics fill:#9C27B0,stroke:#4A148C,color:white;
    classDef core fill:#607D8B,stroke:#263238,color:white;
    classDef storage fill:#795548,stroke:#3E2723,color:white;

    A[Web UI<br/>📄 Upload & Input]:::frontend
    B[Dashboard<br/>📊 Live Results]:::frontend

    C[FastAPI<br/>]:::api

    D[Domain Classifier]:::orchestrator
    E[Preprocessor]:::orchestrator
    F[Metric Coordinator]:::orchestrator

    P1[Perplexity]:::metrics
    P2[Entropy]:::metrics
    P3[Structural]:::metrics
    P4[Linguistic]:::metrics
    P5[Semantic]:::metrics
    P6[Stability]:::metrics

    G[Evidence Aggregator<br/>⚖️ Ensemble + Calibration]:::core
    H[Reporter<br/>📝 Highlights • PDF/JSON]:::core
    I["Models<br/>🤗 HF Cache"]:::storage
    J[(Storage<br/>💾 Logs • Reports)]:::storage

    A --> C
    B --> C
    C --> D
    D --> E
    E --> F
    F --> P1
    F --> P2
    F --> P3
    F --> P4
    F --> P5
    F --> P6
    P1 --> G
    P2 --> G
    P3 --> G
    P4 --> G
    P5 --> G
    P6 --> G
    G --> H
    H --> C
    I --> F
    C --> J
Loading

Notes: The orchestrator schedules parallel metric computation, handles timeouts, and coordinates with the model manager for model loading and caching.


🔁 Workflow / Data Flow

%%{init: {
  "theme": "dark",
  "themeVariables": {
    "fontSize": "10px",
    "fontFamily": "Segoe UI, Helvetica, Arial, sans-serif"
  }
}}%%
sequenceDiagram
    participant U as 👤 User<br/>(Web / API)
    participant API as 🚪 FastAPI<br/>
    participant O as 🧠 Orchestrator<br/>Domain + Preprocess
    participant M as 📊 Metrics Pool<br/>6 Detectors (ParallelGroup)
    participant E as ⚖️ Ensemble<br/>Domain Based<br/>Confidence Calibration
    participant R as 📝 Reporter<br/>PDF/JSON Export

    U->>API: 📤 Submit text or file
    API->>O: ✅ Validate & enqueue job
    O->>M: ⚡ Run metrics in parallel
    M-->>O: 📈 Return evidence scores
    O->>E: 🔗 Aggregate & calibrate
    E-->>O: 🎯 Verdict + uncertainty
    O->>R: 🖨️ Generate report
    R-->>API: 📦 JSON/PDF ready
    API-->>U: 🔗 Return analysis + download
Loading

🧮 Forensic Evidence Signals & Mathematical Foundation

This section provides the exact metric definitions implemented in metrics/ and rationale for their selection. The ensemble combines these orthogonal signals to increase robustness against edited, paraphrased, or algorithmically regularized text.

Metric summary (weights are configurable per domain)

  • Perplexity — 25%
  • Entropy — 20%
  • Structural — 15%
  • Semantic — 15%
  • Linguistic — 15%
  • Multi-perturbation Stability — 10%

1) Perplexity (25% weight)

Definition

$$Perplexity = \exp\left(-\frac{1}{N}\sum_{i=1}^N \log P(w_i\mid context)\right)$$

Implementation sketch

def calculate_perplexity(text, model, k=512):
    tokens = tokenize(text)
    log_probs = []
    for i in range(len(tokens)):
        context = tokens[max(0, i-k):i]
        prob = model.get_probability(tokens[i], context)
        log_probs.append(math.log(prob))
    return math.exp(-sum(log_probs)/len(tokens))

Domain calibration example

if domain == Domain.ACADEMIC:
    perplexity_threshold *= 1.2
elif domain == Domain.SOCIAL_MEDIA:
    perplexity_threshold *= 0.8

2) Entropy (20% weight)

Shannon entropy (token level)

$$H(X) = -Σ p(x_i) * log₂ p(x_i)$$

Implementation sketch

from collections import Counter
def calculate_text_entropy(text):
    tokens = text.split()
    token_freq = Counter(tokens)
    total = len(tokens)
    entropy = -sum((f/total) * math.log2(f/total) for f in token_freq.values())
    return entropy

3) Structural Metric (15% weight)

Burstiness

$$Burstiness = \frac{\sigma - \mu}{\sigma + \mu}$$

where:

  • μ = mean sentence length
  • σ = standard deviation of sentence length

Uniformity

$$Uniformity = 1 - \frac{\sigma}{\mu}$$

where:

  • μ = mean sentence length
  • σ = standard deviation of sentence length

Sketch

def calculate_burstiness(text):
    sentences = split_sentences(text)
    lengths = [len(s.split()) for s in sentences]
    mean_len = np.mean(lengths)
    std_len = np.std(lengths)
    burstiness = (std_len - mean_len) / (std_len + mean_len)
    uniformity = 1 - (std_len/mean_len if mean_len > 0 else 0)
    return {'burstiness': burstiness, 'uniformity': uniformity}

4) Semantic Analysis (15% weight)

Coherence (sentence embedding cosine similarity)

$$Coherence = \frac{1}{n} \sum_{i=1}^{n-1} \cos(e_i, e_{i+1})$$

Sketch

def calculate_semantic_coherence(text, embed_model):
    sentences = split_sentences(text)
    embeddings = [embed_model.encode(s) for s in sentences]
    sims = [cosine_similarity(embeddings[i], embeddings[i+1]) for i in range(len(embeddings)-1)]
    return {'mean_coherence': np.mean(sims), 'coherence_variance': np.var(sims)}

5) Linguistic Metric (15% weight)

POS diversity, parse tree depth, syntactic complexity

def calculate_linguistic_features(text, nlp_model):
    doc = nlp_model(text)
    pos_tags = [token.pos_ for token in doc]
    pos_diversity = len(set(pos_tags))/len(pos_tags)
    depths = [max(get_tree_depth(token) for token in sent) for sent in doc.sents]
    return {'pos_diversity': pos_diversity, 'mean_tree_depth': np.mean(depths)}

6) MultiPerturbationStability (10% weight)

Stability under perturbation (curvature principle)

$$Stability = \frac{1}{n} \sum_{j} \left| \log P(x) - \log P(x_{perturbed_j}) \right|$$
def multi_perturbation_stability_score(text, model, num_perturbations=20):
    original = model.get_log_probability(text)
    diffs = []
    for _ in range(num_perturbations):
        perturbed = generate_perturbation(text)
        diffs.append(abs(original - model.get_log_probability(perturbed)))
    return np.mean(diffs)

🏛️ Ensemble Methodology

Confidence‑Calibrated Aggregation (high level)

  • Start with domain base weights (e.g., DOMAIN_WEIGHTS in config/threshold_config.py)
  • Adjust weights per metric with a sigmoid confidence scaling function
  • Normalize and compute weighted aggregate
  • Quantify uncertainty using variance, confidence means, and decision distance from 0.5
def ensemble_aggregation(metric_results, domain):
    base = get_domain_weights(domain)
    adj = {m: base[m] * sigmoid_confidence(r.confidence) for m, r in metric_results.items()}
    total = sum(adj.values())
    final_weights = {k: v/total for k, v in adj.items()}
    return weighted_aggregate(metric_results, final_weights)

Uncertainty Quantification

def calculate_uncertainty(metric_results, ensemble_result):
    var_uncert = np.var([r.synthetic_probability for r in metric_results.values()])
    conf_uncert = 1 - np.mean([r.confidence for r in metric_results.values()])
    decision_uncert = 1 - 2*abs(ensemble_result.synthetic_probability - 0.5)
    return var_uncert*0.4 + conf_uncert*0.3 + decision_uncert*0.3

🧭 Domain‑Aware Detection

Domain weights and thresholds are configurable. Example weights (in config/threshold_config.py):

DOMAIN_WEIGHTS = {'academic'     : {'perplexity':0.22,'entropy':0.18,'structural':0.15,'linguistic':0.20,'semantic':0.15,'multi_perturbation_stability':0.10},
                  'technical'    : {'perplexity':0.20,'entropy':0.18,'structural':0.12,'linguistic':0.18,'semantic':0.22,'multi_perturbation_stability':0.10},
                  'creative'     : {'perplexity':0.25,'entropy':0.25,'structural':0.20,'linguistic':0.12,'semantic':0.10,'multi_perturbation_stability':0.08},
                  'social_media' : {'perplexity':0.30,'entropy':0.22,'structural':0.15,'linguistic':0.10,'semantic':0.13,'multi_perturbation_stability':0.10},
                 }

Domain Calibration Strategy (brief)

  • Academic: increase linguistic weight, raise perplexity multiplier
  • Technical: prioritize semantic coherence, maximize Synthetic threshold to reduce false positives
  • Creative: boost entropy & structural weights for burstiness detection
  • Social Media: prioritize perplexity and relax linguistic demands

📊 Evaluation & Benchmarks

Comprehensive System Validation

TEXT-AUTH has been rigorously evaluated on 2,750 text samples across 16 domains using a multi-subset benchmark designed to test:

  • Baseline performance on clean human vs. AI text
  • Cross-model generalization (different AI models)
  • Adversarial robustness (paraphrased content)

Evaluation Dataset: TEXT-AUTH-Eval

  • 1,444 samples - CLEAN subset (baseline)
  • 682 samples - CROSS_MODEL subset (generalization test)
  • 500 samples - PARAPHRASED subset (robustness test)
  • 124 samples - Classified as UNCERTAIN (appropriate abstention)

Overall Performance Metrics

Metric Value Status
Overall Accuracy 78.3% Production-Ready
F1 Score 85.7% Exceeds Target (>75%)
Precision (AI Detection) 84.3% High Reliability
Recall (AI Detection) 87.2% Strong Coverage
AUROC 0.777 Good Discrimination
AUPRC 0.888 Excellent Precision-Recall
ECE (Calibration) 0.080 Well-Calibrated

4-Class System Behavior:

  • Coverage: 95.5% (decisive predictions)
  • Abstention Rate: 4.5% (appropriate uncertainty handling)
  • Hybrid Detection: 0.5% (mixed-authorship identification)

Verdict Distribution:

Synthetically-Generated:  73.3% (2,017 samples)
Authentically-Written:    21.7% (596 samples)
Hybrid:                   0.5% (13 samples)
Uncertain:                4.5% (124 samples)

Performance by Evaluation Subset

Subset Samples F1 Score Coverage Abstention Hybrid Rate
CLEAN 1,444 78.6% 92.4% 7.6% 0.6%
CROSS_MODEL 682 95.3% 99.1% 0.9% 0.1%
PARAPHRASED 500 86.1% 100.0% 0.0% 0.8%

Key Insights:

  • Exceptional cross-model generalization (95.3% F1) - system detects AI patterns regardless of specific model
  • Strong adversarial robustness (86.1% F1) - maintains performance on paraphrased content
  • Adaptive abstention - higher uncertainty on CLEAN set (7.6%) reflects appropriate caution on ambiguous cases

Domain-Specific Performance

Top Performing Domains (F1 > 90%)

Domain F1 Score Coverage Abstention Notes
General 93.4% 91.8% 8.2% Encyclopedic content
Creative 92.9% 83.5% 16.5% Literary narratives
Medical 90.3% 100.0% 0.0% Clinical terminology
Journalism 90.3% 93.1% 6.9% News reporting

Strong Performing Domains (F1 85-90%)

Domain F1 Score Coverage Abstention Notes
AI/ML 88.8% 99.2% 0.8% Technical AI content
Academic 87.5% 100.0% 0.0% Research papers
Tutorial 87.5% 94.2% 5.8% How-to guides
Business 86.2% 94.9% 5.1% Business writing
Science 86.2% 95.4% 4.6% Scientific content
Technical Doc 85.6% 94.6% 5.4% Documentation

Moderate Performing Domains (F1 80-85%)

Domain F1 Score Coverage Abstention Hybrid % Notes
Blog/Personal 83.8% 96.7% 3.3% 0.0% Personal blogs
Marketing 84.0% 96.0% 4.0% 0.0% Marketing copy
Engineering 82.0% 100.0% 0.0% 1.7% Technical specs
Software Dev 81.9% 94.9% 5.1% 3.9% Code documentation

Challenging Domains (F1 < 80%)

Domain F1 Score Coverage Abstention Hybrid % Notes
Legal 77.1% 94.9% 5.1% 1.6% ⚠️ Formal legal language
Social Media 73.3% 98.9% 1.1% 0.8% ⚠️ Short, informal text

Domain Analysis:

  • Achieves >80% F1 on 14 of 16 domains
  • Strong performance on structured content (medical, journalism, general)
  • Legal domain challenging due to highly formulaic language patterns
  • Social media challenging due to brevity and informal style

Performance by Text Length

Length Range Samples F1 Score Precision Recall Accuracy Abstention Avg Time (s)
Very Short (0-100) 18 0.000 0.000 0.000 0.278 0.0% 4.6
Short (100-200) 249 0.211 0.118 0.947 0.458 0.0% 8.3
Medium (200-400) 1,682 0.885 0.901 0.869 0.813 0.6% 18.2
Medium-Long (400-600) 630 0.900 0.929 0.872 0.833 7.1% 23.6
Long (600-1000) 15 0.000 0.000 0.000 1.000 74.6% 37.1
Very Long (1000+) 19 0.000 0.000 0.000 1.000 64.8% 108.4

Length-Performance Insights:

  • Optimal range: 200-600 words (F1: 0.885-0.900)
  • Strong performance on medium-length texts - majority of real-world content
  • Limited signals on very short texts (<100 words) - insufficient statistical context
  • High abstention on very long texts (>600 words) - system appropriately defers to human judgment
  • Processing time scales sub-linearly - efficient even on longer texts

Statistical Analysis:

  • Pearson correlation coefficient: r = 0.833
  • No statistically significant linear correlation (p = 0.374)
  • Performance peaks at 400-600 words, then plateaus with increased abstention

Evaluation Visualizations

Confusion Matrix (Decisive Predictions Only)

Evaluation Results

Binary Classification Performance:

  • True Negatives (Human → Human): 344 samples
  • True Positives (AI/Hybrid → AI): 1,711 samples
  • False Positives (Human → AI): 252 samples (14.7% FP rate)
  • False Negatives (AI → Human): 319 samples (15.7% FN rate)

Length-Based Analysis

Length Analysis

Key Patterns:

  1. Performance peaks at medium-length texts (400-600 words)
  2. Abstention rate increases dramatically for texts >600 words
  3. Processing time grows sub-linearly with text length
  4. Sample distribution heavily concentrated in 200-600 word range (84% of dataset)

🔍 Key Findings & Insights

Strengths

  1. High Precision-Recall Balance (84.3% precision, 87.2% recall)

    • Minimizes both false positives and false negatives
    • Well-suited for high-stakes decision support
  2. Exceptional Cross-Model Generalization (95.3% F1)

    • Detects AI patterns regardless of specific generation model
    • Robust to model diversity in real-world scenarios
  3. Appropriate Uncertainty Handling (4.5% abstention)

    • System abstains on genuinely ambiguous cases
    • Prevents overconfident incorrect predictions
  4. Well-Calibrated Confidence (ECE = 0.080)

    • Reported confidence scores match actual accuracy
    • Reliable uncertainty estimates for decision-making
  5. Domain Adaptability (14/16 domains >80% F1)

    • Performs well across diverse writing styles
    • Domain-specific thresholds reduce false positives

Challenges & Limitations

  1. Very Short Texts (<100 words)

    • Insufficient statistical signals for reliable analysis
    • Recommendation: Require minimum 100-word samples
  2. Highly Formulaic Content

    • Legal documents and templates show lower F1 (77.1%)
    • Human-written formulaic text can resemble AI patterns
    • Mitigation: Review Hybrid verdicts in formal domains
  3. Very Long Texts (>1000 words)

    • High abstention rates (65-75%)
    • System appropriately defers to human review
    • Recommendation: Analyze long documents in sections

📚 Evaluation Methodology

Dataset Construction:

  • Human-written texts sourced from Wikipedia, arXiv, C4, PubMed, Project Gutenberg
  • AI-generated texts created using Ollama (mistral:7b baseline)
  • Cross-model texts generated with llama3:8b (generalization test)
  • Paraphrased texts created by rephrasing AI outputs (robustness test)

Metrics Computation:

  • Binary metrics (Precision, Recall, F1) computed on decisive predictions only
  • Hybrid verdicts counted as successful AI detection
  • Uncertain verdicts excluded from accuracy calculation (appropriate abstention)
  • Coverage = percentage of samples with decisive predictions

Evaluation Infrastructure:

  • 2,750 total samples evaluated
  • 16 domains × 3 subsets (clean, cross-model, paraphrased)
  • Processing time: ~1.5 hours on standard hardware
  • Results exported to JSON, CSV, and visualization formats

For detailed evaluation methodology and reproduction instructions, see EVALUATION.md.


📁 Project Structure (as in repository)

text_auth/
├── config/
│   ├── model_config.py
│   ├── settings.py
|   ├── enums.py
|   ├── constants.py
|   ├── schemas.py
│   └── threshold_config.py
├── data/
│   ├── reports/
|   ├── validation_data/
│   └── uploads/
├── services/
│   ├── reasoning_generator.py
│   ├── ensemble_classifier.py
│   ├── highlighter.py
│   └── orchestrator.py
├── metrics/
│   ├── base_metric.py
│   ├── multi_perturbation_stability.py
│   ├── entropy.py
│   ├── linguistic.py
│   ├── perplexity.py
│   ├── semantic_analysis.py
│   └── structural.py
├── models/
│   ├── model_manager.py
│   └── model_registry.py
├── processors/
│   ├── document_extractor.py
│   ├── domain_classifier.py
│   ├── language_detector.py
│   └── text_processor.py
├── reporter/
│   └── report_generator.py
├── ui/
│   └── static/index.html
├── utils/
│   └── logger.py
├── validation/
├── requirements.txt
├── README.md
├── Dockerfile
├── .gitignore
├── test_integration.py
├── .env.example
└── text_auth_app.py

🌐 API Endpoints

/api/analyze — Text Analysis (POST)

Analyze raw text. Returns ensemble assessment, per‑metric signals, highlights, and explainability reasoning.

Request (JSON)

{
  "text":"...",
  "domain":"academic|technical_doc|creative|social_media",
  "enable_highlighting": true,
  "use_sentence_level": true,

Response (JSON) — abbreviated

{
  "status": "success",
  "analysis_id": "analysis_170...",
  "assessment": {
    "final_verdict": "Synthetic / Authentic / Hybrid",
    "overall_confidence": 0.89,
    "uncertainty_score": 0.23
  },
  "metric_signals": {
    "perplexity": { "score": 0.92, "confidence": 0.89 }
  },
  "highlighted_html": "<div>...</div>",
  "reasoning": {
    "summary": "...",
    "key_indicators": ["...", "..."]
  }
}

Note: The final verdict represents a probabilistic consistency assessment, not an authorship or generation claim.

/api/analyze/file — File Analysis (POST, multipart/form-data)

Supports PDF, DOCX, TXT, DOC, MD. File size limit default: 10MB. Returns same structure as text analyze endpoint.

/api/report/generate — Report Generation (POST)

Generate downloadable JSON or PDF reports for a given analysis id.

Utility endpoints

  • GET /health — health status, models loaded, uptime
  • GET /api/domains — supported domains and thresholds
  • GET /api/models — detectable model list

⚙️ Installation & Setup

Prerequisites

  • Python 3.8+
  • 4GB RAM (8GB recommended)
  • Disk: 2GB (models & deps)
  • OS: Linux/macOS/Windows (WSL supported)

Quickstart

git clone https://github.com/satyaki-mitra/text_authentication.git
cd text_authentication
python -m venv venv
source venv/bin/activate
pip install -r requirements.txt
# Copy .env.example -> .env and set HF_TOKEN if using private models
python text_auth_app.py
# or: ./run.sh

Dev tips

  • Use DEBUG=True in config/settings.py for verbose logs
  • For containerized runs, see Dockerfile template (example included in repo suggestions)

🧠 Model Management & First‑Run Behavior

  • The application automatically downloads required model weights from Hugging Face on the first run and caches them to the local HF cache (or a custom path specified in config/model_config.py).
  • Model IDs and revisions are maintained in models/model_registry.py and referenced by models/model_manager.py.
  • Best practices implemented:
    • Pin model revisions (e.g., repo_id@v1.2.0)
    • Resumeable downloads using huggingface_hub.snapshot_download
    • Optional OFFLINE_MODE to load local model paths
    • Optional integrity checks (SHA256) after download
    • Support for private HF repos using HF_TOKEN env var

Example snippet

from huggingface_hub import snapshot_download
snapshot_download(repo_id="satyaki-mitra/statistical-text-reference-v1", local_dir="./models/text-detector-v1")

🎨 Frontend Features (UI)

  • Dual‑panel responsive web UI (left: input / upload; right: live analysis)
  • Sentence‑level color highlights with tooltips and per‑metric breakdown
  • Progressive analysis updates (metric-level streaming)
  • Theme: light/dark toggle (UI respects user preference)
  • Export: JSON and PDF report download
  • Interactive elements: click to expand sentence reasoning, copy text snippets, download raw metrics

💼 Business Model & Market Analysis

TAM: $20B (education, hiring, publishing) — see detailed breakdown in original repo. Use cases: universities (plagiarism & integrity), hiring platforms (resume authenticity), publishers (content verification), social platforms (spam & SEO abuse).

Competitive landscape (summary)

  • Binary authorship-claim systems (e.g., GPTZero-style tools) — our advantages: domain adaptation, explainability, evidence transparency, lower false positives and competitive pricing. TEXT-AUTH explicitly avoids authorship claims in favor of evidence-based forensic assessment.

Monetization ideas

  • SaaS subscription (seat / monthly analyze limits)
  • Enterprise licensing with on‑prem deployment & priority support
  • API billing (per‑analysis tiered pricing)
  • Onboarding & consulting for institutions

🔮 Research Impact & Future Scope

Research directions

  • Adversarial robustness (paraphrase & synonym attacks)
  • Cross‑model generalization & zero‑shot detection
  • Explainability: counterfactual examples & feature importance visualization

Planned features (Q1‑Q2 2026)

  • Multi‑language support (Spanish, French, German, Chinese)
  • Real‑time streaming API (WebSocket)
  • Institution‑specific calibration & admin dashboards

Detailed research methodology and academic foundation available in our Whitepaper. Technical implementation details in Technical Documentation.


🏗️ Deployment notes

  • Containerize app with Docker, orchestrate with Kubernetes or ECS for scale
  • Autoscaling groups for API servers & worker nodes
  • Use spot GPU instances for retraining & large metric compute jobs
  • Integrate observability: Prometheus + Grafana, Sentry for errors, Datadog if available

🔐 Security & Risk Mitigation

Primary risks & mitigations

  • Model performance drift — monitoring + retraining + rollback
  • Adversarial attacks — adversarial training & input sanitization
  • Data privacy — avoid storing raw uploads unless user consents; redact PII in reports
  • Secrets management — use env vars, vaults, and avoid committing tokens
  • Rate limits & auth — JWT/OAuth2, API key rotation, request throttling

File handling best practices (examples)

ALLOWED_EXT = {'.txt','.pdf','.docx','.doc','.md'}
def allowed_file(filename):
    return any(filename.lower().endswith(ext) for ext in ALLOWED_EXT)

📄 License & Acknowledgments

This project is licensed under the MIT License — see LICENSE in the repo.

Acknowledgments:

  • DetectGPT (Mitchell et al., 2023) — inspiration for perturbation-based detection
  • Hugging Face Transformers & Hub
  • Open-source NLP community and early beta testers

Built for Evidence-based text forensics, transparency, and real-world readiness.

Version 1.0.0 — Last Updated: October, 2025

About

TextAuth — Evidence-Based Text Authenticity Analysis: A forensic analysis system that evaluates textual evidence using multiple statistical, linguistic, and semantic signals to assess content authenticity across education, publishing, hiring, and research domains.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors