I study how information behaves in code: in commits, in adoption curves, in systems that look chaotic until you measure them properly. Most of what's below started as a clean hypothesis. Some of it ended with the data winning instead of me. I think that's the more interesting outcome to publish.

difference-in-differencesquasi-experimentalgit mining638k commits

Does GitHub Copilot change how people commit, causally rather than just correlationally?

flowchart LR
A[GH Archive<br/>10 repos, 2018-2024] --> B[Commit extraction<br/>638,000+ commits]
B --> C[Feature engineering<br/>files / churn / inserts]
C --> D[Panel: repo x week<br/>fixed effects]
D --> E[Pre-trend F-test]
D --> F[DiD + event study]
D --> G[Commit-message DiD<br/>mechanism check]
E --> H[Result]
F --> H
G --> H

Effect concentrates in existing contributors, not newcomers: people write smaller, more atomic commits once an assistant is doing the typing. A commit-message DiD adds the mechanism check, with fix-commit share falling and refactor share rising post-adoption. Full review pass added multiple-testing correction (BH-FDR), a wild cluster bootstrap given only 8-10 repo clusters, a COVID-era falsification test, a bot-commit robustness check, and hand-validated message labeling, with the paper's headline claim honestly downgraded from "robust across specs" to "directionally consistent, not decisive under conservative few-cluster inference." IEEEtran-to-ACM sigconf paper (11 pages) drafted, targeting MSR 2027.

staggered-adoption DiDsun-abraham estimatorbigquery89 repos

Does adding a CODEOWNERS file causally change how fast pull requests get reviewed?

flowchart LR
A[GH Archive<br/>~21TB via BigQuery] --> B[89-repo panel<br/>staggered adoption]
B --> C[Sun-Abraham<br/>event-study DiD]
C --> D{Result by<br/>horizon}
D -->|0-18mo| E[Null on<br/>PR closing time]
D -->|23-24mo| F[Signal, flagged<br/>as confounded]
B --> G[CODEOWNERS coverage<br/>parsed at treatment date]
G --> H[Bimodal split:<br/>14 repos ≤10% / 8 repos ≥90%]

shannon entropyleave-one-repo-out CVhonest null result

Does Shannon entropy in commit histories predict upcoming software releases?

flowchart LR
A[Commit histories<br/>9 repos] --> B[Shannon entropy<br/>per commit window]
B --> C[Naive train/test split]
C --> D[72% accuracy]
B --> E[Leave-one-repo-out CV]
E --> F[AUC 0.47, chance level]
B --> G[Confound check]
G --> H[Commit volume vs entropy<br/>Spearman r = 0.817]

Status: Published as a negative result with a documented confound, not a quiet repo nobody talks about. The methodology is the part worth reading. Research direction pivoted toward testing whether entropy-flagged unusual commits predict bad downstream outcomes (fix-follows, reverts), a gap in prior anomaly-detection work.

fairness-aware mldemographic parityequal opportunityrandom forest

Does fixing bias in tabular ML cost accuracy, and do all mitigation strategies work equally well?

flowchart LR
A[Tabular dataset] --> B[Bias audit<br/>12 modules]
B --> C[Reweighting]
B --> D[Feature suppression]
B --> E[Post-processing]
C --> F[Fairness metrics]
D --> F
E --> F
F --> G[Random Forest<br/>accuracy check]

The sharper finding: naive feature suppression, the most intuitive fix, was the least effective of the three, underperforming reweighting on every fairness axis tested. Built with Dr. Chirag Joshi; pending arXiv endorsement.

Contributions to libraries with real production surface area, not toy patches.

