{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ACDWS7VUHZ34AOEPVUVIR3DRZ2","short_pith_number":"pith:ACDWS7VU","canonical_record":{"source":{"id":"1703.00119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-01T03:30:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7ff3d9a1546e941d315cd49713515f0f4a020f362ab25a59fd64141d38d35a4f","abstract_canon_sha256":"6097e6102baf21177db9545932602963d75fb5671a7fa9be89db079ee3852281"},"schema_version":"1.0"},"canonical_sha256":"0087697eb43e77c0388fad2a88ec71ceba90770a042377baaf7a0eff241261b1","source":{"kind":"arxiv","id":"1703.00119","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00119","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00119v2","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00119","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"ACDWS7VUHZ34","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"ACDWS7VUHZ34AOEP","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"ACDWS7VU","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ACDWS7VUHZ34AOEPVUVIR3DRZ2","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-01T03:30:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7ff3d9a1546e941d315cd49713515f0f4a020f362ab25a59fd64141d38d35a4f","abstract_canon_sha256":"6097e6102baf21177db9545932602963d75fb5671a7fa9be89db079ee3852281"},"schema_version":"1.0"},"canonical_sha256":"0087697eb43e77c0388fad2a88ec71ceba90770a042377baaf7a0eff241261b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:57.880938Z","signature_b64":"wkzgtGP/y/vY+/THNvJCS5tEmT8Hq2BKXf5iOU+pvHWqU9oCZKhIXxoU7K8eDvLoFJnQa2nZqxakvlZoKoBSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0087697eb43e77c0388fad2a88ec71ceba90770a042377baaf7a0eff241261b1","last_reissued_at":"2026-05-18T00:41:57.880371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:57.880371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00119","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-18T00:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Be3VBK3YrFSI958MR731BB0WKVOrnyE7sH8la5C03UREcRyOnMOC37o3wXFceTw2n4C6Qx4YClrbOuAya98mBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:03:05.206134Z"},"content_sha256":"8ee48ea0d819a1bdfca301230ed8a2ad792e3192c4efc17db24b66e531a0f50c","schema_version":"1.0","event_id":"sha256:8ee48ea0d819a1bdfca301230ed8a2ad792e3192c4efc17db24b66e531a0f50c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ACDWS7VUHZ34AOEPVUVIR3DRZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to Non-smooth Concave Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bo Liu, Dimitris N. Metaxas, Lezi Wang, Qingshan Liu, Xiao-Tong Yuan","submitted_at":"2017-03-01T03:30:47Z","abstract_excerpt":"Iterative Hard Thresholding (IHT) is a class of projected gradient descent methods for optimizing sparsity-constrained minimization models, with the best known efficiency and scalability in practice. As far as we know, the existing IHT-style methods are designed for sparse minimization in primal form. It remains open to explore duality theory and algorithms in such a non-convex and NP-hard problem setting. In this paper, we bridge this gap by establishing a duality theory for sparsity-constrained minimization with $\\ell_2$-regularized loss function and proposing an IHT-style algorithm for dual"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00119","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-18T00:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nQWH3IIT9X6i41FM1o5Rm0HufsNIhlGKdPkMJJwj03zGrv3PE+csaaRs5T4oRSPXMqdHTwI7Pp1HfUCkoVp2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:03:05.206613Z"},"content_sha256":"28a188a0b5998c722498823074b9d5af9dc8455236a863a84b936aa7bbfbbfbb","schema_version":"1.0","event_id":"sha256:28a188a0b5998c722498823074b9d5af9dc8455236a863a84b936aa7bbfbbfbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACDWS7VUHZ34AOEPVUVIR3DRZ2/bundle.json","state_url":"https://pith.science/pith/ACDWS7VUHZ34AOEPVUVIR3DRZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACDWS7VUHZ34AOEPVUVIR3DRZ2/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-01T14:03:05Z","links":{"resolver":"https://pith.science/pith/ACDWS7VUHZ34AOEPVUVIR3DRZ2","bundle":"https://pith.science/pith/ACDWS7VUHZ34AOEPVUVIR3DRZ2/bundle.json","state":"https://pith.science/pith/ACDWS7VUHZ34AOEPVUVIR3DRZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACDWS7VUHZ34AOEPVUVIR3DRZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ACDWS7VUHZ34AOEPVUVIR3DRZ2","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":"6097e6102baf21177db9545932602963d75fb5671a7fa9be89db079ee3852281","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-01T03:30:47Z","title_canon_sha256":"7ff3d9a1546e941d315cd49713515f0f4a020f362ab25a59fd64141d38d35a4f"},"schema_version":"1.0","source":{"id":"1703.00119","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00119","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00119v2","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00119","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"ACDWS7VUHZ34","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"ACDWS7VUHZ34AOEP","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"ACDWS7VU","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:28a188a0b5998c722498823074b9d5af9dc8455236a863a84b936aa7bbfbbfbb","target":"graph","created_at":"2026-05-18T00:41:57Z","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":"Iterative Hard Thresholding (IHT) is a class of projected gradient descent methods for optimizing sparsity-constrained minimization models, with the best known efficiency and scalability in practice. As far as we know, the existing IHT-style methods are designed for sparse minimization in primal form. It remains open to explore duality theory and algorithms in such a non-convex and NP-hard problem setting. In this paper, we bridge this gap by establishing a duality theory for sparsity-constrained minimization with $\\ell_2$-regularized loss function and proposing an IHT-style algorithm for dual","authors_text":"Bo Liu, Dimitris N. Metaxas, Lezi Wang, Qingshan Liu, Xiao-Tong Yuan","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-01T03:30:47Z","title":"Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to Non-smooth Concave Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00119","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:8ee48ea0d819a1bdfca301230ed8a2ad792e3192c4efc17db24b66e531a0f50c","target":"record","created_at":"2026-05-18T00:41:57Z","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":"6097e6102baf21177db9545932602963d75fb5671a7fa9be89db079ee3852281","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-01T03:30:47Z","title_canon_sha256":"7ff3d9a1546e941d315cd49713515f0f4a020f362ab25a59fd64141d38d35a4f"},"schema_version":"1.0","source":{"id":"1703.00119","kind":"arxiv","version":2}},"canonical_sha256":"0087697eb43e77c0388fad2a88ec71ceba90770a042377baaf7a0eff241261b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0087697eb43e77c0388fad2a88ec71ceba90770a042377baaf7a0eff241261b1","first_computed_at":"2026-05-18T00:41:57.880371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:57.880371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wkzgtGP/y/vY+/THNvJCS5tEmT8Hq2BKXf5iOU+pvHWqU9oCZKhIXxoU7K8eDvLoFJnQa2nZqxakvlZoKoBSAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:57.880938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00119","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ee48ea0d819a1bdfca301230ed8a2ad792e3192c4efc17db24b66e531a0f50c","sha256:28a188a0b5998c722498823074b9d5af9dc8455236a863a84b936aa7bbfbbfbb"],"state_sha256":"75198e685b04de19ff57cb49182f2227283f843ab9cebc73d2eed40a0f6c9d78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtSi4liHdYHoJELUu9nW+fadCAqwBPthx70lLeo/j1mAkyiGivJgpS7a9J6IkHhjID1L0HBfzVenbwrMxvvdBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:03:05.209451Z","bundle_sha256":"5d59f1951142c44c1c7a1c4adcdcc8eb1d51465dc60891733ad4646f47595593"}}