keepset 0.29.2 → 0.30.0

package/README.md

@@ -2,7 +2,7 @@
 
 [![GitHub](https://img.shields.io/badge/GitHub-181717?logo=github&logoColor=white)](https://github.com/Mearman/keepset) [![npm](https://img.shields.io/badge/npm-CB3837?logo=npm&logoColor=white)](https://www.npmjs.com/package/keepset) [![Release](https://img.shields.io/github/v/release/Mearman/keepset)](https://github.com/Mearman/keepset/releases/latest) [![CI](https://img.shields.io/github/actions/workflow/status/Mearman/keepset/ci.yml?branch=main)](https://github.com/Mearman/keepset/actions)
 
-A catalogue of datasets, each with a machine-readable recipe that says how to fetch it and how to normalise it into the shape its category names. The `keepset` package is the consumable library over that catalogue; the CLI and the statically generated site are thin surfaces on top of it. Entries are expressed with [twindex](https://github.com/ExaDev/twindex) crosswalks, so fetching a dataset yields a normalised shape directly in user code.
+A catalogue of datasets, each with a machine-readable recipe that says how to fetch it and how to normalise it into the shape its category names. The `keepset` package is the consumable library over that catalogue; the CLI and the statically generated site are thin surfaces on top of it. Entries are expressed with [crossmap](https://github.com/ExaDev/crossmap) crosswalks, so fetching a dataset yields a normalised shape directly in user code.
 
 ## Usage
 
@@ -36,7 +36,7 @@ npx keepset validate cora
 npx keepset roundtrip cora
 ```
 
-`namespaces [path]` lists the namespaces directly beneath a path (the outermost ones without one) with how many datasets each holds, and the site has a page for each, linked from every entry's namespace. `fetch` writes the normalised result with its provenance beside it; `validate` checks the entry against the entry schema and its crosswalk against twindex's validation without the network; `roundtrip` fetches the dataset and checks that decoding the encoded native document gives it back. Exit status is 0 for an answer, 1 for a negative one (an invalid entry, a round trip that does not hold) and 2 for no answer (bad usage, an unknown or ambiguous name or namespace, a recipe that failed).
+`namespaces [path]` lists the namespaces directly beneath a path (the outermost ones without one) with how many datasets each holds, and the site has a page for each, linked from every entry's namespace. `fetch` writes the normalised result with its provenance beside it; `validate` checks the entry against the entry schema and its crosswalk against crossmap's validation without the network; `roundtrip` fetches the dataset and checks that decoding the encoded native document gives it back. Exit status is 0 for an answer, 1 for a negative one (an invalid entry, a round trip that does not hold) and 2 for no answer (bad usage, an unknown or ambiguous name or namespace, a recipe that failed).
 
 ## Names, aliases and namespaces
 
@@ -57,7 +57,7 @@ An alias that is a path, such as `foo/graphs/bar`, files the entry in a second g
 
 ## The entry format
 
-An entry is a JSON document in `catalogue/entries/`: a descriptor (stable id, name, description, domain, subjects, tags), the category whose normalisation target the entry resolves to, its sources (each with a retrieval date, and for a dead source a pinned Wayback snapshot that travels with the URL because the snapshot timestamp is part of the recipe's reproducibility), its licence and citations, the recipe that turns downloaded bytes into the dataset's native JSON shape, and a twindex crosswalk mapping that native shape onto the category target. The format is defined by Zod schemas, and the generated JSON Schema is published with the package as `keepset/schemas/entry.schema.json`, with the catalogue manifest's beside it. The domain is the entry's topic, its tags are the node fields it carries, its namespace is the source it comes from, and its subjects are the fields of study it is relevant to (for example `operations-research`), as slugs a search filters by (`keepset search --subject operations-research`), a listing page per subject on the site and keywords in the JSON-LD.
+An entry is a JSON document in `catalogue/entries/`: a descriptor (stable id, name, description, domain, subjects, tags), the category whose normalisation target the entry resolves to, its sources (each with a retrieval date, and for a dead source a pinned Wayback snapshot that travels with the URL because the snapshot timestamp is part of the recipe's reproducibility), its licence and citations, the recipe that turns downloaded bytes into the dataset's native JSON shape, and a crossmap crosswalk mapping that native shape onto the category target. The format is defined by Zod schemas, and the generated JSON Schema is published with the package as `keepset/schemas/entry.schema.json`, with the catalogue manifest's beside it. The domain is the entry's topic, its tags are the node fields it carries, its namespace is the source it comes from, and its subjects are the fields of study it is relevant to (for example `operations-research`), as slugs a search filters by (`keepset search --subject operations-research`), a listing page per subject on the site and keywords in the JSON-LD.
 
 The catalogue itself is a manifest (`catalogue/manifest.json`: id, version, repository) plus the entries and their crosswalks. Contribution is by forking with lineage: a fork is its own catalogue, its manifest names the catalogue and version it was forked from, and entry ids stay stable across forks so two catalogues can be compared entry by entry.
 

package/dist/{bundled-Ql23qj97.js → bundled-DV_kxyz2.js}

@@ -1,4 +1,4 @@
-import { CrosswalkSchema, validateCrosswalk } from "twindex";
+import { CrosswalkSchema, validateCrosswalk } from "crossmap";
 import { z } from "zod";
 //#region src/errors.ts
 /** The root of this package's error taxonomy: every error keepset throws is a `KeepsetError`, so callers can catch the family with one check. */
@@ -235,7 +235,7 @@ function maybe(schema) {
 	return schema.nullable().optional();
 }
 /**
-* A task: a place or case to visit or serve, such as a stop of a route or a case in a register, flat so a twindex crosswalk can map a table's columns onto it (a wildcard path must keep the same shape on both sides). The target fixes only what the datasets share and lets a crosswalk map any further column through under its own name, as graph/v1 does. `lat` and `lon` are WGS84 degrees and `x` and `y` are planar coordinates in the dataset's own system; `duration` and `travelTime` are seconds, `prize` is the dataset's own reward measure, and `prizeProbability` is the chance the reward is collected. `skill` and `territory` name what is needed to serve the node and where it sits, `status` is where it is in its lifecycle, and `opened`, `closed` and `deadline` are its lifecycle times as the source writes them, a deadline being a number where the source gives a time of day.
+* A task: a place or case to visit or serve, such as a stop of a route or a case in a register, flat so a crossmap crosswalk can map a table's columns onto it (a wildcard path must keep the same shape on both sides). The target fixes only what the datasets share and lets a crosswalk map any further column through under its own name, as graph/v1 does. `lat` and `lon` are WGS84 degrees and `x` and `y` are planar coordinates in the dataset's own system; `duration` and `travelTime` are seconds, `prize` is the dataset's own reward measure, and `prizeProbability` is the chance the reward is collected. `skill` and `territory` name what is needed to serve the node and where it sits, `status` is where it is in its lifecycle, and `opened`, `closed` and `deadline` are its lifecycle times as the source writes them, a deadline being a number where the source gives a time of day.
 */
 const TaskSchema = z.looseObject({
 	id: z.string().min(1),
@@ -535,7 +535,7 @@ const ArchiveSchema = z.union([
 const ColumnSchema = z.int().min(0);
 /** The text encoding of the unpacked file. Decoding is strict: bytes that are not valid in the stated encoding fail the recipe rather than turning into replacement characters. */
 const EncodingSchema = z.enum(["utf-8", "latin1"]);
-/** A column of a table as the table parser names it: the header with every run of characters outside letters, digits and underscore replaced by one underscore, so it is a valid segment of a twindex path. */
+/** A column of a table as the table parser names it: the header with every run of characters outside letters, digits and underscore replaced by one underscore, so it is a valid segment of a crossmap path. */
 const ColumnNameSchema = z.string().regex(/^[A-Za-z](?:[A-Za-z0-9_]*[A-Za-z0-9])?$/, { message: "must be a column name as the parser spells it: letters, digits and underscores, starting with a letter and not ending with an underscore" });
 /** The parser that reads the unpacked file into the dataset's native JSON shape, with the options that format needs. Every option is stated in the entry, so a recipe reads the same way wherever it runs. */
 const ParserSchema = z.discriminatedUnion("format", [
@@ -675,7 +675,7 @@ const RecipeSchema = z.discriminatedUnion("status", [z.object({
 	status: z.literal("not-fetchable"),
 	reason: z.string().min(1)
 }).strict()]);
-/** The twindex crosswalk from the native shape to the category target: the document inline, or a `.json` file path relative to the catalogue root, so entries that share a native shape share one crosswalk. */
+/** The crossmap crosswalk from the native shape to the category target: the document inline, or a `.json` file path relative to the catalogue root, so entries that share a native shape share one crosswalk. */
 const CrosswalkReferenceSchema = z.union([CrosswalkSchema, z.object({ file: RelativePathSchema.refine((path) => path.endsWith(".json"), { message: "must name a .json file" }) }).strict()]);
 /** The meta keys a fetched result takes from the entry's own descriptor, which its `properties` therefore may not also set. */
 const RESERVED_META_KEYS = ["id", "name"];
@@ -819,7 +819,7 @@ function parseManifest(doc) {
 //#endregion
 //#region src/catalogue.ts
 /**
-* A catalogue index: the manifest, every entry, and every crosswalk file of the catalogue, keyed by its catalogue-relative path. The build assembles it from a catalogue directory; a consumer holding its own catalogue (a fork, say) can pass one to `createCatalogue`. Entry ids are unique, every fully qualified name (the whole path of an id or alias) identifies one entry and is not another entry's id, every namespace segment the manifest gives aliases to is some entry's segment and no alias is itself one, every crosswalk passes twindex's structural validation, every crosswalk file reference resolves, and every crosswalk's target is the category of each entry that uses it.
+* A catalogue index: the manifest, every entry, and every crosswalk file of the catalogue, keyed by its catalogue-relative path. The build assembles it from a catalogue directory; a consumer holding its own catalogue (a fork, say) can pass one to `createCatalogue`. Entry ids are unique, no two entries have the same name once case and surrounding or repeated spaces are ignored (a listing would show two rows a reader cannot tell apart), every fully qualified name (the whole path of an id or alias) identifies one entry and is not another entry's id, every namespace segment the manifest gives aliases to is some entry's segment and no alias is itself one, every crosswalk passes crossmap's structural validation, every crosswalk file reference resolves, and every crosswalk's target is the category of each entry that uses it.
 */
 const CatalogueIndexSchema = define(z.object({
 	manifest: ManifestSchema,
@@ -855,7 +855,20 @@ const CatalogueIndexSchema = define(z.object({
 	const seen = /* @__PURE__ */ new Set();
 	const ids = new Set(index.entries.map((entry) => entry.id));
 	const owners = /* @__PURE__ */ new Map();
+	const namers = /* @__PURE__ */ new Map();
 	for (const [position, entry] of index.entries.entries()) {
+		const listed = entry.name.trim().replace(/\s+/g, " ").toLowerCase();
+		const namer = namers.get(listed);
+		if (namer === void 0) namers.set(listed, entry.id);
+		else if (namer !== entry.id) ctx.addIssue({
+			code: "custom",
+			path: [
+				"entries",
+				position,
+				"name"
+			],
+			message: `${entry.name} is also the name of entry ${namer}, so a listing would show the two alike; name the source or variant that tells them apart`
+		});
 		if (seen.has(entry.id)) ctx.addIssue({
 			code: "custom",
 			path: [
@@ -1041,7 +1054,7 @@ var catalogue_default = {
 		"id": "keepset",
 		"name": "keepset",
 		"description": "The keepset catalogue: datasets with machine-readable recipes that fetch each one and normalise it into its category's target shape.",
-		"version": "1.21.0",
+		"version": "1.22.0",
 		"repository": "https://github.com/Mearman/keepset",
 		"namespaceAliases": {
 			"networkrepository": ["nr"],
@@ -1588,6 +1601,7 @@ var catalogue_default = {
 			"namespace": ["amazon"],
 			"aliases": ["last-mile-routing-2021"],
 			"name": "Amazon Last Mile Routing Research Challenge 2021",
+			"description": "Historical routes driven by Amazon delivery drivers in five US metropolitan areas, with route, stop and package level features and the sequence each driver actually followed. Released for the 2021 Amazon Last Mile Routing Research Challenge with identifiers regenerated and locations obfuscated.",
 			"domain": "Last-mile logistics",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -1607,7 +1621,10 @@ var catalogue_default = {
 				"kind": "spdx",
 				"id": "CC-BY-NC-4.0"
 			},
-			"citations": [],
+			"citations": [{
+				"text": "D. Merchan, J. Arora, J. Pachon, K. Konduri, M. Winkenbach, S. Parks, J. Noszek (2024). 2021 Amazon Last Mile Routing Research Challenge: Data set. Transportation Science 58(1), 8-11.",
+				"doi": "10.1287/trsc.2022.1173"
+			}],
 			"recipe": {
 				"status": "not-fetchable",
 				"reason": "The data is large nested JSON with bare NaN tokens, the largest file is 1.8 GB, and keepset has no JSON parser for it."
@@ -1837,7 +1854,7 @@ var catalogue_default = {
 			"id": "arenas-celegans-metabolic",
 			"namespace": ["arenas"],
 			"aliases": ["celegans-metabolic"],
-			"name": "C. elegans Metabolic Network",
+			"name": "C. elegans Metabolic Network (Arenas)",
 			"description": "Metabolic network of the nematode C. elegans.",
 			"tags": [],
 			"category": "graph/v1",
@@ -3157,6 +3174,7 @@ var catalogue_default = {
 			"namespace": ["camden"],
 			"aliases": ["hmo-licensing-register-duplicate"],
 			"name": "HMO licensing register (Camden, duplicate entry)",
+			"description": "The Camden houses in multiple occupation licensing register, listed a second time by the survey under the portal's root URL. The entry for the register itself holds the recipe.",
 			"domain": "Case records",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -3603,6 +3621,7 @@ var catalogue_default = {
 			"namespace": ["chicago"],
 			"aliases": ["ordinance-violations"],
 			"name": "Ordinance violations (Chicago Department of Administrative Hearings)",
+			"description": "Ordinance violations brought before the Chicago Department of Administrative Hearings, one row per violation, with the most recent hearing date and the case disposition. Violations heard by the Circuit Court of Cook County are not included.",
 			"domain": "Case records",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -4974,6 +4993,7 @@ var catalogue_default = {
 			"namespace": ["cqc"],
 			"aliases": ["care-directory"],
 			"name": "CQC care directory (England)",
+			"description": "The Care Quality Commission's list of the places in England where care is regulated, covering hospitals, care homes, GPs, dentists and home care agencies, with their addresses and postcodes. It is published as a spreadsheet that the commission updates regularly.",
 			"domain": "Technician and home-care routing",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -5656,6 +5676,7 @@ var catalogue_default = {
 			"namespace": ["defra"],
 			"aliases": ["historic-flood-warnings"],
 			"name": "Historic Flood Warnings (England)",
+			"description": "Every severe flood warning, flood warning and flood alert the Environment Agency has issued for flooding from rivers, the sea and some groundwater sites since the warning system began in January 2006.",
 			"domain": "Civic and environmental monitoring",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -6117,6 +6138,7 @@ var catalogue_default = {
 			"namespace": ["elsevier"],
 			"aliases": ["ev-hhcrsp-multi-period"],
 			"name": "EV home health care routing, multi-period variant",
+			"description": "Instances for the multi-period electric vehicle home health care routing and scheduling problem with uncertain travel times and service durations, from Yin et al. in Omega. The publisher's page refuses automated requests, so this rests on the survey item and the article's metadata.",
 			"domain": "Technician and home-care routing",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -6133,7 +6155,10 @@ var catalogue_default = {
 				"status": "live"
 			}],
 			"licence": { "kind": "unrecorded" },
-			"citations": [],
+			"citations": [{
+				"text": "Y. Yin, X. Liu, L. Qing, H. Qiu, X. Wei (2026). An exact solution approach for the multi-period EV home health care routing and scheduling problem with uncertain travel times and service durations. Omega 144, 103587.",
+				"doi": "10.1016/j.omega.2026.103587"
+			}],
 			"recipe": {
 				"status": "not-fetchable",
 				"reason": "The survey URL is a journal article DOI and no dataset download was found."
@@ -6570,6 +6595,7 @@ var catalogue_default = {
 			"namespace": ["fema"],
 			"aliases": ["nfip-redacted-claims"],
 			"name": "FEMA NFIP redacted claims",
+			"description": "Flood insurance claim transactions of the National Flood Insurance Program, redacted to protect policyholders' personal information, with claim dates, rounded locations and amounts paid. FEMA publishes it through the OpenFEMA API.",
 			"domain": "Claims and unclaimed money",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -6892,6 +6918,7 @@ var catalogue_default = {
 			"namespace": ["france-sdes"],
 			"aliases": ["sitadel-housing-permits-ile-de-france"],
 			"name": "Sitadel housing permits (Ile-de-France)",
+			"description": "Building permits and prior declarations from the national Sitadel database that create, transform or demolish dwellings in Ile-de-France, published by the regional environment and transport directorate as a point shapefile.",
 			"domain": "Case records",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -7147,6 +7174,7 @@ var catalogue_default = {
 			"namespace": ["github-afkummer"],
 			"aliases": ["hhcrsp-curated-instances"],
 			"name": "HHCRSP curated instances (Kummer, 2021)",
+			"description": "Instances for the daily home health care routing and scheduling problem with several service types, multiple visits and route interdependence, generated on OpenAddresses data for Porto Alegre, with lower and upper bounds and a curated selection of hard and random instances for each size.",
 			"domain": "Technician and home-care routing",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -7163,7 +7191,13 @@ var catalogue_default = {
 				"status": "live"
 			}],
 			"licence": { "kind": "unrecorded" },
-			"citations": [],
+			"citations": [{
+				"text": "D. S. Mankowska, F. Meisel, C. Bierwirth (2014). The home health care routing and scheduling problem with interdependent services. Health Care Management Science 17(1), 15-30.",
+				"doi": "10.1007/s10729-013-9243-1"
+			}, {
+				"text": "C. S. Sartori, L. S. Buriol (2020). OVIG, the instance generator the dataset's instances were generated with.",
+				"url": "https://github.com/cssartori/ovig"
+			}],
 			"recipe": {
 				"status": "not-fetchable",
 				"reason": "The instances are keyword format text files with node positions, time windows, service durations and a travel time matrix, but the repository holds them as a very large number of separate files in size directories and publishes no archive of the curated selection, so a recipe has no single download to read; the repository's own archive holds every instance and is several gigabytes."
@@ -7177,6 +7211,7 @@ var catalogue_default = {
 			"namespace": ["github-bascoding"],
 			"aliases": ["verolog-2019"],
 			"name": "VeRoLog 2019 machine delivery and installation instances",
+			"description": "A student repository holding the instances ORTEC published for the VeRoLog Solver Challenge 2019, in which trucks deliver machines to customers and technicians then install them within a window of days.",
 			"domain": "Technician and home-care routing",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -7274,6 +7309,7 @@ var catalogue_default = {
 			"namespace": ["github-meituan"],
 			"aliases": ["informs-tsl-dispatch-waybill"],
 			"name": "Meituan-INFORMS-TSL research challenge dataset",
+			"description": "Operational data from Meituan's on-demand food delivery platform for the 2025 INFORMS TSL Data-Driven Research Challenge, covering orders, couriers and merchants, with the waybill and wave records of how orders were dispatched.",
 			"domain": "Last-mile logistics",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -7293,7 +7329,10 @@ var catalogue_default = {
 				"kind": "spdx",
 				"id": "CC-BY-NC-4.0"
 			},
-			"citations": [],
+			"citations": [{
+				"text": "H. Wang, L. Zhao, K. Yan, X. Wang, Y. Liang, J. Hao (2025). Meituan: Operational-level on-demand food delivery data for the 2025 INFORMS TSL Data-Driven Research Challenge.",
+				"url": "https://github.com/meituan/Meituan-INFORMS-TSL-Research-Challenge"
+			}],
 			"recipe": {
 				"status": "not-fetchable",
 				"reason": "The data is released under CC BY-NC 4.0 with a bar on passing it to third parties without permission, and its coordinates are shifted by the publisher, so they are not WGS84 positions."
@@ -7322,7 +7361,10 @@ var catalogue_default = {
 				"status": "live"
 			}],
 			"licence": { "kind": "unrecorded" },
-			"citations": [],
+			"citations": [{
+				"text": "B. Singh, L. Oberfichtner, S. Ivliev (2023). Heuristics for a cash-collection routing problem with a cluster-first route-second approach. Annals of Operations Research 322(1), 413-440.",
+				"doi": "10.1007/s10479-022-04883-1"
+			}],
 			"recipe": {
 				"status": "not-fetchable",
 				"reason": "The only data file is an old binary xls workbook, and keepset reads only xlsx."
@@ -7359,7 +7401,10 @@ var catalogue_default = {
 				"kind": "spdx",
 				"id": "GPL-2.0-only"
 			},
-			"citations": [],
+			"citations": [{
+				"text": "J. Castro-Gutierrez, D. Landa-Silva, J. Moreno Perez (2011). Nature of real-world multi-objective vehicle routing with evolutionary algorithms. 2011 IEEE International Conference on Systems, Man, and Cybernetics, 257-264.",
+				"doi": "10.1109/ICSMC.2011.6083675"
+			}],
 			"recipe": {
 				"status": "fetchable",
 				"source": 1,
@@ -7839,7 +7884,11 @@ var catalogue_default = {
 				"kind": "spdx",
 				"id": "Apache-2.0"
 			},
-			"citations": [],
+			"citations": [{
+				"text": "L. Wu et al. (2023). LaDe: The first comprehensive last-mile delivery dataset from industry. arXiv:2306.10675.",
+				"doi": "10.48550/arXiv.2306.10675",
+				"url": "https://arxiv.org/abs/2306.10675"
+			}],
 			"recipe": {
 				"status": "fetchable",
 				"source": 1,
@@ -8803,7 +8852,20 @@ var catalogue_default = {
 				"status": "live"
 			}],
 			"licence": { "kind": "unrecorded" },
-			"citations": [],
+			"citations": [
+				{
+					"text": "T. Tsiligirides (1984). Heuristic methods applied to orienteering. Journal of the Operational Research Society 35(9), 797-809.",
+					"doi": "10.1057/jors.1984.162"
+				},
+				{
+					"text": "I.-M. Chao, B. L. Golden, E. A. Wasil (1996). The team orienteering problem. European Journal of Operational Research 88(3), 464-474.",
+					"doi": "10.1016/0377-2217(94)00289-4"
+				},
+				{
+					"text": "I.-M. Chao, B. L. Golden, E. A. Wasil (1996). A fast and effective heuristic for the orienteering problem. European Journal of Operational Research 88(3), 475-489.",
+					"doi": "10.1016/0377-2217(95)00035-6"
+				}
+			],
 			"recipe": {
 				"status": "fetchable",
 				"source": 1,
@@ -8882,7 +8944,10 @@ var catalogue_default = {
 				"status": "live"
 			}],
 			"licence": { "kind": "unrecorded" },
-			"citations": [],
+			"citations": [{ "text": "G. Righini, M. Salani (2006). Dynamic programming for the orienteering problem with time windows. Technical Report 91, Dipartimento di Tecnologie dell'Informazione, Universita degli Studi di Milano, Crema." }, {
+				"text": "G. Righini, M. Salani (2008). New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3), 155-170.",
+				"doi": "10.1002/net.20212"
+			}],
 			"recipe": {
 				"status": "fetchable",
 				"source": 1,
@@ -9011,7 +9076,10 @@ var catalogue_default = {
 				"status": "live"
 			}],
 			"licence": { "kind": "unrecorded" },
-			"citations": [],
+			"citations": [{
+				"text": "M. M. Solomon (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35(2), 254-265.",
+				"doi": "10.1287/opre.35.2.254"
+			}],
 			"recipe": {
 				"status": "fetchable",
 				"source": 1,
@@ -9762,6 +9830,7 @@ var catalogue_default = {
 			"namespace": ["louisville-metro"],
 			"aliases": ["property-maintenance-violations"],
 			"name": "Property maintenance inspection violations (Louisville)",
+			"description": "Property maintenance site visits in Louisville Metro with the violations cited, published by Codes and Regulations as a feature layer that covers the last 30 days and is updated daily.",
 			"domain": "Case records",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -10173,6 +10242,7 @@ var catalogue_default = {
 			"namespace": ["mendeley-data"],
 			"aliases": ["concrete-delivery-problem"],
 			"name": "Concrete delivery problem operational data",
+			"description": "Daily concrete orders from construction sites in Quebec, supplied by a concrete producer and processed into instances for the concrete delivery problem, with client and site information anonymised.",
 			"domain": "Technician and home-care routing",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -10193,7 +10263,10 @@ var catalogue_default = {
 				"kind": "spdx",
 				"id": "CC-BY-4.0"
 			},
-			"citations": [],
+			"citations": [{
+				"text": "A. Tzanetos, M. Blondin (2023). Real operational data for the concrete delivery problem. Data in Brief 48, 109189.",
+				"doi": "10.1016/j.dib.2023.109189"
+			}],
 			"recipe": {
 				"status": "not-fetchable",
 				"reason": "The downloads are MATLAB data files and keepset has no parser for them."
@@ -10233,7 +10306,10 @@ var catalogue_default = {
 				"kind": "spdx",
 				"id": "CC-BY-4.0"
 			},
-			"citations": [],
+			"citations": [{
+				"text": "O. Demiray, E. Yucel, D. Tolga (2026). DWSRP-TW-SC Datasets. Mendeley Data, V1.",
+				"doi": "10.17632/dbsf73xpg5.1"
+			}],
 			"recipe": {
 				"status": "not-fetchable",
 				"reason": "The download is hundreds of small Excel workbooks whose task sheets have no coordinates (places exist only as distance matrices) and whose file names repeat across folders, so no recipe can name one table."
@@ -10247,6 +10323,7 @@ var catalogue_default = {
 			"namespace": ["mendeley-data"],
 			"aliases": ["dynamic-team-orienteering"],
 			"name": "Dynamic team orienteering problem",
+			"description": "Mendeley Data deposit for the dynamic team orienteering problem of Kirac, Milburn and Gedik, described as benchmark instances adapted from the Chao et al. team orienteering instances at weak, moderate and high dynamism.",
 			"domain": "Orienteering",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -10265,7 +10342,13 @@ var catalogue_default = {
 				"kind": "spdx",
 				"id": "CC-BY-4.0"
 			},
-			"citations": [],
+			"citations": [{
+				"text": "E. Kirac, A. B. Milburn, R. Gedik (2025). The dynamic team orienteering problem. European Journal of Operational Research 324(1), 22-39.",
+				"doi": "10.1016/j.ejor.2025.01.009"
+			}, {
+				"text": "E. Kirac (2025). Dynamic Team Orienteering Problem (DTOP) Benchmark Instances. Mendeley Data, V1.",
+				"doi": "10.17632/xnf6c4d5gt.1"
+			}],
 			"recipe": {
 				"status": "not-fetchable",
 				"reason": "The only file is an Excel workbook of aggregate results per solved instance, with no row for a place or a task, so there are no nodes to map."
@@ -10279,6 +10362,7 @@ var catalogue_default = {
 			"namespace": ["mendeley-data"],
 			"aliases": ["fmucd"],
 			"name": "Facility Management Unified Classification Database",
+			"description": "Building maintenance work orders from twelve North American universities, classified by the Facility Management Unified Classification Code and joined to the building, its systems and the weather, for planned preventive and unplanned maintenance.",
 			"domain": "Technician and home-care routing",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -10302,7 +10386,10 @@ var catalogue_default = {
 				"kind": "spdx",
 				"id": "CC-BY-4.0"
 			},
-			"citations": [],
+			"citations": [{
+				"text": "A. K. Pampana, J. Jeon, S. Yoon, T. J. Weidner (2024). Comprehensive maintenance dataset of building facilities for planned preventive and unplanned maintenance in North American universities. Data in Brief 57, 110845.",
+				"doi": "10.1016/j.dib.2024.110845"
+			}],
 			"recipe": {
 				"status": "fetchable",
 				"source": 1,
@@ -10352,6 +10439,7 @@ var catalogue_default = {
 			"namespace": ["mendeley-data"],
 			"aliases": ["hhcrsp-multi-window"],
 			"name": "Home health care routing, multi-window variant",
+			"description": "Random instances for the home health care routing and scheduling problem with multiple time windows and multiple synchronised services, generated from the benchmark instances of Mankowska et al.",
 			"domain": "Technician and home-care routing",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -10371,7 +10459,13 @@ var catalogue_default = {
 				"kind": "spdx",
 				"id": "CC-BY-4.0"
 			},
-			"citations": [],
+			"citations": [{
+				"text": "M. Bazirha (2020). Data for: Home health care routing and scheduling problem with multiple time windows and multiple synchronized services. Mendeley Data, V1.",
+				"doi": "10.17632/hp3xftsrfx.1"
+			}, {
+				"text": "D. S. Mankowska, F. Meisel, C. Bierwirth (2014). The home health care routing and scheduling problem with interdependent services. Health Care Management Science 17(1), 15-30.",
+				"doi": "10.1007/s10729-013-9243-1"
+			}],
 			"recipe": {
 				"status": "not-fetchable",
 				"reason": "The download is a RAR archive of macro enabled Excel workbooks, and keepset reads neither RAR archives nor macro workbooks."
@@ -10407,7 +10501,10 @@ var catalogue_default = {
 				"kind": "spdx",
 				"id": "CC-BY-4.0"
 			},
-			"citations": [],
+			"citations": [{
+				"text": "A. Konovalenko, L. M. Hvattum, K. A. H. Iversen (2026). Data describing planned routes and driven routes from a last-mile delivery vehicle routing problem. Data in Brief 66, 112744.",
+				"doi": "10.1016/j.dib.2026.112744"
+			}],
 			"recipe": {
 				"status": "not-fetchable",
 				"reason": "The only file is an Excel workbook with a row per stop visit of a route that holds minute offsets and distances between stops and no location, so the only node field it could fill is a time window and a fetch would carry no place."
@@ -10441,7 +10538,10 @@ var catalogue_default = {
 				"kind": "spdx",
 				"id": "CC-BY-4.0"
 			},
-			"citations": [],
+			"citations": [{
+				"text": "Y. Feyman, A. Legler, K. N. Griffith (2021). Appointment wait time data for primary & specialty care in Veterans Health Administration facilities vs. community medical centers. Data in Brief 36, 107134.",
+				"doi": "10.1016/j.dib.2021.107134"
+			}],
 			"recipe": {
 				"status": "not-fetchable",
 				"reason": "The county-level file has 14,365,643 rows, so even the id alone passes the importer's cell limit (a mapped column would hold twice that many cells), and 8,264 of its rows have unquoted commas in the state and county names of the armed forces entries, which the csv-table parser refuses at line 1892."
@@ -11642,7 +11742,7 @@ var catalogue_default = {
 			"id": "netzschleuder-celegans-metabolic",
 			"namespace": ["netzschleuder"],
 			"aliases": ["celegans-metabolic"],
-			"name": "C. elegans Metabolic Network",
+			"name": "C. elegans Metabolic Network (Netzschleuder)",
 			"description": "Undirected metabolic network of C. elegans. Nodes are metabolites/enzymes. Multiple edges and self-loops present. Heterogeneous with named vertices and structural attributes.",
 			"domain": "Biological network",
 			"tags": ["unweighted"],
@@ -12269,7 +12369,7 @@ var catalogue_default = {
 			"id": "netzschleuder-florentine_families",
 			"namespace": ["netzschleuder"],
 			"aliases": ["florentine_families"],
-			"name": "Padgett Florentine families",
+			"name": "Padgett Florentine Families (Netzschleuder)",
 			"description": "Multiplex network with 2 edge types representing marriage alliances and business relationships between Florentine families during the Italian Renaissance.  Data hosted by Manlio De Domenico.[^icon]\n[^icon]: Description obtained from the [ICON](https://icon.colorado.edu) project.",
 			"tags": [],
 			"category": "graph/v1",
@@ -16645,6 +16745,7 @@ var catalogue_default = {
 			"namespace": ["nyc-open-data"],
 			"aliases": ["housing-maintenance-code-violations"],
 			"name": "Housing maintenance code violations (NYC HPD)",
+			"description": "Violations the New York City Department of Housing Preservation and Development has issued against rental dwellings and buildings under the Housing Maintenance Code and the Multiple Dwelling Law, one row per violation, in four classes of hazard.",
 			"domain": "Case records",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -16825,6 +16926,7 @@ var catalogue_default = {
 			"namespace": ["nyc-open-data"],
 			"aliases": ["oath-hearings-case-status"],
 			"name": "OATH hearings division case status (NYC)",
+			"description": "Summonses for public safety and quality of life violations filed and adjudicated at New York City's Office of Administrative Trials and Hearings, with the infraction charged, the decision, payments and amounts.",
 			"domain": "Case records",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -17338,6 +17440,7 @@ var catalogue_default = {
 			"namespace": ["ortec"],
 			"aliases": ["verolog-2016-2017-instances"],
 			"name": "VeRoLog 2016-2017 scarce-equipment pickup and delivery instances",
+			"description": "Instances for the ORTEC VeRoLog Solver Challenge of 2016 to 2017, a routing problem that redistributes scarce equipment between customers within time windows, released in sets from the early test instances to the hidden ones.",
 			"domain": "Technician and home-care routing",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -17353,7 +17456,10 @@ var catalogue_default = {
 				"status": "live"
 			}],
 			"licence": { "kind": "unrecorded" },
-			"citations": [],
+			"citations": [{
+				"text": "A. Kheiri, A. G. Dragomir, D. Mueller, J. Gromicho, C. Jagtenberg, J. J. van Hoorn (2019). Tackling a VRP challenge to redistribute scarce equipment within time windows using metaheuristic algorithms. EURO Journal on Transportation and Logistics 8(5), 561-595.",
+				"doi": "10.1007/s13676-019-00143-8"
+			}],
 			"recipe": {
 				"status": "not-fetchable",
 				"reason": "The instances are keyword format text files that the Wayback Machine serves one at a time, as the archive zips of each set were not captured, and a recipe reads one download, so no recipe reaches the collection."
@@ -17367,6 +17473,7 @@ var catalogue_default = {
 			"namespace": ["overheid-nl"],
 			"aliases": ["gemeenteblad-omgevingsvergunning"],
 			"name": "Official publications of environmental permit notices (Netherlands)",
+			"description": "Notices about environmental permits that Dutch municipalities publish in their Gemeenteblad, served as XML records by the SRU search interface of the government's official publications repository.",
 			"domain": "Case records",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -21456,6 +21563,7 @@ var catalogue_default = {
 			"namespace": ["queensland-government"],
 			"aliases": ["unclaimed-monies"],
 			"name": "Unclaimed monies (Queensland)",
+			"description": "The Public Trustee of Queensland's register of unclaimed money from deceased estates and from other sources, with the owner, the amount and the postcode.",
 			"domain": "Claims and unclaimed money",
 			"subjects": ["operations-research"],
 			"tags": ["prize", "territory"],
@@ -55667,7 +55775,7 @@ var catalogue_default = {
 			"id": "ucinet-padgett",
 			"namespace": ["ucinet"],
 			"aliases": ["padgett"],
-			"name": "Padgett Florentine Families",
+			"name": "Padgett Florentine Families (UCINET)",
 			"description": "Business and marriage ties among Renaissance Florentine families. The Medici vs Strozzi conflict.",
 			"tags": [],
 			"category": "graph/v1",
@@ -56519,7 +56627,10 @@ var catalogue_default = {
 				"status": "live"
 			}],
 			"licence": { "kind": "unrecorded" },
-			"citations": [],
+			"citations": [{
+				"text": "E. Angelelli, C. Archetti, M. Vindigni (2014). The clustered orienteering problem. European Journal of Operational Research 238(2), 404-414.",
+				"doi": "10.1016/j.ejor.2014.04.006"
+			}],
 			"recipe": {
 				"status": "fetchable",
 				"source": 1,
@@ -56605,7 +56716,10 @@ var catalogue_default = {
 				"status": "live"
 			}],
 			"licence": { "kind": "unrecorded" },
-			"citations": [],
+			"citations": [{
+				"text": "N. Cabrera, J.-F. Cordeau, J. E. Mendoza (2022). The doubly open park-and-loop routing problem. Computers & Operations Research 143, 105761.",
+				"doi": "10.1016/j.cor.2022.105761"
+			}],
 			"recipe": {
 				"status": "fetchable",
 				"source": 1,
@@ -56683,6 +56797,7 @@ var catalogue_default = {
 			"namespace": ["vrp-rep"],
 			"aliases": ["probabilistic-orienteering"],
 			"name": "Probabilistic orienteering problem",
+			"description": "Instances for the probabilistic orienteering problem, in which each customer is present only with a given probability, from Angelelli, Archetti, Filippi and Vindigni, distributed through VRP-REP.",
 			"domain": "Orienteering",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -56702,7 +56817,10 @@ var catalogue_default = {
 				"status": "live"
 			}],
 			"licence": { "kind": "unrecorded" },
-			"citations": [],
+			"citations": [{
+				"text": "E. Angelelli, C. Archetti, C. Filippi, M. Vindigni (2017). The probabilistic orienteering problem. Computers & Operations Research 81, 269-281.",
+				"doi": "10.1016/j.cor.2016.12.025"
+			}],
 			"recipe": {
 				"status": "fetchable",
 				"source": 1,
@@ -56774,6 +56892,7 @@ var catalogue_default = {
 			"namespace": ["vrp-rep"],
 			"aliases": ["technician-routing-pillac"],
 			"name": "Technician routing and scheduling problem (Pillac et al.)",
+			"description": "Technician routing and scheduling instances from Pillac, Gueret and Medaglia, with node coordinates and the skills a technician must cover, distributed through VRP-REP.",
 			"domain": "Technician and home-care routing",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -56794,7 +56913,10 @@ var catalogue_default = {
 				"status": "live"
 			}],
 			"licence": { "kind": "unrecorded" },
-			"citations": [],
+			"citations": [{
+				"text": "V. Pillac, C. Gueret, A. L. Medaglia (2013). A parallel matheuristic for the technician routing and scheduling problem. Optimization Letters 7(7), 1525-1535.",
+				"doi": "10.1007/s11590-012-0567-4"
+			}],
 			"recipe": {
 				"status": "fetchable",
 				"source": 1,
@@ -57914,7 +58036,10 @@ var catalogue_default = {
 				"kind": "spdx",
 				"id": "CC-BY-4.0"
 			},
-			"citations": [],
+			"citations": [{
+				"text": "D. Sinha Roy, C. Defryn, B. Golden, E. Wasil (2022). Data-driven optimization and statistical modeling to improve meter reading for utility companies. Computers & Operations Research 145, 105844.",
+				"doi": "10.1016/j.cor.2022.105844"
+			}],
 			"recipe": {
 				"status": "fetchable",
 				"source": 1,
@@ -57985,7 +58110,10 @@ var catalogue_default = {
 				"kind": "spdx",
 				"id": "CC-BY-4.0"
 			},
-			"citations": [],
+			"citations": [{
+				"text": "A. Vrani, S. D. Apostolidis, A. C. Kapoutsis, E. B. Kosmatopoulos (2025). Delivering data: A real-world dataset for last-mile delivery optimization. Data in Brief 61, 111762.",
+				"doi": "10.1016/j.dib.2025.111762"
+			}],
 			"recipe": {
 				"status": "not-fetchable",
 				"reason": "The download is a zip of Excel workbooks that hold distance and time matrices only, so there are no nodes to map, and keepset reads a sheet of a workbook, not a workbook inside a zip."
@@ -57999,6 +58127,7 @@ var catalogue_default = {
 			"namespace": ["zenodo"],
 			"aliases": ["tdc-technician-dispatch"],
 			"name": "Technician dispatch data (Mathlouthi, Gendreau and Potvin)",
+			"description": "Instance sets and raw results for the technician routing and scheduling problem of Gamst and Pisinger, including the instances of Mathlouthi, Gendreau and Potvin and a further technician dispatch set called TDCData.",
 			"domain": "Technician and home-care routing",
 			"subjects": ["operations-research"],
 			"tags": [
@@ -58021,7 +58150,10 @@ var catalogue_default = {
 				"kind": "spdx",
 				"id": "CC-BY-4.0"
 			},
-			"citations": [],
+			"citations": [{
+				"text": "M. Gamst, D. Pisinger (2024). Decision support for the technician routing and scheduling problem. Networks 83(1), 169-196.",
+				"doi": "10.1002/net.22188"
+			}],
 			"recipe": {
 				"status": "not-fetchable",
 				"reason": "The instances are a custom sectioned text format whose tasks have no positions, and the collection is hundreds of megabytes compressed, almost all of it a pairwise travel time matrix that tasks/v1 has no arcs to hold, so reading it would hold gigabytes in memory to keep a few fields per task."

package/dist/{categories-DC0uTkzn.d.ts → categories-DepJEi4o.d.ts}

@@ -1,4 +1,4 @@
-import { Crosswalk } from "twindex";
+import { Crosswalk } from "crossmap";
 import { z } from "zod";
 //#region src/entry.d.ts
 /** A stable identifier: an entry id, a catalogue id. It starts with a letter or digit, so no id can be `__proto__` or any other name that begins with an underscore. Entry ids stay the same across forks, which is what lets two catalogues be compared entry by entry. */
@@ -131,7 +131,7 @@ type DocumentArchive = Exclude<Archive, {
 }>;
 /** An archive that gives every file a collection is read from. */
 type CollectionArchive = z.infer<typeof CollectionArchiveSchema>;
-/** A column of a table as the table parser names it: the header with every run of characters outside letters, digits and underscore replaced by one underscore, so it is a valid segment of a twindex path. */
+/** A column of a table as the table parser names it: the header with every run of characters outside letters, digits and underscore replaced by one underscore, so it is a valid segment of a crossmap path. */
 declare const ColumnNameSchema: z.ZodString;
 /** The parser that reads the unpacked file into the dataset's native JSON shape, with the options that format needs. Every option is stated in the entry, so a recipe reads the same way wherever it runs. */
 declare const ParserSchema: z.ZodDiscriminatedUnion<[z.ZodObject<{
@@ -393,9 +393,9 @@ declare const RecipeSchema: z.ZodDiscriminatedUnion<[z.ZodObject<{
   reason: z.ZodString;
 }, z.core.$strict>], "status">;
 type Recipe = z.infer<typeof RecipeSchema>;
-/** The twindex crosswalk from the native shape to the category target: the document inline, or a `.json` file path relative to the catalogue root, so entries that share a native shape share one crosswalk. */
-declare const CrosswalkReferenceSchema: z.ZodUnion<readonly [z.ZodType<import("twindex").Crosswalk, unknown, z.core.$ZodTypeInternals<import("twindex").Crosswalk, unknown>> & {
-  is: (value: unknown) => value is import("twindex").Crosswalk;
+/** The crossmap crosswalk from the native shape to the category target: the document inline, or a `.json` file path relative to the catalogue root, so entries that share a native shape share one crosswalk. */
+declare const CrosswalkReferenceSchema: z.ZodUnion<readonly [z.ZodType<import("crossmap").Crosswalk, unknown, z.core.$ZodTypeInternals<import("crossmap").Crosswalk, unknown>> & {
+  is: (value: unknown) => value is import("crossmap").Crosswalk;
 }, z.ZodObject<{
   file: z.ZodString;
 }, z.core.$strict>]>;
@@ -600,8 +600,8 @@ declare const EntrySchema: z.ZodObject<{
     status: z.ZodLiteral<"not-fetchable">;
     reason: z.ZodString;
   }, z.core.$strict>], "status">;
-  crosswalk: z.ZodUnion<readonly [z.ZodType<import("twindex").Crosswalk, unknown, z.core.$ZodTypeInternals<import("twindex").Crosswalk, unknown>> & {
-    is: (value: unknown) => value is import("twindex").Crosswalk;
+  crosswalk: z.ZodUnion<readonly [z.ZodType<import("crossmap").Crosswalk, unknown, z.core.$ZodTypeInternals<import("crossmap").Crosswalk, unknown>> & {
+    is: (value: unknown) => value is import("crossmap").Crosswalk;
   }, z.ZodObject<{
     file: z.ZodString;
   }, z.core.$strict>]>;
@@ -744,7 +744,7 @@ declare const EntrySchema: z.ZodObject<{
       status: "not-fetchable";
       reason: string;
     };
-    crosswalk: import("twindex").Crosswalk | {
+    crosswalk: import("crossmap").Crosswalk | {
       file: string;
     };
     expectedCounts: Record<string, number>;
@@ -816,7 +816,7 @@ declare function parseManifest(doc: unknown): Manifest;
 //#endregion
 //#region src/catalogue.d.ts
 /**
- * A catalogue index: the manifest, every entry, and every crosswalk file of the catalogue, keyed by its catalogue-relative path. The build assembles it from a catalogue directory; a consumer holding its own catalogue (a fork, say) can pass one to `createCatalogue`. Entry ids are unique, every fully qualified name (the whole path of an id or alias) identifies one entry and is not another entry's id, every namespace segment the manifest gives aliases to is some entry's segment and no alias is itself one, every crosswalk passes twindex's structural validation, every crosswalk file reference resolves, and every crosswalk's target is the category of each entry that uses it.
+ * A catalogue index: the manifest, every entry, and every crosswalk file of the catalogue, keyed by its catalogue-relative path. The build assembles it from a catalogue directory; a consumer holding its own catalogue (a fork, say) can pass one to `createCatalogue`. Entry ids are unique, no two entries have the same name once case and surrounding or repeated spaces are ignored (a listing would show two rows a reader cannot tell apart), every fully qualified name (the whole path of an id or alias) identifies one entry and is not another entry's id, every namespace segment the manifest gives aliases to is some entry's segment and no alias is itself one, every crosswalk passes crossmap's structural validation, every crosswalk file reference resolves, and every crosswalk's target is the category of each entry that uses it.
  */
 declare const CatalogueIndexSchema: z.ZodObject<{
   manifest: z.ZodObject<{
@@ -1498,7 +1498,7 @@ declare function collectionOf<Document extends object>(document: z.ZodType<Docum
 //#endregion
 //#region src/targets/tasks-v1.d.ts
 /**
- * A task: a place or case to visit or serve, such as a stop of a route or a case in a register, flat so a twindex crosswalk can map a table's columns onto it (a wildcard path must keep the same shape on both sides). The target fixes only what the datasets share and lets a crosswalk map any further column through under its own name, as graph/v1 does. `lat` and `lon` are WGS84 degrees and `x` and `y` are planar coordinates in the dataset's own system; `duration` and `travelTime` are seconds, `prize` is the dataset's own reward measure, and `prizeProbability` is the chance the reward is collected. `skill` and `territory` name what is needed to serve the node and where it sits, `status` is where it is in its lifecycle, and `opened`, `closed` and `deadline` are its lifecycle times as the source writes them, a deadline being a number where the source gives a time of day.
+ * A task: a place or case to visit or serve, such as a stop of a route or a case in a register, flat so a crossmap crosswalk can map a table's columns onto it (a wildcard path must keep the same shape on both sides). The target fixes only what the datasets share and lets a crosswalk map any further column through under its own name, as graph/v1 does. `lat` and `lon` are WGS84 degrees and `x` and `y` are planar coordinates in the dataset's own system; `duration` and `travelTime` are seconds, `prize` is the dataset's own reward measure, and `prizeProbability` is the chance the reward is collected. `skill` and `territory` name what is needed to serve the node and where it sits, `status` is where it is in its lifecycle, and `opened`, `closed` and `deadline` are its lifecycle times as the source writes them, a deadline being a number where the source gives a time of day.
  */
 declare const TaskSchema: z.ZodObject<{
   id: z.ZodString;

package/dist/index.d.ts

@@ -1,5 +1,5 @@
-import { $ as CrosswalkReference, A as Catalogue, B as ManifestSchema, C as JsonScalarSchema, Ct as waybackUrl, D as GraphNodeSchema, E as GraphNode, F as NamespaceNode, G as ArchiveMember, H as parseManifest, I as createCatalogue, J as Citation, K as ArchiveMemberSchema, L as Lineage, M as CatalogueIndexSchema, N as Dataset, O as GraphV1, P as DatasetQuery, Q as ColumnNameSchema, R as LineageSchema, S as JsonScalar, St as parseEntry, T as GraphEdgeSchema, U as AliasSchema, V as SemVerSchema, W as Archive, X as CollectionArchive, Y as CitationSchema, Z as CollectionArchiveSchema, _ as TasksV1, _t as SnapshotSchema, a as CategoryTargets, at as IdSchema, b as Instance, bt as SubjectSchema, c as countTarget, ct as Namespace, d as getCollectionTarget, dt as ParserSchema, et as CrosswalkReferenceSchema, f as getTarget, ft as RESERVED_META_KEYS, g as TaskSchema, gt as Snapshot, h as Task, ht as RelativePathSchema, i as CategoryTarget, it as HttpUrlSchema, j as CatalogueIndex, k as GraphV1Schema, l as countedKeys, lt as NamespaceSchema, m as listCategories, mt as RecipeSchema, n as CategoryId, nt as Entry, o as CollectionTarget, ot as Licence, p as kindOf, pt as Recipe, q as ArchiveSchema, r as CategoryIdSchema, rt as EntrySchema, s as CountedKey, st as LicenceSchema, t as Category, tt as DocumentArchive, u as getCategory, ut as Parser, v as TasksV1Schema, vt as Source, w as GraphEdge, x as collectionOf, xt as WaybackTimestampSchema, y as Collection, yt as SourceSchema, z as Manifest } from "./categories-DC0uTkzn.js";
-import { Crosswalk } from "twindex";
+import { $ as CrosswalkReference, A as Catalogue, B as ManifestSchema, C as JsonScalarSchema, Ct as waybackUrl, D as GraphNodeSchema, E as GraphNode, F as NamespaceNode, G as ArchiveMember, H as parseManifest, I as createCatalogue, J as Citation, K as ArchiveMemberSchema, L as Lineage, M as CatalogueIndexSchema, N as Dataset, O as GraphV1, P as DatasetQuery, Q as ColumnNameSchema, R as LineageSchema, S as JsonScalar, St as parseEntry, T as GraphEdgeSchema, U as AliasSchema, V as SemVerSchema, W as Archive, X as CollectionArchive, Y as CitationSchema, Z as CollectionArchiveSchema, _ as TasksV1, _t as SnapshotSchema, a as CategoryTargets, at as IdSchema, b as Instance, bt as SubjectSchema, c as countTarget, ct as Namespace, d as getCollectionTarget, dt as ParserSchema, et as CrosswalkReferenceSchema, f as getTarget, ft as RESERVED_META_KEYS, g as TaskSchema, gt as Snapshot, h as Task, ht as RelativePathSchema, i as CategoryTarget, it as HttpUrlSchema, j as CatalogueIndex, k as GraphV1Schema, l as countedKeys, lt as NamespaceSchema, m as listCategories, mt as RecipeSchema, n as CategoryId, nt as Entry, o as CollectionTarget, ot as Licence, p as kindOf, pt as Recipe, q as ArchiveSchema, r as CategoryIdSchema, rt as EntrySchema, s as CountedKey, st as LicenceSchema, t as Category, tt as DocumentArchive, u as getCategory, ut as Parser, v as TasksV1Schema, vt as Source, w as GraphEdge, x as collectionOf, xt as WaybackTimestampSchema, y as Collection, yt as SourceSchema, z as Manifest } from "./categories-DepJEi4o.js";
+import { Crosswalk } from "crossmap";
 //#region src/errors.d.ts
 /** The root of this package's error taxonomy: every error keepset throws is a `KeepsetError`, so callers can catch the family with one check. */
 export declare class KeepsetError extends Error {
@@ -111,7 +111,7 @@ export declare function serialise(doc: Entry | Manifest | Crosswalk): string;
 //#endregion
 //#region src/validate.d.ts
 /**
- * Checks a dataset as the catalogue holds it: the entry against the entry schema, and its crosswalk against twindex's structural validation and the entry's category. A catalogue index is checked the same way when it is built, so a bundled dataset is valid unless the package itself is broken; the check is what a contributor runs on an entry they are writing.
+ * Checks a dataset as the catalogue holds it: the entry against the entry schema, and its crosswalk against crossmap's structural validation and the entry's category. A catalogue index is checked the same way when it is built, so a bundled dataset is valid unless the package itself is broken; the check is what a contributor runs on an entry they are writing.
  * @param dataset - The dataset.
  * @returns Every issue found, with paths from the dataset's root (`entry.` or `crosswalk.`); empty when the dataset is valid.
  */

package/dist/index.js

@@ -1,5 +1,5 @@
-import { $ as ArchiveError, A as WaybackTimestampSchema, B as countedKeys, C as ParserSchema, D as SnapshotSchema, E as RelativePathSchema, F as groupsOf, G as listCategories, H as getCollectionTarget, I as namesOf, J as collectionOf, K as TaskSchema, M as toIssues, N as waybackUrl, O as SourceSchema, P as NAME_SEPARATOR, Q as JsonScalarSchema, R as CategoryIdSchema, S as NamespaceSchema, T as RecipeSchema, U as getTarget, V as getCategory, W as kindOf, X as GraphNodeSchema, Y as GraphEdgeSchema, Z as GraphV1Schema, _ as CrosswalkReferenceSchema, a as CatalogueIndexSchema, at as RecipeError, b as IdSchema, c as ManifestSchema, d as AliasSchema, et as CatalogueSyntaxError, f as ArchiveMemberSchema, g as ColumnNameSchema, h as CollectionArchiveSchema, i as listNamespaces, it as NativeParseError, j as parseEntry, k as SubjectSchema, l as SemVerSchema, m as CitationSchema, n as getManifest, nt as DatasetNotFoundError, o as createCatalogue, ot as UnknownCategoryError, p as ArchiveSchema, q as TasksV1Schema, r as listDatasets, rt as KeepsetError, s as LineageSchema, t as getDataset, tt as DatasetAmbiguousError, u as parseManifest, v as EntrySchema, w as RESERVED_META_KEYS, x as LicenceSchema, y as HttpUrlSchema, z as countTarget } from "./bundled-Ql23qj97.js";
-import { validateCrosswalk } from "twindex";
+import { $ as ArchiveError, A as WaybackTimestampSchema, B as countedKeys, C as ParserSchema, D as SnapshotSchema, E as RelativePathSchema, F as groupsOf, G as listCategories, H as getCollectionTarget, I as namesOf, J as collectionOf, K as TaskSchema, M as toIssues, N as waybackUrl, O as SourceSchema, P as NAME_SEPARATOR, Q as JsonScalarSchema, R as CategoryIdSchema, S as NamespaceSchema, T as RecipeSchema, U as getTarget, V as getCategory, W as kindOf, X as GraphNodeSchema, Y as GraphEdgeSchema, Z as GraphV1Schema, _ as CrosswalkReferenceSchema, a as CatalogueIndexSchema, at as RecipeError, b as IdSchema, c as ManifestSchema, d as AliasSchema, et as CatalogueSyntaxError, f as ArchiveMemberSchema, g as ColumnNameSchema, h as CollectionArchiveSchema, i as listNamespaces, it as NativeParseError, j as parseEntry, k as SubjectSchema, l as SemVerSchema, m as CitationSchema, n as getManifest, nt as DatasetNotFoundError, o as createCatalogue, ot as UnknownCategoryError, p as ArchiveSchema, q as TasksV1Schema, r as listDatasets, rt as KeepsetError, s as LineageSchema, t as getDataset, tt as DatasetAmbiguousError, u as parseManifest, v as EntrySchema, w as RESERVED_META_KEYS, x as LicenceSchema, y as HttpUrlSchema, z as countTarget } from "./bundled-DV_kxyz2.js";
+import { validateCrosswalk } from "crossmap";
 //#region src/serialise.ts
 /**
 * Copies a JSON value with every object's keys in ascending code-unit order, the order the house JSON lint (`json/sort-keys`) requires of committed JSON. `Object.fromEntries` defines each key as an own data property, so a key such as `__proto__` stays a key.
@@ -30,7 +30,7 @@ function serialise(doc) {
 //#endregion
 //#region src/validate.ts
 /**
-* Checks a dataset as the catalogue holds it: the entry against the entry schema, and its crosswalk against twindex's structural validation and the entry's category. A catalogue index is checked the same way when it is built, so a bundled dataset is valid unless the package itself is broken; the check is what a contributor runs on an entry they are writing.
+* Checks a dataset as the catalogue holds it: the entry against the entry schema, and its crosswalk against crossmap's structural validation and the entry's category. A catalogue index is checked the same way when it is built, so a bundled dataset is valid unless the package itself is broken; the check is what a contributor runs on an entry they are writing.
 * @param dataset - The dataset.
 * @returns Every issue found, with paths from the dataset's root (`entry.` or `crosswalk.`); empty when the dataset is valid.
 */

package/dist/node/fetch-dataset.d.ts

@@ -1,4 +1,4 @@
-import { N as Dataset, gt as Snapshot, i as CategoryTarget, nt as Entry, o as CollectionTarget, vt as Source } from "../categories-DC0uTkzn.js";
+import { N as Dataset, gt as Snapshot, i as CategoryTarget, nt as Entry, o as CollectionTarget, vt as Source } from "../categories-DepJEi4o.js";
 //#region src/node/fetch-dataset.d.ts
 /** The network port a recipe downloads through: `downloadRaw` by default, which returns the bytes exactly as served, or a stand-in under test. */
 export type FetchPort = (url: string, init: {
@@ -43,7 +43,7 @@ export interface FetchedDataset {
  */
 export declare function downloadUrl(source: Source): string;
 /**
- * Runs a dataset's recipe: downloads the source (from its pinned snapshot when the source is dead), unpacks the archive, parses the native shape, applies the twindex crosswalk and validates the result against the category target. The native document the crosswalk receives is the parser's output with `meta` built from the entry.
+ * Runs a dataset's recipe: downloads the source (from its pinned snapshot when the source is dead), unpacks the archive, parses the native shape, applies the crossmap crosswalk and validates the result against the category target. The native document the crosswalk receives is the parser's output with `meta` built from the entry.
  * @param dataset - A dataset from any catalogue.
  * @param options - The network port, abort signal and clock.
  * @returns The resolved target with its provenance and any count warnings.
@@ -69,7 +69,7 @@ export type RoundTripReport = {
   readonly provenance: Provenance;
 };
 /**
- * Checks a dataset's crosswalk on its real data: runs the recipe to the native document, then twindex's `assertRoundTrip`, which encodes it, decodes the result and compares the two over every path the crosswalk promises to preserve.
+ * Checks a dataset's crosswalk on its real data: runs the recipe to the native document, then crossmap's `assertRoundTrip`, which encodes it, decodes the result and compares the two over every path the crosswalk promises to preserve.
  * @param dataset - A dataset from any catalogue.
  * @param options - The network port, abort signal and clock.
  * @returns Whether the round trip holds, and where it first differs when it does not.

package/dist/node/fetch-dataset.js

@@ -1,5 +1,5 @@
-import { $ as ArchiveError, H as getCollectionTarget, L as getOwn, U as getTarget, at as RecipeError, it as NativeParseError, rt as KeepsetError, t as getDataset, z as countTarget } from "../bundled-Ql23qj97.js";
-import { RoundTripMismatchError, assertRoundTrip, encode } from "twindex";
+import { $ as ArchiveError, H as getCollectionTarget, L as getOwn, U as getTarget, at as RecipeError, it as NativeParseError, rt as KeepsetError, t as getDataset, z as countTarget } from "../bundled-DV_kxyz2.js";
+import { RoundTripMismatchError, assertRoundTrip, encode } from "crossmap";
 import { z } from "zod";
 import { createHash } from "node:crypto";
 import { gunzipSync } from "node:zlib";
@@ -2945,7 +2945,7 @@ async function runToNative(dataset, options) {
 	};
 }
 /**
-* Runs a dataset's recipe: downloads the source (from its pinned snapshot when the source is dead), unpacks the archive, parses the native shape, applies the twindex crosswalk and validates the result against the category target. The native document the crosswalk receives is the parser's output with `meta` built from the entry.
+* Runs a dataset's recipe: downloads the source (from its pinned snapshot when the source is dead), unpacks the archive, parses the native shape, applies the crossmap crosswalk and validates the result against the category target. The native document the crosswalk receives is the parser's output with `meta` built from the entry.
 * @param dataset - A dataset from any catalogue.
 * @param options - The network port, abort signal and clock.
 * @returns The resolved target with its provenance and any count warnings.
@@ -2990,7 +2990,7 @@ async function fetchDataset(id, options = {}) {
 	return fetchEntry(getDataset(id), options);
 }
 /**
-* Checks a dataset's crosswalk on its real data: runs the recipe to the native document, then twindex's `assertRoundTrip`, which encodes it, decodes the result and compares the two over every path the crosswalk promises to preserve.
+* Checks a dataset's crosswalk on its real data: runs the recipe to the native document, then crossmap's `assertRoundTrip`, which encodes it, decodes the result and compares the two over every path the crosswalk promises to preserve.
 * @param dataset - A dataset from any catalogue.
 * @param options - The network port, abort signal and clock.
 * @returns Whether the round trip holds, and where it first differs when it does not.

package/dist-cli/keepset.mjs

@@ -4,7 +4,7 @@ import { KeepsetError, NAME_SEPARATOR, countTarget, getDataset, listDatasets, li
 import { fetchDataset, roundTripDataset } from "keepset/node";
 import { parseArgs } from "node:util";
 //#region package.json
-var version = "0.29.2";
+var version = "0.30.0";
 //#endregion
 //#region cli/run.ts
 /**
@@ -36,7 +36,7 @@ Commands:
                       to <file> (default <id>.json), with its provenance beside
                       it in <file without .json>.provenance.json
   validate <dataset>  check the entry against the entry schema and its
-                      crosswalk against twindex's validation
+                      crosswalk against crossmap's validation
   roundtrip <dataset> fetch the dataset and check that decoding the encoded
                       native document gives it back
 

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "keepset",
   "description": "Library, CLI and statically generated catalogue for dataset fetch-and-normalise recipes",
-  "version": "0.29.2",
+  "version": "0.30.0",
   "bin": {
     "keepset": "./dist-cli/keepset.mjs"
   },
@@ -10,10 +10,10 @@
     "@mantine/hooks": "9.7.2",
     "@tanstack/react-table": "9.2.8",
     "@vanilla-extract/css": "1.21.3",
+    "crossmap": "0.2.0",
     "fflate": "0.8.3",
     "react": "19.3.0",
     "react-dom": "19.3.0",
-    "twindex": "0.1.4",
     "zod": "4.6.6"
   },
   "devDependencies": {

package/schemas/entry.schema.json

@@ -1 +1 @@
-{"$defs":{"Crosswalk":{"$ref":"https://cdn.jsdelivr.net/npm/twindex@0.1.4/schemas/twindex.schema.json"},"Entry":{"additionalProperties":false,"properties":{"aliases":{"items":{"pattern":"^[A-Za-z0-9][A-Za-z0-9._-]*(?:\\/[A-Za-z0-9][A-Za-z0-9._-]*)*$","type":"string"},"minItems":1,"type":"array"},"category":{"enum":["graph/v1","tasks/v1"],"type":"string"},"citations":{"items":{"additionalProperties":false,"properties":{"doi":{"pattern":"^10\\.\\d{4,9}\\/\\S+$","type":"string"},"text":{"minLength":1,"type":"string"},"url":{"format":"uri","type":"string"}},"required":["text"],"type":"object"},"type":"array"},"crosswalk":{"anyOf":[{"$ref":"#/$defs/Crosswalk"},{"additionalProperties":false,"properties":{"file":{"type":"string"}},"required":["file"],"type":"object"}]},"description":{"minLength":1,"type":"string"},"domain":{"minLength":1,"type":"string"},"expectedCounts":{"additionalProperties":{"maximum":9007199254740991,"minimum":0,"type":"integer"},"propertyNames":{"pattern":"^[A-Za-z][A-Za-z0-9]*$","type":"string"},"type":"object"},"id":{"pattern":"^[A-Za-z0-9][A-Za-z0-9._-]*$","type":"string"},"licence":{"oneOf":[{"additionalProperties":false,"properties":{"id":{"pattern":"^[A-Za-z0-9][A-Za-z0-9.+-]*$","type":"string"},"kind":{"const":"spdx","type":"string"}},"required":["kind","id"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"const":"custom","type":"string"},"name":{"minLength":1,"type":"string"},"url":{"format":"uri","type":"string"}},"required":["kind","name","url"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"const":"unrecorded","type":"string"}},"required":["kind"],"type":"object"}]},"name":{"minLength":1,"type":"string"},"namespace":{"items":{"pattern":"^[A-Za-z0-9][A-Za-z0-9._-]*$","type":"string"},"minItems":1,"type":"array"},"properties":{"additionalProperties":{"type":["string","number","boolean","null"]},"propertyNames":{"pattern":"^[A-Za-z][A-Za-z0-9]*$","type":"string"},"type":"object"},"recipe":{"oneOf":[{"additionalProperties":false,"properties":{"archive":{"anyOf":[{"additionalProperties":false,"properties":{"kind":{"const":"none","type":"string"}},"required":["kind"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"const":"gzip","type":"string"}},"required":["kind"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"enum":["zip","tar","tar.gz"],"type":"string"},"member":{"anyOf":[{"additionalProperties":false,"properties":{"path":{"type":"string"}},"required":["path"],"type":"object"},{"additionalProperties":false,"properties":{"extensions":{"items":{"pattern":"^\\.[A-Za-z0-9][A-Za-z0-9.]*$","type":"string"},"minItems":1,"type":"array"}},"required":["extensions"],"type":"object"},{"additionalProperties":false,"properties":{"pattern":{"minLength":1,"type":"string"}},"required":["pattern"],"type":"object"}]}},"required":["kind","member"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"enum":["zip","tar","tar.gz"],"type":"string"},"members":{"anyOf":[{"additionalProperties":false,"properties":{"path":{"type":"string"}},"required":["path"],"type":"object"},{"additionalProperties":false,"properties":{"extensions":{"items":{"pattern":"^\\.[A-Za-z0-9][A-Za-z0-9.]*$","type":"string"},"minItems":1,"type":"array"}},"required":["extensions"],"type":"object"},{"additionalProperties":false,"properties":{"pattern":{"minLength":1,"type":"string"}},"required":["pattern"],"type":"object"}]}},"required":["kind","members"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"const":"xlsx","type":"string"},"sheet":{"minLength":1,"type":"string"}},"required":["kind","sheet"],"type":"object"}]},"paging":{"oneOf":[{"additionalProperties":false,"properties":{"kind":{"const":"arcgis-query","type":"string"},"orderBy":{"pattern":"^[A-Za-z_][A-Za-z0-9_]*$","type":"string"}},"required":["kind","orderBy"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"const":"socrata-resource","type":"string"},"pageSize":{"maximum":9007199254740991,"minimum":1,"type":"integer"}},"required":["kind","pageSize"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"const":"ckan-datastore","type":"string"},"pageSize":{"maximum":9007199254740991,"minimum":1,"type":"integer"}},"required":["kind","pageSize"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"const":"openfema","type":"string"},"pageSize":{"maximum":9007199254740991,"minimum":1,"type":"integer"}},"required":["kind","pageSize"],"type":"object"}]},"parser":{"oneOf":[{"additionalProperties":false,"properties":{"commentPrefixes":{"items":{"minLength":1,"type":"string"},"type":"array"},"delimiter":{"enum":["detect","whitespace","tab","comma","space"],"type":"string"},"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"edge-list","type":"string"},"skipLines":{"maximum":9007199254740991,"minimum":0,"type":"integer"},"sourceColumn":{"maximum":9007199254740991,"minimum":0,"type":"integer"},"targetColumn":{"maximum":9007199254740991,"minimum":0,"type":"integer"}},"required":["format","encoding","delimiter","skipLines","commentPrefixes","sourceColumn","targetColumn"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"matrix-market","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"gml","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"pajek","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"customer-points","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"solomon","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"top","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"toptw","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"tsplib","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"const":"utf-8","type":"string"},"format":{"const":"verolog-2019","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"const":"utf-8","type":"string"},"format":{"const":"vrp-rep","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"columns":{"items":{"pattern":"^[A-Za-z](?:[A-Za-z0-9_]*[A-Za-z0-9])?$","type":"string"},"type":"array"},"delimiter":{"enum":["comma","tab","semicolon"],"type":"string"},"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"csv-table","type":"string"},"idColumn":{"anyOf":[{"pattern":"^[A-Za-z](?:[A-Za-z0-9_]*[A-Za-z0-9])?$","type":"string"},{"type":"null"}]},"nullValues":{"items":{"minLength":1,"type":"string"},"type":"array"},"numericColumns":{"items":{"additionalProperties":false,"properties":{"column":{"pattern":"^[A-Za-z](?:[A-Za-z0-9_]*[A-Za-z0-9])?$","type":"string"},"factor":{"exclusiveMinimum":0,"type":"number"}},"required":["column","factor"],"type":"object"},"type":"array"},"skipLines":{"maximum":9007199254740991,"minimum":0,"type":"integer"}},"required":["format","encoding","delimiter","skipLines","idColumn","numericColumns"],"type":"object"},{"additionalProperties":false,"properties":{"columns":{"items":{"pattern":"^[A-Za-z](?:[A-Za-z0-9_]*[A-Za-z0-9])?$","type":"string"},"minItems":1,"type":"array"},"dateColumns":{"items":{"pattern":"^[A-Za-z](?:[A-Za-z0-9_]*[A-Za-z0-9])?$","type":"string"},"type":"array"},"encoding":{"const":"utf-8","type":"string"},"format":{"const":"geojson","type":"string"},"idColumn":{"anyOf":[{"pattern":"^[A-Za-z](?:[A-Za-z0-9_]*[A-Za-z0-9])?$","type":"string"},{"type":"null"}]},"numericColumns":{"items":{"additionalProperties":false,"properties":{"column":{"pattern":"^[A-Za-z](?:[A-Za-z0-9_]*[A-Za-z0-9])?$","type":"string"},"factor":{"exclusiveMinimum":0,"type":"number"}},"required":["column","factor"],"type":"object"},"type":"array"}},"required":["format","encoding","idColumn","numericColumns","dateColumns","columns"],"type":"object"}]},"source":{"maximum":9007199254740991,"minimum":0,"type":"integer"},"status":{"const":"fetchable","type":"string"}},"required":["status","source","archive","parser"],"type":"object"},{"additionalProperties":false,"properties":{"reason":{"minLength":1,"type":"string"},"status":{"const":"not-fetchable","type":"string"}},"required":["status","reason"],"type":"object"}]},"sources":{"items":{"additionalProperties":false,"properties":{"retrieved":{"format":"date","pattern":"^(?:(?:\\d\\d[2468][048]|\\d\\d[13579][26]|\\d\\d0[48]|[02468][048]00|[13579][26]00)-02-29|\\d{4}-(?:(?:0[13578]|1[02])-(?:0[1-9]|[12]\\d|3[01])|(?:0[469]|11)-(?:0[1-9]|[12]\\d|30)|(?:02)-(?:0[1-9]|1\\d|2[0-8])))$","type":"string"},"snapshot":{"additionalProperties":false,"properties":{"timestamp":{"pattern":"^\\d{8}(?:\\d{6})?$","type":"string"},"url":{"format":"uri","type":"string"}},"required":["url","timestamp"],"type":"object"},"status":{"enum":["live","dead"],"type":"string"},"url":{"format":"uri","type":"string"}},"required":["url","retrieved","status"],"type":"object"},"minItems":1,"type":"array"},"subjects":{"items":{"pattern":"^[a-z][a-z0-9]*(?:-[a-z0-9]+)*$","type":"string"},"minItems":1,"type":"array"},"tags":{"items":{"minLength":1,"type":"string"},"type":"array"}},"required":["id","name","tags","category","sources","licence","citations","recipe","crosswalk","expectedCounts","properties"],"type":"object"}},"$id":"https://cdn.jsdelivr.net/npm/keepset@0.29.2/schemas/entry.schema.json","$ref":"#/$defs/Entry","$schema":"https://json-schema.org/draft/2020-12/schema"}
+{"$defs":{"Crosswalk":{"$ref":"https://cdn.jsdelivr.net/npm/crossmap@0.2.0/schemas/crossmap.schema.json"},"Entry":{"additionalProperties":false,"properties":{"aliases":{"items":{"pattern":"^[A-Za-z0-9][A-Za-z0-9._-]*(?:\\/[A-Za-z0-9][A-Za-z0-9._-]*)*$","type":"string"},"minItems":1,"type":"array"},"category":{"enum":["graph/v1","tasks/v1"],"type":"string"},"citations":{"items":{"additionalProperties":false,"properties":{"doi":{"pattern":"^10\\.\\d{4,9}\\/\\S+$","type":"string"},"text":{"minLength":1,"type":"string"},"url":{"format":"uri","type":"string"}},"required":["text"],"type":"object"},"type":"array"},"crosswalk":{"anyOf":[{"$ref":"#/$defs/Crosswalk"},{"additionalProperties":false,"properties":{"file":{"type":"string"}},"required":["file"],"type":"object"}]},"description":{"minLength":1,"type":"string"},"domain":{"minLength":1,"type":"string"},"expectedCounts":{"additionalProperties":{"maximum":9007199254740991,"minimum":0,"type":"integer"},"propertyNames":{"pattern":"^[A-Za-z][A-Za-z0-9]*$","type":"string"},"type":"object"},"id":{"pattern":"^[A-Za-z0-9][A-Za-z0-9._-]*$","type":"string"},"licence":{"oneOf":[{"additionalProperties":false,"properties":{"id":{"pattern":"^[A-Za-z0-9][A-Za-z0-9.+-]*$","type":"string"},"kind":{"const":"spdx","type":"string"}},"required":["kind","id"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"const":"custom","type":"string"},"name":{"minLength":1,"type":"string"},"url":{"format":"uri","type":"string"}},"required":["kind","name","url"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"const":"unrecorded","type":"string"}},"required":["kind"],"type":"object"}]},"name":{"minLength":1,"type":"string"},"namespace":{"items":{"pattern":"^[A-Za-z0-9][A-Za-z0-9._-]*$","type":"string"},"minItems":1,"type":"array"},"properties":{"additionalProperties":{"type":["string","number","boolean","null"]},"propertyNames":{"pattern":"^[A-Za-z][A-Za-z0-9]*$","type":"string"},"type":"object"},"recipe":{"oneOf":[{"additionalProperties":false,"properties":{"archive":{"anyOf":[{"additionalProperties":false,"properties":{"kind":{"const":"none","type":"string"}},"required":["kind"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"const":"gzip","type":"string"}},"required":["kind"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"enum":["zip","tar","tar.gz"],"type":"string"},"member":{"anyOf":[{"additionalProperties":false,"properties":{"path":{"type":"string"}},"required":["path"],"type":"object"},{"additionalProperties":false,"properties":{"extensions":{"items":{"pattern":"^\\.[A-Za-z0-9][A-Za-z0-9.]*$","type":"string"},"minItems":1,"type":"array"}},"required":["extensions"],"type":"object"},{"additionalProperties":false,"properties":{"pattern":{"minLength":1,"type":"string"}},"required":["pattern"],"type":"object"}]}},"required":["kind","member"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"enum":["zip","tar","tar.gz"],"type":"string"},"members":{"anyOf":[{"additionalProperties":false,"properties":{"path":{"type":"string"}},"required":["path"],"type":"object"},{"additionalProperties":false,"properties":{"extensions":{"items":{"pattern":"^\\.[A-Za-z0-9][A-Za-z0-9.]*$","type":"string"},"minItems":1,"type":"array"}},"required":["extensions"],"type":"object"},{"additionalProperties":false,"properties":{"pattern":{"minLength":1,"type":"string"}},"required":["pattern"],"type":"object"}]}},"required":["kind","members"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"const":"xlsx","type":"string"},"sheet":{"minLength":1,"type":"string"}},"required":["kind","sheet"],"type":"object"}]},"paging":{"oneOf":[{"additionalProperties":false,"properties":{"kind":{"const":"arcgis-query","type":"string"},"orderBy":{"pattern":"^[A-Za-z_][A-Za-z0-9_]*$","type":"string"}},"required":["kind","orderBy"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"const":"socrata-resource","type":"string"},"pageSize":{"maximum":9007199254740991,"minimum":1,"type":"integer"}},"required":["kind","pageSize"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"const":"ckan-datastore","type":"string"},"pageSize":{"maximum":9007199254740991,"minimum":1,"type":"integer"}},"required":["kind","pageSize"],"type":"object"},{"additionalProperties":false,"properties":{"kind":{"const":"openfema","type":"string"},"pageSize":{"maximum":9007199254740991,"minimum":1,"type":"integer"}},"required":["kind","pageSize"],"type":"object"}]},"parser":{"oneOf":[{"additionalProperties":false,"properties":{"commentPrefixes":{"items":{"minLength":1,"type":"string"},"type":"array"},"delimiter":{"enum":["detect","whitespace","tab","comma","space"],"type":"string"},"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"edge-list","type":"string"},"skipLines":{"maximum":9007199254740991,"minimum":0,"type":"integer"},"sourceColumn":{"maximum":9007199254740991,"minimum":0,"type":"integer"},"targetColumn":{"maximum":9007199254740991,"minimum":0,"type":"integer"}},"required":["format","encoding","delimiter","skipLines","commentPrefixes","sourceColumn","targetColumn"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"matrix-market","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"gml","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"pajek","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"customer-points","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"solomon","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"top","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"toptw","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"tsplib","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"const":"utf-8","type":"string"},"format":{"const":"verolog-2019","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"encoding":{"const":"utf-8","type":"string"},"format":{"const":"vrp-rep","type":"string"}},"required":["format","encoding"],"type":"object"},{"additionalProperties":false,"properties":{"columns":{"items":{"pattern":"^[A-Za-z](?:[A-Za-z0-9_]*[A-Za-z0-9])?$","type":"string"},"type":"array"},"delimiter":{"enum":["comma","tab","semicolon"],"type":"string"},"encoding":{"enum":["utf-8","latin1"],"type":"string"},"format":{"const":"csv-table","type":"string"},"idColumn":{"anyOf":[{"pattern":"^[A-Za-z](?:[A-Za-z0-9_]*[A-Za-z0-9])?$","type":"string"},{"type":"null"}]},"nullValues":{"items":{"minLength":1,"type":"string"},"type":"array"},"numericColumns":{"items":{"additionalProperties":false,"properties":{"column":{"pattern":"^[A-Za-z](?:[A-Za-z0-9_]*[A-Za-z0-9])?$","type":"string"},"factor":{"exclusiveMinimum":0,"type":"number"}},"required":["column","factor"],"type":"object"},"type":"array"},"skipLines":{"maximum":9007199254740991,"minimum":0,"type":"integer"}},"required":["format","encoding","delimiter","skipLines","idColumn","numericColumns"],"type":"object"},{"additionalProperties":false,"properties":{"columns":{"items":{"pattern":"^[A-Za-z](?:[A-Za-z0-9_]*[A-Za-z0-9])?$","type":"string"},"minItems":1,"type":"array"},"dateColumns":{"items":{"pattern":"^[A-Za-z](?:[A-Za-z0-9_]*[A-Za-z0-9])?$","type":"string"},"type":"array"},"encoding":{"const":"utf-8","type":"string"},"format":{"const":"geojson","type":"string"},"idColumn":{"anyOf":[{"pattern":"^[A-Za-z](?:[A-Za-z0-9_]*[A-Za-z0-9])?$","type":"string"},{"type":"null"}]},"numericColumns":{"items":{"additionalProperties":false,"properties":{"column":{"pattern":"^[A-Za-z](?:[A-Za-z0-9_]*[A-Za-z0-9])?$","type":"string"},"factor":{"exclusiveMinimum":0,"type":"number"}},"required":["column","factor"],"type":"object"},"type":"array"}},"required":["format","encoding","idColumn","numericColumns","dateColumns","columns"],"type":"object"}]},"source":{"maximum":9007199254740991,"minimum":0,"type":"integer"},"status":{"const":"fetchable","type":"string"}},"required":["status","source","archive","parser"],"type":"object"},{"additionalProperties":false,"properties":{"reason":{"minLength":1,"type":"string"},"status":{"const":"not-fetchable","type":"string"}},"required":["status","reason"],"type":"object"}]},"sources":{"items":{"additionalProperties":false,"properties":{"retrieved":{"format":"date","pattern":"^(?:(?:\\d\\d[2468][048]|\\d\\d[13579][26]|\\d\\d0[48]|[02468][048]00|[13579][26]00)-02-29|\\d{4}-(?:(?:0[13578]|1[02])-(?:0[1-9]|[12]\\d|3[01])|(?:0[469]|11)-(?:0[1-9]|[12]\\d|30)|(?:02)-(?:0[1-9]|1\\d|2[0-8])))$","type":"string"},"snapshot":{"additionalProperties":false,"properties":{"timestamp":{"pattern":"^\\d{8}(?:\\d{6})?$","type":"string"},"url":{"format":"uri","type":"string"}},"required":["url","timestamp"],"type":"object"},"status":{"enum":["live","dead"],"type":"string"},"url":{"format":"uri","type":"string"}},"required":["url","retrieved","status"],"type":"object"},"minItems":1,"type":"array"},"subjects":{"items":{"pattern":"^[a-z][a-z0-9]*(?:-[a-z0-9]+)*$","type":"string"},"minItems":1,"type":"array"},"tags":{"items":{"minLength":1,"type":"string"},"type":"array"}},"required":["id","name","tags","category","sources","licence","citations","recipe","crosswalk","expectedCounts","properties"],"type":"object"}},"$id":"https://cdn.jsdelivr.net/npm/keepset@0.30.0/schemas/entry.schema.json","$ref":"#/$defs/Entry","$schema":"https://json-schema.org/draft/2020-12/schema"}

package/schemas/manifest.schema.json

@@ -1 +1 @@
-{"$defs":{"Manifest":{"additionalProperties":false,"properties":{"description":{"minLength":1,"type":"string"},"id":{"pattern":"^[A-Za-z0-9][A-Za-z0-9._-]*$","type":"string"},"lineage":{"additionalProperties":false,"properties":{"catalogue":{"pattern":"^[A-Za-z0-9][A-Za-z0-9._-]*$","type":"string"},"repository":{"format":"uri","type":"string"},"version":{"pattern":"^(?:0|[1-9]\\d*)\\.(?:0|[1-9]\\d*)\\.(?:0|[1-9]\\d*)(?:-[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*)?(?:\\+[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*)?$","type":"string"}},"required":["catalogue","version","repository"],"type":"object"},"name":{"minLength":1,"type":"string"},"namespaceAliases":{"additionalProperties":{"items":{"pattern":"^[A-Za-z0-9][A-Za-z0-9._-]*$","type":"string"},"minItems":1,"type":"array"},"propertyNames":{"pattern":"^[A-Za-z0-9][A-Za-z0-9._-]*$","type":"string"},"type":"object"},"repository":{"format":"uri","type":"string"},"version":{"pattern":"^(?:0|[1-9]\\d*)\\.(?:0|[1-9]\\d*)\\.(?:0|[1-9]\\d*)(?:-[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*)?(?:\\+[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*)?$","type":"string"}},"required":["id","name","description","version","repository"],"type":"object"}},"$id":"https://cdn.jsdelivr.net/npm/keepset@0.29.2/schemas/manifest.schema.json","$ref":"#/$defs/Manifest","$schema":"https://json-schema.org/draft/2020-12/schema"}
+{"$defs":{"Manifest":{"additionalProperties":false,"properties":{"description":{"minLength":1,"type":"string"},"id":{"pattern":"^[A-Za-z0-9][A-Za-z0-9._-]*$","type":"string"},"lineage":{"additionalProperties":false,"properties":{"catalogue":{"pattern":"^[A-Za-z0-9][A-Za-z0-9._-]*$","type":"string"},"repository":{"format":"uri","type":"string"},"version":{"pattern":"^(?:0|[1-9]\\d*)\\.(?:0|[1-9]\\d*)\\.(?:0|[1-9]\\d*)(?:-[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*)?(?:\\+[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*)?$","type":"string"}},"required":["catalogue","version","repository"],"type":"object"},"name":{"minLength":1,"type":"string"},"namespaceAliases":{"additionalProperties":{"items":{"pattern":"^[A-Za-z0-9][A-Za-z0-9._-]*$","type":"string"},"minItems":1,"type":"array"},"propertyNames":{"pattern":"^[A-Za-z0-9][A-Za-z0-9._-]*$","type":"string"},"type":"object"},"repository":{"format":"uri","type":"string"},"version":{"pattern":"^(?:0|[1-9]\\d*)\\.(?:0|[1-9]\\d*)\\.(?:0|[1-9]\\d*)(?:-[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*)?(?:\\+[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*)?$","type":"string"}},"required":["id","name","description","version","repository"],"type":"object"}},"$id":"https://cdn.jsdelivr.net/npm/keepset@0.30.0/schemas/manifest.schema.json","$ref":"#/$defs/Manifest","$schema":"https://json-schema.org/draft/2020-12/schema"}