The first dynamic algorithms for matrix rank and related objects achieve update times scaling with rank r, specifically Õ(r^1.405) per entry update and Õ(r^1.528 + z) per column update, extending to dynamic maximum matching.
InProceedings of the 16th International Conference on Mining Software Repositories (MSR)
12 Pith papers cite this work. Polarity classification is still indexing.
12
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
roles
background 2polarities
background 2representative citing papers
A deterministic semi-streaming algorithm achieves an O(Δ)-coloring in O(√log Δ) passes, the first with linear palette size and sublogarithmic passes.
The authors derive the first bit-accurate arithmetic models for matrix multiply-accumulate operations on ten GPU architectures spanning NVIDIA Volta to Blackwell and AMD CDNA1 to CDNA3.
A new deforking map p2PFull for WoC V2604 collapses raw repositories into projects via shared-commit groups and Louvain clustering, recovering cross-forge fork families with 99.01% agreement to GitHub's graph.
Chemistry-aware admission defeats many molecular graph backdoors, yet ChemBack demonstrates that chemically valid, target-aligned backdoors remain effective across benchmarks and defenses.
Argus enables backdoor detection in decentralized ML by collaborative neighbor-based validation of triggers, backed by convergence theory and reducing attack success by up to 90% on tested datasets.
First model organisms of narrow secret loyalties in LLMs evade black-box audits without principal knowledge and persist even at low poison fractions in training data.
Unsupervised GNN model learns local updates for approximate MaxIS on dynamic graphs, achieving competitive ratios on 200-1000 node instances and 1.00-1.18x larger solutions than other unsupervised models when generalizing to 100x larger graphs.
Introduces ClawTrojan benchmark achieving 95.5% ASR for multi-step trojan attacks in agentic harnesses and DASGuard defense that sanitizes control content from untrusted sources.
C-mDP augments the secret with context, enforces metric indistinguishability on the augmented domain, and reduces the LP via conditional independence to achieve higher utility than standard mDP on vehicle traces.
GRASP reduces communication in remote control by 12-fold on average (50-fold for continuous actions) by having actors generate actions via guided sampling and local policy learning instead of receiving full actions or rewards.
Module-switching defense disrupts backdoors more effectively than weight averaging with fewer models and remains robust even when some models share the same backdoors.
citing papers explorer
-
Dynamic Rank, Basis, and Matching
The first dynamic algorithms for matrix rank and related objects achieve update times scaling with rank r, specifically Õ(r^1.405) per entry update and Õ(r^1.528 + z) per column update, extending to dynamic maximum matching.
-
Faster Deterministic Streaming Vertex Coloring
A deterministic semi-streaming algorithm achieves an O(Δ)-coloring in O(√log Δ) passes, the first with linear palette size and sublogarithmic passes.
-
Deforking the World of Code: A Project-Provenance Map that Recovers Cross-Forge Fork Families that Platform Graphs Cannot See
A new deforking map p2PFull for WoC V2604 collapses raw repositories into projects via shared-commit groups and Louvain clustering, recovering cross-forge fork families with 99.01% agreement to GitHub's graph.
-
Rethinking Molecular Graph Backdoors under Chemistry-aware Admission
Chemistry-aware admission defeats many molecular graph backdoors, yet ChemBack demonstrates that chemically valid, target-aligned backdoors remain effective across benchmarks and defenses.
-
Your Neighbors Know: Leveraging Local Neighborhoods for Backdoor Detection in Decentralized Learning
Argus enables backdoor detection in decentralized ML by collaborative neighbor-based validation of triggers, backed by convergence theory and reducing attack success by up to 90% on tested datasets.
-
Narrow Secret Loyalty Dodges Black-Box Audits
First model organisms of narrow secret loyalties in LLMs evade black-box audits without principal knowledge and persist even at low poison fractions in training data.
-
Unsupervised Learning of Local Updates for Maximum Independent Set in Dynamic Graphs
Unsupervised GNN model learns local updates for approximate MaxIS on dynamic graphs, achieving competitive ratios on 200-1000 node instances and 1.00-1.18x larger solutions than other unsupervised models when generalizing to 100x larger graphs.
-
From Prompt Injection to Persistent Control: Defending Agentic Harness Against Trojan Backdoors
Introduces ClawTrojan benchmark achieving 95.5% ASR for multi-step trojan attacks in agentic harnesses and DASGuard defense that sanitizes control content from untrusted sources.
-
Context-Aware Metric Differential Privacy for Vehicle Trajectory Data
C-mDP augments the secret with context, enforces metric indistinguishability on the augmented domain, and reduces the LP via conditional independence to achieve higher utility than standard mDP on vehicle traces.
-
Remote Action Generation: Remote Control with Minimal Communication
GRASP reduces communication in remote control by 12-fold on average (50-fold for continuous actions) by having actors generate actions via guided sampling and local policy learning instead of receiving full actions or rewards.
-
Defending against Backdoor Attacks via Module Switching
Module-switching defense disrupts backdoors more effectively than weight averaging with fewer models and remains robust even when some models share the same backdoors.