{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LSKCS77527POB4LMKKMHATYZ3F","short_pith_number":"pith:LSKCS775","schema_version":"1.0","canonical_sha256":"5c94297ffdd7dee0f16c5298704f19d97c510ec9cce7c93e2ad97bcc041cd40c","source":{"kind":"arxiv","id":"1507.08322","version":1},"attestation_state":"computed","paper":{"title":"Distributed Mini-Batch SDCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Martin Tak\\'a\\v{c}, Nathan Srebro, Peter Richt\\'arik","submitted_at":"2015-07-29T21:15:31Z","abstract_excerpt":"We present an improved analysis of mini-batched stochastic dual coordinate ascent for regularized empirical loss minimization (i.e. SVM and SVM-type objectives). Our analysis allows for flexible sampling schemes, including where data is distribute across machines, and combines a dependence on the smoothness of the loss and/or the data spread (measured through the spectral norm)."},"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":"1507.08322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-29T21:15:31Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"897dd7a67cf1898a9def4280ac3cb9bba270329ab9399efbde51b8be70d162fc","abstract_canon_sha256":"3add217942c54c5e1b91e3efb5aab6a05c144ad4ce2d8d5e77fd9bcf55e2f305"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:07.766818Z","signature_b64":"3ooOkDc1x0xO7/MoSs9wGSRah3QyOj5pEPyLrvCIrcJzQ1um+asV4FSizvL8hc+uJS1ElmLkEWAoXgky5LdfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c94297ffdd7dee0f16c5298704f19d97c510ec9cce7c93e2ad97bcc041cd40c","last_reissued_at":"2026-05-18T01:36:07.766140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:07.766140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Mini-Batch SDCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Martin Tak\\'a\\v{c}, Nathan Srebro, Peter Richt\\'arik","submitted_at":"2015-07-29T21:15:31Z","abstract_excerpt":"We present an improved analysis of mini-batched stochastic dual coordinate ascent for regularized empirical loss minimization (i.e. SVM and SVM-type objectives). Our analysis allows for flexible sampling schemes, including where data is distribute across machines, and combines a dependence on the smoothness of the loss and/or the data spread (measured through the spectral norm)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08322","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":"1507.08322","created_at":"2026-05-18T01:36:07.766210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08322v1","created_at":"2026-05-18T01:36:07.766210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08322","created_at":"2026-05-18T01:36:07.766210+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSKCS77527PO","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSKCS77527POB4LM","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSKCS775","created_at":"2026-05-18T12:29:29.992203+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/LSKCS77527POB4LMKKMHATYZ3F","json":"https://pith.science/pith/LSKCS77527POB4LMKKMHATYZ3F.json","graph_json":"https://pith.science/api/pith-number/LSKCS77527POB4LMKKMHATYZ3F/graph.json","events_json":"https://pith.science/api/pith-number/LSKCS77527POB4LMKKMHATYZ3F/events.json","paper":"https://pith.science/paper/LSKCS775"},"agent_actions":{"view_html":"https://pith.science/pith/LSKCS77527POB4LMKKMHATYZ3F","download_json":"https://pith.science/pith/LSKCS77527POB4LMKKMHATYZ3F.json","view_paper":"https://pith.science/paper/LSKCS775","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08322&json=true","fetch_graph":"https://pith.science/api/pith-number/LSKCS77527POB4LMKKMHATYZ3F/graph.json","fetch_events":"https://pith.science/api/pith-number/LSKCS77527POB4LMKKMHATYZ3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSKCS77527POB4LMKKMHATYZ3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSKCS77527POB4LMKKMHATYZ3F/action/storage_attestation","attest_author":"https://pith.science/pith/LSKCS77527POB4LMKKMHATYZ3F/action/author_attestation","sign_citation":"https://pith.science/pith/LSKCS77527POB4LMKKMHATYZ3F/action/citation_signature","submit_replication":"https://pith.science/pith/LSKCS77527POB4LMKKMHATYZ3F/action/replication_record"}},"created_at":"2026-05-18T01:36:07.766210+00:00","updated_at":"2026-05-18T01:36:07.766210+00:00"}