Yay crazy hybrids! I guess this one is kind of hard.
Draw a loop through adjacent vertices that cannot intersect itself. For each pair of symmetrically placed numbers, one is a Slitherlink clue which indicates how many of the four edges around it are drawn, and one is a Contact clue which indicates the total length of all straight segments adjacent to it where segment length is always measured up to the nearest turns in the loop.
(This was a WordPress bug that should no longer be relevant.)
My computer seems to like core-dumping recently.