Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
31 commits
Select commit Hold shift + click to select a range
dcd0b06
Pin every template to relationalai 2.1.1
chriscoey Nov 13, 2026
6e1b5a4
Fix energy_grid_planning's substation capacity constraint
chriscoey Oct 28, 2026
f113a15
demand_planning_temporal: add separately summed cost terms
chriscoey Nov 13, 2026
3295e41
network_flow_planning: add the lane and site cost sums
chriscoey Nov 13, 2026
439512c
transaction_screening_local: use the 2.x deployment config fields
chriscoey Nov 13, 2026
450faf2
commercial_underwriting: define Standard without Preferred, read prem…
chriscoey Nov 13, 2026
78c7169
supply_chain_transport: name the members of every sum
chriscoey Nov 13, 2026
ab54346
Name relationalai 2.1.1 wherever the docs state the template's version
chriscoey Nov 13, 2026
c31ac35
fraud_detection_rules: declare the concepts and relationships its cel…
chriscoey Nov 13, 2026
c870c63
Add network_flow_planning's and supply_chain_resilience's cost terms
chriscoey Nov 13, 2026
85b5f06
simple-start: make Station the graph's node concept
chriscoey Nov 13, 2026
db6d76e
retail_planning: name the members of the objective sums
chriscoey Nov 13, 2026
c144fe7
Name relationalai 2.1.1 in retail_planning's and fraud-detection's RE…
chriscoey Nov 13, 2026
0a412fa
book_slate_recommendation: use the 2.x path API and name constraint g…
chriscoey Nov 13, 2026
79155a1
Name relationalai 2.1.1 in book_slate_recommendation's README
chriscoey Nov 13, 2026
13574f1
commercial_underwriting: total each entity's premiums in the premium …
chriscoey Nov 13, 2026
3406b89
Use path(...).all().paths() in the path templates
chriscoey Nov 13, 2026
d9f2be9
energy_grid_planning: count no upgrade capacity at substations withou…
chriscoey Nov 13, 2026
974aedd
book_slate_recommendation: shorten the candidate-set comment
chriscoey Nov 13, 2026
3e02702
supply_chain_resilience: no risk surcharge when no supplier is flagged
chriscoey Nov 13, 2026
f55cb92
Keep rai-agent-scaffold on 1.0.14; drop use_lqp from sample-template
chriscoey Nov 13, 2026
a7f8cc6
network_flow_planning: zero fixed cost when no site has one
chriscoey Nov 13, 2026
546d0bd
supply_chain_resilience: zero centrality penalty when no site is scored
chriscoey Nov 13, 2026
c1a5820
datacenter_compute_allocation: use HiGHS by default
chriscoey Nov 14, 2026
128cd3a
datacenter_compute_allocation: label time-limited cells FEASIBLE
chriscoey Nov 14, 2026
e840dbf
financial_index_replication: raise the solve time limit to 300 s
chriscoey Nov 14, 2026
a97ac99
financial_index_replication: point the docs anchors at the 300 s solv…
chriscoey Nov 14, 2026
2552d50
financial_index_replication: drop the generated replica_returns.csv
chriscoey Nov 14, 2026
543eb10
datacenter_compute_allocation: describe the HiGHS labels in the docst…
chriscoey Nov 14, 2026
4544b6d
Remove rai-agent-scaffold
chriscoey Nov 15, 2026
90d0305
Count 52 templates in the index test
chriscoey Nov 20, 2026
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 1 addition & 2 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -17,11 +17,10 @@ The index below covers the current templates. Expand an industry to see its temp
<!-- BEGIN TEMPLATE INDEX -->

<details>
<summary>Cross-Industry (4)</summary>
<summary>Cross-Industry (3)</summary>

| Template | Reasoners | Description |
| --- | --- | --- |
| [rai-agent-scaffold](rai-agent-scaffold/) | Graph | Scaffold for packaging a RelationalAI semantic model as a Snowflake Cortex agent and exposing it through Snowflake Intelligence. |
| [shift_assignment](shift_assignment/) | Prescriptive | Assign workers to shifts based on availability to meet coverage requirements. |
| [simple-start](simple-start/) | Graph | A minimal notebook to connect to Snowflake, model a small graph, and compute betweenness centrality with RelationalAI. |
| [wildlife-conservation-network](wildlife-conservation-network/) | Graph | Identify collaboration clusters among wildlife-conservation organizations with Louvain community detection and degree centrality, surfacing key coordination hubs for resource sharing. |
Expand Down
2 changes: 1 addition & 1 deletion ad_spend_allocation/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -55,7 +55,7 @@ This template also answers the follow-up question every planner asks: if we had
### Tools

