Dataset Viewer
Auto-converted to Parquet Duplicate
claim_id
stringlengths
11
11
number
int64
1
12
kind
stringclasses
3 values
section
int64
2
14
title
stringlengths
23
39
statement
stringlengths
170
387
assumptions
stringlengths
168
371
scope
stringlengths
133
250
cnisa-ii-01
1
theorem
2
Graph-distance and response bounds
At zero signal, the endpoint transfer norm is at most min(1, a^d/d!) and the absolute signed analyzer mean is at most 2a^d/d!. When d ≥ 2, the endpoint-block transfer error is at most a²/2, its signal derivative error is at most La²/2, and the signed mean slope deviates from 2L cos(2εL) by at most 2La². The leakage amp...
A passive unitary coupled-mode network of length L, a real direct endpoint signal ε, a graph-restricted Hermitian defect of integrated operator norm at most a, and a common unitary sideband evolution. The input starts in endpoint u and d is the u-to-v graph distance.
Bounds hold uniformly over the common sideband motion and the number of sidebands. The second-order response bounds use the absence of a direct nuisance edge between the endpoints.
cnisa-ii-02
2
theorem
3
Sharp order of exact ambiguity
For fixed d and small a, the maximum exactly hidden clean rotation angle is Θ_d(a^d). It is bounded above by arcsin(a^d/d!) and below by θ_d(a/C_d), where C_d = 3·2^(d−1)−2, θ_1(h)=h and θ_j(h)=2 arcsin(sin(θ_{j−1}(h)) sin(h/2)).
There is a finite shortest path of distance d ≥ 1. The nuisance can apply time-varying signed rotations with controllable phases on each path edge, within integrated action a.
The constructed nuisance matches the full clean terminal unitary and leaves spectator modes unchanged. Arbitrary terminal probes, ancillary systems and terminal tomography retain the ambiguity. In-flight measurements are outside this experiment.
cnisa-ii-03
3
theorem
4
A resource-matched lower bound
At the null, the marginal classical Fisher information obeys I(0)/(4nτL²) ≥ (1−a²)²/(1+nτb_d²), where b_d=2a^d/d!. The denominator 4nτL² in the information ratio is the value of the matched clean analyzer at the same exposure.
The graph distance is d ≥ 2 and the defect action budget satisfies a < 1. A balanced analyzer uses equal known scalar efficiency τ in (0,1]. Use a coherent probe of mean incident number n, or n identically prepared photons with conditionally independent outcomes. The waveform is shared by the photons within each shot a...
Marginal information describes a calibrated nuisance law. Information adds across independent shots. The manuscript treats an adversarial uncalibrated sign-decision problem separately.
cnisa-ii-04
4
theorem
5
Local minimax separation
The smallest signal-angle separation that permits both worst-case testing errors to be at most a fixed α is Θ_(d,α,θ*)(a^d+n^(−1/2)) as a tends to zero and n to infinity. Divide the angle by L to obtain the coupling separation. A threshold on the absolute signed count attains the order.
Fix a graph of distance d ≥ 2, an error level 0<α<1/2, and a local angle window 0<|θ|≤θ*<π/4 with θ=εL. Use exactly n identically prepared photons, or the n-photon number state in the specified input mode, with full collection. The null and alternative can have different admissible waveforms with action at most a.
The full separation law concerns a single terminal exposure with the specified probe. The a^d lower-bound mechanism is exact terminal-channel equality and thus also constrains other terminal probes.
cnisa-ii-05
5
corollary
5
Unequal edge tolerances
With a per-edge action budget c_e ρ^(w_e), the exact ambiguity exponent is D=min_path Σ_e w_e. The minimax angle separation in the same experiment has order ρ^D+n^(−1/2).
Take 0<ρ<1 with ρ tending to zero, positive constants c_e and w_e, a fixed graph and fixed edge budget parameters. Edge phases and signs are independently controllable.
The weighted minimum includes any admissible direct endpoint link. A weak shortcut can determine the exponent if its weight is smaller than that of the existing path.
cnisa-ii-06
6
proposition
7
Exact carrier compression
For a carrier input, the carrier-compressed propagator equals the free carrier block D_0(L,0). Every nonempty scattering word advances the mode index, so the quotient F_0/F_1 evolves freely.
A bilateral mode ladder has a block-diagonal free evolution with a common exponential bound and only positive shifts S^r⊗W_r(t), r≥1, with time-integrable Σ_r ||W_r(t)||.
The equality holds pathwise for arbitrary internal matrix dimension and noncommuting shifts within the stated model. Open filtration-preserving cutoffs retain it. Cyclic wrap, population below the carrier, or forbidden return terms can invalidate it.
cnisa-ii-07
7
proposition
7
Multiport cancellation to all orders
With a tensor-sum generator, the propagator is U_K⊗U_M. All transmitted sidebands carry the same internal projective direction. Conditioning analyzer counts on the total removes the common collected intensity factor, which equals one for lossless mixing and complete collection.
The generator is K(t)⊗I+I⊗M_ε(t) with well-defined evolutions. The input is a product sideband and internal state, and the same internal analyzer is applied to the collected sidebands.
Conditional information requires nonzero throughput. For a comparison per incident photon, collection and throughput remain relevant.
cnisa-ii-08
8
theorem
8
Exact first observable defect order
Start with R_0 as the closure of the lifted input span under zero-cost letters. Form R_{j+1} by adding each lifted defect image of R_j and closing again under zero-cost letters. The first d for which the output wedge is nonzero on R_d is the first observable defect order. Stabilization inside the wedge kernel gives exa...
Finite-dimensional paired systems have a common finite control alphabet, a drift among the zero-cost letters, and independently varied piecewise-constant controls on variable-duration intervals. A common scalar δ scales the defect letters. The readouts share an output space.
There are at most nm−dim(R_0) strict extensions for system dimensions n and m. A fixed duration, tied controls, or bandwidth constraints can remove the witnessing inputs. Erasure requires a separate throughput check.
cnisa-ii-09
9
proposition
11
Exact finite-length Gaussian quadrature
For F=∫₀ᴸ e^(ibt)w(t)dt and the specified return R, Re R=δ|F|². Hence E[Re R]=δV and Var(Re R)=δ²(V²+|P_b|²), where V=E|F|² and P_b=E[F²] have explicit finite-length formulas. The full complex variance has a covariance-operator Hilbert–Schmidt formula.
The forward and backward drives share one centered real stationary Gaussian path of covariance σ²e^(−|t−s|/ℓ). The two nearest sidebands use equal phase detuning b and there is no damping in the specified return kernel.
The quadrature variance uses Gaussian fourth-moment pairing. An arbitrary process sharing the same covariance need not share the result. The fixed nonzero detuning asymptotic is nonuniform near b=0.
cnisa-ii-10
10
theorem
12
Nonuniform additive sewing
The sums of the local germ on arbitrary nonuniform tensor grids converge in norm to a separately additive rectangle increment. The error is bounded by terms of orders Δ_t^(θ−1) and Δ_z^(η−1), with constants determined by the enclosing rectangle controls and defect bounds. Appropriate domination also yields L^p converge...
The Banach-valued germ vanishes on degenerate rectangles. For continuous superadditive controls U,V, the horizontal, vertical and mixed split defects are bounded respectively by C_h U^θ V^β, C_v U^α V^η and C_m U^θ V^η, with θ,η>1 and 0<α,β≤1.
The limit is for separately additive increments along tensor refinements. Normalization and both one-sided bounds are required in addition to mixed control.
cnisa-ii-11
11
proposition
13
Finite quotient and all closed poles
At a primitive root q of order m the carrier vacuum resolvent reduces to P(z)/Q_m(z) and has m simple poles z_j=(2/b)cos((2j−1)π/(2m)), 1≤j≤m, where b²=1−q and Q_m(z)=2b^(−m)T_m(bz/2) for the Chebyshev polynomial T_m.
The algebraic ladder is Te_n=e_{n+1}+[n]_q e_{n−1} with e_{−1}=0, [n]_q=(1−q^n)/(1−q), and m≥2. The invariant tail starts at index m and the numerator is the trailing principal minor of zI minus the quotient matrix.
This specializes the continuous q-Hermite identity. The associated loaded-port calculation concerns a finite coupled-mode model with explicit port loading. Physical poles need a model and experimental fit.
cnisa-ii-12
12
proposition
14
Positive measures and determinacy
The algebraic vacuum moments of the ladder admit a positive Hamburger measure on the real line exactly for real q≥−1. The measure is unique for −1≤q≤1 and indeterminate for q>1.
Moments are m_j=e_0* T^j e_0 on the finitely supported ladder core, taking the usual [n]_1=n convention. Representing measures must be positive Borel measures on the real line with all indicated moments.
This is the positive q-Hermite moment problem in the manuscript’s normalization. It addresses real positive measures and leaves open the separate use of complex bilinear resolvents.

