GigAudit: A Graph-Powered Algorithmic Transparency and Labor Protection Engine Layer

Abhinav Mangalore

GigAudit is a decentralized, graph-powered algorithmic auditing infrastructure designed to reverse-engineer proprietary gig economy platforms and expose exploitative labor practices without requiring source-code access. With India’s gig workforce projected to expand from 7.7 million in 2020 to 23.5 million by 2029-30, black-box pricing algorithms currently operate in a regulatory vacuum, often inflicting algorithmic wage theft and gradual disempowerment. GigAudit shifts the paradigm to bottom-up accountability by allowing workers to crowdsource transaction receipts via a secure Next.js Progressive Web App. To process this data securely, the platform leverages a production-grade AI observability pipeline featuring FastAPI, NVIDIA NeMo Guardrails to block adversarial prompt injections, and the Ragas framework for empirical data extraction evaluations. The validated data is stored immutably in a PostgreSQL ledger and continuously synced to a Neo4j Graph Database, where index-free adjacency instantly maps and detects complex multi-variable exploitation—such as fatigue-based wage throttling and geofenced margin compression—achieving a 100% detection rate in synthetic benchmarking.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

GigAudit has a clear and important direction for AI safety, particularly around gig-economy transparency, labor protection, and the black-box nature of platform dispatch and pricing algorithms. The project addresses a real socio-technical risk: workers’ livelihoods can be shaped by opaque optimization systems without meaningful visibility or recourse.

The methodology and results are generally understandable, and the project provides practical architecture for bottom-up auditing using crowdsourced receipts, structured databases, and graph analysis. However, the report would be stronger if it explained several key concepts and data assumptions more clearly. For example, terms such as OCR injection, prompt jailbreaks, and geofenced margin compression should be defined clearly with examples and connected more explicitly to the synthetic data generation process and empirical results.

The paper would also benefit from showing what the data looks like before and after generation or Neo4j extraction. A code repository, sample dataset schema with listed features, or commented query examples would help readers understand how the pipeline works in practice and how to produce the reported detection results.

The empirical results suggest strong detection performance, but the link between the analysis and the proposed stakeholder-facing actions is not always clear. For instance, the alert “Do not accept rides in Zone DL-03 for the next hour; platform algorithms are currently underpaying base rates by 22%” is useful, but the report should show a concrete example of how such a conclusion is derived from the data. A step-by-step explanation from raw receipt data to graph detection to final alert would make the system much more convincing.

The discussion of geofenced margin compression could also be expanded. Since India has highly diverse geographic, economic, and social contexts, the report could discuss how marginalization may vary across regions or worker groups. Even a small qualitative analysis of which groups or zones are most affected would strengthen the project’s labor-protection framing.

Overall, this is a promising and practically useful AI safety project. It provides a meaningful starting point for more inclusive algorithms in gig-economy platforms, and it would be even stronger with clearer definitions, more transparent data examples, and a tighter connection between the technical findings and the proposed actions for workers, unions, and regulators.

The Target Audience & Actionable Intelligence Matrix, was a great way to communicate very relevant info to a reader.

Given the system relies entirely on crowdsourced driver receipts, it would be great to also address how the platform intends to incentivize initial user adoption to reach the critical mass necessary for the Neo4j graph database to identify structural patterns. While, the paper proves the technical viability of the system using a simulated dataset, it can also explain more, the operational viability of acquiring real crowdsourced data to be able usable in the real world

Ambitious and well told. The four-audience leverage matrix is the standout, turning raw analysis into a believable path to accountability, and the graph approach to structural exploitation patterns is a sensible bet. The core problem is circular validation: you inject two biases into synthetic data, then detect those same biases. That shows the pipeline runs, but says nothing about real-world accuracy or false positives. The writing also leans on stack name-dropping and on phrases like "mathematical proof" and "un-manipulatable" that claim more than was shown. Test against real receipts, or at least hold-out anomalies the detector wasn't tuned for, and report precision and recall. Dial back the certainty in the language, and state the AI-safety connection directly rather than leaving it implied.

Cite this work