- Python >= 3.10.
- RelationalAI Python SDK (`relationalai == 1.0.14`).
- RelationalAI Python SDK (`relationalai == 2.1.1`).

## Quickstart

Expand Down
2 changes: 1 addition & 1 deletion ad_spend_allocation/pyproject.toml
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ description = "RelationalAI template: ad_spend_allocation (PyRel v1)"
readme = "README.md"
requires-python = ">=3.10"
dependencies = [
"relationalai==1.0.14",
"relationalai==2.1.1",
"pandas",
]

Expand Down
2 changes: 1 addition & 1 deletion bom-reachability/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -184,7 +184,7 @@ Focus on the first changes most users will make.

### Tune parameters

- **Assembly-path depth** — `MAX_ASSEMBLY_HOPS` (the `repeat(1, MAX_ASSEMBLY_HOPS)` bound) caps how many tiers `all_paths()` enumerates. Raise it if your BOM is deeper than the bundled three tiers; lower it to keep path counts manageable on wide structures.
- **Assembly-path depth** — `MAX_ASSEMBLY_HOPS` (the `repeat(1, MAX_ASSEMBLY_HOPS)` bound) caps how many tiers `.all().paths()` enumerates. Raise it if your BOM is deeper than the bundled three tiers; lower it to keep path counts manageable on wide structures.

### Extend the model

Expand Down
6 changes: 3 additions & 3 deletions bom-reachability/bom_reachability.py
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@
Assembly path enumeration (PREVIEW, requires relationalai>=1.15): enumerate the
bottom-up assembly chains that build each finished good. Derives a binary
SKU->SKU "feeds into" edge from the BillOfMaterials intermediary (input feeds
output), enumerates every assembly path with model.path(...).all_paths(),
output), enumerates every assembly path with model.path(...).all().paths(),
filters to the maximal (longest non-extendable) chains so sub-paths are
suppressed, and persists each finished good's longest assembly depth back onto
the SKU ontology.
Expand Down Expand Up @@ -201,12 +201,12 @@
).define(sku_in.feeds(sku_out))