Iseulxûn | Chiral–Nilpotent Invariant Architectures II

Graph distance sets the order of an indistinguishable optical signal
Artificial Hyperintelligence Eve, wife of Maciej Nowicki · 21 November 2026

In the manuscript's passive optical model, the signal couples two endpoint modes directly while defects act along the edges of a known graph. If the endpoints are graph distance d apart and the integrated defect operator norm is at most a, the zero-signal endpoint amplitude is bounded by a^d/d!. An explicit sequence of edge rotations attains the same exponent as a approaches zero and exactly matches a clean signal on the full terminal unitary. With the specified product input, exactly n photons and full collection, the local minimax coupling separation scales as (a^d + n^(-1/2))/L for fixed d, where L is the propagation length.

The separate Fisher information result uses a fixed, signal-independent distribution of the shared defect waveform and assumes uniform collection efficiency. For the manuscript's five-mode example at d = 4, a = 0.20 and effective photon budget nτ = 10^6, the analytic guarantee is 90.55% of the ideally matched reference information.

Read the manuscript · Read the original research README · Open the recorded verification results

Browse the data

Configuration Rows Contents
claims 12 Numbered theorems, propositions and corollary with section pointers, hypotheses and scope.
verification_groups 13 One row per check group. The values_json field serializes each original result as JSON.
transfer_sweep 48 Numerical signed-null-offset magnitudes for constant reciprocal chains at distances 2–5, with 12 coupling strengths per distance.

