skills/flag-boundary-break/SKILL.md
--- name: flag-boundary-break description: For each simplified-boundary claim, drafts a one-paragraph suggestion for how to acknowledge the boundary inside the post — usually a single sentence or "but" clause — so the break becomes a teaching moment rather than hidden fragility. Runs for exactly the claims classified as simplified-boundary. Skip for all other classifications. Use after cross-reference-claim. Trigger keywords: boundary break, fold break into post, feature not flaw, simplified-bou
npx skillsauth add lyndonkl/claude skills/flag-boundary-breakInstall this skill globally with one command. Works with Claude Code, Cursor, and Windsurf.
3 of 9 scanners reported clean
Some scanners were skipped, did not run, or reported a non-clean status. Review each row below.
Per simplified-boundary claim:
- [ ] Step 1: Identify the intuition the writer was using (analogy, metaphor, concrete picture)
- [ ] Step 2: Identify precisely where the intuition breaks using primary source
- [ ] Step 3: Draft a one-sentence suggestion that names the break as a feature
- [ ] Step 4: Optionally suggest a follow-up post if break is too rich for a sentence
- [ ] Step 5: Return {intuition, break_point, fold_suggestion, optional_follow_up}
Claim: "Attention is O(n²) in memory."
Classification: simplified-boundary.
Primary source: Dao et al. 2022 — FlashAttention, arXiv:2205.14135. "FlashAttention uses O(N) memory rather than the O(N²) of standard attention."
Fold suggestion:
"The O(n²) figure is the naive memory cost — modern production attention (FlashAttention, Dao et al. 2022) is actually O(n) in HBM by never materializing the full attention matrix. The quadratic view is still the right intuition for 'why context windows are expensive' circa 2020, but the actual frontier now is 'attention is memory-bandwidth-bound,' which is a richer story — probably a follow-up post."
Optional follow-up: "FlashAttention as memory-bandwidth reframe."
wrong claims — those get fixed, not folded.testing
Cluster a conference's event records into a small set of coarse themes with finer sub-clusters, an explicit outlier bucket, and soft (multi-membership) affinities — using the hybrid embed-then-label pipeline (embed abstracts, reduce, density-cluster, then LLM-label the clusters) when embedding libraries are available, and an LLM-reasoned hierarchical fallback when they are not. Embeddings do the grouping; the LLM only names the groups. Conference-agnostic. Use when turning structured event records into a navigable theme map for preference elicitation and scheduling, when you need 6-8 reasonable themes rather than 20 muddy ones, or when overlapping talks must belong to more than one theme. Trigger keywords - theme clustering, cluster talks, embed then label, soft membership, outlier talks, conference themes, topic map.
development
Build a personal conference schedule as a constraint-optimization problem — hard constraints (no time overlap, room-to-room travel time, capacity/registration, the attendee's own must-attends and blackouts) plus a user-owned weighted objective trading interest against breadth, pacing (maximize contiguous free time), and serendipity. Surfaces unbreakable conflicts (two high-value overlapping talks the model cannot rank) as decisions for the human rather than silently picking, and reports what each choice traded away. Conference-agnostic. Use to turn a preference profile plus a theme map into a day-by-day plan, to resolve overlapping sessions, or to balance a packed vs paced schedule. Trigger keywords - schedule optimization, conference schedule, constraint optimization, overlapping talks, contiguous free time, conflict surfacing, packed vs paced.
development
Parse a heterogeneous conference program (markdown, HTML, PDF-derived text, or JSON) into normalized event records with per-field confidence scores and independent classification axes (topic, depth, format, prerequisites, recorded, capacity). Detects the program's format before extracting, treats every inferred field as uncertain (present vs inferred vs missing), and flags thin or missing abstracts so downstream enrichment can target them. Conference-agnostic. Use when ingesting a conference or event schedule into a structured store, normalizing a talk/session list, or extracting per-session metadata with calibrated confidence. Trigger keywords - program ingestion, parse schedule, session extraction, event records, conference program, talk metadata, per-field confidence.
development
Build a personalized preference profile from a small number of well-chosen, cluster-grounded questions instead of a long survey. Represents the person's interests as an uncertainty region over the theme map, picks the single highest-information-gain choice-based question (contrasting real talks from different clusters), balances exploiting known interests against exploring uncertain ones, deliberately injects outlier probes to fight selection bias, and stops as soon as the schedule would be stable. Also elicits the user-owned objective weights and hard constraints. Interactive — runs where it can actually ask the person. Conference-agnostic. Use to turn a theme map into a preference profile, to decide what to ask a conference attendee, or to elicit scheduling priorities. Trigger keywords - preference elicitation, ask few questions, information gain, choice-based questions, selection bias probe, objective weights, attendee preferences.