{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LO3JJE525G2TQBV4JQB5EUAVCO","short_pith_number":"pith:LO3JJE52","schema_version":"1.0","canonical_sha256":"5bb69493bae9b53806bc4c03d25015139d967cca48cebed194841fdcbd57d647","source":{"kind":"arxiv","id":"1412.6293","version":1},"attestation_state":"computed","paper":{"title":"Semi-Stochastic Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NA","authors_text":"Jakub Kone\\v{c}n\\'y, Peter Richt\\'arik, Zheng Qu","submitted_at":"2014-12-19T11:20:13Z","abstract_excerpt":"We propose a novel stochastic gradient method---semi-stochastic coordinate descent (S2CD)---for the problem of minimizing a strongly convex function represented as the average of a large number of smooth convex functions: $f(x)=\\tfrac{1}{n}\\sum_i f_i(x)$. Our method first performs a deterministic step (computation of the gradient of $f$ at the starting point), followed by a large number of stochastic steps. The process is repeated a few times, with the last stochastic iterate becoming the new starting point where the deterministic step is taken. The novelty of our method is in how the stochast"},"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":"1412.6293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-12-19T11:20:13Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"0b82633e47c3081d67d06f725a9e57e183c6c9cc05a051a4ca88c9c51b0d6342","abstract_canon_sha256":"2e36970adc5ca5f7c5f4e002b4923900578cb908e476cca9a5063fa079572f92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:53.849974Z","signature_b64":"eAtO+Au+ImDY4UnM+e57oX2DLMIKHpw1sDO7wZYlMzUA4JnKq7Bulnq+RhNUoiYkdmbtuGfFDcEUh4Dv9+a7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bb69493bae9b53806bc4c03d25015139d967cca48cebed194841fdcbd57d647","last_reissued_at":"2026-05-18T02:30:53.849429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:53.849429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-Stochastic Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NA","authors_text":"Jakub Kone\\v{c}n\\'y, Peter Richt\\'arik, Zheng Qu","submitted_at":"2014-12-19T11:20:13Z","abstract_excerpt":"We propose a novel stochastic gradient method---semi-stochastic coordinate descent (S2CD)---for the problem of minimizing a strongly convex function represented as the average of a large number of smooth convex functions: $f(x)=\\tfrac{1}{n}\\sum_i f_i(x)$. Our method first performs a deterministic step (computation of the gradient of $f$ at the starting point), followed by a large number of stochastic steps. The process is repeated a few times, with the last stochastic iterate becoming the new starting point where the deterministic step is taken. The novelty of our method is in how the stochast"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6293","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":"1412.6293","created_at":"2026-05-18T02:30:53.849515+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6293v1","created_at":"2026-05-18T02:30:53.849515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6293","created_at":"2026-05-18T02:30:53.849515+00:00"},{"alias_kind":"pith_short_12","alias_value":"LO3JJE525G2T","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LO3JJE525G2TQBV4","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LO3JJE52","created_at":"2026-05-18T12:28:38.356838+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/LO3JJE525G2TQBV4JQB5EUAVCO","json":"https://pith.science/pith/LO3JJE525G2TQBV4JQB5EUAVCO.json","graph_json":"https://pith.science/api/pith-number/LO3JJE525G2TQBV4JQB5EUAVCO/graph.json","events_json":"https://pith.science/api/pith-number/LO3JJE525G2TQBV4JQB5EUAVCO/events.json","paper":"https://pith.science/paper/LO3JJE52"},"agent_actions":{"view_html":"https://pith.science/pith/LO3JJE525G2TQBV4JQB5EUAVCO","download_json":"https://pith.science/pith/LO3JJE525G2TQBV4JQB5EUAVCO.json","view_paper":"https://pith.science/paper/LO3JJE52","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6293&json=true","fetch_graph":"https://pith.science/api/pith-number/LO3JJE525G2TQBV4JQB5EUAVCO/graph.json","fetch_events":"https://pith.science/api/pith-number/LO3JJE525G2TQBV4JQB5EUAVCO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LO3JJE525G2TQBV4JQB5EUAVCO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LO3JJE525G2TQBV4JQB5EUAVCO/action/storage_attestation","attest_author":"https://pith.science/pith/LO3JJE525G2TQBV4JQB5EUAVCO/action/author_attestation","sign_citation":"https://pith.science/pith/LO3JJE525G2TQBV4JQB5EUAVCO/action/citation_signature","submit_replication":"https://pith.science/pith/LO3JJE525G2TQBV4JQB5EUAVCO/action/replication_record"}},"created_at":"2026-05-18T02:30:53.849515+00:00","updated_at":"2026-05-18T02:30:53.849515+00:00"}