{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5LHJIT5FOKZXE35ZOVCP2RATZL","short_pith_number":"pith:5LHJIT5F","canonical_record":{"source":{"id":"1907.01121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-02T01:36:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"19c9ffb4cf6bc3ff53a580224cfc516d523eaa2fbe5470d3b72c7b4f3719d73b","abstract_canon_sha256":"7d010cbd0f662750a54743dcab904de92c75dc5cce0174e22d86a9ed16e4f028"},"schema_version":"1.0"},"canonical_sha256":"eace944fa572b3726fb97544fd4413cacf7113ed032581c6f6fdf9750d52265c","source":{"kind":"arxiv","id":"1907.01121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01121","created_at":"2026-05-17T23:41:41Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01121v1","created_at":"2026-05-17T23:41:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01121","created_at":"2026-05-17T23:41:41Z"},{"alias_kind":"pith_short_12","alias_value":"5LHJIT5FOKZX","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5LHJIT5FOKZXE35Z","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5LHJIT5F","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5LHJIT5FOKZXE35ZOVCP2RATZL","target":"record","payload":{"canonical_record":{"source":{"id":"1907.01121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-02T01:36:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"19c9ffb4cf6bc3ff53a580224cfc516d523eaa2fbe5470d3b72c7b4f3719d73b","abstract_canon_sha256":"7d010cbd0f662750a54743dcab904de92c75dc5cce0174e22d86a9ed16e4f028"},"schema_version":"1.0"},"canonical_sha256":"eace944fa572b3726fb97544fd4413cacf7113ed032581c6f6fdf9750d52265c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:41.205265Z","signature_b64":"5/ZnTyHS/F/7RzntjJs8VQoAaSCyz4QE91It2+sELKGa1Asgygc5udUxGCZYfPej4v9D/6TY4OcoZj2XGS8MAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eace944fa572b3726fb97544fd4413cacf7113ed032581c6f6fdf9750d52265c","last_reissued_at":"2026-05-17T23:41:41.204548Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:41.204548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.01121","source_version":1,"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:41:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DroE5Zz/KsNHKIpBj7az6A8s54bJUIxRL9cF5Hz4WqrK20qtOkMcQkhTRD3KhD2jbtVCnNwAGjW7UnoMO5kqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:27:05.097640Z"},"content_sha256":"3844c50a92d4595632b21d6306cf988416568f6017144df04238d5285755335e","schema_version":"1.0","event_id":"sha256:3844c50a92d4595632b21d6306cf988416568f6017144df04238d5285755335e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5LHJIT5FOKZXE35ZOVCP2RATZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Iteratively Re-weighted Method for Problems with Sparsity-Inducing Norms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Feiping Nie, Heng Huang, Rong Wang, Xiaoqian Wang, Xuelong Li, Zhanxuan Hu","submitted_at":"2019-07-02T01:36:52Z","abstract_excerpt":"This work aims at solving the problems with intractable sparsity-inducing norms that are often encountered in various machine learning tasks, such as multi-task learning, subspace clustering, feature selection, robust principal component analysis, and so on. Specifically, an Iteratively Re-Weighted method (IRW) with solid convergence guarantee is provided. We investigate its convergence speed via numerous experiments on real data. Furthermore, in order to validate the practicality of IRW, we use it to solve a concrete robust feature selection model with complicated objective function. The expe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01121","kind":"arxiv","version":1},"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:41:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eeXyjjgN3ajC2lr0/atVdFOfSGLIvuNVBgtV5Vh5edA8lr8UBE4LbwMytjJj/87zaGfSyKgKAwYUpeWvK9JxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:27:05.097983Z"},"content_sha256":"156b784ebc1d2025140494c17382cf4c332434ba790dde65c61e3491b96d786c","schema_version":"1.0","event_id":"sha256:156b784ebc1d2025140494c17382cf4c332434ba790dde65c61e3491b96d786c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LHJIT5FOKZXE35ZOVCP2RATZL/bundle.json","state_url":"https://pith.science/pith/5LHJIT5FOKZXE35ZOVCP2RATZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LHJIT5FOKZXE35ZOVCP2RATZL/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-04T20:27:05Z","links":{"resolver":"https://pith.science/pith/5LHJIT5FOKZXE35ZOVCP2RATZL","bundle":"https://pith.science/pith/5LHJIT5FOKZXE35ZOVCP2RATZL/bundle.json","state":"https://pith.science/pith/5LHJIT5FOKZXE35ZOVCP2RATZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LHJIT5FOKZXE35ZOVCP2RATZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5LHJIT5FOKZXE35ZOVCP2RATZL","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":"7d010cbd0f662750a54743dcab904de92c75dc5cce0174e22d86a9ed16e4f028","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-02T01:36:52Z","title_canon_sha256":"19c9ffb4cf6bc3ff53a580224cfc516d523eaa2fbe5470d3b72c7b4f3719d73b"},"schema_version":"1.0","source":{"id":"1907.01121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01121","created_at":"2026-05-17T23:41:41Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01121v1","created_at":"2026-05-17T23:41:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01121","created_at":"2026-05-17T23:41:41Z"},{"alias_kind":"pith_short_12","alias_value":"5LHJIT5FOKZX","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5LHJIT5FOKZXE35Z","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5LHJIT5F","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:156b784ebc1d2025140494c17382cf4c332434ba790dde65c61e3491b96d786c","target":"graph","created_at":"2026-05-17T23:41: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 work aims at solving the problems with intractable sparsity-inducing norms that are often encountered in various machine learning tasks, such as multi-task learning, subspace clustering, feature selection, robust principal component analysis, and so on. Specifically, an Iteratively Re-Weighted method (IRW) with solid convergence guarantee is provided. We investigate its convergence speed via numerous experiments on real data. Furthermore, in order to validate the practicality of IRW, we use it to solve a concrete robust feature selection model with complicated objective function. The expe","authors_text":"Feiping Nie, Heng Huang, Rong Wang, Xiaoqian Wang, Xuelong Li, Zhanxuan Hu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-02T01:36:52Z","title":"An Iteratively Re-weighted Method for Problems with Sparsity-Inducing Norms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01121","kind":"arxiv","version":1},"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:3844c50a92d4595632b21d6306cf988416568f6017144df04238d5285755335e","target":"record","created_at":"2026-05-17T23:41: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":"7d010cbd0f662750a54743dcab904de92c75dc5cce0174e22d86a9ed16e4f028","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-02T01:36:52Z","title_canon_sha256":"19c9ffb4cf6bc3ff53a580224cfc516d523eaa2fbe5470d3b72c7b4f3719d73b"},"schema_version":"1.0","source":{"id":"1907.01121","kind":"arxiv","version":1}},"canonical_sha256":"eace944fa572b3726fb97544fd4413cacf7113ed032581c6f6fdf9750d52265c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eace944fa572b3726fb97544fd4413cacf7113ed032581c6f6fdf9750d52265c","first_computed_at":"2026-05-17T23:41:41.204548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:41.204548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5/ZnTyHS/F/7RzntjJs8VQoAaSCyz4QE91It2+sELKGa1Asgygc5udUxGCZYfPej4v9D/6TY4OcoZj2XGS8MAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:41.205265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3844c50a92d4595632b21d6306cf988416568f6017144df04238d5285755335e","sha256:156b784ebc1d2025140494c17382cf4c332434ba790dde65c61e3491b96d786c"],"state_sha256":"7425d12846d45e70ef0aa279fe6df60ed35a2b0f3a5d5a91adfe3646aa5bc9ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"haUlF5FIKWrxgFUmflF6+ERD4mJPTpk8U7prI/qo2wqckju0DcfLj+W6dgAKslodpSGSXQCzjq/la+0QeTeoAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:27:05.099958Z","bundle_sha256":"f2989dd25708f652b8f072379b0ad685ffc752df6bba04226dcf56822e8f38c8"}}