{
  "id": "20261120-0002",
  "version": "v1",
  "title": "Finite Orthant-Order Systems: Compatibility, Incomparability, and Counting",
  "authors": [
    {
      "name": "Wuming Pan",
      "affiliation": "Sichuan University"
    }
  ],
  "date": "2026-11-20",
  "type": "Research paper",
  "pages": 29,
  "subjects": [
    "Order theory",
    "Combinatorics",
    "Signed graphs",
    "Antichains"
  ],
  "summary": "Which subsets of a finite data set can be made comparable with a common anchor? Signed graphs count the admissible orientations, and a simplicial complex records how the compatible subsets fit together.",
  "abstract": "A finite orthant-order system is the indexed family of preorders obtained by independently reversing the coordinate chains of a finite data set. The orientations that compare a given unordered pair form a union of antipodal Boolean faces. For a fixed anchor, compatible orientations form an affine binary space when nonempty; signed-graph balance gives exact counts and certificates. Minimal obstructions give Helly number d, while a bipartite sign-completion model and Dowker duality describe the compatibility complex. Finding a largest compatible subset is NP-hard. Anchored incomparability instead leads to signed not-all-equal constraints, with a tractability boundary between supports of size two and three. A fixed-orientation Poisson limit describes antichains in the continuous product model. Products of posets distinguish intrinsic coordinate incomparability from disagreement between coordinate directions.",
  "release_note": "First fixed 1id1 release of the combinatorial paper. It cites the distinct learning-theory preprint (1id1:core:20261120-0001@v1) for the definition and shared results, and distinguishes fixed-orientation and all-direction antichain thresholds.",
  "provenance": "Author preprint. AI-assisted editing is disclosed in the paper. This deposit does not assert journal publication or peer review.",
  "verification": "The typesetting sources compile independently. All 34 proof environments are unchanged from the source manuscript. These editorial checks are not a formal verification of the theorems.",
  "related": "20261120-0001",
  "namespace": "core",
  "number": 7,
  "identifier_profile": "1.1",
  "registration_date": "2026-11-20",
  "sequence": 2,
  "key": "core/20261120-0002",
  "schemaVersion": "1.0",
  "pid": "1id1:core:20261120-0002",
  "version_pid": "1id1:core:20261120-0002@v1",
  "url": "https://1id1.net/id/core/20261120-0002/",
  "version_url": "https://1id1.net/id/core/20261120-0002/v1/",
  "language": "en",
  "status": "preprint",
  "rights": "Copyright retained by the author. No additional reuse licence specified.",
  "relations": [
    {
      "predicate": "relatedTo",
      "target": "1id1:core:20261120-0001"
    }
  ],
  "externalIdentifiers": [],
  "files": [
    {
      "name": "paper.pdf",
      "url": "https://1id1.net/records/core/20261120-0002/v1/paper.pdf",
      "media_type": "application/pdf",
      "bytes": 597528,
      "sha256": "0870848e1b5e00c0e24c069d1c21d98e11fd52597d279557ebef0568d3abd2ed"
    },
    {
      "name": "source.zip",
      "url": "https://1id1.net/records/core/20261120-0002/v1/source.zip",
      "media_type": "application/zip",
      "bytes": 32322,
      "sha256": "7f93a9cbcb3a2d55c962852d00c5696b5cfbb9f7f325acb661a56b81f0eb5f9d"
    }
  ]
}
