{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TY5C7XCHN7PHQM2WVPLEEYGNUS","short_pith_number":"pith:TY5C7XCH","schema_version":"1.0","canonical_sha256":"9e3a2fdc476fde783356abd64260cda49dcdf280f8b468ca01f2e1ab958904d6","source":{"kind":"arxiv","id":"1112.0665","version":3},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.0665","created_at":"2026-05-18T03:39:41.873793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0665v3","created_at":"2026-05-18T03:39:41.873793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0665","created_at":"2026-05-18T03:39:41.873793+00:00"},{"alias_kind":"pith_short_12","alias_value":"TY5C7XCHN7PH","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TY5C7XCHN7PHQM2W","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TY5C7XCH","created_at":"2026-05-18T12:26:42.757692+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS","json":"https://pith.science/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS.json","graph_json":"https://pith.science/api/pith-number/TY5C7XCHN7PHQM2WVPLEEYGNUS/graph.json","events_json":"https://pith.science/api/pith-number/TY5C7XCHN7PHQM2WVPLEEYGNUS/events.json","paper":"https://pith.science/paper/TY5C7XCH"},"agent_actions":{"view_html":"https://pith.science/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS","download_json":"https://pith.science/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS.json","view_paper":"https://pith.science/paper/TY5C7XCH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0665&json=true","fetch_graph":"https://pith.science/api/pith-number/TY5C7XCHN7PHQM2WVPLEEYGNUS/graph.json","fetch_events":"https://pith.science/api/pith-number/TY5C7XCHN7PHQM2WVPLEEYGNUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS/action/storage_attestation","attest_author":"https://pith.science/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS/action/author_attestation","sign_citation":"https://pith.science/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS/action/citation_signature","submit_replication":"https://pith.science/pith/TY5C7XCHN7PHQM2WVPLEEYGNUS/action/replication_record"}},"created_at":"2026-05-18T03:39:41.873793+00:00","updated_at":"2026-05-18T03:39:41.873793+00:00"}