Skip to content

Registered

Registered before Stage 1: H1 carries a file-type-matched supplementary estimand

Decided on the open question the language-mix ceiling raised: OpenStack's halves split 40% reStructuredText against 62% Python, so part of a half-split contrast could be a document-type difference. H1 now carries a supplementary estimand, as H2 carries one restricted to C++: the same contrast on one file suffix per admitted organization, the one both halves hold most of, meaning the largest smaller count across the two halves' training rows, ties by name (matched_suffix). Pooling the halves was rejected in review: a large docs-heavy half could make a suffix the small half barely has the pooled winner, and that cell would fail for want of changes. For OpenStack the rule gives .py (692 and 1,362 training rows; .rst has 871 and 313). The suffix is derived in code from the organization's split-criteria artifact, never passed in, and each half's test-window share of it is reported. Under ICH E9(R1) a restricted population is a different estimand, so it is reported beside H1 and decides nothing. The rule was registered after OpenStack's development-window pilot had been read, and reads only training-window suffix counts. It costs no training: the adapters' existing scores are read on the subset. cpp_supplement and file_type_supplement share one restricted-bootstrap helper, which builds each cell's clusters inside its error handling, as cpp_supplement did.

Registered before Stage 1: the confirmatory cells are a rule over the admitted organizations

The granularity design had two fixed cell sets, with and without Chromium, and both put Qt in H1. Since 2026-09-26 an organization enters a confirmatory cell only from a host permitting automated access in writing, so Qt, Chromium and Wikimedia are each admitted or not independently, and two fixed sets no longer cover the cases. The cells are now built by one rule from the admitted set (design() in sphragis/experiment/decomposition.py), fixed here before any Wikimedia contrast exists:

Registered before Stage 1: the confirmatory design rests only on hosts that permit automated access

The test window is collected fresh after in-principle acceptance, on every organization. On 2026-09-26 neither permission request had an answer: Qt's ticket QTQAINFRA-8064 is open with no comment, and nothing has come back from Chromium's infra-dev list. codereview.qt-project.org and code.qt.io both serve Disallow: /, so the fallback registered on 2026-09-22 (H1 on OpenStack and Qt) still depends on a permission that may not come: Qt's test window cannot be collected without it. The Chromium deadline covered H2 and left that dependency unstated.

Registered before the human's figures: the check stops at 152 items, and its halves are read apart

The human checked item-002 to item-153 between 2026-09-24 and 2026-09-26, 152 items past the rubric's worked example. The check stops there, fixed before any human-to-model figure is computed. The page shows items in the batches' seeded order, so the 152 are a random sample of the 383, and a stop chosen after seeing agreement would be optional stopping.

Registered: negative readings are bounded by each cell's detectable effect, and rebase edits get a sensitivity analysis

Negative readings. The proposal of 2026-09-23 is adopted. A cell reads bounded when its interval's upper bound lies below the effect the sensitivity analysis says that cell detects at the Holm level it is read at; the gate reads the bounds from decomposition-sensitivity.json (detectable_effects) and refuses a confirmatory cell without one at every level. The SESOI band is reported beside every cell and decides nothing. Justification: Lakens, Scheel and Isager (2018) list the effect a study was designed to detect among the bases for an equivalence bound, and Lakens (2022) asks a design to say which effects it is informative about when it cannot resolve the SESOI. The bound is reachable where absence was not: the regenerated sensitivity artifact records null_reads_bounded per cell and level beside null_reads_absent: a true null reads bounded 0.97 of the time in three of the four H1 cells and 0.94 in Qt's at 95%, against 0.000 absent in all four; every other figure in the artifact reproduced exactly. The bounds are recomputed at N on corpus v2 before the seal opens. A reversed effect now reads bounded, since H1 is directional.

Registered before the human's figures: a reported slip stays as locked

The check page locks the human's label and outside-names answer before it reveals rater A's. A checker can notice a mis-click only after the reveal, and a correction made after seeing the rater is no longer blind, so it does not replace the locked answer. The rule, fixed before any human agreement is computed: every human figure is read on the answers as locked, and each pair a reported slip touches is also reported without that item (human_slips and the without slips pairs). Slips are marked on the page beside the locked answer and saved with the check; label_audit_agreement.py reads them from there, and --slip ITEM:FIELD adds one by hand.

Registered before computing: the placebo gate, and how it will be read

The registered gate compares an adapter trained on one organization against one trained on another, on the first organization's held-out refinements. It cannot say on its own that the organization is what the adapters learned. A project, a codebase family or a document type would all produce the same reading, and this study's own separability probe already reports that two projects inside one organization separate as well as two organizations do (0.828 and 0.872 within, against 0.849 across, on matched Python).

Registered before computing: do AOSP's projects share conventions that Qt's do not?

The one mechanism for organizational coherence still standing is shared code conventions. It predicts something the convention-shape probe can measure without any adapter: within an organization, how separable its C++ projects are from one another when read only as convention shapes. Separability near 0.5 means the projects write alike; high separability means each project has its own conventions.

Registered before computing: collaboration overlap across an organization's projects

From the raw change records, which carry salted pseudonyms for each change's owner, submitter and attention set: for each C++ project in the committed source list, the set of accounts that appear on its changes, and for each organization the mean Jaccard overlap between the account sets of its different projects. No account is identified; only set sizes and intersections are read.

Registered before the run: what FedSA-LoRA's shared matrix should leak

Jobs 149581 and 149582. FedSA-LoRA (Guo, Zeng, Wang, Fan, Wang and Qu, ICLR 2025, arXiv:2410.01463, read from the PDF) shares only the A matrices with the server and keeps B local, on the finding that "A matrices are responsible for learning general knowledge, while B matrices focus on capturing client-specific knowledge", evidenced by A matrices being "more similar across clients than the B matrices". It is a privacy argument by construction, and the paper is the basis for FedSA-rsLoRA and FedSA-VeRA.