groupoid 0.1.0.dev1__py3-none-any.whl

groupoid/transport.py

@@ -0,0 +1,188 @@
+"""Parallel transport on Riemannian manifolds for federated learning.
+
+Implements parallel transport of tangent vectors along geodesics,
+which is the geometric foundation of the groupoid morphisms. When
+client A sends a gradient update to client B, the gradient must be
+parallel-transported from A's tangent space to B's tangent space
+to preserve geometric meaning.
+
+This module provides:
+- Schild's ladder approximation for general manifolds
+- Pole ladder (more accurate, same cost)
+- Exact transport on spheres and SPD matrices
+"""
+
+from __future__ import annotations
+
+from typing import Any
+
+import numpy as np
+import numpy.typing as npt
+from loguru import logger
+
+
+def schild_ladder(
+    manifold: Any,  # geomstats manifold; no upstream type stubs
+    tangent_vec: npt.NDArray[np.float64],
+    base_point: npt.NDArray[np.float64],
+    end_point: npt.NDArray[np.float64],
+    n_rungs: int = 1,
+) -> npt.NDArray[np.float64]:
+    """Parallel transport via Schild's ladder.
+
+    An iterative approximation of parallel transport that only requires
+    the exponential and logarithmic maps. This is the coarser of the two
+    ladders: on S^2 its direction agrees with the analytic parallel
+    transport only to cosine ~0.98 and does not converge to the exact
+    value as ``n_rungs`` increases (see ``pole_ladder`` for the accurate
+    variant and LIMITATIONS.md for the measured behavior).
+
+    Parameters
+    ----------
+    manifold
+        A geomstats manifold with exp and log maps.
+    tangent_vec
+        Tangent vector at base_point to transport.
+    base_point
+        Starting point on the manifold.
+    end_point
+        Destination point on the manifold.
+    n_rungs
+        Number of ladder rungs (higher = more accurate).
+
+    Returns
+    -------
+    np.ndarray
+        The transported tangent vector at end_point.
+    """
+    metric = manifold.metric
+    direction = metric.log(end_point, base_point)
+
+    current_base = base_point
+    current_vec = tangent_vec
+
+    for _k in range(n_rungs):
+        step = direction * (1.0 / n_rungs)
+        next_base = metric.exp(step, current_base)
+
+        # Schild's ladder: reflect the antipodal endpoint through
+        # the midpoint of the base-to-next geodesic
+        u = metric.exp(-current_vec, current_base)
+        midpoint = metric.exp(step / 2.0, current_base)
+        log_mid_u = metric.log(u, midpoint)
+        u_prime = metric.exp(-log_mid_u, midpoint)
+        current_vec = metric.log(u_prime, next_base)
+
+        current_base = next_base
+        direction = metric.log(end_point, current_base)
+
+    result: npt.NDArray[np.float64] = current_vec
+    return result
+
+
+def pole_ladder(
+    manifold: Any,  # geomstats manifold; no upstream type stubs
+    tangent_vec: npt.NDArray[np.float64],
+    base_point: npt.NDArray[np.float64],
+    end_point: npt.NDArray[np.float64],
+    n_rungs: int = 1,
+) -> npt.NDArray[np.float64]:
+    """Parallel transport via pole ladder.
+
+    A variant of Schild's ladder that uses geodesic symmetry instead
+    of midpoint construction. More accurate than Schild's ladder for
+    the same number of rungs, and exactly preserves the norm of the
+    transported vector on symmetric spaces.
+
+    Parameters
+    ----------
+    manifold
+        A geomstats manifold with exp and log maps.
+    tangent_vec
+        Tangent vector at base_point to transport.
+    base_point
+        Starting point on the manifold.
+    end_point
+        Destination point on the manifold.
+    n_rungs
+        Number of ladder rungs.
+
+    Returns
+    -------
+    np.ndarray
+        The transported tangent vector at end_point.
+    """
+    metric = manifold.metric
+    direction = metric.log(end_point, base_point)
+
+    current_base = base_point
+    current_vec = tangent_vec
+
+    for _k in range(n_rungs):
+        step = direction * (1.0 / n_rungs)
+        next_base = metric.exp(step, current_base)
+
+        # Pole construction: reflect through the midpoint of the geodesic
+        pole = metric.exp(-current_vec, current_base)
+        mid_of_geodesic = metric.exp(step / 2.0, current_base)
+        log_pole_from_mid = metric.log(pole, mid_of_geodesic)
+        reflected = metric.exp(-log_pole_from_mid, mid_of_geodesic)
+        current_vec = metric.log(reflected, next_base)
+
+        current_base = next_base
+
+    return current_vec
+
+
+def compute_transport_matrix(
+    manifold: Any,  # geomstats manifold; no upstream type stubs
+    base_point: npt.NDArray[np.float64],
+    end_point: npt.NDArray[np.float64],
+    method: str = "pole",
+    n_rungs: int = 2,
+) -> npt.NDArray[np.float64]:
+    """Compute the parallel transport matrix between two points.
+
+    Constructs the full linear map T such that for any tangent vector v
+    at base_point, T @ v gives the parallel transport of v to end_point.
+
+    Parameters
+    ----------
+    manifold
+        A geomstats manifold.
+    base_point
+        Starting point on the manifold.
+    end_point
+        Destination point on the manifold.
+    method
+        Transport method: "pole" or "schild".
+    n_rungs
+        Number of ladder rungs for the approximation.
+
+    Returns
+    -------
+    np.ndarray
+        Transport matrix of shape (dim, dim).
+    """
+    transport_fn = pole_ladder if method == "pole" else schild_ladder
+    dim = base_point.shape[-1]
+    T = np.zeros((dim, dim))
+
+    # Transport each basis vector
+    for i in range(dim):
+        e_i = np.zeros(dim)
+        e_i[i] = 1.0
+
+        # Project onto tangent space at base_point
+        tangent = manifold.to_tangent(e_i, base_point)
+
+        transported = transport_fn(manifold, tangent, base_point, end_point, n_rungs=n_rungs)
+        T[:, i] = transported
+
+    logger.debug(
+        "Transport matrix computed ({} method, {} rungs): det={:.4f}",
+        method,
+        n_rungs,
+        np.linalg.det(T),
+    )
+    return T

