{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VKYUWEBW6IFDCZI5D2MAMX5TYC","short_pith_number":"pith:VKYUWEBW","schema_version":"1.0","canonical_sha256":"aab14b1036f20a31651d1e98065fb3c091345f8a25f63662d404fa6415046f63","source":{"kind":"arxiv","id":"1905.03652","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Baojian Zhou, Feng Chen, Yiming Ying","submitted_at":"2019-05-09T14:24:43Z","abstract_excerpt":"Stochastic optimization algorithms update models with cheap per-iteration costs sequentially, which makes them amenable for large-scale data analysis. Such algorithms have been widely studied for structured sparse models where the sparsity information is very specific, e.g., convex sparsity-inducing norms or $\\ell^0$-norm. However, these norms cannot be directly applied to the problem of complex (non-convex) graph-structured sparsity models, which have important application in disease outbreak and social networks, etc. In this paper, we propose a stochastic gradient-based method for solving gr"},"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":"1905.03652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-09T14:24:43Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"77e8eed5e72b65b914e566dc3a5276e84e7f321e979604a2bc3190f7a6931e9e","abstract_canon_sha256":"a18810dfadb3b3467779ba907a19a673b3136fed058250d9669ee7e989ab7211"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:37.076809Z","signature_b64":"d3clckd3RQIulS8rGNkQDTCacruTkJau3MBNwvqtQEOjJRCbb9J7VAw9alLRZG9oeuLTfWwofXQa3mpRe7ibBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aab14b1036f20a31651d1e98065fb3c091345f8a25f63662d404fa6415046f63","last_reissued_at":"2026-05-17T23:46:37.076342Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:37.076342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Baojian Zhou, Feng Chen, Yiming Ying","submitted_at":"2019-05-09T14:24:43Z","abstract_excerpt":"Stochastic optimization algorithms update models with cheap per-iteration costs sequentially, which makes them amenable for large-scale data analysis. Such algorithms have been widely studied for structured sparse models where the sparsity information is very specific, e.g., convex sparsity-inducing norms or $\\ell^0$-norm. However, these norms cannot be directly applied to the problem of complex (non-convex) graph-structured sparsity models, which have important application in disease outbreak and social networks, etc. In this paper, we propose a stochastic gradient-based method for solving gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03652","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.03652","created_at":"2026-05-17T23:46:37.076414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03652v1","created_at":"2026-05-17T23:46:37.076414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03652","created_at":"2026-05-17T23:46:37.076414+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKYUWEBW6IFD","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKYUWEBW6IFDCZI5","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKYUWEBW","created_at":"2026-05-18T12:33:30.264802+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/VKYUWEBW6IFDCZI5D2MAMX5TYC","json":"https://pith.science/pith/VKYUWEBW6IFDCZI5D2MAMX5TYC.json","graph_json":"https://pith.science/api/pith-number/VKYUWEBW6IFDCZI5D2MAMX5TYC/graph.json","events_json":"https://pith.science/api/pith-number/VKYUWEBW6IFDCZI5D2MAMX5TYC/events.json","paper":"https://pith.science/paper/VKYUWEBW"},"agent_actions":{"view_html":"https://pith.science/pith/VKYUWEBW6IFDCZI5D2MAMX5TYC","download_json":"https://pith.science/pith/VKYUWEBW6IFDCZI5D2MAMX5TYC.json","view_paper":"https://pith.science/paper/VKYUWEBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03652&json=true","fetch_graph":"https://pith.science/api/pith-number/VKYUWEBW6IFDCZI5D2MAMX5TYC/graph.json","fetch_events":"https://pith.science/api/pith-number/VKYUWEBW6IFDCZI5D2MAMX5TYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKYUWEBW6IFDCZI5D2MAMX5TYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKYUWEBW6IFDCZI5D2MAMX5TYC/action/storage_attestation","attest_author":"https://pith.science/pith/VKYUWEBW6IFDCZI5D2MAMX5TYC/action/author_attestation","sign_citation":"https://pith.science/pith/VKYUWEBW6IFDCZI5D2MAMX5TYC/action/citation_signature","submit_replication":"https://pith.science/pith/VKYUWEBW6IFDCZI5D2MAMX5TYC/action/replication_record"}},"created_at":"2026-05-17T23:46:37.076414+00:00","updated_at":"2026-05-17T23:46:37.076414+00:00"}