MDIT-CS Layer 2.5 (Engineering Spec)

Read full text
Authors: Jian Lin
Cited by: 0

Abstract

This document specifies an auditable and reproducible engineering implementation for MDIT-CS Layer 2.5, whose core primitive is the deterministic computation of a minimum node-cut cost:κG(S → x) = min{cost(C ) : C ⊆ V is a node-cut separating S and x} on a directed doctrine graph. The implementation is deterministic (fixed ASCII lexico- graphic ordering), uses integer-only Q16.16 arithmetic, and seals reproducibility via canonical JSON and output hashes. A runnable reference bundle provides source code, policies, schema, and test cases; readers are expected to execute local verification and compare output hashes to confirm determinism.

Fields of Study & Subjects

Complexity and Algorithms in Graphs Graph Theory and Algorithms Complex Network Analysis Techniques

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
7 February 2026
Document type
Preprint