{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2J62UMF4W3DSVKSJ3ORYN6HP72","short_pith_number":"pith:2J62UMF4","schema_version":"1.0","canonical_sha256":"d27daa30bcb6c72aaa49dba386f8effe82f7246b52d97b2bc74607826fa569ff","source":{"kind":"arxiv","id":"1612.04003","version":2},"attestation_state":"computed","paper":{"title":"Avoiding communication in primal and dual block coordinate descent methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aditya Devarakonda, James Demmel, Kimon Fountoulakis, Michael W. Mahoney","submitted_at":"2016-12-13T02:59:33Z","abstract_excerpt":"Primal and dual block coordinate descent methods are iterative methods for solving regularized and unregularized optimization problems. Distributed-memory parallel implementations of these methods have become popular in analyzing large machine learning datasets. However, existing implementations communicate at every iteration which, on modern data center and supercomputing architectures, often dominates the cost of floating-point computation. Recent results on communication-avoiding Krylov subspace methods suggest that large speedups are possible by re-organizing iterative algorithms to avoid "},"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":"1612.04003","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-12-13T02:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"8ef73993d294f87331033bf34b597a95a2cffed295adfd50da4348f4f034b702","abstract_canon_sha256":"f4608f0a7e9607abeb0f07538c61ed4c34aff262f3e1405421c7fb1872ed3361"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:14.744341Z","signature_b64":"vsTzv/bzLv9R5m5cFwCtVxyyAbGgCV8C7wlL/e2kva8oEd6Gio12uK5eXneBbtS/+etWaXrb+OCOsS/UU25TCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d27daa30bcb6c72aaa49dba386f8effe82f7246b52d97b2bc74607826fa569ff","last_reissued_at":"2026-05-18T00:45:14.743669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:14.743669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Avoiding communication in primal and dual block coordinate descent methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aditya Devarakonda, James Demmel, Kimon Fountoulakis, Michael W. Mahoney","submitted_at":"2016-12-13T02:59:33Z","abstract_excerpt":"Primal and dual block coordinate descent methods are iterative methods for solving regularized and unregularized optimization problems. Distributed-memory parallel implementations of these methods have become popular in analyzing large machine learning datasets. However, existing implementations communicate at every iteration which, on modern data center and supercomputing architectures, often dominates the cost of floating-point computation. Recent results on communication-avoiding Krylov subspace methods suggest that large speedups are possible by re-organizing iterative algorithms to avoid "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04003","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.04003","created_at":"2026-05-18T00:45:14.743760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.04003v2","created_at":"2026-05-18T00:45:14.743760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04003","created_at":"2026-05-18T00:45:14.743760+00:00"},{"alias_kind":"pith_short_12","alias_value":"2J62UMF4W3DS","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2J62UMF4W3DSVKSJ","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2J62UMF4","created_at":"2026-05-18T12:29:55.572404+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/2J62UMF4W3DSVKSJ3ORYN6HP72","json":"https://pith.science/pith/2J62UMF4W3DSVKSJ3ORYN6HP72.json","graph_json":"https://pith.science/api/pith-number/2J62UMF4W3DSVKSJ3ORYN6HP72/graph.json","events_json":"https://pith.science/api/pith-number/2J62UMF4W3DSVKSJ3ORYN6HP72/events.json","paper":"https://pith.science/paper/2J62UMF4"},"agent_actions":{"view_html":"https://pith.science/pith/2J62UMF4W3DSVKSJ3ORYN6HP72","download_json":"https://pith.science/pith/2J62UMF4W3DSVKSJ3ORYN6HP72.json","view_paper":"https://pith.science/paper/2J62UMF4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.04003&json=true","fetch_graph":"https://pith.science/api/pith-number/2J62UMF4W3DSVKSJ3ORYN6HP72/graph.json","fetch_events":"https://pith.science/api/pith-number/2J62UMF4W3DSVKSJ3ORYN6HP72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2J62UMF4W3DSVKSJ3ORYN6HP72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2J62UMF4W3DSVKSJ3ORYN6HP72/action/storage_attestation","attest_author":"https://pith.science/pith/2J62UMF4W3DSVKSJ3ORYN6HP72/action/author_attestation","sign_citation":"https://pith.science/pith/2J62UMF4W3DSVKSJ3ORYN6HP72/action/citation_signature","submit_replication":"https://pith.science/pith/2J62UMF4W3DSVKSJ3ORYN6HP72/action/replication_record"}},"created_at":"2026-05-18T00:45:14.743760+00:00","updated_at":"2026-05-18T00:45:14.743760+00:00"}