2688 3 12
17715147614460666
1213 1093 883 1681 715 1303
1242 2118 1035 1944 111 1857
2213 953 2101 953 1177 2101
1526 532 2254 2388 1764 14
# solutions_found 10
# distance_bound_overall 84
# 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 84
# latent_z_upper 84
# latent_min_upper 84
# latent_x_support [(0,24) (0,408) (0,792) (0,1176) (0,1560) (0,1944) (0,2328) (1,111) (1,495) (1,879) (1,1263) (1,1647) (1,2031) (1,2415) (2,321) (2,705) (2,1089) (2,1473) (2,1857) (2,2241) (2,2625) (3,90) (3,474) (3,858) ...]
# latent_z_support [(0,12) (0,396) (0,780) (0,1164) (0,1548) (0,1932) (0,2316) (1,170) (1,554) (1,938) (1,1322) (1,1706) (1,2090) (1,2474) (2,76) (2,460) (2,844) (2,1228) (2,1612) (2,1996) (2,2380) (3,194) (3,578) (3,962) ...]
# 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=64)
# nonlatent_x_upper 128
# nonlatent_z_upper 128
# nonlatent_min_upper 128
# nonlatent_x_m 2
# nonlatent_z_m 64
# nonlatent_x_support [(0,16) (0,58) (0,100) (0,142) (0,184) (0,226) (0,268) (0,310) (0,352) (0,394) (0,436) (0,478) (0,520) (0,562) (0,604) (0,646) (0,688) (0,730) (0,772) (0,814) (0,856) (0,898) (0,940) (0,982) ...]
# nonlatent_z_support [(6,1) (6,43) (6,85) (6,127) (6,169) (6,211) (6,253) (6,295) (6,337) (6,379) (6,421) (6,463) (6,505) (6,547) (6,589) (6,631) (6,673) (6,715) (6,757) (6,799) (6,841) (6,883) (6,925) (6,967) ...]