384 3 12
17229885754182916
181 145 233 169 337 89
282 8 180 84 296 108
127 157 277 163 13 229
63 366 138 129 294 114
# solutions_found 1
# distance_bound_overall 24
# latent_method Psi_3 kernel -> u^T H~X, v^T H~Z
# latent_note probabilistic search over Psi_3 / Psi_3^T kernels
# latent_x_upper 24
# latent_z_upper 24
# latent_min_upper 24
# latent_x_support [(0,84) (0,276) (1,104) (1,296) (2,108) (2,300) (3,90) (3,282) (4,8) (4,200) (5,180) (5,372) (6,129) (6,321) (7,102) (7,294) (8,114) (8,306) (9,63) (9,255) (10,174) (10,366) (11,138) (11,330)]
# latent_z_support [(0,117) (0,309) (1,30) (1,222) (2,186) (2,378) (3,63) (3,255) (4,54) (4,246) (5,66) (5,258) (6,12) (6,204) (7,108) (7,300) (8,184) (8,376) (9,78) (9,270) (10,180) (10,372) (11,88) (11,280)]
# nonlatent_method m-block-constant compression kernel -> lift
# nonlatent_note probabilistic search over all divisors m>=2 of P (best m_X=2, m_Z=12)
# nonlatent_x_upper 64
# nonlatent_z_upper 48
# nonlatent_min_upper 48
# nonlatent_x_m 2
# nonlatent_z_m 12
# nonlatent_x_support [(0,22) (0,25) (0,64) (0,67) (0,76) (0,79) (0,94) (0,106) (0,133) (0,145) (0,214) (0,217) (0,256) (0,259) (0,268) (0,271) (0,286) (0,298) (0,325) (0,337) (1,16) (1,40) (1,43) (1,58) ...]
# nonlatent_z_support [(0,1) (0,33) (0,65) (0,97) (0,129) (0,161) (0,193) (0,225) (0,257) (0,289) (0,321) (0,353) (2,23) (2,55) (2,87) (2,119) (2,151) (2,183) (2,215) (2,247) (2,279) (2,311) (2,343) (2,375) ...]