{'fraction_non_alphanumeric': 0.060240963855421686, 'fraction_numerical': 0.0, 'mean_word_length': 4.285714285714286, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
NON-UNIFORM SAMPLING IN MULTIPLY GENERATED SHIFT-INVARIANT SUBSPACES OF Lp(IR)

Given the samples {f(xj) : j ∈ J} of a function f belonging to a shift invariant subspace of Lp(IR), we give a fast reconstruction algorithm that allows the exact reconstruction of f , as long as the sampling set X = {xj : j ∈ J} is sufficiently dense.