The 20-route learning estate
eduKateSengkang is organised as a Learning Castle: existing subject hubs, level routes, examination routes and learning-system pages retain their jobs. This page is the master upgrade directory. It does not replace those owners. It makes the work visible, assigns every upgrade to one route, and gives new or substantially revised articles stable IDs so later batches can be connected without losing track of what is complete.
Numbering rule
Each route has a -000 hub pointer. Article slots then use reserved tens: -010, -020, -030 and so on. The first upgrade programme reserves up to 150 article slots per route, ending at -1500. Existing high-value URLs are upgraded in place wherever practical; the ID identifies the editorial job, not a requirement to create a new URL.
| Route | Hub ID | Primary job | Existing owner / destination | Reserved article IDs | Status |
|---|---|---|---|---|---|
| SK-01 | SK-01-000 | Homepage, Sengkang Tuition, commercial/navigation/root accuracy | Homepage / Tuition Centre owner | SK-01-010–SK-01-1500 | OPEN |
| SK-02 | SK-02-000 | Primary 1–3 English | Primary English Learning Hub | SK-02-010–SK-02-1500 | OPEN |
| SK-03 | SK-03-000 | Primary 4–6 English + PSLE English | Primary English Learning Hub / PSLE Learning Guide | SK-03-010–SK-03-1500 | OPEN |
| SK-04 | SK-04-000 | Secondary 1–2 English | English Hub | SK-04-010–SK-04-1500 | OPEN |
| SK-05 | SK-05-000 | Secondary 3–4 English + SEC English | English Hub | SK-05-010–SK-05-1500 | OPEN |
| SK-06 | SK-06-000 | Vocabulary, grammar, reading, writing and English skills | Complete English Index | SK-06-010–SK-06-1500 | OPEN |
| SK-07 | SK-07-000 | Primary 1–3 Mathematics | Mathematics Hub | SK-07-010–SK-07-1500 | OPEN |
| SK-08 | SK-08-000 | Primary 4–6 Mathematics + PSLE Mathematics | Mathematics Hub / PSLE Learning Guide | SK-08-010–SK-08-1500 | OPEN |
| SK-09 | SK-09-000 | Secondary 1–2 Mathematics | Mathematics Hub | SK-09-010–SK-09-1500 | OPEN |
| SK-10 | SK-10-000 | Secondary 3–4 Mathematics + SEC Mathematics | Mathematics Hub | SK-10-010–SK-10-1500 | OPEN |
| SK-11 | SK-11-000 | Additional Mathematics | Additional Mathematics owner | SK-11-010–SK-11-1500 | OPEN |
| SK-12 | SK-12-000 | Primary 3–4 Science | Science Hub | SK-12-010–SK-12-1500 | OPEN |
| SK-13 | SK-13-000 | Primary 5–6 Science + PSLE Science | Science Hub / PSLE Science Learning Guide | SK-13-010–SK-13-1500 | OPEN |
| SK-14 | SK-14-000 | Secondary Science + scientific reasoning | Science Hub | SK-14-010–SK-14-1500 | OPEN |
| SK-15 | SK-15-000 | Learning Castle, Learning Runtime and study methods | Learning Runtime Hub | SK-15-010–SK-15-1500 | OPEN |
| SK-16 | SK-16-000 | Examination performance, revision, assessment and error repair | Examination Craft | SK-16-010–SK-16-1500 | OPEN |
| SK-17 | SK-17-000 | Parent guides, tuition, teaching and student support | Parents’ Guide | SK-17-010–SK-17-1500 | OPEN |
| SK-18 | SK-18-000 | Algorithms, computing and advanced mathematics | Algorithms & Computing Hub | SK-18-010–SK-18-1500 | OPEN |
| SK-19 | SK-19-000 | Advanced science and world-knowledge science material | Complete Science Index | SK-19-010–SK-19-1500 | OPEN |
| SK-20 | SK-20-000 | Estate archaeology: duplication, location leakage, orphan control, cannibalisation and consolidation candidates | Learning Castle Registry | SK-20-010–SK-20-1500 | OPEN |
Article register
The first-wave titles and status ledger are live in the eduKate Sengkang Article Register | SK-01 to SK-20. Use it to claim the next article ID, see protected owners and avoid duplicating work already active in another branch.
Protection-first reader standard
All 20 branches now follow the eduKate Sengkang Reader Experience Standard: protect strong pages, connect isolated pages, improve formatting only where it helps, use bounded surgery for specific defects, and modernise only when the existing article no longer completes its reader job.
Article state
Every inspected URL receives one state before work begins: PROTECT for ranking or strategically sensitive owners; KEEP for sound pages needing no substantial rewrite; MODERNISE for useful but outdated pages; SURGERY for small bounded repairs; RETARGET for pages that need a distinct adjacent search job; CONSOLIDATION CANDIDATE for overlapping intent that requires owner review; LOCATION LEAKAGE for misplaced locality; or HISTORICAL for material worth preserving without major reinvestment.
Completion rule
An article ID becomes complete only when the assigned existing URL or new article has a defined reader job, correct owner, current factual scope, useful internal return path and no unresolved collision with another Sengkang owner. A branch can therefore inspect more than 150 URLs without rewriting 150 pages. The 150 slots are a controlled first-wave capacity, not a quota.
Castle relationship
This programme sits under the existing Learning Castle and follows its one-owner-many-routes rule. English, Mathematics, Science, Examination Craft, Learning Runtime and Algorithms retain their existing canonical roles. The master directory exists to coordinate upgrades and make unfinished work visible; it does not create twenty competing subject hubs.
Complete-index crosswalk
Use the 20 routes above to decide ownership and upgrade work. Use these Complete Archives when the job is enumeration, orphan control or direct deep-article discovery.
English Archive · Mathematics Archive · Science Archive · Examination Archive · Learning Runtime Archive · Algorithms & Computing Archive
Deep fallback discovery
The subject hubs and Complete Archives remain the preferred routes. These live indexes are the final orphan-control layer: they expose every published Page and Post through paginated internal links so newly published or unusually placed content still has a crawlable return path while specialist routing is updated.
Browse every published Page
-
How Writing Works for a Student | From Purpose to Reader-Ready Text
-
I Am Brave: The First Term of Secondary 1
-
I Am Brave: The Primary 6 Year
-
I Am Brave: The Secondary 4 Year
-
Independent Adulthood Tutor | Curie Series | Building a Life That Can Run
-
Independent Attempt | What the Learner Can Carry Without Hidden Help
-
Information & Media Literacy Tutor | Curie Series | Learning to Keep Representations Correctable
-
Interface Verification | Can the Parts Work Together?
-
Is a 3-Pax Class the Right Fit for My Child?
-
Is This Tuition Class the Right Fit? | How Parents Can Evaluate Small-Group Tuition in Sengkang
-
JC1 English Tutor | Curie Series | From Secondary English to General Paper and Academic Argument
-
JC1 Mathematics Tutor | Curie Series | From Secondary Mathematics to Calculus, Statistics and Modelling
-
JC1 Science Tutor | Curie Series | From Secondary Science to A-Level Disciplinary Depth
-
JC2 English Tutor | Curie Series | Evidence, Argument and A-Level Independence
-
JC2 Mathematics Tutor | Curie Series | A-Level Integration, Mathematical Judgement and Independence
-
JC2 Science Tutor | Curie Series | A-Level Integration, Practical Evidence and Scientific Independence
-
June Holiday Revision Plan 2027 for P5, P6, Sec 3 and Sec 4
-
Keep Steward | Learner Capability and Independence Agent
-
Keymaster | Evidence and Permission Agent
-
Knowing When to Ask for Help | Marie Curie Series | Where Independent Learning Should Hand Back to Support
-
Later-Career & Stewardship Tutor | Curie Series | Expertise, Succession and Responsibility
-
Later-Life Learning Tutor | Curie Series | Maintain, Adapt, Grow and Contribute
-
Launch Commit Criteria | What Must Be True Before We Proceed?
-
Leadership & People Responsibility Tutor | Curie Series | Learning to Carry Responsibility for Others
-
Learning & Reskilling Tutor | Curie Series | How Adults Build New Capability
-
Learning Castle Admission Schema
-
Learning Castle Agent Guild | Operations Council
-
Learning Castle AI Discovery Schema | Machine Entry and Interpretation
-
Learning Castle Boot Protocol | Runtime Load Order for AI
-
Learning Castle Edge Schema | Roads, Bridges and Return Paths
-
Learning Castle Fort Schema | Domain Ownership and Capability Runtime
-
Learning Castle Gate Schema | Inputs, Keys and Permitted Transitions
-
Learning Castle Inheritance and Fallback Schema
-
Learning Castle Key Schema | Evidence, Permission and Confidence Keys
-
Learning Castle Node Schema | Uniform Machine Declaration for Every Site Object
-
Learning Castle Portcullis Schema | Hard Stops and Protected Boundaries
-
Learning Castle Registry | Canonical Objects and Routes
-
Learning Castle Return Schema | Capability, Ownership and World Return
-
Learning Castle Route Schema | Gate Conditions and Typed Paths
-
Learning Castle Runtime Closure | Stable Castle Kernel
-
Learning Castle Scout Schema
-
Learning Castle Sentry Schema
-
Learning Castle State Schema | Learner, Routing and Evidence States
-
Learning Castle Supersession and Retirement Schema
-
Learning Castle Validation Schema | Runtime Integrity and Self-Checks
-
Learning Castle Watchtower Schema
-
Learning Castle | Logic Learning Gate System
-
Learning Drift | Marie Curie Series | Why a Student Can Look Fine Before Results Fall
-
Learning Hall | I Am Brave | Courage, Learning & eduKate Sengkang
-
Learning Practice and Review | Find Your Next Step
Browse every published Post
-
How to Learn X-Ray Absorption Spectroscopy (XAS): From Absorption Edges and XANES to EXAFS, Operando Local Structure and Machine-Assisted Spectral Inference
5–7 minutes -
How to Learn Levenberg–Marquardt: Nonlinear Least Squares, Gauss–Newton, Damping, Trust Regions and Robust Curve Fitting
7–10 minutes -
How to Learn Raymond’s Tree-Based Mutual Exclusion: Tokens, Holder Pointers, Request Queues, Tree Reorientation and Message Complexity
8–11 minutes -
How to Learn Neighbor-Joining: Distance Matrices, Q-Criteria, Limb Lengths, Unrooted Trees and Phylogenetic Reconstruction
7–10 minutes -
How to Learn the Nussinov Algorithm: RNA Secondary Structure, Interval Dynamic Programming, Base-Pair Recurrences and Backtracking
6–9 minutes -
How to Learn Bridson’s Poisson-Disk Sampling: Blue Noise, Minimum-Distance Grids, Active Lists and Fast Spatial Sampling
6–9 minutes -
How to Learn the Fast Marching Method: Eikonal Equations, Accepted Fronts, Upwind Updates and Arrival-Time Computation
5–8 minutes -
How to Learn Gale–Shapley Deferred Acceptance: Stable Matching, Preference Lists, Proposer Optimality and Market-Design Reasoning
5–8 minutes -
Hirschberg’s Algorithm | Linear-Space LCS Learning Guide
5–8 minutes -
How to Learn Suurballe’s Algorithm: Reweighting, Residual Graphs, Edge-Disjoint Shortest Paths and Resilient Routing
5–8 minutes -
How to Learn the Frank–Wolfe Algorithm: Linear Minimization Oracles, Duality Gaps, Projection-Free Optimization and Sparse Iterates
6–8 minutes -
How to Learn the Package-Merge Algorithm: Length-Limited Huffman Coding, Coin-Collector Reduction, Code-Length Bounds and Production Compression
6–9 minutes -
Boyer–Myrvold Planarity Testing | Graph Algorithms Learning Guide
6–9 minutes -
How to Learn ADMM: Variable Splitting, Augmented Lagrangians, Primal/Dual Residuals and Distributed Convex Optimization
5–7 minutes -
How to Learn FISTA: Proximal Operators, Momentum, Shrinkage, O(1/k²) Convergence and Restarted Sparse Optimization
5–8 minutes -
How to Learn the Leiden Algorithm: Local Moving, Refinement, Aggregation, CPM/Modularity and Well-Connected Communities
5–8 minutes -
How to Learn the Lanczos Algorithm: Krylov Subspaces, Three-Term Recurrence, Ritz Values, Reorthogonalization and Sparse Eigenproblems
5–8 minutes -
How to Learn Reverse Cuthill–McKee: Sparse Matrix Reordering, Bandwidth Reduction, Pseudo-Peripheral Vertices and Solver Locality
5–8 minutes -
How to Learn Welzl’s Algorithm: Smallest Enclosing Circles, Support Sets, Randomized Incremental Geometry and Expected Linear Time
5–7 minutes -
How to Learn the Fast Marching Method: Eikonal Equations, Accepted Fronts, Upwind Updates and O(N log N) Arrival-Time Computation
5–8 minutes -
How to Learn Sequential Minimal Optimization (SMO): SVM Dual Variables, KKT Conditions, Working Sets and Kernel Training
6–9 minutes -
Amanatides–Woo Voxel Traversal | 3D DDA Learning Guide
7–11 minutes -
How to Learn Bridson’s Poisson-Disk Sampling: Active Lists, Background Grids, Blue Noise and O(N) Spatial Sampling
7–11 minutes -
How to Learn Fisher–Yates Shuffle: Uniform Permutations, Swap Invariants, Modulo Bias and Production-Grade Randomness
7–10 minutes -
How to Learn the Goertzel Algorithm: Single-Bin DFTs, Second-Order Recurrences, Tone Detection and Numerical Stability
7–10 minutes -
How to Learn Bacterial Chemotaxis and Chemoreceptor Arrays: From Molecular Sensing to Run–Tumble Navigation and Adaptive Memory
8–13 minutes -
How to Learn Comammox Nitrospira and Complete Nitrification: From a Two-Microbe Textbook Pathway to One-Cell Ammonia-to-Nitrate Metabolism
9–13 minutes -
How to Learn Polyhydroxyalkanoates (PHA/PHB) and Bacterial Carbon-Storage Granules: From Excess Carbon to Carbonosomes and Bioplastics
8–12 minutes -
How to Learn Archaeal S-Layers and Cell-Surface Glycoproteins: From Protein Lattices to Extreme Cell Envelopes
7–10 minutes -
How to Learn Glass Science and Amorphous Materials: From Supercooled Liquids to Glass Transition, Metallic Glasses and Structural Relaxation
8–12 minutes -
How to Learn Cosmic Rays and Particle Astrophysics: From Charged Particles to Air Showers, PeVatrons and Multimessenger Astronomy
7–11 minutes -
How to Learn Fruchterman–Reingold: Attractive and Repulsive Forces, Cooling, Equilibrium and Production Graph Layout
5–8 minutes -
How to Learn Sinkhorn–Knopp: Matrix Scaling, Doubly Stochastic Matrices, Convergence and Entropic Optimal Transport
5–8 minutes -
How to Learn Barnes–Hut: Quadtrees, Octrees, Opening Angles, Force Approximation and O(N log N) N-Body Simulation
5–8 minutes -
How to Learn Jump Point Search: Grid Symmetry Pruning, Forced Neighbours, Jump Points and Optimal A* Acceleration
6–9 minutes -
How to Learn Immunometabolism and Immune Cell Metabolism: From Glycolysis and Mitochondria to Metabolic Reprogramming and Immune Function
8–11 minutes -
How to Learn Aeolian Geomorphology and Desert Dunes: From Saltation to Dune Fields, Dust and Planetary Landscapes
8–11 minutes -
How to Learn Rollback DSU: Reversible Union-Find, Offline Dynamic Connectivity and Time-Segment Recursion
3–5 minutes -
How to Learn MinHash: Jaccard Similarity, Random Permutations, Signatures and Locality-Sensitive Hashing
3–4 minutes -
How to Learn Heavy-Hitter Algorithms: Misra–Gries, Space-Saving, Error Bounds and Streaming Frequency
3–5 minutes -
How to Learn Cuckoo and Quotient Filters: Fingerprints, Relocation, Deletion and Approximate Membership
3–5 minutes -
How to Learn Inductively Coupled Plasma Mass Spectrometry (ICP-MS): From Plasma Ionisation and Mass-to-Charge Separation to Trace Elements, Isotope Ratios and Single-Particle/Single-Cell Analysis
9–13 minutes -
How to Learn SQUID Magnetometry and Vibrating Sample Magnetometry (VSM): From Magnetic Moment and Hysteresis to Susceptibility, Superparamagnetism and Scanning SQUID Microscopy
8–12 minutes -
How to Learn X-Ray Fluorescence (XRF): From Characteristic X-Rays and Matrix Effects to Quantitative Elemental Analysis, Micro-XRF and Autonomous Chemical Mapping
7–11 minutes -
How to Learn Atom Probe Tomography (APT): From Field Evaporation and Time-of-Flight Mass Spectrometry to 3D Atomic Chemistry, Cryo-APT and Correlative Nanometrology
9–13 minutes -
How to Learn Electron Probe Microanalysis (EPMA/WDS): From Electron-Beam X-Rays and Standards to Quantitative Element Maps, Trace Analysis and Planetary Materials
7–10 minutes -
How to Learn Isothermal Titration Calorimetry (ITC): From Heat Pulses and Binding Isotherms to Affinity, Stoichiometry, Thermodynamics and Kinetic Mechanism
6–9 minutes -
How to Learn Acoustic Emission Testing and Structural Health Monitoring: From Elastic-Wave Bursts to Crack Localization, Damage Mechanics and Machine-Learned Diagnostics
6–9 minutes -
How to Learn Electrochemical Impedance Spectroscopy (EIS): From AC Perturbations and Nyquist Plots to Charge Transfer, Diffusion, DRT and Battery Diagnostics
6–9 minutes -
How to Learn Bacteriophages and Phage–Bacteria Ecology: From Adsorption and Lysis to Lysogeny, Defence Systems and Viral Ecology
10–15 minutes
Routing rule: use this fallback only for discovery and orphan control. Canonical subject ownership, reader pathways and return logic continue to come from the Learning Castle, subject hubs and Complete Archives.