• npm/cli - fixed a silent failure in npm audit fix by adding a securityDowngrade gate to CanPlaceDep (PR #9754), merged.
• pandas - fixed a negative-slice indexer validation bug in core indexing logic using slice.indices() (PR #66101), merged with regression tests.
• PyDriller - corrected Commit._stats() to respect the skip_whitespaces flag (PR #320), merged; added a Commit.patch property exposing full unified diffs, closing a long-standing feature request (PR #321), merged.
• PyGithub - added a configurable max_rate_limit_wait cap to GithubRetry, with a new RateLimitExceededExceedsMaxWait exception, replacing unbounded rate-limit stalls (PR #3540), in review.

goraft consensusdeterministic simulation testingdistributed systems

Can you make a distributed-consensus bug reproduce on demand, then run it live?

flowchart LR
A[Raft nodes in Go<br/>leader election + log] --> B[Scheduler-driven delivery<br/>+ fault injection]
B --> C[Deterministic sim testing<br/>2000-seed sweep]
C --> D[Full log replication<br/>+ KV state machine]
D --> E[Azure 3-node cluster<br/>Docker + gRPC]
E --> F[Live dashboard<br/>chaos controls]
E --> G[HTTPS via Caddy<br/>+ DuckDNS, reboot-safe]

Deterministic simulation testing means every failure replays exactly: a 2000-seed stale-read sweep found 112 stale minority reads and zero linearizability violations. A full code audit turned up 11 numbered concurrency/correctness flaws post-deployment (stale vote replies, stale AppendEntries replies, missing no-op on election win, and more); the two most severe are fixed and verified clean under go test -race, the rest tracked as open findings. The deployed cluster survived an unattended sudo reboot and a live kill-the-leader demo (n2 killed via docker kill, n3 elected and kept serving writes) with no manual intervention.

edge aivibration/acoustic sensingMAD/IQR gatingpredictive maintenance

Can a machine flag a failing bearing on-device, before it fails, without drowning in false alarms?

flowchart LR
A[Vibration/acoustic<br/>sensor stream] --> B[Two-stage MAD/IQR gate]
B --> C[Small anomaly model]
C --> D[Self-calibrating<br/>baseline]
D --> E[CWRU Bearing Data Center<br/>benchmark, 15 fault conditions]

Solo submission (team of 1) for InnoVent-27's Edge AI for Autonomous & Intelligent Heavy Machines category, motivated directly by vocational-training exposure to plant-floor sensor data at NTPC. Virtual PoC validated end-to-end against a public benchmark before the full form and presentation deck were submitted.

htmlsheetjsoffline-firststatistical filtering

Vocational trainee with the APR/SCADA team (June-July 2026). Two shipped tools, both built around a no-pip/no-admin-rights office desktop constraint:

• A fully offline, browser-based CSV/Excel trend-report converter (single HTML file, SheetJS + JSZip bundled inline, zero install) with batch folder processing, pre-flight validation, and a compound tag-editing UI: diff-by-example renaming, character-strip, and per-position removal.
• An outlier-removal and feature-rejection pipeline for Pearson correlation analysis: a two-stage graph-level gap/leverage test ahead of point-level MAD- and IQR-based cleaning, with a PDF methodology summary produced for the team.

clipumapfastapidockergcp

Can a machine read taste?

flowchart LR
A[25-round quiz<br/>image comparisons] --> B[CLIP ViT-B/32<br/>embeddings]
B --> C[Cosine similarity to<br/>16 aesthetic centroids]
B --> D[3D UMAP projection]
D --> E[kNN nearest-image<br/>retrieval]
A --> F[Upload & classify<br/>any photo]

Free-tier GCP VM (964MB RAM) by choice: the constraint is what makes the engineering real. Free HTTPS, a real domain, zero ongoing cost. Full writeup in the repo's README.

• 🎓 Amazon ML Summer School 2026 - selected among the top ~3,000 of 134,000+ applicants (~2.2% selection rate)
• 🏆 Top 1,500 of 100,000+ participants - Google "The Big Code" competitive programming challenge
• 🥇 Dean's Academic Excellence Award - Manipal University Jaipur, Semesters 2, 3, and 4