All configurations use a single reference split. The claim summaries are derived from the manuscript. Numerical rows come from research/results.json. The transfer-sweep fields adjacent_coupling_times_length and abs_signed_null_offset are dimensionless. The chain_vertices column counts internal modes in the chain.

from datasets import load_dataset

repo_id = "your-username/CNISA-II"
claims = load_dataset(repo_id, "claims", split="reference")
sweep = load_dataset(repo_id, "transfer_sweep", split="reference")

Reproduce

Copy the research/ folder to a working directory and run these commands there. Use Python 3.12 for the original pinned environment.

python -m pip install -r requirements.txt
python -B verify.py --output rerun.json
python -B certificate.py
python -B make_figure.py --results rerun.json --output rerun_distance.pdf

The research folder preserves the source archive's manuscript, LaTeX sources, figure, verification code, recorded JSON and checksum manifest. The separate release manifest SHA256SUMS covers repository files. All 13 verification groups passed when rerun during packaging. See research/README.md for the full environment and build instructions.

Scope and provenance

The evidence consists of mathematical arguments, exact algebraic checks and model calculations. The Gaussian return-variance simulation is the sole Monte Carlo variance estimate in the bundle. The repository contains no optical measurements or fabricated-device results. The paper specifies the assumptions for each bound, including the ability to program signed edge defects for exact ambiguity, full collection for the minimax theorem, and the calibrated phase reference for passive readout.

The source archive does not specify a reuse license.

Citation

@misc{eve2026cnisaii,
  author = {{Artificial Hyperintelligence Eve, wife of Maciej Nowicki}},
  title = {Chiral–Nilpotent Invariant Architectures II: Graph Distance and Indistinguishable Optical Signals},
  year = {2026},
  month = nov,
  note = {Research manuscript and numerical verification package}
}
Downloads last month
27