Topics — What a work is about. Nucleation holds whatever reading the owner files here, whether or not an Anthology of the SOTA topic could also hold it; instruction for ML practice belongs to the anthology (ADR-048). The words are seeded from the clusters the reading-time triage of 2026-09-25 found, and grow by decision.
Network science — the structure and dynamics of networks — dimension, curvature and Ricci flow, community detection, consensus and synchronization.
2 of 547 CLAIM documents. Back to the full index.
| # | Title | Summary | Status |
|---|---|---|---|
| CLAIM-453 v2 | A population of perspectives, each advocating one of two interpretations, makes its collective choice by drift diffusion when the coordinate the decision is read from integrates independent evidence with no net leak or self-reinforcement and commitment is a bound on that coordinate; two interpretations make the reduction one-dimensional, but they do not by themselves give it | The owner’s hypothesis at U34 of the exchange of 2026-10-24, continued: “if we’ve set up our simulation appropriately, when n=2 we should see drift diffusion dynamics”. It is the owner’s second statement of CLAIM-262’s continuous case, first given on 2026-10-12. A34 qualified it, A35 gave the dial, and A36 gave an exact reduction for a network of accumulators. The record’s own replicator construction gives a second, which the exchange did not see. Both were checked when filed. The sharp edge: two interpretations are necessary for a one-dimensional reduction, not sufficient. | Active |
| CLAIM-495 | For an O(d)-valued connection on a connected graph, the assignments that meet every edge relation xᵢ = Tᵢⱼxⱼ form a space isomorphic to the vectors at one vertex fixed by every holonomy based there, which is the kernel of the connection Laplacian; for d = 1, and for U(1) phases, that space is all or nothing, but for d > 1 a connection whose loops are not trivial can still keep a subspace on which every loop is, so compatibility among local frames can be partial and graded by direction; and edge maps that do not commute can compose to a flat loop, so non-commutativity is not holonomy | From A2 and A3 of the exchange “Paper assessment” (2026-10-29), which drew it out of LIT-1820’s O(d) setting against THEORY-1082’s U(1) one. The proof and the example are the record’s, checked numerically. It is the zeroth cohomology of the connection sheaf, so standard, and it says nothing about which organizations have such transports. | Active |