{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QGT5YN63UGUIO6ST6M3OTEIFCQ","short_pith_number":"pith:QGT5YN63","schema_version":"1.0","canonical_sha256":"81a7dc37dba1a8877a53f336e991051425e7ab3e3d3142b1fe4221c691dceb7f","source":{"kind":"arxiv","id":"1712.06047","version":1},"attestation_state":"computed","paper":{"title":"Avoiding Synchronization in First-Order Methods for Sparse Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.ML"],"primary_cat":"cs.DC","authors_text":"Aditya Devarakonda, James Demmel, Kimon Fountoulakis, Michael W. Mahoney","submitted_at":"2017-12-17T02:15:15Z","abstract_excerpt":"Parallel computing has played an important role in speeding up convex optimization methods for big data analytics and large-scale machine learning (ML). However, the scalability of these optimization methods is inhibited by the cost of communicating and synchronizing processors in a parallel setting. Iterative ML methods are particularly sensitive to communication cost since they often require communication every iteration. In this work, we extend well-known techniques from Communication-Avoiding Krylov subspace methods to first-order, block coordinate descent methods for Support Vector Machin"},"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":"1712.06047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-17T02:15:15Z","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"title_canon_sha256":"635d20be00eb5776206e2913353dd3c24e66b63e50d732c18f7cae34f6960b6b","abstract_canon_sha256":"de47364351332cdc98e8759674083f3195df1cc10ddcc5c4fef53e203a854deb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:51.199230Z","signature_b64":"A4DCCbL6GGn4TxsbVcEaWyxvuMUU982ql9qTM8nINpNRy93QDBbD2urXc4qPJ5G5thJnqb9gt2aU8zlM0ejEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81a7dc37dba1a8877a53f336e991051425e7ab3e3d3142b1fe4221c691dceb7f","last_reissued_at":"2026-05-18T00:27:51.198763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:51.198763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Avoiding Synchronization in First-Order Methods for Sparse Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.ML"],"primary_cat":"cs.DC","authors_text":"Aditya Devarakonda, James Demmel, Kimon Fountoulakis, Michael W. Mahoney","submitted_at":"2017-12-17T02:15:15Z","abstract_excerpt":"Parallel computing has played an important role in speeding up convex optimization methods for big data analytics and large-scale machine learning (ML). However, the scalability of these optimization methods is inhibited by the cost of communicating and synchronizing processors in a parallel setting. Iterative ML methods are particularly sensitive to communication cost since they often require communication every iteration. In this work, we extend well-known techniques from Communication-Avoiding Krylov subspace methods to first-order, block coordinate descent methods for Support Vector Machin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06047","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":"1712.06047","created_at":"2026-05-18T00:27:51.198836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06047v1","created_at":"2026-05-18T00:27:51.198836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06047","created_at":"2026-05-18T00:27:51.198836+00:00"},{"alias_kind":"pith_short_12","alias_value":"QGT5YN63UGUI","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QGT5YN63UGUIO6ST","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QGT5YN63","created_at":"2026-05-18T12:31:37.085036+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/QGT5YN63UGUIO6ST6M3OTEIFCQ","json":"https://pith.science/pith/QGT5YN63UGUIO6ST6M3OTEIFCQ.json","graph_json":"https://pith.science/api/pith-number/QGT5YN63UGUIO6ST6M3OTEIFCQ/graph.json","events_json":"https://pith.science/api/pith-number/QGT5YN63UGUIO6ST6M3OTEIFCQ/events.json","paper":"https://pith.science/paper/QGT5YN63"},"agent_actions":{"view_html":"https://pith.science/pith/QGT5YN63UGUIO6ST6M3OTEIFCQ","download_json":"https://pith.science/pith/QGT5YN63UGUIO6ST6M3OTEIFCQ.json","view_paper":"https://pith.science/paper/QGT5YN63","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06047&json=true","fetch_graph":"https://pith.science/api/pith-number/QGT5YN63UGUIO6ST6M3OTEIFCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/QGT5YN63UGUIO6ST6M3OTEIFCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QGT5YN63UGUIO6ST6M3OTEIFCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QGT5YN63UGUIO6ST6M3OTEIFCQ/action/storage_attestation","attest_author":"https://pith.science/pith/QGT5YN63UGUIO6ST6M3OTEIFCQ/action/author_attestation","sign_citation":"https://pith.science/pith/QGT5YN63UGUIO6ST6M3OTEIFCQ/action/citation_signature","submit_replication":"https://pith.science/pith/QGT5YN63UGUIO6ST6M3OTEIFCQ/action/replication_record"}},"created_at":"2026-05-18T00:27:51.198836+00:00","updated_at":"2026-05-18T00:27:51.198836+00:00"}