{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OBZJVA4XJAAIGEXCQOGE5HCL4P","short_pith_number":"pith:OBZJVA4X","canonical_record":{"source":{"id":"1804.04897","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-04-13T11:54:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ce2ed4cd9f28e00d8d43d42b606723aab6e0a8ea456906bba81316a5b8d64170","abstract_canon_sha256":"0af152ce8c14b682aad663880648e28341e0720f886bcf89fdca82bc2b2eb25e"},"schema_version":"1.0"},"canonical_sha256":"70729a839748008312e2838c4e9c4be3e843f116332da979e377d00ceeab4726","source":{"kind":"arxiv","id":"1804.04897","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04897","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04897v2","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04897","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"OBZJVA4XJAAI","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OBZJVA4XJAAIGEXC","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OBZJVA4X","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OBZJVA4XJAAIGEXCQOGE5HCL4P","target":"record","payload":{"canonical_record":{"source":{"id":"1804.04897","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-04-13T11:54:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ce2ed4cd9f28e00d8d43d42b606723aab6e0a8ea456906bba81316a5b8d64170","abstract_canon_sha256":"0af152ce8c14b682aad663880648e28341e0720f886bcf89fdca82bc2b2eb25e"},"schema_version":"1.0"},"canonical_sha256":"70729a839748008312e2838c4e9c4be3e843f116332da979e377d00ceeab4726","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:59.043047Z","signature_b64":"ccUMjsuPd4jG4m8/o8ARqiEqN/zm2iOMAZ27rNS6c8uIQNqhcVHzv5ksWvQ27iBGQ3tqAukBfrstoDB78eD9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70729a839748008312e2838c4e9c4be3e843f116332da979e377d00ceeab4726","last_reissued_at":"2026-05-17T23:51:59.042635Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:59.042635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.04897","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RabMx5jyvLmvSvAtX7h+QYhzzxC/TRnvskAlbm51ouOo4L2U9i2BCspKbjCioK1JzH/on0DuNCoUxhVy5ygTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:51:49.431207Z"},"content_sha256":"86ce13ffb103641bf7d3a8d7da35f52e906879e55834b91ea965a9b15d52dee1","schema_version":"1.0","event_id":"sha256:86ce13ffb103641bf7d3a8d7da35f52e906879e55834b91ea965a9b15d52dee1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OBZJVA4XJAAIGEXCQOGE5HCL4P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Minimal Overcompleteness Allowing Universal Sparse Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Rotem Mulayoff, Tomer Michaeli","submitted_at":"2018-04-13T11:54:28Z","abstract_excerpt":"Sparse representation over redundant dictionaries constitutes a good model for many classes of signals (e.g., patches of natural images, segments of speech signals, etc.). However, despite its popularity, very little is known about the representation capacity of this model. In this paper, we study how redundant a dictionary must be so as to allow any vector to admit a sparse approximation with a prescribed sparsity and a prescribed level of accuracy. We address this problem both in a worst-case setting and in an average-case one. For each scenario we derive lower and upper bounds on the minima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04897","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXCgMXXCrw2M7OHr7J1MNM8g8DeI7qPKdX1Rg061K/sW4h+VjD48vapn26cohnDXogkKpS557vHMjrOvq4obCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:51:49.431574Z"},"content_sha256":"8ce60b9f06a145b9057b37b6d81183dd1554703966a8ef6ce5c517032a295144","schema_version":"1.0","event_id":"sha256:8ce60b9f06a145b9057b37b6d81183dd1554703966a8ef6ce5c517032a295144"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBZJVA4XJAAIGEXCQOGE5HCL4P/bundle.json","state_url":"https://pith.science/pith/OBZJVA4XJAAIGEXCQOGE5HCL4P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBZJVA4XJAAIGEXCQOGE5HCL4P/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T22:51:49Z","links":{"resolver":"https://pith.science/pith/OBZJVA4XJAAIGEXCQOGE5HCL4P","bundle":"https://pith.science/pith/OBZJVA4XJAAIGEXCQOGE5HCL4P/bundle.json","state":"https://pith.science/pith/OBZJVA4XJAAIGEXCQOGE5HCL4P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBZJVA4XJAAIGEXCQOGE5HCL4P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OBZJVA4XJAAIGEXCQOGE5HCL4P","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0af152ce8c14b682aad663880648e28341e0720f886bcf89fdca82bc2b2eb25e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-04-13T11:54:28Z","title_canon_sha256":"ce2ed4cd9f28e00d8d43d42b606723aab6e0a8ea456906bba81316a5b8d64170"},"schema_version":"1.0","source":{"id":"1804.04897","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04897","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04897v2","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04897","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"OBZJVA4XJAAI","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OBZJVA4XJAAIGEXC","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OBZJVA4X","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:8ce60b9f06a145b9057b37b6d81183dd1554703966a8ef6ce5c517032a295144","target":"graph","created_at":"2026-05-17T23:51:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Sparse representation over redundant dictionaries constitutes a good model for many classes of signals (e.g., patches of natural images, segments of speech signals, etc.). However, despite its popularity, very little is known about the representation capacity of this model. In this paper, we study how redundant a dictionary must be so as to allow any vector to admit a sparse approximation with a prescribed sparsity and a prescribed level of accuracy. We address this problem both in a worst-case setting and in an average-case one. For each scenario we derive lower and upper bounds on the minima","authors_text":"Rotem Mulayoff, Tomer Michaeli","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-04-13T11:54:28Z","title":"On the Minimal Overcompleteness Allowing Universal Sparse Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04897","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:86ce13ffb103641bf7d3a8d7da35f52e906879e55834b91ea965a9b15d52dee1","target":"record","created_at":"2026-05-17T23:51:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0af152ce8c14b682aad663880648e28341e0720f886bcf89fdca82bc2b2eb25e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-04-13T11:54:28Z","title_canon_sha256":"ce2ed4cd9f28e00d8d43d42b606723aab6e0a8ea456906bba81316a5b8d64170"},"schema_version":"1.0","source":{"id":"1804.04897","kind":"arxiv","version":2}},"canonical_sha256":"70729a839748008312e2838c4e9c4be3e843f116332da979e377d00ceeab4726","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70729a839748008312e2838c4e9c4be3e843f116332da979e377d00ceeab4726","first_computed_at":"2026-05-17T23:51:59.042635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:59.042635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ccUMjsuPd4jG4m8/o8ARqiEqN/zm2iOMAZ27rNS6c8uIQNqhcVHzv5ksWvQ27iBGQ3tqAukBfrstoDB78eD9Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:59.043047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.04897","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86ce13ffb103641bf7d3a8d7da35f52e906879e55834b91ea965a9b15d52dee1","sha256:8ce60b9f06a145b9057b37b6d81183dd1554703966a8ef6ce5c517032a295144"],"state_sha256":"33357823ba5f4f2c27b7744ba2228c7de51fd890d3f63e5f06287881e8a4131a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pf7oAfcis+AuxMW3CvEU14LDTSP47/bsTjUs1SUDv+2fq/LlonNopIUxb/XY7tZnD7xzIhEs6uo7Npk2qavTCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:51:49.433516Z","bundle_sha256":"64d8e4824651def7f77684971312deeb79403cb7a1d489219a64482cbdde761e"}}