[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7APFDYTH5H3XEHPQK36NJ3C":3,"skill-same:01M7APFDYTH5H3XEHPQK36NJ3C":48},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":24,"commitSha":25,"skillDirectory":26,"forksCount":27,"repositoryHtmlUrl":28,"repositoryHomepageUrl":29,"ownerHtmlUrl":30,"ownerBlogUrl":31,"ownerDescription":32,"updatedAt":33,"install":34,"resources":47},"01M7APFDYTH5H3XEHPQK36NJ3C","logistics-constraint-programming-metaheuristics-and-bounds",null,"Use when exact methods are not the right tool or you need to judge a solution: constraint programming and where it beats MIP, metaheuristics including simulated annealing, tabu search and genetic algorithms, local search and large neighbourhood search as the workhorses of practical routing, and bounds and solution quality — how to know how good an answer is rather than assuming.","the-vibey-project\u002Fvibey","the-vibey-project","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F329298758?v=4","01M7AJHGZ9722CTJ4JNQZVRH0Q","the vibey project","01M7AJHGZVMG2K7TGXQ6XFHVG3",5,"MIT","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Flogistics-software-optimization\u002Fskills\u002Flogistics-constraint-programming-metaheuristics-and-bounds\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: logistics-constraint-programming-metaheuristics-and-bounds\ndescription: \"Use when exact methods are not the right tool or you need to judge a solution: constraint programming and where it beats MIP, metaheuristics including simulated annealing, tabu search and genetic algorithms, local search and large neighbourhood search as the workhorses of practical routing, and bounds and solution quality — how to know how good an answer is rather than assuming.\"\n---\n\n# Logistics and Optimization Software: Constraint Programming, Metaheuristics, Local Search, and Bounds\n\n> **Part 2 of 5** of the *Logistics and Optimization Software* reference (plugin `logistics-software-optimization`), covering §6–§9. Sibling skills: `logistics-why-projects-fail-complexity-and-modeling` (§0–§5), `logistics-routing-packing-scheduling-and-network-design` (§10–§16), `logistics-inventory-forecasting-operations-and-solvers` (§17–§24), `logistics-reference` (§25–§31). Section numbers are shared across the set; a reference written as §N → `skill` points into that sibling skill.\n>\n> **Currency:** The algorithms and complexity results are permanent. Two areas are live. See §25 → `logistics-reference` for the solver landscape and the quantum and AI optimization claims.\n\n> **⚠️ Scope.** For engineers building or integrating logistics systems. Complements a\n> data-engineering reference (pipelines), an operations reference (process), and a\n> business reference (unit economics).\n>\n> **⚠️ GOTCHA** boxes mark things that sink projects or silently produce wrong answers.\n>\n> **The three ideas that organize this document:**\n> 1. **⚠️ Optimization projects almost never fail on the algorithm.** **They fail on data\n>    quality, on constraints nobody told you about, and on solutions the drivers refuse to\n>    run** (§1 → `logistics-why-projects-fail-complexity-and-modeling`). **The maths is the easy part and it is not where your time goes.**\n> 2. **⚠️ NP-hard does not mean unsolvable — it means no guaranteed-fast exact method.**\n>    **Real instances with tens of thousands of stops are solved to within a few percent\n>    of optimal every night by well-engineered heuristics** (§2 → `logistics-why-projects-fail-complexity-and-modeling`, §8).\n> 3. **⚠️ A 2% better solution that operations won't execute is worth 0%.** **Stability,\n>    explainability and consistency with yesterday's plan routinely matter more than the\n>    objective value** (§1 → `logistics-why-projects-fail-complexity-and-modeling`, §26 → `logistics-reference`).\n\n---\n\n## §6. Constraint Programming\n\n**⚠️ A different paradigm, and often better than MIP for scheduling and sequencing.**\n**CP works by constraint propagation — domain filtering — plus search, rather than by LP\nrelaxation.**\n**⚠️ Where CP wins**: **scheduling with precedence and resource constraints, rostering,\nproblems with complex logical conditions, and anything with rich global constraints\n(`alldifferent`, `cumulative`, `noOverlap`, `element`).** ⚠️ **CP-SAT in particular\n(OR-Tools) is exceptionally strong on scheduling and has largely displaced hand-rolled\napproaches for those problems.**\n**⚠️ Where MIP wins**: **problems with strong linear structure, cost-driven objectives, and\nwhere you need good bounds.**\n⚠️ **Modern CP-SAT solvers hybridize — they include SAT-style clause learning and\nLP relaxations — so the paradigm boundary is blurrier than it was.**\n\n---\n\n## §7. Metaheuristics\n\n**⚠️ When exact methods don't fit the time budget. All of them are variations on \"search\nthe neighbourhood, sometimes accept worse, escape local optima.\"**\n```\nLOCAL SEARCH \u002F HILL CLIMBING   ⚠️ the base. Gets stuck\nSIMULATED ANNEALING            accept worse with decreasing probability\nTABU SEARCH                    ⚠️ forbid recent moves to escape cycles.\n                               Historically very strong on VRP\nGENETIC \u002F EVOLUTIONARY         ⚠️ popular, and frequently OUTPERFORMED by\n                               simpler LNS on routing. Popularity ≠ performance\nANT COLONY, PARTICLE SWARM     ⚠️ heavily published, rarely the best choice\n   in production. Be sceptical of the metaphor-driven literature here\nGRASP, VNS, ⚠️ LNS\u002FALNS        §8 — the ones that actually win\nHYPER-HEURISTICS               choose among heuristics adaptively\n```\n> **⚠️ GOTCHA — the metaheuristic literature has a serious novelty problem.** ⚠️ **A large\n> body of published \"novel\" nature-inspired metaheuristics (harmony search, various animal\n> algorithms) has been criticized as rebranding existing methods with new metaphors, and\n> comparisons are frequently against weak baselines on synthetic instances.** **This is a\n> well-documented critique within the OR community.** **⚠️ For routing, start with LNS —\n> it is the practical state of the art and it is simple.**\n\n---\n\n## §8. ⚠️ Local Search and Large Neighbourhood Search\n\n**⚠️ This is what actually powers production routing engines, and it's conceptually\nsimple.**\n```\n⚠️ LNS \u002F ALNS (Adaptive LNS)\n  1. Start from any feasible solution\n  2. DESTROY — remove part of it (random stops, a geographic cluster,\n     a whole route, the most \"expensive\" stops)\n  3. REPAIR — reinsert greedily or with a small exact solve\n  4. Accept or reject; ⚠️ ADAPT the weights on destroy\u002Frepair operators\n     based on which have been working\n  5. Repeat until the time budget is gone\n```\n**⚠️ Why it wins in practice:**\n- ⚠️ **It handles arbitrary messy constraints.** **The repair step just has to respect\n  them; you never need a clean mathematical formulation of every business rule.**\n- ⚠️ **It's anytime.** **Stop whenever; you have a valid solution.** **This matches\n  operational reality where you have 20 minutes, not \"until optimal.\"**\n- **⚠️ It warm-starts naturally**, **which is exactly what you need for §1 → `logistics-why-projects-fail-complexity-and-modeling`'s stability\n  requirement and for §23 → `logistics-inventory-forecasting-operations-and-solvers`'s dynamic re-optimization.**\n- **It parallelizes reasonably.**\n\n**⚠️ Classic VRP local search moves worth knowing**: **2-opt and Or-opt (within a route),\nrelocate and swap (between routes), 2-opt* (cross-route tail exchange), and ⚠️ ejection\nchains.** **Combined with LNS these cover most of what commercial engines do.**\n\n---\n\n## §9. Bounds and Solution Quality\n\n> **⚠️ GOTCHA — without a bound you have no idea whether your heuristic is 2% or 40% from\n> optimal, and \"it produced a solution\" tells you nothing.** ⚠️ **This is the single most\n> common gap in home-grown optimizers.**\n\n**⚠️ How to get a bound**: **the LP relaxation; a Lagrangian relaxation; a simplified\nproblem (e.g. the assignment relaxation of a TSP); or a column-generation lower bound.**\n**⚠️ Even a crude bound is transformative** — **it converts \"the heuristic ran\" into \"we\nare within X%,\" which is the number that justifies further investment or closes the\nproject.**\n**⚠️ Benchmark against standard instance libraries**: **TSPLIB, CVRPLIB \u002F Solomon and\nGehring-Homberger for VRPTW, MIPLIB for MIP.** ⚠️ **And benchmark against the HUMAN\nbaseline too, because that's the actual decision.**\n\n---\n\n# PART II — THE CORE PROBLEM FAMILY\n","# Logistics and Optimization Software: Constraint Programming, Metaheuristics, Local Search, and Bounds\n\n> **Part 2 of 5** of the *Logistics and Optimization Software* reference (plugin `logistics-software-optimization`), covering §6–§9. Sibling skills: `logistics-why-projects-fail-complexity-and-modeling` (§0–§5), `logistics-routing-packing-scheduling-and-network-design` (§10–§16), `logistics-inventory-forecasting-operations-and-solvers` (§17–§24), `logistics-reference` (§25–§31). Section numbers are shared across the set; a reference written as §N → `skill` points into that sibling skill.\n>\n> **Currency:** The algorithms and complexity results are permanent. Two areas are live. See §25 → `logistics-reference` for the solver landscape and the quantum and AI optimization claims.\n\n> **⚠️ Scope.** For engineers building or integrating logistics systems. Complements a\n> data-engineering reference (pipelines), an operations reference (process), and a\n> business reference (unit economics).\n>\n> **⚠️ GOTCHA** boxes mark things that sink projects or silently produce wrong answers.\n>\n> **The three ideas that organize this document:**\n> 1. **⚠️ Optimization projects almost never fail on the algorithm.** **They fail on data\n>    quality, on constraints nobody told you about, and on solutions the drivers refuse to\n>    run** (§1 → `logistics-why-projects-fail-complexity-and-modeling`). **The maths is the easy part and it is not where your time goes.**\n> 2. **⚠️ NP-hard does not mean unsolvable — it means no guaranteed-fast exact method.**\n>    **Real instances with tens of thousands of stops are solved to within a few percent\n>    of optimal every night by well-engineered heuristics** (§2 → `logistics-why-projects-fail-complexity-and-modeling`, §8).\n> 3. **⚠️ A 2% better solution that operations won't execute is worth 0%.** **Stability,\n>    explainability and consistency with yesterday's plan routinely matter more than the\n>    objective value** (§1 → `logistics-why-projects-fail-complexity-and-modeling`, §26 → `logistics-reference`).\n\n---\n\n## §6. Constraint Programming\n\n**⚠️ A different paradigm, and often better than MIP for scheduling and sequencing.**\n**CP works by constraint propagation — domain filtering — plus search, rather than by LP\nrelaxation.**\n**⚠️ Where CP wins**: **scheduling with precedence and resource constraints, rostering,\nproblems with complex logical conditions, and anything with rich global constraints\n(`alldifferent`, `cumulative`, `noOverlap`, `element`).** ⚠️ **CP-SAT in particular\n(OR-Tools) is exceptionally strong on scheduling and has largely displaced hand-rolled\napproaches for those problems.**\n**⚠️ Where MIP wins**: **problems with strong linear structure, cost-driven objectives, and\nwhere you need good bounds.**\n⚠️ **Modern CP-SAT solvers hybridize — they include SAT-style clause learning and\nLP relaxations — so the paradigm boundary is blurrier than it was.**\n\n---\n\n## §7. Metaheuristics\n\n**⚠️ When exact methods don't fit the time budget. All of them are variations on \"search\nthe neighbourhood, sometimes accept worse, escape local optima.\"**\n```\nLOCAL SEARCH \u002F HILL CLIMBING   ⚠️ the base. Gets stuck\nSIMULATED ANNEALING            accept worse with decreasing probability\nTABU SEARCH                    ⚠️ forbid recent moves to escape cycles.\n                               Historically very strong on VRP\nGENETIC \u002F EVOLUTIONARY         ⚠️ popular, and frequently OUTPERFORMED by\n                               simpler LNS on routing. Popularity ≠ performance\nANT COLONY, PARTICLE SWARM     ⚠️ heavily published, rarely the best choice\n   in production. Be sceptical of the metaphor-driven literature here\nGRASP, VNS, ⚠️ LNS\u002FALNS        §8 — the ones that actually win\nHYPER-HEURISTICS               choose among heuristics adaptively\n```\n> **⚠️ GOTCHA — the metaheuristic literature has a serious novelty problem.** ⚠️ **A large\n> body of published \"novel\" nature-inspired metaheuristics (harmony search, various animal\n> algorithms) has been criticized as rebranding existing methods with new metaphors, and\n> comparisons are frequently against weak baselines on synthetic instances.** **This is a\n> well-documented critique within the OR community.** **⚠️ For routing, start with LNS —\n> it is the practical state of the art and it is simple.**\n\n---\n\n## §8. ⚠️ Local Search and Large Neighbourhood Search\n\n**⚠️ This is what actually powers production routing engines, and it's conceptually\nsimple.**\n```\n⚠️ LNS \u002F ALNS (Adaptive LNS)\n  1. Start from any feasible solution\n  2. DESTROY — remove part of it (random stops, a geographic cluster,\n     a whole route, the most \"expensive\" stops)\n  3. REPAIR — reinsert greedily or with a small exact solve\n  4. Accept or reject; ⚠️ ADAPT the weights on destroy\u002Frepair operators\n     based on which have been working\n  5. Repeat until the time budget is gone\n```\n**⚠️ Why it wins in practice:**\n- ⚠️ **It handles arbitrary messy constraints.** **The repair step just has to respect\n  them; you never need a clean mathematical formulation of every business rule.**\n- ⚠️ **It's anytime.** **Stop whenever; you have a valid solution.** **This matches\n  operational reality where you have 20 minutes, not \"until optimal.\"**\n- **⚠️ It warm-starts naturally**, **which is exactly what you need for §1 → `logistics-why-projects-fail-complexity-and-modeling`'s stability\n  requirement and for §23 → `logistics-inventory-forecasting-operations-and-solvers`'s dynamic re-optimization.**\n- **It parallelizes reasonably.**\n\n**⚠️ Classic VRP local search moves worth knowing**: **2-opt and Or-opt (within a route),\nrelocate and swap (between routes), 2-opt* (cross-route tail exchange), and ⚠️ ejection\nchains.** **Combined with LNS these cover most of what commercial engines do.**\n\n---\n\n## §9. Bounds and Solution Quality\n\n> **⚠️ GOTCHA — without a bound you have no idea whether your heuristic is 2% or 40% from\n> optimal, and \"it produced a solution\" tells you nothing.** ⚠️ **This is the single most\n> common gap in home-grown optimizers.**\n\n**⚠️ How to get a bound**: **the LP relaxation; a Lagrangian relaxation; a simplified\nproblem (e.g. the assignment relaxation of a TSP); or a column-generation lower bound.**\n**⚠️ Even a crude bound is transformative** — **it converts \"the heuristic ran\" into \"we\nare within X%,\" which is the number that justifies further investment or closes the\nproject.**\n**⚠️ Benchmark against standard instance libraries**: **TSPLIB, CVRPLIB \u002F Solomon and\nGehring-Homberger for VRPTW, MIPLIB for MIP.** ⚠️ **And benchmark against the HUMAN\nbaseline too, because that's the actual decision.**\n\n---\n\n# PART II — THE CORE PROBLEM FAMILY\n",{"name":5,"description":7},"develop","ae32736a1aabddabca5d2c96d665aa0ebc7d8700","src\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Flogistics-software-optimization\u002Fskills\u002Flogistics-constraint-programming-metaheuristics-and-bounds",3,"https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey","https:\u002F\u002Fthe-vibey-project.github.io\u002Fvibey\u002F","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project","https:\u002F\u002Fvibewithadam.matthewsteinberger.com","freedom for software engineers","2026-11-15 05:47:42",{"source":8,"skillName":5,"commands":35,"prompt":45,"zipAvailable":46},[36,39,42],{"tool":37,"command":38},"npx","npx skills add the-vibey-project\u002Fvibey --skill logistics-constraint-programming-metaheuristics-and-bounds",{"tool":40,"command":41},"bunx","bunx skills add the-vibey-project\u002Fvibey --skill logistics-constraint-programming-metaheuristics-and-bounds",{"tool":43,"command":44},"pnpm","pnpm dlx skills add the-vibey-project\u002Fvibey --skill logistics-constraint-programming-metaheuristics-and-bounds","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Flogistics-software-optimization\u002Fskills\u002Flogistics-constraint-programming-metaheuristics-and-bounds\u002FSKILL.md",true,[],[49,56,63,70,77,84],{"skillNo":50,"name":51,"nameZh":6,"description":52,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":53,"categories":54,"keywords":55,"publishedAt":19},"01M7AT1FQJAE1FQYAMDTF490Y4","white-paper-writing","Use when writing white papers, technical reports, policy documents, thought leadership pieces, or any long-form authoritative document. Triggers on requests to write, structure, outline, or review white papers, technical reports, position papers, policy briefs, or evidence-driven arguments. Also use for B2B content marketing strategy, technical documentation requiring authority, academic-style reports, or any document that must educate while persuading. Use when someone asks \"how should I structure this\" for a long-form document.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fwhite-paper-writing\u002FSKILL.md",[],[],{"skillNo":57,"name":58,"nameZh":6,"description":59,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":60,"categories":61,"keywords":62,"publishedAt":19},"01M7AT16BJRJJKK2MASXRZS76G","prose-technical-mechanics","Use when editing or writing prose at a technical\u002Fmechanical level: choosing between Anglo-Saxon and Latinate diction, placing information in topic vs stress positions, writing periodic vs cumulative sentences, handling sentence rhythm, punctuation as logic, transitions, paragraph structure, or phonesthetics. Use when someone wants to understand WHY prose works or doesn't, not just surface-level style advice. Triggers on word choice, sentence structure, emphasis, rhythm, diction, or any deep writing mechanics question.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fprose-technical-mechanics\u002FSKILL.md",[],[],{"skillNo":64,"name":65,"nameZh":6,"description":66,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":67,"categories":68,"keywords":69,"publishedAt":19},"01M7AT0W9HT0ZZ9Y287NW99MR3","prose-mechanics","Use when writing, editing, or analyzing prose style; when trying to avoid generic AI-sounding writing; when applying specific prose styles such as journalistic, academic, narrative, KJV biblical, Hemingway plain, Latinate\u002FJamesian, Orwellian, Augustan, Victorian, Early Modern (Bacon, Browne, Milton), or free indirect discourse; or when coaching someone on writing voice and mechanics. Triggers on any request to improve, analyze, or write in a specific prose style, to fix \"AI-sounding\" writing, to make prose more vivid or concrete, to vary sentence rhythm, or to understand how a particular writer achieves their effects.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fprose-mechanics\u002FSKILL.md",[],[],{"skillNo":71,"name":72,"nameZh":6,"description":73,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":74,"categories":75,"keywords":76,"publishedAt":19},"01M7AT0KR635JX66X2X6F3E2CP","narrative-structure","Use when structuring stories, pitches, presentations, white papers, or any persuasive narrative; analyzing the hero's journey in fiction or non-fiction; applying StoryBrand for business communication; designing narrative arcs for thought leadership; or understanding Vogler, Snyder, Propp, or Campbell frameworks. Triggers on any narrative structure, storytelling, pitch structure, StoryBrand, hero's journey, three-act structure, Freytag, Save the Cat, narrative arc, or \"how should I structure this story\u002Fpitch\u002Fpresentation\" request.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fnarrative-structure\u002FSKILL.md",[],[],{"skillNo":78,"name":79,"nameZh":6,"description":80,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":81,"categories":82,"keywords":83,"publishedAt":19},"01M7AT0AKGW09NKKZDYBT8VRDE","legal-brief-writing","Use when writing legal briefs, motions, or any court filing; when analyzing judicial cognition and persuasion; when applying elite brief-writing techniques from Roberts, Clement, Kagan, Garner; or when structuring legal arguments for maximum persuasion. Also use for autistic\u002Fneurodivergent advocates who need to understand how their natural communication style maps to elite legal advocacy. Triggers on any legal writing, brief drafting, motion preparation, or legal argument structuring request.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Flegal-brief-writing\u002FSKILL.md",[],[],{"skillNo":85,"name":86,"nameZh":6,"description":87,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":88,"categories":89,"keywords":90,"publishedAt":19},"01M7AT00VWPS4Q8B5VEMXX9NQT","journal-publishability-criteria","Use whenever a research paper, article or preprint is being written, revised, reviewed or published, and specifically before every publication of docs\u002Fpaper.md. Covers what legitimate journals actually gate on, in order of gating — the editor's desk screen (scope, novelty, package problems), what reviewers judge (methodological soundness, claims the evidence can carry, statistical and qualitative reporting), EQUATOR reporting guidelines, the ICMJE authorship criteria, COPE's view of text recycling, the near-universal generative-AI policy (no AI author, disclosure, author responsibility), TOP 2025 transparency standards, how to verify a journal is legitimate, submitting without an institution, and a pre-submission checklist. Triggers on requests to evaluate, review, prepare or submit a paper, to judge publishability, to write a declarations or data-availability section, to disclose AI use, or to check a journal.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fjournal-publishability-criteria\u002FSKILL.md",[],[]]