{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:36IBQACTK5YNJMUT7ECWHKS2U2","short_pith_number":"pith:36IBQACT","schema_version":"1.0","canonical_sha256":"df901800535770d4b293f90563aa5aa6b766451526e09f78936e24a112e978e1","source":{"kind":"arxiv","id":"1707.02963","version":5},"attestation_state":"computed","paper":{"title":"An Interactive Greedy Approach to Group Sparsity in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Ji Liu, Ryohei Fujimaki, Wei Qian, Wending Li, Xitong Yang, Yasuhiro Sogawa","submitted_at":"2017-07-10T17:48:28Z","abstract_excerpt":"Sparsity learning with known grouping structure has received considerable attention due to wide modern applications in high-dimensional data analysis. Although advantages of using group information have been well-studied by shrinkage-based approaches, benefits of group sparsity have not been well-documented for greedy-type methods, which much limits our understanding and use of this important class of methods. In this paper, generalizing from a popular forward-backward greedy approach, we propose a new interactive greedy algorithm for group sparsity learning and prove that the proposed greedy-"},"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":"1707.02963","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-10T17:48:28Z","cross_cats_sorted":[],"title_canon_sha256":"72009f7a7a123ba52c9eb330246dbad4ba24703643968f275d84974dc4f5fdc8","abstract_canon_sha256":"fff36b3744bafe236cb2b72b4c8e314c40c14950bc4622f0b2db9c4b684b81b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:39.981292Z","signature_b64":"hQswWXEo6do/+ZtQDYecx0ROCqUUj02PvNcakjwl+R/h0witl3chY12bo8/tG9hxVvs7NG2QqgLWu31iEXuSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df901800535770d4b293f90563aa5aa6b766451526e09f78936e24a112e978e1","last_reissued_at":"2026-05-18T00:04:39.980851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:39.980851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Interactive Greedy Approach to Group Sparsity in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Ji Liu, Ryohei Fujimaki, Wei Qian, Wending Li, Xitong Yang, Yasuhiro Sogawa","submitted_at":"2017-07-10T17:48:28Z","abstract_excerpt":"Sparsity learning with known grouping structure has received considerable attention due to wide modern applications in high-dimensional data analysis. Although advantages of using group information have been well-studied by shrinkage-based approaches, benefits of group sparsity have not been well-documented for greedy-type methods, which much limits our understanding and use of this important class of methods. In this paper, generalizing from a popular forward-backward greedy approach, we propose a new interactive greedy algorithm for group sparsity learning and prove that the proposed greedy-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02963","kind":"arxiv","version":5},"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":"1707.02963","created_at":"2026-05-18T00:04:39.980923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02963v5","created_at":"2026-05-18T00:04:39.980923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02963","created_at":"2026-05-18T00:04:39.980923+00:00"},{"alias_kind":"pith_short_12","alias_value":"36IBQACTK5YN","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"36IBQACTK5YNJMUT","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"36IBQACT","created_at":"2026-05-18T12:30:58.224056+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/36IBQACTK5YNJMUT7ECWHKS2U2","json":"https://pith.science/pith/36IBQACTK5YNJMUT7ECWHKS2U2.json","graph_json":"https://pith.science/api/pith-number/36IBQACTK5YNJMUT7ECWHKS2U2/graph.json","events_json":"https://pith.science/api/pith-number/36IBQACTK5YNJMUT7ECWHKS2U2/events.json","paper":"https://pith.science/paper/36IBQACT"},"agent_actions":{"view_html":"https://pith.science/pith/36IBQACTK5YNJMUT7ECWHKS2U2","download_json":"https://pith.science/pith/36IBQACTK5YNJMUT7ECWHKS2U2.json","view_paper":"https://pith.science/paper/36IBQACT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02963&json=true","fetch_graph":"https://pith.science/api/pith-number/36IBQACTK5YNJMUT7ECWHKS2U2/graph.json","fetch_events":"https://pith.science/api/pith-number/36IBQACTK5YNJMUT7ECWHKS2U2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36IBQACTK5YNJMUT7ECWHKS2U2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36IBQACTK5YNJMUT7ECWHKS2U2/action/storage_attestation","attest_author":"https://pith.science/pith/36IBQACTK5YNJMUT7ECWHKS2U2/action/author_attestation","sign_citation":"https://pith.science/pith/36IBQACTK5YNJMUT7ECWHKS2U2/action/citation_signature","submit_replication":"https://pith.science/pith/36IBQACTK5YNJMUT7ECWHKS2U2/action/replication_record"}},"created_at":"2026-05-18T00:04:39.980923+00:00","updated_at":"2026-05-18T00:04:39.980923+00:00"}