{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HUEREJZ3ZWAHPUCUF4QZTAL2VZ","short_pith_number":"pith:HUEREJZ3","canonical_record":{"source":{"id":"1702.07842","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-25T07:06:09Z","cross_cats_sorted":[],"title_canon_sha256":"bace09ad1aac5f20f004954531968422474b15d2e46e0050b576ff2dfbf02d94","abstract_canon_sha256":"2e38106207e45bb76ce2a0a80d672df1317740bd8dd9447f1661849916f6c3c9"},"schema_version":"1.0"},"canonical_sha256":"3d0912273bcd8077d0542f2199817aae71c811477dedd71af0361dafdc376c54","source":{"kind":"arxiv","id":"1702.07842","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07842","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07842v2","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07842","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"pith_short_12","alias_value":"HUEREJZ3ZWAH","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HUEREJZ3ZWAHPUCU","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HUEREJZ3","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HUEREJZ3ZWAHPUCUF4QZTAL2VZ","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07842","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-25T07:06:09Z","cross_cats_sorted":[],"title_canon_sha256":"bace09ad1aac5f20f004954531968422474b15d2e46e0050b576ff2dfbf02d94","abstract_canon_sha256":"2e38106207e45bb76ce2a0a80d672df1317740bd8dd9447f1661849916f6c3c9"},"schema_version":"1.0"},"canonical_sha256":"3d0912273bcd8077d0542f2199817aae71c811477dedd71af0361dafdc376c54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:47.749826Z","signature_b64":"faqRrUuZ0KgOHNp0EY03bq6fKNwwiY1UQH1oJLG+kgTewEWSuwFp83LPO0QaQgB3h1PvzE5xd3xC4CFjGD2EDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d0912273bcd8077d0542f2199817aae71c811477dedd71af0361dafdc376c54","last_reissued_at":"2026-05-18T00:41:47.749253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:47.749253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07842","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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PKzJExC52AmDbYRl9H8RZgsXgZMNZA1tL22LAmhMyY5mKr6G12Q6uXX6SOKD7YS4EAAjKLD18d4ajkqGutnDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:26:11.981787Z"},"content_sha256":"46f69eb2495119058bdfd19deb171bde8502e6dedf6df682e933d21047cd9790","schema_version":"1.0","event_id":"sha256:46f69eb2495119058bdfd19deb171bde8502e6dedf6df682e933d21047cd9790"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HUEREJZ3ZWAHPUCUF4QZTAL2VZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Stochastic Greedy Coordinate Descent by Soft Thresholding Projection onto Simplex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chaobing Song, Shaobo Cui, Shu-Tao Xia, Yong Jiang","submitted_at":"2017-02-25T07:06:09Z","abstract_excerpt":"In this paper we study the well-known greedy coordinate descent (GCD) algorithm to solve $\\ell_1$-regularized problems and improve GCD by the two popular strategies: Nesterov's acceleration and stochastic optimization. Firstly, we propose a new rule for greedy selection based on an $\\ell_1$-norm square approximation which is nontrivial to solve but convex, then an efficient algorithm called \"SOft ThreshOlding PrOjection (SOTOPO)\" is proposed to exactly solve the $\\ell_1$-regularized $\\ell_1$-norm square approximation problem, which is induced by the new rule. Based on the new rule and the SOTO"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07842","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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m5G0KHuhHnVEKVkb6RvKIooDOLF8Ku0KlZgzmdtrzs03F+E5FmmWwuTjKHaMBShszNlys9dYsVnzMWXVTh6uDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:26:11.982459Z"},"content_sha256":"8b532f80648bda55d20b62d588efb6e30216746e0bcfe5b24273681ba516788b","schema_version":"1.0","event_id":"sha256:8b532f80648bda55d20b62d588efb6e30216746e0bcfe5b24273681ba516788b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HUEREJZ3ZWAHPUCUF4QZTAL2VZ/bundle.json","state_url":"https://pith.science/pith/HUEREJZ3ZWAHPUCUF4QZTAL2VZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HUEREJZ3ZWAHPUCUF4QZTAL2VZ/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-05-27T12:26:11Z","links":{"resolver":"https://pith.science/pith/HUEREJZ3ZWAHPUCUF4QZTAL2VZ","bundle":"https://pith.science/pith/HUEREJZ3ZWAHPUCUF4QZTAL2VZ/bundle.json","state":"https://pith.science/pith/HUEREJZ3ZWAHPUCUF4QZTAL2VZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HUEREJZ3ZWAHPUCUF4QZTAL2VZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HUEREJZ3ZWAHPUCUF4QZTAL2VZ","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":"2e38106207e45bb76ce2a0a80d672df1317740bd8dd9447f1661849916f6c3c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-25T07:06:09Z","title_canon_sha256":"bace09ad1aac5f20f004954531968422474b15d2e46e0050b576ff2dfbf02d94"},"schema_version":"1.0","source":{"id":"1702.07842","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07842","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07842v2","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07842","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"pith_short_12","alias_value":"HUEREJZ3ZWAH","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HUEREJZ3ZWAHPUCU","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HUEREJZ3","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:8b532f80648bda55d20b62d588efb6e30216746e0bcfe5b24273681ba516788b","target":"graph","created_at":"2026-05-18T00:41:47Z","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 paper we study the well-known greedy coordinate descent (GCD) algorithm to solve $\\ell_1$-regularized problems and improve GCD by the two popular strategies: Nesterov's acceleration and stochastic optimization. Firstly, we propose a new rule for greedy selection based on an $\\ell_1$-norm square approximation which is nontrivial to solve but convex, then an efficient algorithm called \"SOft ThreshOlding PrOjection (SOTOPO)\" is proposed to exactly solve the $\\ell_1$-regularized $\\ell_1$-norm square approximation problem, which is induced by the new rule. Based on the new rule and the SOTO","authors_text":"Chaobing Song, Shaobo Cui, Shu-Tao Xia, Yong Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-25T07:06:09Z","title":"Accelerated Stochastic Greedy Coordinate Descent by Soft Thresholding Projection onto Simplex"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07842","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:46f69eb2495119058bdfd19deb171bde8502e6dedf6df682e933d21047cd9790","target":"record","created_at":"2026-05-18T00:41:47Z","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":"2e38106207e45bb76ce2a0a80d672df1317740bd8dd9447f1661849916f6c3c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-25T07:06:09Z","title_canon_sha256":"bace09ad1aac5f20f004954531968422474b15d2e46e0050b576ff2dfbf02d94"},"schema_version":"1.0","source":{"id":"1702.07842","kind":"arxiv","version":2}},"canonical_sha256":"3d0912273bcd8077d0542f2199817aae71c811477dedd71af0361dafdc376c54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d0912273bcd8077d0542f2199817aae71c811477dedd71af0361dafdc376c54","first_computed_at":"2026-05-18T00:41:47.749253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:47.749253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"faqRrUuZ0KgOHNp0EY03bq6fKNwwiY1UQH1oJLG+kgTewEWSuwFp83LPO0QaQgB3h1PvzE5xd3xC4CFjGD2EDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:47.749826Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07842","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46f69eb2495119058bdfd19deb171bde8502e6dedf6df682e933d21047cd9790","sha256:8b532f80648bda55d20b62d588efb6e30216746e0bcfe5b24273681ba516788b"],"state_sha256":"7a0d8a33bd1e7e68101c902cfe9759fb7b14e75853c40575456e00e10dfdfbb1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xsLJltts5eaT8DV+Ou8i/W+VbogUIXluMX/SFGLL1K2mEjMyrd96BrBjLFsXWdOUN8RU0VZ0PpjKMoZAdU1tCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:26:11.986418Z","bundle_sha256":"4aca68030142ac32ac24993ea416d5fcaf8f37ea7f8243ceee4d871ca2f1ce7b"}}