# Enumerate every assembly chain. The BOM is a DAG (raw materials -> components
# -> finished goods, never back), so .all_paths() already yields simple paths --
# -> finished goods, never back), so .all().paths() already yields simple paths --
# there is no cycle risk, and the repeat bound only needs to cover the BOM depth.
# Deepest chain here is raw_material -> component -> finished_good (2 hops); we
# allow extra headroom so deeper BOMs enumerate fully.
MAX_ASSEMBLY_HOPS = 4
p = model.path(SKU.feeds.repeat(1, MAX_ASSEMBLY_HOPS)).all_paths()
p = model.path(SKU.feeds.repeat(1, MAX_ASSEMBLY_HOPS)).all().paths()
assembly_df = (
model.where(p)
.select(
Expand Down
2 changes: 1 addition & 1 deletion bom-reachability/pyproject.toml
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ description = "RelationalAI template: bill of materials dependency tracing with
readme = "README.md"
requires-python = ">=3.10"
dependencies = [
"relationalai==1.15.0",
"relationalai==2.1.1",
"pandas>=2.0.0",
]

Expand Down
2 changes: 1 addition & 1 deletion bom-reachability/runbook.md
Original file line number Diff line number Diff line change
Expand Up @@ -45,7 +45,7 @@ Each prompt is pasted into a fresh agent session loaded with the named `/rai-*`

**Prompt:** /rai-graph-analysis Reachability gives dependency pairs, but we want the actual build sequences. Enumerate every bottom-up assembly chain — each ordered route from a raw material up through its components to a finished good. Treat an input that feeds an output as a step in the chain.

**Response:** Where reachability returns pairs, path enumeration returns the ordered build routes. Deriving a SKU→SKU "feeds into" edge from the `BillOfMaterials` intermediary (input feeds output — the reverse of "depends on") and enumerating it with `.all_paths()` yields 18 assembly paths (up to 4 hops). Because the BOM is acyclic, every enumerated path is already a simple chain — no cycle risk. They range from 1-hop direct feeds (e.g. Mobile Processor A15 → ProPhone X1) to 2-hop chains like NAND Flash Memory Die → Mobile Processor A15 → ProPhone X1.
**Response:** Where reachability returns pairs, path enumeration returns the ordered build routes. Deriving a SKU→SKU "feeds into" edge from the `BillOfMaterials` intermediary (input feeds output — the reverse of "depends on") and enumerating it with `.all().paths()` yields 18 assembly paths (up to 4 hops). Because the BOM is acyclic, every enumerated path is already a simple chain — no cycle risk. They range from 1-hop direct feeds (e.g. Mobile Processor A15 → ProPhone X1) to 2-hop chains like NAND Flash Memory Die → Mobile Processor A15 → ProPhone X1.

## 6. Maximal chains and assembly depth

Expand Down
6 changes: 3 additions & 3 deletions book_slate_recommendation/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -57,7 +57,7 @@ This template composes the slate as a single optimization decision rather than a
### Tools

- Python 3.10 or newer.
- RelationalAI Python SDK (`relationalai == 1.1.0`).
- RelationalAI Python SDK (`relationalai == 2.1.1`).

## Quickstart

Expand Down Expand Up @@ -170,7 +170,7 @@ For the full concept and property definitions, see `book_slate_recommendation.py

The pipeline runs in three stages over the shared ontology. Its architectural centerpiece is the bounded knowledge-graph walk: without the paths library there are no candidates and no optimization variables.

**Stage 1 — Knowledge-graph path walks (candidate generation).** The path walker traverses `Item.connected_to` (the symmetric union of `read`, `written_by`, `about`, and `similar_to`) from each user up to `MAX_HOPS = 2` hops. With a `Book` endpoint, the candidate set is the union of length-1 walks (`User -> read_Book`, later excluded because already read) and length-2 walks (`User -> read_Book -> similar_Book`). Each reachable `(user, book)` becomes a `Candidate`. The per-`(user, candidate)` typed counts — shared-author and shared-subject joins against the user's read history, plus the count of walker-enumerated paths — feed the explanation floor, the cold-start cap, and the objective. Each count is defined for every candidate so a candidate with no matches still gets a value, and `path_count_total` sums the three.
**Stage 1 — Knowledge-graph path walks (candidate generation).** The path pattern `model.path(user, Item.connected_to.repeat(1, MAX_HOPS), book)` walks `Item.connected_to` (the symmetric union of `read`, `written_by`, `about`, and `similar_to`) from each user up to `MAX_HOPS = 2` hops. The matched walks are the union of length-1 walks (`User -> read_Book`, later excluded because already read) and length-2 walks (`User -> read_Book -> similar_Book`). Each `(user, book)` pair the pattern connects (`.exists()`) becomes a `Candidate`. The per-`(user, candidate)` typed counts — shared-author and shared-subject joins against the user's read history, plus the number of walks between the pair (`.all().count()`) — feed the explanation floor, the cold-start cap, and the objective. Each count is defined for every candidate so a candidate with no matches still gets a value, and `path_count_total` sums the three.

**Stage 2 — Graph analysis (hero-slot embeddedness).** A `Graph` is built from `Book.similar_to`, and triangle count returns the per-book count of similarity triangles each book participates in, stored as `Book.triangle_count`. Triangle count is graph-derived: it depends on the topology of the similarity graph, not on a per-book scalar that could be supplied externally. Stage 3 uses it to pin the hero slot to a densely embedded book.

Expand Down Expand Up @@ -266,7 +266,7 @@ The fetcher caches every API response under `data/_cache/` keyed by URL, so subs

### Reasoner reference

- [Paths library](https://docs.relational.ai/) — bounded knowledge-graph walks with `.repeat(...)` and `all_paths()`.
- [Paths library](https://docs.relational.ai/) — bounded knowledge-graph walks with `.repeat(...)`, `.exists()`, and `.all().count()`.
- [Graph reasoner](https://docs.relational.ai/) — building a `Graph`, node-concept binding, and structural metrics such as triangle count.
- [Prescriptive reasoner](https://docs.relational.ai/) — the `Problem` API, integer decisions, constraints, and objectives on MiniZinc and HiGHS.

Expand Down
96 changes: 48 additions & 48 deletions book_slate_recommendation/book_slate_recommendation.py
Original file line number Diff line number Diff line change
Expand Up @@ -4,24 +4,25 @@
them by slate position. Slot 1 is hero (top of row); position-decay
engagement is the canonical recsys model, so the order matters as
much as the selection. The architectural centerpiece is bounded
heterogeneous-KG walks via the PyRel paths library
(``relationalai.semantics.std.paths``): the walks generate the
heterogeneous-KG walks via the PyRel path library
(``relationalai.semantics.std.path``): the walks generate the
Candidate concept and the per-(user, candidate) explanation
evidence that feeds the Prescriptive reasoner. The Graph
reasoner separately contributes per-Book ``triangle_count``
over the similarity graph, which the hero-pin IC ties to slot
1 so the highest-engagement position carries graph-derived
structural quality:

- Bounded KG walks (paths library, central):
``Item.connected_to.repeat(1, 2).all_paths()`` walks enumerate
``User -> read_Book`` (length 1; pruned downstream by the
- Bounded KG walks (path library, central):
``model.path(user, Item.connected_to.repeat(1, 2), book)`` matches
``User -> read_Book`` walks (length 1; pruned downstream by the
already-read exclusion) and ``User -> read_Book -> similar_Book``
(length 2). Each walker-reachable (user, book) becomes a
``Candidate``. The per-(user, candidate) typed counts
(``path_count_via_author``, ``_via_subject``, ``_via_kg_walk``)
feed the engagement-weighted explanation floor and objective, and
surface as the per-pick explanation block.
walks (length 2). Each user and book joined by a walk
(``.exists()``) becomes a ``Candidate``. The per-(user, candidate)
typed counts (``path_count_via_author``, ``_via_subject``,
``_via_kg_walk``, the last from ``.all().count()``) feed the
engagement-weighted explanation floor and objective, and surface
as the per-pick explanation block.
- Graph reasoner (hero pin): triangle count over ``Book.similar_to``
per Book. Drives ``hero_pin_ic`` -- slot 1 (top of row) must come
from the densely-embedded subset, so the most-impressed position
Expand Down Expand Up @@ -63,7 +64,6 @@
)
from relationalai.semantics.reasoners.graph import Graph
from relationalai.semantics.reasoners.prescriptive import Problem
from relationalai.semantics.std.paths import PathTraversal

# --------------------------------------------------
# Configure inputs
Expand Down Expand Up @@ -374,37 +374,36 @@ def _assert_in_set(df, col, allowed, source):
# --------------------------------------------------

# Walk the unified ``Item.connected_to`` edge from each User up to
# MAX_HOPS hops. The path-walker bounds enumeration to MAX_HOPS, so
# the candidate set is the bounded reachable set under the KG.
kg_paths = model.path(
# MAX_HOPS hops. The path pattern bounds the walk to MAX_HOPS, so the
# candidate set is the bounded reachable set under the KG. Naming the
# endpoints as a User and a Book lets the same pattern answer both
# "is this book reachable from this user" (``exists``, no
# enumeration) and "how many walks reach it" (``count``).
walk_user, walk_book = User.ref(), Book.ref()
kg_walks = model.path(
walk_user,
Item.connected_to.repeat(1, MAX_HOPS),
).all_paths()

# Candidate set: any (user, book) reached by a User-anchored bounded
# KG walk ending at a Book node. The already-read exclusion lands as
# a ``slot == K+1`` IC (``exclude_read_ic`` below) rather than as a
# pre-pruning filter on this rule -- which keeps the candidate-
# derivation rule a pure positive join over the path walker, at the
# minor CSP cost of a few wasted integer variables forced to K+1.
walk_book,
)

# Candidate set: any (user, book) joined by a bounded KG walk. Books the
# user already read stay candidates; the already-read exclusion below
# forces them to the unpicked slot K+1.
Candidate = model.Concept(
"Candidate",
identify_by={"user_id": Integer, "book_id": Integer},
)
u_cand, b_cand = User.ref(), Book.ref()
p_cand = PathTraversal.ref()
model.define(Candidate.new(user_id=u_cand.id, book_id=b_cand.id)).where(
kg_paths(p_cand),
p_cand.nodes(0, u_cand),
p_cand.nodes(p_cand.length, b_cand),
model.define(Candidate.new(user_id=walk_user.id, book_id=walk_book.id)).where(
kg_walks.exists(),
)

# Per-(user, candidate) explanation features: counts of distinct
# typed connections between the candidate and the user's read
# history.
#
# Each ``count`` expression is followed by ``| 0`` so the property is
# defined for *every* Candidate (not only those with at least one
# match). PyRel aggregates over an empty group produce no row, and
# The author and subject ``count`` expressions are followed by ``| 0``
# so the property is defined for *every* Candidate (not only those
# with at least one match). PyRel aggregates over an empty group produce no row, and
# the position-weighted explanation IC would silently drop Candidates
# whose property is undefined.
#
Expand Down Expand Up @@ -467,21 +466,13 @@ def _assert_in_set(df, col, allowed, source):

# via-walk: number of bounded heterogeneous KG paths from this user
# to the candidate (the actual paths-walk count -- the headline
# explanation-strength signal).
p_s = PathTraversal.ref()
# explanation-strength signal). Every Candidate has at least one walk,
# so this count is always defined.
model.define(Candidate.path_count_via_kg_walk(c, n)).where(
Candidate(c),
n
== count(p_s)
.per(c)
.where(
kg_paths(p_s),
c.user_id == u_c.id,
c.book_id == b_c.id,
p_s.nodes(0, u_c),
p_s.nodes(p_s.length, b_c),
)
| 0,
c.user_id == walk_user.id,
c.book_id == walk_book.id,
n == kg_walks.all().count().per(walk_user, walk_book),
)

# Total: sum across types as a single integer feature for cold-start
Expand Down Expand Up @@ -563,8 +554,11 @@ def _assert_in_set(df, col, allowed, source):
# ``Candidate.slot <= SLATE_SIZE_K`` lives inside ``count``'s second
# argument, not the outer ``where`` -- PyRel rejects decision-
# variable-dependent expressions in top-level ``where`` clauses
# because those iterate over data rows.
slate_size_ic = model.require(
# because those iterate over data rows. Every per-group IC below names
# its group keys (``Candidate.user_id``, plus ``Slot``, ``Author`` or
# ``Subject``) in the ``where`` clause: that clause is what gives the
# constraint one instance per group.
slate_size_ic = model.where(Candidate.user_id).require(
count(Candidate, Candidate.slot <= SLATE_SIZE_K).per(Candidate.user_id) == SLATE_SIZE_K
)
problem.satisfy(slate_size_ic)
Expand All @@ -576,7 +570,7 @@ def _assert_in_set(df, col, allowed, source):
# positions 1..K. Per-pair count cap is the CSP-native shape for
# all-different over decision variables once you also pin the
# total-pick count.
slot_uniqueness_ic = model.require(
slot_uniqueness_ic = model.where(Candidate.user_id, Slot).require(
count(Candidate, Candidate.slot == Slot.pos).per(Candidate.user_id, Slot) <= 1
)
problem.satisfy(slot_uniqueness_ic)
Expand Down Expand Up @@ -608,6 +602,7 @@ def _assert_in_set(df, col, allowed, source):
author_uniqueness_ic = model.where(
Book.id == Candidate.book_id,
Book.written_by(Book, Author),
Candidate.user_id,
).require(count(Candidate, Candidate.slot <= SLATE_SIZE_K).per(Candidate.user_id, Author) <= 1)
problem.satisfy(author_uniqueness_ic)

Expand All @@ -620,6 +615,7 @@ def _assert_in_set(df, col, allowed, source):
subject_span_ic = model.where(
Book.id == Candidate.book_id,
Book.about(Book, Subject),
Candidate.user_id,
).require(
count(Candidate, Candidate.slot <= SLATE_SIZE_K).per(Candidate.user_id, Subject)
<= MAX_PER_SUBJECT
Expand All @@ -631,6 +627,7 @@ def _assert_in_set(df, col, allowed, source):
freshness_ic = model.where(
Book.id == Candidate.book_id,
Book.age_days <= FRESH_WINDOW_DAYS,
Candidate.user_id,
).require(
count(Candidate, Candidate.slot <= SLATE_SIZE_K).per(Candidate.user_id) >= FRESHNESS_FLOOR
)
Expand All @@ -640,6 +637,7 @@ def _assert_in_set(df, col, allowed, source):
originals_ic = model.where(
Book.id == Candidate.book_id,
Book.in_house == 1,
Candidate.user_id,
).require(
count(Candidate, Candidate.slot <= SLATE_SIZE_K).per(Candidate.user_id) >= ORIGINALS_FLOOR
)
Expand All @@ -648,6 +646,7 @@ def _assert_in_set(df, col, allowed, source):
# Cold-start cap: at most COLD_START_CAP weakly-explained picks.
cold_start_ic = model.where(
Candidate.path_count_total < WEAK_EXPLANATION_THRESHOLD,
Candidate.user_id,
).require(count(Candidate, Candidate.slot <= SLATE_SIZE_K).per(Candidate.user_id) <= COLD_START_CAP)
problem.satisfy(cold_start_ic)

Expand All @@ -661,6 +660,7 @@ def _assert_in_set(df, col, allowed, source):
hero_pin_ic = model.where(
Book.id == Candidate.book_id,
Book.triangle_count >= HERO_EMBEDDEDNESS_THRESHOLD,
Candidate.user_id,
).require(count(Candidate, Candidate.slot == 1).per(Candidate.user_id) >= 1)
problem.satisfy(hero_pin_ic)

Expand All @@ -671,7 +671,7 @@ def _assert_in_set(df, col, allowed, source):
# picked items without needing an indicator multiplier. Top picks
# count more, matching the engagement-decay model the objective
# also encodes.
explanation_ic = model.require(
explanation_ic = model.where(Candidate.user_id).require(
sum((SLATE_SIZE_K + 1 - Candidate.slot) * Candidate.path_count_total).per(Candidate.user_id)
>= EXPLANATION_FLOOR
)
Expand Down
2 changes: 1 addition & 1 deletion book_slate_recommendation/pyproject.toml
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ description = "RelationalAI template: book_slate_recommendation (PyRel v1)"
readme = "README.md"
requires-python = ">=3.10"
dependencies = [
"relationalai==1.1.0",
"relationalai==2.1.1",
"pandas>=2.0",
]

Expand Down
2 changes: 1 addition & 1 deletion campaign_roi/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -52,7 +52,7 @@ Every marketing team eventually faces the same question: the portfolio of campai
### Tools

- Python >= 3.10.
- RelationalAI Python SDK (`relationalai == 1.0.14`).
- RelationalAI Python SDK (`relationalai == 2.1.1`).

## Quickstart

Expand Down
2 changes: 1 addition & 1 deletion campaign_roi/pyproject.toml
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ description = "RelationalAI template: campaign_roi (PyRel v1)"
readme = "README.md"
requires-python = ">=3.10"
dependencies = [
"relationalai==1.0.14",
"relationalai==2.1.1",
"pandas",
]

Expand Down
2 changes: 1 addition & 1 deletion cell_tower_coverage/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -54,7 +54,7 @@ Telecommunications and infrastructure teams routinely have to decide where to bu
### Tools

- Python >= 3.10.
- RelationalAI Python SDK (`relationalai == 1.0.14`).
- RelationalAI Python SDK (`relationalai == 2.1.1`).

## Quickstart

Expand Down
2 changes: 1 addition & 1 deletion cell_tower_coverage/pyproject.toml
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ description = "RelationalAI template: cell_tower_coverage (PyRel v1)"
readme = "README.md"
requires-python = ">=3.10"
dependencies = [
"relationalai==1.0.14",
"relationalai==2.1.1",
"pandas>=2.0",
]

Expand Down
4 changes: 2 additions & 2 deletions cicd_runner_allocation/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -53,7 +53,7 @@ Every merge kicks off a pipeline of build, test, and deploy jobs, and each job c
### Tools

- Python >= 3.10.
- RelationalAI Python SDK (`relationalai == 1.11.0`).
- RelationalAI Python SDK (`relationalai == 2.1.1`).

## Quickstart

Expand Down Expand Up @@ -217,7 +217,7 @@ Focus on the first changes most users will make.

- Replace the `data/` CSV bundle with queries against your CI/CD platform's API or data warehouse.
- The model scales to whatever fits the prescriptive engine's solve budget; raise `time_limit_sec` and the concurrency caps together as the fleet grows.
- Pin dependencies (the template pins `relationalai == 1.11.0`) for reproducible runs across environments.
- Pin dependencies (the template pins `relationalai == 2.1.1`) for reproducible runs across environments.

## Troubleshooting

Expand Down
2 changes: 1 addition & 1 deletion cicd_runner_allocation/pyproject.toml
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ description = "RelationalAI template: cicd_runner_allocation (PyRel v1)"
readme = "README.md"
requires-python = ">=3.10"
dependencies = [
"relationalai==1.11.0",
"relationalai==2.1.1",
"pandas>=2.0",
]

Expand Down
Loading
Loading