{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:I7DCFVJIUH5PZXC5GVC6KIVQQ5","short_pith_number":"pith:I7DCFVJI","schema_version":"1.0","canonical_sha256":"47c622d528a1fafcdc5d3545e522b0874cd5ab0d82d2c4683302e29733be6206","source":{"kind":"arxiv","id":"1212.4174","version":1},"attestation_state":"computed","paper":{"title":"Feature Clustering for Accelerating Parallel Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Ambuj Tewari, Chad Scherrer, David Haglin, Mahantesh Halappanavar","submitted_at":"2012-12-17T21:43:31Z","abstract_excerpt":"Large-scale L1-regularized loss minimization problems arise in high-dimensional applications such as compressed sensing and high-dimensional supervised learning, including classification and regression problems. High-performance algorithms and implementations are critical to efficiently solving these problems. Building upon previous work on coordinate descent algorithms for L1-regularized problems, we introduce a novel family of algorithms called block-greedy coordinate descent that includes, as special cases, several existing algorithms such as SCD, Greedy CD, Shotgun, and Thread-Greedy. We g"},"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":"1212.4174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-17T21:43:31Z","cross_cats_sorted":["cs.DC","cs.LG","math.OC"],"title_canon_sha256":"b0c14d5873c35701af42d7da168625bb1f61ae3812318dd3205ebd71230be69c","abstract_canon_sha256":"7ee75b9b50e4c7c68a3dc71fc755daf89a548a07c9f7c313f8255bfc7edbc3fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:13.615763Z","signature_b64":"2sAddwHZdR1J1bTfqPfeOMT/u8elKEzplcm8nQTT2bRQaJBPpXa0xHMJdDVn5Y4MSmOC+H46mn2cMW/lbaIoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47c622d528a1fafcdc5d3545e522b0874cd5ab0d82d2c4683302e29733be6206","last_reissued_at":"2026-05-18T03:38:13.615340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:13.615340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feature Clustering for Accelerating Parallel Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Ambuj Tewari, Chad Scherrer, David Haglin, Mahantesh Halappanavar","submitted_at":"2012-12-17T21:43:31Z","abstract_excerpt":"Large-scale L1-regularized loss minimization problems arise in high-dimensional applications such as compressed sensing and high-dimensional supervised learning, including classification and regression problems. High-performance algorithms and implementations are critical to efficiently solving these problems. Building upon previous work on coordinate descent algorithms for L1-regularized problems, we introduce a novel family of algorithms called block-greedy coordinate descent that includes, as special cases, several existing algorithms such as SCD, Greedy CD, Shotgun, and Thread-Greedy. We g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4174","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":"1212.4174","created_at":"2026-05-18T03:38:13.615412+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.4174v1","created_at":"2026-05-18T03:38:13.615412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4174","created_at":"2026-05-18T03:38:13.615412+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7DCFVJIUH5P","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7DCFVJIUH5PZXC5","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7DCFVJI","created_at":"2026-05-18T12:27:09.501522+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/I7DCFVJIUH5PZXC5GVC6KIVQQ5","json":"https://pith.science/pith/I7DCFVJIUH5PZXC5GVC6KIVQQ5.json","graph_json":"https://pith.science/api/pith-number/I7DCFVJIUH5PZXC5GVC6KIVQQ5/graph.json","events_json":"https://pith.science/api/pith-number/I7DCFVJIUH5PZXC5GVC6KIVQQ5/events.json","paper":"https://pith.science/paper/I7DCFVJI"},"agent_actions":{"view_html":"https://pith.science/pith/I7DCFVJIUH5PZXC5GVC6KIVQQ5","download_json":"https://pith.science/pith/I7DCFVJIUH5PZXC5GVC6KIVQQ5.json","view_paper":"https://pith.science/paper/I7DCFVJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.4174&json=true","fetch_graph":"https://pith.science/api/pith-number/I7DCFVJIUH5PZXC5GVC6KIVQQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/I7DCFVJIUH5PZXC5GVC6KIVQQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7DCFVJIUH5PZXC5GVC6KIVQQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7DCFVJIUH5PZXC5GVC6KIVQQ5/action/storage_attestation","attest_author":"https://pith.science/pith/I7DCFVJIUH5PZXC5GVC6KIVQQ5/action/author_attestation","sign_citation":"https://pith.science/pith/I7DCFVJIUH5PZXC5GVC6KIVQQ5/action/citation_signature","submit_replication":"https://pith.science/pith/I7DCFVJIUH5PZXC5GVC6KIVQQ5/action/replication_record"}},"created_at":"2026-05-18T03:38:13.615412+00:00","updated_at":"2026-05-18T03:38:13.615412+00:00"}