groupoid-0.1.0.dev1.dist-info/METADATA

@@ -0,0 +1,258 @@
+Metadata-Version: 2.4
+Name: groupoid
+Version: 0.1.0.dev1
+Summary: Research prototype: groupoid-based aggregation for federated learning on Riemannian manifolds
+Author-email: Santiago Maniches <santiago.maniches@gmail.com>
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/smaniches/GROUPOID
+Project-URL: Repository, https://github.com/smaniches/GROUPOID
+Project-URL: Documentation, https://smaniches.github.io/GROUPOID
+Project-URL: Issues, https://github.com/smaniches/GROUPOID/issues
+Project-URL: Changelog, https://github.com/smaniches/GROUPOID/blob/main/CHANGELOG.md
+Keywords: federated-learning,riemannian-geometry,groupoid,topology,sheaf-theory,cohomology,topological-data-analysis
+Classifier: Development Status :: 2 - Pre-Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Requires-Python: <3.13,>=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: geomstats>=0.7
+Requires-Dist: pymanopt>=2.0
+Requires-Dist: ripser>=0.6
+Requires-Dist: persim>=0.3
+Requires-Dist: POT>=0.9
+Requires-Dist: networkx>=3.0
+Requires-Dist: einops>=0.7
+Requires-Dist: numpy<2.0,>=1.24
+Requires-Dist: scipy<1.14,>=1.10
+Requires-Dist: torch>=2.0
+Requires-Dist: pydantic>=2.0
+Requires-Dist: loguru>=0.7
+Provides-Extra: privacy
+Requires-Dist: opacus>=1.4; extra == "privacy"
+Requires-Dist: tenseal>=0.3; extra == "privacy"
+Provides-Extra: numerical
+Requires-Dist: numba>=0.58; extra == "numerical"
+Requires-Dist: jax>=0.4; extra == "numerical"
+Requires-Dist: jaxlib>=0.4; extra == "numerical"
+Provides-Extra: experiment
+Requires-Dist: wandb>=0.16; extra == "experiment"
+Provides-Extra: dev
+Requires-Dist: pytest>=7.0; extra == "dev"
+Requires-Dist: pytest-cov>=4.0; extra == "dev"
+Requires-Dist: hypothesis>=6.0; extra == "dev"
+Requires-Dist: pytest-benchmark>=4.0; extra == "dev"
+Requires-Dist: pytest-xdist>=3.0; extra == "dev"
+Requires-Dist: pytest-asyncio>=0.23; extra == "dev"
+Requires-Dist: pre-commit>=3.0; extra == "dev"
+Requires-Dist: bandit>=1.7; extra == "dev"
+Requires-Dist: pip-audit>=2.7; extra == "dev"
+Requires-Dist: ruff>=0.1; extra == "dev"
+Requires-Dist: black>=23.0; extra == "dev"
+Requires-Dist: mypy>=1.0; extra == "dev"
+Provides-Extra: docs
+Requires-Dist: mkdocs>=1.5; extra == "docs"
+Requires-Dist: mkdocs-material>=9.0; extra == "docs"
+Requires-Dist: mkdocstrings[python]>=0.24; extra == "docs"
+Provides-Extra: all
+Requires-Dist: groupoid[dev,docs,experiment,numerical,privacy]; extra == "all"
+Dynamic: license-file
+
+# GROUPOID
+
+[![CI](https://github.com/smaniches/GROUPOID/actions/workflows/ci.yml/badge.svg)](https://github.com/smaniches/GROUPOID/actions/workflows/ci.yml)
+[![License](https://img.shields.io/badge/License-Apache_2.0-blue.svg)](https://opensource.org/licenses/Apache-2.0)
+[![Python 3.10-3.12](https://img.shields.io/badge/python-3.10--3.12-blue.svg)](https://www.python.org/downloads/)
+[![Status](https://img.shields.io/badge/status-pre--alpha-orange.svg)](#status)
+[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.20563974.svg)](https://doi.org/10.5281/zenodo.20563974)
+
+> **Pre-alpha research prototype.** This is an early-stage exploration of
+> groupoid-based aggregation for federated learning on Riemannian manifolds.
+> It is not a production federated learning system. See
+> [STATUS.md](STATUS.md) and [LIMITATIONS.md](LIMITATIONS.md).
+
+## Overview
+
+GROUPOID explores using transport groupoids, cellular sheaves, and
+Riemannian geometry to aggregate model parameters across heterogeneous
+federated clients. The core idea: instead of naive Euclidean averaging
+(FedAvg), transport client parameters to a common frame via groupoid
+morphisms, check cohomological consistency, and compute the intrinsic
+Karcher mean on the parameter manifold.
+
+## Implemented and tested
+
+These components have working implementations with property-based and
+integration tests:
+
+- **Karcher mean** on Riemannian manifolds via geomstats (`groupoid.manifold`)
+- **Transport groupoid**: morphism composition, inverse, composition
+  associativity verified by Hypothesis (`groupoid.groupoid`)
+- **First cohomology H^1**: holonomy-based obstruction detection on the
+  cycle basis; coboundary vanishing and a multi-cycle independent
+  holonomy-product reference tested; an incompletely specified cocycle
+  (a cycle with a missing edge map) raises `IncompleteCocycleError`
+  rather than reporting a partial-product false positive
+  (`groupoid.cohomology`)
+- **Cellular sheaf**: restriction maps with functoriality tested
+  (`groupoid.sheaf`)
+- **Sheaf Laplacian**: connection Laplacian L = delta^T delta; PSD and
+  delta^T-delta equality verified on non-orthogonal restriction maps, plus
+  spectral analysis, algebraic connectivity, and diffusion convergence
+  tested (`groupoid.laplacian`)
+- **Federated aggregation pipeline**: transport-aware aggregation with
+  H^1 consistency checking, multi-round convergence tested
+  (`groupoid.aggregation`)
+
+## Implemented, validated against ground truth, not yet integrated
+
+These modules have unit tests that validate behavior against a
+known-correct reference, but are not yet wired into the main aggregation
+pipeline:
+
+- **Parallel transport**: Schild's ladder and pole ladder
+  (`groupoid.transport`). The pole ladder is validated against geomstats'
+  analytic parallel transport on S^2 -- it matches in direction
+  (cosine > 0.999) and magnitude. Schild's ladder is a coarser
+  first-order approximation and is asserted as such. See
+  [LIMITATIONS.md](LIMITATIONS.md) for the convergence caveat.
+- **Persistent homology**: Vietoris-Rips filtration for divergence
+  tracking (`groupoid.persistence`). Unit-tested against point clouds of
+  known topology: a circle's dominant 1-cycle (via maximum persistence),
+  two-cluster component counting (`betti_0 == 2` at a finite filtration),
+  and a translation-invariant bottleneck distance. The persistence diagram
+  retains a homology-dimension label, and `track_divergence` compares H0
+  against H0 only (it does not pool features across dimensions); this is
+  verified against an independent minimum-spanning-tree reconstruction of
+  the H0 diagram. The Betti numbers are degenerate under the default
+  `thresh=inf` filtration; see [LIMITATIONS.md](LIMITATIONS.md).
+
+## Implemented, smoke-tested, not yet integrated
+
+This module has implementation with smoke-test coverage only -- the tests
+check coarse sanity (steps stay on the manifold), not core correctness --
+and it is not yet wired into the main aggregation pipeline:
+
+- **Riemannian optimizers**: SGD and Adam with exponential map
+  retraction; smoke-tested to stay on the manifold after a step, with the
+  curvature-adaptive learning rate covered for both its damping and
+  fallback branches. Core descent/convergence behavior is not validated
+  (`groupoid.optimizer`)
+
+## Status
+
+Pre-alpha. See [STATUS.md](STATUS.md) for details.
+
+## Related work / why not just use X?
+
+GROUPOID sits at the intersection of three existing toolchains and is not a
+replacement for any of them. It is an exploratory prototype of one specific
+idea -- transport-groupoid aggregation with cohomological consistency checking
+-- not a federated learning framework.
+
+- **Flower / FedML / TensorFlow Federated** -- mature federated learning
+  frameworks providing the client/server communication, orchestration, and
+  real training loops that GROUPOID deliberately does **not** implement (see
+  [LIMITATIONS.md](LIMITATIONS.md): "Not a federated learning framework").
+  GROUPOID is about the *aggregation operator*, not the FL plumbing; in
+  principle a transport-aware aggregator like this one would be dropped into
+  such a framework, not used instead of it.
+- **geomstats / pymanopt** -- Riemannian-geometry libraries. GROUPOID *uses*
+  geomstats for the manifold primitives (the Karcher mean delegates to
+  geomstats `FrechetMean`). What GROUPOID adds on top is the transport
+  groupoid, the H^1 holonomy/consistency check, and the cellular-sheaf
+  Laplacian wiring -- not the manifold geometry itself.
+- **Cellular-sheaf spectral methods** (the sheaf-Laplacian line of work,
+  e.g. Hansen and Ghrist's spectral theory of cellular sheaves, and sheaf
+  neural networks) -- GROUPOID's sheaf Laplacian follows this line and is the
+  geometric machinery for detecting inconsistency across clients. The
+  contribution here is applying it to the federated-aggregation setting, not
+  the sheaf-Laplacian construction in the abstract.
+
+In short: use Flower/FedML/TFF for the FL system, use geomstats/pymanopt for
+manifold math; GROUPOID is a research prototype testing whether combining a
+transport groupoid with sheaf-cohomological consistency yields a better
+aggregation operator than Euclidean FedAvg. That hypothesis is **not yet
+validated** (see [STATUS.md](STATUS.md)).
+
+## Installation
+
+Requires **Python 3.10, 3.11, or 3.12**. Python 3.13+ is not supported: the
+`numpy<2.0` / `scipy<1.14` pins (needed for geomstats compatibility, see
+[LIMITATIONS.md](LIMITATIONS.md)) have no wheels there, so `pip` will refuse
+with a `Requires-Python` message rather than attempt a source build.
+
+From source (not published on PyPI):
+
+```bash
+git clone https://github.com/smaniches/GROUPOID.git
+cd GROUPOID
+pip install -e ".[dev]"
+```
+
+## Quick example
+
+```python
+import networkx as nx
+import numpy as np
+from geomstats.geometry.hypersphere import Hypersphere
+from groupoid import TransportGroupoidAggregator
+
+manifold = Hypersphere(dim=2)
+graph = nx.DiGraph([("A", "B"), ("A", "C")])
+
+aggregator = TransportGroupoidAggregator(
+    manifold=manifold, graph=graph, base_node="A"
+)
+
+# Register rotation matrices as transport maps
+theta = np.pi / 6
+R = np.array([
+    [np.cos(theta), -np.sin(theta), 0],
+    [np.sin(theta),  np.cos(theta), 0],
+    [0, 0, 1],
+])
+aggregator.register_transport("A", "B", R)
+aggregator.register_transport("A", "C", R.T)
+
+client_params = {
+    "A": np.array([0.0, 0.0, 1.0]),
+    "B": np.array([0.1, 0.0, 0.995]),
+    "C": np.array([-0.1, 0.0, 0.995]),
+}
+client_params = {k: v / np.linalg.norm(v) for k, v in client_params.items()}
+
+result = aggregator.aggregate(client_params)
+print(f"H^1 = {result.h1_norm:.2e} (consistent: {result.is_consistent})")
+```
+
+## Running tests
+
+```bash
+pytest tests/ -v
+```
+
+The suite reaches 100% line and branch coverage of the `groupoid` package
+on Python 3.10-3.12, enforced in CI:
+
+```bash
+pytest tests/ --cov=groupoid --cov-branch --cov-fail-under=100
+```
+
+Coverage measures which lines run, not whether behavior is correct. See
+[STATUS.md](STATUS.md) for the per-component validation depth, which
+coverage alone does not capture.
+
+## Documentation
+
+[smaniches.github.io/GROUPOID](https://smaniches.github.io/GROUPOID)
+
+## License
+
+Copyright 2026 TOPOLOGICA LLC. Licensed under the
+[Apache License, Version 2.0](LICENSE).

groupoid-0.1.0.dev1.dist-info/RECORD

@@ -0,0 +1,15 @@
+groupoid/__init__.py,sha256=xa-jzJ9DcEtAVOp_O4ETX39NSbvmoIFdtFdE6QCJiI4,839
+groupoid/aggregation.py,sha256=5SbaiZkfA4HJGVR09n9oyzlEAGFyTN1eUZDVAcHoBYU,8768
+groupoid/cohomology.py,sha256=CHZDSGjPPuDNXQG8f3xnx3sDlxpEmlYeWqRiCpfRNpU,3567
+groupoid/groupoid.py,sha256=L2WmTG8-Sh_r6TsgmIJ077zRG-nz1OyYEqsorAJf1w0,1992
+groupoid/laplacian.py,sha256=jqZEU6yvBocUqKg30XUojIUlDoGZVfyMEBKNRWhdG6w,6189
+groupoid/manifold.py,sha256=2jP68SwLhbpl4EItvLBRnV6_k6l2thTFzchudIzjGJw,2100
+groupoid/optimizer.py,sha256=RkbQMajLpso4U0jzUiarni9OCqBrUFcN_IVCzRpUEWg,6317
+groupoid/persistence.py,sha256=BuiBr00qRAXMPjdlZKuBRFhBUwFge7v2a-rn5bTF3LU,7229
+groupoid/sheaf.py,sha256=hlhvbP_rfQPy7t-EbvD8jTkjsRYv3eyk49Th2ehRNL0,2653
+groupoid/transport.py,sha256=5ItpmiIEqjEzEcFY8H1EAWiJpWHg-9h2d-UVkLAnR9A,5816
+groupoid-0.1.0.dev1.dist-info/licenses/LICENSE,sha256=qd0jMtXL8CN6XNdjjC4r2RX5u2FS6Y0TG1FtWTH4TTM,10766
+groupoid-0.1.0.dev1.dist-info/METADATA,sha256=PNMFgU0OztRecB1yI2r2Agu5I-2rrqZhwA5GyGj8UQA,11087
+groupoid-0.1.0.dev1.dist-info/WHEEL,sha256=aeYiig01lYGDzBgS8HxWXOg3uV61G9ijOsup-k9o1sk,91
+groupoid-0.1.0.dev1.dist-info/top_level.txt,sha256=avPz-dSDwo-4zKd7EoxNoLEEwEOYTAtByUD6BTFV9bY,9
+groupoid-0.1.0.dev1.dist-info/RECORD,,

groupoid-0.1.0.dev1.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (82.0.1)
+Root-Is-Purelib: true
+Tag: py3-none-any
+

groupoid-0.1.0.dev1.dist-info/licenses/LICENSE

@@ -0,0 +1,191 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to the Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by the Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding any notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   Copyright 2024 TOPOLOGICA LLC
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

groupoid-0.1.0.dev1.dist-info/top_level.txt

@@ -0,0 +1 @@
+groupoid