Mar 21, 2026

Structural Code Monitors: Graph Matching Networks on Code Property Graphs for Topology-Aware Trusted Monitoring

tanzeel shaikh, shubham gupta

We built a non-LLM trusted monitor that compares Code Property Graphs of untrusted code against trusted references

using a Graph Matching Network with cross-graph attention. On 200 trajectories from Apps-Control-Arena, our

0.7M-parameter GNN achieves 0.946 AUC and 70% recall at the 2% FPR audit budget. Even when LLMs receive the same

reference code (diff-based prompt), their false positive rates spike to 46%, making them unusable at low FPR

thresholds. The GNN's structural pooling separates localized backdoor insertions from algorithmic differences — a

distinction text-based monitors cannot make. Cross-graph attention weights additionally produce node-level audit

trails identifying which code lines triggered detection.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

Authors apply well-established static analysis tools to a relevant AI Safety problem — verifying code submitted by untrusted agents. Core results are compelling, and the paper is executed and presented well — I have greatly enjoyed the read.

However, if I have not missed anything, the method's practical applicability faces a fundamental chicken-and-egg problem. The GNN requires a trusted model capable enough to produce correct, parseable reference code. If I have this code already, why use untrusted model to generate another version of it? Especially since any clever algorithmic optimisations that significantly change the CPG will likely be flagged (or, if not, could contain backdoors), and will have to undergo a manual review anyways. I imagine that GPT-4o-mini could already saturate the subset of ControlArena tasks chosen by the authors, and that is why this method appears to work as weak supervision.

I, however, imagine this method could be used for, say, evaluation frameworks, like ControlArena itself. A limited set of reference solutions could be created to be compared against, which could allow to catch misaligned agents seeking to introduce backdoors more reliably.

Good work overall, and great execution!

It’s really refreshing to read an approach to AI control that genuinely goes beyond LLMs. I hope that this inspires others to think more broadly about which tools can be used for AI control. The improvements in recall over LLM baselines, particularly at the most relevant operating point of very low false positive rates, are extremely impressive and at the same time very plausible given the approach taken. I strongly encourage the authors to build on this project and publish their research! I would like to see this applied to more varied attack scenarios and see the potential for complementarity to LLM-based monitors be explored in more depth.

Cite this work

@misc {

title={

(HckPrj) Structural Code Monitors: Graph Matching Networks on Code Property Graphs for Topology-Aware Trusted Monitoring

},

author={

tanzeel shaikh, shubham gupta

},

date={

3/21/26

},

organization={Apart Research},

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

howpublished={https://apartresearch.com}

}

Recent Projects

Feb 2, 2026

Markov Chain Lock Watermarking: Provably Secure Authentication for LLM Outputs

We present Markov Chain Lock (MCL) watermarking, a cryptographically secure framework for authenticating LLM outputs. MCL constrains token generation to follow a secret Markov chain over SHA-256 vocabulary partitions. Using doubly stochastic transition matrices, we prove four theoretical guarantees: (1) exponentially decaying false positive rates via Hoeffding bounds, (2) graceful degradation under adversarial modification with closed-form expected scores, (3) information-theoretic security without key access, and (4) bounded quality loss via KL divergence. Experiments on 173 Wikipedia prompts using Llama-3.2-3B demonstrate that the optimal 7-state soft cycle configuration achieves 100\% detection, 0\% FPR, and perplexity 4.20. Robustness testing confirms detection above 96\% even with 30\% word replacement. The framework enables $O(n)$ model-free detection, addressing EU AI Act Article 50 requirements. Code available at \url{https://github.com/ChenghengLi/MCLW}

Read More

Feb 2, 2026

Prototyping an Embedded Off-Switch for AI Compute

This project prototypes an embedded off-switch for AI accelerators. The security block requires periodic cryptographic authorization to operate: the chip generates a nonce, an external authority signs it, and the chip verifies the signature before granting time-limited permission. Without valid authorization, outputs are gated to zero. The design was implemented in HardCaml and validated in simulation.

Read More

Feb 2, 2026

Fingerprinting All AI Cluster I/O Without Mutually Trusted Processors

We design and simulate a "border patrol" device for generating cryptographic evidence of data traffic entering and leaving an AI cluster, while eliminating the specific analog and steganographic side-channels that post-hoc verification can not close. The device eliminates the need for any mutually trusted logic, while still meeting the security needs of the prover and verifier.

Read More

Feb 2, 2026

Markov Chain Lock Watermarking: Provably Secure Authentication for LLM Outputs

We present Markov Chain Lock (MCL) watermarking, a cryptographically secure framework for authenticating LLM outputs. MCL constrains token generation to follow a secret Markov chain over SHA-256 vocabulary partitions. Using doubly stochastic transition matrices, we prove four theoretical guarantees: (1) exponentially decaying false positive rates via Hoeffding bounds, (2) graceful degradation under adversarial modification with closed-form expected scores, (3) information-theoretic security without key access, and (4) bounded quality loss via KL divergence. Experiments on 173 Wikipedia prompts using Llama-3.2-3B demonstrate that the optimal 7-state soft cycle configuration achieves 100\% detection, 0\% FPR, and perplexity 4.20. Robustness testing confirms detection above 96\% even with 30\% word replacement. The framework enables $O(n)$ model-free detection, addressing EU AI Act Article 50 requirements. Code available at \url{https://github.com/ChenghengLi/MCLW}

Read More

Feb 2, 2026

Prototyping an Embedded Off-Switch for AI Compute

This project prototypes an embedded off-switch for AI accelerators. The security block requires periodic cryptographic authorization to operate: the chip generates a nonce, an external authority signs it, and the chip verifies the signature before granting time-limited permission. Without valid authorization, outputs are gated to zero. The design was implemented in HardCaml and validated in simulation.

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.