{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TY5C7XCHN7PHQM2WVPLEEYGNUS","short_pith_number":"pith:TY5C7XCH","canonical_record":{"source":{"id":"1112.0665","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-03T15:12:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"42308ac9cd25977af5a0384041634a27ad9f44a8e8d9b9607d1df770fa6042c4","abstract_canon_sha256":"b2a13b4e9c20fa6c42b76efca8eca08d03afdb611d015cb211f589677b53145c"},"schema_version":"1.0"},"canonical_sha256":"9e3a2fdc476fde783356abd64260cda49dcdf280f8b468ca01f2e1ab958904d6","source":{"kind":"arxiv","id":"1112.0665","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0665","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0665v3","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0665","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"TY5C7XCHN7PH","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TY5C7XCHN7PHQM2W","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TY5C7XCH","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TY5C7XCHN7PHQM2WVPLEEYGNUS","target":"record","payload":{"canonical_record":{"source":{"id":"1112.0665","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-03T15:12:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"42308ac9cd25977af5a0384041634a27ad9f44a8e8d9b9607d1df770fa6042c4","abstract_canon_sha256":"b2a13b4e9c20fa6c42b76efca8eca08d03afdb611d015cb211f589677b53145c"},"schema_version":"1.0"},"canonical_sha256":"9e3a2fdc476fde783356abd64260cda49dcdf280f8b468ca01f2e1ab958904d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:41.874574Z","signature_b64":"WQzwPYPc+tpWd7eJtbgyYYHY5m4lR88IurgZPphEmGzsAnpc5PBrd+0PW1Q7DAybogopkk0oNXR2zkAjOODGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e3a2fdc476fde783356abd64260cda49dcdf280f8b468ca01f2e1ab958904d6","last_reissued_at":"2026-05-18T03:39:41.873673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:41.873673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.0665","source_version":3,"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-18T03:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sl/gPoMqKWkUCyrohjH+qSIcxRgAJDFzBANpQDf9KUrPo08UdewNBSR0HWHc5ICOz2st86/5JynyElkZw69GAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:51:02.015349Z"},"content_sha256":"b879fe068b0238c955b5016eb0fe993dfabad93cf0ecf7b9dd2e42258220a063","schema_version":"1.0","event_id":"sha256:b879fe068b0238c955b5016eb0fe993dfabad93cf0ecf7b9dd2e42258220a063"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TY5C7XCHN7PHQM2WVPLEEYGNUS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Thresholding and Online Sparsity-Aware Learning in a Union of Subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Konstantinos Slavakis, Sergios Theodoridis, Stephen McLaughlin, Yannis Kopsinis","submitted_at":"2011-12-03T15:12:35Z","abstract_excerpt":"This paper studies a sparse signal recovery task in time-varying (time-adaptive) environments. The contribution of the paper to sparsity-aware online learning is threefold; first, a Generalized Thresholding (GT) operator, which relates to both convex and non-convex penalty functions, is introduced. This operator embodies, in a unified way, the majority of well-known thresholding rules which promote sparsity. Second, a non-convexly constrained, sparsity-promoting, online learning scheme, namely the Adaptive Projection-based Generalized Thresholding (APGT), is developed that incorporates the GT "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0665","kind":"arxiv","version":3},"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-18T03:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wteX9wvhajt1ru4KF+sukpvUSuOrLcaD995yMhVT/shwldHgLVMZlXIoCFs8LoIp/weIt9l9lYzZ+kRKhCqaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:51:02.015698Z"},"content_sha256":"411d86fe80ac53ef64418a27f4e5e320e17d5b49479641e01bb4b307991cf717","schema_version":"1.0","event_id":"sha256:411d86fe80ac53ef64418a27f4e5e320e17d5b49479641e01bb4b307991cf717"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS/bundle.json","state_url":"https://pith.science/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS/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-03T16:51:02Z","links":{"resolver":"https://pith.science/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS","bundle":"https://pith.science/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS/bundle.json","state":"https://pith.science/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TY5C7XCHN7PHQM2WVPLEEYGNUS","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":"b2a13b4e9c20fa6c42b76efca8eca08d03afdb611d015cb211f589677b53145c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-03T15:12:35Z","title_canon_sha256":"42308ac9cd25977af5a0384041634a27ad9f44a8e8d9b9607d1df770fa6042c4"},"schema_version":"1.0","source":{"id":"1112.0665","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0665","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0665v3","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0665","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"TY5C7XCHN7PH","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TY5C7XCHN7PHQM2W","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TY5C7XCH","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:411d86fe80ac53ef64418a27f4e5e320e17d5b49479641e01bb4b307991cf717","target":"graph","created_at":"2026-05-18T03:39:41Z","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":"This paper studies a sparse signal recovery task in time-varying (time-adaptive) environments. The contribution of the paper to sparsity-aware online learning is threefold; first, a Generalized Thresholding (GT) operator, which relates to both convex and non-convex penalty functions, is introduced. This operator embodies, in a unified way, the majority of well-known thresholding rules which promote sparsity. Second, a non-convexly constrained, sparsity-promoting, online learning scheme, namely the Adaptive Projection-based Generalized Thresholding (APGT), is developed that incorporates the GT ","authors_text":"Konstantinos Slavakis, Sergios Theodoridis, Stephen McLaughlin, Yannis Kopsinis","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-03T15:12:35Z","title":"Generalized Thresholding and Online Sparsity-Aware Learning in a Union of Subspaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0665","kind":"arxiv","version":3},"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:b879fe068b0238c955b5016eb0fe993dfabad93cf0ecf7b9dd2e42258220a063","target":"record","created_at":"2026-05-18T03:39:41Z","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":"b2a13b4e9c20fa6c42b76efca8eca08d03afdb611d015cb211f589677b53145c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-03T15:12:35Z","title_canon_sha256":"42308ac9cd25977af5a0384041634a27ad9f44a8e8d9b9607d1df770fa6042c4"},"schema_version":"1.0","source":{"id":"1112.0665","kind":"arxiv","version":3}},"canonical_sha256":"9e3a2fdc476fde783356abd64260cda49dcdf280f8b468ca01f2e1ab958904d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e3a2fdc476fde783356abd64260cda49dcdf280f8b468ca01f2e1ab958904d6","first_computed_at":"2026-05-18T03:39:41.873673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:41.873673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WQzwPYPc+tpWd7eJtbgyYYHY5m4lR88IurgZPphEmGzsAnpc5PBrd+0PW1Q7DAybogopkk0oNXR2zkAjOODGAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:41.874574Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.0665","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b879fe068b0238c955b5016eb0fe993dfabad93cf0ecf7b9dd2e42258220a063","sha256:411d86fe80ac53ef64418a27f4e5e320e17d5b49479641e01bb4b307991cf717"],"state_sha256":"9797396dbefa455f81b0a24b9b8dd4ecee3b9a23e1e55893033cc3f79f4f8e0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i51lKwc6t1fdV2V7rllUb9vbJE1/FLesVO5sP895qmwPeiIBQGRvvWkKyLcJ5Wl37aPK/s/BgTZ2/U3U1eaqDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:51:02.017936Z","bundle_sha256":"339f0ad2e15ea82f41fc993df91488f62960d3491e9c88c2044ad3a0dffdc702"}}