@misc {

title={

(HckPrj) GigAudit: A Graph-Powered Algorithmic Transparency and Labor Protection Engine Layer

},

author={

Abhinav Mangalore

},

date={

},

organization={Apart Research},

note={Research submission to the research sprint hosted by Apart.},

howpublished={https://apartresearch.com}

}

Recent Projects

OliGraph: graph-based screening of large oligopools

Existing synthesis screening tools cannot evaluate short oligonucleotide pools, whose overlapping fragments can be reassembled into regulated sequences via polymerase cycling assembly (PCA) yet fall below gene-length detection thresholds. We present OliGraph, an open-source tool that constructs a bi-directed overlap graph from an oligonucleotide pool and extracts contigs for downstream gene-length screening. An optional PCA mode retains only cross-strand overlaps consistent with PCA chemistry. We validated OliGraph in a blinded study across ten simulated pools (70–9,184 oligonucleotides, 30–300 bp) spanning four risk categories. BLAST screening of individual oligonucleotides failed to identify sequences of concern in most pools: three returned zero hits, and vector noise obscured true positives in the remainder. After OliGraph assembly, contig-level BLAST matched the longest assembled sequences (up to 1,905 bp) to sequences of concern at 97–100% identity. In one pool, assembly collapsed 1,634 individual BLAST results into 10 hits from a single contig, all assigned to the same source organism. PCA mode correctly distinguished assemblable from non-assemblable fragments within the same pool. Two pools with no assemblable structure yielded no contigs. OliGraph processed all pools in under 0.2 seconds, fast enough for real-time order screening and consistent with proposals to bring oligonucleotide orders within the scope of synthesis screening regulation.

Read More

BioRT-Bench: A Multi-Attack Red-Teaming Benchmark for Bio-Misuse Safeguards in Frontier LLMs

Frontier AI laboratories are expected to maintain safeguards against biological misuse, but whether deployed models actually refuse bio-misuse queries under adversarial pressure is largely unmeasured in the public literature. We introduce BioRT-Bench, a benchmark that runs four attack methods (direct request, PAIR, Crescendo, and base64 encoding) against four frontier models (Claude Sonnet 4.6, GPT-5.4, DeepSeek V4-flash, Kimi K2.5) across 40 prompts spanning five biosecurity-relevant categories. Responses are scored by a calibrated judge extending StrongREJECT with two bio-specific dimensions: specificity and actionability. We measure Attack Success Rate (ASR), where 0 means the model fully refused and 1 means it provided specific, actionable bio-misuse content. Our results reveal a sharp robustness divide: Chinese frontier models (DeepSeek, Kimi) have under 5% refusal rates even under direct request (ASR 0.88 and 0.79), while Western models (Claude, GPT) maintain substantially stronger safeguards (ASR 0.15 and 0.16). Crescendo is the most effective attack across all models, both in bypassing refusal and in eliciting actionable content. Claude Sonnet 4.6 is the most robust model tested, achieving 100% refusal against base64-encoded prompts.

Read More

PROTEUS (PROTein Evaluation for Unusual Sequences): Structure-Informed Safety Screening for de novo and Evasion-Prone Protein-Coding Sequences

AI protein design tools like RFdiffusion, ProteinMPNN, and Bindcraft make it trivial to produce low-homology sequences that fold into active, potentially hazardous architectures. However, sequence homology-based biosafety screening tools cannot detect proteins that pose functional risk through structurally novel mechanisms with no sequence precedent. We present a tiered computational pipeline that addresses this gap by combining MMseqs2 sequence alignment with structure-based comparison via FoldSeek and DALI against curated toxin databases totaling ~34,000 entries. AlphaFold2-predicted structures are screened for both global fold similarity (FoldSeek) and local active/allosteric site geometry (DALI), capturing convergent functional hazards that sequence screening misses. The pipeline was validated against a panel of toxins, benign proteins, structural mimics, and de novo-designed Munc13 binders, as well as modified ricin variants with residue substitutions. We additionally tested robustness to partial-synthesis evasion, where a bad actor submits multiple shorter coding sequences intended for downstream reassembly into a full toxin-coding gene. We found that while sequence-based screening did not identify any de novo ricin analogues with high certainty, the combined pipeline with FoldSeek and DALI identified all 24 tested de novo ricins as toxic.

Read More

OliGraph: graph-based screening of large oligopools

Existing synthesis screening tools cannot evaluate short oligonucleotide pools, whose overlapping fragments can be reassembled into regulated sequences via polymerase cycling assembly (PCA) yet fall below gene-length detection thresholds. We present OliGraph, an open-source tool that constructs a bi-directed overlap graph from an oligonucleotide pool and extracts contigs for downstream gene-length screening. An optional PCA mode retains only cross-strand overlaps consistent with PCA chemistry. We validated OliGraph in a blinded study across ten simulated pools (70–9,184 oligonucleotides, 30–300 bp) spanning four risk categories. BLAST screening of individual oligonucleotides failed to identify sequences of concern in most pools: three returned zero hits, and vector noise obscured true positives in the remainder. After OliGraph assembly, contig-level BLAST matched the longest assembled sequences (up to 1,905 bp) to sequences of concern at 97–100% identity. In one pool, assembly collapsed 1,634 individual BLAST results into 10 hits from a single contig, all assigned to the same source organism. PCA mode correctly distinguished assemblable from non-assemblable fragments within the same pool. Two pools with no assemblable structure yielded no contigs. OliGraph processed all pools in under 0.2 seconds, fast enough for real-time order screening and consistent with proposals to bring oligonucleotide orders within the scope of synthesis screening regulation.

Read More

BioRT-Bench: A Multi-Attack Red-Teaming Benchmark for Bio-Misuse Safeguards in Frontier LLMs

Frontier AI laboratories are expected to maintain safeguards against biological misuse, but whether deployed models actually refuse bio-misuse queries under adversarial pressure is largely unmeasured in the public literature. We introduce BioRT-Bench, a benchmark that runs four attack methods (direct request, PAIR, Crescendo, and base64 encoding) against four frontier models (Claude Sonnet 4.6, GPT-5.4, DeepSeek V4-flash, Kimi K2.5) across 40 prompts spanning five biosecurity-relevant categories. Responses are scored by a calibrated judge extending StrongREJECT with two bio-specific dimensions: specificity and actionability. We measure Attack Success Rate (ASR), where 0 means the model fully refused and 1 means it provided specific, actionable bio-misuse content. Our results reveal a sharp robustness divide: Chinese frontier models (DeepSeek, Kimi) have under 5% refusal rates even under direct request (ASR 0.88 and 0.79), while Western models (Claude, GPT) maintain substantially stronger safeguards (ASR 0.15 and 0.16). Crescendo is the most effective attack across all models, both in bypassing refusal and in eliciting actionable content. Claude Sonnet 4.6 is the most robust model tested, achieving 100% refusal against base64-encoded prompts.

Read More

This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.
This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.