References: advanced and connecting work
On this page
The primary-source pages below were inspected on 5 September 2026, with the scope noted in each entry. They support definitions, model boundaries, and further study; the explanations, exercises, calculations, diagrams, and educational implementations are original. A listed source does not mean that its entire book, every linked lecture, or all platform behavior was checked. References for the foundations appear in References: calculus and References: computing, mathematics, and careers.
Curriculum and formal reasoning#
[G-CS2023] ACM/IEEE-CS/AAAI, CS2023 knowledge-area listing. Used to check breadth across mathematical, software, systems, data, human, and professional dimensions; no claim of accreditation or equivalence of contact hours.
[G-HOARE] Software Foundations, Programming Language Foundations, Hoare Logic chapter. Primary teaching source for assertions, partial correctness, assignment, and loop rules. The book’s imperative examples and proofs are written independently.
softwarefoundations.cis.upenn.edu/plf-current/Hoare.html
[G-TYPES] Software Foundations, Types chapter. Primary teaching reference for typed operational semantics and progress/preservation. The companion’s bounded expression language is not a machine-checked reproduction of the source’s formal development.
softwarefoundations.cis.upenn.edu/plf-current/Types.html
[G-FLOW] Jeff Erickson, Algorithms, maximum-flow chapter. Flow conservation, residual networks, and cut certificates inspected as the basis for general theorem context. No textbook exercise is reproduced.
jeffe.cs.illinois.edu/teaching/algorithms/book/10-maxflow.pdf
Mathematics, machine learning, and risk#
[G-CVX] Stephen Boyd and Lieven Vandenberghe, Convex Optimization, official book site. A continuation resource for convexity, least squares, and optimization. The landing page was inspected, not every chapter; the displayed quadratic derivations here are verified directly.
web.stanford.edu/~boyd/cvxbook/
[G-ML] Stanford CS229 course notes, logistic classification and backpropagation sections. The logit-loss derivative and chain-rule formulation were inspected; the small standard-library implementations and synthetic experiments here are separate educational examples.
cs229.stanford.edu/main_notes.pdf
[G-ATTENTION] Vaswani et al., Attention Is All You Need (2017), arXiv manuscript. Scaled dot-product and multi-head architecture text/figure inspected. The forward attention lab does not reproduce model training or the original experimental results.
[G-NIST] NIST AI Risk Management Framework official resource. Used for voluntary risk-management context, not legal advice or a claim that an error-rate audit certifies compliance, fairness, or safety.
www.nist.gov/itl/ai-risk-management-framework
[G-ETHICS] ACM Code of Ethics and Professional Conduct, official intended reference. The direct page did not return readable content when it was checked on 5 September 2026. It remains a clearly labeled continuation reference, not an inspected source; no unseen clause is quoted or treated as verified.
[G-ICLR] ICLR Code of Ethics, official public policy page inspected. Used as a concrete example of research-ethics expectations, not a universal legal rule or an endorsement of this book.
Language and database documentation#
[G-AST] Python 3.13 ast documentation. Host AST interfaces support a strict whitelist conversion, not secure execution of arbitrary user code. The installed interpreter used for the tests was Python 3.13.5; the documentation site may show a later patch release.
docs.python.org/3.13/library/ast.html
[G-IPADDRESS] Python 3.13 ipaddress documentation, address/network objects and strict prefix parsing. Offline route modeling is distinct from configuring a real network.
docs.python.org/3.13/library/ipaddress.html
[G-SQLITE] Python 3.13 sqlite3 transaction-control documentation and SQLite isolation documentation. The reference explicitly selects legacy transaction control with SQL BEGIN IMMEDIATE, not an assumed future default. Parameterized values and local atomic effect/receipt writes are tested separately.
docs.python.org/3.13/library/sqlite3.html
[G-GCC] GCC instrumentation options. Address and undefined-behavior sanitizer options inspected. A successful sanitizer run is evidence about executed paths, not proof of race freedom, all lifetimes, or all platforms.
gcc.gnu.org/onlinedocs/gcc/Instrumentation-Options.html
Networks and distributed systems#
[G-TCP] RFC 9293, Transmission Control Protocol (2022), official RFC Editor text. Ordered byte delivery is not an application-level commit acknowledgment.
www.rfc-editor.org/rfc/rfc9293
[G-LAMPORT] Leslie Lamport, Time, Clocks, and the Ordering of Events in a Distributed System (1978), author-hosted paper. Logical-clock ordering and causality distinction inspected; the clock lab is not a synchronization service.
lamport.azurewebsites.net/pubs/time-clocks.pdf
[G-RAFT] Diego Ongaro and John Ousterhout, In Search of an Understandable Consensus Algorithm, extended paper (2014). Election and replicated-log context inspected. Neither the quorum counterexample nor the SQLite outbox project implements Raft.
[G-SLO] Google Site Reliability Engineering, Service Level Objectives chapter. Source for defining observable service indicators and objectives; the examples here use explicitly hypothetical budgets.
sre.google/sre-book/service-level-objectives/
[G-OVERLOAD] Google Site Reliability Engineering, Handling Overload chapter. Primary engineering context for bounded queues, load shedding, and retry amplification, not a tested deployment recipe.
sre.google/sre-book/handling-overload/
How the connecting workshops use sources#
W01–W08 derive their central identities and correctness arguments in the text. W01 uses the calculus definitions and domain discipline already taught. W02 applies induction and DAG reasoning from C04–C08. W03 relies on source-language lifetime and synchronization principles and separates them from deliberately simplified hardware models. W04 develops dual arithmetic and gradients explicitly. W05 derives the oscillator update matrices and conservation identities directly. W06 derives coordinate and interpolation formulas under a stated convention. W07 develops finite-automaton product reachability and the diagonal halting argument. W08 synthesizes previous contracts rather than introducing unsupported production claims. The core C++ guidance and the Clay P-versus-NP status page were rechecked on 5 September 2026; no speculative resolution is asserted.