01 · Roasts
Professional Ghost
5 commits in the last year, a heatmap that's 99.9% empty, and a staleRepoRatio of 1.0. Your GitHub account is less a developer profile and more a digital Egyptian tomb — impressive it exists, but nothing's moved in there for years.
The Eternal Placeholder
ResSPN's README says 'The code will be uploaded soon.' That was August 2020. Four years later, the code has not been uploaded soon. It has not been uploaded at all.
Monolingual for Life
100% Python across 2 repos, both in the same academic ML niche. You have been on GitHub since 2009 — 15 years — and have explored exactly one language. Even the Amish try new things occasionally.
Zero Engagement Speedrun
0 PRs, 0 issues, 0 forks, 3 total stars lifetime. With 48 followers somehow watching this account, you are the most passive audience experience in open source.
Built using
Zoral
Shadows one worker for a week, then takes over their job with zero extra setup. Behaves exactly like the original.
zoral.ai
02 · Category breakdown
- Impact25% weight25F
- Consistency20% weight5F
- Quality20% weight41D
- Depth15% weight40D
- Breadth10% weight25F
- Community10% weight25F
03 · Stats
365-day commit heatmap
1 active days
Language distribution
- Python100%
04 · Numbers
Owned repos
non-fork
2
Commits
last 12 months
5
Followers
48
Joined GitHub
May 2009
05 · Top repos
fabriziov /
alt-vs-spyn
Research code implementing Sum-Product Network structure learning algorithms (GVS, RGVS, EBVS, WRGVS, RSBVS variants) with supporting infrastructure for data slicing, clustering, and weight estimation.
fabriziov /
ResSPN
Paper code repository with 0 stars, minimal content (14 KB), no actual implementation uploaded. README states "The code will be uploaded soon" indicating placeholder status. Created and pushed same day (2020-08-20), single commit window with no sustained development.
06 · Timeline
- May 7, 2009Joined GitHub
- Sep 3, 2017Created alt-vs-spyn — Code for papers: "Alternative variable splitting methods to learn Sum-Product Networks" and "Sum-Product Network structure learning by efficient product nodes discovery"
- Aug 20, 2020Created ResSPN — Code for the paper "Residual Sum-Product Networks" PGM 2020
- Aug 20, 2020Most recent push to ResSPN
07 · Compare
08 · Rubric
How this score was produced
Overall = Σ (category × weight) + gentle top-end curve
Tier thresholds
▸ How the pipeline works
- 01Scrape.Pull every non-fork repo pushed in the last 90 days, plus your contribution calendar, followers, and language byte counts — straight from GitHub's REST & GraphQL APIs.
- 02Triage.A small model reads every repo's file tree + README and picks the 20 files per repo that actually reveal how you code.
- 03Grade each repo. All repos run in parallel through a fast scoring model that reads the picked files and rates each one independently on Impact, Quality, and Depth — with evidence citations.
- 04Aggregate. A larger reasoning model combines the per-repo scores with server-computed stats (heatmap, commit cadence, language entropy, follower count) to produce the 6-dimension profile score + roasts.
- 05Correct.Deterministic server-side checks enforce anchor-scale floors (e.g. a profile with 2,000+ public commits can't score 30 Consistency) and recompute the final verdict.
~90 seconds per profile, ~$0.25 in compute. Total of ~240 files read across your top-12 repos. One rating per GitHub account per day.
▸ Data sources & caveats
- Heatmap & commit totals: GitHub GraphQL
contributionsCollection— covers the last 365 days, includes private repos when the user has opted in (default). - Language %: byte totals across the top 30 owned non-fork repos.
- Curve: a small upward nudge centered on raw score ≈ 70, capping at 100. Prevents specialists from being unfairly penalised for narrow breadth.
- Anchor corrections: when server-measured signals (e.g. privateWorkLikely, multiRepoVolume, follower count) mandate a minimum category score, the aggregation step enforces it. These are signal-conditional, not identity-based floors.