{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VJL5I3GBR4ILJGMXM7L2HGV7BM","short_pith_number":"pith:VJL5I3GB","canonical_record":{"source":{"id":"1503.07027","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-24T13:29:12Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"66b2fc245080f5fab987c935e90506f3e2c045329a0f15a59f04814892ee2d4f","abstract_canon_sha256":"00a616501ba39ec5d023846027bec04063b6d3adaf389f8ede7b59794c15bdb9"},"schema_version":"1.0"},"canonical_sha256":"aa57d46cc18f10b4999767d7a39abf0b3a9ca536405775699bf0ea108ce8ecff","source":{"kind":"arxiv","id":"1503.07027","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07027","created_at":"2026-05-18T01:09:42Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07027v4","created_at":"2026-05-18T01:09:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07027","created_at":"2026-05-18T01:09:42Z"},{"alias_kind":"pith_short_12","alias_value":"VJL5I3GBR4IL","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VJL5I3GBR4ILJGMX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VJL5I3GB","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VJL5I3GBR4ILJGMXM7L2HGV7BM","target":"record","payload":{"canonical_record":{"source":{"id":"1503.07027","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-24T13:29:12Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"66b2fc245080f5fab987c935e90506f3e2c045329a0f15a59f04814892ee2d4f","abstract_canon_sha256":"00a616501ba39ec5d023846027bec04063b6d3adaf389f8ede7b59794c15bdb9"},"schema_version":"1.0"},"canonical_sha256":"aa57d46cc18f10b4999767d7a39abf0b3a9ca536405775699bf0ea108ce8ecff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:42.251602Z","signature_b64":"Za8EbvNMiHJKK05MVTwHA1IOmE+NQ9n/aSIa7DALTV1vHG4nfA5tngS/JjE7R3+OY0qbhCZ0fXjkGQKoXb17Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa57d46cc18f10b4999767d7a39abf0b3a9ca536405775699bf0ea108ce8ecff","last_reissued_at":"2026-05-18T01:09:42.251111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:42.251111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.07027","source_version":4,"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-18T01:09:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sNWlCYEmsZJNt3ArJ2ZbPEa5M1VMEyHMSbHgokHEFOsz5BhAif94HR/EsTfGuMZylmFJV4YKQv8R4VAKDpyRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:51:33.967041Z"},"content_sha256":"2770b83dd87e713bac4cb2a5140256d609a50341c1594edee984eed3915b4529","schema_version":"1.0","event_id":"sha256:2770b83dd87e713bac4cb2a5140256d609a50341c1594edee984eed3915b4529"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VJL5I3GBR4ILJGMXM7L2HGV7BM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence radius and sample complexity of ITKM algorithms for dictionary learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Karin Schnass","submitted_at":"2015-03-24T13:29:12Z","abstract_excerpt":"In this work we show that iterative thresholding and K-means (ITKM) algorithms can recover a generating dictionary with K atoms from noisy $S$ sparse signals up to an error $\\tilde \\varepsilon$ as long as the initialisation is within a convergence radius, that is up to a $\\log K$ factor inversely proportional to the dynamic range of the signals, and the sample size is proportional to $K \\log K \\tilde \\varepsilon^{-2}$. The results are valid for arbitrary target errors if the sparsity level is of the order of the square root of the signal dimension $d$ and for target errors down to $K^{-\\ell}$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07027","kind":"arxiv","version":4},"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-18T01:09:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BROXdU0Ume82rqoFCZjIIkbd4ZMj+ojp056/N1kI/W5lyn8CXjgQZVmGlwmKtYCtL5QgtO0U4AeQ8xURnlC6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:51:33.967411Z"},"content_sha256":"1d089bd71c449ab3574dd5a1a7fbc0bc80dcc947e1bf640e88708d20728ff54b","schema_version":"1.0","event_id":"sha256:1d089bd71c449ab3574dd5a1a7fbc0bc80dcc947e1bf640e88708d20728ff54b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJL5I3GBR4ILJGMXM7L2HGV7BM/bundle.json","state_url":"https://pith.science/pith/VJL5I3GBR4ILJGMXM7L2HGV7BM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJL5I3GBR4ILJGMXM7L2HGV7BM/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-22T23:51:33Z","links":{"resolver":"https://pith.science/pith/VJL5I3GBR4ILJGMXM7L2HGV7BM","bundle":"https://pith.science/pith/VJL5I3GBR4ILJGMXM7L2HGV7BM/bundle.json","state":"https://pith.science/pith/VJL5I3GBR4ILJGMXM7L2HGV7BM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJL5I3GBR4ILJGMXM7L2HGV7BM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VJL5I3GBR4ILJGMXM7L2HGV7BM","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":"00a616501ba39ec5d023846027bec04063b6d3adaf389f8ede7b59794c15bdb9","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-24T13:29:12Z","title_canon_sha256":"66b2fc245080f5fab987c935e90506f3e2c045329a0f15a59f04814892ee2d4f"},"schema_version":"1.0","source":{"id":"1503.07027","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07027","created_at":"2026-05-18T01:09:42Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07027v4","created_at":"2026-05-18T01:09:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07027","created_at":"2026-05-18T01:09:42Z"},{"alias_kind":"pith_short_12","alias_value":"VJL5I3GBR4IL","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VJL5I3GBR4ILJGMX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VJL5I3GB","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:1d089bd71c449ab3574dd5a1a7fbc0bc80dcc947e1bf640e88708d20728ff54b","target":"graph","created_at":"2026-05-18T01:09:42Z","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":"In this work we show that iterative thresholding and K-means (ITKM) algorithms can recover a generating dictionary with K atoms from noisy $S$ sparse signals up to an error $\\tilde \\varepsilon$ as long as the initialisation is within a convergence radius, that is up to a $\\log K$ factor inversely proportional to the dynamic range of the signals, and the sample size is proportional to $K \\log K \\tilde \\varepsilon^{-2}$. The results are valid for arbitrary target errors if the sparsity level is of the order of the square root of the signal dimension $d$ and for target errors down to $K^{-\\ell}$ ","authors_text":"Karin Schnass","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-24T13:29:12Z","title":"Convergence radius and sample complexity of ITKM algorithms for dictionary learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07027","kind":"arxiv","version":4},"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:2770b83dd87e713bac4cb2a5140256d609a50341c1594edee984eed3915b4529","target":"record","created_at":"2026-05-18T01:09:42Z","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":"00a616501ba39ec5d023846027bec04063b6d3adaf389f8ede7b59794c15bdb9","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-24T13:29:12Z","title_canon_sha256":"66b2fc245080f5fab987c935e90506f3e2c045329a0f15a59f04814892ee2d4f"},"schema_version":"1.0","source":{"id":"1503.07027","kind":"arxiv","version":4}},"canonical_sha256":"aa57d46cc18f10b4999767d7a39abf0b3a9ca536405775699bf0ea108ce8ecff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa57d46cc18f10b4999767d7a39abf0b3a9ca536405775699bf0ea108ce8ecff","first_computed_at":"2026-05-18T01:09:42.251111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:42.251111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Za8EbvNMiHJKK05MVTwHA1IOmE+NQ9n/aSIa7DALTV1vHG4nfA5tngS/JjE7R3+OY0qbhCZ0fXjkGQKoXb17Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:42.251602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07027","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2770b83dd87e713bac4cb2a5140256d609a50341c1594edee984eed3915b4529","sha256:1d089bd71c449ab3574dd5a1a7fbc0bc80dcc947e1bf640e88708d20728ff54b"],"state_sha256":"bdae65d9ac0046e4538f4bec8cdbc7667bb6040da9e99d857eb6f6334a8ac515"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QOYv3vhDxJb/iWtTcku0lD3AhrJq7xAA5cLc7bLW1u0IGUU3nDKHhDiOagw/UOPw7/0bRyQe5Ej4os4xcNLhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:51:33.969432Z","bundle_sha256":"8ae443624f407774a6b6f9608878e819e370dd386fb8e3ecb0c3c60b857e358f"}}