niklas

Since 2025-02-24 · 486 days · Last sync 2026-06-14 17:00

Overview
9,881
Reviews
86.7%
Retention
0
Day Streak
36.9h
Study Time
4,841
Cards
853
Mature
13.4s
Avg Time
83.6d
Avg Interval
36d
Best Streak
776
Due Now
Activity
Review Activity — Last 12 Months
Study Hours (All Time)
Upcoming Reviews 770 overdue
Card Analysis
Card States
Answer Buttons
Interval Distribution
Card Progress by Deck 29.0% overall
Deck Introduced New Left Total Progress
ETH2. SemesterPProg 267 744 1,011
26.4%
ETH2. SemesterA&W 202 564 766
26.4%
ETH2. SemesterAnalysis 260 415 675
38.5%
ETHScience in PerspectiveAdvanced Finance 0 84 84
0.0%
ETH2. SemesterDDCA 0 60 60
0.0%
ETHMajor: Information and Data ProcessingIML 0 23 23
0.0%
ETH1. SemesterA&D 529 8 537
98.5%
ETH1. SemesterLinAlg 465 0 465
100.0%
ETH1. SemesterEProg 205 0 205
100.0%
ETH1. SemesterDiskMat 1,015 0 1,015
100.0%
Memory Model
51.5d
Avg Stability
2.59 / 10
Avg Difficulty
9.3%
Avg Retrievability
77.5%
At Risk (1,986 cards)
39.5d
Median Stability
46d
Memory Half-Life
Stability Distribution
Difficulty Distribution
Retrievability Snapshot — Right Now
Memory by Deck
Deck Cards Avg Stability Avg Difficulty Avg Retrievability
ETH::2. Semester::Analysis 252 80.7d 2.84 0%
ETH::2. Semester::PProg 118 72.4d 1.86 34.9%
ETH::1. Semester::A&D 496 60.8d 2.96 8.0%
ETH::1. Semester::DiskMat 945 51.3d 2.4 6.5%
ETH::1. Semester::EProg 205 47.4d 1.78 21.6%
ETH::2. Semester::A&W 185 27.1d 3.44 3.3%
ETH::1. Semester::LinAlg 362 26.9d 2.64 10.4%
FSRS Model — Initial Stability by Deck
Review Insights
Review Time vs Answer Button
Speed by Deck
Deck Reviews Median Avg <3s 3–10s 10–20s 20–30s 30s+ Trend
ETH1. SemesterDiskMat 3,745 9.5s 13.4s 4.2% 48.2% 29.4% 9.4% 8.8%
ETH1. SemesterA&D 2,101 9.7s 15.0s 4.3% 46.7% 27.8% 8.5% 12.7%
ETH1. SemesterLinAlg 1,187 9.3s 13.3s 6.7% 46.1% 30.1% 8.3% 8.8%
ETH2. SemesterAnalysis 1,034 10.0s 14.2s 4.6% 45.5% 31.3% 9.0% 9.6%
ETH2. SemesterA&W 838 10.8s 14.8s 4.9% 42.0% 30.3% 11.0% 11.8%
ETH1. SemesterEProg 598 6.0s 7.9s 9.4% 68.1% 18.1% 2.7% 1.8%
ETH2. SemesterPProg 378 7.3s 8.8s 7.7% 61.6% 25.4% 2.6% 2.6%
Sessions
177
Sessions
16.5m
Avg Session
Session Length Distribution
Intra-Session Fatigue Curve
Fun Stats
Evening Fucker
5,637 reviews 6-11pm
11.0%
Human — 529 lapses across all reviews
Balanced
9.1s median — 5.1% under 3s, 9.1% over 30s
3
Mostly Chill — sessions ending in 3+ consecutive fails
0
Cards Buried — 0 by you, 0 by scheduler
64.9m
Machine — 219 cards on 2026-01-16
22:00
Peak Study Hour
23.6%
Reviews After Midnight
0.3
Lapses / Mature Card
5.1%
Sub-3s Reviews
12.7m
Avg Session (5m gap)
3
Worst Again Streak
0
User Buried Now
0
Sched Buried Now
Review Speed Distribution
Marathon Session Types
Fastest Cards
Front Avg Time Ease Interval Reviews
\[ {{c1::\sin^2\theta + \cos^2\theta :: \text{Identity} }} = {{c2::1}} \] 1.6s 280% 272d 3
Hat ein Ikosaeder einen Hamiltonkreis? 2.7s 280% 43d 5
{{c1::\(\sum_{i = 1}^{n} \sum_{i = 1}^{n} 1\)::Sum}} \(=\) {{c2:: \(n^2\)}} 3.0s 265% 239d 2
What is \(\log x\) in AuD classes? 3.0s 265% 120d 3
\[ \sin\!\left(\frac{3\pi}{2}\right) = {{c1::-1}} \] 3.2s 280% 288d 3
{{c1::Concurrency}} means {{c2::dealing with multiple things at the same time}}. 3.3s 255% 39d 9
In graph theory, a {{c2::closed walk (Zyklus)}} is a {{c1::walk where \(v_0 = v_n\) (sta 3.3s 265% 233d 4
Maximum und Minimum sind {{c1::eindeutig bestimmte Kenngrössen}} einer Menge, sofern {{c2::si 3.3s 280% 326d 4
{{c1::image-occlusion:rect:left=.0993:top=.1668:width=.1045:height=.5974}}{{c2::image-occlusion: 3.4s 265% 90d 3
{{c1::image-occlusion:rect:left=.0993:top=.1668:width=.1045:height=.5974}}{{c2::image-occlusion: 3.4s 265% 86d 3
\[ \sin\!\left(\frac{\pi}{2}\right) = {{c1::1}} \] 3.6s 280% 292d 3
A thread {{c1::starves}} if {{c2::it can never enter a/any critical section}}. 3.6s 280% 228d 4
We can ignore the base of a logarithm only if {{c1::it's not in the exponent}}. 3.7s 250% 52d 4
Path 3.7s 265% 99d 2
Linear Search 3.7s 265% 70d 3
Hardest Cards
Front Lapses Ease Interval Reviews
Ein Graph \(G = (V, E)\) heisst {{c1::\(k\)-zusammenhängend}}, falls {{c2::\(|V| \geq k + 1\) 5 210% 13d 23
Dreiecksungleichung (Subtraktion) 4 155% 2d 15
Choose a tight bound!\({{c1::O(n)}} \leq {{c2::O(\log(n!))}}\) 4 200% 8d 12
Sei \(G = (V, E)\) ein Graph. Dann gilt: {{c1::\(G\) is \(k\)-knoten-zusa 4 200% 9d 14
{{c3::image-occlusion:rect:left=.1591:top=.8923:width=.7185:height=.0742}}{{c2::image-occlusion: 4 215% 12d 14
Für alle \( k \) gilt: jeder \( k \)-reguläre bipartite Graph enthält {{c1::ein perfektes Mat 3 175% 2d 15
\[ \tan\!\left(\frac{5\pi}{3}\right) = {{c1::-\sqrt{3} }} \] 3 175% 7d 13
{{c1:: \(\sum_{i = 1}^{n} i^3\)::Sum}}  \(=\) {{c2::\(\frac{n^2(n + 1)^2}{4}\)}}  3 190% 2d 14
Eine Folge {{c1::konvergiert}} \(\Longleftrightarrow\) Sie ist {{c2:: eine Cauchy-F 3 190% 2d 13
A program has a {{c1::data race}} if, {{c2::during any possible execution, a memory location could b 3 205% 22d 12
Beweis: Für alle \(a < b\) in \(\mathbb{R}\) existiert ein \(\mathbb{Q}\) mit \(a < q < 3 220% 69d 10
\[ \cos(\pi) = {{c1::-1}} \] 3 220% 65d 10
\[ \tan(\pi) = {{c1::0}} \] 3 220% 33d 12
Choose a tight bound!\({{c1::O(\log(n))}}\leq {{c2::O(n)}}\) 3 235% 10d 17
Archimedisches Prinzip 3 235% 107d 17